| blob | 963ad7ac9cc5e2e1b717af3da1efb37b0ea41996 |
1 /* C++ Parser.
2 Copyright (C) 2000-2014 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
186 /* Prototypes. */
192 static void cp_lexer_destroy
194 static int cp_lexer_saving_tokens
198 static void cp_lexer_get_preprocessor_token
206 static bool cp_lexer_next_token_is_not
208 static bool cp_lexer_next_token_is_keyword
212 static void cp_lexer_purge_token
214 static void cp_lexer_purge_tokens_after
216 static void cp_lexer_save_tokens
218 static void cp_lexer_commit_tokens
220 static void cp_lexer_rollback_tokens
222 static void cp_lexer_print_token
226 static void cp_lexer_start_debugging
228 static void cp_lexer_stop_debugging
234 static void cp_parser_initial_pragma
237 static tree cp_literal_operator_id
240 static void cp_parser_cilk_simd
242 static bool cp_parser_omp_declare_reduction_exprs
244 static tree cp_parser_cilk_simd_vectorlength
247 /* Manifest constants. */
248 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
249 #define CP_SAVED_TOKEN_STACK 5
251 /* Variables. */
253 /* The stream to which debugging output should be written. */
256 /* Nonzero if we are parsing an unevaluated operand: an operand to
257 sizeof, typeof, or alignof. */
260 /* Dump up to NUM tokens in BUFFER to FILE starting with token
261 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
262 first token in BUFFER. If NUM is 0, dump all the tokens. If
263 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
264 highlighted by surrounding it in [[ ]]. */
266 static void
270 {
287 {
290 }
295 {
302 nprinted++;
312 {
322 }
323 }
326 {
329 }
332 }
335 /* Dump all tokens in BUFFER to stderr. */
337 void
339 {
341 }
343 DEBUG_FUNCTION void
345 {
347 }
349 DEBUG_FUNCTION void
351 {
354 else
356 }
359 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
360 description for T. */
362 static void
364 {
366 {
369 }
370 }
373 /* Dump parser context C to FILE. */
375 static void
377 {
382 }
385 /* Print the stack of parsing contexts to FILE starting with FIRST. */
387 static void
389 {
395 {
398 }
399 }
402 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
404 static void
406 {
409 }
412 /* Print an unparsed function entry UF to FILE. */
414 static void
416 {
419 tree fn;
424 i++)
425 {
431 }
436 {
439 }
445 {
448 }
450 }
453 /* Print the stack of unparsed member functions S to FILE. */
455 static void
458 {
464 {
467 }
468 }
471 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
472 the given PARSER. If FILE is NULL, the output is printed on stderr. */
474 static void
476 {
488 next_token);
489 }
492 /* Dump debugging information for the given PARSER. If FILE is NULL,
493 the output is printed on stderr. */
495 void
497 {
500 expanded_location eloc;
578 }
580 DEBUG_FUNCTION void
582 {
584 }
586 DEBUG_FUNCTION void
588 {
591 else
593 }
595 /* Allocate memory for a new lexer object and return it. */
599 {
604 /* Allocate the memory. */
607 /* Initially we are not debugging. */
612 /* Create the buffer. */
616 }
619 /* Create a new main C++ lexer, the lexer that gets tokens from the
620 preprocessor. */
624 {
626 cp_token token;
628 /* It's possible that parsing the first pragma will load a PCH file,
629 which is a GC collection point. So we have to do that before
630 allocating any memory. */
635 /* Put the first token in the buffer. */
638 /* Get the remaining tokens from the preprocessor. */
640 {
643 }
652 /* Subsequent preprocessor diagnostics should use compiler
653 diagnostic functions to get the compiler source location. */
658 }
660 /* Create a new lexer whose token stream is primed with the tokens in
661 CACHE. When these tokens are exhausted, no new tokens will be read. */
665 {
670 /* We do not own the buffer. */
677 /* Initially we are not debugging. */
682 }
684 /* Frees all resources associated with LEXER. */
686 static void
688 {
692 }
694 /* Returns nonzero if debugging information should be output. */
698 {
700 }
705 {
709 }
713 {
715 }
719 {
721 }
725 {
728 else
730 }
734 {
738 }
740 /* nonzero if we are presently saving tokens. */
744 {
746 }
748 /* Store the next token from the preprocessor in *TOKEN. Return true
749 if we reach EOF. If LEXER is NULL, assume we are handling an
750 initial #pragma pch_preprocess, and thus want the lexer to return
751 processed strings. */
753 static void
755 {
758 /* Get a new token from the preprocessor. */
759 token->type
766 /* On some systems, some header files are surrounded by an
767 implicit extern "C" block. Set a flag in the token if it
768 comes from such a header. */
773 /* Check to see if this token is a keyword. */
775 {
777 {
778 /* Mark this token as a keyword. */
780 /* Record which keyword. */
782 }
783 else
784 {
788 {
789 /* Warn about the C++0x keyword (but still treat it as
790 an identifier). */
795 /* Clear out the C_RID_CODE so we don't warn about this
796 particular identifier-turned-keyword again. */
798 }
802 }
803 }
805 {
806 /* This only happens in Objective-C++; it must be a keyword. */
809 {
810 /* Replace 'class' with '@class', 'private' with '@private',
811 etc. This prevents confusion with the C++ keyword
812 'class', and makes the tokens consistent with other
813 Objective-C 'AT' keywords. For example '@class' is
814 reported as RID_AT_CLASS which is consistent with
815 '@synchronized', which is reported as
816 RID_AT_SYNCHRONIZED.
817 */
826 }
827 }
829 {
830 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
834 }
835 }
837 /* Update the globals input_location and the input file stack from TOKEN. */
840 {
842 {
844 }
845 }
847 /* Update the globals input_location and the input file stack from LEXER. */
850 {
853 }
855 /* Return a pointer to the next token in the token stream, but do not
856 consume it. */
860 {
862 {
866 }
868 }
870 /* Return true if the next token has the indicated TYPE. */
874 {
876 }
878 /* Return true if the next token does not have the indicated TYPE. */
882 {
884 }
886 /* Return true if the next token is the indicated KEYWORD. */
890 {
892 }
896 {
898 }
900 /* Return true if the next token is not the indicated KEYWORD. */
904 {
906 }
908 /* Return true if the next token is a keyword for a decl-specifier. */
910 static bool
912 {
917 {
918 /* auto specifier: storage-class-specifier in C++,
919 simple-type-specifier in C++0x. */
921 /* Storage classes. */
927 /* Elaborated type specifiers. */
933 /* Simple type specifiers. */
948 /* GNU extensions. */
951 /* C++0x extensions. */
958 }
959 }
961 /* Returns TRUE iff the token T begins a decltype type. */
963 static bool
965 {
968 }
970 /* Returns TRUE iff the next token begins a decltype type. */
972 static bool
974 {
977 }
979 /* Return a pointer to the Nth token in the token stream. If N is 1,
980 then this is precisely equivalent to cp_lexer_peek_token (except
981 that it is not inline). One would like to disallow that case, but
982 there is one case (cp_parser_nth_token_starts_template_id) where
983 the caller passes a variable for N and it might be 1. */
987 {
990 /* N is 1-based, not zero-based. */
1001 {
1004 {
1007 }
1011 }
1014 {
1017 }
1020 }
1022 /* Return the next token, and advance the lexer's next_token pointer
1023 to point to the next non-purged token. */
1027 {
1033 do
1034 {
1037 {
1040 }
1042 }
1047 /* Provide debugging output. */
1049 {
1053 }
1056 }
1058 /* Permanently remove the next token from the token stream, and
1059 advance the next_token pointer to refer to the next non-purged
1060 token. */
1062 static void
1064 {
1073 do
1074 {
1075 tok++;
1077 {
1080 }
1081 }
1084 }
1086 /* Permanently remove all tokens after TOK, up to, but not
1087 including, the token that will be returned next by
1088 cp_lexer_peek_token. */
1090 static void
1092 {
1101 {
1106 }
1107 }
1109 /* Begin saving tokens. All tokens consumed after this point will be
1110 preserved. */
1112 static void
1114 {
1115 /* Provide debugging output. */
1120 }
1122 /* Commit to the portion of the token stream most recently saved. */
1124 static void
1126 {
1127 /* Provide debugging output. */
1132 }
1134 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1135 to the token stream. Stop saving tokens. */
1137 static void
1139 {
1140 /* Provide debugging output. */
1145 }
1147 /* Print a representation of the TOKEN on the STREAM. */
1149 static void
1151 {
1152 /* We don't use cpp_type2name here because the parser defines
1153 a few tokens of its own. */
1155 /* cpplib-defined token types */
1156 #define OP(e, s) #e,
1157 #define TK(e, s) #e,
1158 TTYPE_TABLE
1159 #undef OP
1160 #undef TK
1161 /* C++ parser token types - see "Manifest constants", above. */
1165 };
1167 /* For some tokens, print the associated data. */
1169 {
1171 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1172 For example, `struct' is mapped to an INTEGER_CST. */
1175 /* else fall through */
1193 /* If we have a name for the token, print it out. Otherwise, we
1194 simply give the numeric code. */
1197 else
1200 }
1201 }
1203 DEBUG_FUNCTION void
1205 {
1208 }
1210 DEBUG_FUNCTION void
1212 {
1215 else
1217 }
1220 /* Start emitting debugging information. */
1222 static void
1224 {
1227 }
1229 /* Stop emitting debugging information. */
1231 static void
1233 {
1236 }
1238 /* Create a new cp_token_cache, representing a range of tokens. */
1242 {
1247 }
1249 /* Diagnose if #pragma omp declare simd isn't followed immediately
1250 by function declaration or definition. */
1254 {
1256 {
1260 }
1261 }
1263 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1264 and put that into "omp declare simd" attribute. */
1268 {
1270 {
1272 {
1275 }
1277 {
1280 }
1281 }
1282 }
1283 \f
1284 /* Decl-specifiers. */
1286 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1288 static void
1290 {
1292 }
1294 /* Declarators. */
1296 /* Nothing other than the parser should be creating declarators;
1297 declarators are a semi-syntactic representation of C++ entities.
1298 Other parts of the front end that need to create entities (like
1299 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1314 /* An erroneous declarator. */
1317 /* The obstack on which declarators and related data structures are
1318 allocated. */
1321 /* Alloc BYTES from the declarator memory pool. */
1325 {
1327 }
1329 /* Allocate a declarator of the indicated KIND. Clear fields that are
1330 common to all declarators. */
1334 {
1346 }
1348 /* Make a declarator for a generalized identifier. If
1349 QUALIFYING_SCOPE is non-NULL, the identifier is
1350 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1351 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1352 is, if any. */
1356 special_function_kind sfk)
1357 {
1360 /* It is valid to write:
1362 class C { void f(); };
1363 typedef C D;
1364 void D::f();
1366 The standard is not clear about whether `typedef const C D' is
1367 legal; as of 2002-09-15 the committee is considering that
1368 question. EDG 3.0 allows that syntax. Therefore, we do as
1369 well. */
1383 }
1385 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1386 of modifiers such as const or volatile to apply to the pointer
1387 type, represented as identifiers. ATTRIBUTES represent the attributes that
1388 appertain to the pointer or reference. */
1390 cp_declarator *
1392 tree attributes)
1393 {
1401 {
1405 }
1406 else
1412 }
1414 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1415 represent the attributes that appertain to the pointer or
1416 reference. */
1418 cp_declarator *
1421 {
1429 {
1433 }
1434 else
1440 }
1442 /* Like make_pointer_declarator -- but for a pointer to a non-static
1443 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1449 tree attributes)
1450 {
1459 {
1462 }
1463 else
1469 }
1471 /* Make a declarator for the function given by TARGET, with the
1472 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1473 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1474 indicates what exceptions can be thrown. */
1476 cp_declarator *
1478 tree parms,
1479 cp_cv_quals cv_qualifiers,
1480 cp_virt_specifiers virt_specifiers,
1481 cp_ref_qualifier ref_qualifier,
1482 tree exception_specification,
1483 tree late_return_type)
1484 {
1496 {
1500 }
1501 else
1505 }
1507 /* Make a declarator for an array of BOUNDS elements, each of which is
1508 defined by ELEMENT. */
1510 cp_declarator *
1512 {
1519 {
1523 }
1524 else
1528 }
1530 /* Determine whether the declarator we've seen so far can be a
1531 parameter pack, when followed by an ellipsis. */
1532 static bool
1534 {
1535 /* Search for a declarator name, or any other declarator that goes
1536 after the point where the ellipsis could appear in a parameter
1537 pack. If we find any of these, then this declarator can not be
1538 made into a parameter pack. */
1541 {
1543 {
1555 }
1556 }
1559 }
1563 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1564 DECLARATOR and DEFAULT_ARGUMENT. */
1566 cp_parameter_declarator *
1569 tree default_argument)
1570 {
1578 else
1585 }
1587 /* Returns true iff DECLARATOR is a declaration for a function. */
1589 static bool
1591 {
1593 {
1601 }
1603 }
1605 /* The parser. */
1607 /* Overview
1608 --------
1610 A cp_parser parses the token stream as specified by the C++
1611 grammar. Its job is purely parsing, not semantic analysis. For
1612 example, the parser breaks the token stream into declarators,
1613 expressions, statements, and other similar syntactic constructs.
1614 It does not check that the types of the expressions on either side
1615 of an assignment-statement are compatible, or that a function is
1616 not declared with a parameter of type `void'.
1618 The parser invokes routines elsewhere in the compiler to perform
1619 semantic analysis and to build up the abstract syntax tree for the
1620 code processed.
1622 The parser (and the template instantiation code, which is, in a
1623 way, a close relative of parsing) are the only parts of the
1624 compiler that should be calling push_scope and pop_scope, or
1625 related functions. The parser (and template instantiation code)
1626 keeps track of what scope is presently active; everything else
1627 should simply honor that. (The code that generates static
1628 initializers may also need to set the scope, in order to check
1629 access control correctly when emitting the initializers.)
1631 Methodology
1632 -----------
1634 The parser is of the standard recursive-descent variety. Upcoming
1635 tokens in the token stream are examined in order to determine which
1636 production to use when parsing a non-terminal. Some C++ constructs
1637 require arbitrary look ahead to disambiguate. For example, it is
1638 impossible, in the general case, to tell whether a statement is an
1639 expression or declaration without scanning the entire statement.
1640 Therefore, the parser is capable of "parsing tentatively." When the
1641 parser is not sure what construct comes next, it enters this mode.
1642 Then, while we attempt to parse the construct, the parser queues up
1643 error messages, rather than issuing them immediately, and saves the
1644 tokens it consumes. If the construct is parsed successfully, the
1645 parser "commits", i.e., it issues any queued error messages and
1646 the tokens that were being preserved are permanently discarded.
1647 If, however, the construct is not parsed successfully, the parser
1648 rolls back its state completely so that it can resume parsing using
1649 a different alternative.
1651 Future Improvements
1652 -------------------
1654 The performance of the parser could probably be improved substantially.
1655 We could often eliminate the need to parse tentatively by looking ahead
1656 a little bit. In some places, this approach might not entirely eliminate
1657 the need to parse tentatively, but it might still speed up the average
1658 case. */
1660 /* Flags that are passed to some parsing functions. These values can
1661 be bitwise-ored together. */
1663 enum
1664 {
1665 /* No flags. */
1667 /* The construct is optional. If it is not present, then no error
1668 should be issued. */
1670 /* When parsing a type-specifier, treat user-defined type-names
1671 as non-type identifiers. */
1673 /* When parsing a type-specifier, do not try to parse a class-specifier
1674 or enum-specifier. */
1676 /* When parsing a decl-specifier-seq, only allow type-specifier or
1677 constexpr. */
1679 };
1681 /* This type is used for parameters and variables which hold
1682 combinations of the above flags. */
1685 /* The different kinds of declarators we want to parse. */
1688 {
1689 /* We want an abstract declarator. */
1690 CP_PARSER_DECLARATOR_ABSTRACT,
1691 /* We want a named declarator. */
1692 CP_PARSER_DECLARATOR_NAMED,
1693 /* We don't mind, but the name must be an unqualified-id. */
1694 CP_PARSER_DECLARATOR_EITHER
1697 /* The precedence values used to parse binary expressions. The minimum value
1698 of PREC must be 1, because zero is reserved to quickly discriminate
1699 binary operators from other tokens. */
1701 enum cp_parser_prec
1702 {
1703 PREC_NOT_OPERATOR,
1704 PREC_LOGICAL_OR_EXPRESSION,
1705 PREC_LOGICAL_AND_EXPRESSION,
1706 PREC_INCLUSIVE_OR_EXPRESSION,
1707 PREC_EXCLUSIVE_OR_EXPRESSION,
1708 PREC_AND_EXPRESSION,
1709 PREC_EQUALITY_EXPRESSION,
1710 PREC_RELATIONAL_EXPRESSION,
1711 PREC_SHIFT_EXPRESSION,
1712 PREC_ADDITIVE_EXPRESSION,
1713 PREC_MULTIPLICATIVE_EXPRESSION,
1714 PREC_PM_EXPRESSION,
1715 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1716 };
1718 /* A mapping from a token type to a corresponding tree node type, with a
1719 precedence value. */
1722 {
1723 /* The token type. */
1725 /* The corresponding tree code. */
1727 /* The precedence of this operator. */
1732 {
1733 /* Left hand side of the binary operation we are currently
1734 parsing. */
1735 tree lhs;
1736 /* Original tree code for left hand side, if it was a binary
1737 expression itself (used for -Wparentheses). */
1739 /* Tree code for the binary operation we are parsing. */
1741 /* Precedence of the binary operation we are parsing. */
1743 /* Location of the binary operation we are parsing. */
1744 location_t loc;
1747 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1748 entries because precedence levels on the stack are monotonically
1749 increasing. */
1753 /* Prototypes. */
1755 /* Constructors and destructors. */
1760 /* Class variables. */
1764 /* The operator-precedence table used by cp_parser_binary_expression.
1765 Transformed into an associative array (binops_by_token) by
1766 cp_parser_new. */
1799 };
1801 /* The same as binops, but initialized by cp_parser_new so that
1802 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1803 for speed. */
1806 /* Constructors and destructors. */
1808 /* Construct a new context. The context below this one on the stack
1809 is given by NEXT. */
1813 {
1816 /* Allocate the storage. */
1818 {
1819 /* Pull the first entry from the free list. */
1823 }
1824 else
1827 /* No errors have occurred yet in this context. */
1829 /* If this is not the bottommost context, copy information that we
1830 need from the previous context. */
1832 {
1833 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1834 expression, then we are parsing one in this context, too. */
1836 /* Thread the stack. */
1838 }
1841 }
1843 /* Managing the unparsed function queues. */
1845 #define unparsed_funs_with_default_args \
1846 parser->unparsed_queues->last ().funs_with_default_args
1847 #define unparsed_funs_with_definitions \
1848 parser->unparsed_queues->last ().funs_with_definitions
1849 #define unparsed_nsdmis \
1850 parser->unparsed_queues->last ().nsdmis
1852 static void
1854 {
1857 }
1859 static void
1861 {
1864 }
1866 /* Prototypes. */
1868 /* Constructors and destructors. */
1873 /* Routines to parse various constructs.
1875 Those that return `tree' will return the error_mark_node (rather
1876 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1877 Sometimes, they will return an ordinary node if error-recovery was
1878 attempted, even though a parse error occurred. So, to check
1879 whether or not a parse error occurred, you should always use
1880 cp_parser_error_occurred. If the construct is optional (indicated
1881 either by an `_opt' in the name of the function that does the
1882 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1883 the construct is not present. */
1885 /* Lexical conventions [gram.lex] */
1887 static tree cp_parser_identifier
1889 static tree cp_parser_string_literal
1891 static tree cp_parser_userdef_char_literal
1893 static tree cp_parser_userdef_string_literal
1895 static tree cp_parser_userdef_numeric_literal
1898 /* Basic concepts [gram.basic] */
1900 static bool cp_parser_translation_unit
1903 /* Expressions [gram.expr] */
1905 static tree cp_parser_primary_expression
1907 static tree cp_parser_id_expression
1909 static tree cp_parser_unqualified_id
1911 static tree cp_parser_nested_name_specifier_opt
1913 static tree cp_parser_nested_name_specifier
1915 static tree cp_parser_qualifying_entity
1917 static tree cp_parser_postfix_expression
1919 static tree cp_parser_postfix_open_square_expression
1921 static tree cp_parser_postfix_dot_deref_expression
1925 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1927 static void cp_parser_pseudo_destructor_name
1929 static tree cp_parser_unary_expression
1931 static enum tree_code cp_parser_unary_operator
1933 static tree cp_parser_new_expression
1937 static tree cp_parser_new_type_id
1945 static tree cp_parser_delete_expression
1947 static tree cp_parser_cast_expression
1949 static tree cp_parser_binary_expression
1951 static tree cp_parser_question_colon_clause
1953 static tree cp_parser_assignment_expression
1955 static enum tree_code cp_parser_assignment_operator_opt
1957 static tree cp_parser_expression
1959 static tree cp_parser_expression
1961 static tree cp_parser_constant_expression
1963 static tree cp_parser_builtin_offsetof
1965 static tree cp_parser_lambda_expression
1967 static void cp_parser_lambda_introducer
1969 static bool cp_parser_lambda_declarator_opt
1971 static void cp_parser_lambda_body
1974 /* Statements [gram.stmt.stmt] */
1976 static void cp_parser_statement
1978 static void cp_parser_label_for_labeled_statement
1980 static tree cp_parser_expression_statement
1982 static tree cp_parser_compound_statement
1984 static void cp_parser_statement_seq_opt
1986 static tree cp_parser_selection_statement
1988 static tree cp_parser_condition
1990 static tree cp_parser_iteration_statement
1992 static bool cp_parser_for_init_statement
1994 static tree cp_parser_for
1996 static tree cp_parser_c_for
1998 static tree cp_parser_range_for
2000 static void do_range_for_auto_deduction
2002 static tree cp_parser_perform_range_for_lookup
2004 static tree cp_parser_range_for_member_function
2006 static tree cp_parser_jump_statement
2008 static void cp_parser_declaration_statement
2011 static tree cp_parser_implicitly_scoped_statement
2013 static void cp_parser_already_scoped_statement
2016 /* Declarations [gram.dcl.dcl] */
2018 static void cp_parser_declaration_seq_opt
2020 static void cp_parser_declaration
2022 static void cp_parser_block_declaration
2024 static void cp_parser_simple_declaration
2026 static void cp_parser_decl_specifier_seq
2028 static tree cp_parser_storage_class_specifier_opt
2030 static tree cp_parser_function_specifier_opt
2032 static tree cp_parser_type_specifier
2035 static tree cp_parser_simple_type_specifier
2037 static tree cp_parser_type_name
2039 static tree cp_parser_nonclass_name
2041 static tree cp_parser_elaborated_type_specifier
2043 static tree cp_parser_enum_specifier
2045 static void cp_parser_enumerator_list
2047 static void cp_parser_enumerator_definition
2049 static tree cp_parser_namespace_name
2051 static void cp_parser_namespace_definition
2053 static void cp_parser_namespace_body
2055 static tree cp_parser_qualified_namespace_specifier
2057 static void cp_parser_namespace_alias_definition
2059 static bool cp_parser_using_declaration
2061 static void cp_parser_using_directive
2063 static tree cp_parser_alias_declaration
2065 static void cp_parser_asm_definition
2067 static void cp_parser_linkage_specification
2069 static void cp_parser_static_assert
2071 static tree cp_parser_decltype
2074 /* Declarators [gram.dcl.decl] */
2076 static tree cp_parser_init_declarator
2077 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2082 static enum tree_code cp_parser_ptr_operator
2084 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2086 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2088 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2090 static tree cp_parser_late_return_type_opt
2092 static tree cp_parser_declarator_id
2094 static tree cp_parser_type_id
2096 static tree cp_parser_template_type_arg
2099 static tree cp_parser_type_id_1
2101 static void cp_parser_type_specifier_seq
2103 static tree cp_parser_parameter_declaration_clause
2105 static tree cp_parser_parameter_declaration_list
2109 static tree cp_parser_default_argument
2111 static void cp_parser_function_body
2113 static tree cp_parser_initializer
2115 static tree cp_parser_initializer_clause
2117 static tree cp_parser_braced_list
2122 static bool cp_parser_ctor_initializer_opt_and_function_body
2125 static tree cp_parser_late_parsing_omp_declare_simd
2128 static tree cp_parser_late_parsing_cilk_simd_fn_info
2131 static tree synthesize_implicit_template_parm
2133 static tree finish_fully_implicit_template
2136 /* Classes [gram.class] */
2138 static tree cp_parser_class_name
2140 static tree cp_parser_class_specifier
2142 static tree cp_parser_class_head
2144 static enum tag_types cp_parser_class_key
2146 static void cp_parser_member_specification_opt
2148 static void cp_parser_member_declaration
2150 static tree cp_parser_pure_specifier
2152 static tree cp_parser_constant_initializer
2155 /* Derived classes [gram.class.derived] */
2157 static tree cp_parser_base_clause
2159 static tree cp_parser_base_specifier
2162 /* Special member functions [gram.special] */
2164 static tree cp_parser_conversion_function_id
2166 static tree cp_parser_conversion_type_id
2170 static bool cp_parser_ctor_initializer_opt
2172 static void cp_parser_mem_initializer_list
2174 static tree cp_parser_mem_initializer
2176 static tree cp_parser_mem_initializer_id
2179 /* Overloading [gram.over] */
2181 static tree cp_parser_operator_function_id
2183 static tree cp_parser_operator
2186 /* Templates [gram.temp] */
2188 static void cp_parser_template_declaration
2190 static tree cp_parser_template_parameter_list
2192 static tree cp_parser_template_parameter
2194 static tree cp_parser_type_parameter
2196 static tree cp_parser_template_id
2198 static tree cp_parser_template_name
2200 static tree cp_parser_template_argument_list
2202 static tree cp_parser_template_argument
2204 static void cp_parser_explicit_instantiation
2206 static void cp_parser_explicit_specialization
2209 /* Exception handling [gram.exception] */
2211 static tree cp_parser_try_block
2213 static bool cp_parser_function_try_block
2215 static void cp_parser_handler_seq
2217 static void cp_parser_handler
2219 static tree cp_parser_exception_declaration
2221 static tree cp_parser_throw_expression
2223 static tree cp_parser_exception_specification_opt
2225 static tree cp_parser_type_id_list
2228 /* GNU Extensions */
2230 static tree cp_parser_asm_specification_opt
2232 static tree cp_parser_asm_operand_list
2234 static tree cp_parser_asm_clobber_list
2236 static tree cp_parser_asm_label_list
2238 static bool cp_next_tokens_can_be_attribute_p
2240 static bool cp_next_tokens_can_be_gnu_attribute_p
2242 static bool cp_next_tokens_can_be_std_attribute_p
2244 static bool cp_nth_tokens_can_be_std_attribute_p
2246 static bool cp_nth_tokens_can_be_gnu_attribute_p
2248 static bool cp_nth_tokens_can_be_attribute_p
2250 static tree cp_parser_attributes_opt
2252 static tree cp_parser_gnu_attributes_opt
2254 static tree cp_parser_gnu_attribute_list
2256 static tree cp_parser_std_attribute
2258 static tree cp_parser_std_attribute_spec
2260 static tree cp_parser_std_attribute_spec_seq
2262 static bool cp_parser_extension_opt
2264 static void cp_parser_label_declaration
2267 /* Transactional Memory Extensions */
2269 static tree cp_parser_transaction
2271 static tree cp_parser_transaction_expression
2273 static bool cp_parser_function_transaction
2275 static tree cp_parser_transaction_cancel
2279 pragma_external,
2280 pragma_member,
2281 pragma_objc_icode,
2282 pragma_stmt,
2283 pragma_compound
2284 };
2285 static bool cp_parser_pragma
2288 /* Objective-C++ Productions */
2290 static tree cp_parser_objc_message_receiver
2292 static tree cp_parser_objc_message_args
2294 static tree cp_parser_objc_message_expression
2296 static tree cp_parser_objc_encode_expression
2298 static tree cp_parser_objc_defs_expression
2300 static tree cp_parser_objc_protocol_expression
2302 static tree cp_parser_objc_selector_expression
2304 static tree cp_parser_objc_expression
2306 static bool cp_parser_objc_selector_p
2308 static tree cp_parser_objc_selector
2310 static tree cp_parser_objc_protocol_refs_opt
2312 static void cp_parser_objc_declaration
2314 static tree cp_parser_objc_statement
2316 static bool cp_parser_objc_valid_prefix_attributes
2318 static void cp_parser_objc_at_property_declaration
2320 static void cp_parser_objc_at_synthesize_declaration
2322 static void cp_parser_objc_at_dynamic_declaration
2324 static tree cp_parser_objc_struct_declaration
2327 /* Utility Routines */
2329 static tree cp_parser_lookup_name
2331 static tree cp_parser_lookup_name_simple
2333 static tree cp_parser_maybe_treat_template_as_class
2335 static bool cp_parser_check_declarator_template_parameters
2337 static bool cp_parser_check_template_parameters
2339 static tree cp_parser_simple_cast_expression
2341 static tree cp_parser_global_scope_opt
2343 static bool cp_parser_constructor_declarator_p
2345 static tree cp_parser_function_definition_from_specifiers_and_declarator
2347 static tree cp_parser_function_definition_after_declarator
2349 static void cp_parser_template_declaration_after_export
2351 static void cp_parser_perform_template_parameter_access_checks
2353 static tree cp_parser_single_declaration
2355 static tree cp_parser_functional_cast
2357 static tree cp_parser_save_member_function_body
2359 static tree cp_parser_save_nsdmi
2361 static tree cp_parser_enclosed_template_argument_list
2363 static void cp_parser_save_default_args
2365 static void cp_parser_late_parsing_for_member
2367 static tree cp_parser_late_parse_one_default_arg
2369 static void cp_parser_late_parsing_nsdmi
2371 static void cp_parser_late_parsing_default_args
2373 static tree cp_parser_sizeof_operand
2375 static tree cp_parser_trait_expr
2377 static bool cp_parser_declares_only_class_p
2379 static void cp_parser_set_storage_class
2381 static void cp_parser_set_decl_spec_type
2383 static void set_and_check_decl_spec_loc
2386 static bool cp_parser_friend_p
2388 static void cp_parser_required_error
2394 static bool cp_parser_token_starts_function_definition_p
2396 static bool cp_parser_next_token_starts_class_definition_p
2398 static bool cp_parser_next_token_ends_template_argument_p
2400 static bool cp_parser_nth_token_starts_template_argument_list_p
2402 static enum tag_types cp_parser_token_is_class_key
2404 static void cp_parser_check_class_key
2406 static void cp_parser_check_access_in_redeclaration
2408 static bool cp_parser_optional_template_keyword
2410 static void cp_parser_pre_parsed_nested_name_specifier
2412 static bool cp_parser_cache_group
2414 static tree cp_parser_cache_defarg
2416 static void cp_parser_parse_tentatively
2418 static void cp_parser_commit_to_tentative_parse
2420 static void cp_parser_commit_to_topmost_tentative_parse
2422 static void cp_parser_abort_tentative_parse
2424 static bool cp_parser_parse_definitely
2428 static bool cp_parser_uncommitted_to_tentative_parse_p
2430 static void cp_parser_error
2432 static void cp_parser_name_lookup_error
2434 static bool cp_parser_simulate_error
2436 static bool cp_parser_check_type_definition
2438 static void cp_parser_check_for_definition_in_return_type
2440 static void cp_parser_check_for_invalid_template_id
2442 static bool cp_parser_non_integral_constant_expression
2444 static void cp_parser_diagnose_invalid_type_name
2446 static bool cp_parser_parse_and_diagnose_invalid_type_name
2448 static int cp_parser_skip_to_closing_parenthesis
2450 static void cp_parser_skip_to_end_of_statement
2452 static void cp_parser_consume_semicolon_at_end_of_statement
2454 static void cp_parser_skip_to_end_of_block_or_statement
2456 static bool cp_parser_skip_to_closing_brace
2458 static void cp_parser_skip_to_end_of_template_parameter_list
2460 static void cp_parser_skip_to_pragma_eol
2462 static bool cp_parser_error_occurred
2464 static bool cp_parser_allow_gnu_extensions_p
2466 static bool cp_parser_is_pure_string_literal
2468 static bool cp_parser_is_string_literal
2470 static bool cp_parser_is_keyword
2472 static tree cp_parser_make_typename_type
2477 /* Returns nonzero if we are parsing tentatively. */
2481 {
2483 }
2485 /* Returns nonzero if TOKEN is a string literal. */
2487 static bool
2489 {
2495 }
2497 /* Returns nonzero if TOKEN is a string literal
2498 of a user-defined string literal. */
2500 static bool
2502 {
2509 }
2511 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2513 static bool
2515 {
2517 }
2519 /* If not parsing tentatively, issue a diagnostic of the form
2520 FILE:LINE: MESSAGE before TOKEN
2521 where TOKEN is the next token in the input stream. MESSAGE
2522 (specified by the caller) is usually of the form "expected
2523 OTHER-TOKEN". */
2525 static void
2527 {
2529 {
2531 /* This diagnostic makes more sense if it is tagged to the line
2532 of the token we just peeked at. */
2536 {
2541 }
2544 /* Because c_parser_error does not understand
2545 CPP_KEYWORD, keywords are treated like
2546 identifiers. */
2549 }
2550 }
2552 /* Issue an error about name-lookup failing. NAME is the
2553 IDENTIFIER_NODE DECL is the result of
2554 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2555 the thing that we hoped to find. */
2557 static void
2559 tree name,
2560 tree decl,
2561 name_lookup_error desired,
2562 location_t location)
2563 {
2564 /* If name lookup completely failed, tell the user that NAME was not
2565 declared. */
2567 {
2580 else
2582 }
2584 {
2586 {
2603 }
2604 }
2606 {
2608 {
2618 name);
2622 }
2623 }
2624 else
2625 {
2627 {
2640 }
2641 }
2642 }
2644 /* If we are parsing tentatively, remember that an error has occurred
2645 during this tentative parse. Returns true if the error was
2646 simulated; false if a message should be issued by the caller. */
2648 static bool
2650 {
2652 {
2655 }
2657 }
2659 /* This function is called when a type is defined. If type
2660 definitions are forbidden at this point, an error message is
2661 issued. */
2663 static bool
2665 {
2666 /* If types are forbidden here, issue a message. */
2668 {
2669 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2670 in the message need to be interpreted. */
2673 }
2675 }
2677 /* This function is called when the DECLARATOR is processed. The TYPE
2678 was a type defined in the decl-specifiers. If it is invalid to
2679 define a type in the decl-specifiers for DECLARATOR, an error is
2680 issued. TYPE_LOCATION is the location of TYPE and is used
2681 for error reporting. */
2683 static void
2686 {
2687 /* [dcl.fct] forbids type definitions in return types.
2688 Unfortunately, it's not easy to know whether or not we are
2689 processing a return type until after the fact. */
2697 {
2702 type);
2703 }
2704 }
2706 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2707 "<" in any valid C++ program. If the next token is indeed "<",
2708 issue a message warning the user about what appears to be an
2709 invalid attempt to form a template-id. LOCATION is the location
2710 of the type-specifier (TYPE) */
2712 static void
2714 tree type,
2716 location_t location)
2717 {
2721 {
2725 {
2728 else
2730 }
2731 else
2733 /* Remember the location of the invalid "<". */
2736 /* Consume the "<". */
2738 /* Parse the template arguments. */
2740 /* Permanently remove the invalid template arguments so that
2741 this error message is not issued again. */
2744 }
2745 }
2747 /* If parsing an integral constant-expression, issue an error message
2748 about the fact that THING appeared and return true. Otherwise,
2749 return false. In either case, set
2750 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2752 static bool
2754 non_integral_constant thing)
2755 {
2758 {
2760 {
2763 {
2770 "enumeration type cannot appear in a "
2861 }
2865 }
2866 }
2868 }
2870 /* Emit a diagnostic for an invalid type name. SCOPE is the
2871 qualifying scope (or NULL, if none) for ID. This function commits
2872 to the current active tentative parse, if any. (Otherwise, the
2873 problematic construct might be encountered again later, resulting
2874 in duplicate error messages.) LOCATION is the location of ID. */
2876 static void
2879 location_t location)
2880 {
2883 /* Try to lookup the identifier. */
2888 /* If the lookup found a template-name, it means that the user forgot
2889 to specify an argument list. Emit a useful error message. */
2893 decl);
2897 /* Something like 'unsigned A a;' */
2900 {
2901 /* Issue an error message. */
2903 /* If we're in a template class, it's possible that the user was
2904 referring to a type from a base class. For example:
2906 template <typename T> struct A { typedef T X; };
2907 template <typename T> struct B : public A<T> { X x; };
2909 The user should have said "typename A<T>::X". */
2915 {
2916 tree b;
2919 b;
2921 {
2925 {
2926 tree field;
2927 /* Go from a particular instantiation of the
2928 template (which will have an empty TYPE_FIELDs),
2929 to the main version. */
2932 field;
2936 {
2941 }
2944 }
2945 }
2946 }
2947 }
2948 /* Here we diagnose qualified-ids where the scope is actually correct,
2949 but the identifier does not resolve to a valid type name. */
2951 {
2953 {
2958 else
2962 }
2965 {
2966 /* A<T>::A<T>() */
2972 }
2979 {
2984 else
2988 }
2989 else
2991 }
2992 }
2994 /* Check for a common situation where a type-name should be present,
2995 but is not, and issue a sensible error message. Returns true if an
2996 invalid type-name was detected.
2998 The situation handled by this function are variable declarations of the
2999 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3000 Usually, `ID' should name a type, but if we got here it means that it
3001 does not. We try to emit the best possible error message depending on
3002 how exactly the id-expression looks like. */
3004 static bool
3006 {
3007 tree id;
3010 /* Avoid duplicate error about ambiguous lookup. */
3012 {
3016 }
3025 /* If the next token is a (, this is a function with no explicit return
3026 type, i.e. constructor, destructor or conversion op. */
3029 {
3032 }
3036 /* Emit a diagnostic for the invalid type. */
3039 out:
3040 /* If we aren't in the middle of a declarator (i.e. in a
3041 parameter-declaration-clause), skip to the end of the declaration;
3042 there's no point in trying to process it. */
3046 }
3048 /* Consume tokens up to, and including, the next non-nested closing `)'.
3049 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3050 are doing error recovery. Returns -1 if OR_COMMA is true and we
3051 found an unnested comma. */
3053 static int
3058 {
3068 {
3072 {
3075 /* If we've run out of tokens, then there is no closing `)'. */
3078 /* This is good for lambda expression capture-lists. */
3088 /* This matches the processing in skip_to_end_of_statement. */
3114 {
3118 }
3123 }
3125 /* Consume the token. */
3127 }
3128 }
3130 /* Consume tokens until we reach the end of the current statement.
3131 Normally, that will be just before consuming a `;'. However, if a
3132 non-nested `}' comes first, then we stop before consuming that. */
3134 static void
3136 {
3139 /* Unwind generic function template scope if necessary. */
3144 {
3148 {
3151 /* If we've run out of tokens, stop. */
3155 /* If the next token is a `;', we have reached the end of the
3156 statement. */
3162 /* If this is a non-nested '}', stop before consuming it.
3163 That way, when confronted with something like:
3165 { 3 + }
3167 we stop before consuming the closing '}', even though we
3168 have not yet reached a `;'. */
3172 /* If it is the closing '}' for a block that we have
3173 scanned, stop -- but only after consuming the token.
3174 That way given:
3176 void f g () { ... }
3177 typedef int I;
3179 we will stop after the body of the erroneously declared
3180 function, but before consuming the following `typedef'
3181 declaration. */
3183 {
3186 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* This function is called at the end of a statement or declaration.
3202 If the next token is a semicolon, it is consumed; otherwise, error
3203 recovery is attempted. */
3205 static void
3207 {
3208 /* Look for the trailing `;'. */
3210 {
3211 /* If there is additional (erroneous) input, skip to the end of
3212 the statement. */
3214 /* If the next token is now a `;', consume it. */
3217 }
3218 }
3220 /* Skip tokens until we have consumed an entire block, or until we
3221 have consumed a non-nested `;'. */
3223 static void
3225 {
3228 /* Unwind generic function template scope if necessary. */
3233 {
3237 {
3240 /* If we've run out of tokens, stop. */
3244 /* Stop if this is an unnested ';'. */
3250 /* Stop if this is an unnested '}', or closes the outermost
3251 nesting level. */
3252 nesting_depth--;
3260 /* Nest. */
3261 nesting_depth++;
3266 }
3268 /* Consume the token. */
3270 }
3271 }
3273 /* Skip tokens until a non-nested closing curly brace is the next
3274 token, or there are no more tokens. Return true in the first case,
3275 false otherwise. */
3277 static bool
3279 {
3283 {
3287 {
3290 /* If we've run out of tokens, stop. */
3294 /* If the next token is a non-nested `}', then we have reached
3295 the end of the current block. */
3301 /* If it the next token is a `{', then we are entering a new
3302 block. Consume the entire block. */
3308 }
3310 /* Consume the token. */
3312 }
3313 }
3315 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3316 parameter is the PRAGMA token, allowing us to purge the entire pragma
3317 sequence. */
3319 static void
3321 {
3326 do
3330 /* Ensure that the pragma is not parsed again. */
3332 }
3334 /* Require pragma end of line, resyncing with it as necessary. The
3335 arguments are as for cp_parser_skip_to_pragma_eol. */
3337 static void
3339 {
3343 }
3345 /* This is a simple wrapper around make_typename_type. When the id is
3346 an unresolved identifier node, we can provide a superior diagnostic
3347 using cp_parser_diagnose_invalid_type_name. */
3349 static tree
3352 {
3353 tree result;
3355 {
3361 }
3363 }
3365 /* This is a wrapper around the
3366 make_{pointer,ptrmem,reference}_declarator functions that decides
3367 which one to call based on the CODE and CLASS_TYPE arguments. The
3368 CODE argument should be one of the values returned by
3369 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3370 appertain to the pointer or reference. */
3374 cp_cv_quals cv_qualifiers,
3376 tree attributes)
3377 {
3384 else
3394 }
3396 /* Create a new C++ parser. */
3400 {
3405 /* cp_lexer_new_main is called before doing GC allocation because
3406 cp_lexer_new_main might load a PCH file. */
3409 /* Initialize the binops_by_token so that we can get the tree
3410 directly from the token. */
3418 /* For now, we always accept GNU extensions. */
3421 /* The `>' token is a greater-than operator, not the end of a
3422 template-id. */
3427 /* We are not parsing a constant-expression. */
3432 /* Local variable names are not forbidden. */
3435 /* We are not processing an `extern "C"' declaration. */
3438 /* We are not processing a declarator. */
3441 /* We are not processing a template-argument-list. */
3444 /* We are not in an iteration statement. */
3447 /* We are not in a switch statement. */
3450 /* We are not parsing a type-id inside an expression. */
3453 /* Declarations aren't implicitly extern "C". */
3456 /* String literals should be translated to the execution character set. */
3459 /* We are not parsing a function body. */
3462 /* We can correct until told otherwise. */
3465 /* The unparsed function queue is empty. */
3468 /* There are no classes being defined. */
3471 /* No template parameters apply. */
3474 /* Not declaring an implicit function template. */
3481 }
3483 /* Create a cp_lexer structure which will emit the tokens in CACHE
3484 and push it onto the parser's lexer stack. This is used for delayed
3485 parsing of in-class method bodies and default arguments, and should
3486 not be confused with tentative parsing. */
3487 static void
3489 {
3494 /* Move the current source position to that of the first token in the
3495 new lexer. */
3497 }
3499 /* Pop the top lexer off the parser stack. This is never used for the
3500 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3501 static void
3503 {
3508 /* Put the current source position back where it was before this
3509 lexer was pushed. */
3511 }
3513 /* Lexical conventions [gram.lex] */
3515 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3516 identifier. */
3518 static tree
3520 {
3523 /* Look for the identifier. */
3525 /* Return the value. */
3527 }
3529 /* Parse a sequence of adjacent string constants. Returns a
3530 TREE_STRING representing the combined, nul-terminated string
3531 constant. If TRANSLATE is true, translate the string to the
3532 execution character set. If WIDE_OK is true, a wide string is
3533 invalid here.
3535 C++98 [lex.string] says that if a narrow string literal token is
3536 adjacent to a wide string literal token, the behavior is undefined.
3537 However, C99 6.4.5p4 says that this results in a wide string literal.
3538 We follow C99 here, for consistency with the C front end.
3540 This code is largely lifted from lex_string() in c-lex.c.
3542 FUTURE: ObjC++ will need to handle @-strings here. */
3543 static tree
3545 {
3546 tree value;
3553 tree string_tree;
3559 {
3562 }
3565 {
3569 }
3570 else
3571 {
3574 }
3577 /* Try to avoid the overhead of creating and destroying an obstack
3578 for the common case of just one string. */
3581 {
3589 {
3593 }
3594 else
3598 }
3599 else
3600 {
3604 do
3605 {
3607 count++;
3612 {
3615 {
3618 }
3621 {
3626 }
3628 }
3629 else
3633 {
3638 "unsupported non-standard concatenation "
3640 }
3646 {
3650 }
3651 else
3652 {
3656 }
3657 }
3661 }
3664 {
3667 }
3671 {
3676 {
3691 }
3696 {
3701 }
3702 }
3703 else
3704 /* cpp_interpret_string has issued an error. */
3711 }
3713 /* Look up a literal operator with the name and the exact arguments. */
3715 static tree
3717 {
3724 {
3730 {
3733 {
3743 }
3746 /* May be this should be sufficient_parms_p instead,
3747 depending on how exactly should user-defined literals
3748 work in presence of default arguments on the literal
3749 operator parameters. */
3752 }
3753 }
3756 }
3758 /* Parse a user-defined char constant. Returns a call to a user-defined
3759 literal operator taking the character as an argument. */
3761 static tree
3763 {
3771 /* Build up a call to the user-defined operator */
3772 /* Lookup the name we got back from the id-expression. */
3777 {
3782 }
3791 }
3793 /* A subroutine of cp_parser_userdef_numeric_literal to
3794 create a char... template parameter pack from a string node. */
3796 static tree
3798 {
3799 tree charvec;
3805 /* Fill in CHARVEC with all of the parameters. */
3810 /* Build the argument packs. */
3817 }
3819 /* A subroutine of cp_parser_userdef_numeric_literal to
3820 create a char... template parameter pack from a string node. */
3822 static tree
3824 {
3825 tree charvec;
3836 /* First template parm is character type. */
3839 /* Fill in CHARVEC with all of the parameters. */
3846 /* Build the argument packs. */
3853 }
3855 /* Parse a user-defined numeric constant. returns a call to a user-defined
3856 literal operator. */
3858 static tree
3860 {
3871 /* Look for a literal operator taking the exact type of numeric argument
3872 as the literal value. */
3877 {
3880 {
3884 long_long_unsigned_type_node);
3885 else
3886 {
3890 long_double_type_node);
3894 }
3897 }
3898 }
3901 /* If the numeric argument didn't work, look for a raw literal
3902 operator taking a const char* argument consisting of the number
3903 in string format. */
3908 {
3911 {
3914 }
3915 }
3918 /* If the raw literal didn't work, look for a non-type template
3919 function with parameter pack char.... Call the function with
3920 template parameter characters representing the number. */
3924 {
3929 {
3932 }
3933 }
3941 }
3943 /* Parse a user-defined string constant. Returns a call to a user-defined
3944 literal operator taking a character pointer and the length of the string
3945 as arguments. */
3947 static tree
3949 {
3959 /* Look for a template function with typename parameter CharT
3960 and parameter pack CharT... Call the function with
3961 template parameter characters representing the string. */
3965 {
3970 {
3973 }
3974 }
3977 /* Build up a call to the user-defined operator */
3978 /* Lookup the name we got back from the id-expression. */
3984 {
3988 }
3997 }
4000 /* Basic concepts [gram.basic] */
4002 /* Parse a translation-unit.
4004 translation-unit:
4005 declaration-seq [opt]
4007 Returns TRUE if all went well. */
4009 static bool
4011 {
4012 /* The address of the first non-permanent object on the declarator
4013 obstack. */
4018 /* Create the declarator obstack, if necessary. */
4020 {
4022 /* Create the error declarator. */
4024 /* Create the empty parameter list. */
4026 /* Remember where the base of the declarator obstack lies. */
4028 }
4032 /* If there are no tokens left then all went well. */
4034 {
4035 /* Get rid of the token array; we don't need it any more. */
4039 /* This file might have been a context that's implicitly extern
4040 "C". If so, pop the lang context. (Only relevant for PCH.) */
4042 {
4045 }
4047 /* Finish up. */
4051 }
4052 else
4053 {
4056 }
4058 /* Make sure the declarator obstack was fully cleaned up. */
4062 /* All went well. */
4064 }
4066 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4067 decltype context. */
4071 {
4076 }
4078 /* Expressions [gram.expr] */
4080 /* Parse a primary-expression.
4082 primary-expression:
4083 literal
4084 this
4085 ( expression )
4086 id-expression
4088 GNU Extensions:
4090 primary-expression:
4091 ( compound-statement )
4092 __builtin_va_arg ( assignment-expression , type-id )
4093 __builtin_offsetof ( type-id , offsetof-expression )
4095 C++ Extensions:
4096 __has_nothrow_assign ( type-id )
4097 __has_nothrow_constructor ( type-id )
4098 __has_nothrow_copy ( type-id )
4099 __has_trivial_assign ( type-id )
4100 __has_trivial_constructor ( type-id )
4101 __has_trivial_copy ( type-id )
4102 __has_trivial_destructor ( type-id )
4103 __has_virtual_destructor ( type-id )
4104 __is_abstract ( type-id )
4105 __is_base_of ( type-id , type-id )
4106 __is_class ( type-id )
4107 __is_convertible_to ( type-id , type-id )
4108 __is_empty ( type-id )
4109 __is_enum ( type-id )
4110 __is_final ( type-id )
4111 __is_literal_type ( type-id )
4112 __is_pod ( type-id )
4113 __is_polymorphic ( type-id )
4114 __is_std_layout ( type-id )
4115 __is_trivial ( type-id )
4116 __is_union ( type-id )
4118 Objective-C++ Extension:
4120 primary-expression:
4121 objc-expression
4123 literal:
4124 __null
4126 ADDRESS_P is true iff this expression was immediately preceded by
4127 "&" and therefore might denote a pointer-to-member. CAST_P is true
4128 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4129 true iff this expression is a template argument.
4131 Returns a representation of the expression. Upon return, *IDK
4132 indicates what kind of id-expression (if any) was present. */
4134 static tree
4141 {
4144 /* Assume the primary expression is not an id-expression. */
4147 /* Peek at the next token. */
4150 {
4151 /* literal:
4152 integer-literal
4153 character-literal
4154 floating-literal
4155 string-literal
4156 boolean-literal
4157 pointer-literal
4158 user-defined-literal */
4168 {
4172 }
4173 /* Floating-point literals are only allowed in an integral
4174 constant expression if they are cast to an integral or
4175 enumeration type. */
4179 {
4180 /* CAST_P will be set even in invalid code like "int(2.7 +
4181 ...)". Therefore, we have to check that the next token
4182 is sure to end the cast. */
4184 {
4189 enumerator-definition. */
4191 /* The curly brace at the end of an enum-specifier. */
4193 /* The end of a statement. */
4195 /* The end of the cast-expression. */
4197 /* The end of an array bound. */
4199 /* The closing ">" in a template-argument-list. */
4202 /* C++0x only: A ">>" treated like two ">" tokens,
4203 in a template-argument-list. */
4208 }
4210 /* If we are within a cast, then the constraint that the
4211 cast is to an integral or enumeration type will be
4212 checked at that point. If we are not within a cast, then
4213 this code is invalid. */
4216 }
4235 /* ??? Should wide strings be allowed when parser->translate_strings_p
4236 is false (i.e. in attributes)? If not, we can kill the third
4237 argument to cp_parser_string_literal. */
4243 {
4244 tree expr;
4247 /* Consume the `('. */
4249 /* Within a parenthesized expression, a `>' token is always
4250 the greater-than operator. */
4251 saved_greater_than_is_operator_p
4254 /* If we see `( { ' then we are looking at the beginning of
4255 a GNU statement-expression. */
4258 {
4259 /* Statement-expressions are not allowed by the standard. */
4263 /* And they're not allowed outside of a function-body; you
4264 cannot, for example, write:
4266 int i = ({ int j = 3; j + 1; });
4268 at class or namespace scope. */
4271 {
4273 "statement-expressions are not allowed outside "
4277 }
4278 else
4279 {
4280 /* Start the statement-expression. */
4282 /* Parse the compound-statement. */
4284 /* Finish up. */
4286 }
4287 }
4288 else
4289 {
4290 /* Parse the parenthesized expression. */
4292 /* Let the front end know that this expression was
4293 enclosed in parentheses. This matters in case, for
4294 example, the expression is of the form `A::B', since
4295 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4296 not. */
4298 /* DR 705: Wrapping an unqualified name in parentheses
4299 suppresses arg-dependent lookup. We want to pass back
4300 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4301 (c++/37862), but none of the others. */
4304 }
4305 /* The `>' token might be the end of a template-id or
4306 template-parameter-list now. */
4307 parser->greater_than_is_operator_p
4309 /* Consume the `)'. */
4314 }
4318 /* We have an Objective-C++ message. */
4320 {
4322 /* Don't warn about a failed tentative parse. */
4327 }
4331 /* We have an Objective-C++ string literal. */
4338 {
4339 /* These two are the boolean literals. */
4347 /* The `__null' literal. */
4352 /* The `nullptr' literal. */
4357 /* Recognize the `this' keyword. */
4361 {
4365 }
4366 /* Pointers cannot appear in constant-expressions. */
4371 /* The `operator' keyword can be the beginning of an
4372 id-expression. */
4379 {
4380 non_integral_constant name;
4382 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4383 __func__ are the names of variables -- but they are
4384 treated specially. Therefore, they are handled here,
4385 rather than relying on the generic id-expression logic
4386 below. Grammatically, these names are id-expressions.
4388 Consume the token. */
4392 {
4404 }
4409 /* Look up the name. */
4411 }
4414 {
4415 tree expression;
4416 tree type;
4417 source_location type_location;
4419 /* The `__builtin_va_arg' construct is used to handle
4420 `va_arg'. Consume the `__builtin_va_arg' token. */
4422 /* Look for the opening `('. */
4424 /* Now, parse the assignment-expression. */
4427 /* Look for the `,'. */
4430 /* Parse the type-id. */
4432 /* Look for the closing `)'. */
4434 /* Using `va_arg' in a constant-expression is not
4435 allowed. */
4437 NIC_VA_ARG))
4440 }
4468 /* Objective-C++ expressions. */
4478 {
4483 }
4487 }
4489 /* An id-expression can start with either an identifier, a
4490 `::' as the beginning of a qualified-id, or the "operator"
4491 keyword. */
4496 {
4497 tree id_expression;
4498 tree decl;
4504 id_expression:
4505 /* Parse the id-expression. */
4506 id_expression
4523 /* If we have a template-id, then no further lookup is
4524 required. If the template-id was for a template-class, we
4525 will sometimes have a TYPE_DECL at this point. */
4529 /* Look up the name. */
4530 else
4531 {
4532 tree ambiguous_decls;
4534 /* If we already know that this lookup is ambiguous, then
4535 we've already issued an error message; there's no reason
4536 to check again. */
4539 {
4542 }
4545 none_type,
4546 template_p,
4551 /* If the lookup was ambiguous, an error will already have
4552 been issued. */
4556 /* In Objective-C++, we may have an Objective-C 2.0
4557 dot-syntax for classes here. */
4562 {
4563 tree component;
4570 }
4572 /* In Objective-C++, an instance variable (ivar) may be preferred
4573 to whatever cp_parser_lookup_name() found. */
4576 /* If name lookup gives us a SCOPE_REF, then the
4577 qualifying scope was dependent. */
4579 {
4580 /* At this point, we do not know if DECL is a valid
4581 integral constant expression. We assume that it is
4582 in fact such an expression, so that code like:
4584 template <int N> struct A {
4585 int a[B<N>::i];
4586 };
4588 is accepted. At template-instantiation time, we
4589 will check that B<N>::i is actually a constant. */
4591 }
4592 /* Check to see if DECL is a local variable in a context
4593 where that is forbidden. */
4596 {
4597 /* It might be that we only found DECL because we are
4598 trying to be generous with pre-ISO scoping rules.
4599 For example, consider:
4601 int i;
4602 void g() {
4603 for (int i = 0; i < 10; ++i) {}
4604 extern void f(int j = i);
4605 }
4607 Here, name look up will originally find the out
4608 of scope `i'. We need to issue a warning message,
4609 but then use the global `i'. */
4612 {
4615 decl);
4617 }
4618 }
4619 }
4621 decl = (finish_id_expression
4623 idk,
4628 template_arg_p,
4634 }
4636 /* Anything else is an error. */
4640 }
4641 }
4649 {
4652 }
4654 /* Parse an id-expression.
4656 id-expression:
4657 unqualified-id
4658 qualified-id
4660 qualified-id:
4661 :: [opt] nested-name-specifier template [opt] unqualified-id
4662 :: identifier
4663 :: operator-function-id
4664 :: template-id
4666 Return a representation of the unqualified portion of the
4667 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4668 a `::' or nested-name-specifier.
4670 Often, if the id-expression was a qualified-id, the caller will
4671 want to make a SCOPE_REF to represent the qualified-id. This
4672 function does not do this in order to avoid wastefully creating
4673 SCOPE_REFs when they are not required.
4675 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4676 `template' keyword.
4678 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4679 uninstantiated templates.
4681 If *TEMPLATE_P is non-NULL, it is set to true iff the
4682 `template' keyword is used to explicitly indicate that the entity
4683 named is a template.
4685 If DECLARATOR_P is true, the id-expression is appearing as part of
4686 a declarator, rather than as part of an expression. */
4688 static tree
4695 {
4699 /* Assume the `template' keyword was not used. */
4703 /* Look for the optional `::' operator. */
4704 global_scope_p
4707 /* Look for the optional nested-name-specifier. */
4708 nested_name_specifier_p
4711 check_dependency_p,
4713 declarator_p)
4715 /* If there is a nested-name-specifier, then we are looking at
4716 the first qualified-id production. */
4718 {
4719 tree saved_scope;
4720 tree saved_object_scope;
4721 tree saved_qualifying_scope;
4722 tree unqualified_id;
4725 /* See if the next token is the `template' keyword. */
4729 /* Name lookup we do during the processing of the
4730 unqualified-id might obliterate SCOPE. */
4734 /* Process the final unqualified-id. */
4736 check_dependency_p,
4737 declarator_p,
4739 /* Restore the SAVED_SCOPE for our caller. */
4745 }
4746 /* Otherwise, if we are in global scope, then we are looking at one
4747 of the other qualified-id productions. */
4749 {
4751 tree id;
4753 /* Peek at the next token. */
4756 /* If it's an identifier, and the next token is not a "<", then
4757 we can avoid the template-id case. This is an optimization
4758 for this common case. */
4760 && !cp_parser_nth_token_starts_template_argument_list_p
4765 /* Try a template-id. */
4769 none_type,
4770 declarator_p);
4771 /* If that worked, we're done. */
4775 /* Peek at the next token. (Changes in the token buffer may
4776 have invalidated the pointer obtained above.) */
4780 {
4787 /* Fall through. */
4792 }
4793 }
4794 else
4797 declarator_p,
4798 optional_p);
4799 }
4801 /* Parse an unqualified-id.
4803 unqualified-id:
4804 identifier
4805 operator-function-id
4806 conversion-function-id
4807 ~ class-name
4808 template-id
4810 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4811 keyword, in a construct like `A::template ...'.
4813 Returns a representation of unqualified-id. For the `identifier'
4814 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4815 production a BIT_NOT_EXPR is returned; the operand of the
4816 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4817 other productions, see the documentation accompanying the
4818 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4819 names are looked up in uninstantiated templates. If DECLARATOR_P
4820 is true, the unqualified-id is appearing as part of a declarator,
4821 rather than as part of an expression. */
4823 static tree
4829 {
4832 /* Peek at the next token. */
4836 {
4838 {
4839 tree id;
4841 /* We don't know yet whether or not this will be a
4842 template-id. */
4844 /* Try a template-id. */
4846 check_dependency_p,
4847 none_type,
4848 declarator_p);
4849 /* If it worked, we're done. */
4852 /* Otherwise, it's an ordinary identifier. */
4854 }
4858 check_dependency_p,
4859 none_type,
4860 declarator_p);
4863 {
4864 tree type_decl;
4865 tree qualifying_scope;
4866 tree object_scope;
4867 tree scope;
4870 /* Consume the `~' token. */
4872 /* Parse the class-name. The standard, as written, seems to
4873 say that:
4875 template <typename T> struct S { ~S (); };
4876 template <typename T> S<T>::~S() {}
4878 is invalid, since `~' must be followed by a class-name, but
4879 `S<T>' is dependent, and so not known to be a class.
4880 That's not right; we need to look in uninstantiated
4881 templates. A further complication arises from:
4883 template <typename T> void f(T t) {
4884 t.T::~T();
4885 }
4887 Here, it is not possible to look up `T' in the scope of `T'
4888 itself. We must look in both the current scope, and the
4889 scope of the containing complete expression.
4891 Yet another issue is:
4893 struct S {
4894 int S;
4895 ~S();
4896 };
4898 S::~S() {}
4900 The standard does not seem to say that the `S' in `~S'
4901 should refer to the type `S' and not the data member
4902 `S::S'. */
4904 /* DR 244 says that we look up the name after the "~" in the
4905 same scope as we looked up the qualifying name. That idea
4906 isn't fully worked out; it's more complicated than that. */
4911 /* Check for invalid scopes. */
4913 {
4917 }
4919 {
4923 scope);
4928 }
4931 /* If the name is of the form "X::~X" it's OK even if X is a
4932 typedef. */
4941 {
4944 }
4946 /* ~auto means the destructor of whatever the object is. */
4948 {
4951 "%<~auto%> only available with "
4955 }
4957 /* If there was an explicit qualification (S::~T), first look
4958 in the scope given by the qualification (i.e., S).
4960 Note: in the calls to cp_parser_class_name below we pass
4961 typename_type so that lookup finds the injected-class-name
4962 rather than the constructor. */
4966 {
4971 typename_type,
4974 declarator_p);
4977 }
4978 /* In "N::S::~S", look in "N" as well. */
4980 {
4985 type_decl
4989 typename_type,
4992 declarator_p);
4995 }
4996 /* In "p->S::~T", look in the scope given by "*p" as well. */
4998 {
5003 type_decl
5007 typename_type,
5010 declarator_p);
5013 }
5014 /* Look in the surrounding context. */
5016 {
5022 type_decl
5026 typename_type,
5029 declarator_p);
5032 {
5033 /* We couldn't find a type with this name, so just accept
5034 it and check for a match at instantiation time. */
5039 }
5040 }
5041 /* If an error occurred, assume that the name of the
5042 destructor is the same as the name of the qualifying
5043 class. That allows us to keep parsing after running
5044 into ill-formed destructor names. */
5050 /* Check that destructor name and scope match. */
5052 {
5059 }
5061 /* [class.dtor]
5063 A typedef-name that names a class shall not be used as the
5064 identifier in the declarator for a destructor declaration. */
5071 type_decl);
5074 }
5078 {
5079 tree id;
5081 /* This could be a template-id, so we try that first. */
5083 /* Try a template-id. */
5086 none_type,
5087 declarator_p);
5088 /* If that worked, we're done. */
5091 /* We still don't know whether we're looking at an
5092 operator-function-id or a conversion-function-id. */
5094 /* Try an operator-function-id. */
5096 /* If that didn't work, try a conversion-function-id. */
5100 {
5101 /* 17.6.3.3.5 */
5107 }
5110 }
5111 /* Fall through. */
5118 }
5119 }
5121 /* Parse an (optional) nested-name-specifier.
5123 nested-name-specifier: [C++98]
5124 class-or-namespace-name :: nested-name-specifier [opt]
5125 class-or-namespace-name :: template nested-name-specifier [opt]
5127 nested-name-specifier: [C++0x]
5128 type-name ::
5129 namespace-name ::
5130 nested-name-specifier identifier ::
5131 nested-name-specifier template [opt] simple-template-id ::
5133 PARSER->SCOPE should be set appropriately before this function is
5134 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5135 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5136 in name lookups.
5138 Sets PARSER->SCOPE to the class (TYPE) or namespace
5139 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5140 it unchanged if there is no nested-name-specifier. Returns the new
5141 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5143 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5144 part of a declaration and/or decl-specifier. */
5146 static tree
5152 {
5157 /* Remember where the nested-name-specifier starts. */
5159 {
5162 }
5165 {
5166 tree new_scope;
5167 tree old_scope;
5168 tree saved_qualifying_scope;
5171 /* Spot cases that cannot be the beginning of a
5172 nested-name-specifier. */
5175 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5176 the already parsed nested-name-specifier. */
5178 {
5179 /* Grab the nested-name-specifier and continue the loop. */
5181 /* If we originally encountered this nested-name-specifier
5182 with IS_DECLARATION set to false, we will not have
5183 resolved TYPENAME_TYPEs, so we must do so here. */
5186 {
5191 }
5194 }
5196 /* Spot cases that cannot be the beginning of a
5197 nested-name-specifier. On the second and subsequent times
5198 through the loop, we look for the `template' keyword. */
5200 ;
5201 /* A template-id can start a nested-name-specifier. */
5203 ;
5204 /* DR 743: decltype can be used in a nested-name-specifier. */
5206 ;
5207 else
5208 {
5209 /* If the next token is not an identifier, then it is
5210 definitely not a type-name or namespace-name. */
5213 /* If the following token is neither a `<' (to begin a
5214 template-id), nor a `::', then we are not looking at a
5215 nested-name-specifier. */
5221 {
5225 }
5228 && !cp_parser_nth_token_starts_template_argument_list_p
5231 }
5233 /* The nested-name-specifier is optional, so we parse
5234 tentatively. */
5237 /* Look for the optional `template' keyword, if this isn't the
5238 first time through the loop. */
5241 else
5244 /* Save the old scope since the name lookup we are about to do
5245 might destroy it. */
5248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5249 look up names in "X<T>::I" in order to determine that "Y" is
5250 a template. So, if we have a typename at this point, we make
5251 an effort to look through it. */
5253 && !typename_keyword_p
5258 /* Parse the qualifying entity. */
5259 new_scope
5261 typename_keyword_p,
5262 template_keyword_p,
5263 check_dependency_p,
5264 type_p,
5265 is_declaration);
5266 /* Look for the `::' token. */
5269 /* If we found what we wanted, we keep going; otherwise, we're
5270 done. */
5272 {
5275 /* Restore the OLD_SCOPE since it was valid before the
5276 failed attempt at finding the last
5277 class-or-namespace-name. */
5281 /* If the next token is a decltype, and the one after that is a
5282 `::', then the decltype has failed to resolve to a class or
5283 enumeration type. Give this error even when parsing
5284 tentatively since it can't possibly be valid--and we're going
5285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5286 won't get another chance.*/
5290 {
5297 /* As below. */
5300 }
5304 /* If the next token is an identifier, and the one after
5305 that is a `::', then any valid interpretation would have
5306 found a class-or-namespace-name. */
5312 {
5315 {
5317 {
5318 tree decl;
5319 tree ambiguous_decls;
5322 none_type,
5331 decl);
5333 {
5334 // cp_parser_lookup_name has the same diagnostic,
5335 // thus make sure to emit it at most once.
5338 {
5343 }
5345 }
5346 else
5347 {
5349 cp_parser_name_lookup_error
5352 else
5353 cp_parser_name_lookup_error
5356 }
5357 }
5360 /* Treat this as a successful nested-name-specifier
5361 due to:
5363 [basic.lookup.qual]
5365 If the name found is not a class-name (clause
5366 _class_) or namespace-name (_namespace.def_), the
5367 program is ill-formed. */
5369 }
5371 }
5373 }
5374 /* We've found one valid nested-name-specifier. */
5376 /* Name lookup always gives us a DECL. */
5379 /* Uses of "template" must be followed by actual templates. */
5391 new_scope);
5392 /* If it is a class scope, try to complete it; we are about to
5393 be looking up names inside the class. */
5395 /* Since checking types for dependency can be expensive,
5396 avoid doing it if the type is already complete. */
5398 /* Do not try to complete dependent types. */
5400 {
5402 /* If it is a typedef to current class, use the current
5403 class instead, as the typedef won't have any names inside
5404 it yet. */
5408 }
5409 /* Make sure we look in the right scope the next time through
5410 the loop. */
5412 }
5414 /* If parsing tentatively, replace the sequence of tokens that makes
5415 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5416 token. That way, should we re-parse the token stream, we will
5417 not have to repeat the effort required to do the parse, nor will
5418 we issue duplicate error messages. */
5420 {
5424 /* Reset the contents of the START token. */
5426 /* Retrieve any deferred checks. Do not pop this access checks yet
5427 so the memory will not be reclaimed during token replacing below. */
5435 /* Purge all subsequent tokens. */
5437 }
5443 }
5445 /* Parse a nested-name-specifier. See
5446 cp_parser_nested_name_specifier_opt for details. This function
5447 behaves identically, except that it will an issue an error if no
5448 nested-name-specifier is present. */
5450 static tree
5456 {
5457 tree scope;
5459 /* Look for the nested-name-specifier. */
5461 typename_keyword_p,
5462 check_dependency_p,
5463 type_p,
5464 is_declaration);
5465 /* If it was not present, issue an error message. */
5467 {
5470 }
5473 }
5475 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5476 this is either a class-name or a namespace-name (which corresponds
5477 to the class-or-namespace-name production in the grammar). For
5478 C++0x, it can also be a type-name that refers to an enumeration
5479 type or a simple-template-id.
5481 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5482 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5483 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5484 TYPE_P is TRUE iff the next name should be taken as a class-name,
5485 even the same name is declared to be another entity in the same
5486 scope.
5488 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5489 specified by the class-or-namespace-name. If neither is found the
5490 ERROR_MARK_NODE is returned. */
5492 static tree
5499 {
5500 tree saved_scope;
5501 tree saved_qualifying_scope;
5502 tree saved_object_scope;
5503 tree scope;
5507 /* DR 743: decltype can appear in a nested-name-specifier. */
5509 {
5513 {
5516 }
5520 }
5522 /* Before we try to parse the class-name, we must save away the
5523 current PARSER->SCOPE since cp_parser_class_name will destroy
5524 it. */
5528 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5529 there is no need to look for a namespace-name. */
5530 only_class_p = template_keyword_p
5535 typename_keyword_p,
5536 template_keyword_p,
5538 check_dependency_p,
5540 is_declaration);
5542 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5546 {
5547 /* Restore the saved scope. */
5552 /* Parse tentatively. */
5555 /* Parse a type-name */
5558 /* "If the name found does not designate a namespace or a class,
5559 enumeration, or dependent type, the program is ill-formed."
5561 We cover classes and dependent types above and namespaces below,
5562 so this code is only looking for enums. */
5568 }
5569 /* If that didn't work, try for a namespace-name. */
5571 {
5572 /* Restore the saved scope. */
5576 /* If we are not looking at an identifier followed by the scope
5577 resolution operator, then this is not part of a
5578 nested-name-specifier. (Note that this function is only used
5579 to parse the components of a nested-name-specifier.) */
5584 }
5587 }
5589 /* Parse a postfix-expression.
5591 postfix-expression:
5592 primary-expression
5593 postfix-expression [ expression ]
5594 postfix-expression ( expression-list [opt] )
5595 simple-type-specifier ( expression-list [opt] )
5596 typename :: [opt] nested-name-specifier identifier
5597 ( expression-list [opt] )
5598 typename :: [opt] nested-name-specifier template [opt] template-id
5599 ( expression-list [opt] )
5600 postfix-expression . template [opt] id-expression
5601 postfix-expression -> template [opt] id-expression
5602 postfix-expression . pseudo-destructor-name
5603 postfix-expression -> pseudo-destructor-name
5604 postfix-expression ++
5605 postfix-expression --
5606 dynamic_cast < type-id > ( expression )
5607 static_cast < type-id > ( expression )
5608 reinterpret_cast < type-id > ( expression )
5609 const_cast < type-id > ( expression )
5610 typeid ( expression )
5611 typeid ( type-id )
5613 GNU Extension:
5615 postfix-expression:
5616 ( type-id ) { initializer-list , [opt] }
5618 This extension is a GNU version of the C99 compound-literal
5619 construct. (The C99 grammar uses `type-name' instead of `type-id',
5620 but they are essentially the same concept.)
5622 If ADDRESS_P is true, the postfix expression is the operand of the
5623 `&' operator. CAST_P is true if this expression is the target of a
5624 cast.
5626 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5627 class member access expressions [expr.ref].
5629 Returns a representation of the expression. */
5631 static tree
5635 {
5637 location_t loc;
5644 /* Peek at the next token. */
5647 /* Some of the productions are determined by keywords. */
5650 {
5655 {
5656 tree type;
5657 tree expression;
5661 /* All of these can be handled in the same way from the point
5662 of view of parsing. Begin by consuming the token
5663 identifying the cast. */
5666 /* New types cannot be defined in the cast. */
5668 parser->type_definition_forbidden_message
5671 /* Look for the opening `<'. */
5673 /* Parse the type to which we are casting. */
5678 /* Look for the closing `>'. */
5680 /* Restore the old message. */
5683 bool saved_greater_than_is_operator_p
5687 /* And the expression which is being cast. */
5692 parser->greater_than_is_operator_p
5695 /* Only type conversions to integral or enumeration types
5696 can be used in constant-expressions. */
5702 {
5704 postfix_expression
5708 postfix_expression
5712 postfix_expression
5714 tf_warning_or_error);
5717 postfix_expression
5722 }
5723 }
5727 {
5728 tree type;
5732 /* Consume the `typeid' token. */
5734 /* Look for the `(' token. */
5736 /* Types cannot be defined in a `typeid' expression. */
5738 parser->type_definition_forbidden_message
5740 /* We can't be sure yet whether we're looking at a type-id or an
5741 expression. */
5743 /* Try a type-id first. */
5748 /* Look for the `)' token. Otherwise, we can't be sure that
5749 we're not looking at an expression: consider `typeid (int
5750 (3))', for example. */
5752 /* If all went well, simply lookup the type-id. */
5755 /* Otherwise, fall back to the expression variant. */
5756 else
5757 {
5758 tree expression;
5760 /* Look for an expression. */
5762 /* Compute its typeid. */
5764 /* Look for the `)' token. */
5766 }
5767 /* Restore the saved message. */
5769 /* `typeid' may not appear in an integral constant expression. */
5772 }
5776 {
5777 tree type;
5778 /* The syntax permitted here is the same permitted for an
5779 elaborated-type-specifier. */
5784 }
5788 {
5792 {
5797 }
5799 {
5804 }
5805 else
5806 {
5807 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5810 }
5812 postfix_expression =
5816 {
5820 }
5822 {
5827 }
5828 else
5829 {
5831 postfix_expression);
5835 }
5837 }
5841 {
5846 }
5847 else
5854 {
5857 tree p;
5871 tf_warning_or_error);
5874 tf_warning_or_error);
5875 else
5876 {
5880 }
5882 }
5885 {
5886 tree type;
5888 /* If the next thing is a simple-type-specifier, we may be
5889 looking at a functional cast. We could also be looking at
5890 an id-expression. So, we try the functional cast, and if
5891 that doesn't work we fall back to the primary-expression. */
5893 /* Look for the simple-type-specifier. */
5896 CP_PARSER_FLAGS_NONE);
5897 /* Parse the cast itself. */
5899 postfix_expression
5901 /* If that worked, we're done. */
5905 /* If the functional-cast didn't work out, try a
5906 compound-literal. */
5909 {
5914 /* Consume the `('. */
5917 /* Avoid calling cp_parser_type_id pointlessly, see comment
5918 in cp_parser_cast_expression about c++/29234. */
5921 compound_literal_p
5926 /* Roll back the tokens we skipped. */
5931 else
5932 {
5933 /* Parse the type. */
5938 /* Look for the `)'. */
5940 }
5942 /* If things aren't going well, there's no need to
5943 keep going. */
5945 {
5947 /* Parse the brace-enclosed initializer list. */
5950 }
5951 /* If that worked, we're definitely looking at a
5952 compound-literal expression. */
5954 {
5955 /* Warn the user that a compound literal is not
5956 allowed in standard C++. */
5959 /* For simplicity, we disallow compound literals in
5960 constant-expressions. We could
5961 allow compound literals of integer type, whose
5962 initializer was a constant, in constant
5963 expressions. Permitting that usage, as a further
5964 extension, would not change the meaning of any
5965 currently accepted programs. (Of course, as
5966 compound literals are not part of ISO C++, the
5967 standard has nothing to say.) */
5969 NIC_NCC))
5970 {
5973 }
5974 /* Form the representation of the compound-literal. */
5975 postfix_expression
5977 tf_warning_or_error);
5979 }
5980 }
5982 /* It must be a primary-expression. */
5983 postfix_expression
5986 decltype_p,
5988 }
5990 }
5992 /* Note that we don't need to worry about calling build_cplus_new on a
5993 class-valued CALL_EXPR in decltype when it isn't the end of the
5994 postfix-expression; unary_complex_lvalue will take care of that for
5995 all these cases. */
5997 /* Keep looping until the postfix-expression is complete. */
5999 {
6003 /* It is not a Koenig lookup function call. */
6004 postfix_expression
6007 /* Peek at the next token. */
6011 {
6014 {
6016 "two consecutive %<[%> shall "
6019 }
6020 postfix_expression
6022 postfix_expression,
6024 decltype_p);
6030 /* postfix-expression ( expression-list [opt] ) */
6031 {
6041 is_builtin_constant_p
6044 {
6045 /* The whole point of __builtin_constant_p is to allow
6046 non-constant expressions to appear as arguments. */
6047 saved_integral_constant_expression_p
6049 saved_non_integral_constant_expression_p
6052 }
6053 args = (cp_parser_parenthesized_expression_list
6058 {
6059 parser->integral_constant_expression_p
6061 parser->non_integral_constant_expression_p
6063 }
6066 {
6069 }
6071 /* Function calls are not permitted in
6072 constant-expressions. */
6075 NIC_FUNC_CALL))
6076 {
6080 }
6085 {
6087 {
6089 {
6092 postfix_expression
6094 complain);
6095 }
6096 else
6097 postfix_expression
6099 }
6100 /* We do not perform argument-dependent lookup if
6101 normal lookup finds a non-function, in accordance
6102 with the expected resolution of DR 218. */
6105 {
6109 /* Do not do argument dependent lookup if regular
6110 lookup finds a member function or a block-scope
6111 function declaration. [basic.lookup.argdep]/3 */
6114 {
6117 postfix_expression
6119 complain);
6120 }
6121 }
6122 }
6125 {
6135 {
6136 postfix_expression
6140 }
6143 {
6144 postfix_expression
6145 = (build_new_method_call
6151 complain));
6152 }
6153 else
6154 postfix_expression
6158 complain);
6159 }
6163 postfix_expression = (build_offset_ref_call_from_tree
6165 complain));
6167 /* A call to a static class member, or a namespace-scope
6168 function. */
6169 postfix_expression
6172 koenig_p,
6173 complain);
6174 else
6175 /* All other function calls. */
6176 postfix_expression
6179 koenig_p,
6180 complain);
6182 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6186 }
6191 /* postfix-expression . template [opt] id-expression
6192 postfix-expression . pseudo-destructor-name
6193 postfix-expression -> template [opt] id-expression
6194 postfix-expression -> pseudo-destructor-name */
6196 /* Consume the `.' or `->' operator. */
6199 postfix_expression
6201 postfix_expression,
6208 /* postfix-expression ++ */
6209 /* Consume the `++' token. */
6211 /* Generate a representation for the complete expression. */
6212 postfix_expression
6214 POSTINCREMENT_EXPR);
6215 /* Increments may not appear in constant-expressions. */
6223 /* postfix-expression -- */
6224 /* Consume the `--' token. */
6226 /* Generate a representation for the complete expression. */
6227 postfix_expression
6229 POSTDECREMENT_EXPR);
6230 /* Decrements may not appear in constant-expressions. */
6242 else
6244 }
6245 }
6247 /* We should never get here. */
6250 }
6252 /* This function parses Cilk Plus array notations. If a normal array expr. is
6253 parsed then the array index is passed back to the caller through *INIT_INDEX
6254 and the function returns a NULL_TREE. If array notation expr. is parsed,
6255 then *INIT_INDEX is ignored by the caller and the function returns
6256 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6257 error_mark_node. */
6259 static tree
6261 tree array_value)
6262 {
6266 {
6269 }
6278 {
6281 }
6283 {
6284 /* Consume the ':'. */
6287 /* If we are here, then we have a case like this A[:]. */
6289 {
6293 }
6297 }
6298 else
6299 {
6300 /* If we are here, then there are three valid possibilities:
6301 1. ARRAY [ EXP ]
6302 2. ARRAY [ EXP : EXP ]
6303 3. ARRAY [ EXP : EXP : EXP ] */
6307 {
6308 /* This indicates that we have a normal array expression. */
6311 }
6313 /* Consume the ':'. */
6317 {
6320 }
6321 }
6326 {
6330 }
6336 }
6338 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6339 by cp_parser_builtin_offsetof. We're looking for
6341 postfix-expression [ expression ]
6342 postfix-expression [ braced-init-list ] (C++11)
6344 FOR_OFFSETOF is set if we're being called in that context, which
6345 changes how we deal with integer constant expressions. */
6347 static tree
6349 tree postfix_expression,
6352 {
6357 /* Consume the `[' token. */
6363 /* Parse the index expression. */
6364 /* ??? For offsetof, there is a question of what to allow here. If
6365 offsetof is not being used in an integral constant expression context,
6366 then we *could* get the right answer by computing the value at runtime.
6367 If we are in an integral constant expression context, then we might
6368 could accept any constant expression; hard to say without analysis.
6369 Rather than open the barn door too wide right away, allow only integer
6370 constant expressions here. */
6373 else
6374 {
6376 {
6383 {
6385 "braced list index is not allowed with array "
6389 }
6390 }
6392 {
6393 /* Here are have these two options:
6394 ARRAY[EXP : EXP] - Array notation expr with default
6395 stride of 1.
6396 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6397 stride. */
6399 postfix_expression);
6402 }
6403 else
6405 }
6409 /* Look for the closing `]'. */
6412 /* Build the ARRAY_REF. */
6416 /* When not doing offsetof, array references are not permitted in
6417 constant-expressions. */
6423 }
6425 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6426 by cp_parser_builtin_offsetof. We're looking for
6428 postfix-expression . template [opt] id-expression
6429 postfix-expression . pseudo-destructor-name
6430 postfix-expression -> template [opt] id-expression
6431 postfix-expression -> pseudo-destructor-name
6433 FOR_OFFSETOF is set if we're being called in that context. That sorta
6434 limits what of the above we'll actually accept, but nevermind.
6435 TOKEN_TYPE is the "." or "->" token, which will already have been
6436 removed from the stream. */
6438 static tree
6441 tree postfix_expression,
6443 location_t location)
6444 {
6445 tree name;
6450 /* If this is a `->' operator, dereference the pointer. */
6453 tf_warning_or_error);
6454 /* Check to see whether or not the expression is type-dependent. */
6456 /* The identifier following the `->' or `.' is not qualified. */
6462 /* Enter the scope corresponding to the type of the object
6463 given by the POSTFIX_EXPRESSION. */
6465 {
6467 /* According to the standard, no expression should ever have
6468 reference type. Unfortunately, we do not currently match
6469 the standard in this respect in that our internal representation
6470 of an expression may have reference type even when the standard
6471 says it does not. Therefore, we have to manually obtain the
6472 underlying type here. */
6474 /* The type of the POSTFIX_EXPRESSION must be complete. */
6476 {
6478 postfix_expression);
6480 }
6481 /* Unlike the object expression in other contexts, *this is not
6482 required to be of complete type for purposes of class member
6483 access (5.2.5) outside the member function body. */
6487 /* Let the name lookup machinery know that we are processing a
6488 class member access expression. */
6490 /* If something went wrong, we want to be able to discern that case,
6491 as opposed to the case where there was no SCOPE due to the type
6492 of expression being dependent. */
6495 /* If the SCOPE was erroneous, make the various semantic analysis
6496 functions exit quickly -- and without issuing additional error
6497 messages. */
6500 }
6502 /* Assume this expression is not a pseudo-destructor access. */
6505 /* If the SCOPE is a scalar type, then, if this is a valid program,
6506 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6507 is type dependent, it can be pseudo-destructor-name or something else.
6508 Try to parse it as pseudo-destructor-name first. */
6510 {
6511 tree s;
6512 tree type;
6515 /* Parse the pseudo-destructor-name. */
6524 {
6526 postfix_expression
6529 }
6530 }
6533 {
6534 /* If the SCOPE is not a scalar type, we are looking at an
6535 ordinary class member access expression, rather than a
6536 pseudo-destructor-name. */
6539 /* Parse the id-expression. */
6540 name = (cp_parser_id_expression
6547 /* In general, build a SCOPE_REF if the member name is qualified.
6548 However, if the name was not dependent and has already been
6549 resolved; there is no need to build the SCOPE_REF. For example;
6551 struct X { void f(); };
6552 template <typename T> void f(T* t) { t->X::f(); }
6554 Even though "t" is dependent, "X::f" is not and has been resolved
6555 to a BASELINK; there is no need to include scope information. */
6557 /* But we do need to remember that there was an explicit scope for
6558 virtual function calls. */
6562 /* If the name is a template-id that names a type, we will get a
6563 TYPE_DECL here. That is invalid code. */
6565 {
6568 }
6569 else
6570 {
6572 {
6574 {
6578 }
6579 else
6582 name,
6583 template_p);
6587 }
6589 adjust_result_of_qualified_name_lookup
6591 postfix_expression
6593 template_p,
6594 tf_warning_or_error);
6595 }
6596 }
6598 /* We no longer need to look up names in the scope of the object on
6599 the left-hand side of the `.' or `->' operator. */
6602 /* Outside of offsetof, these operators may not appear in
6603 constant-expressions. */
6605 && (cp_parser_non_integral_constant_expression
6610 }
6612 /* Parse a parenthesized expression-list.
6614 expression-list:
6615 assignment-expression
6616 expression-list, assignment-expression
6618 attribute-list:
6619 expression-list
6620 identifier
6621 identifier, expression-list
6623 CAST_P is true if this expression is the target of a cast.
6625 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6626 argument pack.
6628 Returns a vector of trees. Each element is a representation of an
6629 assignment-expression. NULL is returned if the ( and or ) are
6630 missing. An empty, but allocated, vector is returned on no
6631 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6632 if we are parsing an attribute list for an attribute that wants a
6633 plain identifier argument, normal_attr for an attribute that wants
6634 an expression, or non_attr if we aren't parsing an attribute list. If
6635 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6636 not all of the expressions in the list were constant. */
6644 {
6650 /* Assume all the expressions will be constant. */
6659 /* Within a parenthesized expression, a `>' token is always
6660 the greater-than operator. */
6661 saved_greater_than_is_operator_p
6665 /* Consume expressions until there are no more. */
6668 {
6669 tree expr;
6671 /* At the beginning of attribute lists, check to see if the
6672 next token is an identifier. */
6675 {
6678 /* Consume the identifier. */
6680 /* Save the identifier. */
6682 }
6683 else
6684 {
6687 /* Parse the next assignment-expression. */
6689 {
6690 /* A braced-init-list. */
6696 }
6698 {
6699 expr = (cp_parser_constant_expression
6704 }
6705 else
6711 /* If we have an ellipsis, then this is an expression
6712 expansion. */
6715 {
6716 /* Consume the `...'. */
6719 /* Build the argument pack. */
6721 }
6723 /* Add it to the list. We add error_mark_node
6724 expressions to the list, so that we can still tell if
6725 the correct form for a parenthesized expression-list
6726 is found. That gives better errors. */
6731 }
6733 /* After the first item, attribute lists look the same as
6734 expression lists. */
6737 get_comma:;
6738 /* If the next token isn't a `,', then we are done. */
6742 /* Otherwise, consume the `,' and keep going. */
6744 }
6747 {
6750 skip_comma:;
6751 /* We try and resync to an unnested comma, as that will give the
6752 user better diagnostics. */
6760 {
6761 parser->greater_than_is_operator_p
6764 }
6765 }
6767 parser->greater_than_is_operator_p
6774 }
6776 /* Parse a pseudo-destructor-name.
6778 pseudo-destructor-name:
6779 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6780 :: [opt] nested-name-specifier template template-id :: ~ type-name
6781 :: [opt] nested-name-specifier [opt] ~ type-name
6783 If either of the first two productions is used, sets *SCOPE to the
6784 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6785 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6786 or ERROR_MARK_NODE if the parse fails. */
6788 static void
6790 tree object,
6793 {
6796 /* Handle ~auto. */
6800 {
6803 "%<~auto%> only available with "
6810 }
6812 /* Assume that things will not work out. */
6815 /* Look for the optional `::' operator. */
6817 /* Look for the optional nested-name-specifier. */
6818 nested_name_specifier_p
6825 /* Now, if we saw a nested-name-specifier, we might be doing the
6826 second production. */
6829 {
6830 /* Consume the `template' keyword. */
6832 /* Parse the template-id. */
6836 class_type,
6838 /* Look for the `::' token. */
6840 }
6841 /* If the next token is not a `~', then there might be some
6842 additional qualification. */
6844 {
6845 /* At this point, we're looking for "type-name :: ~". The type-name
6846 must not be a class-name, since this is a pseudo-destructor. So,
6847 it must be either an enum-name, or a typedef-name -- both of which
6848 are just identifiers. So, we peek ahead to check that the "::"
6849 and "~" tokens are present; if they are not, then we can avoid
6850 calling type_name. */
6854 {
6857 }
6859 /* Look for the type-name. */
6864 /* Look for the `::' token. */
6866 }
6867 else
6870 /* Look for the `~'. */
6873 /* Once we see the ~, this has to be a pseudo-destructor. */
6877 /* Look for the type-name again. We are not responsible for
6878 checking that it matches the first type-name. */
6880 }
6882 /* Parse a unary-expression.
6884 unary-expression:
6885 postfix-expression
6886 ++ cast-expression
6887 -- cast-expression
6888 unary-operator cast-expression
6889 sizeof unary-expression
6890 sizeof ( type-id )
6891 alignof ( type-id ) [C++0x]
6892 new-expression
6893 delete-expression
6895 GNU Extensions:
6897 unary-expression:
6898 __extension__ cast-expression
6899 __alignof__ unary-expression
6900 __alignof__ ( type-id )
6901 alignof unary-expression [C++0x]
6902 __real__ cast-expression
6903 __imag__ cast-expression
6904 && identifier
6905 sizeof ( type-id ) { initializer-list , [opt] }
6906 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6907 __alignof__ ( type-id ) { initializer-list , [opt] }
6909 ADDRESS_P is true iff the unary-expression is appearing as the
6910 operand of the `&' operator. CAST_P is true if this expression is
6911 the target of a cast.
6913 Returns a representation of the expression. */
6915 static tree
6918 {
6922 /* Peek at the next token. */
6924 /* Some keywords give away the kind of expression. */
6926 {
6930 {
6933 {
6936 location_t first_loc;
6939 /* Consume the token. */
6942 /* Parse the operand. */
6947 else
6948 {
6949 /* ISO C++ defines alignof only with types, not with
6950 expressions. So pedwarn if alignof is used with a non-
6951 type expression. However, __alignof__ is ok. */
6954 "ISO C++ does not allow %<alignof%> "
6958 }
6959 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6960 SIZEOF_EXPR with the original operand. */
6962 {
6964 {
6966 {
6969 error_mark_node));
6971 }
6972 else
6976 }
6978 }
6980 }
6989 {
6990 /* The saved value of the PEDANTIC flag. */
6992 tree expr;
6994 /* Save away the PEDANTIC flag. */
6996 /* Parse the cast-expression. */
6998 /* Restore the PEDANTIC flag. */
7002 }
7006 {
7007 tree expression;
7009 /* Consume the `__real__' or `__imag__' token. */
7011 /* Parse the cast-expression. */
7013 /* Create the complete representation. */
7017 expression,
7018 tf_warning_or_error);
7019 }
7027 {
7028 tree expr;
7038 parser->type_definition_forbidden_message
7041 saved_integral_constant_expression_p
7043 saved_non_integral_constant_expression_p
7047 saved_greater_than_is_operator_p
7057 parser->greater_than_is_operator_p
7060 parser->integral_constant_expression_p
7062 parser->non_integral_constant_expression_p
7069 }
7073 }
7074 }
7076 /* Look for the `:: new' and `:: delete', which also signal the
7077 beginning of a new-expression, or delete-expression,
7078 respectively. If the next token is `::', then it might be one of
7079 these. */
7081 {
7084 /* See if the token after the `::' is one of the keywords in
7085 which we're interested. */
7087 /* If it's `new', we have a new-expression. */
7090 /* Similarly, for `delete'. */
7093 }
7095 /* Look for a unary operator. */
7097 /* The `++' and `--' operators can be handled similarly, even though
7098 they are not technically unary-operators in the grammar. */
7100 {
7105 /* Handle the GNU address-of-label extension. */
7108 {
7109 tree identifier;
7110 tree expression;
7113 /* Consume the '&&' token. */
7115 /* Look for the identifier. */
7117 /* Create an expression representing the address. */
7120 NIC_ADDR_LABEL))
7123 }
7124 }
7126 {
7127 tree cast_expression;
7133 /* Consume the operator token. */
7135 /* Parse the cast-expression. */
7136 cast_expression
7141 pidk);
7142 /* Now, build an appropriate representation. */
7144 {
7148 RO_UNARY_STAR,
7149 complain);
7154 /* Fall through. */
7157 cast_expression,
7158 complain);
7165 /* Fall through. */
7175 }
7179 non_constant_p))
7183 }
7187 decltype_p,
7188 pidk);
7189 }
7194 {
7197 }
7199 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7200 unary-operator, the corresponding tree code is returned. */
7202 static enum tree_code
7204 {
7206 {
7227 }
7228 }
7230 /* Parse a new-expression.
7232 new-expression:
7233 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7234 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7236 Returns a representation of the expression. */
7238 static tree
7240 {
7243 tree type;
7246 tree ret;
7248 /* Look for the optional `::' operator. */
7249 global_scope_p
7253 /* Look for the `new' operator. */
7255 /* There's no easy way to tell a new-placement from the
7256 `( type-id )' construct. */
7258 /* Look for a new-placement. */
7260 /* If that didn't work out, there's no new-placement. */
7262 {
7266 }
7268 /* If the next token is a `(', then we have a parenthesized
7269 type-id. */
7271 {
7275 /* Consume the `('. */
7278 /* Parse the type-id. */
7279 parser->type_definition_forbidden_message
7284 /* Look for the closing `)'. */
7287 /* There should not be a direct-new-declarator in this production,
7288 but GCC used to allowed this, so we check and emit a sensible error
7289 message for this case. */
7291 {
7297 }
7298 }
7299 /* Otherwise, there must be a new-type-id. */
7300 else
7303 /* If the next token is a `(' or '{', then we have a new-initializer. */
7307 else
7310 /* A new-expression may not appear in an integral constant
7311 expression. */
7314 else
7315 {
7316 /* Create a representation of the new-expression. */
7318 tf_warning_or_error);
7319 }
7327 }
7329 /* Parse a new-placement.
7331 new-placement:
7332 ( expression-list )
7334 Returns the same representation as for an expression-list. */
7338 {
7341 /* Parse the expression-list. */
7342 expression_list = (cp_parser_parenthesized_expression_list
7348 }
7350 /* Parse a new-type-id.
7352 new-type-id:
7353 type-specifier-seq new-declarator [opt]
7355 Returns the TYPE allocated. If the new-type-id indicates an array
7356 type, *NELTS is set to the number of elements in the last array
7357 bound; the TYPE will not include the last array bound. */
7359 static tree
7361 {
7362 cp_decl_specifier_seq type_specifier_seq;
7368 /* The type-specifier sequence must not contain type definitions.
7369 (It cannot contain declarations of new types either, but if they
7370 are not definitions we will catch that because they are not
7371 complete.) */
7373 parser->type_definition_forbidden_message
7375 /* Parse the type-specifier-seq. */
7379 /* Restore the old message. */
7385 /* Parse the new-declarator. */
7388 /* Determine the number of elements in the last array dimension, if
7389 any. */
7391 /* Skip down to the last array dimension. */
7396 {
7399 }
7404 {
7407 }
7410 {
7417 else
7419 }
7422 }
7424 /* Parse an (optional) new-declarator.
7426 new-declarator:
7427 ptr-operator new-declarator [opt]
7428 direct-new-declarator
7430 Returns the declarator. */
7434 {
7437 cp_cv_quals cv_quals;
7439 /* We don't know if there's a ptr-operator next, or not. */
7441 /* Look for a ptr-operator. */
7443 /* If that worked, look for more new-declarators. */
7445 {
7448 /* Parse another optional declarator. */
7451 declarator = cp_parser_make_indirect_declarator
7455 }
7457 /* If the next token is a `[', there is a direct-new-declarator. */
7462 }
7464 /* Parse a direct-new-declarator.
7466 direct-new-declarator:
7467 [ expression ]
7468 direct-new-declarator [constant-expression]
7470 */
7474 {
7478 {
7479 tree expression;
7482 /* Look for the opening `['. */
7487 /* The standard requires that the expression have integral
7488 type. DR 74 adds enumeration types. We believe that the
7489 real intent is that these expressions be handled like the
7490 expression in a `switch' condition, which also allows
7491 classes with a single conversion to integral or
7492 enumeration type. */
7494 {
7495 expression
7497 expression,
7500 {
7502 "expression in new-declarator must have integral "
7505 }
7506 }
7508 /* Look for the closing `]'. */
7511 /* Add this bound to the declarator. */
7514 /* If the next token is not a `[', then there are no more
7515 bounds. */
7518 }
7521 }
7523 /* Parse a new-initializer.
7525 new-initializer:
7526 ( expression-list [opt] )
7527 braced-init-list
7529 Returns a representation of the expression-list. */
7533 {
7537 {
7538 tree t;
7545 }
7546 else
7547 expression_list = (cp_parser_parenthesized_expression_list
7553 }
7555 /* Parse a delete-expression.
7557 delete-expression:
7558 :: [opt] delete cast-expression
7559 :: [opt] delete [ ] cast-expression
7561 Returns a representation of the expression. */
7563 static tree
7565 {
7568 tree expression;
7570 /* Look for the optional `::' operator. */
7571 global_scope_p
7575 /* Look for the `delete' keyword. */
7577 /* See if the array syntax is in use. */
7579 {
7580 /* Consume the `[' token. */
7582 /* Look for the `]' token. */
7584 /* Remember that this is the `[]' construct. */
7586 }
7587 else
7590 /* Parse the cast-expression. */
7593 /* A delete-expression may not appear in an integral constant
7594 expression. */
7599 tf_warning_or_error);
7600 }
7602 /* Returns true if TOKEN may start a cast-expression and false
7603 otherwise. */
7605 static bool
7607 {
7610 {
7651 /* In ((type ()) () the last () isn't a valid cast-expression,
7652 so the whole must be parsed as postfix-expression. */
7656 /* '[' may start a primary-expression in obj-c++. */
7662 }
7663 }
7665 /* Parse a cast-expression.
7667 cast-expression:
7668 unary-expression
7669 ( type-id ) cast-expression
7671 ADDRESS_P is true iff the unary-expression is appearing as the
7672 operand of the `&' operator. CAST_P is true if this expression is
7673 the target of a cast.
7675 Returns a representation of the expression. */
7677 static tree
7680 {
7681 /* If it's a `(', then we might be looking at a cast. */
7683 {
7689 /* There's no way to know yet whether or not this is a cast.
7690 For example, `(int (3))' is a unary-expression, while `(int)
7691 3' is a cast. So, we resort to parsing tentatively. */
7693 /* Types may not be defined in a cast. */
7695 parser->type_definition_forbidden_message
7697 /* Consume the `('. */
7699 /* A very tricky bit is that `(struct S) { 3 }' is a
7700 compound-literal (which we permit in C++ as an extension).
7701 But, that construct is not a cast-expression -- it is a
7702 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7703 is legal; if the compound-literal were a cast-expression,
7704 you'd need an extra set of parentheses.) But, if we parse
7705 the type-id, and it happens to be a class-specifier, then we
7706 will commit to the parse at that point, because we cannot
7707 undo the action that is done when creating a new class. So,
7708 then we cannot back up and do a postfix-expression.
7709 Another tricky case is the following (c++/29234):
7711 struct S { void operator () (); };
7713 void foo ()
7714 {
7715 ( S()() );
7716 }
7718 As a type-id we parse the parenthesized S()() as a function
7719 returning a function, groktypename complains and we cannot
7720 back up in this case either.
7722 Therefore, we scan ahead to the closing `)', and check to see
7723 if the tokens after the `)' can start a cast-expression. Otherwise
7724 we are dealing with an unary-expression, a postfix-expression
7725 or something else.
7727 Save tokens so that we can put them back. */
7730 /* We may be looking at a cast-expression. */
7731 cast_expression_p
7736 /* Roll back the tokens we skipped. */
7738 /* If we aren't looking at a cast-expression, simulate an error so
7739 that the call to cp_parser_parse_definitely below will fail. */
7742 else
7743 {
7746 /* Look for the type-id. */
7748 /* Look for the closing `)'. */
7751 }
7753 /* Restore the saved message. */
7756 /* At this point this can only be either a cast or a
7757 parenthesized ctor such as `(T ())' that looks like a cast to
7758 function returning T. */
7760 {
7766 pidk);
7768 /* Warn about old-style casts, if so requested. */
7775 /* Only type conversions to integral or enumeration types
7776 can be used in constant-expressions. */
7779 NIC_CAST))
7782 /* Perform the cast. */
7785 }
7786 else
7788 }
7790 /* If we get here, then it's not a cast, so it must be a
7791 unary-expression. */
7794 }
7796 /* Parse a binary expression of the general form:
7798 pm-expression:
7799 cast-expression
7800 pm-expression .* cast-expression
7801 pm-expression ->* cast-expression
7803 multiplicative-expression:
7804 pm-expression
7805 multiplicative-expression * pm-expression
7806 multiplicative-expression / pm-expression
7807 multiplicative-expression % pm-expression
7809 additive-expression:
7810 multiplicative-expression
7811 additive-expression + multiplicative-expression
7812 additive-expression - multiplicative-expression
7814 shift-expression:
7815 additive-expression
7816 shift-expression << additive-expression
7817 shift-expression >> additive-expression
7819 relational-expression:
7820 shift-expression
7821 relational-expression < shift-expression
7822 relational-expression > shift-expression
7823 relational-expression <= shift-expression
7824 relational-expression >= shift-expression
7826 GNU Extension:
7828 relational-expression:
7829 relational-expression <? shift-expression
7830 relational-expression >? shift-expression
7832 equality-expression:
7833 relational-expression
7834 equality-expression == relational-expression
7835 equality-expression != relational-expression
7837 and-expression:
7838 equality-expression
7839 and-expression & equality-expression
7841 exclusive-or-expression:
7842 and-expression
7843 exclusive-or-expression ^ and-expression
7845 inclusive-or-expression:
7846 exclusive-or-expression
7847 inclusive-or-expression | exclusive-or-expression
7849 logical-and-expression:
7850 inclusive-or-expression
7851 logical-and-expression && inclusive-or-expression
7853 logical-or-expression:
7854 logical-and-expression
7855 logical-or-expression || logical-and-expression
7857 All these are implemented with a single function like:
7859 binary-expression:
7860 simple-cast-expression
7861 binary-expression <token> binary-expression
7863 CAST_P is true if this expression is the target of a cast.
7865 The binops_by_token map is used to get the tree codes for each <token> type.
7866 binary-expressions are associated according to a precedence table. */
7868 #define TOKEN_PRECEDENCE(token) \
7869 (((token->type == CPP_GREATER \
7870 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7871 && !parser->greater_than_is_operator_p) \
7872 ? PREC_NOT_OPERATOR \
7873 : binops_by_token[token->type].prec)
7875 static tree
7881 {
7882 cp_parser_expression_stack stack;
7884 cp_parser_expression_stack_entry current;
7885 tree rhs;
7889 tree overload;
7891 /* Parse the first expression. */
7901 {
7902 /* Get an operator token. */
7908 {
7910 "%<>>%> operator is treated"
7914 }
7918 /* Popping an entry off the stack means we completed a subexpression:
7919 - either we found a token which is not an operator (`>' where it is not
7920 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7921 will happen repeatedly;
7922 - or, we found an operator which has lower priority. This is the case
7923 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7924 parsing `3 * 4'. */
7926 {
7929 else
7931 }
7933 get_rhs:
7937 /* We used the operator token. */
7940 /* For "false && x" or "true || x", x will never be executed;
7941 disable warnings while evaluating it. */
7947 /* Extract another operand. It may be the RHS of this expression
7948 or the LHS of a new, higher priority expression. */
7952 /* Get another operator token. Look up its precedence to avoid
7953 building a useless (immediately popped) stack entry for common
7954 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7958 {
7959 /* ... and prepare to parse the RHS of the new, higher priority
7960 expression. Since precedence levels on the stack are
7961 monotonically increasing, we do not have to care about
7962 stack overflows. */
7971 pop:
7973 /* If the stack is not empty, we have parsed into LHS the right side
7974 (`4' in the example above) of an expression we had suspended.
7975 We can use the information on the stack to recover the LHS (`3')
7976 from the stack together with the tree code (`MULT_EXPR'), and
7977 the precedence of the higher level subexpression
7978 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7979 which will be used to actually build the additive expression. */
7984 }
7986 /* Undo the disabling of warnings done above. */
7993 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7994 ERROR_MARK for everything that is not a binary expression.
7995 This makes warn_about_parentheses miss some warnings that
7996 involve unary operators. For unary expressions we should
7997 pass the correct tree_code unless the unary expression was
7998 surrounded by parentheses.
7999 */
8005 == tcc_comparison
8008 else
8017 /* If the binary operator required the use of an overloaded operator,
8018 then this expression cannot be an integral constant-expression.
8019 An overloaded operator can be used even if both operands are
8020 otherwise permissible in an integral constant-expression if at
8021 least one of the operands is of enumeration type. */
8025 NIC_OVERLOADED))
8027 }
8030 }
8032 static tree
8037 {
8040 }
8042 /* Parse the `? expression : assignment-expression' part of a
8043 conditional-expression. The LOGICAL_OR_EXPR is the
8044 logical-or-expression that started the conditional-expression.
8045 Returns a representation of the entire conditional-expression.
8047 This routine is used by cp_parser_assignment_expression.
8049 ? expression : assignment-expression
8051 GNU Extensions:
8053 ? : assignment-expression */
8055 static tree
8057 {
8058 tree expr;
8059 tree assignment_expr;
8063 /* Consume the `?' token. */
8068 {
8071 /* Implicit true clause. */
8075 }
8076 else
8077 {
8080 /* Parse the expression. */
8083 c_inhibit_evaluation_warnings +=
8087 }
8089 /* The next token should be a `:'. */
8091 /* Parse the assignment-expression. */
8095 /* Build the conditional-expression. */
8097 expr,
8098 assignment_expr,
8099 tf_warning_or_error);
8100 }
8102 /* A helpfer function to check if the given expression (EXPR) is of POD type.
8103 Note that if the expression's type is NULL (e.g. when its type depends on
8104 template parameters), we return false. */
8106 static bool
8108 {
8110 }
8112 /* Parse an assignment-expression.
8114 assignment-expression:
8115 conditional-expression
8116 logical-or-expression assignment-operator assignment_expression
8117 throw-expression
8119 CAST_P is true if this expression is the target of a cast.
8120 DECLTYPE_P is true if this expression is the operand of decltype.
8122 Returns a representation for the expression. */
8124 static tree
8127 {
8128 tree expr;
8130 /* If the next token is the `throw' keyword, then we're looking at
8131 a throw-expression. */
8134 /* Otherwise, it must be that we are looking at a
8135 logical-or-expression. */
8136 else
8137 {
8138 /* Parse the binary expressions (logical-or-expression). */
8140 decltype_p,
8142 /* If the next token is a `?' then we're actually looking at a
8143 conditional-expression. */
8146 else
8147 {
8150 /* If it's an assignment-operator, we're using the second
8151 production. */
8152 enum tree_code assignment_operator
8155 {
8157 location_t saved_input_location;
8159 /* Parse the right-hand side of the assignment. */
8165 /* An assignment may not appear in a
8166 constant-expression. */
8168 NIC_ASSIGNMENT))
8171 /* Check for and warn about self-assignment if -Wself-assign is
8172 enabled and the assignment operator is "=".
8173 Checking for non-POD self-assignment will be performed only
8174 when -Wself-assign-non-pod is enabled. */
8180 /* Build the assignment expression. Its default
8181 location is the location of the '=' token. */
8185 assignment_operator,
8186 rhs,
8189 }
8190 }
8191 }
8194 }
8196 static tree
8199 {
8202 }
8204 /* Parse an (optional) assignment-operator.
8206 assignment-operator: one of
8207 = *= /= %= += -= >>= <<= &= ^= |=
8209 GNU Extension:
8211 assignment-operator: one of
8212 <?= >?=
8214 If the next token is an assignment operator, the corresponding tree
8215 code is returned, and the token is consumed. For example, for
8216 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8217 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8218 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8219 operator, ERROR_MARK is returned. */
8221 static enum tree_code
8223 {
8227 /* Peek at the next token. */
8231 {
8277 /* Nothing else is an assignment operator. */
8279 }
8281 /* If it was an assignment operator, consume it. */
8286 }
8288 /* Parse an expression.
8290 expression:
8291 assignment-expression
8292 expression , assignment-expression
8294 CAST_P is true if this expression is the target of a cast.
8295 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8296 except possibly parenthesized or on the RHS of a comma (N3276).
8298 Returns a representation of the expression. */
8300 static tree
8303 {
8308 {
8309 tree assignment_expression;
8311 /* Parse the next assignment-expression. */
8312 assignment_expression
8315 /* We don't create a temporary for a call that is the immediate operand
8316 of decltype or on the RHS of a comma. But when we see a comma, we
8317 need to create a temporary for a call on the LHS. */
8322 assignment_expression
8326 /* If this is the first assignment-expression, we can just
8327 save it away. */
8330 else
8332 assignment_expression,
8334 /* If the next token is not a comma, then we are done with the
8335 expression. */
8338 /* Consume the `,'. */
8341 /* A comma operator cannot appear in a constant-expression. */
8344 }
8347 }
8351 {
8353 }
8355 /* Parse a constant-expression.
8357 constant-expression:
8358 conditional-expression
8360 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8361 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8362 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8363 is false, NON_CONSTANT_P should be NULL. */
8365 static tree
8369 {
8373 tree expression;
8375 /* It might seem that we could simply parse the
8376 conditional-expression, and then check to see if it were
8377 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8378 one that the compiler can figure out is constant, possibly after
8379 doing some simplifications or optimizations. The standard has a
8380 precise definition of constant-expression, and we must honor
8381 that, even though it is somewhat more restrictive.
8383 For example:
8385 int i[(2, 3)];
8387 is not a legal declaration, because `(2, 3)' is not a
8388 constant-expression. The `,' operator is forbidden in a
8389 constant-expression. However, GCC's constant-folding machinery
8390 will fold this operation to an INTEGER_CST for `3'. */
8392 /* Save the old settings. */
8394 saved_allow_non_integral_constant_expression_p
8397 /* We are now parsing a constant-expression. */
8399 parser->allow_non_integral_constant_expression_p
8402 /* Although the grammar says "conditional-expression", we parse an
8403 "assignment-expression", which also permits "throw-expression"
8404 and the use of assignment operators. In the case that
8405 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8406 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8407 actually essential that we look for an assignment-expression.
8408 For example, cp_parser_initializer_clauses uses this function to
8409 determine whether a particular assignment-expression is in fact
8410 constant. */
8412 /* Restore the old settings. */
8413 parser->integral_constant_expression_p
8415 parser->allow_non_integral_constant_expression_p
8418 {
8419 /* Require an rvalue constant expression here; that's what our
8420 callers expect. Reference constant expressions are handled
8421 separately in e.g. cp_parser_template_argument. */
8426 }
8429 parser->non_integral_constant_expression_p
8433 }
8435 /* Parse __builtin_offsetof.
8437 offsetof-expression:
8438 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8440 offsetof-member-designator:
8441 id-expression
8442 | offsetof-member-designator "." id-expression
8443 | offsetof-member-designator "[" expression "]"
8444 | offsetof-member-designator "->" id-expression */
8446 static tree
8448 {
8451 cp_id_kind dummy;
8454 /* We're about to accept non-integral-constant things, but will
8455 definitely yield an integral constant expression. Save and
8456 restore these values around our local parsing. */
8460 /* Consume the "__builtin_offsetof" token. */
8462 /* Consume the opening `('. */
8464 /* Parse the type-id. */
8466 /* Look for the `,'. */
8470 /* Build the (type *)null that begins the traditional offsetof macro. */
8472 tf_warning_or_error);
8474 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8478 {
8481 {
8483 /* offsetof-member-designator "[" expression "]" */
8489 /* offsetof-member-designator "->" identifier */
8492 /* FALLTHRU */
8495 /* offsetof-member-designator "." identifier */
8503 /* Consume the ")" token. */
8508 /* Error. We know the following require will fail, but
8509 that gives the proper error message. */
8514 }
8515 }
8517 success:
8518 /* If we're processing a template, we can't finish the semantics yet.
8519 Otherwise we can fold the entire expression now. */
8522 else
8525 failure:
8530 }
8532 /* Parse a trait expression.
8534 Returns a representation of the expression, the underlying type
8535 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8537 static tree
8539 {
8540 cp_trait_kind kind;
8543 cp_decl_specifier_seq decl_specs;
8546 {
8623 }
8625 /* Consume the token. */
8635 /* Build a trivial decl-specifier-seq. */
8639 /* Call grokdeclarator to figure out what type this is. */
8644 {
8652 /* Build a trivial decl-specifier-seq. */
8656 /* Call grokdeclarator to figure out what type this is. */
8659 }
8663 /* Complete the trait expression, which may mean either processing
8664 the trait expr now or saving it for template instantiation. */
8666 {
8675 }
8676 }
8678 /* Lambdas that appear in variable initializer or default argument scope
8679 get that in their mangling, so we need to record it. We might as well
8680 use the count for function and namespace scopes as well. */
8684 {
8685 tree t;
8690 static void
8692 {
8693 tree_int ti;
8695 /* Once we're inside a function, we ignore other scopes and just push
8696 the function again so that popping works properly. */
8703 {
8704 /* Don't reset the count if we're still in the same function. */
8707 }
8708 }
8710 static void
8712 {
8715 }
8717 static void
8719 {
8722 {
8725 }
8727 }
8729 /* Parse a lambda expression.
8731 lambda-expression:
8732 lambda-introducer lambda-declarator [opt] compound-statement
8734 Returns a representation of the expression. */
8736 static tree
8738 {
8740 tree type;
8747 {
8751 }
8753 /* We may be in the middle of deferred access check. Disable
8754 it now. */
8765 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8768 /* Now that we've started the type, add the capture fields for any
8769 explicit captures. */
8772 {
8773 /* Inside the class, surrounding template-parameter-lists do not apply. */
8774 unsigned int saved_num_template_parameter_lists
8778 bool fully_implicit_function_template_p
8782 bool auto_is_implicit_function_template_parm_p
8793 /* By virtue of defining a local class, a lambda expression has access to
8794 the private variables of enclosing classes. */
8801 {
8804 }
8806 /* The capture list was built up in reverse order; fix that now. */
8818 parser->fully_implicit_function_template_p
8822 parser->auto_is_implicit_function_template_parm_p
8824 }
8828 /* This field is only used during parsing of the lambda. */
8831 /* This lambda shouldn't have any proxies left at this point. */
8833 /* And now that we're done, push proxies for an enclosing lambda. */
8838 else
8840 }
8842 /* Parse the beginning of a lambda expression.
8844 lambda-introducer:
8845 [ lambda-capture [opt] ]
8847 LAMBDA_EXPR is the current representation of the lambda expression. */
8849 static void
8851 {
8852 /* Need commas after the first capture. */
8855 /* Eat the leading `['. */
8858 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8866 {
8869 }
8872 {
8874 tree capture_id;
8875 tree capture_init_expr;
8879 enum capture_kind_type
8880 {
8881 BY_COPY,
8882 BY_REFERENCE
8883 };
8887 {
8890 }
8894 else
8897 /* Possibly capture `this'. */
8899 {
8909 explicit_init_p);
8911 }
8913 /* Remember whether we want to capture as a reference or not. */
8915 {
8918 }
8920 /* Get the identifier. */
8925 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8926 delimiters, but I modified this to stop on unnested ']' as well. It
8927 was already changed to stop on unnested '}', so the
8928 "closing_parenthesis" name is no more misleading with my change. */
8929 {
8935 }
8937 /* Find the initializer for this capture. */
8941 {
8943 /* An explicit initializer exists. */
8946 "lambda capture initializers "
8952 {
8955 }
8956 }
8957 else
8958 {
8961 /* Turn the identifier into an id-expression. */
8962 capture_init_expr
8967 {
8970 }
8974 {
8977 capture_init_expr);
8980 }
8983 {
8986 capture_init_expr);
8989 }
8991 capture_init_expr
8992 = finish_id_expression
8994 capture_init_expr,
9008 {
9011 }
9012 else
9014 }
9018 {
9023 capture_id);
9027 "capture of %qD redundant with by-reference capture "
9029 }
9032 capture_id,
9033 capture_init_expr,
9035 explicit_init_p);
9036 }
9039 }
9041 /* Parse the (optional) middle of a lambda expression.
9043 lambda-declarator:
9044 < template-parameter-list [opt] >
9045 ( parameter-declaration-clause [opt] )
9046 attribute-specifier [opt]
9047 mutable [opt]
9048 exception-specification [opt]
9049 lambda-return-type-clause [opt]
9051 LAMBDA_EXPR is the current representation of the lambda expression. */
9053 static bool
9055 {
9056 /* 5.1.1.4 of the standard says:
9057 If a lambda-expression does not include a lambda-declarator, it is as if
9058 the lambda-declarator were ().
9059 This means an empty parameter list, no attributes, and no exception
9060 specification. */
9066 /* The template-parameter-list is optional, but must begin with
9067 an opening angle if present. */
9069 {
9072 "lambda templates are only available with "
9081 /* We just processed one more parameter list. */
9083 }
9085 /* The parameter-declaration-clause is optional (unless
9086 template-parameter-list was given), but must begin with an
9087 opening parenthesis if present. */
9089 {
9094 /* Parse parameters. */
9097 /* Default arguments shall not be specified in the
9098 parameter-declaration-clause of a lambda-declarator. */
9108 /* Parse optional `mutable' keyword. */
9110 {
9113 }
9115 /* Parse optional exception specification. */
9118 /* Parse optional trailing return type. */
9120 {
9124 }
9126 /* The function parameters must be in scope all the way until after the
9127 trailing-return-type in case of decltype. */
9129 }
9133 /* Create the function call operator.
9135 Messing with declarators like this is no uglier than building up the
9136 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9137 other code. */
9138 {
9139 cp_decl_specifier_seq return_type_specs;
9141 tree fco;
9148 else
9149 /* Maybe we will deduce the return type later. */
9155 sfk_none);
9160 VIRT_SPEC_UNSPECIFIED,
9161 REF_QUAL_NONE,
9162 exception_spec,
9167 declarator,
9168 attributes);
9170 {
9173 /* Give the object parameter a different name. */
9175 }
9177 {
9181 }
9190 }
9191 }
9193 /* Parse the body of a lambda expression, which is simply
9195 compound-statement
9197 but which requires special handling.
9198 LAMBDA_EXPR is the current representation of the lambda expression. */
9200 static void
9202 {
9207 else
9208 /* Still increment function_depth so that we don't GC in the
9209 middle of an expression. */
9211 /* Clear this in case we're in the middle of a default argument. */
9214 /* Finish the function call operator
9215 - class_specifier
9216 + late_parsing_for_member
9217 + function_definition_after_declarator
9218 + ctor_initializer_opt_and_function_body */
9219 {
9221 tree body;
9223 tree compound_stmt;
9224 tree cap;
9226 /* Let the front end know that we are going to be defining this
9227 function. */
9229 NULL_TREE,
9238 /* Push the proxies for any explicit captures. */
9245 /* 5.1.1.4 of the standard says:
9246 If a lambda-expression does not include a trailing-return-type, it
9247 is as if the trailing-return-type denotes the following type:
9248 * if the compound-statement is of the form
9249 { return attribute-specifier [opt] expression ; }
9250 the type of the returned expression after lvalue-to-rvalue
9251 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9252 (_conv.array_ 4.2), and function-to-pointer conversion
9253 (_conv.func_ 4.3);
9254 * otherwise, void. */
9256 /* In a lambda that has neither a lambda-return-type-clause
9257 nor a deducible form, errors should be reported for return statements
9258 in the body. Since we used void as the placeholder return type, parsing
9259 the body as usual will give such desired behavior. */
9263 {
9267 /* Parse tentatively in case there's more after the initial return
9268 statement. */
9279 {
9283 /* Will get error here if type not deduced yet. */
9287 }
9288 }
9291 {
9296 }
9300 out:
9304 /* Finish the function and generate code for it if necessary. */
9307 /* Only expand if the call op is not a template. */
9310 }
9315 else
9317 }
9319 /* Statements [gram.stmt.stmt] */
9321 /* Parse a statement.
9323 statement:
9324 labeled-statement
9325 expression-statement
9326 compound-statement
9327 selection-statement
9328 iteration-statement
9329 jump-statement
9330 declaration-statement
9331 try-block
9333 C++11:
9335 statement:
9336 labeled-statement
9337 attribute-specifier-seq (opt) expression-statement
9338 attribute-specifier-seq (opt) compound-statement
9339 attribute-specifier-seq (opt) selection-statement
9340 attribute-specifier-seq (opt) iteration-statement
9341 attribute-specifier-seq (opt) jump-statement
9342 declaration-statement
9343 attribute-specifier-seq (opt) try-block
9345 TM Extension:
9347 statement:
9348 atomic-statement
9350 IN_COMPOUND is true when the statement is nested inside a
9351 cp_parser_compound_statement; this matters for certain pragmas.
9353 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9354 is a (possibly labeled) if statement which is not enclosed in braces
9355 and has an else clause. This is used to implement -Wparentheses. */
9357 static void
9360 {
9365 restart:
9368 /* There is no statement yet. */
9374 /* In obj-c++, seeing '[[' might be the either the beginning of
9375 c++11 attributes, or a nested objc-message-expression. So
9376 let's parse the c++11 attributes tentatively. */
9380 {
9383 }
9385 /* Peek at the next token. */
9387 /* Remember the location of the first token in the statement. */
9389 /* If this is a keyword, then that will often determine what kind of
9390 statement we have. */
9392 {
9396 {
9399 /* Looks like a labeled-statement with a case label.
9400 Parse the label, and then use tail recursion to parse
9401 the statement. */
9423 /* Objective-C++ exception-handling constructs. */
9437 /* This must be a namespace alias definition. */
9450 /* It might be a keyword like `int' that can start a
9451 declaration-statement. */
9453 }
9454 }
9456 {
9457 /* If the next token is a `:', then we are looking at a
9458 labeled-statement. */
9461 {
9462 /* Looks like a labeled-statement with an ordinary label.
9463 Parse the label, and then use tail recursion to parse
9464 the statement. */
9468 }
9469 }
9470 /* Anything that starts with a `{' must be a compound-statement. */
9473 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9474 a statement all its own. */
9476 {
9477 /* Only certain OpenMP pragmas are attached to statements, and thus
9478 are considered statements themselves. All others are not. In
9479 the context of a compound, accept the pragma as a "statement" and
9480 return so that we can check for a close brace. Otherwise we
9481 require a real statement and must go back and read one. */
9487 }
9489 {
9492 }
9494 /* Everything else must be a declaration-statement or an
9495 expression-statement. Try for the declaration-statement
9496 first, unless we are looking at a `;', in which case we know that
9497 we have an expression-statement. */
9499 {
9501 {
9503 {
9504 /* Attributes should be parsed as part of the the
9505 declaration, so let's un-parse them. */
9508 }
9511 /* Try to parse the declaration-statement. */
9513 /* If that worked, we're done. */
9516 }
9517 /* Look for an expression-statement instead. */
9519 }
9521 /* Set the line number for the statement. */
9525 /* Note that for now, we don't do anything with c++11 statements
9526 parsed at this level. */
9529 OPT_Wattributes,
9531 }
9533 /* Parse the label for a labeled-statement, i.e.
9535 identifier :
9536 case constant-expression :
9537 default :
9539 GNU Extension:
9540 case constant-expression ... constant-expression : statement
9542 When a label is parsed without errors, the label is added to the
9543 parse tree by the finish_* functions, so this function doesn't
9544 have to return the label. */
9546 static void
9548 {
9553 /* The next token should be an identifier. */
9557 {
9560 }
9564 {
9566 {
9570 /* Consume the `case' token. */
9572 /* Parse the constant-expression. */
9575 NULL);
9579 {
9580 /* Consume the `...' token. */
9582 expr_hi =
9585 NULL);
9586 /* We don't need to emit warnings here, as the common code
9587 will do this for us. */
9588 }
9589 else
9594 else
9597 expr);
9598 }
9602 /* Consume the `default' token. */
9607 else
9612 /* Anything else must be an ordinary label. */
9615 }
9617 /* Require the `:' token. */
9620 /* An ordinary label may optionally be followed by attributes.
9621 However, this is only permitted if the attributes are then
9622 followed by a semicolon. This is because, for backward
9623 compatibility, when parsing
9624 lab: __attribute__ ((unused)) int i;
9625 we want the attribute to attach to "i", not "lab". */
9628 {
9629 tree attrs;
9636 ;
9637 else
9639 }
9645 }
9647 /* Parse an expression-statement.
9649 expression-statement:
9650 expression [opt] ;
9652 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9653 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9654 indicates whether this expression-statement is part of an
9655 expression statement. */
9657 static tree
9659 {
9663 /* If the next token is a ';', then there is no expression
9664 statement. */
9666 {
9670 {
9673 }
9674 }
9676 /* Give a helpful message for "A<T>::type t;" and the like. */
9679 {
9686 {
9687 /* A::A a; */
9692 }
9693 }
9695 /* Consume the final `;'. */
9700 /* This is the final expression statement of a statement
9701 expression. */
9707 }
9709 /* Parse a compound-statement.
9711 compound-statement:
9712 { statement-seq [opt] }
9714 GNU extension:
9716 compound-statement:
9717 { label-declaration-seq [opt] statement-seq [opt] }
9719 label-declaration-seq:
9720 label-declaration
9721 label-declaration-seq label-declaration
9723 Returns a tree representing the statement. */
9725 static tree
9728 {
9729 tree compound_stmt;
9731 /* Consume the `{'. */
9738 /* Begin the compound-statement. */
9740 /* If the next keyword is `__label__' we have a label declaration. */
9743 /* Parse an (optional) statement-seq. */
9745 /* Finish the compound-statement. */
9747 /* Consume the `}'. */
9751 }
9753 /* Parse an (optional) statement-seq.
9755 statement-seq:
9756 statement
9757 statement-seq [opt] statement */
9759 static void
9761 {
9762 /* Scan statements until there aren't any more. */
9764 {
9767 /* If we are looking at a `}', then we have run out of
9768 statements; the same is true if we have reached the end
9769 of file, or have stumbled upon a stray '@end'. */
9776 /* If we are in a compound statement and find 'else' then
9777 something went wrong. */
9779 {
9782 else
9783 {
9786 }
9787 }
9789 /* Parse the statement. */
9791 }
9792 }
9794 /* Parse a selection-statement.
9796 selection-statement:
9797 if ( condition ) statement
9798 if ( condition ) statement else statement
9799 switch ( condition ) statement
9801 Returns the new IF_STMT or SWITCH_STMT.
9803 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9804 is a (possibly labeled) if statement which is not enclosed in
9805 braces and has an else clause. This is used to implement
9806 -Wparentheses. */
9808 static tree
9810 {
9817 /* Peek at the next token. */
9820 /* See what kind of keyword it is. */
9823 {
9826 {
9827 tree statement;
9828 tree condition;
9830 /* Look for the `('. */
9832 {
9835 }
9837 /* Begin the selection-statement. */
9840 else
9843 /* Parse the condition. */
9845 /* Look for the `)'. */
9851 {
9855 /* Add the condition. */
9858 /* Parse the then-clause. */
9862 {
9870 }
9871 else
9877 /* If the next token is `else', parse the else-clause. */
9879 RID_ELSE))
9880 {
9881 /* Consume the `else' keyword. */
9884 /* Parse the else-clause. */
9886 {
9887 location_t loc;
9894 }
9895 else
9900 /* If we are currently parsing a then-clause, then
9901 IF_P will not be NULL. We set it to true to
9902 indicate that this if statement has an else clause.
9903 This may trigger the Wparentheses warning below
9904 when we get back up to the parent if statement. */
9907 }
9908 else
9909 {
9910 /* This if statement does not have an else clause. If
9911 NESTED_IF is true, then the then-clause is an if
9912 statement which does have an else clause. We warn
9913 about the potential ambiguity. */
9916 "suggest explicit braces to avoid ambiguous"
9918 }
9920 /* Now we're all done with the if-statement. */
9922 }
9923 else
9924 {
9928 /* Add the condition. */
9931 /* Parse the body of the switch-statement. */
9940 /* Now we're all done with the switch-statement. */
9942 }
9945 }
9951 }
9952 }
9954 /* Parse a condition.
9956 condition:
9957 expression
9958 type-specifier-seq declarator = initializer-clause
9959 type-specifier-seq declarator braced-init-list
9961 GNU Extension:
9963 condition:
9964 type-specifier-seq declarator asm-specification [opt]
9965 attributes [opt] = assignment-expression
9967 Returns the expression that should be tested. */
9969 static tree
9971 {
9972 cp_decl_specifier_seq type_specifiers;
9976 /* Try the declaration first. */
9978 /* New types are not allowed in the type-specifier-seq for a
9979 condition. */
9981 parser->type_definition_forbidden_message
9983 /* Parse the type-specifier-seq. */
9985 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9988 /* Restore the saved message. */
9990 /* If all is well, we might be looking at a declaration. */
9992 {
9993 tree decl;
9994 tree asm_specification;
9995 tree attributes;
9999 /* Parse the declarator. */
10004 /* Parse the attributes. */
10006 /* Parse the asm-specification. */
10008 /* If the next token is not an `=' or '{', then we might still be
10009 looking at an expression. For example:
10011 if (A(a).x)
10013 looks like a decl-specifier-seq and a declarator -- but then
10014 there is no `=', so this is an expression. */
10019 /* If we did see an `=' or '{', then we are looking at a declaration
10020 for sure. */
10022 {
10023 tree pushed_scope;
10027 /* Create the declaration. */
10033 /* Parse the initializer. */
10035 {
10039 }
10040 else
10041 {
10042 /* Consume the `='. */
10045 }
10049 /* Process the initializer. */
10052 asm_specification,
10053 flags);
10059 }
10060 }
10061 /* If we didn't even get past the declarator successfully, we are
10062 definitely not looking at a declaration. */
10063 else
10066 /* Otherwise, we are looking at an expression. */
10068 }
10070 /* Parses a for-statement or range-for-statement until the closing ')',
10071 not included. */
10073 static tree
10075 {
10079 /* Begin the for-statement. */
10082 /* Parse the initialization. */
10087 else
10089 }
10091 static tree
10093 {
10094 /* Normal for loop */
10097 tree stmt;
10100 /* The for-init-statement has already been parsed in
10101 cp_parser_for_init_statement, so no work is needed here. */
10104 /* If there's a condition, process it. */
10108 {
10112 }
10114 /* Look for the `;'. */
10117 /* If there's an expression, process it. */
10123 }
10125 /* Tries to parse a range-based for-statement:
10127 range-based-for:
10128 decl-specifier-seq declarator : expression
10130 The decl-specifier-seq declarator and the `:' are already parsed by
10131 cp_parser_for_init_statement. If processing_template_decl it returns a
10132 newly created RANGE_FOR_STMT; if not, it is converted to a
10133 regular FOR_STMT. */
10135 static tree
10138 {
10142 {
10145 }
10146 else
10149 /* If in template, STMT is converted to a normal for-statement
10150 at instantiation. If not, it is done just ahead. */
10152 {
10160 /* do_auto_deduction doesn't mess with template init-lists. */
10163 }
10164 else
10165 {
10168 }
10170 }
10172 /* Subroutine of cp_convert_range_for: given the initializer expression,
10173 builds up the range temporary. */
10175 static tree
10177 {
10180 /* Find out the type deduced by the declaration
10181 `auto &&__range = range_expr'. */
10186 /* Create the __range variable. */
10193 }
10195 /* Used by cp_parser_range_for in template context: we aren't going to
10196 do a full conversion yet, but we still need to resolve auto in the
10197 type of the for-range-declaration if present. This is basically
10198 a shortcut version of cp_convert_range_for. */
10200 static void
10202 {
10205 {
10208 iter_type = (cp_parser_perform_range_for_lookup
10211 {
10213 iter_type);
10215 tf_warning_or_error);
10218 }
10219 }
10220 }
10222 /* Converts a range-based for-statement into a normal
10223 for-statement, as per the definition.
10225 for (RANGE_DECL : RANGE_EXPR)
10226 BLOCK
10228 should be equivalent to:
10230 {
10231 auto &&__range = RANGE_EXPR;
10232 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10233 __begin != __end;
10234 ++__begin)
10235 {
10236 RANGE_DECL = *__begin;
10237 BLOCK
10238 }
10239 }
10241 If RANGE_EXPR is an array:
10242 BEGIN_EXPR = __range
10243 END_EXPR = __range + ARRAY_SIZE(__range)
10244 Else if RANGE_EXPR has a member 'begin' or 'end':
10245 BEGIN_EXPR = __range.begin()
10246 END_EXPR = __range.end()
10247 Else:
10248 BEGIN_EXPR = begin(__range)
10249 END_EXPR = end(__range);
10251 If __range has a member 'begin' but not 'end', or vice versa, we must
10252 still use the second alternative (it will surely fail, however).
10253 When calling begin()/end() in the third alternative we must use
10254 argument dependent lookup, but always considering 'std' as an associated
10255 namespace. */
10257 tree
10260 {
10266 /* If an error happened previously do nothing or else a lot of
10267 unhelpful errors would be issued. */
10269 else
10270 {
10271 tree range_temp;
10275 /* Can't bind a reference to an array of runtime bound. */
10277 else
10278 {
10283 LOOKUP_ONLYCONVERTING);
10285 }
10288 }
10290 /* The new for initialization statement. */
10298 LOOKUP_ONLYCONVERTING);
10307 LOOKUP_ONLYCONVERTING);
10311 /* The new for condition. */
10318 /* The new increment expression. */
10321 tf_warning_or_error);
10324 /* The declaration is initialized with *__begin inside the loop body. */
10327 tf_warning_or_error),
10329 LOOKUP_ONLYCONVERTING);
10332 }
10334 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10335 We need to solve both at the same time because the method used
10336 depends on the existence of members begin or end.
10337 Returns the type deduced for the iterator expression. */
10339 static tree
10341 {
10343 {
10346 }
10349 {
10354 }
10356 {
10357 /* If RANGE is an array, we will use pointer arithmetic. */
10360 range,
10364 }
10365 else
10366 {
10367 /* If it is not an array, we must do a bit of magic. */
10377 tf_warning_or_error);
10380 tf_warning_or_error);
10383 {
10384 /* Use the member functions. */
10387 else
10393 else
10396 }
10397 else
10398 {
10399 /* Use global functions with ADL. */
10406 tf_warning_or_error);
10408 tf_warning_or_error);
10410 tf_warning_or_error);
10412 tf_warning_or_error);
10415 }
10417 /* Last common checks. */
10419 {
10420 /* If one of the expressions is an error do no more checks. */
10423 }
10426 /* Can happen, when, eg, in a template context, Koenig lookup
10427 can't resolve begin/end (c++/58503). */
10429 else
10430 {
10432 /* The unqualified type of the __begin and __end temporaries should
10433 be the same, as required by the multiple auto declaration. */
10439 }
10440 }
10441 }
10443 /* Helper function for cp_parser_perform_range_for_lookup.
10444 Builds a tree for RANGE.IDENTIFIER(). */
10446 static tree
10448 {
10461 tf_warning_or_error);
10464 }
10466 /* Parse an iteration-statement.
10468 iteration-statement:
10469 while ( condition ) statement
10470 do statement while ( expression ) ;
10471 for ( for-init-statement condition [opt] ; expression [opt] )
10472 statement
10474 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10476 static tree
10478 {
10481 tree statement;
10484 /* Peek at the next token. */
10489 /* Remember whether or not we are already within an iteration
10490 statement. */
10493 /* See what kind of keyword it is. */
10496 {
10498 {
10499 tree condition;
10501 /* Begin the while-statement. */
10503 /* Look for the `('. */
10505 /* Parse the condition. */
10508 /* Look for the `)'. */
10510 /* Parse the dependent statement. */
10514 /* We're done with the while-statement. */
10516 }
10520 {
10521 tree expression;
10523 /* Begin the do-statement. */
10525 /* Parse the body of the do-statement. */
10530 /* Look for the `while' keyword. */
10532 /* Look for the `('. */
10534 /* Parse the expression. */
10536 /* We're done with the do-statement. */
10538 /* Look for the `)'. */
10540 /* Look for the `;'. */
10542 }
10546 {
10547 /* Look for the `('. */
10552 /* Look for the `)'. */
10555 /* Parse the body of the for-statement. */
10560 /* We're done with the for-statement. */
10562 }
10569 }
10572 }
10574 /* Parse a for-init-statement or the declarator of a range-based-for.
10575 Returns true if a range-based-for declaration is seen.
10577 for-init-statement:
10578 expression-statement
10579 simple-declaration */
10581 static bool
10583 {
10584 /* If the next token is a `;', then we have an empty
10585 expression-statement. Grammatically, this is also a
10586 simple-declaration, but an invalid one, because it does not
10587 declare anything. Therefore, if we did not handle this case
10588 specially, we would issue an error message about an invalid
10589 declaration. */
10591 {
10597 /* We're going to speculatively look for a declaration, falling back
10598 to an expression, if necessary. */
10600 /* Parse the declaration. */
10603 decl);
10606 {
10607 /* It is a range-for, consume the ':' */
10611 {
10613 "range-based %<for%> loops are not allowed "
10616 }
10617 }
10618 else
10619 /* The ';' is not consumed yet because we told
10620 cp_parser_simple_declaration not to. */
10625 /* If the tentative parse failed, then we shall need to look for an
10626 expression-statement. */
10627 }
10628 /* If we are here, it is an expression-statement. */
10631 }
10633 /* Parse a jump-statement.
10635 jump-statement:
10636 break ;
10637 continue ;
10638 return expression [opt] ;
10639 return braced-init-list ;
10640 goto identifier ;
10642 GNU extension:
10644 jump-statement:
10645 goto * expression ;
10647 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10649 static tree
10651 {
10657 /* Peek at the next token. */
10662 /* See what kind of keyword it is. */
10665 {
10669 {
10689 }
10695 {
10702 /* Fall through. */
10712 }
10717 {
10718 tree expr;
10722 {
10726 }
10729 else
10730 /* If the next token is a `;', then there is no
10731 expression. */
10733 /* Build the return-statement. */
10735 /* Look for the final `;'. */
10737 }
10741 /* Create the goto-statement. */
10743 {
10744 /* Issue a warning about this use of a GNU extension. */
10746 /* Consume the '*' token. */
10748 /* Parse the dependent expression. */
10750 }
10751 else
10753 /* Look for the final `;'. */
10760 }
10763 }
10765 /* Parse a declaration-statement.
10767 declaration-statement:
10768 block-declaration */
10770 static void
10772 {
10775 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10778 /* Parse the block-declaration. */
10781 /* Free any declarators allocated. */
10783 }
10785 /* Some dependent statements (like `if (cond) statement'), are
10786 implicitly in their own scope. In other words, if the statement is
10787 a single statement (as opposed to a compound-statement), it is
10788 none-the-less treated as if it were enclosed in braces. Any
10789 declarations appearing in the dependent statement are out of scope
10790 after control passes that point. This function parses a statement,
10791 but ensures that is in its own scope, even if it is not a
10792 compound-statement.
10794 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10795 is a (possibly labeled) if statement which is not enclosed in
10796 braces and has an else clause. This is used to implement
10797 -Wparentheses.
10799 Returns the new statement. */
10801 static tree
10803 {
10804 tree statement;
10809 /* Mark if () ; with a special NOP_EXPR. */
10811 {
10815 }
10816 /* if a compound is opened, we simply parse the statement directly. */
10819 /* If the token is not a `{', then we must take special action. */
10820 else
10821 {
10822 /* Create a compound-statement. */
10824 /* Parse the dependent-statement. */
10826 /* Finish the dummy compound-statement. */
10828 }
10830 /* Return the statement. */
10832 }
10834 /* For some dependent statements (like `while (cond) statement'), we
10835 have already created a scope. Therefore, even if the dependent
10836 statement is a compound-statement, we do not want to create another
10837 scope. */
10839 static void
10841 {
10842 /* If the token is a `{', then we must take special action. */
10845 else
10846 {
10847 /* Avoid calling cp_parser_compound_statement, so that we
10848 don't create a new scope. Do everything else by hand. */
10850 /* If the next keyword is `__label__' we have a label declaration. */
10853 /* Parse an (optional) statement-seq. */
10856 }
10857 }
10859 /* Declarations [gram.dcl.dcl] */
10861 /* Parse an optional declaration-sequence.
10863 declaration-seq:
10864 declaration
10865 declaration-seq declaration */
10867 static void
10869 {
10871 {
10882 {
10883 /* A declaration consisting of a single semicolon is
10884 invalid. Allow it unless we're being pedantic. */
10889 }
10891 /* If we're entering or exiting a region that's implicitly
10892 extern "C", modify the lang context appropriately. */
10894 {
10897 }
10899 {
10902 }
10905 {
10906 /* A top-level declaration can consist solely of a #pragma.
10907 A nested declaration cannot, so this is done here and not
10908 in cp_parser_declaration. (A #pragma at block scope is
10909 handled in cp_parser_statement.) */
10912 }
10914 /* Parse the declaration itself. */
10916 }
10917 }
10919 /* Parse a declaration.
10921 declaration:
10922 block-declaration
10923 function-definition
10924 template-declaration
10925 explicit-instantiation
10926 explicit-specialization
10927 linkage-specification
10928 namespace-definition
10930 GNU extension:
10932 declaration:
10933 __extension__ declaration */
10935 static void
10937 {
10938 cp_token token1;
10939 cp_token token2;
10944 /* Check for the `__extension__' keyword. */
10946 {
10947 /* Parse the qualified declaration. */
10949 /* Restore the PEDANTIC flag. */
10953 }
10955 /* Try to figure out what kind of declaration is present. */
10960 else
10961 {
10964 }
10966 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10969 /* If the next token is `extern' and the following token is a string
10970 literal, then we have a linkage specification. */
10974 /* If the next token is `template', then we have either a template
10975 declaration, an explicit instantiation, or an explicit
10976 specialization. */
10978 {
10979 /* `template <>' indicates a template specialization. */
10983 /* `template <' indicates a template declaration. */
10986 /* Anything else must be an explicit instantiation. */
10987 else
10989 }
10990 /* If the next token is `export', then we have a template
10991 declaration. */
10994 /* If the next token is `extern', 'static' or 'inline' and the one
10995 after that is `template', we have a GNU extended explicit
10996 instantiation directive. */
11003 /* If the next token is `namespace', check for a named or unnamed
11004 namespace definition. */
11010 /* An unnamed namespace definition. */
11014 /* An inline (associated) namespace definition. */
11018 /* Objective-C++ declaration/definition. */
11025 /* We must have either a block declaration or a function
11026 definition. */
11027 else
11028 /* Try to parse a block-declaration, or a function-definition. */
11031 /* Free any declarators allocated. */
11033 }
11035 /* Parse a block-declaration.
11037 block-declaration:
11038 simple-declaration
11039 asm-definition
11040 namespace-alias-definition
11041 using-declaration
11042 using-directive
11044 GNU Extension:
11046 block-declaration:
11047 __extension__ block-declaration
11049 C++0x Extension:
11051 block-declaration:
11052 static_assert-declaration
11054 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11055 part of a declaration-statement. */
11057 static void
11060 {
11064 /* Check for the `__extension__' keyword. */
11066 {
11067 /* Parse the qualified declaration. */
11069 /* Restore the PEDANTIC flag. */
11073 }
11075 /* Peek at the next token to figure out which kind of declaration is
11076 present. */
11079 /* If the next keyword is `asm', we have an asm-definition. */
11081 {
11085 }
11086 /* If the next keyword is `namespace', we have a
11087 namespace-alias-definition. */
11090 /* If the next keyword is `using', we have a
11091 using-declaration, a using-directive, or an alias-declaration. */
11093 {
11098 /* If the token after `using' is `namespace', then we have a
11099 using-directive. */
11103 /* If the second token after 'using' is '=', then we have an
11104 alias-declaration. */
11110 /* Otherwise, it's a using-declaration. */
11111 else
11114 }
11115 /* If the next keyword is `__label__' we have a misplaced label
11116 declaration. */
11118 {
11122 /* If the next token is now a `;', consume it. */
11125 }
11126 /* If the next token is `static_assert' we have a static assertion. */
11129 /* Anything else must be a simple-declaration. */
11130 else
11133 }
11135 /* Parse a simple-declaration.
11137 simple-declaration:
11138 decl-specifier-seq [opt] init-declarator-list [opt] ;
11140 init-declarator-list:
11141 init-declarator
11142 init-declarator-list , init-declarator
11144 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11145 function-definition as a simple-declaration.
11147 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11148 parsed declaration if it is an uninitialized single declarator not followed
11149 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11150 if present, will not be consumed. */
11152 static void
11156 {
11157 cp_decl_specifier_seq decl_specifiers;
11164 /* Defer access checks until we know what is being declared; the
11165 checks for names appearing in the decl-specifier-seq should be
11166 done as if we were in the scope of the thing being declared. */
11169 /* Parse the decl-specifier-seq. We have to keep track of whether
11170 or not the decl-specifier-seq declares a named class or
11171 enumeration type, since that is the only case in which the
11172 init-declarator-list is allowed to be empty.
11174 [dcl.dcl]
11176 In a simple-declaration, the optional init-declarator-list can be
11177 omitted only when declaring a class or enumeration, that is when
11178 the decl-specifier-seq contains either a class-specifier, an
11179 elaborated-type-specifier, or an enum-specifier. */
11181 CP_PARSER_FLAGS_OPTIONAL,
11184 /* We no longer need to defer access checks. */
11187 /* In a block scope, a valid declaration must always have a
11188 decl-specifier-seq. By not trying to parse declarators, we can
11189 resolve the declaration/expression ambiguity more quickly. */
11192 {
11195 }
11197 /* If the next two tokens are both identifiers, the code is
11198 erroneous. The usual cause of this situation is code like:
11200 T t;
11202 where "T" should name a type -- but does not. */
11205 {
11206 /* If parsing tentatively, we should commit; we really are
11207 looking at a declaration. */
11209 /* Give up. */
11211 }
11213 /* If we have seen at least one decl-specifier, and the next token
11214 is not a parenthesis, then we must be looking at a declaration.
11215 (After "int (" we might be looking at a functional cast.) */
11222 /* Keep going until we hit the `;' at the end of the simple
11223 declaration. */
11226 CPP_SEMICOLON))
11227 {
11230 tree decl;
11233 {
11234 /* If we are processing next declarator, coma is expected */
11240 }
11241 else
11244 /* Parse the init-declarator. */
11247 function_definition_allowed_p,
11249 declares_class_or_enum,
11251 maybe_range_for_decl);
11252 /* If an error occurred while parsing tentatively, exit quickly.
11253 (That usually happens when in the body of a function; each
11254 statement is treated as a declaration-statement until proven
11255 otherwise.) */
11258 /* Handle function definitions specially. */
11260 {
11261 /* If the next token is a `,', then we are probably
11262 processing something like:
11264 void f() {}, *p;
11266 which is erroneous. */
11268 {
11271 "mixing"
11273 }
11274 /* Otherwise, we're done with the list of declarators. */
11275 else
11276 {
11279 }
11280 }
11283 /* The next token should be either a `,' or a `;'. */
11285 /* If it's a `,', there are more declarators to come. */
11288 /* If it's a `;', we are done. */
11291 /* Anything else is an error. */
11292 else
11293 {
11294 /* If we have already issued an error message we don't need
11295 to issue another one. */
11299 /* Skip tokens until we reach the end of the statement. */
11301 /* If the next token is now a `;', consume it. */
11305 }
11306 /* After the first time around, a function-definition is not
11307 allowed -- even if it was OK at first. For example:
11309 int i, f() {}
11311 is not valid. */
11313 }
11315 /* Issue an error message if no declarators are present, and the
11316 decl-specifier-seq does not itself declare a class or
11317 enumeration: [dcl.dcl]/3. */
11319 {
11321 {
11325 /* Ensure an error is issued anyway when finish_decltype_type,
11326 called via cp_parser_decl_specifier_seq, returns a class or
11327 an enumeration (c++/51786). */
11330 }
11331 /* Perform any deferred access checks. */
11333 }
11335 /* Consume the `;'. */
11339 done:
11341 }
11343 /* Parse a decl-specifier-seq.
11345 decl-specifier-seq:
11346 decl-specifier-seq [opt] decl-specifier
11347 decl-specifier attribute-specifier-seq [opt] (C++11)
11349 decl-specifier:
11350 storage-class-specifier
11351 type-specifier
11352 function-specifier
11353 friend
11354 typedef
11356 GNU Extension:
11358 decl-specifier:
11359 attributes
11361 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11363 The parser flags FLAGS is used to control type-specifier parsing.
11365 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11366 flags:
11368 1: one of the decl-specifiers is an elaborated-type-specifier
11369 (i.e., a type declaration)
11370 2: one of the decl-specifiers is an enum-specifier or a
11371 class-specifier (i.e., a type definition)
11373 */
11375 static void
11377 cp_parser_flags flags,
11380 {
11384 cp_decl_spec ds;
11386 /* Clear DECL_SPECS. */
11389 /* Assume no class or enumeration type is declared. */
11392 /* Keep reading specifiers until there are no more to read. */
11394 {
11399 /* Peek at the next token. */
11402 /* Save the first token of the decl spec list for error
11403 reporting. */
11406 /* Handle attributes. */
11408 {
11409 /* Parse the attributes. */
11412 /* In a sequence of declaration specifiers, c++11 attributes
11413 appertain to the type that precede them. In that case
11414 [dcl.spec]/1 says:
11416 The attribute-specifier-seq affects the type only for
11417 the declaration it appears in, not other declarations
11418 involving the same type.
11420 But for now let's force the user to position the
11421 attribute either at the beginning of the declaration or
11422 after the declarator-id, which would clearly mean that it
11423 applies to the declarator. */
11425 {
11427 /* The c++11 attribute is at the beginning of the
11428 declaration. It appertains to the entity being
11430 else
11431 {
11433 {
11434 /* This is an attribute following a
11435 class-specifier. */
11440 }
11441 else
11442 {
11443 decl_specs->std_attributes
11445 attrs);
11448 }
11450 }
11451 }
11453 decl_specs->attributes
11455 attrs);
11459 }
11460 /* Assume we will find a decl-specifier keyword. */
11462 /* If the next token is an appropriate keyword, we can simply
11463 add it to the list. */
11465 {
11466 /* decl-specifier:
11467 friend
11468 constexpr */
11471 {
11474 }
11475 else
11476 {
11478 /* Consume the token. */
11480 }
11488 /* function-specifier:
11489 inline
11490 virtual
11491 explicit */
11498 /* decl-specifier:
11499 typedef */
11502 /* Consume the token. */
11504 /* A constructor declarator cannot appear in a typedef. */
11506 /* The "typedef" keyword can only occur in a declaration; we
11507 may as well commit at this point. */
11514 /* storage-class-specifier:
11515 auto
11516 register
11517 static
11518 extern
11519 mutable
11521 GNU Extension:
11522 thread */
11525 {
11526 /* Consume the token. */
11529 /* Complain about `auto' as a storage specifier, if
11530 we're complaining about C++0x compatibility. */
11534 /* Set the storage class anyway. */
11536 token);
11537 }
11538 else
11539 /* C++0x auto type-specifier. */
11547 /* Consume the token. */
11550 token);
11553 /* Consume the token. */
11559 /* We did not yet find a decl-specifier yet. */
11562 }
11572 /* Constructors are a special case. The `S' in `S()' is not a
11573 decl-specifier; it is the beginning of the declarator. */
11574 constructor_p
11575 = (!found_decl_spec
11576 && constructor_possible_p
11577 && (cp_parser_constructor_declarator_p
11580 /* If we don't have a DECL_SPEC yet, then we must be looking at
11581 a type-specifier. */
11583 {
11586 tree type_spec;
11588 type_spec
11590 decl_specs,
11596 /* If this type-specifier referenced a user-defined type
11597 (a typedef, class-name, etc.), then we can't allow any
11598 more such type-specifiers henceforth.
11600 [dcl.spec]
11602 The longest sequence of decl-specifiers that could
11603 possibly be a type name is taken as the
11604 decl-specifier-seq of a declaration. The sequence shall
11605 be self-consistent as described below.
11607 [dcl.type]
11609 As a general rule, at most one type-specifier is allowed
11610 in the complete decl-specifier-seq of a declaration. The
11611 only exceptions are the following:
11613 -- const or volatile can be combined with any other
11614 type-specifier.
11616 -- signed or unsigned can be combined with char, long,
11617 short, or int.
11619 -- ..
11621 Example:
11623 typedef char* Pc;
11624 void g (const int Pc);
11626 Here, Pc is *not* part of the decl-specifier seq; it's
11627 the declarator. Therefore, once we see a type-specifier
11628 (other than a cv-qualifier), we forbid any additional
11629 user-defined types. We *do* still allow things like `int
11630 int' to be considered a decl-specifier-seq, and issue the
11631 error message later. */
11634 /* A constructor declarator cannot follow a type-specifier. */
11636 {
11641 }
11642 }
11644 /* If we still do not have a DECL_SPEC, then there are no more
11645 decl-specifiers. */
11650 /* After we see one decl-specifier, further decl-specifiers are
11651 always optional. */
11653 }
11655 /* Don't allow a friend specifier with a class definition. */
11660 }
11662 /* Parse an (optional) storage-class-specifier.
11664 storage-class-specifier:
11665 auto
11666 register
11667 static
11668 extern
11669 mutable
11671 GNU Extension:
11673 storage-class-specifier:
11674 thread
11676 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11678 static tree
11680 {
11682 {
11686 /* Fall through for C++98. */
11693 /* Consume the token. */
11698 }
11699 }
11701 /* Parse an (optional) function-specifier.
11703 function-specifier:
11704 inline
11705 virtual
11706 explicit
11708 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11709 Updates DECL_SPECS, if it is non-NULL. */
11711 static tree
11714 {
11717 {
11723 /* 14.5.2.3 [temp.mem]
11725 A member function template shall not be virtual. */
11728 else
11738 }
11740 /* Consume the token. */
11742 }
11744 /* Parse a linkage-specification.
11746 linkage-specification:
11747 extern string-literal { declaration-seq [opt] }
11748 extern string-literal declaration */
11750 static void
11752 {
11753 tree linkage;
11755 /* Look for the `extern' keyword. */
11758 /* Look for the string-literal. */
11761 /* Transform the literal into an identifier. If the literal is a
11762 wide-character string, or contains embedded NULs, then we can't
11763 handle it as the user wants. */
11766 {
11768 /* Assume C++ linkage. */
11770 }
11771 else
11774 /* We're now using the new linkage. */
11777 /* If the next token is a `{', then we're using the first
11778 production. */
11780 {
11783 /* Consume the `{' token. */
11785 /* Parse the declarations. */
11787 /* Look for the closing `}'. */
11789 }
11790 /* Otherwise, there's just one declaration. */
11791 else
11792 {
11795 saved_in_unbraced_linkage_specification_p
11799 parser->in_unbraced_linkage_specification_p
11801 }
11803 /* We're done with the linkage-specification. */
11805 }
11807 /* Parse a static_assert-declaration.
11809 static_assert-declaration:
11810 static_assert ( constant-expression , string-literal ) ;
11812 If MEMBER_P, this static_assert is a class member. */
11814 static void
11816 {
11817 tree condition;
11818 tree message;
11820 location_t saved_loc;
11823 /* Peek at the `static_assert' token so we can keep track of exactly
11824 where the static assertion started. */
11828 /* Look for the `static_assert' keyword. */
11830 RT_STATIC_ASSERT))
11833 /* We know we are in a static assertion; commit to any tentative
11834 parse. */
11838 /* Parse the `(' starting the static assertion condition. */
11841 /* Parse the constant-expression. Allow a non-constant expression
11842 here in order to give better diagnostics in finish_static_assert. */
11843 condition =
11848 /* Parse the separating `,'. */
11851 /* Parse the string-literal message. */
11856 /* A `)' completes the static assertion. */
11863 /* A semicolon terminates the declaration. */
11866 /* Complete the static assertion, which may mean either processing
11867 the static assert now or saving it for template instantiation. */
11869 }
11871 /* Parse the expression in decltype ( expression ). */
11873 static tree
11876 {
11878 tree expr;
11880 /* First, try parsing an id-expression. */
11891 {
11894 cp_id_kind idk;
11898 /* Lookup the name we got back from the id-expression. */
11909 {
11910 /* Complete lookup of the id-expression. */
11911 expr = (finish_id_expression
11924 /* We found an id-expression, but it was something that we
11925 should not have found. This is an error, not something
11926 we can recover from, so note that we found an
11927 id-expression and we'll recover as gracefully as
11928 possible. */
11930 }
11935 /* We have an id-expression. */
11937 }
11940 {
11941 /* Abort the id-expression parse. */
11944 /* Parsing tentatively, again. */
11947 /* Parse a class member access. */
11955 /* We have an id-expression. */
11957 }
11960 /* We have parsed the complete id-expression or member access. */
11962 else
11963 {
11964 /* Abort our attempt to parse an id-expression or member access
11965 expression. */
11968 /* Parse a full expression. */
11971 }
11974 }
11976 /* Parse a `decltype' type. Returns the type.
11978 simple-type-specifier:
11979 decltype ( expression )
11980 C++14 proposal:
11981 decltype ( auto ) */
11983 static tree
11985 {
11986 tree expr;
11995 {
11996 /* Already parsed. */
11999 }
12001 /* Look for the `decltype' token. */
12005 /* Parse the opening `('. */
12009 /* decltype (auto) */
12012 {
12019 }
12021 /* Types cannot be defined in a `decltype' expression. Save away the
12022 old message. */
12025 /* And create the new one. */
12026 parser->type_definition_forbidden_message
12029 /* The restrictions on constant-expressions do not apply inside
12030 decltype expressions. */
12031 saved_integral_constant_expression_p
12033 saved_non_integral_constant_expression_p
12037 /* Within a parenthesized expression, a `>' token is always
12038 the greater-than operator. */
12039 saved_greater_than_is_operator_p
12043 /* Do not actually evaluate the expression. */
12046 /* Do not warn about problems with the expression. */
12051 /* Go back to evaluating expressions. */
12055 /* The `>' token might be the end of a template-id or
12056 template-parameter-list now. */
12057 parser->greater_than_is_operator_p
12060 /* Restore the old message and the integral constant expression
12061 flags. */
12063 parser->integral_constant_expression_p
12065 parser->non_integral_constant_expression_p
12068 /* Parse to the closing `)'. */
12070 {
12074 }
12077 tf_warning_or_error);
12079 rewrite:
12080 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12081 it again. */
12088 }
12090 /* Special member functions [gram.special] */
12092 /* Parse a conversion-function-id.
12094 conversion-function-id:
12095 operator conversion-type-id
12097 Returns an IDENTIFIER_NODE representing the operator. */
12099 static tree
12101 {
12102 tree type;
12103 tree saved_scope;
12104 tree saved_qualifying_scope;
12105 tree saved_object_scope;
12108 /* Look for the `operator' token. */
12111 /* When we parse the conversion-type-id, the current scope will be
12112 reset. However, we need that information in able to look up the
12113 conversion function later, so we save it here. */
12117 /* We must enter the scope of the class so that the names of
12118 entities declared within the class are available in the
12119 conversion-type-id. For example, consider:
12121 struct S {
12122 typedef int I;
12123 operator I();
12124 };
12126 S::operator I() { ... }
12128 In order to see that `I' is a type-name in the definition, we
12129 must be in the scope of `S'. */
12132 /* Parse the conversion-type-id. */
12134 /* Leave the scope of the class, if any. */
12137 /* Restore the saved scope. */
12141 /* If the TYPE is invalid, indicate failure. */
12145 }
12147 /* Parse a conversion-type-id:
12149 conversion-type-id:
12150 type-specifier-seq conversion-declarator [opt]
12152 Returns the TYPE specified. */
12154 static tree
12156 {
12157 tree attributes;
12158 cp_decl_specifier_seq type_specifiers;
12160 tree type_specified;
12163 /* Parse the attributes. */
12167 parser->type_definition_forbidden_message
12170 /* Parse the type-specifiers. */
12177 /* If that didn't work, stop. */
12180 /* Parse the conversion-declarator. */
12188 /* Don't give this error when parsing tentatively. This happens to
12189 work because we always parse this definitively once. */
12192 {
12194 {
12197 }
12201 }
12204 }
12206 /* Parse an (optional) conversion-declarator.
12208 conversion-declarator:
12209 ptr-operator conversion-declarator [opt]
12211 */
12215 {
12218 cp_cv_quals cv_quals;
12220 /* We don't know if there's a ptr-operator next, or not. */
12222 /* Try the ptr-operator. */
12225 /* If it worked, look for more conversion-declarators. */
12227 {
12230 /* Parse another optional declarator. */
12233 declarator = cp_parser_make_indirect_declarator
12237 }
12240 }
12242 /* Parse an (optional) ctor-initializer.
12244 ctor-initializer:
12245 : mem-initializer-list
12247 Returns TRUE iff the ctor-initializer was actually present. */
12249 static bool
12251 {
12252 /* If the next token is not a `:', then there is no
12253 ctor-initializer. */
12255 {
12256 /* Do default initialization of any bases and members. */
12261 }
12263 /* Consume the `:' token. */
12265 /* And the mem-initializer-list. */
12269 }
12271 /* Parse a mem-initializer-list.
12273 mem-initializer-list:
12274 mem-initializer ... [opt]
12275 mem-initializer ... [opt] , mem-initializer-list */
12277 static void
12279 {
12284 /* Let the semantic analysis code know that we are starting the
12285 mem-initializer-list. */
12290 /* Loop through the list. */
12292 {
12293 tree mem_initializer;
12296 /* Parse the mem-initializer. */
12298 /* If the next token is a `...', we're expanding member initializers. */
12300 {
12301 /* Consume the `...'. */
12304 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12305 can be expanded but members cannot. */
12308 {
12313 }
12315 /* Construct the pack expansion type. */
12318 }
12321 {
12325 }
12326 /* Look for a target constructor. */
12330 {
12333 {
12337 }
12339 }
12340 /* Add it to the list, unless it was erroneous. */
12342 {
12345 }
12346 /* If the next token is not a `,', we're done. */
12349 /* Consume the `,' token. */
12351 }
12353 /* Perform semantic analysis. */
12356 }
12358 /* Parse a mem-initializer.
12360 mem-initializer:
12361 mem-initializer-id ( expression-list [opt] )
12362 mem-initializer-id braced-init-list
12364 GNU extension:
12366 mem-initializer:
12367 ( expression-list [opt] )
12369 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12370 class) or FIELD_DECL (for a non-static data member) to initialize;
12371 the TREE_VALUE is the expression-list. An empty initialization
12372 list is represented by void_list_node. */
12374 static tree
12376 {
12377 tree mem_initializer_id;
12378 tree expression_list;
12379 tree member;
12382 /* Find out what is being initialized. */
12384 {
12388 }
12389 else
12390 {
12394 }
12400 {
12407 }
12408 else
12409 {
12419 }
12429 }
12431 /* Parse a mem-initializer-id.
12433 mem-initializer-id:
12434 :: [opt] nested-name-specifier [opt] class-name
12435 identifier
12437 Returns a TYPE indicating the class to be initializer for the first
12438 production. Returns an IDENTIFIER_NODE indicating the data member
12439 to be initialized for the second production. */
12441 static tree
12443 {
12447 tree id;
12451 /* `typename' is not allowed in this context ([temp.res]). */
12453 {
12455 "keyword %<typename%> not allowed in this context (a qualified "
12458 }
12459 /* Look for the optional `::' operator. */
12460 global_scope_p
12464 /* Look for the optional nested-name-specifier. The simplest way to
12465 implement:
12467 [temp.res]
12469 The keyword `typename' is not permitted in a base-specifier or
12470 mem-initializer; in these contexts a qualified name that
12471 depends on a template-parameter is implicitly assumed to be a
12472 type name.
12474 is to assume that we have seen the `typename' keyword at this
12475 point. */
12476 nested_name_specifier_p
12485 /* If there is a `::' operator or a nested-name-specifier, then we
12486 are definitely looking for a class-name. */
12491 typename_type,
12495 /* Otherwise, we could also be looking for an ordinary identifier. */
12497 /* Try a class-name. */
12501 none_type,
12505 /* If we found one, we're done. */
12508 /* Otherwise, look for an ordinary identifier. */
12510 }
12512 /* Overloading [gram.over] */
12514 /* Parse an operator-function-id.
12516 operator-function-id:
12517 operator operator
12519 Returns an IDENTIFIER_NODE for the operator which is a
12520 human-readable spelling of the identifier, e.g., `operator +'. */
12522 static tree
12524 {
12525 /* Look for the `operator' keyword. */
12528 /* And then the name of the operator itself. */
12530 }
12532 /* Return an identifier node for a user-defined literal operator.
12533 The suffix identifier is chained to the operator name identifier. */
12535 static tree
12537 {
12538 tree identifier;
12545 }
12547 /* Parse an operator.
12549 operator:
12550 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12551 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12552 || ++ -- , ->* -> () []
12554 GNU Extensions:
12556 operator:
12557 <? >? <?= >?=
12559 Returns an IDENTIFIER_NODE for the operator which is a
12560 human-readable spelling of the identifier, e.g., `operator +'. */
12562 static tree
12564 {
12569 /* Peek at the next token. */
12571 /* Figure out which operator we have. */
12573 {
12575 {
12578 /* The keyword should be either `new' or `delete'. */
12583 else
12586 /* Consume the `new' or `delete' token. */
12589 /* Peek at the next token. */
12591 /* If it's a `[' token then this is the array variant of the
12592 operator. */
12594 {
12595 /* Consume the `[' token. */
12597 /* Look for the `]' token. */
12601 }
12602 /* Otherwise, we have the non-array variant. */
12603 else
12607 }
12754 /* Consume the `('. */
12756 /* Look for the matching `)'. */
12761 /* Consume the `['. */
12763 /* Look for the matching `]'. */
12772 /* Fall through. */
12778 {
12781 }
12783 {
12786 }
12787 /* Consume the string. */
12789 /* Look for the suffix identifier. */
12792 {
12795 {
12798 }
12799 }
12801 {
12805 }
12806 else
12807 {
12810 }
12817 /* Fall through. */
12823 {
12826 }
12827 {
12830 {
12833 }
12835 /* Consume the user-defined string literal. */
12838 {
12841 }
12842 else
12844 }
12847 /* Anything else is an error. */
12849 }
12851 /* If we have selected an identifier, we need to consume the
12852 operator token. */
12855 /* Otherwise, no valid operator name was present. */
12856 else
12857 {
12860 }
12863 }
12865 /* Parse a template-declaration.
12867 template-declaration:
12868 export [opt] template < template-parameter-list > declaration
12870 If MEMBER_P is TRUE, this template-declaration occurs within a
12871 class-specifier.
12873 The grammar rule given by the standard isn't correct. What
12874 is really meant is:
12876 template-declaration:
12877 export [opt] template-parameter-list-seq
12878 decl-specifier-seq [opt] init-declarator [opt] ;
12879 export [opt] template-parameter-list-seq
12880 function-definition
12882 template-parameter-list-seq:
12883 template-parameter-list-seq [opt]
12884 template < template-parameter-list > */
12886 static void
12888 {
12889 /* A hack to disable -Wself-assign warning in template parsing. */
12892 /* Check for `export'. */
12894 {
12895 /* Consume the `export' token. */
12897 /* Warn that we do not support `export'. */
12899 }
12903 }
12905 /* Parse a template-parameter-list.
12907 template-parameter-list:
12908 template-parameter
12909 template-parameter-list , template-parameter
12911 Returns a TREE_LIST. Each node represents a template parameter.
12912 The nodes are connected via their TREE_CHAINs. */
12914 static tree
12916 {
12921 /* The loop below parses the template parms. We first need to know
12922 the total number of template parms to be able to compute proper
12923 canonical types of each dependent type. So after the loop, when
12924 we know the total number of template parms,
12925 end_template_parm_list computes the proper canonical types and
12926 fixes up the dependent types accordingly. */
12928 {
12929 tree parameter;
12932 location_t parm_loc;
12934 /* Parse the template-parameter. */
12939 /* Add it to the list. */
12942 parm_loc,
12943 parameter,
12944 is_non_type,
12945 is_parameter_pack);
12946 else
12947 {
12950 }
12952 /* If the next token is not a `,', we're done. */
12955 /* Otherwise, consume the `,' token. */
12957 }
12960 }
12962 /* Parse a template-parameter.
12964 template-parameter:
12965 type-parameter
12966 parameter-declaration
12968 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12969 the parameter. The TREE_PURPOSE is the default value, if any.
12970 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12971 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12972 set to true iff this parameter is a parameter pack. */
12974 static tree
12977 {
12981 tree parm;
12983 /* Assume it is a type parameter or a template parameter. */
12985 /* Assume it not a parameter pack. */
12987 /* Peek at the next token. */
12989 /* If it is `class' or `template', we have a type-parameter. */
12992 /* If it is `class' or `typename' we do not know yet whether it is a
12993 type parameter or a non-type parameter. Consider:
12995 template <typename T, typename T::X X> ...
12997 or:
12999 template <class C, class D*> ...
13001 Here, the first parameter is a type parameter, and the second is
13002 a non-type parameter. We can tell by looking at the token after
13003 the identifier -- if it is a `,', `=', or `>' then we have a type
13004 parameter. */
13006 {
13007 /* Peek at the token after `class' or `typename'. */
13009 /* If it's an ellipsis, we have a template type parameter
13010 pack. */
13013 /* If it's an identifier, skip it. */
13016 /* Now, see if the token looks like the end of a template
13017 parameter. */
13022 }
13024 /* Otherwise, it is a non-type parameter.
13026 [temp.param]
13028 When parsing a default template-argument for a non-type
13029 template-parameter, the first non-nested `>' is taken as the end
13030 of the template parameter-list rather than a greater-than
13031 operator. */
13033 parameter_declarator
13040 /* If the parameter declaration is marked as a parameter pack, set
13041 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13042 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13043 grokdeclarator. */
13046 {
13049 }
13052 {
13053 /* Can happen in some cases of erroneous input (c++/34892). */
13055 /* Consume the `...' for better error recovery. */
13057 }
13058 /* If the next token is an ellipsis, and we don't already have it
13059 marked as a parameter pack, then we have a parameter pack (that
13060 has no declarator). */
13063 && (declarator_can_be_parameter_pack
13065 {
13066 /* Consume the `...'. */
13071 }
13072 /* We might end up with a pack expansion as the type of the non-type
13073 template parameter, in which case this is a non-type template
13074 parameter pack. */
13077 {
13081 }
13084 {
13085 /* Parameter packs cannot have default arguments. However, a
13086 user may try to do so, so we'll parse them and give an
13087 appropriate diagnostic here. */
13091 /* Find the name of the parameter pack. */
13100 else
13104 /* Parse the default argument, but throw away the result. */
13106 }
13116 }
13118 /* Parse a type-parameter.
13120 type-parameter:
13121 class identifier [opt]
13122 class identifier [opt] = type-id
13123 typename identifier [opt]
13124 typename identifier [opt] = type-id
13125 template < template-parameter-list > class identifier [opt]
13126 template < template-parameter-list > class identifier [opt]
13127 = id-expression
13129 GNU Extension (variadic templates):
13131 type-parameter:
13132 class ... identifier [opt]
13133 typename ... identifier [opt]
13135 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13136 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13137 the declaration of the parameter.
13139 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13141 static tree
13143 {
13145 tree parameter;
13147 /* Look for a keyword to tell us what kind of parameter this is. */
13153 {
13156 {
13157 tree identifier;
13158 tree default_argument;
13160 /* If the next token is an ellipsis, we have a template
13161 argument pack. */
13163 {
13164 /* Consume the `...' token. */
13169 }
13171 /* If the next token is an identifier, then it names the
13172 parameter. */
13175 else
13178 /* Create the parameter. */
13181 /* If the next token is an `=', we have a default argument. */
13183 {
13184 /* Consume the `=' token. */
13186 /* Parse the default-argument. */
13190 /* Template parameter packs cannot have default
13191 arguments. */
13193 {
13196 "template parameter pack %qD cannot have a "
13198 else
13200 "template parameter packs cannot have "
13203 }
13205 }
13206 else
13209 /* Create the combined representation of the parameter and the
13210 default argument. */
13212 }
13216 {
13217 tree identifier;
13218 tree default_argument;
13220 /* Look for the `<'. */
13222 /* Parse the template-parameter-list. */
13224 /* Look for the `>'. */
13226 /* Look for the `class' keyword. */
13228 /* If the next token is an ellipsis, we have a template
13229 argument pack. */
13231 {
13232 /* Consume the `...' token. */
13237 }
13238 /* If the next token is an `=', then there is a
13239 default-argument. If the next token is a `>', we are at
13240 the end of the parameter-list. If the next token is a `,',
13241 then we are at the end of this parameter. */
13245 {
13247 /* Treat invalid names as if the parameter were nameless. */
13250 }
13251 else
13254 /* Create the template parameter. */
13256 identifier);
13258 /* If the next token is an `=', then there is a
13259 default-argument. */
13261 {
13264 /* Consume the `='. */
13266 /* Parse the id-expression. */
13268 /* save token before parsing the id-expression, for error
13269 reporting */
13271 default_argument
13279 /* If the id-expression was a template-id that refers to
13280 a template-class, we already have the declaration here,
13281 so no further lookup is needed. */
13282 ;
13283 else
13284 /* Look up the name. */
13285 default_argument
13287 none_type,
13293 /* See if the default argument is valid. */
13294 default_argument
13297 /* Template parameter packs cannot have default
13298 arguments. */
13300 {
13303 "template parameter pack %qD cannot "
13305 identifier);
13306 else
13310 }
13312 }
13313 else
13316 /* Create the combined representation of the parameter and the
13317 default argument. */
13319 }
13325 }
13328 }
13330 /* Parse a template-id.
13332 template-id:
13333 template-name < template-argument-list [opt] >
13335 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13336 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13337 returned. Otherwise, if the template-name names a function, or set
13338 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13339 names a class, returns a TYPE_DECL for the specialization.
13341 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13342 uninstantiated templates. */
13344 static tree
13350 {
13352 tree templ;
13353 tree arguments;
13354 tree template_id;
13361 /* If the next token corresponds to a template-id, there is no need
13362 to reparse it. */
13365 {
13368 /* Get the stored value. */
13370 /* Perform any access checks that were deferred. */
13373 {
13378 tf_warning_or_error);
13379 }
13380 /* Return the stored value. */
13382 }
13384 /* Avoid performing name lookup if there is no possibility of
13385 finding a template-id. */
13388 && !cp_parser_nth_token_starts_template_argument_list_p
13390 {
13393 }
13395 /* Remember where the template-id starts. */
13401 /* Parse the template-name. */
13404 check_dependency_p,
13405 is_declaration,
13406 tag_type,
13409 {
13412 }
13414 /* If we find the sequence `[:' after a template-name, it's probably
13415 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13416 parse correctly the argument list. */
13423 {
13425 /* Change `:' into `::'. */
13427 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13428 CPP_LESS. */
13431 /* Parse the arguments. */
13434 {
13435 /* If we couldn't parse an argument list, then we revert our changes
13436 and return simply an error. Maybe this is not a template-id
13437 after all. */
13442 }
13443 /* Otherwise, emit an error about the invalid digraph, but continue
13444 parsing because we got our argument list. */
13447 {
13450 "%<<:%> is an alternate spelling for %<[%>."
13453 {
13455 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13458 }
13459 }
13460 }
13461 else
13462 {
13463 /* Look for the `<' that starts the template-argument-list. */
13465 {
13468 }
13469 /* Parse the arguments. */
13471 }
13473 /* Build a representation of the specialization. */
13476 TEMPLATE_ID_EXPR,
13480 {
13482 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13483 template (rather than some instantiation thereof) only if
13484 is not nested within some other construct. For example, in
13485 "template <typename T> void f(T) { A<T>::", A<T> is just an
13486 instantiation of A. */
13489 CPP_SCOPE));
13490 template_id
13492 }
13493 else
13494 {
13495 /* If it's not a class-template or a template-template, it should be
13496 a function-template. */
13502 }
13504 /* If parsing tentatively, replace the sequence of tokens that makes
13505 up the template-id with a CPP_TEMPLATE_ID token. That way,
13506 should we re-parse the token stream, we will not have to repeat
13507 the effort required to do the parse, nor will we issue duplicate
13508 error messages about problems during instantiation of the
13509 template. */
13511 /* Don't do this if we had a parse error in a declarator; re-parsing
13512 might succeed if a name changes meaning (60361). */
13516 {
13519 /* Reset the contents of the START_OF_ID token. */
13521 /* Retrieve any deferred checks. Do not pop this access checks yet
13522 so the memory will not be reclaimed during token replacing below. */
13528 /* Purge all subsequent tokens. */
13531 /* ??? Can we actually assume that, if template_id ==
13532 error_mark_node, we will have issued a diagnostic to the
13533 user, as opposed to simply marking the tentative parse as
13534 failed? */
13537 }
13541 }
13543 /* Parse a template-name.
13545 template-name:
13546 identifier
13548 The standard should actually say:
13550 template-name:
13551 identifier
13552 operator-function-id
13554 A defect report has been filed about this issue.
13556 A conversion-function-id cannot be a template name because they cannot
13557 be part of a template-id. In fact, looking at this code:
13559 a.operator K<int>()
13561 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13562 It is impossible to call a templated conversion-function-id with an
13563 explicit argument list, since the only allowed template parameter is
13564 the type to which it is converting.
13566 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13567 `template' keyword, in a construction like:
13569 T::template f<3>()
13571 In that case `f' is taken to be a template-name, even though there
13572 is no way of knowing for sure.
13574 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13575 name refers to a set of overloaded functions, at least one of which
13576 is a template, or an IDENTIFIER_NODE with the name of the template,
13577 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13578 names are looked up inside uninstantiated templates. */
13580 static tree
13587 {
13588 tree identifier;
13589 tree decl;
13590 tree fns;
13593 /* If the next token is `operator', then we have either an
13594 operator-function-id or a conversion-function-id. */
13596 {
13597 /* We don't know whether we're looking at an
13598 operator-function-id or a conversion-function-id. */
13600 /* Try an operator-function-id. */
13602 /* If that didn't work, try a conversion-function-id. */
13604 {
13607 }
13608 }
13609 /* Look for the identifier. */
13610 else
13613 /* If we didn't find an identifier, we don't have a template-id. */
13617 /* If the name immediately followed the `template' keyword, then it
13618 is a template-name. However, if the next token is not `<', then
13619 we do not treat it as a template-name, since it is not being used
13620 as part of a template-id. This enables us to handle constructs
13621 like:
13623 template <typename T> struct S { S(); };
13624 template <typename T> S<T>::S();
13626 correctly. We would treat `S' as a template -- if it were `S<T>'
13627 -- but we do not if there is no `<'. */
13631 {
13632 /* In a declaration, in a dependent context, we pretend that the
13633 "template" keyword was present in order to improve error
13634 recovery. For example, given:
13636 template <typename T> void f(T::X<int>);
13638 we want to treat "X<int>" as a template-id. */
13640 && !template_keyword_p
13642 && check_dependency_p
13644 /* Do not do this for dtors (or ctors), since they never
13645 need the template keyword before their name. */
13647 {
13650 /* Explain what went wrong. */
13652 identifier);
13655 /* If parsing tentatively, find the location of the "<" token. */
13658 /* Parse the template arguments so that we can issue error
13659 messages about them. */
13662 /* Skip tokens until we find a good place from which to
13663 continue parsing. */
13668 /* If parsing tentatively, permanently remove the
13669 template argument list. That will prevent duplicate
13670 error messages from being issued about the missing
13671 "template" keyword. */
13677 }
13679 /* If the "template" keyword is present, then there is generally
13680 no point in doing name-lookup, so we just return IDENTIFIER.
13681 But, if the qualifying scope is non-dependent then we can
13682 (and must) do name-lookup normally. */
13688 }
13690 /* Look up the name. */
13692 tag_type,
13695 check_dependency_p,
13699 /* If DECL is a template, then the name was a template-name. */
13701 ;
13702 else
13703 {
13706 /* The standard does not explicitly indicate whether a name that
13707 names a set of overloaded declarations, some of which are
13708 templates, is a template-name. However, such a name should
13709 be a template-name; otherwise, there is no way to form a
13710 template-id for the overloaded templates. */
13718 {
13719 /* The name does not name a template. */
13722 }
13723 }
13725 /* If DECL is dependent, and refers to a function, then just return
13726 its name; we will look it up again during template instantiation. */
13728 {
13732 }
13735 }
13737 /* Parse a template-argument-list.
13739 template-argument-list:
13740 template-argument ... [opt]
13741 template-argument-list , template-argument ... [opt]
13743 Returns a TREE_VEC containing the arguments. */
13745 static tree
13747 {
13752 tree vec;
13759 /* Even if the template-id appears in an integral
13760 constant-expression, the contents of the argument list do
13761 not. */
13767 /* Parse the arguments. */
13768 do
13769 {
13770 tree argument;
13773 /* Consume the comma. */
13776 /* Parse the template-argument. */
13779 /* If the next token is an ellipsis, we're expanding a template
13780 argument pack. */
13782 {
13784 {
13788 }
13789 /* Consume the `...' token. */
13792 /* Make the argument into a TYPE_PACK_EXPANSION or
13793 EXPR_PACK_EXPANSION. */
13795 }
13798 {
13802 {
13805 }
13806 else
13808 }
13810 }
13823 #ifdef ENABLE_CHECKING
13825 #endif
13827 }
13829 /* Parse a template-argument.
13831 template-argument:
13832 assignment-expression
13833 type-id
13834 id-expression
13836 The representation is that of an assignment-expression, type-id, or
13837 id-expression -- except that the qualified id-expression is
13838 evaluated, so that the value returned is either a DECL or an
13839 OVERLOAD.
13841 Although the standard says "assignment-expression", it forbids
13842 throw-expressions or assignments in the template argument.
13843 Therefore, we use "conditional-expression" instead. */
13845 static tree
13847 {
13848 tree argument;
13854 cp_id_kind idk;
13856 /* There's really no way to know what we're looking at, so we just
13857 try each alternative in order.
13859 [temp.arg]
13861 In a template-argument, an ambiguity between a type-id and an
13862 expression is resolved to a type-id, regardless of the form of
13863 the corresponding template-parameter.
13865 Therefore, we try a type-id first. */
13868 /* If there was no error parsing the type-id but the next token is a
13869 '>>', our behavior depends on which dialect of C++ we're
13870 parsing. In C++98, we probably found a typo for '> >'. But there
13871 are type-id which are also valid expressions. For instance:
13873 struct X { int operator >> (int); };
13874 template <int V> struct Foo {};
13875 Foo<X () >> 5> r;
13877 Here 'X()' is a valid type-id of a function type, but the user just
13878 wanted to write the expression "X() >> 5". Thus, we remember that we
13879 found a valid type-id, but we still try to parse the argument as an
13880 expression to see what happens.
13882 In C++0x, the '>>' will be considered two separate '>'
13883 tokens. */
13887 {
13890 }
13891 else
13892 {
13893 /* If the next token isn't a `,' or a `>', then this argument wasn't
13894 really finished. This means that the argument is not a valid
13895 type-id. */
13898 /* If that worked, we're done. */
13901 }
13902 /* We're still not sure what the argument will be. */
13904 /* Try a template. */
13912 /* If the next token isn't a `,' or a `>', then this argument wasn't
13913 really finished. */
13917 {
13918 /* Figure out what is being referred to. If the id-expression
13919 was for a class template specialization, then we will have a
13920 TYPE_DECL at this point. There is no need to do name lookup
13921 at this point in that case. */
13924 none_type,
13933 }
13936 /* It must be a non-type argument. There permitted cases are given
13937 in [temp.arg.nontype]:
13939 -- an integral constant-expression of integral or enumeration
13940 type; or
13942 -- the name of a non-type template-parameter; or
13944 -- the name of an object or function with external linkage...
13946 -- the address of an object or function with external linkage...
13948 -- a pointer to member... */
13949 /* Look for a non-type template parameter. */
13951 {
13963 }
13965 /* If the next token is "&", the argument must be the address of an
13966 object or function with external linkage. */
13969 {
13972 }
13973 /* See if we might have an id-expression. */
13980 {
13983 address_p,
13990 else
13991 {
13992 tree probe;
13995 {
13996 /* Strip the dereference temporarily. */
13999 }
14001 /* If we're in a template, we represent a qualified-id referring
14002 to a static data member as a SCOPE_REF even if the scope isn't
14003 dependent so that we can check access control later. */
14008 {
14009 /* A variable without external linkage might still be a
14010 valid constant-expression, so no error is issued here
14011 if the external-linkage check fails. */
14014 }
14016 /* All overloaded functions are allowed; if the external
14017 linkage test does not pass, an error will be issued
14018 later. */
14019 ;
14023 /* A pointer-to-member. */
14024 ;
14026 ;
14027 else
14031 {
14034 tf_warning_or_error);
14035 else
14038 }
14039 }
14040 }
14041 /* If the argument started with "&", there are no other valid
14042 alternatives at this point. */
14044 {
14047 }
14049 /* If the argument wasn't successfully parsed as a type-id followed
14050 by '>>', the argument can only be a constant expression now.
14051 Otherwise, we try parsing the constant-expression tentatively,
14052 because the argument could really be a type-id. */
14064 /* We did our best to parse the argument as a non type-id, but that
14065 was the only alternative that matched (albeit with a '>' after
14066 it). We can assume it's just a typo from the user, and a
14067 diagnostic will then be issued. */
14069 }
14071 /* Parse an explicit-instantiation.
14073 explicit-instantiation:
14074 template declaration
14076 Although the standard says `declaration', what it really means is:
14078 explicit-instantiation:
14079 template decl-specifier-seq [opt] declarator [opt] ;
14081 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14082 supposed to be allowed. A defect report has been filed about this
14083 issue.
14085 GNU Extension:
14087 explicit-instantiation:
14088 storage-class-specifier template
14089 decl-specifier-seq [opt] declarator [opt] ;
14090 function-specifier template
14091 decl-specifier-seq [opt] declarator [opt] ; */
14093 static void
14095 {
14097 cp_decl_specifier_seq decl_specifiers;
14102 /* Look for an (optional) storage-class-specifier or
14103 function-specifier. */
14105 {
14106 extension_specifier
14109 extension_specifier
14112 }
14114 /* Look for the `template' keyword. */
14116 /* Let the front end know that we are processing an explicit
14117 instantiation. */
14119 /* [temp.explicit] says that we are supposed to ignore access
14120 control while processing explicit instantiation directives. */
14122 /* Parse a decl-specifier-seq. */
14124 CP_PARSER_FLAGS_OPTIONAL,
14127 /* If there was exactly one decl-specifier, and it declared a class,
14128 and there's no declarator, then we have an explicit type
14129 instantiation. */
14131 {
14132 tree type;
14136 /* Turn access control back on for names used during
14137 template instantiation. */
14142 }
14143 else
14144 {
14146 tree decl;
14148 /* Parse the declarator. */
14149 declarator
14159 {
14162 "explicit instantiation shall not use"
14166 "explicit instantiation shall not use"
14171 /* Turn access control back on for names used during
14172 template instantiation. */
14174 /* Do the explicit instantiation. */
14176 }
14177 else
14178 {
14180 /* Skip the body of the explicit instantiation. */
14182 }
14183 }
14184 /* We're done with the instantiation. */
14190 }
14192 /* Parse an explicit-specialization.
14194 explicit-specialization:
14195 template < > declaration
14197 Although the standard says `declaration', what it really means is:
14199 explicit-specialization:
14200 template <> decl-specifier [opt] init-declarator [opt] ;
14201 template <> function-definition
14202 template <> explicit-specialization
14203 template <> template-declaration */
14205 static void
14207 {
14211 /* Look for the `template' keyword. */
14213 /* Look for the `<'. */
14215 /* Look for the `>'. */
14217 /* We have processed another parameter list. */
14219 /* [temp]
14221 A template ... explicit specialization ... shall not have C
14222 linkage. */
14224 {
14226 /* Give it C++ linkage to avoid confusing other parts of the
14227 front end. */
14230 }
14231 else
14233 /* Let the front end know that we are beginning a specialization. */
14235 {
14238 }
14240 /* If the next keyword is `template', we need to figure out whether
14241 or not we're looking a template-declaration. */
14243 {
14248 else
14250 }
14251 else
14252 /* Parse the dependent declaration. */
14258 /* We're done with the specialization. */
14260 /* For the erroneous case of a template with C linkage, we pushed an
14261 implicit C++ linkage scope; exit that scope now. */
14264 /* We're done with this parameter list. */
14266 }
14268 /* Parse a type-specifier.
14270 type-specifier:
14271 simple-type-specifier
14272 class-specifier
14273 enum-specifier
14274 elaborated-type-specifier
14275 cv-qualifier
14277 GNU Extension:
14279 type-specifier:
14280 __complex__
14282 Returns a representation of the type-specifier. For a
14283 class-specifier, enum-specifier, or elaborated-type-specifier, a
14284 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14286 The parser flags FLAGS is used to control type-specifier parsing.
14288 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14289 in a decl-specifier-seq.
14291 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14292 class-specifier, enum-specifier, or elaborated-type-specifier, then
14293 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14294 if a type is declared; 2 if it is defined. Otherwise, it is set to
14295 zero.
14297 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14298 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14299 is set to FALSE. */
14301 static tree
14303 cp_parser_flags flags,
14308 {
14314 /* Assume this type-specifier does not declare a new type. */
14317 /* And that it does not specify a cv-qualifier. */
14320 /* Peek at the next token. */
14323 /* If we're looking at a keyword, we can use that to guide the
14324 production we choose. */
14327 {
14332 /* Look for the enum-specifier. */
14334 /* If that worked, we're done. */
14336 {
14341 type_spec,
14342 token,
14345 }
14346 else
14349 /* Any of these indicate either a class-specifier, or an
14350 elaborated-type-specifier. */
14357 /* Parse tentatively so that we can back up if we don't find a
14358 class-specifier. */
14360 /* Look for the class-specifier. */
14363 /* If that worked, we're done. */
14365 {
14370 type_spec,
14371 token,
14374 }
14376 /* Fall through. */
14377 elaborated_type_specifier:
14378 /* We're declaring (not defining) a class or enum. */
14382 /* Fall through. */
14384 /* Look for an elaborated-type-specifier. */
14385 type_spec
14386 = (cp_parser_elaborated_type_specifier
14389 is_declaration));
14392 type_spec,
14393 token,
14416 /* The `__complex__' keyword is a GNU extension. */
14422 }
14424 /* Handle simple keywords. */
14426 {
14428 {
14431 }
14433 }
14435 /* If we do not already have a type-specifier, assume we are looking
14436 at a simple-type-specifier. */
14438 decl_specs,
14439 flags);
14441 /* If we didn't find a type-specifier, and a type-specifier was not
14442 optional in this context, issue an error message. */
14444 {
14447 }
14450 }
14452 /* Parse a simple-type-specifier.
14454 simple-type-specifier:
14455 :: [opt] nested-name-specifier [opt] type-name
14456 :: [opt] nested-name-specifier template template-id
14457 char
14458 wchar_t
14459 bool
14460 short
14461 int
14462 long
14463 signed
14464 unsigned
14465 float
14466 double
14467 void
14469 C++0x Extension:
14471 simple-type-specifier:
14472 auto
14473 decltype ( expression )
14474 char16_t
14475 char32_t
14476 __underlying_type ( type-id )
14478 GNU Extension:
14480 simple-type-specifier:
14481 __int128
14482 __typeof__ unary-expression
14483 __typeof__ ( type-id )
14484 __typeof__ ( type-id ) { initializer-list , [opt] }
14486 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14487 appropriately updated. */
14489 static tree
14492 cp_parser_flags flags)
14493 {
14497 /* Peek at the next token. */
14500 /* If we're looking at a keyword, things are easy. */
14502 {
14562 {
14566 {
14569 "use of %<auto%> in lambda parameter declaration "
14570 "only available with "
14572 }
14575 "use of %<auto%> in parameter declaration "
14576 "only available with "
14578 else
14580 "ISO C++ forbids use of %<auto%> in parameter "
14582 }
14583 else
14588 /* Since DR 743, decltype can either be a simple-type-specifier by
14589 itself or begin a nested-name-specifier. Parsing it will replace
14590 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14591 handling below decide what to do. */
14597 /* Consume the `typeof' token. */
14599 /* Parse the operand to `typeof'. */
14601 /* If it is not already a TYPE, take its type. */
14607 token,
14616 token,
14626 token,
14631 }
14633 /* If token is an already-parsed decltype not followed by ::,
14634 it's a simple-type-specifier. */
14637 {
14641 token,
14645 }
14647 /* If the type-specifier was for a built-in type, we're done. */
14649 {
14650 /* Record the type. */
14657 type,
14658 token,
14663 /* Consume the token. */
14666 /* There is no valid C++ program where a non-template type is
14667 followed by a "<". That usually indicates that the user thought
14668 that the type was a template. */
14673 }
14675 /* The type-specifier must be a user-defined type. */
14677 {
14681 /* Don't gobble tokens or issue error messages if this is an
14682 optional type-specifier. */
14686 /* Look for the optional `::' operator. */
14687 global_p
14691 /* Look for the nested-name specifier. */
14692 qualified_p
14700 /* If we have seen a nested-name-specifier, and the next token
14701 is `template', then we are using the template-id production. */
14704 {
14705 /* Look for the template-id. */
14709 none_type,
14711 /* If the template-id did not name a type, we are out of
14712 luck. */
14714 {
14717 }
14718 }
14719 /* Otherwise, look for a type-name. */
14720 else
14722 /* Keep track of all name-lookups performed in class scopes. */
14724 && !global_p
14725 && !qualified_p
14729 /* If it didn't work out, we don't have a TYPE. */
14735 token,
14737 }
14739 /* If we didn't get a type-name, issue an error message. */
14741 {
14744 }
14747 {
14748 /* See if TYPE is an Objective-C type, and if so, parse and
14749 accept any protocol references following it. Do this before
14750 the cp_parser_check_for_invalid_template_id() call, because
14751 Objective-C types can be followed by '<...>' which would
14752 enclose protocol names rather than template arguments, and so
14753 everything is fine. */
14756 {
14760 /* Clobber the "unqualified" type previously entered into
14761 DECL_SPECS with the new, improved protocol-qualified version. */
14766 }
14768 /* There is no valid C++ program where a non-template type is
14769 followed by a "<". That usually indicates that the user
14770 thought that the type was a template. */
14772 none_type,
14774 }
14777 }
14779 /* Parse a type-name.
14781 type-name:
14782 class-name
14783 enum-name
14784 typedef-name
14785 simple-template-id [in c++0x]
14787 enum-name:
14788 identifier
14790 typedef-name:
14791 identifier
14793 Returns a TYPE_DECL for the type. */
14795 static tree
14797 {
14798 tree type_decl;
14800 /* We can't know yet whether it is a class-name or not. */
14802 /* Try a class-name. */
14806 none_type,
14810 /* If it's not a class-name, keep looking. */
14812 {
14814 /* It must be a typedef-name or an enum-name. */
14818 /* It is either a simple-template-id representing an
14819 instantiation of an alias template... */
14823 none_type,
14825 /* Note that this must be an instantiation of an alias template
14826 because [temp.names]/6 says:
14828 A template-id that names an alias template specialization
14829 is a type-name.
14831 Whereas [temp.names]/7 says:
14833 A simple-template-id that names a class template
14834 specialization is a class-name. */
14839 else
14843 /* ... Or a typedef-name or an enum-name. */
14845 }
14848 }
14850 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14852 enum-name:
14853 identifier
14855 typedef-name:
14856 identifier
14858 Returns a TYPE_DECL for the type. */
14860 static tree
14862 {
14863 tree type_decl;
14864 tree identifier;
14871 /* Look up the type-name. */
14878 {
14879 /* See if this is an Objective-C type. */
14884 }
14886 /* Issue an error if we did not find a type-name. */
14888 /* In Objective-C, we have the complication that class names are
14889 normally type names and start declarations (eg, the
14890 "NSObject" in "NSObject *object;"), but can be used in an
14891 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14892 is an expression. So, a classname followed by a dot is not a
14893 valid type-name. */
14896 {
14901 }
14902 /* Remember that the name was used in the definition of the
14903 current class so that we can check later to see if the
14904 meaning would have been different after the class was
14905 entirely defined. */
14911 }
14913 /* Parse an elaborated-type-specifier. Note that the grammar given
14914 here incorporates the resolution to DR68.
14916 elaborated-type-specifier:
14917 class-key :: [opt] nested-name-specifier [opt] identifier
14918 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14919 enum-key :: [opt] nested-name-specifier [opt] identifier
14920 typename :: [opt] nested-name-specifier identifier
14921 typename :: [opt] nested-name-specifier template [opt]
14922 template-id
14924 GNU extension:
14926 elaborated-type-specifier:
14927 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14928 class-key attributes :: [opt] nested-name-specifier [opt]
14929 template [opt] template-id
14930 enum attributes :: [opt] nested-name-specifier [opt] identifier
14932 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14933 declared `friend'. If IS_DECLARATION is TRUE, then this
14934 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14935 something is being declared.
14937 Returns the TYPE specified. */
14939 static tree
14943 {
14945 tree identifier;
14948 tree globalscope;
14951 /* See if we're looking at the `enum' keyword. */
14953 {
14954 /* Consume the `enum' token. */
14956 /* Remember that it's an enumeration type. */
14958 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14959 enums) is used here. */
14962 {
14966 /* Consume the `struct' or `class' and parse it anyway. */
14968 }
14969 /* Parse the attributes. */
14971 }
14972 /* Or, it might be `typename'. */
14974 RID_TYPENAME))
14975 {
14976 /* Consume the `typename' token. */
14978 /* Remember that it's a `typename' type. */
14980 }
14981 /* Otherwise it must be a class-key. */
14982 else
14983 {
14987 /* Parse the attributes. */
14989 }
14991 /* Look for the `::' operator. */
14994 /* Look for the nested-name-specifier. */
14996 {
15001 is_declaration))
15003 }
15004 else
15005 /* Even though `typename' is not present, the proposed resolution
15006 to Core Issue 180 says that in `class A<T>::B', `B' should be
15007 considered a type-name, even if `A<T>' is dependent. */
15012 is_declaration);
15013 /* For everything but enumeration types, consider a template-id.
15014 For an enumeration type, consider only a plain identifier. */
15016 {
15018 tree decl;
15020 /* Allow the `template' keyword. */
15022 /* If we didn't see `template', we don't know if there's a
15023 template-id or not. */
15026 /* Parse the template-id. */
15030 tag_type,
15031 is_declaration);
15032 /* If we didn't find a template-id, look for an ordinary
15033 identifier. */
15035 ;
15036 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15037 in effect, then we must assume that, upon instantiation, the
15038 template will correspond to a class. */
15042 typename_type,
15044 /* If the `typename' keyword is in effect and DECL is not a type
15045 decl, then type is non existent. */
15047 ;
15053 }
15056 {
15061 {
15064 }
15066 /* For a `typename', we needn't call xref_tag. */
15070 identifier,
15072 /* Look up a qualified name in the usual way. */
15074 {
15075 tree decl;
15076 tree ambiguous_decls;
15079 tag_type,
15086 /* If the lookup was ambiguous, an error will already have been
15087 issued. */
15091 /* If we are parsing friend declaration, DECL may be a
15092 TEMPLATE_DECL tree node here. However, we need to check
15093 whether this TEMPLATE_DECL results in valid code. Consider
15094 the following example:
15096 namespace N {
15097 template <class T> class C {};
15098 }
15099 class X {
15100 template <class T> friend class N::C; // #1, valid code
15101 };
15102 template <class T> class Y {
15103 friend class N::C; // #2, invalid code
15104 };
15106 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15107 name lookup of `N::C'. We see that friend declaration must
15108 be template for the code to be valid. Note that
15109 processing_template_decl does not work here since it is
15110 always 1 for the above two cases. */
15112 decl = (cp_parser_maybe_treat_template_as_class
15117 {
15120 identifier,
15123 }
15126 {
15130 allow_template);
15134 }
15136 /* Forward declarations of nested types, such as
15138 class C1::C2;
15139 class C1::C2::C3;
15141 are invalid unless all components preceding the final '::'
15142 are complete. If all enclosing types are complete, these
15143 declarations become merely pointless.
15145 Invalid forward declarations of nested types are errors
15146 caught elsewhere in parsing. Those that are pointless arrive
15147 here. */
15154 }
15155 else
15156 {
15157 /* An elaborated-type-specifier sometimes introduces a new type and
15158 sometimes names an existing type. Normally, the rule is that it
15159 introduces a new type only if there is not an existing type of
15160 the same name already in scope. For example, given:
15162 struct S {};
15163 void f() { struct S s; }
15165 the `struct S' in the body of `f' is the same `struct S' as in
15166 the global scope; the existing definition is used. However, if
15167 there were no global declaration, this would introduce a new
15168 local class named `S'.
15170 An exception to this rule applies to the following code:
15172 namespace N { struct S; }
15174 Here, the elaborated-type-specifier names a new type
15175 unconditionally; even if there is already an `S' in the
15176 containing scope this declaration names a new type.
15177 This exception only applies if the elaborated-type-specifier
15178 forms the complete declaration:
15180 [class.name]
15182 A declaration consisting solely of `class-key identifier ;' is
15183 either a redeclaration of the name in the current scope or a
15184 forward declaration of the identifier as a class name. It
15185 introduces the name into the current scope.
15187 We are in this situation precisely when the next token is a `;'.
15189 An exception to the exception is that a `friend' declaration does
15190 *not* name a new type; i.e., given:
15192 struct S { friend struct T; };
15194 `T' is not a new type in the scope of `S'.
15196 Also, `new struct S' or `sizeof (struct S)' never results in the
15197 definition of a new type; a new type can only be declared in a
15198 declaration context. */
15200 tag_scope ts;
15204 /* Friends have special name lookup rules. */
15208 CPP_SEMICOLON))
15209 /* This is a `class-key identifier ;' */
15211 else
15214 template_p =
15218 /* An unqualified name was used to reference this type, so
15219 there were no qualifying templates. */
15226 }
15227 }
15232 /* Allow attributes on forward declarations of classes. */
15234 {
15244 else
15247 }
15250 {
15251 /* Indicate whether this class was declared as a `class' or as a
15252 `struct'. */
15256 }
15258 /* A "<" cannot follow an elaborated type specifier. If that
15259 happens, the user was probably trying to form a template-id. */
15264 }
15266 /* Parse an enum-specifier.
15268 enum-specifier:
15269 enum-head { enumerator-list [opt] }
15270 enum-head { enumerator-list , } [C++0x]
15272 enum-head:
15273 enum-key identifier [opt] enum-base [opt]
15274 enum-key nested-name-specifier identifier enum-base [opt]
15276 enum-key:
15277 enum
15278 enum class [C++0x]
15279 enum struct [C++0x]
15281 enum-base: [C++0x]
15282 : type-specifier-seq
15284 opaque-enum-specifier:
15285 enum-key identifier enum-base [opt] ;
15287 GNU Extensions:
15288 enum-key attributes[opt] identifier [opt] enum-base [opt]
15289 { enumerator-list [opt] }attributes[opt]
15290 enum-key attributes[opt] identifier [opt] enum-base [opt]
15291 { enumerator-list, }attributes[opt] [C++0x]
15293 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15294 if the token stream isn't an enum-specifier after all. */
15296 static tree
15298 {
15299 tree identifier;
15301 tree prev_scope;
15303 tree attributes;
15316 /* Parse tentatively so that we can back up if we don't find a
15317 enum-specifier. */
15320 /* Caller guarantees that the current token is 'enum', an identifier
15321 possibly follows, and the token after that is an opening brace.
15322 If we don't have an identifier, fabricate an anonymous name for
15323 the enumeration being defined. */
15326 /* Parse the "class" or "struct", which indicates a scoped
15327 enumeration type in C++0x. */
15330 {
15334 /* Consume the `struct' or `class' token. */
15338 }
15342 /* Clear the qualification. */
15347 /* Figure out in what scope the declaration is being placed. */
15353 nested_name_specifier
15361 {
15362 tree name;
15366 enum_type,
15371 input_location);
15373 {
15376 {
15377 /* Are template enums allowed in ISO? */
15381 /* ignore a typename reference, for it will be solved by name
15382 in start_enum. */
15384 }
15385 }
15388 else
15391 }
15392 else
15393 {
15396 else
15397 {
15403 }
15404 }
15407 /* Check for the `:' that denotes a specified underlying type in C++0x.
15408 Note that a ':' could also indicate a bitfield width, however. */
15410 {
15411 cp_decl_specifier_seq type_specifiers;
15413 /* Consume the `:'. */
15416 /* Parse the type-specifier-seq. */
15421 /* At this point this is surely not elaborated type specifier. */
15430 /* If that didn't work, stop. */
15432 {
15438 }
15439 }
15441 /* Look for the `{' but don't consume it yet. */
15443 {
15445 {
15448 {
15451 }
15452 }
15453 /* An opaque-enum-specifier must have a ';' here. */
15456 {
15459 {
15462 }
15463 }
15464 }
15470 {
15472 {
15476 }
15478 {
15480 }
15481 }
15483 /* Issue an error message if type-definitions are forbidden here. */
15486 else
15487 /* Create the new type. We do this before consuming the opening
15488 brace so the enum will be recorded as being on the line of its
15489 tag (or the 'enum' keyword, if there is no tag). */
15493 /* If the next token is not '{' it is an opaque-enum-specifier or an
15494 elaborated-type-specifier. */
15496 {
15500 {
15501 /* The following catches invalid code such as:
15502 enum class S<int>::E { A, B, C }; */
15510 {
15514 nested_name_specifier);
15516 }
15517 /* If that scope does not contain the scope in which the
15518 class was originally declared, the program is invalid. */
15520 nested_name_specifier))
15521 {
15524 "declaration of %qD in namespace %qD which does not "
15527 else
15529 "declaration of %qD in %qD which does not "
15533 }
15534 }
15539 /* Consume the opening brace. */
15546 {
15550 }
15551 else
15552 {
15557 }
15561 /* If the next token is not '}', then there are some enumerators. */
15563 {
15567 }
15568 else
15571 /* Consume the final '}'. */
15577 }
15578 else
15579 {
15580 /* If a ';' follows, then it is an opaque-enum-specifier
15581 and additional restrictions apply. */
15583 {
15590 }
15591 }
15593 /* Look for trailing attributes to apply to this enumeration, and
15594 apply them if appropriate. */
15596 {
15600 trailing_attr,
15602 }
15604 /* Finish up the enumeration. */
15606 {
15611 }
15614 {
15616 {
15619 }
15621 {
15623 }
15624 }
15625 out:
15628 }
15630 /* Parse an enumerator-list. The enumerators all have the indicated
15631 TYPE.
15633 enumerator-list:
15634 enumerator-definition
15635 enumerator-list , enumerator-definition */
15637 static void
15639 {
15641 {
15642 /* Parse an enumerator-definition. */
15645 /* If the next token is not a ',', we've reached the end of
15646 the list. */
15649 /* Otherwise, consume the `,' and keep going. */
15651 /* If the next token is a `}', there is a trailing comma. */
15653 {
15658 }
15659 }
15660 }
15662 /* Parse an enumerator-definition. The enumerator has the indicated
15663 TYPE.
15665 enumerator-definition:
15666 enumerator
15667 enumerator = constant-expression
15669 enumerator:
15670 identifier */
15672 static void
15674 {
15675 tree identifier;
15676 tree value;
15677 location_t loc;
15679 /* Save the input location because we are interested in the location
15680 of the identifier and not the location of the explicit value. */
15683 /* Look for the identifier. */
15688 /* If the next token is an '=', then there is an explicit value. */
15690 {
15691 /* Consume the `=' token. */
15693 /* Parse the value. */
15696 NULL);
15697 }
15698 else
15701 /* If we are processing a template, make sure the initializer of the
15702 enumerator doesn't contain any bare template parameter pack. */
15706 /* integral_constant_value will pull out this expression, so make sure
15707 it's folded as appropriate. */
15710 /* Create the enumerator. */
15712 }
15714 /* Parse a namespace-name.
15716 namespace-name:
15717 original-namespace-name
15718 namespace-alias
15720 Returns the NAMESPACE_DECL for the namespace. */
15722 static tree
15724 {
15725 tree identifier;
15726 tree namespace_decl;
15730 /* Get the name of the namespace. */
15735 /* Look up the identifier in the currently active scope. Look only
15736 for namespaces, due to:
15738 [basic.lookup.udir]
15740 When looking up a namespace-name in a using-directive or alias
15741 definition, only namespace names are considered.
15743 And:
15745 [basic.lookup.qual]
15747 During the lookup of a name preceding the :: scope resolution
15748 operator, object, function, and enumerator names are ignored.
15750 (Note that cp_parser_qualifying_entity only calls this
15751 function if the token after the name is the scope resolution
15752 operator.) */
15754 none_type,
15760 /* If it's not a namespace, issue an error. */
15763 {
15768 }
15771 }
15773 /* Parse a namespace-definition.
15775 namespace-definition:
15776 named-namespace-definition
15777 unnamed-namespace-definition
15779 named-namespace-definition:
15780 original-namespace-definition
15781 extension-namespace-definition
15783 original-namespace-definition:
15784 namespace identifier { namespace-body }
15786 extension-namespace-definition:
15787 namespace original-namespace-name { namespace-body }
15789 unnamed-namespace-definition:
15790 namespace { namespace-body } */
15792 static void
15794 {
15801 {
15805 }
15806 else
15809 /* Look for the `namespace' keyword. */
15812 /* Get the name of the namespace. We do not attempt to distinguish
15813 between an original-namespace-definition and an
15814 extension-namespace-definition at this point. The semantic
15815 analysis routines are responsible for that. */
15818 else
15821 /* Parse any specified attributes. */
15824 /* Look for the `{' to start the namespace. */
15826 /* Start the namespace. */
15829 /* "inline namespace" is equivalent to a stub namespace definition
15830 followed by a strong using directive. */
15832 {
15834 /* Set up namespace association. */
15838 /* Import the contents of the inline namespace. */
15842 }
15846 /* Parse the body of the namespace. */
15852 /* Finish the namespace. */
15854 /* Look for the final `}'. */
15856 }
15858 /* Parse a namespace-body.
15860 namespace-body:
15861 declaration-seq [opt] */
15863 static void
15865 {
15867 }
15869 /* Parse a namespace-alias-definition.
15871 namespace-alias-definition:
15872 namespace identifier = qualified-namespace-specifier ; */
15874 static void
15876 {
15877 tree identifier;
15878 tree namespace_specifier;
15882 /* Look for the `namespace' keyword. */
15884 /* Look for the identifier. */
15888 /* Look for the `=' token. */
15891 {
15893 /* Skip the definition. */
15898 }
15900 /* Look for the qualified-namespace-specifier. */
15901 namespace_specifier
15903 /* Look for the `;' token. */
15906 /* Register the alias in the symbol table. */
15908 }
15910 /* Parse a qualified-namespace-specifier.
15912 qualified-namespace-specifier:
15913 :: [opt] nested-name-specifier [opt] namespace-name
15915 Returns a NAMESPACE_DECL corresponding to the specified
15916 namespace. */
15918 static tree
15920 {
15921 /* Look for the optional `::'. */
15925 /* Look for the optional nested-name-specifier. */
15933 }
15935 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15936 access declaration.
15938 using-declaration:
15939 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15940 using :: unqualified-id ;
15942 access-declaration:
15943 qualified-id ;
15945 */
15947 static bool
15950 {
15954 tree decl;
15955 tree identifier;
15956 tree qscope;
15961 {
15964 }
15965 else
15966 {
15967 /* Look for the `using' keyword. */
15970 /* Peek at the next token. */
15972 /* See if it's `typename'. */
15974 {
15975 /* Remember that we've seen it. */
15977 /* Consume the `typename' token. */
15979 }
15980 }
15982 /* Look for the optional global scope qualification. */
15983 global_scope_p
15988 /* If we saw `typename', or didn't see `::', then there must be a
15989 nested-name-specifier present. */
15991 {
15997 {
16000 }
16001 }
16002 /* Otherwise, we could be in either of the two productions. In that
16003 case, treat the nested-name-specifier as optional. */
16004 else
16014 /* Something has already gone wrong; there's no need to parse
16015 further. Since an error has occurred, the return value of
16016 cp_parser_parse_definitely will be false, as required. */
16020 /* Parse the unqualified-id. */
16028 {
16033 }
16035 /* The function we call to handle a using-declaration is different
16036 depending on what scope we are in. */
16038 ;
16041 /* [namespace.udecl]
16043 A using declaration shall not name a template-id. */
16046 else
16047 {
16049 {
16050 /* Create the USING_DECL. */
16057 {
16060 }
16061 else
16062 /* Add it to the list of members in this class. */
16064 }
16065 else
16066 {
16068 identifier,
16075 {
16078 }
16081 else
16083 }
16084 }
16086 /* Look for the final `;'. */
16091 "access declarations are deprecated "
16092 "in favour of using-declarations; "
16096 }
16098 /* Parse an alias-declaration.
16100 alias-declaration:
16101 using identifier attribute-specifier-seq [opt] = type-id */
16103 static tree
16105 {
16107 location_t id_location;
16109 cp_decl_specifier_seq decl_specs;
16113 /* Look for the `using' keyword. */
16114 cp_token *using_token
16135 /* Now we are going to parse the type-id of the declaration. */
16137 /*
16138 [dcl.type]/3 says:
16140 "A type-specifier-seq shall not define a class or enumeration
16141 unless it appears in the type-id of an alias-declaration (7.1.3) that
16142 is not the declaration of a template-declaration."
16144 In other words, if we currently are in an alias template, the
16145 type-id should not define a type.
16147 So let's set parser->type_definition_forbidden_message in that
16148 case; cp_parser_check_type_definition (called by
16149 cp_parser_class_specifier) will then emit an error if a type is
16150 defined in the type-id. */
16152 {
16156 }
16160 /* Restore the error message if need be. */
16165 {
16168 }
16173 {
16176 }
16178 /* A typedef-name can also be introduced by an alias-declaration. The
16179 identifier following the using keyword becomes a typedef-name. It has
16180 the same semantics as if it were introduced by the typedef
16181 specifier. In particular, it does not define a new type and it shall
16182 not appear in the type-id. */
16187 {
16190 ds_attribute,
16191 attrs_token);
16192 }
16194 ds_typedef,
16195 using_token);
16197 ds_alias,
16198 using_token);
16207 else
16218 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16219 added into the symbol table; otherwise, return the TYPE_DECL. */
16223 {
16227 }
16230 }
16232 /* Parse a using-directive.
16234 using-directive:
16235 using namespace :: [opt] nested-name-specifier [opt]
16236 namespace-name ; */
16238 static void
16240 {
16241 tree namespace_decl;
16242 tree attribs;
16244 /* Look for the `using' keyword. */
16246 /* And the `namespace' keyword. */
16248 /* Look for the optional `::' operator. */
16250 /* And the optional nested-name-specifier. */
16256 /* Get the namespace being used. */
16258 /* And any specified attributes. */
16260 /* Update the symbol table. */
16262 /* Look for the final `;'. */
16264 }
16266 /* Parse an asm-definition.
16268 asm-definition:
16269 asm ( string-literal ) ;
16271 GNU Extension:
16273 asm-definition:
16274 asm volatile [opt] ( string-literal ) ;
16275 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16276 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16277 : asm-operand-list [opt] ) ;
16278 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16279 : asm-operand-list [opt]
16280 : asm-clobber-list [opt] ) ;
16281 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16282 : asm-clobber-list [opt]
16283 : asm-goto-list ) ; */
16285 static void
16287 {
16288 tree string;
16293 tree asm_stmt;
16301 /* Look for the `asm' keyword. */
16303 /* See if the next token is `volatile'. */
16306 {
16307 /* Remember that we saw the `volatile' keyword. */
16309 /* Consume the token. */
16311 }
16315 {
16316 /* Remember that we saw the `goto' keyword. */
16318 /* Consume the token. */
16320 }
16321 /* Look for the opening `('. */
16324 /* Look for the string. */
16327 {
16331 }
16333 /* If we're allowing GNU extensions, check for the extended assembly
16334 syntax. Unfortunately, the `:' tokens need not be separated by
16335 a space in C, and so, for compatibility, we tolerate that here
16336 too. Doing that means that we have to treat the `::' operator as
16337 two `:' tokens. */
16342 {
16347 /* The extended syntax was used. */
16350 /* Look for outputs. */
16352 {
16353 /* Consume the `:'. */
16355 /* Parse the output-operands. */
16357 CPP_COLON)
16359 CPP_SCOPE)
16361 CPP_CLOSE_PAREN)
16367 }
16368 /* If the next token is `::', there are no outputs, and the
16369 next token is the beginning of the inputs. */
16371 /* The inputs are coming next. */
16374 /* Look for inputs. */
16377 {
16378 /* Consume the `:' or `::'. */
16380 /* Parse the output-operands. */
16382 CPP_COLON)
16384 CPP_SCOPE)
16386 CPP_CLOSE_PAREN))
16391 }
16393 /* The clobbers are coming next. */
16396 /* Look for clobbers. */
16399 {
16401 /* Consume the `:' or `::'. */
16403 /* Parse the clobbers. */
16405 CPP_COLON)
16407 CPP_CLOSE_PAREN))
16409 }
16412 /* The labels are coming next. */
16415 /* Look for labels. */
16418 {
16420 /* Consume the `:' or `::'. */
16422 /* Parse the labels. */
16424 }
16428 }
16432 /* Look for the closing `)'. */
16440 {
16441 /* Create the ASM_EXPR. */
16443 {
16446 /* If the extended syntax was not used, mark the ASM_EXPR. */
16448 {
16454 }
16455 }
16456 else
16458 }
16459 }
16461 /* Declarators [gram.dcl.decl] */
16463 /* Parse an init-declarator.
16465 init-declarator:
16466 declarator initializer [opt]
16468 GNU Extension:
16470 init-declarator:
16471 declarator asm-specification [opt] attributes [opt] initializer [opt]
16473 function-definition:
16474 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16475 function-body
16476 decl-specifier-seq [opt] declarator function-try-block
16478 GNU Extension:
16480 function-definition:
16481 __extension__ function-definition
16483 TM Extension:
16485 function-definition:
16486 decl-specifier-seq [opt] declarator function-transaction-block
16488 The DECL_SPECIFIERS apply to this declarator. Returns a
16489 representation of the entity declared. If MEMBER_P is TRUE, then
16490 this declarator appears in a class scope. The new DECL created by
16491 this declarator is returned.
16493 The CHECKS are access checks that should be performed once we know
16494 what entity is being declared (and, therefore, what classes have
16495 befriended it).
16497 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16498 for a function-definition here as well. If the declarator is a
16499 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16500 be TRUE upon return. By that point, the function-definition will
16501 have been completely parsed.
16503 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16504 is FALSE.
16506 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16507 parsed declaration if it is an uninitialized single declarator not followed
16508 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16509 if present, will not be consumed. If returned, this declarator will be
16510 created with SD_INITIALIZED but will not call cp_finish_decl. */
16512 static tree
16521 {
16525 tree prefix_attributes;
16527 tree asm_specification;
16528 tree initializer;
16530 tree scope;
16532 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16533 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16534 "(...)". */
16544 /* Gather the attributes that were provided with the
16545 decl-specifiers. */
16548 /* Assume that this is not the declarator for a function
16549 definition. */
16553 /* Default arguments are only permitted for function parameters. */
16557 /* Defer access checks while parsing the declarator; we cannot know
16558 what names are accessible until we know what is being
16559 declared. */
16562 /* Parse the declarator. */
16564 declarator
16568 member_p);
16569 /* Gather up the deferred checks. */
16574 /* If the DECLARATOR was erroneous, there's no need to go
16575 further. */
16579 /* Check that the number of template-parameter-lists is OK. */
16589 /* Figure out what scope the entity declared by the DECLARATOR is
16590 located in. `grokdeclarator' sometimes changes the scope, so
16591 we compute it now. */
16594 /* Perform any lookups in the declared type which were thought to be
16595 dependent, but are not in the scope of the declarator. */
16596 decl_specifiers->type
16599 /* If we're allowing GNU extensions, look for an
16600 asm-specification. */
16602 {
16603 /* Look for an asm-specification. */
16606 }
16607 else
16610 /* Look for attributes. */
16614 /* Peek at the next token. */
16618 {
16619 /* Check to see if the token indicates the start of a
16620 function-definition. */
16622 {
16624 {
16625 /* If a function-definition should not appear here, issue an
16626 error message. */
16630 }
16632 location_t func_brace_location
16635 /* Neither attributes nor an asm-specification are allowed
16636 on a function-definition. */
16639 "an asm-specification is not allowed "
16643 "attributes are not allowed "
16645 /* This is a function-definition. */
16648 /* Parse the function definition. */
16651 decl_specifiers,
16652 declarator,
16653 prefix_attributes);
16654 else
16655 decl =
16656 (cp_parser_function_definition_from_specifiers_and_declarator
16660 {
16661 /* This is where the prologue starts... */
16664 }
16667 }
16668 }
16670 /* [dcl.dcl]
16672 Only in function declarations for constructors, destructors, and
16673 type conversions can the decl-specifier-seq be omitted.
16675 We explicitly postpone this check past the point where we handle
16676 function-definitions because we tolerate function-definitions
16677 that are missing their return types in some modes. */
16679 {
16683 }
16685 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16689 {
16697 {
16703 }
16704 }
16705 else
16706 {
16707 /* If the init-declarator isn't initialized and isn't followed by a
16708 `,' or `;', it's not a valid init-declarator. */
16711 {
16714 else
16715 {
16718 }
16719 }
16722 }
16724 /* Because start_decl has side-effects, we should only call it if we
16725 know we're going ahead. By this point, we know that we cannot
16726 possibly be looking at any other construct. */
16729 /* If the decl specifiers were bad, issue an error now that we're
16730 sure this was intended to be a declarator. Then continue
16731 declaring the variable(s), as int, to try to cut down on further
16732 errors. */
16735 {
16738 }
16740 /* Check to see whether or not this declaration is a friend. */
16743 /* Enter the newly declared entry in the symbol table. If we're
16744 processing a declaration in a class-specifier, we wait until
16745 after processing the initializer. */
16747 {
16754 /* Adjust location of decl if declarator->id_loc is more appropriate:
16755 set, and decl wasn't merged with another decl, in which case its
16756 location would be different from input_location, and more accurate. */
16761 }
16763 /* Enter the SCOPE. That way unqualified names appearing in the
16764 initializer will be looked up in SCOPE. */
16767 /* Perform deferred access control checks, now that we know in which
16768 SCOPE the declared entity resides. */
16770 {
16773 /* If the entity being declared is a function, pretend that we
16774 are in its scope. If it is a `friend', it may have access to
16775 things that would not otherwise be accessible. */
16777 {
16780 }
16782 /* Perform access checks for template parameters. */
16785 /* Perform the access control checks for the declarator and the
16786 decl-specifiers. */
16789 /* Restore the saved value. */
16792 }
16794 /* Parse the initializer. */
16799 {
16801 {
16805 else
16806 {
16807 /* If the declaration was erroneous, we don't really
16808 know what the user intended, so just silently
16809 consume the initializer. */
16817 }
16818 }
16819 else
16820 {
16821 /* We want to record the extra mangling scope for in-class
16822 initializers of class members and initializers of static data
16823 member templates. The former involves deferring
16824 parsing of the initializer until end of class as with default
16825 arguments. So right here we only handle the latter. */
16835 }
16836 }
16838 /* The old parser allows attributes to appear after a parenthesized
16839 initializer. Mark Mitchell proposed removing this functionality
16840 on the GCC mailing lists on 2002-08-13. This parser accepts the
16841 attributes -- but ignores them. */
16848 /* A non-template declaration involving a function parameter list containing
16849 an implicit template parameter will have been made into a template. If it
16850 turns out that the resulting declaration is not an actual function then
16851 finish the template declaration here. An error message will already have
16852 been issued. */
16857 /* For an in-class declaration, use `grokfield' to create the
16858 declaration. */
16860 {
16862 {
16865 }
16873 }
16875 /* Finish processing the declaration. But, skip member
16876 declarations. */
16878 {
16881 asm_specification,
16882 /* If the initializer is in parentheses, then this is
16883 a direct-initialization, which means that an
16884 `explicit' constructor is OK. Otherwise, an
16885 `explicit' constructor cannot be used. */
16888 /* Check for and warn about self-initialization if -Wself-assign is
16889 enabled. */
16892 }
16895 /* Core issue #226 (C++0x only): A default template-argument
16896 shall not be specified in a friend class template
16897 declaration. */
16906 {
16909 else
16911 }
16914 }
16916 /* Parse a declarator.
16918 declarator:
16919 direct-declarator
16920 ptr-operator declarator
16922 abstract-declarator:
16923 ptr-operator abstract-declarator [opt]
16924 direct-abstract-declarator
16926 GNU Extensions:
16928 declarator:
16929 attributes [opt] direct-declarator
16930 attributes [opt] ptr-operator declarator
16932 abstract-declarator:
16933 attributes [opt] ptr-operator abstract-declarator [opt]
16934 attributes [opt] direct-abstract-declarator
16936 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16937 detect constructor, destructor or conversion operators. It is set
16938 to -1 if the declarator is a name, and +1 if it is a
16939 function. Otherwise it is set to zero. Usually you just want to
16940 test for >0, but internally the negative value is used.
16942 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16943 a decl-specifier-seq unless it declares a constructor, destructor,
16944 or conversion. It might seem that we could check this condition in
16945 semantic analysis, rather than parsing, but that makes it difficult
16946 to handle something like `f()'. We want to notice that there are
16947 no decl-specifiers, and therefore realize that this is an
16948 expression, not a declaration.)
16950 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16951 the declarator is a direct-declarator of the form "(...)".
16953 MEMBER_P is true iff this declarator is a member-declarator. */
16957 cp_parser_declarator_kind dcl_kind,
16961 {
16964 cp_cv_quals cv_quals;
16965 tree class_type;
16968 /* Assume this is not a constructor, destructor, or type-conversion
16969 operator. */
16976 /* Check for the ptr-operator production. */
16978 /* Parse the ptr-operator. */
16984 /* If that worked, then we have a ptr-operator. */
16986 {
16987 /* If a ptr-operator was found, then this declarator was not
16988 parenthesized. */
16991 /* The dependent declarator is optional if we are parsing an
16992 abstract-declarator. */
16996 /* Parse the dependent declarator. */
17002 /* If we are parsing an abstract-declarator, we must handle the
17003 case where the dependent declarator is absent. */
17008 declarator = cp_parser_make_indirect_declarator
17010 }
17011 /* Everything else is a direct-declarator. */
17012 else
17013 {
17016 CPP_OPEN_PAREN);
17018 ctor_dtor_or_conv_p,
17019 member_p);
17020 }
17025 }
17027 /* Parse a direct-declarator or direct-abstract-declarator.
17029 direct-declarator:
17030 declarator-id
17031 direct-declarator ( parameter-declaration-clause )
17032 cv-qualifier-seq [opt]
17033 ref-qualifier [opt]
17034 exception-specification [opt]
17035 direct-declarator [ constant-expression [opt] ]
17036 ( declarator )
17038 direct-abstract-declarator:
17039 direct-abstract-declarator [opt]
17040 ( parameter-declaration-clause )
17041 cv-qualifier-seq [opt]
17042 ref-qualifier [opt]
17043 exception-specification [opt]
17044 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17045 ( abstract-declarator )
17047 Returns a representation of the declarator. DCL_KIND is
17048 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17049 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17050 we are parsing a direct-declarator. It is
17051 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17052 of ambiguity we prefer an abstract declarator, as per
17053 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17054 cp_parser_declarator. */
17058 cp_parser_declarator_kind dcl_kind,
17061 {
17071 {
17072 /* Peek at the next token. */
17075 {
17076 /* This is either a parameter-declaration-clause, or a
17077 parenthesized declarator. When we know we are parsing a
17078 named declarator, it must be a parenthesized declarator
17079 if FIRST is true. For instance, `(int)' is a
17080 parameter-declaration-clause, with an omitted
17081 direct-abstract-declarator. But `((*))', is a
17082 parenthesized abstract declarator. Finally, when T is a
17083 template parameter `(T)' is a
17084 parameter-declaration-clause, and not a parenthesized
17085 named declarator.
17087 We first try and parse a parameter-declaration-clause,
17088 and then try a nested declarator (if FIRST is true).
17090 It is not an error for it not to be a
17091 parameter-declaration-clause, even when FIRST is
17092 false. Consider,
17094 int i (int);
17095 int i (3);
17097 The first is the declaration of a function while the
17098 second is the definition of a variable, including its
17099 initializer.
17101 Having seen only the parenthesis, we cannot know which of
17102 these two alternatives should be selected. Even more
17103 complex are examples like:
17105 int i (int (a));
17106 int i (int (3));
17108 The former is a function-declaration; the latter is a
17109 variable initialization.
17111 Thus again, we try a parameter-declaration-clause, and if
17112 that fails, we back out and return. */
17115 {
17116 tree params;
17119 /* In a member-declarator, the only valid interpretation
17120 of a parenthesis is the start of a
17121 parameter-declaration-clause. (It is invalid to
17122 initialize a static data member with a parenthesized
17123 initializer; only the "=" form of initialization is
17124 permitted.) */
17128 /* Consume the `('. */
17131 {
17132 /* If this is going to be an abstract declarator, we're
17133 in a declarator and we can't have default args. */
17136 }
17140 /* Parse the parameter-declaration-clause. */
17143 /* Consume the `)'. */
17146 /* If all went well, parse the cv-qualifier-seq,
17147 ref-qualifier and the exception-specification. */
17149 {
17150 cp_cv_quals cv_quals;
17151 cp_virt_specifiers virt_specifiers;
17152 cp_ref_qualifier ref_qual;
17153 tree exception_specification;
17154 tree late_return;
17155 tree attrs;
17165 /* Parse the cv-qualifier-seq. */
17167 /* Parse the ref-qualifier. */
17169 /* And the exception-specification. */
17170 exception_specification
17175 /* In here, we handle cases where attribute is used after
17176 the function declaration. For example:
17177 void func (int x) __attribute__((vector(..))); */
17180 {
17184 CPP_SEMICOLON)
17186 CPP_OPEN_BRACE))
17189 ;
17190 else
17192 }
17193 late_return = (cp_parser_late_return_type_opt
17198 /* Parse the virt-specifier-seq. */
17201 /* Create the function-declarator. */
17203 params,
17204 cv_quals,
17205 virt_specifiers,
17206 ref_qual,
17207 exception_specification,
17208 late_return);
17210 /* Any subsequent parameter lists are to do with
17211 return type, so are not those of the declared
17212 function. */
17214 }
17216 /* Remove the function parms from scope. */
17220 /* Repeat the main loop. */
17222 }
17224 /* If this is the first, we can try a parenthesized
17225 declarator. */
17227 {
17233 /* Consume the `('. */
17235 /* Parse the nested declarator. */
17238 declarator
17241 member_p);
17244 /* Expect a `)'. */
17251 }
17252 /* Otherwise, we must be done. */
17253 else
17255 }
17259 {
17260 /* Parse an array-declarator. */
17269 /* Consume the `['. */
17271 /* Peek at the next token. */
17273 /* If the next token is `]', then there is no
17274 constant-expression. */
17276 {
17278 bounds
17288 {
17289 /* Normally, the array bound must be an integral constant
17290 expression. However, as an extension, we allow VLAs
17291 in function scopes as long as they aren't part of a
17292 parameter declaration. */
17296 }
17299 {
17300 /* Remember this wasn't a constant-expression. */
17303 }
17304 }
17305 else
17307 /* Look for the closing `]'. */
17309 {
17312 }
17317 }
17319 {
17320 {
17321 tree qualifying_scope;
17322 tree unqualified_name;
17323 tree attrs;
17324 special_function_kind sfk;
17329 /* Parse a declarator-id */
17332 {
17335 /* If we see an ellipsis, we should be looking at a
17336 parameter pack. */
17338 {
17339 /* Consume the `...' */
17343 }
17344 }
17347 unqualified_name
17351 {
17355 {
17356 /* Check whether an error occurred. */
17359 /* We already consumed the ellipsis to mark a
17360 parameter pack, but we have no way to report it,
17361 so abort the tentative parse. We will be exiting
17362 immediately anyway. */
17364 }
17365 else
17371 && (qualifying_scope
17373 {
17376 }
17377 }
17382 {
17387 }
17393 {
17394 /* In the declaration of a member of a template class
17395 outside of the class itself, the SCOPE will sometimes
17396 be a TYPENAME_TYPE. For example, given:
17398 template <typename T>
17399 int S<T>::R::i = 3;
17401 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17402 this context, we must resolve S<T>::R to an ordinary
17403 type, rather than a typename type.
17405 The reason we normally avoid resolving TYPENAME_TYPEs
17406 is that a specialization of `S' might render
17407 `S<T>::R' not a type. However, if `S' is
17408 specialized, then this `i' will not be used, so there
17409 is no harm in resolving the types here. */
17410 tree type;
17412 /* Resolve the TYPENAME_TYPE. */
17415 /* If that failed, the declarator is invalid. */
17417 {
17420 "cannot define member of dependent typedef "
17422 else
17427 }
17429 }
17434 {
17435 tree class_type;
17440 else
17444 {
17447 {
17450 {
17454 "use %<%T::%D%> instead of %<%T::%D%> to "
17456 class_type,
17461 }
17462 else
17464 }
17465 else
17466 {
17467 /* We do not attempt to print the declarator
17468 here because we do not have enough
17469 information about its original syntactic
17470 form. */
17474 }
17475 }
17478 {
17484 for an anonymous type, even if the type
17485 got a name for linkage purposes. */
17488 class_type))
17489 {
17492 }
17500 }
17501 }
17503 unqualified_name,
17504 sfk);
17511 }
17513 handle_declarator:;
17516 {
17517 /* Any names that appear after the declarator-id for a
17518 member are looked up in the containing scope. */
17520 {
17521 /* But declarations with qualified-ids can't appear in a
17522 function. */
17526 }
17528 }
17532 /* Default args are only allowed on function
17533 declarations. */
17535 else
17539 }
17540 /* We're done. */
17541 else
17543 }
17545 /* For an abstract declarator, we might wind up with nothing at this
17546 point. That's an error; the declarator is not optional. */
17550 /* If we entered a scope, we must exit it now. */
17558 }
17560 /* Parse a ptr-operator.
17562 ptr-operator:
17563 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17564 * cv-qualifier-seq [opt]
17565 &
17566 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17567 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17569 GNU Extension:
17571 ptr-operator:
17572 & cv-qualifier-seq [opt]
17574 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17575 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17576 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17577 filled in with the TYPE containing the member. *CV_QUALS is
17578 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17579 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17580 Note that the tree codes returned by this function have nothing
17581 to do with the types of trees that will be eventually be created
17582 to represent the pointer or reference type being parsed. They are
17583 just constants with suggestive names. */
17584 static enum tree_code
17589 {
17594 /* Assume that it's not a pointer-to-member. */
17596 /* And that there are no cv-qualifiers. */
17599 /* Peek at the next token. */
17602 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17612 {
17613 /* Consume the `*', `&' or `&&'. */
17616 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17617 `&', if we are allowing GNU extensions. (The only qualifier
17618 that can legally appear after `&' is `restrict', but that is
17619 enforced during semantic analysis. */
17627 }
17628 else
17629 {
17630 /* Try the pointer-to-member case. */
17632 /* Look for the optional `::' operator. */
17635 /* Look for the nested-name specifier. */
17642 /* If we found it, and the next token is a `*', then we are
17643 indeed looking at a pointer-to-member operator. */
17646 {
17647 /* Indicate that the `*' operator was used. */
17655 else
17656 {
17657 /* The type of which the member is a member is given by the
17658 current SCOPE. */
17660 /* The next name will not be qualified. */
17664 /* Look for optional c++11 attributes. */
17668 /* Look for the optional cv-qualifier-seq. */
17670 }
17671 }
17672 /* If that didn't work we don't have a ptr-operator. */
17675 }
17678 }
17680 /* Parse an (optional) cv-qualifier-seq.
17682 cv-qualifier-seq:
17683 cv-qualifier cv-qualifier-seq [opt]
17685 cv-qualifier:
17686 const
17687 volatile
17689 GNU Extension:
17691 cv-qualifier:
17692 __restrict__
17694 Returns a bitmask representing the cv-qualifiers. */
17696 static cp_cv_quals
17698 {
17702 {
17704 cp_cv_quals cv_qualifier;
17706 /* Peek at the next token. */
17708 /* See if it's a cv-qualifier. */
17710 {
17726 }
17732 {
17735 }
17736 else
17737 {
17740 }
17741 }
17744 }
17746 /* Parse an (optional) ref-qualifier
17748 ref-qualifier:
17749 &
17750 &&
17752 Returns cp_ref_qualifier representing ref-qualifier. */
17754 static cp_ref_qualifier
17756 {
17759 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17764 {
17769 {
17781 }
17786 {
17789 }
17790 else
17791 {
17794 }
17795 }
17798 }
17800 /* Parse an (optional) virt-specifier-seq.
17802 virt-specifier-seq:
17803 virt-specifier virt-specifier-seq [opt]
17805 virt-specifier:
17806 override
17807 final
17809 Returns a bitmask representing the virt-specifiers. */
17811 static cp_virt_specifiers
17813 {
17817 {
17819 cp_virt_specifiers virt_specifier;
17821 /* Peek at the next token. */
17823 /* See if it's a virt-specifier-qualifier. */
17827 {
17830 }
17832 {
17835 }
17837 {
17839 }
17840 else
17844 {
17847 }
17848 else
17849 {
17852 }
17853 }
17855 }
17857 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17858 is in scope even though it isn't real. */
17860 static void
17862 {
17863 tree this_parm;
17866 {
17867 /* We don't clear this between NSDMIs. Is it already what we want? */
17872 }
17875 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17877 current_class_ref
17880 }
17882 /* Return true iff our current scope is a non-static data member
17883 initializer. */
17885 bool
17887 {
17888 /* We recognize NSDMI context by the context-less 'this' pointer set up
17889 by the function above. */
17893 }
17895 /* Parse a late-specified return type, if any. This is not a separate
17896 non-terminal, but part of a function declarator, which looks like
17898 -> trailing-type-specifier-seq abstract-declarator(opt)
17900 Returns the type indicated by the type-id.
17902 In addition to this this parses any queued up omp declare simd
17903 clauses and Cilk Plus SIMD-enabled function's vector attributes.
17905 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17906 function. */
17908 static tree
17910 cp_cv_quals quals)
17911 {
17915 && declarator
17921 /* Peek at the next token. */
17923 /* A late-specified return type is indicated by an initial '->'. */
17930 {
17931 /* DR 1207: 'this' is in scope in the trailing return type. */
17933 }
17936 {
17937 /* Consume the ->. */
17941 }
17944 declarator->std_attributes
17948 declarator->std_attributes
17953 {
17956 }
17959 }
17961 /* Parse a declarator-id.
17963 declarator-id:
17964 id-expression
17965 :: [opt] nested-name-specifier [opt] type-name
17967 In the `id-expression' case, the value returned is as for
17968 cp_parser_id_expression if the id-expression was an unqualified-id.
17969 If the id-expression was a qualified-id, then a SCOPE_REF is
17970 returned. The first operand is the scope (either a NAMESPACE_DECL
17971 or TREE_TYPE), but the second is still just a representation of an
17972 unqualified-id. */
17974 static tree
17976 {
17977 tree id;
17978 /* The expression must be an id-expression. Assume that qualified
17979 names are the names of types so that:
17981 template <class T>
17982 int S<T>::R::i = 3;
17984 will work; we must treat `S<T>::R' as the name of a type.
17985 Similarly, assume that qualified names are templates, where
17986 required, so that:
17988 template <class T>
17989 int S<T>::R<T>::i = 3;
17991 will work, too. */
17997 optional_p);
18001 }
18003 /* Parse a type-id.
18005 type-id:
18006 type-specifier-seq abstract-declarator [opt]
18008 Returns the TYPE specified. */
18010 static tree
18013 {
18014 cp_decl_specifier_seq type_specifier_seq;
18017 /* Parse the type-specifier-seq. */
18019 is_trailing_return,
18024 /* There might or might not be an abstract declarator. */
18026 /* Look for the declarator. */
18027 abstract_declarator
18031 /* Check to see if there really was a declarator. */
18036 /* None of the valid uses of 'auto' in C++14 involve the type-id
18037 nonterminal, but it is valid in a trailing-return-type. */
18040 {
18041 /* A type-id with type 'auto' is only ok if the abstract declarator
18042 is a function declarator with a late-specified return type. */
18047 else
18048 {
18051 }
18052 }
18055 is_template_arg);
18056 }
18059 {
18061 }
18064 {
18065 tree r;
18067 parser->type_definition_forbidden_message
18072 {
18075 }
18077 }
18080 {
18082 }
18084 /* Parse a type-specifier-seq.
18086 type-specifier-seq:
18087 type-specifier type-specifier-seq [opt]
18089 GNU extension:
18091 type-specifier-seq:
18092 attributes type-specifier-seq [opt]
18094 If IS_DECLARATION is true, we are at the start of a "condition" or
18095 exception-declaration, so we might be followed by a declarator-id.
18097 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18098 i.e. we've just seen "->".
18100 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18102 static void
18107 {
18112 /* Clear the TYPE_SPECIFIER_SEQ. */
18115 /* In the context of a trailing return type, enum E { } is an
18116 elaborated-type-specifier followed by a function-body, not an
18117 enum-specifier. */
18121 /* Parse the type-specifiers and attributes. */
18123 {
18124 tree type_specifier;
18127 /* Check for attributes first. */
18129 {
18134 }
18136 /* record the token of the beginning of the type specifier seq,
18137 for error reporting purposes*/
18141 /* Look for the type-specifier. */
18143 flags,
18144 type_specifier_seq,
18146 NULL,
18149 {
18150 /* If the first type-specifier could not be found, this is not a
18151 type-specifier-seq at all. */
18153 {
18154 /* Set in_declarator_p to avoid skipping to the semicolon. */
18166 }
18167 /* If subsequent type-specifiers could not be found, the
18168 type-specifier-seq is complete. */
18170 }
18173 /* The standard says that a condition can be:
18175 type-specifier-seq declarator = assignment-expression
18177 However, given:
18179 struct S {};
18180 if (int S = ...)
18182 we should treat the "S" as a declarator, not as a
18183 type-specifier. The standard doesn't say that explicitly for
18184 type-specifier-seq, but it does say that for
18185 decl-specifier-seq in an ordinary declaration. Perhaps it
18186 would be clearer just to allow a decl-specifier-seq here, and
18187 then add a semantic restriction that if any decl-specifiers
18188 that are not type-specifiers appear, the program is invalid. */
18191 }
18192 }
18194 /* Return whether the function currently being declared has an associated
18195 template parameter list. */
18197 static bool
18199 {
18212 }
18214 /* Parse a parameter-declaration-clause.
18216 parameter-declaration-clause:
18217 parameter-declaration-list [opt] ... [opt]
18218 parameter-declaration-list , ...
18220 Returns a representation for the parameter declarations. A return
18221 value of NULL indicates a parameter-declaration-clause consisting
18222 only of an ellipsis. */
18224 static tree
18226 {
18227 tree parameters;
18236 parser->auto_is_implicit_function_template_parm_p
18238 }
18244 && !processing_template_parmlist
18250 /* Peek at the next token. */
18252 /* Check for trivial parameter-declaration-clauses. */
18254 {
18255 /* Consume the `...' token. */
18258 }
18260 /* There are no parameters. */
18261 {
18262 #ifndef NO_IMPLICIT_EXTERN_C
18267 else
18268 #endif
18270 }
18271 /* Check for `(void)', too, which is a special case. */
18275 {
18276 /* Consume the `void' token. */
18278 /* There are no parameters. */
18280 }
18282 /* Parse the parameter-declaration-list. */
18284 /* If a parse error occurred while parsing the
18285 parameter-declaration-list, then the entire
18286 parameter-declaration-clause is erroneous. */
18290 /* Peek at the next token. */
18292 /* If it's a `,', the clause should terminate with an ellipsis. */
18294 {
18295 /* Consume the `,'. */
18297 /* Expect an ellipsis. */
18298 ellipsis_p
18300 }
18301 /* It might also be `...' if the optional trailing `,' was
18302 omitted. */
18304 {
18305 /* Consume the `...' token. */
18307 /* And remember that we saw it. */
18309 }
18310 else
18313 /* Finish the parameter list. */
18318 }
18320 /* Parse a parameter-declaration-list.
18322 parameter-declaration-list:
18323 parameter-declaration
18324 parameter-declaration-list , parameter-declaration
18326 Returns a representation of the parameter-declaration-list, as for
18327 cp_parser_parameter_declaration_clause. However, the
18328 `void_list_node' is never appended to the list. Upon return,
18329 *IS_ERROR will be true iff an error occurred. */
18331 static tree
18333 {
18339 /* Assume all will go well. */
18341 /* The special considerations that apply to a function within an
18342 unbraced linkage specifications do not apply to the parameters
18343 to the function. */
18344 saved_in_unbraced_linkage_specification_p
18348 /* Look for more parameters. */
18350 {
18358 /* Parse the parameter. */
18359 parameter
18364 /* We don't know yet if the enclosing context is deprecated, so wait
18365 and warn in grokparms if appropriate. */
18369 {
18370 /* If a function parameter pack was specified and an implicit template
18371 parameter was introduced during cp_parser_parameter_declaration,
18372 change any implicit parameters introduced into packs. */
18376 {
18384 }
18388 PARM,
18391 }
18395 /* If a parse error occurred parsing the parameter declaration,
18396 then the entire parameter-declaration-list is erroneous. */
18398 {
18402 }
18412 {
18416 }
18418 /* Add the new parameter to the list. */
18422 /* Peek at the next token. */
18425 /* These are for Objective-C++ */
18428 /* The parameter-declaration-list is complete. */
18431 {
18434 /* Peek at the next token. */
18436 /* If it's an ellipsis, then the list is complete. */
18439 /* Otherwise, there must be more parameters. Consume the
18440 `,'. */
18442 /* When parsing something like:
18444 int i(float f, double d)
18446 we can tell after seeing the declaration for "f" that we
18447 are not looking at an initialization of a variable "i",
18448 but rather at the declaration of a function "i".
18450 Due to the fact that the parsing of template arguments
18451 (as specified to a template-id) requires backtracking we
18452 cannot use this technique when inside a template argument
18453 list. */
18457 /* However, a parameter-declaration of the form
18458 "float(f)" (which is a valid declaration of a
18459 parameter "f") can also be interpreted as an
18460 expression (the conversion of "f" to "float"). */
18463 }
18464 else
18465 {
18473 }
18474 }
18476 parser->in_unbraced_linkage_specification_p
18479 /* Reset implicit_template_scope if we are about to leave the function
18480 parameter list that introduced it. Note that for out-of-line member
18481 definitions, there will be one or more class scopes before we get to
18482 the template parameter scope. */
18486 {
18490 {
18493 }
18494 }
18497 }
18499 /* Parse a parameter declaration.
18501 parameter-declaration:
18502 decl-specifier-seq ... [opt] declarator
18503 decl-specifier-seq declarator = assignment-expression
18504 decl-specifier-seq ... [opt] abstract-declarator [opt]
18505 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18507 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18508 declares a template parameter. (In that case, a non-nested `>'
18509 token encountered during the parsing of the assignment-expression
18510 is not interpreted as a greater-than operator.)
18512 Returns a representation of the parameter, or NULL if an error
18513 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18514 true iff the declarator is of the form "(p)". */
18520 {
18522 cp_decl_specifier_seq decl_specifiers;
18524 tree default_argument;
18528 /* In a template parameter, `>' is not an operator.
18530 [temp.param]
18532 When parsing a default template-argument for a non-type
18533 template-parameter, the first non-nested `>' is taken as the end
18534 of the template parameter-list rather than a greater-than
18535 operator. */
18537 /* Type definitions may not appear in parameter types. */
18539 parser->type_definition_forbidden_message
18542 /* Parse the declaration-specifiers. */
18544 CP_PARSER_FLAGS_NONE,
18548 /* Complain about missing 'typename' or other invalid type names. */
18553 /* If an error occurred, there's no reason to attempt to parse the
18554 rest of the declaration. */
18556 {
18559 }
18561 /* Peek at the next token. */
18564 /* If the next token is a `)', `,', `=', `>', or `...', then there
18565 is no declarator. However, when variadic templates are enabled,
18566 there may be a declarator following `...'. */
18571 {
18575 }
18576 /* Otherwise, there should be a declarator. */
18577 else
18578 {
18582 /* After seeing a decl-specifier-seq, if the next token is not a
18583 "(", there is no possibility that the code is a valid
18584 expression. Therefore, if parsing tentatively, we commit at
18585 this point. */
18587 /* In an expression context, having seen:
18589 (int((char ...
18591 we cannot be sure whether we are looking at a
18592 function-type (taking a "char" as a parameter) or a cast
18593 of some object of type "char" to "int". */
18599 /* Parse the declarator. */
18602 CP_PARSER_DECLARATOR_EITHER,
18604 parenthesized_p,
18607 /* After the declarator, allow more attributes. */
18608 decl_specifiers.attributes
18611 }
18613 /* If the next token is an ellipsis, and we have not seen a
18614 declarator name, and the type of the declarator contains parameter
18615 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18616 a parameter pack expansion expression. Otherwise, leave the
18617 ellipsis for a C-style variadic function. */
18620 {
18631 {
18632 /* Consume the `...'. */
18636 /* Build a pack expansion type */
18639 else
18641 }
18642 }
18644 /* The restriction on defining new types applies only to the type
18645 of the parameter, not to the default argument. */
18648 /* If the next token is `=', then process a default argument. */
18650 {
18652 /* If we are defining a class, then the tokens that make up the
18653 default argument must be saved and processed later. */
18658 /* Outside of a class definition, we can just parse the
18659 assignment-expression. */
18660 else
18661 default_argument
18665 {
18668 else
18669 {
18671 "default arguments are only "
18674 }
18675 }
18679 {
18680 /* Find the name of the parameter pack. */
18687 template_parm_p
18693 else
18695 template_parm_p
18702 }
18703 }
18704 else
18708 declarator,
18709 default_argument);
18710 }
18712 /* Parse a default argument and return it.
18714 TEMPLATE_PARM_P is true if this is a default argument for a
18715 non-type template parameter. */
18716 static tree
18718 {
18724 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18725 set correctly. */
18728 /* Local variable names (and the `this' keyword) may not
18729 appear in a default argument. */
18732 /* Parse the assignment-expression. */
18737 /* The "this" pointer is not valid in a default argument. */
18739 {
18744 }
18745 default_argument
18747 /* Restore the "this" pointer. */
18749 {
18752 }
18761 }
18763 /* Parse a function-body.
18765 function-body:
18766 compound_statement */
18768 static void
18770 {
18772 }
18774 /* Parse a ctor-initializer-opt followed by a function-body. Return
18775 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18776 is true we are parsing a function-try-block. */
18778 static bool
18781 {
18789 /* Begin the function body. */
18791 /* Parse the optional ctor-initializer. */
18794 /* If we're parsing a constexpr constructor definition, we need
18795 to check that the constructor body is indeed empty. However,
18796 before we get to cp_parser_function_body lot of junk has been
18797 generated, so we can't just check that we have an empty block.
18798 Rather we take a snapshot of the outermost block, and check whether
18799 cp_parser_function_body changed its state. */
18801 {
18805 }
18806 /* Parse the function-body. */
18810 /* Finish the function body. */
18814 }
18816 /* Parse an initializer.
18818 initializer:
18819 = initializer-clause
18820 ( expression-list )
18822 Returns an expression representing the initializer. If no
18823 initializer is present, NULL_TREE is returned.
18825 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18826 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18827 set to TRUE if there is no initializer present. If there is an
18828 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18829 is set to true; otherwise it is set to false. */
18831 static tree
18834 {
18836 tree init;
18838 /* Peek at the next token. */
18841 /* Let our caller know whether or not this initializer was
18842 parenthesized. */
18844 /* Assume that the initializer is constant. */
18848 {
18849 /* Consume the `='. */
18851 /* Parse the initializer-clause. */
18853 }
18855 {
18860 non_constant_p);
18865 }
18867 {
18872 }
18873 else
18874 {
18875 /* Anything else is an error. */
18878 }
18881 }
18883 /* Parse an initializer-clause.
18885 initializer-clause:
18886 assignment-expression
18887 braced-init-list
18889 Returns an expression representing the initializer.
18891 If the `assignment-expression' production is used the value
18892 returned is simply a representation for the expression.
18894 Otherwise, calls cp_parser_braced_list. */
18896 static tree
18898 {
18899 tree initializer;
18901 /* Assume the expression is constant. */
18904 /* If it is not a `{', then we are looking at an
18905 assignment-expression. */
18907 {
18908 initializer
18911 non_constant_p);
18912 }
18913 else
18917 }
18919 /* Parse a brace-enclosed initializer list.
18921 braced-init-list:
18922 { initializer-list , [opt] }
18923 { }
18925 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18926 the elements of the initializer-list (or NULL, if the last
18927 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18928 NULL_TREE. There is no way to detect whether or not the optional
18929 trailing `,' was provided. NON_CONSTANT_P is as for
18930 cp_parser_initializer. */
18932 static tree
18934 {
18935 tree initializer;
18937 /* Consume the `{' token. */
18939 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18941 /* If it's not a `}', then there is a non-trivial initializer. */
18943 {
18944 /* Parse the initializer list. */
18947 /* A trailing `,' token is allowed. */
18950 }
18951 else
18953 /* Now, there should be a trailing `}'. */
18957 }
18959 /* Parse an initializer-list.
18961 initializer-list:
18962 initializer-clause ... [opt]
18963 initializer-list , initializer-clause ... [opt]
18965 GNU Extension:
18967 initializer-list:
18968 designation initializer-clause ...[opt]
18969 initializer-list , designation initializer-clause ...[opt]
18971 designation:
18972 . identifier =
18973 identifier :
18974 [ constant-expression ] =
18976 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18977 for the initializer. If the INDEX of the elt is non-NULL, it is the
18978 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18979 as for cp_parser_initializer. */
18983 {
18986 /* Assume all of the expressions are constant. */
18989 /* Parse the rest of the list. */
18991 {
18993 tree designator;
18994 tree initializer;
18997 /* If the next token is an identifier and the following one is a
18998 colon, we are looking at the GNU designated-initializer
18999 syntax. */
19003 {
19004 /* Warn the user that they are using an extension. */
19007 /* Consume the identifier. */
19009 /* Consume the `:'. */
19011 }
19012 /* Also handle the C99 syntax, '. id ='. */
19017 {
19018 /* Warn the user that they are using an extension. */
19021 /* Consume the `.'. */
19023 /* Consume the identifier. */
19025 /* Consume the `='. */
19027 }
19028 /* Also handle C99 array designators, '[ const ] ='. */
19032 {
19033 /* In C++11, [ could start a lambda-introducer. */
19045 }
19046 else
19049 /* Parse the initializer. */
19052 /* If any clause is non-constant, so is the entire initializer. */
19056 /* If we have an ellipsis, this is an initializer pack
19057 expansion. */
19059 {
19060 /* Consume the `...'. */
19063 /* Turn the initializer into an initializer expansion. */
19065 }
19067 /* Add it to the vector. */
19070 /* If the next token is not a comma, we have reached the end of
19071 the list. */
19075 /* Peek at the next token. */
19077 /* If the next token is a `}', then we're still done. An
19078 initializer-clause can have a trailing `,' after the
19079 initializer-list and before the closing `}'. */
19083 /* Consume the `,' token. */
19085 }
19088 }
19090 /* Classes [gram.class] */
19092 /* Parse a class-name.
19094 class-name:
19095 identifier
19096 template-id
19098 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19099 to indicate that names looked up in dependent types should be
19100 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19101 keyword has been used to indicate that the name that appears next
19102 is a template. TAG_TYPE indicates the explicit tag given before
19103 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19104 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19105 is the class being defined in a class-head.
19107 Returns the TYPE_DECL representing the class. */
19109 static tree
19117 {
19118 tree decl;
19119 tree scope;
19124 /* All class-names start with an identifier. */
19127 {
19130 }
19132 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19133 to a template-id, so we save it here. */
19138 /* Any name names a type if we're following the `typename' keyword
19139 in a qualified name where the enclosing scope is type-dependent. */
19142 /* Handle the common case (an identifier, but not a template-id)
19143 efficiently. */
19146 {
19150 /* Look for the identifier. */
19154 /* If the next token isn't an identifier, we are certainly not
19155 looking at a class-name. */
19158 /* If we know this is a type-name, there's no need to look it
19159 up. */
19162 else
19163 {
19164 tree ambiguous_decls;
19165 /* If we already know that this lookup is ambiguous, then
19166 we've already issued an error message; there's no reason
19167 to check again. */
19169 {
19172 }
19173 /* If the next token is a `::', then the name must be a type
19174 name.
19176 [basic.lookup.qual]
19178 During the lookup for a name preceding the :: scope
19179 resolution operator, object, function, and enumerator
19180 names are ignored. */
19183 /* Look up the name. */
19185 tag_type,
19188 check_dependency_p,
19192 {
19196 }
19197 }
19198 }
19199 else
19200 {
19201 /* Try a template-id. */
19203 check_dependency_p,
19204 tag_type,
19205 is_declaration);
19208 }
19212 /* If this is a typename, create a TYPENAME_TYPE. */
19214 {
19219 }
19223 /* Check to see that it is really the name of a class. */
19227 /* Situations like this:
19229 template <typename T> struct A {
19230 typename T::template X<int>::I i;
19231 };
19233 are problematic. Is `T::template X<int>' a class-name? The
19234 standard does not seem to be definitive, but there is no other
19235 valid interpretation of the following `::'. Therefore, those
19236 names are considered class-names. */
19237 {
19241 }
19245 /* In Objective-C 2.0, a classname followed by '.' starts a
19246 dot-syntax expression, and it's not a type-name. */
19258 }
19260 /* Parse a class-specifier.
19262 class-specifier:
19263 class-head { member-specification [opt] }
19265 Returns the TREE_TYPE representing the class. */
19267 static tree
19269 {
19270 tree type;
19284 /* Parse the class-head. */
19287 /* If the class-head was a semantic disaster, skip the entire body
19288 of the class. */
19290 {
19294 }
19296 /* Look for the `{'. */
19298 {
19301 }
19305 /* Issue an error message if type-definitions are forbidden here. */
19307 /* Remember that we are defining one more class. */
19309 /* Inside the class, surrounding template-parameter-lists do not
19310 apply. */
19311 saved_num_template_parameter_lists
19314 /* We are not in a function body. */
19317 /* Or in a loop. */
19320 /* Or in a switch. */
19323 /* We are not immediately inside an extern "lang" block. */
19324 saved_in_unbraced_linkage_specification_p
19328 /* Start the class. */
19330 {
19333 }
19337 /* If the type is erroneous, skip the entire body of the class. */
19339 else
19340 /* Parse the member-specification. */
19343 /* Look for the trailing `}'. */
19345 /* Look for trailing attributes to apply to this class. */
19353 /* We've finished a type definition. Check for the common syntax
19354 error of forgetting a semicolon after the definition. We need to
19355 be careful, as we can't just check for not-a-semicolon and be done
19356 with it; the user might have typed:
19358 class X { } c = ...;
19359 class X { } *p = ...;
19361 and so forth. Instead, enumerate all the possible tokens that
19362 might follow this production; if we don't see one of them, then
19363 complain and silently insert the semicolon. */
19364 {
19369 /* Don't try to parse c++11 attributes here. As per the
19370 grammar, that should be a task for
19371 cp_parser_decl_specifier_seq. */
19375 {
19386 /* While it's legal for type qualifiers and storage class
19387 specifiers to follow type definitions in the grammar, only
19388 compiler testsuites contain code like that. Assume that if
19389 we see such code, then what we're really seeing is a case
19390 like:
19392 class X { }
19393 const <type> var = ...;
19395 or
19397 class Y { }
19398 static <type> func (...) ...
19400 i.e. the qualifier or specifier applies to the next
19401 declaration. To do so, however, we need to look ahead one
19402 more token to see if *that* token is a type specifier.
19404 This code could be improved to handle:
19406 class Z { }
19407 static const <type> var = ...; */
19410 {
19413 /* Handling user-defined types here would be nice, but very
19414 tricky. */
19415 want_semicolon
19418 }
19422 }
19424 /* If we don't have a type, then something is very wrong and we
19425 shouldn't try to do anything clever. Likewise for not seeing the
19426 closing brace. */
19428 {
19429 cp_token_position prev
19440 else
19443 /* Unget one token and smash it to look as though we encountered
19444 a semicolon in the input stream. */
19449 }
19450 }
19452 /* If this class is not itself within the scope of another class,
19453 then we need to parse the bodies of all of the queued function
19454 definitions. Note that the queued functions defined in a class
19455 are not always processed immediately following the
19456 class-specifier for that class. Consider:
19458 struct A {
19459 struct B { void f() { sizeof (A); } };
19460 };
19462 If `f' were processed before the processing of `A' were
19463 completed, there would be no way to compute the size of `A'.
19464 Note that the nesting we are interested in here is lexical --
19465 not the semantic nesting given by TYPE_CONTEXT. In particular,
19466 for:
19468 struct A { struct B; };
19469 struct A::B { void f() { } };
19471 there is no need to delay the parsing of `A::B::f'. */
19473 {
19474 tree decl;
19481 /* In a first pass, parse default arguments to the functions.
19482 Then, in a second pass, parse the bodies of the functions.
19483 This two-phased approach handles cases like:
19485 struct S {
19486 void f() { g(); }
19487 void g(int i = 3);
19488 };
19490 */
19492 {
19494 /* If there are default arguments that have not yet been processed,
19495 take care of them now. */
19497 {
19502 }
19503 /* Make sure that any template parameters are in scope. */
19505 /* Parse the default argument expressions. */
19507 /* Remove any template parameters from the symbol table. */
19509 }
19511 /* Now parse any NSDMIs. */
19515 {
19517 {
19522 }
19525 }
19531 /* Now parse the body of the functions. */
19533 {
19534 /* OpenMP UDRs need to be parsed before all other functions. */
19541 }
19542 else
19546 }
19548 /* Put back any saved access checks. */
19551 /* Restore saved state. */
19555 parser->num_template_parameter_lists
19557 parser->in_unbraced_linkage_specification_p
19561 }
19563 static tree
19565 {
19566 tree ret;
19571 }
19573 /* Parse a class-head.
19575 class-head:
19576 class-key identifier [opt] base-clause [opt]
19577 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19578 class-key nested-name-specifier [opt] template-id
19579 base-clause [opt]
19581 class-virt-specifier:
19582 final
19584 GNU Extensions:
19585 class-key attributes identifier [opt] base-clause [opt]
19586 class-key attributes nested-name-specifier identifier base-clause [opt]
19587 class-key attributes nested-name-specifier [opt] template-id
19588 base-clause [opt]
19590 Upon return BASES is initialized to the list of base classes (or
19591 NULL, if there are none) in the same form returned by
19592 cp_parser_base_clause.
19594 Returns the TYPE of the indicated class. Sets
19595 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19596 involving a nested-name-specifier was used, and FALSE otherwise.
19598 Returns error_mark_node if this is not a class-head.
19600 Returns NULL_TREE if the class-head is syntactically valid, but
19601 semantically invalid in a way that means we should skip the entire
19602 body of the class. */
19604 static tree
19607 {
19608 tree nested_name_specifier;
19612 tree attributes;
19613 tree bases;
19623 /* Assume no nested-name-specifier will be present. */
19625 /* Assume no template parameter lists will be used in defining the
19626 type. */
19630 /* Look for the class-key. */
19635 /* Parse the attributes. */
19638 /* If the next token is `::', that is invalid -- but sometimes
19639 people do try to write:
19641 struct ::S {};
19643 Handle this gracefully by accepting the extra qualifier, and then
19644 issuing an error about it later if this really is a
19645 class-head. If it turns out just to be an elaborated type
19646 specifier, remain silent. */
19652 /* Determine the name of the class. Begin by looking for an
19653 optional nested-name-specifier. */
19655 nested_name_specifier
19661 /* If there was a nested-name-specifier, then there *must* be an
19662 identifier. */
19664 {
19666 /* Although the grammar says `identifier', it really means
19667 `class-name' or `template-name'. You are only allowed to
19668 define a class that has already been declared with this
19669 syntax.
19671 The proposed resolution for Core Issue 180 says that wherever
19672 you see `class T::X' you should treat `X' as a type-name.
19674 It is OK to define an inaccessible class; for example:
19676 class A { class B; };
19677 class A::B {};
19679 We do not know if we will see a class-name, or a
19680 template-name. We look for a class-name first, in case the
19681 class-name is a template-id; if we looked for the
19682 template-name first we would stop after the template-name. */
19687 class_type,
19691 /* If that didn't work, ignore the nested-name-specifier. */
19693 {
19699 }
19700 /* If we could not find a corresponding TYPE, treat this
19701 declaration like an unqualified declaration. */
19704 /* Otherwise, count the number of templates used in TYPE and its
19705 containing scopes. */
19706 else
19707 {
19708 tree scope;
19720 }
19721 }
19722 /* Otherwise, the identifier is optional. */
19723 else
19724 {
19725 /* We don't know whether what comes next is a template-id,
19726 an identifier, or nothing at all. */
19728 /* Check for a template-id. */
19733 class_key,
19735 /* If that didn't work, it could still be an identifier. */
19737 {
19739 {
19742 }
19743 else
19745 }
19746 else
19747 {
19750 }
19751 }
19756 {
19758 class_key,
19760 }
19763 /* If it's not a `:' or a `{' then we can't really be looking at a
19764 class-head, since a class-head only appears as part of a
19765 class-specifier. We have to detect this situation before calling
19766 xref_tag, since that has irreversible side-effects. */
19768 {
19772 }
19774 /* At this point, we're going ahead with the class-specifier, even
19775 if some other problem occurs. */
19778 {
19783 }
19784 /* Issue the error about the overly-qualified name now. */
19786 {
19791 }
19793 {
19798 }
19800 {
19801 tree scope;
19803 /* Reject typedef-names in class heads. */
19805 {
19808 type);
19811 }
19813 /* Figure out in what scope the declaration is being placed. */
19815 /* If that scope does not contain the scope in which the
19816 class was originally declared, the program is invalid. */
19818 {
19821 "declaration of %qD in namespace %qD which does not "
19824 else
19830 }
19831 /* [dcl.meaning]
19833 A declarator-id shall not be qualified except for the
19834 definition of a ... nested class outside of its class
19835 ... [or] the definition or explicit instantiation of a
19836 class member of a namespace outside of its namespace. */
19838 {
19843 }
19844 }
19845 /* An explicit-specialization must be preceded by "template <>". If
19846 it is not, try to recover gracefully. */
19850 {
19854 /* Take the same action that would have been taken by
19855 cp_parser_explicit_specialization. */
19858 }
19859 /* There must be no "return" statements between this point and the
19860 end of this function; set "type "to the correct return value and
19861 use "goto done;" to return. */
19862 /* Make sure that the right number of template parameters were
19863 present. */
19867 {
19868 /* If something went wrong, there is no point in even trying to
19869 process the class-definition. */
19872 }
19874 /* Look up the type. */
19876 {
19880 {
19884 }
19885 else
19886 {
19889 }
19892 }
19894 {
19895 tree class_type;
19897 /* Given:
19899 template <typename T> struct S { struct T };
19900 template <typename T> struct S<T>::T { };
19902 we will get a TYPENAME_TYPE when processing the definition of
19903 `S::T'. We need to resolve it to the actual type before we
19904 try to define it. */
19906 {
19911 else
19912 {
19915 }
19916 }
19920 {
19923 }
19926 /* Enter the scope indicated by the nested-name-specifier. */
19928 /* Get the canonical version of this type. */
19930 /* Call push_template_decl if it seems like we should be defining a
19931 template either from the template headers or the type we're
19932 defining, so that we diagnose both extra and missing headers. */
19938 {
19941 {
19944 }
19945 }
19949 }
19951 {
19952 /* If the class was unnamed, create a dummy name. */
19957 }
19959 /* Indicate whether this class was declared as a `class' or as a
19960 `struct'. */
19965 /* If this type was already complete, and we see another definition,
19966 that's an error. */
19968 {
19970 type);
19972 type);
19975 }
19980 {
19981 /* Apply attributes now, before any use of the class as a template
19982 argument in its base list. */
19985 }
19987 /* We will have entered the scope containing the class; the names of
19988 base classes should be looked up in that context. For example:
19990 struct A { struct B {}; struct C; };
19991 struct A::C : B {};
19993 is valid. */
19995 /* Get the list of base-classes, if there is one. */
19997 {
19998 /* PR59482: enter the class scope so that base-specifiers are looked
19999 up correctly. */
20003 /* PR59482: get out of the previously pushed class scope so that the
20004 subsequent pops pop the right thing. */
20007 }
20008 else
20011 /* If we're really defining a class, process the base classes.
20012 If they're invalid, fail. */
20017 done:
20018 /* Leave the scope given by the nested-name-specifier. We will
20019 enter the class scope itself while processing the members. */
20024 {
20027 }
20033 out:
20036 }
20038 /* Parse a class-key.
20040 class-key:
20041 class
20042 struct
20043 union
20045 Returns the kind of class-key specified, or none_type to indicate
20046 error. */
20048 static enum tag_types
20050 {
20054 /* Look for the class-key. */
20059 /* Check to see if the TOKEN is a class-key. */
20064 }
20066 /* Parse an (optional) member-specification.
20068 member-specification:
20069 member-declaration member-specification [opt]
20070 access-specifier : member-specification [opt] */
20072 static void
20074 {
20076 {
20080 /* Peek at the next token. */
20082 /* If it's a `}', or EOF then we've seen all the members. */
20088 /* See if this token is a keyword. */
20091 {
20095 /* Consume the access-specifier. */
20097 /* Remember which access-specifier is active. */
20099 /* Look for the `:'. */
20104 /* Accept #pragmas at class scope. */
20106 {
20109 }
20111 /* Otherwise, the next construction must be a
20112 member-declaration. */
20114 }
20115 }
20116 }
20118 /* Parse a member-declaration.
20120 member-declaration:
20121 decl-specifier-seq [opt] member-declarator-list [opt] ;
20122 function-definition ; [opt]
20123 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20124 using-declaration
20125 template-declaration
20126 alias-declaration
20128 member-declarator-list:
20129 member-declarator
20130 member-declarator-list , member-declarator
20132 member-declarator:
20133 declarator pure-specifier [opt]
20134 declarator constant-initializer [opt]
20135 identifier [opt] : constant-expression
20137 GNU Extensions:
20139 member-declaration:
20140 __extension__ member-declaration
20142 member-declarator:
20143 declarator attributes [opt] pure-specifier [opt]
20144 declarator attributes [opt] constant-initializer [opt]
20145 identifier [opt] attributes [opt] : constant-expression
20147 C++0x Extensions:
20149 member-declaration:
20150 static_assert-declaration */
20152 static void
20154 {
20155 cp_decl_specifier_seq decl_specifiers;
20156 tree prefix_attributes;
20157 tree decl;
20166 /* Check for the `__extension__' keyword. */
20168 {
20169 /* Recurse. */
20171 /* Restore the old value of the PEDANTIC flag. */
20175 }
20177 /* Check for a template-declaration. */
20179 {
20180 /* An explicit specialization here is an error condition, and we
20181 expect the specialization handler to detect and report this. */
20185 else
20189 }
20191 /* Check for a using-declaration. */
20193 {
20195 {
20196 /* Parse the using-declaration. */
20200 }
20201 else
20202 {
20203 tree decl;
20207 /* Note that if we actually see the '=' token after the
20208 identifier, cp_parser_alias_declaration commits the
20209 tentative parse. In that case, we really expects an
20210 alias-declaration. Otherwise, we expect a using
20211 declaration. */
20212 alias_decl_expected =
20218 else
20222 }
20223 }
20225 /* Check for @defs. */
20227 {
20232 {
20237 }
20239 }
20241 /* If the next token is `static_assert' we have a static assertion. */
20243 {
20246 }
20253 /* Parse the decl-specifier-seq. */
20256 CP_PARSER_FLAGS_OPTIONAL,
20259 /* Check for an invalid type-name. */
20263 /* If there is no declarator, then the decl-specifier-seq should
20264 specify a type. */
20266 {
20267 /* If there was no decl-specifier-seq, and the next token is a
20268 `;', then we have something like:
20270 struct S { ; };
20272 [class.mem]
20274 Each member-declaration shall declare at least one member
20275 name of the class. */
20277 {
20281 }
20282 else
20283 {
20284 tree type;
20286 /* See if this declaration is a friend. */
20288 /* If there were decl-specifiers, check to see if there was
20289 a class-declaration. */
20292 /* Nested classes have already been added to the class, but
20293 a `friend' needs to be explicitly registered. */
20295 {
20296 /* If the `friend' keyword was present, the friend must
20297 be introduced with a class-key. */
20300 "in C++03 a class-key must be used "
20302 /* In this case:
20304 template <typename T> struct A {
20305 friend struct A<T>::B;
20306 };
20308 A<T>::B will be represented by a TYPENAME_TYPE, and
20309 therefore not recognized by check_tag_decl. */
20311 {
20315 }
20318 "friend declaration does not name a class or "
20320 else
20323 }
20324 /* If there is no TYPE, an error message will already have
20325 been issued. */
20327 ;
20328 /* An anonymous aggregate has to be handled specially; such
20329 a declaration really declares a data member (with a
20330 particular type), as opposed to a nested class. */
20332 {
20333 /* C++11 9.5/6. */
20336 "a storage class on an anonymous aggregate "
20339 /* Remove constructors and such from TYPE, now that we
20340 know it is an anonymous aggregate. */
20342 /* And make the corresponding data member. */
20345 /* Add it to the class. */
20347 }
20348 else
20349 cp_parser_check_access_in_redeclaration
20352 }
20353 }
20354 else
20355 {
20358 /* Clear attributes from the decl_specifiers but keep them
20359 around as prefix attributes that apply them to the entity
20360 being declared. */
20364 /* See if these declarations will be friends. */
20367 /* Keep going until we hit the `;' at the end of the
20368 declaration. */
20370 {
20372 tree first_attribute;
20374 /* Peek at the next token. */
20377 /* Check for a bitfield declaration. */
20382 {
20383 tree identifier;
20384 tree width;
20386 /* Get the name of the bitfield. Note that we cannot just
20387 check TOKEN here because it may have been invalidated by
20388 the call to cp_lexer_peek_nth_token above. */
20391 else
20394 /* Consume the `:' token. */
20396 /* Get the width of the bitfield. */
20397 width
20400 NULL);
20402 /* Look for attributes that apply to the bitfield. */
20404 /* Remember which attributes are prefix attributes and
20405 which are not. */
20407 /* Combine the attributes. */
20410 /* Create the bitfield declaration. */
20413 identifier,
20414 sfk_none)
20417 width,
20418 attributes);
20419 }
20420 else
20421 {
20423 tree initializer;
20424 tree asm_specification;
20427 /* Parse the declarator. */
20428 declarator
20434 /* If something went wrong parsing the declarator, make sure
20435 that we at least consume some tokens. */
20437 {
20438 /* Skip to the end of the statement. */
20440 /* If the next token is not a semicolon, that is
20441 probably because we just skipped over the body of
20442 a function. So, we consume a semicolon if
20443 present, but do not issue an error message if it
20444 is not present. */
20446 CPP_SEMICOLON))
20449 }
20452 cp_parser_check_for_definition_in_return_type
20456 /* Look for an asm-specification. */
20458 /* Look for attributes that apply to the declaration. */
20460 /* Remember which attributes are prefix attributes and
20461 which are not. */
20463 /* Combine the attributes. */
20466 /* If it's an `=', then we have a constant-initializer or a
20467 pure-specifier. It is not correct to parse the
20468 initializer before registering the member declaration
20469 since the member declaration should be in scope while
20470 its initializer is processed. However, the rest of the
20471 front end does not yet provide an interface that allows
20472 us to handle this correctly. */
20474 {
20475 /* In [class.mem]:
20477 A pure-specifier shall be used only in the declaration of
20478 a virtual function.
20480 A member-declarator can contain a constant-initializer
20481 only if it declares a static member of integral or
20482 enumeration type.
20484 Therefore, if the DECLARATOR is for a function, we look
20485 for a pure-specifier; otherwise, we look for a
20486 constant-initializer. When we call `grokfield', it will
20487 perform more stringent semantics checks. */
20499 {
20501 /* Don't require a constant rvalue in C++11, since we
20502 might want a reference constant. We'll enforce
20503 constancy later. */
20505 /* Parse the initializer. */
20508 }
20509 else
20510 /* Parse the initializer. */
20512 }
20515 {
20519 else
20521 }
20522 /* Otherwise, there is no initializer. */
20523 else
20526 /* See if we are probably looking at a function
20527 definition. We are certainly not looking at a
20528 member-declarator. Calling `grokfield' has
20529 side-effects, so we must not do it unless we are sure
20530 that we are looking at a member-declarator. */
20533 {
20534 /* The grammar does not allow a pure-specifier to be
20535 used when a member function is defined. (It is
20536 possible that this fact is an oversight in the
20537 standard, since a pure function may be defined
20538 outside of the class-specifier. */
20544 declarator,
20545 attributes);
20548 /* If the member was not a friend, declare it here. */
20551 /* Peek at the next token. */
20553 /* If the next token is a semicolon, consume it. */
20557 }
20558 else
20561 /* Create the declaration. */
20566 {
20569 else
20571 }
20572 }
20576 /* Reset PREFIX_ATTRIBUTES. */
20582 /* If there is any qualification still in effect, clear it
20583 now; we will be starting fresh with the next declarator. */
20587 /* If it's a `,', then there are more declarators. */
20589 {
20592 {
20596 }
20597 }
20598 /* If the next token isn't a `;', then we have a parse error. */
20600 CPP_SEMICOLON))
20601 {
20602 /* The next token might be a ways away from where the
20603 actual semicolon is missing. Find the previous token
20604 and use that for our error position. */
20609 /* Assume that the user meant to provide a semicolon. If
20610 we were to cp_parser_skip_to_end_of_statement, we might
20611 skip to a semicolon inside a member function definition
20612 and issue nonsensical error messages. */
20614 }
20617 {
20618 /* Add DECL to the list of members. */
20627 /* Add DECL to the queue of NSDMI to be parsed later. */
20629 }
20633 }
20634 }
20637 out:
20639 }
20641 /* Parse a pure-specifier.
20643 pure-specifier:
20644 = 0
20646 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20647 Otherwise, ERROR_MARK_NODE is returned. */
20649 static tree
20651 {
20654 /* Look for the `=' token. */
20657 /* Look for the `0' token. */
20666 /* Accept = default or = delete in c++0x mode. */
20669 {
20672 }
20674 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20676 {
20681 }
20683 {
20686 }
20689 }
20691 /* Parse a constant-initializer.
20693 constant-initializer:
20694 = constant-expression
20696 Returns a representation of the constant-expression. */
20698 static tree
20700 {
20701 /* Look for the `=' token. */
20705 /* It is invalid to write:
20707 struct S { static const int i = { 7 }; };
20709 */
20711 {
20714 /* Consume the opening brace. */
20716 /* Skip the initializer. */
20718 /* Look for the trailing `}'. */
20722 }
20726 NULL);
20727 }
20729 /* Derived classes [gram.class.derived] */
20731 /* Parse a base-clause.
20733 base-clause:
20734 : base-specifier-list
20736 base-specifier-list:
20737 base-specifier ... [opt]
20738 base-specifier-list , base-specifier ... [opt]
20740 Returns a TREE_LIST representing the base-classes, in the order in
20741 which they were declared. The representation of each node is as
20742 described by cp_parser_base_specifier.
20744 In the case that no bases are specified, this function will return
20745 NULL_TREE, not ERROR_MARK_NODE. */
20747 static tree
20749 {
20752 /* Look for the `:' that begins the list. */
20755 /* Scan the base-specifier-list. */
20757 {
20759 tree base;
20762 /* Look for the base-specifier. */
20764 /* Look for the (optional) ellipsis. */
20766 {
20767 /* Consume the `...'. */
20771 }
20773 /* Add BASE to the front of the list. */
20775 {
20777 /* Make this a pack expansion type. */
20781 {
20784 }
20785 }
20786 /* Peek at the next token. */
20788 /* If it's not a comma, then the list is complete. */
20791 /* Consume the `,'. */
20793 }
20795 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20796 base class had a qualified name. However, the next name that
20797 appears is certainly not qualified. */
20803 }
20805 /* Parse a base-specifier.
20807 base-specifier:
20808 :: [opt] nested-name-specifier [opt] class-name
20809 virtual access-specifier [opt] :: [opt] nested-name-specifier
20810 [opt] class-name
20811 access-specifier virtual [opt] :: [opt] nested-name-specifier
20812 [opt] class-name
20814 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20815 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20816 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20817 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20819 static tree
20821 {
20829 tree type;
20831 /* Process the optional `virtual' and `access-specifier'. */
20833 {
20834 /* Peek at the next token. */
20836 /* Process `virtual'. */
20838 {
20840 /* If `virtual' appears more than once, issue an error. */
20842 {
20846 }
20850 /* Consume the `virtual' token. */
20858 /* If more than one access specifier appears, issue an
20859 error. */
20862 {
20866 }
20870 /* Consume the access-specifier. */
20878 }
20879 }
20880 /* It is not uncommon to see programs mechanically, erroneously, use
20881 the 'typename' keyword to denote (dependent) qualified types
20882 as base classes. */
20884 {
20889 else
20891 "keyword %<typename%> not allowed in this context "
20894 }
20896 /* Look for the optional `::' operator. */
20898 /* Look for the nested-name-specifier. The simplest way to
20899 implement:
20901 [temp.res]
20903 The keyword `typename' is not permitted in a base-specifier or
20904 mem-initializer; in these contexts a qualified name that
20905 depends on a template-parameter is implicitly assumed to be a
20906 type name.
20908 is to pretend that we have seen the `typename' keyword at this
20909 point. */
20913 typename_type,
20915 /* If the base class is given by a qualified name, assume that names
20916 we see are type names or templates, as appropriate. */
20922 /* DR 950 allows decltype as a base-specifier. */
20924 else
20925 {
20926 /* Otherwise, look for the class-name. */
20928 class_scope_p,
20929 template_p,
20930 typename_type,
20935 }
20941 }
20943 /* Exception handling [gram.exception] */
20945 /* Parse an (optional) noexcept-specification.
20947 noexcept-specification:
20948 noexcept ( constant-expression ) [opt]
20950 If no noexcept-specification is present, returns NULL_TREE.
20951 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20952 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20953 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20954 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20955 in which case a boolean condition is returned instead. */
20957 static tree
20962 {
20966 /* Peek at the next token. */
20969 /* Is it a noexcept-specification? */
20971 {
20972 tree expr;
20976 {
20980 {
20981 /* Types may not be defined in an exception-specification. */
20983 parser->type_definition_forbidden_message
20988 /* Restore the saved message. */
20990 }
20991 else
20992 {
20995 }
20998 }
20999 else
21000 {
21004 }
21006 /* We cannot build a noexcept-spec right away because this will check
21007 that expr is a constexpr. */
21010 else
21012 }
21013 else
21015 }
21017 /* Parse an (optional) exception-specification.
21019 exception-specification:
21020 throw ( type-id-list [opt] )
21022 Returns a TREE_LIST representing the exception-specification. The
21023 TREE_VALUE of each node is a type. */
21025 static tree
21027 {
21029 tree type_id_list;
21032 /* Peek at the next token. */
21035 /* Is it a noexcept-specification? */
21041 /* If it's not `throw', then there's no exception-specification. */
21045 #if 0
21046 /* Enable this once a lot of code has transitioned to noexcept? */
21050 #endif
21052 /* Consume the `throw'. */
21055 /* Look for the `('. */
21058 /* Peek at the next token. */
21060 /* If it's not a `)', then there is a type-id-list. */
21062 {
21063 /* Types may not be defined in an exception-specification. */
21065 parser->type_definition_forbidden_message
21067 /* Parse the type-id-list. */
21069 /* Restore the saved message. */
21071 }
21072 else
21075 /* Look for the `)'. */
21079 }
21081 /* Parse an (optional) type-id-list.
21083 type-id-list:
21084 type-id ... [opt]
21085 type-id-list , type-id ... [opt]
21087 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21088 in the order that the types were presented. */
21090 static tree
21092 {
21096 {
21098 tree type;
21100 /* Get the next type-id. */
21102 /* Parse the optional ellipsis. */
21104 {
21105 /* Consume the `...'. */
21108 /* Turn the type into a pack expansion expression. */
21110 }
21111 /* Add it to the list. */
21113 /* Peek at the next token. */
21115 /* If it is not a `,', we are done. */
21118 /* Consume the `,'. */
21120 }
21123 }
21125 /* Parse a try-block.
21127 try-block:
21128 try compound-statement handler-seq */
21130 static tree
21132 {
21133 tree try_block;
21143 }
21145 /* Parse a function-try-block.
21147 function-try-block:
21148 try ctor-initializer [opt] function-body handler-seq */
21150 static bool
21152 {
21153 tree compound_stmt;
21154 tree try_block;
21157 /* Look for the `try' keyword. */
21160 /* Let the rest of the front end know where we are. */
21162 /* Parse the function-body. */
21163 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21165 /* We're done with the `try' part. */
21167 /* Parse the handlers. */
21169 /* We're done with the handlers. */
21173 }
21175 /* Parse a handler-seq.
21177 handler-seq:
21178 handler handler-seq [opt] */
21180 static void
21182 {
21184 {
21187 /* Parse the handler. */
21189 /* Peek at the next token. */
21191 /* If it's not `catch' then there are no more handlers. */
21194 }
21195 }
21197 /* Parse a handler.
21199 handler:
21200 catch ( exception-declaration ) compound-statement */
21202 static void
21204 {
21205 tree handler;
21206 tree declaration;
21216 }
21218 /* Parse an exception-declaration.
21220 exception-declaration:
21221 type-specifier-seq declarator
21222 type-specifier-seq abstract-declarator
21223 type-specifier-seq
21224 ...
21226 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21227 ellipsis variant is used. */
21229 static tree
21231 {
21232 cp_decl_specifier_seq type_specifiers;
21236 /* If it's an ellipsis, it's easy to handle. */
21238 {
21239 /* Consume the `...' token. */
21242 }
21244 /* Types may not be defined in exception-declarations. */
21246 parser->type_definition_forbidden_message
21249 /* Parse the type-specifier-seq. */
21253 /* If it's a `)', then there is no declarator. */
21256 else
21262 /* Restore the saved message. */
21269 }
21271 /* Parse a throw-expression.
21273 throw-expression:
21274 throw assignment-expression [opt]
21276 Returns a THROW_EXPR representing the throw-expression. */
21278 static tree
21280 {
21281 tree expression;
21286 /* Figure out whether or not there is an assignment-expression
21287 following the "throw" keyword. */
21295 else
21300 }
21302 /* GNU Extensions */
21304 /* Parse an (optional) asm-specification.
21306 asm-specification:
21307 asm ( string-literal )
21309 If the asm-specification is present, returns a STRING_CST
21310 corresponding to the string-literal. Otherwise, returns
21311 NULL_TREE. */
21313 static tree
21315 {
21317 tree asm_specification;
21319 /* Peek at the next token. */
21321 /* If the next token isn't the `asm' keyword, then there's no
21322 asm-specification. */
21326 /* Consume the `asm' token. */
21328 /* Look for the `('. */
21331 /* Look for the string-literal. */
21334 /* Look for the `)'. */
21338 }
21340 /* Parse an asm-operand-list.
21342 asm-operand-list:
21343 asm-operand
21344 asm-operand-list , asm-operand
21346 asm-operand:
21347 string-literal ( expression )
21348 [ string-literal ] string-literal ( expression )
21350 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21351 each node is the expression. The TREE_PURPOSE is itself a
21352 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21353 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21354 is a STRING_CST for the string literal before the parenthesis. Returns
21355 ERROR_MARK_NODE if any of the operands are invalid. */
21357 static tree
21359 {
21364 {
21365 tree string_literal;
21366 tree expression;
21367 tree name;
21370 {
21371 /* Consume the `[' token. */
21373 /* Read the operand name. */
21378 /* Look for the closing `]'. */
21380 }
21381 else
21383 /* Look for the string-literal. */
21386 /* Look for the `('. */
21388 /* Parse the expression. */
21390 /* Look for the `)'. */
21398 /* Add this operand to the list. */
21400 expression,
21401 asm_operands);
21402 /* If the next token is not a `,', there are no more
21403 operands. */
21406 /* Consume the `,'. */
21408 }
21411 }
21413 /* Parse an asm-clobber-list.
21415 asm-clobber-list:
21416 string-literal
21417 asm-clobber-list , string-literal
21419 Returns a TREE_LIST, indicating the clobbers in the order that they
21420 appeared. The TREE_VALUE of each node is a STRING_CST. */
21422 static tree
21424 {
21428 {
21429 tree string_literal;
21431 /* Look for the string literal. */
21433 /* Add it to the list. */
21435 /* If the next token is not a `,', then the list is
21436 complete. */
21439 /* Consume the `,' token. */
21441 }
21444 }
21446 /* Parse an asm-label-list.
21448 asm-label-list:
21449 identifier
21450 asm-label-list , identifier
21452 Returns a TREE_LIST, indicating the labels in the order that they
21453 appeared. The TREE_VALUE of each node is a label. */
21455 static tree
21457 {
21461 {
21464 /* Look for the identifier. */
21467 {
21470 {
21476 }
21477 }
21478 /* If the next token is not a `,', then the list is
21479 complete. */
21482 /* Consume the `,' token. */
21484 }
21487 }
21489 /* Return TRUE iff the next tokens in the stream are possibly the
21490 beginning of a GNU extension attribute. */
21492 static bool
21494 {
21496 }
21498 /* Return TRUE iff the next tokens in the stream are possibly the
21499 beginning of a standard C++-11 attribute specifier. */
21501 static bool
21503 {
21505 }
21507 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21508 beginning of a standard C++-11 attribute specifier. */
21510 static bool
21512 {
21520 }
21522 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21523 beginning of a GNU extension attribute. */
21525 static bool
21527 {
21531 }
21533 /* Return true iff the next tokens can be the beginning of either a
21534 GNU attribute list, or a standard C++11 attribute sequence. */
21536 static bool
21538 {
21541 }
21543 /* Return true iff the next Nth tokens can be the beginning of either
21544 a GNU attribute list, or a standard C++11 attribute sequence. */
21546 static bool
21548 {
21551 }
21553 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21554 of GNU attributes, or return NULL. */
21556 static tree
21558 {
21562 }
21564 #define CILK_SIMD_FN_CLAUSE_MASK \
21565 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21566 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21567 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21568 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21569 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21571 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21572 vector [(<clauses>)] */
21574 static void
21576 {
21580 {
21585 }
21588 {
21591 paren_scope++;
21592 }
21594 {
21597 paren_scope++;
21599 paren_scope--;
21600 /* Do not push the last ')' */
21603 }
21612 }
21614 /* Parse an (optional) series of attributes.
21616 attributes:
21617 attributes attribute
21619 attribute:
21620 __attribute__ (( attribute-list [opt] ))
21622 The return value is as for cp_parser_gnu_attribute_list. */
21624 static tree
21626 {
21630 {
21632 tree attribute_list;
21635 /* Peek at the next token. */
21637 /* If it's not `__attribute__', then we're done. */
21641 /* Consume the `__attribute__' keyword. */
21643 /* Look for the two `(' tokens. */
21647 /* Peek at the next token. */
21650 /* Parse the attribute-list. */
21652 else
21653 /* If the next token is a `)', then there is no attribute
21654 list. */
21657 /* Look for the two `)' tokens. */
21665 /* Add these new attributes to the list. */
21667 }
21670 }
21672 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21673 "__vector" or "__vector__." */
21677 {
21681 }
21683 /* Parse a GNU attribute-list.
21685 attribute-list:
21686 attribute
21687 attribute-list , attribute
21689 attribute:
21690 identifier
21691 identifier ( identifier )
21692 identifier ( identifier , expression-list )
21693 identifier ( expression-list )
21695 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21696 to an attribute. The TREE_PURPOSE of each node is the identifier
21697 indicating which attribute is in use. The TREE_VALUE represents
21698 the arguments, if any. */
21700 static tree
21702 {
21708 {
21710 tree identifier;
21711 tree attribute;
21713 /* Look for the identifier. We also allow keywords here; for
21714 example `__attribute__ ((const))' is legal. */
21718 {
21721 /* Consume the token, but save it since we need it for the
21722 SIMD enabled function parsing. */
21725 /* Save away the identifier that indicates which attribute
21726 this is. */
21728 /* For keywords, use the canonical spelling, not the
21729 parsed identifier. */
21735 /* Peek at the next token. */
21737 /* If it's an `(', then parse the attribute arguments. */
21739 {
21744 {
21747 }
21748 else
21749 vec = cp_parser_parenthesized_expression_list
21755 else
21756 {
21759 }
21760 /* Save the arguments away. */
21762 }
21764 {
21767 }
21770 {
21771 /* Add this attribute to the list. */
21774 }
21777 }
21778 /* Now, look for more attributes. If the next token isn't a
21779 `,', we're done. */
21783 /* Consume the comma and keep going. */
21785 }
21788 /* We built up the list in reverse order. */
21790 }
21792 /* Parse a standard C++11 attribute.
21794 The returned representation is a TREE_LIST which TREE_PURPOSE is
21795 the scoped name of the attribute, and the TREE_VALUE is its
21796 arguments list.
21798 Note that the scoped name of the attribute is itself a TREE_LIST
21799 which TREE_PURPOSE is the namespace of the attribute, and
21800 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21801 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21802 and which TREE_PURPOSE is directly the attribute name.
21804 Clients of the attribute code should use get_attribute_namespace
21805 and get_attribute_name to get the actual namespace and name of
21806 attributes, regardless of their being GNU or C++11 attributes.
21808 attribute:
21809 attribute-token attribute-argument-clause [opt]
21811 attribute-token:
21812 identifier
21813 attribute-scoped-token
21815 attribute-scoped-token:
21816 attribute-namespace :: identifier
21818 attribute-namespace:
21819 identifier
21821 attribute-argument-clause:
21822 ( balanced-token-seq )
21824 balanced-token-seq:
21825 balanced-token [opt]
21826 balanced-token-seq balanced-token
21828 balanced-token:
21829 ( balanced-token-seq )
21830 [ balanced-token-seq ]
21831 { balanced-token-seq }. */
21833 static tree
21835 {
21839 /* First, parse name of the the attribute, a.k.a
21840 attribute-token. */
21857 {
21858 /* We are seeing a scoped attribute token. */
21868 else
21869 {
21873 }
21875 NULL_TREE);
21877 }
21878 else
21879 {
21881 NULL_TREE);
21882 /* C++11 noreturn attribute is equivalent to GNU's. */
21885 /* C++14 deprecated attribute is equivalent to GNU's. */
21888 }
21890 /* Now parse the optional argument clause of the attribute. */
21895 {
21901 /* A GNU attribute that takes an identifier in parameter. */
21904 vec = cp_parser_parenthesized_expression_list
21910 else
21911 {
21914 }
21918 else
21920 }
21923 }
21925 /* Parse a list of standard C++-11 attributes.
21927 attribute-list:
21928 attribute [opt]
21929 attribute-list , attribute[opt]
21930 attribute ...
21931 attribute-list , attribute ...
21932 */
21934 static tree
21936 {
21941 {
21946 {
21949 }
21954 }
21957 }
21959 /* Parse a standard C++-11 attribute specifier.
21961 attribute-specifier:
21962 [ [ attribute-list ] ]
21963 alignment-specifier
21965 alignment-specifier:
21966 alignas ( type-id ... [opt] )
21967 alignas ( alignment-expression ... [opt] ). */
21969 static tree
21971 {
21977 {
21986 else
21987 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21988 when we are sure that we have actually parsed them. */
21990 }
21991 else
21992 {
21993 tree alignas_expr;
21995 /* Look for an alignment-specifier. */
22007 {
22010 }
22016 {
22020 alignas_expr =
22028 }
22031 {
22034 }
22038 /* Build the C++-11 representation of an 'aligned'
22039 attribute. */
22040 attributes =
22044 }
22047 }
22049 /* Parse a standard C++-11 attribute-specifier-seq.
22051 attribute-specifier-seq:
22052 attribute-specifier-seq [opt] attribute-specifier
22053 */
22055 static tree
22057 {
22061 {
22070 }
22074 }
22076 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22077 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22078 current value of the PEDANTIC flag, regardless of whether or not
22079 the `__extension__' keyword is present. The caller is responsible
22080 for restoring the value of the PEDANTIC flag. */
22082 static bool
22084 {
22085 /* Save the old value of the PEDANTIC flag. */
22089 {
22090 /* Consume the `__extension__' token. */
22092 /* We're not being pedantic while the `__extension__' keyword is
22093 in effect. */
22097 }
22100 }
22102 /* Parse a label declaration.
22104 label-declaration:
22105 __label__ label-declarator-seq ;
22107 label-declarator-seq:
22108 identifier , label-declarator-seq
22109 identifier */
22111 static void
22113 {
22114 /* Look for the `__label__' keyword. */
22118 {
22119 tree identifier;
22121 /* Look for an identifier. */
22123 /* If we failed, stop. */
22126 /* Declare it as a label. */
22128 /* If the next token is a `;', stop. */
22131 /* Look for the `,' separating the label declarations. */
22133 }
22135 /* Look for the final `;'. */
22137 }
22139 /* Support Functions */
22141 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22142 NAME should have one of the representations used for an
22143 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22144 is returned. If PARSER->SCOPE is a dependent type, then a
22145 SCOPE_REF is returned.
22147 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22148 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22149 was formed. Abstractly, such entities should not be passed to this
22150 function, because they do not need to be looked up, but it is
22151 simpler to check for this special case here, rather than at the
22152 call-sites.
22154 In cases not explicitly covered above, this function returns a
22155 DECL, OVERLOAD, or baselink representing the result of the lookup.
22156 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22157 is returned.
22159 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22160 (e.g., "struct") that was used. In that case bindings that do not
22161 refer to types are ignored.
22163 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22164 ignored.
22166 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22167 are ignored.
22169 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22170 types.
22172 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22173 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22174 NULL_TREE otherwise. */
22176 static tree
22183 location_t name_location)
22184 {
22185 tree decl;
22188 /* Assume that the lookup will be unambiguous. */
22192 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22193 no longer valid. Note that if we are parsing tentatively, and
22194 the parse fails, OBJECT_TYPE will be automatically restored. */
22200 /* A template-id has already been resolved; there is no lookup to
22201 do. */
22205 {
22209 }
22211 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22212 it should already have been checked to make sure that the name
22213 used matches the type being destroyed. */
22215 {
22216 tree type;
22218 /* Figure out to which type this destructor applies. */
22223 else
22225 /* If that's not a class type, there is no destructor. */
22232 /* If it was a class type, return the destructor. */
22234 }
22236 /* By this point, the NAME should be an ordinary identifier. If
22237 the id-expression was a qualified name, the qualifying scope is
22238 stored in PARSER->SCOPE at this point. */
22241 /* Perform the lookup. */
22243 {
22249 /* If the SCOPE is dependent, the lookup must be deferred until
22250 the template is instantiated -- unless we are explicitly
22251 looking up names in uninstantiated templates. Even then, we
22252 cannot look up the name if the scope is not a class type; it
22253 might, for example, be a template type parameter. */
22258 /* Defer lookup. */
22260 else
22261 {
22264 /* If PARSER->SCOPE is a dependent type, then it must be a
22265 class type, and we must not be checking dependencies;
22266 otherwise, we would have processed this lookup above. So
22267 that PARSER->SCOPE is not considered a dependent base by
22268 lookup_member, we must enter the scope here. */
22272 /* If the PARSER->SCOPE is a template specialization, it
22273 may be instantiated during name lookup. In that case,
22274 errors may be issued. Even if we rollback the current
22275 tentative parse, those errors are valid. */
22280 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22281 lookup result and the nested-name-specifier nominates a class C:
22282 * if the name specified after the nested-name-specifier, when
22283 looked up in C, is the injected-class-name of C (Clause 9), or
22284 * if the name specified after the nested-name-specifier is the
22285 same as the identifier or the simple-template-id's template-
22286 name in the last component of the nested-name-specifier,
22287 the name is instead considered to name the constructor of
22288 class C. [ Note: for example, the constructor is not an
22289 acceptable lookup result in an elaborated-type-specifier so
22290 the constructor would not be used in place of the
22291 injected-class-name. --end note ] Such a constructor name
22292 shall be used only in the declarator-id of a declaration that
22293 names a constructor or in a using-declaration. */
22301 /* If we have a single function from a using decl, pull it out. */
22308 }
22310 /* If the scope is a dependent type and either we deferred lookup or
22311 we did lookup but didn't find the name, rememeber the name. */
22314 {
22316 {
22317 tree type;
22319 /* The resolution to Core Issue 180 says that `struct
22320 A::B' should be considered a type-name, even if `A'
22321 is dependent. */
22326 }
22330 CPP_CLOSE_PAREN)))
22334 else
22337 is_template);
22338 }
22341 }
22343 {
22344 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22345 OBJECT_TYPE is not a class. */
22347 /* If the OBJECT_TYPE is a template specialization, it may
22348 be instantiated during name lookup. In that case, errors
22349 may be issued. Even if we rollback the current tentative
22350 parse, those errors are valid. */
22352 name,
22355 tf_warning_or_error);
22356 else
22360 /* Look it up in the enclosing context. */
22366 }
22367 else
22368 {
22374 }
22376 /* If the lookup failed, let our caller know. */
22380 /* Pull out the template from an injected-class-name (or multiple). */
22384 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22386 {
22389 /* The error message we have to print is too complicated for
22390 cp_parser_error, so we incorporate its actions directly. */
22392 {
22394 name);
22396 }
22398 }
22406 /* If we have resolved the name of a member declaration, check to
22407 see if the declaration is accessible. When the name resolves to
22408 set of overloaded functions, accessibility is checked when
22409 overload resolution is done.
22411 During an explicit instantiation, access is not checked at all,
22412 as per [temp.explicit]. */
22419 }
22421 /* Like cp_parser_lookup_name, but for use in the typical case where
22422 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22423 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22425 static tree
22427 {
22429 none_type,
22434 location);
22435 }
22437 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22438 the current context, return the TYPE_DECL. If TAG_NAME_P is
22439 true, the DECL indicates the class being defined in a class-head,
22440 or declared in an elaborated-type-specifier.
22442 Otherwise, return DECL. */
22444 static tree
22446 {
22447 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22448 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22450 struct A {
22451 template <typename T> struct B;
22452 };
22454 template <typename T> struct A::B {};
22456 Similarly, in an elaborated-type-specifier:
22458 namespace N { struct X{}; }
22460 struct A {
22461 template <typename T> friend struct N::X;
22462 };
22464 However, if the DECL refers to a class type, and we are in
22465 the scope of the class, then the name lookup automatically
22466 finds the TYPE_DECL created by build_self_reference rather
22467 than a TEMPLATE_DECL. For example, in:
22469 template <class T> struct S {
22470 S s;
22471 };
22473 there is no need to handle such case. */
22479 }
22481 /* If too many, or too few, template-parameter lists apply to the
22482 declarator, issue an error message. Returns TRUE if all went well,
22483 and FALSE otherwise. */
22485 static bool
22488 location_t declarator_location)
22489 {
22491 {
22493 {
22501 /* If the DECLARATOR has the form `X<y>' then it uses one
22502 additional level of template parameters. */
22505 return cp_parser_check_template_parameters
22507 }
22522 }
22524 }
22526 /* NUM_TEMPLATES were used in the current declaration. If that is
22527 invalid, return FALSE and issue an error messages. Otherwise,
22528 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22529 declarator and we can print more accurate diagnostics. */
22531 static bool
22534 location_t location,
22536 {
22537 /* If there are the same number of template classes and parameter
22538 lists, that's OK. */
22541 /* If there are more, but only one more, then we are referring to a
22542 member template. That's OK too. */
22545 /* If there are more template classes than parameter lists, we have
22546 something like:
22548 template <class T> void S<T>::R<T>::f (); */
22550 {
22560 else
22563 }
22564 /* Otherwise, there are too many template parameter lists. We have
22565 something like:
22567 template <class T> template <class U> void S::f(); */
22570 }
22572 /* Parse an optional `::' token indicating that the following name is
22573 from the global namespace. If so, PARSER->SCOPE is set to the
22574 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22575 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22576 Returns the new value of PARSER->SCOPE, if the `::' token is
22577 present, and NULL_TREE otherwise. */
22579 static tree
22581 {
22584 /* Peek at the next token. */
22586 /* If we're looking at a `::' token then we're starting from the
22587 global namespace, not our current location. */
22589 {
22590 /* Consume the `::' token. */
22592 /* Set the SCOPE so that we know where to start the lookup. */
22598 }
22600 {
22604 }
22607 }
22609 /* Returns TRUE if the upcoming token sequence is the start of a
22610 constructor declarator. If FRIEND_P is true, the declarator is
22611 preceded by the `friend' specifier. */
22613 static bool
22615 {
22618 tree nested_name_specifier;
22621 /* The common case is that this is not a constructor declarator, so
22622 try to avoid doing lots of work if at all possible. It's not
22623 valid declare a constructor at function scope. */
22626 /* And only certain tokens can begin a constructor declarator. */
22634 /* Parse tentatively; we are going to roll back all of the tokens
22635 consumed here. */
22637 /* Assume that we are looking at a constructor declarator. */
22640 /* Look for the optional `::' operator. */
22643 /* Look for the nested-name-specifier. */
22644 nested_name_specifier
22655 /* Outside of a class-specifier, there must be a
22656 nested-name-specifier. */
22662 /* If we have a class scope, this is easy; DR 147 says that S::S always
22663 names the constructor, and no other qualified name could. */
22666 {
22676 }
22677 /* If we still think that this might be a constructor-declarator,
22678 look for a class-name. */
22680 {
22681 /* If we have:
22683 template <typename T> struct S {
22684 S();
22685 };
22687 we must recognize that the nested `S' names a class. */
22688 tree type_decl;
22692 none_type,
22696 /* If there was no class-name, then this is not a constructor.
22697 Otherwise, if we are in a class-specifier and we aren't
22698 handling a friend declaration, check that its type matches
22699 current_class_type (c++/38313). Note: error_mark_node
22700 is left alone for error recovery purposes. */
22702 && (outside_class_specifier_p
22707 /* If we're still considering a constructor, we have to see a `(',
22708 to begin the parameter-declaration-clause, followed by either a
22709 `)', an `...', or a decl-specifier. We need to check for a
22710 type-specifier to avoid being fooled into thinking that:
22712 S (f) (int);
22714 is a constructor. (It is actually a function named `f' that
22715 takes one parameter (of type `int') and returns a value of type
22716 `S'. */
22724 /* A parameter declaration begins with a decl-specifier,
22725 which is either the "attribute" keyword, a storage class
22726 specifier, or (usually) a type-specifier. */
22728 {
22729 tree type;
22733 /* Names appearing in the type-specifier should be looked up
22734 in the scope of the class. */
22737 else
22738 {
22741 {
22745 {
22748 }
22749 }
22751 }
22753 /* Inside the constructor parameter list, surrounding
22754 template-parameter-lists do not apply. */
22755 saved_num_template_parameter_lists
22759 /* Look for the type-specifier. */
22761 CP_PARSER_FLAGS_NONE,
22767 parser->num_template_parameter_lists
22770 /* Leave the scope of the class. */
22775 }
22776 }
22778 /* We did not really want to consume any tokens. */
22782 }
22784 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22785 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22786 they must be performed once we are in the scope of the function.
22788 Returns the function defined. */
22790 static tree
22791 cp_parser_function_definition_from_specifiers_and_declarator
22794 tree attributes,
22796 {
22797 tree fn;
22800 /* Begin the function-definition. */
22803 /* The things we're about to see are not directly qualified by any
22804 template headers we've seen thus far. */
22807 /* If there were names looked up in the decl-specifier-seq that we
22808 did not check, check them now. We must wait until we are in the
22809 scope of the function to perform the checks, since the function
22810 might be a friend. */
22814 {
22817 }
22820 {
22821 /* Skip the entire function. */
22824 }
22826 {
22827 /* Seen already, skip it. An error message has already been output. */
22831 /* If this is a function from a class, pop the nested class. */
22834 }
22835 else
22836 {
22837 timevar_id_t tv;
22840 else
22846 }
22849 }
22851 /* Parse the part of a function-definition that follows the
22852 declarator. INLINE_P is TRUE iff this function is an inline
22853 function defined within a class-specifier.
22855 Returns the function defined. */
22857 static tree
22860 {
22861 tree fn;
22867 bool fully_implicit_function_template_p
22870 tree implicit_template_parms
22873 cp_binding_level* implicit_template_scope
22879 /* If the next token is `return', then the code may be trying to
22880 make use of the "named return value" extension that G++ used to
22881 support. */
22884 {
22885 /* Consume the `return' keyword. */
22887 /* Look for the identifier that indicates what value is to be
22888 returned. */
22890 /* Issue an error message. */
22893 /* Skip tokens until we reach the start of the function body. */
22895 {
22902 }
22903 }
22904 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22905 anything declared inside `f'. */
22906 saved_in_unbraced_linkage_specification_p
22909 /* Inside the function, surrounding template-parameter-lists do not
22910 apply. */
22911 saved_num_template_parameter_lists
22917 /* If the next token is `try', `__transaction_atomic', or
22918 `__transaction_relaxed`, then we are looking at either function-try-block
22919 or function-transaction-block. Note that all of these include the
22920 function-body. */
22923 RID_TRANSACTION_ATOMIC);
22925 RID_TRANSACTION_RELAXED))
22927 RID_TRANSACTION_RELAXED);
22930 else
22931 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22936 /* Finish the function. */
22939 /* Generate code for it, if necessary. */
22941 /* Restore the saved values. */
22942 parser->in_unbraced_linkage_specification_p
22944 parser->num_template_parameter_lists
22948 parser->fully_implicit_function_template_p
22950 parser->implicit_template_parms
22952 parser->implicit_template_scope
22959 }
22961 /* Parse a template-declaration, assuming that the `export' (and
22962 `extern') keywords, if present, has already been scanned. MEMBER_P
22963 is as for cp_parser_template_declaration. */
22965 static void
22967 {
22970 tree parameter_list;
22975 /* Look for the `template' keyword. */
22980 /* And the `<'. */
22984 {
22985 /* 14.5.2.2 [temp.mem]
22987 A local class shall not have member templates. */
22992 }
22993 /* [temp]
22995 A template ... shall not have C linkage. */
22997 {
22999 /* Give it C++ linkage to avoid confusing other parts of the
23000 front end. */
23003 }
23004 else
23007 /* We cannot perform access checks on the template parameter
23008 declarations until we know what is being declared, just as we
23009 cannot check the decl-specifier list. */
23012 /* If the next token is `>', then we have an invalid
23013 specialization. Rather than complain about an invalid template
23014 parameter, issue an error message here. */
23016 {
23020 }
23021 else
23022 {
23023 /* Parse the template parameters. */
23025 }
23027 /* Get the deferred access checks from the parameter list. These
23028 will be checked once we know what is being declared, as for a
23029 member template the checks must be performed in the scope of the
23030 class containing the member. */
23033 /* Look for the `>'. */
23035 /* We just processed one more parameter list. */
23037 /* If the next token is `template', there are more template
23038 parameters. */
23040 RID_TEMPLATE))
23045 else
23046 {
23047 /* There are no access checks when parsing a template, as we do not
23048 know if a specialization will be a friend. */
23052 checks,
23053 member_p,
23058 /* If this is a member template declaration, let the front
23059 end know. */
23061 {
23066 }
23071 }
23072 /* We are done with the current parameter list. */
23077 /* Finish up. */
23080 /* Check the template arguments for a literal operator template. */
23084 {
23088 else
23089 {
23092 {
23098 }
23100 {
23108 }
23109 else
23111 }
23114 " Expected non-type template argument pack <char...>"
23116 decl);
23117 }
23118 /* Register member declarations. */
23121 /* For the erroneous case of a template with C linkage, we pushed an
23122 implicit C++ linkage scope; exit that scope now. */
23125 /* If DECL is a function template, we must return to parse it later.
23126 (Even though there is no definition, there might be default
23127 arguments that need handling.) */
23131 }
23133 /* Perform the deferred access checks from a template-parameter-list.
23134 CHECKS is a TREE_LIST of access checks, as returned by
23135 get_deferred_access_checks. */
23137 static void
23138 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23139 {
23143 }
23145 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23146 `function-definition' sequence that follows a template header.
23147 If MEMBER_P is true, this declaration appears in a class scope.
23149 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23150 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23152 static tree
23158 {
23161 cp_decl_specifier_seq decl_specifiers;
23165 /* This function is only used when processing a template
23166 declaration. */
23170 /* Defer access checks until we know what is being declared. */
23173 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23174 alternative. */
23177 CP_PARSER_FLAGS_OPTIONAL,
23183 /* There are no template typedefs. */
23185 {
23189 }
23191 /* Gather up the access checks that occurred the
23192 decl-specifier-seq. */
23195 /* Check for the declaration of a template class. */
23197 {
23199 {
23202 /* In this case:
23204 struct C {
23205 friend template <typename T> struct A<T>::B;
23206 };
23208 A<T>::B will be represented by a TYPENAME_TYPE, and
23209 therefore not recognized by shadow_tag. */
23211 && !decl
23218 else
23221 /* Perform access checks for template parameters. */
23223 }
23224 }
23226 /* Complain about missing 'typename' or other invalid type names. */
23229 {
23230 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23231 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23232 the rest of this declaration. */
23235 }
23237 /* If it's not a template class, try for a template function. If
23238 the next token is a `;', then this declaration does not declare
23239 anything. But, if there were errors in the decl-specifiers, then
23240 the error might well have come from an attempted class-specifier.
23241 In that case, there's no need to warn about a missing declarator. */
23245 {
23248 checks,
23250 member_p,
23251 declares_class_or_enum,
23253 NULL);
23255 /* 7.1.1-1 [dcl.stc]
23257 A storage-class-specifier shall not be specified in an explicit
23258 specialization... */
23260 && explicit_specialization_p
23262 {
23266 }
23270 }
23272 /* Look for a trailing `;' after the declaration. */
23278 out:
23281 /* Clear any current qualification; whatever comes next is the start
23282 of something new. */
23288 }
23290 /* Parse a cast-expression that is not the operand of a unary "&". */
23292 static tree
23294 {
23297 }
23299 /* Parse a functional cast to TYPE. Returns an expression
23300 representing the cast. */
23302 static tree
23304 {
23306 tree expression_list;
23307 tree cast;
23314 {
23322 tf_warning_or_error);
23323 }
23332 else
23333 {
23336 }
23339 tf_warning_or_error);
23340 /* [expr.const]/1: In an integral constant expression "only type
23341 conversions to integral or enumeration type can be used". */
23347 NIC_CONSTRUCTOR))
23350 }
23352 /* Save the tokens that make up the body of a member function defined
23353 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23354 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23355 specifiers applied to the declaration. Returns the FUNCTION_DECL
23356 for the member function. */
23358 static tree
23362 tree attributes)
23363 {
23366 tree fn;
23368 /* Create the FUNCTION_DECL. */
23371 /* If something went badly wrong, bail out now. */
23373 {
23374 /* If there's a function-body, skip it. */
23379 }
23381 /* Remember it, if there default args to post process. */
23384 /* Save away the tokens that make up the body of the
23385 function. */
23387 /* Handle function try blocks. */
23390 /* We can have braced-init-list mem-initializers before the fn body. */
23392 {
23395 {
23396 /* cache_group will stop after an un-nested { } pair, too. */
23400 /* variadic mem-inits have ... after the ')'. */
23403 }
23404 }
23406 /* Handle function try blocks. */
23411 /* Save away the inline definition; we will process it when the
23412 class is complete. */
23416 /* We need to know that this was defined in the class, so that
23417 friend templates are handled correctly. */
23420 /* Add FN to the queue of functions to be parsed later. */
23424 }
23426 /* Save the tokens that make up the in-class initializer for a non-static
23427 data member. Returns a DEFAULT_ARG. */
23429 static tree
23431 {
23433 }
23435 /* Parse a template-argument-list, as well as the trailing ">" (but
23436 not the opening "<"). See cp_parser_template_argument_list for the
23437 return value. */
23439 static tree
23441 {
23442 tree arguments;
23443 tree saved_scope;
23444 tree saved_qualifying_scope;
23445 tree saved_object_scope;
23450 /* [temp.names]
23452 When parsing a template-id, the first non-nested `>' is taken as
23453 the end of the template-argument-list rather than a greater-than
23454 operator. */
23455 saved_greater_than_is_operator_p
23458 /* Parsing the argument list may modify SCOPE, so we save it
23459 here. */
23463 /* We need to evaluate the template arguments, even though this
23464 template-id may be nested within a "sizeof". */
23469 /* Parse the template-argument-list itself. */
23473 else
23475 /* Look for the `>' that ends the template-argument-list. If we find
23476 a '>>' instead, it's probably just a typo. */
23478 {
23480 {
23481 /* In C++0x, a `>>' in a template argument list or cast
23482 expression is considered to be two separate `>'
23483 tokens. So, change the current token to a `>', but don't
23484 consume it: it will be consumed later when the outer
23485 template argument list (or cast expression) is parsed.
23486 Note that this replacement of `>' for `>>' is necessary
23487 even if we are parsing tentatively: in the tentative
23488 case, after calling
23489 cp_parser_enclosed_template_argument_list we will always
23490 throw away all of the template arguments and the first
23491 closing `>', either because the template argument list
23492 was erroneous or because we are replacing those tokens
23493 with a CPP_TEMPLATE_ID token. The second `>' (which will
23494 not have been thrown away) is needed either to close an
23495 outer template argument list or to complete a new-style
23496 cast. */
23499 }
23501 {
23502 /* If we're in a nested template argument list, the '>>' has
23503 to be a typo for '> >'. We emit the error message, but we
23504 continue parsing and we push a '>' as next token, so that
23505 the argument list will be parsed correctly. Note that the
23506 global source location is still on the token before the
23507 '>>', so we need to say explicitly where we want it. */
23513 }
23514 else
23515 {
23516 /* If this is not a nested template argument list, the '>>'
23517 is a typo for '>'. Emit an error message and continue.
23518 Same deal about the token location, but here we can get it
23519 right by consuming the '>>' before issuing the diagnostic. */
23522 "spurious %<>>%>, use %<>%> to terminate "
23524 }
23525 }
23526 else
23528 /* The `>' token might be a greater-than operator again now. */
23529 parser->greater_than_is_operator_p
23531 /* Restore the SAVED_SCOPE. */
23539 }
23541 /* MEMBER_FUNCTION is a member function, or a friend. If default
23542 arguments, or the body of the function have not yet been parsed,
23543 parse them now. */
23545 static void
23547 {
23549 /* If this member is a template, get the underlying
23550 FUNCTION_DECL. */
23554 /* There should not be any class definitions in progress at this
23555 point; the bodies of members are only parsed outside of all class
23556 definitions. */
23558 /* While we're parsing the member functions we might encounter more
23559 classes. We want to handle them right away, but we don't want
23560 them getting mixed up with functions that are currently in the
23561 queue. */
23564 /* Make sure that any template parameters are in scope. */
23567 /* If the body of the function has not yet been parsed, parse it
23568 now. */
23570 {
23571 tree function_scope;
23574 /* The function is no longer pending; we are processing it. */
23579 /* If this is a local class, enter the scope of the containing
23580 function. */
23585 /* Push the body of the function onto the lexer stack. */
23588 /* Let the front end know that we going to be defining this
23589 function. */
23593 /* Don't do access checking if it is a templated function. */
23597 /* #pragma omp declare reduction needs special parsing. */
23599 {
23604 }
23605 else
23606 /* Now, parse the body of the function. */
23613 /* Leave the scope of the containing function. */
23617 }
23619 /* Remove any template parameters from the symbol table. */
23622 /* Restore the queue. */
23625 }
23627 /* If DECL contains any default args, remember it on the unparsed
23628 functions queue. */
23630 static void
23632 {
23633 tree probe;
23636 probe;
23639 {
23643 }
23644 }
23646 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23647 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23648 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23649 from the parameter-type-list. */
23651 static tree
23654 {
23656 tree parsed_arg;
23662 /* Push the saved tokens for the default argument onto the parser's
23663 lexer stack. */
23669 /* Parse the default argument. */
23680 {
23681 /* In a non-template class, check conversions now. In a template,
23682 we'll wait and instantiate these as needed. */
23685 tf_warning_or_error);
23686 else
23687 {
23694 /* This represents the whole initialization. */
23696 }
23697 }
23699 /* If the token stream has not been completely used up, then
23700 there was extra junk after the end of the default
23701 argument. */
23703 {
23706 else
23708 }
23710 /* Revert to the main lexer. */
23714 }
23716 /* FIELD is a non-static data member with an initializer which we saved for
23717 later; parse it now. */
23719 static void
23721 {
23722 tree def;
23729 NULL_TREE);
23735 }
23737 /* FN is a FUNCTION_DECL which may contains a parameter with an
23738 unparsed DEFAULT_ARG. Parse the default args now. This function
23739 assumes that the current scope is the scope in which the default
23740 argument should be processed. */
23742 static void
23744 {
23748 /* While we're parsing the default args, we might (due to the
23749 statement expression extension) encounter more classes. We want
23750 to handle them right away, but we don't want them getting mixed
23751 up with default args that are currently in the queue. */
23754 /* Local variable names (and the `this' keyword) may not appear
23755 in a default argument. */
23766 {
23768 tree parsed_arg;
23770 tree copy;
23777 /* This can happen for a friend declaration for a function
23778 already declared with default arguments. */
23781 parsed_arg
23783 default_arg,
23786 {
23788 }
23792 /* Update any instantiations we've already created. */
23796 }
23800 /* Make sure no default arg is missing. */
23803 /* Restore the state of local_variables_forbidden_p. */
23806 /* Restore the queue. */
23808 }
23810 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23812 sizeof ... ( identifier )
23814 where the 'sizeof' token has already been consumed. */
23816 static tree
23818 {
23819 /* Consume the `...'. */
23826 else
23834 /* The name is not qualified. */
23852 }
23854 /* Parse the operand of `sizeof' (or a similar operator). Returns
23855 either a TYPE or an expression, depending on the form of the
23856 input. The KEYWORD indicates which kind of expression we have
23857 encountered. */
23859 static tree
23861 {
23868 /* If it's a `...', then we are computing the length of a parameter
23869 pack. */
23874 /* Types cannot be defined in a `sizeof' expression. Save away the
23875 old message. */
23877 /* And create the new one. */
23883 /* The restrictions on constant-expressions do not apply inside
23884 sizeof expressions. */
23885 saved_integral_constant_expression_p
23887 saved_non_integral_constant_expression_p
23891 /* Do not actually evaluate the expression. */
23894 /* If it's a `(', then we might be looking at the type-id
23895 construction. */
23897 {
23901 /* We can't be sure yet whether we're looking at a type-id or an
23902 expression. */
23904 /* Consume the `('. */
23906 /* Note: as a GNU Extension, compound literals are considered
23907 postfix-expressions as they are in C99, so they are valid
23908 arguments to sizeof. See comment in cp_parser_cast_expression
23909 for details. */
23911 /* Skip tokens until the next token is a closing parenthesis.
23912 If we find the closing `)', and the next token is a `{', then
23913 we are looking at a compound-literal. */
23914 compound_literal_p
23918 /* Roll back the tokens we skipped. */
23920 /* If we were looking at a compound-literal, simulate an error
23921 so that the call to cp_parser_parse_definitely below will
23922 fail. */
23925 else
23926 {
23929 /* Look for the type-id. */
23931 /* Look for the closing `)'. */
23934 }
23936 /* If all went well, then we're done. */
23938 {
23939 cp_decl_specifier_seq decl_specs;
23941 /* Build a trivial decl-specifier-seq. */
23945 /* Call grokdeclarator to figure out what type this is. */
23948 TYPENAME,
23951 }
23952 }
23954 /* If the type-id production did not work out, then we must be
23955 looking at the unary-expression production. */
23960 /* Go back to evaluating expressions. */
23964 /* Free the message we created. */
23966 /* And restore the old one. */
23968 parser->integral_constant_expression_p
23970 parser->non_integral_constant_expression_p
23974 }
23976 /* If the current declaration has no declarator, return true. */
23978 static bool
23980 {
23981 /* If the next token is a `;' or a `,' then there is no
23982 declarator. */
23985 }
23987 /* Update the DECL_SPECS to reflect the storage class indicated by
23988 KEYWORD. */
23990 static void
23995 {
23996 cp_storage_class storage_class;
23999 {
24003 }
24005 {
24008 }
24013 {
24016 }
24019 {
24037 }
24041 /* A storage class specifier cannot be applied alongside a typedef
24042 specifier. If there is a typedef specifier present then set
24043 conflicting_specifiers_p which will trigger an error later
24044 on in grokdeclarator. */
24047 }
24049 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24050 is true, the type is a class or enum definition. */
24052 static void
24054 tree type_spec,
24057 {
24060 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24061 (with, for example, in "typedef int wchar_t;") we remember that
24062 this is what happened. In system headers, we ignore these
24063 declarations so that G++ can work with system headers that are not
24064 C++-safe. */
24066 && !type_definition_p
24076 {
24079 ds_redefined_builtin_type_spec,
24080 token);
24082 {
24086 }
24087 }
24090 else
24091 {
24096 }
24097 }
24099 /* True iff TOKEN is the GNU keyword __thread. */
24101 static bool
24103 {
24106 }
24108 /* Set the location for a declarator specifier and check if it is
24109 duplicated.
24111 DECL_SPECS is the sequence of declarator specifiers onto which to
24112 set the location.
24114 DS is the single declarator specifier to set which location is to
24115 be set onto the existing sequence of declarators.
24117 LOCATION is the location for the declarator specifier to
24118 consider. */
24120 static void
24123 {
24132 {
24136 }
24137 else
24138 {
24140 {
24144 else
24145 {
24148 OPT_Wlong_long,
24150 }
24151 }
24153 {
24158 else
24160 }
24161 else
24162 {
24178 "__complex"
24179 };
24182 }
24183 }
24184 }
24186 /* Return true iff the declarator specifier DS is present in the
24187 sequence of declarator specifiers DECL_SPECS. */
24189 bool
24191 cp_decl_spec ds)
24192 {
24199 }
24201 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24202 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24204 static bool
24206 {
24208 }
24210 /* Issue an error message indicating that TOKEN_DESC was expected.
24211 If KEYWORD is true, it indicated this function is called by
24212 cp_parser_require_keword and the required token can only be
24213 a indicated keyword. */
24215 static void
24217 required_token token_desc,
24219 {
24221 {
24290 }
24292 {
24294 {
24373 }
24374 }
24375 else
24377 }
24381 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24382 issue an error message indicating that TOKEN_DESC was expected.
24384 Returns the token consumed, if the token had the appropriate type.
24385 Otherwise, returns NULL. */
24390 required_token token_desc)
24391 {
24394 else
24395 {
24396 /* Output the MESSAGE -- unless we're parsing tentatively. */
24400 }
24401 }
24403 /* An error message is produced if the next token is not '>'.
24404 All further tokens are skipped until the desired token is
24405 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24407 static void
24409 {
24410 /* Current level of '< ... >'. */
24412 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24415 /* Are we ready, yet? If not, issue error message. */
24419 /* Skip tokens until the desired token is found. */
24421 {
24422 /* Peek at the next token. */
24424 {
24432 /* C++0x views the `>>' operator as two `>' tokens, but
24433 C++98 does not. */
24436 {
24437 /* We've hit a `>>' where the first `>' closes the
24438 template argument list, and the second `>' is
24439 spurious. Just consume the `>>' and stop; we've
24440 already produced at least one error. */
24443 }
24444 /* Fall through for C++0x, so we handle the second `>' in
24445 the `>>'. */
24449 {
24450 /* We've reached the token we want, consume it and stop. */
24453 }
24472 /* The '>' was probably forgotten, don't look further. */
24477 }
24479 /* Consume this token. */
24481 }
24482 }
24484 /* If the next token is the indicated keyword, consume it. Otherwise,
24485 issue an error message indicating that TOKEN_DESC was expected.
24487 Returns the token consumed, if the token had the appropriate type.
24488 Otherwise, returns NULL. */
24493 required_token token_desc)
24494 {
24498 {
24501 }
24504 }
24506 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24507 function-definition. */
24509 static bool
24511 {
24514 /* A ctor-initializer begins with a `:'. */
24516 /* A function-try-block begins with `try'. */
24518 /* A function-transaction-block begins with `__transaction_atomic'
24519 or `__transaction_relaxed'. */
24522 /* The named return value extension begins with `return'. */
24524 }
24526 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24527 definition. */
24529 static bool
24531 {
24538 }
24540 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24541 C++0x) ending a template-argument. */
24543 static bool
24545 {
24553 }
24555 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24556 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24558 static bool
24561 {
24567 /* Check for the sequence `<::' in the original code. It would be lexed as
24568 `[:', where `[' is a digraph, and there is no whitespace before
24569 `:'. */
24571 {
24576 }
24578 }
24580 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24581 or none_type otherwise. */
24583 static enum tag_types
24585 {
24587 {
24597 }
24598 }
24600 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24602 static void
24604 {
24608 {
24612 type))
24615 }
24616 }
24618 /* Issue an error message if DECL is redeclared with different
24619 access than its original declaration [class.access.spec/3].
24620 This applies to nested classes and nested class templates.
24621 [class.mem/1]. */
24623 static void
24625 {
24634 }
24636 /* Look for the `template' keyword, as a syntactic disambiguator.
24637 Return TRUE iff it is present, in which case it will be
24638 consumed. */
24640 static bool
24642 {
24644 {
24645 /* In C++98 the `template' keyword can only be used within templates;
24646 outside templates the parser can always figure out what is a
24647 template and what is not. In C++11, per the resolution of DR 468,
24648 `template' is allowed in cases where it is not strictly necessary. */
24651 {
24654 "in C++98 %<template%> (as a disambiguator) is only "
24656 /* If this part of the token stream is rescanned, the same
24657 error message would be generated. So, we purge the token
24658 from the stream. */
24661 }
24662 else
24663 {
24664 /* Consume the `template' keyword. */
24667 }
24668 }
24670 }
24672 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24673 set PARSER->SCOPE, and perform other related actions. */
24675 static void
24677 {
24683 /* Get the stored value. */
24685 /* Perform any access checks that were deferred. */
24688 {
24693 }
24694 /* Set the scope from the stored value. */
24698 }
24700 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24701 encounter the end of a block before what we were looking for. */
24703 static bool
24707 {
24709 {
24712 /* Abort a parenthesized expression if we encounter a semicolon. */
24716 /* If we've reached the end of the file, stop. */
24722 /* We've hit the end of an enclosing block, so there's been some
24723 kind of syntax error. */
24726 /* Consume the token. */
24728 /* See if it starts a new group. */
24730 {
24732 /* In theory this should probably check end == '}', but
24733 cp_parser_save_member_function_body needs it to exit
24734 after either '}' or ')' when called with ')'. */
24737 }
24739 {
24743 }
24748 }
24749 }
24751 /* Like above, for caching a default argument or NSDMI. Both of these are
24752 terminated by a non-nested comma, but it can be unclear whether or not a
24753 comma is nested in a template argument list unless we do more parsing.
24754 In order to handle this ambiguity, when we encounter a ',' after a '<'
24755 we try to parse what follows as a parameter-declaration-list (in the
24756 case of a default argument) or a member-declarator (in the case of an
24757 NSDMI). If that succeeds, then we stop caching. */
24759 static tree
24761 {
24766 tree default_argument;
24768 /* Add tokens until we have processed the entire default
24769 argument. We add the range [first_token, token). */
24772 {
24773 /* For list-initialization, this is straightforward. */
24776 }
24778 {
24781 /* Peek at the next token. */
24783 /* What we do depends on what token we have. */
24785 {
24786 /* In valid code, a default argument must be
24787 immediately followed by a `,' `)', or `...'. */
24790 {
24791 /* If we've seen a '<', we might be in a
24792 template-argument-list. Until Core issue 325 is
24793 resolved, we don't know how this situation ought
24794 to be handled, so try to DTRT. We check whether
24795 what comes after the comma is a valid parameter
24796 declaration list. If it is, then the comma ends
24797 the default argument; otherwise the default
24798 argument continues. */
24801 /* Set ITALP so cp_parser_parameter_declaration_list
24802 doesn't decide to commit to this parse. */
24810 {
24816 }
24817 else
24818 {
24822 }
24829 }
24832 /* If we run into a non-nested `;', `}', or `]',
24833 then the code is invalid -- but the default
24834 argument is certainly over. */
24839 /* Handle correctly int n = sizeof ... ( p ); */
24842 /* Update DEPTH, if necessary. */
24857 /* This might be the comparison operator, or it might
24858 start a template argument list. */
24865 /* Fall through for C++0x, which treats the `>>'
24866 operator like two `>' tokens in certain
24867 cases. */
24871 {
24872 /* This might be an operator, or it might close a
24873 template argument list. But if a previous '<'
24874 started a template argument list, this will have
24875 closed it, so we can't be in one anymore. */
24879 }
24882 /* If we run out of tokens, issue an error message. */
24891 /* In these cases, we should look for template-ids.
24892 For example, if the default argument is
24893 `X<int, double>()', we need to do name lookup to
24894 figure out whether or not `X' is a template; if
24895 so, the `,' does not end the default argument.
24897 That is not yet done. */
24902 }
24904 /* If we've reached the end, stop. */
24908 /* Add the token to the token block. */
24910 }
24912 /* Create a DEFAULT_ARG to represent the unparsed default
24913 argument. */
24920 }
24922 /* Begin parsing tentatively. We always save tokens while parsing
24923 tentatively so that if the tentative parsing fails we can restore the
24924 tokens. */
24926 static void
24928 {
24929 /* Enter a new parsing context. */
24931 /* Begin saving tokens. */
24933 /* In order to avoid repetitive access control error messages,
24934 access checks are queued up until we are no longer parsing
24935 tentatively. */
24937 }
24939 /* Commit to the currently active tentative parse. */
24941 static void
24943 {
24947 /* Mark all of the levels as committed. */
24950 {
24957 }
24958 }
24960 /* Commit to the topmost currently active tentative parse.
24962 Note that this function shouldn't be called when there are
24963 irreversible side-effects while in a tentative state. For
24964 example, we shouldn't create a permanent entry in the symbol
24965 table, or issue an error message that might not apply if the
24966 tentative parse is aborted. */
24968 static void
24970 {
24975 {
24983 }
24984 }
24986 /* Abort the currently active tentative parse. All consumed tokens
24987 will be rolled back, and no diagnostics will be issued. */
24989 static void
24991 {
24995 /* Now, pretend that we want to see if the construct was
24996 successfully parsed. */
24998 }
25000 /* Stop parsing tentatively. If a parse error has occurred, restore the
25001 token stream. Otherwise, commit to the tokens we have consumed.
25002 Returns true if no error occurred; false otherwise. */
25004 static bool
25006 {
25010 /* Remember whether or not an error occurred, since we are about to
25011 destroy that information. */
25013 /* Remove the topmost context from the stack. */
25016 /* If no parse errors occurred, commit to the tentative parse. */
25018 {
25019 /* Commit to the tokens read tentatively, unless that was
25020 already done. */
25025 }
25026 /* Otherwise, if errors occurred, roll back our state so that things
25027 are just as they were before we began the tentative parse. */
25028 else
25029 {
25032 }
25033 /* Add the context to the front of the free list. */
25038 }
25040 /* Returns true if we are parsing tentatively and are not committed to
25041 this tentative parse. */
25043 static bool
25045 {
25048 }
25050 /* Returns nonzero iff an error has occurred during the most recent
25051 tentative parse. */
25053 static bool
25055 {
25058 }
25060 /* Returns nonzero if GNU extensions are allowed. */
25062 static bool
25064 {
25066 }
25067 \f
25068 /* Objective-C++ Productions */
25071 /* Parse an Objective-C expression, which feeds into a primary-expression
25072 above.
25074 objc-expression:
25075 objc-message-expression
25076 objc-string-literal
25077 objc-encode-expression
25078 objc-protocol-expression
25079 objc-selector-expression
25081 Returns a tree representation of the expression. */
25083 static tree
25085 {
25086 /* Try to figure out what kind of declaration is present. */
25090 {
25100 {
25112 }
25118 }
25121 }
25123 /* Parse an Objective-C message expression.
25125 objc-message-expression:
25126 [ objc-message-receiver objc-message-args ]
25128 Returns a representation of an Objective-C message. */
25130 static tree
25132 {
25141 }
25143 /* Parse an objc-message-receiver.
25145 objc-message-receiver:
25146 expression
25147 simple-type-specifier
25149 Returns a representation of the type or expression. */
25151 static tree
25153 {
25154 tree rcv;
25156 /* An Objective-C message receiver may be either (1) a type
25157 or (2) an expression. */
25166 CP_PARSER_FLAGS_NONE);
25169 }
25171 /* Parse the arguments and selectors comprising an Objective-C message.
25173 objc-message-args:
25174 objc-selector
25175 objc-selector-args
25176 objc-selector-args , objc-comma-args
25178 objc-selector-args:
25179 objc-selector [opt] : assignment-expression
25180 objc-selector-args objc-selector [opt] : assignment-expression
25182 objc-comma-args:
25183 assignment-expression
25184 objc-comma-args , assignment-expression
25186 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25187 selector arguments and TREE_VALUE containing a list of comma
25188 arguments. */
25190 static tree
25192 {
25198 {
25204 /* Detect if we have a unary selector. */
25213 sel_args
25218 }
25220 /* Handle non-selector arguments, if any. */
25222 {
25223 tree arg;
25228 addl_args
25233 }
25236 {
25239 }
25242 }
25244 /* Parse an Objective-C encode expression.
25246 objc-encode-expression:
25247 @encode objc-typename
25249 Returns an encoded representation of the type argument. */
25251 static tree
25253 {
25254 tree type;
25264 {
25268 }
25270 /* This happens if we find @encode(T) (where T is a template
25271 typename or something dependent on a template typename) when
25272 parsing a template. In that case, we can't compile it
25273 immediately, but we rather create an AT_ENCODE_EXPR which will
25274 need to be instantiated when the template is used.
25275 */
25277 {
25281 }
25284 }
25286 /* Parse an Objective-C @defs expression. */
25288 static tree
25290 {
25291 tree name;
25299 }
25301 /* Parse an Objective-C protocol expression.
25303 objc-protocol-expression:
25304 @protocol ( identifier )
25306 Returns a representation of the protocol expression. */
25308 static tree
25310 {
25311 tree proto;
25319 }
25321 /* Parse an Objective-C selector expression.
25323 objc-selector-expression:
25324 @selector ( objc-method-signature )
25326 objc-method-signature:
25327 objc-selector
25328 objc-selector-seq
25330 objc-selector-seq:
25331 objc-selector :
25332 objc-selector-seq objc-selector :
25334 Returns a representation of the method selector. */
25336 static tree
25338 {
25350 {
25359 {
25360 /* Detect if we have a unary selector. */
25362 {
25365 }
25366 else
25367 {
25369 }
25370 }
25375 {
25376 sel_seq
25379 sel_seq
25382 }
25383 else
25384 sel_seq
25389 }
25391 finish_selector:
25395 }
25397 /* Parse a list of identifiers.
25399 objc-identifier-list:
25400 identifier
25401 objc-identifier-list , identifier
25403 Returns a TREE_LIST of identifier nodes. */
25405 static tree
25407 {
25408 tree identifier;
25409 tree list;
25420 {
25427 identifier));
25429 }
25432 }
25434 /* Parse an Objective-C alias declaration.
25436 objc-alias-declaration:
25437 @compatibility_alias identifier identifier ;
25439 This function registers the alias mapping with the Objective-C front end.
25440 It returns nothing. */
25442 static void
25444 {
25452 }
25454 /* Parse an Objective-C class forward-declaration.
25456 objc-class-declaration:
25457 @class objc-identifier-list ;
25459 The function registers the forward declarations with the Objective-C
25460 front end. It returns nothing. */
25462 static void
25464 {
25467 {
25468 tree id;
25478 else
25480 }
25482 }
25484 /* Parse a list of Objective-C protocol references.
25486 objc-protocol-refs-opt:
25487 objc-protocol-refs [opt]
25489 objc-protocol-refs:
25490 < objc-identifier-list >
25492 Returns a TREE_LIST of identifiers, if any. */
25494 static tree
25496 {
25500 {
25504 }
25507 }
25509 /* Parse a Objective-C visibility specification. */
25511 static void
25513 {
25517 {
25532 }
25534 /* Eat '@private'/'@protected'/'@public'. */
25536 }
25538 /* Parse an Objective-C method type. Return 'true' if it is a class
25539 (+) method, and 'false' if it is an instance (-) method. */
25543 {
25546 else
25548 }
25550 /* Parse an Objective-C protocol qualifier. */
25552 static tree
25554 {
25567 {
25572 }
25575 }
25577 /* Parse an Objective-C typename. */
25579 static tree
25581 {
25585 {
25591 /* An ObjC type name may consist of just protocol qualifiers, in which
25592 case the type shall default to 'id'. */
25594 {
25597 /* If the type could not be parsed, an error has already
25598 been produced. For error recovery, behave as if it had
25599 not been specified, which will use the default type
25600 'id'. */
25602 {
25604 /* We need to skip to the closing parenthesis as
25605 cp_parser_type_id() does not seem to do it for
25606 us. */
25611 }
25612 }
25616 }
25619 }
25621 /* Check to see if TYPE refers to an Objective-C selector name. */
25623 static bool
25625 {
25631 }
25633 /* Parse an Objective-C selector. */
25635 static tree
25637 {
25641 {
25644 }
25646 /* C++ operator names are allowed to appear in ObjC selectors. */
25648 {
25661 }
25662 }
25664 /* Parse an Objective-C params list. */
25666 static tree
25668 {
25674 {
25684 /* Detect if we have a unary selector. */
25687 {
25690 }
25694 {
25695 /* Something went quite wrong. There should be a colon
25696 here, but there is not. Stop parsing parameters. */
25698 }
25700 /* New ObjC allows attributes on parameters too. */
25705 params
25708 type_name,
25709 identifier,
25710 parm_attr));
25713 }
25716 {
25719 }
25721 /* We allow tail attributes for the method. */
25723 {
25731 }
25734 {
25737 }
25739 }
25741 /* Parse the non-keyword Objective-C params. */
25743 static tree
25746 {
25752 {
25754 tree parm;
25760 {
25765 }
25767 /* TODO: parse attributes for tail parameters. */
25776 }
25778 /* We allow tail attributes for the method. */
25780 {
25782 {
25787 }
25788 else
25789 /* We have an error, but parse the attributes, so that we can
25790 carry on. */
25796 }
25799 }
25801 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25803 static void
25805 {
25808 /* If the next token is `extern' and the following token is a string
25809 literal, then we have a linkage specification. */
25811 && cp_parser_is_pure_string_literal
25814 /* Handle #pragma, if any. */
25817 /* Allow stray semicolons. */
25820 /* Mark methods as optional or required, when building protocols. */
25822 {
25825 }
25827 {
25830 }
25833 /* Other stray characters must generate errors. */
25835 {
25839 }
25840 /* Finally, try to parse a block-declaration, or a function-definition. */
25841 else
25843 }
25845 /* Parse a method signature. */
25847 static tree
25849 {
25865 }
25867 static bool
25869 {
25870 tree tattr;
25875 /* If the attributes are followed by a method introducer, this is not allowed.
25876 Dump the attributes and flag the situation. */
25881 /* Otherwise, the attributes introduce some interstitial code, possibly so
25882 rewind to allow that check. */
25885 }
25887 /* Parse an Objective-C method prototype list. */
25889 static void
25891 {
25895 {
25897 {
25902 else
25906 {
25910 }
25913 }
25919 OPT_Wattributes,
25921 else
25922 /* Allow for interspersed non-ObjC++ code. */
25926 }
25930 else
25934 }
25936 /* Parse an Objective-C method definition list. */
25938 static void
25940 {
25944 {
25945 tree meth;
25948 {
25954 else
25959 {
25963 }
25965 NULL_TREE);
25967 /* For historical reasons, we accept an optional semicolon. */
25974 {
25981 }
25982 }
25983 /* The following case will be removed once @synthesize is
25984 completely implemented. */
25995 else
25996 /* Allow for interspersed non-ObjC++ code. */
26000 }
26004 else
26008 }
26010 /* Parse Objective-C ivars. */
26012 static void
26014 {
26025 {
26026 cp_decl_specifier_seq declspecs;
26028 tree prefix_attributes;
26036 CP_PARSER_FLAGS_OPTIONAL,
26040 /* auto, register, static, extern, mutable. */
26042 {
26045 }
26047 /* thread_local. */
26049 {
26052 }
26054 /* typedef. */
26056 {
26059 }
26064 /* Keep going until we hit the `;' at the end of the
26065 declaration. */
26067 {
26072 /* Check for a (possibly unnamed) bitfield declaration. */
26080 {
26081 /* Get the name of the bitfield. */
26084 sfk_none);
26086 eat_colon:
26088 /* Get the width of the bitfield. */
26089 width
26092 NULL);
26093 }
26094 else
26095 {
26096 /* Parse the declarator. */
26097 declarator
26102 }
26104 /* Look for attributes that apply to the ivar. */
26106 /* Remember which attributes are prefix attributes and
26107 which are not. */
26109 /* Combine the attributes. */
26113 /* Create the bitfield declaration. */
26115 width,
26116 attributes);
26117 else
26122 /* Add the instance variable. */
26126 /* Reset PREFIX_ATTRIBUTES. */
26135 {
26138 }
26140 }
26144 }
26149 /* Do not consume the RID_AT_END, so it will be read again as terminating
26150 the @interface of @implementation. */
26154 /* For historical reasons, we accept an optional semicolon. */
26157 }
26159 /* Parse an Objective-C protocol declaration. */
26161 static void
26163 {
26169 {
26174 }
26176 /* See if we have a forward declaration or a definition. */
26179 /* Try a forward declaration first. */
26181 {
26183 {
26184 tree id;
26194 else
26196 }
26198 }
26200 /* Ok, we got a full-fledged definition (or at least should). */
26201 else
26202 {
26207 }
26208 }
26210 /* Parse an Objective-C superclass or category. */
26212 static void
26217 {
26223 {
26226 }
26228 {
26231 /* If there is no category name, and this is an @interface, we
26232 have a class extension. */
26234 {
26237 }
26238 else
26242 }
26243 }
26245 /* Parse an Objective-C class interface. */
26247 static void
26249 {
26256 {
26257 /* It's hard to recover because even if valid @interface stuff
26258 is to follow, we can't compile it (or validate it) if we
26259 don't even know which class it refers to. Let's assume this
26260 was a stray '@interface' token in the stream and skip it.
26261 */
26263 }
26268 /* We have either a class or a category on our hands. */
26271 else
26272 {
26274 /* Handle instance variable declarations, if any. */
26277 }
26280 }
26282 /* Parse an Objective-C class implementation. */
26284 static void
26286 {
26293 {
26294 /* It's hard to recover because even if valid @implementation
26295 stuff is to follow, we can't compile it (or validate it) if
26296 we don't even know which class it refers to. Let's assume
26297 this was a stray '@implementation' token in the stream and
26298 skip it.
26299 */
26301 }
26305 /* We have either a class or a category on our hands. */
26308 else
26309 {
26311 /* Handle instance variable declarations, if any. */
26314 }
26317 }
26319 /* Consume the @end token and finish off the implementation. */
26321 static void
26323 {
26326 }
26328 /* Parse an Objective-C declaration. */
26330 static void
26332 {
26333 /* Try to figure out what kind of declaration is present. */
26338 {
26354 }
26357 {
26380 }
26381 }
26383 /* Parse an Objective-C try-catch-finally statement.
26385 objc-try-catch-finally-stmt:
26386 @try compound-statement objc-catch-clause-seq [opt]
26387 objc-finally-clause [opt]
26389 objc-catch-clause-seq:
26390 objc-catch-clause objc-catch-clause-seq [opt]
26392 objc-catch-clause:
26393 @catch ( objc-exception-declaration ) compound-statement
26395 objc-finally-clause:
26396 @finally compound-statement
26398 objc-exception-declaration:
26399 parameter-declaration
26400 '...'
26402 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26404 Returns NULL_TREE.
26406 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26407 for C. Keep them in sync. */
26409 static tree
26411 {
26412 location_t location;
26413 tree stmt;
26418 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26419 node, lest it get absorbed into the surrounding block. */
26425 {
26434 {
26435 /* We have "@catch (...)" (where the '...' are literally
26436 what is in the code). Skip the '...'.
26437 parameter_declaration is set to NULL_TREE, and
26438 objc_being_catch_clauses() knows that that means
26439 '...'. */
26442 }
26443 else
26444 {
26445 /* We have "@catch (NSException *exception)" or something
26446 like that. Parse the parameter declaration. */
26450 else
26455 }
26458 else
26459 {
26460 /* If there was no open parenthesis, we are recovering from
26461 an error, and we are trying to figure out what mistake
26462 the user has made. */
26464 /* If there is an immediate closing parenthesis, the user
26465 probably forgot the opening one (ie, they typed "@catch
26466 NSException *e)". Parse the closing parenthesis and keep
26467 going. */
26471 /* If these is no immediate closing parenthesis, the user
26472 probably doesn't know that parenthesis are required at
26473 all (ie, they typed "@catch NSException *e"). So, just
26474 forget about the closing parenthesis and keep going. */
26475 }
26479 }
26481 {
26484 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26485 node, lest it get absorbed into the surrounding block. */
26489 }
26492 }
26494 /* Parse an Objective-C synchronized statement.
26496 objc-synchronized-stmt:
26497 @synchronized ( expression ) compound-statement
26499 Returns NULL_TREE. */
26501 static tree
26503 {
26504 location_t location;
26515 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26516 node, lest it get absorbed into the surrounding block. */
26521 }
26523 /* Parse an Objective-C throw statement.
26525 objc-throw-stmt:
26526 @throw assignment-expression [opt] ;
26528 Returns a constructed '@throw' statement. */
26530 static tree
26532 {
26544 }
26546 /* Parse an Objective-C statement. */
26548 static tree
26550 {
26551 /* Try to figure out what kind of declaration is present. */
26555 {
26566 }
26569 }
26571 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26572 look ahead to see if an objc keyword follows the attributes. This
26573 is to detect the use of prefix attributes on ObjC @interface and
26574 @protocol. */
26576 static bool
26578 {
26583 {
26586 }
26589 }
26591 /* This routine is a minimal replacement for
26592 c_parser_struct_declaration () used when parsing the list of
26593 types/names or ObjC++ properties. For example, when parsing the
26594 code
26596 @property (readonly) int a, b, c;
26598 this function is responsible for parsing "int a, int b, int c" and
26599 returning the declarations as CHAIN of DECLs.
26601 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26602 similar parsing. */
26603 static tree
26605 {
26607 cp_decl_specifier_seq declspecs;
26609 tree prefix_attributes;
26612 CP_PARSER_FLAGS_NONE,
26619 /* auto, register, static, extern, mutable. */
26621 {
26624 }
26626 /* thread_local. */
26628 {
26631 }
26633 /* typedef. */
26635 {
26638 }
26643 /* Keep going until we hit the `;' at the end of the declaration. */
26645 {
26650 /* Parse the declarator. */
26654 /* Look for attributes that apply to the ivar. */
26656 /* Remember which attributes are prefix attributes and
26657 which are not. */
26659 /* Combine the attributes. */
26669 /* Reset PREFIX_ATTRIBUTES. */
26680 {
26683 }
26684 else
26686 }
26688 }
26690 /* Parse an Objective-C @property declaration. The syntax is:
26692 objc-property-declaration:
26693 '@property' objc-property-attributes[opt] struct-declaration ;
26695 objc-property-attributes:
26696 '(' objc-property-attribute-list ')'
26698 objc-property-attribute-list:
26699 objc-property-attribute
26700 objc-property-attribute-list, objc-property-attribute
26702 objc-property-attribute
26703 'getter' = identifier
26704 'setter' = identifier
26705 'readonly'
26706 'readwrite'
26707 'assign'
26708 'retain'
26709 'copy'
26710 'nonatomic'
26712 For example:
26713 @property NSString *name;
26714 @property (readonly) id object;
26715 @property (retain, nonatomic, getter=getTheName) id name;
26716 @property int a, b, c;
26718 PS: This function is identical to
26719 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26720 static void
26722 {
26723 /* The following variables hold the attributes of the properties as
26724 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26725 seen. When we see an attribute, we set them to 'true' (if they
26726 are boolean properties) or to the identifier (if they have an
26727 argument, ie, for getter and setter). Note that here we only
26728 parse the list of attributes, check the syntax and accumulate the
26729 attributes that we find. objc_add_property_declaration() will
26730 then process the information. */
26740 /* 'properties' is the list of properties that we read. Usually a
26741 single one, but maybe more (eg, in "@property int a, b, c;" there
26742 are three). */
26743 tree properties;
26744 location_t loc;
26750 /* Parse the optional attribute list... */
26752 {
26753 /* Eat the '('. */
26757 {
26763 {
26766 }
26770 {
26781 {
26785 else
26790 }
26793 {
26797 }
26799 {
26801 {
26804 }
26805 else
26809 else
26811 }
26812 else
26813 {
26815 {
26818 }
26819 else
26821 }
26827 }
26834 else
26836 }
26838 /* FIXME: "@property (setter, assign);" will generate a spurious
26839 "error: expected ‘)’ before ‘,’ token". This is because
26840 cp_parser_require, unlike the C counterpart, will produce an
26841 error even if we are in error recovery. */
26843 {
26848 }
26849 }
26851 /* ... and the property declaration(s). */
26855 {
26857 /* If the next token is now a `;', consume it. */
26861 }
26865 else
26866 {
26867 /* Comma-separated properties are chained together in
26868 reverse order; add them one by one. */
26877 }
26880 }
26882 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26884 objc-synthesize-declaration:
26885 @synthesize objc-synthesize-identifier-list ;
26887 objc-synthesize-identifier-list:
26888 objc-synthesize-identifier
26889 objc-synthesize-identifier-list, objc-synthesize-identifier
26891 objc-synthesize-identifier
26892 identifier
26893 identifier = identifier
26895 For example:
26896 @synthesize MyProperty;
26897 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26899 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26900 for C. Keep them in sync.
26901 */
26902 static void
26904 {
26906 location_t loc;
26911 {
26915 {
26918 }
26920 {
26924 {
26927 }
26928 }
26929 else
26934 else
26936 }
26939 }
26941 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26943 objc-dynamic-declaration:
26944 @dynamic identifier-list ;
26946 For example:
26947 @dynamic MyProperty;
26948 @dynamic MyProperty, AnotherProperty;
26950 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26951 for C. Keep them in sync.
26952 */
26953 static void
26955 {
26957 location_t loc;
26962 {
26963 tree property;
26966 {
26969 }
26973 else
26975 }
26978 }
26980 \f
26981 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26983 /* Returns name of the next clause.
26984 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26985 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26986 returned and the token is consumed. */
26988 static pragma_omp_clause
26990 {
27002 {
27007 {
27110 }
27111 }
27117 }
27119 /* Validate that a clause of the given type does not already exist. */
27121 static void
27124 {
27125 tree c;
27129 {
27132 }
27133 }
27135 /* OpenMP 2.5:
27136 variable-list:
27137 identifier
27138 variable-list , identifier
27140 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27141 colon). An opening parenthesis will have been consumed by the caller.
27143 If KIND is nonzero, create the appropriate node and install the decl
27144 in OMP_CLAUSE_DECL and add the node to the head of the list.
27146 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27147 return the list created.
27149 COLON can be NULL if only closing parenthesis should end the list,
27150 or pointer to bool which will receive false if the list is terminated
27151 by closing parenthesis or true if the list is terminated by colon. */
27153 static tree
27156 {
27160 {
27163 }
27165 {
27182 {
27184 {
27190 {
27197 NULL);
27199 parser->colon_corrects_to_scope_p
27203 else
27204 {
27205 /* Look for `:'. */
27209 CPP_CLOSE_SQUARE))
27212 NULL);
27213 }
27214 /* Look for the closing `]'. */
27216 RT_CLOSE_SQUARE))
27219 }
27223 }
27229 }
27230 else
27233 get_comma:
27237 }
27243 {
27247 }
27250 {
27253 /* Try to resync to an unnested comma. Copied from
27254 cp_parser_parenthesized_expression_list. */
27255 skip_comma:
27264 }
27267 }
27269 /* Similarly, but expect leading and trailing parenthesis. This is a very
27270 common case for omp clauses. */
27272 static tree
27274 {
27278 }
27280 /* OpenMP 3.0:
27281 collapse ( constant-expression ) */
27283 static tree
27285 {
27287 location_t loc;
27288 HOST_WIDE_INT n;
27308 {
27311 }
27319 }
27321 /* OpenMP 2.5:
27322 default ( shared | none ) */
27324 static tree
27326 {
27328 tree c;
27333 {
27338 {
27353 }
27356 }
27357 else
27358 {
27359 invalid_kind:
27361 }
27377 }
27379 /* OpenMP 3.1:
27380 final ( expression ) */
27382 static tree
27384 {
27405 }
27407 /* OpenMP 2.5:
27408 if ( expression ) */
27410 static tree
27412 {
27433 }
27435 /* OpenMP 3.1:
27436 mergeable */
27438 static tree
27441 {
27442 tree c;
27445 location);
27450 }
27452 /* OpenMP 2.5:
27453 nowait */
27455 static tree
27458 {
27459 tree c;
27466 }
27468 /* OpenMP 2.5:
27469 num_threads ( expression ) */
27471 static tree
27473 location_t location)
27474 {
27496 }
27498 /* OpenMP 2.5:
27499 ordered */
27501 static tree
27504 {
27505 tree c;
27513 }
27515 /* OpenMP 2.5:
27516 reduction ( reduction-operator : variable-list )
27518 reduction-operator:
27519 One of: + * - & ^ | && ||
27521 OpenMP 3.1:
27523 reduction-operator:
27524 One of: + * - & ^ | && || min max
27526 OpenMP 4.0:
27528 reduction-operator:
27529 One of: + * - & ^ | && ||
27530 id-expression */
27532 static tree
27534 {
27542 {
27552 }
27556 else
27557 {
27568 {
27598 }
27599 else
27600 {
27602 resync_fail:
27607 }
27608 }
27614 NULL);
27616 {
27619 }
27622 }
27624 /* OpenMP 2.5:
27625 schedule ( schedule-kind )
27626 schedule ( schedule-kind , expression )
27628 schedule-kind:
27629 static | dynamic | guided | runtime | auto */
27631 static tree
27633 {
27642 {
27647 {
27668 }
27669 }
27674 else
27679 {
27694 else
27699 }
27707 invalid_kind:
27709 resync_fail:
27714 }
27716 /* OpenMP 3.0:
27717 untied */
27719 static tree
27722 {
27723 tree c;
27730 }
27732 /* OpenMP 4.0:
27733 inbranch
27734 notinbranch */
27736 static tree
27739 {
27744 }
27746 /* OpenMP 4.0:
27747 parallel
27748 for
27749 sections
27750 taskgroup */
27752 static tree
27756 {
27760 }
27762 /* OpenMP 4.0:
27763 num_teams ( expression ) */
27765 static tree
27767 location_t location)
27768 {
27790 }
27792 /* OpenMP 4.0:
27793 thread_limit ( expression ) */
27795 static tree
27797 location_t location)
27798 {
27820 }
27822 /* OpenMP 4.0:
27823 aligned ( variable-list )
27824 aligned ( variable-list : constant-expression ) */
27826 static tree
27828 {
27839 {
27849 }
27855 }
27857 /* OpenMP 4.0:
27858 linear ( variable-list )
27859 linear ( variable-list : expression ) */
27861 static tree
27864 {
27875 {
27879 {
27882 }
27890 }
27896 }
27898 /* OpenMP 4.0:
27899 safelen ( constant-expression ) */
27901 static tree
27903 location_t location)
27904 {
27925 }
27927 /* OpenMP 4.0:
27928 simdlen ( constant-expression ) */
27930 static tree
27932 location_t location)
27933 {
27954 }
27956 /* OpenMP 4.0:
27957 depend ( depend-kind : variable-list )
27959 depend-kind:
27960 in | out | inout */
27962 static tree
27964 {
27972 {
27982 else
27984 }
27985 else
27993 NULL);
28000 invalid_kind:
28002 resync_fail:
28007 }
28009 /* OpenMP 4.0:
28010 map ( map-kind : variable-list )
28011 map ( variable-list )
28013 map-kind:
28014 alloc | to | from | tofrom */
28016 static tree
28018 {
28027 {
28039 else
28040 {
28046 }
28049 }
28052 NULL);
28058 }
28060 /* OpenMP 4.0:
28061 device ( expression ) */
28063 static tree
28065 location_t location)
28066 {
28088 }
28090 /* OpenMP 4.0:
28091 dist_schedule ( static )
28092 dist_schedule ( static , expression ) */
28094 static tree
28096 location_t location)
28097 {
28110 {
28121 }
28126 location);
28130 invalid_kind:
28132 resync_fail:
28137 }
28139 /* OpenMP 4.0:
28140 proc_bind ( proc-bind-kind )
28142 proc-bind-kind:
28143 master | close | spread */
28145 static tree
28147 location_t location)
28148 {
28149 tree c;
28156 {
28166 else
28168 }
28169 else
28178 location);
28183 invalid_kind:
28185 resync_fail:
28190 }
28192 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28193 is a bitmask in MASK. Return the list of clauses found; the result
28194 of clause default goes in *pdefault. */
28196 static tree
28200 {
28207 {
28208 pragma_omp_clause c_kind;
28219 {
28231 clauses);
28245 clauses);
28254 clauses);
28278 clauses);
28292 clauses);
28309 OMP_CLAUSE_NOTINBRANCH,
28318 {
28319 clause_not_first:
28323 }
28348 clauses);
28353 clauses);
28358 clauses);
28421 }
28426 {
28427 /* Remove the invalid clause(s) from the list to avoid
28428 confusing the rest of the compiler. */
28431 }
28432 }
28433 saw_error:
28434 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28435 no reason to skip to the end. */
28441 }
28443 /* OpenMP 2.5:
28444 structured-block:
28445 statement
28447 In practice, we're also interested in adding the statement to an
28448 outer node. So it is convenient if we work around the fact that
28449 cp_parser_statement calls add_stmt. */
28451 static unsigned
28453 {
28456 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28457 This preserves the "not within loop or switch" style error messages
28458 for nonsense cases like
28459 void foo() {
28460 #pragma omp single
28461 break;
28462 }
28463 */
28468 }
28470 static void
28472 {
28474 }
28476 static tree
28478 {
28486 }
28488 /* OpenMP 2.5:
28489 # pragma omp atomic new-line
28490 expression-stmt
28492 expression-stmt:
28493 x binop= expr | x++ | ++x | x-- | --x
28494 binop:
28495 +, *, -, /, &, ^, |, <<, >>
28497 where x is an lvalue expression with scalar type.
28499 OpenMP 3.1:
28500 # pragma omp atomic new-line
28501 update-stmt
28503 # pragma omp atomic read new-line
28504 read-stmt
28506 # pragma omp atomic write new-line
28507 write-stmt
28509 # pragma omp atomic update new-line
28510 update-stmt
28512 # pragma omp atomic capture new-line
28513 capture-stmt
28515 # pragma omp atomic capture new-line
28516 capture-block
28518 read-stmt:
28519 v = x
28520 write-stmt:
28521 x = expr
28522 update-stmt:
28523 expression-stmt | x = x binop expr
28524 capture-stmt:
28525 v = expression-stmt
28526 capture-block:
28527 { v = x; update-stmt; } | { update-stmt; v = x; }
28529 OpenMP 4.0:
28530 update-stmt:
28531 expression-stmt | x = x binop expr | x = expr binop x
28532 capture-stmt:
28533 v = update-stmt
28534 capture-block:
28535 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28537 where x and v are lvalue expressions with scalar type. */
28539 static void
28541 {
28549 {
28561 else
28565 }
28568 {
28573 {
28576 }
28577 }
28581 {
28592 else
28598 {
28599 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28600 opcode. */
28605 }
28609 {
28612 }
28613 else
28614 {
28621 }
28624 }
28626 restart:
28631 {
28638 /* FALLTHROUGH */
28648 /* FALLTHROUGH */
28663 /* Undo effects of boolean_increment for post {in,de}crement. */
28665 /* FALLTHRU */
28669 {
28670 /* Undo effects of boolean_increment. */
28672 {
28673 /* This is pre or post increment. */
28678 && !structured_block
28682 }
28683 }
28684 /* FALLTHRU */
28687 {
28722 {
28726 }
28729 {
28735 {
28740 }
28742 {
28753 {
28755 {
28760 }
28761 else
28763 }
28767 }
28770 {
28777 }
28781 }
28785 {
28788 {
28796 }
28798 {
28803 }
28838 }
28849 /* FALLTHROUGH */
28854 }
28861 }
28862 stmt_done:
28864 {
28877 }
28879 {
28882 }
28883 done:
28889 saw_error:
28892 {
28896 {
28900 }
28901 }
28902 }
28905 /* OpenMP 2.5:
28906 # pragma omp barrier new-line */
28908 static void
28910 {
28913 }
28915 /* OpenMP 2.5:
28916 # pragma omp critical [(name)] new-line
28917 structured-block */
28919 static tree
28921 {
28925 {
28937 }
28942 }
28944 /* OpenMP 2.5:
28945 # pragma omp flush flush-vars[opt] new-line
28947 flush-vars:
28948 ( variable-list ) */
28950 static void
28952 {
28958 }
28960 /* Helper function, to parse omp for increment expression. */
28962 static tree
28964 {
28969 {
28972 }
28975 {
28984 /* Fall through: OpenMP disallows NE_EXPR. */
28987 }
28989 /* If decl is an iterator, preserve LHS and RHS of the relational
28990 expr until finish_omp_for. */
29000 }
29002 /* Helper function, to parse omp for increment expression. */
29004 static tree
29006 {
29010 cp_id_kind idk;
29014 {
29022 }
29030 {
29035 }
29042 {
29046 }
29058 do
29059 {
29066 {
29068 {
29071 else
29073 tf_warning_or_error);
29074 }
29075 else
29078 }
29079 }
29083 {
29087 }
29088 else
29092 }
29094 /* Parse the initialization statement of either an OpenMP for loop or
29095 a Cilk Plus for loop.
29097 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29098 Plus.
29100 Return true if the resulting construct should have an
29101 OMP_CLAUSE_PRIVATE added to it. */
29103 static bool
29111 {
29117 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29119 init-expr:
29120 var = lb
29121 integer-type var = lb
29122 random-access-iterator-type var = lb
29123 pointer-type var = lb
29124 */
29125 cp_decl_specifier_seq type_specifiers;
29127 /* First, try to parse as an initialized declaration. See
29128 cp_parser_condition, from whence the bulk of this is copied. */
29135 {
29136 /* If parsing a type specifier seq succeeded, then this
29137 MUST be a initialized declaration. */
29142 CP_PARSER_DECLARATOR_NAMED,
29152 else
29153 {
29163 {
29165 CPP_OPEN_PAREN))
29166 {
29170 else
29173 }
29174 else
29175 /* Trigger an error. */
29180 }
29184 {
29192 {
29195 auto_node);
29200 }
29203 asm_specification,
29204 LOOKUP_ONLYCONVERTING);
29206 {
29209 }
29210 else
29213 }
29214 else
29215 {
29216 /* Consume '='. */
29220 non_class:
29223 else
29226 asm_specification,
29227 LOOKUP_ONLYCONVERTING);
29228 }
29232 }
29233 }
29234 else
29235 {
29236 cp_id_kind idk;
29237 /* If parsing a type specifier sequence failed, then
29238 this MUST be a simple expression. */
29243 && decl
29246 {
29247 tree rhs;
29254 rhs,
29255 tf_warning_or_error));
29257 }
29258 else
29259 {
29264 {
29268 }
29269 }
29270 }
29272 }
29274 /* Parse the restricted form of the for statement allowed by OpenMP. */
29276 static tree
29279 {
29283 location_t loc_first;
29302 {
29305 location_t loc;
29308 {
29311 }
29320 add_private_clause
29328 {
29331 {
29337 }
29338 else
29340 }
29347 {
29352 {
29356 }
29359 {
29360 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29361 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29370 }
29371 else
29372 {
29377 }
29378 }
29381 {
29382 tree c;
29384 {
29393 decl);
29397 decl);
29398 }
29400 {
29405 {
29408 }
29409 }
29410 }
29419 {
29420 /* If decl is an iterator, preserve the operator on decl
29421 until finish_omp_for. */
29423 && ((processing_template_decl
29427 else
29431 }
29446 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29447 in between the collapsed for loops to be still considered perfectly
29448 nested. Hopefully the final version clarifies this.
29449 For now handle (multiple) {'s and empty statements. */
29451 do
29452 {
29456 {
29458 bracecount++;
29459 }
29463 else
29464 {
29471 }
29472 }
29476 {
29479 }
29480 }
29482 /* Note that we saved the original contents of this flag when we entered
29483 the structured block, and so we don't need to re-save it here. */
29486 else
29489 /* Note that the grammar doesn't call for a structured block here,
29490 though the loop as a whole is a structured block. */
29497 else
29502 {
29504 {
29506 nbraces--;
29507 }
29510 else
29511 {
29513 {
29516 }
29521 }
29522 }
29529 }
29531 /* Helper function for OpenMP parsing, split clauses and call
29532 finish_omp_clauses on each of the set of clauses afterwards. */
29534 static void
29537 {
29543 }
29545 /* OpenMP 4.0:
29546 #pragma omp simd simd-clause[optseq] new-line
29547 for-loop */
29549 #define OMP_SIMD_CLAUSE_MASK \
29550 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29558 static tree
29561 {
29573 {
29576 }
29587 }
29589 /* OpenMP 2.5:
29590 #pragma omp for for-clause[optseq] new-line
29591 for-loop
29593 OpenMP 4.0:
29594 #pragma omp for simd for-simd-clause[optseq] new-line
29595 for-loop */
29597 #define OMP_FOR_CLAUSE_MASK \
29598 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29600 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29601 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29607 static tree
29610 {
29621 {
29626 {
29634 cclauses);
29638 cclauses);
29650 }
29651 }
29653 {
29656 }
29661 {
29664 }
29675 }
29677 /* OpenMP 2.5:
29678 # pragma omp master new-line
29679 structured-block */
29681 static tree
29683 {
29687 }
29689 /* OpenMP 2.5:
29690 # pragma omp ordered new-line
29691 structured-block */
29693 static tree
29695 {
29699 }
29701 /* OpenMP 2.5:
29703 section-scope:
29704 { section-sequence }
29706 section-sequence:
29707 section-directive[opt] structured-block
29708 section-sequence section-directive structured-block */
29710 static tree
29712 {
29723 {
29727 }
29730 {
29738 {
29742 }
29744 {
29747 }
29752 }
29763 }
29765 /* OpenMP 2.5:
29766 # pragma omp sections sections-clause[optseq] newline
29767 sections-scope */
29769 #define OMP_SECTIONS_CLAUSE_MASK \
29770 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29776 static tree
29779 {
29791 {
29794 }
29801 }
29803 /* OpenMP 2.5:
29804 # pragma omp parallel parallel-clause[optseq] new-line
29805 structured-block
29806 # pragma omp parallel for parallel-for-clause[optseq] new-line
29807 structured-block
29808 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
29809 structured-block
29811 OpenMP 4.0:
29812 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
29813 structured-block */
29815 #define OMP_PARALLEL_CLAUSE_MASK \
29816 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29826 static tree
29829 {
29838 {
29851 block);
29854 }
29856 {
29860 }
29862 {
29865 }
29867 {
29871 {
29881 block);
29884 }
29885 }
29895 }
29897 /* OpenMP 2.5:
29898 # pragma omp single single-clause[optseq] new-line
29899 structured-block */
29901 #define OMP_SINGLE_CLAUSE_MASK \
29902 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29904 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29905 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29907 static tree
29909 {
29919 }
29921 /* OpenMP 3.0:
29922 # pragma omp task task-clause[optseq] new-line
29923 structured-block */
29925 #define OMP_TASK_CLAUSE_MASK \
29926 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29936 static tree
29938 {
29949 }
29951 /* OpenMP 3.0:
29952 # pragma omp taskwait new-line */
29954 static void
29956 {
29959 }
29961 /* OpenMP 3.1:
29962 # pragma omp taskyield new-line */
29964 static void
29966 {
29969 }
29971 /* OpenMP 4.0:
29972 # pragma omp taskgroup new-line
29973 structured-block */
29975 static tree
29977 {
29981 }
29984 /* OpenMP 2.5:
29985 # pragma omp threadprivate (variable-list) */
29987 static void
29989 {
29990 tree vars;
29996 }
29998 /* OpenMP 4.0:
29999 # pragma omp cancel cancel-clause[optseq] new-line */
30001 #define OMP_CANCEL_CLAUSE_MASK \
30002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30008 static void
30010 {
30014 }
30016 /* OpenMP 4.0:
30017 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30019 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30020 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30025 static void
30027 {
30028 tree clauses;
30032 {
30037 {
30040 }
30041 }
30043 {
30047 }
30050 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30052 pragma_tok);
30054 }
30056 /* OpenMP 4.0:
30057 #pragma omp distribute distribute-clause[optseq] new-line
30058 for-loop */
30060 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30061 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30066 static tree
30069 {
30078 {
30086 else
30089 {
30095 {
30098 cclauses);
30099 else
30101 cclauses);
30102 }
30107 cclauses);
30108 else
30110 cclauses);
30122 }
30123 }
30125 {
30128 }
30133 {
30136 }
30147 }
30149 /* OpenMP 4.0:
30150 # pragma omp teams teams-clause[optseq] new-line
30151 structured-block */
30153 #define OMP_TEAMS_CLAUSE_MASK \
30154 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30162 static tree
30165 {
30174 {
30178 {
30186 cclauses);
30190 cclauses);
30201 }
30202 }
30204 {
30207 }
30212 {
30215 }
30223 }
30225 /* OpenMP 4.0:
30226 # pragma omp target data target-data-clause[optseq] new-line
30227 structured-block */
30229 #define OMP_TARGET_DATA_CLAUSE_MASK \
30230 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30234 static tree
30236 {
30248 }
30250 /* OpenMP 4.0:
30251 # pragma omp target update target-update-clause[optseq] new-line */
30253 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30259 static bool
30262 {
30264 {
30266 "%<#pragma omp target update%> may only be "
30270 }
30272 tree clauses
30277 {
30279 "%<#pragma omp target update must contain at least one "
30282 }
30290 }
30292 /* OpenMP 4.0:
30293 # pragma omp target target-clause[optseq] new-line
30294 structured-block */
30296 #define OMP_TARGET_CLAUSE_MASK \
30297 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30301 static bool
30304 {
30306 {
30310 }
30313 {
30318 {
30343 }
30345 {
30348 }
30350 {
30354 }
30356 {
30359 }
30360 }
30374 }
30376 /* OpenMP 4.0:
30377 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30379 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30380 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30387 static void
30390 {
30392 cp_omp_declare_simd_data data;
30394 {
30399 }
30410 {
30414 {
30427 }
30432 "%<#pragma omp declare simd%> not immediately followed by "
30436 }
30437 }
30439 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30440 This function is modelled similar to the late parsing of omp declare
30441 simd. */
30443 static tree
30445 {
30451 {
30457 }
30459 {
30463 }
30468 {
30475 NULL);
30489 }
30494 }
30496 /* Finalize #pragma omp declare simd clauses after direct declarator has
30497 been parsed, and put that into "omp declare simd" attribute. */
30499 static tree
30501 {
30507 {
30512 }
30517 {
30535 }
30539 }
30542 /* OpenMP 4.0:
30543 # pragma omp declare target new-line
30544 declarations and definitions
30545 # pragma omp end declare target new-line */
30547 static void
30549 {
30552 }
30554 static void
30556 {
30559 {
30562 }
30564 {
30568 {
30571 }
30574 else
30575 {
30579 }
30580 }
30581 else
30582 {
30586 }
30590 "%<#pragma omp end declare target%> without corresponding "
30592 else
30594 }
30596 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30597 expression and optional initializer clause of
30598 #pragma omp declare reduction. We store the expression(s) as
30599 either 3, 6 or 7 special statements inside of the artificial function's
30600 body. The first two statements are DECL_EXPRs for the artificial
30601 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30602 expression that uses those variables.
30603 If there was any INITIALIZER clause, this is followed by further statements,
30604 the fourth and fifth statements are DECL_EXPRs for the artificial
30605 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30606 constructor variant (first token after open paren is not omp_priv),
30607 then the sixth statement is a statement with the function call expression
30608 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30609 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30610 to initialize the OMP_PRIV artificial variable and there is seventh
30611 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30613 static bool
30615 {
30627 tree combiner;
30642 {
30645 }
30648 {
30655 {
30658 }
30674 {
30678 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30682 == CPP_CLOSE_PAREN
30685 {
30689 }
30694 }
30695 else
30696 {
30712 {
30717 }
30719 tree arg;
30732 }
30743 }
30749 }
30751 /* OpenMP 4.0
30752 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30753 initializer-clause[opt] new-line
30755 initializer-clause:
30756 initializer (omp_priv initializer)
30757 initializer (function-name (argument-list)) */
30759 static void
30762 {
30772 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
30779 {
30811 }
30823 /* Types may not be defined in declare reduction type list. */
30826 parser->type_definition_forbidden_message
30832 saved_colon_doesnt_start_class_def_p
30837 {
30841 ;
30862 else
30867 else
30869 }
30871 /* Restore the saved message. */
30874 parser->colon_doesnt_start_class_def_p
30879 {
30880 fail:
30883 }
30889 {
30890 tree fntype
30893 NULL_TREE);
30912 {
30917 }
30919 {
30921 {
30930 }
30937 }
30938 else
30939 {
30942 }
30945 else
30948 {
30951 }
30953 {
30956 else
30961 }
30966 else
30967 {
30976 }
30983 }
30987 done:
30988 /* Free any declarators allocated. */
30990 }
30992 /* OpenMP 4.0
30993 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30994 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30995 initializer-clause[opt] new-line
30996 #pragma omp declare target new-line */
30998 static void
31001 {
31003 {
31008 {
31011 context);
31013 }
31016 {
31019 context);
31021 }
31023 {
31026 }
31028 {
31032 }
31033 }
31037 }
31039 /* Main entry point to OpenMP statement pragmas. */
31041 static void
31043 {
31044 tree stmt;
31049 {
31097 }
31101 }
31102 \f
31103 /* Transactional Memory parsing routines. */
31105 /* Parse a transaction attribute.
31107 txn-attribute:
31108 attribute
31109 [ [ identifier ] ]
31111 ??? Simplify this when C++0x bracket attributes are
31112 implemented properly. */
31114 static tree
31116 {
31131 {
31135 /* For keywords, use the canonical spelling,
31136 not the parsed identifier. */
31140 }
31141 else
31145 error1:
31148 }
31150 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31152 transaction-statement:
31153 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31154 compound-statement
31155 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31156 */
31158 static tree
31160 {
31175 else
31176 {
31180 }
31182 /* Parse a noexcept specification. */
31185 /* Keep track if we're in the lexical scope of an outer transaction. */
31197 }
31199 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31201 transaction-expression:
31202 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31203 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31204 */
31206 static tree
31208 {
31233 /* Set this early. This might mean that we allow transaction_cancel in
31234 an expression that we find out later actually has to be a constexpr.
31235 However, we expect that cxx_constant_value will be able to deal with
31236 this; also, if the noexcept has no constexpr, then what we parse next
31237 really is a transaction's body. */
31240 /* Parse a noexcept specification. */
31246 {
31253 }
31254 else
31255 {
31256 /* The only expression that is available got parsed for the noexcept
31257 already. noexcept is true then. */
31260 }
31269 }
31271 /* Parse a function-transaction-block.
31273 function-transaction-block:
31274 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31275 function-body
31276 __transaction_atomic txn-attribute[opt] function-try-block
31277 __transaction_relaxed ctor-initializer[opt] function-body
31278 __transaction_relaxed function-try-block
31279 */
31281 static bool
31283 {
31299 else
31300 {
31304 }
31312 else
31313 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31321 }
31323 /* Parse a __transaction_cancel statement.
31325 cancel-statement:
31326 __transaction_cancel txn-attribute[opt] ;
31327 __transaction_cancel txn-attribute[opt] throw-expression ;
31329 ??? Cancel and throw is not yet implemented. */
31331 static tree
31333 {
31339 RT_TRANSACTION_CANCEL);
31346 /* ??? Parse cancel-and-throw here. */
31351 {
31355 }
31357 {
31361 }
31363 {
31366 {
31372 }
31373 }
31375 {
31379 }
31385 }
31386 \f
31387 /* The parser. */
31391 \f
31392 /* Special handling for the first token or line in the file. The first
31393 thing in the file might be #pragma GCC pch_preprocess, which loads a
31394 PCH file, which is a GC collection point. So we need to handle this
31395 first pragma without benefit of an existing lexer structure.
31397 Always returns one token to the caller in *FIRST_TOKEN. This is
31398 either the true first token of the file, or the first token after
31399 the initial pragma. */
31401 static void
31403 {
31412 {
31419 }
31420 else
31423 /* Skip to the end of the pragma. */
31427 /* Now actually load the PCH file. */
31431 /* Read one more token to return to our caller. We have to do this
31432 after reading the PCH file in, since its pointers have to be
31433 live. */
31435 }
31437 /* Normal parsing of a pragma token. Here we can (and must) use the
31438 regular lexer. */
31440 static bool
31442 {
31454 {
31462 {
31472 }
31477 {
31487 }
31492 {
31498 "%<#pragma omp taskwait%> may only be "
31503 }
31508 {
31514 "%<#pragma omp taskyield%> may only be "
31519 }
31524 {
31530 "%<#pragma omp cancel%> may only be "
31535 }
31540 {
31546 "%<#pragma omp cancellation point%> may only be "
31551 }
31589 "%<#pragma omp section%> may only be used in "
31594 {
31601 {
31604 }
31607 }
31611 {
31615 }
31624 bad_stmt:
31627 }
31631 }
31633 /* The interface the pragma parsers have to the lexer. */
31635 enum cpp_ttype
31637 {
31650 else
31651 {
31655 }
31658 }
31660 \f
31661 /* External interface. */
31663 /* Parse one entire translation unit. */
31665 void
31667 {
31674 }
31676 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31677 vectorlength clause:
31678 Syntax:
31679 vectorlength ( constant-expression ) */
31681 static tree
31684 {
31686 tree expr;
31687 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31688 safelen clause. Thus, vectorlength is represented as OMP 4.0
31689 safelen. For SIMD-enabled function it is represented by OMP 4.0
31690 simdlen. */
31693 loc);
31694 else
31696 loc);
31704 /* If expr == error_mark_node, then don't emit any errors nor
31705 create a clause. if any of the above functions returns
31706 error mark node then they would have emitted an error message. */
31708 ;
31716 else
31717 {
31718 tree c;
31720 {
31725 }
31726 else
31727 {
31732 }
31733 }
31738 }
31740 /* Handles the Cilk Plus #pragma simd linear clause.
31741 Syntax:
31742 linear ( simd-linear-variable-list )
31744 simd-linear-variable-list:
31745 simd-linear-variable
31746 simd-linear-variable-list , simd-linear-variable
31748 simd-linear-variable:
31749 id-expression
31750 id-expression : simd-linear-step
31752 simd-linear-step:
31753 conditional-expression */
31755 static tree
31757 {
31763 {
31767 }
31772 {
31775 {
31779 }
31786 {
31790 }
31791 else
31792 {
31796 /* If present, parse the linear step. Otherwise, assume the default
31797 value of 1. */
31799 {
31806 {
31807 /* If an error has occurred, then the whole pragma is
31808 considered ill-formed. Thus, no reason to keep
31809 parsing. */
31812 }
31820 else
31822 "step size must be an integer constant "
31824 }
31826 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
31832 }
31837 else
31838 {
31843 }
31844 }
31848 }
31850 /* Returns the name of the next clause. If the clause is not
31851 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
31852 token is not consumed. Otherwise, the appropriate enum from the
31853 pragma_simd_clause is returned and the token is consumed. */
31855 static pragma_omp_clause
31857 {
31858 pragma_omp_clause clause_type;
31875 else
31880 }
31882 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
31884 static tree
31886 {
31891 {
31892 pragma_omp_clause c_kind;
31899 /* Use the OpenMP 4.0 equivalent function. */
31902 /* Use the OpenMP 4.0 equivalent function. */
31904 clauses);
31906 /* Use the OMP 4.0 equivalent function. */
31908 clauses);
31910 /* Use the OMP 4.0 equivalent function. */
31912 else
31913 {
31917 }
31918 }
31924 else
31926 }
31928 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
31930 static void
31932 {
31939 {
31943 }
31953 }
31955 /* Create an identifier for a generic parameter type (a synthesized
31956 template parameter implied by `auto' or a concept identifier). */
31959 static tree
31961 {
31965 }
31967 /* Predicate that behaves as is_auto_or_concept but matches the parent
31968 node of the generic type rather than the generic type itself. This
31969 allows for type transformation in add_implicit_template_parms. */
31973 {
31975 }
31977 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
31978 (creating a new template parameter list if necessary). Returns the newly
31979 created template type parm. */
31981 tree
31983 {
31986 /* We are either continuing a function template that already contains implicit
31987 template parameters, creating a new fully-implicit function template, or
31988 extending an existing explicit function template with implicit template
31989 parameters. */
31997 {
32001 }
32002 else
32003 {
32004 /* Roll back to the existing template parameter scope (in the case of
32005 extending an explicit function template) or introduce a new template
32006 parameter scope ahead of the function parameter scope (or class scope
32007 in the case of out-of-line member definitions). The function scope is
32008 added back after template parameter synthesis below. */
32013 {
32016 }
32018 {
32019 /* If not defining a class, then any class scope is a scope level in
32020 an out-of-line member definition. In this case simply wind back
32021 beyond the first such scope to inject the template parameter list.
32022 Otherwise wind back to the class being defined. The latter can
32023 occur in class member friend declarations such as:
32025 class A {
32026 void foo (auto);
32027 };
32028 class B {
32029 friend void A::foo (auto);
32030 };
32032 The template parameter list synthesized for the friend declaration
32033 must be injected in the scope of 'B'. This can also occur in
32034 erroneous cases such as:
32036 struct A {
32037 struct B {
32038 void foo (auto);
32039 };
32040 void B::foo (auto) {}
32041 };
32043 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32044 but, nevertheless, the template parameter list synthesized for the
32045 declarator should be injected into the scope of 'A' as if the
32046 ill-formed template was specified explicitly. */
32049 {
32052 }
32053 }
32059 {
32060 /* Introduce a new template parameter list for implicit template
32061 parameters. */
32065 parser->implicit_template_scope
32072 }
32073 else
32074 {
32075 /* Synthesize implicit template parameters at the end of the explicit
32076 template parameter list. */
32083 parser->implicit_template_parms
32085 }
32086 }
32088 /* Synthesize a new template parameter and track the current template
32089 parameter chain with implicit_template_parms. */
32093 synth_id);
32094 tree new_parm
32096 input_location,
32103 parser->implicit_template_parms
32105 else
32110 /* If creating a fully implicit function template, start the new implicit
32111 template parameter list with this synthesized type, otherwise grow the
32112 current template parameter list. */
32115 {
32122 }
32123 else
32124 {
32129 }
32134 }
32136 /* Finish the declaration of a fully implicit function template. Such a
32137 template has no explicit template parameter list so has not been through the
32138 normal template head and tail processing. synthesize_implicit_template_parm
32139 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32140 provided if the declaration is a class member such that its template
32141 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32142 form is returned. Otherwise NULL_TREE is returned. */
32144 tree
32146 {
32151 {
32155 }
32165 }