| blob | 572528358f5bcfc6cf694ef9b180b4bf14328055 |
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 {
3140 {
3144 {
3147 /* If we've run out of tokens, stop. */
3151 /* If the next token is a `;', we have reached the end of the
3152 statement. */
3158 /* If this is a non-nested '}', stop before consuming it.
3159 That way, when confronted with something like:
3161 { 3 + }
3163 we stop before consuming the closing '}', even though we
3164 have not yet reached a `;'. */
3168 /* If it is the closing '}' for a block that we have
3169 scanned, stop -- but only after consuming the token.
3170 That way given:
3172 void f g () { ... }
3173 typedef int I;
3175 we will stop after the body of the erroneously declared
3176 function, but before consuming the following `typedef'
3177 declaration. */
3179 {
3182 }
3190 }
3192 /* Consume the token. */
3194 }
3195 }
3197 /* This function is called at the end of a statement or declaration.
3198 If the next token is a semicolon, it is consumed; otherwise, error
3199 recovery is attempted. */
3201 static void
3203 {
3204 /* Look for the trailing `;'. */
3206 {
3207 /* If there is additional (erroneous) input, skip to the end of
3208 the statement. */
3210 /* If the next token is now a `;', consume it. */
3213 }
3214 }
3216 /* Skip tokens until we have consumed an entire block, or until we
3217 have consumed a non-nested `;'. */
3219 static void
3221 {
3225 {
3229 {
3232 /* If we've run out of tokens, stop. */
3236 /* Stop if this is an unnested ';'. */
3242 /* Stop if this is an unnested '}', or closes the outermost
3243 nesting level. */
3244 nesting_depth--;
3252 /* Nest. */
3253 nesting_depth++;
3258 }
3260 /* Consume the token. */
3262 }
3263 }
3265 /* Skip tokens until a non-nested closing curly brace is the next
3266 token, or there are no more tokens. Return true in the first case,
3267 false otherwise. */
3269 static bool
3271 {
3275 {
3279 {
3282 /* If we've run out of tokens, stop. */
3286 /* If the next token is a non-nested `}', then we have reached
3287 the end of the current block. */
3293 /* If it the next token is a `{', then we are entering a new
3294 block. Consume the entire block. */
3300 }
3302 /* Consume the token. */
3304 }
3305 }
3307 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3308 parameter is the PRAGMA token, allowing us to purge the entire pragma
3309 sequence. */
3311 static void
3313 {
3318 do
3322 /* Ensure that the pragma is not parsed again. */
3324 }
3326 /* Require pragma end of line, resyncing with it as necessary. The
3327 arguments are as for cp_parser_skip_to_pragma_eol. */
3329 static void
3331 {
3335 }
3337 /* This is a simple wrapper around make_typename_type. When the id is
3338 an unresolved identifier node, we can provide a superior diagnostic
3339 using cp_parser_diagnose_invalid_type_name. */
3341 static tree
3344 {
3345 tree result;
3347 {
3353 }
3355 }
3357 /* This is a wrapper around the
3358 make_{pointer,ptrmem,reference}_declarator functions that decides
3359 which one to call based on the CODE and CLASS_TYPE arguments. The
3360 CODE argument should be one of the values returned by
3361 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3362 appertain to the pointer or reference. */
3366 cp_cv_quals cv_qualifiers,
3368 tree attributes)
3369 {
3376 else
3386 }
3388 /* Create a new C++ parser. */
3392 {
3397 /* cp_lexer_new_main is called before doing GC allocation because
3398 cp_lexer_new_main might load a PCH file. */
3401 /* Initialize the binops_by_token so that we can get the tree
3402 directly from the token. */
3410 /* For now, we always accept GNU extensions. */
3413 /* The `>' token is a greater-than operator, not the end of a
3414 template-id. */
3419 /* We are not parsing a constant-expression. */
3424 /* Local variable names are not forbidden. */
3427 /* We are not processing an `extern "C"' declaration. */
3430 /* We are not processing a declarator. */
3433 /* We are not processing a template-argument-list. */
3436 /* We are not in an iteration statement. */
3439 /* We are not in a switch statement. */
3442 /* We are not parsing a type-id inside an expression. */
3445 /* Declarations aren't implicitly extern "C". */
3448 /* String literals should be translated to the execution character set. */
3451 /* We are not parsing a function body. */
3454 /* We can correct until told otherwise. */
3457 /* The unparsed function queue is empty. */
3460 /* There are no classes being defined. */
3463 /* No template parameters apply. */
3466 /* Not declaring an implicit function template. */
3473 }
3475 /* Create a cp_lexer structure which will emit the tokens in CACHE
3476 and push it onto the parser's lexer stack. This is used for delayed
3477 parsing of in-class method bodies and default arguments, and should
3478 not be confused with tentative parsing. */
3479 static void
3481 {
3486 /* Move the current source position to that of the first token in the
3487 new lexer. */
3489 }
3491 /* Pop the top lexer off the parser stack. This is never used for the
3492 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3493 static void
3495 {
3500 /* Put the current source position back where it was before this
3501 lexer was pushed. */
3503 }
3505 /* Lexical conventions [gram.lex] */
3507 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3508 identifier. */
3510 static tree
3512 {
3515 /* Look for the identifier. */
3517 /* Return the value. */
3519 }
3521 /* Parse a sequence of adjacent string constants. Returns a
3522 TREE_STRING representing the combined, nul-terminated string
3523 constant. If TRANSLATE is true, translate the string to the
3524 execution character set. If WIDE_OK is true, a wide string is
3525 invalid here.
3527 C++98 [lex.string] says that if a narrow string literal token is
3528 adjacent to a wide string literal token, the behavior is undefined.
3529 However, C99 6.4.5p4 says that this results in a wide string literal.
3530 We follow C99 here, for consistency with the C front end.
3532 This code is largely lifted from lex_string() in c-lex.c.
3534 FUTURE: ObjC++ will need to handle @-strings here. */
3535 static tree
3537 {
3538 tree value;
3545 tree string_tree;
3551 {
3554 }
3557 {
3561 }
3562 else
3563 {
3566 }
3569 /* Try to avoid the overhead of creating and destroying an obstack
3570 for the common case of just one string. */
3573 {
3581 {
3585 }
3586 else
3590 }
3591 else
3592 {
3596 do
3597 {
3599 count++;
3604 {
3607 {
3610 }
3613 {
3618 }
3620 }
3621 else
3625 {
3630 "unsupported non-standard concatenation "
3632 }
3638 {
3642 }
3643 else
3644 {
3648 }
3649 }
3653 }
3656 {
3659 }
3663 {
3668 {
3683 }
3688 {
3693 }
3694 }
3695 else
3696 /* cpp_interpret_string has issued an error. */
3703 }
3705 /* Look up a literal operator with the name and the exact arguments. */
3707 static tree
3709 {
3716 {
3722 {
3725 {
3735 }
3738 /* May be this should be sufficient_parms_p instead,
3739 depending on how exactly should user-defined literals
3740 work in presence of default arguments on the literal
3741 operator parameters. */
3744 }
3745 }
3748 }
3750 /* Parse a user-defined char constant. Returns a call to a user-defined
3751 literal operator taking the character as an argument. */
3753 static tree
3755 {
3763 /* Build up a call to the user-defined operator */
3764 /* Lookup the name we got back from the id-expression. */
3769 {
3774 }
3783 }
3785 /* A subroutine of cp_parser_userdef_numeric_literal to
3786 create a char... template parameter pack from a string node. */
3788 static tree
3790 {
3791 tree charvec;
3797 /* Fill in CHARVEC with all of the parameters. */
3802 /* Build the argument packs. */
3809 }
3811 /* A subroutine of cp_parser_userdef_numeric_literal to
3812 create a char... template parameter pack from a string node. */
3814 static tree
3816 {
3817 tree charvec;
3828 /* First template parm is character type. */
3831 /* Fill in CHARVEC with all of the parameters. */
3838 /* Build the argument packs. */
3845 }
3847 /* Parse a user-defined numeric constant. returns a call to a user-defined
3848 literal operator. */
3850 static tree
3852 {
3863 /* Look for a literal operator taking the exact type of numeric argument
3864 as the literal value. */
3869 {
3872 {
3876 long_long_unsigned_type_node);
3877 else
3878 {
3882 long_double_type_node);
3886 }
3889 }
3890 }
3893 /* If the numeric argument didn't work, look for a raw literal
3894 operator taking a const char* argument consisting of the number
3895 in string format. */
3900 {
3903 {
3906 }
3907 }
3910 /* If the raw literal didn't work, look for a non-type template
3911 function with parameter pack char.... Call the function with
3912 template parameter characters representing the number. */
3916 {
3921 {
3924 }
3925 }
3933 }
3935 /* Parse a user-defined string constant. Returns a call to a user-defined
3936 literal operator taking a character pointer and the length of the string
3937 as arguments. */
3939 static tree
3941 {
3951 /* Look for a template function with typename parameter CharT
3952 and parameter pack CharT... Call the function with
3953 template parameter characters representing the string. */
3957 {
3962 {
3965 }
3966 }
3969 /* Build up a call to the user-defined operator */
3970 /* Lookup the name we got back from the id-expression. */
3976 {
3980 }
3989 }
3992 /* Basic concepts [gram.basic] */
3994 /* Parse a translation-unit.
3996 translation-unit:
3997 declaration-seq [opt]
3999 Returns TRUE if all went well. */
4001 static bool
4003 {
4004 /* The address of the first non-permanent object on the declarator
4005 obstack. */
4010 /* Create the declarator obstack, if necessary. */
4012 {
4014 /* Create the error declarator. */
4016 /* Create the empty parameter list. */
4018 /* Remember where the base of the declarator obstack lies. */
4020 }
4024 /* If there are no tokens left then all went well. */
4026 {
4027 /* Get rid of the token array; we don't need it any more. */
4031 /* This file might have been a context that's implicitly extern
4032 "C". If so, pop the lang context. (Only relevant for PCH.) */
4034 {
4037 }
4039 /* Finish up. */
4043 }
4044 else
4045 {
4048 }
4050 /* Make sure the declarator obstack was fully cleaned up. */
4054 /* All went well. */
4056 }
4058 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4059 decltype context. */
4063 {
4068 }
4070 /* Expressions [gram.expr] */
4072 /* Parse a primary-expression.
4074 primary-expression:
4075 literal
4076 this
4077 ( expression )
4078 id-expression
4080 GNU Extensions:
4082 primary-expression:
4083 ( compound-statement )
4084 __builtin_va_arg ( assignment-expression , type-id )
4085 __builtin_offsetof ( type-id , offsetof-expression )
4087 C++ Extensions:
4088 __has_nothrow_assign ( type-id )
4089 __has_nothrow_constructor ( type-id )
4090 __has_nothrow_copy ( type-id )
4091 __has_trivial_assign ( type-id )
4092 __has_trivial_constructor ( type-id )
4093 __has_trivial_copy ( type-id )
4094 __has_trivial_destructor ( type-id )
4095 __has_virtual_destructor ( type-id )
4096 __is_abstract ( type-id )
4097 __is_base_of ( type-id , type-id )
4098 __is_class ( type-id )
4099 __is_convertible_to ( type-id , type-id )
4100 __is_empty ( type-id )
4101 __is_enum ( type-id )
4102 __is_final ( type-id )
4103 __is_literal_type ( type-id )
4104 __is_pod ( type-id )
4105 __is_polymorphic ( type-id )
4106 __is_std_layout ( type-id )
4107 __is_trivial ( type-id )
4108 __is_union ( type-id )
4110 Objective-C++ Extension:
4112 primary-expression:
4113 objc-expression
4115 literal:
4116 __null
4118 ADDRESS_P is true iff this expression was immediately preceded by
4119 "&" and therefore might denote a pointer-to-member. CAST_P is true
4120 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4121 true iff this expression is a template argument.
4123 Returns a representation of the expression. Upon return, *IDK
4124 indicates what kind of id-expression (if any) was present. */
4126 static tree
4133 {
4136 /* Assume the primary expression is not an id-expression. */
4139 /* Peek at the next token. */
4142 {
4143 /* literal:
4144 integer-literal
4145 character-literal
4146 floating-literal
4147 string-literal
4148 boolean-literal
4149 pointer-literal
4150 user-defined-literal */
4160 {
4164 }
4165 /* Floating-point literals are only allowed in an integral
4166 constant expression if they are cast to an integral or
4167 enumeration type. */
4171 {
4172 /* CAST_P will be set even in invalid code like "int(2.7 +
4173 ...)". Therefore, we have to check that the next token
4174 is sure to end the cast. */
4176 {
4181 enumerator-definition. */
4183 /* The curly brace at the end of an enum-specifier. */
4185 /* The end of a statement. */
4187 /* The end of the cast-expression. */
4189 /* The end of an array bound. */
4191 /* The closing ">" in a template-argument-list. */
4194 /* C++0x only: A ">>" treated like two ">" tokens,
4195 in a template-argument-list. */
4200 }
4202 /* If we are within a cast, then the constraint that the
4203 cast is to an integral or enumeration type will be
4204 checked at that point. If we are not within a cast, then
4205 this code is invalid. */
4208 }
4227 /* ??? Should wide strings be allowed when parser->translate_strings_p
4228 is false (i.e. in attributes)? If not, we can kill the third
4229 argument to cp_parser_string_literal. */
4235 {
4236 tree expr;
4239 /* Consume the `('. */
4241 /* Within a parenthesized expression, a `>' token is always
4242 the greater-than operator. */
4243 saved_greater_than_is_operator_p
4246 /* If we see `( { ' then we are looking at the beginning of
4247 a GNU statement-expression. */
4250 {
4251 /* Statement-expressions are not allowed by the standard. */
4255 /* And they're not allowed outside of a function-body; you
4256 cannot, for example, write:
4258 int i = ({ int j = 3; j + 1; });
4260 at class or namespace scope. */
4263 {
4265 "statement-expressions are not allowed outside "
4269 }
4270 else
4271 {
4272 /* Start the statement-expression. */
4274 /* Parse the compound-statement. */
4276 /* Finish up. */
4278 }
4279 }
4280 else
4281 {
4282 /* Parse the parenthesized expression. */
4284 /* Let the front end know that this expression was
4285 enclosed in parentheses. This matters in case, for
4286 example, the expression is of the form `A::B', since
4287 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4288 not. */
4290 /* DR 705: Wrapping an unqualified name in parentheses
4291 suppresses arg-dependent lookup. We want to pass back
4292 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4293 (c++/37862), but none of the others. */
4296 }
4297 /* The `>' token might be the end of a template-id or
4298 template-parameter-list now. */
4299 parser->greater_than_is_operator_p
4301 /* Consume the `)'. */
4306 }
4310 /* We have an Objective-C++ message. */
4312 {
4314 /* Don't warn about a failed tentative parse. */
4319 }
4323 /* We have an Objective-C++ string literal. */
4330 {
4331 /* These two are the boolean literals. */
4339 /* The `__null' literal. */
4344 /* The `nullptr' literal. */
4349 /* Recognize the `this' keyword. */
4353 {
4357 }
4358 /* Pointers cannot appear in constant-expressions. */
4363 /* The `operator' keyword can be the beginning of an
4364 id-expression. */
4371 {
4372 non_integral_constant name;
4374 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4375 __func__ are the names of variables -- but they are
4376 treated specially. Therefore, they are handled here,
4377 rather than relying on the generic id-expression logic
4378 below. Grammatically, these names are id-expressions.
4380 Consume the token. */
4384 {
4396 }
4401 /* Look up the name. */
4403 }
4406 {
4407 tree expression;
4408 tree type;
4409 source_location type_location;
4411 /* The `__builtin_va_arg' construct is used to handle
4412 `va_arg'. Consume the `__builtin_va_arg' token. */
4414 /* Look for the opening `('. */
4416 /* Now, parse the assignment-expression. */
4419 /* Look for the `,'. */
4422 /* Parse the type-id. */
4424 /* Look for the closing `)'. */
4426 /* Using `va_arg' in a constant-expression is not
4427 allowed. */
4429 NIC_VA_ARG))
4432 }
4460 /* Objective-C++ expressions. */
4470 {
4475 }
4479 }
4481 /* An id-expression can start with either an identifier, a
4482 `::' as the beginning of a qualified-id, or the "operator"
4483 keyword. */
4488 {
4489 tree id_expression;
4490 tree decl;
4496 id_expression:
4497 /* Parse the id-expression. */
4498 id_expression
4515 /* If we have a template-id, then no further lookup is
4516 required. If the template-id was for a template-class, we
4517 will sometimes have a TYPE_DECL at this point. */
4521 /* Look up the name. */
4522 else
4523 {
4524 tree ambiguous_decls;
4526 /* If we already know that this lookup is ambiguous, then
4527 we've already issued an error message; there's no reason
4528 to check again. */
4531 {
4534 }
4537 none_type,
4538 template_p,
4543 /* If the lookup was ambiguous, an error will already have
4544 been issued. */
4548 /* In Objective-C++, we may have an Objective-C 2.0
4549 dot-syntax for classes here. */
4554 {
4555 tree component;
4562 }
4564 /* In Objective-C++, an instance variable (ivar) may be preferred
4565 to whatever cp_parser_lookup_name() found. */
4568 /* If name lookup gives us a SCOPE_REF, then the
4569 qualifying scope was dependent. */
4571 {
4572 /* At this point, we do not know if DECL is a valid
4573 integral constant expression. We assume that it is
4574 in fact such an expression, so that code like:
4576 template <int N> struct A {
4577 int a[B<N>::i];
4578 };
4580 is accepted. At template-instantiation time, we
4581 will check that B<N>::i is actually a constant. */
4583 }
4584 /* Check to see if DECL is a local variable in a context
4585 where that is forbidden. */
4588 {
4589 /* It might be that we only found DECL because we are
4590 trying to be generous with pre-ISO scoping rules.
4591 For example, consider:
4593 int i;
4594 void g() {
4595 for (int i = 0; i < 10; ++i) {}
4596 extern void f(int j = i);
4597 }
4599 Here, name look up will originally find the out
4600 of scope `i'. We need to issue a warning message,
4601 but then use the global `i'. */
4604 {
4607 decl);
4609 }
4610 }
4611 }
4613 decl = (finish_id_expression
4615 idk,
4620 template_arg_p,
4626 }
4628 /* Anything else is an error. */
4632 }
4633 }
4641 {
4644 }
4646 /* Parse an id-expression.
4648 id-expression:
4649 unqualified-id
4650 qualified-id
4652 qualified-id:
4653 :: [opt] nested-name-specifier template [opt] unqualified-id
4654 :: identifier
4655 :: operator-function-id
4656 :: template-id
4658 Return a representation of the unqualified portion of the
4659 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4660 a `::' or nested-name-specifier.
4662 Often, if the id-expression was a qualified-id, the caller will
4663 want to make a SCOPE_REF to represent the qualified-id. This
4664 function does not do this in order to avoid wastefully creating
4665 SCOPE_REFs when they are not required.
4667 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4668 `template' keyword.
4670 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4671 uninstantiated templates.
4673 If *TEMPLATE_P is non-NULL, it is set to true iff the
4674 `template' keyword is used to explicitly indicate that the entity
4675 named is a template.
4677 If DECLARATOR_P is true, the id-expression is appearing as part of
4678 a declarator, rather than as part of an expression. */
4680 static tree
4687 {
4691 /* Assume the `template' keyword was not used. */
4695 /* Look for the optional `::' operator. */
4696 global_scope_p
4699 /* Look for the optional nested-name-specifier. */
4700 nested_name_specifier_p
4703 check_dependency_p,
4705 declarator_p)
4707 /* If there is a nested-name-specifier, then we are looking at
4708 the first qualified-id production. */
4710 {
4711 tree saved_scope;
4712 tree saved_object_scope;
4713 tree saved_qualifying_scope;
4714 tree unqualified_id;
4717 /* See if the next token is the `template' keyword. */
4721 /* Name lookup we do during the processing of the
4722 unqualified-id might obliterate SCOPE. */
4726 /* Process the final unqualified-id. */
4728 check_dependency_p,
4729 declarator_p,
4731 /* Restore the SAVED_SCOPE for our caller. */
4737 }
4738 /* Otherwise, if we are in global scope, then we are looking at one
4739 of the other qualified-id productions. */
4741 {
4743 tree id;
4745 /* Peek at the next token. */
4748 /* If it's an identifier, and the next token is not a "<", then
4749 we can avoid the template-id case. This is an optimization
4750 for this common case. */
4752 && !cp_parser_nth_token_starts_template_argument_list_p
4757 /* Try a template-id. */
4761 none_type,
4762 declarator_p);
4763 /* If that worked, we're done. */
4767 /* Peek at the next token. (Changes in the token buffer may
4768 have invalidated the pointer obtained above.) */
4772 {
4779 /* Fall through. */
4784 }
4785 }
4786 else
4789 declarator_p,
4790 optional_p);
4791 }
4793 /* Parse an unqualified-id.
4795 unqualified-id:
4796 identifier
4797 operator-function-id
4798 conversion-function-id
4799 ~ class-name
4800 template-id
4802 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4803 keyword, in a construct like `A::template ...'.
4805 Returns a representation of unqualified-id. For the `identifier'
4806 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4807 production a BIT_NOT_EXPR is returned; the operand of the
4808 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4809 other productions, see the documentation accompanying the
4810 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4811 names are looked up in uninstantiated templates. If DECLARATOR_P
4812 is true, the unqualified-id is appearing as part of a declarator,
4813 rather than as part of an expression. */
4815 static tree
4821 {
4824 /* Peek at the next token. */
4828 {
4830 {
4831 tree id;
4833 /* We don't know yet whether or not this will be a
4834 template-id. */
4836 /* Try a template-id. */
4838 check_dependency_p,
4839 none_type,
4840 declarator_p);
4841 /* If it worked, we're done. */
4844 /* Otherwise, it's an ordinary identifier. */
4846 }
4850 check_dependency_p,
4851 none_type,
4852 declarator_p);
4855 {
4856 tree type_decl;
4857 tree qualifying_scope;
4858 tree object_scope;
4859 tree scope;
4862 /* Consume the `~' token. */
4864 /* Parse the class-name. The standard, as written, seems to
4865 say that:
4867 template <typename T> struct S { ~S (); };
4868 template <typename T> S<T>::~S() {}
4870 is invalid, since `~' must be followed by a class-name, but
4871 `S<T>' is dependent, and so not known to be a class.
4872 That's not right; we need to look in uninstantiated
4873 templates. A further complication arises from:
4875 template <typename T> void f(T t) {
4876 t.T::~T();
4877 }
4879 Here, it is not possible to look up `T' in the scope of `T'
4880 itself. We must look in both the current scope, and the
4881 scope of the containing complete expression.
4883 Yet another issue is:
4885 struct S {
4886 int S;
4887 ~S();
4888 };
4890 S::~S() {}
4892 The standard does not seem to say that the `S' in `~S'
4893 should refer to the type `S' and not the data member
4894 `S::S'. */
4896 /* DR 244 says that we look up the name after the "~" in the
4897 same scope as we looked up the qualifying name. That idea
4898 isn't fully worked out; it's more complicated than that. */
4903 /* Check for invalid scopes. */
4905 {
4909 }
4911 {
4915 scope);
4920 }
4923 /* If the name is of the form "X::~X" it's OK even if X is a
4924 typedef. */
4933 {
4936 }
4938 /* ~auto means the destructor of whatever the object is. */
4940 {
4943 "%<~auto%> only available with "
4947 }
4949 /* If there was an explicit qualification (S::~T), first look
4950 in the scope given by the qualification (i.e., S).
4952 Note: in the calls to cp_parser_class_name below we pass
4953 typename_type so that lookup finds the injected-class-name
4954 rather than the constructor. */
4958 {
4963 typename_type,
4966 declarator_p);
4969 }
4970 /* In "N::S::~S", look in "N" as well. */
4972 {
4977 type_decl
4981 typename_type,
4984 declarator_p);
4987 }
4988 /* In "p->S::~T", look in the scope given by "*p" as well. */
4990 {
4995 type_decl
4999 typename_type,
5002 declarator_p);
5005 }
5006 /* Look in the surrounding context. */
5008 {
5014 type_decl
5018 typename_type,
5021 declarator_p);
5024 {
5025 /* We couldn't find a type with this name, so just accept
5026 it and check for a match at instantiation time. */
5031 }
5032 }
5033 /* If an error occurred, assume that the name of the
5034 destructor is the same as the name of the qualifying
5035 class. That allows us to keep parsing after running
5036 into ill-formed destructor names. */
5042 /* Check that destructor name and scope match. */
5044 {
5051 }
5053 /* [class.dtor]
5055 A typedef-name that names a class shall not be used as the
5056 identifier in the declarator for a destructor declaration. */
5063 type_decl);
5066 }
5070 {
5071 tree id;
5073 /* This could be a template-id, so we try that first. */
5075 /* Try a template-id. */
5078 none_type,
5079 declarator_p);
5080 /* If that worked, we're done. */
5083 /* We still don't know whether we're looking at an
5084 operator-function-id or a conversion-function-id. */
5086 /* Try an operator-function-id. */
5088 /* If that didn't work, try a conversion-function-id. */
5092 {
5093 /* 17.6.3.3.5 */
5099 }
5102 }
5103 /* Fall through. */
5110 }
5111 }
5113 /* Parse an (optional) nested-name-specifier.
5115 nested-name-specifier: [C++98]
5116 class-or-namespace-name :: nested-name-specifier [opt]
5117 class-or-namespace-name :: template nested-name-specifier [opt]
5119 nested-name-specifier: [C++0x]
5120 type-name ::
5121 namespace-name ::
5122 nested-name-specifier identifier ::
5123 nested-name-specifier template [opt] simple-template-id ::
5125 PARSER->SCOPE should be set appropriately before this function is
5126 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5127 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5128 in name lookups.
5130 Sets PARSER->SCOPE to the class (TYPE) or namespace
5131 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5132 it unchanged if there is no nested-name-specifier. Returns the new
5133 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5135 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5136 part of a declaration and/or decl-specifier. */
5138 static tree
5144 {
5149 /* Remember where the nested-name-specifier starts. */
5151 {
5154 }
5157 {
5158 tree new_scope;
5159 tree old_scope;
5160 tree saved_qualifying_scope;
5163 /* Spot cases that cannot be the beginning of a
5164 nested-name-specifier. */
5167 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5168 the already parsed nested-name-specifier. */
5170 {
5171 /* Grab the nested-name-specifier and continue the loop. */
5173 /* If we originally encountered this nested-name-specifier
5174 with IS_DECLARATION set to false, we will not have
5175 resolved TYPENAME_TYPEs, so we must do so here. */
5178 {
5183 }
5186 }
5188 /* Spot cases that cannot be the beginning of a
5189 nested-name-specifier. On the second and subsequent times
5190 through the loop, we look for the `template' keyword. */
5192 ;
5193 /* A template-id can start a nested-name-specifier. */
5195 ;
5196 /* DR 743: decltype can be used in a nested-name-specifier. */
5198 ;
5199 else
5200 {
5201 /* If the next token is not an identifier, then it is
5202 definitely not a type-name or namespace-name. */
5205 /* If the following token is neither a `<' (to begin a
5206 template-id), nor a `::', then we are not looking at a
5207 nested-name-specifier. */
5213 {
5217 }
5220 && !cp_parser_nth_token_starts_template_argument_list_p
5223 }
5225 /* The nested-name-specifier is optional, so we parse
5226 tentatively. */
5229 /* Look for the optional `template' keyword, if this isn't the
5230 first time through the loop. */
5233 else
5236 /* Save the old scope since the name lookup we are about to do
5237 might destroy it. */
5240 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5241 look up names in "X<T>::I" in order to determine that "Y" is
5242 a template. So, if we have a typename at this point, we make
5243 an effort to look through it. */
5245 && !typename_keyword_p
5250 /* Parse the qualifying entity. */
5251 new_scope
5253 typename_keyword_p,
5254 template_keyword_p,
5255 check_dependency_p,
5256 type_p,
5257 is_declaration);
5258 /* Look for the `::' token. */
5261 /* If we found what we wanted, we keep going; otherwise, we're
5262 done. */
5264 {
5267 /* Restore the OLD_SCOPE since it was valid before the
5268 failed attempt at finding the last
5269 class-or-namespace-name. */
5273 /* If the next token is a decltype, and the one after that is a
5274 `::', then the decltype has failed to resolve to a class or
5275 enumeration type. Give this error even when parsing
5276 tentatively since it can't possibly be valid--and we're going
5277 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5278 won't get another chance.*/
5282 {
5289 /* As below. */
5292 }
5296 /* If the next token is an identifier, and the one after
5297 that is a `::', then any valid interpretation would have
5298 found a class-or-namespace-name. */
5304 {
5307 {
5309 {
5310 tree decl;
5311 tree ambiguous_decls;
5314 none_type,
5323 decl);
5325 {
5326 // cp_parser_lookup_name has the same diagnostic,
5327 // thus make sure to emit it at most once.
5330 {
5335 }
5337 }
5338 else
5339 {
5341 cp_parser_name_lookup_error
5344 else
5345 cp_parser_name_lookup_error
5348 }
5349 }
5352 /* Treat this as a successful nested-name-specifier
5353 due to:
5355 [basic.lookup.qual]
5357 If the name found is not a class-name (clause
5358 _class_) or namespace-name (_namespace.def_), the
5359 program is ill-formed. */
5361 }
5363 }
5365 }
5366 /* We've found one valid nested-name-specifier. */
5368 /* Name lookup always gives us a DECL. */
5371 /* Uses of "template" must be followed by actual templates. */
5383 new_scope);
5384 /* If it is a class scope, try to complete it; we are about to
5385 be looking up names inside the class. */
5387 /* Since checking types for dependency can be expensive,
5388 avoid doing it if the type is already complete. */
5390 /* Do not try to complete dependent types. */
5392 {
5394 /* If it is a typedef to current class, use the current
5395 class instead, as the typedef won't have any names inside
5396 it yet. */
5400 }
5401 /* Make sure we look in the right scope the next time through
5402 the loop. */
5404 }
5406 /* If parsing tentatively, replace the sequence of tokens that makes
5407 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5408 token. That way, should we re-parse the token stream, we will
5409 not have to repeat the effort required to do the parse, nor will
5410 we issue duplicate error messages. */
5412 {
5416 /* Reset the contents of the START token. */
5418 /* Retrieve any deferred checks. Do not pop this access checks yet
5419 so the memory will not be reclaimed during token replacing below. */
5427 /* Purge all subsequent tokens. */
5429 }
5435 }
5437 /* Parse a nested-name-specifier. See
5438 cp_parser_nested_name_specifier_opt for details. This function
5439 behaves identically, except that it will an issue an error if no
5440 nested-name-specifier is present. */
5442 static tree
5448 {
5449 tree scope;
5451 /* Look for the nested-name-specifier. */
5453 typename_keyword_p,
5454 check_dependency_p,
5455 type_p,
5456 is_declaration);
5457 /* If it was not present, issue an error message. */
5459 {
5462 }
5465 }
5467 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5468 this is either a class-name or a namespace-name (which corresponds
5469 to the class-or-namespace-name production in the grammar). For
5470 C++0x, it can also be a type-name that refers to an enumeration
5471 type or a simple-template-id.
5473 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5474 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5475 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5476 TYPE_P is TRUE iff the next name should be taken as a class-name,
5477 even the same name is declared to be another entity in the same
5478 scope.
5480 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5481 specified by the class-or-namespace-name. If neither is found the
5482 ERROR_MARK_NODE is returned. */
5484 static tree
5491 {
5492 tree saved_scope;
5493 tree saved_qualifying_scope;
5494 tree saved_object_scope;
5495 tree scope;
5499 /* DR 743: decltype can appear in a nested-name-specifier. */
5501 {
5505 {
5508 }
5512 }
5514 /* Before we try to parse the class-name, we must save away the
5515 current PARSER->SCOPE since cp_parser_class_name will destroy
5516 it. */
5520 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5521 there is no need to look for a namespace-name. */
5522 only_class_p = template_keyword_p
5527 typename_keyword_p,
5528 template_keyword_p,
5530 check_dependency_p,
5532 is_declaration);
5534 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5538 {
5539 /* Restore the saved scope. */
5544 /* Parse tentatively. */
5547 /* Parse a type-name */
5550 /* "If the name found does not designate a namespace or a class,
5551 enumeration, or dependent type, the program is ill-formed."
5553 We cover classes and dependent types above and namespaces below,
5554 so this code is only looking for enums. */
5560 }
5561 /* If that didn't work, try for a namespace-name. */
5563 {
5564 /* Restore the saved scope. */
5568 /* If we are not looking at an identifier followed by the scope
5569 resolution operator, then this is not part of a
5570 nested-name-specifier. (Note that this function is only used
5571 to parse the components of a nested-name-specifier.) */
5576 }
5579 }
5581 /* Parse a postfix-expression.
5583 postfix-expression:
5584 primary-expression
5585 postfix-expression [ expression ]
5586 postfix-expression ( expression-list [opt] )
5587 simple-type-specifier ( expression-list [opt] )
5588 typename :: [opt] nested-name-specifier identifier
5589 ( expression-list [opt] )
5590 typename :: [opt] nested-name-specifier template [opt] template-id
5591 ( expression-list [opt] )
5592 postfix-expression . template [opt] id-expression
5593 postfix-expression -> template [opt] id-expression
5594 postfix-expression . pseudo-destructor-name
5595 postfix-expression -> pseudo-destructor-name
5596 postfix-expression ++
5597 postfix-expression --
5598 dynamic_cast < type-id > ( expression )
5599 static_cast < type-id > ( expression )
5600 reinterpret_cast < type-id > ( expression )
5601 const_cast < type-id > ( expression )
5602 typeid ( expression )
5603 typeid ( type-id )
5605 GNU Extension:
5607 postfix-expression:
5608 ( type-id ) { initializer-list , [opt] }
5610 This extension is a GNU version of the C99 compound-literal
5611 construct. (The C99 grammar uses `type-name' instead of `type-id',
5612 but they are essentially the same concept.)
5614 If ADDRESS_P is true, the postfix expression is the operand of the
5615 `&' operator. CAST_P is true if this expression is the target of a
5616 cast.
5618 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5619 class member access expressions [expr.ref].
5621 Returns a representation of the expression. */
5623 static tree
5627 {
5629 location_t loc;
5636 /* Peek at the next token. */
5639 /* Some of the productions are determined by keywords. */
5642 {
5647 {
5648 tree type;
5649 tree expression;
5653 /* All of these can be handled in the same way from the point
5654 of view of parsing. Begin by consuming the token
5655 identifying the cast. */
5658 /* New types cannot be defined in the cast. */
5660 parser->type_definition_forbidden_message
5663 /* Look for the opening `<'. */
5665 /* Parse the type to which we are casting. */
5670 /* Look for the closing `>'. */
5672 /* Restore the old message. */
5675 bool saved_greater_than_is_operator_p
5679 /* And the expression which is being cast. */
5684 parser->greater_than_is_operator_p
5687 /* Only type conversions to integral or enumeration types
5688 can be used in constant-expressions. */
5694 {
5696 postfix_expression
5700 postfix_expression
5704 postfix_expression
5706 tf_warning_or_error);
5709 postfix_expression
5714 }
5715 }
5719 {
5720 tree type;
5724 /* Consume the `typeid' token. */
5726 /* Look for the `(' token. */
5728 /* Types cannot be defined in a `typeid' expression. */
5730 parser->type_definition_forbidden_message
5732 /* We can't be sure yet whether we're looking at a type-id or an
5733 expression. */
5735 /* Try a type-id first. */
5740 /* Look for the `)' token. Otherwise, we can't be sure that
5741 we're not looking at an expression: consider `typeid (int
5742 (3))', for example. */
5744 /* If all went well, simply lookup the type-id. */
5747 /* Otherwise, fall back to the expression variant. */
5748 else
5749 {
5750 tree expression;
5752 /* Look for an expression. */
5754 /* Compute its typeid. */
5756 /* Look for the `)' token. */
5758 }
5759 /* Restore the saved message. */
5761 /* `typeid' may not appear in an integral constant expression. */
5764 }
5768 {
5769 tree type;
5770 /* The syntax permitted here is the same permitted for an
5771 elaborated-type-specifier. */
5776 }
5780 {
5784 {
5789 }
5791 {
5796 }
5797 else
5798 {
5799 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5802 }
5804 postfix_expression =
5808 {
5812 }
5814 {
5819 }
5820 else
5821 {
5823 postfix_expression);
5827 }
5829 }
5833 {
5838 }
5839 else
5846 {
5849 tree p;
5863 tf_warning_or_error);
5866 tf_warning_or_error);
5867 else
5868 {
5872 }
5874 }
5877 {
5878 tree type;
5880 /* If the next thing is a simple-type-specifier, we may be
5881 looking at a functional cast. We could also be looking at
5882 an id-expression. So, we try the functional cast, and if
5883 that doesn't work we fall back to the primary-expression. */
5885 /* Look for the simple-type-specifier. */
5888 CP_PARSER_FLAGS_NONE);
5889 /* Parse the cast itself. */
5891 postfix_expression
5893 /* If that worked, we're done. */
5897 /* If the functional-cast didn't work out, try a
5898 compound-literal. */
5901 {
5906 /* Consume the `('. */
5909 /* Avoid calling cp_parser_type_id pointlessly, see comment
5910 in cp_parser_cast_expression about c++/29234. */
5913 compound_literal_p
5918 /* Roll back the tokens we skipped. */
5923 else
5924 {
5925 /* Parse the type. */
5930 /* Look for the `)'. */
5932 }
5934 /* If things aren't going well, there's no need to
5935 keep going. */
5937 {
5939 /* Parse the brace-enclosed initializer list. */
5942 }
5943 /* If that worked, we're definitely looking at a
5944 compound-literal expression. */
5946 {
5947 /* Warn the user that a compound literal is not
5948 allowed in standard C++. */
5951 /* For simplicity, we disallow compound literals in
5952 constant-expressions. We could
5953 allow compound literals of integer type, whose
5954 initializer was a constant, in constant
5955 expressions. Permitting that usage, as a further
5956 extension, would not change the meaning of any
5957 currently accepted programs. (Of course, as
5958 compound literals are not part of ISO C++, the
5959 standard has nothing to say.) */
5961 NIC_NCC))
5962 {
5965 }
5966 /* Form the representation of the compound-literal. */
5967 postfix_expression
5969 tf_warning_or_error);
5971 }
5972 }
5974 /* It must be a primary-expression. */
5975 postfix_expression
5978 decltype_p,
5980 }
5982 }
5984 /* Note that we don't need to worry about calling build_cplus_new on a
5985 class-valued CALL_EXPR in decltype when it isn't the end of the
5986 postfix-expression; unary_complex_lvalue will take care of that for
5987 all these cases. */
5989 /* Keep looping until the postfix-expression is complete. */
5991 {
5995 /* It is not a Koenig lookup function call. */
5996 postfix_expression
5999 /* Peek at the next token. */
6003 {
6006 {
6008 "two consecutive %<[%> shall "
6011 }
6012 postfix_expression
6014 postfix_expression,
6016 decltype_p);
6022 /* postfix-expression ( expression-list [opt] ) */
6023 {
6033 is_builtin_constant_p
6036 {
6037 /* The whole point of __builtin_constant_p is to allow
6038 non-constant expressions to appear as arguments. */
6039 saved_integral_constant_expression_p
6041 saved_non_integral_constant_expression_p
6044 }
6045 args = (cp_parser_parenthesized_expression_list
6050 {
6051 parser->integral_constant_expression_p
6053 parser->non_integral_constant_expression_p
6055 }
6058 {
6061 }
6063 /* Function calls are not permitted in
6064 constant-expressions. */
6067 NIC_FUNC_CALL))
6068 {
6072 }
6077 {
6079 {
6081 {
6084 postfix_expression
6086 complain);
6087 }
6088 else
6089 postfix_expression
6091 }
6092 /* We do not perform argument-dependent lookup if
6093 normal lookup finds a non-function, in accordance
6094 with the expected resolution of DR 218. */
6097 {
6101 /* Do not do argument dependent lookup if regular
6102 lookup finds a member function or a block-scope
6103 function declaration. [basic.lookup.argdep]/3 */
6106 {
6109 postfix_expression
6111 complain);
6112 }
6113 }
6114 }
6117 {
6127 {
6128 postfix_expression
6132 }
6135 {
6136 postfix_expression
6137 = (build_new_method_call
6143 complain));
6144 }
6145 else
6146 postfix_expression
6150 complain);
6151 }
6155 postfix_expression = (build_offset_ref_call_from_tree
6157 complain));
6159 /* A call to a static class member, or a namespace-scope
6160 function. */
6161 postfix_expression
6164 koenig_p,
6165 complain);
6166 else
6167 /* All other function calls. */
6168 postfix_expression
6171 koenig_p,
6172 complain);
6174 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6178 }
6183 /* postfix-expression . template [opt] id-expression
6184 postfix-expression . pseudo-destructor-name
6185 postfix-expression -> template [opt] id-expression
6186 postfix-expression -> pseudo-destructor-name */
6188 /* Consume the `.' or `->' operator. */
6191 postfix_expression
6193 postfix_expression,
6200 /* postfix-expression ++ */
6201 /* Consume the `++' token. */
6203 /* Generate a representation for the complete expression. */
6204 postfix_expression
6206 POSTINCREMENT_EXPR);
6207 /* Increments may not appear in constant-expressions. */
6215 /* postfix-expression -- */
6216 /* Consume the `--' token. */
6218 /* Generate a representation for the complete expression. */
6219 postfix_expression
6221 POSTDECREMENT_EXPR);
6222 /* Decrements may not appear in constant-expressions. */
6234 else
6236 }
6237 }
6239 /* We should never get here. */
6242 }
6244 /* This function parses Cilk Plus array notations. If a normal array expr. is
6245 parsed then the array index is passed back to the caller through *INIT_INDEX
6246 and the function returns a NULL_TREE. If array notation expr. is parsed,
6247 then *INIT_INDEX is ignored by the caller and the function returns
6248 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6249 error_mark_node. */
6251 static tree
6253 tree array_value)
6254 {
6258 {
6261 }
6270 {
6273 }
6275 {
6276 /* Consume the ':'. */
6279 /* If we are here, then we have a case like this A[:]. */
6281 {
6285 }
6289 }
6290 else
6291 {
6292 /* If we are here, then there are three valid possibilities:
6293 1. ARRAY [ EXP ]
6294 2. ARRAY [ EXP : EXP ]
6295 3. ARRAY [ EXP : EXP : EXP ] */
6299 {
6300 /* This indicates that we have a normal array expression. */
6303 }
6305 /* Consume the ':'. */
6309 {
6312 }
6313 }
6318 {
6322 }
6328 }
6330 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6331 by cp_parser_builtin_offsetof. We're looking for
6333 postfix-expression [ expression ]
6334 postfix-expression [ braced-init-list ] (C++11)
6336 FOR_OFFSETOF is set if we're being called in that context, which
6337 changes how we deal with integer constant expressions. */
6339 static tree
6341 tree postfix_expression,
6344 {
6349 /* Consume the `[' token. */
6355 /* Parse the index expression. */
6356 /* ??? For offsetof, there is a question of what to allow here. If
6357 offsetof is not being used in an integral constant expression context,
6358 then we *could* get the right answer by computing the value at runtime.
6359 If we are in an integral constant expression context, then we might
6360 could accept any constant expression; hard to say without analysis.
6361 Rather than open the barn door too wide right away, allow only integer
6362 constant expressions here. */
6365 else
6366 {
6368 {
6375 {
6377 "braced list index is not allowed with array "
6381 }
6382 }
6384 {
6385 /* Here are have these two options:
6386 ARRAY[EXP : EXP] - Array notation expr with default
6387 stride of 1.
6388 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6389 stride. */
6391 postfix_expression);
6394 }
6395 else
6397 }
6401 /* Look for the closing `]'. */
6404 /* Build the ARRAY_REF. */
6408 /* When not doing offsetof, array references are not permitted in
6409 constant-expressions. */
6415 }
6417 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6418 by cp_parser_builtin_offsetof. We're looking for
6420 postfix-expression . template [opt] id-expression
6421 postfix-expression . pseudo-destructor-name
6422 postfix-expression -> template [opt] id-expression
6423 postfix-expression -> pseudo-destructor-name
6425 FOR_OFFSETOF is set if we're being called in that context. That sorta
6426 limits what of the above we'll actually accept, but nevermind.
6427 TOKEN_TYPE is the "." or "->" token, which will already have been
6428 removed from the stream. */
6430 static tree
6433 tree postfix_expression,
6435 location_t location)
6436 {
6437 tree name;
6442 /* If this is a `->' operator, dereference the pointer. */
6445 tf_warning_or_error);
6446 /* Check to see whether or not the expression is type-dependent. */
6448 /* The identifier following the `->' or `.' is not qualified. */
6454 /* Enter the scope corresponding to the type of the object
6455 given by the POSTFIX_EXPRESSION. */
6457 {
6459 /* According to the standard, no expression should ever have
6460 reference type. Unfortunately, we do not currently match
6461 the standard in this respect in that our internal representation
6462 of an expression may have reference type even when the standard
6463 says it does not. Therefore, we have to manually obtain the
6464 underlying type here. */
6466 /* The type of the POSTFIX_EXPRESSION must be complete. */
6468 {
6470 postfix_expression);
6472 }
6473 /* Unlike the object expression in other contexts, *this is not
6474 required to be of complete type for purposes of class member
6475 access (5.2.5) outside the member function body. */
6479 /* Let the name lookup machinery know that we are processing a
6480 class member access expression. */
6482 /* If something went wrong, we want to be able to discern that case,
6483 as opposed to the case where there was no SCOPE due to the type
6484 of expression being dependent. */
6487 /* If the SCOPE was erroneous, make the various semantic analysis
6488 functions exit quickly -- and without issuing additional error
6489 messages. */
6492 }
6494 /* Assume this expression is not a pseudo-destructor access. */
6497 /* If the SCOPE is a scalar type, then, if this is a valid program,
6498 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6499 is type dependent, it can be pseudo-destructor-name or something else.
6500 Try to parse it as pseudo-destructor-name first. */
6502 {
6503 tree s;
6504 tree type;
6507 /* Parse the pseudo-destructor-name. */
6516 {
6518 postfix_expression
6521 }
6522 }
6525 {
6526 /* If the SCOPE is not a scalar type, we are looking at an
6527 ordinary class member access expression, rather than a
6528 pseudo-destructor-name. */
6531 /* Parse the id-expression. */
6532 name = (cp_parser_id_expression
6539 /* In general, build a SCOPE_REF if the member name is qualified.
6540 However, if the name was not dependent and has already been
6541 resolved; there is no need to build the SCOPE_REF. For example;
6543 struct X { void f(); };
6544 template <typename T> void f(T* t) { t->X::f(); }
6546 Even though "t" is dependent, "X::f" is not and has been resolved
6547 to a BASELINK; there is no need to include scope information. */
6549 /* But we do need to remember that there was an explicit scope for
6550 virtual function calls. */
6554 /* If the name is a template-id that names a type, we will get a
6555 TYPE_DECL here. That is invalid code. */
6557 {
6560 }
6561 else
6562 {
6564 {
6566 {
6570 }
6571 else
6574 name,
6575 template_p);
6579 }
6581 adjust_result_of_qualified_name_lookup
6583 postfix_expression
6585 template_p,
6586 tf_warning_or_error);
6587 }
6588 }
6590 /* We no longer need to look up names in the scope of the object on
6591 the left-hand side of the `.' or `->' operator. */
6594 /* Outside of offsetof, these operators may not appear in
6595 constant-expressions. */
6597 && (cp_parser_non_integral_constant_expression
6602 }
6604 /* Parse a parenthesized expression-list.
6606 expression-list:
6607 assignment-expression
6608 expression-list, assignment-expression
6610 attribute-list:
6611 expression-list
6612 identifier
6613 identifier, expression-list
6615 CAST_P is true if this expression is the target of a cast.
6617 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6618 argument pack.
6620 Returns a vector of trees. Each element is a representation of an
6621 assignment-expression. NULL is returned if the ( and or ) are
6622 missing. An empty, but allocated, vector is returned on no
6623 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6624 if we are parsing an attribute list for an attribute that wants a
6625 plain identifier argument, normal_attr for an attribute that wants
6626 an expression, or non_attr if we aren't parsing an attribute list. If
6627 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6628 not all of the expressions in the list were constant. */
6636 {
6642 /* Assume all the expressions will be constant. */
6651 /* Within a parenthesized expression, a `>' token is always
6652 the greater-than operator. */
6653 saved_greater_than_is_operator_p
6657 /* Consume expressions until there are no more. */
6660 {
6661 tree expr;
6663 /* At the beginning of attribute lists, check to see if the
6664 next token is an identifier. */
6667 {
6670 /* Consume the identifier. */
6672 /* Save the identifier. */
6674 }
6675 else
6676 {
6679 /* Parse the next assignment-expression. */
6681 {
6682 /* A braced-init-list. */
6688 }
6690 {
6691 expr = (cp_parser_constant_expression
6696 }
6697 else
6703 /* If we have an ellipsis, then this is an expression
6704 expansion. */
6707 {
6708 /* Consume the `...'. */
6711 /* Build the argument pack. */
6713 }
6715 /* Add it to the list. We add error_mark_node
6716 expressions to the list, so that we can still tell if
6717 the correct form for a parenthesized expression-list
6718 is found. That gives better errors. */
6723 }
6725 /* After the first item, attribute lists look the same as
6726 expression lists. */
6729 get_comma:;
6730 /* If the next token isn't a `,', then we are done. */
6734 /* Otherwise, consume the `,' and keep going. */
6736 }
6739 {
6742 skip_comma:;
6743 /* We try and resync to an unnested comma, as that will give the
6744 user better diagnostics. */
6752 {
6753 parser->greater_than_is_operator_p
6756 }
6757 }
6759 parser->greater_than_is_operator_p
6766 }
6768 /* Parse a pseudo-destructor-name.
6770 pseudo-destructor-name:
6771 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6772 :: [opt] nested-name-specifier template template-id :: ~ type-name
6773 :: [opt] nested-name-specifier [opt] ~ type-name
6775 If either of the first two productions is used, sets *SCOPE to the
6776 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6777 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6778 or ERROR_MARK_NODE if the parse fails. */
6780 static void
6782 tree object,
6785 {
6788 /* Handle ~auto. */
6792 {
6795 "%<~auto%> only available with "
6802 }
6804 /* Assume that things will not work out. */
6807 /* Look for the optional `::' operator. */
6809 /* Look for the optional nested-name-specifier. */
6810 nested_name_specifier_p
6817 /* Now, if we saw a nested-name-specifier, we might be doing the
6818 second production. */
6821 {
6822 /* Consume the `template' keyword. */
6824 /* Parse the template-id. */
6828 class_type,
6830 /* Look for the `::' token. */
6832 }
6833 /* If the next token is not a `~', then there might be some
6834 additional qualification. */
6836 {
6837 /* At this point, we're looking for "type-name :: ~". The type-name
6838 must not be a class-name, since this is a pseudo-destructor. So,
6839 it must be either an enum-name, or a typedef-name -- both of which
6840 are just identifiers. So, we peek ahead to check that the "::"
6841 and "~" tokens are present; if they are not, then we can avoid
6842 calling type_name. */
6846 {
6849 }
6851 /* Look for the type-name. */
6856 /* Look for the `::' token. */
6858 }
6859 else
6862 /* Look for the `~'. */
6865 /* Once we see the ~, this has to be a pseudo-destructor. */
6869 /* Look for the type-name again. We are not responsible for
6870 checking that it matches the first type-name. */
6872 }
6874 /* Parse a unary-expression.
6876 unary-expression:
6877 postfix-expression
6878 ++ cast-expression
6879 -- cast-expression
6880 unary-operator cast-expression
6881 sizeof unary-expression
6882 sizeof ( type-id )
6883 alignof ( type-id ) [C++0x]
6884 new-expression
6885 delete-expression
6887 GNU Extensions:
6889 unary-expression:
6890 __extension__ cast-expression
6891 __alignof__ unary-expression
6892 __alignof__ ( type-id )
6893 alignof unary-expression [C++0x]
6894 __real__ cast-expression
6895 __imag__ cast-expression
6896 && identifier
6897 sizeof ( type-id ) { initializer-list , [opt] }
6898 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6899 __alignof__ ( type-id ) { initializer-list , [opt] }
6901 ADDRESS_P is true iff the unary-expression is appearing as the
6902 operand of the `&' operator. CAST_P is true if this expression is
6903 the target of a cast.
6905 Returns a representation of the expression. */
6907 static tree
6910 {
6914 /* Peek at the next token. */
6916 /* Some keywords give away the kind of expression. */
6918 {
6922 {
6925 {
6928 location_t first_loc;
6931 /* Consume the token. */
6934 /* Parse the operand. */
6939 else
6940 {
6941 /* ISO C++ defines alignof only with types, not with
6942 expressions. So pedwarn if alignof is used with a non-
6943 type expression. However, __alignof__ is ok. */
6946 "ISO C++ does not allow %<alignof%> "
6950 }
6951 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6952 SIZEOF_EXPR with the original operand. */
6954 {
6956 {
6958 {
6961 error_mark_node));
6963 }
6964 else
6968 }
6970 }
6972 }
6981 {
6982 /* The saved value of the PEDANTIC flag. */
6984 tree expr;
6986 /* Save away the PEDANTIC flag. */
6988 /* Parse the cast-expression. */
6990 /* Restore the PEDANTIC flag. */
6994 }
6998 {
6999 tree expression;
7001 /* Consume the `__real__' or `__imag__' token. */
7003 /* Parse the cast-expression. */
7005 /* Create the complete representation. */
7009 expression,
7010 tf_warning_or_error);
7011 }
7019 {
7020 tree expr;
7030 parser->type_definition_forbidden_message
7033 saved_integral_constant_expression_p
7035 saved_non_integral_constant_expression_p
7039 saved_greater_than_is_operator_p
7049 parser->greater_than_is_operator_p
7052 parser->integral_constant_expression_p
7054 parser->non_integral_constant_expression_p
7061 }
7065 }
7066 }
7068 /* Look for the `:: new' and `:: delete', which also signal the
7069 beginning of a new-expression, or delete-expression,
7070 respectively. If the next token is `::', then it might be one of
7071 these. */
7073 {
7076 /* See if the token after the `::' is one of the keywords in
7077 which we're interested. */
7079 /* If it's `new', we have a new-expression. */
7082 /* Similarly, for `delete'. */
7085 }
7087 /* Look for a unary operator. */
7089 /* The `++' and `--' operators can be handled similarly, even though
7090 they are not technically unary-operators in the grammar. */
7092 {
7097 /* Handle the GNU address-of-label extension. */
7100 {
7101 tree identifier;
7102 tree expression;
7105 /* Consume the '&&' token. */
7107 /* Look for the identifier. */
7109 /* Create an expression representing the address. */
7112 NIC_ADDR_LABEL))
7115 }
7116 }
7118 {
7119 tree cast_expression;
7125 /* Consume the operator token. */
7127 /* Parse the cast-expression. */
7128 cast_expression
7133 pidk);
7134 /* Now, build an appropriate representation. */
7136 {
7140 RO_UNARY_STAR,
7141 complain);
7146 /* Fall through. */
7149 cast_expression,
7150 complain);
7157 /* Fall through. */
7167 }
7171 non_constant_p))
7175 }
7179 decltype_p,
7180 pidk);
7181 }
7186 {
7189 }
7191 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7192 unary-operator, the corresponding tree code is returned. */
7194 static enum tree_code
7196 {
7198 {
7219 }
7220 }
7222 /* Parse a new-expression.
7224 new-expression:
7225 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7226 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7228 Returns a representation of the expression. */
7230 static tree
7232 {
7235 tree type;
7238 tree ret;
7240 /* Look for the optional `::' operator. */
7241 global_scope_p
7245 /* Look for the `new' operator. */
7247 /* There's no easy way to tell a new-placement from the
7248 `( type-id )' construct. */
7250 /* Look for a new-placement. */
7252 /* If that didn't work out, there's no new-placement. */
7254 {
7258 }
7260 /* If the next token is a `(', then we have a parenthesized
7261 type-id. */
7263 {
7267 /* Consume the `('. */
7270 /* Parse the type-id. */
7271 parser->type_definition_forbidden_message
7276 /* Look for the closing `)'. */
7279 /* There should not be a direct-new-declarator in this production,
7280 but GCC used to allowed this, so we check and emit a sensible error
7281 message for this case. */
7283 {
7289 }
7290 }
7291 /* Otherwise, there must be a new-type-id. */
7292 else
7295 /* If the next token is a `(' or '{', then we have a new-initializer. */
7299 else
7302 /* A new-expression may not appear in an integral constant
7303 expression. */
7306 else
7307 {
7308 /* Create a representation of the new-expression. */
7310 tf_warning_or_error);
7311 }
7319 }
7321 /* Parse a new-placement.
7323 new-placement:
7324 ( expression-list )
7326 Returns the same representation as for an expression-list. */
7330 {
7333 /* Parse the expression-list. */
7334 expression_list = (cp_parser_parenthesized_expression_list
7340 }
7342 /* Parse a new-type-id.
7344 new-type-id:
7345 type-specifier-seq new-declarator [opt]
7347 Returns the TYPE allocated. If the new-type-id indicates an array
7348 type, *NELTS is set to the number of elements in the last array
7349 bound; the TYPE will not include the last array bound. */
7351 static tree
7353 {
7354 cp_decl_specifier_seq type_specifier_seq;
7360 /* The type-specifier sequence must not contain type definitions.
7361 (It cannot contain declarations of new types either, but if they
7362 are not definitions we will catch that because they are not
7363 complete.) */
7365 parser->type_definition_forbidden_message
7367 /* Parse the type-specifier-seq. */
7371 /* Restore the old message. */
7377 /* Parse the new-declarator. */
7380 /* Determine the number of elements in the last array dimension, if
7381 any. */
7383 /* Skip down to the last array dimension. */
7388 {
7391 }
7396 {
7399 }
7402 {
7409 else
7411 }
7414 }
7416 /* Parse an (optional) new-declarator.
7418 new-declarator:
7419 ptr-operator new-declarator [opt]
7420 direct-new-declarator
7422 Returns the declarator. */
7426 {
7429 cp_cv_quals cv_quals;
7431 /* We don't know if there's a ptr-operator next, or not. */
7433 /* Look for a ptr-operator. */
7435 /* If that worked, look for more new-declarators. */
7437 {
7440 /* Parse another optional declarator. */
7443 declarator = cp_parser_make_indirect_declarator
7447 }
7449 /* If the next token is a `[', there is a direct-new-declarator. */
7454 }
7456 /* Parse a direct-new-declarator.
7458 direct-new-declarator:
7459 [ expression ]
7460 direct-new-declarator [constant-expression]
7462 */
7466 {
7470 {
7471 tree expression;
7474 /* Look for the opening `['. */
7479 /* The standard requires that the expression have integral
7480 type. DR 74 adds enumeration types. We believe that the
7481 real intent is that these expressions be handled like the
7482 expression in a `switch' condition, which also allows
7483 classes with a single conversion to integral or
7484 enumeration type. */
7486 {
7487 expression
7489 expression,
7492 {
7494 "expression in new-declarator must have integral "
7497 }
7498 }
7500 /* Look for the closing `]'. */
7503 /* Add this bound to the declarator. */
7506 /* If the next token is not a `[', then there are no more
7507 bounds. */
7510 }
7513 }
7515 /* Parse a new-initializer.
7517 new-initializer:
7518 ( expression-list [opt] )
7519 braced-init-list
7521 Returns a representation of the expression-list. */
7525 {
7529 {
7530 tree t;
7537 }
7538 else
7539 expression_list = (cp_parser_parenthesized_expression_list
7545 }
7547 /* Parse a delete-expression.
7549 delete-expression:
7550 :: [opt] delete cast-expression
7551 :: [opt] delete [ ] cast-expression
7553 Returns a representation of the expression. */
7555 static tree
7557 {
7560 tree expression;
7562 /* Look for the optional `::' operator. */
7563 global_scope_p
7567 /* Look for the `delete' keyword. */
7569 /* See if the array syntax is in use. */
7571 {
7572 /* Consume the `[' token. */
7574 /* Look for the `]' token. */
7576 /* Remember that this is the `[]' construct. */
7578 }
7579 else
7582 /* Parse the cast-expression. */
7585 /* A delete-expression may not appear in an integral constant
7586 expression. */
7591 tf_warning_or_error);
7592 }
7594 /* Returns true if TOKEN may start a cast-expression and false
7595 otherwise. */
7597 static bool
7599 {
7602 {
7643 /* In ((type ()) () the last () isn't a valid cast-expression,
7644 so the whole must be parsed as postfix-expression. */
7648 /* '[' may start a primary-expression in obj-c++. */
7654 }
7655 }
7657 /* Parse a cast-expression.
7659 cast-expression:
7660 unary-expression
7661 ( type-id ) cast-expression
7663 ADDRESS_P is true iff the unary-expression is appearing as the
7664 operand of the `&' operator. CAST_P is true if this expression is
7665 the target of a cast.
7667 Returns a representation of the expression. */
7669 static tree
7672 {
7673 /* If it's a `(', then we might be looking at a cast. */
7675 {
7681 /* There's no way to know yet whether or not this is a cast.
7682 For example, `(int (3))' is a unary-expression, while `(int)
7683 3' is a cast. So, we resort to parsing tentatively. */
7685 /* Types may not be defined in a cast. */
7687 parser->type_definition_forbidden_message
7689 /* Consume the `('. */
7691 /* A very tricky bit is that `(struct S) { 3 }' is a
7692 compound-literal (which we permit in C++ as an extension).
7693 But, that construct is not a cast-expression -- it is a
7694 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7695 is legal; if the compound-literal were a cast-expression,
7696 you'd need an extra set of parentheses.) But, if we parse
7697 the type-id, and it happens to be a class-specifier, then we
7698 will commit to the parse at that point, because we cannot
7699 undo the action that is done when creating a new class. So,
7700 then we cannot back up and do a postfix-expression.
7701 Another tricky case is the following (c++/29234):
7703 struct S { void operator () (); };
7705 void foo ()
7706 {
7707 ( S()() );
7708 }
7710 As a type-id we parse the parenthesized S()() as a function
7711 returning a function, groktypename complains and we cannot
7712 back up in this case either.
7714 Therefore, we scan ahead to the closing `)', and check to see
7715 if the tokens after the `)' can start a cast-expression. Otherwise
7716 we are dealing with an unary-expression, a postfix-expression
7717 or something else.
7719 Save tokens so that we can put them back. */
7722 /* We may be looking at a cast-expression. */
7723 cast_expression_p
7728 /* Roll back the tokens we skipped. */
7730 /* If we aren't looking at a cast-expression, simulate an error so
7731 that the call to cp_parser_parse_definitely below will fail. */
7734 else
7735 {
7738 /* Look for the type-id. */
7740 /* Look for the closing `)'. */
7743 }
7745 /* Restore the saved message. */
7748 /* At this point this can only be either a cast or a
7749 parenthesized ctor such as `(T ())' that looks like a cast to
7750 function returning T. */
7752 {
7758 pidk);
7760 /* Warn about old-style casts, if so requested. */
7767 /* Only type conversions to integral or enumeration types
7768 can be used in constant-expressions. */
7771 NIC_CAST))
7774 /* Perform the cast. */
7777 }
7778 else
7780 }
7782 /* If we get here, then it's not a cast, so it must be a
7783 unary-expression. */
7786 }
7788 /* Parse a binary expression of the general form:
7790 pm-expression:
7791 cast-expression
7792 pm-expression .* cast-expression
7793 pm-expression ->* cast-expression
7795 multiplicative-expression:
7796 pm-expression
7797 multiplicative-expression * pm-expression
7798 multiplicative-expression / pm-expression
7799 multiplicative-expression % pm-expression
7801 additive-expression:
7802 multiplicative-expression
7803 additive-expression + multiplicative-expression
7804 additive-expression - multiplicative-expression
7806 shift-expression:
7807 additive-expression
7808 shift-expression << additive-expression
7809 shift-expression >> additive-expression
7811 relational-expression:
7812 shift-expression
7813 relational-expression < shift-expression
7814 relational-expression > shift-expression
7815 relational-expression <= shift-expression
7816 relational-expression >= shift-expression
7818 GNU Extension:
7820 relational-expression:
7821 relational-expression <? shift-expression
7822 relational-expression >? shift-expression
7824 equality-expression:
7825 relational-expression
7826 equality-expression == relational-expression
7827 equality-expression != relational-expression
7829 and-expression:
7830 equality-expression
7831 and-expression & equality-expression
7833 exclusive-or-expression:
7834 and-expression
7835 exclusive-or-expression ^ and-expression
7837 inclusive-or-expression:
7838 exclusive-or-expression
7839 inclusive-or-expression | exclusive-or-expression
7841 logical-and-expression:
7842 inclusive-or-expression
7843 logical-and-expression && inclusive-or-expression
7845 logical-or-expression:
7846 logical-and-expression
7847 logical-or-expression || logical-and-expression
7849 All these are implemented with a single function like:
7851 binary-expression:
7852 simple-cast-expression
7853 binary-expression <token> binary-expression
7855 CAST_P is true if this expression is the target of a cast.
7857 The binops_by_token map is used to get the tree codes for each <token> type.
7858 binary-expressions are associated according to a precedence table. */
7860 #define TOKEN_PRECEDENCE(token) \
7861 (((token->type == CPP_GREATER \
7862 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7863 && !parser->greater_than_is_operator_p) \
7864 ? PREC_NOT_OPERATOR \
7865 : binops_by_token[token->type].prec)
7867 static tree
7873 {
7874 cp_parser_expression_stack stack;
7876 cp_parser_expression_stack_entry current;
7877 tree rhs;
7881 tree overload;
7883 /* Parse the first expression. */
7893 {
7894 /* Get an operator token. */
7900 {
7902 "%<>>%> operator is treated"
7906 }
7910 /* Popping an entry off the stack means we completed a subexpression:
7911 - either we found a token which is not an operator (`>' where it is not
7912 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7913 will happen repeatedly;
7914 - or, we found an operator which has lower priority. This is the case
7915 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7916 parsing `3 * 4'. */
7918 {
7921 else
7923 }
7925 get_rhs:
7929 /* We used the operator token. */
7932 /* For "false && x" or "true || x", x will never be executed;
7933 disable warnings while evaluating it. */
7939 /* Extract another operand. It may be the RHS of this expression
7940 or the LHS of a new, higher priority expression. */
7944 /* Get another operator token. Look up its precedence to avoid
7945 building a useless (immediately popped) stack entry for common
7946 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7950 {
7951 /* ... and prepare to parse the RHS of the new, higher priority
7952 expression. Since precedence levels on the stack are
7953 monotonically increasing, we do not have to care about
7954 stack overflows. */
7963 pop:
7965 /* If the stack is not empty, we have parsed into LHS the right side
7966 (`4' in the example above) of an expression we had suspended.
7967 We can use the information on the stack to recover the LHS (`3')
7968 from the stack together with the tree code (`MULT_EXPR'), and
7969 the precedence of the higher level subexpression
7970 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7971 which will be used to actually build the additive expression. */
7976 }
7978 /* Undo the disabling of warnings done above. */
7985 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7986 ERROR_MARK for everything that is not a binary expression.
7987 This makes warn_about_parentheses miss some warnings that
7988 involve unary operators. For unary expressions we should
7989 pass the correct tree_code unless the unary expression was
7990 surrounded by parentheses.
7991 */
7997 == tcc_comparison
8000 else
8009 /* If the binary operator required the use of an overloaded operator,
8010 then this expression cannot be an integral constant-expression.
8011 An overloaded operator can be used even if both operands are
8012 otherwise permissible in an integral constant-expression if at
8013 least one of the operands is of enumeration type. */
8017 NIC_OVERLOADED))
8019 }
8022 }
8024 static tree
8029 {
8032 }
8034 /* Parse the `? expression : assignment-expression' part of a
8035 conditional-expression. The LOGICAL_OR_EXPR is the
8036 logical-or-expression that started the conditional-expression.
8037 Returns a representation of the entire conditional-expression.
8039 This routine is used by cp_parser_assignment_expression.
8041 ? expression : assignment-expression
8043 GNU Extensions:
8045 ? : assignment-expression */
8047 static tree
8049 {
8050 tree expr;
8051 tree assignment_expr;
8055 /* Consume the `?' token. */
8060 {
8063 /* Implicit true clause. */
8067 }
8068 else
8069 {
8072 /* Parse the expression. */
8075 c_inhibit_evaluation_warnings +=
8079 }
8081 /* The next token should be a `:'. */
8083 /* Parse the assignment-expression. */
8087 /* Build the conditional-expression. */
8089 expr,
8090 assignment_expr,
8091 tf_warning_or_error);
8092 }
8094 /* Parse an assignment-expression.
8096 assignment-expression:
8097 conditional-expression
8098 logical-or-expression assignment-operator assignment_expression
8099 throw-expression
8101 CAST_P is true if this expression is the target of a cast.
8102 DECLTYPE_P is true if this expression is the operand of decltype.
8104 Returns a representation for the expression. */
8106 static tree
8109 {
8110 tree expr;
8112 /* If the next token is the `throw' keyword, then we're looking at
8113 a throw-expression. */
8116 /* Otherwise, it must be that we are looking at a
8117 logical-or-expression. */
8118 else
8119 {
8120 /* Parse the binary expressions (logical-or-expression). */
8122 decltype_p,
8124 /* If the next token is a `?' then we're actually looking at a
8125 conditional-expression. */
8128 else
8129 {
8132 /* If it's an assignment-operator, we're using the second
8133 production. */
8134 enum tree_code assignment_operator
8137 {
8139 location_t saved_input_location;
8141 /* Parse the right-hand side of the assignment. */
8147 /* An assignment may not appear in a
8148 constant-expression. */
8150 NIC_ASSIGNMENT))
8152 /* Build the assignment expression. Its default
8153 location is the location of the '=' token. */
8157 assignment_operator,
8158 rhs,
8161 }
8162 }
8163 }
8166 }
8168 static tree
8171 {
8174 }
8176 /* Parse an (optional) assignment-operator.
8178 assignment-operator: one of
8179 = *= /= %= += -= >>= <<= &= ^= |=
8181 GNU Extension:
8183 assignment-operator: one of
8184 <?= >?=
8186 If the next token is an assignment operator, the corresponding tree
8187 code is returned, and the token is consumed. For example, for
8188 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8189 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8190 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8191 operator, ERROR_MARK is returned. */
8193 static enum tree_code
8195 {
8199 /* Peek at the next token. */
8203 {
8249 /* Nothing else is an assignment operator. */
8251 }
8253 /* If it was an assignment operator, consume it. */
8258 }
8260 /* Parse an expression.
8262 expression:
8263 assignment-expression
8264 expression , assignment-expression
8266 CAST_P is true if this expression is the target of a cast.
8267 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8268 except possibly parenthesized or on the RHS of a comma (N3276).
8270 Returns a representation of the expression. */
8272 static tree
8275 {
8280 {
8281 tree assignment_expression;
8283 /* Parse the next assignment-expression. */
8284 assignment_expression
8287 /* We don't create a temporary for a call that is the immediate operand
8288 of decltype or on the RHS of a comma. But when we see a comma, we
8289 need to create a temporary for a call on the LHS. */
8294 assignment_expression
8298 /* If this is the first assignment-expression, we can just
8299 save it away. */
8302 else
8304 assignment_expression,
8306 /* If the next token is not a comma, then we are done with the
8307 expression. */
8310 /* Consume the `,'. */
8313 /* A comma operator cannot appear in a constant-expression. */
8316 }
8319 }
8323 {
8325 }
8327 /* Parse a constant-expression.
8329 constant-expression:
8330 conditional-expression
8332 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8333 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8334 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8335 is false, NON_CONSTANT_P should be NULL. */
8337 static tree
8341 {
8345 tree expression;
8347 /* It might seem that we could simply parse the
8348 conditional-expression, and then check to see if it were
8349 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8350 one that the compiler can figure out is constant, possibly after
8351 doing some simplifications or optimizations. The standard has a
8352 precise definition of constant-expression, and we must honor
8353 that, even though it is somewhat more restrictive.
8355 For example:
8357 int i[(2, 3)];
8359 is not a legal declaration, because `(2, 3)' is not a
8360 constant-expression. The `,' operator is forbidden in a
8361 constant-expression. However, GCC's constant-folding machinery
8362 will fold this operation to an INTEGER_CST for `3'. */
8364 /* Save the old settings. */
8366 saved_allow_non_integral_constant_expression_p
8369 /* We are now parsing a constant-expression. */
8371 parser->allow_non_integral_constant_expression_p
8374 /* Although the grammar says "conditional-expression", we parse an
8375 "assignment-expression", which also permits "throw-expression"
8376 and the use of assignment operators. In the case that
8377 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8378 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8379 actually essential that we look for an assignment-expression.
8380 For example, cp_parser_initializer_clauses uses this function to
8381 determine whether a particular assignment-expression is in fact
8382 constant. */
8384 /* Restore the old settings. */
8385 parser->integral_constant_expression_p
8387 parser->allow_non_integral_constant_expression_p
8390 {
8391 /* Require an rvalue constant expression here; that's what our
8392 callers expect. Reference constant expressions are handled
8393 separately in e.g. cp_parser_template_argument. */
8398 }
8401 parser->non_integral_constant_expression_p
8405 }
8407 /* Parse __builtin_offsetof.
8409 offsetof-expression:
8410 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8412 offsetof-member-designator:
8413 id-expression
8414 | offsetof-member-designator "." id-expression
8415 | offsetof-member-designator "[" expression "]"
8416 | offsetof-member-designator "->" id-expression */
8418 static tree
8420 {
8423 cp_id_kind dummy;
8426 /* We're about to accept non-integral-constant things, but will
8427 definitely yield an integral constant expression. Save and
8428 restore these values around our local parsing. */
8432 /* Consume the "__builtin_offsetof" token. */
8434 /* Consume the opening `('. */
8436 /* Parse the type-id. */
8438 /* Look for the `,'. */
8442 /* Build the (type *)null that begins the traditional offsetof macro. */
8444 tf_warning_or_error);
8446 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8450 {
8453 {
8455 /* offsetof-member-designator "[" expression "]" */
8461 /* offsetof-member-designator "->" identifier */
8464 /* FALLTHRU */
8467 /* offsetof-member-designator "." identifier */
8475 /* Consume the ")" token. */
8480 /* Error. We know the following require will fail, but
8481 that gives the proper error message. */
8486 }
8487 }
8489 success:
8490 /* If we're processing a template, we can't finish the semantics yet.
8491 Otherwise we can fold the entire expression now. */
8494 else
8497 failure:
8502 }
8504 /* Parse a trait expression.
8506 Returns a representation of the expression, the underlying type
8507 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8509 static tree
8511 {
8512 cp_trait_kind kind;
8515 cp_decl_specifier_seq decl_specs;
8518 {
8595 }
8597 /* Consume the token. */
8607 /* Build a trivial decl-specifier-seq. */
8611 /* Call grokdeclarator to figure out what type this is. */
8616 {
8624 /* Build a trivial decl-specifier-seq. */
8628 /* Call grokdeclarator to figure out what type this is. */
8631 }
8635 /* Complete the trait expression, which may mean either processing
8636 the trait expr now or saving it for template instantiation. */
8638 {
8647 }
8648 }
8650 /* Lambdas that appear in variable initializer or default argument scope
8651 get that in their mangling, so we need to record it. We might as well
8652 use the count for function and namespace scopes as well. */
8656 {
8657 tree t;
8662 static void
8664 {
8665 tree_int ti;
8667 /* Once we're inside a function, we ignore other scopes and just push
8668 the function again so that popping works properly. */
8675 {
8676 /* Don't reset the count if we're still in the same function. */
8679 }
8680 }
8682 static void
8684 {
8687 }
8689 static void
8691 {
8694 {
8697 }
8699 }
8701 /* Parse a lambda expression.
8703 lambda-expression:
8704 lambda-introducer lambda-declarator [opt] compound-statement
8706 Returns a representation of the expression. */
8708 static tree
8710 {
8712 tree type;
8722 /* We may be in the middle of deferred access check. Disable
8723 it now. */
8734 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8737 /* Now that we've started the type, add the capture fields for any
8738 explicit captures. */
8741 {
8742 /* Inside the class, surrounding template-parameter-lists do not apply. */
8743 unsigned int saved_num_template_parameter_lists
8747 bool fully_implicit_function_template_p
8751 bool auto_is_implicit_function_template_parm_p
8762 /* By virtue of defining a local class, a lambda expression has access to
8763 the private variables of enclosing classes. */
8772 /* The capture list was built up in reverse order; fix that now. */
8784 parser->fully_implicit_function_template_p
8788 parser->auto_is_implicit_function_template_parm_p
8790 }
8794 /* This field is only used during parsing of the lambda. */
8797 /* This lambda shouldn't have any proxies left at this point. */
8799 /* And now that we're done, push proxies for an enclosing lambda. */
8804 else
8806 }
8808 /* Parse the beginning of a lambda expression.
8810 lambda-introducer:
8811 [ lambda-capture [opt] ]
8813 LAMBDA_EXPR is the current representation of the lambda expression. */
8815 static void
8817 {
8818 /* Need commas after the first capture. */
8821 /* Eat the leading `['. */
8824 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8832 {
8835 }
8838 {
8840 tree capture_id;
8841 tree capture_init_expr;
8845 enum capture_kind_type
8846 {
8847 BY_COPY,
8848 BY_REFERENCE
8849 };
8853 {
8856 }
8860 else
8863 /* Possibly capture `this'. */
8865 {
8875 explicit_init_p);
8877 }
8879 /* Remember whether we want to capture as a reference or not. */
8881 {
8884 }
8886 /* Get the identifier. */
8891 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8892 delimiters, but I modified this to stop on unnested ']' as well. It
8893 was already changed to stop on unnested '}', so the
8894 "closing_parenthesis" name is no more misleading with my change. */
8895 {
8901 }
8903 /* Find the initializer for this capture. */
8907 {
8909 /* An explicit initializer exists. */
8912 "lambda capture initializers "
8918 {
8921 }
8922 }
8923 else
8924 {
8927 /* Turn the identifier into an id-expression. */
8928 capture_init_expr
8933 {
8936 }
8940 {
8943 capture_init_expr);
8946 }
8949 {
8952 capture_init_expr);
8955 }
8957 capture_init_expr
8958 = finish_id_expression
8960 capture_init_expr,
8974 {
8977 }
8978 else
8980 }
8984 {
8989 capture_id);
8993 "capture of %qD redundant with by-reference capture "
8995 }
8998 capture_id,
8999 capture_init_expr,
9001 explicit_init_p);
9002 }
9005 }
9007 /* Parse the (optional) middle of a lambda expression.
9009 lambda-declarator:
9010 < template-parameter-list [opt] >
9011 ( parameter-declaration-clause [opt] )
9012 attribute-specifier [opt]
9013 mutable [opt]
9014 exception-specification [opt]
9015 lambda-return-type-clause [opt]
9017 LAMBDA_EXPR is the current representation of the lambda expression. */
9019 static bool
9021 {
9022 /* 5.1.1.4 of the standard says:
9023 If a lambda-expression does not include a lambda-declarator, it is as if
9024 the lambda-declarator were ().
9025 This means an empty parameter list, no attributes, and no exception
9026 specification. */
9032 /* The template-parameter-list is optional, but must begin with
9033 an opening angle if present. */
9035 {
9038 "lambda templates are only available with "
9047 /* We just processed one more parameter list. */
9049 }
9051 /* The parameter-declaration-clause is optional (unless
9052 template-parameter-list was given), but must begin with an
9053 opening parenthesis if present. */
9055 {
9060 /* Parse parameters. */
9063 /* Default arguments shall not be specified in the
9064 parameter-declaration-clause of a lambda-declarator. */
9074 /* Parse optional `mutable' keyword. */
9076 {
9079 }
9081 /* Parse optional exception specification. */
9084 /* Parse optional trailing return type. */
9086 {
9090 }
9092 /* The function parameters must be in scope all the way until after the
9093 trailing-return-type in case of decltype. */
9095 }
9099 /* Create the function call operator.
9101 Messing with declarators like this is no uglier than building up the
9102 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9103 other code. */
9104 {
9105 cp_decl_specifier_seq return_type_specs;
9107 tree fco;
9114 else
9115 /* Maybe we will deduce the return type later. */
9121 sfk_none);
9126 VIRT_SPEC_UNSPECIFIED,
9127 REF_QUAL_NONE,
9128 exception_spec,
9133 declarator,
9134 attributes);
9136 {
9139 /* Give the object parameter a different name. */
9141 }
9143 {
9147 }
9156 }
9157 }
9159 /* Parse the body of a lambda expression, which is simply
9161 compound-statement
9163 but which requires special handling.
9164 LAMBDA_EXPR is the current representation of the lambda expression. */
9166 static void
9168 {
9173 else
9174 /* Still increment function_depth so that we don't GC in the
9175 middle of an expression. */
9177 /* Clear this in case we're in the middle of a default argument. */
9180 /* Finish the function call operator
9181 - class_specifier
9182 + late_parsing_for_member
9183 + function_definition_after_declarator
9184 + ctor_initializer_opt_and_function_body */
9185 {
9187 tree body;
9189 tree compound_stmt;
9190 tree cap;
9192 /* Let the front end know that we are going to be defining this
9193 function. */
9195 NULL_TREE,
9204 /* Push the proxies for any explicit captures. */
9211 /* 5.1.1.4 of the standard says:
9212 If a lambda-expression does not include a trailing-return-type, it
9213 is as if the trailing-return-type denotes the following type:
9214 * if the compound-statement is of the form
9215 { return attribute-specifier [opt] expression ; }
9216 the type of the returned expression after lvalue-to-rvalue
9217 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9218 (_conv.array_ 4.2), and function-to-pointer conversion
9219 (_conv.func_ 4.3);
9220 * otherwise, void. */
9222 /* In a lambda that has neither a lambda-return-type-clause
9223 nor a deducible form, errors should be reported for return statements
9224 in the body. Since we used void as the placeholder return type, parsing
9225 the body as usual will give such desired behavior. */
9229 {
9233 /* Parse tentatively in case there's more after the initial return
9234 statement. */
9245 {
9249 /* Will get error here if type not deduced yet. */
9253 }
9254 }
9257 {
9262 }
9266 out:
9270 /* Finish the function and generate code for it if necessary. */
9273 /* Only expand if the call op is not a template. */
9276 }
9281 else
9283 }
9285 /* Statements [gram.stmt.stmt] */
9287 /* Parse a statement.
9289 statement:
9290 labeled-statement
9291 expression-statement
9292 compound-statement
9293 selection-statement
9294 iteration-statement
9295 jump-statement
9296 declaration-statement
9297 try-block
9299 C++11:
9301 statement:
9302 labeled-statement
9303 attribute-specifier-seq (opt) expression-statement
9304 attribute-specifier-seq (opt) compound-statement
9305 attribute-specifier-seq (opt) selection-statement
9306 attribute-specifier-seq (opt) iteration-statement
9307 attribute-specifier-seq (opt) jump-statement
9308 declaration-statement
9309 attribute-specifier-seq (opt) try-block
9311 TM Extension:
9313 statement:
9314 atomic-statement
9316 IN_COMPOUND is true when the statement is nested inside a
9317 cp_parser_compound_statement; this matters for certain pragmas.
9319 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9320 is a (possibly labeled) if statement which is not enclosed in braces
9321 and has an else clause. This is used to implement -Wparentheses. */
9323 static void
9326 {
9331 restart:
9334 /* There is no statement yet. */
9340 /* In obj-c++, seeing '[[' might be the either the beginning of
9341 c++11 attributes, or a nested objc-message-expression. So
9342 let's parse the c++11 attributes tentatively. */
9346 {
9349 }
9351 /* Peek at the next token. */
9353 /* Remember the location of the first token in the statement. */
9355 /* If this is a keyword, then that will often determine what kind of
9356 statement we have. */
9358 {
9362 {
9365 /* Looks like a labeled-statement with a case label.
9366 Parse the label, and then use tail recursion to parse
9367 the statement. */
9389 /* Objective-C++ exception-handling constructs. */
9403 /* This must be a namespace alias definition. */
9416 /* It might be a keyword like `int' that can start a
9417 declaration-statement. */
9419 }
9420 }
9422 {
9423 /* If the next token is a `:', then we are looking at a
9424 labeled-statement. */
9427 {
9428 /* Looks like a labeled-statement with an ordinary label.
9429 Parse the label, and then use tail recursion to parse
9430 the statement. */
9434 }
9435 }
9436 /* Anything that starts with a `{' must be a compound-statement. */
9439 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9440 a statement all its own. */
9442 {
9443 /* Only certain OpenMP pragmas are attached to statements, and thus
9444 are considered statements themselves. All others are not. In
9445 the context of a compound, accept the pragma as a "statement" and
9446 return so that we can check for a close brace. Otherwise we
9447 require a real statement and must go back and read one. */
9453 }
9455 {
9458 }
9460 /* Everything else must be a declaration-statement or an
9461 expression-statement. Try for the declaration-statement
9462 first, unless we are looking at a `;', in which case we know that
9463 we have an expression-statement. */
9465 {
9467 {
9469 {
9470 /* Attributes should be parsed as part of the the
9471 declaration, so let's un-parse them. */
9474 }
9477 /* Try to parse the declaration-statement. */
9479 /* If that worked, we're done. */
9482 }
9483 /* Look for an expression-statement instead. */
9485 }
9487 /* Set the line number for the statement. */
9491 /* Note that for now, we don't do anything with c++11 statements
9492 parsed at this level. */
9495 OPT_Wattributes,
9497 }
9499 /* Parse the label for a labeled-statement, i.e.
9501 identifier :
9502 case constant-expression :
9503 default :
9505 GNU Extension:
9506 case constant-expression ... constant-expression : statement
9508 When a label is parsed without errors, the label is added to the
9509 parse tree by the finish_* functions, so this function doesn't
9510 have to return the label. */
9512 static void
9514 {
9519 /* The next token should be an identifier. */
9523 {
9526 }
9530 {
9532 {
9536 /* Consume the `case' token. */
9538 /* Parse the constant-expression. */
9541 NULL);
9545 {
9546 /* Consume the `...' token. */
9548 expr_hi =
9551 NULL);
9552 /* We don't need to emit warnings here, as the common code
9553 will do this for us. */
9554 }
9555 else
9560 else
9563 expr);
9564 }
9568 /* Consume the `default' token. */
9573 else
9578 /* Anything else must be an ordinary label. */
9581 }
9583 /* Require the `:' token. */
9586 /* An ordinary label may optionally be followed by attributes.
9587 However, this is only permitted if the attributes are then
9588 followed by a semicolon. This is because, for backward
9589 compatibility, when parsing
9590 lab: __attribute__ ((unused)) int i;
9591 we want the attribute to attach to "i", not "lab". */
9594 {
9595 tree attrs;
9602 ;
9603 else
9605 }
9611 }
9613 /* Parse an expression-statement.
9615 expression-statement:
9616 expression [opt] ;
9618 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9619 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9620 indicates whether this expression-statement is part of an
9621 expression statement. */
9623 static tree
9625 {
9629 /* If the next token is a ';', then there is no expression
9630 statement. */
9632 {
9636 {
9639 }
9640 }
9642 /* Give a helpful message for "A<T>::type t;" and the like. */
9645 {
9652 {
9653 /* A::A a; */
9658 }
9659 }
9661 /* Consume the final `;'. */
9666 /* This is the final expression statement of a statement
9667 expression. */
9673 }
9675 /* Parse a compound-statement.
9677 compound-statement:
9678 { statement-seq [opt] }
9680 GNU extension:
9682 compound-statement:
9683 { label-declaration-seq [opt] statement-seq [opt] }
9685 label-declaration-seq:
9686 label-declaration
9687 label-declaration-seq label-declaration
9689 Returns a tree representing the statement. */
9691 static tree
9694 {
9695 tree compound_stmt;
9697 /* Consume the `{'. */
9704 /* Begin the compound-statement. */
9706 /* If the next keyword is `__label__' we have a label declaration. */
9709 /* Parse an (optional) statement-seq. */
9711 /* Finish the compound-statement. */
9713 /* Consume the `}'. */
9717 }
9719 /* Parse an (optional) statement-seq.
9721 statement-seq:
9722 statement
9723 statement-seq [opt] statement */
9725 static void
9727 {
9728 /* Scan statements until there aren't any more. */
9730 {
9733 /* If we are looking at a `}', then we have run out of
9734 statements; the same is true if we have reached the end
9735 of file, or have stumbled upon a stray '@end'. */
9742 /* If we are in a compound statement and find 'else' then
9743 something went wrong. */
9745 {
9748 else
9749 {
9752 }
9753 }
9755 /* Parse the statement. */
9757 }
9758 }
9760 /* Parse a selection-statement.
9762 selection-statement:
9763 if ( condition ) statement
9764 if ( condition ) statement else statement
9765 switch ( condition ) statement
9767 Returns the new IF_STMT or SWITCH_STMT.
9769 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9770 is a (possibly labeled) if statement which is not enclosed in
9771 braces and has an else clause. This is used to implement
9772 -Wparentheses. */
9774 static tree
9776 {
9783 /* Peek at the next token. */
9786 /* See what kind of keyword it is. */
9789 {
9792 {
9793 tree statement;
9794 tree condition;
9796 /* Look for the `('. */
9798 {
9801 }
9803 /* Begin the selection-statement. */
9806 else
9809 /* Parse the condition. */
9811 /* Look for the `)'. */
9817 {
9821 /* Add the condition. */
9824 /* Parse the then-clause. */
9828 {
9836 }
9837 else
9843 /* If the next token is `else', parse the else-clause. */
9845 RID_ELSE))
9846 {
9847 /* Consume the `else' keyword. */
9850 /* Parse the else-clause. */
9852 {
9853 location_t loc;
9860 }
9861 else
9866 /* If we are currently parsing a then-clause, then
9867 IF_P will not be NULL. We set it to true to
9868 indicate that this if statement has an else clause.
9869 This may trigger the Wparentheses warning below
9870 when we get back up to the parent if statement. */
9873 }
9874 else
9875 {
9876 /* This if statement does not have an else clause. If
9877 NESTED_IF is true, then the then-clause is an if
9878 statement which does have an else clause. We warn
9879 about the potential ambiguity. */
9882 "suggest explicit braces to avoid ambiguous"
9884 }
9886 /* Now we're all done with the if-statement. */
9888 }
9889 else
9890 {
9894 /* Add the condition. */
9897 /* Parse the body of the switch-statement. */
9906 /* Now we're all done with the switch-statement. */
9908 }
9911 }
9917 }
9918 }
9920 /* Parse a condition.
9922 condition:
9923 expression
9924 type-specifier-seq declarator = initializer-clause
9925 type-specifier-seq declarator braced-init-list
9927 GNU Extension:
9929 condition:
9930 type-specifier-seq declarator asm-specification [opt]
9931 attributes [opt] = assignment-expression
9933 Returns the expression that should be tested. */
9935 static tree
9937 {
9938 cp_decl_specifier_seq type_specifiers;
9942 /* Try the declaration first. */
9944 /* New types are not allowed in the type-specifier-seq for a
9945 condition. */
9947 parser->type_definition_forbidden_message
9949 /* Parse the type-specifier-seq. */
9951 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9954 /* Restore the saved message. */
9956 /* If all is well, we might be looking at a declaration. */
9958 {
9959 tree decl;
9960 tree asm_specification;
9961 tree attributes;
9965 /* Parse the declarator. */
9970 /* Parse the attributes. */
9972 /* Parse the asm-specification. */
9974 /* If the next token is not an `=' or '{', then we might still be
9975 looking at an expression. For example:
9977 if (A(a).x)
9979 looks like a decl-specifier-seq and a declarator -- but then
9980 there is no `=', so this is an expression. */
9985 /* If we did see an `=' or '{', then we are looking at a declaration
9986 for sure. */
9988 {
9989 tree pushed_scope;
9993 /* Create the declaration. */
9999 /* Parse the initializer. */
10001 {
10005 }
10006 else
10007 {
10008 /* Consume the `='. */
10011 }
10015 /* Process the initializer. */
10018 asm_specification,
10019 flags);
10025 }
10026 }
10027 /* If we didn't even get past the declarator successfully, we are
10028 definitely not looking at a declaration. */
10029 else
10032 /* Otherwise, we are looking at an expression. */
10034 }
10036 /* Parses a for-statement or range-for-statement until the closing ')',
10037 not included. */
10039 static tree
10041 {
10045 /* Begin the for-statement. */
10048 /* Parse the initialization. */
10053 else
10055 }
10057 static tree
10059 {
10060 /* Normal for loop */
10063 tree stmt;
10066 /* The for-init-statement has already been parsed in
10067 cp_parser_for_init_statement, so no work is needed here. */
10070 /* If there's a condition, process it. */
10074 {
10078 }
10080 /* Look for the `;'. */
10083 /* If there's an expression, process it. */
10089 }
10091 /* Tries to parse a range-based for-statement:
10093 range-based-for:
10094 decl-specifier-seq declarator : expression
10096 The decl-specifier-seq declarator and the `:' are already parsed by
10097 cp_parser_for_init_statement. If processing_template_decl it returns a
10098 newly created RANGE_FOR_STMT; if not, it is converted to a
10099 regular FOR_STMT. */
10101 static tree
10104 {
10108 {
10111 }
10112 else
10115 /* If in template, STMT is converted to a normal for-statement
10116 at instantiation. If not, it is done just ahead. */
10118 {
10126 /* do_auto_deduction doesn't mess with template init-lists. */
10129 }
10130 else
10131 {
10134 }
10136 }
10138 /* Subroutine of cp_convert_range_for: given the initializer expression,
10139 builds up the range temporary. */
10141 static tree
10143 {
10146 /* Find out the type deduced by the declaration
10147 `auto &&__range = range_expr'. */
10152 /* Create the __range variable. */
10159 }
10161 /* Used by cp_parser_range_for in template context: we aren't going to
10162 do a full conversion yet, but we still need to resolve auto in the
10163 type of the for-range-declaration if present. This is basically
10164 a shortcut version of cp_convert_range_for. */
10166 static void
10168 {
10171 {
10174 iter_type = (cp_parser_perform_range_for_lookup
10177 {
10179 iter_type);
10181 tf_warning_or_error);
10184 }
10185 }
10186 }
10188 /* Converts a range-based for-statement into a normal
10189 for-statement, as per the definition.
10191 for (RANGE_DECL : RANGE_EXPR)
10192 BLOCK
10194 should be equivalent to:
10196 {
10197 auto &&__range = RANGE_EXPR;
10198 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10199 __begin != __end;
10200 ++__begin)
10201 {
10202 RANGE_DECL = *__begin;
10203 BLOCK
10204 }
10205 }
10207 If RANGE_EXPR is an array:
10208 BEGIN_EXPR = __range
10209 END_EXPR = __range + ARRAY_SIZE(__range)
10210 Else if RANGE_EXPR has a member 'begin' or 'end':
10211 BEGIN_EXPR = __range.begin()
10212 END_EXPR = __range.end()
10213 Else:
10214 BEGIN_EXPR = begin(__range)
10215 END_EXPR = end(__range);
10217 If __range has a member 'begin' but not 'end', or vice versa, we must
10218 still use the second alternative (it will surely fail, however).
10219 When calling begin()/end() in the third alternative we must use
10220 argument dependent lookup, but always considering 'std' as an associated
10221 namespace. */
10223 tree
10226 {
10232 /* If an error happened previously do nothing or else a lot of
10233 unhelpful errors would be issued. */
10235 else
10236 {
10237 tree range_temp;
10241 /* Can't bind a reference to an array of runtime bound. */
10243 else
10244 {
10249 LOOKUP_ONLYCONVERTING);
10251 }
10254 }
10256 /* The new for initialization statement. */
10264 LOOKUP_ONLYCONVERTING);
10273 LOOKUP_ONLYCONVERTING);
10277 /* The new for condition. */
10284 /* The new increment expression. */
10287 tf_warning_or_error);
10290 /* The declaration is initialized with *__begin inside the loop body. */
10293 tf_warning_or_error),
10295 LOOKUP_ONLYCONVERTING);
10298 }
10300 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10301 We need to solve both at the same time because the method used
10302 depends on the existence of members begin or end.
10303 Returns the type deduced for the iterator expression. */
10305 static tree
10307 {
10309 {
10312 }
10315 {
10320 }
10322 {
10323 /* If RANGE is an array, we will use pointer arithmetic. */
10326 range,
10330 }
10331 else
10332 {
10333 /* If it is not an array, we must do a bit of magic. */
10343 tf_warning_or_error);
10346 tf_warning_or_error);
10349 {
10350 /* Use the member functions. */
10353 else
10359 else
10362 }
10363 else
10364 {
10365 /* Use global functions with ADL. */
10372 tf_warning_or_error);
10374 tf_warning_or_error);
10376 tf_warning_or_error);
10378 tf_warning_or_error);
10381 }
10383 /* Last common checks. */
10385 {
10386 /* If one of the expressions is an error do no more checks. */
10389 }
10392 /* Can happen, when, eg, in a template context, Koenig lookup
10393 can't resolve begin/end (c++/58503). */
10395 else
10396 {
10398 /* The unqualified type of the __begin and __end temporaries should
10399 be the same, as required by the multiple auto declaration. */
10405 }
10406 }
10407 }
10409 /* Helper function for cp_parser_perform_range_for_lookup.
10410 Builds a tree for RANGE.IDENTIFIER(). */
10412 static tree
10414 {
10427 tf_warning_or_error);
10430 }
10432 /* Parse an iteration-statement.
10434 iteration-statement:
10435 while ( condition ) statement
10436 do statement while ( expression ) ;
10437 for ( for-init-statement condition [opt] ; expression [opt] )
10438 statement
10440 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10442 static tree
10444 {
10447 tree statement;
10450 /* Peek at the next token. */
10455 /* Remember whether or not we are already within an iteration
10456 statement. */
10459 /* See what kind of keyword it is. */
10462 {
10464 {
10465 tree condition;
10467 /* Begin the while-statement. */
10469 /* Look for the `('. */
10471 /* Parse the condition. */
10474 /* Look for the `)'. */
10476 /* Parse the dependent statement. */
10480 /* We're done with the while-statement. */
10482 }
10486 {
10487 tree expression;
10489 /* Begin the do-statement. */
10491 /* Parse the body of the do-statement. */
10496 /* Look for the `while' keyword. */
10498 /* Look for the `('. */
10500 /* Parse the expression. */
10502 /* We're done with the do-statement. */
10504 /* Look for the `)'. */
10506 /* Look for the `;'. */
10508 }
10512 {
10513 /* Look for the `('. */
10518 /* Look for the `)'. */
10521 /* Parse the body of the for-statement. */
10526 /* We're done with the for-statement. */
10528 }
10535 }
10538 }
10540 /* Parse a for-init-statement or the declarator of a range-based-for.
10541 Returns true if a range-based-for declaration is seen.
10543 for-init-statement:
10544 expression-statement
10545 simple-declaration */
10547 static bool
10549 {
10550 /* If the next token is a `;', then we have an empty
10551 expression-statement. Grammatically, this is also a
10552 simple-declaration, but an invalid one, because it does not
10553 declare anything. Therefore, if we did not handle this case
10554 specially, we would issue an error message about an invalid
10555 declaration. */
10557 {
10563 /* We're going to speculatively look for a declaration, falling back
10564 to an expression, if necessary. */
10566 /* Parse the declaration. */
10569 decl);
10572 {
10573 /* It is a range-for, consume the ':' */
10577 {
10579 "range-based %<for%> loops are not allowed "
10582 }
10583 }
10584 else
10585 /* The ';' is not consumed yet because we told
10586 cp_parser_simple_declaration not to. */
10591 /* If the tentative parse failed, then we shall need to look for an
10592 expression-statement. */
10593 }
10594 /* If we are here, it is an expression-statement. */
10597 }
10599 /* Parse a jump-statement.
10601 jump-statement:
10602 break ;
10603 continue ;
10604 return expression [opt] ;
10605 return braced-init-list ;
10606 goto identifier ;
10608 GNU extension:
10610 jump-statement:
10611 goto * expression ;
10613 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10615 static tree
10617 {
10623 /* Peek at the next token. */
10628 /* See what kind of keyword it is. */
10631 {
10635 {
10655 }
10661 {
10668 /* Fall through. */
10678 }
10683 {
10684 tree expr;
10688 {
10692 }
10695 else
10696 /* If the next token is a `;', then there is no
10697 expression. */
10699 /* Build the return-statement. */
10701 /* Look for the final `;'. */
10703 }
10707 /* Create the goto-statement. */
10709 {
10710 /* Issue a warning about this use of a GNU extension. */
10712 /* Consume the '*' token. */
10714 /* Parse the dependent expression. */
10716 }
10717 else
10719 /* Look for the final `;'. */
10726 }
10729 }
10731 /* Parse a declaration-statement.
10733 declaration-statement:
10734 block-declaration */
10736 static void
10738 {
10741 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10744 /* Parse the block-declaration. */
10747 /* Free any declarators allocated. */
10749 }
10751 /* Some dependent statements (like `if (cond) statement'), are
10752 implicitly in their own scope. In other words, if the statement is
10753 a single statement (as opposed to a compound-statement), it is
10754 none-the-less treated as if it were enclosed in braces. Any
10755 declarations appearing in the dependent statement are out of scope
10756 after control passes that point. This function parses a statement,
10757 but ensures that is in its own scope, even if it is not a
10758 compound-statement.
10760 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10761 is a (possibly labeled) if statement which is not enclosed in
10762 braces and has an else clause. This is used to implement
10763 -Wparentheses.
10765 Returns the new statement. */
10767 static tree
10769 {
10770 tree statement;
10775 /* Mark if () ; with a special NOP_EXPR. */
10777 {
10781 }
10782 /* if a compound is opened, we simply parse the statement directly. */
10785 /* If the token is not a `{', then we must take special action. */
10786 else
10787 {
10788 /* Create a compound-statement. */
10790 /* Parse the dependent-statement. */
10792 /* Finish the dummy compound-statement. */
10794 }
10796 /* Return the statement. */
10798 }
10800 /* For some dependent statements (like `while (cond) statement'), we
10801 have already created a scope. Therefore, even if the dependent
10802 statement is a compound-statement, we do not want to create another
10803 scope. */
10805 static void
10807 {
10808 /* If the token is a `{', then we must take special action. */
10811 else
10812 {
10813 /* Avoid calling cp_parser_compound_statement, so that we
10814 don't create a new scope. Do everything else by hand. */
10816 /* If the next keyword is `__label__' we have a label declaration. */
10819 /* Parse an (optional) statement-seq. */
10822 }
10823 }
10825 /* Declarations [gram.dcl.dcl] */
10827 /* Parse an optional declaration-sequence.
10829 declaration-seq:
10830 declaration
10831 declaration-seq declaration */
10833 static void
10835 {
10837 {
10848 {
10849 /* A declaration consisting of a single semicolon is
10850 invalid. Allow it unless we're being pedantic. */
10855 }
10857 /* If we're entering or exiting a region that's implicitly
10858 extern "C", modify the lang context appropriately. */
10860 {
10863 }
10865 {
10868 }
10871 {
10872 /* A top-level declaration can consist solely of a #pragma.
10873 A nested declaration cannot, so this is done here and not
10874 in cp_parser_declaration. (A #pragma at block scope is
10875 handled in cp_parser_statement.) */
10878 }
10880 /* Parse the declaration itself. */
10882 }
10883 }
10885 /* Parse a declaration.
10887 declaration:
10888 block-declaration
10889 function-definition
10890 template-declaration
10891 explicit-instantiation
10892 explicit-specialization
10893 linkage-specification
10894 namespace-definition
10896 GNU extension:
10898 declaration:
10899 __extension__ declaration */
10901 static void
10903 {
10904 cp_token token1;
10905 cp_token token2;
10910 /* Check for the `__extension__' keyword. */
10912 {
10913 /* Parse the qualified declaration. */
10915 /* Restore the PEDANTIC flag. */
10919 }
10921 /* Try to figure out what kind of declaration is present. */
10926 else
10927 {
10930 }
10932 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10935 /* If the next token is `extern' and the following token is a string
10936 literal, then we have a linkage specification. */
10940 /* If the next token is `template', then we have either a template
10941 declaration, an explicit instantiation, or an explicit
10942 specialization. */
10944 {
10945 /* `template <>' indicates a template specialization. */
10949 /* `template <' indicates a template declaration. */
10952 /* Anything else must be an explicit instantiation. */
10953 else
10955 }
10956 /* If the next token is `export', then we have a template
10957 declaration. */
10960 /* If the next token is `extern', 'static' or 'inline' and the one
10961 after that is `template', we have a GNU extended explicit
10962 instantiation directive. */
10969 /* If the next token is `namespace', check for a named or unnamed
10970 namespace definition. */
10976 /* An unnamed namespace definition. */
10980 /* An inline (associated) namespace definition. */
10984 /* Objective-C++ declaration/definition. */
10991 /* We must have either a block declaration or a function
10992 definition. */
10993 else
10994 /* Try to parse a block-declaration, or a function-definition. */
10997 /* Free any declarators allocated. */
10999 }
11001 /* Parse a block-declaration.
11003 block-declaration:
11004 simple-declaration
11005 asm-definition
11006 namespace-alias-definition
11007 using-declaration
11008 using-directive
11010 GNU Extension:
11012 block-declaration:
11013 __extension__ block-declaration
11015 C++0x Extension:
11017 block-declaration:
11018 static_assert-declaration
11020 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11021 part of a declaration-statement. */
11023 static void
11026 {
11030 /* Check for the `__extension__' keyword. */
11032 {
11033 /* Parse the qualified declaration. */
11035 /* Restore the PEDANTIC flag. */
11039 }
11041 /* Peek at the next token to figure out which kind of declaration is
11042 present. */
11045 /* If the next keyword is `asm', we have an asm-definition. */
11047 {
11051 }
11052 /* If the next keyword is `namespace', we have a
11053 namespace-alias-definition. */
11056 /* If the next keyword is `using', we have a
11057 using-declaration, a using-directive, or an alias-declaration. */
11059 {
11064 /* If the token after `using' is `namespace', then we have a
11065 using-directive. */
11069 /* If the second token after 'using' is '=', then we have an
11070 alias-declaration. */
11076 /* Otherwise, it's a using-declaration. */
11077 else
11080 }
11081 /* If the next keyword is `__label__' we have a misplaced label
11082 declaration. */
11084 {
11088 /* If the next token is now a `;', consume it. */
11091 }
11092 /* If the next token is `static_assert' we have a static assertion. */
11095 /* Anything else must be a simple-declaration. */
11096 else
11099 }
11101 /* Parse a simple-declaration.
11103 simple-declaration:
11104 decl-specifier-seq [opt] init-declarator-list [opt] ;
11106 init-declarator-list:
11107 init-declarator
11108 init-declarator-list , init-declarator
11110 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11111 function-definition as a simple-declaration.
11113 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11114 parsed declaration if it is an uninitialized single declarator not followed
11115 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11116 if present, will not be consumed. */
11118 static void
11122 {
11123 cp_decl_specifier_seq decl_specifiers;
11130 /* Defer access checks until we know what is being declared; the
11131 checks for names appearing in the decl-specifier-seq should be
11132 done as if we were in the scope of the thing being declared. */
11135 /* Parse the decl-specifier-seq. We have to keep track of whether
11136 or not the decl-specifier-seq declares a named class or
11137 enumeration type, since that is the only case in which the
11138 init-declarator-list is allowed to be empty.
11140 [dcl.dcl]
11142 In a simple-declaration, the optional init-declarator-list can be
11143 omitted only when declaring a class or enumeration, that is when
11144 the decl-specifier-seq contains either a class-specifier, an
11145 elaborated-type-specifier, or an enum-specifier. */
11147 CP_PARSER_FLAGS_OPTIONAL,
11150 /* We no longer need to defer access checks. */
11153 /* In a block scope, a valid declaration must always have a
11154 decl-specifier-seq. By not trying to parse declarators, we can
11155 resolve the declaration/expression ambiguity more quickly. */
11158 {
11161 }
11163 /* If the next two tokens are both identifiers, the code is
11164 erroneous. The usual cause of this situation is code like:
11166 T t;
11168 where "T" should name a type -- but does not. */
11171 {
11172 /* If parsing tentatively, we should commit; we really are
11173 looking at a declaration. */
11175 /* Give up. */
11177 }
11179 /* If we have seen at least one decl-specifier, and the next token
11180 is not a parenthesis, then we must be looking at a declaration.
11181 (After "int (" we might be looking at a functional cast.) */
11188 /* Keep going until we hit the `;' at the end of the simple
11189 declaration. */
11192 CPP_SEMICOLON))
11193 {
11196 tree decl;
11199 {
11200 /* If we are processing next declarator, coma is expected */
11206 }
11207 else
11210 /* Parse the init-declarator. */
11213 function_definition_allowed_p,
11215 declares_class_or_enum,
11217 maybe_range_for_decl);
11218 /* If an error occurred while parsing tentatively, exit quickly.
11219 (That usually happens when in the body of a function; each
11220 statement is treated as a declaration-statement until proven
11221 otherwise.) */
11224 /* Handle function definitions specially. */
11226 {
11227 /* If the next token is a `,', then we are probably
11228 processing something like:
11230 void f() {}, *p;
11232 which is erroneous. */
11234 {
11237 "mixing"
11239 }
11240 /* Otherwise, we're done with the list of declarators. */
11241 else
11242 {
11245 }
11246 }
11249 /* The next token should be either a `,' or a `;'. */
11251 /* If it's a `,', there are more declarators to come. */
11254 /* If it's a `;', we are done. */
11257 /* Anything else is an error. */
11258 else
11259 {
11260 /* If we have already issued an error message we don't need
11261 to issue another one. */
11265 /* Skip tokens until we reach the end of the statement. */
11267 /* If the next token is now a `;', consume it. */
11271 }
11272 /* After the first time around, a function-definition is not
11273 allowed -- even if it was OK at first. For example:
11275 int i, f() {}
11277 is not valid. */
11279 }
11281 /* Issue an error message if no declarators are present, and the
11282 decl-specifier-seq does not itself declare a class or
11283 enumeration: [dcl.dcl]/3. */
11285 {
11287 {
11291 /* Ensure an error is issued anyway when finish_decltype_type,
11292 called via cp_parser_decl_specifier_seq, returns a class or
11293 an enumeration (c++/51786). */
11296 }
11297 /* Perform any deferred access checks. */
11299 }
11301 /* Consume the `;'. */
11305 done:
11307 }
11309 /* Parse a decl-specifier-seq.
11311 decl-specifier-seq:
11312 decl-specifier-seq [opt] decl-specifier
11313 decl-specifier attribute-specifier-seq [opt] (C++11)
11315 decl-specifier:
11316 storage-class-specifier
11317 type-specifier
11318 function-specifier
11319 friend
11320 typedef
11322 GNU Extension:
11324 decl-specifier:
11325 attributes
11327 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11329 The parser flags FLAGS is used to control type-specifier parsing.
11331 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11332 flags:
11334 1: one of the decl-specifiers is an elaborated-type-specifier
11335 (i.e., a type declaration)
11336 2: one of the decl-specifiers is an enum-specifier or a
11337 class-specifier (i.e., a type definition)
11339 */
11341 static void
11343 cp_parser_flags flags,
11346 {
11350 cp_decl_spec ds;
11352 /* Clear DECL_SPECS. */
11355 /* Assume no class or enumeration type is declared. */
11358 /* Keep reading specifiers until there are no more to read. */
11360 {
11365 /* Peek at the next token. */
11368 /* Save the first token of the decl spec list for error
11369 reporting. */
11372 /* Handle attributes. */
11374 {
11375 /* Parse the attributes. */
11378 /* In a sequence of declaration specifiers, c++11 attributes
11379 appertain to the type that precede them. In that case
11380 [dcl.spec]/1 says:
11382 The attribute-specifier-seq affects the type only for
11383 the declaration it appears in, not other declarations
11384 involving the same type.
11386 But for now let's force the user to position the
11387 attribute either at the beginning of the declaration or
11388 after the declarator-id, which would clearly mean that it
11389 applies to the declarator. */
11391 {
11393 /* The c++11 attribute is at the beginning of the
11394 declaration. It appertains to the entity being
11396 else
11397 {
11399 {
11400 /* This is an attribute following a
11401 class-specifier. */
11406 }
11407 else
11408 {
11409 decl_specs->std_attributes
11411 attrs);
11414 }
11416 }
11417 }
11419 decl_specs->attributes
11421 attrs);
11425 }
11426 /* Assume we will find a decl-specifier keyword. */
11428 /* If the next token is an appropriate keyword, we can simply
11429 add it to the list. */
11431 {
11432 /* decl-specifier:
11433 friend
11434 constexpr */
11437 {
11440 }
11441 else
11442 {
11444 /* Consume the token. */
11446 }
11454 /* function-specifier:
11455 inline
11456 virtual
11457 explicit */
11464 /* decl-specifier:
11465 typedef */
11468 /* Consume the token. */
11470 /* A constructor declarator cannot appear in a typedef. */
11472 /* The "typedef" keyword can only occur in a declaration; we
11473 may as well commit at this point. */
11480 /* storage-class-specifier:
11481 auto
11482 register
11483 static
11484 extern
11485 mutable
11487 GNU Extension:
11488 thread */
11491 {
11492 /* Consume the token. */
11495 /* Complain about `auto' as a storage specifier, if
11496 we're complaining about C++0x compatibility. */
11500 /* Set the storage class anyway. */
11502 token);
11503 }
11504 else
11505 /* C++0x auto type-specifier. */
11513 /* Consume the token. */
11516 token);
11519 /* Consume the token. */
11525 /* We did not yet find a decl-specifier yet. */
11528 }
11538 /* Constructors are a special case. The `S' in `S()' is not a
11539 decl-specifier; it is the beginning of the declarator. */
11540 constructor_p
11541 = (!found_decl_spec
11542 && constructor_possible_p
11543 && (cp_parser_constructor_declarator_p
11546 /* If we don't have a DECL_SPEC yet, then we must be looking at
11547 a type-specifier. */
11549 {
11552 tree type_spec;
11554 type_spec
11556 decl_specs,
11562 /* If this type-specifier referenced a user-defined type
11563 (a typedef, class-name, etc.), then we can't allow any
11564 more such type-specifiers henceforth.
11566 [dcl.spec]
11568 The longest sequence of decl-specifiers that could
11569 possibly be a type name is taken as the
11570 decl-specifier-seq of a declaration. The sequence shall
11571 be self-consistent as described below.
11573 [dcl.type]
11575 As a general rule, at most one type-specifier is allowed
11576 in the complete decl-specifier-seq of a declaration. The
11577 only exceptions are the following:
11579 -- const or volatile can be combined with any other
11580 type-specifier.
11582 -- signed or unsigned can be combined with char, long,
11583 short, or int.
11585 -- ..
11587 Example:
11589 typedef char* Pc;
11590 void g (const int Pc);
11592 Here, Pc is *not* part of the decl-specifier seq; it's
11593 the declarator. Therefore, once we see a type-specifier
11594 (other than a cv-qualifier), we forbid any additional
11595 user-defined types. We *do* still allow things like `int
11596 int' to be considered a decl-specifier-seq, and issue the
11597 error message later. */
11600 /* A constructor declarator cannot follow a type-specifier. */
11602 {
11607 }
11608 }
11610 /* If we still do not have a DECL_SPEC, then there are no more
11611 decl-specifiers. */
11616 /* After we see one decl-specifier, further decl-specifiers are
11617 always optional. */
11619 }
11621 /* Don't allow a friend specifier with a class definition. */
11626 }
11628 /* Parse an (optional) storage-class-specifier.
11630 storage-class-specifier:
11631 auto
11632 register
11633 static
11634 extern
11635 mutable
11637 GNU Extension:
11639 storage-class-specifier:
11640 thread
11642 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11644 static tree
11646 {
11648 {
11652 /* Fall through for C++98. */
11659 /* Consume the token. */
11664 }
11665 }
11667 /* Parse an (optional) function-specifier.
11669 function-specifier:
11670 inline
11671 virtual
11672 explicit
11674 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11675 Updates DECL_SPECS, if it is non-NULL. */
11677 static tree
11680 {
11683 {
11689 /* 14.5.2.3 [temp.mem]
11691 A member function template shall not be virtual. */
11694 else
11704 }
11706 /* Consume the token. */
11708 }
11710 /* Parse a linkage-specification.
11712 linkage-specification:
11713 extern string-literal { declaration-seq [opt] }
11714 extern string-literal declaration */
11716 static void
11718 {
11719 tree linkage;
11721 /* Look for the `extern' keyword. */
11724 /* Look for the string-literal. */
11727 /* Transform the literal into an identifier. If the literal is a
11728 wide-character string, or contains embedded NULs, then we can't
11729 handle it as the user wants. */
11732 {
11734 /* Assume C++ linkage. */
11736 }
11737 else
11740 /* We're now using the new linkage. */
11743 /* If the next token is a `{', then we're using the first
11744 production. */
11746 {
11749 /* Consume the `{' token. */
11751 /* Parse the declarations. */
11753 /* Look for the closing `}'. */
11755 }
11756 /* Otherwise, there's just one declaration. */
11757 else
11758 {
11761 saved_in_unbraced_linkage_specification_p
11765 parser->in_unbraced_linkage_specification_p
11767 }
11769 /* We're done with the linkage-specification. */
11771 }
11773 /* Parse a static_assert-declaration.
11775 static_assert-declaration:
11776 static_assert ( constant-expression , string-literal ) ;
11778 If MEMBER_P, this static_assert is a class member. */
11780 static void
11782 {
11783 tree condition;
11784 tree message;
11786 location_t saved_loc;
11789 /* Peek at the `static_assert' token so we can keep track of exactly
11790 where the static assertion started. */
11794 /* Look for the `static_assert' keyword. */
11796 RT_STATIC_ASSERT))
11799 /* We know we are in a static assertion; commit to any tentative
11800 parse. */
11804 /* Parse the `(' starting the static assertion condition. */
11807 /* Parse the constant-expression. Allow a non-constant expression
11808 here in order to give better diagnostics in finish_static_assert. */
11809 condition =
11814 /* Parse the separating `,'. */
11817 /* Parse the string-literal message. */
11822 /* A `)' completes the static assertion. */
11829 /* A semicolon terminates the declaration. */
11832 /* Complete the static assertion, which may mean either processing
11833 the static assert now or saving it for template instantiation. */
11835 }
11837 /* Parse the expression in decltype ( expression ). */
11839 static tree
11842 {
11844 tree expr;
11846 /* First, try parsing an id-expression. */
11857 {
11860 cp_id_kind idk;
11864 /* Lookup the name we got back from the id-expression. */
11875 {
11876 /* Complete lookup of the id-expression. */
11877 expr = (finish_id_expression
11890 /* We found an id-expression, but it was something that we
11891 should not have found. This is an error, not something
11892 we can recover from, so note that we found an
11893 id-expression and we'll recover as gracefully as
11894 possible. */
11896 }
11901 /* We have an id-expression. */
11903 }
11906 {
11907 /* Abort the id-expression parse. */
11910 /* Parsing tentatively, again. */
11913 /* Parse a class member access. */
11921 /* We have an id-expression. */
11923 }
11926 /* We have parsed the complete id-expression or member access. */
11928 else
11929 {
11930 /* Abort our attempt to parse an id-expression or member access
11931 expression. */
11934 /* Parse a full expression. */
11937 }
11940 }
11942 /* Parse a `decltype' type. Returns the type.
11944 simple-type-specifier:
11945 decltype ( expression )
11946 C++14 proposal:
11947 decltype ( auto ) */
11949 static tree
11951 {
11952 tree expr;
11961 {
11962 /* Already parsed. */
11965 }
11967 /* Look for the `decltype' token. */
11971 /* Parse the opening `('. */
11975 /* decltype (auto) */
11978 {
11985 }
11987 /* Types cannot be defined in a `decltype' expression. Save away the
11988 old message. */
11991 /* And create the new one. */
11992 parser->type_definition_forbidden_message
11995 /* The restrictions on constant-expressions do not apply inside
11996 decltype expressions. */
11997 saved_integral_constant_expression_p
11999 saved_non_integral_constant_expression_p
12003 /* Within a parenthesized expression, a `>' token is always
12004 the greater-than operator. */
12005 saved_greater_than_is_operator_p
12009 /* Do not actually evaluate the expression. */
12012 /* Do not warn about problems with the expression. */
12017 /* Go back to evaluating expressions. */
12021 /* The `>' token might be the end of a template-id or
12022 template-parameter-list now. */
12023 parser->greater_than_is_operator_p
12026 /* Restore the old message and the integral constant expression
12027 flags. */
12029 parser->integral_constant_expression_p
12031 parser->non_integral_constant_expression_p
12034 /* Parse to the closing `)'. */
12036 {
12040 }
12043 tf_warning_or_error);
12045 rewrite:
12046 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12047 it again. */
12054 }
12056 /* Special member functions [gram.special] */
12058 /* Parse a conversion-function-id.
12060 conversion-function-id:
12061 operator conversion-type-id
12063 Returns an IDENTIFIER_NODE representing the operator. */
12065 static tree
12067 {
12068 tree type;
12069 tree saved_scope;
12070 tree saved_qualifying_scope;
12071 tree saved_object_scope;
12074 /* Look for the `operator' token. */
12077 /* When we parse the conversion-type-id, the current scope will be
12078 reset. However, we need that information in able to look up the
12079 conversion function later, so we save it here. */
12083 /* We must enter the scope of the class so that the names of
12084 entities declared within the class are available in the
12085 conversion-type-id. For example, consider:
12087 struct S {
12088 typedef int I;
12089 operator I();
12090 };
12092 S::operator I() { ... }
12094 In order to see that `I' is a type-name in the definition, we
12095 must be in the scope of `S'. */
12098 /* Parse the conversion-type-id. */
12100 /* Leave the scope of the class, if any. */
12103 /* Restore the saved scope. */
12107 /* If the TYPE is invalid, indicate failure. */
12111 }
12113 /* Parse a conversion-type-id:
12115 conversion-type-id:
12116 type-specifier-seq conversion-declarator [opt]
12118 Returns the TYPE specified. */
12120 static tree
12122 {
12123 tree attributes;
12124 cp_decl_specifier_seq type_specifiers;
12126 tree type_specified;
12129 /* Parse the attributes. */
12133 parser->type_definition_forbidden_message
12136 /* Parse the type-specifiers. */
12143 /* If that didn't work, stop. */
12146 /* Parse the conversion-declarator. */
12154 /* Don't give this error when parsing tentatively. This happens to
12155 work because we always parse this definitively once. */
12158 {
12160 {
12163 }
12167 }
12170 }
12172 /* Parse an (optional) conversion-declarator.
12174 conversion-declarator:
12175 ptr-operator conversion-declarator [opt]
12177 */
12181 {
12184 cp_cv_quals cv_quals;
12186 /* We don't know if there's a ptr-operator next, or not. */
12188 /* Try the ptr-operator. */
12191 /* If it worked, look for more conversion-declarators. */
12193 {
12196 /* Parse another optional declarator. */
12199 declarator = cp_parser_make_indirect_declarator
12203 }
12206 }
12208 /* Parse an (optional) ctor-initializer.
12210 ctor-initializer:
12211 : mem-initializer-list
12213 Returns TRUE iff the ctor-initializer was actually present. */
12215 static bool
12217 {
12218 /* If the next token is not a `:', then there is no
12219 ctor-initializer. */
12221 {
12222 /* Do default initialization of any bases and members. */
12227 }
12229 /* Consume the `:' token. */
12231 /* And the mem-initializer-list. */
12235 }
12237 /* Parse a mem-initializer-list.
12239 mem-initializer-list:
12240 mem-initializer ... [opt]
12241 mem-initializer ... [opt] , mem-initializer-list */
12243 static void
12245 {
12250 /* Let the semantic analysis code know that we are starting the
12251 mem-initializer-list. */
12256 /* Loop through the list. */
12258 {
12259 tree mem_initializer;
12262 /* Parse the mem-initializer. */
12264 /* If the next token is a `...', we're expanding member initializers. */
12266 {
12267 /* Consume the `...'. */
12270 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12271 can be expanded but members cannot. */
12274 {
12279 }
12281 /* Construct the pack expansion type. */
12284 }
12287 {
12291 }
12292 /* Look for a target constructor. */
12296 {
12299 {
12303 }
12305 }
12306 /* Add it to the list, unless it was erroneous. */
12308 {
12311 }
12312 /* If the next token is not a `,', we're done. */
12315 /* Consume the `,' token. */
12317 }
12319 /* Perform semantic analysis. */
12322 }
12324 /* Parse a mem-initializer.
12326 mem-initializer:
12327 mem-initializer-id ( expression-list [opt] )
12328 mem-initializer-id braced-init-list
12330 GNU extension:
12332 mem-initializer:
12333 ( expression-list [opt] )
12335 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12336 class) or FIELD_DECL (for a non-static data member) to initialize;
12337 the TREE_VALUE is the expression-list. An empty initialization
12338 list is represented by void_list_node. */
12340 static tree
12342 {
12343 tree mem_initializer_id;
12344 tree expression_list;
12345 tree member;
12348 /* Find out what is being initialized. */
12350 {
12354 }
12355 else
12356 {
12360 }
12366 {
12373 }
12374 else
12375 {
12385 }
12395 }
12397 /* Parse a mem-initializer-id.
12399 mem-initializer-id:
12400 :: [opt] nested-name-specifier [opt] class-name
12401 identifier
12403 Returns a TYPE indicating the class to be initializer for the first
12404 production. Returns an IDENTIFIER_NODE indicating the data member
12405 to be initialized for the second production. */
12407 static tree
12409 {
12413 tree id;
12417 /* `typename' is not allowed in this context ([temp.res]). */
12419 {
12421 "keyword %<typename%> not allowed in this context (a qualified "
12424 }
12425 /* Look for the optional `::' operator. */
12426 global_scope_p
12430 /* Look for the optional nested-name-specifier. The simplest way to
12431 implement:
12433 [temp.res]
12435 The keyword `typename' is not permitted in a base-specifier or
12436 mem-initializer; in these contexts a qualified name that
12437 depends on a template-parameter is implicitly assumed to be a
12438 type name.
12440 is to assume that we have seen the `typename' keyword at this
12441 point. */
12442 nested_name_specifier_p
12451 /* If there is a `::' operator or a nested-name-specifier, then we
12452 are definitely looking for a class-name. */
12457 typename_type,
12461 /* Otherwise, we could also be looking for an ordinary identifier. */
12463 /* Try a class-name. */
12467 none_type,
12471 /* If we found one, we're done. */
12474 /* Otherwise, look for an ordinary identifier. */
12476 }
12478 /* Overloading [gram.over] */
12480 /* Parse an operator-function-id.
12482 operator-function-id:
12483 operator operator
12485 Returns an IDENTIFIER_NODE for the operator which is a
12486 human-readable spelling of the identifier, e.g., `operator +'. */
12488 static tree
12490 {
12491 /* Look for the `operator' keyword. */
12494 /* And then the name of the operator itself. */
12496 }
12498 /* Return an identifier node for a user-defined literal operator.
12499 The suffix identifier is chained to the operator name identifier. */
12501 static tree
12503 {
12504 tree identifier;
12511 }
12513 /* Parse an operator.
12515 operator:
12516 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12517 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12518 || ++ -- , ->* -> () []
12520 GNU Extensions:
12522 operator:
12523 <? >? <?= >?=
12525 Returns an IDENTIFIER_NODE for the operator which is a
12526 human-readable spelling of the identifier, e.g., `operator +'. */
12528 static tree
12530 {
12535 /* Peek at the next token. */
12537 /* Figure out which operator we have. */
12539 {
12541 {
12544 /* The keyword should be either `new' or `delete'. */
12549 else
12552 /* Consume the `new' or `delete' token. */
12555 /* Peek at the next token. */
12557 /* If it's a `[' token then this is the array variant of the
12558 operator. */
12560 {
12561 /* Consume the `[' token. */
12563 /* Look for the `]' token. */
12567 }
12568 /* Otherwise, we have the non-array variant. */
12569 else
12573 }
12720 /* Consume the `('. */
12722 /* Look for the matching `)'. */
12727 /* Consume the `['. */
12729 /* Look for the matching `]'. */
12738 /* Fall through. */
12744 {
12747 }
12749 {
12752 }
12753 /* Consume the string. */
12755 /* Look for the suffix identifier. */
12758 {
12761 {
12764 }
12765 }
12767 {
12771 }
12772 else
12773 {
12776 }
12783 /* Fall through. */
12789 {
12792 }
12793 {
12796 {
12799 }
12801 /* Consume the user-defined string literal. */
12804 {
12807 }
12808 else
12810 }
12813 /* Anything else is an error. */
12815 }
12817 /* If we have selected an identifier, we need to consume the
12818 operator token. */
12821 /* Otherwise, no valid operator name was present. */
12822 else
12823 {
12826 }
12829 }
12831 /* Parse a template-declaration.
12833 template-declaration:
12834 export [opt] template < template-parameter-list > declaration
12836 If MEMBER_P is TRUE, this template-declaration occurs within a
12837 class-specifier.
12839 The grammar rule given by the standard isn't correct. What
12840 is really meant is:
12842 template-declaration:
12843 export [opt] template-parameter-list-seq
12844 decl-specifier-seq [opt] init-declarator [opt] ;
12845 export [opt] template-parameter-list-seq
12846 function-definition
12848 template-parameter-list-seq:
12849 template-parameter-list-seq [opt]
12850 template < template-parameter-list > */
12852 static void
12854 {
12855 /* Check for `export'. */
12857 {
12858 /* Consume the `export' token. */
12860 /* Warn that we do not support `export'. */
12862 }
12865 }
12867 /* Parse a template-parameter-list.
12869 template-parameter-list:
12870 template-parameter
12871 template-parameter-list , template-parameter
12873 Returns a TREE_LIST. Each node represents a template parameter.
12874 The nodes are connected via their TREE_CHAINs. */
12876 static tree
12878 {
12883 /* The loop below parses the template parms. We first need to know
12884 the total number of template parms to be able to compute proper
12885 canonical types of each dependent type. So after the loop, when
12886 we know the total number of template parms,
12887 end_template_parm_list computes the proper canonical types and
12888 fixes up the dependent types accordingly. */
12890 {
12891 tree parameter;
12894 location_t parm_loc;
12896 /* Parse the template-parameter. */
12901 /* Add it to the list. */
12904 parm_loc,
12905 parameter,
12906 is_non_type,
12907 is_parameter_pack);
12908 else
12909 {
12912 }
12914 /* If the next token is not a `,', we're done. */
12917 /* Otherwise, consume the `,' token. */
12919 }
12922 }
12924 /* Parse a template-parameter.
12926 template-parameter:
12927 type-parameter
12928 parameter-declaration
12930 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12931 the parameter. The TREE_PURPOSE is the default value, if any.
12932 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12933 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12934 set to true iff this parameter is a parameter pack. */
12936 static tree
12939 {
12943 tree parm;
12945 /* Assume it is a type parameter or a template parameter. */
12947 /* Assume it not a parameter pack. */
12949 /* Peek at the next token. */
12951 /* If it is `class' or `template', we have a type-parameter. */
12954 /* If it is `class' or `typename' we do not know yet whether it is a
12955 type parameter or a non-type parameter. Consider:
12957 template <typename T, typename T::X X> ...
12959 or:
12961 template <class C, class D*> ...
12963 Here, the first parameter is a type parameter, and the second is
12964 a non-type parameter. We can tell by looking at the token after
12965 the identifier -- if it is a `,', `=', or `>' then we have a type
12966 parameter. */
12968 {
12969 /* Peek at the token after `class' or `typename'. */
12971 /* If it's an ellipsis, we have a template type parameter
12972 pack. */
12975 /* If it's an identifier, skip it. */
12978 /* Now, see if the token looks like the end of a template
12979 parameter. */
12984 }
12986 /* Otherwise, it is a non-type parameter.
12988 [temp.param]
12990 When parsing a default template-argument for a non-type
12991 template-parameter, the first non-nested `>' is taken as the end
12992 of the template parameter-list rather than a greater-than
12993 operator. */
12995 parameter_declarator
13002 /* If the parameter declaration is marked as a parameter pack, set
13003 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13004 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13005 grokdeclarator. */
13008 {
13011 }
13014 {
13015 /* Can happen in some cases of erroneous input (c++/34892). */
13017 /* Consume the `...' for better error recovery. */
13019 }
13020 /* If the next token is an ellipsis, and we don't already have it
13021 marked as a parameter pack, then we have a parameter pack (that
13022 has no declarator). */
13025 && (declarator_can_be_parameter_pack
13027 {
13028 /* Consume the `...'. */
13033 }
13034 /* We might end up with a pack expansion as the type of the non-type
13035 template parameter, in which case this is a non-type template
13036 parameter pack. */
13039 {
13043 }
13046 {
13047 /* Parameter packs cannot have default arguments. However, a
13048 user may try to do so, so we'll parse them and give an
13049 appropriate diagnostic here. */
13053 /* Find the name of the parameter pack. */
13062 else
13066 /* Parse the default argument, but throw away the result. */
13068 }
13078 }
13080 /* Parse a type-parameter.
13082 type-parameter:
13083 class identifier [opt]
13084 class identifier [opt] = type-id
13085 typename identifier [opt]
13086 typename identifier [opt] = type-id
13087 template < template-parameter-list > class identifier [opt]
13088 template < template-parameter-list > class identifier [opt]
13089 = id-expression
13091 GNU Extension (variadic templates):
13093 type-parameter:
13094 class ... identifier [opt]
13095 typename ... identifier [opt]
13097 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13098 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13099 the declaration of the parameter.
13101 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13103 static tree
13105 {
13107 tree parameter;
13109 /* Look for a keyword to tell us what kind of parameter this is. */
13115 {
13118 {
13119 tree identifier;
13120 tree default_argument;
13122 /* If the next token is an ellipsis, we have a template
13123 argument pack. */
13125 {
13126 /* Consume the `...' token. */
13131 }
13133 /* If the next token is an identifier, then it names the
13134 parameter. */
13137 else
13140 /* Create the parameter. */
13143 /* If the next token is an `=', we have a default argument. */
13145 {
13146 /* Consume the `=' token. */
13148 /* Parse the default-argument. */
13152 /* Template parameter packs cannot have default
13153 arguments. */
13155 {
13158 "template parameter pack %qD cannot have a "
13160 else
13162 "template parameter packs cannot have "
13165 }
13167 }
13168 else
13171 /* Create the combined representation of the parameter and the
13172 default argument. */
13174 }
13178 {
13179 tree identifier;
13180 tree default_argument;
13182 /* Look for the `<'. */
13184 /* Parse the template-parameter-list. */
13186 /* Look for the `>'. */
13188 /* Look for the `class' keyword. */
13190 /* If the next token is an ellipsis, we have a template
13191 argument pack. */
13193 {
13194 /* Consume the `...' token. */
13199 }
13200 /* If the next token is an `=', then there is a
13201 default-argument. If the next token is a `>', we are at
13202 the end of the parameter-list. If the next token is a `,',
13203 then we are at the end of this parameter. */
13207 {
13209 /* Treat invalid names as if the parameter were nameless. */
13212 }
13213 else
13216 /* Create the template parameter. */
13218 identifier);
13220 /* If the next token is an `=', then there is a
13221 default-argument. */
13223 {
13226 /* Consume the `='. */
13228 /* Parse the id-expression. */
13230 /* save token before parsing the id-expression, for error
13231 reporting */
13233 default_argument
13241 /* If the id-expression was a template-id that refers to
13242 a template-class, we already have the declaration here,
13243 so no further lookup is needed. */
13244 ;
13245 else
13246 /* Look up the name. */
13247 default_argument
13249 none_type,
13255 /* See if the default argument is valid. */
13256 default_argument
13259 /* Template parameter packs cannot have default
13260 arguments. */
13262 {
13265 "template parameter pack %qD cannot "
13267 identifier);
13268 else
13272 }
13274 }
13275 else
13278 /* Create the combined representation of the parameter and the
13279 default argument. */
13281 }
13287 }
13290 }
13292 /* Parse a template-id.
13294 template-id:
13295 template-name < template-argument-list [opt] >
13297 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13298 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13299 returned. Otherwise, if the template-name names a function, or set
13300 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13301 names a class, returns a TYPE_DECL for the specialization.
13303 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13304 uninstantiated templates. */
13306 static tree
13312 {
13314 tree templ;
13315 tree arguments;
13316 tree template_id;
13323 /* If the next token corresponds to a template-id, there is no need
13324 to reparse it. */
13327 {
13330 /* Get the stored value. */
13332 /* Perform any access checks that were deferred. */
13335 {
13340 tf_warning_or_error);
13341 }
13342 /* Return the stored value. */
13344 }
13346 /* Avoid performing name lookup if there is no possibility of
13347 finding a template-id. */
13350 && !cp_parser_nth_token_starts_template_argument_list_p
13352 {
13355 }
13357 /* Remember where the template-id starts. */
13363 /* Parse the template-name. */
13366 check_dependency_p,
13367 is_declaration,
13368 tag_type,
13371 {
13374 }
13376 /* If we find the sequence `[:' after a template-name, it's probably
13377 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13378 parse correctly the argument list. */
13385 {
13387 /* Change `:' into `::'. */
13389 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13390 CPP_LESS. */
13393 /* Parse the arguments. */
13396 {
13397 /* If we couldn't parse an argument list, then we revert our changes
13398 and return simply an error. Maybe this is not a template-id
13399 after all. */
13404 }
13405 /* Otherwise, emit an error about the invalid digraph, but continue
13406 parsing because we got our argument list. */
13409 {
13412 "%<<:%> is an alternate spelling for %<[%>."
13415 {
13417 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13420 }
13421 }
13422 }
13423 else
13424 {
13425 /* Look for the `<' that starts the template-argument-list. */
13427 {
13430 }
13431 /* Parse the arguments. */
13433 }
13435 /* Build a representation of the specialization. */
13438 TEMPLATE_ID_EXPR,
13442 {
13444 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13445 template (rather than some instantiation thereof) only if
13446 is not nested within some other construct. For example, in
13447 "template <typename T> void f(T) { A<T>::", A<T> is just an
13448 instantiation of A. */
13451 CPP_SCOPE));
13452 template_id
13454 }
13455 else
13456 {
13457 /* If it's not a class-template or a template-template, it should be
13458 a function-template. */
13464 }
13466 /* If parsing tentatively, replace the sequence of tokens that makes
13467 up the template-id with a CPP_TEMPLATE_ID token. That way,
13468 should we re-parse the token stream, we will not have to repeat
13469 the effort required to do the parse, nor will we issue duplicate
13470 error messages about problems during instantiation of the
13471 template. */
13473 /* Don't do this if we had a parse error in a declarator; re-parsing
13474 might succeed if a name changes meaning (60361). */
13478 {
13481 /* Reset the contents of the START_OF_ID token. */
13483 /* Retrieve any deferred checks. Do not pop this access checks yet
13484 so the memory will not be reclaimed during token replacing below. */
13490 /* Purge all subsequent tokens. */
13493 /* ??? Can we actually assume that, if template_id ==
13494 error_mark_node, we will have issued a diagnostic to the
13495 user, as opposed to simply marking the tentative parse as
13496 failed? */
13499 }
13503 }
13505 /* Parse a template-name.
13507 template-name:
13508 identifier
13510 The standard should actually say:
13512 template-name:
13513 identifier
13514 operator-function-id
13516 A defect report has been filed about this issue.
13518 A conversion-function-id cannot be a template name because they cannot
13519 be part of a template-id. In fact, looking at this code:
13521 a.operator K<int>()
13523 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13524 It is impossible to call a templated conversion-function-id with an
13525 explicit argument list, since the only allowed template parameter is
13526 the type to which it is converting.
13528 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13529 `template' keyword, in a construction like:
13531 T::template f<3>()
13533 In that case `f' is taken to be a template-name, even though there
13534 is no way of knowing for sure.
13536 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13537 name refers to a set of overloaded functions, at least one of which
13538 is a template, or an IDENTIFIER_NODE with the name of the template,
13539 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13540 names are looked up inside uninstantiated templates. */
13542 static tree
13549 {
13550 tree identifier;
13551 tree decl;
13552 tree fns;
13555 /* If the next token is `operator', then we have either an
13556 operator-function-id or a conversion-function-id. */
13558 {
13559 /* We don't know whether we're looking at an
13560 operator-function-id or a conversion-function-id. */
13562 /* Try an operator-function-id. */
13564 /* If that didn't work, try a conversion-function-id. */
13566 {
13569 }
13570 }
13571 /* Look for the identifier. */
13572 else
13575 /* If we didn't find an identifier, we don't have a template-id. */
13579 /* If the name immediately followed the `template' keyword, then it
13580 is a template-name. However, if the next token is not `<', then
13581 we do not treat it as a template-name, since it is not being used
13582 as part of a template-id. This enables us to handle constructs
13583 like:
13585 template <typename T> struct S { S(); };
13586 template <typename T> S<T>::S();
13588 correctly. We would treat `S' as a template -- if it were `S<T>'
13589 -- but we do not if there is no `<'. */
13593 {
13594 /* In a declaration, in a dependent context, we pretend that the
13595 "template" keyword was present in order to improve error
13596 recovery. For example, given:
13598 template <typename T> void f(T::X<int>);
13600 we want to treat "X<int>" as a template-id. */
13602 && !template_keyword_p
13604 && check_dependency_p
13606 /* Do not do this for dtors (or ctors), since they never
13607 need the template keyword before their name. */
13609 {
13612 /* Explain what went wrong. */
13614 identifier);
13617 /* If parsing tentatively, find the location of the "<" token. */
13620 /* Parse the template arguments so that we can issue error
13621 messages about them. */
13624 /* Skip tokens until we find a good place from which to
13625 continue parsing. */
13630 /* If parsing tentatively, permanently remove the
13631 template argument list. That will prevent duplicate
13632 error messages from being issued about the missing
13633 "template" keyword. */
13639 }
13641 /* If the "template" keyword is present, then there is generally
13642 no point in doing name-lookup, so we just return IDENTIFIER.
13643 But, if the qualifying scope is non-dependent then we can
13644 (and must) do name-lookup normally. */
13650 }
13652 /* Look up the name. */
13654 tag_type,
13657 check_dependency_p,
13661 /* If DECL is a template, then the name was a template-name. */
13663 ;
13664 else
13665 {
13668 /* The standard does not explicitly indicate whether a name that
13669 names a set of overloaded declarations, some of which are
13670 templates, is a template-name. However, such a name should
13671 be a template-name; otherwise, there is no way to form a
13672 template-id for the overloaded templates. */
13680 {
13681 /* The name does not name a template. */
13684 }
13685 }
13687 /* If DECL is dependent, and refers to a function, then just return
13688 its name; we will look it up again during template instantiation. */
13690 {
13694 }
13697 }
13699 /* Parse a template-argument-list.
13701 template-argument-list:
13702 template-argument ... [opt]
13703 template-argument-list , template-argument ... [opt]
13705 Returns a TREE_VEC containing the arguments. */
13707 static tree
13709 {
13714 tree vec;
13721 /* Even if the template-id appears in an integral
13722 constant-expression, the contents of the argument list do
13723 not. */
13729 /* Parse the arguments. */
13730 do
13731 {
13732 tree argument;
13735 /* Consume the comma. */
13738 /* Parse the template-argument. */
13741 /* If the next token is an ellipsis, we're expanding a template
13742 argument pack. */
13744 {
13746 {
13750 }
13751 /* Consume the `...' token. */
13754 /* Make the argument into a TYPE_PACK_EXPANSION or
13755 EXPR_PACK_EXPANSION. */
13757 }
13760 {
13764 {
13767 }
13768 else
13770 }
13772 }
13785 #ifdef ENABLE_CHECKING
13787 #endif
13789 }
13791 /* Parse a template-argument.
13793 template-argument:
13794 assignment-expression
13795 type-id
13796 id-expression
13798 The representation is that of an assignment-expression, type-id, or
13799 id-expression -- except that the qualified id-expression is
13800 evaluated, so that the value returned is either a DECL or an
13801 OVERLOAD.
13803 Although the standard says "assignment-expression", it forbids
13804 throw-expressions or assignments in the template argument.
13805 Therefore, we use "conditional-expression" instead. */
13807 static tree
13809 {
13810 tree argument;
13816 cp_id_kind idk;
13818 /* There's really no way to know what we're looking at, so we just
13819 try each alternative in order.
13821 [temp.arg]
13823 In a template-argument, an ambiguity between a type-id and an
13824 expression is resolved to a type-id, regardless of the form of
13825 the corresponding template-parameter.
13827 Therefore, we try a type-id first. */
13830 /* If there was no error parsing the type-id but the next token is a
13831 '>>', our behavior depends on which dialect of C++ we're
13832 parsing. In C++98, we probably found a typo for '> >'. But there
13833 are type-id which are also valid expressions. For instance:
13835 struct X { int operator >> (int); };
13836 template <int V> struct Foo {};
13837 Foo<X () >> 5> r;
13839 Here 'X()' is a valid type-id of a function type, but the user just
13840 wanted to write the expression "X() >> 5". Thus, we remember that we
13841 found a valid type-id, but we still try to parse the argument as an
13842 expression to see what happens.
13844 In C++0x, the '>>' will be considered two separate '>'
13845 tokens. */
13849 {
13852 }
13853 else
13854 {
13855 /* If the next token isn't a `,' or a `>', then this argument wasn't
13856 really finished. This means that the argument is not a valid
13857 type-id. */
13860 /* If that worked, we're done. */
13863 }
13864 /* We're still not sure what the argument will be. */
13866 /* Try a template. */
13874 /* If the next token isn't a `,' or a `>', then this argument wasn't
13875 really finished. */
13879 {
13880 /* Figure out what is being referred to. If the id-expression
13881 was for a class template specialization, then we will have a
13882 TYPE_DECL at this point. There is no need to do name lookup
13883 at this point in that case. */
13886 none_type,
13895 }
13898 /* It must be a non-type argument. There permitted cases are given
13899 in [temp.arg.nontype]:
13901 -- an integral constant-expression of integral or enumeration
13902 type; or
13904 -- the name of a non-type template-parameter; or
13906 -- the name of an object or function with external linkage...
13908 -- the address of an object or function with external linkage...
13910 -- a pointer to member... */
13911 /* Look for a non-type template parameter. */
13913 {
13925 }
13927 /* If the next token is "&", the argument must be the address of an
13928 object or function with external linkage. */
13931 {
13934 }
13935 /* See if we might have an id-expression. */
13942 {
13945 address_p,
13952 else
13953 {
13954 tree probe;
13957 {
13958 /* Strip the dereference temporarily. */
13961 }
13963 /* If we're in a template, we represent a qualified-id referring
13964 to a static data member as a SCOPE_REF even if the scope isn't
13965 dependent so that we can check access control later. */
13970 {
13971 /* A variable without external linkage might still be a
13972 valid constant-expression, so no error is issued here
13973 if the external-linkage check fails. */
13976 }
13978 /* All overloaded functions are allowed; if the external
13979 linkage test does not pass, an error will be issued
13980 later. */
13981 ;
13985 /* A pointer-to-member. */
13986 ;
13988 ;
13989 else
13993 {
13996 tf_warning_or_error);
13997 else
14000 }
14001 }
14002 }
14003 /* If the argument started with "&", there are no other valid
14004 alternatives at this point. */
14006 {
14009 }
14011 /* If the argument wasn't successfully parsed as a type-id followed
14012 by '>>', the argument can only be a constant expression now.
14013 Otherwise, we try parsing the constant-expression tentatively,
14014 because the argument could really be a type-id. */
14026 /* We did our best to parse the argument as a non type-id, but that
14027 was the only alternative that matched (albeit with a '>' after
14028 it). We can assume it's just a typo from the user, and a
14029 diagnostic will then be issued. */
14031 }
14033 /* Parse an explicit-instantiation.
14035 explicit-instantiation:
14036 template declaration
14038 Although the standard says `declaration', what it really means is:
14040 explicit-instantiation:
14041 template decl-specifier-seq [opt] declarator [opt] ;
14043 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14044 supposed to be allowed. A defect report has been filed about this
14045 issue.
14047 GNU Extension:
14049 explicit-instantiation:
14050 storage-class-specifier template
14051 decl-specifier-seq [opt] declarator [opt] ;
14052 function-specifier template
14053 decl-specifier-seq [opt] declarator [opt] ; */
14055 static void
14057 {
14059 cp_decl_specifier_seq decl_specifiers;
14064 /* Look for an (optional) storage-class-specifier or
14065 function-specifier. */
14067 {
14068 extension_specifier
14071 extension_specifier
14074 }
14076 /* Look for the `template' keyword. */
14078 /* Let the front end know that we are processing an explicit
14079 instantiation. */
14081 /* [temp.explicit] says that we are supposed to ignore access
14082 control while processing explicit instantiation directives. */
14084 /* Parse a decl-specifier-seq. */
14086 CP_PARSER_FLAGS_OPTIONAL,
14089 /* If there was exactly one decl-specifier, and it declared a class,
14090 and there's no declarator, then we have an explicit type
14091 instantiation. */
14093 {
14094 tree type;
14098 /* Turn access control back on for names used during
14099 template instantiation. */
14104 }
14105 else
14106 {
14108 tree decl;
14110 /* Parse the declarator. */
14111 declarator
14121 {
14124 "explicit instantiation shall not use"
14128 "explicit instantiation shall not use"
14133 /* Turn access control back on for names used during
14134 template instantiation. */
14136 /* Do the explicit instantiation. */
14138 }
14139 else
14140 {
14142 /* Skip the body of the explicit instantiation. */
14144 }
14145 }
14146 /* We're done with the instantiation. */
14152 }
14154 /* Parse an explicit-specialization.
14156 explicit-specialization:
14157 template < > declaration
14159 Although the standard says `declaration', what it really means is:
14161 explicit-specialization:
14162 template <> decl-specifier [opt] init-declarator [opt] ;
14163 template <> function-definition
14164 template <> explicit-specialization
14165 template <> template-declaration */
14167 static void
14169 {
14173 /* Look for the `template' keyword. */
14175 /* Look for the `<'. */
14177 /* Look for the `>'. */
14179 /* We have processed another parameter list. */
14181 /* [temp]
14183 A template ... explicit specialization ... shall not have C
14184 linkage. */
14186 {
14188 /* Give it C++ linkage to avoid confusing other parts of the
14189 front end. */
14192 }
14193 else
14195 /* Let the front end know that we are beginning a specialization. */
14197 {
14200 }
14202 /* If the next keyword is `template', we need to figure out whether
14203 or not we're looking a template-declaration. */
14205 {
14210 else
14212 }
14213 else
14214 /* Parse the dependent declaration. */
14220 /* We're done with the specialization. */
14222 /* For the erroneous case of a template with C linkage, we pushed an
14223 implicit C++ linkage scope; exit that scope now. */
14226 /* We're done with this parameter list. */
14228 }
14230 /* Parse a type-specifier.
14232 type-specifier:
14233 simple-type-specifier
14234 class-specifier
14235 enum-specifier
14236 elaborated-type-specifier
14237 cv-qualifier
14239 GNU Extension:
14241 type-specifier:
14242 __complex__
14244 Returns a representation of the type-specifier. For a
14245 class-specifier, enum-specifier, or elaborated-type-specifier, a
14246 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14248 The parser flags FLAGS is used to control type-specifier parsing.
14250 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14251 in a decl-specifier-seq.
14253 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14254 class-specifier, enum-specifier, or elaborated-type-specifier, then
14255 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14256 if a type is declared; 2 if it is defined. Otherwise, it is set to
14257 zero.
14259 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14260 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14261 is set to FALSE. */
14263 static tree
14265 cp_parser_flags flags,
14270 {
14276 /* Assume this type-specifier does not declare a new type. */
14279 /* And that it does not specify a cv-qualifier. */
14282 /* Peek at the next token. */
14285 /* If we're looking at a keyword, we can use that to guide the
14286 production we choose. */
14289 {
14294 /* Look for the enum-specifier. */
14296 /* If that worked, we're done. */
14298 {
14303 type_spec,
14304 token,
14307 }
14308 else
14311 /* Any of these indicate either a class-specifier, or an
14312 elaborated-type-specifier. */
14319 /* Parse tentatively so that we can back up if we don't find a
14320 class-specifier. */
14322 /* Look for the class-specifier. */
14325 /* If that worked, we're done. */
14327 {
14332 type_spec,
14333 token,
14336 }
14338 /* Fall through. */
14339 elaborated_type_specifier:
14340 /* We're declaring (not defining) a class or enum. */
14344 /* Fall through. */
14346 /* Look for an elaborated-type-specifier. */
14347 type_spec
14348 = (cp_parser_elaborated_type_specifier
14351 is_declaration));
14354 type_spec,
14355 token,
14378 /* The `__complex__' keyword is a GNU extension. */
14384 }
14386 /* Handle simple keywords. */
14388 {
14390 {
14393 }
14395 }
14397 /* If we do not already have a type-specifier, assume we are looking
14398 at a simple-type-specifier. */
14400 decl_specs,
14401 flags);
14403 /* If we didn't find a type-specifier, and a type-specifier was not
14404 optional in this context, issue an error message. */
14406 {
14409 }
14412 }
14414 /* Parse a simple-type-specifier.
14416 simple-type-specifier:
14417 :: [opt] nested-name-specifier [opt] type-name
14418 :: [opt] nested-name-specifier template template-id
14419 char
14420 wchar_t
14421 bool
14422 short
14423 int
14424 long
14425 signed
14426 unsigned
14427 float
14428 double
14429 void
14431 C++0x Extension:
14433 simple-type-specifier:
14434 auto
14435 decltype ( expression )
14436 char16_t
14437 char32_t
14438 __underlying_type ( type-id )
14440 GNU Extension:
14442 simple-type-specifier:
14443 __int128
14444 __typeof__ unary-expression
14445 __typeof__ ( type-id )
14446 __typeof__ ( type-id ) { initializer-list , [opt] }
14448 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14449 appropriately updated. */
14451 static tree
14454 cp_parser_flags flags)
14455 {
14459 /* Peek at the next token. */
14462 /* If we're looking at a keyword, things are easy. */
14464 {
14524 {
14528 {
14531 "use of %<auto%> in lambda parameter declaration "
14532 "only available with "
14534 }
14537 "use of %<auto%> in parameter declaration "
14538 "only available with "
14540 else
14542 "ISO C++ forbids use of %<auto%> in parameter "
14544 }
14545 else
14550 /* Since DR 743, decltype can either be a simple-type-specifier by
14551 itself or begin a nested-name-specifier. Parsing it will replace
14552 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14553 handling below decide what to do. */
14559 /* Consume the `typeof' token. */
14561 /* Parse the operand to `typeof'. */
14563 /* If it is not already a TYPE, take its type. */
14569 token,
14578 token,
14588 token,
14593 }
14595 /* If token is an already-parsed decltype not followed by ::,
14596 it's a simple-type-specifier. */
14599 {
14603 token,
14607 }
14609 /* If the type-specifier was for a built-in type, we're done. */
14611 {
14612 /* Record the type. */
14619 type,
14620 token,
14625 /* Consume the token. */
14628 /* There is no valid C++ program where a non-template type is
14629 followed by a "<". That usually indicates that the user thought
14630 that the type was a template. */
14635 }
14637 /* The type-specifier must be a user-defined type. */
14639 {
14643 /* Don't gobble tokens or issue error messages if this is an
14644 optional type-specifier. */
14648 /* Look for the optional `::' operator. */
14649 global_p
14653 /* Look for the nested-name specifier. */
14654 qualified_p
14662 /* If we have seen a nested-name-specifier, and the next token
14663 is `template', then we are using the template-id production. */
14666 {
14667 /* Look for the template-id. */
14671 none_type,
14673 /* If the template-id did not name a type, we are out of
14674 luck. */
14676 {
14679 }
14680 }
14681 /* Otherwise, look for a type-name. */
14682 else
14684 /* Keep track of all name-lookups performed in class scopes. */
14686 && !global_p
14687 && !qualified_p
14691 /* If it didn't work out, we don't have a TYPE. */
14697 token,
14699 }
14701 /* If we didn't get a type-name, issue an error message. */
14703 {
14706 }
14709 {
14710 /* See if TYPE is an Objective-C type, and if so, parse and
14711 accept any protocol references following it. Do this before
14712 the cp_parser_check_for_invalid_template_id() call, because
14713 Objective-C types can be followed by '<...>' which would
14714 enclose protocol names rather than template arguments, and so
14715 everything is fine. */
14718 {
14722 /* Clobber the "unqualified" type previously entered into
14723 DECL_SPECS with the new, improved protocol-qualified version. */
14728 }
14730 /* There is no valid C++ program where a non-template type is
14731 followed by a "<". That usually indicates that the user
14732 thought that the type was a template. */
14734 none_type,
14736 }
14739 }
14741 /* Parse a type-name.
14743 type-name:
14744 class-name
14745 enum-name
14746 typedef-name
14747 simple-template-id [in c++0x]
14749 enum-name:
14750 identifier
14752 typedef-name:
14753 identifier
14755 Returns a TYPE_DECL for the type. */
14757 static tree
14759 {
14760 tree type_decl;
14762 /* We can't know yet whether it is a class-name or not. */
14764 /* Try a class-name. */
14768 none_type,
14772 /* If it's not a class-name, keep looking. */
14774 {
14776 /* It must be a typedef-name or an enum-name. */
14780 /* It is either a simple-template-id representing an
14781 instantiation of an alias template... */
14785 none_type,
14787 /* Note that this must be an instantiation of an alias template
14788 because [temp.names]/6 says:
14790 A template-id that names an alias template specialization
14791 is a type-name.
14793 Whereas [temp.names]/7 says:
14795 A simple-template-id that names a class template
14796 specialization is a class-name. */
14801 else
14805 /* ... Or a typedef-name or an enum-name. */
14807 }
14810 }
14812 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14814 enum-name:
14815 identifier
14817 typedef-name:
14818 identifier
14820 Returns a TYPE_DECL for the type. */
14822 static tree
14824 {
14825 tree type_decl;
14826 tree identifier;
14833 /* Look up the type-name. */
14840 {
14841 /* See if this is an Objective-C type. */
14846 }
14848 /* Issue an error if we did not find a type-name. */
14850 /* In Objective-C, we have the complication that class names are
14851 normally type names and start declarations (eg, the
14852 "NSObject" in "NSObject *object;"), but can be used in an
14853 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14854 is an expression. So, a classname followed by a dot is not a
14855 valid type-name. */
14858 {
14863 }
14864 /* Remember that the name was used in the definition of the
14865 current class so that we can check later to see if the
14866 meaning would have been different after the class was
14867 entirely defined. */
14873 }
14875 /* Parse an elaborated-type-specifier. Note that the grammar given
14876 here incorporates the resolution to DR68.
14878 elaborated-type-specifier:
14879 class-key :: [opt] nested-name-specifier [opt] identifier
14880 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14881 enum-key :: [opt] nested-name-specifier [opt] identifier
14882 typename :: [opt] nested-name-specifier identifier
14883 typename :: [opt] nested-name-specifier template [opt]
14884 template-id
14886 GNU extension:
14888 elaborated-type-specifier:
14889 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14890 class-key attributes :: [opt] nested-name-specifier [opt]
14891 template [opt] template-id
14892 enum attributes :: [opt] nested-name-specifier [opt] identifier
14894 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14895 declared `friend'. If IS_DECLARATION is TRUE, then this
14896 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14897 something is being declared.
14899 Returns the TYPE specified. */
14901 static tree
14905 {
14907 tree identifier;
14910 tree globalscope;
14913 /* See if we're looking at the `enum' keyword. */
14915 {
14916 /* Consume the `enum' token. */
14918 /* Remember that it's an enumeration type. */
14920 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14921 enums) is used here. */
14924 {
14928 /* Consume the `struct' or `class' and parse it anyway. */
14930 }
14931 /* Parse the attributes. */
14933 }
14934 /* Or, it might be `typename'. */
14936 RID_TYPENAME))
14937 {
14938 /* Consume the `typename' token. */
14940 /* Remember that it's a `typename' type. */
14942 }
14943 /* Otherwise it must be a class-key. */
14944 else
14945 {
14949 /* Parse the attributes. */
14951 }
14953 /* Look for the `::' operator. */
14956 /* Look for the nested-name-specifier. */
14958 {
14963 is_declaration))
14965 }
14966 else
14967 /* Even though `typename' is not present, the proposed resolution
14968 to Core Issue 180 says that in `class A<T>::B', `B' should be
14969 considered a type-name, even if `A<T>' is dependent. */
14974 is_declaration);
14975 /* For everything but enumeration types, consider a template-id.
14976 For an enumeration type, consider only a plain identifier. */
14978 {
14980 tree decl;
14982 /* Allow the `template' keyword. */
14984 /* If we didn't see `template', we don't know if there's a
14985 template-id or not. */
14988 /* Parse the template-id. */
14992 tag_type,
14993 is_declaration);
14994 /* If we didn't find a template-id, look for an ordinary
14995 identifier. */
14997 ;
14998 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14999 in effect, then we must assume that, upon instantiation, the
15000 template will correspond to a class. */
15004 typename_type,
15006 /* If the `typename' keyword is in effect and DECL is not a type
15007 decl, then type is non existent. */
15009 ;
15015 }
15018 {
15023 {
15026 }
15028 /* For a `typename', we needn't call xref_tag. */
15032 identifier,
15034 /* Look up a qualified name in the usual way. */
15036 {
15037 tree decl;
15038 tree ambiguous_decls;
15041 tag_type,
15048 /* If the lookup was ambiguous, an error will already have been
15049 issued. */
15053 /* If we are parsing friend declaration, DECL may be a
15054 TEMPLATE_DECL tree node here. However, we need to check
15055 whether this TEMPLATE_DECL results in valid code. Consider
15056 the following example:
15058 namespace N {
15059 template <class T> class C {};
15060 }
15061 class X {
15062 template <class T> friend class N::C; // #1, valid code
15063 };
15064 template <class T> class Y {
15065 friend class N::C; // #2, invalid code
15066 };
15068 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15069 name lookup of `N::C'. We see that friend declaration must
15070 be template for the code to be valid. Note that
15071 processing_template_decl does not work here since it is
15072 always 1 for the above two cases. */
15074 decl = (cp_parser_maybe_treat_template_as_class
15079 {
15082 identifier,
15085 }
15088 {
15092 allow_template);
15096 }
15098 /* Forward declarations of nested types, such as
15100 class C1::C2;
15101 class C1::C2::C3;
15103 are invalid unless all components preceding the final '::'
15104 are complete. If all enclosing types are complete, these
15105 declarations become merely pointless.
15107 Invalid forward declarations of nested types are errors
15108 caught elsewhere in parsing. Those that are pointless arrive
15109 here. */
15116 }
15117 else
15118 {
15119 /* An elaborated-type-specifier sometimes introduces a new type and
15120 sometimes names an existing type. Normally, the rule is that it
15121 introduces a new type only if there is not an existing type of
15122 the same name already in scope. For example, given:
15124 struct S {};
15125 void f() { struct S s; }
15127 the `struct S' in the body of `f' is the same `struct S' as in
15128 the global scope; the existing definition is used. However, if
15129 there were no global declaration, this would introduce a new
15130 local class named `S'.
15132 An exception to this rule applies to the following code:
15134 namespace N { struct S; }
15136 Here, the elaborated-type-specifier names a new type
15137 unconditionally; even if there is already an `S' in the
15138 containing scope this declaration names a new type.
15139 This exception only applies if the elaborated-type-specifier
15140 forms the complete declaration:
15142 [class.name]
15144 A declaration consisting solely of `class-key identifier ;' is
15145 either a redeclaration of the name in the current scope or a
15146 forward declaration of the identifier as a class name. It
15147 introduces the name into the current scope.
15149 We are in this situation precisely when the next token is a `;'.
15151 An exception to the exception is that a `friend' declaration does
15152 *not* name a new type; i.e., given:
15154 struct S { friend struct T; };
15156 `T' is not a new type in the scope of `S'.
15158 Also, `new struct S' or `sizeof (struct S)' never results in the
15159 definition of a new type; a new type can only be declared in a
15160 declaration context. */
15162 tag_scope ts;
15166 /* Friends have special name lookup rules. */
15170 CPP_SEMICOLON))
15171 /* This is a `class-key identifier ;' */
15173 else
15176 template_p =
15180 /* An unqualified name was used to reference this type, so
15181 there were no qualifying templates. */
15188 }
15189 }
15194 /* Allow attributes on forward declarations of classes. */
15196 {
15206 else
15209 }
15212 {
15213 /* Indicate whether this class was declared as a `class' or as a
15214 `struct'. */
15218 }
15220 /* A "<" cannot follow an elaborated type specifier. If that
15221 happens, the user was probably trying to form a template-id. */
15226 }
15228 /* Parse an enum-specifier.
15230 enum-specifier:
15231 enum-head { enumerator-list [opt] }
15232 enum-head { enumerator-list , } [C++0x]
15234 enum-head:
15235 enum-key identifier [opt] enum-base [opt]
15236 enum-key nested-name-specifier identifier enum-base [opt]
15238 enum-key:
15239 enum
15240 enum class [C++0x]
15241 enum struct [C++0x]
15243 enum-base: [C++0x]
15244 : type-specifier-seq
15246 opaque-enum-specifier:
15247 enum-key identifier enum-base [opt] ;
15249 GNU Extensions:
15250 enum-key attributes[opt] identifier [opt] enum-base [opt]
15251 { enumerator-list [opt] }attributes[opt]
15252 enum-key attributes[opt] identifier [opt] enum-base [opt]
15253 { enumerator-list, }attributes[opt] [C++0x]
15255 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15256 if the token stream isn't an enum-specifier after all. */
15258 static tree
15260 {
15261 tree identifier;
15263 tree prev_scope;
15265 tree attributes;
15278 /* Parse tentatively so that we can back up if we don't find a
15279 enum-specifier. */
15282 /* Caller guarantees that the current token is 'enum', an identifier
15283 possibly follows, and the token after that is an opening brace.
15284 If we don't have an identifier, fabricate an anonymous name for
15285 the enumeration being defined. */
15288 /* Parse the "class" or "struct", which indicates a scoped
15289 enumeration type in C++0x. */
15292 {
15296 /* Consume the `struct' or `class' token. */
15300 }
15304 /* Clear the qualification. */
15309 /* Figure out in what scope the declaration is being placed. */
15315 nested_name_specifier
15323 {
15324 tree name;
15328 enum_type,
15333 input_location);
15335 {
15338 {
15339 /* Are template enums allowed in ISO? */
15343 /* ignore a typename reference, for it will be solved by name
15344 in start_enum. */
15346 }
15347 }
15350 else
15353 }
15354 else
15355 {
15358 else
15359 {
15365 }
15366 }
15369 /* Check for the `:' that denotes a specified underlying type in C++0x.
15370 Note that a ':' could also indicate a bitfield width, however. */
15372 {
15373 cp_decl_specifier_seq type_specifiers;
15375 /* Consume the `:'. */
15378 /* Parse the type-specifier-seq. */
15383 /* At this point this is surely not elaborated type specifier. */
15392 /* If that didn't work, stop. */
15394 {
15400 }
15401 }
15403 /* Look for the `{' but don't consume it yet. */
15405 {
15407 {
15410 {
15413 }
15414 }
15415 /* An opaque-enum-specifier must have a ';' here. */
15418 {
15421 {
15424 }
15425 }
15426 }
15432 {
15434 {
15438 }
15440 {
15442 }
15443 }
15445 /* Issue an error message if type-definitions are forbidden here. */
15448 else
15449 /* Create the new type. We do this before consuming the opening
15450 brace so the enum will be recorded as being on the line of its
15451 tag (or the 'enum' keyword, if there is no tag). */
15455 /* If the next token is not '{' it is an opaque-enum-specifier or an
15456 elaborated-type-specifier. */
15458 {
15462 {
15463 /* The following catches invalid code such as:
15464 enum class S<int>::E { A, B, C }; */
15472 {
15476 nested_name_specifier);
15478 }
15479 /* If that scope does not contain the scope in which the
15480 class was originally declared, the program is invalid. */
15482 nested_name_specifier))
15483 {
15486 "declaration of %qD in namespace %qD which does not "
15489 else
15491 "declaration of %qD in %qD which does not "
15495 }
15496 }
15501 /* Consume the opening brace. */
15508 {
15512 }
15513 else
15514 {
15519 }
15523 /* If the next token is not '}', then there are some enumerators. */
15525 {
15529 }
15530 else
15533 /* Consume the final '}'. */
15539 }
15540 else
15541 {
15542 /* If a ';' follows, then it is an opaque-enum-specifier
15543 and additional restrictions apply. */
15545 {
15552 }
15553 }
15555 /* Look for trailing attributes to apply to this enumeration, and
15556 apply them if appropriate. */
15558 {
15562 trailing_attr,
15564 }
15566 /* Finish up the enumeration. */
15568 {
15573 }
15576 {
15578 {
15581 }
15583 {
15585 }
15586 }
15587 out:
15590 }
15592 /* Parse an enumerator-list. The enumerators all have the indicated
15593 TYPE.
15595 enumerator-list:
15596 enumerator-definition
15597 enumerator-list , enumerator-definition */
15599 static void
15601 {
15603 {
15604 /* Parse an enumerator-definition. */
15607 /* If the next token is not a ',', we've reached the end of
15608 the list. */
15611 /* Otherwise, consume the `,' and keep going. */
15613 /* If the next token is a `}', there is a trailing comma. */
15615 {
15620 }
15621 }
15622 }
15624 /* Parse an enumerator-definition. The enumerator has the indicated
15625 TYPE.
15627 enumerator-definition:
15628 enumerator
15629 enumerator = constant-expression
15631 enumerator:
15632 identifier */
15634 static void
15636 {
15637 tree identifier;
15638 tree value;
15639 location_t loc;
15641 /* Save the input location because we are interested in the location
15642 of the identifier and not the location of the explicit value. */
15645 /* Look for the identifier. */
15650 /* If the next token is an '=', then there is an explicit value. */
15652 {
15653 /* Consume the `=' token. */
15655 /* Parse the value. */
15658 NULL);
15659 }
15660 else
15663 /* If we are processing a template, make sure the initializer of the
15664 enumerator doesn't contain any bare template parameter pack. */
15668 /* integral_constant_value will pull out this expression, so make sure
15669 it's folded as appropriate. */
15672 /* Create the enumerator. */
15674 }
15676 /* Parse a namespace-name.
15678 namespace-name:
15679 original-namespace-name
15680 namespace-alias
15682 Returns the NAMESPACE_DECL for the namespace. */
15684 static tree
15686 {
15687 tree identifier;
15688 tree namespace_decl;
15692 /* Get the name of the namespace. */
15697 /* Look up the identifier in the currently active scope. Look only
15698 for namespaces, due to:
15700 [basic.lookup.udir]
15702 When looking up a namespace-name in a using-directive or alias
15703 definition, only namespace names are considered.
15705 And:
15707 [basic.lookup.qual]
15709 During the lookup of a name preceding the :: scope resolution
15710 operator, object, function, and enumerator names are ignored.
15712 (Note that cp_parser_qualifying_entity only calls this
15713 function if the token after the name is the scope resolution
15714 operator.) */
15716 none_type,
15722 /* If it's not a namespace, issue an error. */
15725 {
15730 }
15733 }
15735 /* Parse a namespace-definition.
15737 namespace-definition:
15738 named-namespace-definition
15739 unnamed-namespace-definition
15741 named-namespace-definition:
15742 original-namespace-definition
15743 extension-namespace-definition
15745 original-namespace-definition:
15746 namespace identifier { namespace-body }
15748 extension-namespace-definition:
15749 namespace original-namespace-name { namespace-body }
15751 unnamed-namespace-definition:
15752 namespace { namespace-body } */
15754 static void
15756 {
15763 {
15767 }
15768 else
15771 /* Look for the `namespace' keyword. */
15774 /* Get the name of the namespace. We do not attempt to distinguish
15775 between an original-namespace-definition and an
15776 extension-namespace-definition at this point. The semantic
15777 analysis routines are responsible for that. */
15780 else
15783 /* Parse any specified attributes. */
15786 /* Look for the `{' to start the namespace. */
15788 /* Start the namespace. */
15791 /* "inline namespace" is equivalent to a stub namespace definition
15792 followed by a strong using directive. */
15794 {
15796 /* Set up namespace association. */
15800 /* Import the contents of the inline namespace. */
15804 }
15808 /* Parse the body of the namespace. */
15814 /* Finish the namespace. */
15816 /* Look for the final `}'. */
15818 }
15820 /* Parse a namespace-body.
15822 namespace-body:
15823 declaration-seq [opt] */
15825 static void
15827 {
15829 }
15831 /* Parse a namespace-alias-definition.
15833 namespace-alias-definition:
15834 namespace identifier = qualified-namespace-specifier ; */
15836 static void
15838 {
15839 tree identifier;
15840 tree namespace_specifier;
15844 /* Look for the `namespace' keyword. */
15846 /* Look for the identifier. */
15850 /* Look for the `=' token. */
15853 {
15855 /* Skip the definition. */
15860 }
15862 /* Look for the qualified-namespace-specifier. */
15863 namespace_specifier
15865 /* Look for the `;' token. */
15868 /* Register the alias in the symbol table. */
15870 }
15872 /* Parse a qualified-namespace-specifier.
15874 qualified-namespace-specifier:
15875 :: [opt] nested-name-specifier [opt] namespace-name
15877 Returns a NAMESPACE_DECL corresponding to the specified
15878 namespace. */
15880 static tree
15882 {
15883 /* Look for the optional `::'. */
15887 /* Look for the optional nested-name-specifier. */
15895 }
15897 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15898 access declaration.
15900 using-declaration:
15901 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15902 using :: unqualified-id ;
15904 access-declaration:
15905 qualified-id ;
15907 */
15909 static bool
15912 {
15916 tree decl;
15917 tree identifier;
15918 tree qscope;
15923 {
15926 }
15927 else
15928 {
15929 /* Look for the `using' keyword. */
15932 /* Peek at the next token. */
15934 /* See if it's `typename'. */
15936 {
15937 /* Remember that we've seen it. */
15939 /* Consume the `typename' token. */
15941 }
15942 }
15944 /* Look for the optional global scope qualification. */
15945 global_scope_p
15950 /* If we saw `typename', or didn't see `::', then there must be a
15951 nested-name-specifier present. */
15953 {
15959 {
15962 }
15963 }
15964 /* Otherwise, we could be in either of the two productions. In that
15965 case, treat the nested-name-specifier as optional. */
15966 else
15976 /* Something has already gone wrong; there's no need to parse
15977 further. Since an error has occurred, the return value of
15978 cp_parser_parse_definitely will be false, as required. */
15982 /* Parse the unqualified-id. */
15990 {
15995 }
15997 /* The function we call to handle a using-declaration is different
15998 depending on what scope we are in. */
16000 ;
16003 /* [namespace.udecl]
16005 A using declaration shall not name a template-id. */
16008 else
16009 {
16011 {
16012 /* Create the USING_DECL. */
16019 {
16022 }
16023 else
16024 /* Add it to the list of members in this class. */
16026 }
16027 else
16028 {
16030 identifier,
16037 {
16040 }
16043 else
16045 }
16046 }
16048 /* Look for the final `;'. */
16053 "access declarations are deprecated "
16054 "in favour of using-declarations; "
16058 }
16060 /* Parse an alias-declaration.
16062 alias-declaration:
16063 using identifier attribute-specifier-seq [opt] = type-id */
16065 static tree
16067 {
16069 location_t id_location;
16071 cp_decl_specifier_seq decl_specs;
16075 /* Look for the `using' keyword. */
16076 cp_token *using_token
16098 /* Now we are going to parse the type-id of the declaration. */
16100 /*
16101 [dcl.type]/3 says:
16103 "A type-specifier-seq shall not define a class or enumeration
16104 unless it appears in the type-id of an alias-declaration (7.1.3) that
16105 is not the declaration of a template-declaration."
16107 In other words, if we currently are in an alias template, the
16108 type-id should not define a type.
16110 So let's set parser->type_definition_forbidden_message in that
16111 case; cp_parser_check_type_definition (called by
16112 cp_parser_class_specifier) will then emit an error if a type is
16113 defined in the type-id. */
16115 {
16119 }
16123 /* Restore the error message if need be. */
16128 {
16131 }
16136 {
16139 }
16141 /* A typedef-name can also be introduced by an alias-declaration. The
16142 identifier following the using keyword becomes a typedef-name. It has
16143 the same semantics as if it were introduced by the typedef
16144 specifier. In particular, it does not define a new type and it shall
16145 not appear in the type-id. */
16150 {
16153 ds_attribute,
16154 attrs_token);
16155 }
16157 ds_typedef,
16158 using_token);
16160 ds_alias,
16161 using_token);
16170 else
16181 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16182 added into the symbol table; otherwise, return the TYPE_DECL. */
16186 {
16190 }
16193 }
16195 /* Parse a using-directive.
16197 using-directive:
16198 using namespace :: [opt] nested-name-specifier [opt]
16199 namespace-name ; */
16201 static void
16203 {
16204 tree namespace_decl;
16205 tree attribs;
16207 /* Look for the `using' keyword. */
16209 /* And the `namespace' keyword. */
16211 /* Look for the optional `::' operator. */
16213 /* And the optional nested-name-specifier. */
16219 /* Get the namespace being used. */
16221 /* And any specified attributes. */
16223 /* Update the symbol table. */
16225 /* Look for the final `;'. */
16227 }
16229 /* Parse an asm-definition.
16231 asm-definition:
16232 asm ( string-literal ) ;
16234 GNU Extension:
16236 asm-definition:
16237 asm volatile [opt] ( string-literal ) ;
16238 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16239 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16240 : asm-operand-list [opt] ) ;
16241 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16242 : asm-operand-list [opt]
16243 : asm-clobber-list [opt] ) ;
16244 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16245 : asm-clobber-list [opt]
16246 : asm-goto-list ) ; */
16248 static void
16250 {
16251 tree string;
16256 tree asm_stmt;
16264 /* Look for the `asm' keyword. */
16266 /* See if the next token is `volatile'. */
16269 {
16270 /* Remember that we saw the `volatile' keyword. */
16272 /* Consume the token. */
16274 }
16278 {
16279 /* Remember that we saw the `goto' keyword. */
16281 /* Consume the token. */
16283 }
16284 /* Look for the opening `('. */
16287 /* Look for the string. */
16290 {
16294 }
16296 /* If we're allowing GNU extensions, check for the extended assembly
16297 syntax. Unfortunately, the `:' tokens need not be separated by
16298 a space in C, and so, for compatibility, we tolerate that here
16299 too. Doing that means that we have to treat the `::' operator as
16300 two `:' tokens. */
16305 {
16310 /* The extended syntax was used. */
16313 /* Look for outputs. */
16315 {
16316 /* Consume the `:'. */
16318 /* Parse the output-operands. */
16320 CPP_COLON)
16322 CPP_SCOPE)
16324 CPP_CLOSE_PAREN)
16330 }
16331 /* If the next token is `::', there are no outputs, and the
16332 next token is the beginning of the inputs. */
16334 /* The inputs are coming next. */
16337 /* Look for inputs. */
16340 {
16341 /* Consume the `:' or `::'. */
16343 /* Parse the output-operands. */
16345 CPP_COLON)
16347 CPP_SCOPE)
16349 CPP_CLOSE_PAREN))
16354 }
16356 /* The clobbers are coming next. */
16359 /* Look for clobbers. */
16362 {
16364 /* Consume the `:' or `::'. */
16366 /* Parse the clobbers. */
16368 CPP_COLON)
16370 CPP_CLOSE_PAREN))
16372 }
16375 /* The labels are coming next. */
16378 /* Look for labels. */
16381 {
16383 /* Consume the `:' or `::'. */
16385 /* Parse the labels. */
16387 }
16391 }
16395 /* Look for the closing `)'. */
16403 {
16404 /* Create the ASM_EXPR. */
16406 {
16409 /* If the extended syntax was not used, mark the ASM_EXPR. */
16411 {
16417 }
16418 }
16419 else
16421 }
16422 }
16424 /* Declarators [gram.dcl.decl] */
16426 /* Parse an init-declarator.
16428 init-declarator:
16429 declarator initializer [opt]
16431 GNU Extension:
16433 init-declarator:
16434 declarator asm-specification [opt] attributes [opt] initializer [opt]
16436 function-definition:
16437 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16438 function-body
16439 decl-specifier-seq [opt] declarator function-try-block
16441 GNU Extension:
16443 function-definition:
16444 __extension__ function-definition
16446 TM Extension:
16448 function-definition:
16449 decl-specifier-seq [opt] declarator function-transaction-block
16451 The DECL_SPECIFIERS apply to this declarator. Returns a
16452 representation of the entity declared. If MEMBER_P is TRUE, then
16453 this declarator appears in a class scope. The new DECL created by
16454 this declarator is returned.
16456 The CHECKS are access checks that should be performed once we know
16457 what entity is being declared (and, therefore, what classes have
16458 befriended it).
16460 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16461 for a function-definition here as well. If the declarator is a
16462 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16463 be TRUE upon return. By that point, the function-definition will
16464 have been completely parsed.
16466 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16467 is FALSE.
16469 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16470 parsed declaration if it is an uninitialized single declarator not followed
16471 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16472 if present, will not be consumed. If returned, this declarator will be
16473 created with SD_INITIALIZED but will not call cp_finish_decl. */
16475 static tree
16484 {
16488 tree prefix_attributes;
16490 tree asm_specification;
16491 tree initializer;
16493 tree scope;
16495 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16496 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16497 "(...)". */
16507 /* Gather the attributes that were provided with the
16508 decl-specifiers. */
16511 /* Assume that this is not the declarator for a function
16512 definition. */
16516 /* Default arguments are only permitted for function parameters. */
16520 /* Defer access checks while parsing the declarator; we cannot know
16521 what names are accessible until we know what is being
16522 declared. */
16525 /* Parse the declarator. */
16527 declarator
16531 member_p);
16532 /* Gather up the deferred checks. */
16537 /* If the DECLARATOR was erroneous, there's no need to go
16538 further. */
16542 /* Check that the number of template-parameter-lists is OK. */
16552 /* Figure out what scope the entity declared by the DECLARATOR is
16553 located in. `grokdeclarator' sometimes changes the scope, so
16554 we compute it now. */
16557 /* Perform any lookups in the declared type which were thought to be
16558 dependent, but are not in the scope of the declarator. */
16559 decl_specifiers->type
16562 /* If we're allowing GNU extensions, look for an
16563 asm-specification. */
16565 {
16566 /* Look for an asm-specification. */
16569 }
16570 else
16573 /* Look for attributes. */
16577 /* Peek at the next token. */
16581 {
16582 /* Check to see if the token indicates the start of a
16583 function-definition. */
16585 {
16587 {
16588 /* If a function-definition should not appear here, issue an
16589 error message. */
16593 }
16595 location_t func_brace_location
16598 /* Neither attributes nor an asm-specification are allowed
16599 on a function-definition. */
16602 "an asm-specification is not allowed "
16606 "attributes are not allowed "
16608 /* This is a function-definition. */
16611 /* Parse the function definition. */
16614 decl_specifiers,
16615 declarator,
16616 prefix_attributes);
16617 else
16618 decl =
16619 (cp_parser_function_definition_from_specifiers_and_declarator
16623 {
16624 /* This is where the prologue starts... */
16627 }
16630 }
16631 }
16633 /* [dcl.dcl]
16635 Only in function declarations for constructors, destructors, and
16636 type conversions can the decl-specifier-seq be omitted.
16638 We explicitly postpone this check past the point where we handle
16639 function-definitions because we tolerate function-definitions
16640 that are missing their return types in some modes. */
16642 {
16646 }
16648 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16652 {
16660 {
16666 }
16667 }
16668 else
16669 {
16670 /* If the init-declarator isn't initialized and isn't followed by a
16671 `,' or `;', it's not a valid init-declarator. */
16674 {
16677 else
16678 {
16681 }
16682 }
16685 }
16687 /* Because start_decl has side-effects, we should only call it if we
16688 know we're going ahead. By this point, we know that we cannot
16689 possibly be looking at any other construct. */
16692 /* If the decl specifiers were bad, issue an error now that we're
16693 sure this was intended to be a declarator. Then continue
16694 declaring the variable(s), as int, to try to cut down on further
16695 errors. */
16698 {
16701 }
16703 /* Check to see whether or not this declaration is a friend. */
16706 /* Enter the newly declared entry in the symbol table. If we're
16707 processing a declaration in a class-specifier, we wait until
16708 after processing the initializer. */
16710 {
16717 /* Adjust location of decl if declarator->id_loc is more appropriate:
16718 set, and decl wasn't merged with another decl, in which case its
16719 location would be different from input_location, and more accurate. */
16724 }
16726 /* Enter the SCOPE. That way unqualified names appearing in the
16727 initializer will be looked up in SCOPE. */
16730 /* Perform deferred access control checks, now that we know in which
16731 SCOPE the declared entity resides. */
16733 {
16736 /* If the entity being declared is a function, pretend that we
16737 are in its scope. If it is a `friend', it may have access to
16738 things that would not otherwise be accessible. */
16740 {
16743 }
16745 /* Perform access checks for template parameters. */
16748 /* Perform the access control checks for the declarator and the
16749 decl-specifiers. */
16752 /* Restore the saved value. */
16755 }
16757 /* Parse the initializer. */
16762 {
16764 {
16768 else
16769 {
16770 /* If the declaration was erroneous, we don't really
16771 know what the user intended, so just silently
16772 consume the initializer. */
16780 }
16781 }
16782 else
16783 {
16784 /* We want to record the extra mangling scope for in-class
16785 initializers of class members and initializers of static data
16786 member templates. The former involves deferring
16787 parsing of the initializer until end of class as with default
16788 arguments. So right here we only handle the latter. */
16798 }
16799 }
16801 /* The old parser allows attributes to appear after a parenthesized
16802 initializer. Mark Mitchell proposed removing this functionality
16803 on the GCC mailing lists on 2002-08-13. This parser accepts the
16804 attributes -- but ignores them. */
16811 /* A non-template declaration involving a function parameter list containing
16812 an implicit template parameter will have been made into a template. If it
16813 turns out that the resulting declaration is not an actual function then
16814 finish the template declaration here. An error message will already have
16815 been issued. */
16820 /* For an in-class declaration, use `grokfield' to create the
16821 declaration. */
16823 {
16825 {
16828 }
16836 }
16838 /* Finish processing the declaration. But, skip member
16839 declarations. */
16841 {
16844 asm_specification,
16845 /* If the initializer is in parentheses, then this is
16846 a direct-initialization, which means that an
16847 `explicit' constructor is OK. Otherwise, an
16848 `explicit' constructor cannot be used. */
16851 }
16854 /* Core issue #226 (C++0x only): A default template-argument
16855 shall not be specified in a friend class template
16856 declaration. */
16865 {
16868 else
16870 }
16873 }
16875 /* Parse a declarator.
16877 declarator:
16878 direct-declarator
16879 ptr-operator declarator
16881 abstract-declarator:
16882 ptr-operator abstract-declarator [opt]
16883 direct-abstract-declarator
16885 GNU Extensions:
16887 declarator:
16888 attributes [opt] direct-declarator
16889 attributes [opt] ptr-operator declarator
16891 abstract-declarator:
16892 attributes [opt] ptr-operator abstract-declarator [opt]
16893 attributes [opt] direct-abstract-declarator
16895 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16896 detect constructor, destructor or conversion operators. It is set
16897 to -1 if the declarator is a name, and +1 if it is a
16898 function. Otherwise it is set to zero. Usually you just want to
16899 test for >0, but internally the negative value is used.
16901 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16902 a decl-specifier-seq unless it declares a constructor, destructor,
16903 or conversion. It might seem that we could check this condition in
16904 semantic analysis, rather than parsing, but that makes it difficult
16905 to handle something like `f()'. We want to notice that there are
16906 no decl-specifiers, and therefore realize that this is an
16907 expression, not a declaration.)
16909 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16910 the declarator is a direct-declarator of the form "(...)".
16912 MEMBER_P is true iff this declarator is a member-declarator. */
16916 cp_parser_declarator_kind dcl_kind,
16920 {
16923 cp_cv_quals cv_quals;
16924 tree class_type;
16927 /* Assume this is not a constructor, destructor, or type-conversion
16928 operator. */
16935 /* Check for the ptr-operator production. */
16937 /* Parse the ptr-operator. */
16943 /* If that worked, then we have a ptr-operator. */
16945 {
16946 /* If a ptr-operator was found, then this declarator was not
16947 parenthesized. */
16950 /* The dependent declarator is optional if we are parsing an
16951 abstract-declarator. */
16955 /* Parse the dependent declarator. */
16961 /* If we are parsing an abstract-declarator, we must handle the
16962 case where the dependent declarator is absent. */
16967 declarator = cp_parser_make_indirect_declarator
16969 }
16970 /* Everything else is a direct-declarator. */
16971 else
16972 {
16975 CPP_OPEN_PAREN);
16977 ctor_dtor_or_conv_p,
16978 member_p);
16979 }
16984 }
16986 /* Parse a direct-declarator or direct-abstract-declarator.
16988 direct-declarator:
16989 declarator-id
16990 direct-declarator ( parameter-declaration-clause )
16991 cv-qualifier-seq [opt]
16992 ref-qualifier [opt]
16993 exception-specification [opt]
16994 direct-declarator [ constant-expression [opt] ]
16995 ( declarator )
16997 direct-abstract-declarator:
16998 direct-abstract-declarator [opt]
16999 ( parameter-declaration-clause )
17000 cv-qualifier-seq [opt]
17001 ref-qualifier [opt]
17002 exception-specification [opt]
17003 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17004 ( abstract-declarator )
17006 Returns a representation of the declarator. DCL_KIND is
17007 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17008 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17009 we are parsing a direct-declarator. It is
17010 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17011 of ambiguity we prefer an abstract declarator, as per
17012 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17013 cp_parser_declarator. */
17017 cp_parser_declarator_kind dcl_kind,
17020 {
17030 {
17031 /* Peek at the next token. */
17034 {
17035 /* This is either a parameter-declaration-clause, or a
17036 parenthesized declarator. When we know we are parsing a
17037 named declarator, it must be a parenthesized declarator
17038 if FIRST is true. For instance, `(int)' is a
17039 parameter-declaration-clause, with an omitted
17040 direct-abstract-declarator. But `((*))', is a
17041 parenthesized abstract declarator. Finally, when T is a
17042 template parameter `(T)' is a
17043 parameter-declaration-clause, and not a parenthesized
17044 named declarator.
17046 We first try and parse a parameter-declaration-clause,
17047 and then try a nested declarator (if FIRST is true).
17049 It is not an error for it not to be a
17050 parameter-declaration-clause, even when FIRST is
17051 false. Consider,
17053 int i (int);
17054 int i (3);
17056 The first is the declaration of a function while the
17057 second is the definition of a variable, including its
17058 initializer.
17060 Having seen only the parenthesis, we cannot know which of
17061 these two alternatives should be selected. Even more
17062 complex are examples like:
17064 int i (int (a));
17065 int i (int (3));
17067 The former is a function-declaration; the latter is a
17068 variable initialization.
17070 Thus again, we try a parameter-declaration-clause, and if
17071 that fails, we back out and return. */
17074 {
17075 tree params;
17078 /* In a member-declarator, the only valid interpretation
17079 of a parenthesis is the start of a
17080 parameter-declaration-clause. (It is invalid to
17081 initialize a static data member with a parenthesized
17082 initializer; only the "=" form of initialization is
17083 permitted.) */
17087 /* Consume the `('. */
17090 {
17091 /* If this is going to be an abstract declarator, we're
17092 in a declarator and we can't have default args. */
17095 }
17099 /* Parse the parameter-declaration-clause. */
17102 /* Consume the `)'. */
17105 /* If all went well, parse the cv-qualifier-seq,
17106 ref-qualifier and the exception-specification. */
17108 {
17109 cp_cv_quals cv_quals;
17110 cp_virt_specifiers virt_specifiers;
17111 cp_ref_qualifier ref_qual;
17112 tree exception_specification;
17113 tree late_return;
17114 tree attrs;
17124 /* Parse the cv-qualifier-seq. */
17126 /* Parse the ref-qualifier. */
17128 /* And the exception-specification. */
17129 exception_specification
17134 /* In here, we handle cases where attribute is used after
17135 the function declaration. For example:
17136 void func (int x) __attribute__((vector(..))); */
17139 {
17143 CPP_SEMICOLON)
17145 CPP_OPEN_BRACE))
17148 ;
17149 else
17151 }
17152 late_return = (cp_parser_late_return_type_opt
17157 /* Parse the virt-specifier-seq. */
17160 /* Create the function-declarator. */
17162 params,
17163 cv_quals,
17164 virt_specifiers,
17165 ref_qual,
17166 exception_specification,
17167 late_return);
17169 /* Any subsequent parameter lists are to do with
17170 return type, so are not those of the declared
17171 function. */
17173 }
17175 /* Remove the function parms from scope. */
17179 /* Repeat the main loop. */
17181 }
17183 /* If this is the first, we can try a parenthesized
17184 declarator. */
17186 {
17192 /* Consume the `('. */
17194 /* Parse the nested declarator. */
17197 declarator
17200 member_p);
17203 /* Expect a `)'. */
17210 }
17211 /* Otherwise, we must be done. */
17212 else
17214 }
17218 {
17219 /* Parse an array-declarator. */
17228 /* Consume the `['. */
17230 /* Peek at the next token. */
17232 /* If the next token is `]', then there is no
17233 constant-expression. */
17235 {
17237 bounds
17247 {
17248 /* Normally, the array bound must be an integral constant
17249 expression. However, as an extension, we allow VLAs
17250 in function scopes as long as they aren't part of a
17251 parameter declaration. */
17255 }
17258 {
17259 /* Remember this wasn't a constant-expression. */
17262 }
17263 }
17264 else
17266 /* Look for the closing `]'. */
17268 {
17271 }
17276 }
17278 {
17279 {
17280 tree qualifying_scope;
17281 tree unqualified_name;
17282 tree attrs;
17283 special_function_kind sfk;
17288 /* Parse a declarator-id */
17291 {
17294 /* If we see an ellipsis, we should be looking at a
17295 parameter pack. */
17297 {
17298 /* Consume the `...' */
17302 }
17303 }
17306 unqualified_name
17310 {
17314 {
17315 /* Check whether an error occurred. */
17318 /* We already consumed the ellipsis to mark a
17319 parameter pack, but we have no way to report it,
17320 so abort the tentative parse. We will be exiting
17321 immediately anyway. */
17323 }
17324 else
17330 && (qualifying_scope
17332 {
17335 }
17336 }
17341 {
17346 }
17352 {
17353 /* In the declaration of a member of a template class
17354 outside of the class itself, the SCOPE will sometimes
17355 be a TYPENAME_TYPE. For example, given:
17357 template <typename T>
17358 int S<T>::R::i = 3;
17360 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17361 this context, we must resolve S<T>::R to an ordinary
17362 type, rather than a typename type.
17364 The reason we normally avoid resolving TYPENAME_TYPEs
17365 is that a specialization of `S' might render
17366 `S<T>::R' not a type. However, if `S' is
17367 specialized, then this `i' will not be used, so there
17368 is no harm in resolving the types here. */
17369 tree type;
17371 /* Resolve the TYPENAME_TYPE. */
17374 /* If that failed, the declarator is invalid. */
17376 {
17379 "cannot define member of dependent typedef "
17381 else
17386 }
17388 }
17393 {
17394 tree class_type;
17399 else
17403 {
17406 {
17409 {
17413 "use %<%T::%D%> instead of %<%T::%D%> to "
17415 class_type,
17420 }
17421 else
17423 }
17424 else
17425 {
17426 /* We do not attempt to print the declarator
17427 here because we do not have enough
17428 information about its original syntactic
17429 form. */
17433 }
17434 }
17437 {
17443 for an anonymous type, even if the type
17444 got a name for linkage purposes. */
17447 class_type))
17448 {
17451 }
17459 }
17460 }
17462 unqualified_name,
17463 sfk);
17470 }
17472 handle_declarator:;
17475 {
17476 /* Any names that appear after the declarator-id for a
17477 member are looked up in the containing scope. */
17479 {
17480 /* But declarations with qualified-ids can't appear in a
17481 function. */
17485 }
17487 }
17491 /* Default args are only allowed on function
17492 declarations. */
17494 else
17498 }
17499 /* We're done. */
17500 else
17502 }
17504 /* For an abstract declarator, we might wind up with nothing at this
17505 point. That's an error; the declarator is not optional. */
17509 /* If we entered a scope, we must exit it now. */
17517 }
17519 /* Parse a ptr-operator.
17521 ptr-operator:
17522 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17523 * cv-qualifier-seq [opt]
17524 &
17525 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17526 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17528 GNU Extension:
17530 ptr-operator:
17531 & cv-qualifier-seq [opt]
17533 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17534 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17535 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17536 filled in with the TYPE containing the member. *CV_QUALS is
17537 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17538 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17539 Note that the tree codes returned by this function have nothing
17540 to do with the types of trees that will be eventually be created
17541 to represent the pointer or reference type being parsed. They are
17542 just constants with suggestive names. */
17543 static enum tree_code
17548 {
17553 /* Assume that it's not a pointer-to-member. */
17555 /* And that there are no cv-qualifiers. */
17558 /* Peek at the next token. */
17561 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17571 {
17572 /* Consume the `*', `&' or `&&'. */
17575 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17576 `&', if we are allowing GNU extensions. (The only qualifier
17577 that can legally appear after `&' is `restrict', but that is
17578 enforced during semantic analysis. */
17586 }
17587 else
17588 {
17589 /* Try the pointer-to-member case. */
17591 /* Look for the optional `::' operator. */
17594 /* Look for the nested-name specifier. */
17601 /* If we found it, and the next token is a `*', then we are
17602 indeed looking at a pointer-to-member operator. */
17605 {
17606 /* Indicate that the `*' operator was used. */
17614 else
17615 {
17616 /* The type of which the member is a member is given by the
17617 current SCOPE. */
17619 /* The next name will not be qualified. */
17623 /* Look for optional c++11 attributes. */
17627 /* Look for the optional cv-qualifier-seq. */
17629 }
17630 }
17631 /* If that didn't work we don't have a ptr-operator. */
17634 }
17637 }
17639 /* Parse an (optional) cv-qualifier-seq.
17641 cv-qualifier-seq:
17642 cv-qualifier cv-qualifier-seq [opt]
17644 cv-qualifier:
17645 const
17646 volatile
17648 GNU Extension:
17650 cv-qualifier:
17651 __restrict__
17653 Returns a bitmask representing the cv-qualifiers. */
17655 static cp_cv_quals
17657 {
17661 {
17663 cp_cv_quals cv_qualifier;
17665 /* Peek at the next token. */
17667 /* See if it's a cv-qualifier. */
17669 {
17685 }
17691 {
17694 }
17695 else
17696 {
17699 }
17700 }
17703 }
17705 /* Parse an (optional) ref-qualifier
17707 ref-qualifier:
17708 &
17709 &&
17711 Returns cp_ref_qualifier representing ref-qualifier. */
17713 static cp_ref_qualifier
17715 {
17718 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17723 {
17728 {
17740 }
17745 {
17748 }
17749 else
17750 {
17753 }
17754 }
17757 }
17759 /* Parse an (optional) virt-specifier-seq.
17761 virt-specifier-seq:
17762 virt-specifier virt-specifier-seq [opt]
17764 virt-specifier:
17765 override
17766 final
17768 Returns a bitmask representing the virt-specifiers. */
17770 static cp_virt_specifiers
17772 {
17776 {
17778 cp_virt_specifiers virt_specifier;
17780 /* Peek at the next token. */
17782 /* See if it's a virt-specifier-qualifier. */
17786 {
17789 }
17791 {
17794 }
17796 {
17798 }
17799 else
17803 {
17806 }
17807 else
17808 {
17811 }
17812 }
17814 }
17816 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17817 is in scope even though it isn't real. */
17819 static void
17821 {
17822 tree this_parm;
17825 {
17826 /* We don't clear this between NSDMIs. Is it already what we want? */
17831 }
17834 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17836 current_class_ref
17839 }
17841 /* Return true iff our current scope is a non-static data member
17842 initializer. */
17844 bool
17846 {
17847 /* We recognize NSDMI context by the context-less 'this' pointer set up
17848 by the function above. */
17852 }
17854 /* Parse a late-specified return type, if any. This is not a separate
17855 non-terminal, but part of a function declarator, which looks like
17857 -> trailing-type-specifier-seq abstract-declarator(opt)
17859 Returns the type indicated by the type-id.
17861 In addition to this this parses any queued up omp declare simd
17862 clauses and Cilk Plus SIMD-enabled function's vector attributes.
17864 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17865 function. */
17867 static tree
17869 cp_cv_quals quals)
17870 {
17874 && declarator
17880 /* Peek at the next token. */
17882 /* A late-specified return type is indicated by an initial '->'. */
17889 {
17890 /* DR 1207: 'this' is in scope in the trailing return type. */
17892 }
17895 {
17896 /* Consume the ->. */
17900 }
17903 declarator->std_attributes
17907 declarator->std_attributes
17912 {
17915 }
17918 }
17920 /* Parse a declarator-id.
17922 declarator-id:
17923 id-expression
17924 :: [opt] nested-name-specifier [opt] type-name
17926 In the `id-expression' case, the value returned is as for
17927 cp_parser_id_expression if the id-expression was an unqualified-id.
17928 If the id-expression was a qualified-id, then a SCOPE_REF is
17929 returned. The first operand is the scope (either a NAMESPACE_DECL
17930 or TREE_TYPE), but the second is still just a representation of an
17931 unqualified-id. */
17933 static tree
17935 {
17936 tree id;
17937 /* The expression must be an id-expression. Assume that qualified
17938 names are the names of types so that:
17940 template <class T>
17941 int S<T>::R::i = 3;
17943 will work; we must treat `S<T>::R' as the name of a type.
17944 Similarly, assume that qualified names are templates, where
17945 required, so that:
17947 template <class T>
17948 int S<T>::R<T>::i = 3;
17950 will work, too. */
17956 optional_p);
17960 }
17962 /* Parse a type-id.
17964 type-id:
17965 type-specifier-seq abstract-declarator [opt]
17967 Returns the TYPE specified. */
17969 static tree
17972 {
17973 cp_decl_specifier_seq type_specifier_seq;
17976 /* Parse the type-specifier-seq. */
17978 is_trailing_return,
17983 /* There might or might not be an abstract declarator. */
17985 /* Look for the declarator. */
17986 abstract_declarator
17990 /* Check to see if there really was a declarator. */
17995 /* None of the valid uses of 'auto' in C++14 involve the type-id
17996 nonterminal, but it is valid in a trailing-return-type. */
17999 {
18000 /* A type-id with type 'auto' is only ok if the abstract declarator
18001 is a function declarator with a late-specified return type. */
18006 else
18007 {
18010 }
18011 }
18014 is_template_arg);
18015 }
18018 {
18020 }
18023 {
18024 tree r;
18026 parser->type_definition_forbidden_message
18031 {
18034 }
18036 }
18039 {
18041 }
18043 /* Parse a type-specifier-seq.
18045 type-specifier-seq:
18046 type-specifier type-specifier-seq [opt]
18048 GNU extension:
18050 type-specifier-seq:
18051 attributes type-specifier-seq [opt]
18053 If IS_DECLARATION is true, we are at the start of a "condition" or
18054 exception-declaration, so we might be followed by a declarator-id.
18056 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18057 i.e. we've just seen "->".
18059 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18061 static void
18066 {
18071 /* Clear the TYPE_SPECIFIER_SEQ. */
18074 /* In the context of a trailing return type, enum E { } is an
18075 elaborated-type-specifier followed by a function-body, not an
18076 enum-specifier. */
18080 /* Parse the type-specifiers and attributes. */
18082 {
18083 tree type_specifier;
18086 /* Check for attributes first. */
18088 {
18093 }
18095 /* record the token of the beginning of the type specifier seq,
18096 for error reporting purposes*/
18100 /* Look for the type-specifier. */
18102 flags,
18103 type_specifier_seq,
18105 NULL,
18108 {
18109 /* If the first type-specifier could not be found, this is not a
18110 type-specifier-seq at all. */
18112 {
18113 /* Set in_declarator_p to avoid skipping to the semicolon. */
18125 }
18126 /* If subsequent type-specifiers could not be found, the
18127 type-specifier-seq is complete. */
18129 }
18132 /* The standard says that a condition can be:
18134 type-specifier-seq declarator = assignment-expression
18136 However, given:
18138 struct S {};
18139 if (int S = ...)
18141 we should treat the "S" as a declarator, not as a
18142 type-specifier. The standard doesn't say that explicitly for
18143 type-specifier-seq, but it does say that for
18144 decl-specifier-seq in an ordinary declaration. Perhaps it
18145 would be clearer just to allow a decl-specifier-seq here, and
18146 then add a semantic restriction that if any decl-specifiers
18147 that are not type-specifiers appear, the program is invalid. */
18150 }
18151 }
18153 /* Return whether the function currently being declared has an associated
18154 template parameter list. */
18156 static bool
18158 {
18171 }
18173 /* Parse a parameter-declaration-clause.
18175 parameter-declaration-clause:
18176 parameter-declaration-list [opt] ... [opt]
18177 parameter-declaration-list , ...
18179 Returns a representation for the parameter declarations. A return
18180 value of NULL indicates a parameter-declaration-clause consisting
18181 only of an ellipsis. */
18183 static tree
18185 {
18186 tree parameters;
18195 parser->auto_is_implicit_function_template_parm_p
18197 }
18207 /* Peek at the next token. */
18209 /* Check for trivial parameter-declaration-clauses. */
18211 {
18212 /* Consume the `...' token. */
18215 }
18217 /* There are no parameters. */
18218 {
18219 #ifndef NO_IMPLICIT_EXTERN_C
18224 else
18225 #endif
18227 }
18228 /* Check for `(void)', too, which is a special case. */
18232 {
18233 /* Consume the `void' token. */
18235 /* There are no parameters. */
18237 }
18239 /* Parse the parameter-declaration-list. */
18241 /* If a parse error occurred while parsing the
18242 parameter-declaration-list, then the entire
18243 parameter-declaration-clause is erroneous. */
18245 {
18246 /* Unwind generic function template scope if necessary. */
18250 }
18252 /* Peek at the next token. */
18254 /* If it's a `,', the clause should terminate with an ellipsis. */
18256 {
18257 /* Consume the `,'. */
18259 /* Expect an ellipsis. */
18260 ellipsis_p
18262 }
18263 /* It might also be `...' if the optional trailing `,' was
18264 omitted. */
18266 {
18267 /* Consume the `...' token. */
18269 /* And remember that we saw it. */
18271 }
18272 else
18275 /* Finish the parameter list. */
18280 }
18282 /* Parse a parameter-declaration-list.
18284 parameter-declaration-list:
18285 parameter-declaration
18286 parameter-declaration-list , parameter-declaration
18288 Returns a representation of the parameter-declaration-list, as for
18289 cp_parser_parameter_declaration_clause. However, the
18290 `void_list_node' is never appended to the list. Upon return,
18291 *IS_ERROR will be true iff an error occurred. */
18293 static tree
18295 {
18301 /* Assume all will go well. */
18303 /* The special considerations that apply to a function within an
18304 unbraced linkage specifications do not apply to the parameters
18305 to the function. */
18306 saved_in_unbraced_linkage_specification_p
18310 /* Look for more parameters. */
18312 {
18320 /* Parse the parameter. */
18321 parameter
18326 /* We don't know yet if the enclosing context is deprecated, so wait
18327 and warn in grokparms if appropriate. */
18331 {
18332 /* If a function parameter pack was specified and an implicit template
18333 parameter was introduced during cp_parser_parameter_declaration,
18334 change any implicit parameters introduced into packs. */
18338 {
18346 }
18350 PARM,
18353 }
18357 /* If a parse error occurred parsing the parameter declaration,
18358 then the entire parameter-declaration-list is erroneous. */
18360 {
18364 }
18374 {
18378 }
18380 /* Add the new parameter to the list. */
18384 /* Peek at the next token. */
18387 /* These are for Objective-C++ */
18390 /* The parameter-declaration-list is complete. */
18393 {
18396 /* Peek at the next token. */
18398 /* If it's an ellipsis, then the list is complete. */
18401 /* Otherwise, there must be more parameters. Consume the
18402 `,'. */
18404 /* When parsing something like:
18406 int i(float f, double d)
18408 we can tell after seeing the declaration for "f" that we
18409 are not looking at an initialization of a variable "i",
18410 but rather at the declaration of a function "i".
18412 Due to the fact that the parsing of template arguments
18413 (as specified to a template-id) requires backtracking we
18414 cannot use this technique when inside a template argument
18415 list. */
18419 /* However, a parameter-declaration of the form
18420 "float(f)" (which is a valid declaration of a
18421 parameter "f") can also be interpreted as an
18422 expression (the conversion of "f" to "float"). */
18425 }
18426 else
18427 {
18435 }
18436 }
18438 parser->in_unbraced_linkage_specification_p
18441 /* Reset implicit_template_scope if we are about to leave the function
18442 parameter list that introduced it. Note that for out-of-line member
18443 definitions, there will be one or more class scopes before we get to
18444 the template parameter scope. */
18448 {
18452 {
18455 }
18456 }
18459 }
18461 /* Parse a parameter declaration.
18463 parameter-declaration:
18464 decl-specifier-seq ... [opt] declarator
18465 decl-specifier-seq declarator = assignment-expression
18466 decl-specifier-seq ... [opt] abstract-declarator [opt]
18467 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18469 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18470 declares a template parameter. (In that case, a non-nested `>'
18471 token encountered during the parsing of the assignment-expression
18472 is not interpreted as a greater-than operator.)
18474 Returns a representation of the parameter, or NULL if an error
18475 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18476 true iff the declarator is of the form "(p)". */
18482 {
18484 cp_decl_specifier_seq decl_specifiers;
18486 tree default_argument;
18490 /* In a template parameter, `>' is not an operator.
18492 [temp.param]
18494 When parsing a default template-argument for a non-type
18495 template-parameter, the first non-nested `>' is taken as the end
18496 of the template parameter-list rather than a greater-than
18497 operator. */
18499 /* Type definitions may not appear in parameter types. */
18501 parser->type_definition_forbidden_message
18504 /* Parse the declaration-specifiers. */
18506 CP_PARSER_FLAGS_NONE,
18510 /* Complain about missing 'typename' or other invalid type names. */
18515 /* If an error occurred, there's no reason to attempt to parse the
18516 rest of the declaration. */
18518 {
18521 }
18523 /* Peek at the next token. */
18526 /* If the next token is a `)', `,', `=', `>', or `...', then there
18527 is no declarator. However, when variadic templates are enabled,
18528 there may be a declarator following `...'. */
18533 {
18537 }
18538 /* Otherwise, there should be a declarator. */
18539 else
18540 {
18544 /* After seeing a decl-specifier-seq, if the next token is not a
18545 "(", there is no possibility that the code is a valid
18546 expression. Therefore, if parsing tentatively, we commit at
18547 this point. */
18549 /* In an expression context, having seen:
18551 (int((char ...
18553 we cannot be sure whether we are looking at a
18554 function-type (taking a "char" as a parameter) or a cast
18555 of some object of type "char" to "int". */
18561 /* Parse the declarator. */
18564 CP_PARSER_DECLARATOR_EITHER,
18566 parenthesized_p,
18569 /* After the declarator, allow more attributes. */
18570 decl_specifiers.attributes
18573 }
18575 /* If the next token is an ellipsis, and we have not seen a
18576 declarator name, and the type of the declarator contains parameter
18577 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18578 a parameter pack expansion expression. Otherwise, leave the
18579 ellipsis for a C-style variadic function. */
18582 {
18593 {
18594 /* Consume the `...'. */
18598 /* Build a pack expansion type */
18601 else
18603 }
18604 }
18606 /* The restriction on defining new types applies only to the type
18607 of the parameter, not to the default argument. */
18610 /* If the next token is `=', then process a default argument. */
18612 {
18614 /* If we are defining a class, then the tokens that make up the
18615 default argument must be saved and processed later. */
18620 /* Outside of a class definition, we can just parse the
18621 assignment-expression. */
18622 else
18623 default_argument
18627 {
18630 else
18631 {
18633 "default arguments are only "
18636 }
18637 }
18641 {
18642 /* Find the name of the parameter pack. */
18649 template_parm_p
18655 else
18657 template_parm_p
18664 }
18665 }
18666 else
18670 declarator,
18671 default_argument);
18672 }
18674 /* Parse a default argument and return it.
18676 TEMPLATE_PARM_P is true if this is a default argument for a
18677 non-type template parameter. */
18678 static tree
18680 {
18686 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18687 set correctly. */
18690 /* Local variable names (and the `this' keyword) may not
18691 appear in a default argument. */
18694 /* Parse the assignment-expression. */
18699 /* The "this" pointer is not valid in a default argument. */
18701 {
18706 }
18707 default_argument
18709 /* Restore the "this" pointer. */
18711 {
18714 }
18723 }
18725 /* Parse a function-body.
18727 function-body:
18728 compound_statement */
18730 static void
18732 {
18734 }
18736 /* Parse a ctor-initializer-opt followed by a function-body. Return
18737 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18738 is true we are parsing a function-try-block. */
18740 static bool
18743 {
18751 /* Begin the function body. */
18753 /* Parse the optional ctor-initializer. */
18756 /* If we're parsing a constexpr constructor definition, we need
18757 to check that the constructor body is indeed empty. However,
18758 before we get to cp_parser_function_body lot of junk has been
18759 generated, so we can't just check that we have an empty block.
18760 Rather we take a snapshot of the outermost block, and check whether
18761 cp_parser_function_body changed its state. */
18763 {
18767 }
18768 /* Parse the function-body. */
18772 /* Finish the function body. */
18776 }
18778 /* Parse an initializer.
18780 initializer:
18781 = initializer-clause
18782 ( expression-list )
18784 Returns an expression representing the initializer. If no
18785 initializer is present, NULL_TREE is returned.
18787 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18788 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18789 set to TRUE if there is no initializer present. If there is an
18790 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18791 is set to true; otherwise it is set to false. */
18793 static tree
18796 {
18798 tree init;
18800 /* Peek at the next token. */
18803 /* Let our caller know whether or not this initializer was
18804 parenthesized. */
18806 /* Assume that the initializer is constant. */
18810 {
18811 /* Consume the `='. */
18813 /* Parse the initializer-clause. */
18815 }
18817 {
18822 non_constant_p);
18827 }
18829 {
18834 }
18835 else
18836 {
18837 /* Anything else is an error. */
18840 }
18843 }
18845 /* Parse an initializer-clause.
18847 initializer-clause:
18848 assignment-expression
18849 braced-init-list
18851 Returns an expression representing the initializer.
18853 If the `assignment-expression' production is used the value
18854 returned is simply a representation for the expression.
18856 Otherwise, calls cp_parser_braced_list. */
18858 static tree
18860 {
18861 tree initializer;
18863 /* Assume the expression is constant. */
18866 /* If it is not a `{', then we are looking at an
18867 assignment-expression. */
18869 {
18870 initializer
18873 non_constant_p);
18874 }
18875 else
18879 }
18881 /* Parse a brace-enclosed initializer list.
18883 braced-init-list:
18884 { initializer-list , [opt] }
18885 { }
18887 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18888 the elements of the initializer-list (or NULL, if the last
18889 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18890 NULL_TREE. There is no way to detect whether or not the optional
18891 trailing `,' was provided. NON_CONSTANT_P is as for
18892 cp_parser_initializer. */
18894 static tree
18896 {
18897 tree initializer;
18899 /* Consume the `{' token. */
18901 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18903 /* If it's not a `}', then there is a non-trivial initializer. */
18905 {
18906 /* Parse the initializer list. */
18909 /* A trailing `,' token is allowed. */
18912 }
18913 else
18915 /* Now, there should be a trailing `}'. */
18919 }
18921 /* Parse an initializer-list.
18923 initializer-list:
18924 initializer-clause ... [opt]
18925 initializer-list , initializer-clause ... [opt]
18927 GNU Extension:
18929 initializer-list:
18930 designation initializer-clause ...[opt]
18931 initializer-list , designation initializer-clause ...[opt]
18933 designation:
18934 . identifier =
18935 identifier :
18936 [ constant-expression ] =
18938 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18939 for the initializer. If the INDEX of the elt is non-NULL, it is the
18940 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18941 as for cp_parser_initializer. */
18945 {
18948 /* Assume all of the expressions are constant. */
18951 /* Parse the rest of the list. */
18953 {
18955 tree designator;
18956 tree initializer;
18959 /* If the next token is an identifier and the following one is a
18960 colon, we are looking at the GNU designated-initializer
18961 syntax. */
18965 {
18966 /* Warn the user that they are using an extension. */
18969 /* Consume the identifier. */
18971 /* Consume the `:'. */
18973 }
18974 /* Also handle the C99 syntax, '. id ='. */
18979 {
18980 /* Warn the user that they are using an extension. */
18983 /* Consume the `.'. */
18985 /* Consume the identifier. */
18987 /* Consume the `='. */
18989 }
18990 /* Also handle C99 array designators, '[ const ] ='. */
18994 {
18995 /* In C++11, [ could start a lambda-introducer. */
19007 }
19008 else
19011 /* Parse the initializer. */
19014 /* If any clause is non-constant, so is the entire initializer. */
19018 /* If we have an ellipsis, this is an initializer pack
19019 expansion. */
19021 {
19022 /* Consume the `...'. */
19025 /* Turn the initializer into an initializer expansion. */
19027 }
19029 /* Add it to the vector. */
19032 /* If the next token is not a comma, we have reached the end of
19033 the list. */
19037 /* Peek at the next token. */
19039 /* If the next token is a `}', then we're still done. An
19040 initializer-clause can have a trailing `,' after the
19041 initializer-list and before the closing `}'. */
19045 /* Consume the `,' token. */
19047 }
19050 }
19052 /* Classes [gram.class] */
19054 /* Parse a class-name.
19056 class-name:
19057 identifier
19058 template-id
19060 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19061 to indicate that names looked up in dependent types should be
19062 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19063 keyword has been used to indicate that the name that appears next
19064 is a template. TAG_TYPE indicates the explicit tag given before
19065 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19066 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19067 is the class being defined in a class-head.
19069 Returns the TYPE_DECL representing the class. */
19071 static tree
19079 {
19080 tree decl;
19081 tree scope;
19086 /* All class-names start with an identifier. */
19089 {
19092 }
19094 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19095 to a template-id, so we save it here. */
19100 /* Any name names a type if we're following the `typename' keyword
19101 in a qualified name where the enclosing scope is type-dependent. */
19104 /* Handle the common case (an identifier, but not a template-id)
19105 efficiently. */
19108 {
19112 /* Look for the identifier. */
19116 /* If the next token isn't an identifier, we are certainly not
19117 looking at a class-name. */
19120 /* If we know this is a type-name, there's no need to look it
19121 up. */
19124 else
19125 {
19126 tree ambiguous_decls;
19127 /* If we already know that this lookup is ambiguous, then
19128 we've already issued an error message; there's no reason
19129 to check again. */
19131 {
19134 }
19135 /* If the next token is a `::', then the name must be a type
19136 name.
19138 [basic.lookup.qual]
19140 During the lookup for a name preceding the :: scope
19141 resolution operator, object, function, and enumerator
19142 names are ignored. */
19145 /* Look up the name. */
19147 tag_type,
19150 check_dependency_p,
19154 {
19158 }
19159 }
19160 }
19161 else
19162 {
19163 /* Try a template-id. */
19165 check_dependency_p,
19166 tag_type,
19167 is_declaration);
19170 }
19174 /* If this is a typename, create a TYPENAME_TYPE. */
19176 {
19181 }
19185 /* Check to see that it is really the name of a class. */
19189 /* Situations like this:
19191 template <typename T> struct A {
19192 typename T::template X<int>::I i;
19193 };
19195 are problematic. Is `T::template X<int>' a class-name? The
19196 standard does not seem to be definitive, but there is no other
19197 valid interpretation of the following `::'. Therefore, those
19198 names are considered class-names. */
19199 {
19203 }
19207 /* In Objective-C 2.0, a classname followed by '.' starts a
19208 dot-syntax expression, and it's not a type-name. */
19220 }
19222 /* Parse a class-specifier.
19224 class-specifier:
19225 class-head { member-specification [opt] }
19227 Returns the TREE_TYPE representing the class. */
19229 static tree
19231 {
19232 tree type;
19246 /* Parse the class-head. */
19249 /* If the class-head was a semantic disaster, skip the entire body
19250 of the class. */
19252 {
19256 }
19258 /* Look for the `{'. */
19260 {
19263 }
19267 /* Issue an error message if type-definitions are forbidden here. */
19269 /* Remember that we are defining one more class. */
19271 /* Inside the class, surrounding template-parameter-lists do not
19272 apply. */
19273 saved_num_template_parameter_lists
19276 /* We are not in a function body. */
19279 /* Or in a loop. */
19282 /* Or in a switch. */
19285 /* We are not immediately inside an extern "lang" block. */
19286 saved_in_unbraced_linkage_specification_p
19290 /* Start the class. */
19292 {
19295 }
19299 /* If the type is erroneous, skip the entire body of the class. */
19301 else
19302 /* Parse the member-specification. */
19305 /* Look for the trailing `}'. */
19307 /* Look for trailing attributes to apply to this class. */
19315 /* We've finished a type definition. Check for the common syntax
19316 error of forgetting a semicolon after the definition. We need to
19317 be careful, as we can't just check for not-a-semicolon and be done
19318 with it; the user might have typed:
19320 class X { } c = ...;
19321 class X { } *p = ...;
19323 and so forth. Instead, enumerate all the possible tokens that
19324 might follow this production; if we don't see one of them, then
19325 complain and silently insert the semicolon. */
19326 {
19331 /* Don't try to parse c++11 attributes here. As per the
19332 grammar, that should be a task for
19333 cp_parser_decl_specifier_seq. */
19337 {
19348 /* While it's legal for type qualifiers and storage class
19349 specifiers to follow type definitions in the grammar, only
19350 compiler testsuites contain code like that. Assume that if
19351 we see such code, then what we're really seeing is a case
19352 like:
19354 class X { }
19355 const <type> var = ...;
19357 or
19359 class Y { }
19360 static <type> func (...) ...
19362 i.e. the qualifier or specifier applies to the next
19363 declaration. To do so, however, we need to look ahead one
19364 more token to see if *that* token is a type specifier.
19366 This code could be improved to handle:
19368 class Z { }
19369 static const <type> var = ...; */
19372 {
19375 /* Handling user-defined types here would be nice, but very
19376 tricky. */
19377 want_semicolon
19380 }
19384 }
19386 /* If we don't have a type, then something is very wrong and we
19387 shouldn't try to do anything clever. Likewise for not seeing the
19388 closing brace. */
19390 {
19391 cp_token_position prev
19402 else
19405 /* Unget one token and smash it to look as though we encountered
19406 a semicolon in the input stream. */
19411 }
19412 }
19414 /* If this class is not itself within the scope of another class,
19415 then we need to parse the bodies of all of the queued function
19416 definitions. Note that the queued functions defined in a class
19417 are not always processed immediately following the
19418 class-specifier for that class. Consider:
19420 struct A {
19421 struct B { void f() { sizeof (A); } };
19422 };
19424 If `f' were processed before the processing of `A' were
19425 completed, there would be no way to compute the size of `A'.
19426 Note that the nesting we are interested in here is lexical --
19427 not the semantic nesting given by TYPE_CONTEXT. In particular,
19428 for:
19430 struct A { struct B; };
19431 struct A::B { void f() { } };
19433 there is no need to delay the parsing of `A::B::f'. */
19435 {
19436 tree decl;
19443 /* In a first pass, parse default arguments to the functions.
19444 Then, in a second pass, parse the bodies of the functions.
19445 This two-phased approach handles cases like:
19447 struct S {
19448 void f() { g(); }
19449 void g(int i = 3);
19450 };
19452 */
19454 {
19456 /* If there are default arguments that have not yet been processed,
19457 take care of them now. */
19459 {
19464 }
19465 /* Make sure that any template parameters are in scope. */
19467 /* Parse the default argument expressions. */
19469 /* Remove any template parameters from the symbol table. */
19471 }
19473 /* Now parse any NSDMIs. */
19477 {
19479 {
19484 }
19487 }
19493 /* Now parse the body of the functions. */
19495 {
19496 /* OpenMP UDRs need to be parsed before all other functions. */
19503 }
19504 else
19508 }
19510 /* Put back any saved access checks. */
19513 /* Restore saved state. */
19517 parser->num_template_parameter_lists
19519 parser->in_unbraced_linkage_specification_p
19523 }
19525 static tree
19527 {
19528 tree ret;
19533 }
19535 /* Parse a class-head.
19537 class-head:
19538 class-key identifier [opt] base-clause [opt]
19539 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19540 class-key nested-name-specifier [opt] template-id
19541 base-clause [opt]
19543 class-virt-specifier:
19544 final
19546 GNU Extensions:
19547 class-key attributes identifier [opt] base-clause [opt]
19548 class-key attributes nested-name-specifier identifier base-clause [opt]
19549 class-key attributes nested-name-specifier [opt] template-id
19550 base-clause [opt]
19552 Upon return BASES is initialized to the list of base classes (or
19553 NULL, if there are none) in the same form returned by
19554 cp_parser_base_clause.
19556 Returns the TYPE of the indicated class. Sets
19557 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19558 involving a nested-name-specifier was used, and FALSE otherwise.
19560 Returns error_mark_node if this is not a class-head.
19562 Returns NULL_TREE if the class-head is syntactically valid, but
19563 semantically invalid in a way that means we should skip the entire
19564 body of the class. */
19566 static tree
19569 {
19570 tree nested_name_specifier;
19574 tree attributes;
19575 tree bases;
19585 /* Assume no nested-name-specifier will be present. */
19587 /* Assume no template parameter lists will be used in defining the
19588 type. */
19592 /* Look for the class-key. */
19597 /* Parse the attributes. */
19600 /* If the next token is `::', that is invalid -- but sometimes
19601 people do try to write:
19603 struct ::S {};
19605 Handle this gracefully by accepting the extra qualifier, and then
19606 issuing an error about it later if this really is a
19607 class-head. If it turns out just to be an elaborated type
19608 specifier, remain silent. */
19614 /* Determine the name of the class. Begin by looking for an
19615 optional nested-name-specifier. */
19617 nested_name_specifier
19623 /* If there was a nested-name-specifier, then there *must* be an
19624 identifier. */
19626 {
19628 /* Although the grammar says `identifier', it really means
19629 `class-name' or `template-name'. You are only allowed to
19630 define a class that has already been declared with this
19631 syntax.
19633 The proposed resolution for Core Issue 180 says that wherever
19634 you see `class T::X' you should treat `X' as a type-name.
19636 It is OK to define an inaccessible class; for example:
19638 class A { class B; };
19639 class A::B {};
19641 We do not know if we will see a class-name, or a
19642 template-name. We look for a class-name first, in case the
19643 class-name is a template-id; if we looked for the
19644 template-name first we would stop after the template-name. */
19649 class_type,
19653 /* If that didn't work, ignore the nested-name-specifier. */
19655 {
19661 }
19662 /* If we could not find a corresponding TYPE, treat this
19663 declaration like an unqualified declaration. */
19666 /* Otherwise, count the number of templates used in TYPE and its
19667 containing scopes. */
19668 else
19669 {
19670 tree scope;
19682 }
19683 }
19684 /* Otherwise, the identifier is optional. */
19685 else
19686 {
19687 /* We don't know whether what comes next is a template-id,
19688 an identifier, or nothing at all. */
19690 /* Check for a template-id. */
19695 class_key,
19697 /* If that didn't work, it could still be an identifier. */
19699 {
19701 {
19704 }
19705 else
19707 }
19708 else
19709 {
19712 }
19713 }
19718 {
19720 class_key,
19722 }
19725 /* If it's not a `:' or a `{' then we can't really be looking at a
19726 class-head, since a class-head only appears as part of a
19727 class-specifier. We have to detect this situation before calling
19728 xref_tag, since that has irreversible side-effects. */
19730 {
19734 }
19736 /* At this point, we're going ahead with the class-specifier, even
19737 if some other problem occurs. */
19740 {
19745 }
19746 /* Issue the error about the overly-qualified name now. */
19748 {
19753 }
19755 {
19760 }
19762 {
19763 tree scope;
19765 /* Reject typedef-names in class heads. */
19767 {
19770 type);
19773 }
19775 /* Figure out in what scope the declaration is being placed. */
19777 /* If that scope does not contain the scope in which the
19778 class was originally declared, the program is invalid. */
19780 {
19783 "declaration of %qD in namespace %qD which does not "
19786 else
19792 }
19793 /* [dcl.meaning]
19795 A declarator-id shall not be qualified except for the
19796 definition of a ... nested class outside of its class
19797 ... [or] the definition or explicit instantiation of a
19798 class member of a namespace outside of its namespace. */
19800 {
19805 }
19806 }
19807 /* An explicit-specialization must be preceded by "template <>". If
19808 it is not, try to recover gracefully. */
19812 {
19816 /* Take the same action that would have been taken by
19817 cp_parser_explicit_specialization. */
19820 }
19821 /* There must be no "return" statements between this point and the
19822 end of this function; set "type "to the correct return value and
19823 use "goto done;" to return. */
19824 /* Make sure that the right number of template parameters were
19825 present. */
19829 {
19830 /* If something went wrong, there is no point in even trying to
19831 process the class-definition. */
19834 }
19836 /* Look up the type. */
19838 {
19842 {
19846 }
19847 else
19848 {
19851 }
19854 }
19856 {
19857 tree class_type;
19859 /* Given:
19861 template <typename T> struct S { struct T };
19862 template <typename T> struct S<T>::T { };
19864 we will get a TYPENAME_TYPE when processing the definition of
19865 `S::T'. We need to resolve it to the actual type before we
19866 try to define it. */
19868 {
19873 else
19874 {
19877 }
19878 }
19882 {
19885 }
19888 /* Enter the scope indicated by the nested-name-specifier. */
19890 /* Get the canonical version of this type. */
19894 {
19897 {
19900 }
19901 }
19905 }
19907 {
19908 /* If the class was unnamed, create a dummy name. */
19913 }
19915 /* Indicate whether this class was declared as a `class' or as a
19916 `struct'. */
19921 /* If this type was already complete, and we see another definition,
19922 that's an error. */
19924 {
19926 type);
19928 type);
19931 }
19936 {
19937 /* Apply attributes now, before any use of the class as a template
19938 argument in its base list. */
19941 }
19943 /* We will have entered the scope containing the class; the names of
19944 base classes should be looked up in that context. For example:
19946 struct A { struct B {}; struct C; };
19947 struct A::C : B {};
19949 is valid. */
19951 /* Get the list of base-classes, if there is one. */
19953 {
19954 /* PR59482: enter the class scope so that base-specifiers are looked
19955 up correctly. */
19959 /* PR59482: get out of the previously pushed class scope so that the
19960 subsequent pops pop the right thing. */
19963 }
19964 else
19967 /* If we're really defining a class, process the base classes.
19968 If they're invalid, fail. */
19973 done:
19974 /* Leave the scope given by the nested-name-specifier. We will
19975 enter the class scope itself while processing the members. */
19980 {
19983 }
19989 out:
19992 }
19994 /* Parse a class-key.
19996 class-key:
19997 class
19998 struct
19999 union
20001 Returns the kind of class-key specified, or none_type to indicate
20002 error. */
20004 static enum tag_types
20006 {
20010 /* Look for the class-key. */
20015 /* Check to see if the TOKEN is a class-key. */
20020 }
20022 /* Parse an (optional) member-specification.
20024 member-specification:
20025 member-declaration member-specification [opt]
20026 access-specifier : member-specification [opt] */
20028 static void
20030 {
20032 {
20036 /* Peek at the next token. */
20038 /* If it's a `}', or EOF then we've seen all the members. */
20044 /* See if this token is a keyword. */
20047 {
20051 /* Consume the access-specifier. */
20053 /* Remember which access-specifier is active. */
20055 /* Look for the `:'. */
20060 /* Accept #pragmas at class scope. */
20062 {
20065 }
20067 /* Otherwise, the next construction must be a
20068 member-declaration. */
20070 }
20071 }
20072 }
20074 /* Parse a member-declaration.
20076 member-declaration:
20077 decl-specifier-seq [opt] member-declarator-list [opt] ;
20078 function-definition ; [opt]
20079 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20080 using-declaration
20081 template-declaration
20082 alias-declaration
20084 member-declarator-list:
20085 member-declarator
20086 member-declarator-list , member-declarator
20088 member-declarator:
20089 declarator pure-specifier [opt]
20090 declarator constant-initializer [opt]
20091 identifier [opt] : constant-expression
20093 GNU Extensions:
20095 member-declaration:
20096 __extension__ member-declaration
20098 member-declarator:
20099 declarator attributes [opt] pure-specifier [opt]
20100 declarator attributes [opt] constant-initializer [opt]
20101 identifier [opt] attributes [opt] : constant-expression
20103 C++0x Extensions:
20105 member-declaration:
20106 static_assert-declaration */
20108 static void
20110 {
20111 cp_decl_specifier_seq decl_specifiers;
20112 tree prefix_attributes;
20113 tree decl;
20122 /* Check for the `__extension__' keyword. */
20124 {
20125 /* Recurse. */
20127 /* Restore the old value of the PEDANTIC flag. */
20131 }
20133 /* Check for a template-declaration. */
20135 {
20136 /* An explicit specialization here is an error condition, and we
20137 expect the specialization handler to detect and report this. */
20141 else
20145 }
20147 /* Check for a using-declaration. */
20149 {
20151 {
20152 /* Parse the using-declaration. */
20156 }
20157 else
20158 {
20159 tree decl;
20163 /* Note that if we actually see the '=' token after the
20164 identifier, cp_parser_alias_declaration commits the
20165 tentative parse. In that case, we really expects an
20166 alias-declaration. Otherwise, we expect a using
20167 declaration. */
20168 alias_decl_expected =
20174 else
20178 }
20179 }
20181 /* Check for @defs. */
20183 {
20188 {
20193 }
20195 }
20197 /* If the next token is `static_assert' we have a static assertion. */
20199 {
20202 }
20209 /* Parse the decl-specifier-seq. */
20212 CP_PARSER_FLAGS_OPTIONAL,
20215 /* Check for an invalid type-name. */
20219 /* If there is no declarator, then the decl-specifier-seq should
20220 specify a type. */
20222 {
20223 /* If there was no decl-specifier-seq, and the next token is a
20224 `;', then we have something like:
20226 struct S { ; };
20228 [class.mem]
20230 Each member-declaration shall declare at least one member
20231 name of the class. */
20233 {
20237 }
20238 else
20239 {
20240 tree type;
20242 /* See if this declaration is a friend. */
20244 /* If there were decl-specifiers, check to see if there was
20245 a class-declaration. */
20248 /* Nested classes have already been added to the class, but
20249 a `friend' needs to be explicitly registered. */
20251 {
20252 /* If the `friend' keyword was present, the friend must
20253 be introduced with a class-key. */
20256 "in C++03 a class-key must be used "
20258 /* In this case:
20260 template <typename T> struct A {
20261 friend struct A<T>::B;
20262 };
20264 A<T>::B will be represented by a TYPENAME_TYPE, and
20265 therefore not recognized by check_tag_decl. */
20267 {
20271 }
20274 "friend declaration does not name a class or "
20276 else
20279 }
20280 /* If there is no TYPE, an error message will already have
20281 been issued. */
20283 ;
20284 /* An anonymous aggregate has to be handled specially; such
20285 a declaration really declares a data member (with a
20286 particular type), as opposed to a nested class. */
20288 {
20289 /* C++11 9.5/6. */
20292 "a storage class on an anonymous aggregate "
20295 /* Remove constructors and such from TYPE, now that we
20296 know it is an anonymous aggregate. */
20298 /* And make the corresponding data member. */
20301 /* Add it to the class. */
20303 }
20304 else
20305 cp_parser_check_access_in_redeclaration
20308 }
20309 }
20310 else
20311 {
20314 /* Clear attributes from the decl_specifiers but keep them
20315 around as prefix attributes that apply them to the entity
20316 being declared. */
20320 /* See if these declarations will be friends. */
20323 /* Keep going until we hit the `;' at the end of the
20324 declaration. */
20326 {
20328 tree first_attribute;
20330 /* Peek at the next token. */
20333 /* Check for a bitfield declaration. */
20338 {
20339 tree identifier;
20340 tree width;
20342 /* Get the name of the bitfield. Note that we cannot just
20343 check TOKEN here because it may have been invalidated by
20344 the call to cp_lexer_peek_nth_token above. */
20347 else
20350 /* Consume the `:' token. */
20352 /* Get the width of the bitfield. */
20353 width
20356 NULL);
20358 /* Look for attributes that apply to the bitfield. */
20360 /* Remember which attributes are prefix attributes and
20361 which are not. */
20363 /* Combine the attributes. */
20366 /* Create the bitfield declaration. */
20369 identifier,
20370 sfk_none)
20373 width,
20374 attributes);
20375 }
20376 else
20377 {
20379 tree initializer;
20380 tree asm_specification;
20383 /* Parse the declarator. */
20384 declarator
20390 /* If something went wrong parsing the declarator, make sure
20391 that we at least consume some tokens. */
20393 {
20394 /* Skip to the end of the statement. */
20396 /* If the next token is not a semicolon, that is
20397 probably because we just skipped over the body of
20398 a function. So, we consume a semicolon if
20399 present, but do not issue an error message if it
20400 is not present. */
20402 CPP_SEMICOLON))
20405 }
20408 cp_parser_check_for_definition_in_return_type
20412 /* Look for an asm-specification. */
20414 /* Look for attributes that apply to the declaration. */
20416 /* Remember which attributes are prefix attributes and
20417 which are not. */
20419 /* Combine the attributes. */
20422 /* If it's an `=', then we have a constant-initializer or a
20423 pure-specifier. It is not correct to parse the
20424 initializer before registering the member declaration
20425 since the member declaration should be in scope while
20426 its initializer is processed. However, the rest of the
20427 front end does not yet provide an interface that allows
20428 us to handle this correctly. */
20430 {
20431 /* In [class.mem]:
20433 A pure-specifier shall be used only in the declaration of
20434 a virtual function.
20436 A member-declarator can contain a constant-initializer
20437 only if it declares a static member of integral or
20438 enumeration type.
20440 Therefore, if the DECLARATOR is for a function, we look
20441 for a pure-specifier; otherwise, we look for a
20442 constant-initializer. When we call `grokfield', it will
20443 perform more stringent semantics checks. */
20455 {
20457 /* Don't require a constant rvalue in C++11, since we
20458 might want a reference constant. We'll enforce
20459 constancy later. */
20461 /* Parse the initializer. */
20464 }
20465 else
20466 /* Parse the initializer. */
20468 }
20471 {
20475 else
20477 }
20478 /* Otherwise, there is no initializer. */
20479 else
20482 /* See if we are probably looking at a function
20483 definition. We are certainly not looking at a
20484 member-declarator. Calling `grokfield' has
20485 side-effects, so we must not do it unless we are sure
20486 that we are looking at a member-declarator. */
20489 {
20490 /* The grammar does not allow a pure-specifier to be
20491 used when a member function is defined. (It is
20492 possible that this fact is an oversight in the
20493 standard, since a pure function may be defined
20494 outside of the class-specifier. */
20500 declarator,
20501 attributes);
20504 /* If the member was not a friend, declare it here. */
20507 /* Peek at the next token. */
20509 /* If the next token is a semicolon, consume it. */
20513 }
20514 else
20517 /* Create the declaration. */
20523 }
20527 /* Reset PREFIX_ATTRIBUTES. */
20533 /* If there is any qualification still in effect, clear it
20534 now; we will be starting fresh with the next declarator. */
20538 /* If it's a `,', then there are more declarators. */
20540 {
20543 {
20547 }
20548 }
20549 /* If the next token isn't a `;', then we have a parse error. */
20551 CPP_SEMICOLON))
20552 {
20553 /* The next token might be a ways away from where the
20554 actual semicolon is missing. Find the previous token
20555 and use that for our error position. */
20560 /* Assume that the user meant to provide a semicolon. If
20561 we were to cp_parser_skip_to_end_of_statement, we might
20562 skip to a semicolon inside a member function definition
20563 and issue nonsensical error messages. */
20565 }
20568 {
20569 /* Add DECL to the list of members. */
20578 /* Add DECL to the queue of NSDMI to be parsed later. */
20580 }
20584 }
20585 }
20588 out:
20590 }
20592 /* Parse a pure-specifier.
20594 pure-specifier:
20595 = 0
20597 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20598 Otherwise, ERROR_MARK_NODE is returned. */
20600 static tree
20602 {
20605 /* Look for the `=' token. */
20608 /* Look for the `0' token. */
20617 /* Accept = default or = delete in c++0x mode. */
20620 {
20623 }
20625 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20627 {
20632 }
20634 {
20637 }
20640 }
20642 /* Parse a constant-initializer.
20644 constant-initializer:
20645 = constant-expression
20647 Returns a representation of the constant-expression. */
20649 static tree
20651 {
20652 /* Look for the `=' token. */
20656 /* It is invalid to write:
20658 struct S { static const int i = { 7 }; };
20660 */
20662 {
20665 /* Consume the opening brace. */
20667 /* Skip the initializer. */
20669 /* Look for the trailing `}'. */
20673 }
20677 NULL);
20678 }
20680 /* Derived classes [gram.class.derived] */
20682 /* Parse a base-clause.
20684 base-clause:
20685 : base-specifier-list
20687 base-specifier-list:
20688 base-specifier ... [opt]
20689 base-specifier-list , base-specifier ... [opt]
20691 Returns a TREE_LIST representing the base-classes, in the order in
20692 which they were declared. The representation of each node is as
20693 described by cp_parser_base_specifier.
20695 In the case that no bases are specified, this function will return
20696 NULL_TREE, not ERROR_MARK_NODE. */
20698 static tree
20700 {
20703 /* Look for the `:' that begins the list. */
20706 /* Scan the base-specifier-list. */
20708 {
20710 tree base;
20713 /* Look for the base-specifier. */
20715 /* Look for the (optional) ellipsis. */
20717 {
20718 /* Consume the `...'. */
20722 }
20724 /* Add BASE to the front of the list. */
20726 {
20728 /* Make this a pack expansion type. */
20732 {
20735 }
20736 }
20737 /* Peek at the next token. */
20739 /* If it's not a comma, then the list is complete. */
20742 /* Consume the `,'. */
20744 }
20746 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20747 base class had a qualified name. However, the next name that
20748 appears is certainly not qualified. */
20754 }
20756 /* Parse a base-specifier.
20758 base-specifier:
20759 :: [opt] nested-name-specifier [opt] class-name
20760 virtual access-specifier [opt] :: [opt] nested-name-specifier
20761 [opt] class-name
20762 access-specifier virtual [opt] :: [opt] nested-name-specifier
20763 [opt] class-name
20765 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20766 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20767 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20768 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20770 static tree
20772 {
20780 tree type;
20782 /* Process the optional `virtual' and `access-specifier'. */
20784 {
20785 /* Peek at the next token. */
20787 /* Process `virtual'. */
20789 {
20791 /* If `virtual' appears more than once, issue an error. */
20793 {
20797 }
20801 /* Consume the `virtual' token. */
20809 /* If more than one access specifier appears, issue an
20810 error. */
20813 {
20817 }
20821 /* Consume the access-specifier. */
20829 }
20830 }
20831 /* It is not uncommon to see programs mechanically, erroneously, use
20832 the 'typename' keyword to denote (dependent) qualified types
20833 as base classes. */
20835 {
20840 else
20842 "keyword %<typename%> not allowed in this context "
20845 }
20847 /* Look for the optional `::' operator. */
20849 /* Look for the nested-name-specifier. The simplest way to
20850 implement:
20852 [temp.res]
20854 The keyword `typename' is not permitted in a base-specifier or
20855 mem-initializer; in these contexts a qualified name that
20856 depends on a template-parameter is implicitly assumed to be a
20857 type name.
20859 is to pretend that we have seen the `typename' keyword at this
20860 point. */
20864 typename_type,
20866 /* If the base class is given by a qualified name, assume that names
20867 we see are type names or templates, as appropriate. */
20873 /* DR 950 allows decltype as a base-specifier. */
20875 else
20876 {
20877 /* Otherwise, look for the class-name. */
20879 class_scope_p,
20880 template_p,
20881 typename_type,
20886 }
20892 }
20894 /* Exception handling [gram.exception] */
20896 /* Parse an (optional) noexcept-specification.
20898 noexcept-specification:
20899 noexcept ( constant-expression ) [opt]
20901 If no noexcept-specification is present, returns NULL_TREE.
20902 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20903 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20904 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20905 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20906 in which case a boolean condition is returned instead. */
20908 static tree
20913 {
20917 /* Peek at the next token. */
20920 /* Is it a noexcept-specification? */
20922 {
20923 tree expr;
20927 {
20931 {
20932 /* Types may not be defined in an exception-specification. */
20934 parser->type_definition_forbidden_message
20939 /* Restore the saved message. */
20941 }
20942 else
20943 {
20946 }
20949 }
20950 else
20951 {
20955 }
20957 /* We cannot build a noexcept-spec right away because this will check
20958 that expr is a constexpr. */
20961 else
20963 }
20964 else
20966 }
20968 /* Parse an (optional) exception-specification.
20970 exception-specification:
20971 throw ( type-id-list [opt] )
20973 Returns a TREE_LIST representing the exception-specification. The
20974 TREE_VALUE of each node is a type. */
20976 static tree
20978 {
20980 tree type_id_list;
20983 /* Peek at the next token. */
20986 /* Is it a noexcept-specification? */
20992 /* If it's not `throw', then there's no exception-specification. */
20996 #if 0
20997 /* Enable this once a lot of code has transitioned to noexcept? */
21001 #endif
21003 /* Consume the `throw'. */
21006 /* Look for the `('. */
21009 /* Peek at the next token. */
21011 /* If it's not a `)', then there is a type-id-list. */
21013 {
21014 /* Types may not be defined in an exception-specification. */
21016 parser->type_definition_forbidden_message
21018 /* Parse the type-id-list. */
21020 /* Restore the saved message. */
21022 }
21023 else
21026 /* Look for the `)'. */
21030 }
21032 /* Parse an (optional) type-id-list.
21034 type-id-list:
21035 type-id ... [opt]
21036 type-id-list , type-id ... [opt]
21038 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21039 in the order that the types were presented. */
21041 static tree
21043 {
21047 {
21049 tree type;
21051 /* Get the next type-id. */
21053 /* Parse the optional ellipsis. */
21055 {
21056 /* Consume the `...'. */
21059 /* Turn the type into a pack expansion expression. */
21061 }
21062 /* Add it to the list. */
21064 /* Peek at the next token. */
21066 /* If it is not a `,', we are done. */
21069 /* Consume the `,'. */
21071 }
21074 }
21076 /* Parse a try-block.
21078 try-block:
21079 try compound-statement handler-seq */
21081 static tree
21083 {
21084 tree try_block;
21094 }
21096 /* Parse a function-try-block.
21098 function-try-block:
21099 try ctor-initializer [opt] function-body handler-seq */
21101 static bool
21103 {
21104 tree compound_stmt;
21105 tree try_block;
21108 /* Look for the `try' keyword. */
21111 /* Let the rest of the front end know where we are. */
21113 /* Parse the function-body. */
21114 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21116 /* We're done with the `try' part. */
21118 /* Parse the handlers. */
21120 /* We're done with the handlers. */
21124 }
21126 /* Parse a handler-seq.
21128 handler-seq:
21129 handler handler-seq [opt] */
21131 static void
21133 {
21135 {
21138 /* Parse the handler. */
21140 /* Peek at the next token. */
21142 /* If it's not `catch' then there are no more handlers. */
21145 }
21146 }
21148 /* Parse a handler.
21150 handler:
21151 catch ( exception-declaration ) compound-statement */
21153 static void
21155 {
21156 tree handler;
21157 tree declaration;
21167 }
21169 /* Parse an exception-declaration.
21171 exception-declaration:
21172 type-specifier-seq declarator
21173 type-specifier-seq abstract-declarator
21174 type-specifier-seq
21175 ...
21177 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21178 ellipsis variant is used. */
21180 static tree
21182 {
21183 cp_decl_specifier_seq type_specifiers;
21187 /* If it's an ellipsis, it's easy to handle. */
21189 {
21190 /* Consume the `...' token. */
21193 }
21195 /* Types may not be defined in exception-declarations. */
21197 parser->type_definition_forbidden_message
21200 /* Parse the type-specifier-seq. */
21204 /* If it's a `)', then there is no declarator. */
21207 else
21213 /* Restore the saved message. */
21220 }
21222 /* Parse a throw-expression.
21224 throw-expression:
21225 throw assignment-expression [opt]
21227 Returns a THROW_EXPR representing the throw-expression. */
21229 static tree
21231 {
21232 tree expression;
21237 /* Figure out whether or not there is an assignment-expression
21238 following the "throw" keyword. */
21246 else
21251 }
21253 /* GNU Extensions */
21255 /* Parse an (optional) asm-specification.
21257 asm-specification:
21258 asm ( string-literal )
21260 If the asm-specification is present, returns a STRING_CST
21261 corresponding to the string-literal. Otherwise, returns
21262 NULL_TREE. */
21264 static tree
21266 {
21268 tree asm_specification;
21270 /* Peek at the next token. */
21272 /* If the next token isn't the `asm' keyword, then there's no
21273 asm-specification. */
21277 /* Consume the `asm' token. */
21279 /* Look for the `('. */
21282 /* Look for the string-literal. */
21285 /* Look for the `)'. */
21289 }
21291 /* Parse an asm-operand-list.
21293 asm-operand-list:
21294 asm-operand
21295 asm-operand-list , asm-operand
21297 asm-operand:
21298 string-literal ( expression )
21299 [ string-literal ] string-literal ( expression )
21301 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21302 each node is the expression. The TREE_PURPOSE is itself a
21303 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21304 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21305 is a STRING_CST for the string literal before the parenthesis. Returns
21306 ERROR_MARK_NODE if any of the operands are invalid. */
21308 static tree
21310 {
21315 {
21316 tree string_literal;
21317 tree expression;
21318 tree name;
21321 {
21322 /* Consume the `[' token. */
21324 /* Read the operand name. */
21329 /* Look for the closing `]'. */
21331 }
21332 else
21334 /* Look for the string-literal. */
21337 /* Look for the `('. */
21339 /* Parse the expression. */
21341 /* Look for the `)'. */
21349 /* Add this operand to the list. */
21351 expression,
21352 asm_operands);
21353 /* If the next token is not a `,', there are no more
21354 operands. */
21357 /* Consume the `,'. */
21359 }
21362 }
21364 /* Parse an asm-clobber-list.
21366 asm-clobber-list:
21367 string-literal
21368 asm-clobber-list , string-literal
21370 Returns a TREE_LIST, indicating the clobbers in the order that they
21371 appeared. The TREE_VALUE of each node is a STRING_CST. */
21373 static tree
21375 {
21379 {
21380 tree string_literal;
21382 /* Look for the string literal. */
21384 /* Add it to the list. */
21386 /* If the next token is not a `,', then the list is
21387 complete. */
21390 /* Consume the `,' token. */
21392 }
21395 }
21397 /* Parse an asm-label-list.
21399 asm-label-list:
21400 identifier
21401 asm-label-list , identifier
21403 Returns a TREE_LIST, indicating the labels in the order that they
21404 appeared. The TREE_VALUE of each node is a label. */
21406 static tree
21408 {
21412 {
21415 /* Look for the identifier. */
21418 {
21421 {
21427 }
21428 }
21429 /* If the next token is not a `,', then the list is
21430 complete. */
21433 /* Consume the `,' token. */
21435 }
21438 }
21440 /* Return TRUE iff the next tokens in the stream are possibly the
21441 beginning of a GNU extension attribute. */
21443 static bool
21445 {
21447 }
21449 /* Return TRUE iff the next tokens in the stream are possibly the
21450 beginning of a standard C++-11 attribute specifier. */
21452 static bool
21454 {
21456 }
21458 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21459 beginning of a standard C++-11 attribute specifier. */
21461 static bool
21463 {
21471 }
21473 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21474 beginning of a GNU extension attribute. */
21476 static bool
21478 {
21482 }
21484 /* Return true iff the next tokens can be the beginning of either a
21485 GNU attribute list, or a standard C++11 attribute sequence. */
21487 static bool
21489 {
21492 }
21494 /* Return true iff the next Nth tokens can be the beginning of either
21495 a GNU attribute list, or a standard C++11 attribute sequence. */
21497 static bool
21499 {
21502 }
21504 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21505 of GNU attributes, or return NULL. */
21507 static tree
21509 {
21513 }
21515 #define CILK_SIMD_FN_CLAUSE_MASK \
21516 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21517 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21518 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21519 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21520 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21522 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21523 vector [(<clauses>)] */
21525 static void
21527 {
21531 {
21536 }
21539 {
21542 paren_scope++;
21543 }
21545 {
21548 paren_scope++;
21550 paren_scope--;
21551 /* Do not push the last ')' */
21554 }
21563 }
21565 /* Parse an (optional) series of attributes.
21567 attributes:
21568 attributes attribute
21570 attribute:
21571 __attribute__ (( attribute-list [opt] ))
21573 The return value is as for cp_parser_gnu_attribute_list. */
21575 static tree
21577 {
21581 {
21583 tree attribute_list;
21586 /* Peek at the next token. */
21588 /* If it's not `__attribute__', then we're done. */
21592 /* Consume the `__attribute__' keyword. */
21594 /* Look for the two `(' tokens. */
21598 /* Peek at the next token. */
21601 /* Parse the attribute-list. */
21603 else
21604 /* If the next token is a `)', then there is no attribute
21605 list. */
21608 /* Look for the two `)' tokens. */
21616 /* Add these new attributes to the list. */
21618 }
21621 }
21623 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21624 "__vector" or "__vector__." */
21628 {
21632 }
21634 /* Parse a GNU attribute-list.
21636 attribute-list:
21637 attribute
21638 attribute-list , attribute
21640 attribute:
21641 identifier
21642 identifier ( identifier )
21643 identifier ( identifier , expression-list )
21644 identifier ( expression-list )
21646 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21647 to an attribute. The TREE_PURPOSE of each node is the identifier
21648 indicating which attribute is in use. The TREE_VALUE represents
21649 the arguments, if any. */
21651 static tree
21653 {
21659 {
21661 tree identifier;
21662 tree attribute;
21664 /* Look for the identifier. We also allow keywords here; for
21665 example `__attribute__ ((const))' is legal. */
21669 {
21672 /* Consume the token, but save it since we need it for the
21673 SIMD enabled function parsing. */
21676 /* Save away the identifier that indicates which attribute
21677 this is. */
21679 /* For keywords, use the canonical spelling, not the
21680 parsed identifier. */
21686 /* Peek at the next token. */
21688 /* If it's an `(', then parse the attribute arguments. */
21690 {
21695 {
21698 }
21699 else
21700 vec = cp_parser_parenthesized_expression_list
21706 else
21707 {
21710 }
21711 /* Save the arguments away. */
21713 }
21715 {
21718 }
21721 {
21722 /* Add this attribute to the list. */
21725 }
21728 }
21729 /* Now, look for more attributes. If the next token isn't a
21730 `,', we're done. */
21734 /* Consume the comma and keep going. */
21736 }
21739 /* We built up the list in reverse order. */
21741 }
21743 /* Parse a standard C++11 attribute.
21745 The returned representation is a TREE_LIST which TREE_PURPOSE is
21746 the scoped name of the attribute, and the TREE_VALUE is its
21747 arguments list.
21749 Note that the scoped name of the attribute is itself a TREE_LIST
21750 which TREE_PURPOSE is the namespace of the attribute, and
21751 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21752 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21753 and which TREE_PURPOSE is directly the attribute name.
21755 Clients of the attribute code should use get_attribute_namespace
21756 and get_attribute_name to get the actual namespace and name of
21757 attributes, regardless of their being GNU or C++11 attributes.
21759 attribute:
21760 attribute-token attribute-argument-clause [opt]
21762 attribute-token:
21763 identifier
21764 attribute-scoped-token
21766 attribute-scoped-token:
21767 attribute-namespace :: identifier
21769 attribute-namespace:
21770 identifier
21772 attribute-argument-clause:
21773 ( balanced-token-seq )
21775 balanced-token-seq:
21776 balanced-token [opt]
21777 balanced-token-seq balanced-token
21779 balanced-token:
21780 ( balanced-token-seq )
21781 [ balanced-token-seq ]
21782 { balanced-token-seq }. */
21784 static tree
21786 {
21790 /* First, parse name of the the attribute, a.k.a
21791 attribute-token. */
21808 {
21809 /* We are seeing a scoped attribute token. */
21819 else
21820 {
21824 }
21826 NULL_TREE);
21828 }
21829 else
21830 {
21832 NULL_TREE);
21833 /* C++11 noreturn attribute is equivalent to GNU's. */
21836 /* C++14 deprecated attribute is equivalent to GNU's. */
21839 }
21841 /* Now parse the optional argument clause of the attribute. */
21846 {
21852 /* A GNU attribute that takes an identifier in parameter. */
21855 vec = cp_parser_parenthesized_expression_list
21861 else
21862 {
21865 }
21869 else
21871 }
21874 }
21876 /* Parse a list of standard C++-11 attributes.
21878 attribute-list:
21879 attribute [opt]
21880 attribute-list , attribute[opt]
21881 attribute ...
21882 attribute-list , attribute ...
21883 */
21885 static tree
21887 {
21892 {
21897 {
21900 }
21905 }
21908 }
21910 /* Parse a standard C++-11 attribute specifier.
21912 attribute-specifier:
21913 [ [ attribute-list ] ]
21914 alignment-specifier
21916 alignment-specifier:
21917 alignas ( type-id ... [opt] )
21918 alignas ( alignment-expression ... [opt] ). */
21920 static tree
21922 {
21928 {
21937 else
21938 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21939 when we are sure that we have actually parsed them. */
21941 }
21942 else
21943 {
21944 tree alignas_expr;
21946 /* Look for an alignment-specifier. */
21958 {
21961 }
21967 {
21971 alignas_expr =
21979 }
21982 {
21985 }
21989 /* Build the C++-11 representation of an 'aligned'
21990 attribute. */
21991 attributes =
21995 }
21998 }
22000 /* Parse a standard C++-11 attribute-specifier-seq.
22002 attribute-specifier-seq:
22003 attribute-specifier-seq [opt] attribute-specifier
22004 */
22006 static tree
22008 {
22012 {
22021 }
22025 }
22027 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22028 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22029 current value of the PEDANTIC flag, regardless of whether or not
22030 the `__extension__' keyword is present. The caller is responsible
22031 for restoring the value of the PEDANTIC flag. */
22033 static bool
22035 {
22036 /* Save the old value of the PEDANTIC flag. */
22040 {
22041 /* Consume the `__extension__' token. */
22043 /* We're not being pedantic while the `__extension__' keyword is
22044 in effect. */
22048 }
22051 }
22053 /* Parse a label declaration.
22055 label-declaration:
22056 __label__ label-declarator-seq ;
22058 label-declarator-seq:
22059 identifier , label-declarator-seq
22060 identifier */
22062 static void
22064 {
22065 /* Look for the `__label__' keyword. */
22069 {
22070 tree identifier;
22072 /* Look for an identifier. */
22074 /* If we failed, stop. */
22077 /* Declare it as a label. */
22079 /* If the next token is a `;', stop. */
22082 /* Look for the `,' separating the label declarations. */
22084 }
22086 /* Look for the final `;'. */
22088 }
22090 /* Support Functions */
22092 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22093 NAME should have one of the representations used for an
22094 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22095 is returned. If PARSER->SCOPE is a dependent type, then a
22096 SCOPE_REF is returned.
22098 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22099 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22100 was formed. Abstractly, such entities should not be passed to this
22101 function, because they do not need to be looked up, but it is
22102 simpler to check for this special case here, rather than at the
22103 call-sites.
22105 In cases not explicitly covered above, this function returns a
22106 DECL, OVERLOAD, or baselink representing the result of the lookup.
22107 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22108 is returned.
22110 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22111 (e.g., "struct") that was used. In that case bindings that do not
22112 refer to types are ignored.
22114 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22115 ignored.
22117 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22118 are ignored.
22120 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22121 types.
22123 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22124 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22125 NULL_TREE otherwise. */
22127 static tree
22134 location_t name_location)
22135 {
22136 tree decl;
22139 /* Assume that the lookup will be unambiguous. */
22143 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22144 no longer valid. Note that if we are parsing tentatively, and
22145 the parse fails, OBJECT_TYPE will be automatically restored. */
22151 /* A template-id has already been resolved; there is no lookup to
22152 do. */
22156 {
22160 }
22162 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22163 it should already have been checked to make sure that the name
22164 used matches the type being destroyed. */
22166 {
22167 tree type;
22169 /* Figure out to which type this destructor applies. */
22174 else
22176 /* If that's not a class type, there is no destructor. */
22183 /* If it was a class type, return the destructor. */
22185 }
22187 /* By this point, the NAME should be an ordinary identifier. If
22188 the id-expression was a qualified name, the qualifying scope is
22189 stored in PARSER->SCOPE at this point. */
22192 /* Perform the lookup. */
22194 {
22200 /* If the SCOPE is dependent, the lookup must be deferred until
22201 the template is instantiated -- unless we are explicitly
22202 looking up names in uninstantiated templates. Even then, we
22203 cannot look up the name if the scope is not a class type; it
22204 might, for example, be a template type parameter. */
22209 /* Defer lookup. */
22211 else
22212 {
22215 /* If PARSER->SCOPE is a dependent type, then it must be a
22216 class type, and we must not be checking dependencies;
22217 otherwise, we would have processed this lookup above. So
22218 that PARSER->SCOPE is not considered a dependent base by
22219 lookup_member, we must enter the scope here. */
22223 /* If the PARSER->SCOPE is a template specialization, it
22224 may be instantiated during name lookup. In that case,
22225 errors may be issued. Even if we rollback the current
22226 tentative parse, those errors are valid. */
22231 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22232 lookup result and the nested-name-specifier nominates a class C:
22233 * if the name specified after the nested-name-specifier, when
22234 looked up in C, is the injected-class-name of C (Clause 9), or
22235 * if the name specified after the nested-name-specifier is the
22236 same as the identifier or the simple-template-id's template-
22237 name in the last component of the nested-name-specifier,
22238 the name is instead considered to name the constructor of
22239 class C. [ Note: for example, the constructor is not an
22240 acceptable lookup result in an elaborated-type-specifier so
22241 the constructor would not be used in place of the
22242 injected-class-name. --end note ] Such a constructor name
22243 shall be used only in the declarator-id of a declaration that
22244 names a constructor or in a using-declaration. */
22252 /* If we have a single function from a using decl, pull it out. */
22259 }
22261 /* If the scope is a dependent type and either we deferred lookup or
22262 we did lookup but didn't find the name, rememeber the name. */
22265 {
22267 {
22268 tree type;
22270 /* The resolution to Core Issue 180 says that `struct
22271 A::B' should be considered a type-name, even if `A'
22272 is dependent. */
22277 }
22281 CPP_CLOSE_PAREN)))
22285 else
22288 is_template);
22289 }
22292 }
22294 {
22295 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22296 OBJECT_TYPE is not a class. */
22298 /* If the OBJECT_TYPE is a template specialization, it may
22299 be instantiated during name lookup. In that case, errors
22300 may be issued. Even if we rollback the current tentative
22301 parse, those errors are valid. */
22303 name,
22306 tf_warning_or_error);
22307 else
22311 /* Look it up in the enclosing context. */
22317 }
22318 else
22319 {
22325 }
22327 /* If the lookup failed, let our caller know. */
22331 /* Pull out the template from an injected-class-name (or multiple). */
22335 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22337 {
22340 /* The error message we have to print is too complicated for
22341 cp_parser_error, so we incorporate its actions directly. */
22343 {
22345 name);
22347 }
22349 }
22357 /* If we have resolved the name of a member declaration, check to
22358 see if the declaration is accessible. When the name resolves to
22359 set of overloaded functions, accessibility is checked when
22360 overload resolution is done.
22362 During an explicit instantiation, access is not checked at all,
22363 as per [temp.explicit]. */
22370 }
22372 /* Like cp_parser_lookup_name, but for use in the typical case where
22373 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22374 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22376 static tree
22378 {
22380 none_type,
22385 location);
22386 }
22388 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22389 the current context, return the TYPE_DECL. If TAG_NAME_P is
22390 true, the DECL indicates the class being defined in a class-head,
22391 or declared in an elaborated-type-specifier.
22393 Otherwise, return DECL. */
22395 static tree
22397 {
22398 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22399 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22401 struct A {
22402 template <typename T> struct B;
22403 };
22405 template <typename T> struct A::B {};
22407 Similarly, in an elaborated-type-specifier:
22409 namespace N { struct X{}; }
22411 struct A {
22412 template <typename T> friend struct N::X;
22413 };
22415 However, if the DECL refers to a class type, and we are in
22416 the scope of the class, then the name lookup automatically
22417 finds the TYPE_DECL created by build_self_reference rather
22418 than a TEMPLATE_DECL. For example, in:
22420 template <class T> struct S {
22421 S s;
22422 };
22424 there is no need to handle such case. */
22430 }
22432 /* If too many, or too few, template-parameter lists apply to the
22433 declarator, issue an error message. Returns TRUE if all went well,
22434 and FALSE otherwise. */
22436 static bool
22439 location_t declarator_location)
22440 {
22442 {
22444 {
22452 /* If the DECLARATOR has the form `X<y>' then it uses one
22453 additional level of template parameters. */
22456 return cp_parser_check_template_parameters
22458 }
22473 }
22475 }
22477 /* NUM_TEMPLATES were used in the current declaration. If that is
22478 invalid, return FALSE and issue an error messages. Otherwise,
22479 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22480 declarator and we can print more accurate diagnostics. */
22482 static bool
22485 location_t location,
22487 {
22488 /* If there are the same number of template classes and parameter
22489 lists, that's OK. */
22492 /* If there are more, but only one more, then we are referring to a
22493 member template. That's OK too. */
22496 /* If there are more template classes than parameter lists, we have
22497 something like:
22499 template <class T> void S<T>::R<T>::f (); */
22501 {
22511 else
22514 }
22515 /* Otherwise, there are too many template parameter lists. We have
22516 something like:
22518 template <class T> template <class U> void S::f(); */
22521 }
22523 /* Parse an optional `::' token indicating that the following name is
22524 from the global namespace. If so, PARSER->SCOPE is set to the
22525 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22526 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22527 Returns the new value of PARSER->SCOPE, if the `::' token is
22528 present, and NULL_TREE otherwise. */
22530 static tree
22532 {
22535 /* Peek at the next token. */
22537 /* If we're looking at a `::' token then we're starting from the
22538 global namespace, not our current location. */
22540 {
22541 /* Consume the `::' token. */
22543 /* Set the SCOPE so that we know where to start the lookup. */
22549 }
22551 {
22555 }
22558 }
22560 /* Returns TRUE if the upcoming token sequence is the start of a
22561 constructor declarator. If FRIEND_P is true, the declarator is
22562 preceded by the `friend' specifier. */
22564 static bool
22566 {
22569 tree nested_name_specifier;
22572 /* The common case is that this is not a constructor declarator, so
22573 try to avoid doing lots of work if at all possible. It's not
22574 valid declare a constructor at function scope. */
22577 /* And only certain tokens can begin a constructor declarator. */
22585 /* Parse tentatively; we are going to roll back all of the tokens
22586 consumed here. */
22588 /* Assume that we are looking at a constructor declarator. */
22591 /* Look for the optional `::' operator. */
22594 /* Look for the nested-name-specifier. */
22595 nested_name_specifier
22606 /* Outside of a class-specifier, there must be a
22607 nested-name-specifier. */
22613 /* If we have a class scope, this is easy; DR 147 says that S::S always
22614 names the constructor, and no other qualified name could. */
22617 {
22627 }
22628 /* If we still think that this might be a constructor-declarator,
22629 look for a class-name. */
22631 {
22632 /* If we have:
22634 template <typename T> struct S {
22635 S();
22636 };
22638 we must recognize that the nested `S' names a class. */
22639 tree type_decl;
22643 none_type,
22647 /* If there was no class-name, then this is not a constructor.
22648 Otherwise, if we are in a class-specifier and we aren't
22649 handling a friend declaration, check that its type matches
22650 current_class_type (c++/38313). Note: error_mark_node
22651 is left alone for error recovery purposes. */
22653 && (outside_class_specifier_p
22658 /* If we're still considering a constructor, we have to see a `(',
22659 to begin the parameter-declaration-clause, followed by either a
22660 `)', an `...', or a decl-specifier. We need to check for a
22661 type-specifier to avoid being fooled into thinking that:
22663 S (f) (int);
22665 is a constructor. (It is actually a function named `f' that
22666 takes one parameter (of type `int') and returns a value of type
22667 `S'. */
22675 /* A parameter declaration begins with a decl-specifier,
22676 which is either the "attribute" keyword, a storage class
22677 specifier, or (usually) a type-specifier. */
22679 {
22680 tree type;
22684 /* Names appearing in the type-specifier should be looked up
22685 in the scope of the class. */
22688 else
22689 {
22692 {
22696 {
22699 }
22700 }
22702 }
22704 /* Inside the constructor parameter list, surrounding
22705 template-parameter-lists do not apply. */
22706 saved_num_template_parameter_lists
22710 /* Look for the type-specifier. */
22712 CP_PARSER_FLAGS_NONE,
22718 parser->num_template_parameter_lists
22721 /* Leave the scope of the class. */
22726 }
22727 }
22729 /* We did not really want to consume any tokens. */
22733 }
22735 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22736 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22737 they must be performed once we are in the scope of the function.
22739 Returns the function defined. */
22741 static tree
22742 cp_parser_function_definition_from_specifiers_and_declarator
22745 tree attributes,
22747 {
22748 tree fn;
22751 /* Begin the function-definition. */
22754 /* The things we're about to see are not directly qualified by any
22755 template headers we've seen thus far. */
22758 /* If there were names looked up in the decl-specifier-seq that we
22759 did not check, check them now. We must wait until we are in the
22760 scope of the function to perform the checks, since the function
22761 might be a friend. */
22765 {
22768 }
22771 {
22772 /* Skip the entire function. */
22775 }
22777 {
22778 /* Seen already, skip it. An error message has already been output. */
22782 /* If this is a function from a class, pop the nested class. */
22785 }
22786 else
22787 {
22788 timevar_id_t tv;
22791 else
22797 }
22800 }
22802 /* Parse the part of a function-definition that follows the
22803 declarator. INLINE_P is TRUE iff this function is an inline
22804 function defined within a class-specifier.
22806 Returns the function defined. */
22808 static tree
22811 {
22812 tree fn;
22818 bool fully_implicit_function_template_p
22821 tree implicit_template_parms
22824 cp_binding_level* implicit_template_scope
22830 /* If the next token is `return', then the code may be trying to
22831 make use of the "named return value" extension that G++ used to
22832 support. */
22835 {
22836 /* Consume the `return' keyword. */
22838 /* Look for the identifier that indicates what value is to be
22839 returned. */
22841 /* Issue an error message. */
22844 /* Skip tokens until we reach the start of the function body. */
22846 {
22853 }
22854 }
22855 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22856 anything declared inside `f'. */
22857 saved_in_unbraced_linkage_specification_p
22860 /* Inside the function, surrounding template-parameter-lists do not
22861 apply. */
22862 saved_num_template_parameter_lists
22868 /* If the next token is `try', `__transaction_atomic', or
22869 `__transaction_relaxed`, then we are looking at either function-try-block
22870 or function-transaction-block. Note that all of these include the
22871 function-body. */
22874 RID_TRANSACTION_ATOMIC);
22876 RID_TRANSACTION_RELAXED))
22878 RID_TRANSACTION_RELAXED);
22881 else
22882 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22887 /* Finish the function. */
22890 /* Generate code for it, if necessary. */
22892 /* Restore the saved values. */
22893 parser->in_unbraced_linkage_specification_p
22895 parser->num_template_parameter_lists
22899 parser->fully_implicit_function_template_p
22901 parser->implicit_template_parms
22903 parser->implicit_template_scope
22910 }
22912 /* Parse a template-declaration, assuming that the `export' (and
22913 `extern') keywords, if present, has already been scanned. MEMBER_P
22914 is as for cp_parser_template_declaration. */
22916 static void
22918 {
22921 tree parameter_list;
22926 /* Look for the `template' keyword. */
22931 /* And the `<'. */
22935 {
22936 /* 14.5.2.2 [temp.mem]
22938 A local class shall not have member templates. */
22943 }
22944 /* [temp]
22946 A template ... shall not have C linkage. */
22948 {
22950 /* Give it C++ linkage to avoid confusing other parts of the
22951 front end. */
22954 }
22955 else
22958 /* We cannot perform access checks on the template parameter
22959 declarations until we know what is being declared, just as we
22960 cannot check the decl-specifier list. */
22963 /* If the next token is `>', then we have an invalid
22964 specialization. Rather than complain about an invalid template
22965 parameter, issue an error message here. */
22967 {
22971 }
22972 else
22973 {
22974 /* Parse the template parameters. */
22976 }
22978 /* Get the deferred access checks from the parameter list. These
22979 will be checked once we know what is being declared, as for a
22980 member template the checks must be performed in the scope of the
22981 class containing the member. */
22984 /* Look for the `>'. */
22986 /* We just processed one more parameter list. */
22988 /* If the next token is `template', there are more template
22989 parameters. */
22991 RID_TEMPLATE))
22996 else
22997 {
22998 /* There are no access checks when parsing a template, as we do not
22999 know if a specialization will be a friend. */
23003 checks,
23004 member_p,
23009 /* If this is a member template declaration, let the front
23010 end know. */
23012 {
23017 }
23022 }
23023 /* We are done with the current parameter list. */
23028 /* Finish up. */
23031 /* Check the template arguments for a literal operator template. */
23035 {
23039 else
23040 {
23043 {
23049 }
23051 {
23059 }
23060 else
23062 }
23065 " Expected non-type template argument pack <char...>"
23067 decl);
23068 }
23069 /* Register member declarations. */
23072 /* For the erroneous case of a template with C linkage, we pushed an
23073 implicit C++ linkage scope; exit that scope now. */
23076 /* If DECL is a function template, we must return to parse it later.
23077 (Even though there is no definition, there might be default
23078 arguments that need handling.) */
23082 }
23084 /* Perform the deferred access checks from a template-parameter-list.
23085 CHECKS is a TREE_LIST of access checks, as returned by
23086 get_deferred_access_checks. */
23088 static void
23089 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23090 {
23094 }
23096 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23097 `function-definition' sequence that follows a template header.
23098 If MEMBER_P is true, this declaration appears in a class scope.
23100 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23101 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23103 static tree
23109 {
23112 cp_decl_specifier_seq decl_specifiers;
23116 /* This function is only used when processing a template
23117 declaration. */
23121 /* Defer access checks until we know what is being declared. */
23124 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23125 alternative. */
23128 CP_PARSER_FLAGS_OPTIONAL,
23134 /* There are no template typedefs. */
23136 {
23140 }
23142 /* Gather up the access checks that occurred the
23143 decl-specifier-seq. */
23146 /* Check for the declaration of a template class. */
23148 {
23150 {
23153 /* In this case:
23155 struct C {
23156 friend template <typename T> struct A<T>::B;
23157 };
23159 A<T>::B will be represented by a TYPENAME_TYPE, and
23160 therefore not recognized by shadow_tag. */
23162 && !decl
23169 else
23172 /* Perform access checks for template parameters. */
23174 }
23175 }
23177 /* Complain about missing 'typename' or other invalid type names. */
23180 {
23181 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23182 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23183 the rest of this declaration. */
23186 }
23188 /* If it's not a template class, try for a template function. If
23189 the next token is a `;', then this declaration does not declare
23190 anything. But, if there were errors in the decl-specifiers, then
23191 the error might well have come from an attempted class-specifier.
23192 In that case, there's no need to warn about a missing declarator. */
23196 {
23199 checks,
23201 member_p,
23202 declares_class_or_enum,
23204 NULL);
23206 /* 7.1.1-1 [dcl.stc]
23208 A storage-class-specifier shall not be specified in an explicit
23209 specialization... */
23211 && explicit_specialization_p
23213 {
23217 }
23221 }
23223 /* Look for a trailing `;' after the declaration. */
23229 out:
23232 /* Clear any current qualification; whatever comes next is the start
23233 of something new. */
23239 }
23241 /* Parse a cast-expression that is not the operand of a unary "&". */
23243 static tree
23245 {
23248 }
23250 /* Parse a functional cast to TYPE. Returns an expression
23251 representing the cast. */
23253 static tree
23255 {
23257 tree expression_list;
23258 tree cast;
23265 {
23273 tf_warning_or_error);
23274 }
23283 else
23284 {
23287 }
23290 tf_warning_or_error);
23291 /* [expr.const]/1: In an integral constant expression "only type
23292 conversions to integral or enumeration type can be used". */
23298 NIC_CONSTRUCTOR))
23301 }
23303 /* Save the tokens that make up the body of a member function defined
23304 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23305 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23306 specifiers applied to the declaration. Returns the FUNCTION_DECL
23307 for the member function. */
23309 static tree
23313 tree attributes)
23314 {
23317 tree fn;
23319 /* Create the FUNCTION_DECL. */
23322 /* If something went badly wrong, bail out now. */
23324 {
23325 /* If there's a function-body, skip it. */
23330 }
23332 /* Remember it, if there default args to post process. */
23335 /* Save away the tokens that make up the body of the
23336 function. */
23338 /* Handle function try blocks. */
23341 /* We can have braced-init-list mem-initializers before the fn body. */
23343 {
23346 {
23347 /* cache_group will stop after an un-nested { } pair, too. */
23351 /* variadic mem-inits have ... after the ')'. */
23354 }
23355 }
23357 /* Handle function try blocks. */
23362 /* Save away the inline definition; we will process it when the
23363 class is complete. */
23367 /* We need to know that this was defined in the class, so that
23368 friend templates are handled correctly. */
23371 /* Add FN to the queue of functions to be parsed later. */
23375 }
23377 /* Save the tokens that make up the in-class initializer for a non-static
23378 data member. Returns a DEFAULT_ARG. */
23380 static tree
23382 {
23384 }
23386 /* Parse a template-argument-list, as well as the trailing ">" (but
23387 not the opening "<"). See cp_parser_template_argument_list for the
23388 return value. */
23390 static tree
23392 {
23393 tree arguments;
23394 tree saved_scope;
23395 tree saved_qualifying_scope;
23396 tree saved_object_scope;
23401 /* [temp.names]
23403 When parsing a template-id, the first non-nested `>' is taken as
23404 the end of the template-argument-list rather than a greater-than
23405 operator. */
23406 saved_greater_than_is_operator_p
23409 /* Parsing the argument list may modify SCOPE, so we save it
23410 here. */
23414 /* We need to evaluate the template arguments, even though this
23415 template-id may be nested within a "sizeof". */
23420 /* Parse the template-argument-list itself. */
23424 else
23426 /* Look for the `>' that ends the template-argument-list. If we find
23427 a '>>' instead, it's probably just a typo. */
23429 {
23431 {
23432 /* In C++0x, a `>>' in a template argument list or cast
23433 expression is considered to be two separate `>'
23434 tokens. So, change the current token to a `>', but don't
23435 consume it: it will be consumed later when the outer
23436 template argument list (or cast expression) is parsed.
23437 Note that this replacement of `>' for `>>' is necessary
23438 even if we are parsing tentatively: in the tentative
23439 case, after calling
23440 cp_parser_enclosed_template_argument_list we will always
23441 throw away all of the template arguments and the first
23442 closing `>', either because the template argument list
23443 was erroneous or because we are replacing those tokens
23444 with a CPP_TEMPLATE_ID token. The second `>' (which will
23445 not have been thrown away) is needed either to close an
23446 outer template argument list or to complete a new-style
23447 cast. */
23450 }
23452 {
23453 /* If we're in a nested template argument list, the '>>' has
23454 to be a typo for '> >'. We emit the error message, but we
23455 continue parsing and we push a '>' as next token, so that
23456 the argument list will be parsed correctly. Note that the
23457 global source location is still on the token before the
23458 '>>', so we need to say explicitly where we want it. */
23464 }
23465 else
23466 {
23467 /* If this is not a nested template argument list, the '>>'
23468 is a typo for '>'. Emit an error message and continue.
23469 Same deal about the token location, but here we can get it
23470 right by consuming the '>>' before issuing the diagnostic. */
23473 "spurious %<>>%>, use %<>%> to terminate "
23475 }
23476 }
23477 else
23479 /* The `>' token might be a greater-than operator again now. */
23480 parser->greater_than_is_operator_p
23482 /* Restore the SAVED_SCOPE. */
23490 }
23492 /* MEMBER_FUNCTION is a member function, or a friend. If default
23493 arguments, or the body of the function have not yet been parsed,
23494 parse them now. */
23496 static void
23498 {
23500 /* If this member is a template, get the underlying
23501 FUNCTION_DECL. */
23505 /* There should not be any class definitions in progress at this
23506 point; the bodies of members are only parsed outside of all class
23507 definitions. */
23509 /* While we're parsing the member functions we might encounter more
23510 classes. We want to handle them right away, but we don't want
23511 them getting mixed up with functions that are currently in the
23512 queue. */
23515 /* Make sure that any template parameters are in scope. */
23518 /* If the body of the function has not yet been parsed, parse it
23519 now. */
23521 {
23522 tree function_scope;
23525 /* The function is no longer pending; we are processing it. */
23530 /* If this is a local class, enter the scope of the containing
23531 function. */
23536 /* Push the body of the function onto the lexer stack. */
23539 /* Let the front end know that we going to be defining this
23540 function. */
23544 /* Don't do access checking if it is a templated function. */
23548 /* #pragma omp declare reduction needs special parsing. */
23550 {
23555 }
23556 else
23557 /* Now, parse the body of the function. */
23564 /* Leave the scope of the containing function. */
23568 }
23570 /* Remove any template parameters from the symbol table. */
23573 /* Restore the queue. */
23576 }
23578 /* If DECL contains any default args, remember it on the unparsed
23579 functions queue. */
23581 static void
23583 {
23584 tree probe;
23587 probe;
23590 {
23594 }
23595 }
23597 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23598 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23599 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23600 from the parameter-type-list. */
23602 static tree
23605 {
23607 tree parsed_arg;
23613 /* Push the saved tokens for the default argument onto the parser's
23614 lexer stack. */
23620 /* Parse the default argument. */
23631 {
23632 /* In a non-template class, check conversions now. In a template,
23633 we'll wait and instantiate these as needed. */
23636 tf_warning_or_error);
23637 else
23638 {
23645 /* This represents the whole initialization. */
23647 }
23648 }
23650 /* If the token stream has not been completely used up, then
23651 there was extra junk after the end of the default
23652 argument. */
23654 {
23657 else
23659 }
23661 /* Revert to the main lexer. */
23665 }
23667 /* FIELD is a non-static data member with an initializer which we saved for
23668 later; parse it now. */
23670 static void
23672 {
23673 tree def;
23680 NULL_TREE);
23686 }
23688 /* FN is a FUNCTION_DECL which may contains a parameter with an
23689 unparsed DEFAULT_ARG. Parse the default args now. This function
23690 assumes that the current scope is the scope in which the default
23691 argument should be processed. */
23693 static void
23695 {
23699 /* While we're parsing the default args, we might (due to the
23700 statement expression extension) encounter more classes. We want
23701 to handle them right away, but we don't want them getting mixed
23702 up with default args that are currently in the queue. */
23705 /* Local variable names (and the `this' keyword) may not appear
23706 in a default argument. */
23717 {
23719 tree parsed_arg;
23721 tree copy;
23728 /* This can happen for a friend declaration for a function
23729 already declared with default arguments. */
23732 parsed_arg
23734 default_arg,
23737 {
23739 }
23743 /* Update any instantiations we've already created. */
23747 }
23751 /* Make sure no default arg is missing. */
23754 /* Restore the state of local_variables_forbidden_p. */
23757 /* Restore the queue. */
23759 }
23761 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23763 sizeof ... ( identifier )
23765 where the 'sizeof' token has already been consumed. */
23767 static tree
23769 {
23770 /* Consume the `...'. */
23777 else
23785 /* The name is not qualified. */
23803 }
23805 /* Parse the operand of `sizeof' (or a similar operator). Returns
23806 either a TYPE or an expression, depending on the form of the
23807 input. The KEYWORD indicates which kind of expression we have
23808 encountered. */
23810 static tree
23812 {
23819 /* If it's a `...', then we are computing the length of a parameter
23820 pack. */
23825 /* Types cannot be defined in a `sizeof' expression. Save away the
23826 old message. */
23828 /* And create the new one. */
23834 /* The restrictions on constant-expressions do not apply inside
23835 sizeof expressions. */
23836 saved_integral_constant_expression_p
23838 saved_non_integral_constant_expression_p
23842 /* Do not actually evaluate the expression. */
23845 /* If it's a `(', then we might be looking at the type-id
23846 construction. */
23848 {
23852 /* We can't be sure yet whether we're looking at a type-id or an
23853 expression. */
23855 /* Consume the `('. */
23857 /* Note: as a GNU Extension, compound literals are considered
23858 postfix-expressions as they are in C99, so they are valid
23859 arguments to sizeof. See comment in cp_parser_cast_expression
23860 for details. */
23862 /* Skip tokens until the next token is a closing parenthesis.
23863 If we find the closing `)', and the next token is a `{', then
23864 we are looking at a compound-literal. */
23865 compound_literal_p
23869 /* Roll back the tokens we skipped. */
23871 /* If we were looking at a compound-literal, simulate an error
23872 so that the call to cp_parser_parse_definitely below will
23873 fail. */
23876 else
23877 {
23880 /* Look for the type-id. */
23882 /* Look for the closing `)'. */
23885 }
23887 /* If all went well, then we're done. */
23889 {
23890 cp_decl_specifier_seq decl_specs;
23892 /* Build a trivial decl-specifier-seq. */
23896 /* Call grokdeclarator to figure out what type this is. */
23899 TYPENAME,
23902 }
23903 }
23905 /* If the type-id production did not work out, then we must be
23906 looking at the unary-expression production. */
23911 /* Go back to evaluating expressions. */
23915 /* Free the message we created. */
23917 /* And restore the old one. */
23919 parser->integral_constant_expression_p
23921 parser->non_integral_constant_expression_p
23925 }
23927 /* If the current declaration has no declarator, return true. */
23929 static bool
23931 {
23932 /* If the next token is a `;' or a `,' then there is no
23933 declarator. */
23936 }
23938 /* Update the DECL_SPECS to reflect the storage class indicated by
23939 KEYWORD. */
23941 static void
23946 {
23947 cp_storage_class storage_class;
23950 {
23954 }
23956 {
23959 }
23964 {
23967 }
23970 {
23988 }
23992 /* A storage class specifier cannot be applied alongside a typedef
23993 specifier. If there is a typedef specifier present then set
23994 conflicting_specifiers_p which will trigger an error later
23995 on in grokdeclarator. */
23998 }
24000 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24001 is true, the type is a class or enum definition. */
24003 static void
24005 tree type_spec,
24008 {
24011 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24012 (with, for example, in "typedef int wchar_t;") we remember that
24013 this is what happened. In system headers, we ignore these
24014 declarations so that G++ can work with system headers that are not
24015 C++-safe. */
24017 && !type_definition_p
24027 {
24030 ds_redefined_builtin_type_spec,
24031 token);
24033 {
24037 }
24038 }
24041 else
24042 {
24047 }
24048 }
24050 /* True iff TOKEN is the GNU keyword __thread. */
24052 static bool
24054 {
24057 }
24059 /* Set the location for a declarator specifier and check if it is
24060 duplicated.
24062 DECL_SPECS is the sequence of declarator specifiers onto which to
24063 set the location.
24065 DS is the single declarator specifier to set which location is to
24066 be set onto the existing sequence of declarators.
24068 LOCATION is the location for the declarator specifier to
24069 consider. */
24071 static void
24074 {
24083 {
24087 }
24088 else
24089 {
24091 {
24095 else
24096 {
24099 OPT_Wlong_long,
24101 }
24102 }
24104 {
24109 else
24111 }
24112 else
24113 {
24129 "__complex"
24130 };
24133 }
24134 }
24135 }
24137 /* Return true iff the declarator specifier DS is present in the
24138 sequence of declarator specifiers DECL_SPECS. */
24140 bool
24142 cp_decl_spec ds)
24143 {
24150 }
24152 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24153 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24155 static bool
24157 {
24159 }
24161 /* Issue an error message indicating that TOKEN_DESC was expected.
24162 If KEYWORD is true, it indicated this function is called by
24163 cp_parser_require_keword and the required token can only be
24164 a indicated keyword. */
24166 static void
24168 required_token token_desc,
24170 {
24172 {
24241 }
24243 {
24245 {
24324 }
24325 }
24326 else
24328 }
24332 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24333 issue an error message indicating that TOKEN_DESC was expected.
24335 Returns the token consumed, if the token had the appropriate type.
24336 Otherwise, returns NULL. */
24341 required_token token_desc)
24342 {
24345 else
24346 {
24347 /* Output the MESSAGE -- unless we're parsing tentatively. */
24351 }
24352 }
24354 /* An error message is produced if the next token is not '>'.
24355 All further tokens are skipped until the desired token is
24356 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24358 static void
24360 {
24361 /* Current level of '< ... >'. */
24363 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24366 /* Are we ready, yet? If not, issue error message. */
24370 /* Skip tokens until the desired token is found. */
24372 {
24373 /* Peek at the next token. */
24375 {
24383 /* C++0x views the `>>' operator as two `>' tokens, but
24384 C++98 does not. */
24387 {
24388 /* We've hit a `>>' where the first `>' closes the
24389 template argument list, and the second `>' is
24390 spurious. Just consume the `>>' and stop; we've
24391 already produced at least one error. */
24394 }
24395 /* Fall through for C++0x, so we handle the second `>' in
24396 the `>>'. */
24400 {
24401 /* We've reached the token we want, consume it and stop. */
24404 }
24423 /* The '>' was probably forgotten, don't look further. */
24428 }
24430 /* Consume this token. */
24432 }
24433 }
24435 /* If the next token is the indicated keyword, consume it. Otherwise,
24436 issue an error message indicating that TOKEN_DESC was expected.
24438 Returns the token consumed, if the token had the appropriate type.
24439 Otherwise, returns NULL. */
24444 required_token token_desc)
24445 {
24449 {
24452 }
24455 }
24457 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24458 function-definition. */
24460 static bool
24462 {
24465 /* A ctor-initializer begins with a `:'. */
24467 /* A function-try-block begins with `try'. */
24469 /* A function-transaction-block begins with `__transaction_atomic'
24470 or `__transaction_relaxed'. */
24473 /* The named return value extension begins with `return'. */
24475 }
24477 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24478 definition. */
24480 static bool
24482 {
24489 }
24491 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24492 C++0x) ending a template-argument. */
24494 static bool
24496 {
24504 }
24506 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24507 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24509 static bool
24512 {
24518 /* Check for the sequence `<::' in the original code. It would be lexed as
24519 `[:', where `[' is a digraph, and there is no whitespace before
24520 `:'. */
24522 {
24527 }
24529 }
24531 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24532 or none_type otherwise. */
24534 static enum tag_types
24536 {
24538 {
24548 }
24549 }
24551 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24553 static void
24555 {
24559 {
24563 type))
24566 }
24567 }
24569 /* Issue an error message if DECL is redeclared with different
24570 access than its original declaration [class.access.spec/3].
24571 This applies to nested classes and nested class templates.
24572 [class.mem/1]. */
24574 static void
24576 {
24585 }
24587 /* Look for the `template' keyword, as a syntactic disambiguator.
24588 Return TRUE iff it is present, in which case it will be
24589 consumed. */
24591 static bool
24593 {
24595 {
24596 /* In C++98 the `template' keyword can only be used within templates;
24597 outside templates the parser can always figure out what is a
24598 template and what is not. In C++11, per the resolution of DR 468,
24599 `template' is allowed in cases where it is not strictly necessary. */
24602 {
24605 "in C++98 %<template%> (as a disambiguator) is only "
24607 /* If this part of the token stream is rescanned, the same
24608 error message would be generated. So, we purge the token
24609 from the stream. */
24612 }
24613 else
24614 {
24615 /* Consume the `template' keyword. */
24618 }
24619 }
24621 }
24623 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24624 set PARSER->SCOPE, and perform other related actions. */
24626 static void
24628 {
24634 /* Get the stored value. */
24636 /* Perform any access checks that were deferred. */
24639 {
24644 }
24645 /* Set the scope from the stored value. */
24649 }
24651 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24652 encounter the end of a block before what we were looking for. */
24654 static bool
24658 {
24660 {
24663 /* Abort a parenthesized expression if we encounter a semicolon. */
24667 /* If we've reached the end of the file, stop. */
24673 /* We've hit the end of an enclosing block, so there's been some
24674 kind of syntax error. */
24677 /* Consume the token. */
24679 /* See if it starts a new group. */
24681 {
24683 /* In theory this should probably check end == '}', but
24684 cp_parser_save_member_function_body needs it to exit
24685 after either '}' or ')' when called with ')'. */
24688 }
24690 {
24694 }
24699 }
24700 }
24702 /* Like above, for caching a default argument or NSDMI. Both of these are
24703 terminated by a non-nested comma, but it can be unclear whether or not a
24704 comma is nested in a template argument list unless we do more parsing.
24705 In order to handle this ambiguity, when we encounter a ',' after a '<'
24706 we try to parse what follows as a parameter-declaration-list (in the
24707 case of a default argument) or a member-declarator (in the case of an
24708 NSDMI). If that succeeds, then we stop caching. */
24710 static tree
24712 {
24717 tree default_argument;
24719 /* Add tokens until we have processed the entire default
24720 argument. We add the range [first_token, token). */
24723 {
24724 /* For list-initialization, this is straightforward. */
24727 }
24729 {
24732 /* Peek at the next token. */
24734 /* What we do depends on what token we have. */
24736 {
24737 /* In valid code, a default argument must be
24738 immediately followed by a `,' `)', or `...'. */
24741 {
24742 /* If we've seen a '<', we might be in a
24743 template-argument-list. Until Core issue 325 is
24744 resolved, we don't know how this situation ought
24745 to be handled, so try to DTRT. We check whether
24746 what comes after the comma is a valid parameter
24747 declaration list. If it is, then the comma ends
24748 the default argument; otherwise the default
24749 argument continues. */
24752 /* Set ITALP so cp_parser_parameter_declaration_list
24753 doesn't decide to commit to this parse. */
24761 {
24767 }
24768 else
24769 {
24773 }
24780 }
24783 /* If we run into a non-nested `;', `}', or `]',
24784 then the code is invalid -- but the default
24785 argument is certainly over. */
24790 /* Handle correctly int n = sizeof ... ( p ); */
24793 /* Update DEPTH, if necessary. */
24808 /* This might be the comparison operator, or it might
24809 start a template argument list. */
24816 /* Fall through for C++0x, which treats the `>>'
24817 operator like two `>' tokens in certain
24818 cases. */
24822 {
24823 /* This might be an operator, or it might close a
24824 template argument list. But if a previous '<'
24825 started a template argument list, this will have
24826 closed it, so we can't be in one anymore. */
24830 }
24833 /* If we run out of tokens, issue an error message. */
24842 /* In these cases, we should look for template-ids.
24843 For example, if the default argument is
24844 `X<int, double>()', we need to do name lookup to
24845 figure out whether or not `X' is a template; if
24846 so, the `,' does not end the default argument.
24848 That is not yet done. */
24853 }
24855 /* If we've reached the end, stop. */
24859 /* Add the token to the token block. */
24861 }
24863 /* Create a DEFAULT_ARG to represent the unparsed default
24864 argument. */
24871 }
24873 /* Begin parsing tentatively. We always save tokens while parsing
24874 tentatively so that if the tentative parsing fails we can restore the
24875 tokens. */
24877 static void
24879 {
24880 /* Enter a new parsing context. */
24882 /* Begin saving tokens. */
24884 /* In order to avoid repetitive access control error messages,
24885 access checks are queued up until we are no longer parsing
24886 tentatively. */
24888 }
24890 /* Commit to the currently active tentative parse. */
24892 static void
24894 {
24898 /* Mark all of the levels as committed. */
24901 {
24908 }
24909 }
24911 /* Commit to the topmost currently active tentative parse.
24913 Note that this function shouldn't be called when there are
24914 irreversible side-effects while in a tentative state. For
24915 example, we shouldn't create a permanent entry in the symbol
24916 table, or issue an error message that might not apply if the
24917 tentative parse is aborted. */
24919 static void
24921 {
24926 {
24934 }
24935 }
24937 /* Abort the currently active tentative parse. All consumed tokens
24938 will be rolled back, and no diagnostics will be issued. */
24940 static void
24942 {
24946 /* Now, pretend that we want to see if the construct was
24947 successfully parsed. */
24949 }
24951 /* Stop parsing tentatively. If a parse error has occurred, restore the
24952 token stream. Otherwise, commit to the tokens we have consumed.
24953 Returns true if no error occurred; false otherwise. */
24955 static bool
24957 {
24961 /* Remember whether or not an error occurred, since we are about to
24962 destroy that information. */
24964 /* Remove the topmost context from the stack. */
24967 /* If no parse errors occurred, commit to the tentative parse. */
24969 {
24970 /* Commit to the tokens read tentatively, unless that was
24971 already done. */
24976 }
24977 /* Otherwise, if errors occurred, roll back our state so that things
24978 are just as they were before we began the tentative parse. */
24979 else
24980 {
24983 }
24984 /* Add the context to the front of the free list. */
24989 }
24991 /* Returns true if we are parsing tentatively and are not committed to
24992 this tentative parse. */
24994 static bool
24996 {
24999 }
25001 /* Returns nonzero iff an error has occurred during the most recent
25002 tentative parse. */
25004 static bool
25006 {
25009 }
25011 /* Returns nonzero if GNU extensions are allowed. */
25013 static bool
25015 {
25017 }
25018 \f
25019 /* Objective-C++ Productions */
25022 /* Parse an Objective-C expression, which feeds into a primary-expression
25023 above.
25025 objc-expression:
25026 objc-message-expression
25027 objc-string-literal
25028 objc-encode-expression
25029 objc-protocol-expression
25030 objc-selector-expression
25032 Returns a tree representation of the expression. */
25034 static tree
25036 {
25037 /* Try to figure out what kind of declaration is present. */
25041 {
25051 {
25063 }
25069 }
25072 }
25074 /* Parse an Objective-C message expression.
25076 objc-message-expression:
25077 [ objc-message-receiver objc-message-args ]
25079 Returns a representation of an Objective-C message. */
25081 static tree
25083 {
25092 }
25094 /* Parse an objc-message-receiver.
25096 objc-message-receiver:
25097 expression
25098 simple-type-specifier
25100 Returns a representation of the type or expression. */
25102 static tree
25104 {
25105 tree rcv;
25107 /* An Objective-C message receiver may be either (1) a type
25108 or (2) an expression. */
25117 CP_PARSER_FLAGS_NONE);
25120 }
25122 /* Parse the arguments and selectors comprising an Objective-C message.
25124 objc-message-args:
25125 objc-selector
25126 objc-selector-args
25127 objc-selector-args , objc-comma-args
25129 objc-selector-args:
25130 objc-selector [opt] : assignment-expression
25131 objc-selector-args objc-selector [opt] : assignment-expression
25133 objc-comma-args:
25134 assignment-expression
25135 objc-comma-args , assignment-expression
25137 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25138 selector arguments and TREE_VALUE containing a list of comma
25139 arguments. */
25141 static tree
25143 {
25149 {
25155 /* Detect if we have a unary selector. */
25164 sel_args
25169 }
25171 /* Handle non-selector arguments, if any. */
25173 {
25174 tree arg;
25179 addl_args
25184 }
25187 {
25190 }
25193 }
25195 /* Parse an Objective-C encode expression.
25197 objc-encode-expression:
25198 @encode objc-typename
25200 Returns an encoded representation of the type argument. */
25202 static tree
25204 {
25205 tree type;
25215 {
25219 }
25221 /* This happens if we find @encode(T) (where T is a template
25222 typename or something dependent on a template typename) when
25223 parsing a template. In that case, we can't compile it
25224 immediately, but we rather create an AT_ENCODE_EXPR which will
25225 need to be instantiated when the template is used.
25226 */
25228 {
25232 }
25235 }
25237 /* Parse an Objective-C @defs expression. */
25239 static tree
25241 {
25242 tree name;
25250 }
25252 /* Parse an Objective-C protocol expression.
25254 objc-protocol-expression:
25255 @protocol ( identifier )
25257 Returns a representation of the protocol expression. */
25259 static tree
25261 {
25262 tree proto;
25270 }
25272 /* Parse an Objective-C selector expression.
25274 objc-selector-expression:
25275 @selector ( objc-method-signature )
25277 objc-method-signature:
25278 objc-selector
25279 objc-selector-seq
25281 objc-selector-seq:
25282 objc-selector :
25283 objc-selector-seq objc-selector :
25285 Returns a representation of the method selector. */
25287 static tree
25289 {
25301 {
25310 {
25311 /* Detect if we have a unary selector. */
25313 {
25316 }
25317 else
25318 {
25320 }
25321 }
25326 {
25327 sel_seq
25330 sel_seq
25333 }
25334 else
25335 sel_seq
25340 }
25342 finish_selector:
25346 }
25348 /* Parse a list of identifiers.
25350 objc-identifier-list:
25351 identifier
25352 objc-identifier-list , identifier
25354 Returns a TREE_LIST of identifier nodes. */
25356 static tree
25358 {
25359 tree identifier;
25360 tree list;
25371 {
25378 identifier));
25380 }
25383 }
25385 /* Parse an Objective-C alias declaration.
25387 objc-alias-declaration:
25388 @compatibility_alias identifier identifier ;
25390 This function registers the alias mapping with the Objective-C front end.
25391 It returns nothing. */
25393 static void
25395 {
25403 }
25405 /* Parse an Objective-C class forward-declaration.
25407 objc-class-declaration:
25408 @class objc-identifier-list ;
25410 The function registers the forward declarations with the Objective-C
25411 front end. It returns nothing. */
25413 static void
25415 {
25418 {
25419 tree id;
25429 else
25431 }
25433 }
25435 /* Parse a list of Objective-C protocol references.
25437 objc-protocol-refs-opt:
25438 objc-protocol-refs [opt]
25440 objc-protocol-refs:
25441 < objc-identifier-list >
25443 Returns a TREE_LIST of identifiers, if any. */
25445 static tree
25447 {
25451 {
25455 }
25458 }
25460 /* Parse a Objective-C visibility specification. */
25462 static void
25464 {
25468 {
25483 }
25485 /* Eat '@private'/'@protected'/'@public'. */
25487 }
25489 /* Parse an Objective-C method type. Return 'true' if it is a class
25490 (+) method, and 'false' if it is an instance (-) method. */
25494 {
25497 else
25499 }
25501 /* Parse an Objective-C protocol qualifier. */
25503 static tree
25505 {
25518 {
25523 }
25526 }
25528 /* Parse an Objective-C typename. */
25530 static tree
25532 {
25536 {
25542 /* An ObjC type name may consist of just protocol qualifiers, in which
25543 case the type shall default to 'id'. */
25545 {
25548 /* If the type could not be parsed, an error has already
25549 been produced. For error recovery, behave as if it had
25550 not been specified, which will use the default type
25551 'id'. */
25553 {
25555 /* We need to skip to the closing parenthesis as
25556 cp_parser_type_id() does not seem to do it for
25557 us. */
25562 }
25563 }
25567 }
25570 }
25572 /* Check to see if TYPE refers to an Objective-C selector name. */
25574 static bool
25576 {
25582 }
25584 /* Parse an Objective-C selector. */
25586 static tree
25588 {
25592 {
25595 }
25597 /* C++ operator names are allowed to appear in ObjC selectors. */
25599 {
25612 }
25613 }
25615 /* Parse an Objective-C params list. */
25617 static tree
25619 {
25625 {
25635 /* Detect if we have a unary selector. */
25638 {
25641 }
25645 {
25646 /* Something went quite wrong. There should be a colon
25647 here, but there is not. Stop parsing parameters. */
25649 }
25651 /* New ObjC allows attributes on parameters too. */
25656 params
25659 type_name,
25660 identifier,
25661 parm_attr));
25664 }
25667 {
25670 }
25672 /* We allow tail attributes for the method. */
25674 {
25682 }
25685 {
25688 }
25690 }
25692 /* Parse the non-keyword Objective-C params. */
25694 static tree
25697 {
25703 {
25705 tree parm;
25711 {
25716 }
25718 /* TODO: parse attributes for tail parameters. */
25727 }
25729 /* We allow tail attributes for the method. */
25731 {
25733 {
25738 }
25739 else
25740 /* We have an error, but parse the attributes, so that we can
25741 carry on. */
25747 }
25750 }
25752 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25754 static void
25756 {
25759 /* If the next token is `extern' and the following token is a string
25760 literal, then we have a linkage specification. */
25762 && cp_parser_is_pure_string_literal
25765 /* Handle #pragma, if any. */
25768 /* Allow stray semicolons. */
25771 /* Mark methods as optional or required, when building protocols. */
25773 {
25776 }
25778 {
25781 }
25784 /* Other stray characters must generate errors. */
25786 {
25790 }
25791 /* Finally, try to parse a block-declaration, or a function-definition. */
25792 else
25794 }
25796 /* Parse a method signature. */
25798 static tree
25800 {
25816 }
25818 static bool
25820 {
25821 tree tattr;
25826 /* If the attributes are followed by a method introducer, this is not allowed.
25827 Dump the attributes and flag the situation. */
25832 /* Otherwise, the attributes introduce some interstitial code, possibly so
25833 rewind to allow that check. */
25836 }
25838 /* Parse an Objective-C method prototype list. */
25840 static void
25842 {
25846 {
25848 {
25853 else
25857 {
25861 }
25864 }
25870 OPT_Wattributes,
25872 else
25873 /* Allow for interspersed non-ObjC++ code. */
25877 }
25881 else
25885 }
25887 /* Parse an Objective-C method definition list. */
25889 static void
25891 {
25895 {
25896 tree meth;
25899 {
25905 else
25910 {
25914 }
25916 NULL_TREE);
25918 /* For historical reasons, we accept an optional semicolon. */
25925 {
25932 }
25933 }
25934 /* The following case will be removed once @synthesize is
25935 completely implemented. */
25946 else
25947 /* Allow for interspersed non-ObjC++ code. */
25951 }
25955 else
25959 }
25961 /* Parse Objective-C ivars. */
25963 static void
25965 {
25976 {
25977 cp_decl_specifier_seq declspecs;
25979 tree prefix_attributes;
25987 CP_PARSER_FLAGS_OPTIONAL,
25991 /* auto, register, static, extern, mutable. */
25993 {
25996 }
25998 /* thread_local. */
26000 {
26003 }
26005 /* typedef. */
26007 {
26010 }
26015 /* Keep going until we hit the `;' at the end of the
26016 declaration. */
26018 {
26023 /* Check for a (possibly unnamed) bitfield declaration. */
26031 {
26032 /* Get the name of the bitfield. */
26035 sfk_none);
26037 eat_colon:
26039 /* Get the width of the bitfield. */
26040 width
26043 NULL);
26044 }
26045 else
26046 {
26047 /* Parse the declarator. */
26048 declarator
26053 }
26055 /* Look for attributes that apply to the ivar. */
26057 /* Remember which attributes are prefix attributes and
26058 which are not. */
26060 /* Combine the attributes. */
26064 /* Create the bitfield declaration. */
26066 width,
26067 attributes);
26068 else
26073 /* Add the instance variable. */
26077 /* Reset PREFIX_ATTRIBUTES. */
26086 {
26089 }
26091 }
26095 }
26100 /* Do not consume the RID_AT_END, so it will be read again as terminating
26101 the @interface of @implementation. */
26105 /* For historical reasons, we accept an optional semicolon. */
26108 }
26110 /* Parse an Objective-C protocol declaration. */
26112 static void
26114 {
26120 {
26125 }
26127 /* See if we have a forward declaration or a definition. */
26130 /* Try a forward declaration first. */
26132 {
26134 {
26135 tree id;
26145 else
26147 }
26149 }
26151 /* Ok, we got a full-fledged definition (or at least should). */
26152 else
26153 {
26158 }
26159 }
26161 /* Parse an Objective-C superclass or category. */
26163 static void
26168 {
26174 {
26177 }
26179 {
26182 /* If there is no category name, and this is an @interface, we
26183 have a class extension. */
26185 {
26188 }
26189 else
26193 }
26194 }
26196 /* Parse an Objective-C class interface. */
26198 static void
26200 {
26207 {
26208 /* It's hard to recover because even if valid @interface stuff
26209 is to follow, we can't compile it (or validate it) if we
26210 don't even know which class it refers to. Let's assume this
26211 was a stray '@interface' token in the stream and skip it.
26212 */
26214 }
26219 /* We have either a class or a category on our hands. */
26222 else
26223 {
26225 /* Handle instance variable declarations, if any. */
26228 }
26231 }
26233 /* Parse an Objective-C class implementation. */
26235 static void
26237 {
26244 {
26245 /* It's hard to recover because even if valid @implementation
26246 stuff is to follow, we can't compile it (or validate it) if
26247 we don't even know which class it refers to. Let's assume
26248 this was a stray '@implementation' token in the stream and
26249 skip it.
26250 */
26252 }
26256 /* We have either a class or a category on our hands. */
26259 else
26260 {
26262 /* Handle instance variable declarations, if any. */
26265 }
26268 }
26270 /* Consume the @end token and finish off the implementation. */
26272 static void
26274 {
26277 }
26279 /* Parse an Objective-C declaration. */
26281 static void
26283 {
26284 /* Try to figure out what kind of declaration is present. */
26289 {
26305 }
26308 {
26331 }
26332 }
26334 /* Parse an Objective-C try-catch-finally statement.
26336 objc-try-catch-finally-stmt:
26337 @try compound-statement objc-catch-clause-seq [opt]
26338 objc-finally-clause [opt]
26340 objc-catch-clause-seq:
26341 objc-catch-clause objc-catch-clause-seq [opt]
26343 objc-catch-clause:
26344 @catch ( objc-exception-declaration ) compound-statement
26346 objc-finally-clause:
26347 @finally compound-statement
26349 objc-exception-declaration:
26350 parameter-declaration
26351 '...'
26353 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26355 Returns NULL_TREE.
26357 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26358 for C. Keep them in sync. */
26360 static tree
26362 {
26363 location_t location;
26364 tree stmt;
26369 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26370 node, lest it get absorbed into the surrounding block. */
26376 {
26385 {
26386 /* We have "@catch (...)" (where the '...' are literally
26387 what is in the code). Skip the '...'.
26388 parameter_declaration is set to NULL_TREE, and
26389 objc_being_catch_clauses() knows that that means
26390 '...'. */
26393 }
26394 else
26395 {
26396 /* We have "@catch (NSException *exception)" or something
26397 like that. Parse the parameter declaration. */
26401 else
26406 }
26409 else
26410 {
26411 /* If there was no open parenthesis, we are recovering from
26412 an error, and we are trying to figure out what mistake
26413 the user has made. */
26415 /* If there is an immediate closing parenthesis, the user
26416 probably forgot the opening one (ie, they typed "@catch
26417 NSException *e)". Parse the closing parenthesis and keep
26418 going. */
26422 /* If these is no immediate closing parenthesis, the user
26423 probably doesn't know that parenthesis are required at
26424 all (ie, they typed "@catch NSException *e"). So, just
26425 forget about the closing parenthesis and keep going. */
26426 }
26430 }
26432 {
26435 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26436 node, lest it get absorbed into the surrounding block. */
26440 }
26443 }
26445 /* Parse an Objective-C synchronized statement.
26447 objc-synchronized-stmt:
26448 @synchronized ( expression ) compound-statement
26450 Returns NULL_TREE. */
26452 static tree
26454 {
26455 location_t location;
26466 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26467 node, lest it get absorbed into the surrounding block. */
26472 }
26474 /* Parse an Objective-C throw statement.
26476 objc-throw-stmt:
26477 @throw assignment-expression [opt] ;
26479 Returns a constructed '@throw' statement. */
26481 static tree
26483 {
26495 }
26497 /* Parse an Objective-C statement. */
26499 static tree
26501 {
26502 /* Try to figure out what kind of declaration is present. */
26506 {
26517 }
26520 }
26522 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26523 look ahead to see if an objc keyword follows the attributes. This
26524 is to detect the use of prefix attributes on ObjC @interface and
26525 @protocol. */
26527 static bool
26529 {
26534 {
26537 }
26540 }
26542 /* This routine is a minimal replacement for
26543 c_parser_struct_declaration () used when parsing the list of
26544 types/names or ObjC++ properties. For example, when parsing the
26545 code
26547 @property (readonly) int a, b, c;
26549 this function is responsible for parsing "int a, int b, int c" and
26550 returning the declarations as CHAIN of DECLs.
26552 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26553 similar parsing. */
26554 static tree
26556 {
26558 cp_decl_specifier_seq declspecs;
26560 tree prefix_attributes;
26563 CP_PARSER_FLAGS_NONE,
26570 /* auto, register, static, extern, mutable. */
26572 {
26575 }
26577 /* thread_local. */
26579 {
26582 }
26584 /* typedef. */
26586 {
26589 }
26594 /* Keep going until we hit the `;' at the end of the declaration. */
26596 {
26601 /* Parse the declarator. */
26605 /* Look for attributes that apply to the ivar. */
26607 /* Remember which attributes are prefix attributes and
26608 which are not. */
26610 /* Combine the attributes. */
26620 /* Reset PREFIX_ATTRIBUTES. */
26631 {
26634 }
26635 else
26637 }
26639 }
26641 /* Parse an Objective-C @property declaration. The syntax is:
26643 objc-property-declaration:
26644 '@property' objc-property-attributes[opt] struct-declaration ;
26646 objc-property-attributes:
26647 '(' objc-property-attribute-list ')'
26649 objc-property-attribute-list:
26650 objc-property-attribute
26651 objc-property-attribute-list, objc-property-attribute
26653 objc-property-attribute
26654 'getter' = identifier
26655 'setter' = identifier
26656 'readonly'
26657 'readwrite'
26658 'assign'
26659 'retain'
26660 'copy'
26661 'nonatomic'
26663 For example:
26664 @property NSString *name;
26665 @property (readonly) id object;
26666 @property (retain, nonatomic, getter=getTheName) id name;
26667 @property int a, b, c;
26669 PS: This function is identical to
26670 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26671 static void
26673 {
26674 /* The following variables hold the attributes of the properties as
26675 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26676 seen. When we see an attribute, we set them to 'true' (if they
26677 are boolean properties) or to the identifier (if they have an
26678 argument, ie, for getter and setter). Note that here we only
26679 parse the list of attributes, check the syntax and accumulate the
26680 attributes that we find. objc_add_property_declaration() will
26681 then process the information. */
26691 /* 'properties' is the list of properties that we read. Usually a
26692 single one, but maybe more (eg, in "@property int a, b, c;" there
26693 are three). */
26694 tree properties;
26695 location_t loc;
26701 /* Parse the optional attribute list... */
26703 {
26704 /* Eat the '('. */
26708 {
26714 {
26717 }
26721 {
26732 {
26736 else
26741 }
26744 {
26748 }
26750 {
26752 {
26755 }
26756 else
26760 else
26762 }
26763 else
26764 {
26766 {
26769 }
26770 else
26772 }
26778 }
26785 else
26787 }
26789 /* FIXME: "@property (setter, assign);" will generate a spurious
26790 "error: expected ‘)’ before ‘,’ token". This is because
26791 cp_parser_require, unlike the C counterpart, will produce an
26792 error even if we are in error recovery. */
26794 {
26799 }
26800 }
26802 /* ... and the property declaration(s). */
26806 {
26808 /* If the next token is now a `;', consume it. */
26812 }
26816 else
26817 {
26818 /* Comma-separated properties are chained together in
26819 reverse order; add them one by one. */
26828 }
26831 }
26833 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26835 objc-synthesize-declaration:
26836 @synthesize objc-synthesize-identifier-list ;
26838 objc-synthesize-identifier-list:
26839 objc-synthesize-identifier
26840 objc-synthesize-identifier-list, objc-synthesize-identifier
26842 objc-synthesize-identifier
26843 identifier
26844 identifier = identifier
26846 For example:
26847 @synthesize MyProperty;
26848 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26850 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26851 for C. Keep them in sync.
26852 */
26853 static void
26855 {
26857 location_t loc;
26862 {
26866 {
26869 }
26871 {
26875 {
26878 }
26879 }
26880 else
26885 else
26887 }
26890 }
26892 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26894 objc-dynamic-declaration:
26895 @dynamic identifier-list ;
26897 For example:
26898 @dynamic MyProperty;
26899 @dynamic MyProperty, AnotherProperty;
26901 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26902 for C. Keep them in sync.
26903 */
26904 static void
26906 {
26908 location_t loc;
26913 {
26914 tree property;
26917 {
26920 }
26924 else
26926 }
26929 }
26931 \f
26932 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26934 /* Returns name of the next clause.
26935 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26936 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26937 returned and the token is consumed. */
26939 static pragma_omp_clause
26941 {
26953 {
26958 {
27061 }
27062 }
27068 }
27070 /* Validate that a clause of the given type does not already exist. */
27072 static void
27075 {
27076 tree c;
27080 {
27083 }
27084 }
27086 /* OpenMP 2.5:
27087 variable-list:
27088 identifier
27089 variable-list , identifier
27091 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27092 colon). An opening parenthesis will have been consumed by the caller.
27094 If KIND is nonzero, create the appropriate node and install the decl
27095 in OMP_CLAUSE_DECL and add the node to the head of the list.
27097 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27098 return the list created.
27100 COLON can be NULL if only closing parenthesis should end the list,
27101 or pointer to bool which will receive false if the list is terminated
27102 by closing parenthesis or true if the list is terminated by colon. */
27104 static tree
27107 {
27111 {
27114 }
27116 {
27133 {
27135 {
27141 {
27148 NULL);
27150 parser->colon_corrects_to_scope_p
27154 else
27155 {
27156 /* Look for `:'. */
27160 CPP_CLOSE_SQUARE))
27163 NULL);
27164 }
27165 /* Look for the closing `]'. */
27167 RT_CLOSE_SQUARE))
27170 }
27174 }
27180 }
27181 else
27184 get_comma:
27188 }
27194 {
27198 }
27201 {
27204 /* Try to resync to an unnested comma. Copied from
27205 cp_parser_parenthesized_expression_list. */
27206 skip_comma:
27215 }
27218 }
27220 /* Similarly, but expect leading and trailing parenthesis. This is a very
27221 common case for omp clauses. */
27223 static tree
27225 {
27229 }
27231 /* OpenMP 3.0:
27232 collapse ( constant-expression ) */
27234 static tree
27236 {
27238 location_t loc;
27239 HOST_WIDE_INT n;
27259 {
27262 }
27270 }
27272 /* OpenMP 2.5:
27273 default ( shared | none ) */
27275 static tree
27277 {
27279 tree c;
27284 {
27289 {
27304 }
27307 }
27308 else
27309 {
27310 invalid_kind:
27312 }
27328 }
27330 /* OpenMP 3.1:
27331 final ( expression ) */
27333 static tree
27335 {
27356 }
27358 /* OpenMP 2.5:
27359 if ( expression ) */
27361 static tree
27363 {
27384 }
27386 /* OpenMP 3.1:
27387 mergeable */
27389 static tree
27392 {
27393 tree c;
27396 location);
27401 }
27403 /* OpenMP 2.5:
27404 nowait */
27406 static tree
27409 {
27410 tree c;
27417 }
27419 /* OpenMP 2.5:
27420 num_threads ( expression ) */
27422 static tree
27424 location_t location)
27425 {
27447 }
27449 /* OpenMP 2.5:
27450 ordered */
27452 static tree
27455 {
27456 tree c;
27464 }
27466 /* OpenMP 2.5:
27467 reduction ( reduction-operator : variable-list )
27469 reduction-operator:
27470 One of: + * - & ^ | && ||
27472 OpenMP 3.1:
27474 reduction-operator:
27475 One of: + * - & ^ | && || min max
27477 OpenMP 4.0:
27479 reduction-operator:
27480 One of: + * - & ^ | && ||
27481 id-expression */
27483 static tree
27485 {
27493 {
27503 }
27507 else
27508 {
27519 {
27549 }
27550 else
27551 {
27553 resync_fail:
27558 }
27559 }
27565 NULL);
27567 {
27570 }
27573 }
27575 /* OpenMP 2.5:
27576 schedule ( schedule-kind )
27577 schedule ( schedule-kind , expression )
27579 schedule-kind:
27580 static | dynamic | guided | runtime | auto */
27582 static tree
27584 {
27593 {
27598 {
27619 }
27620 }
27625 else
27630 {
27645 else
27650 }
27658 invalid_kind:
27660 resync_fail:
27665 }
27667 /* OpenMP 3.0:
27668 untied */
27670 static tree
27673 {
27674 tree c;
27681 }
27683 /* OpenMP 4.0:
27684 inbranch
27685 notinbranch */
27687 static tree
27690 {
27695 }
27697 /* OpenMP 4.0:
27698 parallel
27699 for
27700 sections
27701 taskgroup */
27703 static tree
27707 {
27711 }
27713 /* OpenMP 4.0:
27714 num_teams ( expression ) */
27716 static tree
27718 location_t location)
27719 {
27741 }
27743 /* OpenMP 4.0:
27744 thread_limit ( expression ) */
27746 static tree
27748 location_t location)
27749 {
27771 }
27773 /* OpenMP 4.0:
27774 aligned ( variable-list )
27775 aligned ( variable-list : constant-expression ) */
27777 static tree
27779 {
27790 {
27800 }
27806 }
27808 /* OpenMP 4.0:
27809 linear ( variable-list )
27810 linear ( variable-list : expression ) */
27812 static tree
27815 {
27826 {
27830 {
27833 }
27841 }
27847 }
27849 /* OpenMP 4.0:
27850 safelen ( constant-expression ) */
27852 static tree
27854 location_t location)
27855 {
27876 }
27878 /* OpenMP 4.0:
27879 simdlen ( constant-expression ) */
27881 static tree
27883 location_t location)
27884 {
27905 }
27907 /* OpenMP 4.0:
27908 depend ( depend-kind : variable-list )
27910 depend-kind:
27911 in | out | inout */
27913 static tree
27915 {
27923 {
27933 else
27935 }
27936 else
27944 NULL);
27951 invalid_kind:
27953 resync_fail:
27958 }
27960 /* OpenMP 4.0:
27961 map ( map-kind : variable-list )
27962 map ( variable-list )
27964 map-kind:
27965 alloc | to | from | tofrom */
27967 static tree
27969 {
27978 {
27990 else
27991 {
27997 }
28000 }
28003 NULL);
28009 }
28011 /* OpenMP 4.0:
28012 device ( expression ) */
28014 static tree
28016 location_t location)
28017 {
28039 }
28041 /* OpenMP 4.0:
28042 dist_schedule ( static )
28043 dist_schedule ( static , expression ) */
28045 static tree
28047 location_t location)
28048 {
28061 {
28072 }
28077 location);
28081 invalid_kind:
28083 resync_fail:
28088 }
28090 /* OpenMP 4.0:
28091 proc_bind ( proc-bind-kind )
28093 proc-bind-kind:
28094 master | close | spread */
28096 static tree
28098 location_t location)
28099 {
28100 tree c;
28107 {
28117 else
28119 }
28120 else
28129 location);
28134 invalid_kind:
28136 resync_fail:
28141 }
28143 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28144 is a bitmask in MASK. Return the list of clauses found; the result
28145 of clause default goes in *pdefault. */
28147 static tree
28151 {
28158 {
28159 pragma_omp_clause c_kind;
28170 {
28182 clauses);
28196 clauses);
28205 clauses);
28229 clauses);
28243 clauses);
28260 OMP_CLAUSE_NOTINBRANCH,
28269 {
28270 clause_not_first:
28274 }
28299 clauses);
28304 clauses);
28309 clauses);
28372 }
28377 {
28378 /* Remove the invalid clause(s) from the list to avoid
28379 confusing the rest of the compiler. */
28382 }
28383 }
28384 saw_error:
28385 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28386 no reason to skip to the end. */
28392 }
28394 /* OpenMP 2.5:
28395 structured-block:
28396 statement
28398 In practice, we're also interested in adding the statement to an
28399 outer node. So it is convenient if we work around the fact that
28400 cp_parser_statement calls add_stmt. */
28402 static unsigned
28404 {
28407 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28408 This preserves the "not within loop or switch" style error messages
28409 for nonsense cases like
28410 void foo() {
28411 #pragma omp single
28412 break;
28413 }
28414 */
28419 }
28421 static void
28423 {
28425 }
28427 static tree
28429 {
28437 }
28439 /* OpenMP 2.5:
28440 # pragma omp atomic new-line
28441 expression-stmt
28443 expression-stmt:
28444 x binop= expr | x++ | ++x | x-- | --x
28445 binop:
28446 +, *, -, /, &, ^, |, <<, >>
28448 where x is an lvalue expression with scalar type.
28450 OpenMP 3.1:
28451 # pragma omp atomic new-line
28452 update-stmt
28454 # pragma omp atomic read new-line
28455 read-stmt
28457 # pragma omp atomic write new-line
28458 write-stmt
28460 # pragma omp atomic update new-line
28461 update-stmt
28463 # pragma omp atomic capture new-line
28464 capture-stmt
28466 # pragma omp atomic capture new-line
28467 capture-block
28469 read-stmt:
28470 v = x
28471 write-stmt:
28472 x = expr
28473 update-stmt:
28474 expression-stmt | x = x binop expr
28475 capture-stmt:
28476 v = expression-stmt
28477 capture-block:
28478 { v = x; update-stmt; } | { update-stmt; v = x; }
28480 OpenMP 4.0:
28481 update-stmt:
28482 expression-stmt | x = x binop expr | x = expr binop x
28483 capture-stmt:
28484 v = update-stmt
28485 capture-block:
28486 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28488 where x and v are lvalue expressions with scalar type. */
28490 static void
28492 {
28500 {
28512 else
28516 }
28519 {
28524 {
28527 }
28528 }
28532 {
28543 else
28549 {
28550 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28551 opcode. */
28556 }
28560 {
28563 }
28564 else
28565 {
28572 }
28575 }
28577 restart:
28582 {
28589 /* FALLTHROUGH */
28599 /* FALLTHROUGH */
28614 /* Undo effects of boolean_increment for post {in,de}crement. */
28616 /* FALLTHRU */
28620 {
28621 /* Undo effects of boolean_increment. */
28623 {
28624 /* This is pre or post increment. */
28629 && !structured_block
28633 }
28634 }
28635 /* FALLTHRU */
28638 {
28673 {
28677 }
28680 {
28686 {
28691 }
28693 {
28704 {
28706 {
28711 }
28712 else
28714 }
28718 }
28721 {
28728 }
28732 }
28736 {
28739 {
28747 }
28749 {
28754 }
28789 }
28800 /* FALLTHROUGH */
28805 }
28812 }
28813 stmt_done:
28815 {
28828 }
28830 {
28833 }
28834 done:
28840 saw_error:
28843 {
28847 {
28851 }
28852 }
28853 }
28856 /* OpenMP 2.5:
28857 # pragma omp barrier new-line */
28859 static void
28861 {
28864 }
28866 /* OpenMP 2.5:
28867 # pragma omp critical [(name)] new-line
28868 structured-block */
28870 static tree
28872 {
28876 {
28888 }
28893 }
28895 /* OpenMP 2.5:
28896 # pragma omp flush flush-vars[opt] new-line
28898 flush-vars:
28899 ( variable-list ) */
28901 static void
28903 {
28909 }
28911 /* Helper function, to parse omp for increment expression. */
28913 static tree
28915 {
28920 {
28923 }
28926 {
28935 /* Fall through: OpenMP disallows NE_EXPR. */
28938 }
28940 /* If decl is an iterator, preserve LHS and RHS of the relational
28941 expr until finish_omp_for. */
28951 }
28953 /* Helper function, to parse omp for increment expression. */
28955 static tree
28957 {
28961 cp_id_kind idk;
28965 {
28973 }
28981 {
28986 }
28993 {
28997 }
29009 do
29010 {
29017 {
29019 {
29022 else
29024 tf_warning_or_error);
29025 }
29026 else
29029 }
29030 }
29034 {
29038 }
29039 else
29043 }
29045 /* Parse the initialization statement of either an OpenMP for loop or
29046 a Cilk Plus for loop.
29048 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29049 Plus.
29051 Return true if the resulting construct should have an
29052 OMP_CLAUSE_PRIVATE added to it. */
29054 static bool
29062 {
29068 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29070 init-expr:
29071 var = lb
29072 integer-type var = lb
29073 random-access-iterator-type var = lb
29074 pointer-type var = lb
29075 */
29076 cp_decl_specifier_seq type_specifiers;
29078 /* First, try to parse as an initialized declaration. See
29079 cp_parser_condition, from whence the bulk of this is copied. */
29086 {
29087 /* If parsing a type specifier seq succeeded, then this
29088 MUST be a initialized declaration. */
29093 CP_PARSER_DECLARATOR_NAMED,
29103 else
29104 {
29114 {
29116 CPP_OPEN_PAREN))
29117 {
29121 else
29124 }
29125 else
29126 /* Trigger an error. */
29131 }
29135 {
29143 {
29146 auto_node);
29151 }
29154 asm_specification,
29155 LOOKUP_ONLYCONVERTING);
29157 {
29160 }
29161 else
29164 }
29165 else
29166 {
29167 /* Consume '='. */
29171 non_class:
29174 else
29177 asm_specification,
29178 LOOKUP_ONLYCONVERTING);
29179 }
29183 }
29184 }
29185 else
29186 {
29187 cp_id_kind idk;
29188 /* If parsing a type specifier sequence failed, then
29189 this MUST be a simple expression. */
29194 && decl
29197 {
29198 tree rhs;
29205 rhs,
29206 tf_warning_or_error));
29208 }
29209 else
29210 {
29215 {
29219 }
29220 }
29221 }
29223 }
29225 /* Parse the restricted form of the for statement allowed by OpenMP. */
29227 static tree
29230 {
29234 location_t loc_first;
29253 {
29256 location_t loc;
29259 {
29262 }
29271 add_private_clause
29279 {
29282 {
29288 }
29289 else
29291 }
29298 {
29303 {
29307 }
29310 {
29311 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29312 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29321 }
29322 else
29323 {
29328 }
29329 }
29332 {
29333 tree c;
29335 {
29344 decl);
29348 decl);
29349 }
29351 {
29356 {
29359 }
29360 }
29361 }
29370 {
29371 /* If decl is an iterator, preserve the operator on decl
29372 until finish_omp_for. */
29374 && ((processing_template_decl
29378 else
29382 }
29397 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29398 in between the collapsed for loops to be still considered perfectly
29399 nested. Hopefully the final version clarifies this.
29400 For now handle (multiple) {'s and empty statements. */
29402 do
29403 {
29407 {
29409 bracecount++;
29410 }
29414 else
29415 {
29422 }
29423 }
29427 {
29430 }
29431 }
29433 /* Note that we saved the original contents of this flag when we entered
29434 the structured block, and so we don't need to re-save it here. */
29437 else
29440 /* Note that the grammar doesn't call for a structured block here,
29441 though the loop as a whole is a structured block. */
29448 else
29453 {
29455 {
29457 nbraces--;
29458 }
29461 else
29462 {
29464 {
29467 }
29472 }
29473 }
29480 }
29482 /* Helper function for OpenMP parsing, split clauses and call
29483 finish_omp_clauses on each of the set of clauses afterwards. */
29485 static void
29488 {
29494 }
29496 /* OpenMP 4.0:
29497 #pragma omp simd simd-clause[optseq] new-line
29498 for-loop */
29500 #define OMP_SIMD_CLAUSE_MASK \
29501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29509 static tree
29512 {
29524 {
29527 }
29538 }
29540 /* OpenMP 2.5:
29541 #pragma omp for for-clause[optseq] new-line
29542 for-loop
29544 OpenMP 4.0:
29545 #pragma omp for simd for-simd-clause[optseq] new-line
29546 for-loop */
29548 #define OMP_FOR_CLAUSE_MASK \
29549 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29558 static tree
29561 {
29572 {
29577 {
29585 cclauses);
29589 cclauses);
29601 }
29602 }
29604 {
29607 }
29612 {
29615 }
29626 }
29628 /* OpenMP 2.5:
29629 # pragma omp master new-line
29630 structured-block */
29632 static tree
29634 {
29638 }
29640 /* OpenMP 2.5:
29641 # pragma omp ordered new-line
29642 structured-block */
29644 static tree
29646 {
29650 }
29652 /* OpenMP 2.5:
29654 section-scope:
29655 { section-sequence }
29657 section-sequence:
29658 section-directive[opt] structured-block
29659 section-sequence section-directive structured-block */
29661 static tree
29663 {
29674 {
29678 }
29681 {
29689 {
29693 }
29695 {
29698 }
29703 }
29714 }
29716 /* OpenMP 2.5:
29717 # pragma omp sections sections-clause[optseq] newline
29718 sections-scope */
29720 #define OMP_SECTIONS_CLAUSE_MASK \
29721 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29727 static tree
29730 {
29742 {
29745 }
29752 }
29754 /* OpenMP 2.5:
29755 # pragma omp parallel parallel-clause[optseq] new-line
29756 structured-block
29757 # pragma omp parallel for parallel-for-clause[optseq] new-line
29758 structured-block
29759 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
29760 structured-block
29762 OpenMP 4.0:
29763 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
29764 structured-block */
29766 #define OMP_PARALLEL_CLAUSE_MASK \
29767 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29777 static tree
29780 {
29789 {
29802 block);
29805 }
29807 {
29811 }
29813 {
29816 }
29818 {
29822 {
29832 block);
29835 }
29836 }
29846 }
29848 /* OpenMP 2.5:
29849 # pragma omp single single-clause[optseq] new-line
29850 structured-block */
29852 #define OMP_SINGLE_CLAUSE_MASK \
29853 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29858 static tree
29860 {
29870 }
29872 /* OpenMP 3.0:
29873 # pragma omp task task-clause[optseq] new-line
29874 structured-block */
29876 #define OMP_TASK_CLAUSE_MASK \
29877 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29887 static tree
29889 {
29900 }
29902 /* OpenMP 3.0:
29903 # pragma omp taskwait new-line */
29905 static void
29907 {
29910 }
29912 /* OpenMP 3.1:
29913 # pragma omp taskyield new-line */
29915 static void
29917 {
29920 }
29922 /* OpenMP 4.0:
29923 # pragma omp taskgroup new-line
29924 structured-block */
29926 static tree
29928 {
29932 }
29935 /* OpenMP 2.5:
29936 # pragma omp threadprivate (variable-list) */
29938 static void
29940 {
29941 tree vars;
29947 }
29949 /* OpenMP 4.0:
29950 # pragma omp cancel cancel-clause[optseq] new-line */
29952 #define OMP_CANCEL_CLAUSE_MASK \
29953 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
29957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29959 static void
29961 {
29965 }
29967 /* OpenMP 4.0:
29968 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
29970 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
29971 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
29976 static void
29978 {
29979 tree clauses;
29983 {
29988 {
29991 }
29992 }
29994 {
29998 }
30001 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30003 pragma_tok);
30005 }
30007 /* OpenMP 4.0:
30008 #pragma omp distribute distribute-clause[optseq] new-line
30009 for-loop */
30011 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30012 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30017 static tree
30020 {
30029 {
30037 else
30040 {
30046 {
30049 cclauses);
30050 else
30052 cclauses);
30053 }
30058 cclauses);
30059 else
30061 cclauses);
30073 }
30074 }
30076 {
30079 }
30084 {
30087 }
30098 }
30100 /* OpenMP 4.0:
30101 # pragma omp teams teams-clause[optseq] new-line
30102 structured-block */
30104 #define OMP_TEAMS_CLAUSE_MASK \
30105 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30113 static tree
30116 {
30125 {
30129 {
30137 cclauses);
30141 cclauses);
30152 }
30153 }
30155 {
30158 }
30163 {
30166 }
30174 }
30176 /* OpenMP 4.0:
30177 # pragma omp target data target-data-clause[optseq] new-line
30178 structured-block */
30180 #define OMP_TARGET_DATA_CLAUSE_MASK \
30181 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30185 static tree
30187 {
30199 }
30201 /* OpenMP 4.0:
30202 # pragma omp target update target-update-clause[optseq] new-line */
30204 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30205 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30210 static bool
30213 {
30215 {
30217 "%<#pragma omp target update%> may only be "
30221 }
30223 tree clauses
30228 {
30230 "%<#pragma omp target update must contain at least one "
30233 }
30241 }
30243 /* OpenMP 4.0:
30244 # pragma omp target target-clause[optseq] new-line
30245 structured-block */
30247 #define OMP_TARGET_CLAUSE_MASK \
30248 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30252 static bool
30255 {
30257 {
30261 }
30264 {
30269 {
30294 }
30296 {
30299 }
30301 {
30305 }
30307 {
30310 }
30311 }
30325 }
30327 /* OpenMP 4.0:
30328 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30330 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30331 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30338 static void
30341 {
30343 cp_omp_declare_simd_data data;
30345 {
30350 }
30361 {
30365 {
30378 }
30383 "%<#pragma omp declare simd%> not immediately followed by "
30387 }
30388 }
30390 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30391 This function is modelled similar to the late parsing of omp declare
30392 simd. */
30394 static tree
30396 {
30402 {
30408 }
30410 {
30414 }
30419 {
30426 NULL);
30440 }
30445 }
30447 /* Finalize #pragma omp declare simd clauses after direct declarator has
30448 been parsed, and put that into "omp declare simd" attribute. */
30450 static tree
30452 {
30458 {
30463 }
30468 {
30486 }
30490 }
30493 /* OpenMP 4.0:
30494 # pragma omp declare target new-line
30495 declarations and definitions
30496 # pragma omp end declare target new-line */
30498 static void
30500 {
30503 }
30505 static void
30507 {
30510 {
30513 }
30515 {
30519 {
30522 }
30525 else
30526 {
30530 }
30531 }
30532 else
30533 {
30537 }
30541 "%<#pragma omp end declare target%> without corresponding "
30543 else
30545 }
30547 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30548 expression and optional initializer clause of
30549 #pragma omp declare reduction. We store the expression(s) as
30550 either 3, 6 or 7 special statements inside of the artificial function's
30551 body. The first two statements are DECL_EXPRs for the artificial
30552 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30553 expression that uses those variables.
30554 If there was any INITIALIZER clause, this is followed by further statements,
30555 the fourth and fifth statements are DECL_EXPRs for the artificial
30556 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30557 constructor variant (first token after open paren is not omp_priv),
30558 then the sixth statement is a statement with the function call expression
30559 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30560 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30561 to initialize the OMP_PRIV artificial variable and there is seventh
30562 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30564 static bool
30566 {
30578 tree combiner;
30593 {
30596 }
30599 {
30606 {
30609 }
30625 {
30629 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30633 == CPP_CLOSE_PAREN
30636 {
30640 }
30645 }
30646 else
30647 {
30663 {
30668 }
30670 tree arg;
30683 }
30694 }
30700 }
30702 /* OpenMP 4.0
30703 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30704 initializer-clause[opt] new-line
30706 initializer-clause:
30707 initializer (omp_priv initializer)
30708 initializer (function-name (argument-list)) */
30710 static void
30713 {
30723 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
30730 {
30762 }
30774 /* Types may not be defined in declare reduction type list. */
30777 parser->type_definition_forbidden_message
30783 saved_colon_doesnt_start_class_def_p
30788 {
30792 ;
30813 else
30818 else
30820 }
30822 /* Restore the saved message. */
30825 parser->colon_doesnt_start_class_def_p
30830 {
30831 fail:
30834 }
30840 {
30841 tree fntype
30844 NULL_TREE);
30863 {
30868 }
30870 {
30872 {
30881 }
30888 }
30889 else
30890 {
30893 }
30896 else
30899 {
30902 }
30904 {
30907 else
30912 }
30917 else
30918 {
30927 }
30934 }
30938 done:
30939 /* Free any declarators allocated. */
30941 }
30943 /* OpenMP 4.0
30944 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30945 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30946 initializer-clause[opt] new-line
30947 #pragma omp declare target new-line */
30949 static void
30952 {
30954 {
30959 {
30962 context);
30964 }
30967 {
30970 context);
30972 }
30974 {
30977 }
30979 {
30983 }
30984 }
30988 }
30990 /* Main entry point to OpenMP statement pragmas. */
30992 static void
30994 {
30995 tree stmt;
31000 {
31048 }
31052 }
31053 \f
31054 /* Transactional Memory parsing routines. */
31056 /* Parse a transaction attribute.
31058 txn-attribute:
31059 attribute
31060 [ [ identifier ] ]
31062 ??? Simplify this when C++0x bracket attributes are
31063 implemented properly. */
31065 static tree
31067 {
31082 {
31086 /* For keywords, use the canonical spelling,
31087 not the parsed identifier. */
31091 }
31092 else
31096 error1:
31099 }
31101 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31103 transaction-statement:
31104 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31105 compound-statement
31106 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31107 */
31109 static tree
31111 {
31126 else
31127 {
31131 }
31133 /* Parse a noexcept specification. */
31136 /* Keep track if we're in the lexical scope of an outer transaction. */
31148 }
31150 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31152 transaction-expression:
31153 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31154 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31155 */
31157 static tree
31159 {
31184 /* Set this early. This might mean that we allow transaction_cancel in
31185 an expression that we find out later actually has to be a constexpr.
31186 However, we expect that cxx_constant_value will be able to deal with
31187 this; also, if the noexcept has no constexpr, then what we parse next
31188 really is a transaction's body. */
31191 /* Parse a noexcept specification. */
31197 {
31204 }
31205 else
31206 {
31207 /* The only expression that is available got parsed for the noexcept
31208 already. noexcept is true then. */
31211 }
31220 }
31222 /* Parse a function-transaction-block.
31224 function-transaction-block:
31225 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31226 function-body
31227 __transaction_atomic txn-attribute[opt] function-try-block
31228 __transaction_relaxed ctor-initializer[opt] function-body
31229 __transaction_relaxed function-try-block
31230 */
31232 static bool
31234 {
31250 else
31251 {
31255 }
31263 else
31264 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31272 }
31274 /* Parse a __transaction_cancel statement.
31276 cancel-statement:
31277 __transaction_cancel txn-attribute[opt] ;
31278 __transaction_cancel txn-attribute[opt] throw-expression ;
31280 ??? Cancel and throw is not yet implemented. */
31282 static tree
31284 {
31290 RT_TRANSACTION_CANCEL);
31297 /* ??? Parse cancel-and-throw here. */
31302 {
31306 }
31308 {
31312 }
31314 {
31317 {
31323 }
31324 }
31326 {
31330 }
31336 }
31337 \f
31338 /* The parser. */
31342 \f
31343 /* Special handling for the first token or line in the file. The first
31344 thing in the file might be #pragma GCC pch_preprocess, which loads a
31345 PCH file, which is a GC collection point. So we need to handle this
31346 first pragma without benefit of an existing lexer structure.
31348 Always returns one token to the caller in *FIRST_TOKEN. This is
31349 either the true first token of the file, or the first token after
31350 the initial pragma. */
31352 static void
31354 {
31363 {
31370 }
31371 else
31374 /* Skip to the end of the pragma. */
31378 /* Now actually load the PCH file. */
31382 /* Read one more token to return to our caller. We have to do this
31383 after reading the PCH file in, since its pointers have to be
31384 live. */
31386 }
31388 /* Normal parsing of a pragma token. Here we can (and must) use the
31389 regular lexer. */
31391 static bool
31393 {
31405 {
31413 {
31423 }
31428 {
31438 }
31443 {
31449 "%<#pragma omp taskwait%> may only be "
31454 }
31459 {
31465 "%<#pragma omp taskyield%> may only be "
31470 }
31475 {
31481 "%<#pragma omp cancel%> may only be "
31486 }
31491 {
31497 "%<#pragma omp cancellation point%> may only be "
31502 }
31540 "%<#pragma omp section%> may only be used in "
31545 {
31552 {
31555 }
31558 }
31562 {
31566 }
31575 bad_stmt:
31578 }
31582 }
31584 /* The interface the pragma parsers have to the lexer. */
31586 enum cpp_ttype
31588 {
31601 else
31602 {
31606 }
31609 }
31611 \f
31612 /* External interface. */
31614 /* Parse one entire translation unit. */
31616 void
31618 {
31622 {
31625 }
31633 }
31635 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31636 vectorlength clause:
31637 Syntax:
31638 vectorlength ( constant-expression ) */
31640 static tree
31643 {
31645 tree expr;
31646 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31647 safelen clause. Thus, vectorlength is represented as OMP 4.0
31648 safelen. For SIMD-enabled function it is represented by OMP 4.0
31649 simdlen. */
31652 loc);
31653 else
31655 loc);
31663 /* If expr == error_mark_node, then don't emit any errors nor
31664 create a clause. if any of the above functions returns
31665 error mark node then they would have emitted an error message. */
31667 ;
31675 else
31676 {
31677 tree c;
31679 {
31684 }
31685 else
31686 {
31691 }
31692 }
31697 }
31699 /* Handles the Cilk Plus #pragma simd linear clause.
31700 Syntax:
31701 linear ( simd-linear-variable-list )
31703 simd-linear-variable-list:
31704 simd-linear-variable
31705 simd-linear-variable-list , simd-linear-variable
31707 simd-linear-variable:
31708 id-expression
31709 id-expression : simd-linear-step
31711 simd-linear-step:
31712 conditional-expression */
31714 static tree
31716 {
31722 {
31726 }
31731 {
31734 {
31738 }
31745 {
31749 }
31750 else
31751 {
31755 /* If present, parse the linear step. Otherwise, assume the default
31756 value of 1. */
31758 {
31765 {
31766 /* If an error has occurred, then the whole pragma is
31767 considered ill-formed. Thus, no reason to keep
31768 parsing. */
31771 }
31779 else
31781 "step size must be an integer constant "
31783 }
31785 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
31791 }
31796 else
31797 {
31802 }
31803 }
31807 }
31809 /* Returns the name of the next clause. If the clause is not
31810 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
31811 token is not consumed. Otherwise, the appropriate enum from the
31812 pragma_simd_clause is returned and the token is consumed. */
31814 static pragma_omp_clause
31816 {
31817 pragma_omp_clause clause_type;
31834 else
31839 }
31841 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
31843 static tree
31845 {
31850 {
31851 pragma_omp_clause c_kind;
31858 /* Use the OpenMP 4.0 equivalent function. */
31861 /* Use the OpenMP 4.0 equivalent function. */
31863 clauses);
31865 /* Use the OMP 4.0 equivalent function. */
31867 clauses);
31869 /* Use the OMP 4.0 equivalent function. */
31871 else
31872 {
31876 }
31877 }
31883 else
31885 }
31887 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
31889 static void
31891 {
31898 {
31902 }
31912 }
31914 /* Create an identifier for a generic parameter type (a synthesized
31915 template parameter implied by `auto' or a concept identifier). */
31918 static tree
31920 {
31924 }
31926 /* Predicate that behaves as is_auto_or_concept but matches the parent
31927 node of the generic type rather than the generic type itself. This
31928 allows for type transformation in add_implicit_template_parms. */
31932 {
31934 }
31936 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
31937 (creating a new template parameter list if necessary). Returns the newly
31938 created template type parm. */
31940 tree
31942 {
31945 /* We are either continuing a function template that already contains implicit
31946 template parameters, creating a new fully-implicit function template, or
31947 extending an existing explicit function template with implicit template
31948 parameters. */
31956 {
31960 }
31961 else
31962 {
31963 /* Roll back to the existing template parameter scope (in the case of
31964 extending an explicit function template) or introduce a new template
31965 parameter scope ahead of the function parameter scope (or class scope
31966 in the case of out-of-line member definitions). The function scope is
31967 added back after template parameter synthesis below. */
31972 {
31975 }
31979 {
31982 }
31988 {
31989 /* Introduce a new template parameter list for implicit template
31990 parameters. */
31994 parser->implicit_template_scope
32001 }
32002 else
32003 {
32004 /* Synthesize implicit template parameters at the end of the explicit
32005 template parameter list. */
32012 parser->implicit_template_parms
32014 }
32015 }
32017 /* Synthesize a new template parameter and track the current template
32018 parameter chain with implicit_template_parms. */
32022 synth_id);
32023 tree new_parm
32025 input_location,
32032 parser->implicit_template_parms
32034 else
32039 /* If creating a fully implicit function template, start the new implicit
32040 template parameter list with this synthesized type, otherwise grow the
32041 current template parameter list. */
32044 {
32051 }
32052 else
32053 {
32058 }
32063 }
32065 /* Finish the declaration of a fully implicit function template. Such a
32066 template has no explicit template parameter list so has not been through the
32067 normal template head and tail processing. synthesize_implicit_template_parm
32068 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32069 provided if the declaration is a class member such that its template
32070 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32071 form is returned. Otherwise NULL_TREE is returned. */
32073 tree
32075 {
32080 {
32084 }
32094 }