| blob | 2e117a53155c0feeec84154e91bb627ddffe1e1b |
1 /* C++ Parser.
2 Copyright (C) 2000-2014 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/>. */
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
186 /* Prototypes. */
192 static void cp_lexer_destroy
194 static int cp_lexer_saving_tokens
198 static void cp_lexer_get_preprocessor_token
206 static bool cp_lexer_next_token_is_not
208 static bool cp_lexer_next_token_is_keyword
212 static void cp_lexer_purge_token
214 static void cp_lexer_purge_tokens_after
216 static void cp_lexer_save_tokens
218 static void cp_lexer_commit_tokens
220 static void cp_lexer_rollback_tokens
222 static void cp_lexer_print_token
226 static void cp_lexer_start_debugging
228 static void cp_lexer_stop_debugging
234 static void cp_parser_initial_pragma
237 static tree cp_literal_operator_id
240 static void cp_parser_cilk_simd
242 static bool cp_parser_omp_declare_reduction_exprs
244 static tree cp_parser_cilk_simd_vectorlength
247 /* Manifest constants. */
248 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
249 #define CP_SAVED_TOKEN_STACK 5
251 /* Variables. */
253 /* The stream to which debugging output should be written. */
256 /* Nonzero if we are parsing an unevaluated operand: an operand to
257 sizeof, typeof, or alignof. */
260 /* Dump up to NUM tokens in BUFFER to FILE starting with token
261 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
262 first token in BUFFER. If NUM is 0, dump all the tokens. If
263 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
264 highlighted by surrounding it in [[ ]]. */
266 static void
270 {
287 {
290 }
295 {
302 nprinted++;
312 {
322 }
323 }
326 {
329 }
332 }
335 /* Dump all tokens in BUFFER to stderr. */
337 void
339 {
341 }
343 DEBUG_FUNCTION void
345 {
347 }
349 DEBUG_FUNCTION void
351 {
354 else
356 }
359 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
360 description for T. */
362 static void
364 {
366 {
369 }
370 }
373 /* Dump parser context C to FILE. */
375 static void
377 {
382 }
385 /* Print the stack of parsing contexts to FILE starting with FIRST. */
387 static void
389 {
395 {
398 }
399 }
402 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
404 static void
406 {
409 }
412 /* Print an unparsed function entry UF to FILE. */
414 static void
416 {
419 tree fn;
424 i++)
425 {
431 }
436 {
439 }
445 {
448 }
450 }
453 /* Print the stack of unparsed member functions S to FILE. */
455 static void
458 {
464 {
467 }
468 }
471 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
472 the given PARSER. If FILE is NULL, the output is printed on stderr. */
474 static void
476 {
488 next_token);
489 }
492 /* Dump debugging information for the given PARSER. If FILE is NULL,
493 the output is printed on stderr. */
495 void
497 {
500 expanded_location eloc;
578 }
580 DEBUG_FUNCTION void
582 {
584 }
586 DEBUG_FUNCTION void
588 {
591 else
593 }
595 /* Allocate memory for a new lexer object and return it. */
599 {
604 /* Allocate the memory. */
607 /* Initially we are not debugging. */
612 /* Create the buffer. */
616 }
619 /* Create a new main C++ lexer, the lexer that gets tokens from the
620 preprocessor. */
624 {
626 cp_token token;
628 /* It's possible that parsing the first pragma will load a PCH file,
629 which is a GC collection point. So we have to do that before
630 allocating any memory. */
635 /* Put the first token in the buffer. */
638 /* Get the remaining tokens from the preprocessor. */
640 {
643 }
652 /* Subsequent preprocessor diagnostics should use compiler
653 diagnostic functions to get the compiler source location. */
658 }
660 /* Create a new lexer whose token stream is primed with the tokens in
661 CACHE. When these tokens are exhausted, no new tokens will be read. */
665 {
670 /* We do not own the buffer. */
677 /* Initially we are not debugging. */
682 }
684 /* Frees all resources associated with LEXER. */
686 static void
688 {
692 }
694 /* Returns nonzero if debugging information should be output. */
698 {
700 }
705 {
709 }
713 {
715 }
719 {
721 }
725 {
728 else
730 }
734 {
738 }
740 /* nonzero if we are presently saving tokens. */
744 {
746 }
748 /* Store the next token from the preprocessor in *TOKEN. Return true
749 if we reach EOF. If LEXER is NULL, assume we are handling an
750 initial #pragma pch_preprocess, and thus want the lexer to return
751 processed strings. */
753 static void
755 {
758 /* Get a new token from the preprocessor. */
759 token->type
766 /* On some systems, some header files are surrounded by an
767 implicit extern "C" block. Set a flag in the token if it
768 comes from such a header. */
773 /* Check to see if this token is a keyword. */
775 {
777 {
778 /* Mark this token as a keyword. */
780 /* Record which keyword. */
782 }
783 else
784 {
788 {
789 /* Warn about the C++0x keyword (but still treat it as
790 an identifier). */
795 /* Clear out the C_RID_CODE so we don't warn about this
796 particular identifier-turned-keyword again. */
798 }
802 }
803 }
805 {
806 /* This only happens in Objective-C++; it must be a keyword. */
809 {
810 /* Replace 'class' with '@class', 'private' with '@private',
811 etc. This prevents confusion with the C++ keyword
812 'class', and makes the tokens consistent with other
813 Objective-C 'AT' keywords. For example '@class' is
814 reported as RID_AT_CLASS which is consistent with
815 '@synchronized', which is reported as
816 RID_AT_SYNCHRONIZED.
817 */
826 }
827 }
829 {
830 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
834 }
835 }
837 /* Update the globals input_location and the input file stack from TOKEN. */
840 {
842 {
844 }
845 }
847 /* Update the globals input_location and the input file stack from LEXER. */
850 {
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 cp_parser_late_parsing_cilk_simd_fn_info
2131 static tree synthesize_implicit_template_parm
2133 static tree finish_fully_implicit_template
2136 /* Classes [gram.class] */
2138 static tree cp_parser_class_name
2140 static tree cp_parser_class_specifier
2142 static tree cp_parser_class_head
2144 static enum tag_types cp_parser_class_key
2146 static void cp_parser_member_specification_opt
2148 static void cp_parser_member_declaration
2150 static tree cp_parser_pure_specifier
2152 static tree cp_parser_constant_initializer
2155 /* Derived classes [gram.class.derived] */
2157 static tree cp_parser_base_clause
2159 static tree cp_parser_base_specifier
2162 /* Special member functions [gram.special] */
2164 static tree cp_parser_conversion_function_id
2166 static tree cp_parser_conversion_type_id
2170 static bool cp_parser_ctor_initializer_opt
2172 static void cp_parser_mem_initializer_list
2174 static tree cp_parser_mem_initializer
2176 static tree cp_parser_mem_initializer_id
2179 /* Overloading [gram.over] */
2181 static tree cp_parser_operator_function_id
2183 static tree cp_parser_operator
2186 /* Templates [gram.temp] */
2188 static void cp_parser_template_declaration
2190 static tree cp_parser_template_parameter_list
2192 static tree cp_parser_template_parameter
2194 static tree cp_parser_type_parameter
2196 static tree cp_parser_template_id
2198 static tree cp_parser_template_name
2200 static tree cp_parser_template_argument_list
2202 static tree cp_parser_template_argument
2204 static void cp_parser_explicit_instantiation
2206 static void cp_parser_explicit_specialization
2209 /* Exception handling [gram.exception] */
2211 static tree cp_parser_try_block
2213 static bool cp_parser_function_try_block
2215 static void cp_parser_handler_seq
2217 static void cp_parser_handler
2219 static tree cp_parser_exception_declaration
2221 static tree cp_parser_throw_expression
2223 static tree cp_parser_exception_specification_opt
2225 static tree cp_parser_type_id_list
2228 /* GNU Extensions */
2230 static tree cp_parser_asm_specification_opt
2232 static tree cp_parser_asm_operand_list
2234 static tree cp_parser_asm_clobber_list
2236 static tree cp_parser_asm_label_list
2238 static bool cp_next_tokens_can_be_attribute_p
2240 static bool cp_next_tokens_can_be_gnu_attribute_p
2242 static bool cp_next_tokens_can_be_std_attribute_p
2244 static bool cp_nth_tokens_can_be_std_attribute_p
2246 static bool cp_nth_tokens_can_be_gnu_attribute_p
2248 static bool cp_nth_tokens_can_be_attribute_p
2250 static tree cp_parser_attributes_opt
2252 static tree cp_parser_gnu_attributes_opt
2254 static tree cp_parser_gnu_attribute_list
2256 static tree cp_parser_std_attribute
2258 static tree cp_parser_std_attribute_spec
2260 static tree cp_parser_std_attribute_spec_seq
2262 static bool cp_parser_extension_opt
2264 static void cp_parser_label_declaration
2267 /* Transactional Memory Extensions */
2269 static tree cp_parser_transaction
2271 static tree cp_parser_transaction_expression
2273 static bool cp_parser_function_transaction
2275 static tree cp_parser_transaction_cancel
2279 pragma_external,
2280 pragma_member,
2281 pragma_objc_icode,
2282 pragma_stmt,
2283 pragma_compound
2284 };
2285 static bool cp_parser_pragma
2288 /* Objective-C++ Productions */
2290 static tree cp_parser_objc_message_receiver
2292 static tree cp_parser_objc_message_args
2294 static tree cp_parser_objc_message_expression
2296 static tree cp_parser_objc_encode_expression
2298 static tree cp_parser_objc_defs_expression
2300 static tree cp_parser_objc_protocol_expression
2302 static tree cp_parser_objc_selector_expression
2304 static tree cp_parser_objc_expression
2306 static bool cp_parser_objc_selector_p
2308 static tree cp_parser_objc_selector
2310 static tree cp_parser_objc_protocol_refs_opt
2312 static void cp_parser_objc_declaration
2314 static tree cp_parser_objc_statement
2316 static bool cp_parser_objc_valid_prefix_attributes
2318 static void cp_parser_objc_at_property_declaration
2320 static void cp_parser_objc_at_synthesize_declaration
2322 static void cp_parser_objc_at_dynamic_declaration
2324 static tree cp_parser_objc_struct_declaration
2327 /* Utility Routines */
2329 static tree cp_parser_lookup_name
2331 static tree cp_parser_lookup_name_simple
2333 static tree cp_parser_maybe_treat_template_as_class
2335 static bool cp_parser_check_declarator_template_parameters
2337 static bool cp_parser_check_template_parameters
2339 static tree cp_parser_simple_cast_expression
2341 static tree cp_parser_global_scope_opt
2343 static bool cp_parser_constructor_declarator_p
2345 static tree cp_parser_function_definition_from_specifiers_and_declarator
2347 static tree cp_parser_function_definition_after_declarator
2349 static void cp_parser_template_declaration_after_export
2351 static void cp_parser_perform_template_parameter_access_checks
2353 static tree cp_parser_single_declaration
2355 static tree cp_parser_functional_cast
2357 static tree cp_parser_save_member_function_body
2359 static tree cp_parser_save_nsdmi
2361 static tree cp_parser_enclosed_template_argument_list
2363 static void cp_parser_save_default_args
2365 static void cp_parser_late_parsing_for_member
2367 static tree cp_parser_late_parse_one_default_arg
2369 static void cp_parser_late_parsing_nsdmi
2371 static void cp_parser_late_parsing_default_args
2373 static tree cp_parser_sizeof_operand
2375 static tree cp_parser_trait_expr
2377 static bool cp_parser_declares_only_class_p
2379 static void cp_parser_set_storage_class
2381 static void cp_parser_set_decl_spec_type
2383 static void set_and_check_decl_spec_loc
2386 static bool cp_parser_friend_p
2388 static void cp_parser_required_error
2394 static bool cp_parser_token_starts_function_definition_p
2396 static bool cp_parser_next_token_starts_class_definition_p
2398 static bool cp_parser_next_token_ends_template_argument_p
2400 static bool cp_parser_nth_token_starts_template_argument_list_p
2402 static enum tag_types cp_parser_token_is_class_key
2404 static void cp_parser_check_class_key
2406 static void cp_parser_check_access_in_redeclaration
2408 static bool cp_parser_optional_template_keyword
2410 static void cp_parser_pre_parsed_nested_name_specifier
2412 static bool cp_parser_cache_group
2414 static tree cp_parser_cache_defarg
2416 static void cp_parser_parse_tentatively
2418 static void cp_parser_commit_to_tentative_parse
2420 static void cp_parser_commit_to_topmost_tentative_parse
2422 static void cp_parser_abort_tentative_parse
2424 static bool cp_parser_parse_definitely
2428 static bool cp_parser_uncommitted_to_tentative_parse_p
2430 static void cp_parser_error
2432 static void cp_parser_name_lookup_error
2434 static bool cp_parser_simulate_error
2436 static bool cp_parser_check_type_definition
2438 static void cp_parser_check_for_definition_in_return_type
2440 static void cp_parser_check_for_invalid_template_id
2442 static bool cp_parser_non_integral_constant_expression
2444 static void cp_parser_diagnose_invalid_type_name
2446 static bool cp_parser_parse_and_diagnose_invalid_type_name
2448 static int cp_parser_skip_to_closing_parenthesis
2450 static void cp_parser_skip_to_end_of_statement
2452 static void cp_parser_consume_semicolon_at_end_of_statement
2454 static void cp_parser_skip_to_end_of_block_or_statement
2456 static bool cp_parser_skip_to_closing_brace
2458 static void cp_parser_skip_to_end_of_template_parameter_list
2460 static void cp_parser_skip_to_pragma_eol
2462 static bool cp_parser_error_occurred
2464 static bool cp_parser_allow_gnu_extensions_p
2466 static bool cp_parser_is_pure_string_literal
2468 static bool cp_parser_is_string_literal
2470 static bool cp_parser_is_keyword
2472 static tree cp_parser_make_typename_type
2477 /* Returns nonzero if we are parsing tentatively. */
2481 {
2483 }
2485 /* Returns nonzero if TOKEN is a string literal. */
2487 static bool
2489 {
2495 }
2497 /* Returns nonzero if TOKEN is a string literal
2498 of a user-defined string literal. */
2500 static bool
2502 {
2509 }
2511 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2513 static bool
2515 {
2517 }
2519 /* If not parsing tentatively, issue a diagnostic of the form
2520 FILE:LINE: MESSAGE before TOKEN
2521 where TOKEN is the next token in the input stream. MESSAGE
2522 (specified by the caller) is usually of the form "expected
2523 OTHER-TOKEN". */
2525 static void
2527 {
2529 {
2531 /* This diagnostic makes more sense if it is tagged to the line
2532 of the token we just peeked at. */
2536 {
2541 }
2544 /* Because c_parser_error does not understand
2545 CPP_KEYWORD, keywords are treated like
2546 identifiers. */
2549 }
2550 }
2552 /* Issue an error about name-lookup failing. NAME is the
2553 IDENTIFIER_NODE DECL is the result of
2554 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2555 the thing that we hoped to find. */
2557 static void
2559 tree name,
2560 tree decl,
2561 name_lookup_error desired,
2562 location_t location)
2563 {
2564 /* If name lookup completely failed, tell the user that NAME was not
2565 declared. */
2567 {
2580 else
2582 }
2584 {
2586 {
2603 }
2604 }
2606 {
2608 {
2618 name);
2622 }
2623 }
2624 else
2625 {
2627 {
2640 }
2641 }
2642 }
2644 /* If we are parsing tentatively, remember that an error has occurred
2645 during this tentative parse. Returns true if the error was
2646 simulated; false if a message should be issued by the caller. */
2648 static bool
2650 {
2652 {
2655 }
2657 }
2659 /* This function is called when a type is defined. If type
2660 definitions are forbidden at this point, an error message is
2661 issued. */
2663 static bool
2665 {
2666 /* If types are forbidden here, issue a message. */
2668 {
2669 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2670 in the message need to be interpreted. */
2673 }
2675 }
2677 /* This function is called when the DECLARATOR is processed. The TYPE
2678 was a type defined in the decl-specifiers. If it is invalid to
2679 define a type in the decl-specifiers for DECLARATOR, an error is
2680 issued. TYPE_LOCATION is the location of TYPE and is used
2681 for error reporting. */
2683 static void
2686 {
2687 /* [dcl.fct] forbids type definitions in return types.
2688 Unfortunately, it's not easy to know whether or not we are
2689 processing a return type until after the fact. */
2697 {
2702 type);
2703 }
2704 }
2706 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2707 "<" in any valid C++ program. If the next token is indeed "<",
2708 issue a message warning the user about what appears to be an
2709 invalid attempt to form a template-id. LOCATION is the location
2710 of the type-specifier (TYPE) */
2712 static void
2714 tree type,
2716 location_t location)
2717 {
2721 {
2725 {
2728 else
2730 }
2731 else
2733 /* Remember the location of the invalid "<". */
2736 /* Consume the "<". */
2738 /* Parse the template arguments. */
2740 /* Permanently remove the invalid template arguments so that
2741 this error message is not issued again. */
2744 }
2745 }
2747 /* If parsing an integral constant-expression, issue an error message
2748 about the fact that THING appeared and return true. Otherwise,
2749 return false. In either case, set
2750 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2752 static bool
2754 non_integral_constant thing)
2755 {
2758 {
2760 {
2763 {
2770 "enumeration type cannot appear in a "
2861 }
2865 }
2866 }
2868 }
2870 /* Emit a diagnostic for an invalid type name. SCOPE is the
2871 qualifying scope (or NULL, if none) for ID. This function commits
2872 to the current active tentative parse, if any. (Otherwise, the
2873 problematic construct might be encountered again later, resulting
2874 in duplicate error messages.) LOCATION is the location of ID. */
2876 static void
2879 location_t location)
2880 {
2883 /* Try to lookup the identifier. */
2888 /* If the lookup found a template-name, it means that the user forgot
2889 to specify an argument list. Emit a useful error message. */
2893 decl);
2897 /* Something like 'unsigned A a;' */
2900 {
2901 /* Issue an error message. */
2903 /* If we're in a template class, it's possible that the user was
2904 referring to a type from a base class. For example:
2906 template <typename T> struct A { typedef T X; };
2907 template <typename T> struct B : public A<T> { X x; };
2909 The user should have said "typename A<T>::X". */
2915 {
2916 tree b;
2919 b;
2921 {
2925 {
2926 tree field;
2927 /* Go from a particular instantiation of the
2928 template (which will have an empty TYPE_FIELDs),
2929 to the main version. */
2932 field;
2936 {
2941 }
2944 }
2945 }
2946 }
2947 }
2948 /* Here we diagnose qualified-ids where the scope is actually correct,
2949 but the identifier does not resolve to a valid type name. */
2951 {
2953 {
2958 else
2962 }
2965 {
2966 /* A<T>::A<T>() */
2972 }
2979 {
2984 else
2988 }
2989 else
2991 }
2992 }
2994 /* Check for a common situation where a type-name should be present,
2995 but is not, and issue a sensible error message. Returns true if an
2996 invalid type-name was detected.
2998 The situation handled by this function are variable declarations of the
2999 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3000 Usually, `ID' should name a type, but if we got here it means that it
3001 does not. We try to emit the best possible error message depending on
3002 how exactly the id-expression looks like. */
3004 static bool
3006 {
3007 tree id;
3010 /* Avoid duplicate error about ambiguous lookup. */
3012 {
3016 }
3025 /* If the next token is a (, this is a function with no explicit return
3026 type, i.e. constructor, destructor or conversion op. */
3029 {
3032 }
3036 /* Emit a diagnostic for the invalid type. */
3039 out:
3040 /* If we aren't in the middle of a declarator (i.e. in a
3041 parameter-declaration-clause), skip to the end of the declaration;
3042 there's no point in trying to process it. */
3046 }
3048 /* Consume tokens up to, and including, the next non-nested closing `)'.
3049 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3050 are doing error recovery. Returns -1 if OR_COMMA is true and we
3051 found an unnested comma. */
3053 static int
3058 {
3068 {
3072 {
3075 /* If we've run out of tokens, then there is no closing `)'. */
3078 /* This is good for lambda expression capture-lists. */
3088 /* This matches the processing in skip_to_end_of_statement. */
3114 {
3118 }
3123 }
3125 /* Consume the token. */
3127 }
3128 }
3130 /* Consume tokens until we reach the end of the current statement.
3131 Normally, that will be just before consuming a `;'. However, if a
3132 non-nested `}' comes first, then we stop before consuming that. */
3134 static void
3136 {
3139 /* Unwind generic function template scope if necessary. */
3144 {
3148 {
3151 /* If we've run out of tokens, stop. */
3155 /* If the next token is a `;', we have reached the end of the
3156 statement. */
3162 /* If this is a non-nested '}', stop before consuming it.
3163 That way, when confronted with something like:
3165 { 3 + }
3167 we stop before consuming the closing '}', even though we
3168 have not yet reached a `;'. */
3172 /* If it is the closing '}' for a block that we have
3173 scanned, stop -- but only after consuming the token.
3174 That way given:
3176 void f g () { ... }
3177 typedef int I;
3179 we will stop after the body of the erroneously declared
3180 function, but before consuming the following `typedef'
3181 declaration. */
3183 {
3186 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* This function is called at the end of a statement or declaration.
3202 If the next token is a semicolon, it is consumed; otherwise, error
3203 recovery is attempted. */
3205 static void
3207 {
3208 /* Look for the trailing `;'. */
3210 {
3211 /* If there is additional (erroneous) input, skip to the end of
3212 the statement. */
3214 /* If the next token is now a `;', consume it. */
3217 }
3218 }
3220 /* Skip tokens until we have consumed an entire block, or until we
3221 have consumed a non-nested `;'. */
3223 static void
3225 {
3228 /* Unwind generic function template scope if necessary. */
3233 {
3237 {
3240 /* If we've run out of tokens, stop. */
3244 /* Stop if this is an unnested ';'. */
3250 /* Stop if this is an unnested '}', or closes the outermost
3251 nesting level. */
3252 nesting_depth--;
3260 /* Nest. */
3261 nesting_depth++;
3266 }
3268 /* Consume the token. */
3270 }
3271 }
3273 /* Skip tokens until a non-nested closing curly brace is the next
3274 token, or there are no more tokens. Return true in the first case,
3275 false otherwise. */
3277 static bool
3279 {
3283 {
3287 {
3290 /* If we've run out of tokens, stop. */
3294 /* If the next token is a non-nested `}', then we have reached
3295 the end of the current block. */
3301 /* If it the next token is a `{', then we are entering a new
3302 block. Consume the entire block. */
3308 }
3310 /* Consume the token. */
3312 }
3313 }
3315 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3316 parameter is the PRAGMA token, allowing us to purge the entire pragma
3317 sequence. */
3319 static void
3321 {
3326 do
3330 /* Ensure that the pragma is not parsed again. */
3332 }
3334 /* Require pragma end of line, resyncing with it as necessary. The
3335 arguments are as for cp_parser_skip_to_pragma_eol. */
3337 static void
3339 {
3343 }
3345 /* This is a simple wrapper around make_typename_type. When the id is
3346 an unresolved identifier node, we can provide a superior diagnostic
3347 using cp_parser_diagnose_invalid_type_name. */
3349 static tree
3352 {
3353 tree result;
3355 {
3361 }
3363 }
3365 /* This is a wrapper around the
3366 make_{pointer,ptrmem,reference}_declarator functions that decides
3367 which one to call based on the CODE and CLASS_TYPE arguments. The
3368 CODE argument should be one of the values returned by
3369 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3370 appertain to the pointer or reference. */
3374 cp_cv_quals cv_qualifiers,
3376 tree attributes)
3377 {
3384 else
3394 }
3396 /* Create a new C++ parser. */
3400 {
3405 /* cp_lexer_new_main is called before doing GC allocation because
3406 cp_lexer_new_main might load a PCH file. */
3409 /* Initialize the binops_by_token so that we can get the tree
3410 directly from the token. */
3418 /* For now, we always accept GNU extensions. */
3421 /* The `>' token is a greater-than operator, not the end of a
3422 template-id. */
3427 /* We are not parsing a constant-expression. */
3432 /* Local variable names are not forbidden. */
3435 /* We are not processing an `extern "C"' declaration. */
3438 /* We are not processing a declarator. */
3441 /* We are not processing a template-argument-list. */
3444 /* We are not in an iteration statement. */
3447 /* We are not in a switch statement. */
3450 /* We are not parsing a type-id inside an expression. */
3453 /* Declarations aren't implicitly extern "C". */
3456 /* String literals should be translated to the execution character set. */
3459 /* We are not parsing a function body. */
3462 /* We can correct until told otherwise. */
3465 /* The unparsed function queue is empty. */
3468 /* There are no classes being defined. */
3471 /* No template parameters apply. */
3474 /* Not declaring an implicit function template. */
3481 }
3483 /* Create a cp_lexer structure which will emit the tokens in CACHE
3484 and push it onto the parser's lexer stack. This is used for delayed
3485 parsing of in-class method bodies and default arguments, and should
3486 not be confused with tentative parsing. */
3487 static void
3489 {
3494 /* Move the current source position to that of the first token in the
3495 new lexer. */
3497 }
3499 /* Pop the top lexer off the parser stack. This is never used for the
3500 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3501 static void
3503 {
3508 /* Put the current source position back where it was before this
3509 lexer was pushed. */
3511 }
3513 /* Lexical conventions [gram.lex] */
3515 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3516 identifier. */
3518 static tree
3520 {
3523 /* Look for the identifier. */
3525 /* Return the value. */
3527 }
3529 /* Parse a sequence of adjacent string constants. Returns a
3530 TREE_STRING representing the combined, nul-terminated string
3531 constant. If TRANSLATE is true, translate the string to the
3532 execution character set. If WIDE_OK is true, a wide string is
3533 invalid here.
3535 C++98 [lex.string] says that if a narrow string literal token is
3536 adjacent to a wide string literal token, the behavior is undefined.
3537 However, C99 6.4.5p4 says that this results in a wide string literal.
3538 We follow C99 here, for consistency with the C front end.
3540 This code is largely lifted from lex_string() in c-lex.c.
3542 FUTURE: ObjC++ will need to handle @-strings here. */
3543 static tree
3545 {
3546 tree value;
3553 tree string_tree;
3559 {
3562 }
3565 {
3569 }
3570 else
3571 {
3574 }
3577 /* Try to avoid the overhead of creating and destroying an obstack
3578 for the common case of just one string. */
3581 {
3589 {
3593 }
3594 else
3598 }
3599 else
3600 {
3604 do
3605 {
3607 count++;
3612 {
3615 {
3618 }
3621 {
3626 }
3628 }
3629 else
3633 {
3638 "unsupported non-standard concatenation "
3640 }
3646 {
3650 }
3651 else
3652 {
3656 }
3657 }
3661 }
3664 {
3667 }
3671 {
3676 {
3691 }
3696 {
3701 }
3702 }
3703 else
3704 /* cpp_interpret_string has issued an error. */
3711 }
3713 /* Look up a literal operator with the name and the exact arguments. */
3715 static tree
3717 {
3724 {
3730 {
3733 {
3743 }
3746 /* May be this should be sufficient_parms_p instead,
3747 depending on how exactly should user-defined literals
3748 work in presence of default arguments on the literal
3749 operator parameters. */
3752 }
3753 }
3756 }
3758 /* Parse a user-defined char constant. Returns a call to a user-defined
3759 literal operator taking the character as an argument. */
3761 static tree
3763 {
3771 /* Build up a call to the user-defined operator */
3772 /* Lookup the name we got back from the id-expression. */
3777 {
3782 }
3791 }
3793 /* A subroutine of cp_parser_userdef_numeric_literal to
3794 create a char... template parameter pack from a string node. */
3796 static tree
3798 {
3799 tree charvec;
3805 /* Fill in CHARVEC with all of the parameters. */
3810 /* Build the argument packs. */
3817 }
3819 /* A subroutine of cp_parser_userdef_numeric_literal to
3820 create a char... template parameter pack from a string node. */
3822 static tree
3824 {
3825 tree charvec;
3836 /* First template parm is character type. */
3839 /* Fill in CHARVEC with all of the parameters. */
3846 /* Build the argument packs. */
3853 }
3855 /* Parse a user-defined numeric constant. returns a call to a user-defined
3856 literal operator. */
3858 static tree
3860 {
3871 /* Look for a literal operator taking the exact type of numeric argument
3872 as the literal value. */
3877 {
3880 {
3884 long_long_unsigned_type_node);
3885 else
3886 {
3890 long_double_type_node);
3894 }
3897 }
3898 }
3901 /* If the numeric argument didn't work, look for a raw literal
3902 operator taking a const char* argument consisting of the number
3903 in string format. */
3908 {
3911 {
3914 }
3915 }
3918 /* If the raw literal didn't work, look for a non-type template
3919 function with parameter pack char.... Call the function with
3920 template parameter characters representing the number. */
3924 {
3929 {
3932 }
3933 }
3941 }
3943 /* Parse a user-defined string constant. Returns a call to a user-defined
3944 literal operator taking a character pointer and the length of the string
3945 as arguments. */
3947 static tree
3949 {
3959 /* Look for a template function with typename parameter CharT
3960 and parameter pack CharT... Call the function with
3961 template parameter characters representing the string. */
3965 {
3970 {
3973 }
3974 }
3977 /* Build up a call to the user-defined operator */
3978 /* Lookup the name we got back from the id-expression. */
3984 {
3988 }
3997 }
4000 /* Basic concepts [gram.basic] */
4002 /* Parse a translation-unit.
4004 translation-unit:
4005 declaration-seq [opt]
4007 Returns TRUE if all went well. */
4009 static bool
4011 {
4012 /* The address of the first non-permanent object on the declarator
4013 obstack. */
4018 /* Create the declarator obstack, if necessary. */
4020 {
4022 /* Create the error declarator. */
4024 /* Create the empty parameter list. */
4026 /* Remember where the base of the declarator obstack lies. */
4028 }
4032 /* If there are no tokens left then all went well. */
4034 {
4035 /* Get rid of the token array; we don't need it any more. */
4039 /* This file might have been a context that's implicitly extern
4040 "C". If so, pop the lang context. (Only relevant for PCH.) */
4042 {
4045 }
4047 /* Finish up. */
4051 }
4052 else
4053 {
4056 }
4058 /* Make sure the declarator obstack was fully cleaned up. */
4062 /* All went well. */
4064 }
4066 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4067 decltype context. */
4071 {
4076 }
4078 /* Expressions [gram.expr] */
4080 /* Parse a primary-expression.
4082 primary-expression:
4083 literal
4084 this
4085 ( expression )
4086 id-expression
4088 GNU Extensions:
4090 primary-expression:
4091 ( compound-statement )
4092 __builtin_va_arg ( assignment-expression , type-id )
4093 __builtin_offsetof ( type-id , offsetof-expression )
4095 C++ Extensions:
4096 __has_nothrow_assign ( type-id )
4097 __has_nothrow_constructor ( type-id )
4098 __has_nothrow_copy ( type-id )
4099 __has_trivial_assign ( type-id )
4100 __has_trivial_constructor ( type-id )
4101 __has_trivial_copy ( type-id )
4102 __has_trivial_destructor ( type-id )
4103 __has_virtual_destructor ( type-id )
4104 __is_abstract ( type-id )
4105 __is_base_of ( type-id , type-id )
4106 __is_class ( type-id )
4107 __is_convertible_to ( type-id , type-id )
4108 __is_empty ( type-id )
4109 __is_enum ( type-id )
4110 __is_final ( type-id )
4111 __is_literal_type ( type-id )
4112 __is_pod ( type-id )
4113 __is_polymorphic ( type-id )
4114 __is_std_layout ( type-id )
4115 __is_trivial ( type-id )
4116 __is_union ( type-id )
4118 Objective-C++ Extension:
4120 primary-expression:
4121 objc-expression
4123 literal:
4124 __null
4126 ADDRESS_P is true iff this expression was immediately preceded by
4127 "&" and therefore might denote a pointer-to-member. CAST_P is true
4128 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4129 true iff this expression is a template argument.
4131 Returns a representation of the expression. Upon return, *IDK
4132 indicates what kind of id-expression (if any) was present. */
4134 static tree
4141 {
4144 /* Assume the primary expression is not an id-expression. */
4147 /* Peek at the next token. */
4150 {
4151 /* literal:
4152 integer-literal
4153 character-literal
4154 floating-literal
4155 string-literal
4156 boolean-literal
4157 pointer-literal
4158 user-defined-literal */
4168 {
4172 }
4173 /* Floating-point literals are only allowed in an integral
4174 constant expression if they are cast to an integral or
4175 enumeration type. */
4179 {
4180 /* CAST_P will be set even in invalid code like "int(2.7 +
4181 ...)". Therefore, we have to check that the next token
4182 is sure to end the cast. */
4184 {
4189 enumerator-definition. */
4191 /* The curly brace at the end of an enum-specifier. */
4193 /* The end of a statement. */
4195 /* The end of the cast-expression. */
4197 /* The end of an array bound. */
4199 /* The closing ">" in a template-argument-list. */
4202 /* C++0x only: A ">>" treated like two ">" tokens,
4203 in a template-argument-list. */
4208 }
4210 /* If we are within a cast, then the constraint that the
4211 cast is to an integral or enumeration type will be
4212 checked at that point. If we are not within a cast, then
4213 this code is invalid. */
4216 }
4235 /* ??? Should wide strings be allowed when parser->translate_strings_p
4236 is false (i.e. in attributes)? If not, we can kill the third
4237 argument to cp_parser_string_literal. */
4243 {
4244 tree expr;
4247 /* Consume the `('. */
4249 /* Within a parenthesized expression, a `>' token is always
4250 the greater-than operator. */
4251 saved_greater_than_is_operator_p
4254 /* If we see `( { ' then we are looking at the beginning of
4255 a GNU statement-expression. */
4258 {
4259 /* Statement-expressions are not allowed by the standard. */
4263 /* And they're not allowed outside of a function-body; you
4264 cannot, for example, write:
4266 int i = ({ int j = 3; j + 1; });
4268 at class or namespace scope. */
4271 {
4273 "statement-expressions are not allowed outside "
4277 }
4278 else
4279 {
4280 /* Start the statement-expression. */
4282 /* Parse the compound-statement. */
4284 /* Finish up. */
4286 }
4287 }
4288 else
4289 {
4290 /* Parse the parenthesized expression. */
4292 /* Let the front end know that this expression was
4293 enclosed in parentheses. This matters in case, for
4294 example, the expression is of the form `A::B', since
4295 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4296 not. */
4298 /* DR 705: Wrapping an unqualified name in parentheses
4299 suppresses arg-dependent lookup. We want to pass back
4300 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4301 (c++/37862), but none of the others. */
4304 }
4305 /* The `>' token might be the end of a template-id or
4306 template-parameter-list now. */
4307 parser->greater_than_is_operator_p
4309 /* Consume the `)'. */
4314 }
4318 /* We have an Objective-C++ message. */
4320 {
4322 /* Don't warn about a failed tentative parse. */
4327 }
4331 /* We have an Objective-C++ string literal. */
4338 {
4339 /* These two are the boolean literals. */
4347 /* The `__null' literal. */
4352 /* The `nullptr' literal. */
4357 /* Recognize the `this' keyword. */
4361 {
4365 }
4366 /* Pointers cannot appear in constant-expressions. */
4371 /* The `operator' keyword can be the beginning of an
4372 id-expression. */
4379 {
4380 non_integral_constant name;
4382 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4383 __func__ are the names of variables -- but they are
4384 treated specially. Therefore, they are handled here,
4385 rather than relying on the generic id-expression logic
4386 below. Grammatically, these names are id-expressions.
4388 Consume the token. */
4392 {
4404 }
4409 /* Look up the name. */
4411 }
4414 {
4415 tree expression;
4416 tree type;
4417 source_location type_location;
4419 /* The `__builtin_va_arg' construct is used to handle
4420 `va_arg'. Consume the `__builtin_va_arg' token. */
4422 /* Look for the opening `('. */
4424 /* Now, parse the assignment-expression. */
4427 /* Look for the `,'. */
4430 /* Parse the type-id. */
4432 /* Look for the closing `)'. */
4434 /* Using `va_arg' in a constant-expression is not
4435 allowed. */
4437 NIC_VA_ARG))
4440 }
4468 /* Objective-C++ expressions. */
4478 {
4483 }
4487 }
4489 /* An id-expression can start with either an identifier, a
4490 `::' as the beginning of a qualified-id, or the "operator"
4491 keyword. */
4496 {
4497 tree id_expression;
4498 tree decl;
4504 id_expression:
4505 /* Parse the id-expression. */
4506 id_expression
4523 /* If we have a template-id, then no further lookup is
4524 required. If the template-id was for a template-class, we
4525 will sometimes have a TYPE_DECL at this point. */
4529 /* Look up the name. */
4530 else
4531 {
4532 tree ambiguous_decls;
4534 /* If we already know that this lookup is ambiguous, then
4535 we've already issued an error message; there's no reason
4536 to check again. */
4539 {
4542 }
4545 none_type,
4546 template_p,
4551 /* If the lookup was ambiguous, an error will already have
4552 been issued. */
4556 /* In Objective-C++, we may have an Objective-C 2.0
4557 dot-syntax for classes here. */
4562 {
4563 tree component;
4570 }
4572 /* In Objective-C++, an instance variable (ivar) may be preferred
4573 to whatever cp_parser_lookup_name() found. */
4576 /* If name lookup gives us a SCOPE_REF, then the
4577 qualifying scope was dependent. */
4579 {
4580 /* At this point, we do not know if DECL is a valid
4581 integral constant expression. We assume that it is
4582 in fact such an expression, so that code like:
4584 template <int N> struct A {
4585 int a[B<N>::i];
4586 };
4588 is accepted. At template-instantiation time, we
4589 will check that B<N>::i is actually a constant. */
4591 }
4592 /* Check to see if DECL is a local variable in a context
4593 where that is forbidden. */
4596 {
4597 /* It might be that we only found DECL because we are
4598 trying to be generous with pre-ISO scoping rules.
4599 For example, consider:
4601 int i;
4602 void g() {
4603 for (int i = 0; i < 10; ++i) {}
4604 extern void f(int j = i);
4605 }
4607 Here, name look up will originally find the out
4608 of scope `i'. We need to issue a warning message,
4609 but then use the global `i'. */
4612 {
4615 decl);
4617 }
4618 }
4619 }
4621 decl = (finish_id_expression
4623 idk,
4628 template_arg_p,
4634 }
4636 /* Anything else is an error. */
4640 }
4641 }
4649 {
4652 }
4654 /* Parse an id-expression.
4656 id-expression:
4657 unqualified-id
4658 qualified-id
4660 qualified-id:
4661 :: [opt] nested-name-specifier template [opt] unqualified-id
4662 :: identifier
4663 :: operator-function-id
4664 :: template-id
4666 Return a representation of the unqualified portion of the
4667 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4668 a `::' or nested-name-specifier.
4670 Often, if the id-expression was a qualified-id, the caller will
4671 want to make a SCOPE_REF to represent the qualified-id. This
4672 function does not do this in order to avoid wastefully creating
4673 SCOPE_REFs when they are not required.
4675 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4676 `template' keyword.
4678 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4679 uninstantiated templates.
4681 If *TEMPLATE_P is non-NULL, it is set to true iff the
4682 `template' keyword is used to explicitly indicate that the entity
4683 named is a template.
4685 If DECLARATOR_P is true, the id-expression is appearing as part of
4686 a declarator, rather than as part of an expression. */
4688 static tree
4695 {
4699 /* Assume the `template' keyword was not used. */
4703 /* Look for the optional `::' operator. */
4704 global_scope_p
4707 /* Look for the optional nested-name-specifier. */
4708 nested_name_specifier_p
4711 check_dependency_p,
4713 declarator_p)
4715 /* If there is a nested-name-specifier, then we are looking at
4716 the first qualified-id production. */
4718 {
4719 tree saved_scope;
4720 tree saved_object_scope;
4721 tree saved_qualifying_scope;
4722 tree unqualified_id;
4725 /* See if the next token is the `template' keyword. */
4729 /* Name lookup we do during the processing of the
4730 unqualified-id might obliterate SCOPE. */
4734 /* Process the final unqualified-id. */
4736 check_dependency_p,
4737 declarator_p,
4739 /* Restore the SAVED_SCOPE for our caller. */
4745 }
4746 /* Otherwise, if we are in global scope, then we are looking at one
4747 of the other qualified-id productions. */
4749 {
4751 tree id;
4753 /* Peek at the next token. */
4756 /* If it's an identifier, and the next token is not a "<", then
4757 we can avoid the template-id case. This is an optimization
4758 for this common case. */
4760 && !cp_parser_nth_token_starts_template_argument_list_p
4765 /* Try a template-id. */
4769 none_type,
4770 declarator_p);
4771 /* If that worked, we're done. */
4775 /* Peek at the next token. (Changes in the token buffer may
4776 have invalidated the pointer obtained above.) */
4780 {
4787 /* Fall through. */
4792 }
4793 }
4794 else
4797 declarator_p,
4798 optional_p);
4799 }
4801 /* Parse an unqualified-id.
4803 unqualified-id:
4804 identifier
4805 operator-function-id
4806 conversion-function-id
4807 ~ class-name
4808 template-id
4810 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4811 keyword, in a construct like `A::template ...'.
4813 Returns a representation of unqualified-id. For the `identifier'
4814 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4815 production a BIT_NOT_EXPR is returned; the operand of the
4816 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4817 other productions, see the documentation accompanying the
4818 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4819 names are looked up in uninstantiated templates. If DECLARATOR_P
4820 is true, the unqualified-id is appearing as part of a declarator,
4821 rather than as part of an expression. */
4823 static tree
4829 {
4832 /* Peek at the next token. */
4836 {
4838 {
4839 tree id;
4841 /* We don't know yet whether or not this will be a
4842 template-id. */
4844 /* Try a template-id. */
4846 check_dependency_p,
4847 none_type,
4848 declarator_p);
4849 /* If it worked, we're done. */
4852 /* Otherwise, it's an ordinary identifier. */
4854 }
4858 check_dependency_p,
4859 none_type,
4860 declarator_p);
4863 {
4864 tree type_decl;
4865 tree qualifying_scope;
4866 tree object_scope;
4867 tree scope;
4870 /* Consume the `~' token. */
4872 /* Parse the class-name. The standard, as written, seems to
4873 say that:
4875 template <typename T> struct S { ~S (); };
4876 template <typename T> S<T>::~S() {}
4878 is invalid, since `~' must be followed by a class-name, but
4879 `S<T>' is dependent, and so not known to be a class.
4880 That's not right; we need to look in uninstantiated
4881 templates. A further complication arises from:
4883 template <typename T> void f(T t) {
4884 t.T::~T();
4885 }
4887 Here, it is not possible to look up `T' in the scope of `T'
4888 itself. We must look in both the current scope, and the
4889 scope of the containing complete expression.
4891 Yet another issue is:
4893 struct S {
4894 int S;
4895 ~S();
4896 };
4898 S::~S() {}
4900 The standard does not seem to say that the `S' in `~S'
4901 should refer to the type `S' and not the data member
4902 `S::S'. */
4904 /* DR 244 says that we look up the name after the "~" in the
4905 same scope as we looked up the qualifying name. That idea
4906 isn't fully worked out; it's more complicated than that. */
4911 /* Check for invalid scopes. */
4913 {
4917 }
4919 {
4923 scope);
4928 }
4931 /* If the name is of the form "X::~X" it's OK even if X is a
4932 typedef. */
4941 {
4944 }
4946 /* ~auto means the destructor of whatever the object is. */
4948 {
4951 "%<~auto%> only available with "
4955 }
4957 /* If there was an explicit qualification (S::~T), first look
4958 in the scope given by the qualification (i.e., S).
4960 Note: in the calls to cp_parser_class_name below we pass
4961 typename_type so that lookup finds the injected-class-name
4962 rather than the constructor. */
4966 {
4971 typename_type,
4974 declarator_p);
4977 }
4978 /* In "N::S::~S", look in "N" as well. */
4980 {
4985 type_decl
4989 typename_type,
4992 declarator_p);
4995 }
4996 /* In "p->S::~T", look in the scope given by "*p" as well. */
4998 {
5003 type_decl
5007 typename_type,
5010 declarator_p);
5013 }
5014 /* Look in the surrounding context. */
5016 {
5022 type_decl
5026 typename_type,
5029 declarator_p);
5032 {
5033 /* We couldn't find a type with this name, so just accept
5034 it and check for a match at instantiation time. */
5039 }
5040 }
5041 /* If an error occurred, assume that the name of the
5042 destructor is the same as the name of the qualifying
5043 class. That allows us to keep parsing after running
5044 into ill-formed destructor names. */
5050 /* Check that destructor name and scope match. */
5052 {
5059 }
5061 /* [class.dtor]
5063 A typedef-name that names a class shall not be used as the
5064 identifier in the declarator for a destructor declaration. */
5071 type_decl);
5074 }
5078 {
5079 tree id;
5081 /* This could be a template-id, so we try that first. */
5083 /* Try a template-id. */
5086 none_type,
5087 declarator_p);
5088 /* If that worked, we're done. */
5091 /* We still don't know whether we're looking at an
5092 operator-function-id or a conversion-function-id. */
5094 /* Try an operator-function-id. */
5096 /* If that didn't work, try a conversion-function-id. */
5100 {
5101 /* 17.6.3.3.5 */
5107 }
5110 }
5111 /* Fall through. */
5118 }
5119 }
5121 /* Parse an (optional) nested-name-specifier.
5123 nested-name-specifier: [C++98]
5124 class-or-namespace-name :: nested-name-specifier [opt]
5125 class-or-namespace-name :: template nested-name-specifier [opt]
5127 nested-name-specifier: [C++0x]
5128 type-name ::
5129 namespace-name ::
5130 nested-name-specifier identifier ::
5131 nested-name-specifier template [opt] simple-template-id ::
5133 PARSER->SCOPE should be set appropriately before this function is
5134 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5135 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5136 in name lookups.
5138 Sets PARSER->SCOPE to the class (TYPE) or namespace
5139 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5140 it unchanged if there is no nested-name-specifier. Returns the new
5141 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5143 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5144 part of a declaration and/or decl-specifier. */
5146 static tree
5152 {
5157 /* Remember where the nested-name-specifier starts. */
5159 {
5162 }
5165 {
5166 tree new_scope;
5167 tree old_scope;
5168 tree saved_qualifying_scope;
5171 /* Spot cases that cannot be the beginning of a
5172 nested-name-specifier. */
5175 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5176 the already parsed nested-name-specifier. */
5178 {
5179 /* Grab the nested-name-specifier and continue the loop. */
5181 /* If we originally encountered this nested-name-specifier
5182 with IS_DECLARATION set to false, we will not have
5183 resolved TYPENAME_TYPEs, so we must do so here. */
5186 {
5191 }
5194 }
5196 /* Spot cases that cannot be the beginning of a
5197 nested-name-specifier. On the second and subsequent times
5198 through the loop, we look for the `template' keyword. */
5200 ;
5201 /* A template-id can start a nested-name-specifier. */
5203 ;
5204 /* DR 743: decltype can be used in a nested-name-specifier. */
5206 ;
5207 else
5208 {
5209 /* If the next token is not an identifier, then it is
5210 definitely not a type-name or namespace-name. */
5213 /* If the following token is neither a `<' (to begin a
5214 template-id), nor a `::', then we are not looking at a
5215 nested-name-specifier. */
5221 {
5225 }
5228 && !cp_parser_nth_token_starts_template_argument_list_p
5231 }
5233 /* The nested-name-specifier is optional, so we parse
5234 tentatively. */
5237 /* Look for the optional `template' keyword, if this isn't the
5238 first time through the loop. */
5241 else
5244 /* Save the old scope since the name lookup we are about to do
5245 might destroy it. */
5248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5249 look up names in "X<T>::I" in order to determine that "Y" is
5250 a template. So, if we have a typename at this point, we make
5251 an effort to look through it. */
5253 && !typename_keyword_p
5258 /* Parse the qualifying entity. */
5259 new_scope
5261 typename_keyword_p,
5262 template_keyword_p,
5263 check_dependency_p,
5264 type_p,
5265 is_declaration);
5266 /* Look for the `::' token. */
5269 /* If we found what we wanted, we keep going; otherwise, we're
5270 done. */
5272 {
5275 /* Restore the OLD_SCOPE since it was valid before the
5276 failed attempt at finding the last
5277 class-or-namespace-name. */
5281 /* If the next token is a decltype, and the one after that is a
5282 `::', then the decltype has failed to resolve to a class or
5283 enumeration type. Give this error even when parsing
5284 tentatively since it can't possibly be valid--and we're going
5285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5286 won't get another chance.*/
5290 {
5297 /* As below. */
5300 }
5304 /* If the next token is an identifier, and the one after
5305 that is a `::', then any valid interpretation would have
5306 found a class-or-namespace-name. */
5312 {
5315 {
5317 {
5318 tree decl;
5319 tree ambiguous_decls;
5322 none_type,
5331 decl);
5333 {
5334 // cp_parser_lookup_name has the same diagnostic,
5335 // thus make sure to emit it at most once.
5338 {
5343 }
5345 }
5346 else
5347 {
5349 cp_parser_name_lookup_error
5352 else
5353 cp_parser_name_lookup_error
5356 }
5357 }
5360 /* Treat this as a successful nested-name-specifier
5361 due to:
5363 [basic.lookup.qual]
5365 If the name found is not a class-name (clause
5366 _class_) or namespace-name (_namespace.def_), the
5367 program is ill-formed. */
5369 }
5371 }
5373 }
5374 /* We've found one valid nested-name-specifier. */
5376 /* Name lookup always gives us a DECL. */
5379 /* Uses of "template" must be followed by actual templates. */
5391 new_scope);
5392 /* If it is a class scope, try to complete it; we are about to
5393 be looking up names inside the class. */
5395 /* Since checking types for dependency can be expensive,
5396 avoid doing it if the type is already complete. */
5398 /* Do not try to complete dependent types. */
5400 {
5402 /* If it is a typedef to current class, use the current
5403 class instead, as the typedef won't have any names inside
5404 it yet. */
5408 }
5409 /* Make sure we look in the right scope the next time through
5410 the loop. */
5412 }
5414 /* If parsing tentatively, replace the sequence of tokens that makes
5415 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5416 token. That way, should we re-parse the token stream, we will
5417 not have to repeat the effort required to do the parse, nor will
5418 we issue duplicate error messages. */
5420 {
5424 /* Reset the contents of the START token. */
5426 /* Retrieve any deferred checks. Do not pop this access checks yet
5427 so the memory will not be reclaimed during token replacing below. */
5435 /* Purge all subsequent tokens. */
5437 }
5443 }
5445 /* Parse a nested-name-specifier. See
5446 cp_parser_nested_name_specifier_opt for details. This function
5447 behaves identically, except that it will an issue an error if no
5448 nested-name-specifier is present. */
5450 static tree
5456 {
5457 tree scope;
5459 /* Look for the nested-name-specifier. */
5461 typename_keyword_p,
5462 check_dependency_p,
5463 type_p,
5464 is_declaration);
5465 /* If it was not present, issue an error message. */
5467 {
5470 }
5473 }
5475 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5476 this is either a class-name or a namespace-name (which corresponds
5477 to the class-or-namespace-name production in the grammar). For
5478 C++0x, it can also be a type-name that refers to an enumeration
5479 type or a simple-template-id.
5481 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5482 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5483 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5484 TYPE_P is TRUE iff the next name should be taken as a class-name,
5485 even the same name is declared to be another entity in the same
5486 scope.
5488 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5489 specified by the class-or-namespace-name. If neither is found the
5490 ERROR_MARK_NODE is returned. */
5492 static tree
5499 {
5500 tree saved_scope;
5501 tree saved_qualifying_scope;
5502 tree saved_object_scope;
5503 tree scope;
5507 /* DR 743: decltype can appear in a nested-name-specifier. */
5509 {
5513 {
5516 }
5520 }
5522 /* Before we try to parse the class-name, we must save away the
5523 current PARSER->SCOPE since cp_parser_class_name will destroy
5524 it. */
5528 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5529 there is no need to look for a namespace-name. */
5530 only_class_p = template_keyword_p
5535 typename_keyword_p,
5536 template_keyword_p,
5538 check_dependency_p,
5540 is_declaration);
5542 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5546 {
5547 /* Restore the saved scope. */
5552 /* Parse tentatively. */
5555 /* Parse a type-name */
5558 /* "If the name found does not designate a namespace or a class,
5559 enumeration, or dependent type, the program is ill-formed."
5561 We cover classes and dependent types above and namespaces below,
5562 so this code is only looking for enums. */
5568 }
5569 /* If that didn't work, try for a namespace-name. */
5571 {
5572 /* Restore the saved scope. */
5576 /* If we are not looking at an identifier followed by the scope
5577 resolution operator, then this is not part of a
5578 nested-name-specifier. (Note that this function is only used
5579 to parse the components of a nested-name-specifier.) */
5584 }
5587 }
5589 /* Parse a postfix-expression.
5591 postfix-expression:
5592 primary-expression
5593 postfix-expression [ expression ]
5594 postfix-expression ( expression-list [opt] )
5595 simple-type-specifier ( expression-list [opt] )
5596 typename :: [opt] nested-name-specifier identifier
5597 ( expression-list [opt] )
5598 typename :: [opt] nested-name-specifier template [opt] template-id
5599 ( expression-list [opt] )
5600 postfix-expression . template [opt] id-expression
5601 postfix-expression -> template [opt] id-expression
5602 postfix-expression . pseudo-destructor-name
5603 postfix-expression -> pseudo-destructor-name
5604 postfix-expression ++
5605 postfix-expression --
5606 dynamic_cast < type-id > ( expression )
5607 static_cast < type-id > ( expression )
5608 reinterpret_cast < type-id > ( expression )
5609 const_cast < type-id > ( expression )
5610 typeid ( expression )
5611 typeid ( type-id )
5613 GNU Extension:
5615 postfix-expression:
5616 ( type-id ) { initializer-list , [opt] }
5618 This extension is a GNU version of the C99 compound-literal
5619 construct. (The C99 grammar uses `type-name' instead of `type-id',
5620 but they are essentially the same concept.)
5622 If ADDRESS_P is true, the postfix expression is the operand of the
5623 `&' operator. CAST_P is true if this expression is the target of a
5624 cast.
5626 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5627 class member access expressions [expr.ref].
5629 Returns a representation of the expression. */
5631 static tree
5635 {
5637 location_t loc;
5644 /* Peek at the next token. */
5647 /* Some of the productions are determined by keywords. */
5650 {
5655 {
5656 tree type;
5657 tree expression;
5661 /* All of these can be handled in the same way from the point
5662 of view of parsing. Begin by consuming the token
5663 identifying the cast. */
5666 /* New types cannot be defined in the cast. */
5668 parser->type_definition_forbidden_message
5671 /* Look for the opening `<'. */
5673 /* Parse the type to which we are casting. */
5678 /* Look for the closing `>'. */
5680 /* Restore the old message. */
5683 bool saved_greater_than_is_operator_p
5687 /* And the expression which is being cast. */
5692 parser->greater_than_is_operator_p
5695 /* Only type conversions to integral or enumeration types
5696 can be used in constant-expressions. */
5702 {
5704 postfix_expression
5708 postfix_expression
5712 postfix_expression
5714 tf_warning_or_error);
5717 postfix_expression
5722 }
5723 }
5727 {
5728 tree type;
5732 /* Consume the `typeid' token. */
5734 /* Look for the `(' token. */
5736 /* Types cannot be defined in a `typeid' expression. */
5738 parser->type_definition_forbidden_message
5740 /* We can't be sure yet whether we're looking at a type-id or an
5741 expression. */
5743 /* Try a type-id first. */
5748 /* Look for the `)' token. Otherwise, we can't be sure that
5749 we're not looking at an expression: consider `typeid (int
5750 (3))', for example. */
5752 /* If all went well, simply lookup the type-id. */
5755 /* Otherwise, fall back to the expression variant. */
5756 else
5757 {
5758 tree expression;
5760 /* Look for an expression. */
5762 /* Compute its typeid. */
5764 /* Look for the `)' token. */
5766 }
5767 /* Restore the saved message. */
5769 /* `typeid' may not appear in an integral constant expression. */
5772 }
5776 {
5777 tree type;
5778 /* The syntax permitted here is the same permitted for an
5779 elaborated-type-specifier. */
5784 }
5788 {
5792 {
5797 }
5799 {
5804 }
5805 else
5806 {
5807 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5810 }
5812 postfix_expression =
5816 {
5820 }
5822 {
5827 }
5828 else
5829 {
5831 postfix_expression);
5835 }
5837 }
5841 {
5846 }
5847 else
5854 {
5857 tree p;
5871 tf_warning_or_error);
5874 tf_warning_or_error);
5875 else
5876 {
5880 }
5882 }
5885 {
5886 tree type;
5888 /* If the next thing is a simple-type-specifier, we may be
5889 looking at a functional cast. We could also be looking at
5890 an id-expression. So, we try the functional cast, and if
5891 that doesn't work we fall back to the primary-expression. */
5893 /* Look for the simple-type-specifier. */
5896 CP_PARSER_FLAGS_NONE);
5897 /* Parse the cast itself. */
5899 postfix_expression
5901 /* If that worked, we're done. */
5905 /* If the functional-cast didn't work out, try a
5906 compound-literal. */
5909 {
5914 /* Consume the `('. */
5917 /* Avoid calling cp_parser_type_id pointlessly, see comment
5918 in cp_parser_cast_expression about c++/29234. */
5921 compound_literal_p
5926 /* Roll back the tokens we skipped. */
5931 else
5932 {
5933 /* Parse the type. */
5938 /* Look for the `)'. */
5940 }
5942 /* If things aren't going well, there's no need to
5943 keep going. */
5945 {
5947 /* Parse the brace-enclosed initializer list. */
5950 }
5951 /* If that worked, we're definitely looking at a
5952 compound-literal expression. */
5954 {
5955 /* Warn the user that a compound literal is not
5956 allowed in standard C++. */
5959 /* For simplicity, we disallow compound literals in
5960 constant-expressions. We could
5961 allow compound literals of integer type, whose
5962 initializer was a constant, in constant
5963 expressions. Permitting that usage, as a further
5964 extension, would not change the meaning of any
5965 currently accepted programs. (Of course, as
5966 compound literals are not part of ISO C++, the
5967 standard has nothing to say.) */
5969 NIC_NCC))
5970 {
5973 }
5974 /* Form the representation of the compound-literal. */
5975 postfix_expression
5977 tf_warning_or_error);
5979 }
5980 }
5982 /* It must be a primary-expression. */
5983 postfix_expression
5986 decltype_p,
5988 }
5990 }
5992 /* Note that we don't need to worry about calling build_cplus_new on a
5993 class-valued CALL_EXPR in decltype when it isn't the end of the
5994 postfix-expression; unary_complex_lvalue will take care of that for
5995 all these cases. */
5997 /* Keep looping until the postfix-expression is complete. */
5999 {
6003 /* It is not a Koenig lookup function call. */
6004 postfix_expression
6007 /* Peek at the next token. */
6011 {
6014 {
6016 "two consecutive %<[%> shall "
6019 }
6020 postfix_expression
6022 postfix_expression,
6024 decltype_p);
6030 /* postfix-expression ( expression-list [opt] ) */
6031 {
6041 is_builtin_constant_p
6044 {
6045 /* The whole point of __builtin_constant_p is to allow
6046 non-constant expressions to appear as arguments. */
6047 saved_integral_constant_expression_p
6049 saved_non_integral_constant_expression_p
6052 }
6053 args = (cp_parser_parenthesized_expression_list
6058 {
6059 parser->integral_constant_expression_p
6061 parser->non_integral_constant_expression_p
6063 }
6066 {
6069 }
6071 /* Function calls are not permitted in
6072 constant-expressions. */
6075 NIC_FUNC_CALL))
6076 {
6080 }
6085 {
6087 {
6089 {
6092 postfix_expression
6094 complain);
6095 }
6096 else
6097 postfix_expression
6099 }
6100 /* We do not perform argument-dependent lookup if
6101 normal lookup finds a non-function, in accordance
6102 with the expected resolution of DR 218. */
6105 {
6109 /* Do not do argument dependent lookup if regular
6110 lookup finds a member function or a block-scope
6111 function declaration. [basic.lookup.argdep]/3 */
6114 {
6117 postfix_expression
6119 complain);
6120 }
6121 }
6122 }
6125 {
6135 {
6136 postfix_expression
6140 }
6143 {
6144 postfix_expression
6145 = (build_new_method_call
6151 complain));
6152 }
6153 else
6154 postfix_expression
6158 complain);
6159 }
6163 postfix_expression = (build_offset_ref_call_from_tree
6165 complain));
6167 /* A call to a static class member, or a namespace-scope
6168 function. */
6169 postfix_expression
6172 koenig_p,
6173 complain);
6174 else
6175 /* All other function calls. */
6176 postfix_expression
6179 koenig_p,
6180 complain);
6182 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6186 }
6191 /* postfix-expression . template [opt] id-expression
6192 postfix-expression . pseudo-destructor-name
6193 postfix-expression -> template [opt] id-expression
6194 postfix-expression -> pseudo-destructor-name */
6196 /* Consume the `.' or `->' operator. */
6199 postfix_expression
6201 postfix_expression,
6208 /* postfix-expression ++ */
6209 /* Consume the `++' token. */
6211 /* Generate a representation for the complete expression. */
6212 postfix_expression
6214 POSTINCREMENT_EXPR);
6215 /* Increments may not appear in constant-expressions. */
6223 /* postfix-expression -- */
6224 /* Consume the `--' token. */
6226 /* Generate a representation for the complete expression. */
6227 postfix_expression
6229 POSTDECREMENT_EXPR);
6230 /* Decrements may not appear in constant-expressions. */
6242 else
6244 }
6245 }
6247 /* We should never get here. */
6250 }
6252 /* This function parses Cilk Plus array notations. If a normal array expr. is
6253 parsed then the array index is passed back to the caller through *INIT_INDEX
6254 and the function returns a NULL_TREE. If array notation expr. is parsed,
6255 then *INIT_INDEX is ignored by the caller and the function returns
6256 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6257 error_mark_node. */
6259 static tree
6261 tree array_value)
6262 {
6266 {
6269 }
6278 {
6281 }
6283 {
6284 /* Consume the ':'. */
6287 /* If we are here, then we have a case like this A[:]. */
6289 {
6293 }
6297 }
6298 else
6299 {
6300 /* If we are here, then there are three valid possibilities:
6301 1. ARRAY [ EXP ]
6302 2. ARRAY [ EXP : EXP ]
6303 3. ARRAY [ EXP : EXP : EXP ] */
6307 {
6308 /* This indicates that we have a normal array expression. */
6311 }
6313 /* Consume the ':'. */
6317 {
6320 }
6321 }
6326 {
6330 }
6336 }
6338 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6339 by cp_parser_builtin_offsetof. We're looking for
6341 postfix-expression [ expression ]
6342 postfix-expression [ braced-init-list ] (C++11)
6344 FOR_OFFSETOF is set if we're being called in that context, which
6345 changes how we deal with integer constant expressions. */
6347 static tree
6349 tree postfix_expression,
6352 {
6357 /* Consume the `[' token. */
6363 /* Parse the index expression. */
6364 /* ??? For offsetof, there is a question of what to allow here. If
6365 offsetof is not being used in an integral constant expression context,
6366 then we *could* get the right answer by computing the value at runtime.
6367 If we are in an integral constant expression context, then we might
6368 could accept any constant expression; hard to say without analysis.
6369 Rather than open the barn door too wide right away, allow only integer
6370 constant expressions here. */
6373 else
6374 {
6376 {
6383 {
6385 "braced list index is not allowed with array "
6389 }
6390 }
6392 {
6393 /* Here are have these two options:
6394 ARRAY[EXP : EXP] - Array notation expr with default
6395 stride of 1.
6396 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6397 stride. */
6399 postfix_expression);
6402 }
6403 else
6405 }
6409 /* Look for the closing `]'. */
6412 /* Build the ARRAY_REF. */
6416 /* When not doing offsetof, array references are not permitted in
6417 constant-expressions. */
6423 }
6425 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6426 by cp_parser_builtin_offsetof. We're looking for
6428 postfix-expression . template [opt] id-expression
6429 postfix-expression . pseudo-destructor-name
6430 postfix-expression -> template [opt] id-expression
6431 postfix-expression -> pseudo-destructor-name
6433 FOR_OFFSETOF is set if we're being called in that context. That sorta
6434 limits what of the above we'll actually accept, but nevermind.
6435 TOKEN_TYPE is the "." or "->" token, which will already have been
6436 removed from the stream. */
6438 static tree
6441 tree postfix_expression,
6443 location_t location)
6444 {
6445 tree name;
6450 /* If this is a `->' operator, dereference the pointer. */
6453 tf_warning_or_error);
6454 /* Check to see whether or not the expression is type-dependent. */
6456 /* The identifier following the `->' or `.' is not qualified. */
6462 /* Enter the scope corresponding to the type of the object
6463 given by the POSTFIX_EXPRESSION. */
6465 {
6467 /* According to the standard, no expression should ever have
6468 reference type. Unfortunately, we do not currently match
6469 the standard in this respect in that our internal representation
6470 of an expression may have reference type even when the standard
6471 says it does not. Therefore, we have to manually obtain the
6472 underlying type here. */
6474 /* The type of the POSTFIX_EXPRESSION must be complete. */
6476 {
6478 postfix_expression);
6480 }
6481 /* Unlike the object expression in other contexts, *this is not
6482 required to be of complete type for purposes of class member
6483 access (5.2.5) outside the member function body. */
6487 /* Let the name lookup machinery know that we are processing a
6488 class member access expression. */
6490 /* If something went wrong, we want to be able to discern that case,
6491 as opposed to the case where there was no SCOPE due to the type
6492 of expression being dependent. */
6495 /* If the SCOPE was erroneous, make the various semantic analysis
6496 functions exit quickly -- and without issuing additional error
6497 messages. */
6500 }
6502 /* Assume this expression is not a pseudo-destructor access. */
6505 /* If the SCOPE is a scalar type, then, if this is a valid program,
6506 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6507 is type dependent, it can be pseudo-destructor-name or something else.
6508 Try to parse it as pseudo-destructor-name first. */
6510 {
6511 tree s;
6512 tree type;
6515 /* Parse the pseudo-destructor-name. */
6524 {
6526 postfix_expression
6529 }
6530 }
6533 {
6534 /* If the SCOPE is not a scalar type, we are looking at an
6535 ordinary class member access expression, rather than a
6536 pseudo-destructor-name. */
6539 /* Parse the id-expression. */
6540 name = (cp_parser_id_expression
6547 /* In general, build a SCOPE_REF if the member name is qualified.
6548 However, if the name was not dependent and has already been
6549 resolved; there is no need to build the SCOPE_REF. For example;
6551 struct X { void f(); };
6552 template <typename T> void f(T* t) { t->X::f(); }
6554 Even though "t" is dependent, "X::f" is not and has been resolved
6555 to a BASELINK; there is no need to include scope information. */
6557 /* But we do need to remember that there was an explicit scope for
6558 virtual function calls. */
6562 /* If the name is a template-id that names a type, we will get a
6563 TYPE_DECL here. That is invalid code. */
6565 {
6568 }
6569 else
6570 {
6572 {
6574 {
6578 }
6579 else
6582 name,
6583 template_p);
6587 }
6589 adjust_result_of_qualified_name_lookup
6591 postfix_expression
6593 template_p,
6594 tf_warning_or_error);
6595 }
6596 }
6598 /* We no longer need to look up names in the scope of the object on
6599 the left-hand side of the `.' or `->' operator. */
6602 /* Outside of offsetof, these operators may not appear in
6603 constant-expressions. */
6605 && (cp_parser_non_integral_constant_expression
6610 }
6612 /* Parse a parenthesized expression-list.
6614 expression-list:
6615 assignment-expression
6616 expression-list, assignment-expression
6618 attribute-list:
6619 expression-list
6620 identifier
6621 identifier, expression-list
6623 CAST_P is true if this expression is the target of a cast.
6625 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6626 argument pack.
6628 Returns a vector of trees. Each element is a representation of an
6629 assignment-expression. NULL is returned if the ( and or ) are
6630 missing. An empty, but allocated, vector is returned on no
6631 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6632 if we are parsing an attribute list for an attribute that wants a
6633 plain identifier argument, normal_attr for an attribute that wants
6634 an expression, or non_attr if we aren't parsing an attribute list. If
6635 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6636 not all of the expressions in the list were constant. */
6644 {
6650 /* Assume all the expressions will be constant. */
6659 /* Within a parenthesized expression, a `>' token is always
6660 the greater-than operator. */
6661 saved_greater_than_is_operator_p
6665 /* Consume expressions until there are no more. */
6668 {
6669 tree expr;
6671 /* At the beginning of attribute lists, check to see if the
6672 next token is an identifier. */
6675 {
6678 /* Consume the identifier. */
6680 /* Save the identifier. */
6682 }
6683 else
6684 {
6687 /* Parse the next assignment-expression. */
6689 {
6690 /* A braced-init-list. */
6696 }
6698 {
6699 expr = (cp_parser_constant_expression
6704 }
6705 else
6711 /* If we have an ellipsis, then this is an expression
6712 expansion. */
6715 {
6716 /* Consume the `...'. */
6719 /* Build the argument pack. */
6721 }
6723 /* Add it to the list. We add error_mark_node
6724 expressions to the list, so that we can still tell if
6725 the correct form for a parenthesized expression-list
6726 is found. That gives better errors. */
6731 }
6733 /* After the first item, attribute lists look the same as
6734 expression lists. */
6737 get_comma:;
6738 /* If the next token isn't a `,', then we are done. */
6742 /* Otherwise, consume the `,' and keep going. */
6744 }
6747 {
6750 skip_comma:;
6751 /* We try and resync to an unnested comma, as that will give the
6752 user better diagnostics. */
6760 {
6761 parser->greater_than_is_operator_p
6764 }
6765 }
6767 parser->greater_than_is_operator_p
6774 }
6776 /* Parse a pseudo-destructor-name.
6778 pseudo-destructor-name:
6779 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6780 :: [opt] nested-name-specifier template template-id :: ~ type-name
6781 :: [opt] nested-name-specifier [opt] ~ type-name
6783 If either of the first two productions is used, sets *SCOPE to the
6784 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6785 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6786 or ERROR_MARK_NODE if the parse fails. */
6788 static void
6790 tree object,
6793 {
6796 /* Handle ~auto. */
6800 {
6803 "%<~auto%> only available with "
6810 }
6812 /* Assume that things will not work out. */
6815 /* Look for the optional `::' operator. */
6817 /* Look for the optional nested-name-specifier. */
6818 nested_name_specifier_p
6825 /* Now, if we saw a nested-name-specifier, we might be doing the
6826 second production. */
6829 {
6830 /* Consume the `template' keyword. */
6832 /* Parse the template-id. */
6836 class_type,
6838 /* Look for the `::' token. */
6840 }
6841 /* If the next token is not a `~', then there might be some
6842 additional qualification. */
6844 {
6845 /* At this point, we're looking for "type-name :: ~". The type-name
6846 must not be a class-name, since this is a pseudo-destructor. So,
6847 it must be either an enum-name, or a typedef-name -- both of which
6848 are just identifiers. So, we peek ahead to check that the "::"
6849 and "~" tokens are present; if they are not, then we can avoid
6850 calling type_name. */
6854 {
6857 }
6859 /* Look for the type-name. */
6864 /* Look for the `::' token. */
6866 }
6867 else
6870 /* Look for the `~'. */
6873 /* Once we see the ~, this has to be a pseudo-destructor. */
6877 /* Look for the type-name again. We are not responsible for
6878 checking that it matches the first type-name. */
6880 }
6882 /* Parse a unary-expression.
6884 unary-expression:
6885 postfix-expression
6886 ++ cast-expression
6887 -- cast-expression
6888 unary-operator cast-expression
6889 sizeof unary-expression
6890 sizeof ( type-id )
6891 alignof ( type-id ) [C++0x]
6892 new-expression
6893 delete-expression
6895 GNU Extensions:
6897 unary-expression:
6898 __extension__ cast-expression
6899 __alignof__ unary-expression
6900 __alignof__ ( type-id )
6901 alignof unary-expression [C++0x]
6902 __real__ cast-expression
6903 __imag__ cast-expression
6904 && identifier
6905 sizeof ( type-id ) { initializer-list , [opt] }
6906 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6907 __alignof__ ( type-id ) { initializer-list , [opt] }
6909 ADDRESS_P is true iff the unary-expression is appearing as the
6910 operand of the `&' operator. CAST_P is true if this expression is
6911 the target of a cast.
6913 Returns a representation of the expression. */
6915 static tree
6918 {
6922 /* Peek at the next token. */
6924 /* Some keywords give away the kind of expression. */
6926 {
6930 {
6933 {
6936 location_t first_loc;
6939 /* Consume the token. */
6942 /* Parse the operand. */
6947 else
6948 {
6949 /* ISO C++ defines alignof only with types, not with
6950 expressions. So pedwarn if alignof is used with a non-
6951 type expression. However, __alignof__ is ok. */
6954 "ISO C++ does not allow %<alignof%> "
6958 }
6959 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6960 SIZEOF_EXPR with the original operand. */
6962 {
6964 {
6966 {
6969 error_mark_node));
6971 }
6972 else
6976 }
6978 }
6980 }
6989 {
6990 /* The saved value of the PEDANTIC flag. */
6992 tree expr;
6994 /* Save away the PEDANTIC flag. */
6996 /* Parse the cast-expression. */
6998 /* Restore the PEDANTIC flag. */
7002 }
7006 {
7007 tree expression;
7009 /* Consume the `__real__' or `__imag__' token. */
7011 /* Parse the cast-expression. */
7013 /* Create the complete representation. */
7017 expression,
7018 tf_warning_or_error);
7019 }
7027 {
7028 tree expr;
7038 parser->type_definition_forbidden_message
7041 saved_integral_constant_expression_p
7043 saved_non_integral_constant_expression_p
7047 saved_greater_than_is_operator_p
7057 parser->greater_than_is_operator_p
7060 parser->integral_constant_expression_p
7062 parser->non_integral_constant_expression_p
7069 }
7073 }
7074 }
7076 /* Look for the `:: new' and `:: delete', which also signal the
7077 beginning of a new-expression, or delete-expression,
7078 respectively. If the next token is `::', then it might be one of
7079 these. */
7081 {
7084 /* See if the token after the `::' is one of the keywords in
7085 which we're interested. */
7087 /* If it's `new', we have a new-expression. */
7090 /* Similarly, for `delete'. */
7093 }
7095 /* Look for a unary operator. */
7097 /* The `++' and `--' operators can be handled similarly, even though
7098 they are not technically unary-operators in the grammar. */
7100 {
7105 /* Handle the GNU address-of-label extension. */
7108 {
7109 tree identifier;
7110 tree expression;
7113 /* Consume the '&&' token. */
7115 /* Look for the identifier. */
7117 /* Create an expression representing the address. */
7120 NIC_ADDR_LABEL))
7123 }
7124 }
7126 {
7127 tree cast_expression;
7133 /* Consume the operator token. */
7135 /* Parse the cast-expression. */
7136 cast_expression
7141 pidk);
7142 /* Now, build an appropriate representation. */
7144 {
7148 RO_UNARY_STAR,
7149 complain);
7154 /* Fall through. */
7157 cast_expression,
7158 complain);
7165 /* Fall through. */
7175 }
7179 non_constant_p))
7183 }
7187 decltype_p,
7188 pidk);
7189 }
7194 {
7197 }
7199 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7200 unary-operator, the corresponding tree code is returned. */
7202 static enum tree_code
7204 {
7206 {
7227 }
7228 }
7230 /* Parse a new-expression.
7232 new-expression:
7233 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7234 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7236 Returns a representation of the expression. */
7238 static tree
7240 {
7243 tree type;
7246 tree ret;
7248 /* Look for the optional `::' operator. */
7249 global_scope_p
7253 /* Look for the `new' operator. */
7255 /* There's no easy way to tell a new-placement from the
7256 `( type-id )' construct. */
7258 /* Look for a new-placement. */
7260 /* If that didn't work out, there's no new-placement. */
7262 {
7266 }
7268 /* If the next token is a `(', then we have a parenthesized
7269 type-id. */
7271 {
7275 /* Consume the `('. */
7278 /* Parse the type-id. */
7279 parser->type_definition_forbidden_message
7284 /* Look for the closing `)'. */
7287 /* There should not be a direct-new-declarator in this production,
7288 but GCC used to allowed this, so we check and emit a sensible error
7289 message for this case. */
7291 {
7297 }
7298 }
7299 /* Otherwise, there must be a new-type-id. */
7300 else
7303 /* If the next token is a `(' or '{', then we have a new-initializer. */
7307 else
7310 /* A new-expression may not appear in an integral constant
7311 expression. */
7314 else
7315 {
7316 /* Create a representation of the new-expression. */
7318 tf_warning_or_error);
7319 }
7327 }
7329 /* Parse a new-placement.
7331 new-placement:
7332 ( expression-list )
7334 Returns the same representation as for an expression-list. */
7338 {
7341 /* Parse the expression-list. */
7342 expression_list = (cp_parser_parenthesized_expression_list
7348 }
7350 /* Parse a new-type-id.
7352 new-type-id:
7353 type-specifier-seq new-declarator [opt]
7355 Returns the TYPE allocated. If the new-type-id indicates an array
7356 type, *NELTS is set to the number of elements in the last array
7357 bound; the TYPE will not include the last array bound. */
7359 static tree
7361 {
7362 cp_decl_specifier_seq type_specifier_seq;
7368 /* The type-specifier sequence must not contain type definitions.
7369 (It cannot contain declarations of new types either, but if they
7370 are not definitions we will catch that because they are not
7371 complete.) */
7373 parser->type_definition_forbidden_message
7375 /* Parse the type-specifier-seq. */
7379 /* Restore the old message. */
7385 /* Parse the new-declarator. */
7388 /* Determine the number of elements in the last array dimension, if
7389 any. */
7391 /* Skip down to the last array dimension. */
7396 {
7399 }
7404 {
7407 }
7410 {
7417 else
7419 }
7422 }
7424 /* Parse an (optional) new-declarator.
7426 new-declarator:
7427 ptr-operator new-declarator [opt]
7428 direct-new-declarator
7430 Returns the declarator. */
7434 {
7437 cp_cv_quals cv_quals;
7439 /* We don't know if there's a ptr-operator next, or not. */
7441 /* Look for a ptr-operator. */
7443 /* If that worked, look for more new-declarators. */
7445 {
7448 /* Parse another optional declarator. */
7451 declarator = cp_parser_make_indirect_declarator
7455 }
7457 /* If the next token is a `[', there is a direct-new-declarator. */
7462 }
7464 /* Parse a direct-new-declarator.
7466 direct-new-declarator:
7467 [ expression ]
7468 direct-new-declarator [constant-expression]
7470 */
7474 {
7478 {
7479 tree expression;
7482 /* Look for the opening `['. */
7487 /* The standard requires that the expression have integral
7488 type. DR 74 adds enumeration types. We believe that the
7489 real intent is that these expressions be handled like the
7490 expression in a `switch' condition, which also allows
7491 classes with a single conversion to integral or
7492 enumeration type. */
7494 {
7495 expression
7497 expression,
7500 {
7502 "expression in new-declarator must have integral "
7505 }
7506 }
7508 /* Look for the closing `]'. */
7511 /* Add this bound to the declarator. */
7514 /* If the next token is not a `[', then there are no more
7515 bounds. */
7518 }
7521 }
7523 /* Parse a new-initializer.
7525 new-initializer:
7526 ( expression-list [opt] )
7527 braced-init-list
7529 Returns a representation of the expression-list. */
7533 {
7537 {
7538 tree t;
7545 }
7546 else
7547 expression_list = (cp_parser_parenthesized_expression_list
7553 }
7555 /* Parse a delete-expression.
7557 delete-expression:
7558 :: [opt] delete cast-expression
7559 :: [opt] delete [ ] cast-expression
7561 Returns a representation of the expression. */
7563 static tree
7565 {
7568 tree expression;
7570 /* Look for the optional `::' operator. */
7571 global_scope_p
7575 /* Look for the `delete' keyword. */
7577 /* See if the array syntax is in use. */
7579 {
7580 /* Consume the `[' token. */
7582 /* Look for the `]' token. */
7584 /* Remember that this is the `[]' construct. */
7586 }
7587 else
7590 /* Parse the cast-expression. */
7593 /* A delete-expression may not appear in an integral constant
7594 expression. */
7599 tf_warning_or_error);
7600 }
7602 /* Returns true if TOKEN may start a cast-expression and false
7603 otherwise. */
7605 static bool
7607 {
7610 {
7651 /* In ((type ()) () the last () isn't a valid cast-expression,
7652 so the whole must be parsed as postfix-expression. */
7656 /* '[' may start a primary-expression in obj-c++. */
7662 }
7663 }
7665 /* Parse a cast-expression.
7667 cast-expression:
7668 unary-expression
7669 ( type-id ) cast-expression
7671 ADDRESS_P is true iff the unary-expression is appearing as the
7672 operand of the `&' operator. CAST_P is true if this expression is
7673 the target of a cast.
7675 Returns a representation of the expression. */
7677 static tree
7680 {
7681 /* If it's a `(', then we might be looking at a cast. */
7683 {
7689 /* There's no way to know yet whether or not this is a cast.
7690 For example, `(int (3))' is a unary-expression, while `(int)
7691 3' is a cast. So, we resort to parsing tentatively. */
7693 /* Types may not be defined in a cast. */
7695 parser->type_definition_forbidden_message
7697 /* Consume the `('. */
7699 /* A very tricky bit is that `(struct S) { 3 }' is a
7700 compound-literal (which we permit in C++ as an extension).
7701 But, that construct is not a cast-expression -- it is a
7702 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7703 is legal; if the compound-literal were a cast-expression,
7704 you'd need an extra set of parentheses.) But, if we parse
7705 the type-id, and it happens to be a class-specifier, then we
7706 will commit to the parse at that point, because we cannot
7707 undo the action that is done when creating a new class. So,
7708 then we cannot back up and do a postfix-expression.
7709 Another tricky case is the following (c++/29234):
7711 struct S { void operator () (); };
7713 void foo ()
7714 {
7715 ( S()() );
7716 }
7718 As a type-id we parse the parenthesized S()() as a function
7719 returning a function, groktypename complains and we cannot
7720 back up in this case either.
7722 Therefore, we scan ahead to the closing `)', and check to see
7723 if the tokens after the `)' can start a cast-expression. Otherwise
7724 we are dealing with an unary-expression, a postfix-expression
7725 or something else.
7727 Save tokens so that we can put them back. */
7730 /* We may be looking at a cast-expression. */
7731 cast_expression_p
7736 /* Roll back the tokens we skipped. */
7738 /* If we aren't looking at a cast-expression, simulate an error so
7739 that the call to cp_parser_parse_definitely below will fail. */
7742 else
7743 {
7746 /* Look for the type-id. */
7748 /* Look for the closing `)'. */
7751 }
7753 /* Restore the saved message. */
7756 /* At this point this can only be either a cast or a
7757 parenthesized ctor such as `(T ())' that looks like a cast to
7758 function returning T. */
7760 {
7766 pidk);
7768 /* Warn about old-style casts, if so requested. */
7775 /* Only type conversions to integral or enumeration types
7776 can be used in constant-expressions. */
7779 NIC_CAST))
7782 /* Perform the cast. */
7785 }
7786 else
7788 }
7790 /* If we get here, then it's not a cast, so it must be a
7791 unary-expression. */
7794 }
7796 /* Parse a binary expression of the general form:
7798 pm-expression:
7799 cast-expression
7800 pm-expression .* cast-expression
7801 pm-expression ->* cast-expression
7803 multiplicative-expression:
7804 pm-expression
7805 multiplicative-expression * pm-expression
7806 multiplicative-expression / pm-expression
7807 multiplicative-expression % pm-expression
7809 additive-expression:
7810 multiplicative-expression
7811 additive-expression + multiplicative-expression
7812 additive-expression - multiplicative-expression
7814 shift-expression:
7815 additive-expression
7816 shift-expression << additive-expression
7817 shift-expression >> additive-expression
7819 relational-expression:
7820 shift-expression
7821 relational-expression < shift-expression
7822 relational-expression > shift-expression
7823 relational-expression <= shift-expression
7824 relational-expression >= shift-expression
7826 GNU Extension:
7828 relational-expression:
7829 relational-expression <? shift-expression
7830 relational-expression >? shift-expression
7832 equality-expression:
7833 relational-expression
7834 equality-expression == relational-expression
7835 equality-expression != relational-expression
7837 and-expression:
7838 equality-expression
7839 and-expression & equality-expression
7841 exclusive-or-expression:
7842 and-expression
7843 exclusive-or-expression ^ and-expression
7845 inclusive-or-expression:
7846 exclusive-or-expression
7847 inclusive-or-expression | exclusive-or-expression
7849 logical-and-expression:
7850 inclusive-or-expression
7851 logical-and-expression && inclusive-or-expression
7853 logical-or-expression:
7854 logical-and-expression
7855 logical-or-expression || logical-and-expression
7857 All these are implemented with a single function like:
7859 binary-expression:
7860 simple-cast-expression
7861 binary-expression <token> binary-expression
7863 CAST_P is true if this expression is the target of a cast.
7865 The binops_by_token map is used to get the tree codes for each <token> type.
7866 binary-expressions are associated according to a precedence table. */
7868 #define TOKEN_PRECEDENCE(token) \
7869 (((token->type == CPP_GREATER \
7870 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7871 && !parser->greater_than_is_operator_p) \
7872 ? PREC_NOT_OPERATOR \
7873 : binops_by_token[token->type].prec)
7875 static tree
7881 {
7882 cp_parser_expression_stack stack;
7884 cp_parser_expression_stack_entry current;
7885 tree rhs;
7889 tree overload;
7891 /* Parse the first expression. */
7901 {
7902 /* Get an operator token. */
7908 {
7910 "%<>>%> operator is treated"
7914 }
7918 /* Popping an entry off the stack means we completed a subexpression:
7919 - either we found a token which is not an operator (`>' where it is not
7920 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7921 will happen repeatedly;
7922 - or, we found an operator which has lower priority. This is the case
7923 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7924 parsing `3 * 4'. */
7926 {
7929 else
7931 }
7933 get_rhs:
7937 /* We used the operator token. */
7940 /* For "false && x" or "true || x", x will never be executed;
7941 disable warnings while evaluating it. */
7947 /* Extract another operand. It may be the RHS of this expression
7948 or the LHS of a new, higher priority expression. */
7952 /* Get another operator token. Look up its precedence to avoid
7953 building a useless (immediately popped) stack entry for common
7954 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7958 {
7959 /* ... and prepare to parse the RHS of the new, higher priority
7960 expression. Since precedence levels on the stack are
7961 monotonically increasing, we do not have to care about
7962 stack overflows. */
7971 pop:
7973 /* If the stack is not empty, we have parsed into LHS the right side
7974 (`4' in the example above) of an expression we had suspended.
7975 We can use the information on the stack to recover the LHS (`3')
7976 from the stack together with the tree code (`MULT_EXPR'), and
7977 the precedence of the higher level subexpression
7978 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7979 which will be used to actually build the additive expression. */
7984 }
7986 /* Undo the disabling of warnings done above. */
7993 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7994 ERROR_MARK for everything that is not a binary expression.
7995 This makes warn_about_parentheses miss some warnings that
7996 involve unary operators. For unary expressions we should
7997 pass the correct tree_code unless the unary expression was
7998 surrounded by parentheses.
7999 */
8005 == tcc_comparison
8008 else
8017 /* If the binary operator required the use of an overloaded operator,
8018 then this expression cannot be an integral constant-expression.
8019 An overloaded operator can be used even if both operands are
8020 otherwise permissible in an integral constant-expression if at
8021 least one of the operands is of enumeration type. */
8025 NIC_OVERLOADED))
8027 }
8030 }
8032 static tree
8037 {
8040 }
8042 /* Parse the `? expression : assignment-expression' part of a
8043 conditional-expression. The LOGICAL_OR_EXPR is the
8044 logical-or-expression that started the conditional-expression.
8045 Returns a representation of the entire conditional-expression.
8047 This routine is used by cp_parser_assignment_expression.
8049 ? expression : assignment-expression
8051 GNU Extensions:
8053 ? : assignment-expression */
8055 static tree
8057 {
8058 tree expr;
8059 tree assignment_expr;
8063 /* Consume the `?' token. */
8068 {
8071 /* Implicit true clause. */
8075 }
8076 else
8077 {
8080 /* Parse the expression. */
8083 c_inhibit_evaluation_warnings +=
8087 }
8089 /* The next token should be a `:'. */
8091 /* Parse the assignment-expression. */
8095 /* Build the conditional-expression. */
8097 expr,
8098 assignment_expr,
8099 tf_warning_or_error);
8100 }
8102 /* Parse an assignment-expression.
8104 assignment-expression:
8105 conditional-expression
8106 logical-or-expression assignment-operator assignment_expression
8107 throw-expression
8109 CAST_P is true if this expression is the target of a cast.
8110 DECLTYPE_P is true if this expression is the operand of decltype.
8112 Returns a representation for the expression. */
8114 static tree
8117 {
8118 tree expr;
8120 /* If the next token is the `throw' keyword, then we're looking at
8121 a throw-expression. */
8124 /* Otherwise, it must be that we are looking at a
8125 logical-or-expression. */
8126 else
8127 {
8128 /* Parse the binary expressions (logical-or-expression). */
8130 decltype_p,
8132 /* If the next token is a `?' then we're actually looking at a
8133 conditional-expression. */
8136 else
8137 {
8140 /* If it's an assignment-operator, we're using the second
8141 production. */
8142 enum tree_code assignment_operator
8145 {
8147 location_t saved_input_location;
8149 /* Parse the right-hand side of the assignment. */
8155 /* An assignment may not appear in a
8156 constant-expression. */
8158 NIC_ASSIGNMENT))
8160 /* Build the assignment expression. Its default
8161 location is the location of the '=' token. */
8165 assignment_operator,
8166 rhs,
8169 }
8170 }
8171 }
8174 }
8176 static tree
8179 {
8182 }
8184 /* Parse an (optional) assignment-operator.
8186 assignment-operator: one of
8187 = *= /= %= += -= >>= <<= &= ^= |=
8189 GNU Extension:
8191 assignment-operator: one of
8192 <?= >?=
8194 If the next token is an assignment operator, the corresponding tree
8195 code is returned, and the token is consumed. For example, for
8196 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8197 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8198 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8199 operator, ERROR_MARK is returned. */
8201 static enum tree_code
8203 {
8207 /* Peek at the next token. */
8211 {
8257 /* Nothing else is an assignment operator. */
8259 }
8261 /* If it was an assignment operator, consume it. */
8266 }
8268 /* Parse an expression.
8270 expression:
8271 assignment-expression
8272 expression , assignment-expression
8274 CAST_P is true if this expression is the target of a cast.
8275 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8276 except possibly parenthesized or on the RHS of a comma (N3276).
8278 Returns a representation of the expression. */
8280 static tree
8283 {
8288 {
8289 tree assignment_expression;
8291 /* Parse the next assignment-expression. */
8292 assignment_expression
8295 /* We don't create a temporary for a call that is the immediate operand
8296 of decltype or on the RHS of a comma. But when we see a comma, we
8297 need to create a temporary for a call on the LHS. */
8302 assignment_expression
8306 /* If this is the first assignment-expression, we can just
8307 save it away. */
8310 else
8312 assignment_expression,
8314 /* If the next token is not a comma, then we are done with the
8315 expression. */
8318 /* Consume the `,'. */
8321 /* A comma operator cannot appear in a constant-expression. */
8324 }
8327 }
8331 {
8333 }
8335 /* Parse a constant-expression.
8337 constant-expression:
8338 conditional-expression
8340 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8341 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8342 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8343 is false, NON_CONSTANT_P should be NULL. */
8345 static tree
8349 {
8353 tree expression;
8355 /* It might seem that we could simply parse the
8356 conditional-expression, and then check to see if it were
8357 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8358 one that the compiler can figure out is constant, possibly after
8359 doing some simplifications or optimizations. The standard has a
8360 precise definition of constant-expression, and we must honor
8361 that, even though it is somewhat more restrictive.
8363 For example:
8365 int i[(2, 3)];
8367 is not a legal declaration, because `(2, 3)' is not a
8368 constant-expression. The `,' operator is forbidden in a
8369 constant-expression. However, GCC's constant-folding machinery
8370 will fold this operation to an INTEGER_CST for `3'. */
8372 /* Save the old settings. */
8374 saved_allow_non_integral_constant_expression_p
8377 /* We are now parsing a constant-expression. */
8379 parser->allow_non_integral_constant_expression_p
8382 /* Although the grammar says "conditional-expression", we parse an
8383 "assignment-expression", which also permits "throw-expression"
8384 and the use of assignment operators. In the case that
8385 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8386 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8387 actually essential that we look for an assignment-expression.
8388 For example, cp_parser_initializer_clauses uses this function to
8389 determine whether a particular assignment-expression is in fact
8390 constant. */
8392 /* Restore the old settings. */
8393 parser->integral_constant_expression_p
8395 parser->allow_non_integral_constant_expression_p
8398 {
8399 /* Require an rvalue constant expression here; that's what our
8400 callers expect. Reference constant expressions are handled
8401 separately in e.g. cp_parser_template_argument. */
8406 }
8409 parser->non_integral_constant_expression_p
8413 }
8415 /* Parse __builtin_offsetof.
8417 offsetof-expression:
8418 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8420 offsetof-member-designator:
8421 id-expression
8422 | offsetof-member-designator "." id-expression
8423 | offsetof-member-designator "[" expression "]"
8424 | offsetof-member-designator "->" id-expression */
8426 static tree
8428 {
8431 cp_id_kind dummy;
8434 /* We're about to accept non-integral-constant things, but will
8435 definitely yield an integral constant expression. Save and
8436 restore these values around our local parsing. */
8440 /* Consume the "__builtin_offsetof" token. */
8442 /* Consume the opening `('. */
8444 /* Parse the type-id. */
8446 /* Look for the `,'. */
8450 /* Build the (type *)null that begins the traditional offsetof macro. */
8452 tf_warning_or_error);
8454 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8458 {
8461 {
8463 /* offsetof-member-designator "[" expression "]" */
8469 /* offsetof-member-designator "->" identifier */
8472 /* FALLTHRU */
8475 /* offsetof-member-designator "." identifier */
8483 /* Consume the ")" token. */
8488 /* Error. We know the following require will fail, but
8489 that gives the proper error message. */
8494 }
8495 }
8497 success:
8498 /* If we're processing a template, we can't finish the semantics yet.
8499 Otherwise we can fold the entire expression now. */
8502 else
8505 failure:
8510 }
8512 /* Parse a trait expression.
8514 Returns a representation of the expression, the underlying type
8515 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8517 static tree
8519 {
8520 cp_trait_kind kind;
8523 cp_decl_specifier_seq decl_specs;
8526 {
8603 }
8605 /* Consume the token. */
8615 /* Build a trivial decl-specifier-seq. */
8619 /* Call grokdeclarator to figure out what type this is. */
8624 {
8632 /* Build a trivial decl-specifier-seq. */
8636 /* Call grokdeclarator to figure out what type this is. */
8639 }
8643 /* Complete the trait expression, which may mean either processing
8644 the trait expr now or saving it for template instantiation. */
8646 {
8655 }
8656 }
8658 /* Lambdas that appear in variable initializer or default argument scope
8659 get that in their mangling, so we need to record it. We might as well
8660 use the count for function and namespace scopes as well. */
8664 {
8665 tree t;
8670 static void
8672 {
8673 tree_int ti;
8675 /* Once we're inside a function, we ignore other scopes and just push
8676 the function again so that popping works properly. */
8683 {
8684 /* Don't reset the count if we're still in the same function. */
8687 }
8688 }
8690 static void
8692 {
8695 }
8697 static void
8699 {
8702 {
8705 }
8707 }
8709 /* Parse a lambda expression.
8711 lambda-expression:
8712 lambda-introducer lambda-declarator [opt] compound-statement
8714 Returns a representation of the expression. */
8716 static tree
8718 {
8720 tree type;
8727 {
8731 }
8733 /* We may be in the middle of deferred access check. Disable
8734 it now. */
8745 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8748 /* Now that we've started the type, add the capture fields for any
8749 explicit captures. */
8752 {
8753 /* Inside the class, surrounding template-parameter-lists do not apply. */
8754 unsigned int saved_num_template_parameter_lists
8758 bool fully_implicit_function_template_p
8762 bool auto_is_implicit_function_template_parm_p
8773 /* By virtue of defining a local class, a lambda expression has access to
8774 the private variables of enclosing classes. */
8781 {
8784 }
8786 /* The capture list was built up in reverse order; fix that now. */
8798 parser->fully_implicit_function_template_p
8802 parser->auto_is_implicit_function_template_parm_p
8804 }
8808 /* This field is only used during parsing of the lambda. */
8811 /* This lambda shouldn't have any proxies left at this point. */
8813 /* And now that we're done, push proxies for an enclosing lambda. */
8818 else
8820 }
8822 /* Parse the beginning of a lambda expression.
8824 lambda-introducer:
8825 [ lambda-capture [opt] ]
8827 LAMBDA_EXPR is the current representation of the lambda expression. */
8829 static void
8831 {
8832 /* Need commas after the first capture. */
8835 /* Eat the leading `['. */
8838 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8846 {
8849 }
8852 {
8854 tree capture_id;
8855 tree capture_init_expr;
8859 enum capture_kind_type
8860 {
8861 BY_COPY,
8862 BY_REFERENCE
8863 };
8867 {
8870 }
8874 else
8877 /* Possibly capture `this'. */
8879 {
8889 explicit_init_p);
8891 }
8893 /* Remember whether we want to capture as a reference or not. */
8895 {
8898 }
8900 /* Get the identifier. */
8905 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8906 delimiters, but I modified this to stop on unnested ']' as well. It
8907 was already changed to stop on unnested '}', so the
8908 "closing_parenthesis" name is no more misleading with my change. */
8909 {
8915 }
8917 /* Find the initializer for this capture. */
8921 {
8923 /* An explicit initializer exists. */
8926 "lambda capture initializers "
8932 {
8935 }
8936 }
8937 else
8938 {
8941 /* Turn the identifier into an id-expression. */
8942 capture_init_expr
8947 {
8950 }
8954 {
8957 capture_init_expr);
8960 }
8963 {
8966 capture_init_expr);
8969 }
8971 capture_init_expr
8972 = finish_id_expression
8974 capture_init_expr,
8988 {
8991 }
8992 else
8994 }
8998 {
9003 capture_id);
9007 "capture of %qD redundant with by-reference capture "
9009 }
9012 capture_id,
9013 capture_init_expr,
9015 explicit_init_p);
9016 }
9019 }
9021 /* Parse the (optional) middle of a lambda expression.
9023 lambda-declarator:
9024 < template-parameter-list [opt] >
9025 ( parameter-declaration-clause [opt] )
9026 attribute-specifier [opt]
9027 mutable [opt]
9028 exception-specification [opt]
9029 lambda-return-type-clause [opt]
9031 LAMBDA_EXPR is the current representation of the lambda expression. */
9033 static bool
9035 {
9036 /* 5.1.1.4 of the standard says:
9037 If a lambda-expression does not include a lambda-declarator, it is as if
9038 the lambda-declarator were ().
9039 This means an empty parameter list, no attributes, and no exception
9040 specification. */
9046 /* The template-parameter-list is optional, but must begin with
9047 an opening angle if present. */
9049 {
9052 "lambda templates are only available with "
9061 /* We just processed one more parameter list. */
9063 }
9065 /* The parameter-declaration-clause is optional (unless
9066 template-parameter-list was given), but must begin with an
9067 opening parenthesis if present. */
9069 {
9074 /* Parse parameters. */
9077 /* Default arguments shall not be specified in the
9078 parameter-declaration-clause of a lambda-declarator. */
9088 /* Parse optional `mutable' keyword. */
9090 {
9093 }
9095 /* Parse optional exception specification. */
9098 /* Parse optional trailing return type. */
9100 {
9104 }
9106 /* The function parameters must be in scope all the way until after the
9107 trailing-return-type in case of decltype. */
9109 }
9113 /* Create the function call operator.
9115 Messing with declarators like this is no uglier than building up the
9116 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9117 other code. */
9118 {
9119 cp_decl_specifier_seq return_type_specs;
9121 tree fco;
9128 else
9129 /* Maybe we will deduce the return type later. */
9135 sfk_none);
9140 VIRT_SPEC_UNSPECIFIED,
9141 REF_QUAL_NONE,
9142 exception_spec,
9147 declarator,
9148 attributes);
9150 {
9153 /* Give the object parameter a different name. */
9155 }
9157 {
9161 }
9170 }
9171 }
9173 /* Parse the body of a lambda expression, which is simply
9175 compound-statement
9177 but which requires special handling.
9178 LAMBDA_EXPR is the current representation of the lambda expression. */
9180 static void
9182 {
9187 else
9188 /* Still increment function_depth so that we don't GC in the
9189 middle of an expression. */
9191 /* Clear this in case we're in the middle of a default argument. */
9194 /* Finish the function call operator
9195 - class_specifier
9196 + late_parsing_for_member
9197 + function_definition_after_declarator
9198 + ctor_initializer_opt_and_function_body */
9199 {
9201 tree body;
9203 tree compound_stmt;
9204 tree cap;
9206 /* Let the front end know that we are going to be defining this
9207 function. */
9209 NULL_TREE,
9218 /* Push the proxies for any explicit captures. */
9225 /* 5.1.1.4 of the standard says:
9226 If a lambda-expression does not include a trailing-return-type, it
9227 is as if the trailing-return-type denotes the following type:
9228 * if the compound-statement is of the form
9229 { return attribute-specifier [opt] expression ; }
9230 the type of the returned expression after lvalue-to-rvalue
9231 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9232 (_conv.array_ 4.2), and function-to-pointer conversion
9233 (_conv.func_ 4.3);
9234 * otherwise, void. */
9236 /* In a lambda that has neither a lambda-return-type-clause
9237 nor a deducible form, errors should be reported for return statements
9238 in the body. Since we used void as the placeholder return type, parsing
9239 the body as usual will give such desired behavior. */
9243 {
9247 /* Parse tentatively in case there's more after the initial return
9248 statement. */
9259 {
9263 /* Will get error here if type not deduced yet. */
9267 }
9268 }
9271 {
9276 }
9280 out:
9284 /* Finish the function and generate code for it if necessary. */
9287 /* Only expand if the call op is not a template. */
9290 }
9295 else
9297 }
9299 /* Statements [gram.stmt.stmt] */
9301 /* Parse a statement.
9303 statement:
9304 labeled-statement
9305 expression-statement
9306 compound-statement
9307 selection-statement
9308 iteration-statement
9309 jump-statement
9310 declaration-statement
9311 try-block
9313 C++11:
9315 statement:
9316 labeled-statement
9317 attribute-specifier-seq (opt) expression-statement
9318 attribute-specifier-seq (opt) compound-statement
9319 attribute-specifier-seq (opt) selection-statement
9320 attribute-specifier-seq (opt) iteration-statement
9321 attribute-specifier-seq (opt) jump-statement
9322 declaration-statement
9323 attribute-specifier-seq (opt) try-block
9325 TM Extension:
9327 statement:
9328 atomic-statement
9330 IN_COMPOUND is true when the statement is nested inside a
9331 cp_parser_compound_statement; this matters for certain pragmas.
9333 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9334 is a (possibly labeled) if statement which is not enclosed in braces
9335 and has an else clause. This is used to implement -Wparentheses. */
9337 static void
9340 {
9345 restart:
9348 /* There is no statement yet. */
9354 /* In obj-c++, seeing '[[' might be the either the beginning of
9355 c++11 attributes, or a nested objc-message-expression. So
9356 let's parse the c++11 attributes tentatively. */
9360 {
9363 }
9365 /* Peek at the next token. */
9367 /* Remember the location of the first token in the statement. */
9369 /* If this is a keyword, then that will often determine what kind of
9370 statement we have. */
9372 {
9376 {
9379 /* Looks like a labeled-statement with a case label.
9380 Parse the label, and then use tail recursion to parse
9381 the statement. */
9403 /* Objective-C++ exception-handling constructs. */
9417 /* This must be a namespace alias definition. */
9430 /* It might be a keyword like `int' that can start a
9431 declaration-statement. */
9433 }
9434 }
9436 {
9437 /* If the next token is a `:', then we are looking at a
9438 labeled-statement. */
9441 {
9442 /* Looks like a labeled-statement with an ordinary label.
9443 Parse the label, and then use tail recursion to parse
9444 the statement. */
9448 }
9449 }
9450 /* Anything that starts with a `{' must be a compound-statement. */
9453 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9454 a statement all its own. */
9456 {
9457 /* Only certain OpenMP pragmas are attached to statements, and thus
9458 are considered statements themselves. All others are not. In
9459 the context of a compound, accept the pragma as a "statement" and
9460 return so that we can check for a close brace. Otherwise we
9461 require a real statement and must go back and read one. */
9467 }
9469 {
9472 }
9474 /* Everything else must be a declaration-statement or an
9475 expression-statement. Try for the declaration-statement
9476 first, unless we are looking at a `;', in which case we know that
9477 we have an expression-statement. */
9479 {
9481 {
9483 {
9484 /* Attributes should be parsed as part of the the
9485 declaration, so let's un-parse them. */
9488 }
9491 /* Try to parse the declaration-statement. */
9493 /* If that worked, we're done. */
9496 }
9497 /* Look for an expression-statement instead. */
9499 }
9501 /* Set the line number for the statement. */
9505 /* Note that for now, we don't do anything with c++11 statements
9506 parsed at this level. */
9509 OPT_Wattributes,
9511 }
9513 /* Parse the label for a labeled-statement, i.e.
9515 identifier :
9516 case constant-expression :
9517 default :
9519 GNU Extension:
9520 case constant-expression ... constant-expression : statement
9522 When a label is parsed without errors, the label is added to the
9523 parse tree by the finish_* functions, so this function doesn't
9524 have to return the label. */
9526 static void
9528 {
9533 /* The next token should be an identifier. */
9537 {
9540 }
9544 {
9546 {
9550 /* Consume the `case' token. */
9552 /* Parse the constant-expression. */
9555 NULL);
9559 {
9560 /* Consume the `...' token. */
9562 expr_hi =
9565 NULL);
9566 /* We don't need to emit warnings here, as the common code
9567 will do this for us. */
9568 }
9569 else
9574 else
9577 expr);
9578 }
9582 /* Consume the `default' token. */
9587 else
9592 /* Anything else must be an ordinary label. */
9595 }
9597 /* Require the `:' token. */
9600 /* An ordinary label may optionally be followed by attributes.
9601 However, this is only permitted if the attributes are then
9602 followed by a semicolon. This is because, for backward
9603 compatibility, when parsing
9604 lab: __attribute__ ((unused)) int i;
9605 we want the attribute to attach to "i", not "lab". */
9608 {
9609 tree attrs;
9616 ;
9617 else
9619 }
9625 }
9627 /* Parse an expression-statement.
9629 expression-statement:
9630 expression [opt] ;
9632 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9633 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9634 indicates whether this expression-statement is part of an
9635 expression statement. */
9637 static tree
9639 {
9643 /* If the next token is a ';', then there is no expression
9644 statement. */
9646 {
9650 {
9653 }
9654 }
9656 /* Give a helpful message for "A<T>::type t;" and the like. */
9659 {
9666 {
9667 /* A::A a; */
9672 }
9673 }
9675 /* Consume the final `;'. */
9680 /* This is the final expression statement of a statement
9681 expression. */
9687 }
9689 /* Parse a compound-statement.
9691 compound-statement:
9692 { statement-seq [opt] }
9694 GNU extension:
9696 compound-statement:
9697 { label-declaration-seq [opt] statement-seq [opt] }
9699 label-declaration-seq:
9700 label-declaration
9701 label-declaration-seq label-declaration
9703 Returns a tree representing the statement. */
9705 static tree
9708 {
9709 tree compound_stmt;
9711 /* Consume the `{'. */
9718 /* Begin the compound-statement. */
9720 /* If the next keyword is `__label__' we have a label declaration. */
9723 /* Parse an (optional) statement-seq. */
9725 /* Finish the compound-statement. */
9727 /* Consume the `}'. */
9731 }
9733 /* Parse an (optional) statement-seq.
9735 statement-seq:
9736 statement
9737 statement-seq [opt] statement */
9739 static void
9741 {
9742 /* Scan statements until there aren't any more. */
9744 {
9747 /* If we are looking at a `}', then we have run out of
9748 statements; the same is true if we have reached the end
9749 of file, or have stumbled upon a stray '@end'. */
9756 /* If we are in a compound statement and find 'else' then
9757 something went wrong. */
9759 {
9762 else
9763 {
9766 }
9767 }
9769 /* Parse the statement. */
9771 }
9772 }
9774 /* Parse a selection-statement.
9776 selection-statement:
9777 if ( condition ) statement
9778 if ( condition ) statement else statement
9779 switch ( condition ) statement
9781 Returns the new IF_STMT or SWITCH_STMT.
9783 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9784 is a (possibly labeled) if statement which is not enclosed in
9785 braces and has an else clause. This is used to implement
9786 -Wparentheses. */
9788 static tree
9790 {
9797 /* Peek at the next token. */
9800 /* See what kind of keyword it is. */
9803 {
9806 {
9807 tree statement;
9808 tree condition;
9810 /* Look for the `('. */
9812 {
9815 }
9817 /* Begin the selection-statement. */
9820 else
9823 /* Parse the condition. */
9825 /* Look for the `)'. */
9831 {
9835 /* Add the condition. */
9838 /* Parse the then-clause. */
9842 {
9850 }
9851 else
9857 /* If the next token is `else', parse the else-clause. */
9859 RID_ELSE))
9860 {
9861 /* Consume the `else' keyword. */
9864 /* Parse the else-clause. */
9866 {
9867 location_t loc;
9874 }
9875 else
9880 /* If we are currently parsing a then-clause, then
9881 IF_P will not be NULL. We set it to true to
9882 indicate that this if statement has an else clause.
9883 This may trigger the Wparentheses warning below
9884 when we get back up to the parent if statement. */
9887 }
9888 else
9889 {
9890 /* This if statement does not have an else clause. If
9891 NESTED_IF is true, then the then-clause is an if
9892 statement which does have an else clause. We warn
9893 about the potential ambiguity. */
9896 "suggest explicit braces to avoid ambiguous"
9898 }
9900 /* Now we're all done with the if-statement. */
9902 }
9903 else
9904 {
9908 /* Add the condition. */
9911 /* Parse the body of the switch-statement. */
9920 /* Now we're all done with the switch-statement. */
9922 }
9925 }
9931 }
9932 }
9934 /* Parse a condition.
9936 condition:
9937 expression
9938 type-specifier-seq declarator = initializer-clause
9939 type-specifier-seq declarator braced-init-list
9941 GNU Extension:
9943 condition:
9944 type-specifier-seq declarator asm-specification [opt]
9945 attributes [opt] = assignment-expression
9947 Returns the expression that should be tested. */
9949 static tree
9951 {
9952 cp_decl_specifier_seq type_specifiers;
9956 /* Try the declaration first. */
9958 /* New types are not allowed in the type-specifier-seq for a
9959 condition. */
9961 parser->type_definition_forbidden_message
9963 /* Parse the type-specifier-seq. */
9965 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9968 /* Restore the saved message. */
9970 /* If all is well, we might be looking at a declaration. */
9972 {
9973 tree decl;
9974 tree asm_specification;
9975 tree attributes;
9979 /* Parse the declarator. */
9984 /* Parse the attributes. */
9986 /* Parse the asm-specification. */
9988 /* If the next token is not an `=' or '{', then we might still be
9989 looking at an expression. For example:
9991 if (A(a).x)
9993 looks like a decl-specifier-seq and a declarator -- but then
9994 there is no `=', so this is an expression. */
9999 /* If we did see an `=' or '{', then we are looking at a declaration
10000 for sure. */
10002 {
10003 tree pushed_scope;
10007 /* Create the declaration. */
10013 /* Parse the initializer. */
10015 {
10019 }
10020 else
10021 {
10022 /* Consume the `='. */
10025 }
10029 /* Process the initializer. */
10032 asm_specification,
10033 flags);
10039 }
10040 }
10041 /* If we didn't even get past the declarator successfully, we are
10042 definitely not looking at a declaration. */
10043 else
10046 /* Otherwise, we are looking at an expression. */
10048 }
10050 /* Parses a for-statement or range-for-statement until the closing ')',
10051 not included. */
10053 static tree
10055 {
10059 /* Begin the for-statement. */
10062 /* Parse the initialization. */
10067 else
10069 }
10071 static tree
10073 {
10074 /* Normal for loop */
10077 tree stmt;
10080 /* The for-init-statement has already been parsed in
10081 cp_parser_for_init_statement, so no work is needed here. */
10084 /* If there's a condition, process it. */
10088 {
10092 }
10094 /* Look for the `;'. */
10097 /* If there's an expression, process it. */
10103 }
10105 /* Tries to parse a range-based for-statement:
10107 range-based-for:
10108 decl-specifier-seq declarator : expression
10110 The decl-specifier-seq declarator and the `:' are already parsed by
10111 cp_parser_for_init_statement. If processing_template_decl it returns a
10112 newly created RANGE_FOR_STMT; if not, it is converted to a
10113 regular FOR_STMT. */
10115 static tree
10118 {
10122 {
10125 }
10126 else
10129 /* If in template, STMT is converted to a normal for-statement
10130 at instantiation. If not, it is done just ahead. */
10132 {
10140 /* do_auto_deduction doesn't mess with template init-lists. */
10143 }
10144 else
10145 {
10148 }
10150 }
10152 /* Subroutine of cp_convert_range_for: given the initializer expression,
10153 builds up the range temporary. */
10155 static tree
10157 {
10160 /* Find out the type deduced by the declaration
10161 `auto &&__range = range_expr'. */
10166 /* Create the __range variable. */
10173 }
10175 /* Used by cp_parser_range_for in template context: we aren't going to
10176 do a full conversion yet, but we still need to resolve auto in the
10177 type of the for-range-declaration if present. This is basically
10178 a shortcut version of cp_convert_range_for. */
10180 static void
10182 {
10185 {
10188 iter_type = (cp_parser_perform_range_for_lookup
10191 {
10193 iter_type);
10195 tf_warning_or_error);
10198 }
10199 }
10200 }
10202 /* Converts a range-based for-statement into a normal
10203 for-statement, as per the definition.
10205 for (RANGE_DECL : RANGE_EXPR)
10206 BLOCK
10208 should be equivalent to:
10210 {
10211 auto &&__range = RANGE_EXPR;
10212 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10213 __begin != __end;
10214 ++__begin)
10215 {
10216 RANGE_DECL = *__begin;
10217 BLOCK
10218 }
10219 }
10221 If RANGE_EXPR is an array:
10222 BEGIN_EXPR = __range
10223 END_EXPR = __range + ARRAY_SIZE(__range)
10224 Else if RANGE_EXPR has a member 'begin' or 'end':
10225 BEGIN_EXPR = __range.begin()
10226 END_EXPR = __range.end()
10227 Else:
10228 BEGIN_EXPR = begin(__range)
10229 END_EXPR = end(__range);
10231 If __range has a member 'begin' but not 'end', or vice versa, we must
10232 still use the second alternative (it will surely fail, however).
10233 When calling begin()/end() in the third alternative we must use
10234 argument dependent lookup, but always considering 'std' as an associated
10235 namespace. */
10237 tree
10240 {
10246 /* If an error happened previously do nothing or else a lot of
10247 unhelpful errors would be issued. */
10249 else
10250 {
10251 tree range_temp;
10255 /* Can't bind a reference to an array of runtime bound. */
10257 else
10258 {
10263 LOOKUP_ONLYCONVERTING);
10265 }
10268 }
10270 /* The new for initialization statement. */
10278 LOOKUP_ONLYCONVERTING);
10287 LOOKUP_ONLYCONVERTING);
10291 /* The new for condition. */
10298 /* The new increment expression. */
10301 tf_warning_or_error);
10304 /* The declaration is initialized with *__begin inside the loop body. */
10307 tf_warning_or_error),
10309 LOOKUP_ONLYCONVERTING);
10312 }
10314 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10315 We need to solve both at the same time because the method used
10316 depends on the existence of members begin or end.
10317 Returns the type deduced for the iterator expression. */
10319 static tree
10321 {
10323 {
10326 }
10329 {
10334 }
10336 {
10337 /* If RANGE is an array, we will use pointer arithmetic. */
10340 range,
10344 }
10345 else
10346 {
10347 /* If it is not an array, we must do a bit of magic. */
10357 tf_warning_or_error);
10360 tf_warning_or_error);
10363 {
10364 /* Use the member functions. */
10367 else
10373 else
10376 }
10377 else
10378 {
10379 /* Use global functions with ADL. */
10386 tf_warning_or_error);
10388 tf_warning_or_error);
10390 tf_warning_or_error);
10392 tf_warning_or_error);
10395 }
10397 /* Last common checks. */
10399 {
10400 /* If one of the expressions is an error do no more checks. */
10403 }
10406 /* Can happen, when, eg, in a template context, Koenig lookup
10407 can't resolve begin/end (c++/58503). */
10409 else
10410 {
10412 /* The unqualified type of the __begin and __end temporaries should
10413 be the same, as required by the multiple auto declaration. */
10419 }
10420 }
10421 }
10423 /* Helper function for cp_parser_perform_range_for_lookup.
10424 Builds a tree for RANGE.IDENTIFIER(). */
10426 static tree
10428 {
10441 tf_warning_or_error);
10444 }
10446 /* Parse an iteration-statement.
10448 iteration-statement:
10449 while ( condition ) statement
10450 do statement while ( expression ) ;
10451 for ( for-init-statement condition [opt] ; expression [opt] )
10452 statement
10454 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10456 static tree
10458 {
10461 tree statement;
10464 /* Peek at the next token. */
10469 /* Remember whether or not we are already within an iteration
10470 statement. */
10473 /* See what kind of keyword it is. */
10476 {
10478 {
10479 tree condition;
10481 /* Begin the while-statement. */
10483 /* Look for the `('. */
10485 /* Parse the condition. */
10488 /* Look for the `)'. */
10490 /* Parse the dependent statement. */
10494 /* We're done with the while-statement. */
10496 }
10500 {
10501 tree expression;
10503 /* Begin the do-statement. */
10505 /* Parse the body of the do-statement. */
10510 /* Look for the `while' keyword. */
10512 /* Look for the `('. */
10514 /* Parse the expression. */
10516 /* We're done with the do-statement. */
10518 /* Look for the `)'. */
10520 /* Look for the `;'. */
10522 }
10526 {
10527 /* Look for the `('. */
10532 /* Look for the `)'. */
10535 /* Parse the body of the for-statement. */
10540 /* We're done with the for-statement. */
10542 }
10549 }
10552 }
10554 /* Parse a for-init-statement or the declarator of a range-based-for.
10555 Returns true if a range-based-for declaration is seen.
10557 for-init-statement:
10558 expression-statement
10559 simple-declaration */
10561 static bool
10563 {
10564 /* If the next token is a `;', then we have an empty
10565 expression-statement. Grammatically, this is also a
10566 simple-declaration, but an invalid one, because it does not
10567 declare anything. Therefore, if we did not handle this case
10568 specially, we would issue an error message about an invalid
10569 declaration. */
10571 {
10577 /* We're going to speculatively look for a declaration, falling back
10578 to an expression, if necessary. */
10580 /* Parse the declaration. */
10583 decl);
10586 {
10587 /* It is a range-for, consume the ':' */
10591 {
10593 "range-based %<for%> loops are not allowed "
10596 }
10597 }
10598 else
10599 /* The ';' is not consumed yet because we told
10600 cp_parser_simple_declaration not to. */
10605 /* If the tentative parse failed, then we shall need to look for an
10606 expression-statement. */
10607 }
10608 /* If we are here, it is an expression-statement. */
10611 }
10613 /* Parse a jump-statement.
10615 jump-statement:
10616 break ;
10617 continue ;
10618 return expression [opt] ;
10619 return braced-init-list ;
10620 goto identifier ;
10622 GNU extension:
10624 jump-statement:
10625 goto * expression ;
10627 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10629 static tree
10631 {
10637 /* Peek at the next token. */
10642 /* See what kind of keyword it is. */
10645 {
10649 {
10669 }
10675 {
10682 /* Fall through. */
10692 }
10697 {
10698 tree expr;
10702 {
10706 }
10709 else
10710 /* If the next token is a `;', then there is no
10711 expression. */
10713 /* Build the return-statement. */
10715 /* Look for the final `;'. */
10717 }
10721 /* Create the goto-statement. */
10723 {
10724 /* Issue a warning about this use of a GNU extension. */
10726 /* Consume the '*' token. */
10728 /* Parse the dependent expression. */
10730 }
10731 else
10733 /* Look for the final `;'. */
10740 }
10743 }
10745 /* Parse a declaration-statement.
10747 declaration-statement:
10748 block-declaration */
10750 static void
10752 {
10755 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10758 /* Parse the block-declaration. */
10761 /* Free any declarators allocated. */
10763 }
10765 /* Some dependent statements (like `if (cond) statement'), are
10766 implicitly in their own scope. In other words, if the statement is
10767 a single statement (as opposed to a compound-statement), it is
10768 none-the-less treated as if it were enclosed in braces. Any
10769 declarations appearing in the dependent statement are out of scope
10770 after control passes that point. This function parses a statement,
10771 but ensures that is in its own scope, even if it is not a
10772 compound-statement.
10774 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10775 is a (possibly labeled) if statement which is not enclosed in
10776 braces and has an else clause. This is used to implement
10777 -Wparentheses.
10779 Returns the new statement. */
10781 static tree
10783 {
10784 tree statement;
10789 /* Mark if () ; with a special NOP_EXPR. */
10791 {
10795 }
10796 /* if a compound is opened, we simply parse the statement directly. */
10799 /* If the token is not a `{', then we must take special action. */
10800 else
10801 {
10802 /* Create a compound-statement. */
10804 /* Parse the dependent-statement. */
10806 /* Finish the dummy compound-statement. */
10808 }
10810 /* Return the statement. */
10812 }
10814 /* For some dependent statements (like `while (cond) statement'), we
10815 have already created a scope. Therefore, even if the dependent
10816 statement is a compound-statement, we do not want to create another
10817 scope. */
10819 static void
10821 {
10822 /* If the token is a `{', then we must take special action. */
10825 else
10826 {
10827 /* Avoid calling cp_parser_compound_statement, so that we
10828 don't create a new scope. Do everything else by hand. */
10830 /* If the next keyword is `__label__' we have a label declaration. */
10833 /* Parse an (optional) statement-seq. */
10836 }
10837 }
10839 /* Declarations [gram.dcl.dcl] */
10841 /* Parse an optional declaration-sequence.
10843 declaration-seq:
10844 declaration
10845 declaration-seq declaration */
10847 static void
10849 {
10851 {
10862 {
10863 /* A declaration consisting of a single semicolon is
10864 invalid. Allow it unless we're being pedantic. */
10869 }
10871 /* If we're entering or exiting a region that's implicitly
10872 extern "C", modify the lang context appropriately. */
10874 {
10877 }
10879 {
10882 }
10885 {
10886 /* A top-level declaration can consist solely of a #pragma.
10887 A nested declaration cannot, so this is done here and not
10888 in cp_parser_declaration. (A #pragma at block scope is
10889 handled in cp_parser_statement.) */
10892 }
10894 /* Parse the declaration itself. */
10896 }
10897 }
10899 /* Parse a declaration.
10901 declaration:
10902 block-declaration
10903 function-definition
10904 template-declaration
10905 explicit-instantiation
10906 explicit-specialization
10907 linkage-specification
10908 namespace-definition
10910 GNU extension:
10912 declaration:
10913 __extension__ declaration */
10915 static void
10917 {
10918 cp_token token1;
10919 cp_token token2;
10924 /* Check for the `__extension__' keyword. */
10926 {
10927 /* Parse the qualified declaration. */
10929 /* Restore the PEDANTIC flag. */
10933 }
10935 /* Try to figure out what kind of declaration is present. */
10940 else
10941 {
10944 }
10946 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10949 /* If the next token is `extern' and the following token is a string
10950 literal, then we have a linkage specification. */
10954 /* If the next token is `template', then we have either a template
10955 declaration, an explicit instantiation, or an explicit
10956 specialization. */
10958 {
10959 /* `template <>' indicates a template specialization. */
10963 /* `template <' indicates a template declaration. */
10966 /* Anything else must be an explicit instantiation. */
10967 else
10969 }
10970 /* If the next token is `export', then we have a template
10971 declaration. */
10974 /* If the next token is `extern', 'static' or 'inline' and the one
10975 after that is `template', we have a GNU extended explicit
10976 instantiation directive. */
10983 /* If the next token is `namespace', check for a named or unnamed
10984 namespace definition. */
10990 /* An unnamed namespace definition. */
10994 /* An inline (associated) namespace definition. */
10998 /* Objective-C++ declaration/definition. */
11005 /* We must have either a block declaration or a function
11006 definition. */
11007 else
11008 /* Try to parse a block-declaration, or a function-definition. */
11011 /* Free any declarators allocated. */
11013 }
11015 /* Parse a block-declaration.
11017 block-declaration:
11018 simple-declaration
11019 asm-definition
11020 namespace-alias-definition
11021 using-declaration
11022 using-directive
11024 GNU Extension:
11026 block-declaration:
11027 __extension__ block-declaration
11029 C++0x Extension:
11031 block-declaration:
11032 static_assert-declaration
11034 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11035 part of a declaration-statement. */
11037 static void
11040 {
11044 /* Check for the `__extension__' keyword. */
11046 {
11047 /* Parse the qualified declaration. */
11049 /* Restore the PEDANTIC flag. */
11053 }
11055 /* Peek at the next token to figure out which kind of declaration is
11056 present. */
11059 /* If the next keyword is `asm', we have an asm-definition. */
11061 {
11065 }
11066 /* If the next keyword is `namespace', we have a
11067 namespace-alias-definition. */
11070 /* If the next keyword is `using', we have a
11071 using-declaration, a using-directive, or an alias-declaration. */
11073 {
11078 /* If the token after `using' is `namespace', then we have a
11079 using-directive. */
11083 /* If the second token after 'using' is '=', then we have an
11084 alias-declaration. */
11090 /* Otherwise, it's a using-declaration. */
11091 else
11094 }
11095 /* If the next keyword is `__label__' we have a misplaced label
11096 declaration. */
11098 {
11102 /* If the next token is now a `;', consume it. */
11105 }
11106 /* If the next token is `static_assert' we have a static assertion. */
11109 /* Anything else must be a simple-declaration. */
11110 else
11113 }
11115 /* Parse a simple-declaration.
11117 simple-declaration:
11118 decl-specifier-seq [opt] init-declarator-list [opt] ;
11120 init-declarator-list:
11121 init-declarator
11122 init-declarator-list , init-declarator
11124 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11125 function-definition as a simple-declaration.
11127 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11128 parsed declaration if it is an uninitialized single declarator not followed
11129 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11130 if present, will not be consumed. */
11132 static void
11136 {
11137 cp_decl_specifier_seq decl_specifiers;
11144 /* Defer access checks until we know what is being declared; the
11145 checks for names appearing in the decl-specifier-seq should be
11146 done as if we were in the scope of the thing being declared. */
11149 /* Parse the decl-specifier-seq. We have to keep track of whether
11150 or not the decl-specifier-seq declares a named class or
11151 enumeration type, since that is the only case in which the
11152 init-declarator-list is allowed to be empty.
11154 [dcl.dcl]
11156 In a simple-declaration, the optional init-declarator-list can be
11157 omitted only when declaring a class or enumeration, that is when
11158 the decl-specifier-seq contains either a class-specifier, an
11159 elaborated-type-specifier, or an enum-specifier. */
11161 CP_PARSER_FLAGS_OPTIONAL,
11164 /* We no longer need to defer access checks. */
11167 /* In a block scope, a valid declaration must always have a
11168 decl-specifier-seq. By not trying to parse declarators, we can
11169 resolve the declaration/expression ambiguity more quickly. */
11172 {
11175 }
11177 /* If the next two tokens are both identifiers, the code is
11178 erroneous. The usual cause of this situation is code like:
11180 T t;
11182 where "T" should name a type -- but does not. */
11185 {
11186 /* If parsing tentatively, we should commit; we really are
11187 looking at a declaration. */
11189 /* Give up. */
11191 }
11193 /* If we have seen at least one decl-specifier, and the next token
11194 is not a parenthesis, then we must be looking at a declaration.
11195 (After "int (" we might be looking at a functional cast.) */
11202 /* Keep going until we hit the `;' at the end of the simple
11203 declaration. */
11206 CPP_SEMICOLON))
11207 {
11210 tree decl;
11213 {
11214 /* If we are processing next declarator, coma is expected */
11220 }
11221 else
11224 /* Parse the init-declarator. */
11227 function_definition_allowed_p,
11229 declares_class_or_enum,
11231 maybe_range_for_decl);
11232 /* If an error occurred while parsing tentatively, exit quickly.
11233 (That usually happens when in the body of a function; each
11234 statement is treated as a declaration-statement until proven
11235 otherwise.) */
11238 /* Handle function definitions specially. */
11240 {
11241 /* If the next token is a `,', then we are probably
11242 processing something like:
11244 void f() {}, *p;
11246 which is erroneous. */
11248 {
11251 "mixing"
11253 }
11254 /* Otherwise, we're done with the list of declarators. */
11255 else
11256 {
11259 }
11260 }
11263 /* The next token should be either a `,' or a `;'. */
11265 /* If it's a `,', there are more declarators to come. */
11268 /* If it's a `;', we are done. */
11271 /* Anything else is an error. */
11272 else
11273 {
11274 /* If we have already issued an error message we don't need
11275 to issue another one. */
11279 /* Skip tokens until we reach the end of the statement. */
11281 /* If the next token is now a `;', consume it. */
11285 }
11286 /* After the first time around, a function-definition is not
11287 allowed -- even if it was OK at first. For example:
11289 int i, f() {}
11291 is not valid. */
11293 }
11295 /* Issue an error message if no declarators are present, and the
11296 decl-specifier-seq does not itself declare a class or
11297 enumeration: [dcl.dcl]/3. */
11299 {
11301 {
11305 /* Ensure an error is issued anyway when finish_decltype_type,
11306 called via cp_parser_decl_specifier_seq, returns a class or
11307 an enumeration (c++/51786). */
11310 }
11311 /* Perform any deferred access checks. */
11313 }
11315 /* Consume the `;'. */
11319 done:
11321 }
11323 /* Parse a decl-specifier-seq.
11325 decl-specifier-seq:
11326 decl-specifier-seq [opt] decl-specifier
11327 decl-specifier attribute-specifier-seq [opt] (C++11)
11329 decl-specifier:
11330 storage-class-specifier
11331 type-specifier
11332 function-specifier
11333 friend
11334 typedef
11336 GNU Extension:
11338 decl-specifier:
11339 attributes
11341 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11343 The parser flags FLAGS is used to control type-specifier parsing.
11345 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11346 flags:
11348 1: one of the decl-specifiers is an elaborated-type-specifier
11349 (i.e., a type declaration)
11350 2: one of the decl-specifiers is an enum-specifier or a
11351 class-specifier (i.e., a type definition)
11353 */
11355 static void
11357 cp_parser_flags flags,
11360 {
11364 cp_decl_spec ds;
11366 /* Clear DECL_SPECS. */
11369 /* Assume no class or enumeration type is declared. */
11372 /* Keep reading specifiers until there are no more to read. */
11374 {
11379 /* Peek at the next token. */
11382 /* Save the first token of the decl spec list for error
11383 reporting. */
11386 /* Handle attributes. */
11388 {
11389 /* Parse the attributes. */
11392 /* In a sequence of declaration specifiers, c++11 attributes
11393 appertain to the type that precede them. In that case
11394 [dcl.spec]/1 says:
11396 The attribute-specifier-seq affects the type only for
11397 the declaration it appears in, not other declarations
11398 involving the same type.
11400 But for now let's force the user to position the
11401 attribute either at the beginning of the declaration or
11402 after the declarator-id, which would clearly mean that it
11403 applies to the declarator. */
11405 {
11407 /* The c++11 attribute is at the beginning of the
11408 declaration. It appertains to the entity being
11410 else
11411 {
11413 {
11414 /* This is an attribute following a
11415 class-specifier. */
11420 }
11421 else
11422 {
11423 decl_specs->std_attributes
11425 attrs);
11428 }
11430 }
11431 }
11433 decl_specs->attributes
11435 attrs);
11439 }
11440 /* Assume we will find a decl-specifier keyword. */
11442 /* If the next token is an appropriate keyword, we can simply
11443 add it to the list. */
11445 {
11446 /* decl-specifier:
11447 friend
11448 constexpr */
11451 {
11454 }
11455 else
11456 {
11458 /* Consume the token. */
11460 }
11468 /* function-specifier:
11469 inline
11470 virtual
11471 explicit */
11478 /* decl-specifier:
11479 typedef */
11482 /* Consume the token. */
11484 /* A constructor declarator cannot appear in a typedef. */
11486 /* The "typedef" keyword can only occur in a declaration; we
11487 may as well commit at this point. */
11494 /* storage-class-specifier:
11495 auto
11496 register
11497 static
11498 extern
11499 mutable
11501 GNU Extension:
11502 thread */
11505 {
11506 /* Consume the token. */
11509 /* Complain about `auto' as a storage specifier, if
11510 we're complaining about C++0x compatibility. */
11514 /* Set the storage class anyway. */
11516 token);
11517 }
11518 else
11519 /* C++0x auto type-specifier. */
11527 /* Consume the token. */
11530 token);
11533 /* Consume the token. */
11539 /* We did not yet find a decl-specifier yet. */
11542 }
11552 /* Constructors are a special case. The `S' in `S()' is not a
11553 decl-specifier; it is the beginning of the declarator. */
11554 constructor_p
11555 = (!found_decl_spec
11556 && constructor_possible_p
11557 && (cp_parser_constructor_declarator_p
11560 /* If we don't have a DECL_SPEC yet, then we must be looking at
11561 a type-specifier. */
11563 {
11566 tree type_spec;
11568 type_spec
11570 decl_specs,
11576 /* If this type-specifier referenced a user-defined type
11577 (a typedef, class-name, etc.), then we can't allow any
11578 more such type-specifiers henceforth.
11580 [dcl.spec]
11582 The longest sequence of decl-specifiers that could
11583 possibly be a type name is taken as the
11584 decl-specifier-seq of a declaration. The sequence shall
11585 be self-consistent as described below.
11587 [dcl.type]
11589 As a general rule, at most one type-specifier is allowed
11590 in the complete decl-specifier-seq of a declaration. The
11591 only exceptions are the following:
11593 -- const or volatile can be combined with any other
11594 type-specifier.
11596 -- signed or unsigned can be combined with char, long,
11597 short, or int.
11599 -- ..
11601 Example:
11603 typedef char* Pc;
11604 void g (const int Pc);
11606 Here, Pc is *not* part of the decl-specifier seq; it's
11607 the declarator. Therefore, once we see a type-specifier
11608 (other than a cv-qualifier), we forbid any additional
11609 user-defined types. We *do* still allow things like `int
11610 int' to be considered a decl-specifier-seq, and issue the
11611 error message later. */
11614 /* A constructor declarator cannot follow a type-specifier. */
11616 {
11621 }
11622 }
11624 /* If we still do not have a DECL_SPEC, then there are no more
11625 decl-specifiers. */
11630 /* After we see one decl-specifier, further decl-specifiers are
11631 always optional. */
11633 }
11635 /* Don't allow a friend specifier with a class definition. */
11640 }
11642 /* Parse an (optional) storage-class-specifier.
11644 storage-class-specifier:
11645 auto
11646 register
11647 static
11648 extern
11649 mutable
11651 GNU Extension:
11653 storage-class-specifier:
11654 thread
11656 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11658 static tree
11660 {
11662 {
11666 /* Fall through for C++98. */
11673 /* Consume the token. */
11678 }
11679 }
11681 /* Parse an (optional) function-specifier.
11683 function-specifier:
11684 inline
11685 virtual
11686 explicit
11688 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11689 Updates DECL_SPECS, if it is non-NULL. */
11691 static tree
11694 {
11697 {
11703 /* 14.5.2.3 [temp.mem]
11705 A member function template shall not be virtual. */
11708 else
11718 }
11720 /* Consume the token. */
11722 }
11724 /* Parse a linkage-specification.
11726 linkage-specification:
11727 extern string-literal { declaration-seq [opt] }
11728 extern string-literal declaration */
11730 static void
11732 {
11733 tree linkage;
11735 /* Look for the `extern' keyword. */
11738 /* Look for the string-literal. */
11741 /* Transform the literal into an identifier. If the literal is a
11742 wide-character string, or contains embedded NULs, then we can't
11743 handle it as the user wants. */
11746 {
11748 /* Assume C++ linkage. */
11750 }
11751 else
11754 /* We're now using the new linkage. */
11757 /* If the next token is a `{', then we're using the first
11758 production. */
11760 {
11763 /* Consume the `{' token. */
11765 /* Parse the declarations. */
11767 /* Look for the closing `}'. */
11769 }
11770 /* Otherwise, there's just one declaration. */
11771 else
11772 {
11775 saved_in_unbraced_linkage_specification_p
11779 parser->in_unbraced_linkage_specification_p
11781 }
11783 /* We're done with the linkage-specification. */
11785 }
11787 /* Parse a static_assert-declaration.
11789 static_assert-declaration:
11790 static_assert ( constant-expression , string-literal ) ;
11792 If MEMBER_P, this static_assert is a class member. */
11794 static void
11796 {
11797 tree condition;
11798 tree message;
11800 location_t saved_loc;
11803 /* Peek at the `static_assert' token so we can keep track of exactly
11804 where the static assertion started. */
11808 /* Look for the `static_assert' keyword. */
11810 RT_STATIC_ASSERT))
11813 /* We know we are in a static assertion; commit to any tentative
11814 parse. */
11818 /* Parse the `(' starting the static assertion condition. */
11821 /* Parse the constant-expression. Allow a non-constant expression
11822 here in order to give better diagnostics in finish_static_assert. */
11823 condition =
11828 /* Parse the separating `,'. */
11831 /* Parse the string-literal message. */
11836 /* A `)' completes the static assertion. */
11843 /* A semicolon terminates the declaration. */
11846 /* Complete the static assertion, which may mean either processing
11847 the static assert now or saving it for template instantiation. */
11849 }
11851 /* Parse the expression in decltype ( expression ). */
11853 static tree
11856 {
11858 tree expr;
11860 /* First, try parsing an id-expression. */
11871 {
11874 cp_id_kind idk;
11878 /* Lookup the name we got back from the id-expression. */
11889 {
11890 /* Complete lookup of the id-expression. */
11891 expr = (finish_id_expression
11904 /* We found an id-expression, but it was something that we
11905 should not have found. This is an error, not something
11906 we can recover from, so note that we found an
11907 id-expression and we'll recover as gracefully as
11908 possible. */
11910 }
11915 /* We have an id-expression. */
11917 }
11920 {
11921 /* Abort the id-expression parse. */
11924 /* Parsing tentatively, again. */
11927 /* Parse a class member access. */
11935 /* We have an id-expression. */
11937 }
11940 /* We have parsed the complete id-expression or member access. */
11942 else
11943 {
11944 /* Abort our attempt to parse an id-expression or member access
11945 expression. */
11948 /* Parse a full expression. */
11951 }
11954 }
11956 /* Parse a `decltype' type. Returns the type.
11958 simple-type-specifier:
11959 decltype ( expression )
11960 C++14 proposal:
11961 decltype ( auto ) */
11963 static tree
11965 {
11966 tree expr;
11975 {
11976 /* Already parsed. */
11979 }
11981 /* Look for the `decltype' token. */
11985 /* Parse the opening `('. */
11989 /* decltype (auto) */
11992 {
11999 }
12001 /* Types cannot be defined in a `decltype' expression. Save away the
12002 old message. */
12005 /* And create the new one. */
12006 parser->type_definition_forbidden_message
12009 /* The restrictions on constant-expressions do not apply inside
12010 decltype expressions. */
12011 saved_integral_constant_expression_p
12013 saved_non_integral_constant_expression_p
12017 /* Within a parenthesized expression, a `>' token is always
12018 the greater-than operator. */
12019 saved_greater_than_is_operator_p
12023 /* Do not actually evaluate the expression. */
12026 /* Do not warn about problems with the expression. */
12031 /* Go back to evaluating expressions. */
12035 /* The `>' token might be the end of a template-id or
12036 template-parameter-list now. */
12037 parser->greater_than_is_operator_p
12040 /* Restore the old message and the integral constant expression
12041 flags. */
12043 parser->integral_constant_expression_p
12045 parser->non_integral_constant_expression_p
12048 /* Parse to the closing `)'. */
12050 {
12054 }
12057 tf_warning_or_error);
12059 rewrite:
12060 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12061 it again. */
12068 }
12070 /* Special member functions [gram.special] */
12072 /* Parse a conversion-function-id.
12074 conversion-function-id:
12075 operator conversion-type-id
12077 Returns an IDENTIFIER_NODE representing the operator. */
12079 static tree
12081 {
12082 tree type;
12083 tree saved_scope;
12084 tree saved_qualifying_scope;
12085 tree saved_object_scope;
12088 /* Look for the `operator' token. */
12091 /* When we parse the conversion-type-id, the current scope will be
12092 reset. However, we need that information in able to look up the
12093 conversion function later, so we save it here. */
12097 /* We must enter the scope of the class so that the names of
12098 entities declared within the class are available in the
12099 conversion-type-id. For example, consider:
12101 struct S {
12102 typedef int I;
12103 operator I();
12104 };
12106 S::operator I() { ... }
12108 In order to see that `I' is a type-name in the definition, we
12109 must be in the scope of `S'. */
12112 /* Parse the conversion-type-id. */
12114 /* Leave the scope of the class, if any. */
12117 /* Restore the saved scope. */
12121 /* If the TYPE is invalid, indicate failure. */
12125 }
12127 /* Parse a conversion-type-id:
12129 conversion-type-id:
12130 type-specifier-seq conversion-declarator [opt]
12132 Returns the TYPE specified. */
12134 static tree
12136 {
12137 tree attributes;
12138 cp_decl_specifier_seq type_specifiers;
12140 tree type_specified;
12143 /* Parse the attributes. */
12147 parser->type_definition_forbidden_message
12150 /* Parse the type-specifiers. */
12157 /* If that didn't work, stop. */
12160 /* Parse the conversion-declarator. */
12168 /* Don't give this error when parsing tentatively. This happens to
12169 work because we always parse this definitively once. */
12172 {
12174 {
12177 }
12181 }
12184 }
12186 /* Parse an (optional) conversion-declarator.
12188 conversion-declarator:
12189 ptr-operator conversion-declarator [opt]
12191 */
12195 {
12198 cp_cv_quals cv_quals;
12200 /* We don't know if there's a ptr-operator next, or not. */
12202 /* Try the ptr-operator. */
12205 /* If it worked, look for more conversion-declarators. */
12207 {
12210 /* Parse another optional declarator. */
12213 declarator = cp_parser_make_indirect_declarator
12217 }
12220 }
12222 /* Parse an (optional) ctor-initializer.
12224 ctor-initializer:
12225 : mem-initializer-list
12227 Returns TRUE iff the ctor-initializer was actually present. */
12229 static bool
12231 {
12232 /* If the next token is not a `:', then there is no
12233 ctor-initializer. */
12235 {
12236 /* Do default initialization of any bases and members. */
12241 }
12243 /* Consume the `:' token. */
12245 /* And the mem-initializer-list. */
12249 }
12251 /* Parse a mem-initializer-list.
12253 mem-initializer-list:
12254 mem-initializer ... [opt]
12255 mem-initializer ... [opt] , mem-initializer-list */
12257 static void
12259 {
12264 /* Let the semantic analysis code know that we are starting the
12265 mem-initializer-list. */
12270 /* Loop through the list. */
12272 {
12273 tree mem_initializer;
12276 /* Parse the mem-initializer. */
12278 /* If the next token is a `...', we're expanding member initializers. */
12280 {
12281 /* Consume the `...'. */
12284 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12285 can be expanded but members cannot. */
12288 {
12293 }
12295 /* Construct the pack expansion type. */
12298 }
12301 {
12305 }
12306 /* Look for a target constructor. */
12310 {
12313 {
12317 }
12319 }
12320 /* Add it to the list, unless it was erroneous. */
12322 {
12325 }
12326 /* If the next token is not a `,', we're done. */
12329 /* Consume the `,' token. */
12331 }
12333 /* Perform semantic analysis. */
12336 }
12338 /* Parse a mem-initializer.
12340 mem-initializer:
12341 mem-initializer-id ( expression-list [opt] )
12342 mem-initializer-id braced-init-list
12344 GNU extension:
12346 mem-initializer:
12347 ( expression-list [opt] )
12349 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12350 class) or FIELD_DECL (for a non-static data member) to initialize;
12351 the TREE_VALUE is the expression-list. An empty initialization
12352 list is represented by void_list_node. */
12354 static tree
12356 {
12357 tree mem_initializer_id;
12358 tree expression_list;
12359 tree member;
12362 /* Find out what is being initialized. */
12364 {
12368 }
12369 else
12370 {
12374 }
12380 {
12387 }
12388 else
12389 {
12399 }
12409 }
12411 /* Parse a mem-initializer-id.
12413 mem-initializer-id:
12414 :: [opt] nested-name-specifier [opt] class-name
12415 identifier
12417 Returns a TYPE indicating the class to be initializer for the first
12418 production. Returns an IDENTIFIER_NODE indicating the data member
12419 to be initialized for the second production. */
12421 static tree
12423 {
12427 tree id;
12431 /* `typename' is not allowed in this context ([temp.res]). */
12433 {
12435 "keyword %<typename%> not allowed in this context (a qualified "
12438 }
12439 /* Look for the optional `::' operator. */
12440 global_scope_p
12444 /* Look for the optional nested-name-specifier. The simplest way to
12445 implement:
12447 [temp.res]
12449 The keyword `typename' is not permitted in a base-specifier or
12450 mem-initializer; in these contexts a qualified name that
12451 depends on a template-parameter is implicitly assumed to be a
12452 type name.
12454 is to assume that we have seen the `typename' keyword at this
12455 point. */
12456 nested_name_specifier_p
12465 /* If there is a `::' operator or a nested-name-specifier, then we
12466 are definitely looking for a class-name. */
12471 typename_type,
12475 /* Otherwise, we could also be looking for an ordinary identifier. */
12477 /* Try a class-name. */
12481 none_type,
12485 /* If we found one, we're done. */
12488 /* Otherwise, look for an ordinary identifier. */
12490 }
12492 /* Overloading [gram.over] */
12494 /* Parse an operator-function-id.
12496 operator-function-id:
12497 operator operator
12499 Returns an IDENTIFIER_NODE for the operator which is a
12500 human-readable spelling of the identifier, e.g., `operator +'. */
12502 static tree
12504 {
12505 /* Look for the `operator' keyword. */
12508 /* And then the name of the operator itself. */
12510 }
12512 /* Return an identifier node for a user-defined literal operator.
12513 The suffix identifier is chained to the operator name identifier. */
12515 static tree
12517 {
12518 tree identifier;
12525 }
12527 /* Parse an operator.
12529 operator:
12530 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12531 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12532 || ++ -- , ->* -> () []
12534 GNU Extensions:
12536 operator:
12537 <? >? <?= >?=
12539 Returns an IDENTIFIER_NODE for the operator which is a
12540 human-readable spelling of the identifier, e.g., `operator +'. */
12542 static tree
12544 {
12549 /* Peek at the next token. */
12551 /* Figure out which operator we have. */
12553 {
12555 {
12558 /* The keyword should be either `new' or `delete'. */
12563 else
12566 /* Consume the `new' or `delete' token. */
12569 /* Peek at the next token. */
12571 /* If it's a `[' token then this is the array variant of the
12572 operator. */
12574 {
12575 /* Consume the `[' token. */
12577 /* Look for the `]' token. */
12581 }
12582 /* Otherwise, we have the non-array variant. */
12583 else
12587 }
12734 /* Consume the `('. */
12736 /* Look for the matching `)'. */
12741 /* Consume the `['. */
12743 /* Look for the matching `]'. */
12752 /* Fall through. */
12758 {
12761 }
12763 {
12766 }
12767 /* Consume the string. */
12769 /* Look for the suffix identifier. */
12772 {
12775 {
12778 }
12779 }
12781 {
12785 }
12786 else
12787 {
12790 }
12797 /* Fall through. */
12803 {
12806 }
12807 {
12810 {
12813 }
12815 /* Consume the user-defined string literal. */
12818 {
12821 }
12822 else
12824 }
12827 /* Anything else is an error. */
12829 }
12831 /* If we have selected an identifier, we need to consume the
12832 operator token. */
12835 /* Otherwise, no valid operator name was present. */
12836 else
12837 {
12840 }
12843 }
12845 /* Parse a template-declaration.
12847 template-declaration:
12848 export [opt] template < template-parameter-list > declaration
12850 If MEMBER_P is TRUE, this template-declaration occurs within a
12851 class-specifier.
12853 The grammar rule given by the standard isn't correct. What
12854 is really meant is:
12856 template-declaration:
12857 export [opt] template-parameter-list-seq
12858 decl-specifier-seq [opt] init-declarator [opt] ;
12859 export [opt] template-parameter-list-seq
12860 function-definition
12862 template-parameter-list-seq:
12863 template-parameter-list-seq [opt]
12864 template < template-parameter-list > */
12866 static void
12868 {
12869 /* Check for `export'. */
12871 {
12872 /* Consume the `export' token. */
12874 /* Warn that we do not support `export'. */
12876 }
12879 }
12881 /* Parse a template-parameter-list.
12883 template-parameter-list:
12884 template-parameter
12885 template-parameter-list , template-parameter
12887 Returns a TREE_LIST. Each node represents a template parameter.
12888 The nodes are connected via their TREE_CHAINs. */
12890 static tree
12892 {
12897 /* The loop below parses the template parms. We first need to know
12898 the total number of template parms to be able to compute proper
12899 canonical types of each dependent type. So after the loop, when
12900 we know the total number of template parms,
12901 end_template_parm_list computes the proper canonical types and
12902 fixes up the dependent types accordingly. */
12904 {
12905 tree parameter;
12908 location_t parm_loc;
12910 /* Parse the template-parameter. */
12915 /* Add it to the list. */
12918 parm_loc,
12919 parameter,
12920 is_non_type,
12921 is_parameter_pack);
12922 else
12923 {
12926 }
12928 /* If the next token is not a `,', we're done. */
12931 /* Otherwise, consume the `,' token. */
12933 }
12936 }
12938 /* Parse a template-parameter.
12940 template-parameter:
12941 type-parameter
12942 parameter-declaration
12944 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12945 the parameter. The TREE_PURPOSE is the default value, if any.
12946 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12947 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12948 set to true iff this parameter is a parameter pack. */
12950 static tree
12953 {
12957 tree parm;
12959 /* Assume it is a type parameter or a template parameter. */
12961 /* Assume it not a parameter pack. */
12963 /* Peek at the next token. */
12965 /* If it is `class' or `template', we have a type-parameter. */
12968 /* If it is `class' or `typename' we do not know yet whether it is a
12969 type parameter or a non-type parameter. Consider:
12971 template <typename T, typename T::X X> ...
12973 or:
12975 template <class C, class D*> ...
12977 Here, the first parameter is a type parameter, and the second is
12978 a non-type parameter. We can tell by looking at the token after
12979 the identifier -- if it is a `,', `=', or `>' then we have a type
12980 parameter. */
12982 {
12983 /* Peek at the token after `class' or `typename'. */
12985 /* If it's an ellipsis, we have a template type parameter
12986 pack. */
12989 /* If it's an identifier, skip it. */
12992 /* Now, see if the token looks like the end of a template
12993 parameter. */
12998 }
13000 /* Otherwise, it is a non-type parameter.
13002 [temp.param]
13004 When parsing a default template-argument for a non-type
13005 template-parameter, the first non-nested `>' is taken as the end
13006 of the template parameter-list rather than a greater-than
13007 operator. */
13009 parameter_declarator
13016 /* If the parameter declaration is marked as a parameter pack, set
13017 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13018 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13019 grokdeclarator. */
13022 {
13025 }
13028 {
13029 /* Can happen in some cases of erroneous input (c++/34892). */
13031 /* Consume the `...' for better error recovery. */
13033 }
13034 /* If the next token is an ellipsis, and we don't already have it
13035 marked as a parameter pack, then we have a parameter pack (that
13036 has no declarator). */
13039 && (declarator_can_be_parameter_pack
13041 {
13042 /* Consume the `...'. */
13047 }
13048 /* We might end up with a pack expansion as the type of the non-type
13049 template parameter, in which case this is a non-type template
13050 parameter pack. */
13053 {
13057 }
13060 {
13061 /* Parameter packs cannot have default arguments. However, a
13062 user may try to do so, so we'll parse them and give an
13063 appropriate diagnostic here. */
13067 /* Find the name of the parameter pack. */
13076 else
13080 /* Parse the default argument, but throw away the result. */
13082 }
13092 }
13094 /* Parse a type-parameter.
13096 type-parameter:
13097 class identifier [opt]
13098 class identifier [opt] = type-id
13099 typename identifier [opt]
13100 typename identifier [opt] = type-id
13101 template < template-parameter-list > class identifier [opt]
13102 template < template-parameter-list > class identifier [opt]
13103 = id-expression
13105 GNU Extension (variadic templates):
13107 type-parameter:
13108 class ... identifier [opt]
13109 typename ... identifier [opt]
13111 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13112 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13113 the declaration of the parameter.
13115 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13117 static tree
13119 {
13121 tree parameter;
13123 /* Look for a keyword to tell us what kind of parameter this is. */
13129 {
13132 {
13133 tree identifier;
13134 tree default_argument;
13136 /* If the next token is an ellipsis, we have a template
13137 argument pack. */
13139 {
13140 /* Consume the `...' token. */
13145 }
13147 /* If the next token is an identifier, then it names the
13148 parameter. */
13151 else
13154 /* Create the parameter. */
13157 /* If the next token is an `=', we have a default argument. */
13159 {
13160 /* Consume the `=' token. */
13162 /* Parse the default-argument. */
13166 /* Template parameter packs cannot have default
13167 arguments. */
13169 {
13172 "template parameter pack %qD cannot have a "
13174 else
13176 "template parameter packs cannot have "
13179 }
13181 }
13182 else
13185 /* Create the combined representation of the parameter and the
13186 default argument. */
13188 }
13192 {
13193 tree identifier;
13194 tree default_argument;
13196 /* Look for the `<'. */
13198 /* Parse the template-parameter-list. */
13200 /* Look for the `>'. */
13202 /* Look for the `class' keyword. */
13204 /* If the next token is an ellipsis, we have a template
13205 argument pack. */
13207 {
13208 /* Consume the `...' token. */
13213 }
13214 /* If the next token is an `=', then there is a
13215 default-argument. If the next token is a `>', we are at
13216 the end of the parameter-list. If the next token is a `,',
13217 then we are at the end of this parameter. */
13221 {
13223 /* Treat invalid names as if the parameter were nameless. */
13226 }
13227 else
13230 /* Create the template parameter. */
13232 identifier);
13234 /* If the next token is an `=', then there is a
13235 default-argument. */
13237 {
13240 /* Consume the `='. */
13242 /* Parse the id-expression. */
13244 /* save token before parsing the id-expression, for error
13245 reporting */
13247 default_argument
13255 /* If the id-expression was a template-id that refers to
13256 a template-class, we already have the declaration here,
13257 so no further lookup is needed. */
13258 ;
13259 else
13260 /* Look up the name. */
13261 default_argument
13263 none_type,
13269 /* See if the default argument is valid. */
13270 default_argument
13273 /* Template parameter packs cannot have default
13274 arguments. */
13276 {
13279 "template parameter pack %qD cannot "
13281 identifier);
13282 else
13286 }
13288 }
13289 else
13292 /* Create the combined representation of the parameter and the
13293 default argument. */
13295 }
13301 }
13304 }
13306 /* Parse a template-id.
13308 template-id:
13309 template-name < template-argument-list [opt] >
13311 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13312 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13313 returned. Otherwise, if the template-name names a function, or set
13314 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13315 names a class, returns a TYPE_DECL for the specialization.
13317 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13318 uninstantiated templates. */
13320 static tree
13326 {
13328 tree templ;
13329 tree arguments;
13330 tree template_id;
13337 /* If the next token corresponds to a template-id, there is no need
13338 to reparse it. */
13341 {
13344 /* Get the stored value. */
13346 /* Perform any access checks that were deferred. */
13349 {
13354 tf_warning_or_error);
13355 }
13356 /* Return the stored value. */
13358 }
13360 /* Avoid performing name lookup if there is no possibility of
13361 finding a template-id. */
13364 && !cp_parser_nth_token_starts_template_argument_list_p
13366 {
13369 }
13371 /* Remember where the template-id starts. */
13377 /* Parse the template-name. */
13380 check_dependency_p,
13381 is_declaration,
13382 tag_type,
13385 {
13388 }
13390 /* If we find the sequence `[:' after a template-name, it's probably
13391 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13392 parse correctly the argument list. */
13399 {
13401 /* Change `:' into `::'. */
13403 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13404 CPP_LESS. */
13407 /* Parse the arguments. */
13410 {
13411 /* If we couldn't parse an argument list, then we revert our changes
13412 and return simply an error. Maybe this is not a template-id
13413 after all. */
13418 }
13419 /* Otherwise, emit an error about the invalid digraph, but continue
13420 parsing because we got our argument list. */
13423 {
13426 "%<<:%> is an alternate spelling for %<[%>."
13429 {
13431 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13434 }
13435 }
13436 }
13437 else
13438 {
13439 /* Look for the `<' that starts the template-argument-list. */
13441 {
13444 }
13445 /* Parse the arguments. */
13447 }
13449 /* Build a representation of the specialization. */
13452 TEMPLATE_ID_EXPR,
13456 {
13458 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13459 template (rather than some instantiation thereof) only if
13460 is not nested within some other construct. For example, in
13461 "template <typename T> void f(T) { A<T>::", A<T> is just an
13462 instantiation of A. */
13465 CPP_SCOPE));
13466 template_id
13468 }
13469 else
13470 {
13471 /* If it's not a class-template or a template-template, it should be
13472 a function-template. */
13478 }
13480 /* If parsing tentatively, replace the sequence of tokens that makes
13481 up the template-id with a CPP_TEMPLATE_ID token. That way,
13482 should we re-parse the token stream, we will not have to repeat
13483 the effort required to do the parse, nor will we issue duplicate
13484 error messages about problems during instantiation of the
13485 template. */
13487 /* Don't do this if we had a parse error in a declarator; re-parsing
13488 might succeed if a name changes meaning (60361). */
13492 {
13495 /* Reset the contents of the START_OF_ID token. */
13497 /* Retrieve any deferred checks. Do not pop this access checks yet
13498 so the memory will not be reclaimed during token replacing below. */
13504 /* Purge all subsequent tokens. */
13507 /* ??? Can we actually assume that, if template_id ==
13508 error_mark_node, we will have issued a diagnostic to the
13509 user, as opposed to simply marking the tentative parse as
13510 failed? */
13513 }
13517 }
13519 /* Parse a template-name.
13521 template-name:
13522 identifier
13524 The standard should actually say:
13526 template-name:
13527 identifier
13528 operator-function-id
13530 A defect report has been filed about this issue.
13532 A conversion-function-id cannot be a template name because they cannot
13533 be part of a template-id. In fact, looking at this code:
13535 a.operator K<int>()
13537 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13538 It is impossible to call a templated conversion-function-id with an
13539 explicit argument list, since the only allowed template parameter is
13540 the type to which it is converting.
13542 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13543 `template' keyword, in a construction like:
13545 T::template f<3>()
13547 In that case `f' is taken to be a template-name, even though there
13548 is no way of knowing for sure.
13550 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13551 name refers to a set of overloaded functions, at least one of which
13552 is a template, or an IDENTIFIER_NODE with the name of the template,
13553 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13554 names are looked up inside uninstantiated templates. */
13556 static tree
13563 {
13564 tree identifier;
13565 tree decl;
13566 tree fns;
13569 /* If the next token is `operator', then we have either an
13570 operator-function-id or a conversion-function-id. */
13572 {
13573 /* We don't know whether we're looking at an
13574 operator-function-id or a conversion-function-id. */
13576 /* Try an operator-function-id. */
13578 /* If that didn't work, try a conversion-function-id. */
13580 {
13583 }
13584 }
13585 /* Look for the identifier. */
13586 else
13589 /* If we didn't find an identifier, we don't have a template-id. */
13593 /* If the name immediately followed the `template' keyword, then it
13594 is a template-name. However, if the next token is not `<', then
13595 we do not treat it as a template-name, since it is not being used
13596 as part of a template-id. This enables us to handle constructs
13597 like:
13599 template <typename T> struct S { S(); };
13600 template <typename T> S<T>::S();
13602 correctly. We would treat `S' as a template -- if it were `S<T>'
13603 -- but we do not if there is no `<'. */
13607 {
13608 /* In a declaration, in a dependent context, we pretend that the
13609 "template" keyword was present in order to improve error
13610 recovery. For example, given:
13612 template <typename T> void f(T::X<int>);
13614 we want to treat "X<int>" as a template-id. */
13616 && !template_keyword_p
13618 && check_dependency_p
13620 /* Do not do this for dtors (or ctors), since they never
13621 need the template keyword before their name. */
13623 {
13626 /* Explain what went wrong. */
13628 identifier);
13631 /* If parsing tentatively, find the location of the "<" token. */
13634 /* Parse the template arguments so that we can issue error
13635 messages about them. */
13638 /* Skip tokens until we find a good place from which to
13639 continue parsing. */
13644 /* If parsing tentatively, permanently remove the
13645 template argument list. That will prevent duplicate
13646 error messages from being issued about the missing
13647 "template" keyword. */
13653 }
13655 /* If the "template" keyword is present, then there is generally
13656 no point in doing name-lookup, so we just return IDENTIFIER.
13657 But, if the qualifying scope is non-dependent then we can
13658 (and must) do name-lookup normally. */
13664 }
13666 /* Look up the name. */
13668 tag_type,
13671 check_dependency_p,
13675 /* If DECL is a template, then the name was a template-name. */
13677 ;
13678 else
13679 {
13682 /* The standard does not explicitly indicate whether a name that
13683 names a set of overloaded declarations, some of which are
13684 templates, is a template-name. However, such a name should
13685 be a template-name; otherwise, there is no way to form a
13686 template-id for the overloaded templates. */
13694 {
13695 /* The name does not name a template. */
13698 }
13699 }
13701 /* If DECL is dependent, and refers to a function, then just return
13702 its name; we will look it up again during template instantiation. */
13704 {
13708 }
13711 }
13713 /* Parse a template-argument-list.
13715 template-argument-list:
13716 template-argument ... [opt]
13717 template-argument-list , template-argument ... [opt]
13719 Returns a TREE_VEC containing the arguments. */
13721 static tree
13723 {
13728 tree vec;
13735 /* Even if the template-id appears in an integral
13736 constant-expression, the contents of the argument list do
13737 not. */
13743 /* Parse the arguments. */
13744 do
13745 {
13746 tree argument;
13749 /* Consume the comma. */
13752 /* Parse the template-argument. */
13755 /* If the next token is an ellipsis, we're expanding a template
13756 argument pack. */
13758 {
13760 {
13764 }
13765 /* Consume the `...' token. */
13768 /* Make the argument into a TYPE_PACK_EXPANSION or
13769 EXPR_PACK_EXPANSION. */
13771 }
13774 {
13778 {
13781 }
13782 else
13784 }
13786 }
13799 #ifdef ENABLE_CHECKING
13801 #endif
13803 }
13805 /* Parse a template-argument.
13807 template-argument:
13808 assignment-expression
13809 type-id
13810 id-expression
13812 The representation is that of an assignment-expression, type-id, or
13813 id-expression -- except that the qualified id-expression is
13814 evaluated, so that the value returned is either a DECL or an
13815 OVERLOAD.
13817 Although the standard says "assignment-expression", it forbids
13818 throw-expressions or assignments in the template argument.
13819 Therefore, we use "conditional-expression" instead. */
13821 static tree
13823 {
13824 tree argument;
13830 cp_id_kind idk;
13832 /* There's really no way to know what we're looking at, so we just
13833 try each alternative in order.
13835 [temp.arg]
13837 In a template-argument, an ambiguity between a type-id and an
13838 expression is resolved to a type-id, regardless of the form of
13839 the corresponding template-parameter.
13841 Therefore, we try a type-id first. */
13844 /* If there was no error parsing the type-id but the next token is a
13845 '>>', our behavior depends on which dialect of C++ we're
13846 parsing. In C++98, we probably found a typo for '> >'. But there
13847 are type-id which are also valid expressions. For instance:
13849 struct X { int operator >> (int); };
13850 template <int V> struct Foo {};
13851 Foo<X () >> 5> r;
13853 Here 'X()' is a valid type-id of a function type, but the user just
13854 wanted to write the expression "X() >> 5". Thus, we remember that we
13855 found a valid type-id, but we still try to parse the argument as an
13856 expression to see what happens.
13858 In C++0x, the '>>' will be considered two separate '>'
13859 tokens. */
13863 {
13866 }
13867 else
13868 {
13869 /* If the next token isn't a `,' or a `>', then this argument wasn't
13870 really finished. This means that the argument is not a valid
13871 type-id. */
13874 /* If that worked, we're done. */
13877 }
13878 /* We're still not sure what the argument will be. */
13880 /* Try a template. */
13888 /* If the next token isn't a `,' or a `>', then this argument wasn't
13889 really finished. */
13893 {
13894 /* Figure out what is being referred to. If the id-expression
13895 was for a class template specialization, then we will have a
13896 TYPE_DECL at this point. There is no need to do name lookup
13897 at this point in that case. */
13900 none_type,
13909 }
13912 /* It must be a non-type argument. There permitted cases are given
13913 in [temp.arg.nontype]:
13915 -- an integral constant-expression of integral or enumeration
13916 type; or
13918 -- the name of a non-type template-parameter; or
13920 -- the name of an object or function with external linkage...
13922 -- the address of an object or function with external linkage...
13924 -- a pointer to member... */
13925 /* Look for a non-type template parameter. */
13927 {
13939 }
13941 /* If the next token is "&", the argument must be the address of an
13942 object or function with external linkage. */
13945 {
13948 }
13949 /* See if we might have an id-expression. */
13956 {
13959 address_p,
13966 else
13967 {
13968 tree probe;
13971 {
13972 /* Strip the dereference temporarily. */
13975 }
13977 /* If we're in a template, we represent a qualified-id referring
13978 to a static data member as a SCOPE_REF even if the scope isn't
13979 dependent so that we can check access control later. */
13984 {
13985 /* A variable without external linkage might still be a
13986 valid constant-expression, so no error is issued here
13987 if the external-linkage check fails. */
13990 }
13992 /* All overloaded functions are allowed; if the external
13993 linkage test does not pass, an error will be issued
13994 later. */
13995 ;
13999 /* A pointer-to-member. */
14000 ;
14002 ;
14003 else
14007 {
14010 tf_warning_or_error);
14011 else
14014 }
14015 }
14016 }
14017 /* If the argument started with "&", there are no other valid
14018 alternatives at this point. */
14020 {
14023 }
14025 /* If the argument wasn't successfully parsed as a type-id followed
14026 by '>>', the argument can only be a constant expression now.
14027 Otherwise, we try parsing the constant-expression tentatively,
14028 because the argument could really be a type-id. */
14040 /* We did our best to parse the argument as a non type-id, but that
14041 was the only alternative that matched (albeit with a '>' after
14042 it). We can assume it's just a typo from the user, and a
14043 diagnostic will then be issued. */
14045 }
14047 /* Parse an explicit-instantiation.
14049 explicit-instantiation:
14050 template declaration
14052 Although the standard says `declaration', what it really means is:
14054 explicit-instantiation:
14055 template decl-specifier-seq [opt] declarator [opt] ;
14057 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14058 supposed to be allowed. A defect report has been filed about this
14059 issue.
14061 GNU Extension:
14063 explicit-instantiation:
14064 storage-class-specifier template
14065 decl-specifier-seq [opt] declarator [opt] ;
14066 function-specifier template
14067 decl-specifier-seq [opt] declarator [opt] ; */
14069 static void
14071 {
14073 cp_decl_specifier_seq decl_specifiers;
14078 /* Look for an (optional) storage-class-specifier or
14079 function-specifier. */
14081 {
14082 extension_specifier
14085 extension_specifier
14088 }
14090 /* Look for the `template' keyword. */
14092 /* Let the front end know that we are processing an explicit
14093 instantiation. */
14095 /* [temp.explicit] says that we are supposed to ignore access
14096 control while processing explicit instantiation directives. */
14098 /* Parse a decl-specifier-seq. */
14100 CP_PARSER_FLAGS_OPTIONAL,
14103 /* If there was exactly one decl-specifier, and it declared a class,
14104 and there's no declarator, then we have an explicit type
14105 instantiation. */
14107 {
14108 tree type;
14112 /* Turn access control back on for names used during
14113 template instantiation. */
14118 }
14119 else
14120 {
14122 tree decl;
14124 /* Parse the declarator. */
14125 declarator
14135 {
14138 "explicit instantiation shall not use"
14142 "explicit instantiation shall not use"
14147 /* Turn access control back on for names used during
14148 template instantiation. */
14150 /* Do the explicit instantiation. */
14152 }
14153 else
14154 {
14156 /* Skip the body of the explicit instantiation. */
14158 }
14159 }
14160 /* We're done with the instantiation. */
14166 }
14168 /* Parse an explicit-specialization.
14170 explicit-specialization:
14171 template < > declaration
14173 Although the standard says `declaration', what it really means is:
14175 explicit-specialization:
14176 template <> decl-specifier [opt] init-declarator [opt] ;
14177 template <> function-definition
14178 template <> explicit-specialization
14179 template <> template-declaration */
14181 static void
14183 {
14187 /* Look for the `template' keyword. */
14189 /* Look for the `<'. */
14191 /* Look for the `>'. */
14193 /* We have processed another parameter list. */
14195 /* [temp]
14197 A template ... explicit specialization ... shall not have C
14198 linkage. */
14200 {
14202 /* Give it C++ linkage to avoid confusing other parts of the
14203 front end. */
14206 }
14207 else
14209 /* Let the front end know that we are beginning a specialization. */
14211 {
14214 }
14216 /* If the next keyword is `template', we need to figure out whether
14217 or not we're looking a template-declaration. */
14219 {
14224 else
14226 }
14227 else
14228 /* Parse the dependent declaration. */
14234 /* We're done with the specialization. */
14236 /* For the erroneous case of a template with C linkage, we pushed an
14237 implicit C++ linkage scope; exit that scope now. */
14240 /* We're done with this parameter list. */
14242 }
14244 /* Parse a type-specifier.
14246 type-specifier:
14247 simple-type-specifier
14248 class-specifier
14249 enum-specifier
14250 elaborated-type-specifier
14251 cv-qualifier
14253 GNU Extension:
14255 type-specifier:
14256 __complex__
14258 Returns a representation of the type-specifier. For a
14259 class-specifier, enum-specifier, or elaborated-type-specifier, a
14260 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14262 The parser flags FLAGS is used to control type-specifier parsing.
14264 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14265 in a decl-specifier-seq.
14267 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14268 class-specifier, enum-specifier, or elaborated-type-specifier, then
14269 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14270 if a type is declared; 2 if it is defined. Otherwise, it is set to
14271 zero.
14273 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14274 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14275 is set to FALSE. */
14277 static tree
14279 cp_parser_flags flags,
14284 {
14290 /* Assume this type-specifier does not declare a new type. */
14293 /* And that it does not specify a cv-qualifier. */
14296 /* Peek at the next token. */
14299 /* If we're looking at a keyword, we can use that to guide the
14300 production we choose. */
14303 {
14308 /* Look for the enum-specifier. */
14310 /* If that worked, we're done. */
14312 {
14317 type_spec,
14318 token,
14321 }
14322 else
14325 /* Any of these indicate either a class-specifier, or an
14326 elaborated-type-specifier. */
14333 /* Parse tentatively so that we can back up if we don't find a
14334 class-specifier. */
14336 /* Look for the class-specifier. */
14339 /* If that worked, we're done. */
14341 {
14346 type_spec,
14347 token,
14350 }
14352 /* Fall through. */
14353 elaborated_type_specifier:
14354 /* We're declaring (not defining) a class or enum. */
14358 /* Fall through. */
14360 /* Look for an elaborated-type-specifier. */
14361 type_spec
14362 = (cp_parser_elaborated_type_specifier
14365 is_declaration));
14368 type_spec,
14369 token,
14392 /* The `__complex__' keyword is a GNU extension. */
14398 }
14400 /* Handle simple keywords. */
14402 {
14404 {
14407 }
14409 }
14411 /* If we do not already have a type-specifier, assume we are looking
14412 at a simple-type-specifier. */
14414 decl_specs,
14415 flags);
14417 /* If we didn't find a type-specifier, and a type-specifier was not
14418 optional in this context, issue an error message. */
14420 {
14423 }
14426 }
14428 /* Parse a simple-type-specifier.
14430 simple-type-specifier:
14431 :: [opt] nested-name-specifier [opt] type-name
14432 :: [opt] nested-name-specifier template template-id
14433 char
14434 wchar_t
14435 bool
14436 short
14437 int
14438 long
14439 signed
14440 unsigned
14441 float
14442 double
14443 void
14445 C++0x Extension:
14447 simple-type-specifier:
14448 auto
14449 decltype ( expression )
14450 char16_t
14451 char32_t
14452 __underlying_type ( type-id )
14454 GNU Extension:
14456 simple-type-specifier:
14457 __int128
14458 __typeof__ unary-expression
14459 __typeof__ ( type-id )
14460 __typeof__ ( type-id ) { initializer-list , [opt] }
14462 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14463 appropriately updated. */
14465 static tree
14468 cp_parser_flags flags)
14469 {
14473 /* Peek at the next token. */
14476 /* If we're looking at a keyword, things are easy. */
14478 {
14538 {
14542 {
14545 "use of %<auto%> in lambda parameter declaration "
14546 "only available with "
14548 }
14551 "use of %<auto%> in parameter declaration "
14552 "only available with "
14554 else
14556 "ISO C++ forbids use of %<auto%> in parameter "
14558 }
14559 else
14564 /* Since DR 743, decltype can either be a simple-type-specifier by
14565 itself or begin a nested-name-specifier. Parsing it will replace
14566 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14567 handling below decide what to do. */
14573 /* Consume the `typeof' token. */
14575 /* Parse the operand to `typeof'. */
14577 /* If it is not already a TYPE, take its type. */
14583 token,
14592 token,
14602 token,
14607 }
14609 /* If token is an already-parsed decltype not followed by ::,
14610 it's a simple-type-specifier. */
14613 {
14617 token,
14621 }
14623 /* If the type-specifier was for a built-in type, we're done. */
14625 {
14626 /* Record the type. */
14633 type,
14634 token,
14639 /* Consume the token. */
14642 /* There is no valid C++ program where a non-template type is
14643 followed by a "<". That usually indicates that the user thought
14644 that the type was a template. */
14649 }
14651 /* The type-specifier must be a user-defined type. */
14653 {
14657 /* Don't gobble tokens or issue error messages if this is an
14658 optional type-specifier. */
14662 /* Look for the optional `::' operator. */
14663 global_p
14667 /* Look for the nested-name specifier. */
14668 qualified_p
14676 /* If we have seen a nested-name-specifier, and the next token
14677 is `template', then we are using the template-id production. */
14680 {
14681 /* Look for the template-id. */
14685 none_type,
14687 /* If the template-id did not name a type, we are out of
14688 luck. */
14690 {
14693 }
14694 }
14695 /* Otherwise, look for a type-name. */
14696 else
14698 /* Keep track of all name-lookups performed in class scopes. */
14700 && !global_p
14701 && !qualified_p
14705 /* If it didn't work out, we don't have a TYPE. */
14711 token,
14713 }
14715 /* If we didn't get a type-name, issue an error message. */
14717 {
14720 }
14723 {
14724 /* See if TYPE is an Objective-C type, and if so, parse and
14725 accept any protocol references following it. Do this before
14726 the cp_parser_check_for_invalid_template_id() call, because
14727 Objective-C types can be followed by '<...>' which would
14728 enclose protocol names rather than template arguments, and so
14729 everything is fine. */
14732 {
14736 /* Clobber the "unqualified" type previously entered into
14737 DECL_SPECS with the new, improved protocol-qualified version. */
14742 }
14744 /* There is no valid C++ program where a non-template type is
14745 followed by a "<". That usually indicates that the user
14746 thought that the type was a template. */
14748 none_type,
14750 }
14753 }
14755 /* Parse a type-name.
14757 type-name:
14758 class-name
14759 enum-name
14760 typedef-name
14761 simple-template-id [in c++0x]
14763 enum-name:
14764 identifier
14766 typedef-name:
14767 identifier
14769 Returns a TYPE_DECL for the type. */
14771 static tree
14773 {
14774 tree type_decl;
14776 /* We can't know yet whether it is a class-name or not. */
14778 /* Try a class-name. */
14782 none_type,
14786 /* If it's not a class-name, keep looking. */
14788 {
14790 /* It must be a typedef-name or an enum-name. */
14794 /* It is either a simple-template-id representing an
14795 instantiation of an alias template... */
14799 none_type,
14801 /* Note that this must be an instantiation of an alias template
14802 because [temp.names]/6 says:
14804 A template-id that names an alias template specialization
14805 is a type-name.
14807 Whereas [temp.names]/7 says:
14809 A simple-template-id that names a class template
14810 specialization is a class-name. */
14815 else
14819 /* ... Or a typedef-name or an enum-name. */
14821 }
14824 }
14826 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14828 enum-name:
14829 identifier
14831 typedef-name:
14832 identifier
14834 Returns a TYPE_DECL for the type. */
14836 static tree
14838 {
14839 tree type_decl;
14840 tree identifier;
14847 /* Look up the type-name. */
14854 {
14855 /* See if this is an Objective-C type. */
14860 }
14862 /* Issue an error if we did not find a type-name. */
14864 /* In Objective-C, we have the complication that class names are
14865 normally type names and start declarations (eg, the
14866 "NSObject" in "NSObject *object;"), but can be used in an
14867 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14868 is an expression. So, a classname followed by a dot is not a
14869 valid type-name. */
14872 {
14877 }
14878 /* Remember that the name was used in the definition of the
14879 current class so that we can check later to see if the
14880 meaning would have been different after the class was
14881 entirely defined. */
14887 }
14889 /* Parse an elaborated-type-specifier. Note that the grammar given
14890 here incorporates the resolution to DR68.
14892 elaborated-type-specifier:
14893 class-key :: [opt] nested-name-specifier [opt] identifier
14894 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14895 enum-key :: [opt] nested-name-specifier [opt] identifier
14896 typename :: [opt] nested-name-specifier identifier
14897 typename :: [opt] nested-name-specifier template [opt]
14898 template-id
14900 GNU extension:
14902 elaborated-type-specifier:
14903 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14904 class-key attributes :: [opt] nested-name-specifier [opt]
14905 template [opt] template-id
14906 enum attributes :: [opt] nested-name-specifier [opt] identifier
14908 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14909 declared `friend'. If IS_DECLARATION is TRUE, then this
14910 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14911 something is being declared.
14913 Returns the TYPE specified. */
14915 static tree
14919 {
14921 tree identifier;
14924 tree globalscope;
14927 /* See if we're looking at the `enum' keyword. */
14929 {
14930 /* Consume the `enum' token. */
14932 /* Remember that it's an enumeration type. */
14934 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14935 enums) is used here. */
14938 {
14942 /* Consume the `struct' or `class' and parse it anyway. */
14944 }
14945 /* Parse the attributes. */
14947 }
14948 /* Or, it might be `typename'. */
14950 RID_TYPENAME))
14951 {
14952 /* Consume the `typename' token. */
14954 /* Remember that it's a `typename' type. */
14956 }
14957 /* Otherwise it must be a class-key. */
14958 else
14959 {
14963 /* Parse the attributes. */
14965 }
14967 /* Look for the `::' operator. */
14970 /* Look for the nested-name-specifier. */
14972 {
14977 is_declaration))
14979 }
14980 else
14981 /* Even though `typename' is not present, the proposed resolution
14982 to Core Issue 180 says that in `class A<T>::B', `B' should be
14983 considered a type-name, even if `A<T>' is dependent. */
14988 is_declaration);
14989 /* For everything but enumeration types, consider a template-id.
14990 For an enumeration type, consider only a plain identifier. */
14992 {
14994 tree decl;
14996 /* Allow the `template' keyword. */
14998 /* If we didn't see `template', we don't know if there's a
14999 template-id or not. */
15002 /* Parse the template-id. */
15006 tag_type,
15007 is_declaration);
15008 /* If we didn't find a template-id, look for an ordinary
15009 identifier. */
15011 ;
15012 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15013 in effect, then we must assume that, upon instantiation, the
15014 template will correspond to a class. */
15018 typename_type,
15020 /* If the `typename' keyword is in effect and DECL is not a type
15021 decl, then type is non existent. */
15023 ;
15029 }
15032 {
15037 {
15040 }
15042 /* For a `typename', we needn't call xref_tag. */
15046 identifier,
15048 /* Look up a qualified name in the usual way. */
15050 {
15051 tree decl;
15052 tree ambiguous_decls;
15055 tag_type,
15062 /* If the lookup was ambiguous, an error will already have been
15063 issued. */
15067 /* If we are parsing friend declaration, DECL may be a
15068 TEMPLATE_DECL tree node here. However, we need to check
15069 whether this TEMPLATE_DECL results in valid code. Consider
15070 the following example:
15072 namespace N {
15073 template <class T> class C {};
15074 }
15075 class X {
15076 template <class T> friend class N::C; // #1, valid code
15077 };
15078 template <class T> class Y {
15079 friend class N::C; // #2, invalid code
15080 };
15082 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15083 name lookup of `N::C'. We see that friend declaration must
15084 be template for the code to be valid. Note that
15085 processing_template_decl does not work here since it is
15086 always 1 for the above two cases. */
15088 decl = (cp_parser_maybe_treat_template_as_class
15093 {
15096 identifier,
15099 }
15102 {
15106 allow_template);
15110 }
15112 /* Forward declarations of nested types, such as
15114 class C1::C2;
15115 class C1::C2::C3;
15117 are invalid unless all components preceding the final '::'
15118 are complete. If all enclosing types are complete, these
15119 declarations become merely pointless.
15121 Invalid forward declarations of nested types are errors
15122 caught elsewhere in parsing. Those that are pointless arrive
15123 here. */
15130 }
15131 else
15132 {
15133 /* An elaborated-type-specifier sometimes introduces a new type and
15134 sometimes names an existing type. Normally, the rule is that it
15135 introduces a new type only if there is not an existing type of
15136 the same name already in scope. For example, given:
15138 struct S {};
15139 void f() { struct S s; }
15141 the `struct S' in the body of `f' is the same `struct S' as in
15142 the global scope; the existing definition is used. However, if
15143 there were no global declaration, this would introduce a new
15144 local class named `S'.
15146 An exception to this rule applies to the following code:
15148 namespace N { struct S; }
15150 Here, the elaborated-type-specifier names a new type
15151 unconditionally; even if there is already an `S' in the
15152 containing scope this declaration names a new type.
15153 This exception only applies if the elaborated-type-specifier
15154 forms the complete declaration:
15156 [class.name]
15158 A declaration consisting solely of `class-key identifier ;' is
15159 either a redeclaration of the name in the current scope or a
15160 forward declaration of the identifier as a class name. It
15161 introduces the name into the current scope.
15163 We are in this situation precisely when the next token is a `;'.
15165 An exception to the exception is that a `friend' declaration does
15166 *not* name a new type; i.e., given:
15168 struct S { friend struct T; };
15170 `T' is not a new type in the scope of `S'.
15172 Also, `new struct S' or `sizeof (struct S)' never results in the
15173 definition of a new type; a new type can only be declared in a
15174 declaration context. */
15176 tag_scope ts;
15180 /* Friends have special name lookup rules. */
15184 CPP_SEMICOLON))
15185 /* This is a `class-key identifier ;' */
15187 else
15190 template_p =
15194 /* An unqualified name was used to reference this type, so
15195 there were no qualifying templates. */
15202 }
15203 }
15208 /* Allow attributes on forward declarations of classes. */
15210 {
15220 else
15223 }
15226 {
15227 /* Indicate whether this class was declared as a `class' or as a
15228 `struct'. */
15232 }
15234 /* A "<" cannot follow an elaborated type specifier. If that
15235 happens, the user was probably trying to form a template-id. */
15240 }
15242 /* Parse an enum-specifier.
15244 enum-specifier:
15245 enum-head { enumerator-list [opt] }
15246 enum-head { enumerator-list , } [C++0x]
15248 enum-head:
15249 enum-key identifier [opt] enum-base [opt]
15250 enum-key nested-name-specifier identifier enum-base [opt]
15252 enum-key:
15253 enum
15254 enum class [C++0x]
15255 enum struct [C++0x]
15257 enum-base: [C++0x]
15258 : type-specifier-seq
15260 opaque-enum-specifier:
15261 enum-key identifier enum-base [opt] ;
15263 GNU Extensions:
15264 enum-key attributes[opt] identifier [opt] enum-base [opt]
15265 { enumerator-list [opt] }attributes[opt]
15266 enum-key attributes[opt] identifier [opt] enum-base [opt]
15267 { enumerator-list, }attributes[opt] [C++0x]
15269 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15270 if the token stream isn't an enum-specifier after all. */
15272 static tree
15274 {
15275 tree identifier;
15277 tree prev_scope;
15279 tree attributes;
15292 /* Parse tentatively so that we can back up if we don't find a
15293 enum-specifier. */
15296 /* Caller guarantees that the current token is 'enum', an identifier
15297 possibly follows, and the token after that is an opening brace.
15298 If we don't have an identifier, fabricate an anonymous name for
15299 the enumeration being defined. */
15302 /* Parse the "class" or "struct", which indicates a scoped
15303 enumeration type in C++0x. */
15306 {
15310 /* Consume the `struct' or `class' token. */
15314 }
15318 /* Clear the qualification. */
15323 /* Figure out in what scope the declaration is being placed. */
15329 nested_name_specifier
15337 {
15338 tree name;
15342 enum_type,
15347 input_location);
15349 {
15352 {
15353 /* Are template enums allowed in ISO? */
15357 /* ignore a typename reference, for it will be solved by name
15358 in start_enum. */
15360 }
15361 }
15364 else
15367 }
15368 else
15369 {
15372 else
15373 {
15379 }
15380 }
15383 /* Check for the `:' that denotes a specified underlying type in C++0x.
15384 Note that a ':' could also indicate a bitfield width, however. */
15386 {
15387 cp_decl_specifier_seq type_specifiers;
15389 /* Consume the `:'. */
15392 /* Parse the type-specifier-seq. */
15397 /* At this point this is surely not elaborated type specifier. */
15406 /* If that didn't work, stop. */
15408 {
15414 }
15415 }
15417 /* Look for the `{' but don't consume it yet. */
15419 {
15421 {
15424 {
15427 }
15428 }
15429 /* An opaque-enum-specifier must have a ';' here. */
15432 {
15435 {
15438 }
15439 }
15440 }
15446 {
15448 {
15452 }
15454 {
15456 }
15457 }
15459 /* Issue an error message if type-definitions are forbidden here. */
15462 else
15463 /* Create the new type. We do this before consuming the opening
15464 brace so the enum will be recorded as being on the line of its
15465 tag (or the 'enum' keyword, if there is no tag). */
15469 /* If the next token is not '{' it is an opaque-enum-specifier or an
15470 elaborated-type-specifier. */
15472 {
15476 {
15477 /* The following catches invalid code such as:
15478 enum class S<int>::E { A, B, C }; */
15486 {
15490 nested_name_specifier);
15492 }
15493 /* If that scope does not contain the scope in which the
15494 class was originally declared, the program is invalid. */
15496 nested_name_specifier))
15497 {
15500 "declaration of %qD in namespace %qD which does not "
15503 else
15505 "declaration of %qD in %qD which does not "
15509 }
15510 }
15515 /* Consume the opening brace. */
15522 {
15526 }
15527 else
15528 {
15533 }
15537 /* If the next token is not '}', then there are some enumerators. */
15539 {
15543 }
15544 else
15547 /* Consume the final '}'. */
15553 }
15554 else
15555 {
15556 /* If a ';' follows, then it is an opaque-enum-specifier
15557 and additional restrictions apply. */
15559 {
15566 }
15567 }
15569 /* Look for trailing attributes to apply to this enumeration, and
15570 apply them if appropriate. */
15572 {
15576 trailing_attr,
15578 }
15580 /* Finish up the enumeration. */
15582 {
15587 }
15590 {
15592 {
15595 }
15597 {
15599 }
15600 }
15601 out:
15604 }
15606 /* Parse an enumerator-list. The enumerators all have the indicated
15607 TYPE.
15609 enumerator-list:
15610 enumerator-definition
15611 enumerator-list , enumerator-definition */
15613 static void
15615 {
15617 {
15618 /* Parse an enumerator-definition. */
15621 /* If the next token is not a ',', we've reached the end of
15622 the list. */
15625 /* Otherwise, consume the `,' and keep going. */
15627 /* If the next token is a `}', there is a trailing comma. */
15629 {
15634 }
15635 }
15636 }
15638 /* Parse an enumerator-definition. The enumerator has the indicated
15639 TYPE.
15641 enumerator-definition:
15642 enumerator
15643 enumerator = constant-expression
15645 enumerator:
15646 identifier */
15648 static void
15650 {
15651 tree identifier;
15652 tree value;
15653 location_t loc;
15655 /* Save the input location because we are interested in the location
15656 of the identifier and not the location of the explicit value. */
15659 /* Look for the identifier. */
15664 /* If the next token is an '=', then there is an explicit value. */
15666 {
15667 /* Consume the `=' token. */
15669 /* Parse the value. */
15672 NULL);
15673 }
15674 else
15677 /* If we are processing a template, make sure the initializer of the
15678 enumerator doesn't contain any bare template parameter pack. */
15682 /* integral_constant_value will pull out this expression, so make sure
15683 it's folded as appropriate. */
15686 /* Create the enumerator. */
15688 }
15690 /* Parse a namespace-name.
15692 namespace-name:
15693 original-namespace-name
15694 namespace-alias
15696 Returns the NAMESPACE_DECL for the namespace. */
15698 static tree
15700 {
15701 tree identifier;
15702 tree namespace_decl;
15706 /* Get the name of the namespace. */
15711 /* Look up the identifier in the currently active scope. Look only
15712 for namespaces, due to:
15714 [basic.lookup.udir]
15716 When looking up a namespace-name in a using-directive or alias
15717 definition, only namespace names are considered.
15719 And:
15721 [basic.lookup.qual]
15723 During the lookup of a name preceding the :: scope resolution
15724 operator, object, function, and enumerator names are ignored.
15726 (Note that cp_parser_qualifying_entity only calls this
15727 function if the token after the name is the scope resolution
15728 operator.) */
15730 none_type,
15736 /* If it's not a namespace, issue an error. */
15739 {
15744 }
15747 }
15749 /* Parse a namespace-definition.
15751 namespace-definition:
15752 named-namespace-definition
15753 unnamed-namespace-definition
15755 named-namespace-definition:
15756 original-namespace-definition
15757 extension-namespace-definition
15759 original-namespace-definition:
15760 namespace identifier { namespace-body }
15762 extension-namespace-definition:
15763 namespace original-namespace-name { namespace-body }
15765 unnamed-namespace-definition:
15766 namespace { namespace-body } */
15768 static void
15770 {
15777 {
15781 }
15782 else
15785 /* Look for the `namespace' keyword. */
15788 /* Get the name of the namespace. We do not attempt to distinguish
15789 between an original-namespace-definition and an
15790 extension-namespace-definition at this point. The semantic
15791 analysis routines are responsible for that. */
15794 else
15797 /* Parse any specified attributes. */
15800 /* Look for the `{' to start the namespace. */
15802 /* Start the namespace. */
15805 /* "inline namespace" is equivalent to a stub namespace definition
15806 followed by a strong using directive. */
15808 {
15810 /* Set up namespace association. */
15814 /* Import the contents of the inline namespace. */
15818 }
15822 /* Parse the body of the namespace. */
15828 /* Finish the namespace. */
15830 /* Look for the final `}'. */
15832 }
15834 /* Parse a namespace-body.
15836 namespace-body:
15837 declaration-seq [opt] */
15839 static void
15841 {
15843 }
15845 /* Parse a namespace-alias-definition.
15847 namespace-alias-definition:
15848 namespace identifier = qualified-namespace-specifier ; */
15850 static void
15852 {
15853 tree identifier;
15854 tree namespace_specifier;
15858 /* Look for the `namespace' keyword. */
15860 /* Look for the identifier. */
15864 /* Look for the `=' token. */
15867 {
15869 /* Skip the definition. */
15874 }
15876 /* Look for the qualified-namespace-specifier. */
15877 namespace_specifier
15879 /* Look for the `;' token. */
15882 /* Register the alias in the symbol table. */
15884 }
15886 /* Parse a qualified-namespace-specifier.
15888 qualified-namespace-specifier:
15889 :: [opt] nested-name-specifier [opt] namespace-name
15891 Returns a NAMESPACE_DECL corresponding to the specified
15892 namespace. */
15894 static tree
15896 {
15897 /* Look for the optional `::'. */
15901 /* Look for the optional nested-name-specifier. */
15909 }
15911 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15912 access declaration.
15914 using-declaration:
15915 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15916 using :: unqualified-id ;
15918 access-declaration:
15919 qualified-id ;
15921 */
15923 static bool
15926 {
15930 tree decl;
15931 tree identifier;
15932 tree qscope;
15937 {
15940 }
15941 else
15942 {
15943 /* Look for the `using' keyword. */
15946 /* Peek at the next token. */
15948 /* See if it's `typename'. */
15950 {
15951 /* Remember that we've seen it. */
15953 /* Consume the `typename' token. */
15955 }
15956 }
15958 /* Look for the optional global scope qualification. */
15959 global_scope_p
15964 /* If we saw `typename', or didn't see `::', then there must be a
15965 nested-name-specifier present. */
15967 {
15973 {
15976 }
15977 }
15978 /* Otherwise, we could be in either of the two productions. In that
15979 case, treat the nested-name-specifier as optional. */
15980 else
15990 /* Something has already gone wrong; there's no need to parse
15991 further. Since an error has occurred, the return value of
15992 cp_parser_parse_definitely will be false, as required. */
15996 /* Parse the unqualified-id. */
16004 {
16009 }
16011 /* The function we call to handle a using-declaration is different
16012 depending on what scope we are in. */
16014 ;
16017 /* [namespace.udecl]
16019 A using declaration shall not name a template-id. */
16022 else
16023 {
16025 {
16026 /* Create the USING_DECL. */
16033 {
16036 }
16037 else
16038 /* Add it to the list of members in this class. */
16040 }
16041 else
16042 {
16044 identifier,
16051 {
16054 }
16057 else
16059 }
16060 }
16062 /* Look for the final `;'. */
16067 "access declarations are deprecated "
16068 "in favour of using-declarations; "
16072 }
16074 /* Parse an alias-declaration.
16076 alias-declaration:
16077 using identifier attribute-specifier-seq [opt] = type-id */
16079 static tree
16081 {
16083 location_t id_location;
16085 cp_decl_specifier_seq decl_specs;
16089 /* Look for the `using' keyword. */
16090 cp_token *using_token
16112 /* Now we are going to parse the type-id of the declaration. */
16114 /*
16115 [dcl.type]/3 says:
16117 "A type-specifier-seq shall not define a class or enumeration
16118 unless it appears in the type-id of an alias-declaration (7.1.3) that
16119 is not the declaration of a template-declaration."
16121 In other words, if we currently are in an alias template, the
16122 type-id should not define a type.
16124 So let's set parser->type_definition_forbidden_message in that
16125 case; cp_parser_check_type_definition (called by
16126 cp_parser_class_specifier) will then emit an error if a type is
16127 defined in the type-id. */
16129 {
16133 }
16137 /* Restore the error message if need be. */
16142 {
16145 }
16150 {
16153 }
16155 /* A typedef-name can also be introduced by an alias-declaration. The
16156 identifier following the using keyword becomes a typedef-name. It has
16157 the same semantics as if it were introduced by the typedef
16158 specifier. In particular, it does not define a new type and it shall
16159 not appear in the type-id. */
16164 {
16167 ds_attribute,
16168 attrs_token);
16169 }
16171 ds_typedef,
16172 using_token);
16174 ds_alias,
16175 using_token);
16184 else
16195 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16196 added into the symbol table; otherwise, return the TYPE_DECL. */
16200 {
16204 }
16207 }
16209 /* Parse a using-directive.
16211 using-directive:
16212 using namespace :: [opt] nested-name-specifier [opt]
16213 namespace-name ; */
16215 static void
16217 {
16218 tree namespace_decl;
16219 tree attribs;
16221 /* Look for the `using' keyword. */
16223 /* And the `namespace' keyword. */
16225 /* Look for the optional `::' operator. */
16227 /* And the optional nested-name-specifier. */
16233 /* Get the namespace being used. */
16235 /* And any specified attributes. */
16237 /* Update the symbol table. */
16239 /* Look for the final `;'. */
16241 }
16243 /* Parse an asm-definition.
16245 asm-definition:
16246 asm ( string-literal ) ;
16248 GNU Extension:
16250 asm-definition:
16251 asm volatile [opt] ( string-literal ) ;
16252 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16253 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16254 : asm-operand-list [opt] ) ;
16255 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16256 : asm-operand-list [opt]
16257 : asm-clobber-list [opt] ) ;
16258 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16259 : asm-clobber-list [opt]
16260 : asm-goto-list ) ; */
16262 static void
16264 {
16265 tree string;
16270 tree asm_stmt;
16278 /* Look for the `asm' keyword. */
16280 /* See if the next token is `volatile'. */
16283 {
16284 /* Remember that we saw the `volatile' keyword. */
16286 /* Consume the token. */
16288 }
16292 {
16293 /* Remember that we saw the `goto' keyword. */
16295 /* Consume the token. */
16297 }
16298 /* Look for the opening `('. */
16301 /* Look for the string. */
16304 {
16308 }
16310 /* If we're allowing GNU extensions, check for the extended assembly
16311 syntax. Unfortunately, the `:' tokens need not be separated by
16312 a space in C, and so, for compatibility, we tolerate that here
16313 too. Doing that means that we have to treat the `::' operator as
16314 two `:' tokens. */
16319 {
16324 /* The extended syntax was used. */
16327 /* Look for outputs. */
16329 {
16330 /* Consume the `:'. */
16332 /* Parse the output-operands. */
16334 CPP_COLON)
16336 CPP_SCOPE)
16338 CPP_CLOSE_PAREN)
16344 }
16345 /* If the next token is `::', there are no outputs, and the
16346 next token is the beginning of the inputs. */
16348 /* The inputs are coming next. */
16351 /* Look for inputs. */
16354 {
16355 /* Consume the `:' or `::'. */
16357 /* Parse the output-operands. */
16359 CPP_COLON)
16361 CPP_SCOPE)
16363 CPP_CLOSE_PAREN))
16368 }
16370 /* The clobbers are coming next. */
16373 /* Look for clobbers. */
16376 {
16378 /* Consume the `:' or `::'. */
16380 /* Parse the clobbers. */
16382 CPP_COLON)
16384 CPP_CLOSE_PAREN))
16386 }
16389 /* The labels are coming next. */
16392 /* Look for labels. */
16395 {
16397 /* Consume the `:' or `::'. */
16399 /* Parse the labels. */
16401 }
16405 }
16409 /* Look for the closing `)'. */
16417 {
16418 /* Create the ASM_EXPR. */
16420 {
16423 /* If the extended syntax was not used, mark the ASM_EXPR. */
16425 {
16431 }
16432 }
16433 else
16435 }
16436 }
16438 /* Declarators [gram.dcl.decl] */
16440 /* Parse an init-declarator.
16442 init-declarator:
16443 declarator initializer [opt]
16445 GNU Extension:
16447 init-declarator:
16448 declarator asm-specification [opt] attributes [opt] initializer [opt]
16450 function-definition:
16451 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16452 function-body
16453 decl-specifier-seq [opt] declarator function-try-block
16455 GNU Extension:
16457 function-definition:
16458 __extension__ function-definition
16460 TM Extension:
16462 function-definition:
16463 decl-specifier-seq [opt] declarator function-transaction-block
16465 The DECL_SPECIFIERS apply to this declarator. Returns a
16466 representation of the entity declared. If MEMBER_P is TRUE, then
16467 this declarator appears in a class scope. The new DECL created by
16468 this declarator is returned.
16470 The CHECKS are access checks that should be performed once we know
16471 what entity is being declared (and, therefore, what classes have
16472 befriended it).
16474 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16475 for a function-definition here as well. If the declarator is a
16476 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16477 be TRUE upon return. By that point, the function-definition will
16478 have been completely parsed.
16480 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16481 is FALSE.
16483 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16484 parsed declaration if it is an uninitialized single declarator not followed
16485 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16486 if present, will not be consumed. If returned, this declarator will be
16487 created with SD_INITIALIZED but will not call cp_finish_decl. */
16489 static tree
16498 {
16502 tree prefix_attributes;
16504 tree asm_specification;
16505 tree initializer;
16507 tree scope;
16509 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16510 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16511 "(...)". */
16521 /* Gather the attributes that were provided with the
16522 decl-specifiers. */
16525 /* Assume that this is not the declarator for a function
16526 definition. */
16530 /* Default arguments are only permitted for function parameters. */
16534 /* Defer access checks while parsing the declarator; we cannot know
16535 what names are accessible until we know what is being
16536 declared. */
16539 /* Parse the declarator. */
16541 declarator
16545 member_p);
16546 /* Gather up the deferred checks. */
16551 /* If the DECLARATOR was erroneous, there's no need to go
16552 further. */
16556 /* Check that the number of template-parameter-lists is OK. */
16566 /* Figure out what scope the entity declared by the DECLARATOR is
16567 located in. `grokdeclarator' sometimes changes the scope, so
16568 we compute it now. */
16571 /* Perform any lookups in the declared type which were thought to be
16572 dependent, but are not in the scope of the declarator. */
16573 decl_specifiers->type
16576 /* If we're allowing GNU extensions, look for an
16577 asm-specification. */
16579 {
16580 /* Look for an asm-specification. */
16583 }
16584 else
16587 /* Look for attributes. */
16591 /* Peek at the next token. */
16595 {
16596 /* Check to see if the token indicates the start of a
16597 function-definition. */
16599 {
16601 {
16602 /* If a function-definition should not appear here, issue an
16603 error message. */
16607 }
16609 location_t func_brace_location
16612 /* Neither attributes nor an asm-specification are allowed
16613 on a function-definition. */
16616 "an asm-specification is not allowed "
16620 "attributes are not allowed "
16622 /* This is a function-definition. */
16625 /* Parse the function definition. */
16628 decl_specifiers,
16629 declarator,
16630 prefix_attributes);
16631 else
16632 decl =
16633 (cp_parser_function_definition_from_specifiers_and_declarator
16637 {
16638 /* This is where the prologue starts... */
16641 }
16644 }
16645 }
16647 /* [dcl.dcl]
16649 Only in function declarations for constructors, destructors, and
16650 type conversions can the decl-specifier-seq be omitted.
16652 We explicitly postpone this check past the point where we handle
16653 function-definitions because we tolerate function-definitions
16654 that are missing their return types in some modes. */
16656 {
16660 }
16662 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16666 {
16674 {
16680 }
16681 }
16682 else
16683 {
16684 /* If the init-declarator isn't initialized and isn't followed by a
16685 `,' or `;', it's not a valid init-declarator. */
16688 {
16691 else
16692 {
16695 }
16696 }
16699 }
16701 /* Because start_decl has side-effects, we should only call it if we
16702 know we're going ahead. By this point, we know that we cannot
16703 possibly be looking at any other construct. */
16706 /* If the decl specifiers were bad, issue an error now that we're
16707 sure this was intended to be a declarator. Then continue
16708 declaring the variable(s), as int, to try to cut down on further
16709 errors. */
16712 {
16715 }
16717 /* Check to see whether or not this declaration is a friend. */
16720 /* Enter the newly declared entry in the symbol table. If we're
16721 processing a declaration in a class-specifier, we wait until
16722 after processing the initializer. */
16724 {
16731 /* Adjust location of decl if declarator->id_loc is more appropriate:
16732 set, and decl wasn't merged with another decl, in which case its
16733 location would be different from input_location, and more accurate. */
16738 }
16740 /* Enter the SCOPE. That way unqualified names appearing in the
16741 initializer will be looked up in SCOPE. */
16744 /* Perform deferred access control checks, now that we know in which
16745 SCOPE the declared entity resides. */
16747 {
16750 /* If the entity being declared is a function, pretend that we
16751 are in its scope. If it is a `friend', it may have access to
16752 things that would not otherwise be accessible. */
16754 {
16757 }
16759 /* Perform access checks for template parameters. */
16762 /* Perform the access control checks for the declarator and the
16763 decl-specifiers. */
16766 /* Restore the saved value. */
16769 }
16771 /* Parse the initializer. */
16776 {
16778 {
16782 else
16783 {
16784 /* If the declaration was erroneous, we don't really
16785 know what the user intended, so just silently
16786 consume the initializer. */
16794 }
16795 }
16796 else
16797 {
16798 /* We want to record the extra mangling scope for in-class
16799 initializers of class members and initializers of static data
16800 member templates. The former involves deferring
16801 parsing of the initializer until end of class as with default
16802 arguments. So right here we only handle the latter. */
16812 }
16813 }
16815 /* The old parser allows attributes to appear after a parenthesized
16816 initializer. Mark Mitchell proposed removing this functionality
16817 on the GCC mailing lists on 2002-08-13. This parser accepts the
16818 attributes -- but ignores them. */
16825 /* A non-template declaration involving a function parameter list containing
16826 an implicit template parameter will have been made into a template. If it
16827 turns out that the resulting declaration is not an actual function then
16828 finish the template declaration here. An error message will already have
16829 been issued. */
16834 /* For an in-class declaration, use `grokfield' to create the
16835 declaration. */
16837 {
16839 {
16842 }
16850 }
16852 /* Finish processing the declaration. But, skip member
16853 declarations. */
16855 {
16858 asm_specification,
16859 /* If the initializer is in parentheses, then this is
16860 a direct-initialization, which means that an
16861 `explicit' constructor is OK. Otherwise, an
16862 `explicit' constructor cannot be used. */
16865 }
16868 /* Core issue #226 (C++0x only): A default template-argument
16869 shall not be specified in a friend class template
16870 declaration. */
16879 {
16882 else
16884 }
16887 }
16889 /* Parse a declarator.
16891 declarator:
16892 direct-declarator
16893 ptr-operator declarator
16895 abstract-declarator:
16896 ptr-operator abstract-declarator [opt]
16897 direct-abstract-declarator
16899 GNU Extensions:
16901 declarator:
16902 attributes [opt] direct-declarator
16903 attributes [opt] ptr-operator declarator
16905 abstract-declarator:
16906 attributes [opt] ptr-operator abstract-declarator [opt]
16907 attributes [opt] direct-abstract-declarator
16909 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16910 detect constructor, destructor or conversion operators. It is set
16911 to -1 if the declarator is a name, and +1 if it is a
16912 function. Otherwise it is set to zero. Usually you just want to
16913 test for >0, but internally the negative value is used.
16915 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16916 a decl-specifier-seq unless it declares a constructor, destructor,
16917 or conversion. It might seem that we could check this condition in
16918 semantic analysis, rather than parsing, but that makes it difficult
16919 to handle something like `f()'. We want to notice that there are
16920 no decl-specifiers, and therefore realize that this is an
16921 expression, not a declaration.)
16923 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16924 the declarator is a direct-declarator of the form "(...)".
16926 MEMBER_P is true iff this declarator is a member-declarator. */
16930 cp_parser_declarator_kind dcl_kind,
16934 {
16937 cp_cv_quals cv_quals;
16938 tree class_type;
16941 /* Assume this is not a constructor, destructor, or type-conversion
16942 operator. */
16949 /* Check for the ptr-operator production. */
16951 /* Parse the ptr-operator. */
16957 /* If that worked, then we have a ptr-operator. */
16959 {
16960 /* If a ptr-operator was found, then this declarator was not
16961 parenthesized. */
16964 /* The dependent declarator is optional if we are parsing an
16965 abstract-declarator. */
16969 /* Parse the dependent declarator. */
16975 /* If we are parsing an abstract-declarator, we must handle the
16976 case where the dependent declarator is absent. */
16981 declarator = cp_parser_make_indirect_declarator
16983 }
16984 /* Everything else is a direct-declarator. */
16985 else
16986 {
16989 CPP_OPEN_PAREN);
16991 ctor_dtor_or_conv_p,
16992 member_p);
16993 }
16998 }
17000 /* Parse a direct-declarator or direct-abstract-declarator.
17002 direct-declarator:
17003 declarator-id
17004 direct-declarator ( parameter-declaration-clause )
17005 cv-qualifier-seq [opt]
17006 ref-qualifier [opt]
17007 exception-specification [opt]
17008 direct-declarator [ constant-expression [opt] ]
17009 ( declarator )
17011 direct-abstract-declarator:
17012 direct-abstract-declarator [opt]
17013 ( parameter-declaration-clause )
17014 cv-qualifier-seq [opt]
17015 ref-qualifier [opt]
17016 exception-specification [opt]
17017 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17018 ( abstract-declarator )
17020 Returns a representation of the declarator. DCL_KIND is
17021 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17022 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17023 we are parsing a direct-declarator. It is
17024 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17025 of ambiguity we prefer an abstract declarator, as per
17026 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17027 cp_parser_declarator. */
17031 cp_parser_declarator_kind dcl_kind,
17034 {
17044 {
17045 /* Peek at the next token. */
17048 {
17049 /* This is either a parameter-declaration-clause, or a
17050 parenthesized declarator. When we know we are parsing a
17051 named declarator, it must be a parenthesized declarator
17052 if FIRST is true. For instance, `(int)' is a
17053 parameter-declaration-clause, with an omitted
17054 direct-abstract-declarator. But `((*))', is a
17055 parenthesized abstract declarator. Finally, when T is a
17056 template parameter `(T)' is a
17057 parameter-declaration-clause, and not a parenthesized
17058 named declarator.
17060 We first try and parse a parameter-declaration-clause,
17061 and then try a nested declarator (if FIRST is true).
17063 It is not an error for it not to be a
17064 parameter-declaration-clause, even when FIRST is
17065 false. Consider,
17067 int i (int);
17068 int i (3);
17070 The first is the declaration of a function while the
17071 second is the definition of a variable, including its
17072 initializer.
17074 Having seen only the parenthesis, we cannot know which of
17075 these two alternatives should be selected. Even more
17076 complex are examples like:
17078 int i (int (a));
17079 int i (int (3));
17081 The former is a function-declaration; the latter is a
17082 variable initialization.
17084 Thus again, we try a parameter-declaration-clause, and if
17085 that fails, we back out and return. */
17088 {
17089 tree params;
17092 /* In a member-declarator, the only valid interpretation
17093 of a parenthesis is the start of a
17094 parameter-declaration-clause. (It is invalid to
17095 initialize a static data member with a parenthesized
17096 initializer; only the "=" form of initialization is
17097 permitted.) */
17101 /* Consume the `('. */
17104 {
17105 /* If this is going to be an abstract declarator, we're
17106 in a declarator and we can't have default args. */
17109 }
17113 /* Parse the parameter-declaration-clause. */
17116 /* Consume the `)'. */
17119 /* If all went well, parse the cv-qualifier-seq,
17120 ref-qualifier and the exception-specification. */
17122 {
17123 cp_cv_quals cv_quals;
17124 cp_virt_specifiers virt_specifiers;
17125 cp_ref_qualifier ref_qual;
17126 tree exception_specification;
17127 tree late_return;
17128 tree attrs;
17138 /* Parse the cv-qualifier-seq. */
17140 /* Parse the ref-qualifier. */
17142 /* And the exception-specification. */
17143 exception_specification
17148 /* In here, we handle cases where attribute is used after
17149 the function declaration. For example:
17150 void func (int x) __attribute__((vector(..))); */
17153 {
17157 CPP_SEMICOLON)
17159 CPP_OPEN_BRACE))
17162 ;
17163 else
17165 }
17166 late_return = (cp_parser_late_return_type_opt
17171 /* Parse the virt-specifier-seq. */
17174 /* Create the function-declarator. */
17176 params,
17177 cv_quals,
17178 virt_specifiers,
17179 ref_qual,
17180 exception_specification,
17181 late_return);
17183 /* Any subsequent parameter lists are to do with
17184 return type, so are not those of the declared
17185 function. */
17187 }
17189 /* Remove the function parms from scope. */
17193 /* Repeat the main loop. */
17195 }
17197 /* If this is the first, we can try a parenthesized
17198 declarator. */
17200 {
17206 /* Consume the `('. */
17208 /* Parse the nested declarator. */
17211 declarator
17214 member_p);
17217 /* Expect a `)'. */
17224 }
17225 /* Otherwise, we must be done. */
17226 else
17228 }
17232 {
17233 /* Parse an array-declarator. */
17242 /* Consume the `['. */
17244 /* Peek at the next token. */
17246 /* If the next token is `]', then there is no
17247 constant-expression. */
17249 {
17251 bounds
17261 {
17262 /* Normally, the array bound must be an integral constant
17263 expression. However, as an extension, we allow VLAs
17264 in function scopes as long as they aren't part of a
17265 parameter declaration. */
17269 }
17272 {
17273 /* Remember this wasn't a constant-expression. */
17276 }
17277 }
17278 else
17280 /* Look for the closing `]'. */
17282 {
17285 }
17290 }
17292 {
17293 {
17294 tree qualifying_scope;
17295 tree unqualified_name;
17296 tree attrs;
17297 special_function_kind sfk;
17302 /* Parse a declarator-id */
17305 {
17308 /* If we see an ellipsis, we should be looking at a
17309 parameter pack. */
17311 {
17312 /* Consume the `...' */
17316 }
17317 }
17320 unqualified_name
17324 {
17328 {
17329 /* Check whether an error occurred. */
17332 /* We already consumed the ellipsis to mark a
17333 parameter pack, but we have no way to report it,
17334 so abort the tentative parse. We will be exiting
17335 immediately anyway. */
17337 }
17338 else
17344 && (qualifying_scope
17346 {
17349 }
17350 }
17355 {
17360 }
17366 {
17367 /* In the declaration of a member of a template class
17368 outside of the class itself, the SCOPE will sometimes
17369 be a TYPENAME_TYPE. For example, given:
17371 template <typename T>
17372 int S<T>::R::i = 3;
17374 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17375 this context, we must resolve S<T>::R to an ordinary
17376 type, rather than a typename type.
17378 The reason we normally avoid resolving TYPENAME_TYPEs
17379 is that a specialization of `S' might render
17380 `S<T>::R' not a type. However, if `S' is
17381 specialized, then this `i' will not be used, so there
17382 is no harm in resolving the types here. */
17383 tree type;
17385 /* Resolve the TYPENAME_TYPE. */
17388 /* If that failed, the declarator is invalid. */
17390 {
17393 "cannot define member of dependent typedef "
17395 else
17400 }
17402 }
17407 {
17408 tree class_type;
17413 else
17417 {
17420 {
17423 {
17427 "use %<%T::%D%> instead of %<%T::%D%> to "
17429 class_type,
17434 }
17435 else
17437 }
17438 else
17439 {
17440 /* We do not attempt to print the declarator
17441 here because we do not have enough
17442 information about its original syntactic
17443 form. */
17447 }
17448 }
17451 {
17457 for an anonymous type, even if the type
17458 got a name for linkage purposes. */
17461 class_type))
17462 {
17465 }
17473 }
17474 }
17476 unqualified_name,
17477 sfk);
17484 }
17486 handle_declarator:;
17489 {
17490 /* Any names that appear after the declarator-id for a
17491 member are looked up in the containing scope. */
17493 {
17494 /* But declarations with qualified-ids can't appear in a
17495 function. */
17499 }
17501 }
17505 /* Default args are only allowed on function
17506 declarations. */
17508 else
17512 }
17513 /* We're done. */
17514 else
17516 }
17518 /* For an abstract declarator, we might wind up with nothing at this
17519 point. That's an error; the declarator is not optional. */
17523 /* If we entered a scope, we must exit it now. */
17531 }
17533 /* Parse a ptr-operator.
17535 ptr-operator:
17536 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17537 * cv-qualifier-seq [opt]
17538 &
17539 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17540 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17542 GNU Extension:
17544 ptr-operator:
17545 & cv-qualifier-seq [opt]
17547 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17548 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17549 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17550 filled in with the TYPE containing the member. *CV_QUALS is
17551 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17552 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17553 Note that the tree codes returned by this function have nothing
17554 to do with the types of trees that will be eventually be created
17555 to represent the pointer or reference type being parsed. They are
17556 just constants with suggestive names. */
17557 static enum tree_code
17562 {
17567 /* Assume that it's not a pointer-to-member. */
17569 /* And that there are no cv-qualifiers. */
17572 /* Peek at the next token. */
17575 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17585 {
17586 /* Consume the `*', `&' or `&&'. */
17589 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17590 `&', if we are allowing GNU extensions. (The only qualifier
17591 that can legally appear after `&' is `restrict', but that is
17592 enforced during semantic analysis. */
17600 }
17601 else
17602 {
17603 /* Try the pointer-to-member case. */
17605 /* Look for the optional `::' operator. */
17608 /* Look for the nested-name specifier. */
17615 /* If we found it, and the next token is a `*', then we are
17616 indeed looking at a pointer-to-member operator. */
17619 {
17620 /* Indicate that the `*' operator was used. */
17628 else
17629 {
17630 /* The type of which the member is a member is given by the
17631 current SCOPE. */
17633 /* The next name will not be qualified. */
17637 /* Look for optional c++11 attributes. */
17641 /* Look for the optional cv-qualifier-seq. */
17643 }
17644 }
17645 /* If that didn't work we don't have a ptr-operator. */
17648 }
17651 }
17653 /* Parse an (optional) cv-qualifier-seq.
17655 cv-qualifier-seq:
17656 cv-qualifier cv-qualifier-seq [opt]
17658 cv-qualifier:
17659 const
17660 volatile
17662 GNU Extension:
17664 cv-qualifier:
17665 __restrict__
17667 Returns a bitmask representing the cv-qualifiers. */
17669 static cp_cv_quals
17671 {
17675 {
17677 cp_cv_quals cv_qualifier;
17679 /* Peek at the next token. */
17681 /* See if it's a cv-qualifier. */
17683 {
17699 }
17705 {
17708 }
17709 else
17710 {
17713 }
17714 }
17717 }
17719 /* Parse an (optional) ref-qualifier
17721 ref-qualifier:
17722 &
17723 &&
17725 Returns cp_ref_qualifier representing ref-qualifier. */
17727 static cp_ref_qualifier
17729 {
17732 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17737 {
17742 {
17754 }
17759 {
17762 }
17763 else
17764 {
17767 }
17768 }
17771 }
17773 /* Parse an (optional) virt-specifier-seq.
17775 virt-specifier-seq:
17776 virt-specifier virt-specifier-seq [opt]
17778 virt-specifier:
17779 override
17780 final
17782 Returns a bitmask representing the virt-specifiers. */
17784 static cp_virt_specifiers
17786 {
17790 {
17792 cp_virt_specifiers virt_specifier;
17794 /* Peek at the next token. */
17796 /* See if it's a virt-specifier-qualifier. */
17800 {
17803 }
17805 {
17808 }
17810 {
17812 }
17813 else
17817 {
17820 }
17821 else
17822 {
17825 }
17826 }
17828 }
17830 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17831 is in scope even though it isn't real. */
17833 static void
17835 {
17836 tree this_parm;
17839 {
17840 /* We don't clear this between NSDMIs. Is it already what we want? */
17845 }
17848 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17850 current_class_ref
17853 }
17855 /* Return true iff our current scope is a non-static data member
17856 initializer. */
17858 bool
17860 {
17861 /* We recognize NSDMI context by the context-less 'this' pointer set up
17862 by the function above. */
17866 }
17868 /* Parse a late-specified return type, if any. This is not a separate
17869 non-terminal, but part of a function declarator, which looks like
17871 -> trailing-type-specifier-seq abstract-declarator(opt)
17873 Returns the type indicated by the type-id.
17875 In addition to this this parses any queued up omp declare simd
17876 clauses and Cilk Plus SIMD-enabled function's vector attributes.
17878 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17879 function. */
17881 static tree
17883 cp_cv_quals quals)
17884 {
17888 && declarator
17894 /* Peek at the next token. */
17896 /* A late-specified return type is indicated by an initial '->'. */
17903 {
17904 /* DR 1207: 'this' is in scope in the trailing return type. */
17906 }
17909 {
17910 /* Consume the ->. */
17914 }
17917 declarator->std_attributes
17921 declarator->std_attributes
17926 {
17929 }
17932 }
17934 /* Parse a declarator-id.
17936 declarator-id:
17937 id-expression
17938 :: [opt] nested-name-specifier [opt] type-name
17940 In the `id-expression' case, the value returned is as for
17941 cp_parser_id_expression if the id-expression was an unqualified-id.
17942 If the id-expression was a qualified-id, then a SCOPE_REF is
17943 returned. The first operand is the scope (either a NAMESPACE_DECL
17944 or TREE_TYPE), but the second is still just a representation of an
17945 unqualified-id. */
17947 static tree
17949 {
17950 tree id;
17951 /* The expression must be an id-expression. Assume that qualified
17952 names are the names of types so that:
17954 template <class T>
17955 int S<T>::R::i = 3;
17957 will work; we must treat `S<T>::R' as the name of a type.
17958 Similarly, assume that qualified names are templates, where
17959 required, so that:
17961 template <class T>
17962 int S<T>::R<T>::i = 3;
17964 will work, too. */
17970 optional_p);
17974 }
17976 /* Parse a type-id.
17978 type-id:
17979 type-specifier-seq abstract-declarator [opt]
17981 Returns the TYPE specified. */
17983 static tree
17986 {
17987 cp_decl_specifier_seq type_specifier_seq;
17990 /* Parse the type-specifier-seq. */
17992 is_trailing_return,
17997 /* There might or might not be an abstract declarator. */
17999 /* Look for the declarator. */
18000 abstract_declarator
18004 /* Check to see if there really was a declarator. */
18009 /* None of the valid uses of 'auto' in C++14 involve the type-id
18010 nonterminal, but it is valid in a trailing-return-type. */
18013 {
18014 /* A type-id with type 'auto' is only ok if the abstract declarator
18015 is a function declarator with a late-specified return type. */
18020 else
18021 {
18024 }
18025 }
18028 is_template_arg);
18029 }
18032 {
18034 }
18037 {
18038 tree r;
18040 parser->type_definition_forbidden_message
18045 {
18048 }
18050 }
18053 {
18055 }
18057 /* Parse a type-specifier-seq.
18059 type-specifier-seq:
18060 type-specifier type-specifier-seq [opt]
18062 GNU extension:
18064 type-specifier-seq:
18065 attributes type-specifier-seq [opt]
18067 If IS_DECLARATION is true, we are at the start of a "condition" or
18068 exception-declaration, so we might be followed by a declarator-id.
18070 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18071 i.e. we've just seen "->".
18073 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18075 static void
18080 {
18085 /* Clear the TYPE_SPECIFIER_SEQ. */
18088 /* In the context of a trailing return type, enum E { } is an
18089 elaborated-type-specifier followed by a function-body, not an
18090 enum-specifier. */
18094 /* Parse the type-specifiers and attributes. */
18096 {
18097 tree type_specifier;
18100 /* Check for attributes first. */
18102 {
18107 }
18109 /* record the token of the beginning of the type specifier seq,
18110 for error reporting purposes*/
18114 /* Look for the type-specifier. */
18116 flags,
18117 type_specifier_seq,
18119 NULL,
18122 {
18123 /* If the first type-specifier could not be found, this is not a
18124 type-specifier-seq at all. */
18126 {
18127 /* Set in_declarator_p to avoid skipping to the semicolon. */
18139 }
18140 /* If subsequent type-specifiers could not be found, the
18141 type-specifier-seq is complete. */
18143 }
18146 /* The standard says that a condition can be:
18148 type-specifier-seq declarator = assignment-expression
18150 However, given:
18152 struct S {};
18153 if (int S = ...)
18155 we should treat the "S" as a declarator, not as a
18156 type-specifier. The standard doesn't say that explicitly for
18157 type-specifier-seq, but it does say that for
18158 decl-specifier-seq in an ordinary declaration. Perhaps it
18159 would be clearer just to allow a decl-specifier-seq here, and
18160 then add a semantic restriction that if any decl-specifiers
18161 that are not type-specifiers appear, the program is invalid. */
18164 }
18165 }
18167 /* Return whether the function currently being declared has an associated
18168 template parameter list. */
18170 static bool
18172 {
18185 }
18187 /* Parse a parameter-declaration-clause.
18189 parameter-declaration-clause:
18190 parameter-declaration-list [opt] ... [opt]
18191 parameter-declaration-list , ...
18193 Returns a representation for the parameter declarations. A return
18194 value of NULL indicates a parameter-declaration-clause consisting
18195 only of an ellipsis. */
18197 static tree
18199 {
18200 tree parameters;
18209 parser->auto_is_implicit_function_template_parm_p
18211 }
18217 && !processing_template_parmlist
18223 /* Peek at the next token. */
18225 /* Check for trivial parameter-declaration-clauses. */
18227 {
18228 /* Consume the `...' token. */
18231 }
18233 /* There are no parameters. */
18234 {
18235 #ifndef NO_IMPLICIT_EXTERN_C
18240 else
18241 #endif
18243 }
18244 /* Check for `(void)', too, which is a special case. */
18248 {
18249 /* Consume the `void' token. */
18251 /* There are no parameters. */
18253 }
18255 /* Parse the parameter-declaration-list. */
18257 /* If a parse error occurred while parsing the
18258 parameter-declaration-list, then the entire
18259 parameter-declaration-clause is erroneous. */
18263 /* Peek at the next token. */
18265 /* If it's a `,', the clause should terminate with an ellipsis. */
18267 {
18268 /* Consume the `,'. */
18270 /* Expect an ellipsis. */
18271 ellipsis_p
18273 }
18274 /* It might also be `...' if the optional trailing `,' was
18275 omitted. */
18277 {
18278 /* Consume the `...' token. */
18280 /* And remember that we saw it. */
18282 }
18283 else
18286 /* Finish the parameter list. */
18291 }
18293 /* Parse a parameter-declaration-list.
18295 parameter-declaration-list:
18296 parameter-declaration
18297 parameter-declaration-list , parameter-declaration
18299 Returns a representation of the parameter-declaration-list, as for
18300 cp_parser_parameter_declaration_clause. However, the
18301 `void_list_node' is never appended to the list. Upon return,
18302 *IS_ERROR will be true iff an error occurred. */
18304 static tree
18306 {
18312 /* Assume all will go well. */
18314 /* The special considerations that apply to a function within an
18315 unbraced linkage specifications do not apply to the parameters
18316 to the function. */
18317 saved_in_unbraced_linkage_specification_p
18321 /* Look for more parameters. */
18323 {
18331 /* Parse the parameter. */
18332 parameter
18337 /* We don't know yet if the enclosing context is deprecated, so wait
18338 and warn in grokparms if appropriate. */
18342 {
18343 /* If a function parameter pack was specified and an implicit template
18344 parameter was introduced during cp_parser_parameter_declaration,
18345 change any implicit parameters introduced into packs. */
18349 {
18357 }
18361 PARM,
18364 }
18368 /* If a parse error occurred parsing the parameter declaration,
18369 then the entire parameter-declaration-list is erroneous. */
18371 {
18375 }
18385 {
18389 }
18391 /* Add the new parameter to the list. */
18395 /* Peek at the next token. */
18398 /* These are for Objective-C++ */
18401 /* The parameter-declaration-list is complete. */
18404 {
18407 /* Peek at the next token. */
18409 /* If it's an ellipsis, then the list is complete. */
18412 /* Otherwise, there must be more parameters. Consume the
18413 `,'. */
18415 /* When parsing something like:
18417 int i(float f, double d)
18419 we can tell after seeing the declaration for "f" that we
18420 are not looking at an initialization of a variable "i",
18421 but rather at the declaration of a function "i".
18423 Due to the fact that the parsing of template arguments
18424 (as specified to a template-id) requires backtracking we
18425 cannot use this technique when inside a template argument
18426 list. */
18430 /* However, a parameter-declaration of the form
18431 "float(f)" (which is a valid declaration of a
18432 parameter "f") can also be interpreted as an
18433 expression (the conversion of "f" to "float"). */
18436 }
18437 else
18438 {
18446 }
18447 }
18449 parser->in_unbraced_linkage_specification_p
18452 /* Reset implicit_template_scope if we are about to leave the function
18453 parameter list that introduced it. Note that for out-of-line member
18454 definitions, there will be one or more class scopes before we get to
18455 the template parameter scope. */
18459 {
18463 {
18466 }
18467 }
18470 }
18472 /* Parse a parameter declaration.
18474 parameter-declaration:
18475 decl-specifier-seq ... [opt] declarator
18476 decl-specifier-seq declarator = assignment-expression
18477 decl-specifier-seq ... [opt] abstract-declarator [opt]
18478 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18480 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18481 declares a template parameter. (In that case, a non-nested `>'
18482 token encountered during the parsing of the assignment-expression
18483 is not interpreted as a greater-than operator.)
18485 Returns a representation of the parameter, or NULL if an error
18486 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18487 true iff the declarator is of the form "(p)". */
18493 {
18495 cp_decl_specifier_seq decl_specifiers;
18497 tree default_argument;
18501 /* In a template parameter, `>' is not an operator.
18503 [temp.param]
18505 When parsing a default template-argument for a non-type
18506 template-parameter, the first non-nested `>' is taken as the end
18507 of the template parameter-list rather than a greater-than
18508 operator. */
18510 /* Type definitions may not appear in parameter types. */
18512 parser->type_definition_forbidden_message
18515 /* Parse the declaration-specifiers. */
18517 CP_PARSER_FLAGS_NONE,
18521 /* Complain about missing 'typename' or other invalid type names. */
18526 /* If an error occurred, there's no reason to attempt to parse the
18527 rest of the declaration. */
18529 {
18532 }
18534 /* Peek at the next token. */
18537 /* If the next token is a `)', `,', `=', `>', or `...', then there
18538 is no declarator. However, when variadic templates are enabled,
18539 there may be a declarator following `...'. */
18544 {
18548 }
18549 /* Otherwise, there should be a declarator. */
18550 else
18551 {
18555 /* After seeing a decl-specifier-seq, if the next token is not a
18556 "(", there is no possibility that the code is a valid
18557 expression. Therefore, if parsing tentatively, we commit at
18558 this point. */
18560 /* In an expression context, having seen:
18562 (int((char ...
18564 we cannot be sure whether we are looking at a
18565 function-type (taking a "char" as a parameter) or a cast
18566 of some object of type "char" to "int". */
18572 /* Parse the declarator. */
18575 CP_PARSER_DECLARATOR_EITHER,
18577 parenthesized_p,
18580 /* After the declarator, allow more attributes. */
18581 decl_specifiers.attributes
18584 }
18586 /* If the next token is an ellipsis, and we have not seen a
18587 declarator name, and the type of the declarator contains parameter
18588 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18589 a parameter pack expansion expression. Otherwise, leave the
18590 ellipsis for a C-style variadic function. */
18593 {
18604 {
18605 /* Consume the `...'. */
18609 /* Build a pack expansion type */
18612 else
18614 }
18615 }
18617 /* The restriction on defining new types applies only to the type
18618 of the parameter, not to the default argument. */
18621 /* If the next token is `=', then process a default argument. */
18623 {
18625 /* If we are defining a class, then the tokens that make up the
18626 default argument must be saved and processed later. */
18631 /* Outside of a class definition, we can just parse the
18632 assignment-expression. */
18633 else
18634 default_argument
18638 {
18641 else
18642 {
18644 "default arguments are only "
18647 }
18648 }
18652 {
18653 /* Find the name of the parameter pack. */
18660 template_parm_p
18666 else
18668 template_parm_p
18675 }
18676 }
18677 else
18681 declarator,
18682 default_argument);
18683 }
18685 /* Parse a default argument and return it.
18687 TEMPLATE_PARM_P is true if this is a default argument for a
18688 non-type template parameter. */
18689 static tree
18691 {
18697 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18698 set correctly. */
18701 /* Local variable names (and the `this' keyword) may not
18702 appear in a default argument. */
18705 /* Parse the assignment-expression. */
18710 /* The "this" pointer is not valid in a default argument. */
18712 {
18717 }
18718 default_argument
18720 /* Restore the "this" pointer. */
18722 {
18725 }
18734 }
18736 /* Parse a function-body.
18738 function-body:
18739 compound_statement */
18741 static void
18743 {
18745 }
18747 /* Parse a ctor-initializer-opt followed by a function-body. Return
18748 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18749 is true we are parsing a function-try-block. */
18751 static bool
18754 {
18762 /* Begin the function body. */
18764 /* Parse the optional ctor-initializer. */
18767 /* If we're parsing a constexpr constructor definition, we need
18768 to check that the constructor body is indeed empty. However,
18769 before we get to cp_parser_function_body lot of junk has been
18770 generated, so we can't just check that we have an empty block.
18771 Rather we take a snapshot of the outermost block, and check whether
18772 cp_parser_function_body changed its state. */
18774 {
18778 }
18779 /* Parse the function-body. */
18783 /* Finish the function body. */
18787 }
18789 /* Parse an initializer.
18791 initializer:
18792 = initializer-clause
18793 ( expression-list )
18795 Returns an expression representing the initializer. If no
18796 initializer is present, NULL_TREE is returned.
18798 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18799 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18800 set to TRUE if there is no initializer present. If there is an
18801 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18802 is set to true; otherwise it is set to false. */
18804 static tree
18807 {
18809 tree init;
18811 /* Peek at the next token. */
18814 /* Let our caller know whether or not this initializer was
18815 parenthesized. */
18817 /* Assume that the initializer is constant. */
18821 {
18822 /* Consume the `='. */
18824 /* Parse the initializer-clause. */
18826 }
18828 {
18833 non_constant_p);
18838 }
18840 {
18845 }
18846 else
18847 {
18848 /* Anything else is an error. */
18851 }
18854 }
18856 /* Parse an initializer-clause.
18858 initializer-clause:
18859 assignment-expression
18860 braced-init-list
18862 Returns an expression representing the initializer.
18864 If the `assignment-expression' production is used the value
18865 returned is simply a representation for the expression.
18867 Otherwise, calls cp_parser_braced_list. */
18869 static tree
18871 {
18872 tree initializer;
18874 /* Assume the expression is constant. */
18877 /* If it is not a `{', then we are looking at an
18878 assignment-expression. */
18880 {
18881 initializer
18884 non_constant_p);
18885 }
18886 else
18890 }
18892 /* Parse a brace-enclosed initializer list.
18894 braced-init-list:
18895 { initializer-list , [opt] }
18896 { }
18898 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18899 the elements of the initializer-list (or NULL, if the last
18900 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18901 NULL_TREE. There is no way to detect whether or not the optional
18902 trailing `,' was provided. NON_CONSTANT_P is as for
18903 cp_parser_initializer. */
18905 static tree
18907 {
18908 tree initializer;
18910 /* Consume the `{' token. */
18912 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18914 /* If it's not a `}', then there is a non-trivial initializer. */
18916 {
18917 /* Parse the initializer list. */
18920 /* A trailing `,' token is allowed. */
18923 }
18924 else
18926 /* Now, there should be a trailing `}'. */
18930 }
18932 /* Parse an initializer-list.
18934 initializer-list:
18935 initializer-clause ... [opt]
18936 initializer-list , initializer-clause ... [opt]
18938 GNU Extension:
18940 initializer-list:
18941 designation initializer-clause ...[opt]
18942 initializer-list , designation initializer-clause ...[opt]
18944 designation:
18945 . identifier =
18946 identifier :
18947 [ constant-expression ] =
18949 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18950 for the initializer. If the INDEX of the elt is non-NULL, it is the
18951 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18952 as for cp_parser_initializer. */
18956 {
18959 /* Assume all of the expressions are constant. */
18962 /* Parse the rest of the list. */
18964 {
18966 tree designator;
18967 tree initializer;
18970 /* If the next token is an identifier and the following one is a
18971 colon, we are looking at the GNU designated-initializer
18972 syntax. */
18976 {
18977 /* Warn the user that they are using an extension. */
18980 /* Consume the identifier. */
18982 /* Consume the `:'. */
18984 }
18985 /* Also handle the C99 syntax, '. id ='. */
18990 {
18991 /* Warn the user that they are using an extension. */
18994 /* Consume the `.'. */
18996 /* Consume the identifier. */
18998 /* Consume the `='. */
19000 }
19001 /* Also handle C99 array designators, '[ const ] ='. */
19005 {
19006 /* In C++11, [ could start a lambda-introducer. */
19018 }
19019 else
19022 /* Parse the initializer. */
19025 /* If any clause is non-constant, so is the entire initializer. */
19029 /* If we have an ellipsis, this is an initializer pack
19030 expansion. */
19032 {
19033 /* Consume the `...'. */
19036 /* Turn the initializer into an initializer expansion. */
19038 }
19040 /* Add it to the vector. */
19043 /* If the next token is not a comma, we have reached the end of
19044 the list. */
19048 /* Peek at the next token. */
19050 /* If the next token is a `}', then we're still done. An
19051 initializer-clause can have a trailing `,' after the
19052 initializer-list and before the closing `}'. */
19056 /* Consume the `,' token. */
19058 }
19061 }
19063 /* Classes [gram.class] */
19065 /* Parse a class-name.
19067 class-name:
19068 identifier
19069 template-id
19071 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19072 to indicate that names looked up in dependent types should be
19073 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19074 keyword has been used to indicate that the name that appears next
19075 is a template. TAG_TYPE indicates the explicit tag given before
19076 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19077 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19078 is the class being defined in a class-head.
19080 Returns the TYPE_DECL representing the class. */
19082 static tree
19090 {
19091 tree decl;
19092 tree scope;
19097 /* All class-names start with an identifier. */
19100 {
19103 }
19105 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19106 to a template-id, so we save it here. */
19111 /* Any name names a type if we're following the `typename' keyword
19112 in a qualified name where the enclosing scope is type-dependent. */
19115 /* Handle the common case (an identifier, but not a template-id)
19116 efficiently. */
19119 {
19123 /* Look for the identifier. */
19127 /* If the next token isn't an identifier, we are certainly not
19128 looking at a class-name. */
19131 /* If we know this is a type-name, there's no need to look it
19132 up. */
19135 else
19136 {
19137 tree ambiguous_decls;
19138 /* If we already know that this lookup is ambiguous, then
19139 we've already issued an error message; there's no reason
19140 to check again. */
19142 {
19145 }
19146 /* If the next token is a `::', then the name must be a type
19147 name.
19149 [basic.lookup.qual]
19151 During the lookup for a name preceding the :: scope
19152 resolution operator, object, function, and enumerator
19153 names are ignored. */
19156 /* Look up the name. */
19158 tag_type,
19161 check_dependency_p,
19165 {
19169 }
19170 }
19171 }
19172 else
19173 {
19174 /* Try a template-id. */
19176 check_dependency_p,
19177 tag_type,
19178 is_declaration);
19181 }
19185 /* If this is a typename, create a TYPENAME_TYPE. */
19187 {
19192 }
19196 /* Check to see that it is really the name of a class. */
19200 /* Situations like this:
19202 template <typename T> struct A {
19203 typename T::template X<int>::I i;
19204 };
19206 are problematic. Is `T::template X<int>' a class-name? The
19207 standard does not seem to be definitive, but there is no other
19208 valid interpretation of the following `::'. Therefore, those
19209 names are considered class-names. */
19210 {
19214 }
19218 /* In Objective-C 2.0, a classname followed by '.' starts a
19219 dot-syntax expression, and it's not a type-name. */
19231 }
19233 /* Parse a class-specifier.
19235 class-specifier:
19236 class-head { member-specification [opt] }
19238 Returns the TREE_TYPE representing the class. */
19240 static tree
19242 {
19243 tree type;
19257 /* Parse the class-head. */
19260 /* If the class-head was a semantic disaster, skip the entire body
19261 of the class. */
19263 {
19267 }
19269 /* Look for the `{'. */
19271 {
19274 }
19278 /* Issue an error message if type-definitions are forbidden here. */
19280 /* Remember that we are defining one more class. */
19282 /* Inside the class, surrounding template-parameter-lists do not
19283 apply. */
19284 saved_num_template_parameter_lists
19287 /* We are not in a function body. */
19290 /* Or in a loop. */
19293 /* Or in a switch. */
19296 /* We are not immediately inside an extern "lang" block. */
19297 saved_in_unbraced_linkage_specification_p
19301 /* Start the class. */
19303 {
19306 }
19310 /* If the type is erroneous, skip the entire body of the class. */
19312 else
19313 /* Parse the member-specification. */
19316 /* Look for the trailing `}'. */
19318 /* Look for trailing attributes to apply to this class. */
19326 /* We've finished a type definition. Check for the common syntax
19327 error of forgetting a semicolon after the definition. We need to
19328 be careful, as we can't just check for not-a-semicolon and be done
19329 with it; the user might have typed:
19331 class X { } c = ...;
19332 class X { } *p = ...;
19334 and so forth. Instead, enumerate all the possible tokens that
19335 might follow this production; if we don't see one of them, then
19336 complain and silently insert the semicolon. */
19337 {
19342 /* Don't try to parse c++11 attributes here. As per the
19343 grammar, that should be a task for
19344 cp_parser_decl_specifier_seq. */
19348 {
19359 /* While it's legal for type qualifiers and storage class
19360 specifiers to follow type definitions in the grammar, only
19361 compiler testsuites contain code like that. Assume that if
19362 we see such code, then what we're really seeing is a case
19363 like:
19365 class X { }
19366 const <type> var = ...;
19368 or
19370 class Y { }
19371 static <type> func (...) ...
19373 i.e. the qualifier or specifier applies to the next
19374 declaration. To do so, however, we need to look ahead one
19375 more token to see if *that* token is a type specifier.
19377 This code could be improved to handle:
19379 class Z { }
19380 static const <type> var = ...; */
19383 {
19386 /* Handling user-defined types here would be nice, but very
19387 tricky. */
19388 want_semicolon
19391 }
19395 }
19397 /* If we don't have a type, then something is very wrong and we
19398 shouldn't try to do anything clever. Likewise for not seeing the
19399 closing brace. */
19401 {
19402 cp_token_position prev
19413 else
19416 /* Unget one token and smash it to look as though we encountered
19417 a semicolon in the input stream. */
19422 }
19423 }
19425 /* If this class is not itself within the scope of another class,
19426 then we need to parse the bodies of all of the queued function
19427 definitions. Note that the queued functions defined in a class
19428 are not always processed immediately following the
19429 class-specifier for that class. Consider:
19431 struct A {
19432 struct B { void f() { sizeof (A); } };
19433 };
19435 If `f' were processed before the processing of `A' were
19436 completed, there would be no way to compute the size of `A'.
19437 Note that the nesting we are interested in here is lexical --
19438 not the semantic nesting given by TYPE_CONTEXT. In particular,
19439 for:
19441 struct A { struct B; };
19442 struct A::B { void f() { } };
19444 there is no need to delay the parsing of `A::B::f'. */
19446 {
19447 tree decl;
19454 /* In a first pass, parse default arguments to the functions.
19455 Then, in a second pass, parse the bodies of the functions.
19456 This two-phased approach handles cases like:
19458 struct S {
19459 void f() { g(); }
19460 void g(int i = 3);
19461 };
19463 */
19465 {
19467 /* If there are default arguments that have not yet been processed,
19468 take care of them now. */
19470 {
19475 }
19476 /* Make sure that any template parameters are in scope. */
19478 /* Parse the default argument expressions. */
19480 /* Remove any template parameters from the symbol table. */
19482 }
19484 /* Now parse any NSDMIs. */
19488 {
19490 {
19495 }
19498 }
19504 /* Now parse the body of the functions. */
19506 {
19507 /* OpenMP UDRs need to be parsed before all other functions. */
19514 }
19515 else
19519 }
19521 /* Put back any saved access checks. */
19524 /* Restore saved state. */
19528 parser->num_template_parameter_lists
19530 parser->in_unbraced_linkage_specification_p
19534 }
19536 static tree
19538 {
19539 tree ret;
19544 }
19546 /* Parse a class-head.
19548 class-head:
19549 class-key identifier [opt] base-clause [opt]
19550 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19551 class-key nested-name-specifier [opt] template-id
19552 base-clause [opt]
19554 class-virt-specifier:
19555 final
19557 GNU Extensions:
19558 class-key attributes identifier [opt] base-clause [opt]
19559 class-key attributes nested-name-specifier identifier base-clause [opt]
19560 class-key attributes nested-name-specifier [opt] template-id
19561 base-clause [opt]
19563 Upon return BASES is initialized to the list of base classes (or
19564 NULL, if there are none) in the same form returned by
19565 cp_parser_base_clause.
19567 Returns the TYPE of the indicated class. Sets
19568 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19569 involving a nested-name-specifier was used, and FALSE otherwise.
19571 Returns error_mark_node if this is not a class-head.
19573 Returns NULL_TREE if the class-head is syntactically valid, but
19574 semantically invalid in a way that means we should skip the entire
19575 body of the class. */
19577 static tree
19580 {
19581 tree nested_name_specifier;
19585 tree attributes;
19586 tree bases;
19596 /* Assume no nested-name-specifier will be present. */
19598 /* Assume no template parameter lists will be used in defining the
19599 type. */
19603 /* Look for the class-key. */
19608 /* Parse the attributes. */
19611 /* If the next token is `::', that is invalid -- but sometimes
19612 people do try to write:
19614 struct ::S {};
19616 Handle this gracefully by accepting the extra qualifier, and then
19617 issuing an error about it later if this really is a
19618 class-head. If it turns out just to be an elaborated type
19619 specifier, remain silent. */
19625 /* Determine the name of the class. Begin by looking for an
19626 optional nested-name-specifier. */
19628 nested_name_specifier
19634 /* If there was a nested-name-specifier, then there *must* be an
19635 identifier. */
19637 {
19639 /* Although the grammar says `identifier', it really means
19640 `class-name' or `template-name'. You are only allowed to
19641 define a class that has already been declared with this
19642 syntax.
19644 The proposed resolution for Core Issue 180 says that wherever
19645 you see `class T::X' you should treat `X' as a type-name.
19647 It is OK to define an inaccessible class; for example:
19649 class A { class B; };
19650 class A::B {};
19652 We do not know if we will see a class-name, or a
19653 template-name. We look for a class-name first, in case the
19654 class-name is a template-id; if we looked for the
19655 template-name first we would stop after the template-name. */
19660 class_type,
19664 /* If that didn't work, ignore the nested-name-specifier. */
19666 {
19672 }
19673 /* If we could not find a corresponding TYPE, treat this
19674 declaration like an unqualified declaration. */
19677 /* Otherwise, count the number of templates used in TYPE and its
19678 containing scopes. */
19679 else
19680 {
19681 tree scope;
19693 }
19694 }
19695 /* Otherwise, the identifier is optional. */
19696 else
19697 {
19698 /* We don't know whether what comes next is a template-id,
19699 an identifier, or nothing at all. */
19701 /* Check for a template-id. */
19706 class_key,
19708 /* If that didn't work, it could still be an identifier. */
19710 {
19712 {
19715 }
19716 else
19718 }
19719 else
19720 {
19723 }
19724 }
19729 {
19731 class_key,
19733 }
19736 /* If it's not a `:' or a `{' then we can't really be looking at a
19737 class-head, since a class-head only appears as part of a
19738 class-specifier. We have to detect this situation before calling
19739 xref_tag, since that has irreversible side-effects. */
19741 {
19745 }
19747 /* At this point, we're going ahead with the class-specifier, even
19748 if some other problem occurs. */
19751 {
19756 }
19757 /* Issue the error about the overly-qualified name now. */
19759 {
19764 }
19766 {
19771 }
19773 {
19774 tree scope;
19776 /* Reject typedef-names in class heads. */
19778 {
19781 type);
19784 }
19786 /* Figure out in what scope the declaration is being placed. */
19788 /* If that scope does not contain the scope in which the
19789 class was originally declared, the program is invalid. */
19791 {
19794 "declaration of %qD in namespace %qD which does not "
19797 else
19803 }
19804 /* [dcl.meaning]
19806 A declarator-id shall not be qualified except for the
19807 definition of a ... nested class outside of its class
19808 ... [or] the definition or explicit instantiation of a
19809 class member of a namespace outside of its namespace. */
19811 {
19816 }
19817 }
19818 /* An explicit-specialization must be preceded by "template <>". If
19819 it is not, try to recover gracefully. */
19823 {
19827 /* Take the same action that would have been taken by
19828 cp_parser_explicit_specialization. */
19831 }
19832 /* There must be no "return" statements between this point and the
19833 end of this function; set "type "to the correct return value and
19834 use "goto done;" to return. */
19835 /* Make sure that the right number of template parameters were
19836 present. */
19840 {
19841 /* If something went wrong, there is no point in even trying to
19842 process the class-definition. */
19845 }
19847 /* Look up the type. */
19849 {
19853 {
19857 }
19858 else
19859 {
19862 }
19865 }
19867 {
19868 tree class_type;
19870 /* Given:
19872 template <typename T> struct S { struct T };
19873 template <typename T> struct S<T>::T { };
19875 we will get a TYPENAME_TYPE when processing the definition of
19876 `S::T'. We need to resolve it to the actual type before we
19877 try to define it. */
19879 {
19884 else
19885 {
19888 }
19889 }
19893 {
19896 }
19899 /* Enter the scope indicated by the nested-name-specifier. */
19901 /* Get the canonical version of this type. */
19903 /* Call push_template_decl if it seems like we should be defining a
19904 template either from the template headers or the type we're
19905 defining, so that we diagnose both extra and missing headers. */
19911 {
19914 {
19917 }
19918 }
19922 }
19924 {
19925 /* If the class was unnamed, create a dummy name. */
19930 }
19932 /* Indicate whether this class was declared as a `class' or as a
19933 `struct'. */
19938 /* If this type was already complete, and we see another definition,
19939 that's an error. */
19941 {
19943 type);
19945 type);
19948 }
19953 {
19954 /* Apply attributes now, before any use of the class as a template
19955 argument in its base list. */
19958 }
19960 /* We will have entered the scope containing the class; the names of
19961 base classes should be looked up in that context. For example:
19963 struct A { struct B {}; struct C; };
19964 struct A::C : B {};
19966 is valid. */
19968 /* Get the list of base-classes, if there is one. */
19970 {
19971 /* PR59482: enter the class scope so that base-specifiers are looked
19972 up correctly. */
19976 /* PR59482: get out of the previously pushed class scope so that the
19977 subsequent pops pop the right thing. */
19980 }
19981 else
19984 /* If we're really defining a class, process the base classes.
19985 If they're invalid, fail. */
19990 done:
19991 /* Leave the scope given by the nested-name-specifier. We will
19992 enter the class scope itself while processing the members. */
19997 {
20000 }
20006 out:
20009 }
20011 /* Parse a class-key.
20013 class-key:
20014 class
20015 struct
20016 union
20018 Returns the kind of class-key specified, or none_type to indicate
20019 error. */
20021 static enum tag_types
20023 {
20027 /* Look for the class-key. */
20032 /* Check to see if the TOKEN is a class-key. */
20037 }
20039 /* Parse an (optional) member-specification.
20041 member-specification:
20042 member-declaration member-specification [opt]
20043 access-specifier : member-specification [opt] */
20045 static void
20047 {
20049 {
20053 /* Peek at the next token. */
20055 /* If it's a `}', or EOF then we've seen all the members. */
20061 /* See if this token is a keyword. */
20064 {
20068 /* Consume the access-specifier. */
20070 /* Remember which access-specifier is active. */
20072 /* Look for the `:'. */
20077 /* Accept #pragmas at class scope. */
20079 {
20082 }
20084 /* Otherwise, the next construction must be a
20085 member-declaration. */
20087 }
20088 }
20089 }
20091 /* Parse a member-declaration.
20093 member-declaration:
20094 decl-specifier-seq [opt] member-declarator-list [opt] ;
20095 function-definition ; [opt]
20096 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20097 using-declaration
20098 template-declaration
20099 alias-declaration
20101 member-declarator-list:
20102 member-declarator
20103 member-declarator-list , member-declarator
20105 member-declarator:
20106 declarator pure-specifier [opt]
20107 declarator constant-initializer [opt]
20108 identifier [opt] : constant-expression
20110 GNU Extensions:
20112 member-declaration:
20113 __extension__ member-declaration
20115 member-declarator:
20116 declarator attributes [opt] pure-specifier [opt]
20117 declarator attributes [opt] constant-initializer [opt]
20118 identifier [opt] attributes [opt] : constant-expression
20120 C++0x Extensions:
20122 member-declaration:
20123 static_assert-declaration */
20125 static void
20127 {
20128 cp_decl_specifier_seq decl_specifiers;
20129 tree prefix_attributes;
20130 tree decl;
20139 /* Check for the `__extension__' keyword. */
20141 {
20142 /* Recurse. */
20144 /* Restore the old value of the PEDANTIC flag. */
20148 }
20150 /* Check for a template-declaration. */
20152 {
20153 /* An explicit specialization here is an error condition, and we
20154 expect the specialization handler to detect and report this. */
20158 else
20162 }
20164 /* Check for a using-declaration. */
20166 {
20168 {
20169 /* Parse the using-declaration. */
20173 }
20174 else
20175 {
20176 tree decl;
20180 /* Note that if we actually see the '=' token after the
20181 identifier, cp_parser_alias_declaration commits the
20182 tentative parse. In that case, we really expects an
20183 alias-declaration. Otherwise, we expect a using
20184 declaration. */
20185 alias_decl_expected =
20191 else
20195 }
20196 }
20198 /* Check for @defs. */
20200 {
20205 {
20210 }
20212 }
20214 /* If the next token is `static_assert' we have a static assertion. */
20216 {
20219 }
20226 /* Parse the decl-specifier-seq. */
20229 CP_PARSER_FLAGS_OPTIONAL,
20232 /* Check for an invalid type-name. */
20236 /* If there is no declarator, then the decl-specifier-seq should
20237 specify a type. */
20239 {
20240 /* If there was no decl-specifier-seq, and the next token is a
20241 `;', then we have something like:
20243 struct S { ; };
20245 [class.mem]
20247 Each member-declaration shall declare at least one member
20248 name of the class. */
20250 {
20254 }
20255 else
20256 {
20257 tree type;
20259 /* See if this declaration is a friend. */
20261 /* If there were decl-specifiers, check to see if there was
20262 a class-declaration. */
20265 /* Nested classes have already been added to the class, but
20266 a `friend' needs to be explicitly registered. */
20268 {
20269 /* If the `friend' keyword was present, the friend must
20270 be introduced with a class-key. */
20273 "in C++03 a class-key must be used "
20275 /* In this case:
20277 template <typename T> struct A {
20278 friend struct A<T>::B;
20279 };
20281 A<T>::B will be represented by a TYPENAME_TYPE, and
20282 therefore not recognized by check_tag_decl. */
20284 {
20288 }
20291 "friend declaration does not name a class or "
20293 else
20296 }
20297 /* If there is no TYPE, an error message will already have
20298 been issued. */
20300 ;
20301 /* An anonymous aggregate has to be handled specially; such
20302 a declaration really declares a data member (with a
20303 particular type), as opposed to a nested class. */
20305 {
20306 /* C++11 9.5/6. */
20309 "a storage class on an anonymous aggregate "
20312 /* Remove constructors and such from TYPE, now that we
20313 know it is an anonymous aggregate. */
20315 /* And make the corresponding data member. */
20318 /* Add it to the class. */
20320 }
20321 else
20322 cp_parser_check_access_in_redeclaration
20325 }
20326 }
20327 else
20328 {
20331 /* Clear attributes from the decl_specifiers but keep them
20332 around as prefix attributes that apply them to the entity
20333 being declared. */
20337 /* See if these declarations will be friends. */
20340 /* Keep going until we hit the `;' at the end of the
20341 declaration. */
20343 {
20345 tree first_attribute;
20347 /* Peek at the next token. */
20350 /* Check for a bitfield declaration. */
20355 {
20356 tree identifier;
20357 tree width;
20359 /* Get the name of the bitfield. Note that we cannot just
20360 check TOKEN here because it may have been invalidated by
20361 the call to cp_lexer_peek_nth_token above. */
20364 else
20367 /* Consume the `:' token. */
20369 /* Get the width of the bitfield. */
20370 width
20373 NULL);
20375 /* Look for attributes that apply to the bitfield. */
20377 /* Remember which attributes are prefix attributes and
20378 which are not. */
20380 /* Combine the attributes. */
20383 /* Create the bitfield declaration. */
20386 identifier,
20387 sfk_none)
20390 width,
20391 attributes);
20392 }
20393 else
20394 {
20396 tree initializer;
20397 tree asm_specification;
20400 /* Parse the declarator. */
20401 declarator
20407 /* If something went wrong parsing the declarator, make sure
20408 that we at least consume some tokens. */
20410 {
20411 /* Skip to the end of the statement. */
20413 /* If the next token is not a semicolon, that is
20414 probably because we just skipped over the body of
20415 a function. So, we consume a semicolon if
20416 present, but do not issue an error message if it
20417 is not present. */
20419 CPP_SEMICOLON))
20422 }
20425 cp_parser_check_for_definition_in_return_type
20429 /* Look for an asm-specification. */
20431 /* Look for attributes that apply to the declaration. */
20433 /* Remember which attributes are prefix attributes and
20434 which are not. */
20436 /* Combine the attributes. */
20439 /* If it's an `=', then we have a constant-initializer or a
20440 pure-specifier. It is not correct to parse the
20441 initializer before registering the member declaration
20442 since the member declaration should be in scope while
20443 its initializer is processed. However, the rest of the
20444 front end does not yet provide an interface that allows
20445 us to handle this correctly. */
20447 {
20448 /* In [class.mem]:
20450 A pure-specifier shall be used only in the declaration of
20451 a virtual function.
20453 A member-declarator can contain a constant-initializer
20454 only if it declares a static member of integral or
20455 enumeration type.
20457 Therefore, if the DECLARATOR is for a function, we look
20458 for a pure-specifier; otherwise, we look for a
20459 constant-initializer. When we call `grokfield', it will
20460 perform more stringent semantics checks. */
20472 {
20474 /* Don't require a constant rvalue in C++11, since we
20475 might want a reference constant. We'll enforce
20476 constancy later. */
20478 /* Parse the initializer. */
20481 }
20482 else
20483 /* Parse the initializer. */
20485 }
20488 {
20492 else
20494 }
20495 /* Otherwise, there is no initializer. */
20496 else
20499 /* See if we are probably looking at a function
20500 definition. We are certainly not looking at a
20501 member-declarator. Calling `grokfield' has
20502 side-effects, so we must not do it unless we are sure
20503 that we are looking at a member-declarator. */
20506 {
20507 /* The grammar does not allow a pure-specifier to be
20508 used when a member function is defined. (It is
20509 possible that this fact is an oversight in the
20510 standard, since a pure function may be defined
20511 outside of the class-specifier. */
20517 declarator,
20518 attributes);
20521 /* If the member was not a friend, declare it here. */
20524 /* Peek at the next token. */
20526 /* If the next token is a semicolon, consume it. */
20530 }
20531 else
20534 /* Create the declaration. */
20539 {
20542 else
20544 }
20545 }
20549 /* Reset PREFIX_ATTRIBUTES. */
20555 /* If there is any qualification still in effect, clear it
20556 now; we will be starting fresh with the next declarator. */
20560 /* If it's a `,', then there are more declarators. */
20562 {
20565 {
20569 }
20570 }
20571 /* If the next token isn't a `;', then we have a parse error. */
20573 CPP_SEMICOLON))
20574 {
20575 /* The next token might be a ways away from where the
20576 actual semicolon is missing. Find the previous token
20577 and use that for our error position. */
20582 /* Assume that the user meant to provide a semicolon. If
20583 we were to cp_parser_skip_to_end_of_statement, we might
20584 skip to a semicolon inside a member function definition
20585 and issue nonsensical error messages. */
20587 }
20590 {
20591 /* Add DECL to the list of members. */
20600 /* Add DECL to the queue of NSDMI to be parsed later. */
20602 }
20606 }
20607 }
20610 out:
20612 }
20614 /* Parse a pure-specifier.
20616 pure-specifier:
20617 = 0
20619 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20620 Otherwise, ERROR_MARK_NODE is returned. */
20622 static tree
20624 {
20627 /* Look for the `=' token. */
20630 /* Look for the `0' token. */
20639 /* Accept = default or = delete in c++0x mode. */
20642 {
20645 }
20647 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20649 {
20654 }
20656 {
20659 }
20662 }
20664 /* Parse a constant-initializer.
20666 constant-initializer:
20667 = constant-expression
20669 Returns a representation of the constant-expression. */
20671 static tree
20673 {
20674 /* Look for the `=' token. */
20678 /* It is invalid to write:
20680 struct S { static const int i = { 7 }; };
20682 */
20684 {
20687 /* Consume the opening brace. */
20689 /* Skip the initializer. */
20691 /* Look for the trailing `}'. */
20695 }
20699 NULL);
20700 }
20702 /* Derived classes [gram.class.derived] */
20704 /* Parse a base-clause.
20706 base-clause:
20707 : base-specifier-list
20709 base-specifier-list:
20710 base-specifier ... [opt]
20711 base-specifier-list , base-specifier ... [opt]
20713 Returns a TREE_LIST representing the base-classes, in the order in
20714 which they were declared. The representation of each node is as
20715 described by cp_parser_base_specifier.
20717 In the case that no bases are specified, this function will return
20718 NULL_TREE, not ERROR_MARK_NODE. */
20720 static tree
20722 {
20725 /* Look for the `:' that begins the list. */
20728 /* Scan the base-specifier-list. */
20730 {
20732 tree base;
20735 /* Look for the base-specifier. */
20737 /* Look for the (optional) ellipsis. */
20739 {
20740 /* Consume the `...'. */
20744 }
20746 /* Add BASE to the front of the list. */
20748 {
20750 /* Make this a pack expansion type. */
20754 {
20757 }
20758 }
20759 /* Peek at the next token. */
20761 /* If it's not a comma, then the list is complete. */
20764 /* Consume the `,'. */
20766 }
20768 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20769 base class had a qualified name. However, the next name that
20770 appears is certainly not qualified. */
20776 }
20778 /* Parse a base-specifier.
20780 base-specifier:
20781 :: [opt] nested-name-specifier [opt] class-name
20782 virtual access-specifier [opt] :: [opt] nested-name-specifier
20783 [opt] class-name
20784 access-specifier virtual [opt] :: [opt] nested-name-specifier
20785 [opt] class-name
20787 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20788 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20789 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20790 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20792 static tree
20794 {
20802 tree type;
20804 /* Process the optional `virtual' and `access-specifier'. */
20806 {
20807 /* Peek at the next token. */
20809 /* Process `virtual'. */
20811 {
20813 /* If `virtual' appears more than once, issue an error. */
20815 {
20819 }
20823 /* Consume the `virtual' token. */
20831 /* If more than one access specifier appears, issue an
20832 error. */
20835 {
20839 }
20843 /* Consume the access-specifier. */
20851 }
20852 }
20853 /* It is not uncommon to see programs mechanically, erroneously, use
20854 the 'typename' keyword to denote (dependent) qualified types
20855 as base classes. */
20857 {
20862 else
20864 "keyword %<typename%> not allowed in this context "
20867 }
20869 /* Look for the optional `::' operator. */
20871 /* Look for the nested-name-specifier. The simplest way to
20872 implement:
20874 [temp.res]
20876 The keyword `typename' is not permitted in a base-specifier or
20877 mem-initializer; in these contexts a qualified name that
20878 depends on a template-parameter is implicitly assumed to be a
20879 type name.
20881 is to pretend that we have seen the `typename' keyword at this
20882 point. */
20886 typename_type,
20888 /* If the base class is given by a qualified name, assume that names
20889 we see are type names or templates, as appropriate. */
20895 /* DR 950 allows decltype as a base-specifier. */
20897 else
20898 {
20899 /* Otherwise, look for the class-name. */
20901 class_scope_p,
20902 template_p,
20903 typename_type,
20908 }
20914 }
20916 /* Exception handling [gram.exception] */
20918 /* Parse an (optional) noexcept-specification.
20920 noexcept-specification:
20921 noexcept ( constant-expression ) [opt]
20923 If no noexcept-specification is present, returns NULL_TREE.
20924 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20925 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20926 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20927 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20928 in which case a boolean condition is returned instead. */
20930 static tree
20935 {
20939 /* Peek at the next token. */
20942 /* Is it a noexcept-specification? */
20944 {
20945 tree expr;
20949 {
20953 {
20954 /* Types may not be defined in an exception-specification. */
20956 parser->type_definition_forbidden_message
20961 /* Restore the saved message. */
20963 }
20964 else
20965 {
20968 }
20971 }
20972 else
20973 {
20977 }
20979 /* We cannot build a noexcept-spec right away because this will check
20980 that expr is a constexpr. */
20983 else
20985 }
20986 else
20988 }
20990 /* Parse an (optional) exception-specification.
20992 exception-specification:
20993 throw ( type-id-list [opt] )
20995 Returns a TREE_LIST representing the exception-specification. The
20996 TREE_VALUE of each node is a type. */
20998 static tree
21000 {
21002 tree type_id_list;
21005 /* Peek at the next token. */
21008 /* Is it a noexcept-specification? */
21014 /* If it's not `throw', then there's no exception-specification. */
21018 #if 0
21019 /* Enable this once a lot of code has transitioned to noexcept? */
21023 #endif
21025 /* Consume the `throw'. */
21028 /* Look for the `('. */
21031 /* Peek at the next token. */
21033 /* If it's not a `)', then there is a type-id-list. */
21035 {
21036 /* Types may not be defined in an exception-specification. */
21038 parser->type_definition_forbidden_message
21040 /* Parse the type-id-list. */
21042 /* Restore the saved message. */
21044 }
21045 else
21048 /* Look for the `)'. */
21052 }
21054 /* Parse an (optional) type-id-list.
21056 type-id-list:
21057 type-id ... [opt]
21058 type-id-list , type-id ... [opt]
21060 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21061 in the order that the types were presented. */
21063 static tree
21065 {
21069 {
21071 tree type;
21073 /* Get the next type-id. */
21075 /* Parse the optional ellipsis. */
21077 {
21078 /* Consume the `...'. */
21081 /* Turn the type into a pack expansion expression. */
21083 }
21084 /* Add it to the list. */
21086 /* Peek at the next token. */
21088 /* If it is not a `,', we are done. */
21091 /* Consume the `,'. */
21093 }
21096 }
21098 /* Parse a try-block.
21100 try-block:
21101 try compound-statement handler-seq */
21103 static tree
21105 {
21106 tree try_block;
21116 }
21118 /* Parse a function-try-block.
21120 function-try-block:
21121 try ctor-initializer [opt] function-body handler-seq */
21123 static bool
21125 {
21126 tree compound_stmt;
21127 tree try_block;
21130 /* Look for the `try' keyword. */
21133 /* Let the rest of the front end know where we are. */
21135 /* Parse the function-body. */
21136 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21138 /* We're done with the `try' part. */
21140 /* Parse the handlers. */
21142 /* We're done with the handlers. */
21146 }
21148 /* Parse a handler-seq.
21150 handler-seq:
21151 handler handler-seq [opt] */
21153 static void
21155 {
21157 {
21160 /* Parse the handler. */
21162 /* Peek at the next token. */
21164 /* If it's not `catch' then there are no more handlers. */
21167 }
21168 }
21170 /* Parse a handler.
21172 handler:
21173 catch ( exception-declaration ) compound-statement */
21175 static void
21177 {
21178 tree handler;
21179 tree declaration;
21189 }
21191 /* Parse an exception-declaration.
21193 exception-declaration:
21194 type-specifier-seq declarator
21195 type-specifier-seq abstract-declarator
21196 type-specifier-seq
21197 ...
21199 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21200 ellipsis variant is used. */
21202 static tree
21204 {
21205 cp_decl_specifier_seq type_specifiers;
21209 /* If it's an ellipsis, it's easy to handle. */
21211 {
21212 /* Consume the `...' token. */
21215 }
21217 /* Types may not be defined in exception-declarations. */
21219 parser->type_definition_forbidden_message
21222 /* Parse the type-specifier-seq. */
21226 /* If it's a `)', then there is no declarator. */
21229 else
21235 /* Restore the saved message. */
21242 }
21244 /* Parse a throw-expression.
21246 throw-expression:
21247 throw assignment-expression [opt]
21249 Returns a THROW_EXPR representing the throw-expression. */
21251 static tree
21253 {
21254 tree expression;
21259 /* Figure out whether or not there is an assignment-expression
21260 following the "throw" keyword. */
21268 else
21273 }
21275 /* GNU Extensions */
21277 /* Parse an (optional) asm-specification.
21279 asm-specification:
21280 asm ( string-literal )
21282 If the asm-specification is present, returns a STRING_CST
21283 corresponding to the string-literal. Otherwise, returns
21284 NULL_TREE. */
21286 static tree
21288 {
21290 tree asm_specification;
21292 /* Peek at the next token. */
21294 /* If the next token isn't the `asm' keyword, then there's no
21295 asm-specification. */
21299 /* Consume the `asm' token. */
21301 /* Look for the `('. */
21304 /* Look for the string-literal. */
21307 /* Look for the `)'. */
21311 }
21313 /* Parse an asm-operand-list.
21315 asm-operand-list:
21316 asm-operand
21317 asm-operand-list , asm-operand
21319 asm-operand:
21320 string-literal ( expression )
21321 [ string-literal ] string-literal ( expression )
21323 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21324 each node is the expression. The TREE_PURPOSE is itself a
21325 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21326 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21327 is a STRING_CST for the string literal before the parenthesis. Returns
21328 ERROR_MARK_NODE if any of the operands are invalid. */
21330 static tree
21332 {
21337 {
21338 tree string_literal;
21339 tree expression;
21340 tree name;
21343 {
21344 /* Consume the `[' token. */
21346 /* Read the operand name. */
21351 /* Look for the closing `]'. */
21353 }
21354 else
21356 /* Look for the string-literal. */
21359 /* Look for the `('. */
21361 /* Parse the expression. */
21363 /* Look for the `)'. */
21371 /* Add this operand to the list. */
21373 expression,
21374 asm_operands);
21375 /* If the next token is not a `,', there are no more
21376 operands. */
21379 /* Consume the `,'. */
21381 }
21384 }
21386 /* Parse an asm-clobber-list.
21388 asm-clobber-list:
21389 string-literal
21390 asm-clobber-list , string-literal
21392 Returns a TREE_LIST, indicating the clobbers in the order that they
21393 appeared. The TREE_VALUE of each node is a STRING_CST. */
21395 static tree
21397 {
21401 {
21402 tree string_literal;
21404 /* Look for the string literal. */
21406 /* Add it to the list. */
21408 /* If the next token is not a `,', then the list is
21409 complete. */
21412 /* Consume the `,' token. */
21414 }
21417 }
21419 /* Parse an asm-label-list.
21421 asm-label-list:
21422 identifier
21423 asm-label-list , identifier
21425 Returns a TREE_LIST, indicating the labels in the order that they
21426 appeared. The TREE_VALUE of each node is a label. */
21428 static tree
21430 {
21434 {
21437 /* Look for the identifier. */
21440 {
21443 {
21449 }
21450 }
21451 /* If the next token is not a `,', then the list is
21452 complete. */
21455 /* Consume the `,' token. */
21457 }
21460 }
21462 /* Return TRUE iff the next tokens in the stream are possibly the
21463 beginning of a GNU extension attribute. */
21465 static bool
21467 {
21469 }
21471 /* Return TRUE iff the next tokens in the stream are possibly the
21472 beginning of a standard C++-11 attribute specifier. */
21474 static bool
21476 {
21478 }
21480 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21481 beginning of a standard C++-11 attribute specifier. */
21483 static bool
21485 {
21493 }
21495 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21496 beginning of a GNU extension attribute. */
21498 static bool
21500 {
21504 }
21506 /* Return true iff the next tokens can be the beginning of either a
21507 GNU attribute list, or a standard C++11 attribute sequence. */
21509 static bool
21511 {
21514 }
21516 /* Return true iff the next Nth tokens can be the beginning of either
21517 a GNU attribute list, or a standard C++11 attribute sequence. */
21519 static bool
21521 {
21524 }
21526 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21527 of GNU attributes, or return NULL. */
21529 static tree
21531 {
21535 }
21537 #define CILK_SIMD_FN_CLAUSE_MASK \
21538 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21539 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21540 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21541 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21542 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21544 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21545 vector [(<clauses>)] */
21547 static void
21549 {
21553 {
21558 }
21561 {
21564 paren_scope++;
21565 }
21567 {
21570 paren_scope++;
21572 paren_scope--;
21573 /* Do not push the last ')' */
21576 }
21585 }
21587 /* Parse an (optional) series of attributes.
21589 attributes:
21590 attributes attribute
21592 attribute:
21593 __attribute__ (( attribute-list [opt] ))
21595 The return value is as for cp_parser_gnu_attribute_list. */
21597 static tree
21599 {
21603 {
21605 tree attribute_list;
21608 /* Peek at the next token. */
21610 /* If it's not `__attribute__', then we're done. */
21614 /* Consume the `__attribute__' keyword. */
21616 /* Look for the two `(' tokens. */
21620 /* Peek at the next token. */
21623 /* Parse the attribute-list. */
21625 else
21626 /* If the next token is a `)', then there is no attribute
21627 list. */
21630 /* Look for the two `)' tokens. */
21638 /* Add these new attributes to the list. */
21640 }
21643 }
21645 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21646 "__vector" or "__vector__." */
21650 {
21654 }
21656 /* Parse a GNU attribute-list.
21658 attribute-list:
21659 attribute
21660 attribute-list , attribute
21662 attribute:
21663 identifier
21664 identifier ( identifier )
21665 identifier ( identifier , expression-list )
21666 identifier ( expression-list )
21668 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21669 to an attribute. The TREE_PURPOSE of each node is the identifier
21670 indicating which attribute is in use. The TREE_VALUE represents
21671 the arguments, if any. */
21673 static tree
21675 {
21681 {
21683 tree identifier;
21684 tree attribute;
21686 /* Look for the identifier. We also allow keywords here; for
21687 example `__attribute__ ((const))' is legal. */
21691 {
21694 /* Consume the token, but save it since we need it for the
21695 SIMD enabled function parsing. */
21698 /* Save away the identifier that indicates which attribute
21699 this is. */
21701 /* For keywords, use the canonical spelling, not the
21702 parsed identifier. */
21708 /* Peek at the next token. */
21710 /* If it's an `(', then parse the attribute arguments. */
21712 {
21717 {
21720 }
21721 else
21722 vec = cp_parser_parenthesized_expression_list
21728 else
21729 {
21732 }
21733 /* Save the arguments away. */
21735 }
21737 {
21740 }
21743 {
21744 /* Add this attribute to the list. */
21747 }
21750 }
21751 /* Now, look for more attributes. If the next token isn't a
21752 `,', we're done. */
21756 /* Consume the comma and keep going. */
21758 }
21761 /* We built up the list in reverse order. */
21763 }
21765 /* Parse a standard C++11 attribute.
21767 The returned representation is a TREE_LIST which TREE_PURPOSE is
21768 the scoped name of the attribute, and the TREE_VALUE is its
21769 arguments list.
21771 Note that the scoped name of the attribute is itself a TREE_LIST
21772 which TREE_PURPOSE is the namespace of the attribute, and
21773 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21774 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21775 and which TREE_PURPOSE is directly the attribute name.
21777 Clients of the attribute code should use get_attribute_namespace
21778 and get_attribute_name to get the actual namespace and name of
21779 attributes, regardless of their being GNU or C++11 attributes.
21781 attribute:
21782 attribute-token attribute-argument-clause [opt]
21784 attribute-token:
21785 identifier
21786 attribute-scoped-token
21788 attribute-scoped-token:
21789 attribute-namespace :: identifier
21791 attribute-namespace:
21792 identifier
21794 attribute-argument-clause:
21795 ( balanced-token-seq )
21797 balanced-token-seq:
21798 balanced-token [opt]
21799 balanced-token-seq balanced-token
21801 balanced-token:
21802 ( balanced-token-seq )
21803 [ balanced-token-seq ]
21804 { balanced-token-seq }. */
21806 static tree
21808 {
21812 /* First, parse name of the the attribute, a.k.a
21813 attribute-token. */
21830 {
21831 /* We are seeing a scoped attribute token. */
21841 else
21842 {
21846 }
21848 NULL_TREE);
21850 }
21851 else
21852 {
21854 NULL_TREE);
21855 /* C++11 noreturn attribute is equivalent to GNU's. */
21858 /* C++14 deprecated attribute is equivalent to GNU's. */
21861 }
21863 /* Now parse the optional argument clause of the attribute. */
21868 {
21874 /* A GNU attribute that takes an identifier in parameter. */
21877 vec = cp_parser_parenthesized_expression_list
21883 else
21884 {
21887 }
21891 else
21893 }
21896 }
21898 /* Parse a list of standard C++-11 attributes.
21900 attribute-list:
21901 attribute [opt]
21902 attribute-list , attribute[opt]
21903 attribute ...
21904 attribute-list , attribute ...
21905 */
21907 static tree
21909 {
21914 {
21919 {
21922 }
21927 }
21930 }
21932 /* Parse a standard C++-11 attribute specifier.
21934 attribute-specifier:
21935 [ [ attribute-list ] ]
21936 alignment-specifier
21938 alignment-specifier:
21939 alignas ( type-id ... [opt] )
21940 alignas ( alignment-expression ... [opt] ). */
21942 static tree
21944 {
21950 {
21959 else
21960 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21961 when we are sure that we have actually parsed them. */
21963 }
21964 else
21965 {
21966 tree alignas_expr;
21968 /* Look for an alignment-specifier. */
21980 {
21983 }
21989 {
21993 alignas_expr =
22001 }
22004 {
22007 }
22011 /* Build the C++-11 representation of an 'aligned'
22012 attribute. */
22013 attributes =
22017 }
22020 }
22022 /* Parse a standard C++-11 attribute-specifier-seq.
22024 attribute-specifier-seq:
22025 attribute-specifier-seq [opt] attribute-specifier
22026 */
22028 static tree
22030 {
22034 {
22043 }
22047 }
22049 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22050 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22051 current value of the PEDANTIC flag, regardless of whether or not
22052 the `__extension__' keyword is present. The caller is responsible
22053 for restoring the value of the PEDANTIC flag. */
22055 static bool
22057 {
22058 /* Save the old value of the PEDANTIC flag. */
22062 {
22063 /* Consume the `__extension__' token. */
22065 /* We're not being pedantic while the `__extension__' keyword is
22066 in effect. */
22070 }
22073 }
22075 /* Parse a label declaration.
22077 label-declaration:
22078 __label__ label-declarator-seq ;
22080 label-declarator-seq:
22081 identifier , label-declarator-seq
22082 identifier */
22084 static void
22086 {
22087 /* Look for the `__label__' keyword. */
22091 {
22092 tree identifier;
22094 /* Look for an identifier. */
22096 /* If we failed, stop. */
22099 /* Declare it as a label. */
22101 /* If the next token is a `;', stop. */
22104 /* Look for the `,' separating the label declarations. */
22106 }
22108 /* Look for the final `;'. */
22110 }
22112 /* Support Functions */
22114 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22115 NAME should have one of the representations used for an
22116 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22117 is returned. If PARSER->SCOPE is a dependent type, then a
22118 SCOPE_REF is returned.
22120 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22121 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22122 was formed. Abstractly, such entities should not be passed to this
22123 function, because they do not need to be looked up, but it is
22124 simpler to check for this special case here, rather than at the
22125 call-sites.
22127 In cases not explicitly covered above, this function returns a
22128 DECL, OVERLOAD, or baselink representing the result of the lookup.
22129 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22130 is returned.
22132 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22133 (e.g., "struct") that was used. In that case bindings that do not
22134 refer to types are ignored.
22136 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22137 ignored.
22139 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22140 are ignored.
22142 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22143 types.
22145 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22146 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22147 NULL_TREE otherwise. */
22149 static tree
22156 location_t name_location)
22157 {
22158 tree decl;
22161 /* Assume that the lookup will be unambiguous. */
22165 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22166 no longer valid. Note that if we are parsing tentatively, and
22167 the parse fails, OBJECT_TYPE will be automatically restored. */
22173 /* A template-id has already been resolved; there is no lookup to
22174 do. */
22178 {
22182 }
22184 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22185 it should already have been checked to make sure that the name
22186 used matches the type being destroyed. */
22188 {
22189 tree type;
22191 /* Figure out to which type this destructor applies. */
22196 else
22198 /* If that's not a class type, there is no destructor. */
22205 /* If it was a class type, return the destructor. */
22207 }
22209 /* By this point, the NAME should be an ordinary identifier. If
22210 the id-expression was a qualified name, the qualifying scope is
22211 stored in PARSER->SCOPE at this point. */
22214 /* Perform the lookup. */
22216 {
22222 /* If the SCOPE is dependent, the lookup must be deferred until
22223 the template is instantiated -- unless we are explicitly
22224 looking up names in uninstantiated templates. Even then, we
22225 cannot look up the name if the scope is not a class type; it
22226 might, for example, be a template type parameter. */
22231 /* Defer lookup. */
22233 else
22234 {
22237 /* If PARSER->SCOPE is a dependent type, then it must be a
22238 class type, and we must not be checking dependencies;
22239 otherwise, we would have processed this lookup above. So
22240 that PARSER->SCOPE is not considered a dependent base by
22241 lookup_member, we must enter the scope here. */
22245 /* If the PARSER->SCOPE is a template specialization, it
22246 may be instantiated during name lookup. In that case,
22247 errors may be issued. Even if we rollback the current
22248 tentative parse, those errors are valid. */
22253 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22254 lookup result and the nested-name-specifier nominates a class C:
22255 * if the name specified after the nested-name-specifier, when
22256 looked up in C, is the injected-class-name of C (Clause 9), or
22257 * if the name specified after the nested-name-specifier is the
22258 same as the identifier or the simple-template-id's template-
22259 name in the last component of the nested-name-specifier,
22260 the name is instead considered to name the constructor of
22261 class C. [ Note: for example, the constructor is not an
22262 acceptable lookup result in an elaborated-type-specifier so
22263 the constructor would not be used in place of the
22264 injected-class-name. --end note ] Such a constructor name
22265 shall be used only in the declarator-id of a declaration that
22266 names a constructor or in a using-declaration. */
22274 /* If we have a single function from a using decl, pull it out. */
22281 }
22283 /* If the scope is a dependent type and either we deferred lookup or
22284 we did lookup but didn't find the name, rememeber the name. */
22287 {
22289 {
22290 tree type;
22292 /* The resolution to Core Issue 180 says that `struct
22293 A::B' should be considered a type-name, even if `A'
22294 is dependent. */
22299 }
22303 CPP_CLOSE_PAREN)))
22307 else
22310 is_template);
22311 }
22314 }
22316 {
22317 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22318 OBJECT_TYPE is not a class. */
22320 /* If the OBJECT_TYPE is a template specialization, it may
22321 be instantiated during name lookup. In that case, errors
22322 may be issued. Even if we rollback the current tentative
22323 parse, those errors are valid. */
22325 name,
22328 tf_warning_or_error);
22329 else
22333 /* Look it up in the enclosing context. */
22339 }
22340 else
22341 {
22347 }
22349 /* If the lookup failed, let our caller know. */
22353 /* Pull out the template from an injected-class-name (or multiple). */
22357 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22359 {
22362 /* The error message we have to print is too complicated for
22363 cp_parser_error, so we incorporate its actions directly. */
22365 {
22367 name);
22369 }
22371 }
22379 /* If we have resolved the name of a member declaration, check to
22380 see if the declaration is accessible. When the name resolves to
22381 set of overloaded functions, accessibility is checked when
22382 overload resolution is done.
22384 During an explicit instantiation, access is not checked at all,
22385 as per [temp.explicit]. */
22392 }
22394 /* Like cp_parser_lookup_name, but for use in the typical case where
22395 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22396 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22398 static tree
22400 {
22402 none_type,
22407 location);
22408 }
22410 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22411 the current context, return the TYPE_DECL. If TAG_NAME_P is
22412 true, the DECL indicates the class being defined in a class-head,
22413 or declared in an elaborated-type-specifier.
22415 Otherwise, return DECL. */
22417 static tree
22419 {
22420 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22421 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22423 struct A {
22424 template <typename T> struct B;
22425 };
22427 template <typename T> struct A::B {};
22429 Similarly, in an elaborated-type-specifier:
22431 namespace N { struct X{}; }
22433 struct A {
22434 template <typename T> friend struct N::X;
22435 };
22437 However, if the DECL refers to a class type, and we are in
22438 the scope of the class, then the name lookup automatically
22439 finds the TYPE_DECL created by build_self_reference rather
22440 than a TEMPLATE_DECL. For example, in:
22442 template <class T> struct S {
22443 S s;
22444 };
22446 there is no need to handle such case. */
22452 }
22454 /* If too many, or too few, template-parameter lists apply to the
22455 declarator, issue an error message. Returns TRUE if all went well,
22456 and FALSE otherwise. */
22458 static bool
22461 location_t declarator_location)
22462 {
22464 {
22466 {
22474 /* If the DECLARATOR has the form `X<y>' then it uses one
22475 additional level of template parameters. */
22478 return cp_parser_check_template_parameters
22480 }
22495 }
22497 }
22499 /* NUM_TEMPLATES were used in the current declaration. If that is
22500 invalid, return FALSE and issue an error messages. Otherwise,
22501 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22502 declarator and we can print more accurate diagnostics. */
22504 static bool
22507 location_t location,
22509 {
22510 /* If there are the same number of template classes and parameter
22511 lists, that's OK. */
22514 /* If there are more, but only one more, then we are referring to a
22515 member template. That's OK too. */
22518 /* If there are more template classes than parameter lists, we have
22519 something like:
22521 template <class T> void S<T>::R<T>::f (); */
22523 {
22533 else
22536 }
22537 /* Otherwise, there are too many template parameter lists. We have
22538 something like:
22540 template <class T> template <class U> void S::f(); */
22543 }
22545 /* Parse an optional `::' token indicating that the following name is
22546 from the global namespace. If so, PARSER->SCOPE is set to the
22547 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22548 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22549 Returns the new value of PARSER->SCOPE, if the `::' token is
22550 present, and NULL_TREE otherwise. */
22552 static tree
22554 {
22557 /* Peek at the next token. */
22559 /* If we're looking at a `::' token then we're starting from the
22560 global namespace, not our current location. */
22562 {
22563 /* Consume the `::' token. */
22565 /* Set the SCOPE so that we know where to start the lookup. */
22571 }
22573 {
22577 }
22580 }
22582 /* Returns TRUE if the upcoming token sequence is the start of a
22583 constructor declarator. If FRIEND_P is true, the declarator is
22584 preceded by the `friend' specifier. */
22586 static bool
22588 {
22591 tree nested_name_specifier;
22594 /* The common case is that this is not a constructor declarator, so
22595 try to avoid doing lots of work if at all possible. It's not
22596 valid declare a constructor at function scope. */
22599 /* And only certain tokens can begin a constructor declarator. */
22607 /* Parse tentatively; we are going to roll back all of the tokens
22608 consumed here. */
22610 /* Assume that we are looking at a constructor declarator. */
22613 /* Look for the optional `::' operator. */
22616 /* Look for the nested-name-specifier. */
22617 nested_name_specifier
22628 /* Outside of a class-specifier, there must be a
22629 nested-name-specifier. */
22635 /* If we have a class scope, this is easy; DR 147 says that S::S always
22636 names the constructor, and no other qualified name could. */
22639 {
22649 }
22650 /* If we still think that this might be a constructor-declarator,
22651 look for a class-name. */
22653 {
22654 /* If we have:
22656 template <typename T> struct S {
22657 S();
22658 };
22660 we must recognize that the nested `S' names a class. */
22661 tree type_decl;
22665 none_type,
22669 /* If there was no class-name, then this is not a constructor.
22670 Otherwise, if we are in a class-specifier and we aren't
22671 handling a friend declaration, check that its type matches
22672 current_class_type (c++/38313). Note: error_mark_node
22673 is left alone for error recovery purposes. */
22675 && (outside_class_specifier_p
22680 /* If we're still considering a constructor, we have to see a `(',
22681 to begin the parameter-declaration-clause, followed by either a
22682 `)', an `...', or a decl-specifier. We need to check for a
22683 type-specifier to avoid being fooled into thinking that:
22685 S (f) (int);
22687 is a constructor. (It is actually a function named `f' that
22688 takes one parameter (of type `int') and returns a value of type
22689 `S'. */
22697 /* A parameter declaration begins with a decl-specifier,
22698 which is either the "attribute" keyword, a storage class
22699 specifier, or (usually) a type-specifier. */
22701 {
22702 tree type;
22706 /* Names appearing in the type-specifier should be looked up
22707 in the scope of the class. */
22710 else
22711 {
22714 {
22718 {
22721 }
22722 }
22724 }
22726 /* Inside the constructor parameter list, surrounding
22727 template-parameter-lists do not apply. */
22728 saved_num_template_parameter_lists
22732 /* Look for the type-specifier. */
22734 CP_PARSER_FLAGS_NONE,
22740 parser->num_template_parameter_lists
22743 /* Leave the scope of the class. */
22748 }
22749 }
22751 /* We did not really want to consume any tokens. */
22755 }
22757 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22758 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22759 they must be performed once we are in the scope of the function.
22761 Returns the function defined. */
22763 static tree
22764 cp_parser_function_definition_from_specifiers_and_declarator
22767 tree attributes,
22769 {
22770 tree fn;
22773 /* Begin the function-definition. */
22776 /* The things we're about to see are not directly qualified by any
22777 template headers we've seen thus far. */
22780 /* If there were names looked up in the decl-specifier-seq that we
22781 did not check, check them now. We must wait until we are in the
22782 scope of the function to perform the checks, since the function
22783 might be a friend. */
22787 {
22790 }
22793 {
22794 /* Skip the entire function. */
22797 }
22799 {
22800 /* Seen already, skip it. An error message has already been output. */
22804 /* If this is a function from a class, pop the nested class. */
22807 }
22808 else
22809 {
22810 timevar_id_t tv;
22813 else
22819 }
22822 }
22824 /* Parse the part of a function-definition that follows the
22825 declarator. INLINE_P is TRUE iff this function is an inline
22826 function defined within a class-specifier.
22828 Returns the function defined. */
22830 static tree
22833 {
22834 tree fn;
22840 bool fully_implicit_function_template_p
22843 tree implicit_template_parms
22846 cp_binding_level* implicit_template_scope
22852 /* If the next token is `return', then the code may be trying to
22853 make use of the "named return value" extension that G++ used to
22854 support. */
22857 {
22858 /* Consume the `return' keyword. */
22860 /* Look for the identifier that indicates what value is to be
22861 returned. */
22863 /* Issue an error message. */
22866 /* Skip tokens until we reach the start of the function body. */
22868 {
22875 }
22876 }
22877 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22878 anything declared inside `f'. */
22879 saved_in_unbraced_linkage_specification_p
22882 /* Inside the function, surrounding template-parameter-lists do not
22883 apply. */
22884 saved_num_template_parameter_lists
22890 /* If the next token is `try', `__transaction_atomic', or
22891 `__transaction_relaxed`, then we are looking at either function-try-block
22892 or function-transaction-block. Note that all of these include the
22893 function-body. */
22896 RID_TRANSACTION_ATOMIC);
22898 RID_TRANSACTION_RELAXED))
22900 RID_TRANSACTION_RELAXED);
22903 else
22904 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22909 /* Finish the function. */
22912 /* Generate code for it, if necessary. */
22914 /* Restore the saved values. */
22915 parser->in_unbraced_linkage_specification_p
22917 parser->num_template_parameter_lists
22921 parser->fully_implicit_function_template_p
22923 parser->implicit_template_parms
22925 parser->implicit_template_scope
22932 }
22934 /* Parse a template-declaration, assuming that the `export' (and
22935 `extern') keywords, if present, has already been scanned. MEMBER_P
22936 is as for cp_parser_template_declaration. */
22938 static void
22940 {
22943 tree parameter_list;
22948 /* Look for the `template' keyword. */
22953 /* And the `<'. */
22957 {
22958 /* 14.5.2.2 [temp.mem]
22960 A local class shall not have member templates. */
22965 }
22966 /* [temp]
22968 A template ... shall not have C linkage. */
22970 {
22972 /* Give it C++ linkage to avoid confusing other parts of the
22973 front end. */
22976 }
22977 else
22980 /* We cannot perform access checks on the template parameter
22981 declarations until we know what is being declared, just as we
22982 cannot check the decl-specifier list. */
22985 /* If the next token is `>', then we have an invalid
22986 specialization. Rather than complain about an invalid template
22987 parameter, issue an error message here. */
22989 {
22993 }
22994 else
22995 {
22996 /* Parse the template parameters. */
22998 }
23000 /* Get the deferred access checks from the parameter list. These
23001 will be checked once we know what is being declared, as for a
23002 member template the checks must be performed in the scope of the
23003 class containing the member. */
23006 /* Look for the `>'. */
23008 /* We just processed one more parameter list. */
23010 /* If the next token is `template', there are more template
23011 parameters. */
23013 RID_TEMPLATE))
23018 else
23019 {
23020 /* There are no access checks when parsing a template, as we do not
23021 know if a specialization will be a friend. */
23025 checks,
23026 member_p,
23031 /* If this is a member template declaration, let the front
23032 end know. */
23034 {
23039 }
23044 }
23045 /* We are done with the current parameter list. */
23050 /* Finish up. */
23053 /* Check the template arguments for a literal operator template. */
23057 {
23061 else
23062 {
23065 {
23071 }
23073 {
23081 }
23082 else
23084 }
23087 " Expected non-type template argument pack <char...>"
23089 decl);
23090 }
23091 /* Register member declarations. */
23094 /* For the erroneous case of a template with C linkage, we pushed an
23095 implicit C++ linkage scope; exit that scope now. */
23098 /* If DECL is a function template, we must return to parse it later.
23099 (Even though there is no definition, there might be default
23100 arguments that need handling.) */
23104 }
23106 /* Perform the deferred access checks from a template-parameter-list.
23107 CHECKS is a TREE_LIST of access checks, as returned by
23108 get_deferred_access_checks. */
23110 static void
23111 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23112 {
23116 }
23118 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23119 `function-definition' sequence that follows a template header.
23120 If MEMBER_P is true, this declaration appears in a class scope.
23122 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23123 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23125 static tree
23131 {
23134 cp_decl_specifier_seq decl_specifiers;
23138 /* This function is only used when processing a template
23139 declaration. */
23143 /* Defer access checks until we know what is being declared. */
23146 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23147 alternative. */
23150 CP_PARSER_FLAGS_OPTIONAL,
23156 /* There are no template typedefs. */
23158 {
23162 }
23164 /* Gather up the access checks that occurred the
23165 decl-specifier-seq. */
23168 /* Check for the declaration of a template class. */
23170 {
23172 {
23175 /* In this case:
23177 struct C {
23178 friend template <typename T> struct A<T>::B;
23179 };
23181 A<T>::B will be represented by a TYPENAME_TYPE, and
23182 therefore not recognized by shadow_tag. */
23184 && !decl
23191 else
23194 /* Perform access checks for template parameters. */
23196 }
23197 }
23199 /* Complain about missing 'typename' or other invalid type names. */
23202 {
23203 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23204 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23205 the rest of this declaration. */
23208 }
23210 /* If it's not a template class, try for a template function. If
23211 the next token is a `;', then this declaration does not declare
23212 anything. But, if there were errors in the decl-specifiers, then
23213 the error might well have come from an attempted class-specifier.
23214 In that case, there's no need to warn about a missing declarator. */
23218 {
23221 checks,
23223 member_p,
23224 declares_class_or_enum,
23226 NULL);
23228 /* 7.1.1-1 [dcl.stc]
23230 A storage-class-specifier shall not be specified in an explicit
23231 specialization... */
23233 && explicit_specialization_p
23235 {
23239 }
23243 }
23245 /* Look for a trailing `;' after the declaration. */
23251 out:
23254 /* Clear any current qualification; whatever comes next is the start
23255 of something new. */
23261 }
23263 /* Parse a cast-expression that is not the operand of a unary "&". */
23265 static tree
23267 {
23270 }
23272 /* Parse a functional cast to TYPE. Returns an expression
23273 representing the cast. */
23275 static tree
23277 {
23279 tree expression_list;
23280 tree cast;
23287 {
23295 tf_warning_or_error);
23296 }
23305 else
23306 {
23309 }
23312 tf_warning_or_error);
23313 /* [expr.const]/1: In an integral constant expression "only type
23314 conversions to integral or enumeration type can be used". */
23320 NIC_CONSTRUCTOR))
23323 }
23325 /* Save the tokens that make up the body of a member function defined
23326 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23327 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23328 specifiers applied to the declaration. Returns the FUNCTION_DECL
23329 for the member function. */
23331 static tree
23335 tree attributes)
23336 {
23339 tree fn;
23341 /* Create the FUNCTION_DECL. */
23344 /* If something went badly wrong, bail out now. */
23346 {
23347 /* If there's a function-body, skip it. */
23352 }
23354 /* Remember it, if there default args to post process. */
23357 /* Save away the tokens that make up the body of the
23358 function. */
23360 /* Handle function try blocks. */
23363 /* We can have braced-init-list mem-initializers before the fn body. */
23365 {
23368 {
23369 /* cache_group will stop after an un-nested { } pair, too. */
23373 /* variadic mem-inits have ... after the ')'. */
23376 }
23377 }
23379 /* Handle function try blocks. */
23384 /* Save away the inline definition; we will process it when the
23385 class is complete. */
23389 /* We need to know that this was defined in the class, so that
23390 friend templates are handled correctly. */
23393 /* Add FN to the queue of functions to be parsed later. */
23397 }
23399 /* Save the tokens that make up the in-class initializer for a non-static
23400 data member. Returns a DEFAULT_ARG. */
23402 static tree
23404 {
23406 }
23408 /* Parse a template-argument-list, as well as the trailing ">" (but
23409 not the opening "<"). See cp_parser_template_argument_list for the
23410 return value. */
23412 static tree
23414 {
23415 tree arguments;
23416 tree saved_scope;
23417 tree saved_qualifying_scope;
23418 tree saved_object_scope;
23423 /* [temp.names]
23425 When parsing a template-id, the first non-nested `>' is taken as
23426 the end of the template-argument-list rather than a greater-than
23427 operator. */
23428 saved_greater_than_is_operator_p
23431 /* Parsing the argument list may modify SCOPE, so we save it
23432 here. */
23436 /* We need to evaluate the template arguments, even though this
23437 template-id may be nested within a "sizeof". */
23442 /* Parse the template-argument-list itself. */
23446 else
23448 /* Look for the `>' that ends the template-argument-list. If we find
23449 a '>>' instead, it's probably just a typo. */
23451 {
23453 {
23454 /* In C++0x, a `>>' in a template argument list or cast
23455 expression is considered to be two separate `>'
23456 tokens. So, change the current token to a `>', but don't
23457 consume it: it will be consumed later when the outer
23458 template argument list (or cast expression) is parsed.
23459 Note that this replacement of `>' for `>>' is necessary
23460 even if we are parsing tentatively: in the tentative
23461 case, after calling
23462 cp_parser_enclosed_template_argument_list we will always
23463 throw away all of the template arguments and the first
23464 closing `>', either because the template argument list
23465 was erroneous or because we are replacing those tokens
23466 with a CPP_TEMPLATE_ID token. The second `>' (which will
23467 not have been thrown away) is needed either to close an
23468 outer template argument list or to complete a new-style
23469 cast. */
23472 }
23474 {
23475 /* If we're in a nested template argument list, the '>>' has
23476 to be a typo for '> >'. We emit the error message, but we
23477 continue parsing and we push a '>' as next token, so that
23478 the argument list will be parsed correctly. Note that the
23479 global source location is still on the token before the
23480 '>>', so we need to say explicitly where we want it. */
23486 }
23487 else
23488 {
23489 /* If this is not a nested template argument list, the '>>'
23490 is a typo for '>'. Emit an error message and continue.
23491 Same deal about the token location, but here we can get it
23492 right by consuming the '>>' before issuing the diagnostic. */
23495 "spurious %<>>%>, use %<>%> to terminate "
23497 }
23498 }
23499 else
23501 /* The `>' token might be a greater-than operator again now. */
23502 parser->greater_than_is_operator_p
23504 /* Restore the SAVED_SCOPE. */
23512 }
23514 /* MEMBER_FUNCTION is a member function, or a friend. If default
23515 arguments, or the body of the function have not yet been parsed,
23516 parse them now. */
23518 static void
23520 {
23522 /* If this member is a template, get the underlying
23523 FUNCTION_DECL. */
23527 /* There should not be any class definitions in progress at this
23528 point; the bodies of members are only parsed outside of all class
23529 definitions. */
23531 /* While we're parsing the member functions we might encounter more
23532 classes. We want to handle them right away, but we don't want
23533 them getting mixed up with functions that are currently in the
23534 queue. */
23537 /* Make sure that any template parameters are in scope. */
23540 /* If the body of the function has not yet been parsed, parse it
23541 now. */
23543 {
23544 tree function_scope;
23547 /* The function is no longer pending; we are processing it. */
23552 /* If this is a local class, enter the scope of the containing
23553 function. */
23558 /* Push the body of the function onto the lexer stack. */
23561 /* Let the front end know that we going to be defining this
23562 function. */
23566 /* Don't do access checking if it is a templated function. */
23570 /* #pragma omp declare reduction needs special parsing. */
23572 {
23577 }
23578 else
23579 /* Now, parse the body of the function. */
23586 /* Leave the scope of the containing function. */
23590 }
23592 /* Remove any template parameters from the symbol table. */
23595 /* Restore the queue. */
23598 }
23600 /* If DECL contains any default args, remember it on the unparsed
23601 functions queue. */
23603 static void
23605 {
23606 tree probe;
23609 probe;
23612 {
23616 }
23617 }
23619 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23620 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23621 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23622 from the parameter-type-list. */
23624 static tree
23627 {
23629 tree parsed_arg;
23635 /* Push the saved tokens for the default argument onto the parser's
23636 lexer stack. */
23642 /* Parse the default argument. */
23653 {
23654 /* In a non-template class, check conversions now. In a template,
23655 we'll wait and instantiate these as needed. */
23658 tf_warning_or_error);
23659 else
23660 {
23667 /* This represents the whole initialization. */
23669 }
23670 }
23672 /* If the token stream has not been completely used up, then
23673 there was extra junk after the end of the default
23674 argument. */
23676 {
23679 else
23681 }
23683 /* Revert to the main lexer. */
23687 }
23689 /* FIELD is a non-static data member with an initializer which we saved for
23690 later; parse it now. */
23692 static void
23694 {
23695 tree def;
23702 NULL_TREE);
23708 }
23710 /* FN is a FUNCTION_DECL which may contains a parameter with an
23711 unparsed DEFAULT_ARG. Parse the default args now. This function
23712 assumes that the current scope is the scope in which the default
23713 argument should be processed. */
23715 static void
23717 {
23721 /* While we're parsing the default args, we might (due to the
23722 statement expression extension) encounter more classes. We want
23723 to handle them right away, but we don't want them getting mixed
23724 up with default args that are currently in the queue. */
23727 /* Local variable names (and the `this' keyword) may not appear
23728 in a default argument. */
23739 {
23741 tree parsed_arg;
23743 tree copy;
23750 /* This can happen for a friend declaration for a function
23751 already declared with default arguments. */
23754 parsed_arg
23756 default_arg,
23759 {
23761 }
23765 /* Update any instantiations we've already created. */
23769 }
23773 /* Make sure no default arg is missing. */
23776 /* Restore the state of local_variables_forbidden_p. */
23779 /* Restore the queue. */
23781 }
23783 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23785 sizeof ... ( identifier )
23787 where the 'sizeof' token has already been consumed. */
23789 static tree
23791 {
23792 /* Consume the `...'. */
23799 else
23807 /* The name is not qualified. */
23825 }
23827 /* Parse the operand of `sizeof' (or a similar operator). Returns
23828 either a TYPE or an expression, depending on the form of the
23829 input. The KEYWORD indicates which kind of expression we have
23830 encountered. */
23832 static tree
23834 {
23841 /* If it's a `...', then we are computing the length of a parameter
23842 pack. */
23847 /* Types cannot be defined in a `sizeof' expression. Save away the
23848 old message. */
23850 /* And create the new one. */
23856 /* The restrictions on constant-expressions do not apply inside
23857 sizeof expressions. */
23858 saved_integral_constant_expression_p
23860 saved_non_integral_constant_expression_p
23864 /* Do not actually evaluate the expression. */
23867 /* If it's a `(', then we might be looking at the type-id
23868 construction. */
23870 {
23874 /* We can't be sure yet whether we're looking at a type-id or an
23875 expression. */
23877 /* Consume the `('. */
23879 /* Note: as a GNU Extension, compound literals are considered
23880 postfix-expressions as they are in C99, so they are valid
23881 arguments to sizeof. See comment in cp_parser_cast_expression
23882 for details. */
23884 /* Skip tokens until the next token is a closing parenthesis.
23885 If we find the closing `)', and the next token is a `{', then
23886 we are looking at a compound-literal. */
23887 compound_literal_p
23891 /* Roll back the tokens we skipped. */
23893 /* If we were looking at a compound-literal, simulate an error
23894 so that the call to cp_parser_parse_definitely below will
23895 fail. */
23898 else
23899 {
23902 /* Look for the type-id. */
23904 /* Look for the closing `)'. */
23907 }
23909 /* If all went well, then we're done. */
23911 {
23912 cp_decl_specifier_seq decl_specs;
23914 /* Build a trivial decl-specifier-seq. */
23918 /* Call grokdeclarator to figure out what type this is. */
23921 TYPENAME,
23924 }
23925 }
23927 /* If the type-id production did not work out, then we must be
23928 looking at the unary-expression production. */
23933 /* Go back to evaluating expressions. */
23937 /* Free the message we created. */
23939 /* And restore the old one. */
23941 parser->integral_constant_expression_p
23943 parser->non_integral_constant_expression_p
23947 }
23949 /* If the current declaration has no declarator, return true. */
23951 static bool
23953 {
23954 /* If the next token is a `;' or a `,' then there is no
23955 declarator. */
23958 }
23960 /* Update the DECL_SPECS to reflect the storage class indicated by
23961 KEYWORD. */
23963 static void
23968 {
23969 cp_storage_class storage_class;
23972 {
23976 }
23978 {
23981 }
23986 {
23989 }
23992 {
24010 }
24014 /* A storage class specifier cannot be applied alongside a typedef
24015 specifier. If there is a typedef specifier present then set
24016 conflicting_specifiers_p which will trigger an error later
24017 on in grokdeclarator. */
24020 }
24022 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24023 is true, the type is a class or enum definition. */
24025 static void
24027 tree type_spec,
24030 {
24033 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24034 (with, for example, in "typedef int wchar_t;") we remember that
24035 this is what happened. In system headers, we ignore these
24036 declarations so that G++ can work with system headers that are not
24037 C++-safe. */
24039 && !type_definition_p
24049 {
24052 ds_redefined_builtin_type_spec,
24053 token);
24055 {
24059 }
24060 }
24063 else
24064 {
24069 }
24070 }
24072 /* True iff TOKEN is the GNU keyword __thread. */
24074 static bool
24076 {
24079 }
24081 /* Set the location for a declarator specifier and check if it is
24082 duplicated.
24084 DECL_SPECS is the sequence of declarator specifiers onto which to
24085 set the location.
24087 DS is the single declarator specifier to set which location is to
24088 be set onto the existing sequence of declarators.
24090 LOCATION is the location for the declarator specifier to
24091 consider. */
24093 static void
24096 {
24105 {
24109 }
24110 else
24111 {
24113 {
24117 else
24118 {
24121 OPT_Wlong_long,
24123 }
24124 }
24126 {
24131 else
24133 }
24134 else
24135 {
24151 "__complex"
24152 };
24155 }
24156 }
24157 }
24159 /* Return true iff the declarator specifier DS is present in the
24160 sequence of declarator specifiers DECL_SPECS. */
24162 bool
24164 cp_decl_spec ds)
24165 {
24172 }
24174 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24175 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24177 static bool
24179 {
24181 }
24183 /* Issue an error message indicating that TOKEN_DESC was expected.
24184 If KEYWORD is true, it indicated this function is called by
24185 cp_parser_require_keword and the required token can only be
24186 a indicated keyword. */
24188 static void
24190 required_token token_desc,
24192 {
24194 {
24263 }
24265 {
24267 {
24346 }
24347 }
24348 else
24350 }
24354 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24355 issue an error message indicating that TOKEN_DESC was expected.
24357 Returns the token consumed, if the token had the appropriate type.
24358 Otherwise, returns NULL. */
24363 required_token token_desc)
24364 {
24367 else
24368 {
24369 /* Output the MESSAGE -- unless we're parsing tentatively. */
24373 }
24374 }
24376 /* An error message is produced if the next token is not '>'.
24377 All further tokens are skipped until the desired token is
24378 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24380 static void
24382 {
24383 /* Current level of '< ... >'. */
24385 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24388 /* Are we ready, yet? If not, issue error message. */
24392 /* Skip tokens until the desired token is found. */
24394 {
24395 /* Peek at the next token. */
24397 {
24405 /* C++0x views the `>>' operator as two `>' tokens, but
24406 C++98 does not. */
24409 {
24410 /* We've hit a `>>' where the first `>' closes the
24411 template argument list, and the second `>' is
24412 spurious. Just consume the `>>' and stop; we've
24413 already produced at least one error. */
24416 }
24417 /* Fall through for C++0x, so we handle the second `>' in
24418 the `>>'. */
24422 {
24423 /* We've reached the token we want, consume it and stop. */
24426 }
24445 /* The '>' was probably forgotten, don't look further. */
24450 }
24452 /* Consume this token. */
24454 }
24455 }
24457 /* If the next token is the indicated keyword, consume it. Otherwise,
24458 issue an error message indicating that TOKEN_DESC was expected.
24460 Returns the token consumed, if the token had the appropriate type.
24461 Otherwise, returns NULL. */
24466 required_token token_desc)
24467 {
24471 {
24474 }
24477 }
24479 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24480 function-definition. */
24482 static bool
24484 {
24487 /* A ctor-initializer begins with a `:'. */
24489 /* A function-try-block begins with `try'. */
24491 /* A function-transaction-block begins with `__transaction_atomic'
24492 or `__transaction_relaxed'. */
24495 /* The named return value extension begins with `return'. */
24497 }
24499 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24500 definition. */
24502 static bool
24504 {
24511 }
24513 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24514 C++0x) ending a template-argument. */
24516 static bool
24518 {
24526 }
24528 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24529 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24531 static bool
24534 {
24540 /* Check for the sequence `<::' in the original code. It would be lexed as
24541 `[:', where `[' is a digraph, and there is no whitespace before
24542 `:'. */
24544 {
24549 }
24551 }
24553 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24554 or none_type otherwise. */
24556 static enum tag_types
24558 {
24560 {
24570 }
24571 }
24573 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24575 static void
24577 {
24581 {
24585 type))
24588 }
24589 }
24591 /* Issue an error message if DECL is redeclared with different
24592 access than its original declaration [class.access.spec/3].
24593 This applies to nested classes and nested class templates.
24594 [class.mem/1]. */
24596 static void
24598 {
24607 }
24609 /* Look for the `template' keyword, as a syntactic disambiguator.
24610 Return TRUE iff it is present, in which case it will be
24611 consumed. */
24613 static bool
24615 {
24617 {
24618 /* In C++98 the `template' keyword can only be used within templates;
24619 outside templates the parser can always figure out what is a
24620 template and what is not. In C++11, per the resolution of DR 468,
24621 `template' is allowed in cases where it is not strictly necessary. */
24624 {
24627 "in C++98 %<template%> (as a disambiguator) is only "
24629 /* If this part of the token stream is rescanned, the same
24630 error message would be generated. So, we purge the token
24631 from the stream. */
24634 }
24635 else
24636 {
24637 /* Consume the `template' keyword. */
24640 }
24641 }
24643 }
24645 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24646 set PARSER->SCOPE, and perform other related actions. */
24648 static void
24650 {
24656 /* Get the stored value. */
24658 /* Perform any access checks that were deferred. */
24661 {
24666 }
24667 /* Set the scope from the stored value. */
24671 }
24673 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24674 encounter the end of a block before what we were looking for. */
24676 static bool
24680 {
24682 {
24685 /* Abort a parenthesized expression if we encounter a semicolon. */
24689 /* If we've reached the end of the file, stop. */
24695 /* We've hit the end of an enclosing block, so there's been some
24696 kind of syntax error. */
24699 /* Consume the token. */
24701 /* See if it starts a new group. */
24703 {
24705 /* In theory this should probably check end == '}', but
24706 cp_parser_save_member_function_body needs it to exit
24707 after either '}' or ')' when called with ')'. */
24710 }
24712 {
24716 }
24721 }
24722 }
24724 /* Like above, for caching a default argument or NSDMI. Both of these are
24725 terminated by a non-nested comma, but it can be unclear whether or not a
24726 comma is nested in a template argument list unless we do more parsing.
24727 In order to handle this ambiguity, when we encounter a ',' after a '<'
24728 we try to parse what follows as a parameter-declaration-list (in the
24729 case of a default argument) or a member-declarator (in the case of an
24730 NSDMI). If that succeeds, then we stop caching. */
24732 static tree
24734 {
24739 tree default_argument;
24741 /* Add tokens until we have processed the entire default
24742 argument. We add the range [first_token, token). */
24745 {
24746 /* For list-initialization, this is straightforward. */
24749 }
24751 {
24754 /* Peek at the next token. */
24756 /* What we do depends on what token we have. */
24758 {
24759 /* In valid code, a default argument must be
24760 immediately followed by a `,' `)', or `...'. */
24763 {
24764 /* If we've seen a '<', we might be in a
24765 template-argument-list. Until Core issue 325 is
24766 resolved, we don't know how this situation ought
24767 to be handled, so try to DTRT. We check whether
24768 what comes after the comma is a valid parameter
24769 declaration list. If it is, then the comma ends
24770 the default argument; otherwise the default
24771 argument continues. */
24774 /* Set ITALP so cp_parser_parameter_declaration_list
24775 doesn't decide to commit to this parse. */
24783 {
24789 }
24790 else
24791 {
24795 }
24802 }
24805 /* If we run into a non-nested `;', `}', or `]',
24806 then the code is invalid -- but the default
24807 argument is certainly over. */
24812 /* Handle correctly int n = sizeof ... ( p ); */
24815 /* Update DEPTH, if necessary. */
24830 /* This might be the comparison operator, or it might
24831 start a template argument list. */
24838 /* Fall through for C++0x, which treats the `>>'
24839 operator like two `>' tokens in certain
24840 cases. */
24844 {
24845 /* This might be an operator, or it might close a
24846 template argument list. But if a previous '<'
24847 started a template argument list, this will have
24848 closed it, so we can't be in one anymore. */
24852 }
24855 /* If we run out of tokens, issue an error message. */
24864 /* In these cases, we should look for template-ids.
24865 For example, if the default argument is
24866 `X<int, double>()', we need to do name lookup to
24867 figure out whether or not `X' is a template; if
24868 so, the `,' does not end the default argument.
24870 That is not yet done. */
24875 }
24877 /* If we've reached the end, stop. */
24881 /* Add the token to the token block. */
24883 }
24885 /* Create a DEFAULT_ARG to represent the unparsed default
24886 argument. */
24893 }
24895 /* Begin parsing tentatively. We always save tokens while parsing
24896 tentatively so that if the tentative parsing fails we can restore the
24897 tokens. */
24899 static void
24901 {
24902 /* Enter a new parsing context. */
24904 /* Begin saving tokens. */
24906 /* In order to avoid repetitive access control error messages,
24907 access checks are queued up until we are no longer parsing
24908 tentatively. */
24910 }
24912 /* Commit to the currently active tentative parse. */
24914 static void
24916 {
24920 /* Mark all of the levels as committed. */
24923 {
24930 }
24931 }
24933 /* Commit to the topmost currently active tentative parse.
24935 Note that this function shouldn't be called when there are
24936 irreversible side-effects while in a tentative state. For
24937 example, we shouldn't create a permanent entry in the symbol
24938 table, or issue an error message that might not apply if the
24939 tentative parse is aborted. */
24941 static void
24943 {
24948 {
24956 }
24957 }
24959 /* Abort the currently active tentative parse. All consumed tokens
24960 will be rolled back, and no diagnostics will be issued. */
24962 static void
24964 {
24968 /* Now, pretend that we want to see if the construct was
24969 successfully parsed. */
24971 }
24973 /* Stop parsing tentatively. If a parse error has occurred, restore the
24974 token stream. Otherwise, commit to the tokens we have consumed.
24975 Returns true if no error occurred; false otherwise. */
24977 static bool
24979 {
24983 /* Remember whether or not an error occurred, since we are about to
24984 destroy that information. */
24986 /* Remove the topmost context from the stack. */
24989 /* If no parse errors occurred, commit to the tentative parse. */
24991 {
24992 /* Commit to the tokens read tentatively, unless that was
24993 already done. */
24998 }
24999 /* Otherwise, if errors occurred, roll back our state so that things
25000 are just as they were before we began the tentative parse. */
25001 else
25002 {
25005 }
25006 /* Add the context to the front of the free list. */
25011 }
25013 /* Returns true if we are parsing tentatively and are not committed to
25014 this tentative parse. */
25016 static bool
25018 {
25021 }
25023 /* Returns nonzero iff an error has occurred during the most recent
25024 tentative parse. */
25026 static bool
25028 {
25031 }
25033 /* Returns nonzero if GNU extensions are allowed. */
25035 static bool
25037 {
25039 }
25040 \f
25041 /* Objective-C++ Productions */
25044 /* Parse an Objective-C expression, which feeds into a primary-expression
25045 above.
25047 objc-expression:
25048 objc-message-expression
25049 objc-string-literal
25050 objc-encode-expression
25051 objc-protocol-expression
25052 objc-selector-expression
25054 Returns a tree representation of the expression. */
25056 static tree
25058 {
25059 /* Try to figure out what kind of declaration is present. */
25063 {
25073 {
25085 }
25091 }
25094 }
25096 /* Parse an Objective-C message expression.
25098 objc-message-expression:
25099 [ objc-message-receiver objc-message-args ]
25101 Returns a representation of an Objective-C message. */
25103 static tree
25105 {
25114 }
25116 /* Parse an objc-message-receiver.
25118 objc-message-receiver:
25119 expression
25120 simple-type-specifier
25122 Returns a representation of the type or expression. */
25124 static tree
25126 {
25127 tree rcv;
25129 /* An Objective-C message receiver may be either (1) a type
25130 or (2) an expression. */
25139 CP_PARSER_FLAGS_NONE);
25142 }
25144 /* Parse the arguments and selectors comprising an Objective-C message.
25146 objc-message-args:
25147 objc-selector
25148 objc-selector-args
25149 objc-selector-args , objc-comma-args
25151 objc-selector-args:
25152 objc-selector [opt] : assignment-expression
25153 objc-selector-args objc-selector [opt] : assignment-expression
25155 objc-comma-args:
25156 assignment-expression
25157 objc-comma-args , assignment-expression
25159 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25160 selector arguments and TREE_VALUE containing a list of comma
25161 arguments. */
25163 static tree
25165 {
25171 {
25177 /* Detect if we have a unary selector. */
25186 sel_args
25191 }
25193 /* Handle non-selector arguments, if any. */
25195 {
25196 tree arg;
25201 addl_args
25206 }
25209 {
25212 }
25215 }
25217 /* Parse an Objective-C encode expression.
25219 objc-encode-expression:
25220 @encode objc-typename
25222 Returns an encoded representation of the type argument. */
25224 static tree
25226 {
25227 tree type;
25237 {
25241 }
25243 /* This happens if we find @encode(T) (where T is a template
25244 typename or something dependent on a template typename) when
25245 parsing a template. In that case, we can't compile it
25246 immediately, but we rather create an AT_ENCODE_EXPR which will
25247 need to be instantiated when the template is used.
25248 */
25250 {
25254 }
25257 }
25259 /* Parse an Objective-C @defs expression. */
25261 static tree
25263 {
25264 tree name;
25272 }
25274 /* Parse an Objective-C protocol expression.
25276 objc-protocol-expression:
25277 @protocol ( identifier )
25279 Returns a representation of the protocol expression. */
25281 static tree
25283 {
25284 tree proto;
25292 }
25294 /* Parse an Objective-C selector expression.
25296 objc-selector-expression:
25297 @selector ( objc-method-signature )
25299 objc-method-signature:
25300 objc-selector
25301 objc-selector-seq
25303 objc-selector-seq:
25304 objc-selector :
25305 objc-selector-seq objc-selector :
25307 Returns a representation of the method selector. */
25309 static tree
25311 {
25323 {
25332 {
25333 /* Detect if we have a unary selector. */
25335 {
25338 }
25339 else
25340 {
25342 }
25343 }
25348 {
25349 sel_seq
25352 sel_seq
25355 }
25356 else
25357 sel_seq
25362 }
25364 finish_selector:
25368 }
25370 /* Parse a list of identifiers.
25372 objc-identifier-list:
25373 identifier
25374 objc-identifier-list , identifier
25376 Returns a TREE_LIST of identifier nodes. */
25378 static tree
25380 {
25381 tree identifier;
25382 tree list;
25393 {
25400 identifier));
25402 }
25405 }
25407 /* Parse an Objective-C alias declaration.
25409 objc-alias-declaration:
25410 @compatibility_alias identifier identifier ;
25412 This function registers the alias mapping with the Objective-C front end.
25413 It returns nothing. */
25415 static void
25417 {
25425 }
25427 /* Parse an Objective-C class forward-declaration.
25429 objc-class-declaration:
25430 @class objc-identifier-list ;
25432 The function registers the forward declarations with the Objective-C
25433 front end. It returns nothing. */
25435 static void
25437 {
25440 {
25441 tree id;
25451 else
25453 }
25455 }
25457 /* Parse a list of Objective-C protocol references.
25459 objc-protocol-refs-opt:
25460 objc-protocol-refs [opt]
25462 objc-protocol-refs:
25463 < objc-identifier-list >
25465 Returns a TREE_LIST of identifiers, if any. */
25467 static tree
25469 {
25473 {
25477 }
25480 }
25482 /* Parse a Objective-C visibility specification. */
25484 static void
25486 {
25490 {
25505 }
25507 /* Eat '@private'/'@protected'/'@public'. */
25509 }
25511 /* Parse an Objective-C method type. Return 'true' if it is a class
25512 (+) method, and 'false' if it is an instance (-) method. */
25516 {
25519 else
25521 }
25523 /* Parse an Objective-C protocol qualifier. */
25525 static tree
25527 {
25540 {
25545 }
25548 }
25550 /* Parse an Objective-C typename. */
25552 static tree
25554 {
25558 {
25564 /* An ObjC type name may consist of just protocol qualifiers, in which
25565 case the type shall default to 'id'. */
25567 {
25570 /* If the type could not be parsed, an error has already
25571 been produced. For error recovery, behave as if it had
25572 not been specified, which will use the default type
25573 'id'. */
25575 {
25577 /* We need to skip to the closing parenthesis as
25578 cp_parser_type_id() does not seem to do it for
25579 us. */
25584 }
25585 }
25589 }
25592 }
25594 /* Check to see if TYPE refers to an Objective-C selector name. */
25596 static bool
25598 {
25604 }
25606 /* Parse an Objective-C selector. */
25608 static tree
25610 {
25614 {
25617 }
25619 /* C++ operator names are allowed to appear in ObjC selectors. */
25621 {
25634 }
25635 }
25637 /* Parse an Objective-C params list. */
25639 static tree
25641 {
25647 {
25657 /* Detect if we have a unary selector. */
25660 {
25663 }
25667 {
25668 /* Something went quite wrong. There should be a colon
25669 here, but there is not. Stop parsing parameters. */
25671 }
25673 /* New ObjC allows attributes on parameters too. */
25678 params
25681 type_name,
25682 identifier,
25683 parm_attr));
25686 }
25689 {
25692 }
25694 /* We allow tail attributes for the method. */
25696 {
25704 }
25707 {
25710 }
25712 }
25714 /* Parse the non-keyword Objective-C params. */
25716 static tree
25719 {
25725 {
25727 tree parm;
25733 {
25738 }
25740 /* TODO: parse attributes for tail parameters. */
25749 }
25751 /* We allow tail attributes for the method. */
25753 {
25755 {
25760 }
25761 else
25762 /* We have an error, but parse the attributes, so that we can
25763 carry on. */
25769 }
25772 }
25774 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25776 static void
25778 {
25781 /* If the next token is `extern' and the following token is a string
25782 literal, then we have a linkage specification. */
25784 && cp_parser_is_pure_string_literal
25787 /* Handle #pragma, if any. */
25790 /* Allow stray semicolons. */
25793 /* Mark methods as optional or required, when building protocols. */
25795 {
25798 }
25800 {
25803 }
25806 /* Other stray characters must generate errors. */
25808 {
25812 }
25813 /* Finally, try to parse a block-declaration, or a function-definition. */
25814 else
25816 }
25818 /* Parse a method signature. */
25820 static tree
25822 {
25838 }
25840 static bool
25842 {
25843 tree tattr;
25848 /* If the attributes are followed by a method introducer, this is not allowed.
25849 Dump the attributes and flag the situation. */
25854 /* Otherwise, the attributes introduce some interstitial code, possibly so
25855 rewind to allow that check. */
25858 }
25860 /* Parse an Objective-C method prototype list. */
25862 static void
25864 {
25868 {
25870 {
25875 else
25879 {
25883 }
25886 }
25892 OPT_Wattributes,
25894 else
25895 /* Allow for interspersed non-ObjC++ code. */
25899 }
25903 else
25907 }
25909 /* Parse an Objective-C method definition list. */
25911 static void
25913 {
25917 {
25918 tree meth;
25921 {
25927 else
25932 {
25936 }
25938 NULL_TREE);
25940 /* For historical reasons, we accept an optional semicolon. */
25947 {
25954 }
25955 }
25956 /* The following case will be removed once @synthesize is
25957 completely implemented. */
25968 else
25969 /* Allow for interspersed non-ObjC++ code. */
25973 }
25977 else
25981 }
25983 /* Parse Objective-C ivars. */
25985 static void
25987 {
25998 {
25999 cp_decl_specifier_seq declspecs;
26001 tree prefix_attributes;
26009 CP_PARSER_FLAGS_OPTIONAL,
26013 /* auto, register, static, extern, mutable. */
26015 {
26018 }
26020 /* thread_local. */
26022 {
26025 }
26027 /* typedef. */
26029 {
26032 }
26037 /* Keep going until we hit the `;' at the end of the
26038 declaration. */
26040 {
26045 /* Check for a (possibly unnamed) bitfield declaration. */
26053 {
26054 /* Get the name of the bitfield. */
26057 sfk_none);
26059 eat_colon:
26061 /* Get the width of the bitfield. */
26062 width
26065 NULL);
26066 }
26067 else
26068 {
26069 /* Parse the declarator. */
26070 declarator
26075 }
26077 /* Look for attributes that apply to the ivar. */
26079 /* Remember which attributes are prefix attributes and
26080 which are not. */
26082 /* Combine the attributes. */
26086 /* Create the bitfield declaration. */
26088 width,
26089 attributes);
26090 else
26095 /* Add the instance variable. */
26099 /* Reset PREFIX_ATTRIBUTES. */
26108 {
26111 }
26113 }
26117 }
26122 /* Do not consume the RID_AT_END, so it will be read again as terminating
26123 the @interface of @implementation. */
26127 /* For historical reasons, we accept an optional semicolon. */
26130 }
26132 /* Parse an Objective-C protocol declaration. */
26134 static void
26136 {
26142 {
26147 }
26149 /* See if we have a forward declaration or a definition. */
26152 /* Try a forward declaration first. */
26154 {
26156 {
26157 tree id;
26167 else
26169 }
26171 }
26173 /* Ok, we got a full-fledged definition (or at least should). */
26174 else
26175 {
26180 }
26181 }
26183 /* Parse an Objective-C superclass or category. */
26185 static void
26190 {
26196 {
26199 }
26201 {
26204 /* If there is no category name, and this is an @interface, we
26205 have a class extension. */
26207 {
26210 }
26211 else
26215 }
26216 }
26218 /* Parse an Objective-C class interface. */
26220 static void
26222 {
26229 {
26230 /* It's hard to recover because even if valid @interface stuff
26231 is to follow, we can't compile it (or validate it) if we
26232 don't even know which class it refers to. Let's assume this
26233 was a stray '@interface' token in the stream and skip it.
26234 */
26236 }
26241 /* We have either a class or a category on our hands. */
26244 else
26245 {
26247 /* Handle instance variable declarations, if any. */
26250 }
26253 }
26255 /* Parse an Objective-C class implementation. */
26257 static void
26259 {
26266 {
26267 /* It's hard to recover because even if valid @implementation
26268 stuff is to follow, we can't compile it (or validate it) if
26269 we don't even know which class it refers to. Let's assume
26270 this was a stray '@implementation' token in the stream and
26271 skip it.
26272 */
26274 }
26278 /* We have either a class or a category on our hands. */
26281 else
26282 {
26284 /* Handle instance variable declarations, if any. */
26287 }
26290 }
26292 /* Consume the @end token and finish off the implementation. */
26294 static void
26296 {
26299 }
26301 /* Parse an Objective-C declaration. */
26303 static void
26305 {
26306 /* Try to figure out what kind of declaration is present. */
26311 {
26327 }
26330 {
26353 }
26354 }
26356 /* Parse an Objective-C try-catch-finally statement.
26358 objc-try-catch-finally-stmt:
26359 @try compound-statement objc-catch-clause-seq [opt]
26360 objc-finally-clause [opt]
26362 objc-catch-clause-seq:
26363 objc-catch-clause objc-catch-clause-seq [opt]
26365 objc-catch-clause:
26366 @catch ( objc-exception-declaration ) compound-statement
26368 objc-finally-clause:
26369 @finally compound-statement
26371 objc-exception-declaration:
26372 parameter-declaration
26373 '...'
26375 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26377 Returns NULL_TREE.
26379 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26380 for C. Keep them in sync. */
26382 static tree
26384 {
26385 location_t location;
26386 tree stmt;
26391 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26392 node, lest it get absorbed into the surrounding block. */
26398 {
26407 {
26408 /* We have "@catch (...)" (where the '...' are literally
26409 what is in the code). Skip the '...'.
26410 parameter_declaration is set to NULL_TREE, and
26411 objc_being_catch_clauses() knows that that means
26412 '...'. */
26415 }
26416 else
26417 {
26418 /* We have "@catch (NSException *exception)" or something
26419 like that. Parse the parameter declaration. */
26423 else
26428 }
26431 else
26432 {
26433 /* If there was no open parenthesis, we are recovering from
26434 an error, and we are trying to figure out what mistake
26435 the user has made. */
26437 /* If there is an immediate closing parenthesis, the user
26438 probably forgot the opening one (ie, they typed "@catch
26439 NSException *e)". Parse the closing parenthesis and keep
26440 going. */
26444 /* If these is no immediate closing parenthesis, the user
26445 probably doesn't know that parenthesis are required at
26446 all (ie, they typed "@catch NSException *e"). So, just
26447 forget about the closing parenthesis and keep going. */
26448 }
26452 }
26454 {
26457 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26458 node, lest it get absorbed into the surrounding block. */
26462 }
26465 }
26467 /* Parse an Objective-C synchronized statement.
26469 objc-synchronized-stmt:
26470 @synchronized ( expression ) compound-statement
26472 Returns NULL_TREE. */
26474 static tree
26476 {
26477 location_t location;
26488 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26489 node, lest it get absorbed into the surrounding block. */
26494 }
26496 /* Parse an Objective-C throw statement.
26498 objc-throw-stmt:
26499 @throw assignment-expression [opt] ;
26501 Returns a constructed '@throw' statement. */
26503 static tree
26505 {
26517 }
26519 /* Parse an Objective-C statement. */
26521 static tree
26523 {
26524 /* Try to figure out what kind of declaration is present. */
26528 {
26539 }
26542 }
26544 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26545 look ahead to see if an objc keyword follows the attributes. This
26546 is to detect the use of prefix attributes on ObjC @interface and
26547 @protocol. */
26549 static bool
26551 {
26556 {
26559 }
26562 }
26564 /* This routine is a minimal replacement for
26565 c_parser_struct_declaration () used when parsing the list of
26566 types/names or ObjC++ properties. For example, when parsing the
26567 code
26569 @property (readonly) int a, b, c;
26571 this function is responsible for parsing "int a, int b, int c" and
26572 returning the declarations as CHAIN of DECLs.
26574 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26575 similar parsing. */
26576 static tree
26578 {
26580 cp_decl_specifier_seq declspecs;
26582 tree prefix_attributes;
26585 CP_PARSER_FLAGS_NONE,
26592 /* auto, register, static, extern, mutable. */
26594 {
26597 }
26599 /* thread_local. */
26601 {
26604 }
26606 /* typedef. */
26608 {
26611 }
26616 /* Keep going until we hit the `;' at the end of the declaration. */
26618 {
26623 /* Parse the declarator. */
26627 /* Look for attributes that apply to the ivar. */
26629 /* Remember which attributes are prefix attributes and
26630 which are not. */
26632 /* Combine the attributes. */
26642 /* Reset PREFIX_ATTRIBUTES. */
26653 {
26656 }
26657 else
26659 }
26661 }
26663 /* Parse an Objective-C @property declaration. The syntax is:
26665 objc-property-declaration:
26666 '@property' objc-property-attributes[opt] struct-declaration ;
26668 objc-property-attributes:
26669 '(' objc-property-attribute-list ')'
26671 objc-property-attribute-list:
26672 objc-property-attribute
26673 objc-property-attribute-list, objc-property-attribute
26675 objc-property-attribute
26676 'getter' = identifier
26677 'setter' = identifier
26678 'readonly'
26679 'readwrite'
26680 'assign'
26681 'retain'
26682 'copy'
26683 'nonatomic'
26685 For example:
26686 @property NSString *name;
26687 @property (readonly) id object;
26688 @property (retain, nonatomic, getter=getTheName) id name;
26689 @property int a, b, c;
26691 PS: This function is identical to
26692 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26693 static void
26695 {
26696 /* The following variables hold the attributes of the properties as
26697 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26698 seen. When we see an attribute, we set them to 'true' (if they
26699 are boolean properties) or to the identifier (if they have an
26700 argument, ie, for getter and setter). Note that here we only
26701 parse the list of attributes, check the syntax and accumulate the
26702 attributes that we find. objc_add_property_declaration() will
26703 then process the information. */
26713 /* 'properties' is the list of properties that we read. Usually a
26714 single one, but maybe more (eg, in "@property int a, b, c;" there
26715 are three). */
26716 tree properties;
26717 location_t loc;
26723 /* Parse the optional attribute list... */
26725 {
26726 /* Eat the '('. */
26730 {
26736 {
26739 }
26743 {
26754 {
26758 else
26763 }
26766 {
26770 }
26772 {
26774 {
26777 }
26778 else
26782 else
26784 }
26785 else
26786 {
26788 {
26791 }
26792 else
26794 }
26800 }
26807 else
26809 }
26811 /* FIXME: "@property (setter, assign);" will generate a spurious
26812 "error: expected ‘)’ before ‘,’ token". This is because
26813 cp_parser_require, unlike the C counterpart, will produce an
26814 error even if we are in error recovery. */
26816 {
26821 }
26822 }
26824 /* ... and the property declaration(s). */
26828 {
26830 /* If the next token is now a `;', consume it. */
26834 }
26838 else
26839 {
26840 /* Comma-separated properties are chained together in
26841 reverse order; add them one by one. */
26850 }
26853 }
26855 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26857 objc-synthesize-declaration:
26858 @synthesize objc-synthesize-identifier-list ;
26860 objc-synthesize-identifier-list:
26861 objc-synthesize-identifier
26862 objc-synthesize-identifier-list, objc-synthesize-identifier
26864 objc-synthesize-identifier
26865 identifier
26866 identifier = identifier
26868 For example:
26869 @synthesize MyProperty;
26870 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26872 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26873 for C. Keep them in sync.
26874 */
26875 static void
26877 {
26879 location_t loc;
26884 {
26888 {
26891 }
26893 {
26897 {
26900 }
26901 }
26902 else
26907 else
26909 }
26912 }
26914 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26916 objc-dynamic-declaration:
26917 @dynamic identifier-list ;
26919 For example:
26920 @dynamic MyProperty;
26921 @dynamic MyProperty, AnotherProperty;
26923 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26924 for C. Keep them in sync.
26925 */
26926 static void
26928 {
26930 location_t loc;
26935 {
26936 tree property;
26939 {
26942 }
26946 else
26948 }
26951 }
26953 \f
26954 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26956 /* Returns name of the next clause.
26957 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26958 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26959 returned and the token is consumed. */
26961 static pragma_omp_clause
26963 {
26975 {
26980 {
27083 }
27084 }
27090 }
27092 /* Validate that a clause of the given type does not already exist. */
27094 static void
27097 {
27098 tree c;
27102 {
27105 }
27106 }
27108 /* OpenMP 2.5:
27109 variable-list:
27110 identifier
27111 variable-list , identifier
27113 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27114 colon). An opening parenthesis will have been consumed by the caller.
27116 If KIND is nonzero, create the appropriate node and install the decl
27117 in OMP_CLAUSE_DECL and add the node to the head of the list.
27119 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27120 return the list created.
27122 COLON can be NULL if only closing parenthesis should end the list,
27123 or pointer to bool which will receive false if the list is terminated
27124 by closing parenthesis or true if the list is terminated by colon. */
27126 static tree
27129 {
27133 {
27136 }
27138 {
27155 {
27157 {
27163 {
27170 NULL);
27172 parser->colon_corrects_to_scope_p
27176 else
27177 {
27178 /* Look for `:'. */
27182 CPP_CLOSE_SQUARE))
27185 NULL);
27186 }
27187 /* Look for the closing `]'. */
27189 RT_CLOSE_SQUARE))
27192 }
27196 }
27202 }
27203 else
27206 get_comma:
27210 }
27216 {
27220 }
27223 {
27226 /* Try to resync to an unnested comma. Copied from
27227 cp_parser_parenthesized_expression_list. */
27228 skip_comma:
27237 }
27240 }
27242 /* Similarly, but expect leading and trailing parenthesis. This is a very
27243 common case for omp clauses. */
27245 static tree
27247 {
27251 }
27253 /* OpenMP 3.0:
27254 collapse ( constant-expression ) */
27256 static tree
27258 {
27260 location_t loc;
27261 HOST_WIDE_INT n;
27281 {
27284 }
27292 }
27294 /* OpenMP 2.5:
27295 default ( shared | none ) */
27297 static tree
27299 {
27301 tree c;
27306 {
27311 {
27326 }
27329 }
27330 else
27331 {
27332 invalid_kind:
27334 }
27350 }
27352 /* OpenMP 3.1:
27353 final ( expression ) */
27355 static tree
27357 {
27378 }
27380 /* OpenMP 2.5:
27381 if ( expression ) */
27383 static tree
27385 {
27406 }
27408 /* OpenMP 3.1:
27409 mergeable */
27411 static tree
27414 {
27415 tree c;
27418 location);
27423 }
27425 /* OpenMP 2.5:
27426 nowait */
27428 static tree
27431 {
27432 tree c;
27439 }
27441 /* OpenMP 2.5:
27442 num_threads ( expression ) */
27444 static tree
27446 location_t location)
27447 {
27469 }
27471 /* OpenMP 2.5:
27472 ordered */
27474 static tree
27477 {
27478 tree c;
27486 }
27488 /* OpenMP 2.5:
27489 reduction ( reduction-operator : variable-list )
27491 reduction-operator:
27492 One of: + * - & ^ | && ||
27494 OpenMP 3.1:
27496 reduction-operator:
27497 One of: + * - & ^ | && || min max
27499 OpenMP 4.0:
27501 reduction-operator:
27502 One of: + * - & ^ | && ||
27503 id-expression */
27505 static tree
27507 {
27515 {
27525 }
27529 else
27530 {
27541 {
27571 }
27572 else
27573 {
27575 resync_fail:
27580 }
27581 }
27587 NULL);
27589 {
27592 }
27595 }
27597 /* OpenMP 2.5:
27598 schedule ( schedule-kind )
27599 schedule ( schedule-kind , expression )
27601 schedule-kind:
27602 static | dynamic | guided | runtime | auto */
27604 static tree
27606 {
27615 {
27620 {
27641 }
27642 }
27647 else
27652 {
27667 else
27672 }
27680 invalid_kind:
27682 resync_fail:
27687 }
27689 /* OpenMP 3.0:
27690 untied */
27692 static tree
27695 {
27696 tree c;
27703 }
27705 /* OpenMP 4.0:
27706 inbranch
27707 notinbranch */
27709 static tree
27712 {
27717 }
27719 /* OpenMP 4.0:
27720 parallel
27721 for
27722 sections
27723 taskgroup */
27725 static tree
27729 {
27733 }
27735 /* OpenMP 4.0:
27736 num_teams ( expression ) */
27738 static tree
27740 location_t location)
27741 {
27763 }
27765 /* OpenMP 4.0:
27766 thread_limit ( expression ) */
27768 static tree
27770 location_t location)
27771 {
27793 }
27795 /* OpenMP 4.0:
27796 aligned ( variable-list )
27797 aligned ( variable-list : constant-expression ) */
27799 static tree
27801 {
27812 {
27822 }
27828 }
27830 /* OpenMP 4.0:
27831 linear ( variable-list )
27832 linear ( variable-list : expression ) */
27834 static tree
27837 {
27848 {
27852 {
27855 }
27863 }
27869 }
27871 /* OpenMP 4.0:
27872 safelen ( constant-expression ) */
27874 static tree
27876 location_t location)
27877 {
27898 }
27900 /* OpenMP 4.0:
27901 simdlen ( constant-expression ) */
27903 static tree
27905 location_t location)
27906 {
27927 }
27929 /* OpenMP 4.0:
27930 depend ( depend-kind : variable-list )
27932 depend-kind:
27933 in | out | inout */
27935 static tree
27937 {
27945 {
27955 else
27957 }
27958 else
27966 NULL);
27973 invalid_kind:
27975 resync_fail:
27980 }
27982 /* OpenMP 4.0:
27983 map ( map-kind : variable-list )
27984 map ( variable-list )
27986 map-kind:
27987 alloc | to | from | tofrom */
27989 static tree
27991 {
28000 {
28012 else
28013 {
28019 }
28022 }
28025 NULL);
28031 }
28033 /* OpenMP 4.0:
28034 device ( expression ) */
28036 static tree
28038 location_t location)
28039 {
28061 }
28063 /* OpenMP 4.0:
28064 dist_schedule ( static )
28065 dist_schedule ( static , expression ) */
28067 static tree
28069 location_t location)
28070 {
28083 {
28094 }
28099 location);
28103 invalid_kind:
28105 resync_fail:
28110 }
28112 /* OpenMP 4.0:
28113 proc_bind ( proc-bind-kind )
28115 proc-bind-kind:
28116 master | close | spread */
28118 static tree
28120 location_t location)
28121 {
28122 tree c;
28129 {
28139 else
28141 }
28142 else
28151 location);
28156 invalid_kind:
28158 resync_fail:
28163 }
28165 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28166 is a bitmask in MASK. Return the list of clauses found; the result
28167 of clause default goes in *pdefault. */
28169 static tree
28173 {
28180 {
28181 pragma_omp_clause c_kind;
28192 {
28204 clauses);
28218 clauses);
28227 clauses);
28251 clauses);
28265 clauses);
28282 OMP_CLAUSE_NOTINBRANCH,
28291 {
28292 clause_not_first:
28296 }
28321 clauses);
28326 clauses);
28331 clauses);
28394 }
28399 {
28400 /* Remove the invalid clause(s) from the list to avoid
28401 confusing the rest of the compiler. */
28404 }
28405 }
28406 saw_error:
28407 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28408 no reason to skip to the end. */
28414 }
28416 /* OpenMP 2.5:
28417 structured-block:
28418 statement
28420 In practice, we're also interested in adding the statement to an
28421 outer node. So it is convenient if we work around the fact that
28422 cp_parser_statement calls add_stmt. */
28424 static unsigned
28426 {
28429 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28430 This preserves the "not within loop or switch" style error messages
28431 for nonsense cases like
28432 void foo() {
28433 #pragma omp single
28434 break;
28435 }
28436 */
28441 }
28443 static void
28445 {
28447 }
28449 static tree
28451 {
28459 }
28461 /* OpenMP 2.5:
28462 # pragma omp atomic new-line
28463 expression-stmt
28465 expression-stmt:
28466 x binop= expr | x++ | ++x | x-- | --x
28467 binop:
28468 +, *, -, /, &, ^, |, <<, >>
28470 where x is an lvalue expression with scalar type.
28472 OpenMP 3.1:
28473 # pragma omp atomic new-line
28474 update-stmt
28476 # pragma omp atomic read new-line
28477 read-stmt
28479 # pragma omp atomic write new-line
28480 write-stmt
28482 # pragma omp atomic update new-line
28483 update-stmt
28485 # pragma omp atomic capture new-line
28486 capture-stmt
28488 # pragma omp atomic capture new-line
28489 capture-block
28491 read-stmt:
28492 v = x
28493 write-stmt:
28494 x = expr
28495 update-stmt:
28496 expression-stmt | x = x binop expr
28497 capture-stmt:
28498 v = expression-stmt
28499 capture-block:
28500 { v = x; update-stmt; } | { update-stmt; v = x; }
28502 OpenMP 4.0:
28503 update-stmt:
28504 expression-stmt | x = x binop expr | x = expr binop x
28505 capture-stmt:
28506 v = update-stmt
28507 capture-block:
28508 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28510 where x and v are lvalue expressions with scalar type. */
28512 static void
28514 {
28522 {
28534 else
28538 }
28541 {
28546 {
28549 }
28550 }
28554 {
28565 else
28571 {
28572 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28573 opcode. */
28578 }
28582 {
28585 }
28586 else
28587 {
28594 }
28597 }
28599 restart:
28604 {
28611 /* FALLTHROUGH */
28621 /* FALLTHROUGH */
28636 /* Undo effects of boolean_increment for post {in,de}crement. */
28638 /* FALLTHRU */
28642 {
28643 /* Undo effects of boolean_increment. */
28645 {
28646 /* This is pre or post increment. */
28651 && !structured_block
28655 }
28656 }
28657 /* FALLTHRU */
28660 {
28695 {
28699 }
28702 {
28708 {
28713 }
28715 {
28726 {
28728 {
28733 }
28734 else
28736 }
28740 }
28743 {
28750 }
28754 }
28758 {
28761 {
28769 }
28771 {
28776 }
28811 }
28822 /* FALLTHROUGH */
28827 }
28834 }
28835 stmt_done:
28837 {
28850 }
28852 {
28855 }
28856 done:
28862 saw_error:
28865 {
28869 {
28873 }
28874 }
28875 }
28878 /* OpenMP 2.5:
28879 # pragma omp barrier new-line */
28881 static void
28883 {
28886 }
28888 /* OpenMP 2.5:
28889 # pragma omp critical [(name)] new-line
28890 structured-block */
28892 static tree
28894 {
28898 {
28910 }
28915 }
28917 /* OpenMP 2.5:
28918 # pragma omp flush flush-vars[opt] new-line
28920 flush-vars:
28921 ( variable-list ) */
28923 static void
28925 {
28931 }
28933 /* Helper function, to parse omp for increment expression. */
28935 static tree
28937 {
28942 {
28945 }
28948 {
28957 /* Fall through: OpenMP disallows NE_EXPR. */
28960 }
28962 /* If decl is an iterator, preserve LHS and RHS of the relational
28963 expr until finish_omp_for. */
28973 }
28975 /* Helper function, to parse omp for increment expression. */
28977 static tree
28979 {
28983 cp_id_kind idk;
28987 {
28995 }
29003 {
29008 }
29015 {
29019 }
29031 do
29032 {
29039 {
29041 {
29044 else
29046 tf_warning_or_error);
29047 }
29048 else
29051 }
29052 }
29056 {
29060 }
29061 else
29065 }
29067 /* Parse the initialization statement of either an OpenMP for loop or
29068 a Cilk Plus for loop.
29070 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29071 Plus.
29073 Return true if the resulting construct should have an
29074 OMP_CLAUSE_PRIVATE added to it. */
29076 static bool
29084 {
29090 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29092 init-expr:
29093 var = lb
29094 integer-type var = lb
29095 random-access-iterator-type var = lb
29096 pointer-type var = lb
29097 */
29098 cp_decl_specifier_seq type_specifiers;
29100 /* First, try to parse as an initialized declaration. See
29101 cp_parser_condition, from whence the bulk of this is copied. */
29108 {
29109 /* If parsing a type specifier seq succeeded, then this
29110 MUST be a initialized declaration. */
29115 CP_PARSER_DECLARATOR_NAMED,
29125 else
29126 {
29136 {
29138 CPP_OPEN_PAREN))
29139 {
29143 else
29146 }
29147 else
29148 /* Trigger an error. */
29153 }
29157 {
29165 {
29168 auto_node);
29173 }
29176 asm_specification,
29177 LOOKUP_ONLYCONVERTING);
29179 {
29182 }
29183 else
29186 }
29187 else
29188 {
29189 /* Consume '='. */
29193 non_class:
29196 else
29199 asm_specification,
29200 LOOKUP_ONLYCONVERTING);
29201 }
29205 }
29206 }
29207 else
29208 {
29209 cp_id_kind idk;
29210 /* If parsing a type specifier sequence failed, then
29211 this MUST be a simple expression. */
29216 && decl
29219 {
29220 tree rhs;
29227 rhs,
29228 tf_warning_or_error));
29230 }
29231 else
29232 {
29237 {
29241 }
29242 }
29243 }
29245 }
29247 /* Parse the restricted form of the for statement allowed by OpenMP. */
29249 static tree
29252 {
29256 location_t loc_first;
29275 {
29278 location_t loc;
29281 {
29284 }
29293 add_private_clause
29301 {
29304 {
29310 }
29311 else
29313 }
29320 {
29325 {
29329 }
29332 {
29333 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29334 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29343 }
29344 else
29345 {
29350 }
29351 }
29354 {
29355 tree c;
29357 {
29366 decl);
29370 decl);
29371 }
29373 {
29378 {
29381 }
29382 }
29383 }
29392 {
29393 /* If decl is an iterator, preserve the operator on decl
29394 until finish_omp_for. */
29396 && ((processing_template_decl
29400 else
29404 }
29419 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29420 in between the collapsed for loops to be still considered perfectly
29421 nested. Hopefully the final version clarifies this.
29422 For now handle (multiple) {'s and empty statements. */
29424 do
29425 {
29429 {
29431 bracecount++;
29432 }
29436 else
29437 {
29444 }
29445 }
29449 {
29452 }
29453 }
29455 /* Note that we saved the original contents of this flag when we entered
29456 the structured block, and so we don't need to re-save it here. */
29459 else
29462 /* Note that the grammar doesn't call for a structured block here,
29463 though the loop as a whole is a structured block. */
29470 else
29475 {
29477 {
29479 nbraces--;
29480 }
29483 else
29484 {
29486 {
29489 }
29494 }
29495 }
29502 }
29504 /* Helper function for OpenMP parsing, split clauses and call
29505 finish_omp_clauses on each of the set of clauses afterwards. */
29507 static void
29510 {
29516 }
29518 /* OpenMP 4.0:
29519 #pragma omp simd simd-clause[optseq] new-line
29520 for-loop */
29522 #define OMP_SIMD_CLAUSE_MASK \
29523 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29531 static tree
29534 {
29546 {
29549 }
29560 }
29562 /* OpenMP 2.5:
29563 #pragma omp for for-clause[optseq] new-line
29564 for-loop
29566 OpenMP 4.0:
29567 #pragma omp for simd for-simd-clause[optseq] new-line
29568 for-loop */
29570 #define OMP_FOR_CLAUSE_MASK \
29571 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29580 static tree
29583 {
29594 {
29599 {
29607 cclauses);
29611 cclauses);
29623 }
29624 }
29626 {
29629 }
29634 {
29637 }
29648 }
29650 /* OpenMP 2.5:
29651 # pragma omp master new-line
29652 structured-block */
29654 static tree
29656 {
29660 }
29662 /* OpenMP 2.5:
29663 # pragma omp ordered new-line
29664 structured-block */
29666 static tree
29668 {
29672 }
29674 /* OpenMP 2.5:
29676 section-scope:
29677 { section-sequence }
29679 section-sequence:
29680 section-directive[opt] structured-block
29681 section-sequence section-directive structured-block */
29683 static tree
29685 {
29696 {
29700 }
29703 {
29711 {
29715 }
29717 {
29720 }
29725 }
29736 }
29738 /* OpenMP 2.5:
29739 # pragma omp sections sections-clause[optseq] newline
29740 sections-scope */
29742 #define OMP_SECTIONS_CLAUSE_MASK \
29743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29749 static tree
29752 {
29764 {
29767 }
29774 }
29776 /* OpenMP 2.5:
29777 # pragma omp parallel parallel-clause[optseq] new-line
29778 structured-block
29779 # pragma omp parallel for parallel-for-clause[optseq] new-line
29780 structured-block
29781 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
29782 structured-block
29784 OpenMP 4.0:
29785 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
29786 structured-block */
29788 #define OMP_PARALLEL_CLAUSE_MASK \
29789 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29799 static tree
29802 {
29811 {
29824 block);
29827 }
29829 {
29833 }
29835 {
29838 }
29840 {
29844 {
29854 block);
29857 }
29858 }
29868 }
29870 /* OpenMP 2.5:
29871 # pragma omp single single-clause[optseq] new-line
29872 structured-block */
29874 #define OMP_SINGLE_CLAUSE_MASK \
29875 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29880 static tree
29882 {
29892 }
29894 /* OpenMP 3.0:
29895 # pragma omp task task-clause[optseq] new-line
29896 structured-block */
29898 #define OMP_TASK_CLAUSE_MASK \
29899 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29900 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29901 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29902 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29906 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29909 static tree
29911 {
29922 }
29924 /* OpenMP 3.0:
29925 # pragma omp taskwait new-line */
29927 static void
29929 {
29932 }
29934 /* OpenMP 3.1:
29935 # pragma omp taskyield new-line */
29937 static void
29939 {
29942 }
29944 /* OpenMP 4.0:
29945 # pragma omp taskgroup new-line
29946 structured-block */
29948 static tree
29950 {
29954 }
29957 /* OpenMP 2.5:
29958 # pragma omp threadprivate (variable-list) */
29960 static void
29962 {
29963 tree vars;
29969 }
29971 /* OpenMP 4.0:
29972 # pragma omp cancel cancel-clause[optseq] new-line */
29974 #define OMP_CANCEL_CLAUSE_MASK \
29975 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
29979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29981 static void
29983 {
29987 }
29989 /* OpenMP 4.0:
29990 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
29992 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
29993 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
29998 static void
30000 {
30001 tree clauses;
30005 {
30010 {
30013 }
30014 }
30016 {
30020 }
30023 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30025 pragma_tok);
30027 }
30029 /* OpenMP 4.0:
30030 #pragma omp distribute distribute-clause[optseq] new-line
30031 for-loop */
30033 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30039 static tree
30042 {
30051 {
30059 else
30062 {
30068 {
30071 cclauses);
30072 else
30074 cclauses);
30075 }
30080 cclauses);
30081 else
30083 cclauses);
30095 }
30096 }
30098 {
30101 }
30106 {
30109 }
30120 }
30122 /* OpenMP 4.0:
30123 # pragma omp teams teams-clause[optseq] new-line
30124 structured-block */
30126 #define OMP_TEAMS_CLAUSE_MASK \
30127 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30135 static tree
30138 {
30147 {
30151 {
30159 cclauses);
30163 cclauses);
30174 }
30175 }
30177 {
30180 }
30185 {
30188 }
30196 }
30198 /* OpenMP 4.0:
30199 # pragma omp target data target-data-clause[optseq] new-line
30200 structured-block */
30202 #define OMP_TARGET_DATA_CLAUSE_MASK \
30203 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30207 static tree
30209 {
30221 }
30223 /* OpenMP 4.0:
30224 # pragma omp target update target-update-clause[optseq] new-line */
30226 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30227 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30232 static bool
30235 {
30237 {
30239 "%<#pragma omp target update%> may only be "
30243 }
30245 tree clauses
30250 {
30252 "%<#pragma omp target update must contain at least one "
30255 }
30263 }
30265 /* OpenMP 4.0:
30266 # pragma omp target target-clause[optseq] new-line
30267 structured-block */
30269 #define OMP_TARGET_CLAUSE_MASK \
30270 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30274 static bool
30277 {
30279 {
30283 }
30286 {
30291 {
30316 }
30318 {
30321 }
30323 {
30327 }
30329 {
30332 }
30333 }
30347 }
30349 /* OpenMP 4.0:
30350 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30352 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30353 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30360 static void
30363 {
30365 cp_omp_declare_simd_data data;
30367 {
30372 }
30383 {
30387 {
30400 }
30405 "%<#pragma omp declare simd%> not immediately followed by "
30409 }
30410 }
30412 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30413 This function is modelled similar to the late parsing of omp declare
30414 simd. */
30416 static tree
30418 {
30424 {
30430 }
30432 {
30436 }
30441 {
30448 NULL);
30462 }
30467 }
30469 /* Finalize #pragma omp declare simd clauses after direct declarator has
30470 been parsed, and put that into "omp declare simd" attribute. */
30472 static tree
30474 {
30480 {
30485 }
30490 {
30508 }
30512 }
30515 /* OpenMP 4.0:
30516 # pragma omp declare target new-line
30517 declarations and definitions
30518 # pragma omp end declare target new-line */
30520 static void
30522 {
30525 }
30527 static void
30529 {
30532 {
30535 }
30537 {
30541 {
30544 }
30547 else
30548 {
30552 }
30553 }
30554 else
30555 {
30559 }
30563 "%<#pragma omp end declare target%> without corresponding "
30565 else
30567 }
30569 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30570 expression and optional initializer clause of
30571 #pragma omp declare reduction. We store the expression(s) as
30572 either 3, 6 or 7 special statements inside of the artificial function's
30573 body. The first two statements are DECL_EXPRs for the artificial
30574 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30575 expression that uses those variables.
30576 If there was any INITIALIZER clause, this is followed by further statements,
30577 the fourth and fifth statements are DECL_EXPRs for the artificial
30578 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30579 constructor variant (first token after open paren is not omp_priv),
30580 then the sixth statement is a statement with the function call expression
30581 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30582 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30583 to initialize the OMP_PRIV artificial variable and there is seventh
30584 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30586 static bool
30588 {
30600 tree combiner;
30615 {
30618 }
30621 {
30628 {
30631 }
30647 {
30651 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30655 == CPP_CLOSE_PAREN
30658 {
30662 }
30667 }
30668 else
30669 {
30685 {
30690 }
30692 tree arg;
30705 }
30716 }
30722 }
30724 /* OpenMP 4.0
30725 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30726 initializer-clause[opt] new-line
30728 initializer-clause:
30729 initializer (omp_priv initializer)
30730 initializer (function-name (argument-list)) */
30732 static void
30735 {
30745 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
30752 {
30784 }
30796 /* Types may not be defined in declare reduction type list. */
30799 parser->type_definition_forbidden_message
30805 saved_colon_doesnt_start_class_def_p
30810 {
30814 ;
30835 else
30840 else
30842 }
30844 /* Restore the saved message. */
30847 parser->colon_doesnt_start_class_def_p
30852 {
30853 fail:
30856 }
30862 {
30863 tree fntype
30866 NULL_TREE);
30885 {
30890 }
30892 {
30894 {
30903 }
30910 }
30911 else
30912 {
30915 }
30918 else
30921 {
30924 }
30926 {
30929 else
30934 }
30939 else
30940 {
30949 }
30956 }
30960 done:
30961 /* Free any declarators allocated. */
30963 }
30965 /* OpenMP 4.0
30966 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30967 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30968 initializer-clause[opt] new-line
30969 #pragma omp declare target new-line */
30971 static void
30974 {
30976 {
30981 {
30984 context);
30986 }
30989 {
30992 context);
30994 }
30996 {
30999 }
31001 {
31005 }
31006 }
31010 }
31012 /* Main entry point to OpenMP statement pragmas. */
31014 static void
31016 {
31017 tree stmt;
31022 {
31070 }
31074 }
31075 \f
31076 /* Transactional Memory parsing routines. */
31078 /* Parse a transaction attribute.
31080 txn-attribute:
31081 attribute
31082 [ [ identifier ] ]
31084 ??? Simplify this when C++0x bracket attributes are
31085 implemented properly. */
31087 static tree
31089 {
31104 {
31108 /* For keywords, use the canonical spelling,
31109 not the parsed identifier. */
31113 }
31114 else
31118 error1:
31121 }
31123 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31125 transaction-statement:
31126 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31127 compound-statement
31128 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31129 */
31131 static tree
31133 {
31148 else
31149 {
31153 }
31155 /* Parse a noexcept specification. */
31158 /* Keep track if we're in the lexical scope of an outer transaction. */
31170 }
31172 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31174 transaction-expression:
31175 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31176 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31177 */
31179 static tree
31181 {
31206 /* Set this early. This might mean that we allow transaction_cancel in
31207 an expression that we find out later actually has to be a constexpr.
31208 However, we expect that cxx_constant_value will be able to deal with
31209 this; also, if the noexcept has no constexpr, then what we parse next
31210 really is a transaction's body. */
31213 /* Parse a noexcept specification. */
31219 {
31226 }
31227 else
31228 {
31229 /* The only expression that is available got parsed for the noexcept
31230 already. noexcept is true then. */
31233 }
31242 }
31244 /* Parse a function-transaction-block.
31246 function-transaction-block:
31247 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31248 function-body
31249 __transaction_atomic txn-attribute[opt] function-try-block
31250 __transaction_relaxed ctor-initializer[opt] function-body
31251 __transaction_relaxed function-try-block
31252 */
31254 static bool
31256 {
31272 else
31273 {
31277 }
31285 else
31286 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31294 }
31296 /* Parse a __transaction_cancel statement.
31298 cancel-statement:
31299 __transaction_cancel txn-attribute[opt] ;
31300 __transaction_cancel txn-attribute[opt] throw-expression ;
31302 ??? Cancel and throw is not yet implemented. */
31304 static tree
31306 {
31312 RT_TRANSACTION_CANCEL);
31319 /* ??? Parse cancel-and-throw here. */
31324 {
31328 }
31330 {
31334 }
31336 {
31339 {
31345 }
31346 }
31348 {
31352 }
31358 }
31359 \f
31360 /* The parser. */
31364 \f
31365 /* Special handling for the first token or line in the file. The first
31366 thing in the file might be #pragma GCC pch_preprocess, which loads a
31367 PCH file, which is a GC collection point. So we need to handle this
31368 first pragma without benefit of an existing lexer structure.
31370 Always returns one token to the caller in *FIRST_TOKEN. This is
31371 either the true first token of the file, or the first token after
31372 the initial pragma. */
31374 static void
31376 {
31385 {
31392 }
31393 else
31396 /* Skip to the end of the pragma. */
31400 /* Now actually load the PCH file. */
31404 /* Read one more token to return to our caller. We have to do this
31405 after reading the PCH file in, since its pointers have to be
31406 live. */
31408 }
31410 /* Normal parsing of a pragma token. Here we can (and must) use the
31411 regular lexer. */
31413 static bool
31415 {
31427 {
31435 {
31445 }
31450 {
31460 }
31465 {
31471 "%<#pragma omp taskwait%> may only be "
31476 }
31481 {
31487 "%<#pragma omp taskyield%> may only be "
31492 }
31497 {
31503 "%<#pragma omp cancel%> may only be "
31508 }
31513 {
31519 "%<#pragma omp cancellation point%> may only be "
31524 }
31562 "%<#pragma omp section%> may only be used in "
31567 {
31574 {
31577 }
31580 }
31584 {
31588 }
31597 bad_stmt:
31600 }
31604 }
31606 /* The interface the pragma parsers have to the lexer. */
31608 enum cpp_ttype
31610 {
31623 else
31624 {
31628 }
31631 }
31633 \f
31634 /* External interface. */
31636 /* Parse one entire translation unit. */
31638 void
31640 {
31644 {
31647 }
31655 }
31657 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31658 vectorlength clause:
31659 Syntax:
31660 vectorlength ( constant-expression ) */
31662 static tree
31665 {
31667 tree expr;
31668 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31669 safelen clause. Thus, vectorlength is represented as OMP 4.0
31670 safelen. For SIMD-enabled function it is represented by OMP 4.0
31671 simdlen. */
31674 loc);
31675 else
31677 loc);
31685 /* If expr == error_mark_node, then don't emit any errors nor
31686 create a clause. if any of the above functions returns
31687 error mark node then they would have emitted an error message. */
31689 ;
31697 else
31698 {
31699 tree c;
31701 {
31706 }
31707 else
31708 {
31713 }
31714 }
31719 }
31721 /* Handles the Cilk Plus #pragma simd linear clause.
31722 Syntax:
31723 linear ( simd-linear-variable-list )
31725 simd-linear-variable-list:
31726 simd-linear-variable
31727 simd-linear-variable-list , simd-linear-variable
31729 simd-linear-variable:
31730 id-expression
31731 id-expression : simd-linear-step
31733 simd-linear-step:
31734 conditional-expression */
31736 static tree
31738 {
31744 {
31748 }
31753 {
31756 {
31760 }
31767 {
31771 }
31772 else
31773 {
31777 /* If present, parse the linear step. Otherwise, assume the default
31778 value of 1. */
31780 {
31787 {
31788 /* If an error has occurred, then the whole pragma is
31789 considered ill-formed. Thus, no reason to keep
31790 parsing. */
31793 }
31801 else
31803 "step size must be an integer constant "
31805 }
31807 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
31813 }
31818 else
31819 {
31824 }
31825 }
31829 }
31831 /* Returns the name of the next clause. If the clause is not
31832 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
31833 token is not consumed. Otherwise, the appropriate enum from the
31834 pragma_simd_clause is returned and the token is consumed. */
31836 static pragma_omp_clause
31838 {
31839 pragma_omp_clause clause_type;
31856 else
31861 }
31863 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
31865 static tree
31867 {
31872 {
31873 pragma_omp_clause c_kind;
31880 /* Use the OpenMP 4.0 equivalent function. */
31883 /* Use the OpenMP 4.0 equivalent function. */
31885 clauses);
31887 /* Use the OMP 4.0 equivalent function. */
31889 clauses);
31891 /* Use the OMP 4.0 equivalent function. */
31893 else
31894 {
31898 }
31899 }
31905 else
31907 }
31909 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
31911 static void
31913 {
31920 {
31924 }
31934 }
31936 /* Create an identifier for a generic parameter type (a synthesized
31937 template parameter implied by `auto' or a concept identifier). */
31940 static tree
31942 {
31946 }
31948 /* Predicate that behaves as is_auto_or_concept but matches the parent
31949 node of the generic type rather than the generic type itself. This
31950 allows for type transformation in add_implicit_template_parms. */
31954 {
31956 }
31958 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
31959 (creating a new template parameter list if necessary). Returns the newly
31960 created template type parm. */
31962 tree
31964 {
31967 /* We are either continuing a function template that already contains implicit
31968 template parameters, creating a new fully-implicit function template, or
31969 extending an existing explicit function template with implicit template
31970 parameters. */
31978 {
31982 }
31983 else
31984 {
31985 /* Roll back to the existing template parameter scope (in the case of
31986 extending an explicit function template) or introduce a new template
31987 parameter scope ahead of the function parameter scope (or class scope
31988 in the case of out-of-line member definitions). The function scope is
31989 added back after template parameter synthesis below. */
31994 {
31997 }
31999 {
32000 /* If not defining a class, then any class scope is a scope level in
32001 an out-of-line member definition. In this case simply wind back
32002 beyond the first such scope to inject the template argument list.
32003 Otherwise wind back to the class being defined. The latter can
32004 occur in class member friend declarations such as:
32006 class A {
32007 void foo (auto);
32008 };
32009 class B {
32010 friend void A::foo (auto);
32011 };
32013 The template argument list synthesized for the friend declaration
32014 must be injected in the scope of 'B', just beyond the scope of 'A'
32015 introduced by 'A::'. */
32019 {
32022 }
32023 }
32029 {
32030 /* Introduce a new template parameter list for implicit template
32031 parameters. */
32035 parser->implicit_template_scope
32042 }
32043 else
32044 {
32045 /* Synthesize implicit template parameters at the end of the explicit
32046 template parameter list. */
32053 parser->implicit_template_parms
32055 }
32056 }
32058 /* Synthesize a new template parameter and track the current template
32059 parameter chain with implicit_template_parms. */
32063 synth_id);
32064 tree new_parm
32066 input_location,
32073 parser->implicit_template_parms
32075 else
32080 /* If creating a fully implicit function template, start the new implicit
32081 template parameter list with this synthesized type, otherwise grow the
32082 current template parameter list. */
32085 {
32092 }
32093 else
32094 {
32099 }
32104 }
32106 /* Finish the declaration of a fully implicit function template. Such a
32107 template has no explicit template parameter list so has not been through the
32108 normal template head and tail processing. synthesize_implicit_template_parm
32109 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32110 provided if the declaration is a class member such that its template
32111 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32112 form is returned. Otherwise NULL_TREE is returned. */
32114 tree
32116 {
32121 {
32125 }
32135 }