| blob | db5d6682981713c302c41fb6de57d88db409a53d |
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 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
14951 or a concept-name.
14953 enum-name:
14954 identifier
14956 typedef-name:
14957 identifier
14959 concept-name:
14960 identifier
14962 Returns a TYPE_DECL for the type. */
14964 static tree
14966 {
14967 tree type_decl;
14968 tree identifier;
14975 /* Look up the type-name. */
14978 // If we found an overload set, then it may refer to a concept-name.
14979 //
14980 // TODO: The name could also refer to a variable template or an
14981 // introduction (if followed by '{').
14983 {
14984 // Determine whether the overload refers to a concept.
14987 }
14990 {
14994 {
14995 /* We have found a type introduced by a using
14996 declaration at class scope that refers to a dependent
14997 type.
14999 using typename :: [opt] nested-name-specifier unqualified-id ;
15000 */
15006 }
15007 }
15011 {
15012 /* See if this is an Objective-C type. */
15017 }
15019 /* Issue an error if we did not find a type-name. */
15021 /* In Objective-C, we have the complication that class names are
15022 normally type names and start declarations (eg, the
15023 "NSObject" in "NSObject *object;"), but can be used in an
15024 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15025 is an expression. So, a classname followed by a dot is not a
15026 valid type-name. */
15029 {
15034 }
15035 /* Remember that the name was used in the definition of the
15036 current class so that we can check later to see if the
15037 meaning would have been different after the class was
15038 entirely defined. */
15044 }
15046 /* Parse an elaborated-type-specifier. Note that the grammar given
15047 here incorporates the resolution to DR68.
15049 elaborated-type-specifier:
15050 class-key :: [opt] nested-name-specifier [opt] identifier
15051 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15052 enum-key :: [opt] nested-name-specifier [opt] identifier
15053 typename :: [opt] nested-name-specifier identifier
15054 typename :: [opt] nested-name-specifier template [opt]
15055 template-id
15057 GNU extension:
15059 elaborated-type-specifier:
15060 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15061 class-key attributes :: [opt] nested-name-specifier [opt]
15062 template [opt] template-id
15063 enum attributes :: [opt] nested-name-specifier [opt] identifier
15065 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15066 declared `friend'. If IS_DECLARATION is TRUE, then this
15067 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15068 something is being declared.
15070 Returns the TYPE specified. */
15072 static tree
15076 {
15078 tree identifier;
15081 tree globalscope;
15084 /* See if we're looking at the `enum' keyword. */
15086 {
15087 /* Consume the `enum' token. */
15089 /* Remember that it's an enumeration type. */
15091 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15092 enums) is used here. */
15095 {
15099 /* Consume the `struct' or `class' and parse it anyway. */
15101 }
15102 /* Parse the attributes. */
15104 }
15105 /* Or, it might be `typename'. */
15107 RID_TYPENAME))
15108 {
15109 /* Consume the `typename' token. */
15111 /* Remember that it's a `typename' type. */
15113 }
15114 /* Otherwise it must be a class-key. */
15115 else
15116 {
15120 /* Parse the attributes. */
15122 }
15124 /* Look for the `::' operator. */
15127 /* Look for the nested-name-specifier. */
15129 {
15134 is_declaration))
15136 }
15137 else
15138 /* Even though `typename' is not present, the proposed resolution
15139 to Core Issue 180 says that in `class A<T>::B', `B' should be
15140 considered a type-name, even if `A<T>' is dependent. */
15145 is_declaration);
15146 /* For everything but enumeration types, consider a template-id.
15147 For an enumeration type, consider only a plain identifier. */
15149 {
15151 tree decl;
15153 /* Allow the `template' keyword. */
15155 /* If we didn't see `template', we don't know if there's a
15156 template-id or not. */
15159 /* Parse the template-id. */
15163 tag_type,
15164 is_declaration);
15165 /* If we didn't find a template-id, look for an ordinary
15166 identifier. */
15168 ;
15169 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15170 in effect, then we must assume that, upon instantiation, the
15171 template will correspond to a class. */
15175 typename_type,
15177 /* If the `typename' keyword is in effect and DECL is not a type
15178 decl, then type is non existent. */
15180 ;
15186 }
15189 {
15194 {
15197 }
15199 /* For a `typename', we needn't call xref_tag. */
15203 identifier,
15205 /* Look up a qualified name in the usual way. */
15207 {
15208 tree decl;
15209 tree ambiguous_decls;
15212 tag_type,
15219 /* If the lookup was ambiguous, an error will already have been
15220 issued. */
15224 /* If we are parsing friend declaration, DECL may be a
15225 TEMPLATE_DECL tree node here. However, we need to check
15226 whether this TEMPLATE_DECL results in valid code. Consider
15227 the following example:
15229 namespace N {
15230 template <class T> class C {};
15231 }
15232 class X {
15233 template <class T> friend class N::C; // #1, valid code
15234 };
15235 template <class T> class Y {
15236 friend class N::C; // #2, invalid code
15237 };
15239 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15240 name lookup of `N::C'. We see that friend declaration must
15241 be template for the code to be valid. Note that
15242 processing_template_decl does not work here since it is
15243 always 1 for the above two cases. */
15245 decl = (cp_parser_maybe_treat_template_as_class
15250 {
15253 identifier,
15256 }
15259 {
15263 allow_template);
15267 }
15269 /* Forward declarations of nested types, such as
15271 class C1::C2;
15272 class C1::C2::C3;
15274 are invalid unless all components preceding the final '::'
15275 are complete. If all enclosing types are complete, these
15276 declarations become merely pointless.
15278 Invalid forward declarations of nested types are errors
15279 caught elsewhere in parsing. Those that are pointless arrive
15280 here. */
15287 }
15288 else
15289 {
15290 /* An elaborated-type-specifier sometimes introduces a new type and
15291 sometimes names an existing type. Normally, the rule is that it
15292 introduces a new type only if there is not an existing type of
15293 the same name already in scope. For example, given:
15295 struct S {};
15296 void f() { struct S s; }
15298 the `struct S' in the body of `f' is the same `struct S' as in
15299 the global scope; the existing definition is used. However, if
15300 there were no global declaration, this would introduce a new
15301 local class named `S'.
15303 An exception to this rule applies to the following code:
15305 namespace N { struct S; }
15307 Here, the elaborated-type-specifier names a new type
15308 unconditionally; even if there is already an `S' in the
15309 containing scope this declaration names a new type.
15310 This exception only applies if the elaborated-type-specifier
15311 forms the complete declaration:
15313 [class.name]
15315 A declaration consisting solely of `class-key identifier ;' is
15316 either a redeclaration of the name in the current scope or a
15317 forward declaration of the identifier as a class name. It
15318 introduces the name into the current scope.
15320 We are in this situation precisely when the next token is a `;'.
15322 An exception to the exception is that a `friend' declaration does
15323 *not* name a new type; i.e., given:
15325 struct S { friend struct T; };
15327 `T' is not a new type in the scope of `S'.
15329 Also, `new struct S' or `sizeof (struct S)' never results in the
15330 definition of a new type; a new type can only be declared in a
15331 declaration context. */
15333 tag_scope ts;
15337 /* Friends have special name lookup rules. */
15341 CPP_SEMICOLON))
15342 /* This is a `class-key identifier ;' */
15344 else
15347 template_p =
15351 /* An unqualified name was used to reference this type, so
15352 there were no qualifying templates. */
15359 }
15360 }
15365 /* Allow attributes on forward declarations of classes. */
15367 {
15377 else
15380 }
15383 {
15384 /* Indicate whether this class was declared as a `class' or as a
15385 `struct'. */
15389 }
15391 /* A "<" cannot follow an elaborated type specifier. If that
15392 happens, the user was probably trying to form a template-id. */
15397 }
15399 /* Parse an enum-specifier.
15401 enum-specifier:
15402 enum-head { enumerator-list [opt] }
15403 enum-head { enumerator-list , } [C++0x]
15405 enum-head:
15406 enum-key identifier [opt] enum-base [opt]
15407 enum-key nested-name-specifier identifier enum-base [opt]
15409 enum-key:
15410 enum
15411 enum class [C++0x]
15412 enum struct [C++0x]
15414 enum-base: [C++0x]
15415 : type-specifier-seq
15417 opaque-enum-specifier:
15418 enum-key identifier enum-base [opt] ;
15420 GNU Extensions:
15421 enum-key attributes[opt] identifier [opt] enum-base [opt]
15422 { enumerator-list [opt] }attributes[opt]
15423 enum-key attributes[opt] identifier [opt] enum-base [opt]
15424 { enumerator-list, }attributes[opt] [C++0x]
15426 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15427 if the token stream isn't an enum-specifier after all. */
15429 static tree
15431 {
15432 tree identifier;
15434 tree prev_scope;
15436 tree attributes;
15449 /* Parse tentatively so that we can back up if we don't find a
15450 enum-specifier. */
15453 /* Caller guarantees that the current token is 'enum', an identifier
15454 possibly follows, and the token after that is an opening brace.
15455 If we don't have an identifier, fabricate an anonymous name for
15456 the enumeration being defined. */
15459 /* Parse the "class" or "struct", which indicates a scoped
15460 enumeration type in C++0x. */
15463 {
15467 /* Consume the `struct' or `class' token. */
15471 }
15475 /* Clear the qualification. */
15480 /* Figure out in what scope the declaration is being placed. */
15486 nested_name_specifier
15494 {
15495 tree name;
15499 enum_type,
15504 input_location);
15506 {
15509 {
15510 /* Are template enums allowed in ISO? */
15514 /* ignore a typename reference, for it will be solved by name
15515 in start_enum. */
15517 }
15518 }
15521 else
15524 }
15525 else
15526 {
15529 else
15530 {
15536 }
15537 }
15540 /* Check for the `:' that denotes a specified underlying type in C++0x.
15541 Note that a ':' could also indicate a bitfield width, however. */
15543 {
15544 cp_decl_specifier_seq type_specifiers;
15546 /* Consume the `:'. */
15549 /* Parse the type-specifier-seq. */
15554 /* At this point this is surely not elaborated type specifier. */
15563 /* If that didn't work, stop. */
15565 {
15570 }
15571 }
15573 /* Look for the `{' but don't consume it yet. */
15575 {
15577 {
15580 {
15583 }
15584 }
15585 /* An opaque-enum-specifier must have a ';' here. */
15588 {
15591 {
15594 }
15595 }
15596 }
15602 {
15604 {
15608 }
15610 {
15612 }
15613 }
15615 /* Issue an error message if type-definitions are forbidden here. */
15618 else
15619 /* Create the new type. We do this before consuming the opening
15620 brace so the enum will be recorded as being on the line of its
15621 tag (or the 'enum' keyword, if there is no tag). */
15625 /* If the next token is not '{' it is an opaque-enum-specifier or an
15626 elaborated-type-specifier. */
15628 {
15632 {
15633 /* The following catches invalid code such as:
15634 enum class S<int>::E { A, B, C }; */
15641 /* If that scope does not contain the scope in which the
15642 class was originally declared, the program is invalid. */
15644 {
15647 "declaration of %qD in namespace %qD which does not "
15650 else
15655 }
15656 }
15661 /* Consume the opening brace. */
15668 {
15672 }
15673 else
15674 {
15679 }
15683 /* If the next token is not '}', then there are some enumerators. */
15685 {
15689 }
15690 else
15693 /* Consume the final '}'. */
15699 }
15700 else
15701 {
15702 /* If a ';' follows, then it is an opaque-enum-specifier
15703 and additional restrictions apply. */
15705 {
15712 }
15713 }
15715 /* Look for trailing attributes to apply to this enumeration, and
15716 apply them if appropriate. */
15718 {
15722 trailing_attr,
15724 }
15726 /* Finish up the enumeration. */
15728 {
15733 }
15736 {
15738 {
15741 }
15743 {
15745 }
15746 }
15747 out:
15750 }
15752 /* Parse an enumerator-list. The enumerators all have the indicated
15753 TYPE.
15755 enumerator-list:
15756 enumerator-definition
15757 enumerator-list , enumerator-definition */
15759 static void
15761 {
15763 {
15764 /* Parse an enumerator-definition. */
15767 /* If the next token is not a ',', we've reached the end of
15768 the list. */
15771 /* Otherwise, consume the `,' and keep going. */
15773 /* If the next token is a `}', there is a trailing comma. */
15775 {
15780 }
15781 }
15782 }
15784 /* Parse an enumerator-definition. The enumerator has the indicated
15785 TYPE.
15787 enumerator-definition:
15788 enumerator
15789 enumerator = constant-expression
15791 enumerator:
15792 identifier */
15794 static void
15796 {
15797 tree identifier;
15798 tree value;
15799 location_t loc;
15801 /* Save the input location because we are interested in the location
15802 of the identifier and not the location of the explicit value. */
15805 /* Look for the identifier. */
15810 /* If the next token is an '=', then there is an explicit value. */
15812 {
15813 /* Consume the `=' token. */
15815 /* Parse the value. */
15818 NULL);
15819 }
15820 else
15823 /* If we are processing a template, make sure the initializer of the
15824 enumerator doesn't contain any bare template parameter pack. */
15828 /* integral_constant_value will pull out this expression, so make sure
15829 it's folded as appropriate. */
15832 /* Create the enumerator. */
15834 }
15836 /* Parse a namespace-name.
15838 namespace-name:
15839 original-namespace-name
15840 namespace-alias
15842 Returns the NAMESPACE_DECL for the namespace. */
15844 static tree
15846 {
15847 tree identifier;
15848 tree namespace_decl;
15852 /* Get the name of the namespace. */
15857 /* Look up the identifier in the currently active scope. Look only
15858 for namespaces, due to:
15860 [basic.lookup.udir]
15862 When looking up a namespace-name in a using-directive or alias
15863 definition, only namespace names are considered.
15865 And:
15867 [basic.lookup.qual]
15869 During the lookup of a name preceding the :: scope resolution
15870 operator, object, function, and enumerator names are ignored.
15872 (Note that cp_parser_qualifying_entity only calls this
15873 function if the token after the name is the scope resolution
15874 operator.) */
15876 none_type,
15882 /* If it's not a namespace, issue an error. */
15885 {
15890 }
15893 }
15895 /* Parse a namespace-definition.
15897 namespace-definition:
15898 named-namespace-definition
15899 unnamed-namespace-definition
15901 named-namespace-definition:
15902 original-namespace-definition
15903 extension-namespace-definition
15905 original-namespace-definition:
15906 namespace identifier { namespace-body }
15908 extension-namespace-definition:
15909 namespace original-namespace-name { namespace-body }
15911 unnamed-namespace-definition:
15912 namespace { namespace-body } */
15914 static void
15916 {
15923 {
15927 }
15928 else
15931 /* Look for the `namespace' keyword. */
15934 /* Get the name of the namespace. We do not attempt to distinguish
15935 between an original-namespace-definition and an
15936 extension-namespace-definition at this point. The semantic
15937 analysis routines are responsible for that. */
15940 else
15943 /* Parse any specified attributes. */
15946 /* Look for the `{' to start the namespace. */
15948 /* Start the namespace. */
15951 /* "inline namespace" is equivalent to a stub namespace definition
15952 followed by a strong using directive. */
15954 {
15956 /* Set up namespace association. */
15960 /* Import the contents of the inline namespace. */
15964 }
15968 /* Parse the body of the namespace. */
15974 /* Finish the namespace. */
15976 /* Look for the final `}'. */
15978 }
15980 /* Parse a namespace-body.
15982 namespace-body:
15983 declaration-seq [opt] */
15985 static void
15987 {
15989 }
15991 /* Parse a namespace-alias-definition.
15993 namespace-alias-definition:
15994 namespace identifier = qualified-namespace-specifier ; */
15996 static void
15998 {
15999 tree identifier;
16000 tree namespace_specifier;
16004 /* Look for the `namespace' keyword. */
16006 /* Look for the identifier. */
16010 /* Look for the `=' token. */
16013 {
16015 /* Skip the definition. */
16020 }
16022 /* Look for the qualified-namespace-specifier. */
16023 namespace_specifier
16025 /* Look for the `;' token. */
16028 /* Register the alias in the symbol table. */
16030 }
16032 /* Parse a qualified-namespace-specifier.
16034 qualified-namespace-specifier:
16035 :: [opt] nested-name-specifier [opt] namespace-name
16037 Returns a NAMESPACE_DECL corresponding to the specified
16038 namespace. */
16040 static tree
16042 {
16043 /* Look for the optional `::'. */
16047 /* Look for the optional nested-name-specifier. */
16055 }
16057 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16058 access declaration.
16060 using-declaration:
16061 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16062 using :: unqualified-id ;
16064 access-declaration:
16065 qualified-id ;
16067 */
16069 static bool
16072 {
16076 tree decl;
16077 tree identifier;
16078 tree qscope;
16083 {
16086 }
16087 else
16088 {
16089 /* Look for the `using' keyword. */
16092 /* Peek at the next token. */
16094 /* See if it's `typename'. */
16096 {
16097 /* Remember that we've seen it. */
16099 /* Consume the `typename' token. */
16101 }
16102 }
16104 /* Look for the optional global scope qualification. */
16105 global_scope_p
16110 /* If we saw `typename', or didn't see `::', then there must be a
16111 nested-name-specifier present. */
16117 /* Otherwise, we could be in either of the two productions. In that
16118 case, treat the nested-name-specifier as optional. */
16119 else
16129 /* Something has already gone wrong; there's no need to parse
16130 further. Since an error has occurred, the return value of
16131 cp_parser_parse_definitely will be false, as required. */
16135 /* Parse the unqualified-id. */
16143 {
16148 }
16150 /* The function we call to handle a using-declaration is different
16151 depending on what scope we are in. */
16153 ;
16156 /* [namespace.udecl]
16158 A using declaration shall not name a template-id. */
16161 else
16162 {
16164 {
16165 /* Create the USING_DECL. */
16173 else
16174 /* Add it to the list of members in this class. */
16176 }
16177 else
16178 {
16180 identifier,
16190 else
16192 }
16193 }
16195 /* Look for the final `;'. */
16200 "access declarations are deprecated "
16201 "in favour of using-declarations; "
16205 }
16207 /* Parse an alias-declaration.
16209 alias-declaration:
16210 using identifier attribute-specifier-seq [opt] = type-id */
16212 static tree
16214 {
16216 location_t id_location;
16218 cp_decl_specifier_seq decl_specs;
16222 /* Look for the `using' keyword. */
16223 cp_token *using_token
16245 /* Now we are going to parse the type-id of the declaration. */
16247 /*
16248 [dcl.type]/3 says:
16250 "A type-specifier-seq shall not define a class or enumeration
16251 unless it appears in the type-id of an alias-declaration (7.1.3) that
16252 is not the declaration of a template-declaration."
16254 In other words, if we currently are in an alias template, the
16255 type-id should not define a type.
16257 So let's set parser->type_definition_forbidden_message in that
16258 case; cp_parser_check_type_definition (called by
16259 cp_parser_class_specifier) will then emit an error if a type is
16260 defined in the type-id. */
16262 {
16266 }
16270 /* Restore the error message if need be. */
16275 {
16278 }
16283 {
16286 }
16288 /* A typedef-name can also be introduced by an alias-declaration. The
16289 identifier following the using keyword becomes a typedef-name. It has
16290 the same semantics as if it were introduced by the typedef
16291 specifier. In particular, it does not define a new type and it shall
16292 not appear in the type-id. */
16297 {
16300 ds_attribute,
16301 attrs_token);
16302 }
16304 ds_typedef,
16305 using_token);
16307 ds_alias,
16308 using_token);
16317 else
16328 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16329 added into the symbol table; otherwise, return the TYPE_DECL. */
16333 {
16337 }
16340 }
16342 /* Parse a using-directive.
16344 using-directive:
16345 using namespace :: [opt] nested-name-specifier [opt]
16346 namespace-name ; */
16348 static void
16350 {
16351 tree namespace_decl;
16352 tree attribs;
16354 /* Look for the `using' keyword. */
16356 /* And the `namespace' keyword. */
16358 /* Look for the optional `::' operator. */
16360 /* And the optional nested-name-specifier. */
16366 /* Get the namespace being used. */
16368 /* And any specified attributes. */
16370 /* Update the symbol table. */
16372 /* Look for the final `;'. */
16374 }
16376 /* Parse an asm-definition.
16378 asm-definition:
16379 asm ( string-literal ) ;
16381 GNU Extension:
16383 asm-definition:
16384 asm volatile [opt] ( string-literal ) ;
16385 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16386 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16387 : asm-operand-list [opt] ) ;
16388 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16389 : asm-operand-list [opt]
16390 : asm-clobber-list [opt] ) ;
16391 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16392 : asm-clobber-list [opt]
16393 : asm-goto-list ) ; */
16395 static void
16397 {
16398 tree string;
16403 tree asm_stmt;
16411 /* Look for the `asm' keyword. */
16413 /* See if the next token is `volatile'. */
16416 {
16417 /* Remember that we saw the `volatile' keyword. */
16419 /* Consume the token. */
16421 }
16425 {
16426 /* Remember that we saw the `goto' keyword. */
16428 /* Consume the token. */
16430 }
16431 /* Look for the opening `('. */
16434 /* Look for the string. */
16437 {
16441 }
16443 /* If we're allowing GNU extensions, check for the extended assembly
16444 syntax. Unfortunately, the `:' tokens need not be separated by
16445 a space in C, and so, for compatibility, we tolerate that here
16446 too. Doing that means that we have to treat the `::' operator as
16447 two `:' tokens. */
16452 {
16457 /* The extended syntax was used. */
16460 /* Look for outputs. */
16462 {
16463 /* Consume the `:'. */
16465 /* Parse the output-operands. */
16467 CPP_COLON)
16469 CPP_SCOPE)
16471 CPP_CLOSE_PAREN)
16477 }
16478 /* If the next token is `::', there are no outputs, and the
16479 next token is the beginning of the inputs. */
16481 /* The inputs are coming next. */
16484 /* Look for inputs. */
16487 {
16488 /* Consume the `:' or `::'. */
16490 /* Parse the output-operands. */
16492 CPP_COLON)
16494 CPP_SCOPE)
16496 CPP_CLOSE_PAREN))
16501 }
16503 /* The clobbers are coming next. */
16506 /* Look for clobbers. */
16509 {
16511 /* Consume the `:' or `::'. */
16513 /* Parse the clobbers. */
16515 CPP_COLON)
16517 CPP_CLOSE_PAREN))
16519 }
16522 /* The labels are coming next. */
16525 /* Look for labels. */
16528 {
16530 /* Consume the `:' or `::'. */
16532 /* Parse the labels. */
16534 }
16538 }
16542 /* Look for the closing `)'. */
16550 {
16551 /* Create the ASM_EXPR. */
16553 {
16556 /* If the extended syntax was not used, mark the ASM_EXPR. */
16558 {
16564 }
16565 }
16566 else
16568 }
16569 }
16571 /* Declarators [gram.dcl.decl] */
16573 /* Parse an init-declarator.
16575 init-declarator:
16576 declarator initializer [opt]
16578 GNU Extension:
16580 init-declarator:
16581 declarator asm-specification [opt] attributes [opt] initializer [opt]
16583 function-definition:
16584 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16585 function-body
16586 decl-specifier-seq [opt] declarator function-try-block
16588 GNU Extension:
16590 function-definition:
16591 __extension__ function-definition
16593 TM Extension:
16595 function-definition:
16596 decl-specifier-seq [opt] declarator function-transaction-block
16598 The DECL_SPECIFIERS apply to this declarator. Returns a
16599 representation of the entity declared. If MEMBER_P is TRUE, then
16600 this declarator appears in a class scope. The new DECL created by
16601 this declarator is returned.
16603 The CHECKS are access checks that should be performed once we know
16604 what entity is being declared (and, therefore, what classes have
16605 befriended it).
16607 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16608 for a function-definition here as well. If the declarator is a
16609 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16610 be TRUE upon return. By that point, the function-definition will
16611 have been completely parsed.
16613 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16614 is FALSE.
16616 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16617 parsed declaration if it is an uninitialized single declarator not followed
16618 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16619 if present, will not be consumed. If returned, this declarator will be
16620 created with SD_INITIALIZED but will not call cp_finish_decl. */
16622 static tree
16631 {
16635 tree prefix_attributes;
16637 tree asm_specification;
16638 tree initializer;
16640 tree scope;
16642 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16643 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16644 "(...)". */
16654 /* Gather the attributes that were provided with the
16655 decl-specifiers. */
16658 /* Assume that this is not the declarator for a function
16659 definition. */
16663 /* Default arguments are only permitted for function parameters. */
16667 /* Defer access checks while parsing the declarator; we cannot know
16668 what names are accessible until we know what is being
16669 declared. */
16672 /* Parse the declarator. */
16674 declarator
16678 member_p);
16679 /* Gather up the deferred checks. */
16684 /* If the DECLARATOR was erroneous, there's no need to go
16685 further. */
16689 /* Check that the number of template-parameter-lists is OK. */
16699 /* Figure out what scope the entity declared by the DECLARATOR is
16700 located in. `grokdeclarator' sometimes changes the scope, so
16701 we compute it now. */
16704 /* Perform any lookups in the declared type which were thought to be
16705 dependent, but are not in the scope of the declarator. */
16706 decl_specifiers->type
16709 /* If we're allowing GNU extensions, look for an
16710 asm-specification. */
16712 {
16713 /* Look for an asm-specification. */
16716 }
16717 else
16720 /* Look for attributes. */
16724 // Save off the current template constraints. These will apply
16725 // to the nested scope, not the declarator. Consider, an out-of-class
16726 // member definition:
16727 //
16728 // template<typename T>
16729 // requires C<T>()
16730 // void S<T>::f() requires D<T>() { ... }
16731 //
16732 // At the point we parse the 2nd requires clause, the previous the
16733 // current constraints will have been used to resolve the enclosing
16734 // class S<T>. The D<T>() requirement applies only to the definition
16735 // of f and do not include C<T>().
16738 // Parse an optional requires clause. Currently, requirements can
16739 // be written for out-of-class member function definitions.
16740 //
16741 // TODO: It may be better to always parse and diagnose the error
16742 // as a semantic one later on.
16744 {
16747 }
16748 else
16752 /* Peek at the next token. */
16756 {
16757 /* Check to see if the token indicates the start of a
16758 function-definition. */
16760 {
16762 {
16763 /* If a function-definition should not appear here, issue an
16764 error message. */
16768 }
16770 location_t func_brace_location
16773 /* Neither attributes nor an asm-specification are allowed
16774 on a function-definition. */
16777 "an asm-specification is not allowed "
16781 "attributes are not allowed "
16783 /* This is a function-definition. */
16786 /* Parse the function definition. */
16789 decl_specifiers,
16790 declarator,
16791 prefix_attributes);
16792 else
16793 decl =
16794 (cp_parser_function_definition_from_specifiers_and_declarator
16798 {
16799 /* This is where the prologue starts... */
16802 }
16804 // Restore the current requirements before returing.
16808 }
16809 }
16811 /* [dcl.dcl]
16813 Only in function declarations for constructors, destructors, and
16814 type conversions can the decl-specifier-seq be omitted.
16816 We explicitly postpone this check past the point where we handle
16817 function-definitions because we tolerate function-definitions
16818 that are missing their return types in some modes. */
16820 {
16824 }
16826 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16830 {
16838 {
16844 }
16845 }
16846 else
16847 {
16848 /* If the init-declarator isn't initialized and isn't followed by a
16849 `,' or `;', it's not a valid init-declarator. */
16852 {
16855 else
16856 {
16859 }
16860 }
16863 }
16865 /* Because start_decl has side-effects, we should only call it if we
16866 know we're going ahead. By this point, we know that we cannot
16867 possibly be looking at any other construct. */
16870 /* If the decl specifiers were bad, issue an error now that we're
16871 sure this was intended to be a declarator. Then continue
16872 declaring the variable(s), as int, to try to cut down on further
16873 errors. */
16876 {
16879 }
16881 /* Check to see whether or not this declaration is a friend. */
16884 /* Enter the newly declared entry in the symbol table. If we're
16885 processing a declaration in a class-specifier, we wait until
16886 after processing the initializer. */
16888 {
16895 /* Adjust location of decl if declarator->id_loc is more appropriate:
16896 set, and decl wasn't merged with another decl, in which case its
16897 location would be different from input_location, and more accurate. */
16902 }
16904 /* Enter the SCOPE. That way unqualified names appearing in the
16905 initializer will be looked up in SCOPE. */
16908 /* Perform deferred access control checks, now that we know in which
16909 SCOPE the declared entity resides. */
16911 {
16914 /* If the entity being declared is a function, pretend that we
16915 are in its scope. If it is a `friend', it may have access to
16916 things that would not otherwise be accessible. */
16918 {
16921 }
16923 /* Perform access checks for template parameters. */
16926 /* Perform the access control checks for the declarator and the
16927 decl-specifiers. */
16930 /* Restore the saved value. */
16933 }
16935 /* Parse the initializer. */
16940 {
16942 {
16946 else
16947 {
16948 /* If the declaration was erroneous, we don't really
16949 know what the user intended, so just silently
16950 consume the initializer. */
16958 }
16959 }
16960 else
16961 {
16962 /* We want to record the extra mangling scope for in-class
16963 initializers of class members and initializers of static data
16964 member templates. The former involves deferring
16965 parsing of the initializer until end of class as with default
16966 arguments. So right here we only handle the latter. */
16976 }
16977 }
16979 /* The old parser allows attributes to appear after a parenthesized
16980 initializer. Mark Mitchell proposed removing this functionality
16981 on the GCC mailing lists on 2002-08-13. This parser accepts the
16982 attributes -- but ignores them. */
16989 /* For an in-class declaration, use `grokfield' to create the
16990 declaration. */
16992 {
16994 {
16997 }
17005 }
17007 /* Finish processing the declaration. But, skip member
17008 declarations. */
17010 {
17013 asm_specification,
17014 /* If the initializer is in parentheses, then this is
17015 a direct-initialization, which means that an
17016 `explicit' constructor is OK. Otherwise, an
17017 `explicit' constructor cannot be used. */
17020 }
17023 /* Core issue #226 (C++0x only): A default template-argument
17024 shall not be specified in a friend class template
17025 declaration. */
17034 {
17037 else
17039 }
17042 }
17044 /* Parse a declarator.
17046 declarator:
17047 direct-declarator
17048 ptr-operator declarator
17050 abstract-declarator:
17051 ptr-operator abstract-declarator [opt]
17052 direct-abstract-declarator
17054 GNU Extensions:
17056 declarator:
17057 attributes [opt] direct-declarator
17058 attributes [opt] ptr-operator declarator
17060 abstract-declarator:
17061 attributes [opt] ptr-operator abstract-declarator [opt]
17062 attributes [opt] direct-abstract-declarator
17064 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17065 detect constructor, destructor or conversion operators. It is set
17066 to -1 if the declarator is a name, and +1 if it is a
17067 function. Otherwise it is set to zero. Usually you just want to
17068 test for >0, but internally the negative value is used.
17070 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17071 a decl-specifier-seq unless it declares a constructor, destructor,
17072 or conversion. It might seem that we could check this condition in
17073 semantic analysis, rather than parsing, but that makes it difficult
17074 to handle something like `f()'. We want to notice that there are
17075 no decl-specifiers, and therefore realize that this is an
17076 expression, not a declaration.)
17078 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17079 the declarator is a direct-declarator of the form "(...)".
17081 MEMBER_P is true iff this declarator is a member-declarator. */
17085 cp_parser_declarator_kind dcl_kind,
17089 {
17092 cp_cv_quals cv_quals;
17093 tree class_type;
17096 /* Assume this is not a constructor, destructor, or type-conversion
17097 operator. */
17104 /* Check for the ptr-operator production. */
17106 /* Parse the ptr-operator. */
17112 /* If that worked, then we have a ptr-operator. */
17114 {
17115 /* If a ptr-operator was found, then this declarator was not
17116 parenthesized. */
17119 /* The dependent declarator is optional if we are parsing an
17120 abstract-declarator. */
17124 /* Parse the dependent declarator. */
17130 /* If we are parsing an abstract-declarator, we must handle the
17131 case where the dependent declarator is absent. */
17136 declarator = cp_parser_make_indirect_declarator
17138 }
17139 /* Everything else is a direct-declarator. */
17140 else
17141 {
17144 CPP_OPEN_PAREN);
17146 ctor_dtor_or_conv_p,
17147 member_p);
17148 }
17153 }
17155 /* Parse a direct-declarator or direct-abstract-declarator.
17157 direct-declarator:
17158 declarator-id
17159 direct-declarator ( parameter-declaration-clause )
17160 cv-qualifier-seq [opt]
17161 ref-qualifier [opt]
17162 exception-specification [opt]
17163 direct-declarator [ constant-expression [opt] ]
17164 ( declarator )
17166 direct-abstract-declarator:
17167 direct-abstract-declarator [opt]
17168 ( parameter-declaration-clause )
17169 cv-qualifier-seq [opt]
17170 ref-qualifier [opt]
17171 exception-specification [opt]
17172 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17173 ( abstract-declarator )
17175 Returns a representation of the declarator. DCL_KIND is
17176 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17177 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17178 we are parsing a direct-declarator. It is
17179 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17180 of ambiguity we prefer an abstract declarator, as per
17181 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17182 cp_parser_declarator. */
17186 cp_parser_declarator_kind dcl_kind,
17189 {
17199 {
17200 /* Peek at the next token. */
17203 {
17204 /* This is either a parameter-declaration-clause, or a
17205 parenthesized declarator. When we know we are parsing a
17206 named declarator, it must be a parenthesized declarator
17207 if FIRST is true. For instance, `(int)' is a
17208 parameter-declaration-clause, with an omitted
17209 direct-abstract-declarator. But `((*))', is a
17210 parenthesized abstract declarator. Finally, when T is a
17211 template parameter `(T)' is a
17212 parameter-declaration-clause, and not a parenthesized
17213 named declarator.
17215 We first try and parse a parameter-declaration-clause,
17216 and then try a nested declarator (if FIRST is true).
17218 It is not an error for it not to be a
17219 parameter-declaration-clause, even when FIRST is
17220 false. Consider,
17222 int i (int);
17223 int i (3);
17225 The first is the declaration of a function while the
17226 second is the definition of a variable, including its
17227 initializer.
17229 Having seen only the parenthesis, we cannot know which of
17230 these two alternatives should be selected. Even more
17231 complex are examples like:
17233 int i (int (a));
17234 int i (int (3));
17236 The former is a function-declaration; the latter is a
17237 variable initialization.
17239 Thus again, we try a parameter-declaration-clause, and if
17240 that fails, we back out and return. */
17243 {
17244 tree params;
17248 /* In a member-declarator, the only valid interpretation
17249 of a parenthesis is the start of a
17250 parameter-declaration-clause. (It is invalid to
17251 initialize a static data member with a parenthesized
17252 initializer; only the "=" form of initialization is
17253 permitted.) */
17257 /* Consume the `('. */
17260 {
17261 /* If this is going to be an abstract declarator, we're
17262 in a declarator and we can't have default args. */
17265 }
17267 /* Inside the function parameter list, surrounding
17268 template-parameter-lists do not apply. */
17269 saved_num_template_parameter_lists
17275 /* Parse the parameter-declaration-clause. */
17278 /* Restore saved template parameter lists accounting for implicit
17279 template parameters. */
17280 parser->num_template_parameter_lists
17283 /* Consume the `)'. */
17286 /* If all went well, parse the cv-qualifier-seq,
17287 ref-qualifier and the exception-specification. */
17289 {
17290 cp_cv_quals cv_quals;
17291 cp_virt_specifiers virt_specifiers;
17292 cp_ref_qualifier ref_qual;
17293 tree exception_specification;
17294 tree late_return;
17295 tree attrs;
17305 /* Parse the cv-qualifier-seq. */
17307 /* Parse the ref-qualifier. */
17309 /* And the exception-specification. */
17310 exception_specification
17315 late_return = (cp_parser_late_return_type_opt
17320 /* Parse the virt-specifier-seq. */
17323 /* Create the function-declarator. */
17325 params,
17326 cv_quals,
17327 virt_specifiers,
17328 ref_qual,
17329 exception_specification,
17330 late_return);
17332 /* Any subsequent parameter lists are to do with
17333 return type, so are not those of the declared
17334 function. */
17336 }
17338 /* Remove the function parms from scope. */
17342 /* Repeat the main loop. */
17344 }
17346 /* If this is the first, we can try a parenthesized
17347 declarator. */
17349 {
17355 /* Consume the `('. */
17357 /* Parse the nested declarator. */
17360 declarator
17363 member_p);
17366 /* Expect a `)'. */
17373 }
17374 /* Otherwise, we must be done. */
17375 else
17377 }
17381 {
17382 /* Parse an array-declarator. */
17391 /* Consume the `['. */
17393 /* Peek at the next token. */
17395 /* If the next token is `]', then there is no
17396 constant-expression. */
17398 {
17400 bounds
17410 {
17411 /* Normally, the array bound must be an integral constant
17412 expression. However, as an extension, we allow VLAs
17413 in function scopes as long as they aren't part of a
17414 parameter declaration. */
17418 }
17420 {
17421 /* Remember this wasn't a constant-expression. */
17424 }
17425 }
17426 else
17428 /* Look for the closing `]'. */
17430 {
17433 }
17438 }
17440 {
17441 {
17442 tree qualifying_scope;
17443 tree unqualified_name;
17444 tree attrs;
17445 special_function_kind sfk;
17450 /* Parse a declarator-id */
17453 {
17456 /* If we see an ellipsis, we should be looking at a
17457 parameter pack. */
17459 {
17460 /* Consume the `...' */
17464 }
17465 }
17468 unqualified_name
17472 {
17476 {
17477 /* Check whether an error occurred. */
17480 /* We already consumed the ellipsis to mark a
17481 parameter pack, but we have no way to report it,
17482 so abort the tentative parse. We will be exiting
17483 immediately anyway. */
17485 }
17486 else
17492 && (qualifying_scope
17494 {
17497 }
17498 }
17503 {
17508 }
17514 {
17515 /* In the declaration of a member of a template class
17516 outside of the class itself, the SCOPE will sometimes
17517 be a TYPENAME_TYPE. For example, given:
17519 template <typename T>
17520 int S<T>::R::i = 3;
17522 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17523 this context, we must resolve S<T>::R to an ordinary
17524 type, rather than a typename type.
17526 The reason we normally avoid resolving TYPENAME_TYPEs
17527 is that a specialization of `S' might render
17528 `S<T>::R' not a type. However, if `S' is
17529 specialized, then this `i' will not be used, so there
17530 is no harm in resolving the types here. */
17531 tree type;
17533 /* Resolve the TYPENAME_TYPE. */
17536 /* If that failed, the declarator is invalid. */
17538 {
17541 "cannot define member of dependent typedef "
17543 else
17548 }
17550 }
17555 {
17556 tree class_type;
17561 else
17565 {
17568 {
17571 {
17575 "use %<%T::%D%> instead of %<%T::%D%> to "
17577 class_type,
17582 }
17583 else
17585 }
17586 else
17587 {
17588 /* We do not attempt to print the declarator
17589 here because we do not have enough
17590 information about its original syntactic
17591 form. */
17595 }
17596 }
17599 {
17605 for an anonymous type, even if the type
17606 got a name for linkage purposes. */
17609 class_type))
17610 {
17613 }
17621 }
17622 }
17624 unqualified_name,
17625 sfk);
17632 }
17634 handle_declarator:;
17637 {
17638 /* Any names that appear after the declarator-id for a
17639 member are looked up in the containing scope. */
17641 {
17642 /* But declarations with qualified-ids can't appear in a
17643 function. */
17646 }
17648 }
17652 /* Default args are only allowed on function
17653 declarations. */
17655 else
17659 }
17660 /* We're done. */
17661 else
17663 }
17665 /* For an abstract declarator, we might wind up with nothing at this
17666 point. That's an error; the declarator is not optional. */
17670 /* If we entered a scope, we must exit it now. */
17678 }
17680 /* Parse a ptr-operator.
17682 ptr-operator:
17683 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17684 * cv-qualifier-seq [opt]
17685 &
17686 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17687 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17689 GNU Extension:
17691 ptr-operator:
17692 & cv-qualifier-seq [opt]
17694 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17695 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17696 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17697 filled in with the TYPE containing the member. *CV_QUALS is
17698 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17699 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17700 Note that the tree codes returned by this function have nothing
17701 to do with the types of trees that will be eventually be created
17702 to represent the pointer or reference type being parsed. They are
17703 just constants with suggestive names. */
17704 static enum tree_code
17709 {
17714 /* Assume that it's not a pointer-to-member. */
17716 /* And that there are no cv-qualifiers. */
17719 /* Peek at the next token. */
17722 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17732 {
17733 /* Consume the `*', `&' or `&&'. */
17736 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17737 `&', if we are allowing GNU extensions. (The only qualifier
17738 that can legally appear after `&' is `restrict', but that is
17739 enforced during semantic analysis. */
17747 }
17748 else
17749 {
17750 /* Try the pointer-to-member case. */
17752 /* Look for the optional `::' operator. */
17755 /* Look for the nested-name specifier. */
17762 /* If we found it, and the next token is a `*', then we are
17763 indeed looking at a pointer-to-member operator. */
17766 {
17767 /* Indicate that the `*' operator was used. */
17775 else
17776 {
17777 /* The type of which the member is a member is given by the
17778 current SCOPE. */
17780 /* The next name will not be qualified. */
17784 /* Look for optional c++11 attributes. */
17788 /* Look for the optional cv-qualifier-seq. */
17790 }
17791 }
17792 /* If that didn't work we don't have a ptr-operator. */
17795 }
17798 }
17800 /* Parse an (optional) cv-qualifier-seq.
17802 cv-qualifier-seq:
17803 cv-qualifier cv-qualifier-seq [opt]
17805 cv-qualifier:
17806 const
17807 volatile
17809 GNU Extension:
17811 cv-qualifier:
17812 __restrict__
17814 Returns a bitmask representing the cv-qualifiers. */
17816 static cp_cv_quals
17818 {
17822 {
17824 cp_cv_quals cv_qualifier;
17826 /* Peek at the next token. */
17828 /* See if it's a cv-qualifier. */
17830 {
17846 }
17852 {
17855 }
17856 else
17857 {
17860 }
17861 }
17864 }
17866 /* Parse an (optional) ref-qualifier
17868 ref-qualifier:
17869 &
17870 &&
17872 Returns cp_ref_qualifier representing ref-qualifier. */
17874 static cp_ref_qualifier
17876 {
17879 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17884 {
17889 {
17901 }
17906 {
17909 }
17910 else
17911 {
17914 }
17915 }
17918 }
17920 /* Parse an (optional) virt-specifier-seq.
17922 virt-specifier-seq:
17923 virt-specifier virt-specifier-seq [opt]
17925 virt-specifier:
17926 override
17927 final
17929 Returns a bitmask representing the virt-specifiers. */
17931 static cp_virt_specifiers
17933 {
17937 {
17939 cp_virt_specifiers virt_specifier;
17941 /* Peek at the next token. */
17943 /* See if it's a virt-specifier-qualifier. */
17947 {
17950 }
17952 {
17955 }
17957 {
17959 }
17960 else
17964 {
17967 }
17968 else
17969 {
17972 }
17973 }
17975 }
17977 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17978 is in scope even though it isn't real. */
17980 static void
17982 {
17983 tree this_parm;
17986 {
17987 /* We don't clear this between NSDMIs. Is it already what we want? */
17992 }
17995 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17997 current_class_ref
18000 }
18002 /* Return true iff our current scope is a non-static data member
18003 initializer. */
18005 bool
18007 {
18008 /* We recognize NSDMI context by the context-less 'this' pointer set up
18009 by the function above. */
18013 }
18015 /* Parse a late-specified return type, if any. This is not a separate
18016 non-terminal, but part of a function declarator, which looks like
18018 -> trailing-type-specifier-seq abstract-declarator(opt)
18020 Returns the type indicated by the type-id.
18022 In addition to this this parses any queued up omp declare simd
18023 clauses.
18025 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18026 function. */
18028 static tree
18030 cp_cv_quals quals)
18031 {
18035 && declarator
18038 /* Peek at the next token. */
18040 /* A late-specified return type is indicated by an initial '->'. */
18047 {
18048 /* DR 1207: 'this' is in scope in the trailing return type. */
18050 }
18053 {
18054 /* Consume the ->. */
18058 }
18061 declarator->std_attributes
18066 {
18069 }
18072 }
18074 /* Parse a declarator-id.
18076 declarator-id:
18077 id-expression
18078 :: [opt] nested-name-specifier [opt] type-name
18080 In the `id-expression' case, the value returned is as for
18081 cp_parser_id_expression if the id-expression was an unqualified-id.
18082 If the id-expression was a qualified-id, then a SCOPE_REF is
18083 returned. The first operand is the scope (either a NAMESPACE_DECL
18084 or TREE_TYPE), but the second is still just a representation of an
18085 unqualified-id. */
18087 static tree
18089 {
18090 tree id;
18091 /* The expression must be an id-expression. Assume that qualified
18092 names are the names of types so that:
18094 template <class T>
18095 int S<T>::R::i = 3;
18097 will work; we must treat `S<T>::R' as the name of a type.
18098 Similarly, assume that qualified names are templates, where
18099 required, so that:
18101 template <class T>
18102 int S<T>::R<T>::i = 3;
18104 will work, too. */
18110 optional_p);
18114 }
18116 /* Parse a type-id.
18118 type-id:
18119 type-specifier-seq abstract-declarator [opt]
18121 Returns the TYPE specified. */
18123 static tree
18126 {
18127 cp_decl_specifier_seq type_specifier_seq;
18130 /* Parse the type-specifier-seq. */
18132 is_trailing_return,
18137 /* There might or might not be an abstract declarator. */
18139 /* Look for the declarator. */
18140 abstract_declarator
18144 /* Check to see if there really was a declarator. */
18151 {
18152 /* A type-id with type 'auto' is only ok if the abstract declarator
18153 is a function declarator with a late-specified return type. */
18158 else
18159 {
18162 }
18163 }
18166 is_template_arg);
18167 }
18170 {
18172 }
18175 {
18176 tree r;
18178 parser->type_definition_forbidden_message
18183 }
18186 {
18188 }
18190 /* Parse a type-specifier-seq.
18192 type-specifier-seq:
18193 type-specifier type-specifier-seq [opt]
18195 GNU extension:
18197 type-specifier-seq:
18198 attributes type-specifier-seq [opt]
18200 If IS_DECLARATION is true, we are at the start of a "condition" or
18201 exception-declaration, so we might be followed by a declarator-id.
18203 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18204 i.e. we've just seen "->".
18206 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18208 static void
18213 {
18218 /* Clear the TYPE_SPECIFIER_SEQ. */
18221 /* In the context of a trailing return type, enum E { } is an
18222 elaborated-type-specifier followed by a function-body, not an
18223 enum-specifier. */
18227 /* Parse the type-specifiers and attributes. */
18229 {
18230 tree type_specifier;
18233 /* Check for attributes first. */
18235 {
18240 }
18242 /* record the token of the beginning of the type specifier seq,
18243 for error reporting purposes*/
18247 /* Look for the type-specifier. */
18249 flags,
18250 type_specifier_seq,
18252 NULL,
18255 {
18256 /* If the first type-specifier could not be found, this is not a
18257 type-specifier-seq at all. */
18259 {
18263 }
18264 /* If subsequent type-specifiers could not be found, the
18265 type-specifier-seq is complete. */
18267 }
18270 /* The standard says that a condition can be:
18272 type-specifier-seq declarator = assignment-expression
18274 However, given:
18276 struct S {};
18277 if (int S = ...)
18279 we should treat the "S" as a declarator, not as a
18280 type-specifier. The standard doesn't say that explicitly for
18281 type-specifier-seq, but it does say that for
18282 decl-specifier-seq in an ordinary declaration. Perhaps it
18283 would be clearer just to allow a decl-specifier-seq here, and
18284 then add a semantic restriction that if any decl-specifiers
18285 that are not type-specifiers appear, the program is invalid. */
18288 }
18289 }
18291 /* Parse a parameter-declaration-clause.
18293 parameter-declaration-clause:
18294 parameter-declaration-list [opt] ... [opt]
18295 parameter-declaration-list , ...
18297 Returns a representation for the parameter declarations. A return
18298 value of NULL indicates a parameter-declaration-clause consisting
18299 only of an ellipsis. */
18301 static tree
18303 {
18304 tree parameters;
18313 parser->auto_is_implicit_function_template_parm_p
18315 }
18323 /* Peek at the next token. */
18325 /* Check for trivial parameter-declaration-clauses. */
18327 {
18328 /* Consume the `...' token. */
18331 }
18333 /* There are no parameters. */
18334 {
18335 #ifndef NO_IMPLICIT_EXTERN_C
18339 else
18340 #endif
18342 }
18343 /* Check for `(void)', too, which is a special case. */
18347 {
18348 /* Consume the `void' token. */
18350 /* There are no parameters. */
18352 }
18354 /* Parse the parameter-declaration-list. */
18356 /* If a parse error occurred while parsing the
18357 parameter-declaration-list, then the entire
18358 parameter-declaration-clause is erroneous. */
18362 /* Peek at the next token. */
18364 /* If it's a `,', the clause should terminate with an ellipsis. */
18366 {
18367 /* Consume the `,'. */
18369 /* Expect an ellipsis. */
18370 ellipsis_p
18372 }
18373 /* It might also be `...' if the optional trailing `,' was
18374 omitted. */
18376 {
18377 /* Consume the `...' token. */
18379 /* And remember that we saw it. */
18381 }
18382 else
18385 /* Finish the parameter list. */
18390 }
18392 /* Parse a parameter-declaration-list.
18394 parameter-declaration-list:
18395 parameter-declaration
18396 parameter-declaration-list , parameter-declaration
18398 Returns a representation of the parameter-declaration-list, as for
18399 cp_parser_parameter_declaration_clause. However, the
18400 `void_list_node' is never appended to the list. Upon return,
18401 *IS_ERROR will be true iff an error occurred. */
18403 static tree
18405 {
18411 /* Assume all will go well. */
18413 /* The special considerations that apply to a function within an
18414 unbraced linkage specifications do not apply to the parameters
18415 to the function. */
18416 saved_in_unbraced_linkage_specification_p
18420 /* Look for more parameters. */
18422 {
18430 /* Parse the parameter. */
18431 parameter
18436 /* We don't know yet if the enclosing context is deprecated, so wait
18437 and warn in grokparms if appropriate. */
18441 {
18442 /* If a function parameter pack was specified and an implicit template
18443 parameter was introduced during cp_parser_parameter_declaration,
18444 change any implicit parameters introduced into packs. */
18448 {
18456 }
18460 PARM,
18463 }
18467 /* If a parse error occurred parsing the parameter declaration,
18468 then the entire parameter-declaration-list is erroneous. */
18470 {
18474 }
18484 {
18488 }
18490 /* Add the new parameter to the list. */
18494 /* Peek at the next token. */
18497 /* These are for Objective-C++ */
18500 /* The parameter-declaration-list is complete. */
18503 {
18506 /* Peek at the next token. */
18508 /* If it's an ellipsis, then the list is complete. */
18511 /* Otherwise, there must be more parameters. Consume the
18512 `,'. */
18514 /* When parsing something like:
18516 int i(float f, double d)
18518 we can tell after seeing the declaration for "f" that we
18519 are not looking at an initialization of a variable "i",
18520 but rather at the declaration of a function "i".
18522 Due to the fact that the parsing of template arguments
18523 (as specified to a template-id) requires backtracking we
18524 cannot use this technique when inside a template argument
18525 list. */
18529 /* However, a parameter-declaration of the form
18530 "float(f)" (which is a valid declaration of a
18531 parameter "f") can also be interpreted as an
18532 expression (the conversion of "f" to "float"). */
18535 }
18536 else
18537 {
18545 }
18546 }
18548 parser->in_unbraced_linkage_specification_p
18553 {
18556 }
18559 }
18561 /* Parse a parameter declaration.
18563 parameter-declaration:
18564 decl-specifier-seq ... [opt] declarator
18565 decl-specifier-seq declarator = assignment-expression
18566 decl-specifier-seq ... [opt] abstract-declarator [opt]
18567 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18569 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18570 declares a template parameter. (In that case, a non-nested `>'
18571 token encountered during the parsing of the assignment-expression
18572 is not interpreted as a greater-than operator.)
18574 Returns a representation of the parameter, or NULL if an error
18575 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18576 true iff the declarator is of the form "(p)". */
18582 {
18584 cp_decl_specifier_seq decl_specifiers;
18586 tree default_argument;
18590 /* In a template parameter, `>' is not an operator.
18592 [temp.param]
18594 When parsing a default template-argument for a non-type
18595 template-parameter, the first non-nested `>' is taken as the end
18596 of the template parameter-list rather than a greater-than
18597 operator. */
18599 /* Type definitions may not appear in parameter types. */
18601 parser->type_definition_forbidden_message
18604 /* Parse the declaration-specifiers. */
18606 CP_PARSER_FLAGS_NONE,
18610 /* Complain about missing 'typename' or other invalid type names. */
18615 /* If an error occurred, there's no reason to attempt to parse the
18616 rest of the declaration. */
18618 {
18621 }
18623 /* Peek at the next token. */
18626 /* If the next token is a `)', `,', `=', `>', or `...', then there
18627 is no declarator. However, when variadic templates are enabled,
18628 there may be a declarator following `...'. */
18633 {
18637 }
18638 /* Otherwise, there should be a declarator. */
18639 else
18640 {
18644 /* After seeing a decl-specifier-seq, if the next token is not a
18645 "(", there is no possibility that the code is a valid
18646 expression. Therefore, if parsing tentatively, we commit at
18647 this point. */
18649 /* In an expression context, having seen:
18651 (int((char ...
18653 we cannot be sure whether we are looking at a
18654 function-type (taking a "char" as a parameter) or a cast
18655 of some object of type "char" to "int". */
18661 /* Parse the declarator. */
18664 CP_PARSER_DECLARATOR_EITHER,
18666 parenthesized_p,
18669 /* After the declarator, allow more attributes. */
18670 decl_specifiers.attributes
18673 }
18675 /* If the next token is an ellipsis, and we have not seen a
18676 declarator name, and the type of the declarator contains parameter
18677 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18678 a parameter pack expansion expression. Otherwise, leave the
18679 ellipsis for a C-style variadic function. */
18682 {
18693 {
18694 /* Consume the `...'. */
18698 /* Build a pack expansion type */
18701 else
18703 }
18704 }
18706 /* The restriction on defining new types applies only to the type
18707 of the parameter, not to the default argument. */
18710 /* If the next token is `=', then process a default argument. */
18712 {
18714 /* If we are defining a class, then the tokens that make up the
18715 default argument must be saved and processed later. */
18720 /* Outside of a class definition, we can just parse the
18721 assignment-expression. */
18722 else
18723 default_argument
18727 {
18730 else
18731 {
18733 "default arguments are only "
18736 }
18737 }
18741 {
18742 /* Find the name of the parameter pack. */
18749 template_parm_p
18755 else
18757 template_parm_p
18764 }
18765 }
18766 else
18770 declarator,
18771 default_argument);
18772 }
18774 /* Parse a default argument and return it.
18776 TEMPLATE_PARM_P is true if this is a default argument for a
18777 non-type template parameter. */
18778 static tree
18780 {
18786 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18787 set correctly. */
18790 /* Local variable names (and the `this' keyword) may not
18791 appear in a default argument. */
18794 /* Parse the assignment-expression. */
18797 default_argument
18807 }
18809 /* Parse a function-body.
18811 function-body:
18812 compound_statement */
18814 static void
18816 {
18818 }
18820 /* Parse a ctor-initializer-opt followed by a function-body. Return
18821 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18822 is true we are parsing a function-try-block. */
18824 static bool
18827 {
18835 /* Begin the function body. */
18837 /* Parse the optional ctor-initializer. */
18840 /* If we're parsing a constexpr constructor definition, we need
18841 to check that the constructor body is indeed empty. However,
18842 before we get to cp_parser_function_body lot of junk has been
18843 generated, so we can't just check that we have an empty block.
18844 Rather we take a snapshot of the outermost block, and check whether
18845 cp_parser_function_body changed its state. */
18847 {
18851 }
18852 /* Parse the function-body. */
18856 /* Finish the function body. */
18860 }
18862 /* Parse an initializer.
18864 initializer:
18865 = initializer-clause
18866 ( expression-list )
18868 Returns an expression representing the initializer. If no
18869 initializer is present, NULL_TREE is returned.
18871 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18872 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18873 set to TRUE if there is no initializer present. If there is an
18874 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18875 is set to true; otherwise it is set to false. */
18877 static tree
18880 {
18882 tree init;
18884 /* Peek at the next token. */
18887 /* Let our caller know whether or not this initializer was
18888 parenthesized. */
18890 /* Assume that the initializer is constant. */
18894 {
18895 /* Consume the `='. */
18897 /* Parse the initializer-clause. */
18899 }
18901 {
18906 non_constant_p);
18911 }
18913 {
18917 }
18918 else
18919 {
18920 /* Anything else is an error. */
18923 }
18926 }
18928 /* Parse an initializer-clause.
18930 initializer-clause:
18931 assignment-expression
18932 braced-init-list
18934 Returns an expression representing the initializer.
18936 If the `assignment-expression' production is used the value
18937 returned is simply a representation for the expression.
18939 Otherwise, calls cp_parser_braced_list. */
18941 static tree
18943 {
18944 tree initializer;
18946 /* Assume the expression is constant. */
18949 /* If it is not a `{', then we are looking at an
18950 assignment-expression. */
18952 {
18953 initializer
18956 non_constant_p);
18957 }
18958 else
18962 }
18964 /* Parse a brace-enclosed initializer list.
18966 braced-init-list:
18967 { initializer-list , [opt] }
18968 { }
18970 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18971 the elements of the initializer-list (or NULL, if the last
18972 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18973 NULL_TREE. There is no way to detect whether or not the optional
18974 trailing `,' was provided. NON_CONSTANT_P is as for
18975 cp_parser_initializer. */
18977 static tree
18979 {
18980 tree initializer;
18982 /* Consume the `{' token. */
18984 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18986 /* If it's not a `}', then there is a non-trivial initializer. */
18988 {
18989 /* Parse the initializer list. */
18992 /* A trailing `,' token is allowed. */
18995 }
18996 else
18998 /* Now, there should be a trailing `}'. */
19002 }
19004 /* Parse an initializer-list.
19006 initializer-list:
19007 initializer-clause ... [opt]
19008 initializer-list , initializer-clause ... [opt]
19010 GNU Extension:
19012 initializer-list:
19013 designation initializer-clause ...[opt]
19014 initializer-list , designation initializer-clause ...[opt]
19016 designation:
19017 . identifier =
19018 identifier :
19019 [ constant-expression ] =
19021 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19022 for the initializer. If the INDEX of the elt is non-NULL, it is the
19023 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19024 as for cp_parser_initializer. */
19028 {
19031 /* Assume all of the expressions are constant. */
19034 /* Parse the rest of the list. */
19036 {
19038 tree designator;
19039 tree initializer;
19042 /* If the next token is an identifier and the following one is a
19043 colon, we are looking at the GNU designated-initializer
19044 syntax. */
19048 {
19049 /* Warn the user that they are using an extension. */
19052 /* Consume the identifier. */
19054 /* Consume the `:'. */
19056 }
19057 /* Also handle the C99 syntax, '. id ='. */
19062 {
19063 /* Warn the user that they are using an extension. */
19066 /* Consume the `.'. */
19068 /* Consume the identifier. */
19070 /* Consume the `='. */
19072 }
19073 /* Also handle C99 array designators, '[ const ] ='. */
19077 {
19078 /* In C++11, [ could start a lambda-introducer. */
19090 }
19091 else
19094 /* Parse the initializer. */
19097 /* If any clause is non-constant, so is the entire initializer. */
19101 /* If we have an ellipsis, this is an initializer pack
19102 expansion. */
19104 {
19105 /* Consume the `...'. */
19108 /* Turn the initializer into an initializer expansion. */
19110 }
19112 /* Add it to the vector. */
19115 /* If the next token is not a comma, we have reached the end of
19116 the list. */
19120 /* Peek at the next token. */
19122 /* If the next token is a `}', then we're still done. An
19123 initializer-clause can have a trailing `,' after the
19124 initializer-list and before the closing `}'. */
19128 /* Consume the `,' token. */
19130 }
19133 }
19135 /* Classes [gram.class] */
19137 /* Parse a class-name.
19139 class-name:
19140 identifier
19141 template-id
19143 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19144 to indicate that names looked up in dependent types should be
19145 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19146 keyword has been used to indicate that the name that appears next
19147 is a template. TAG_TYPE indicates the explicit tag given before
19148 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19149 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19150 is the class being defined in a class-head.
19152 Returns the TYPE_DECL representing the class. */
19154 static tree
19162 {
19163 tree decl;
19164 tree scope;
19169 /* All class-names start with an identifier. */
19172 {
19175 }
19177 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19178 to a template-id, so we save it here. */
19183 /* Any name names a type if we're following the `typename' keyword
19184 in a qualified name where the enclosing scope is type-dependent. */
19187 /* Handle the common case (an identifier, but not a template-id)
19188 efficiently. */
19191 {
19195 /* Look for the identifier. */
19199 /* If the next token isn't an identifier, we are certainly not
19200 looking at a class-name. */
19203 /* If we know this is a type-name, there's no need to look it
19204 up. */
19207 else
19208 {
19209 tree ambiguous_decls;
19210 /* If we already know that this lookup is ambiguous, then
19211 we've already issued an error message; there's no reason
19212 to check again. */
19214 {
19217 }
19218 /* If the next token is a `::', then the name must be a type
19219 name.
19221 [basic.lookup.qual]
19223 During the lookup for a name preceding the :: scope
19224 resolution operator, object, function, and enumerator
19225 names are ignored. */
19228 /* Look up the name. */
19230 tag_type,
19233 check_dependency_p,
19237 {
19241 }
19242 }
19243 }
19244 else
19245 {
19246 /* Try a template-id. */
19248 check_dependency_p,
19249 tag_type,
19250 is_declaration);
19253 }
19257 /* If this is a typename, create a TYPENAME_TYPE. */
19259 {
19264 }
19268 /* Check to see that it is really the name of a class. */
19272 /* Situations like this:
19274 template <typename T> struct A {
19275 typename T::template X<int>::I i;
19276 };
19278 are problematic. Is `T::template X<int>' a class-name? The
19279 standard does not seem to be definitive, but there is no other
19280 valid interpretation of the following `::'. Therefore, those
19281 names are considered class-names. */
19282 {
19286 }
19290 /* In Objective-C 2.0, a classname followed by '.' starts a
19291 dot-syntax expression, and it's not a type-name. */
19303 }
19305 /* Parse a class-specifier.
19307 class-specifier:
19308 class-head { member-specification [opt] }
19310 Returns the TREE_TYPE representing the class. */
19312 static tree
19314 {
19315 tree type;
19329 /* Parse the class-head. */
19332 /* If the class-head was a semantic disaster, skip the entire body
19333 of the class. */
19335 {
19339 }
19341 /* Look for the `{'. */
19343 {
19346 }
19350 /* Issue an error message if type-definitions are forbidden here. */
19352 /* Remember that we are defining one more class. */
19354 /* Inside the class, surrounding template-parameter-lists do not
19355 apply. */
19356 saved_num_template_parameter_lists
19359 /* We are not in a function body. */
19362 /* Or in a loop. */
19365 /* Or in a switch. */
19368 /* We are not immediately inside an extern "lang" block. */
19369 saved_in_unbraced_linkage_specification_p
19373 /* Start the class. */
19375 {
19378 }
19382 /* If the type is erroneous, skip the entire body of the class. */
19384 else
19385 /* Parse the member-specification. */
19388 /* Look for the trailing `}'. */
19390 /* Look for trailing attributes to apply to this class. */
19398 /* We've finished a type definition. Check for the common syntax
19399 error of forgetting a semicolon after the definition. We need to
19400 be careful, as we can't just check for not-a-semicolon and be done
19401 with it; the user might have typed:
19403 class X { } c = ...;
19404 class X { } *p = ...;
19406 and so forth. Instead, enumerate all the possible tokens that
19407 might follow this production; if we don't see one of them, then
19408 complain and silently insert the semicolon. */
19409 {
19414 /* Don't try to parse c++11 attributes here. As per the
19415 grammar, that should be a task for
19416 cp_parser_decl_specifier_seq. */
19420 {
19431 /* While it's legal for type qualifiers and storage class
19432 specifiers to follow type definitions in the grammar, only
19433 compiler testsuites contain code like that. Assume that if
19434 we see such code, then what we're really seeing is a case
19435 like:
19437 class X { }
19438 const <type> var = ...;
19440 or
19442 class Y { }
19443 static <type> func (...) ...
19445 i.e. the qualifier or specifier applies to the next
19446 declaration. To do so, however, we need to look ahead one
19447 more token to see if *that* token is a type specifier.
19449 This code could be improved to handle:
19451 class Z { }
19452 static const <type> var = ...; */
19455 {
19458 /* Handling user-defined types here would be nice, but very
19459 tricky. */
19460 want_semicolon
19463 }
19467 }
19469 /* If we don't have a type, then something is very wrong and we
19470 shouldn't try to do anything clever. Likewise for not seeing the
19471 closing brace. */
19473 {
19474 cp_token_position prev
19485 else
19488 /* Unget one token and smash it to look as though we encountered
19489 a semicolon in the input stream. */
19494 }
19495 }
19497 /* If this class is not itself within the scope of another class,
19498 then we need to parse the bodies of all of the queued function
19499 definitions. Note that the queued functions defined in a class
19500 are not always processed immediately following the
19501 class-specifier for that class. Consider:
19503 struct A {
19504 struct B { void f() { sizeof (A); } };
19505 };
19507 If `f' were processed before the processing of `A' were
19508 completed, there would be no way to compute the size of `A'.
19509 Note that the nesting we are interested in here is lexical --
19510 not the semantic nesting given by TYPE_CONTEXT. In particular,
19511 for:
19513 struct A { struct B; };
19514 struct A::B { void f() { } };
19516 there is no need to delay the parsing of `A::B::f'. */
19518 {
19519 tree decl;
19526 /* In a first pass, parse default arguments to the functions.
19527 Then, in a second pass, parse the bodies of the functions.
19528 This two-phased approach handles cases like:
19530 struct S {
19531 void f() { g(); }
19532 void g(int i = 3);
19533 };
19535 */
19537 {
19539 /* If there are default arguments that have not yet been processed,
19540 take care of them now. */
19542 {
19547 }
19548 /* Make sure that any template parameters are in scope. */
19550 /* Parse the default argument expressions. */
19552 /* Remove any template parameters from the symbol table. */
19554 }
19556 /* Now parse any NSDMIs. */
19560 {
19562 {
19567 }
19570 }
19576 /* Now parse the body of the functions. */
19578 {
19579 /* OpenMP UDRs need to be parsed before all other functions. */
19586 }
19587 else
19591 }
19593 /* Put back any saved access checks. */
19596 /* Restore saved state. */
19600 parser->num_template_parameter_lists
19602 parser->in_unbraced_linkage_specification_p
19606 }
19608 static tree
19610 {
19611 tree ret;
19616 }
19618 /* Parse a class-head.
19620 class-head:
19621 class-key identifier [opt] base-clause [opt]
19622 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19623 class-key nested-name-specifier [opt] template-id
19624 base-clause [opt]
19626 class-virt-specifier:
19627 final
19629 GNU Extensions:
19630 class-key attributes identifier [opt] base-clause [opt]
19631 class-key attributes nested-name-specifier identifier base-clause [opt]
19632 class-key attributes nested-name-specifier [opt] template-id
19633 base-clause [opt]
19635 Upon return BASES is initialized to the list of base classes (or
19636 NULL, if there are none) in the same form returned by
19637 cp_parser_base_clause.
19639 Returns the TYPE of the indicated class. Sets
19640 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19641 involving a nested-name-specifier was used, and FALSE otherwise.
19643 Returns error_mark_node if this is not a class-head.
19645 Returns NULL_TREE if the class-head is syntactically valid, but
19646 semantically invalid in a way that means we should skip the entire
19647 body of the class. */
19649 static tree
19652 {
19653 tree nested_name_specifier;
19657 tree attributes;
19658 tree bases;
19668 /* Assume no nested-name-specifier will be present. */
19670 /* Assume no template parameter lists will be used in defining the
19671 type. */
19675 /* Look for the class-key. */
19680 /* Parse the attributes. */
19683 /* If the next token is `::', that is invalid -- but sometimes
19684 people do try to write:
19686 struct ::S {};
19688 Handle this gracefully by accepting the extra qualifier, and then
19689 issuing an error about it later if this really is a
19690 class-head. If it turns out just to be an elaborated type
19691 specifier, remain silent. */
19697 /* Determine the name of the class. Begin by looking for an
19698 optional nested-name-specifier. */
19700 nested_name_specifier
19706 /* If there was a nested-name-specifier, then there *must* be an
19707 identifier. */
19709 {
19711 /* Although the grammar says `identifier', it really means
19712 `class-name' or `template-name'. You are only allowed to
19713 define a class that has already been declared with this
19714 syntax.
19716 The proposed resolution for Core Issue 180 says that wherever
19717 you see `class T::X' you should treat `X' as a type-name.
19719 It is OK to define an inaccessible class; for example:
19721 class A { class B; };
19722 class A::B {};
19724 We do not know if we will see a class-name, or a
19725 template-name. We look for a class-name first, in case the
19726 class-name is a template-id; if we looked for the
19727 template-name first we would stop after the template-name. */
19732 class_type,
19736 /* If that didn't work, ignore the nested-name-specifier. */
19738 {
19744 }
19745 /* If we could not find a corresponding TYPE, treat this
19746 declaration like an unqualified declaration. */
19749 /* Otherwise, count the number of templates used in TYPE and its
19750 containing scopes. */
19751 else
19752 {
19753 tree scope;
19765 }
19766 }
19767 /* Otherwise, the identifier is optional. */
19768 else
19769 {
19770 /* We don't know whether what comes next is a template-id,
19771 an identifier, or nothing at all. */
19773 /* Check for a template-id. */
19778 class_key,
19780 /* If that didn't work, it could still be an identifier. */
19782 {
19784 {
19787 }
19788 else
19790 }
19791 else
19792 {
19795 }
19796 }
19801 {
19803 class_key,
19805 }
19808 /* If it's not a `:' or a `{' then we can't really be looking at a
19809 class-head, since a class-head only appears as part of a
19810 class-specifier. We have to detect this situation before calling
19811 xref_tag, since that has irreversible side-effects. */
19813 {
19817 }
19819 /* At this point, we're going ahead with the class-specifier, even
19820 if some other problem occurs. */
19823 {
19828 }
19829 /* Issue the error about the overly-qualified name now. */
19831 {
19836 }
19838 {
19843 }
19845 {
19846 tree scope;
19848 /* Reject typedef-names in class heads. */
19850 {
19853 type);
19856 }
19858 /* Figure out in what scope the declaration is being placed. */
19860 /* If that scope does not contain the scope in which the
19861 class was originally declared, the program is invalid. */
19863 {
19866 "declaration of %qD in namespace %qD which does not "
19869 else
19875 }
19876 /* [dcl.meaning]
19878 A declarator-id shall not be qualified except for the
19879 definition of a ... nested class outside of its class
19880 ... [or] the definition or explicit instantiation of a
19881 class member of a namespace outside of its namespace. */
19883 {
19888 }
19889 }
19890 /* An explicit-specialization must be preceded by "template <>". If
19891 it is not, try to recover gracefully. */
19895 {
19899 /* Take the same action that would have been taken by
19900 cp_parser_explicit_specialization. */
19903 }
19904 /* There must be no "return" statements between this point and the
19905 end of this function; set "type "to the correct return value and
19906 use "goto done;" to return. */
19907 /* Make sure that the right number of template parameters were
19908 present. */
19912 {
19913 /* If something went wrong, there is no point in even trying to
19914 process the class-definition. */
19917 }
19919 /* Look up the type. */
19921 {
19925 {
19929 }
19930 else
19931 {
19934 }
19937 }
19939 {
19940 tree class_type;
19942 /* Given:
19944 template <typename T> struct S { struct T };
19945 template <typename T> struct S<T>::T { };
19947 we will get a TYPENAME_TYPE when processing the definition of
19948 `S::T'. We need to resolve it to the actual type before we
19949 try to define it. */
19951 {
19956 else
19957 {
19960 }
19961 }
19965 {
19968 }
19971 /* Enter the scope indicated by the nested-name-specifier. */
19973 /* Get the canonical version of this type. */
19977 {
19980 {
19983 }
19984 }
19988 }
19990 {
19991 /* If the class was unnamed, create a dummy name. */
19996 }
19998 /* Indicate whether this class was declared as a `class' or as a
19999 `struct'. */
20004 /* If this type was already complete, and we see another definition,
20005 that's an error. */
20007 {
20009 type);
20011 type);
20014 }
20019 {
20020 /* Apply attributes now, before any use of the class as a template
20021 argument in its base list. */
20024 }
20026 /* We will have entered the scope containing the class; the names of
20027 base classes should be looked up in that context. For example:
20029 struct A { struct B {}; struct C; };
20030 struct A::C : B {};
20032 is valid. */
20034 /* Get the list of base-classes, if there is one. */
20037 else
20040 /* If we're really defining a class, process the base classes.
20041 If they're invalid, fail. */
20046 done:
20047 /* Leave the scope given by the nested-name-specifier. We will
20048 enter the class scope itself while processing the members. */
20053 {
20056 }
20062 out:
20065 }
20067 /* Parse a class-key.
20069 class-key:
20070 class
20071 struct
20072 union
20074 Returns the kind of class-key specified, or none_type to indicate
20075 error. */
20077 static enum tag_types
20079 {
20083 /* Look for the class-key. */
20088 /* Check to see if the TOKEN is a class-key. */
20093 }
20095 /* Parse an (optional) member-specification.
20097 member-specification:
20098 member-declaration member-specification [opt]
20099 access-specifier : member-specification [opt] */
20101 static void
20103 {
20105 {
20109 /* Peek at the next token. */
20111 /* If it's a `}', or EOF then we've seen all the members. */
20117 /* See if this token is a keyword. */
20120 {
20124 /* Consume the access-specifier. */
20126 /* Remember which access-specifier is active. */
20128 /* Look for the `:'. */
20133 /* Accept #pragmas at class scope. */
20135 {
20138 }
20140 /* Otherwise, the next construction must be a
20141 member-declaration. */
20143 }
20144 }
20145 }
20147 /* Parse a member-declaration.
20149 member-declaration:
20150 decl-specifier-seq [opt] member-declarator-list [opt] ;
20151 function-definition ; [opt]
20152 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20153 using-declaration
20154 template-declaration
20155 alias-declaration
20157 member-declarator-list:
20158 member-declarator
20159 member-declarator-list , member-declarator
20161 member-declarator:
20162 declarator pure-specifier [opt]
20163 declarator constant-initializer [opt]
20164 identifier [opt] : constant-expression
20166 GNU Extensions:
20168 member-declaration:
20169 __extension__ member-declaration
20171 member-declarator:
20172 declarator attributes [opt] pure-specifier [opt]
20173 declarator attributes [opt] constant-initializer [opt]
20174 identifier [opt] attributes [opt] : constant-expression
20176 C++0x Extensions:
20178 member-declaration:
20179 static_assert-declaration */
20181 static void
20183 {
20184 cp_decl_specifier_seq decl_specifiers;
20185 tree prefix_attributes;
20186 tree decl;
20195 /* Check for the `__extension__' keyword. */
20197 {
20198 /* Recurse. */
20200 /* Restore the old value of the PEDANTIC flag. */
20204 }
20206 /* Check for a template-declaration. */
20208 {
20209 /* An explicit specialization here is an error condition, and we
20210 expect the specialization handler to detect and report this. */
20214 else
20218 }
20220 /* Check for a using-declaration. */
20222 {
20224 {
20225 /* Parse the using-declaration. */
20229 }
20230 else
20231 {
20232 tree decl;
20236 /* Note that if we actually see the '=' token after the
20237 identifier, cp_parser_alias_declaration commits the
20238 tentative parse. In that case, we really expects an
20239 alias-declaration. Otherwise, we expect a using
20240 declaration. */
20241 alias_decl_expected =
20247 else
20251 }
20252 }
20254 /* Check for @defs. */
20256 {
20261 {
20266 }
20268 }
20270 /* If the next token is `static_assert' we have a static assertion. */
20272 {
20275 }
20282 /* Parse the decl-specifier-seq. */
20285 CP_PARSER_FLAGS_OPTIONAL,
20288 /* Check for an invalid type-name. */
20292 /* If there is no declarator, then the decl-specifier-seq should
20293 specify a type. */
20295 {
20296 /* If there was no decl-specifier-seq, and the next token is a
20297 `;', then we have something like:
20299 struct S { ; };
20301 [class.mem]
20303 Each member-declaration shall declare at least one member
20304 name of the class. */
20306 {
20310 }
20311 else
20312 {
20313 tree type;
20315 /* See if this declaration is a friend. */
20317 /* If there were decl-specifiers, check to see if there was
20318 a class-declaration. */
20321 /* Nested classes have already been added to the class, but
20322 a `friend' needs to be explicitly registered. */
20324 {
20325 /* If the `friend' keyword was present, the friend must
20326 be introduced with a class-key. */
20329 "in C++03 a class-key must be used "
20331 /* In this case:
20333 template <typename T> struct A {
20334 friend struct A<T>::B;
20335 };
20337 A<T>::B will be represented by a TYPENAME_TYPE, and
20338 therefore not recognized by check_tag_decl. */
20340 {
20344 }
20347 "friend declaration does not name a class or "
20349 else
20352 }
20353 /* If there is no TYPE, an error message will already have
20354 been issued. */
20356 ;
20357 /* An anonymous aggregate has to be handled specially; such
20358 a declaration really declares a data member (with a
20359 particular type), as opposed to a nested class. */
20361 {
20362 /* C++11 9.5/6. */
20365 "a storage class on an anonymous aggregate "
20368 /* Remove constructors and such from TYPE, now that we
20369 know it is an anonymous aggregate. */
20371 /* And make the corresponding data member. */
20374 /* Add it to the class. */
20376 }
20377 else
20378 cp_parser_check_access_in_redeclaration
20381 }
20382 }
20383 else
20384 {
20387 /* Clear attributes from the decl_specifiers but keep them
20388 around as prefix attributes that apply them to the entity
20389 being declared. */
20393 /* See if these declarations will be friends. */
20396 /* Keep going until we hit the `;' at the end of the
20397 declaration. */
20399 {
20401 tree first_attribute;
20403 /* Peek at the next token. */
20406 /* Check for a bitfield declaration. */
20411 {
20412 tree identifier;
20413 tree width;
20415 /* Get the name of the bitfield. Note that we cannot just
20416 check TOKEN here because it may have been invalidated by
20417 the call to cp_lexer_peek_nth_token above. */
20420 else
20423 /* Consume the `:' token. */
20425 /* Get the width of the bitfield. */
20426 width
20429 NULL);
20431 /* Look for attributes that apply to the bitfield. */
20433 /* Remember which attributes are prefix attributes and
20434 which are not. */
20436 /* Combine the attributes. */
20439 /* Create the bitfield declaration. */
20442 identifier,
20443 sfk_none)
20446 width,
20447 attributes);
20448 }
20449 else
20450 {
20452 tree initializer;
20453 tree asm_specification;
20456 /* Parse the declarator. */
20457 declarator
20463 /* If something went wrong parsing the declarator, make sure
20464 that we at least consume some tokens. */
20466 {
20467 /* Skip to the end of the statement. */
20469 /* If the next token is not a semicolon, that is
20470 probably because we just skipped over the body of
20471 a function. So, we consume a semicolon if
20472 present, but do not issue an error message if it
20473 is not present. */
20475 CPP_SEMICOLON))
20478 }
20481 cp_parser_check_for_definition_in_return_type
20485 /* Look for an asm-specification. */
20487 /* Look for attributes that apply to the declaration. */
20489 /* Remember which attributes are prefix attributes and
20490 which are not. */
20492 /* Combine the attributes. */
20495 /* If it's an `=', then we have a constant-initializer or a
20496 pure-specifier. It is not correct to parse the
20497 initializer before registering the member declaration
20498 since the member declaration should be in scope while
20499 its initializer is processed. However, the rest of the
20500 front end does not yet provide an interface that allows
20501 us to handle this correctly. */
20503 {
20504 /* In [class.mem]:
20506 A pure-specifier shall be used only in the declaration of
20507 a virtual function.
20509 A member-declarator can contain a constant-initializer
20510 only if it declares a static member of integral or
20511 enumeration type.
20513 Therefore, if the DECLARATOR is for a function, we look
20514 for a pure-specifier; otherwise, we look for a
20515 constant-initializer. When we call `grokfield', it will
20516 perform more stringent semantics checks. */
20528 {
20530 /* Don't require a constant rvalue in C++11, since we
20531 might want a reference constant. We'll enforce
20532 constancy later. */
20534 /* Parse the initializer. */
20537 }
20538 else
20539 /* Parse the initializer. */
20541 }
20544 {
20548 else
20550 }
20551 /* Otherwise, there is no initializer. */
20552 else
20555 // If we're looking at a member function declaration, then a
20556 // requires clause may follow the declaration.
20559 {
20560 // Because this is a non-template member, there are no
20561 // template requirements to conjoin.
20564 }
20566 /* See if we are probably looking at a function
20567 definition. We are certainly not looking at a
20568 member-declarator. Calling `grokfield' has
20569 side-effects, so we must not do it unless we are sure
20570 that we are looking at a member-declarator. */
20573 {
20574 /* The grammar does not allow a pure-specifier to be
20575 used when a member function is defined. (It is
20576 possible that this fact is an oversight in the
20577 standard, since a pure function may be defined
20578 outside of the class-specifier. */
20584 declarator,
20585 attributes);
20586 /* If the member was not a friend, declare it here. */
20588 {
20592 }
20597 /* Peek at the next token. */
20599 /* If the next token is a semicolon, consume it. */
20603 // Restore the current template requirements.
20607 }
20608 else
20611 /* Create the declaration. */
20618 // Restore the current template requirments.
20620 }
20624 /* Reset PREFIX_ATTRIBUTES. */
20630 /* If there is any qualification still in effect, clear it
20631 now; we will be starting fresh with the next declarator. */
20635 /* If it's a `,', then there are more declarators. */
20637 {
20640 {
20644 }
20645 }
20646 /* If the next token isn't a `;', then we have a parse error. */
20648 CPP_SEMICOLON))
20649 {
20650 /* The next token might be a ways away from where the
20651 actual semicolon is missing. Find the previous token
20652 and use that for our error position. */
20657 /* Assume that the user meant to provide a semicolon. If
20658 we were to cp_parser_skip_to_end_of_statement, we might
20659 skip to a semicolon inside a member function definition
20660 and issue nonsensical error messages. */
20662 }
20665 {
20666 /* Add DECL to the list of members. */
20675 /* Add DECL to the queue of NSDMI to be parsed later. */
20677 }
20681 }
20682 }
20685 out:
20687 }
20689 /* Parse a pure-specifier.
20691 pure-specifier:
20692 = 0
20694 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20695 Otherwise, ERROR_MARK_NODE is returned. */
20697 static tree
20699 {
20702 /* Look for the `=' token. */
20705 /* Look for the `0' token. */
20714 /* Accept = default or = delete in c++0x mode. */
20717 {
20720 }
20722 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20724 {
20729 }
20731 {
20734 }
20737 }
20739 /* Parse a constant-initializer.
20741 constant-initializer:
20742 = constant-expression
20744 Returns a representation of the constant-expression. */
20746 static tree
20748 {
20749 /* Look for the `=' token. */
20753 /* It is invalid to write:
20755 struct S { static const int i = { 7 }; };
20757 */
20759 {
20762 /* Consume the opening brace. */
20764 /* Skip the initializer. */
20766 /* Look for the trailing `}'. */
20770 }
20774 NULL);
20775 }
20777 /* Derived classes [gram.class.derived] */
20779 /* Parse a base-clause.
20781 base-clause:
20782 : base-specifier-list
20784 base-specifier-list:
20785 base-specifier ... [opt]
20786 base-specifier-list , base-specifier ... [opt]
20788 Returns a TREE_LIST representing the base-classes, in the order in
20789 which they were declared. The representation of each node is as
20790 described by cp_parser_base_specifier.
20792 In the case that no bases are specified, this function will return
20793 NULL_TREE, not ERROR_MARK_NODE. */
20795 static tree
20797 {
20800 /* Look for the `:' that begins the list. */
20803 /* Scan the base-specifier-list. */
20805 {
20807 tree base;
20810 /* Look for the base-specifier. */
20812 /* Look for the (optional) ellipsis. */
20814 {
20815 /* Consume the `...'. */
20819 }
20821 /* Add BASE to the front of the list. */
20823 {
20825 /* Make this a pack expansion type. */
20829 {
20832 }
20833 }
20834 /* Peek at the next token. */
20836 /* If it's not a comma, then the list is complete. */
20839 /* Consume the `,'. */
20841 }
20843 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20844 base class had a qualified name. However, the next name that
20845 appears is certainly not qualified. */
20851 }
20853 /* Parse a base-specifier.
20855 base-specifier:
20856 :: [opt] nested-name-specifier [opt] class-name
20857 virtual access-specifier [opt] :: [opt] nested-name-specifier
20858 [opt] class-name
20859 access-specifier virtual [opt] :: [opt] nested-name-specifier
20860 [opt] class-name
20862 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20863 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20864 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20865 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20867 static tree
20869 {
20877 tree type;
20879 /* Process the optional `virtual' and `access-specifier'. */
20881 {
20882 /* Peek at the next token. */
20884 /* Process `virtual'. */
20886 {
20888 /* If `virtual' appears more than once, issue an error. */
20890 {
20894 }
20898 /* Consume the `virtual' token. */
20906 /* If more than one access specifier appears, issue an
20907 error. */
20910 {
20914 }
20918 /* Consume the access-specifier. */
20926 }
20927 }
20928 /* It is not uncommon to see programs mechanically, erroneously, use
20929 the 'typename' keyword to denote (dependent) qualified types
20930 as base classes. */
20932 {
20937 else
20939 "keyword %<typename%> not allowed in this context "
20942 }
20944 /* Look for the optional `::' operator. */
20946 /* Look for the nested-name-specifier. The simplest way to
20947 implement:
20949 [temp.res]
20951 The keyword `typename' is not permitted in a base-specifier or
20952 mem-initializer; in these contexts a qualified name that
20953 depends on a template-parameter is implicitly assumed to be a
20954 type name.
20956 is to pretend that we have seen the `typename' keyword at this
20957 point. */
20961 typename_type,
20963 /* If the base class is given by a qualified name, assume that names
20964 we see are type names or templates, as appropriate. */
20970 /* DR 950 allows decltype as a base-specifier. */
20972 else
20973 {
20974 /* Otherwise, look for the class-name. */
20976 class_scope_p,
20977 template_p,
20978 typename_type,
20983 }
20989 }
20991 /* Exception handling [gram.exception] */
20993 /* Parse an (optional) noexcept-specification.
20995 noexcept-specification:
20996 noexcept ( constant-expression ) [opt]
20998 If no noexcept-specification is present, returns NULL_TREE.
20999 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21000 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21001 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21002 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21003 in which case a boolean condition is returned instead. */
21005 static tree
21010 {
21014 /* Peek at the next token. */
21017 /* Is it a noexcept-specification? */
21019 {
21020 tree expr;
21024 {
21028 {
21029 /* Types may not be defined in an exception-specification. */
21031 parser->type_definition_forbidden_message
21036 /* Restore the saved message. */
21038 }
21039 else
21040 {
21043 }
21046 }
21047 else
21048 {
21052 }
21054 /* We cannot build a noexcept-spec right away because this will check
21055 that expr is a constexpr. */
21058 else
21060 }
21061 else
21063 }
21065 /* Parse an (optional) exception-specification.
21067 exception-specification:
21068 throw ( type-id-list [opt] )
21070 Returns a TREE_LIST representing the exception-specification. The
21071 TREE_VALUE of each node is a type. */
21073 static tree
21075 {
21077 tree type_id_list;
21080 /* Peek at the next token. */
21083 /* Is it a noexcept-specification? */
21089 /* If it's not `throw', then there's no exception-specification. */
21093 #if 0
21094 /* Enable this once a lot of code has transitioned to noexcept? */
21098 #endif
21100 /* Consume the `throw'. */
21103 /* Look for the `('. */
21106 /* Peek at the next token. */
21108 /* If it's not a `)', then there is a type-id-list. */
21110 {
21111 /* Types may not be defined in an exception-specification. */
21113 parser->type_definition_forbidden_message
21115 /* Parse the type-id-list. */
21117 /* Restore the saved message. */
21119 }
21120 else
21123 /* Look for the `)'. */
21127 }
21129 /* Parse an (optional) type-id-list.
21131 type-id-list:
21132 type-id ... [opt]
21133 type-id-list , type-id ... [opt]
21135 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21136 in the order that the types were presented. */
21138 static tree
21140 {
21144 {
21146 tree type;
21148 /* Get the next type-id. */
21150 /* Parse the optional ellipsis. */
21152 {
21153 /* Consume the `...'. */
21156 /* Turn the type into a pack expansion expression. */
21158 }
21159 /* Add it to the list. */
21161 /* Peek at the next token. */
21163 /* If it is not a `,', we are done. */
21166 /* Consume the `,'. */
21168 }
21171 }
21173 /* Parse a try-block.
21175 try-block:
21176 try compound-statement handler-seq */
21178 static tree
21180 {
21181 tree try_block;
21191 }
21193 /* Parse a function-try-block.
21195 function-try-block:
21196 try ctor-initializer [opt] function-body handler-seq */
21198 static bool
21200 {
21201 tree compound_stmt;
21202 tree try_block;
21205 /* Look for the `try' keyword. */
21208 /* Let the rest of the front end know where we are. */
21210 /* Parse the function-body. */
21211 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21213 /* We're done with the `try' part. */
21215 /* Parse the handlers. */
21217 /* We're done with the handlers. */
21221 }
21223 /* Parse a handler-seq.
21225 handler-seq:
21226 handler handler-seq [opt] */
21228 static void
21230 {
21232 {
21235 /* Parse the handler. */
21237 /* Peek at the next token. */
21239 /* If it's not `catch' then there are no more handlers. */
21242 }
21243 }
21245 /* Parse a handler.
21247 handler:
21248 catch ( exception-declaration ) compound-statement */
21250 static void
21252 {
21253 tree handler;
21254 tree declaration;
21264 }
21266 /* Parse an exception-declaration.
21268 exception-declaration:
21269 type-specifier-seq declarator
21270 type-specifier-seq abstract-declarator
21271 type-specifier-seq
21272 ...
21274 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21275 ellipsis variant is used. */
21277 static tree
21279 {
21280 cp_decl_specifier_seq type_specifiers;
21284 /* If it's an ellipsis, it's easy to handle. */
21286 {
21287 /* Consume the `...' token. */
21290 }
21292 /* Types may not be defined in exception-declarations. */
21294 parser->type_definition_forbidden_message
21297 /* Parse the type-specifier-seq. */
21301 /* If it's a `)', then there is no declarator. */
21304 else
21310 /* Restore the saved message. */
21317 }
21319 /* Parse a throw-expression.
21321 throw-expression:
21322 throw assignment-expression [opt]
21324 Returns a THROW_EXPR representing the throw-expression. */
21326 static tree
21328 {
21329 tree expression;
21334 /* Figure out whether or not there is an assignment-expression
21335 following the "throw" keyword. */
21343 else
21348 }
21350 /* GNU Extensions */
21352 /* Parse an (optional) asm-specification.
21354 asm-specification:
21355 asm ( string-literal )
21357 If the asm-specification is present, returns a STRING_CST
21358 corresponding to the string-literal. Otherwise, returns
21359 NULL_TREE. */
21361 static tree
21363 {
21365 tree asm_specification;
21367 /* Peek at the next token. */
21369 /* If the next token isn't the `asm' keyword, then there's no
21370 asm-specification. */
21374 /* Consume the `asm' token. */
21376 /* Look for the `('. */
21379 /* Look for the string-literal. */
21382 /* Look for the `)'. */
21386 }
21388 /* Parse an asm-operand-list.
21390 asm-operand-list:
21391 asm-operand
21392 asm-operand-list , asm-operand
21394 asm-operand:
21395 string-literal ( expression )
21396 [ string-literal ] string-literal ( expression )
21398 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21399 each node is the expression. The TREE_PURPOSE is itself a
21400 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21401 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21402 is a STRING_CST for the string literal before the parenthesis. Returns
21403 ERROR_MARK_NODE if any of the operands are invalid. */
21405 static tree
21407 {
21412 {
21413 tree string_literal;
21414 tree expression;
21415 tree name;
21418 {
21419 /* Consume the `[' token. */
21421 /* Read the operand name. */
21426 /* Look for the closing `]'. */
21428 }
21429 else
21431 /* Look for the string-literal. */
21434 /* Look for the `('. */
21436 /* Parse the expression. */
21438 /* Look for the `)'. */
21446 /* Add this operand to the list. */
21448 expression,
21449 asm_operands);
21450 /* If the next token is not a `,', there are no more
21451 operands. */
21454 /* Consume the `,'. */
21456 }
21459 }
21461 /* Parse an asm-clobber-list.
21463 asm-clobber-list:
21464 string-literal
21465 asm-clobber-list , string-literal
21467 Returns a TREE_LIST, indicating the clobbers in the order that they
21468 appeared. The TREE_VALUE of each node is a STRING_CST. */
21470 static tree
21472 {
21476 {
21477 tree string_literal;
21479 /* Look for the string literal. */
21481 /* Add it to the list. */
21483 /* If the next token is not a `,', then the list is
21484 complete. */
21487 /* Consume the `,' token. */
21489 }
21492 }
21494 /* Parse an asm-label-list.
21496 asm-label-list:
21497 identifier
21498 asm-label-list , identifier
21500 Returns a TREE_LIST, indicating the labels in the order that they
21501 appeared. The TREE_VALUE of each node is a label. */
21503 static tree
21505 {
21509 {
21512 /* Look for the identifier. */
21515 {
21518 {
21524 }
21525 }
21526 /* If the next token is not a `,', then the list is
21527 complete. */
21530 /* Consume the `,' token. */
21532 }
21535 }
21537 /* Return TRUE iff the next tokens in the stream are possibly the
21538 beginning of a GNU extension attribute. */
21540 static bool
21542 {
21544 }
21546 /* Return TRUE iff the next tokens in the stream are possibly the
21547 beginning of a standard C++-11 attribute specifier. */
21549 static bool
21551 {
21553 }
21555 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21556 beginning of a standard C++-11 attribute specifier. */
21558 static bool
21560 {
21568 }
21570 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21571 beginning of a GNU extension attribute. */
21573 static bool
21575 {
21579 }
21581 /* Return true iff the next tokens can be the beginning of either a
21582 GNU attribute list, or a standard C++11 attribute sequence. */
21584 static bool
21586 {
21589 }
21591 /* Return true iff the next Nth tokens can be the beginning of either
21592 a GNU attribute list, or a standard C++11 attribute sequence. */
21594 static bool
21596 {
21599 }
21601 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21602 of GNU attributes, or return NULL. */
21604 static tree
21606 {
21610 }
21612 /* Parse an (optional) series of attributes.
21614 attributes:
21615 attributes attribute
21617 attribute:
21618 __attribute__ (( attribute-list [opt] ))
21620 The return value is as for cp_parser_gnu_attribute_list. */
21622 static tree
21624 {
21628 {
21630 tree attribute_list;
21633 /* Peek at the next token. */
21635 /* If it's not `__attribute__', then we're done. */
21639 /* Consume the `__attribute__' keyword. */
21641 /* Look for the two `(' tokens. */
21645 /* Peek at the next token. */
21648 /* Parse the attribute-list. */
21650 else
21651 /* If the next token is a `)', then there is no attribute
21652 list. */
21655 /* Look for the two `)' tokens. */
21663 /* Add these new attributes to the list. */
21665 }
21668 }
21670 /* Parse a GNU attribute-list.
21672 attribute-list:
21673 attribute
21674 attribute-list , attribute
21676 attribute:
21677 identifier
21678 identifier ( identifier )
21679 identifier ( identifier , expression-list )
21680 identifier ( expression-list )
21682 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21683 to an attribute. The TREE_PURPOSE of each node is the identifier
21684 indicating which attribute is in use. The TREE_VALUE represents
21685 the arguments, if any. */
21687 static tree
21689 {
21695 {
21697 tree identifier;
21698 tree attribute;
21700 /* Look for the identifier. We also allow keywords here; for
21701 example `__attribute__ ((const))' is legal. */
21705 {
21708 /* Consume the token. */
21711 /* Save away the identifier that indicates which attribute
21712 this is. */
21714 /* For keywords, use the canonical spelling, not the
21715 parsed identifier. */
21721 /* Peek at the next token. */
21723 /* If it's an `(', then parse the attribute arguments. */
21725 {
21729 vec = cp_parser_parenthesized_expression_list
21735 else
21736 {
21739 }
21740 /* Save the arguments away. */
21742 }
21745 {
21746 /* Add this attribute to the list. */
21749 }
21752 }
21753 /* Now, look for more attributes. If the next token isn't a
21754 `,', we're done. */
21758 /* Consume the comma and keep going. */
21760 }
21763 /* We built up the list in reverse order. */
21765 }
21767 /* Parse a standard C++11 attribute.
21769 The returned representation is a TREE_LIST which TREE_PURPOSE is
21770 the scoped name of the attribute, and the TREE_VALUE is its
21771 arguments list.
21773 Note that the scoped name of the attribute is itself a TREE_LIST
21774 which TREE_PURPOSE is the namespace of the attribute, and
21775 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21776 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21777 and which TREE_PURPOSE is directly the attribute name.
21779 Clients of the attribute code should use get_attribute_namespace
21780 and get_attribute_name to get the actual namespace and name of
21781 attributes, regardless of their being GNU or C++11 attributes.
21783 attribute:
21784 attribute-token attribute-argument-clause [opt]
21786 attribute-token:
21787 identifier
21788 attribute-scoped-token
21790 attribute-scoped-token:
21791 attribute-namespace :: identifier
21793 attribute-namespace:
21794 identifier
21796 attribute-argument-clause:
21797 ( balanced-token-seq )
21799 balanced-token-seq:
21800 balanced-token [opt]
21801 balanced-token-seq balanced-token
21803 balanced-token:
21804 ( balanced-token-seq )
21805 [ balanced-token-seq ]
21806 { balanced-token-seq }. */
21808 static tree
21810 {
21814 /* First, parse name of the the attribute, a.k.a
21815 attribute-token. */
21832 {
21833 /* We are seeing a scoped attribute token. */
21843 else
21844 {
21848 }
21850 NULL_TREE);
21852 }
21853 else
21854 {
21856 NULL_TREE);
21857 /* C++11 noreturn attribute is equivalent to GNU's. */
21860 /* C++14 deprecated attribute is equivalent to GNU's. */
21863 }
21865 /* Now parse the optional argument clause of the attribute. */
21870 {
21876 /* A GNU attribute that takes an identifier in parameter. */
21879 vec = cp_parser_parenthesized_expression_list
21885 else
21886 {
21889 }
21893 else
21895 }
21898 }
21900 /* Parse a list of standard C++-11 attributes.
21902 attribute-list:
21903 attribute [opt]
21904 attribute-list , attribute[opt]
21905 attribute ...
21906 attribute-list , attribute ...
21907 */
21909 static tree
21911 {
21916 {
21921 {
21924 }
21929 }
21932 }
21934 /* Parse a standard C++-11 attribute specifier.
21936 attribute-specifier:
21937 [ [ attribute-list ] ]
21938 alignment-specifier
21940 alignment-specifier:
21941 alignas ( type-id ... [opt] )
21942 alignas ( alignment-expression ... [opt] ). */
21944 static tree
21946 {
21952 {
21961 else
21962 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21963 when we are sure that we have actually parsed them. */
21965 }
21966 else
21967 {
21968 tree alignas_expr;
21970 /* Look for an alignment-specifier. */
21982 {
21985 }
21991 {
21995 alignas_expr =
22003 }
22006 {
22009 }
22013 /* Build the C++-11 representation of an 'aligned'
22014 attribute. */
22015 attributes =
22019 }
22022 }
22024 /* Parse a standard C++-11 attribute-specifier-seq.
22026 attribute-specifier-seq:
22027 attribute-specifier-seq [opt] attribute-specifier
22028 */
22030 static tree
22032 {
22036 {
22045 }
22049 }
22051 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22052 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22053 current value of the PEDANTIC flag, regardless of whether or not
22054 the `__extension__' keyword is present. The caller is responsible
22055 for restoring the value of the PEDANTIC flag. */
22057 static bool
22059 {
22060 /* Save the old value of the PEDANTIC flag. */
22064 {
22065 /* Consume the `__extension__' token. */
22067 /* We're not being pedantic while the `__extension__' keyword is
22068 in effect. */
22072 }
22075 }
22077 /* Parse a label declaration.
22079 label-declaration:
22080 __label__ label-declarator-seq ;
22082 label-declarator-seq:
22083 identifier , label-declarator-seq
22084 identifier */
22086 static void
22088 {
22089 /* Look for the `__label__' keyword. */
22093 {
22094 tree identifier;
22096 /* Look for an identifier. */
22098 /* If we failed, stop. */
22101 /* Declare it as a label. */
22103 /* If the next token is a `;', stop. */
22106 /* Look for the `,' separating the label declarations. */
22108 }
22110 /* Look for the final `;'. */
22112 }
22114 // -------------------------------------------------------------------------- //
22115 // Requires Clause
22117 // Parse a requires clause.
22118 //
22119 // requires-clause:
22120 // 'requires' logical-or-expression
22121 //
22122 // The required logical-or-expression must be a constant expression.
22123 static tree
22125 {
22126 // Parse the constant expression.
22127 tree expr =
22132 }
22134 // Optionally parse a requires clause:
22135 //
22136 // requires-clause:
22137 // 'requires' logical-or-expression
22138 //
22139 // The required logical-or-expression must be a constant expression.
22140 static tree
22142 {
22147 }
22150 // -------------------------------------------------------------------------- //
22151 // Requires Expression
22154 // An RAII helper that provides scoped control for entering and exiting
22155 // the local scope defined by a requires expression. Name bindings introduced
22156 // within the scope are popped prior to exiting the scope.
22157 struct cp_parser_requires_expr_scope
22158 {
22159 // Enter a scope of kind K belonging to the decl D.
22161 {
22163 }
22166 {
22170 }
22171 };
22173 // Parse a requires expression
22174 //
22175 // requirement-expression:
22176 // 'requires' requirement-parameter-list requirement-body
22177 static tree
22179 {
22183 // TODO: Earlier versions of the concepts lite spec did not allow
22184 // requires expressions outside of template declarations. That
22185 // restriction was relaxed in Chicago, but it has not been implemented.
22187 {
22191 }
22194 // TODO: Check that requires expressions are only written inside of
22195 // template declarations. They don't need to be concepts, just templates.
22197 // Parse the optional parameter list. Any local parameter declarations
22198 // are added to a new scope and are visible within the nested
22199 // requirement list.
22200 cp_parser_requires_expr_scope guard;
22205 // Parse the requirement body.
22211 }
22213 // Parse a parameterized requirement.
22214 //
22215 // requirement-parameter-list:
22216 // '(' parameter-declaration-clause ')'
22217 static tree
22219 {
22223 // Parse the nested parameter declaration clause.
22232 }
22234 // Parse the body of a requirement.
22235 //
22236 // requirement-body:
22237 // '{' requirement-list '}'
22238 static tree
22240 {
22250 }
22252 // Parse a list of requirements.
22253 //
22254 // requirement-list:
22255 // requirement
22256 // requirement-list ';' requirement[opt]
22257 static tree
22259 {
22262 {
22269 // If we see a semi-colon, consume it.
22273 // If we've found the end of the list, stop processing
22274 // the list.
22277 }
22279 // Reverse the order of requirements so they are analyzed in
22280 // declaration order.
22282 }
22284 // Parse a syntactic requirement or type requirement.
22285 //
22286 // requirement:
22287 // simple-requirement
22288 // compound-requirement
22289 // type-requirement
22290 // nested-requirement
22291 static tree
22293 {
22300 // Try parsing a type requirement first.
22306 }
22308 // Parse a nested requirement. This is the same as a requires clause.
22309 //
22310 // nested-requirement:
22311 // requires-clause
22312 static tree
22314 {
22320 }
22322 // Parse a simple requirement.
22323 //
22324 // simple-requirement:
22325 // expression
22326 static tree
22328 {
22333 }
22335 // Parse a compound requirement
22336 //
22337 // compound-requirement:
22338 // '{' expression '}' trailing-constraint-specifiers
22339 //
22340 // trailing-constraint-specifiers:
22341 // constraint-specifiers-seq[opt] result-type-requirement[opt]
22342 //
22343 // result-type-requirement:
22344 // '->' type-id
22345 static tree
22347 {
22348 // Parse an expression enclosed in '{ }'s.
22359 // Parse trailing expression specifiers.
22362 // Parse the optional trailing type requirement.
22365 {
22370 }
22373 }
22375 // Parse a type requirement
22376 //
22377 // type-requirement
22378 // type-id
22379 static tree
22381 {
22382 // Try parsing the type-id
22387 // It can only be a type requirement if nothing comes after it.
22388 // For example, this:
22389 //
22390 // typename T::value_type x = a;
22391 //
22392 // Is not a type requirement even though it stars with a type-id.
22397 }
22399 // Parse an optional constexpr specifier in a constraint expression.
22400 static tree
22402 {
22405 }
22407 // Parse an optional noexcept specifier in a constraint expression.
22408 static tree
22410 {
22413 }
22415 static tree
22417 {
22423 }
22425 // Parse an optional expression specifier sequence.
22426 //
22427 // constraint-specifier-sequence:
22428 // constexpr [opt] noexcept [opt]
22429 static tree
22431 {
22434 {
22435 // If we can parse a constraint specifier, insert it into
22436 // the list of requirements.
22438 {
22441 }
22443 }
22445 }
22447 /* Support Functions */
22449 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22450 NAME should have one of the representations used for an
22451 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22452 is returned. If PARSER->SCOPE is a dependent type, then a
22453 SCOPE_REF is returned.
22455 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22456 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22457 was formed. Abstractly, such entities should not be passed to this
22458 function, because they do not need to be looked up, but it is
22459 simpler to check for this special case here, rather than at the
22460 call-sites.
22462 In cases not explicitly covered above, this function returns a
22463 DECL, OVERLOAD, or baselink representing the result of the lookup.
22464 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22465 is returned.
22467 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22468 (e.g., "struct") that was used. In that case bindings that do not
22469 refer to types are ignored.
22471 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22472 ignored.
22474 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22475 are ignored.
22477 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22478 types.
22480 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22481 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22482 NULL_TREE otherwise. */
22484 static tree
22491 location_t name_location)
22492 {
22493 tree decl;
22496 /* Assume that the lookup will be unambiguous. */
22500 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22501 no longer valid. Note that if we are parsing tentatively, and
22502 the parse fails, OBJECT_TYPE will be automatically restored. */
22508 /* A template-id has already been resolved; there is no lookup to
22509 do. */
22513 {
22517 }
22519 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22520 it should already have been checked to make sure that the name
22521 used matches the type being destroyed. */
22523 {
22524 tree type;
22526 /* Figure out to which type this destructor applies. */
22531 else
22533 /* If that's not a class type, there is no destructor. */
22540 /* If it was a class type, return the destructor. */
22542 }
22544 /* By this point, the NAME should be an ordinary identifier. If
22545 the id-expression was a qualified name, the qualifying scope is
22546 stored in PARSER->SCOPE at this point. */
22549 /* Perform the lookup. */
22551 {
22557 /* If the SCOPE is dependent, the lookup must be deferred until
22558 the template is instantiated -- unless we are explicitly
22559 looking up names in uninstantiated templates. Even then, we
22560 cannot look up the name if the scope is not a class type; it
22561 might, for example, be a template type parameter. */
22566 /* Defer lookup. */
22568 else
22569 {
22572 /* If PARSER->SCOPE is a dependent type, then it must be a
22573 class type, and we must not be checking dependencies;
22574 otherwise, we would have processed this lookup above. So
22575 that PARSER->SCOPE is not considered a dependent base by
22576 lookup_member, we must enter the scope here. */
22580 /* If the PARSER->SCOPE is a template specialization, it
22581 may be instantiated during name lookup. In that case,
22582 errors may be issued. Even if we rollback the current
22583 tentative parse, those errors are valid. */
22588 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22589 lookup result and the nested-name-specifier nominates a class C:
22590 * if the name specified after the nested-name-specifier, when
22591 looked up in C, is the injected-class-name of C (Clause 9), or
22592 * if the name specified after the nested-name-specifier is the
22593 same as the identifier or the simple-template-id's template-
22594 name in the last component of the nested-name-specifier,
22595 the name is instead considered to name the constructor of
22596 class C. [ Note: for example, the constructor is not an
22597 acceptable lookup result in an elaborated-type-specifier so
22598 the constructor would not be used in place of the
22599 injected-class-name. --end note ] Such a constructor name
22600 shall be used only in the declarator-id of a declaration that
22601 names a constructor or in a using-declaration. */
22609 /* If we have a single function from a using decl, pull it out. */
22616 }
22618 /* If the scope is a dependent type and either we deferred lookup or
22619 we did lookup but didn't find the name, rememeber the name. */
22622 {
22624 {
22625 tree type;
22627 /* The resolution to Core Issue 180 says that `struct
22628 A::B' should be considered a type-name, even if `A'
22629 is dependent. */
22634 }
22638 CPP_CLOSE_PAREN)))
22642 else
22645 is_template);
22646 }
22649 }
22651 {
22652 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22653 OBJECT_TYPE is not a class. */
22655 /* If the OBJECT_TYPE is a template specialization, it may
22656 be instantiated during name lookup. In that case, errors
22657 may be issued. Even if we rollback the current tentative
22658 parse, those errors are valid. */
22660 name,
22663 tf_warning_or_error);
22664 else
22668 /* Look it up in the enclosing context. */
22674 }
22675 else
22676 {
22682 }
22684 /* If the lookup failed, let our caller know. */
22688 /* Pull out the template from an injected-class-name (or multiple). */
22692 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22694 {
22697 /* The error message we have to print is too complicated for
22698 cp_parser_error, so we incorporate its actions directly. */
22700 {
22702 name);
22704 }
22706 }
22714 /* If we have resolved the name of a member declaration, check to
22715 see if the declaration is accessible. When the name resolves to
22716 set of overloaded functions, accessibility is checked when
22717 overload resolution is done.
22719 During an explicit instantiation, access is not checked at all,
22720 as per [temp.explicit]. */
22727 }
22729 /* Like cp_parser_lookup_name, but for use in the typical case where
22730 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22731 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22733 static tree
22735 {
22737 none_type,
22742 location);
22743 }
22745 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22746 the current context, return the TYPE_DECL. If TAG_NAME_P is
22747 true, the DECL indicates the class being defined in a class-head,
22748 or declared in an elaborated-type-specifier.
22750 Otherwise, return DECL. */
22752 static tree
22754 {
22755 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22756 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22758 struct A {
22759 template <typename T> struct B;
22760 };
22762 template <typename T> struct A::B {};
22764 Similarly, in an elaborated-type-specifier:
22766 namespace N { struct X{}; }
22768 struct A {
22769 template <typename T> friend struct N::X;
22770 };
22772 However, if the DECL refers to a class type, and we are in
22773 the scope of the class, then the name lookup automatically
22774 finds the TYPE_DECL created by build_self_reference rather
22775 than a TEMPLATE_DECL. For example, in:
22777 template <class T> struct S {
22778 S s;
22779 };
22781 there is no need to handle such case. */
22787 }
22789 /* If too many, or too few, template-parameter lists apply to the
22790 declarator, issue an error message. Returns TRUE if all went well,
22791 and FALSE otherwise. */
22793 static bool
22796 location_t declarator_location)
22797 {
22799 {
22801 {
22809 /* If the DECLARATOR has the form `X<y>' then it uses one
22810 additional level of template parameters. */
22813 return cp_parser_check_template_parameters
22815 }
22830 }
22832 }
22834 /* NUM_TEMPLATES were used in the current declaration. If that is
22835 invalid, return FALSE and issue an error messages. Otherwise,
22836 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22837 declarator and we can print more accurate diagnostics. */
22839 static bool
22842 location_t location,
22844 {
22845 /* If there are the same number of template classes and parameter
22846 lists, that's OK. */
22849 /* If there are more, but only one more, then we are referring to a
22850 member template. That's OK too. */
22853 /* If there are more template classes than parameter lists, we have
22854 something like:
22856 template <class T> void S<T>::R<T>::f (); */
22858 {
22868 else
22871 }
22872 /* Otherwise, there are too many template parameter lists. We have
22873 something like:
22875 template <class T> template <class U> void S::f(); */
22878 }
22880 /* Parse an optional `::' token indicating that the following name is
22881 from the global namespace. If so, PARSER->SCOPE is set to the
22882 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22883 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22884 Returns the new value of PARSER->SCOPE, if the `::' token is
22885 present, and NULL_TREE otherwise. */
22887 static tree
22889 {
22892 /* Peek at the next token. */
22894 /* If we're looking at a `::' token then we're starting from the
22895 global namespace, not our current location. */
22897 {
22898 /* Consume the `::' token. */
22900 /* Set the SCOPE so that we know where to start the lookup. */
22906 }
22908 {
22912 }
22915 }
22917 /* Returns TRUE if the upcoming token sequence is the start of a
22918 constructor declarator. If FRIEND_P is true, the declarator is
22919 preceded by the `friend' specifier. */
22921 static bool
22923 {
22926 tree nested_name_specifier;
22929 /* The common case is that this is not a constructor declarator, so
22930 try to avoid doing lots of work if at all possible. It's not
22931 valid declare a constructor at function scope. */
22934 /* And only certain tokens can begin a constructor declarator. */
22942 /* Parse tentatively; we are going to roll back all of the tokens
22943 consumed here. */
22945 /* Assume that we are looking at a constructor declarator. */
22948 /* Look for the optional `::' operator. */
22951 /* Look for the nested-name-specifier. */
22952 nested_name_specifier
22963 /* Outside of a class-specifier, there must be a
22964 nested-name-specifier. */
22970 /* If we have a class scope, this is easy; DR 147 says that S::S always
22971 names the constructor, and no other qualified name could. */
22974 {
22984 }
22985 /* If we still think that this might be a constructor-declarator,
22986 look for a class-name. */
22988 {
22989 /* If we have:
22991 template <typename T> struct S {
22992 S();
22993 };
22995 we must recognize that the nested `S' names a class. */
22996 tree type_decl;
23000 none_type,
23004 /* If there was no class-name, then this is not a constructor.
23005 Otherwise, if we are in a class-specifier and we aren't
23006 handling a friend declaration, check that its type matches
23007 current_class_type (c++/38313). Note: error_mark_node
23008 is left alone for error recovery purposes. */
23010 && (outside_class_specifier_p
23015 /* If we're still considering a constructor, we have to see a `(',
23016 to begin the parameter-declaration-clause, followed by either a
23017 `)', an `...', or a decl-specifier. We need to check for a
23018 type-specifier to avoid being fooled into thinking that:
23020 S (f) (int);
23022 is a constructor. (It is actually a function named `f' that
23023 takes one parameter (of type `int') and returns a value of type
23024 `S'. */
23032 /* A parameter declaration begins with a decl-specifier,
23033 which is either the "attribute" keyword, a storage class
23034 specifier, or (usually) a type-specifier. */
23036 {
23037 tree type;
23041 /* Names appearing in the type-specifier should be looked up
23042 in the scope of the class. */
23045 else
23046 {
23049 {
23053 {
23056 }
23057 }
23059 }
23061 /* Inside the constructor parameter list, surrounding
23062 template-parameter-lists do not apply. */
23063 saved_num_template_parameter_lists
23067 /* Look for the type-specifier. */
23069 CP_PARSER_FLAGS_NONE,
23075 parser->num_template_parameter_lists
23078 /* Leave the scope of the class. */
23083 }
23084 }
23086 /* We did not really want to consume any tokens. */
23090 }
23092 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23093 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23094 they must be performed once we are in the scope of the function.
23096 Returns the function defined. */
23098 static tree
23099 cp_parser_function_definition_from_specifiers_and_declarator
23102 tree attributes,
23104 {
23105 tree fn;
23108 /* Begin the function-definition. */
23111 /* The things we're about to see are not directly qualified by any
23112 template headers we've seen thus far. */
23115 /* If there were names looked up in the decl-specifier-seq that we
23116 did not check, check them now. We must wait until we are in the
23117 scope of the function to perform the checks, since the function
23118 might be a friend. */
23122 {
23125 }
23128 {
23129 /* Skip the entire function. */
23132 }
23134 {
23135 /* Seen already, skip it. An error message has already been output. */
23139 /* If this is a function from a class, pop the nested class. */
23142 }
23143 else
23144 {
23145 timevar_id_t tv;
23148 else
23154 }
23157 }
23159 /* Parse the part of a function-definition that follows the
23160 declarator. INLINE_P is TRUE iff this function is an inline
23161 function defined within a class-specifier.
23163 Returns the function defined. */
23165 static tree
23168 {
23169 tree fn;
23175 bool fully_implicit_function_template_p
23178 tree implicit_template_parms
23181 cp_binding_level* implicit_template_scope
23187 /* If the next token is `return', then the code may be trying to
23188 make use of the "named return value" extension that G++ used to
23189 support. */
23192 {
23193 /* Consume the `return' keyword. */
23195 /* Look for the identifier that indicates what value is to be
23196 returned. */
23198 /* Issue an error message. */
23201 /* Skip tokens until we reach the start of the function body. */
23203 {
23210 }
23211 }
23212 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23213 anything declared inside `f'. */
23214 saved_in_unbraced_linkage_specification_p
23217 /* Inside the function, surrounding template-parameter-lists do not
23218 apply. */
23219 saved_num_template_parameter_lists
23225 /* If the next token is `try', `__transaction_atomic', or
23226 `__transaction_relaxed`, then we are looking at either function-try-block
23227 or function-transaction-block. Note that all of these include the
23228 function-body. */
23231 RID_TRANSACTION_ATOMIC);
23233 RID_TRANSACTION_RELAXED))
23235 RID_TRANSACTION_RELAXED);
23238 else
23239 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23244 /* Finish the function. */
23247 /* Generate code for it, if necessary. */
23249 /* Restore the saved values. */
23250 parser->in_unbraced_linkage_specification_p
23252 parser->num_template_parameter_lists
23256 parser->fully_implicit_function_template_p
23258 parser->implicit_template_parms
23260 parser->implicit_template_scope
23267 }
23269 /* Parse a template-declaration, assuming that the `export' (and
23270 `extern') keywords, if present, has already been scanned. MEMBER_P
23271 is as for cp_parser_template_declaration. */
23273 static void
23275 {
23278 tree parameter_list;
23283 /* Look for the `template' keyword. */
23288 /* And the `<'. */
23292 {
23293 /* 14.5.2.2 [temp.mem]
23295 A local class shall not have member templates. */
23300 }
23301 /* [temp]
23303 A template ... shall not have C linkage. */
23305 {
23307 /* Give it C++ linkage to avoid confusing other parts of the
23308 front end. */
23311 }
23312 else
23315 /* We cannot perform access checks on the template parameter
23316 declarations until we know what is being declared, just as we
23317 cannot check the decl-specifier list. */
23320 // Save the current template requirements.
23323 /* If the next token is `>', then we have an invalid
23324 specialization. Rather than complain about an invalid template
23325 parameter, issue an error message here. */
23327 {
23331 }
23332 else
23333 {
23334 /* Parse the template parameters. */
23336 }
23338 /* Get the deferred access checks from the parameter list. These
23339 will be checked once we know what is being declared, as for a
23340 member template the checks must be performed in the scope of the
23341 class containing the member. */
23344 /* Look for the `>'. */
23346 /* We just processed one more parameter list. */
23349 // Manage template requirements
23351 {
23357 // Attach the constraints to the template parameter list.
23360 }
23362 /* If the next token is `template', there are more template
23363 parameters. */
23365 RID_TEMPLATE))
23370 else
23371 {
23372 /* There are no access checks when parsing a template, as we do not
23373 know if a specialization will be a friend. */
23377 checks,
23378 member_p,
23383 /* If this is a member template declaration, let the front
23384 end know. */
23386 {
23391 }
23396 }
23397 /* We are done with the current parameter list. */
23402 /* Finish up. */
23405 // Restore the current template requirements.
23408 /* Check the template arguments for a literal operator template. */
23412 {
23416 else
23417 {
23420 {
23426 }
23428 {
23436 }
23437 else
23439 }
23442 " Expected non-type template argument pack <char...>"
23444 decl);
23445 }
23446 /* Register member declarations. */
23449 /* For the erroneous case of a template with C linkage, we pushed an
23450 implicit C++ linkage scope; exit that scope now. */
23453 /* If DECL is a function template, we must return to parse it later.
23454 (Even though there is no definition, there might be default
23455 arguments that need handling.) */
23459 }
23461 /* Perform the deferred access checks from a template-parameter-list.
23462 CHECKS is a TREE_LIST of access checks, as returned by
23463 get_deferred_access_checks. */
23465 static void
23466 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23467 {
23471 }
23473 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23474 `function-definition' sequence that follows a template header.
23475 If MEMBER_P is true, this declaration appears in a class scope.
23477 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23478 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23480 static tree
23486 {
23489 cp_decl_specifier_seq decl_specifiers;
23493 /* This function is only used when processing a template
23494 declaration. */
23498 /* Defer access checks until we know what is being declared. */
23501 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23502 alternative. */
23505 CP_PARSER_FLAGS_OPTIONAL,
23511 /* There are no template typedefs. */
23513 {
23517 }
23519 /* Gather up the access checks that occurred the
23520 decl-specifier-seq. */
23523 /* Check for the declaration of a template class. */
23525 {
23527 {
23530 /* In this case:
23532 struct C {
23533 friend template <typename T> struct A<T>::B;
23534 };
23536 A<T>::B will be represented by a TYPENAME_TYPE, and
23537 therefore not recognized by shadow_tag. */
23539 && !decl
23546 else
23549 /* Perform access checks for template parameters. */
23551 }
23552 }
23554 /* Complain about missing 'typename' or other invalid type names. */
23557 {
23558 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23559 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23560 the rest of this declaration. */
23563 }
23565 /* If it's not a template class, try for a template function. If
23566 the next token is a `;', then this declaration does not declare
23567 anything. But, if there were errors in the decl-specifiers, then
23568 the error might well have come from an attempted class-specifier.
23569 In that case, there's no need to warn about a missing declarator. */
23573 {
23576 checks,
23578 member_p,
23579 declares_class_or_enum,
23581 NULL);
23583 /* 7.1.1-1 [dcl.stc]
23585 A storage-class-specifier shall not be specified in an explicit
23586 specialization... */
23588 && explicit_specialization_p
23590 {
23594 }
23598 }
23600 /* Look for a trailing `;' after the declaration. */
23606 out:
23609 /* Clear any current qualification; whatever comes next is the start
23610 of something new. */
23616 }
23618 /* Parse a cast-expression that is not the operand of a unary "&". */
23620 static tree
23622 {
23625 }
23627 /* Parse a functional cast to TYPE. Returns an expression
23628 representing the cast. */
23630 static tree
23632 {
23634 tree expression_list;
23635 tree cast;
23639 {
23646 tf_warning_or_error);
23647 }
23656 else
23657 {
23660 }
23663 tf_warning_or_error);
23664 /* [expr.const]/1: In an integral constant expression "only type
23665 conversions to integral or enumeration type can be used". */
23671 NIC_CONSTRUCTOR))
23674 }
23676 /* Save the tokens that make up the body of a member function defined
23677 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23678 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23679 specifiers applied to the declaration. Returns the FUNCTION_DECL
23680 for the member function. */
23682 static tree
23686 tree attributes)
23687 {
23690 tree fn;
23692 /* Create the FUNCTION_DECL. */
23695 /* If something went badly wrong, bail out now. */
23697 {
23698 /* If there's a function-body, skip it. */
23703 }
23705 /* Remember it, if there default args to post process. */
23708 /* Save away the tokens that make up the body of the
23709 function. */
23711 /* Handle function try blocks. */
23714 /* We can have braced-init-list mem-initializers before the fn body. */
23716 {
23719 {
23720 /* cache_group will stop after an un-nested { } pair, too. */
23724 /* variadic mem-inits have ... after the ')'. */
23727 }
23728 }
23730 /* Handle function try blocks. */
23735 /* Save away the inline definition; we will process it when the
23736 class is complete. */
23740 /* We need to know that this was defined in the class, so that
23741 friend templates are handled correctly. */
23744 /* Add FN to the queue of functions to be parsed later. */
23748 }
23750 /* Save the tokens that make up the in-class initializer for a non-static
23751 data member. Returns a DEFAULT_ARG. */
23753 static tree
23755 {
23757 }
23759 /* Parse a template-argument-list, as well as the trailing ">" (but
23760 not the opening "<"). See cp_parser_template_argument_list for the
23761 return value. */
23763 static tree
23765 {
23766 tree arguments;
23767 tree saved_scope;
23768 tree saved_qualifying_scope;
23769 tree saved_object_scope;
23774 /* [temp.names]
23776 When parsing a template-id, the first non-nested `>' is taken as
23777 the end of the template-argument-list rather than a greater-than
23778 operator. */
23779 saved_greater_than_is_operator_p
23782 /* Parsing the argument list may modify SCOPE, so we save it
23783 here. */
23787 /* We need to evaluate the template arguments, even though this
23788 template-id may be nested within a "sizeof". */
23793 /* Parse the template-argument-list itself. */
23797 else
23799 /* Look for the `>' that ends the template-argument-list. If we find
23800 a '>>' instead, it's probably just a typo. */
23802 {
23804 {
23805 /* In C++0x, a `>>' in a template argument list or cast
23806 expression is considered to be two separate `>'
23807 tokens. So, change the current token to a `>', but don't
23808 consume it: it will be consumed later when the outer
23809 template argument list (or cast expression) is parsed.
23810 Note that this replacement of `>' for `>>' is necessary
23811 even if we are parsing tentatively: in the tentative
23812 case, after calling
23813 cp_parser_enclosed_template_argument_list we will always
23814 throw away all of the template arguments and the first
23815 closing `>', either because the template argument list
23816 was erroneous or because we are replacing those tokens
23817 with a CPP_TEMPLATE_ID token. The second `>' (which will
23818 not have been thrown away) is needed either to close an
23819 outer template argument list or to complete a new-style
23820 cast. */
23823 }
23825 {
23826 /* If we're in a nested template argument list, the '>>' has
23827 to be a typo for '> >'. We emit the error message, but we
23828 continue parsing and we push a '>' as next token, so that
23829 the argument list will be parsed correctly. Note that the
23830 global source location is still on the token before the
23831 '>>', so we need to say explicitly where we want it. */
23837 }
23838 else
23839 {
23840 /* If this is not a nested template argument list, the '>>'
23841 is a typo for '>'. Emit an error message and continue.
23842 Same deal about the token location, but here we can get it
23843 right by consuming the '>>' before issuing the diagnostic. */
23846 "spurious %<>>%>, use %<>%> to terminate "
23848 }
23849 }
23850 else
23852 /* The `>' token might be a greater-than operator again now. */
23853 parser->greater_than_is_operator_p
23855 /* Restore the SAVED_SCOPE. */
23863 }
23865 /* MEMBER_FUNCTION is a member function, or a friend. If default
23866 arguments, or the body of the function have not yet been parsed,
23867 parse them now. */
23869 static void
23871 {
23873 /* If this member is a template, get the underlying
23874 FUNCTION_DECL. */
23878 /* There should not be any class definitions in progress at this
23879 point; the bodies of members are only parsed outside of all class
23880 definitions. */
23882 /* While we're parsing the member functions we might encounter more
23883 classes. We want to handle them right away, but we don't want
23884 them getting mixed up with functions that are currently in the
23885 queue. */
23888 /* Make sure that any template parameters are in scope. */
23891 // Restore the declaration's requirements for the parsing of
23892 // the definition.
23893 //
23897 /* If the body of the function has not yet been parsed, parse it
23898 now. */
23900 {
23901 tree function_scope;
23904 /* The function is no longer pending; we are processing it. */
23909 /* If this is a local class, enter the scope of the containing
23910 function. */
23915 /* Push the body of the function onto the lexer stack. */
23918 /* Let the front end know that we going to be defining this
23919 function. */
23923 /* Don't do access checking if it is a templated function. */
23927 /* #pragma omp declare reduction needs special parsing. */
23929 {
23934 }
23935 else
23936 /* Now, parse the body of the function. */
23943 /* Leave the scope of the containing function. */
23947 }
23949 /* Remove any template parameters from the symbol table. */
23952 // Restore the template requirements.
23955 /* Restore the queue. */
23958 }
23960 /* If DECL contains any default args, remember it on the unparsed
23961 functions queue. */
23963 static void
23965 {
23966 tree probe;
23969 probe;
23972 {
23976 }
23977 }
23979 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23980 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23981 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23982 from the parameter-type-list. */
23984 static tree
23987 {
23989 tree parsed_arg;
23995 /* Push the saved tokens for the default argument onto the parser's
23996 lexer stack. */
24002 /* Parse the default argument. */
24013 {
24014 /* In a non-template class, check conversions now. In a template,
24015 we'll wait and instantiate these as needed. */
24018 tf_warning_or_error);
24019 else
24020 {
24027 /* This represents the whole initialization. */
24029 }
24030 }
24032 /* If the token stream has not been completely used up, then
24033 there was extra junk after the end of the default
24034 argument. */
24036 {
24039 else
24041 }
24043 /* Revert to the main lexer. */
24047 }
24049 /* FIELD is a non-static data member with an initializer which we saved for
24050 later; parse it now. */
24052 static void
24054 {
24055 tree def;
24062 NULL_TREE);
24068 }
24070 /* FN is a FUNCTION_DECL which may contains a parameter with an
24071 unparsed DEFAULT_ARG. Parse the default args now. This function
24072 assumes that the current scope is the scope in which the default
24073 argument should be processed. */
24075 static void
24077 {
24081 /* While we're parsing the default args, we might (due to the
24082 statement expression extension) encounter more classes. We want
24083 to handle them right away, but we don't want them getting mixed
24084 up with default args that are currently in the queue. */
24087 /* Local variable names (and the `this' keyword) may not appear
24088 in a default argument. */
24099 {
24101 tree parsed_arg;
24103 tree copy;
24110 /* This can happen for a friend declaration for a function
24111 already declared with default arguments. */
24114 parsed_arg
24116 default_arg,
24119 {
24121 }
24125 /* Update any instantiations we've already created. */
24129 }
24133 /* Make sure no default arg is missing. */
24136 /* Restore the state of local_variables_forbidden_p. */
24139 /* Restore the queue. */
24141 }
24143 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24145 sizeof ... ( identifier )
24147 where the 'sizeof' token has already been consumed. */
24149 static tree
24151 {
24152 /* Consume the `...'. */
24159 else
24167 /* The name is not qualified. */
24185 }
24187 /* Parse the operand of `sizeof' (or a similar operator). Returns
24188 either a TYPE or an expression, depending on the form of the
24189 input. The KEYWORD indicates which kind of expression we have
24190 encountered. */
24192 static tree
24194 {
24201 /* If it's a `...', then we are computing the length of a parameter
24202 pack. */
24207 /* Types cannot be defined in a `sizeof' expression. Save away the
24208 old message. */
24210 /* And create the new one. */
24216 /* The restrictions on constant-expressions do not apply inside
24217 sizeof expressions. */
24218 saved_integral_constant_expression_p
24220 saved_non_integral_constant_expression_p
24224 /* Do not actually evaluate the expression. */
24227 /* If it's a `(', then we might be looking at the type-id
24228 construction. */
24230 {
24234 /* We can't be sure yet whether we're looking at a type-id or an
24235 expression. */
24237 /* Consume the `('. */
24239 /* Note: as a GNU Extension, compound literals are considered
24240 postfix-expressions as they are in C99, so they are valid
24241 arguments to sizeof. See comment in cp_parser_cast_expression
24242 for details. */
24244 /* Skip tokens until the next token is a closing parenthesis.
24245 If we find the closing `)', and the next token is a `{', then
24246 we are looking at a compound-literal. */
24247 compound_literal_p
24251 /* Roll back the tokens we skipped. */
24253 /* If we were looking at a compound-literal, simulate an error
24254 so that the call to cp_parser_parse_definitely below will
24255 fail. */
24258 else
24259 {
24262 /* Look for the type-id. */
24264 /* Look for the closing `)'. */
24267 }
24269 /* If all went well, then we're done. */
24271 {
24272 cp_decl_specifier_seq decl_specs;
24274 /* Build a trivial decl-specifier-seq. */
24278 /* Call grokdeclarator to figure out what type this is. */
24281 TYPENAME,
24284 }
24285 }
24287 /* If the type-id production did not work out, then we must be
24288 looking at the unary-expression production. */
24293 /* Go back to evaluating expressions. */
24297 /* Free the message we created. */
24299 /* And restore the old one. */
24301 parser->integral_constant_expression_p
24303 parser->non_integral_constant_expression_p
24307 }
24309 /* If the current declaration has no declarator, return true. */
24311 static bool
24313 {
24314 /* If the next token is a `;' or a `,' then there is no
24315 declarator. */
24318 }
24320 /* Update the DECL_SPECS to reflect the storage class indicated by
24321 KEYWORD. */
24323 static void
24328 {
24329 cp_storage_class storage_class;
24332 {
24336 }
24338 {
24341 }
24346 {
24349 }
24352 {
24370 }
24374 /* A storage class specifier cannot be applied alongside a typedef
24375 specifier. If there is a typedef specifier present then set
24376 conflicting_specifiers_p which will trigger an error later
24377 on in grokdeclarator. */
24380 }
24382 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24383 is true, the type is a class or enum definition. */
24385 static void
24387 tree type_spec,
24390 {
24393 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24394 (with, for example, in "typedef int wchar_t;") we remember that
24395 this is what happened. In system headers, we ignore these
24396 declarations so that G++ can work with system headers that are not
24397 C++-safe. */
24399 && !type_definition_p
24409 {
24412 ds_redefined_builtin_type_spec,
24413 token);
24415 {
24419 }
24420 }
24423 else
24424 {
24429 }
24430 }
24432 /* True iff TOKEN is the GNU keyword __thread. */
24434 static bool
24436 {
24439 }
24441 /* Set the location for a declarator specifier and check if it is
24442 duplicated.
24444 DECL_SPECS is the sequence of declarator specifiers onto which to
24445 set the location.
24447 DS is the single declarator specifier to set which location is to
24448 be set onto the existing sequence of declarators.
24450 LOCATION is the location for the declarator specifier to
24451 consider. */
24453 static void
24456 {
24465 {
24469 }
24470 else
24471 {
24473 {
24477 else
24478 {
24481 OPT_Wlong_long,
24483 }
24484 }
24486 {
24491 else
24493 }
24494 else
24495 {
24511 "__complex"
24512 };
24515 }
24516 }
24517 }
24519 /* Return true iff the declarator specifier DS is present in the
24520 sequence of declarator specifiers DECL_SPECS. */
24522 bool
24524 cp_decl_spec ds)
24525 {
24532 }
24534 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24535 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24537 static bool
24539 {
24541 }
24543 /* Issue an error message indicating that TOKEN_DESC was expected.
24544 If KEYWORD is true, it indicated this function is called by
24545 cp_parser_require_keword and the required token can only be
24546 a indicated keyword. */
24548 static void
24550 required_token token_desc,
24552 {
24554 {
24623 }
24625 {
24627 {
24706 }
24707 }
24708 else
24710 }
24714 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24715 issue an error message indicating that TOKEN_DESC was expected.
24717 Returns the token consumed, if the token had the appropriate type.
24718 Otherwise, returns NULL. */
24723 required_token token_desc)
24724 {
24727 else
24728 {
24729 /* Output the MESSAGE -- unless we're parsing tentatively. */
24733 }
24734 }
24736 /* An error message is produced if the next token is not '>'.
24737 All further tokens are skipped until the desired token is
24738 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24740 static void
24742 {
24743 /* Current level of '< ... >'. */
24745 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24748 /* Are we ready, yet? If not, issue error message. */
24752 /* Skip tokens until the desired token is found. */
24754 {
24755 /* Peek at the next token. */
24757 {
24765 /* C++0x views the `>>' operator as two `>' tokens, but
24766 C++98 does not. */
24769 {
24770 /* We've hit a `>>' where the first `>' closes the
24771 template argument list, and the second `>' is
24772 spurious. Just consume the `>>' and stop; we've
24773 already produced at least one error. */
24776 }
24777 /* Fall through for C++0x, so we handle the second `>' in
24778 the `>>'. */
24782 {
24783 /* We've reached the token we want, consume it and stop. */
24786 }
24805 /* The '>' was probably forgotten, don't look further. */
24810 }
24812 /* Consume this token. */
24814 }
24815 }
24817 /* If the next token is the indicated keyword, consume it. Otherwise,
24818 issue an error message indicating that TOKEN_DESC was expected.
24820 Returns the token consumed, if the token had the appropriate type.
24821 Otherwise, returns NULL. */
24826 required_token token_desc)
24827 {
24831 {
24834 }
24837 }
24839 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24840 function-definition. */
24842 static bool
24844 {
24847 /* A ctor-initializer begins with a `:'. */
24849 /* A function-try-block begins with `try'. */
24851 /* A function-transaction-block begins with `__transaction_atomic'
24852 or `__transaction_relaxed'. */
24855 /* The named return value extension begins with `return'. */
24857 }
24859 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24860 definition. */
24862 static bool
24864 {
24871 }
24873 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24874 C++0x) ending a template-argument. */
24876 static bool
24878 {
24886 }
24888 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24889 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24891 static bool
24894 {
24900 /* Check for the sequence `<::' in the original code. It would be lexed as
24901 `[:', where `[' is a digraph, and there is no whitespace before
24902 `:'. */
24904 {
24909 }
24911 }
24913 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24914 or none_type otherwise. */
24916 static enum tag_types
24918 {
24920 {
24930 }
24931 }
24933 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24935 static void
24937 {
24941 {
24945 type))
24948 }
24949 }
24951 /* Issue an error message if DECL is redeclared with different
24952 access than its original declaration [class.access.spec/3].
24953 This applies to nested classes and nested class templates.
24954 [class.mem/1]. */
24956 static void
24958 {
24967 }
24969 /* Look for the `template' keyword, as a syntactic disambiguator.
24970 Return TRUE iff it is present, in which case it will be
24971 consumed. */
24973 static bool
24975 {
24977 {
24978 /* In C++98 the `template' keyword can only be used within templates;
24979 outside templates the parser can always figure out what is a
24980 template and what is not. In C++11, per the resolution of DR 468,
24981 `template' is allowed in cases where it is not strictly necessary. */
24984 {
24987 "in C++98 %<template%> (as a disambiguator) is only "
24989 /* If this part of the token stream is rescanned, the same
24990 error message would be generated. So, we purge the token
24991 from the stream. */
24994 }
24995 else
24996 {
24997 /* Consume the `template' keyword. */
25000 }
25001 }
25003 }
25005 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25006 set PARSER->SCOPE, and perform other related actions. */
25008 static void
25010 {
25016 /* Get the stored value. */
25018 /* Perform any access checks that were deferred. */
25021 {
25026 }
25027 /* Set the scope from the stored value. */
25031 }
25033 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25034 encounter the end of a block before what we were looking for. */
25036 static bool
25040 {
25042 {
25045 /* Abort a parenthesized expression if we encounter a semicolon. */
25049 /* If we've reached the end of the file, stop. */
25055 /* We've hit the end of an enclosing block, so there's been some
25056 kind of syntax error. */
25059 /* Consume the token. */
25061 /* See if it starts a new group. */
25063 {
25065 /* In theory this should probably check end == '}', but
25066 cp_parser_save_member_function_body needs it to exit
25067 after either '}' or ')' when called with ')'. */
25070 }
25072 {
25076 }
25081 }
25082 }
25084 /* Like above, for caching a default argument or NSDMI. Both of these are
25085 terminated by a non-nested comma, but it can be unclear whether or not a
25086 comma is nested in a template argument list unless we do more parsing.
25087 In order to handle this ambiguity, when we encounter a ',' after a '<'
25088 we try to parse what follows as a parameter-declaration-list (in the
25089 case of a default argument) or a member-declarator (in the case of an
25090 NSDMI). If that succeeds, then we stop caching. */
25092 static tree
25094 {
25099 tree default_argument;
25101 /* Add tokens until we have processed the entire default
25102 argument. We add the range [first_token, token). */
25105 {
25106 /* For list-initialization, this is straightforward. */
25109 }
25111 {
25114 /* Peek at the next token. */
25116 /* What we do depends on what token we have. */
25118 {
25119 /* In valid code, a default argument must be
25120 immediately followed by a `,' `)', or `...'. */
25123 {
25124 /* If we've seen a '<', we might be in a
25125 template-argument-list. Until Core issue 325 is
25126 resolved, we don't know how this situation ought
25127 to be handled, so try to DTRT. We check whether
25128 what comes after the comma is a valid parameter
25129 declaration list. If it is, then the comma ends
25130 the default argument; otherwise the default
25131 argument continues. */
25134 /* Set ITALP so cp_parser_parameter_declaration_list
25135 doesn't decide to commit to this parse. */
25143 {
25149 }
25150 else
25151 {
25155 }
25162 }
25165 /* If we run into a non-nested `;', `}', or `]',
25166 then the code is invalid -- but the default
25167 argument is certainly over. */
25172 /* Handle correctly int n = sizeof ... ( p ); */
25175 /* Update DEPTH, if necessary. */
25190 /* This might be the comparison operator, or it might
25191 start a template argument list. */
25198 /* Fall through for C++0x, which treats the `>>'
25199 operator like two `>' tokens in certain
25200 cases. */
25204 {
25205 /* This might be an operator, or it might close a
25206 template argument list. But if a previous '<'
25207 started a template argument list, this will have
25208 closed it, so we can't be in one anymore. */
25212 }
25215 /* If we run out of tokens, issue an error message. */
25224 /* In these cases, we should look for template-ids.
25225 For example, if the default argument is
25226 `X<int, double>()', we need to do name lookup to
25227 figure out whether or not `X' is a template; if
25228 so, the `,' does not end the default argument.
25230 That is not yet done. */
25235 }
25237 /* If we've reached the end, stop. */
25241 /* Add the token to the token block. */
25243 }
25245 /* Create a DEFAULT_ARG to represent the unparsed default
25246 argument. */
25253 }
25255 /* Begin parsing tentatively. We always save tokens while parsing
25256 tentatively so that if the tentative parsing fails we can restore the
25257 tokens. */
25259 static void
25261 {
25262 /* Enter a new parsing context. */
25264 /* Begin saving tokens. */
25266 /* In order to avoid repetitive access control error messages,
25267 access checks are queued up until we are no longer parsing
25268 tentatively. */
25270 }
25272 /* Commit to the currently active tentative parse. */
25274 static void
25276 {
25280 /* Mark all of the levels as committed. */
25283 {
25290 }
25291 }
25293 /* Commit to the topmost currently active tentative parse.
25295 Note that this function shouldn't be called when there are
25296 irreversible side-effects while in a tentative state. For
25297 example, we shouldn't create a permanent entry in the symbol
25298 table, or issue an error message that might not apply if the
25299 tentative parse is aborted. */
25301 static void
25303 {
25308 {
25316 }
25317 }
25319 /* Abort the currently active tentative parse. All consumed tokens
25320 will be rolled back, and no diagnostics will be issued. */
25322 static void
25324 {
25328 /* Now, pretend that we want to see if the construct was
25329 successfully parsed. */
25331 }
25333 /* Stop parsing tentatively. If a parse error has occurred, restore the
25334 token stream. Otherwise, commit to the tokens we have consumed.
25335 Returns true if no error occurred; false otherwise. */
25337 static bool
25339 {
25343 /* Remember whether or not an error occurred, since we are about to
25344 destroy that information. */
25346 /* Remove the topmost context from the stack. */
25349 /* If no parse errors occurred, commit to the tentative parse. */
25351 {
25352 /* Commit to the tokens read tentatively, unless that was
25353 already done. */
25358 }
25359 /* Otherwise, if errors occurred, roll back our state so that things
25360 are just as they were before we began the tentative parse. */
25361 else
25362 {
25365 }
25366 /* Add the context to the front of the free list. */
25371 }
25373 /* Returns true if we are parsing tentatively and are not committed to
25374 this tentative parse. */
25376 static bool
25378 {
25381 }
25383 /* Returns nonzero iff an error has occurred during the most recent
25384 tentative parse. */
25386 static bool
25388 {
25391 }
25393 /* Returns nonzero if GNU extensions are allowed. */
25395 static bool
25397 {
25399 }
25400 \f
25401 /* Objective-C++ Productions */
25404 /* Parse an Objective-C expression, which feeds into a primary-expression
25405 above.
25407 objc-expression:
25408 objc-message-expression
25409 objc-string-literal
25410 objc-encode-expression
25411 objc-protocol-expression
25412 objc-selector-expression
25414 Returns a tree representation of the expression. */
25416 static tree
25418 {
25419 /* Try to figure out what kind of declaration is present. */
25423 {
25433 {
25445 }
25451 }
25454 }
25456 /* Parse an Objective-C message expression.
25458 objc-message-expression:
25459 [ objc-message-receiver objc-message-args ]
25461 Returns a representation of an Objective-C message. */
25463 static tree
25465 {
25474 }
25476 /* Parse an objc-message-receiver.
25478 objc-message-receiver:
25479 expression
25480 simple-type-specifier
25482 Returns a representation of the type or expression. */
25484 static tree
25486 {
25487 tree rcv;
25489 /* An Objective-C message receiver may be either (1) a type
25490 or (2) an expression. */
25499 CP_PARSER_FLAGS_NONE);
25502 }
25504 /* Parse the arguments and selectors comprising an Objective-C message.
25506 objc-message-args:
25507 objc-selector
25508 objc-selector-args
25509 objc-selector-args , objc-comma-args
25511 objc-selector-args:
25512 objc-selector [opt] : assignment-expression
25513 objc-selector-args objc-selector [opt] : assignment-expression
25515 objc-comma-args:
25516 assignment-expression
25517 objc-comma-args , assignment-expression
25519 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25520 selector arguments and TREE_VALUE containing a list of comma
25521 arguments. */
25523 static tree
25525 {
25531 {
25537 /* Detect if we have a unary selector. */
25546 sel_args
25551 }
25553 /* Handle non-selector arguments, if any. */
25555 {
25556 tree arg;
25561 addl_args
25566 }
25569 {
25572 }
25575 }
25577 /* Parse an Objective-C encode expression.
25579 objc-encode-expression:
25580 @encode objc-typename
25582 Returns an encoded representation of the type argument. */
25584 static tree
25586 {
25587 tree type;
25597 {
25601 }
25603 /* This happens if we find @encode(T) (where T is a template
25604 typename or something dependent on a template typename) when
25605 parsing a template. In that case, we can't compile it
25606 immediately, but we rather create an AT_ENCODE_EXPR which will
25607 need to be instantiated when the template is used.
25608 */
25610 {
25614 }
25617 }
25619 /* Parse an Objective-C @defs expression. */
25621 static tree
25623 {
25624 tree name;
25632 }
25634 /* Parse an Objective-C protocol expression.
25636 objc-protocol-expression:
25637 @protocol ( identifier )
25639 Returns a representation of the protocol expression. */
25641 static tree
25643 {
25644 tree proto;
25652 }
25654 /* Parse an Objective-C selector expression.
25656 objc-selector-expression:
25657 @selector ( objc-method-signature )
25659 objc-method-signature:
25660 objc-selector
25661 objc-selector-seq
25663 objc-selector-seq:
25664 objc-selector :
25665 objc-selector-seq objc-selector :
25667 Returns a representation of the method selector. */
25669 static tree
25671 {
25683 {
25692 {
25693 /* Detect if we have a unary selector. */
25695 {
25698 }
25699 else
25700 {
25702 }
25703 }
25708 {
25709 sel_seq
25712 sel_seq
25715 }
25716 else
25717 sel_seq
25722 }
25724 finish_selector:
25728 }
25730 /* Parse a list of identifiers.
25732 objc-identifier-list:
25733 identifier
25734 objc-identifier-list , identifier
25736 Returns a TREE_LIST of identifier nodes. */
25738 static tree
25740 {
25741 tree identifier;
25742 tree list;
25753 {
25760 identifier));
25762 }
25765 }
25767 /* Parse an Objective-C alias declaration.
25769 objc-alias-declaration:
25770 @compatibility_alias identifier identifier ;
25772 This function registers the alias mapping with the Objective-C front end.
25773 It returns nothing. */
25775 static void
25777 {
25785 }
25787 /* Parse an Objective-C class forward-declaration.
25789 objc-class-declaration:
25790 @class objc-identifier-list ;
25792 The function registers the forward declarations with the Objective-C
25793 front end. It returns nothing. */
25795 static void
25797 {
25800 {
25801 tree id;
25811 else
25813 }
25815 }
25817 /* Parse a list of Objective-C protocol references.
25819 objc-protocol-refs-opt:
25820 objc-protocol-refs [opt]
25822 objc-protocol-refs:
25823 < objc-identifier-list >
25825 Returns a TREE_LIST of identifiers, if any. */
25827 static tree
25829 {
25833 {
25837 }
25840 }
25842 /* Parse a Objective-C visibility specification. */
25844 static void
25846 {
25850 {
25865 }
25867 /* Eat '@private'/'@protected'/'@public'. */
25869 }
25871 /* Parse an Objective-C method type. Return 'true' if it is a class
25872 (+) method, and 'false' if it is an instance (-) method. */
25876 {
25879 else
25881 }
25883 /* Parse an Objective-C protocol qualifier. */
25885 static tree
25887 {
25900 {
25905 }
25908 }
25910 /* Parse an Objective-C typename. */
25912 static tree
25914 {
25918 {
25924 /* An ObjC type name may consist of just protocol qualifiers, in which
25925 case the type shall default to 'id'. */
25927 {
25930 /* If the type could not be parsed, an error has already
25931 been produced. For error recovery, behave as if it had
25932 not been specified, which will use the default type
25933 'id'. */
25935 {
25937 /* We need to skip to the closing parenthesis as
25938 cp_parser_type_id() does not seem to do it for
25939 us. */
25944 }
25945 }
25949 }
25952 }
25954 /* Check to see if TYPE refers to an Objective-C selector name. */
25956 static bool
25958 {
25964 }
25966 /* Parse an Objective-C selector. */
25968 static tree
25970 {
25974 {
25977 }
25979 /* C++ operator names are allowed to appear in ObjC selectors. */
25981 {
25994 }
25995 }
25997 /* Parse an Objective-C params list. */
25999 static tree
26001 {
26007 {
26017 /* Detect if we have a unary selector. */
26020 {
26023 }
26027 {
26028 /* Something went quite wrong. There should be a colon
26029 here, but there is not. Stop parsing parameters. */
26031 }
26033 /* New ObjC allows attributes on parameters too. */
26038 params
26041 type_name,
26042 identifier,
26043 parm_attr));
26046 }
26049 {
26052 }
26054 /* We allow tail attributes for the method. */
26056 {
26064 }
26067 {
26070 }
26072 }
26074 /* Parse the non-keyword Objective-C params. */
26076 static tree
26079 {
26085 {
26087 tree parm;
26093 {
26098 }
26100 /* TODO: parse attributes for tail parameters. */
26109 }
26111 /* We allow tail attributes for the method. */
26113 {
26115 {
26120 }
26121 else
26122 /* We have an error, but parse the attributes, so that we can
26123 carry on. */
26129 }
26132 }
26134 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26136 static void
26138 {
26141 /* If the next token is `extern' and the following token is a string
26142 literal, then we have a linkage specification. */
26144 && cp_parser_is_pure_string_literal
26147 /* Handle #pragma, if any. */
26150 /* Allow stray semicolons. */
26153 /* Mark methods as optional or required, when building protocols. */
26155 {
26158 }
26160 {
26163 }
26166 /* Other stray characters must generate errors. */
26168 {
26172 }
26173 /* Finally, try to parse a block-declaration, or a function-definition. */
26174 else
26176 }
26178 /* Parse a method signature. */
26180 static tree
26182 {
26198 }
26200 static bool
26202 {
26203 tree tattr;
26208 /* If the attributes are followed by a method introducer, this is not allowed.
26209 Dump the attributes and flag the situation. */
26214 /* Otherwise, the attributes introduce some interstitial code, possibly so
26215 rewind to allow that check. */
26218 }
26220 /* Parse an Objective-C method prototype list. */
26222 static void
26224 {
26228 {
26230 {
26235 else
26239 {
26243 }
26246 }
26252 OPT_Wattributes,
26254 else
26255 /* Allow for interspersed non-ObjC++ code. */
26259 }
26263 else
26267 }
26269 /* Parse an Objective-C method definition list. */
26271 static void
26273 {
26277 {
26278 tree meth;
26281 {
26287 else
26292 {
26296 }
26298 NULL_TREE);
26300 /* For historical reasons, we accept an optional semicolon. */
26307 {
26314 }
26315 }
26316 /* The following case will be removed once @synthesize is
26317 completely implemented. */
26328 else
26329 /* Allow for interspersed non-ObjC++ code. */
26333 }
26337 else
26341 }
26343 /* Parse Objective-C ivars. */
26345 static void
26347 {
26358 {
26359 cp_decl_specifier_seq declspecs;
26361 tree prefix_attributes;
26369 CP_PARSER_FLAGS_OPTIONAL,
26373 /* auto, register, static, extern, mutable. */
26375 {
26378 }
26380 /* thread_local. */
26382 {
26385 }
26387 /* typedef. */
26389 {
26392 }
26397 /* Keep going until we hit the `;' at the end of the
26398 declaration. */
26400 {
26405 /* Check for a (possibly unnamed) bitfield declaration. */
26413 {
26414 /* Get the name of the bitfield. */
26417 sfk_none);
26419 eat_colon:
26421 /* Get the width of the bitfield. */
26422 width
26425 NULL);
26426 }
26427 else
26428 {
26429 /* Parse the declarator. */
26430 declarator
26435 }
26437 /* Look for attributes that apply to the ivar. */
26439 /* Remember which attributes are prefix attributes and
26440 which are not. */
26442 /* Combine the attributes. */
26446 /* Create the bitfield declaration. */
26448 width,
26449 attributes);
26450 else
26455 /* Add the instance variable. */
26459 /* Reset PREFIX_ATTRIBUTES. */
26468 {
26471 }
26473 }
26477 }
26482 /* Do not consume the RID_AT_END, so it will be read again as terminating
26483 the @interface of @implementation. */
26487 /* For historical reasons, we accept an optional semicolon. */
26490 }
26492 /* Parse an Objective-C protocol declaration. */
26494 static void
26496 {
26502 {
26507 }
26509 /* See if we have a forward declaration or a definition. */
26512 /* Try a forward declaration first. */
26514 {
26516 {
26517 tree id;
26527 else
26529 }
26531 }
26533 /* Ok, we got a full-fledged definition (or at least should). */
26534 else
26535 {
26540 }
26541 }
26543 /* Parse an Objective-C superclass or category. */
26545 static void
26550 {
26556 {
26559 }
26561 {
26564 /* If there is no category name, and this is an @interface, we
26565 have a class extension. */
26567 {
26570 }
26571 else
26575 }
26576 }
26578 /* Parse an Objective-C class interface. */
26580 static void
26582 {
26589 {
26590 /* It's hard to recover because even if valid @interface stuff
26591 is to follow, we can't compile it (or validate it) if we
26592 don't even know which class it refers to. Let's assume this
26593 was a stray '@interface' token in the stream and skip it.
26594 */
26596 }
26601 /* We have either a class or a category on our hands. */
26604 else
26605 {
26607 /* Handle instance variable declarations, if any. */
26610 }
26613 }
26615 /* Parse an Objective-C class implementation. */
26617 static void
26619 {
26626 {
26627 /* It's hard to recover because even if valid @implementation
26628 stuff is to follow, we can't compile it (or validate it) if
26629 we don't even know which class it refers to. Let's assume
26630 this was a stray '@implementation' token in the stream and
26631 skip it.
26632 */
26634 }
26638 /* We have either a class or a category on our hands. */
26641 else
26642 {
26644 /* Handle instance variable declarations, if any. */
26647 }
26650 }
26652 /* Consume the @end token and finish off the implementation. */
26654 static void
26656 {
26659 }
26661 /* Parse an Objective-C declaration. */
26663 static void
26665 {
26666 /* Try to figure out what kind of declaration is present. */
26671 {
26687 }
26690 {
26713 }
26714 }
26716 /* Parse an Objective-C try-catch-finally statement.
26718 objc-try-catch-finally-stmt:
26719 @try compound-statement objc-catch-clause-seq [opt]
26720 objc-finally-clause [opt]
26722 objc-catch-clause-seq:
26723 objc-catch-clause objc-catch-clause-seq [opt]
26725 objc-catch-clause:
26726 @catch ( objc-exception-declaration ) compound-statement
26728 objc-finally-clause:
26729 @finally compound-statement
26731 objc-exception-declaration:
26732 parameter-declaration
26733 '...'
26735 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26737 Returns NULL_TREE.
26739 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26740 for C. Keep them in sync. */
26742 static tree
26744 {
26745 location_t location;
26746 tree stmt;
26751 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26752 node, lest it get absorbed into the surrounding block. */
26758 {
26767 {
26768 /* We have "@catch (...)" (where the '...' are literally
26769 what is in the code). Skip the '...'.
26770 parameter_declaration is set to NULL_TREE, and
26771 objc_being_catch_clauses() knows that that means
26772 '...'. */
26775 }
26776 else
26777 {
26778 /* We have "@catch (NSException *exception)" or something
26779 like that. Parse the parameter declaration. */
26783 else
26788 }
26791 else
26792 {
26793 /* If there was no open parenthesis, we are recovering from
26794 an error, and we are trying to figure out what mistake
26795 the user has made. */
26797 /* If there is an immediate closing parenthesis, the user
26798 probably forgot the opening one (ie, they typed "@catch
26799 NSException *e)". Parse the closing parenthesis and keep
26800 going. */
26804 /* If these is no immediate closing parenthesis, the user
26805 probably doesn't know that parenthesis are required at
26806 all (ie, they typed "@catch NSException *e"). So, just
26807 forget about the closing parenthesis and keep going. */
26808 }
26812 }
26814 {
26817 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26818 node, lest it get absorbed into the surrounding block. */
26822 }
26825 }
26827 /* Parse an Objective-C synchronized statement.
26829 objc-synchronized-stmt:
26830 @synchronized ( expression ) compound-statement
26832 Returns NULL_TREE. */
26834 static tree
26836 {
26837 location_t location;
26848 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26849 node, lest it get absorbed into the surrounding block. */
26854 }
26856 /* Parse an Objective-C throw statement.
26858 objc-throw-stmt:
26859 @throw assignment-expression [opt] ;
26861 Returns a constructed '@throw' statement. */
26863 static tree
26865 {
26877 }
26879 /* Parse an Objective-C statement. */
26881 static tree
26883 {
26884 /* Try to figure out what kind of declaration is present. */
26888 {
26899 }
26902 }
26904 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26905 look ahead to see if an objc keyword follows the attributes. This
26906 is to detect the use of prefix attributes on ObjC @interface and
26907 @protocol. */
26909 static bool
26911 {
26916 {
26919 }
26922 }
26924 /* This routine is a minimal replacement for
26925 c_parser_struct_declaration () used when parsing the list of
26926 types/names or ObjC++ properties. For example, when parsing the
26927 code
26929 @property (readonly) int a, b, c;
26931 this function is responsible for parsing "int a, int b, int c" and
26932 returning the declarations as CHAIN of DECLs.
26934 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26935 similar parsing. */
26936 static tree
26938 {
26940 cp_decl_specifier_seq declspecs;
26942 tree prefix_attributes;
26945 CP_PARSER_FLAGS_NONE,
26952 /* auto, register, static, extern, mutable. */
26954 {
26957 }
26959 /* thread_local. */
26961 {
26964 }
26966 /* typedef. */
26968 {
26971 }
26976 /* Keep going until we hit the `;' at the end of the declaration. */
26978 {
26983 /* Parse the declarator. */
26987 /* Look for attributes that apply to the ivar. */
26989 /* Remember which attributes are prefix attributes and
26990 which are not. */
26992 /* Combine the attributes. */
27002 /* Reset PREFIX_ATTRIBUTES. */
27013 {
27016 }
27017 else
27019 }
27021 }
27023 /* Parse an Objective-C @property declaration. The syntax is:
27025 objc-property-declaration:
27026 '@property' objc-property-attributes[opt] struct-declaration ;
27028 objc-property-attributes:
27029 '(' objc-property-attribute-list ')'
27031 objc-property-attribute-list:
27032 objc-property-attribute
27033 objc-property-attribute-list, objc-property-attribute
27035 objc-property-attribute
27036 'getter' = identifier
27037 'setter' = identifier
27038 'readonly'
27039 'readwrite'
27040 'assign'
27041 'retain'
27042 'copy'
27043 'nonatomic'
27045 For example:
27046 @property NSString *name;
27047 @property (readonly) id object;
27048 @property (retain, nonatomic, getter=getTheName) id name;
27049 @property int a, b, c;
27051 PS: This function is identical to
27052 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27053 static void
27055 {
27056 /* The following variables hold the attributes of the properties as
27057 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27058 seen. When we see an attribute, we set them to 'true' (if they
27059 are boolean properties) or to the identifier (if they have an
27060 argument, ie, for getter and setter). Note that here we only
27061 parse the list of attributes, check the syntax and accumulate the
27062 attributes that we find. objc_add_property_declaration() will
27063 then process the information. */
27073 /* 'properties' is the list of properties that we read. Usually a
27074 single one, but maybe more (eg, in "@property int a, b, c;" there
27075 are three). */
27076 tree properties;
27077 location_t loc;
27083 /* Parse the optional attribute list... */
27085 {
27086 /* Eat the '('. */
27090 {
27096 {
27099 }
27103 {
27114 {
27118 else
27123 }
27126 {
27130 }
27132 {
27134 {
27137 }
27138 else
27142 else
27144 }
27145 else
27146 {
27148 {
27151 }
27152 else
27154 }
27160 }
27167 else
27169 }
27171 /* FIXME: "@property (setter, assign);" will generate a spurious
27172 "error: expected ‘)’ before ‘,’ token". This is because
27173 cp_parser_require, unlike the C counterpart, will produce an
27174 error even if we are in error recovery. */
27176 {
27181 }
27182 }
27184 /* ... and the property declaration(s). */
27188 {
27190 /* If the next token is now a `;', consume it. */
27194 }
27198 else
27199 {
27200 /* Comma-separated properties are chained together in
27201 reverse order; add them one by one. */
27210 }
27213 }
27215 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27217 objc-synthesize-declaration:
27218 @synthesize objc-synthesize-identifier-list ;
27220 objc-synthesize-identifier-list:
27221 objc-synthesize-identifier
27222 objc-synthesize-identifier-list, objc-synthesize-identifier
27224 objc-synthesize-identifier
27225 identifier
27226 identifier = identifier
27228 For example:
27229 @synthesize MyProperty;
27230 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27232 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27233 for C. Keep them in sync.
27234 */
27235 static void
27237 {
27239 location_t loc;
27244 {
27248 {
27251 }
27253 {
27257 {
27260 }
27261 }
27262 else
27267 else
27269 }
27272 }
27274 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27276 objc-dynamic-declaration:
27277 @dynamic identifier-list ;
27279 For example:
27280 @dynamic MyProperty;
27281 @dynamic MyProperty, AnotherProperty;
27283 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27284 for C. Keep them in sync.
27285 */
27286 static void
27288 {
27290 location_t loc;
27295 {
27296 tree property;
27299 {
27302 }
27306 else
27308 }
27311 }
27313 \f
27314 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27316 /* Returns name of the next clause.
27317 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27318 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27319 returned and the token is consumed. */
27321 static pragma_omp_clause
27323 {
27335 {
27340 {
27435 }
27436 }
27442 }
27444 /* Validate that a clause of the given type does not already exist. */
27446 static void
27449 {
27450 tree c;
27454 {
27457 }
27458 }
27460 /* OpenMP 2.5:
27461 variable-list:
27462 identifier
27463 variable-list , identifier
27465 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27466 colon). An opening parenthesis will have been consumed by the caller.
27468 If KIND is nonzero, create the appropriate node and install the decl
27469 in OMP_CLAUSE_DECL and add the node to the head of the list.
27471 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27472 return the list created.
27474 COLON can be NULL if only closing parenthesis should end the list,
27475 or pointer to bool which will receive false if the list is terminated
27476 by closing parenthesis or true if the list is terminated by colon. */
27478 static tree
27481 {
27485 {
27488 }
27490 {
27507 {
27509 {
27515 {
27522 NULL);
27524 parser->colon_corrects_to_scope_p
27528 else
27529 {
27530 /* Look for `:'. */
27534 CPP_CLOSE_SQUARE))
27537 NULL);
27538 }
27539 /* Look for the closing `]'. */
27541 RT_CLOSE_SQUARE))
27544 }
27548 }
27554 }
27555 else
27558 get_comma:
27562 }
27568 {
27572 }
27575 {
27578 /* Try to resync to an unnested comma. Copied from
27579 cp_parser_parenthesized_expression_list. */
27580 skip_comma:
27589 }
27592 }
27594 /* Similarly, but expect leading and trailing parenthesis. This is a very
27595 common case for omp clauses. */
27597 static tree
27599 {
27603 }
27605 /* OpenMP 3.0:
27606 collapse ( constant-expression ) */
27608 static tree
27610 {
27612 location_t loc;
27613 HOST_WIDE_INT n;
27633 {
27636 }
27644 }
27646 /* OpenMP 2.5:
27647 default ( shared | none ) */
27649 static tree
27651 {
27653 tree c;
27658 {
27663 {
27678 }
27681 }
27682 else
27683 {
27684 invalid_kind:
27686 }
27702 }
27704 /* OpenMP 3.1:
27705 final ( expression ) */
27707 static tree
27709 {
27730 }
27732 /* OpenMP 2.5:
27733 if ( expression ) */
27735 static tree
27737 {
27758 }
27760 /* OpenMP 3.1:
27761 mergeable */
27763 static tree
27766 {
27767 tree c;
27770 location);
27775 }
27777 /* OpenMP 2.5:
27778 nowait */
27780 static tree
27783 {
27784 tree c;
27791 }
27793 /* OpenMP 2.5:
27794 num_threads ( expression ) */
27796 static tree
27798 location_t location)
27799 {
27821 }
27823 /* OpenMP 2.5:
27824 ordered */
27826 static tree
27829 {
27830 tree c;
27838 }
27840 /* OpenMP 2.5:
27841 reduction ( reduction-operator : variable-list )
27843 reduction-operator:
27844 One of: + * - & ^ | && ||
27846 OpenMP 3.1:
27848 reduction-operator:
27849 One of: + * - & ^ | && || min max
27851 OpenMP 4.0:
27853 reduction-operator:
27854 One of: + * - & ^ | && ||
27855 id-expression */
27857 static tree
27859 {
27867 {
27877 }
27881 else
27882 {
27893 {
27923 }
27924 else
27925 {
27927 resync_fail:
27932 }
27933 }
27939 NULL);
27941 {
27944 }
27947 }
27949 /* OpenMP 2.5:
27950 schedule ( schedule-kind )
27951 schedule ( schedule-kind , expression )
27953 schedule-kind:
27954 static | dynamic | guided | runtime | auto */
27956 static tree
27958 {
27967 {
27972 {
27993 }
27994 }
27999 else
28004 {
28019 else
28024 }
28032 invalid_kind:
28034 resync_fail:
28039 }
28041 /* OpenMP 3.0:
28042 untied */
28044 static tree
28047 {
28048 tree c;
28055 }
28057 /* OpenMP 4.0:
28058 inbranch
28059 notinbranch */
28061 static tree
28064 {
28069 }
28071 /* OpenMP 4.0:
28072 parallel
28073 for
28074 sections
28075 taskgroup */
28077 static tree
28081 {
28085 }
28087 /* OpenMP 4.0:
28088 num_teams ( expression ) */
28090 static tree
28092 location_t location)
28093 {
28115 }
28117 /* OpenMP 4.0:
28118 thread_limit ( expression ) */
28120 static tree
28122 location_t location)
28123 {
28145 }
28147 /* OpenMP 4.0:
28148 aligned ( variable-list )
28149 aligned ( variable-list : constant-expression ) */
28151 static tree
28153 {
28164 {
28174 }
28180 }
28182 /* OpenMP 4.0:
28183 linear ( variable-list )
28184 linear ( variable-list : expression ) */
28186 static tree
28188 {
28199 {
28209 }
28215 }
28217 /* OpenMP 4.0:
28218 safelen ( constant-expression ) */
28220 static tree
28222 location_t location)
28223 {
28244 }
28246 /* OpenMP 4.0:
28247 simdlen ( constant-expression ) */
28249 static tree
28251 location_t location)
28252 {
28273 }
28275 /* OpenMP 4.0:
28276 depend ( depend-kind : variable-list )
28278 depend-kind:
28279 in | out | inout */
28281 static tree
28283 {
28291 {
28301 else
28303 }
28304 else
28312 NULL);
28319 invalid_kind:
28321 resync_fail:
28326 }
28328 /* OpenMP 4.0:
28329 map ( map-kind : variable-list )
28330 map ( variable-list )
28332 map-kind:
28333 alloc | to | from | tofrom */
28335 static tree
28337 {
28346 {
28358 else
28359 {
28365 }
28368 }
28371 NULL);
28377 }
28379 /* OpenMP 4.0:
28380 device ( expression ) */
28382 static tree
28384 location_t location)
28385 {
28407 }
28409 /* OpenMP 4.0:
28410 dist_schedule ( static )
28411 dist_schedule ( static , expression ) */
28413 static tree
28415 location_t location)
28416 {
28429 {
28440 }
28445 location);
28449 invalid_kind:
28451 resync_fail:
28456 }
28458 /* OpenMP 4.0:
28459 proc_bind ( proc-bind-kind )
28461 proc-bind-kind:
28462 master | close | spread */
28464 static tree
28466 location_t location)
28467 {
28468 tree c;
28475 {
28485 else
28487 }
28488 else
28497 location);
28502 invalid_kind:
28504 resync_fail:
28509 }
28511 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28512 is a bitmask in MASK. Return the list of clauses found; the result
28513 of clause default goes in *pdefault. */
28515 static tree
28519 {
28525 {
28526 pragma_omp_clause c_kind;
28537 {
28549 clauses);
28563 clauses);
28572 clauses);
28596 clauses);
28610 clauses);
28625 OMP_CLAUSE_NOTINBRANCH,
28634 {
28635 clause_not_first:
28639 }
28664 clauses);
28669 clauses);
28674 clauses);
28731 }
28736 {
28737 /* Remove the invalid clause(s) from the list to avoid
28738 confusing the rest of the compiler. */
28741 }
28742 }
28743 saw_error:
28748 }
28750 /* OpenMP 2.5:
28751 structured-block:
28752 statement
28754 In practice, we're also interested in adding the statement to an
28755 outer node. So it is convenient if we work around the fact that
28756 cp_parser_statement calls add_stmt. */
28758 static unsigned
28760 {
28763 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28764 This preserves the "not within loop or switch" style error messages
28765 for nonsense cases like
28766 void foo() {
28767 #pragma omp single
28768 break;
28769 }
28770 */
28775 }
28777 static void
28779 {
28781 }
28783 static tree
28785 {
28793 }
28795 /* OpenMP 2.5:
28796 # pragma omp atomic new-line
28797 expression-stmt
28799 expression-stmt:
28800 x binop= expr | x++ | ++x | x-- | --x
28801 binop:
28802 +, *, -, /, &, ^, |, <<, >>
28804 where x is an lvalue expression with scalar type.
28806 OpenMP 3.1:
28807 # pragma omp atomic new-line
28808 update-stmt
28810 # pragma omp atomic read new-line
28811 read-stmt
28813 # pragma omp atomic write new-line
28814 write-stmt
28816 # pragma omp atomic update new-line
28817 update-stmt
28819 # pragma omp atomic capture new-line
28820 capture-stmt
28822 # pragma omp atomic capture new-line
28823 capture-block
28825 read-stmt:
28826 v = x
28827 write-stmt:
28828 x = expr
28829 update-stmt:
28830 expression-stmt | x = x binop expr
28831 capture-stmt:
28832 v = expression-stmt
28833 capture-block:
28834 { v = x; update-stmt; } | { update-stmt; v = x; }
28836 OpenMP 4.0:
28837 update-stmt:
28838 expression-stmt | x = x binop expr | x = expr binop x
28839 capture-stmt:
28840 v = update-stmt
28841 capture-block:
28842 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28844 where x and v are lvalue expressions with scalar type. */
28846 static void
28848 {
28856 {
28868 else
28872 }
28875 {
28880 {
28883 }
28884 }
28888 {
28899 else
28905 {
28906 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28907 opcode. */
28912 }
28916 {
28919 }
28920 else
28921 {
28928 }
28931 }
28933 restart:
28938 {
28945 /* FALLTHROUGH */
28955 /* FALLTHROUGH */
28970 /* Undo effects of boolean_increment for post {in,de}crement. */
28972 /* FALLTHRU */
28976 {
28977 /* Undo effects of boolean_increment. */
28979 {
28980 /* This is pre or post increment. */
28985 && !structured_block
28989 }
28990 }
28991 /* FALLTHRU */
28994 {
29029 {
29033 }
29036 {
29042 {
29047 }
29049 {
29060 {
29062 {
29067 }
29068 else
29070 }
29074 }
29077 {
29084 }
29088 }
29092 {
29095 {
29103 }
29105 {
29110 }
29145 }
29156 /* FALLTHROUGH */
29161 }
29168 }
29169 stmt_done:
29171 {
29184 }
29186 {
29189 }
29190 done:
29196 saw_error:
29199 {
29203 {
29207 }
29208 }
29209 }
29212 /* OpenMP 2.5:
29213 # pragma omp barrier new-line */
29215 static void
29217 {
29220 }
29222 /* OpenMP 2.5:
29223 # pragma omp critical [(name)] new-line
29224 structured-block */
29226 static tree
29228 {
29232 {
29244 }
29249 }
29251 /* OpenMP 2.5:
29252 # pragma omp flush flush-vars[opt] new-line
29254 flush-vars:
29255 ( variable-list ) */
29257 static void
29259 {
29265 }
29267 /* Helper function, to parse omp for increment expression. */
29269 static tree
29271 {
29276 {
29279 }
29282 {
29291 /* Fall through: OpenMP disallows NE_EXPR. */
29294 }
29296 /* If decl is an iterator, preserve LHS and RHS of the relational
29297 expr until finish_omp_for. */
29307 }
29309 /* Helper function, to parse omp for increment expression. */
29311 static tree
29313 {
29317 cp_id_kind idk;
29321 {
29329 }
29337 {
29342 }
29349 {
29353 }
29365 do
29366 {
29373 {
29375 {
29378 else
29380 tf_warning_or_error);
29381 }
29382 else
29385 }
29386 }
29390 {
29394 }
29395 else
29399 }
29401 /* Parse the initialization statement of either an OpenMP for loop or
29402 a Cilk Plus for loop.
29404 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29405 Plus.
29407 Return true if the resulting construct should have an
29408 OMP_CLAUSE_PRIVATE added to it. */
29410 static bool
29418 {
29424 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29426 init-expr:
29427 var = lb
29428 integer-type var = lb
29429 random-access-iterator-type var = lb
29430 pointer-type var = lb
29431 */
29432 cp_decl_specifier_seq type_specifiers;
29434 /* First, try to parse as an initialized declaration. See
29435 cp_parser_condition, from whence the bulk of this is copied. */
29442 {
29443 /* If parsing a type specifier seq succeeded, then this
29444 MUST be a initialized declaration. */
29449 CP_PARSER_DECLARATOR_NAMED,
29459 else
29460 {
29470 {
29472 CPP_OPEN_PAREN))
29473 {
29477 else
29480 }
29481 else
29482 /* Trigger an error. */
29487 }
29491 {
29499 {
29502 auto_node);
29507 }
29510 asm_specification,
29511 LOOKUP_ONLYCONVERTING);
29513 {
29516 }
29517 else
29520 }
29521 else
29522 {
29523 /* Consume '='. */
29527 non_class:
29530 else
29533 asm_specification,
29534 LOOKUP_ONLYCONVERTING);
29535 }
29539 }
29540 }
29541 else
29542 {
29543 cp_id_kind idk;
29544 /* If parsing a type specifier sequence failed, then
29545 this MUST be a simple expression. */
29550 && decl
29553 {
29554 tree rhs;
29561 rhs,
29562 tf_warning_or_error));
29564 }
29565 else
29566 {
29571 {
29575 }
29576 }
29577 }
29579 }
29581 /* Parse the restricted form of the for statement allowed by OpenMP. */
29583 static tree
29586 {
29590 location_t loc_first;
29609 {
29612 location_t loc;
29615 {
29618 }
29627 add_private_clause
29635 {
29638 {
29644 }
29645 else
29647 }
29654 {
29659 {
29663 }
29666 {
29667 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29668 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29677 }
29678 else
29679 {
29684 }
29685 }
29688 {
29689 tree c;
29691 {
29700 decl);
29704 decl);
29705 }
29707 {
29712 {
29715 }
29716 }
29717 }
29726 {
29727 /* If decl is an iterator, preserve the operator on decl
29728 until finish_omp_for. */
29730 && ((processing_template_decl
29734 else
29738 }
29753 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29754 in between the collapsed for loops to be still considered perfectly
29755 nested. Hopefully the final version clarifies this.
29756 For now handle (multiple) {'s and empty statements. */
29758 do
29759 {
29763 {
29765 bracecount++;
29766 }
29770 else
29771 {
29778 }
29779 }
29783 {
29786 }
29787 }
29789 /* Note that we saved the original contents of this flag when we entered
29790 the structured block, and so we don't need to re-save it here. */
29793 else
29796 /* Note that the grammar doesn't call for a structured block here,
29797 though the loop as a whole is a structured block. */
29804 else
29809 {
29811 {
29813 nbraces--;
29814 }
29817 else
29818 {
29820 {
29823 }
29828 }
29829 }
29836 }
29838 /* Helper function for OpenMP parsing, split clauses and call
29839 finish_omp_clauses on each of the set of clauses afterwards. */
29841 static void
29844 {
29850 }
29852 /* OpenMP 4.0:
29853 #pragma omp simd simd-clause[optseq] new-line
29854 for-loop */
29856 #define OMP_SIMD_CLAUSE_MASK \
29857 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29865 static tree
29868 {
29880 {
29883 }
29894 }
29896 /* OpenMP 2.5:
29897 #pragma omp for for-clause[optseq] new-line
29898 for-loop
29900 OpenMP 4.0:
29901 #pragma omp for simd for-simd-clause[optseq] new-line
29902 for-loop */
29904 #define OMP_FOR_CLAUSE_MASK \
29905 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29910 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29914 static tree
29917 {
29928 {
29933 {
29941 cclauses);
29945 cclauses);
29957 }
29958 }
29960 {
29963 }
29968 {
29971 }
29982 }
29984 /* OpenMP 2.5:
29985 # pragma omp master new-line
29986 structured-block */
29988 static tree
29990 {
29994 }
29996 /* OpenMP 2.5:
29997 # pragma omp ordered new-line
29998 structured-block */
30000 static tree
30002 {
30006 }
30008 /* OpenMP 2.5:
30010 section-scope:
30011 { section-sequence }
30013 section-sequence:
30014 section-directive[opt] structured-block
30015 section-sequence section-directive structured-block */
30017 static tree
30019 {
30030 {
30034 }
30037 {
30045 {
30049 }
30051 {
30054 }
30059 }
30070 }
30072 /* OpenMP 2.5:
30073 # pragma omp sections sections-clause[optseq] newline
30074 sections-scope */
30076 #define OMP_SECTIONS_CLAUSE_MASK \
30077 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30083 static tree
30086 {
30098 {
30101 }
30108 }
30110 /* OpenMP 2.5:
30111 # pragma parallel parallel-clause new-line
30112 # pragma parallel for parallel-for-clause new-line
30113 # pragma parallel sections parallel-sections-clause new-line
30115 OpenMP 4.0:
30116 # pragma parallel for simd parallel-for-simd-clause new-line */
30118 #define OMP_PARALLEL_CLAUSE_MASK \
30119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30129 static tree
30132 {
30141 {
30154 block);
30157 }
30159 {
30163 }
30165 {
30168 }
30170 {
30174 {
30184 block);
30187 }
30188 }
30198 }
30200 /* OpenMP 2.5:
30201 # pragma omp single single-clause[optseq] new-line
30202 structured-block */
30204 #define OMP_SINGLE_CLAUSE_MASK \
30205 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30210 static tree
30212 {
30222 }
30224 /* OpenMP 3.0:
30225 # pragma omp task task-clause[optseq] new-line
30226 structured-block */
30228 #define OMP_TASK_CLAUSE_MASK \
30229 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30239 static tree
30241 {
30252 }
30254 /* OpenMP 3.0:
30255 # pragma omp taskwait new-line */
30257 static void
30259 {
30262 }
30264 /* OpenMP 3.1:
30265 # pragma omp taskyield new-line */
30267 static void
30269 {
30272 }
30274 /* OpenMP 4.0:
30275 # pragma omp taskgroup new-line
30276 structured-block */
30278 static tree
30280 {
30284 }
30287 /* OpenMP 2.5:
30288 # pragma omp threadprivate (variable-list) */
30290 static void
30292 {
30293 tree vars;
30299 }
30301 /* OpenMP 4.0:
30302 # pragma omp cancel cancel-clause[optseq] new-line */
30304 #define OMP_CANCEL_CLAUSE_MASK \
30305 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30311 static void
30313 {
30317 }
30319 /* OpenMP 4.0:
30320 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30322 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30323 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30328 static void
30330 {
30331 tree clauses;
30335 {
30340 {
30343 }
30344 }
30346 {
30350 }
30353 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30355 pragma_tok);
30357 }
30359 /* OpenMP 4.0:
30360 #pragma omp distribute distribute-clause[optseq] new-line
30361 for-loop */
30363 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30364 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30369 static tree
30372 {
30381 {
30389 else
30392 {
30398 {
30401 cclauses);
30402 else
30404 cclauses);
30405 }
30410 cclauses);
30411 else
30413 cclauses);
30425 }
30426 }
30428 {
30431 }
30436 {
30439 }
30450 }
30452 /* OpenMP 4.0:
30453 # pragma omp teams teams-clause[optseq] new-line
30454 structured-block */
30456 #define OMP_TEAMS_CLAUSE_MASK \
30457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30465 static tree
30468 {
30477 {
30481 {
30489 cclauses);
30493 cclauses);
30504 }
30505 }
30507 {
30510 }
30515 {
30518 }
30526 }
30528 /* OpenMP 4.0:
30529 # pragma omp target data target-data-clause[optseq] new-line
30530 structured-block */
30532 #define OMP_TARGET_DATA_CLAUSE_MASK \
30533 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30537 static tree
30539 {
30551 }
30553 /* OpenMP 4.0:
30554 # pragma omp target update target-update-clause[optseq] new-line */
30556 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30557 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30562 static bool
30565 {
30567 {
30569 "%<#pragma omp target update%> may only be "
30573 }
30575 tree clauses
30580 {
30582 "%<#pragma omp target update must contain at least one "
30585 }
30593 }
30595 /* OpenMP 4.0:
30596 # pragma omp target target-clause[optseq] new-line
30597 structured-block */
30599 #define OMP_TARGET_CLAUSE_MASK \
30600 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30604 static bool
30607 {
30609 {
30613 }
30616 {
30621 {
30646 }
30648 {
30651 }
30653 {
30657 }
30659 {
30662 }
30663 }
30677 }
30679 /* OpenMP 4.0:
30680 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30682 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30683 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30690 static void
30693 {
30695 cp_omp_declare_simd_data data;
30697 {
30702 }
30713 {
30717 {
30730 }
30735 "%<#pragma omp declare simd%> not immediately followed by "
30739 }
30740 }
30742 /* Finalize #pragma omp declare simd clauses after direct declarator has
30743 been parsed, and put that into "omp declare simd" attribute. */
30745 static tree
30747 {
30753 {
30758 }
30763 {
30781 }
30785 }
30788 /* OpenMP 4.0:
30789 # pragma omp declare target new-line
30790 declarations and definitions
30791 # pragma omp end declare target new-line */
30793 static void
30795 {
30798 }
30800 static void
30802 {
30805 {
30808 }
30810 {
30814 {
30817 }
30820 else
30821 {
30825 }
30826 }
30827 else
30828 {
30832 }
30836 "%<#pragma omp end declare target%> without corresponding "
30838 else
30840 }
30842 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30843 expression and optional initializer clause of
30844 #pragma omp declare reduction. We store the expression(s) as
30845 either 3, 6 or 7 special statements inside of the artificial function's
30846 body. The first two statements are DECL_EXPRs for the artificial
30847 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30848 expression that uses those variables.
30849 If there was any INITIALIZER clause, this is followed by further statements,
30850 the fourth and fifth statements are DECL_EXPRs for the artificial
30851 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30852 constructor variant (first token after open paren is not omp_priv),
30853 then the sixth statement is a statement with the function call expression
30854 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30855 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30856 to initialize the OMP_PRIV artificial variable and there is seventh
30857 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30859 static bool
30861 {
30873 tree combiner;
30888 {
30891 }
30894 {
30901 {
30904 }
30920 {
30924 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30928 == CPP_CLOSE_PAREN
30931 {
30935 }
30940 }
30941 else
30942 {
30958 {
30963 }
30965 tree arg;
30978 }
30989 }
30995 }
30997 /* OpenMP 4.0
30998 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30999 initializer-clause[opt] new-line
31001 initializer-clause:
31002 initializer (omp_priv initializer)
31003 initializer (function-name (argument-list)) */
31005 static void
31008 {
31021 {
31053 }
31065 /* Types may not be defined in declare reduction type list. */
31068 parser->type_definition_forbidden_message
31074 saved_colon_doesnt_start_class_def_p
31079 {
31083 ;
31104 else
31109 else
31111 }
31113 /* Restore the saved message. */
31116 parser->colon_doesnt_start_class_def_p
31121 {
31122 fail:
31126 }
31132 {
31133 tree fntype
31136 NULL_TREE);
31155 {
31160 }
31162 {
31164 {
31173 }
31180 }
31181 else
31182 {
31185 }
31188 else
31191 {
31194 }
31196 {
31199 else
31204 }
31209 else
31210 {
31219 }
31226 }
31230 }
31232 /* OpenMP 4.0
31233 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31234 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31235 initializer-clause[opt] new-line
31236 #pragma omp declare target new-line */
31238 static void
31241 {
31243 {
31248 {
31251 context);
31253 }
31256 {
31259 context);
31261 }
31263 {
31266 }
31268 {
31272 }
31273 }
31277 }
31279 /* Main entry point to OpenMP statement pragmas. */
31281 static void
31283 {
31284 tree stmt;
31289 {
31337 }
31341 }
31342 \f
31343 /* Transactional Memory parsing routines. */
31345 /* Parse a transaction attribute.
31347 txn-attribute:
31348 attribute
31349 [ [ identifier ] ]
31351 ??? Simplify this when C++0x bracket attributes are
31352 implemented properly. */
31354 static tree
31356 {
31371 {
31375 /* For keywords, use the canonical spelling,
31376 not the parsed identifier. */
31380 }
31381 else
31385 error1:
31388 }
31390 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31392 transaction-statement:
31393 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31394 compound-statement
31395 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31396 */
31398 static tree
31400 {
31415 else
31416 {
31420 }
31422 /* Parse a noexcept specification. */
31425 /* Keep track if we're in the lexical scope of an outer transaction. */
31437 }
31439 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31441 transaction-expression:
31442 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31443 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31444 */
31446 static tree
31448 {
31473 /* Set this early. This might mean that we allow transaction_cancel in
31474 an expression that we find out later actually has to be a constexpr.
31475 However, we expect that cxx_constant_value will be able to deal with
31476 this; also, if the noexcept has no constexpr, then what we parse next
31477 really is a transaction's body. */
31480 /* Parse a noexcept specification. */
31486 {
31493 }
31494 else
31495 {
31496 /* The only expression that is available got parsed for the noexcept
31497 already. noexcept is true then. */
31500 }
31509 }
31511 /* Parse a function-transaction-block.
31513 function-transaction-block:
31514 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31515 function-body
31516 __transaction_atomic txn-attribute[opt] function-try-block
31517 __transaction_relaxed ctor-initializer[opt] function-body
31518 __transaction_relaxed function-try-block
31519 */
31521 static bool
31523 {
31539 else
31540 {
31544 }
31552 else
31553 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31561 }
31563 /* Parse a __transaction_cancel statement.
31565 cancel-statement:
31566 __transaction_cancel txn-attribute[opt] ;
31567 __transaction_cancel txn-attribute[opt] throw-expression ;
31569 ??? Cancel and throw is not yet implemented. */
31571 static tree
31573 {
31579 RT_TRANSACTION_CANCEL);
31586 /* ??? Parse cancel-and-throw here. */
31591 {
31595 }
31597 {
31601 }
31603 {
31606 {
31612 }
31613 }
31615 {
31619 }
31625 }
31626 \f
31627 /* The parser. */
31631 \f
31632 /* Special handling for the first token or line in the file. The first
31633 thing in the file might be #pragma GCC pch_preprocess, which loads a
31634 PCH file, which is a GC collection point. So we need to handle this
31635 first pragma without benefit of an existing lexer structure.
31637 Always returns one token to the caller in *FIRST_TOKEN. This is
31638 either the true first token of the file, or the first token after
31639 the initial pragma. */
31641 static void
31643 {
31652 {
31659 }
31660 else
31663 /* Skip to the end of the pragma. */
31667 /* Now actually load the PCH file. */
31671 /* Read one more token to return to our caller. We have to do this
31672 after reading the PCH file in, since its pointers have to be
31673 live. */
31675 }
31677 /* Normal parsing of a pragma token. Here we can (and must) use the
31678 regular lexer. */
31680 static bool
31682 {
31694 {
31702 {
31712 }
31717 {
31727 }
31732 {
31738 "%<#pragma omp taskwait%> may only be "
31743 }
31748 {
31754 "%<#pragma omp taskyield%> may only be "
31759 }
31764 {
31770 "%<#pragma omp cancel%> may only be "
31775 }
31780 {
31786 "%<#pragma omp cancellation point%> may only be "
31791 }
31829 "%<#pragma omp section%> may only be used in "
31834 {
31841 {
31844 }
31847 }
31851 {
31855 }
31864 bad_stmt:
31867 }
31871 }
31873 /* The interface the pragma parsers have to the lexer. */
31875 enum cpp_ttype
31877 {
31890 else
31891 {
31895 }
31898 }
31900 \f
31901 /* External interface. */
31903 /* Parse one entire translation unit. */
31905 void
31907 {
31911 {
31914 }
31922 }
31924 /* Parses the Cilk Plus #pragma simd vectorlength clause:
31925 Syntax:
31926 vectorlength ( constant-expression ) */
31928 static tree
31930 {
31932 tree expr;
31933 /* The vectorlength clause behaves exactly like OpenMP's safelen
31934 clause. Thus, vectorlength is represented as OMP 4.0
31935 safelen. */
31948 {
31953 }
31958 }
31960 /* Handles the Cilk Plus #pragma simd linear clause.
31961 Syntax:
31962 linear ( simd-linear-variable-list )
31964 simd-linear-variable-list:
31965 simd-linear-variable
31966 simd-linear-variable-list , simd-linear-variable
31968 simd-linear-variable:
31969 id-expression
31970 id-expression : simd-linear-step
31972 simd-linear-step:
31973 conditional-expression */
31975 static tree
31977 {
31983 {
31987 }
31992 {
31995 {
31999 }
32006 {
32010 }
32011 else
32012 {
32016 /* If present, parse the linear step. Otherwise, assume the default
32017 value of 1. */
32019 {
32026 {
32027 /* If an error has occurred, then the whole pragma is
32028 considered ill-formed. Thus, no reason to keep
32029 parsing. */
32032 }
32040 else
32042 "step size must be an integer constant "
32044 }
32046 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32052 }
32057 else
32058 {
32063 }
32064 }
32068 }
32070 /* Returns the name of the next clause. If the clause is not
32071 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32072 token is not consumed. Otherwise, the appropriate enum from the
32073 pragma_simd_clause is returned and the token is consumed. */
32075 static pragma_cilk_clause
32077 {
32078 pragma_cilk_clause clause_type;
32095 else
32100 }
32102 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32104 static tree
32106 {
32111 {
32112 pragma_cilk_clause c_kind;
32119 /* Use the OpenMP 4.0 equivalent function. */
32122 /* Use the OpenMP 4.0 equivalent function. */
32124 clauses);
32126 /* Use the OMP 4.0 equivalent function. */
32128 clauses);
32130 /* Use the OMP 4.0 equivalent function. */
32132 else
32133 {
32137 }
32138 }
32144 else
32146 }
32148 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32150 static void
32152 {
32159 {
32163 }
32173 }
32175 /* Create an identifier for a generic parameter type (a synthesized
32176 template parameter implied by `auto' or a concept identifier). */
32179 static tree
32181 {
32185 }
32187 /* Predicate that behaves as is_auto_or_concept but matches the parent
32188 node of the generic type rather than the generic type itself. This
32189 allows for type transformation in add_implicit_template_parms. */
32193 {
32195 }
32197 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32198 (creating a new template parameter list if necessary). Returns the newly
32199 created template type parm. */
32201 tree
32203 {
32206 /* We are either continuing a function template that already contains implicit
32207 template parameters, creating a new fully-implicit function template, or
32208 extending an existing explicit function template with implicit template
32209 parameters. */
32217 {
32221 }
32222 else
32223 {
32224 /* Roll back to the existing template parameter scope (in the case of
32225 extending an explicit function template) or introduce a new template
32226 parameter scope ahead of the function parameter scope (or class scope
32227 in the case of out-of-line member definitions). The function scope is
32228 added back after template parameter synthesis below. */
32233 {
32236 }
32240 {
32243 }
32248 {
32249 /* Introduce a new template parameter list for implicit template
32250 parameters. */
32254 parser->implicit_template_scope
32261 }
32262 else
32263 {
32264 /* Synthesize implicit template parameters at the end of the explicit
32265 template parameter list. */
32272 parser->implicit_template_parms
32274 }
32275 }
32277 /* Synthesize a new template parameter and track the current template
32278 parameter chain with implicit_template_parms. */
32282 synth_id);
32283 tree new_parm
32285 input_location,
32292 parser->implicit_template_parms
32294 else
32299 /* If creating a fully implicit function template, start the new implicit
32300 template parameter list with this synthesized type, otherwise grow the
32301 current template parameter list. */
32304 {
32311 }
32312 else
32313 {
32318 }
32323 }
32325 /* Finish the declaration of a fully implicit function template. Such a
32326 template has no explicit template parameter list so has not been through the
32327 normal template head and tail processing. synthesize_implicit_template_parm
32328 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32329 provided if the declaration is a class member such that its template
32330 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32331 form is returned. Otherwise NULL_TREE is returned. */
32333 tree
32335 {
32340 {
32344 }
32354 }