| blob | bb59e3bcdd19b3d99c06665b85d1ba445434b112 |
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
767 /* On some systems, some header files are surrounded by an
768 implicit extern "C" block. Set a flag in the token if it
769 comes from such a header. */
774 /* Check to see if this token is a keyword. */
776 {
778 {
779 /* Mark this token as a keyword. */
781 /* Record which keyword. */
783 }
784 else
785 {
789 {
790 /* Warn about the C++0x keyword (but still treat it as
791 an identifier). */
796 /* Clear out the C_RID_CODE so we don't warn about this
797 particular identifier-turned-keyword again. */
799 }
802 }
803 }
805 {
806 /* This only happens in Objective-C++; it must be a keyword. */
809 {
810 /* Replace 'class' with '@class', 'private' with '@private',
811 etc. This prevents confusion with the C++ keyword
812 'class', and makes the tokens consistent with other
813 Objective-C 'AT' keywords. For example '@class' is
814 reported as RID_AT_CLASS which is consistent with
815 '@synchronized', which is reported as
816 RID_AT_SYNCHRONIZED.
817 */
826 }
827 }
829 {
830 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
834 }
835 }
837 /* Update the globals input_location and the input file stack from TOKEN. */
840 {
842 {
844 }
845 }
847 /* Update the globals input_location and the input file stack from LEXER. */
850 {
853 }
855 /* Return a pointer to the next token in the token stream, but do not
856 consume it. */
860 {
862 {
866 }
868 }
870 /* Return true if the next token has the indicated TYPE. */
874 {
876 }
878 /* Return true if the next token does not have the indicated TYPE. */
882 {
884 }
886 /* Return true if the next token is the indicated KEYWORD. */
890 {
892 }
896 {
898 }
900 /* Return true if the next token is not the indicated KEYWORD. */
904 {
906 }
908 /* Return true if the next token is a keyword for a decl-specifier. */
910 static bool
912 {
917 {
918 /* auto specifier: storage-class-specifier in C++,
919 simple-type-specifier in C++0x. */
921 /* Storage classes. */
927 /* Elaborated type specifiers. */
933 /* Simple type specifiers. */
948 /* GNU extensions. */
951 /* C++0x extensions. */
958 }
959 }
961 /* Returns TRUE iff the token T begins a decltype type. */
963 static bool
965 {
968 }
970 /* Returns TRUE iff the next token begins a decltype type. */
972 static bool
974 {
977 }
979 /* Return a pointer to the Nth token in the token stream. If N is 1,
980 then this is precisely equivalent to cp_lexer_peek_token (except
981 that it is not inline). One would like to disallow that case, but
982 there is one case (cp_parser_nth_token_starts_template_id) where
983 the caller passes a variable for N and it might be 1. */
987 {
990 /* N is 1-based, not zero-based. */
1001 {
1004 {
1007 }
1011 }
1014 {
1017 }
1020 }
1022 /* Return the next token, and advance the lexer's next_token pointer
1023 to point to the next non-purged token. */
1027 {
1033 do
1034 {
1037 {
1040 }
1042 }
1047 /* Provide debugging output. */
1049 {
1053 }
1056 }
1058 /* Permanently remove the next token from the token stream, and
1059 advance the next_token pointer to refer to the next non-purged
1060 token. */
1062 static void
1064 {
1073 do
1074 {
1075 tok++;
1077 {
1080 }
1081 }
1084 }
1086 /* Permanently remove all tokens after TOK, up to, but not
1087 including, the token that will be returned next by
1088 cp_lexer_peek_token. */
1090 static void
1092 {
1101 {
1106 }
1107 }
1109 /* Begin saving tokens. All tokens consumed after this point will be
1110 preserved. */
1112 static void
1114 {
1115 /* Provide debugging output. */
1120 }
1122 /* Commit to the portion of the token stream most recently saved. */
1124 static void
1126 {
1127 /* Provide debugging output. */
1132 }
1134 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1135 to the token stream. Stop saving tokens. */
1137 static void
1139 {
1140 /* Provide debugging output. */
1145 }
1147 /* Print a representation of the TOKEN on the STREAM. */
1149 static void
1151 {
1152 /* We don't use cpp_type2name here because the parser defines
1153 a few tokens of its own. */
1155 /* cpplib-defined token types */
1156 #define OP(e, s) #e,
1157 #define TK(e, s) #e,
1158 TTYPE_TABLE
1159 #undef OP
1160 #undef TK
1161 /* C++ parser token types - see "Manifest constants", above. */
1165 };
1167 /* For some tokens, print the associated data. */
1169 {
1171 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1172 For example, `struct' is mapped to an INTEGER_CST. */
1175 /* else fall through */
1193 /* If we have a name for the token, print it out. Otherwise, we
1194 simply give the numeric code. */
1197 else
1200 }
1201 }
1203 DEBUG_FUNCTION void
1205 {
1208 }
1210 DEBUG_FUNCTION void
1212 {
1215 else
1217 }
1220 /* Start emitting debugging information. */
1222 static void
1224 {
1227 }
1229 /* Stop emitting debugging information. */
1231 static void
1233 {
1236 }
1238 /* Create a new cp_token_cache, representing a range of tokens. */
1242 {
1247 }
1249 /* Diagnose if #pragma omp declare simd isn't followed immediately
1250 by function declaration or definition. */
1254 {
1256 {
1260 }
1261 }
1263 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1264 and put that into "omp declare simd" attribute. */
1268 {
1270 {
1272 {
1275 }
1277 {
1280 }
1281 }
1282 }
1283 \f
1284 /* Decl-specifiers. */
1286 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1288 static void
1290 {
1292 }
1294 /* Declarators. */
1296 /* Nothing other than the parser should be creating declarators;
1297 declarators are a semi-syntactic representation of C++ entities.
1298 Other parts of the front end that need to create entities (like
1299 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1314 /* An erroneous declarator. */
1317 /* The obstack on which declarators and related data structures are
1318 allocated. */
1321 /* Alloc BYTES from the declarator memory pool. */
1325 {
1327 }
1329 /* Allocate a declarator of the indicated KIND. Clear fields that are
1330 common to all declarators. */
1334 {
1346 }
1348 /* Make a declarator for a generalized identifier. If
1349 QUALIFYING_SCOPE is non-NULL, the identifier is
1350 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1351 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1352 is, if any. */
1356 special_function_kind sfk)
1357 {
1360 /* It is valid to write:
1362 class C { void f(); };
1363 typedef C D;
1364 void D::f();
1366 The standard is not clear about whether `typedef const C D' is
1367 legal; as of 2002-09-15 the committee is considering that
1368 question. EDG 3.0 allows that syntax. Therefore, we do as
1369 well. */
1383 }
1385 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1386 of modifiers such as const or volatile to apply to the pointer
1387 type, represented as identifiers. ATTRIBUTES represent the attributes that
1388 appertain to the pointer or reference. */
1390 cp_declarator *
1392 tree attributes)
1393 {
1401 {
1405 }
1406 else
1412 }
1414 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1415 represent the attributes that appertain to the pointer or
1416 reference. */
1418 cp_declarator *
1421 {
1429 {
1433 }
1434 else
1440 }
1442 /* Like make_pointer_declarator -- but for a pointer to a non-static
1443 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1449 tree attributes)
1450 {
1459 {
1462 }
1463 else
1469 }
1471 /* Make a declarator for the function given by TARGET, with the
1472 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1473 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1474 indicates what exceptions can be thrown. */
1476 cp_declarator *
1478 tree parms,
1479 cp_cv_quals cv_qualifiers,
1480 cp_virt_specifiers virt_specifiers,
1481 cp_ref_qualifier ref_qualifier,
1482 tree exception_specification,
1483 tree late_return_type)
1484 {
1496 {
1500 }
1501 else
1505 }
1507 /* Make a declarator for an array of BOUNDS elements, each of which is
1508 defined by ELEMENT. */
1510 cp_declarator *
1512 {
1519 {
1523 }
1524 else
1528 }
1530 /* Determine whether the declarator we've seen so far can be a
1531 parameter pack, when followed by an ellipsis. */
1532 static bool
1534 {
1535 /* Search for a declarator name, or any other declarator that goes
1536 after the point where the ellipsis could appear in a parameter
1537 pack. If we find any of these, then this declarator can not be
1538 made into a parameter pack. */
1541 {
1543 {
1555 }
1556 }
1559 }
1563 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1564 DECLARATOR and DEFAULT_ARGUMENT. */
1566 cp_parameter_declarator *
1569 tree default_argument)
1570 {
1578 else
1585 }
1587 /* Returns true iff DECLARATOR is a declaration for a function. */
1589 static bool
1591 {
1593 {
1601 }
1603 }
1605 /* The parser. */
1607 /* Overview
1608 --------
1610 A cp_parser parses the token stream as specified by the C++
1611 grammar. Its job is purely parsing, not semantic analysis. For
1612 example, the parser breaks the token stream into declarators,
1613 expressions, statements, and other similar syntactic constructs.
1614 It does not check that the types of the expressions on either side
1615 of an assignment-statement are compatible, or that a function is
1616 not declared with a parameter of type `void'.
1618 The parser invokes routines elsewhere in the compiler to perform
1619 semantic analysis and to build up the abstract syntax tree for the
1620 code processed.
1622 The parser (and the template instantiation code, which is, in a
1623 way, a close relative of parsing) are the only parts of the
1624 compiler that should be calling push_scope and pop_scope, or
1625 related functions. The parser (and template instantiation code)
1626 keeps track of what scope is presently active; everything else
1627 should simply honor that. (The code that generates static
1628 initializers may also need to set the scope, in order to check
1629 access control correctly when emitting the initializers.)
1631 Methodology
1632 -----------
1634 The parser is of the standard recursive-descent variety. Upcoming
1635 tokens in the token stream are examined in order to determine which
1636 production to use when parsing a non-terminal. Some C++ constructs
1637 require arbitrary look ahead to disambiguate. For example, it is
1638 impossible, in the general case, to tell whether a statement is an
1639 expression or declaration without scanning the entire statement.
1640 Therefore, the parser is capable of "parsing tentatively." When the
1641 parser is not sure what construct comes next, it enters this mode.
1642 Then, while we attempt to parse the construct, the parser queues up
1643 error messages, rather than issuing them immediately, and saves the
1644 tokens it consumes. If the construct is parsed successfully, the
1645 parser "commits", i.e., it issues any queued error messages and
1646 the tokens that were being preserved are permanently discarded.
1647 If, however, the construct is not parsed successfully, the parser
1648 rolls back its state completely so that it can resume parsing using
1649 a different alternative.
1651 Future Improvements
1652 -------------------
1654 The performance of the parser could probably be improved substantially.
1655 We could often eliminate the need to parse tentatively by looking ahead
1656 a little bit. In some places, this approach might not entirely eliminate
1657 the need to parse tentatively, but it might still speed up the average
1658 case. */
1660 /* Flags that are passed to some parsing functions. These values can
1661 be bitwise-ored together. */
1663 enum
1664 {
1665 /* No flags. */
1667 /* The construct is optional. If it is not present, then no error
1668 should be issued. */
1670 /* When parsing a type-specifier, treat user-defined type-names
1671 as non-type identifiers. */
1673 /* When parsing a type-specifier, do not try to parse a class-specifier
1674 or enum-specifier. */
1676 /* When parsing a decl-specifier-seq, only allow type-specifier or
1677 constexpr. */
1679 };
1681 /* This type is used for parameters and variables which hold
1682 combinations of the above flags. */
1685 /* The different kinds of declarators we want to parse. */
1688 {
1689 /* We want an abstract declarator. */
1690 CP_PARSER_DECLARATOR_ABSTRACT,
1691 /* We want a named declarator. */
1692 CP_PARSER_DECLARATOR_NAMED,
1693 /* We don't mind, but the name must be an unqualified-id. */
1694 CP_PARSER_DECLARATOR_EITHER
1697 /* The precedence values used to parse binary expressions. The minimum value
1698 of PREC must be 1, because zero is reserved to quickly discriminate
1699 binary operators from other tokens. */
1701 enum cp_parser_prec
1702 {
1703 PREC_NOT_OPERATOR,
1704 PREC_LOGICAL_OR_EXPRESSION,
1705 PREC_LOGICAL_AND_EXPRESSION,
1706 PREC_INCLUSIVE_OR_EXPRESSION,
1707 PREC_EXCLUSIVE_OR_EXPRESSION,
1708 PREC_AND_EXPRESSION,
1709 PREC_EQUALITY_EXPRESSION,
1710 PREC_RELATIONAL_EXPRESSION,
1711 PREC_SHIFT_EXPRESSION,
1712 PREC_ADDITIVE_EXPRESSION,
1713 PREC_MULTIPLICATIVE_EXPRESSION,
1714 PREC_PM_EXPRESSION,
1715 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1716 };
1718 /* A mapping from a token type to a corresponding tree node type, with a
1719 precedence value. */
1722 {
1723 /* The token type. */
1725 /* The corresponding tree code. */
1727 /* The precedence of this operator. */
1732 {
1733 /* Left hand side of the binary operation we are currently
1734 parsing. */
1735 tree lhs;
1736 /* Original tree code for left hand side, if it was a binary
1737 expression itself (used for -Wparentheses). */
1739 /* Tree code for the binary operation we are parsing. */
1741 /* Precedence of the binary operation we are parsing. */
1743 /* Location of the binary operation we are parsing. */
1744 location_t loc;
1747 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1748 entries because precedence levels on the stack are monotonically
1749 increasing. */
1753 /* Prototypes. */
1755 /* Constructors and destructors. */
1760 /* Class variables. */
1764 /* The operator-precedence table used by cp_parser_binary_expression.
1765 Transformed into an associative array (binops_by_token) by
1766 cp_parser_new. */
1799 };
1801 /* The same as binops, but initialized by cp_parser_new so that
1802 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1803 for speed. */
1806 /* Constructors and destructors. */
1808 /* Construct a new context. The context below this one on the stack
1809 is given by NEXT. */
1813 {
1816 /* Allocate the storage. */
1818 {
1819 /* Pull the first entry from the free list. */
1823 }
1824 else
1827 /* No errors have occurred yet in this context. */
1829 /* If this is not the bottommost context, copy information that we
1830 need from the previous context. */
1832 {
1833 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1834 expression, then we are parsing one in this context, too. */
1836 /* Thread the stack. */
1838 }
1841 }
1843 /* Managing the unparsed function queues. */
1845 #define unparsed_funs_with_default_args \
1846 parser->unparsed_queues->last ().funs_with_default_args
1847 #define unparsed_funs_with_definitions \
1848 parser->unparsed_queues->last ().funs_with_definitions
1849 #define unparsed_nsdmis \
1850 parser->unparsed_queues->last ().nsdmis
1852 static void
1854 {
1857 }
1859 static void
1861 {
1864 }
1866 /* Prototypes. */
1868 /* Constructors and destructors. */
1873 /* Routines to parse various constructs.
1875 Those that return `tree' will return the error_mark_node (rather
1876 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1877 Sometimes, they will return an ordinary node if error-recovery was
1878 attempted, even though a parse error occurred. So, to check
1879 whether or not a parse error occurred, you should always use
1880 cp_parser_error_occurred. If the construct is optional (indicated
1881 either by an `_opt' in the name of the function that does the
1882 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1883 the construct is not present. */
1885 /* Lexical conventions [gram.lex] */
1887 static tree cp_parser_identifier
1889 static tree cp_parser_string_literal
1891 static tree cp_parser_userdef_char_literal
1893 static tree cp_parser_userdef_string_literal
1895 static tree cp_parser_userdef_numeric_literal
1898 /* Basic concepts [gram.basic] */
1900 static bool cp_parser_translation_unit
1903 /* Expressions [gram.expr] */
1905 static tree cp_parser_primary_expression
1907 static tree cp_parser_id_expression
1909 static tree cp_parser_unqualified_id
1911 static tree cp_parser_nested_name_specifier_opt
1913 static tree cp_parser_nested_name_specifier
1915 static tree cp_parser_qualifying_entity
1917 static tree cp_parser_postfix_expression
1919 static tree cp_parser_postfix_open_square_expression
1921 static tree cp_parser_postfix_dot_deref_expression
1925 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1927 static void cp_parser_pseudo_destructor_name
1929 static tree cp_parser_unary_expression
1931 static enum tree_code cp_parser_unary_operator
1933 static tree cp_parser_new_expression
1937 static tree cp_parser_new_type_id
1945 static tree cp_parser_delete_expression
1947 static tree cp_parser_cast_expression
1949 static tree cp_parser_binary_expression
1951 static tree cp_parser_question_colon_clause
1953 static tree cp_parser_assignment_expression
1955 static enum tree_code cp_parser_assignment_operator_opt
1957 static tree cp_parser_expression
1959 static tree cp_parser_expression
1961 static tree cp_parser_constant_expression
1963 static tree cp_parser_builtin_offsetof
1965 static tree cp_parser_lambda_expression
1967 static void cp_parser_lambda_introducer
1969 static bool cp_parser_lambda_declarator_opt
1971 static void cp_parser_lambda_body
1974 /* Statements [gram.stmt.stmt] */
1976 static void cp_parser_statement
1978 static void cp_parser_label_for_labeled_statement
1980 static tree cp_parser_expression_statement
1982 static tree cp_parser_compound_statement
1984 static void cp_parser_statement_seq_opt
1986 static tree cp_parser_selection_statement
1988 static tree cp_parser_condition
1990 static tree cp_parser_iteration_statement
1992 static bool cp_parser_for_init_statement
1994 static tree cp_parser_for
1996 static tree cp_parser_c_for
1998 static tree cp_parser_range_for
2000 static void do_range_for_auto_deduction
2002 static tree cp_parser_perform_range_for_lookup
2004 static tree cp_parser_range_for_member_function
2006 static tree cp_parser_jump_statement
2008 static void cp_parser_declaration_statement
2011 static tree cp_parser_implicitly_scoped_statement
2013 static void cp_parser_already_scoped_statement
2016 /* Declarations [gram.dcl.dcl] */
2018 static void cp_parser_declaration_seq_opt
2020 static void cp_parser_declaration
2022 static void cp_parser_block_declaration
2024 static void cp_parser_simple_declaration
2026 static void cp_parser_decl_specifier_seq
2028 static tree cp_parser_storage_class_specifier_opt
2030 static tree cp_parser_function_specifier_opt
2032 static tree cp_parser_type_specifier
2035 static tree cp_parser_simple_type_specifier
2037 static tree cp_parser_type_name
2039 static tree cp_parser_nonclass_name
2041 static tree cp_parser_elaborated_type_specifier
2043 static tree cp_parser_enum_specifier
2045 static void cp_parser_enumerator_list
2047 static void cp_parser_enumerator_definition
2049 static tree cp_parser_namespace_name
2051 static void cp_parser_namespace_definition
2053 static void cp_parser_namespace_body
2055 static tree cp_parser_qualified_namespace_specifier
2057 static void cp_parser_namespace_alias_definition
2059 static bool cp_parser_using_declaration
2061 static void cp_parser_using_directive
2063 static tree cp_parser_alias_declaration
2065 static void cp_parser_asm_definition
2067 static void cp_parser_linkage_specification
2069 static void cp_parser_static_assert
2071 static tree cp_parser_decltype
2074 /* Declarators [gram.dcl.decl] */
2076 static tree cp_parser_init_declarator
2077 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2082 static enum tree_code cp_parser_ptr_operator
2084 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2086 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2088 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2090 static tree cp_parser_late_return_type_opt
2092 static tree cp_parser_declarator_id
2094 static tree cp_parser_type_id
2096 static tree cp_parser_template_type_arg
2099 static tree cp_parser_type_id_1
2101 static void cp_parser_type_specifier_seq
2103 static tree cp_parser_parameter_declaration_clause
2105 static tree cp_parser_parameter_declaration_list
2109 static tree cp_parser_default_argument
2111 static void cp_parser_function_body
2113 static tree cp_parser_initializer
2115 static tree cp_parser_initializer_clause
2117 static tree cp_parser_braced_list
2122 static bool cp_parser_ctor_initializer_opt_and_function_body
2125 static tree cp_parser_late_parsing_omp_declare_simd
2128 static tree cp_parser_late_parsing_cilk_simd_fn_info
2131 static tree synthesize_implicit_template_parm
2133 static tree finish_fully_implicit_template
2136 /* Classes [gram.class] */
2138 static tree cp_parser_class_name
2140 static tree cp_parser_class_specifier
2142 static tree cp_parser_class_head
2144 static enum tag_types cp_parser_class_key
2146 static void cp_parser_member_specification_opt
2148 static void cp_parser_member_declaration
2150 static tree cp_parser_pure_specifier
2152 static tree cp_parser_constant_initializer
2155 /* Derived classes [gram.class.derived] */
2157 static tree cp_parser_base_clause
2159 static tree cp_parser_base_specifier
2162 /* Special member functions [gram.special] */
2164 static tree cp_parser_conversion_function_id
2166 static tree cp_parser_conversion_type_id
2170 static bool cp_parser_ctor_initializer_opt
2172 static void cp_parser_mem_initializer_list
2174 static tree cp_parser_mem_initializer
2176 static tree cp_parser_mem_initializer_id
2179 /* Overloading [gram.over] */
2181 static tree cp_parser_operator_function_id
2183 static tree cp_parser_operator
2186 /* Templates [gram.temp] */
2188 static void cp_parser_template_declaration
2190 static tree cp_parser_template_parameter_list
2192 static tree cp_parser_template_parameter
2194 static tree cp_parser_type_parameter
2196 static tree cp_parser_template_id
2198 static tree cp_parser_template_name
2200 static tree cp_parser_template_argument_list
2202 static tree cp_parser_template_argument
2204 static void cp_parser_explicit_instantiation
2206 static void cp_parser_explicit_specialization
2209 /* Exception handling [gram.exception] */
2211 static tree cp_parser_try_block
2213 static bool cp_parser_function_try_block
2215 static void cp_parser_handler_seq
2217 static void cp_parser_handler
2219 static tree cp_parser_exception_declaration
2221 static tree cp_parser_throw_expression
2223 static tree cp_parser_exception_specification_opt
2225 static tree cp_parser_type_id_list
2228 /* GNU Extensions */
2230 static tree cp_parser_asm_specification_opt
2232 static tree cp_parser_asm_operand_list
2234 static tree cp_parser_asm_clobber_list
2236 static tree cp_parser_asm_label_list
2238 static bool cp_next_tokens_can_be_attribute_p
2240 static bool cp_next_tokens_can_be_gnu_attribute_p
2242 static bool cp_next_tokens_can_be_std_attribute_p
2244 static bool cp_nth_tokens_can_be_std_attribute_p
2246 static bool cp_nth_tokens_can_be_gnu_attribute_p
2248 static bool cp_nth_tokens_can_be_attribute_p
2250 static tree cp_parser_attributes_opt
2252 static tree cp_parser_gnu_attributes_opt
2254 static tree cp_parser_gnu_attribute_list
2256 static tree cp_parser_std_attribute
2258 static tree cp_parser_std_attribute_spec
2260 static tree cp_parser_std_attribute_spec_seq
2262 static bool cp_parser_extension_opt
2264 static void cp_parser_label_declaration
2267 /* Transactional Memory Extensions */
2269 static tree cp_parser_transaction
2271 static tree cp_parser_transaction_expression
2273 static bool cp_parser_function_transaction
2275 static tree cp_parser_transaction_cancel
2279 pragma_external,
2280 pragma_member,
2281 pragma_objc_icode,
2282 pragma_stmt,
2283 pragma_compound
2284 };
2285 static bool cp_parser_pragma
2288 /* Objective-C++ Productions */
2290 static tree cp_parser_objc_message_receiver
2292 static tree cp_parser_objc_message_args
2294 static tree cp_parser_objc_message_expression
2296 static tree cp_parser_objc_encode_expression
2298 static tree cp_parser_objc_defs_expression
2300 static tree cp_parser_objc_protocol_expression
2302 static tree cp_parser_objc_selector_expression
2304 static tree cp_parser_objc_expression
2306 static bool cp_parser_objc_selector_p
2308 static tree cp_parser_objc_selector
2310 static tree cp_parser_objc_protocol_refs_opt
2312 static void cp_parser_objc_declaration
2314 static tree cp_parser_objc_statement
2316 static bool cp_parser_objc_valid_prefix_attributes
2318 static void cp_parser_objc_at_property_declaration
2320 static void cp_parser_objc_at_synthesize_declaration
2322 static void cp_parser_objc_at_dynamic_declaration
2324 static tree cp_parser_objc_struct_declaration
2327 /* Utility Routines */
2329 static tree cp_parser_lookup_name
2331 static tree cp_parser_lookup_name_simple
2333 static tree cp_parser_maybe_treat_template_as_class
2335 static bool cp_parser_check_declarator_template_parameters
2337 static bool cp_parser_check_template_parameters
2339 static tree cp_parser_simple_cast_expression
2341 static tree cp_parser_global_scope_opt
2343 static bool cp_parser_constructor_declarator_p
2345 static tree cp_parser_function_definition_from_specifiers_and_declarator
2347 static tree cp_parser_function_definition_after_declarator
2349 static void cp_parser_template_declaration_after_export
2351 static void cp_parser_perform_template_parameter_access_checks
2353 static tree cp_parser_single_declaration
2355 static tree cp_parser_functional_cast
2357 static tree cp_parser_save_member_function_body
2359 static tree cp_parser_save_nsdmi
2361 static tree cp_parser_enclosed_template_argument_list
2363 static void cp_parser_save_default_args
2365 static void cp_parser_late_parsing_for_member
2367 static tree cp_parser_late_parse_one_default_arg
2369 static void cp_parser_late_parsing_nsdmi
2371 static void cp_parser_late_parsing_default_args
2373 static tree cp_parser_sizeof_operand
2375 static tree cp_parser_trait_expr
2377 static bool cp_parser_declares_only_class_p
2379 static void cp_parser_set_storage_class
2381 static void cp_parser_set_decl_spec_type
2383 static void set_and_check_decl_spec_loc
2386 static bool cp_parser_friend_p
2388 static void cp_parser_required_error
2394 static bool cp_parser_token_starts_function_definition_p
2396 static bool cp_parser_next_token_starts_class_definition_p
2398 static bool cp_parser_next_token_ends_template_argument_p
2400 static bool cp_parser_nth_token_starts_template_argument_list_p
2402 static enum tag_types cp_parser_token_is_class_key
2404 static void cp_parser_check_class_key
2406 static void cp_parser_check_access_in_redeclaration
2408 static bool cp_parser_optional_template_keyword
2410 static void cp_parser_pre_parsed_nested_name_specifier
2412 static bool cp_parser_cache_group
2414 static tree cp_parser_cache_defarg
2416 static void cp_parser_parse_tentatively
2418 static void cp_parser_commit_to_tentative_parse
2420 static void cp_parser_commit_to_topmost_tentative_parse
2422 static void cp_parser_abort_tentative_parse
2424 static bool cp_parser_parse_definitely
2428 static bool cp_parser_uncommitted_to_tentative_parse_p
2430 static void cp_parser_error
2432 static void cp_parser_name_lookup_error
2434 static bool cp_parser_simulate_error
2436 static bool cp_parser_check_type_definition
2438 static void cp_parser_check_for_definition_in_return_type
2440 static void cp_parser_check_for_invalid_template_id
2442 static bool cp_parser_non_integral_constant_expression
2444 static void cp_parser_diagnose_invalid_type_name
2446 static bool cp_parser_parse_and_diagnose_invalid_type_name
2448 static int cp_parser_skip_to_closing_parenthesis
2450 static void cp_parser_skip_to_end_of_statement
2452 static void cp_parser_consume_semicolon_at_end_of_statement
2454 static void cp_parser_skip_to_end_of_block_or_statement
2456 static bool cp_parser_skip_to_closing_brace
2458 static void cp_parser_skip_to_end_of_template_parameter_list
2460 static void cp_parser_skip_to_pragma_eol
2462 static bool cp_parser_error_occurred
2464 static bool cp_parser_allow_gnu_extensions_p
2466 static bool cp_parser_is_pure_string_literal
2468 static bool cp_parser_is_string_literal
2470 static bool cp_parser_is_keyword
2472 static tree cp_parser_make_typename_type
2477 /* Returns nonzero if we are parsing tentatively. */
2481 {
2483 }
2485 /* Returns nonzero if TOKEN is a string literal. */
2487 static bool
2489 {
2495 }
2497 /* Returns nonzero if TOKEN is a string literal
2498 of a user-defined string literal. */
2500 static bool
2502 {
2509 }
2511 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2513 static bool
2515 {
2517 }
2519 /* If not parsing tentatively, issue a diagnostic of the form
2520 FILE:LINE: MESSAGE before TOKEN
2521 where TOKEN is the next token in the input stream. MESSAGE
2522 (specified by the caller) is usually of the form "expected
2523 OTHER-TOKEN". */
2525 static void
2527 {
2529 {
2531 /* This diagnostic makes more sense if it is tagged to the line
2532 of the token we just peeked at. */
2536 {
2541 }
2544 /* Because c_parser_error does not understand
2545 CPP_KEYWORD, keywords are treated like
2546 identifiers. */
2549 }
2550 }
2552 /* Issue an error about name-lookup failing. NAME is the
2553 IDENTIFIER_NODE DECL is the result of
2554 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2555 the thing that we hoped to find. */
2557 static void
2559 tree name,
2560 tree decl,
2561 name_lookup_error desired,
2562 location_t location)
2563 {
2564 /* If name lookup completely failed, tell the user that NAME was not
2565 declared. */
2567 {
2580 else
2582 }
2584 {
2586 {
2603 }
2604 }
2606 {
2608 {
2618 name);
2622 }
2623 }
2624 else
2625 {
2627 {
2640 }
2641 }
2642 }
2644 /* If we are parsing tentatively, remember that an error has occurred
2645 during this tentative parse. Returns true if the error was
2646 simulated; false if a message should be issued by the caller. */
2648 static bool
2650 {
2652 {
2655 }
2657 }
2659 /* This function is called when a type is defined. If type
2660 definitions are forbidden at this point, an error message is
2661 issued. */
2663 static bool
2665 {
2666 /* If types are forbidden here, issue a message. */
2668 {
2669 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2670 in the message need to be interpreted. */
2673 }
2675 }
2677 /* This function is called when the DECLARATOR is processed. The TYPE
2678 was a type defined in the decl-specifiers. If it is invalid to
2679 define a type in the decl-specifiers for DECLARATOR, an error is
2680 issued. TYPE_LOCATION is the location of TYPE and is used
2681 for error reporting. */
2683 static void
2686 {
2687 /* [dcl.fct] forbids type definitions in return types.
2688 Unfortunately, it's not easy to know whether or not we are
2689 processing a return type until after the fact. */
2697 {
2702 type);
2703 }
2704 }
2706 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2707 "<" in any valid C++ program. If the next token is indeed "<",
2708 issue a message warning the user about what appears to be an
2709 invalid attempt to form a template-id. LOCATION is the location
2710 of the type-specifier (TYPE) */
2712 static void
2714 tree type,
2716 location_t location)
2717 {
2721 {
2725 {
2728 else
2730 }
2731 else
2733 /* Remember the location of the invalid "<". */
2736 /* Consume the "<". */
2738 /* Parse the template arguments. */
2740 /* Permanently remove the invalid template arguments so that
2741 this error message is not issued again. */
2744 }
2745 }
2747 /* If parsing an integral constant-expression, issue an error message
2748 about the fact that THING appeared and return true. Otherwise,
2749 return false. In either case, set
2750 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2752 static bool
2754 non_integral_constant thing)
2755 {
2758 {
2760 {
2763 {
2770 "enumeration type cannot appear in a "
2861 }
2865 }
2866 }
2868 }
2870 /* Emit a diagnostic for an invalid type name. SCOPE is the
2871 qualifying scope (or NULL, if none) for ID. This function commits
2872 to the current active tentative parse, if any. (Otherwise, the
2873 problematic construct might be encountered again later, resulting
2874 in duplicate error messages.) LOCATION is the location of ID. */
2876 static void
2879 location_t location)
2880 {
2883 /* Try to lookup the identifier. */
2888 /* If the lookup found a template-name, it means that the user forgot
2889 to specify an argument list. Emit a useful error message. */
2893 decl);
2897 /* Something like 'unsigned A a;' */
2900 {
2901 /* Issue an error message. */
2903 /* If we're in a template class, it's possible that the user was
2904 referring to a type from a base class. For example:
2906 template <typename T> struct A { typedef T X; };
2907 template <typename T> struct B : public A<T> { X x; };
2909 The user should have said "typename A<T>::X". */
2915 {
2916 tree b;
2919 b;
2921 {
2925 {
2926 tree field;
2927 /* Go from a particular instantiation of the
2928 template (which will have an empty TYPE_FIELDs),
2929 to the main version. */
2932 field;
2936 {
2941 }
2944 }
2945 }
2946 }
2947 }
2948 /* Here we diagnose qualified-ids where the scope is actually correct,
2949 but the identifier does not resolve to a valid type name. */
2951 {
2953 {
2958 else
2962 }
2965 {
2966 /* A<T>::A<T>() */
2972 }
2979 {
2984 else
2988 }
2989 else
2991 }
2992 }
2994 /* Check for a common situation where a type-name should be present,
2995 but is not, and issue a sensible error message. Returns true if an
2996 invalid type-name was detected.
2998 The situation handled by this function are variable declarations of the
2999 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3000 Usually, `ID' should name a type, but if we got here it means that it
3001 does not. We try to emit the best possible error message depending on
3002 how exactly the id-expression looks like. */
3004 static bool
3006 {
3007 tree id;
3010 /* Avoid duplicate error about ambiguous lookup. */
3012 {
3016 }
3025 /* If the next token is a (, this is a function with no explicit return
3026 type, i.e. constructor, destructor or conversion op. */
3029 {
3032 }
3036 /* Emit a diagnostic for the invalid type. */
3039 out:
3040 /* If we aren't in the middle of a declarator (i.e. in a
3041 parameter-declaration-clause), skip to the end of the declaration;
3042 there's no point in trying to process it. */
3046 }
3048 /* Consume tokens up to, and including, the next non-nested closing `)'.
3049 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3050 are doing error recovery. Returns -1 if OR_COMMA is true and we
3051 found an unnested comma. */
3053 static int
3058 {
3068 {
3072 {
3075 /* If we've run out of tokens, then there is no closing `)'. */
3078 /* This is good for lambda expression capture-lists. */
3088 /* This matches the processing in skip_to_end_of_statement. */
3114 {
3118 }
3123 }
3125 /* Consume the token. */
3127 }
3128 }
3130 /* Consume tokens until we reach the end of the current statement.
3131 Normally, that will be just before consuming a `;'. However, if a
3132 non-nested `}' comes first, then we stop before consuming that. */
3134 static void
3136 {
3139 /* Unwind generic function template scope if necessary. */
3144 {
3148 {
3151 /* If we've run out of tokens, stop. */
3155 /* If the next token is a `;', we have reached the end of the
3156 statement. */
3162 /* If this is a non-nested '}', stop before consuming it.
3163 That way, when confronted with something like:
3165 { 3 + }
3167 we stop before consuming the closing '}', even though we
3168 have not yet reached a `;'. */
3172 /* If it is the closing '}' for a block that we have
3173 scanned, stop -- but only after consuming the token.
3174 That way given:
3176 void f g () { ... }
3177 typedef int I;
3179 we will stop after the body of the erroneously declared
3180 function, but before consuming the following `typedef'
3181 declaration. */
3183 {
3186 }
3194 }
3196 /* Consume the token. */
3198 }
3199 }
3201 /* This function is called at the end of a statement or declaration.
3202 If the next token is a semicolon, it is consumed; otherwise, error
3203 recovery is attempted. */
3205 static void
3207 {
3208 /* Look for the trailing `;'. */
3210 {
3211 /* If there is additional (erroneous) input, skip to the end of
3212 the statement. */
3214 /* If the next token is now a `;', consume it. */
3217 }
3218 }
3220 /* Skip tokens until we have consumed an entire block, or until we
3221 have consumed a non-nested `;'. */
3223 static void
3225 {
3228 /* Unwind generic function template scope if necessary. */
3233 {
3237 {
3240 /* If we've run out of tokens, stop. */
3244 /* Stop if this is an unnested ';'. */
3250 /* Stop if this is an unnested '}', or closes the outermost
3251 nesting level. */
3252 nesting_depth--;
3260 /* Nest. */
3261 nesting_depth++;
3266 }
3268 /* Consume the token. */
3270 }
3271 }
3273 /* Skip tokens until a non-nested closing curly brace is the next
3274 token, or there are no more tokens. Return true in the first case,
3275 false otherwise. */
3277 static bool
3279 {
3283 {
3287 {
3290 /* If we've run out of tokens, stop. */
3294 /* If the next token is a non-nested `}', then we have reached
3295 the end of the current block. */
3301 /* If it the next token is a `{', then we are entering a new
3302 block. Consume the entire block. */
3308 }
3310 /* Consume the token. */
3312 }
3313 }
3315 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3316 parameter is the PRAGMA token, allowing us to purge the entire pragma
3317 sequence. */
3319 static void
3321 {
3326 do
3330 /* Ensure that the pragma is not parsed again. */
3332 }
3334 /* Require pragma end of line, resyncing with it as necessary. The
3335 arguments are as for cp_parser_skip_to_pragma_eol. */
3337 static void
3339 {
3343 }
3345 /* This is a simple wrapper around make_typename_type. When the id is
3346 an unresolved identifier node, we can provide a superior diagnostic
3347 using cp_parser_diagnose_invalid_type_name. */
3349 static tree
3352 {
3353 tree result;
3355 {
3361 }
3363 }
3365 /* This is a wrapper around the
3366 make_{pointer,ptrmem,reference}_declarator functions that decides
3367 which one to call based on the CODE and CLASS_TYPE arguments. The
3368 CODE argument should be one of the values returned by
3369 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3370 appertain to the pointer or reference. */
3374 cp_cv_quals cv_qualifiers,
3376 tree attributes)
3377 {
3384 else
3394 }
3396 /* Create a new C++ parser. */
3400 {
3405 /* cp_lexer_new_main is called before doing GC allocation because
3406 cp_lexer_new_main might load a PCH file. */
3409 /* Initialize the binops_by_token so that we can get the tree
3410 directly from the token. */
3418 /* For now, we always accept GNU extensions. */
3421 /* The `>' token is a greater-than operator, not the end of a
3422 template-id. */
3427 /* We are not parsing a constant-expression. */
3432 /* Local variable names are not forbidden. */
3435 /* We are not processing an `extern "C"' declaration. */
3438 /* We are not processing a declarator. */
3441 /* We are not processing a template-argument-list. */
3444 /* We are not in an iteration statement. */
3447 /* We are not in a switch statement. */
3450 /* We are not parsing a type-id inside an expression. */
3453 /* Declarations aren't implicitly extern "C". */
3456 /* String literals should be translated to the execution character set. */
3459 /* We are not parsing a function body. */
3462 /* We can correct until told otherwise. */
3465 /* The unparsed function queue is empty. */
3468 /* There are no classes being defined. */
3471 /* No template parameters apply. */
3474 /* Not declaring an implicit function template. */
3481 }
3483 /* Create a cp_lexer structure which will emit the tokens in CACHE
3484 and push it onto the parser's lexer stack. This is used for delayed
3485 parsing of in-class method bodies and default arguments, and should
3486 not be confused with tentative parsing. */
3487 static void
3489 {
3494 /* Move the current source position to that of the first token in the
3495 new lexer. */
3497 }
3499 /* Pop the top lexer off the parser stack. This is never used for the
3500 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3501 static void
3503 {
3508 /* Put the current source position back where it was before this
3509 lexer was pushed. */
3511 }
3513 /* Lexical conventions [gram.lex] */
3515 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3516 identifier. */
3518 static tree
3520 {
3523 /* Look for the identifier. */
3525 /* Return the value. */
3527 }
3529 /* Parse a sequence of adjacent string constants. Returns a
3530 TREE_STRING representing the combined, nul-terminated string
3531 constant. If TRANSLATE is true, translate the string to the
3532 execution character set. If WIDE_OK is true, a wide string is
3533 invalid here.
3535 C++98 [lex.string] says that if a narrow string literal token is
3536 adjacent to a wide string literal token, the behavior is undefined.
3537 However, C99 6.4.5p4 says that this results in a wide string literal.
3538 We follow C99 here, for consistency with the C front end.
3540 This code is largely lifted from lex_string() in c-lex.c.
3542 FUTURE: ObjC++ will need to handle @-strings here. */
3543 static tree
3545 {
3546 tree value;
3553 tree string_tree;
3559 {
3562 }
3565 {
3569 }
3570 else
3571 {
3574 }
3577 /* Try to avoid the overhead of creating and destroying an obstack
3578 for the common case of just one string. */
3581 {
3589 {
3593 }
3594 else
3598 }
3599 else
3600 {
3604 do
3605 {
3607 count++;
3612 {
3615 {
3618 }
3621 {
3626 }
3628 }
3629 else
3633 {
3638 "unsupported non-standard concatenation "
3640 }
3646 {
3650 }
3651 else
3652 {
3656 }
3657 }
3661 }
3664 {
3667 }
3671 {
3676 {
3691 }
3696 {
3701 }
3702 }
3703 else
3704 /* cpp_interpret_string has issued an error. */
3711 }
3713 /* Look up a literal operator with the name and the exact arguments. */
3715 static tree
3717 {
3724 {
3730 {
3733 {
3743 }
3746 /* May be this should be sufficient_parms_p instead,
3747 depending on how exactly should user-defined literals
3748 work in presence of default arguments on the literal
3749 operator parameters. */
3752 }
3753 }
3756 }
3758 /* Parse a user-defined char constant. Returns a call to a user-defined
3759 literal operator taking the character as an argument. */
3761 static tree
3763 {
3771 /* Build up a call to the user-defined operator */
3772 /* Lookup the name we got back from the id-expression. */
3777 {
3782 }
3791 }
3793 /* A subroutine of cp_parser_userdef_numeric_literal to
3794 create a char... template parameter pack from a string node. */
3796 static tree
3798 {
3799 tree charvec;
3805 /* Fill in CHARVEC with all of the parameters. */
3810 /* Build the argument packs. */
3817 }
3819 /* A subroutine of cp_parser_userdef_numeric_literal to
3820 create a char... template parameter pack from a string node. */
3822 static tree
3824 {
3825 tree charvec;
3836 /* First template parm is character type. */
3839 /* Fill in CHARVEC with all of the parameters. */
3846 /* Build the argument packs. */
3853 }
3855 /* Parse a user-defined numeric constant. returns a call to a user-defined
3856 literal operator. */
3858 static tree
3860 {
3871 /* Look for a literal operator taking the exact type of numeric argument
3872 as the literal value. */
3877 {
3880 {
3884 long_long_unsigned_type_node);
3885 else
3886 {
3890 long_double_type_node);
3894 }
3897 }
3898 }
3901 /* If the numeric argument didn't work, look for a raw literal
3902 operator taking a const char* argument consisting of the number
3903 in string format. */
3908 {
3911 {
3914 }
3915 }
3918 /* If the raw literal didn't work, look for a non-type template
3919 function with parameter pack char.... Call the function with
3920 template parameter characters representing the number. */
3924 {
3929 {
3932 }
3933 }
3941 }
3943 /* Parse a user-defined string constant. Returns a call to a user-defined
3944 literal operator taking a character pointer and the length of the string
3945 as arguments. */
3947 static tree
3949 {
3959 /* Look for a template function with typename parameter CharT
3960 and parameter pack CharT... Call the function with
3961 template parameter characters representing the string. */
3965 {
3970 {
3973 }
3974 }
3977 /* Build up a call to the user-defined operator */
3978 /* Lookup the name we got back from the id-expression. */
3984 {
3988 }
3997 }
4000 /* Basic concepts [gram.basic] */
4002 /* Parse a translation-unit.
4004 translation-unit:
4005 declaration-seq [opt]
4007 Returns TRUE if all went well. */
4009 static bool
4011 {
4012 /* The address of the first non-permanent object on the declarator
4013 obstack. */
4018 /* Create the declarator obstack, if necessary. */
4020 {
4022 /* Create the error declarator. */
4024 /* Create the empty parameter list. */
4026 /* Remember where the base of the declarator obstack lies. */
4028 }
4032 /* If there are no tokens left then all went well. */
4034 {
4035 /* Get rid of the token array; we don't need it any more. */
4039 /* This file might have been a context that's implicitly extern
4040 "C". If so, pop the lang context. (Only relevant for PCH.) */
4042 {
4045 }
4047 /* Finish up. */
4051 }
4052 else
4053 {
4056 }
4058 /* Make sure the declarator obstack was fully cleaned up. */
4062 /* All went well. */
4064 }
4066 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4067 decltype context. */
4071 {
4076 }
4078 /* Expressions [gram.expr] */
4080 /* Parse a primary-expression.
4082 primary-expression:
4083 literal
4084 this
4085 ( expression )
4086 id-expression
4088 GNU Extensions:
4090 primary-expression:
4091 ( compound-statement )
4092 __builtin_va_arg ( assignment-expression , type-id )
4093 __builtin_offsetof ( type-id , offsetof-expression )
4095 C++ Extensions:
4096 __has_nothrow_assign ( type-id )
4097 __has_nothrow_constructor ( type-id )
4098 __has_nothrow_copy ( type-id )
4099 __has_trivial_assign ( type-id )
4100 __has_trivial_constructor ( type-id )
4101 __has_trivial_copy ( type-id )
4102 __has_trivial_destructor ( type-id )
4103 __has_virtual_destructor ( type-id )
4104 __is_abstract ( type-id )
4105 __is_base_of ( type-id , type-id )
4106 __is_class ( type-id )
4107 __is_convertible_to ( type-id , type-id )
4108 __is_empty ( type-id )
4109 __is_enum ( type-id )
4110 __is_final ( type-id )
4111 __is_literal_type ( type-id )
4112 __is_pod ( type-id )
4113 __is_polymorphic ( type-id )
4114 __is_std_layout ( type-id )
4115 __is_trivial ( type-id )
4116 __is_union ( type-id )
4118 Objective-C++ Extension:
4120 primary-expression:
4121 objc-expression
4123 literal:
4124 __null
4126 ADDRESS_P is true iff this expression was immediately preceded by
4127 "&" and therefore might denote a pointer-to-member. CAST_P is true
4128 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4129 true iff this expression is a template argument.
4131 Returns a representation of the expression. Upon return, *IDK
4132 indicates what kind of id-expression (if any) was present. */
4134 static tree
4141 {
4144 /* Assume the primary expression is not an id-expression. */
4147 /* Peek at the next token. */
4150 {
4151 /* literal:
4152 integer-literal
4153 character-literal
4154 floating-literal
4155 string-literal
4156 boolean-literal
4157 pointer-literal
4158 user-defined-literal */
4168 {
4172 }
4173 /* Floating-point literals are only allowed in an integral
4174 constant expression if they are cast to an integral or
4175 enumeration type. */
4179 {
4180 /* CAST_P will be set even in invalid code like "int(2.7 +
4181 ...)". Therefore, we have to check that the next token
4182 is sure to end the cast. */
4184 {
4189 enumerator-definition. */
4191 /* The curly brace at the end of an enum-specifier. */
4193 /* The end of a statement. */
4195 /* The end of the cast-expression. */
4197 /* The end of an array bound. */
4199 /* The closing ">" in a template-argument-list. */
4202 /* C++0x only: A ">>" treated like two ">" tokens,
4203 in a template-argument-list. */
4208 }
4210 /* If we are within a cast, then the constraint that the
4211 cast is to an integral or enumeration type will be
4212 checked at that point. If we are not within a cast, then
4213 this code is invalid. */
4216 }
4235 /* ??? Should wide strings be allowed when parser->translate_strings_p
4236 is false (i.e. in attributes)? If not, we can kill the third
4237 argument to cp_parser_string_literal. */
4243 {
4244 tree expr;
4247 /* Consume the `('. */
4249 /* Within a parenthesized expression, a `>' token is always
4250 the greater-than operator. */
4251 saved_greater_than_is_operator_p
4254 /* If we see `( { ' then we are looking at the beginning of
4255 a GNU statement-expression. */
4258 {
4259 /* Statement-expressions are not allowed by the standard. */
4263 /* And they're not allowed outside of a function-body; you
4264 cannot, for example, write:
4266 int i = ({ int j = 3; j + 1; });
4268 at class or namespace scope. */
4271 {
4273 "statement-expressions are not allowed outside "
4277 }
4278 else
4279 {
4280 /* Start the statement-expression. */
4282 /* Parse the compound-statement. */
4284 /* Finish up. */
4286 }
4287 }
4288 else
4289 {
4290 /* Parse the parenthesized expression. */
4292 /* Let the front end know that this expression was
4293 enclosed in parentheses. This matters in case, for
4294 example, the expression is of the form `A::B', since
4295 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4296 not. */
4298 /* DR 705: Wrapping an unqualified name in parentheses
4299 suppresses arg-dependent lookup. We want to pass back
4300 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4301 (c++/37862), but none of the others. */
4304 }
4305 /* The `>' token might be the end of a template-id or
4306 template-parameter-list now. */
4307 parser->greater_than_is_operator_p
4309 /* Consume the `)'. */
4314 }
4318 /* We have an Objective-C++ message. */
4320 {
4322 /* Don't warn about a failed tentative parse. */
4327 }
4331 /* We have an Objective-C++ string literal. */
4338 {
4339 /* These two are the boolean literals. */
4347 /* The `__null' literal. */
4352 /* The `nullptr' literal. */
4357 /* Recognize the `this' keyword. */
4361 {
4365 }
4366 /* Pointers cannot appear in constant-expressions. */
4371 /* The `operator' keyword can be the beginning of an
4372 id-expression. */
4379 {
4380 non_integral_constant name;
4382 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4383 __func__ are the names of variables -- but they are
4384 treated specially. Therefore, they are handled here,
4385 rather than relying on the generic id-expression logic
4386 below. Grammatically, these names are id-expressions.
4388 Consume the token. */
4392 {
4404 }
4409 /* Look up the name. */
4411 }
4414 {
4415 tree expression;
4416 tree type;
4417 source_location type_location;
4419 /* The `__builtin_va_arg' construct is used to handle
4420 `va_arg'. Consume the `__builtin_va_arg' token. */
4422 /* Look for the opening `('. */
4424 /* Now, parse the assignment-expression. */
4427 /* Look for the `,'. */
4430 /* Parse the type-id. */
4432 /* Look for the closing `)'. */
4434 /* Using `va_arg' in a constant-expression is not
4435 allowed. */
4437 NIC_VA_ARG))
4440 }
4468 /* Objective-C++ expressions. */
4478 {
4483 }
4487 }
4489 /* An id-expression can start with either an identifier, a
4490 `::' as the beginning of a qualified-id, or the "operator"
4491 keyword. */
4496 {
4497 tree id_expression;
4498 tree decl;
4504 id_expression:
4505 /* Parse the id-expression. */
4506 id_expression
4523 /* If we have a template-id, then no further lookup is
4524 required. If the template-id was for a template-class, we
4525 will sometimes have a TYPE_DECL at this point. */
4529 /* Look up the name. */
4530 else
4531 {
4532 tree ambiguous_decls;
4534 /* If we already know that this lookup is ambiguous, then
4535 we've already issued an error message; there's no reason
4536 to check again. */
4539 {
4542 }
4545 none_type,
4546 template_p,
4551 /* If the lookup was ambiguous, an error will already have
4552 been issued. */
4556 /* In Objective-C++, we may have an Objective-C 2.0
4557 dot-syntax for classes here. */
4562 {
4563 tree component;
4570 }
4572 /* In Objective-C++, an instance variable (ivar) may be preferred
4573 to whatever cp_parser_lookup_name() found. */
4576 /* If name lookup gives us a SCOPE_REF, then the
4577 qualifying scope was dependent. */
4579 {
4580 /* At this point, we do not know if DECL is a valid
4581 integral constant expression. We assume that it is
4582 in fact such an expression, so that code like:
4584 template <int N> struct A {
4585 int a[B<N>::i];
4586 };
4588 is accepted. At template-instantiation time, we
4589 will check that B<N>::i is actually a constant. */
4591 }
4592 /* Check to see if DECL is a local variable in a context
4593 where that is forbidden. */
4596 {
4597 /* It might be that we only found DECL because we are
4598 trying to be generous with pre-ISO scoping rules.
4599 For example, consider:
4601 int i;
4602 void g() {
4603 for (int i = 0; i < 10; ++i) {}
4604 extern void f(int j = i);
4605 }
4607 Here, name look up will originally find the out
4608 of scope `i'. We need to issue a warning message,
4609 but then use the global `i'. */
4612 {
4615 decl);
4617 }
4618 }
4619 }
4621 decl = (finish_id_expression
4623 idk,
4628 template_arg_p,
4634 }
4636 /* Anything else is an error. */
4640 }
4641 }
4649 {
4652 }
4654 /* Parse an id-expression.
4656 id-expression:
4657 unqualified-id
4658 qualified-id
4660 qualified-id:
4661 :: [opt] nested-name-specifier template [opt] unqualified-id
4662 :: identifier
4663 :: operator-function-id
4664 :: template-id
4666 Return a representation of the unqualified portion of the
4667 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4668 a `::' or nested-name-specifier.
4670 Often, if the id-expression was a qualified-id, the caller will
4671 want to make a SCOPE_REF to represent the qualified-id. This
4672 function does not do this in order to avoid wastefully creating
4673 SCOPE_REFs when they are not required.
4675 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4676 `template' keyword.
4678 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4679 uninstantiated templates.
4681 If *TEMPLATE_P is non-NULL, it is set to true iff the
4682 `template' keyword is used to explicitly indicate that the entity
4683 named is a template.
4685 If DECLARATOR_P is true, the id-expression is appearing as part of
4686 a declarator, rather than as part of an expression. */
4688 static tree
4695 {
4699 /* Assume the `template' keyword was not used. */
4703 /* Look for the optional `::' operator. */
4704 global_scope_p
4707 /* Look for the optional nested-name-specifier. */
4708 nested_name_specifier_p
4711 check_dependency_p,
4713 declarator_p)
4715 /* If there is a nested-name-specifier, then we are looking at
4716 the first qualified-id production. */
4718 {
4719 tree saved_scope;
4720 tree saved_object_scope;
4721 tree saved_qualifying_scope;
4722 tree unqualified_id;
4725 /* See if the next token is the `template' keyword. */
4729 /* Name lookup we do during the processing of the
4730 unqualified-id might obliterate SCOPE. */
4734 /* Process the final unqualified-id. */
4736 check_dependency_p,
4737 declarator_p,
4739 /* Restore the SAVED_SCOPE for our caller. */
4745 }
4746 /* Otherwise, if we are in global scope, then we are looking at one
4747 of the other qualified-id productions. */
4749 {
4751 tree id;
4753 /* Peek at the next token. */
4756 /* If it's an identifier, and the next token is not a "<", then
4757 we can avoid the template-id case. This is an optimization
4758 for this common case. */
4760 && !cp_parser_nth_token_starts_template_argument_list_p
4765 /* Try a template-id. */
4769 none_type,
4770 declarator_p);
4771 /* If that worked, we're done. */
4775 /* Peek at the next token. (Changes in the token buffer may
4776 have invalidated the pointer obtained above.) */
4780 {
4787 /* Fall through. */
4792 }
4793 }
4794 else
4797 declarator_p,
4798 optional_p);
4799 }
4801 /* Parse an unqualified-id.
4803 unqualified-id:
4804 identifier
4805 operator-function-id
4806 conversion-function-id
4807 ~ class-name
4808 template-id
4810 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4811 keyword, in a construct like `A::template ...'.
4813 Returns a representation of unqualified-id. For the `identifier'
4814 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4815 production a BIT_NOT_EXPR is returned; the operand of the
4816 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4817 other productions, see the documentation accompanying the
4818 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4819 names are looked up in uninstantiated templates. If DECLARATOR_P
4820 is true, the unqualified-id is appearing as part of a declarator,
4821 rather than as part of an expression. */
4823 static tree
4829 {
4832 /* Peek at the next token. */
4836 {
4838 {
4839 tree id;
4841 /* We don't know yet whether or not this will be a
4842 template-id. */
4844 /* Try a template-id. */
4846 check_dependency_p,
4847 none_type,
4848 declarator_p);
4849 /* If it worked, we're done. */
4852 /* Otherwise, it's an ordinary identifier. */
4854 }
4858 check_dependency_p,
4859 none_type,
4860 declarator_p);
4863 {
4864 tree type_decl;
4865 tree qualifying_scope;
4866 tree object_scope;
4867 tree scope;
4870 /* Consume the `~' token. */
4872 /* Parse the class-name. The standard, as written, seems to
4873 say that:
4875 template <typename T> struct S { ~S (); };
4876 template <typename T> S<T>::~S() {}
4878 is invalid, since `~' must be followed by a class-name, but
4879 `S<T>' is dependent, and so not known to be a class.
4880 That's not right; we need to look in uninstantiated
4881 templates. A further complication arises from:
4883 template <typename T> void f(T t) {
4884 t.T::~T();
4885 }
4887 Here, it is not possible to look up `T' in the scope of `T'
4888 itself. We must look in both the current scope, and the
4889 scope of the containing complete expression.
4891 Yet another issue is:
4893 struct S {
4894 int S;
4895 ~S();
4896 };
4898 S::~S() {}
4900 The standard does not seem to say that the `S' in `~S'
4901 should refer to the type `S' and not the data member
4902 `S::S'. */
4904 /* DR 244 says that we look up the name after the "~" in the
4905 same scope as we looked up the qualifying name. That idea
4906 isn't fully worked out; it's more complicated than that. */
4911 /* Check for invalid scopes. */
4913 {
4917 }
4919 {
4923 scope);
4928 }
4931 /* If the name is of the form "X::~X" it's OK even if X is a
4932 typedef. */
4941 {
4944 }
4946 /* ~auto means the destructor of whatever the object is. */
4948 {
4951 "%<~auto%> only available with "
4955 }
4957 /* If there was an explicit qualification (S::~T), first look
4958 in the scope given by the qualification (i.e., S).
4960 Note: in the calls to cp_parser_class_name below we pass
4961 typename_type so that lookup finds the injected-class-name
4962 rather than the constructor. */
4966 {
4971 typename_type,
4974 declarator_p);
4977 }
4978 /* In "N::S::~S", look in "N" as well. */
4980 {
4985 type_decl
4989 typename_type,
4992 declarator_p);
4995 }
4996 /* In "p->S::~T", look in the scope given by "*p" as well. */
4998 {
5003 type_decl
5007 typename_type,
5010 declarator_p);
5013 }
5014 /* Look in the surrounding context. */
5016 {
5022 type_decl
5026 typename_type,
5029 declarator_p);
5032 {
5033 /* We couldn't find a type with this name, so just accept
5034 it and check for a match at instantiation time. */
5039 }
5040 }
5041 /* If an error occurred, assume that the name of the
5042 destructor is the same as the name of the qualifying
5043 class. That allows us to keep parsing after running
5044 into ill-formed destructor names. */
5050 /* Check that destructor name and scope match. */
5052 {
5059 }
5061 /* [class.dtor]
5063 A typedef-name that names a class shall not be used as the
5064 identifier in the declarator for a destructor declaration. */
5071 type_decl);
5074 }
5078 {
5079 tree id;
5081 /* This could be a template-id, so we try that first. */
5083 /* Try a template-id. */
5086 none_type,
5087 declarator_p);
5088 /* If that worked, we're done. */
5091 /* We still don't know whether we're looking at an
5092 operator-function-id or a conversion-function-id. */
5094 /* Try an operator-function-id. */
5096 /* If that didn't work, try a conversion-function-id. */
5100 {
5101 /* 17.6.3.3.5 */
5107 }
5110 }
5111 /* Fall through. */
5118 }
5119 }
5121 /* Parse an (optional) nested-name-specifier.
5123 nested-name-specifier: [C++98]
5124 class-or-namespace-name :: nested-name-specifier [opt]
5125 class-or-namespace-name :: template nested-name-specifier [opt]
5127 nested-name-specifier: [C++0x]
5128 type-name ::
5129 namespace-name ::
5130 nested-name-specifier identifier ::
5131 nested-name-specifier template [opt] simple-template-id ::
5133 PARSER->SCOPE should be set appropriately before this function is
5134 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5135 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5136 in name lookups.
5138 Sets PARSER->SCOPE to the class (TYPE) or namespace
5139 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5140 it unchanged if there is no nested-name-specifier. Returns the new
5141 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5143 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5144 part of a declaration and/or decl-specifier. */
5146 static tree
5152 {
5157 /* Remember where the nested-name-specifier starts. */
5159 {
5162 }
5165 {
5166 tree new_scope;
5167 tree old_scope;
5168 tree saved_qualifying_scope;
5171 /* Spot cases that cannot be the beginning of a
5172 nested-name-specifier. */
5175 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5176 the already parsed nested-name-specifier. */
5178 {
5179 /* Grab the nested-name-specifier and continue the loop. */
5181 /* If we originally encountered this nested-name-specifier
5182 with IS_DECLARATION set to false, we will not have
5183 resolved TYPENAME_TYPEs, so we must do so here. */
5186 {
5191 }
5194 }
5196 /* Spot cases that cannot be the beginning of a
5197 nested-name-specifier. On the second and subsequent times
5198 through the loop, we look for the `template' keyword. */
5200 ;
5201 /* A template-id can start a nested-name-specifier. */
5203 ;
5204 /* DR 743: decltype can be used in a nested-name-specifier. */
5206 ;
5207 else
5208 {
5209 /* If the next token is not an identifier, then it is
5210 definitely not a type-name or namespace-name. */
5213 /* If the following token is neither a `<' (to begin a
5214 template-id), nor a `::', then we are not looking at a
5215 nested-name-specifier. */
5221 {
5225 }
5228 && !cp_parser_nth_token_starts_template_argument_list_p
5231 }
5233 /* The nested-name-specifier is optional, so we parse
5234 tentatively. */
5237 /* Look for the optional `template' keyword, if this isn't the
5238 first time through the loop. */
5241 else
5244 /* Save the old scope since the name lookup we are about to do
5245 might destroy it. */
5248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5249 look up names in "X<T>::I" in order to determine that "Y" is
5250 a template. So, if we have a typename at this point, we make
5251 an effort to look through it. */
5253 && !typename_keyword_p
5258 /* Parse the qualifying entity. */
5259 new_scope
5261 typename_keyword_p,
5262 template_keyword_p,
5263 check_dependency_p,
5264 type_p,
5265 is_declaration);
5266 /* Look for the `::' token. */
5269 /* If we found what we wanted, we keep going; otherwise, we're
5270 done. */
5272 {
5275 /* Restore the OLD_SCOPE since it was valid before the
5276 failed attempt at finding the last
5277 class-or-namespace-name. */
5281 /* If the next token is a decltype, and the one after that is a
5282 `::', then the decltype has failed to resolve to a class or
5283 enumeration type. Give this error even when parsing
5284 tentatively since it can't possibly be valid--and we're going
5285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5286 won't get another chance.*/
5290 {
5297 /* As below. */
5300 }
5304 /* If the next token is an identifier, and the one after
5305 that is a `::', then any valid interpretation would have
5306 found a class-or-namespace-name. */
5312 {
5315 {
5317 {
5318 tree decl;
5319 tree ambiguous_decls;
5322 none_type,
5331 decl);
5333 {
5334 // cp_parser_lookup_name has the same diagnostic,
5335 // thus make sure to emit it at most once.
5338 {
5343 }
5345 }
5346 else
5347 {
5349 cp_parser_name_lookup_error
5352 else
5353 cp_parser_name_lookup_error
5356 }
5357 }
5360 /* Treat this as a successful nested-name-specifier
5361 due to:
5363 [basic.lookup.qual]
5365 If the name found is not a class-name (clause
5366 _class_) or namespace-name (_namespace.def_), the
5367 program is ill-formed. */
5369 }
5371 }
5373 }
5374 /* We've found one valid nested-name-specifier. */
5376 /* Name lookup always gives us a DECL. */
5379 /* Uses of "template" must be followed by actual templates. */
5391 new_scope);
5392 /* If it is a class scope, try to complete it; we are about to
5393 be looking up names inside the class. */
5395 /* Since checking types for dependency can be expensive,
5396 avoid doing it if the type is already complete. */
5398 /* Do not try to complete dependent types. */
5400 {
5402 /* If it is a typedef to current class, use the current
5403 class instead, as the typedef won't have any names inside
5404 it yet. */
5408 }
5409 /* Make sure we look in the right scope the next time through
5410 the loop. */
5412 }
5414 /* If parsing tentatively, replace the sequence of tokens that makes
5415 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5416 token. That way, should we re-parse the token stream, we will
5417 not have to repeat the effort required to do the parse, nor will
5418 we issue duplicate error messages. */
5420 {
5424 /* Reset the contents of the START token. */
5426 /* Retrieve any deferred checks. Do not pop this access checks yet
5427 so the memory will not be reclaimed during token replacing below. */
5435 /* Purge all subsequent tokens. */
5437 }
5443 }
5445 /* Parse a nested-name-specifier. See
5446 cp_parser_nested_name_specifier_opt for details. This function
5447 behaves identically, except that it will an issue an error if no
5448 nested-name-specifier is present. */
5450 static tree
5456 {
5457 tree scope;
5459 /* Look for the nested-name-specifier. */
5461 typename_keyword_p,
5462 check_dependency_p,
5463 type_p,
5464 is_declaration);
5465 /* If it was not present, issue an error message. */
5467 {
5470 }
5473 }
5475 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5476 this is either a class-name or a namespace-name (which corresponds
5477 to the class-or-namespace-name production in the grammar). For
5478 C++0x, it can also be a type-name that refers to an enumeration
5479 type or a simple-template-id.
5481 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5482 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5483 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5484 TYPE_P is TRUE iff the next name should be taken as a class-name,
5485 even the same name is declared to be another entity in the same
5486 scope.
5488 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5489 specified by the class-or-namespace-name. If neither is found the
5490 ERROR_MARK_NODE is returned. */
5492 static tree
5499 {
5500 tree saved_scope;
5501 tree saved_qualifying_scope;
5502 tree saved_object_scope;
5503 tree scope;
5507 /* DR 743: decltype can appear in a nested-name-specifier. */
5509 {
5513 {
5516 }
5520 }
5522 /* Before we try to parse the class-name, we must save away the
5523 current PARSER->SCOPE since cp_parser_class_name will destroy
5524 it. */
5528 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5529 there is no need to look for a namespace-name. */
5530 only_class_p = template_keyword_p
5535 typename_keyword_p,
5536 template_keyword_p,
5538 check_dependency_p,
5540 is_declaration);
5542 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5546 {
5547 /* Restore the saved scope. */
5552 /* Parse tentatively. */
5555 /* Parse a type-name */
5558 /* "If the name found does not designate a namespace or a class,
5559 enumeration, or dependent type, the program is ill-formed."
5561 We cover classes and dependent types above and namespaces below,
5562 so this code is only looking for enums. */
5568 }
5569 /* If that didn't work, try for a namespace-name. */
5571 {
5572 /* Restore the saved scope. */
5576 /* If we are not looking at an identifier followed by the scope
5577 resolution operator, then this is not part of a
5578 nested-name-specifier. (Note that this function is only used
5579 to parse the components of a nested-name-specifier.) */
5584 }
5587 }
5589 /* Parse a postfix-expression.
5591 postfix-expression:
5592 primary-expression
5593 postfix-expression [ expression ]
5594 postfix-expression ( expression-list [opt] )
5595 simple-type-specifier ( expression-list [opt] )
5596 typename :: [opt] nested-name-specifier identifier
5597 ( expression-list [opt] )
5598 typename :: [opt] nested-name-specifier template [opt] template-id
5599 ( expression-list [opt] )
5600 postfix-expression . template [opt] id-expression
5601 postfix-expression -> template [opt] id-expression
5602 postfix-expression . pseudo-destructor-name
5603 postfix-expression -> pseudo-destructor-name
5604 postfix-expression ++
5605 postfix-expression --
5606 dynamic_cast < type-id > ( expression )
5607 static_cast < type-id > ( expression )
5608 reinterpret_cast < type-id > ( expression )
5609 const_cast < type-id > ( expression )
5610 typeid ( expression )
5611 typeid ( type-id )
5613 GNU Extension:
5615 postfix-expression:
5616 ( type-id ) { initializer-list , [opt] }
5618 This extension is a GNU version of the C99 compound-literal
5619 construct. (The C99 grammar uses `type-name' instead of `type-id',
5620 but they are essentially the same concept.)
5622 If ADDRESS_P is true, the postfix expression is the operand of the
5623 `&' operator. CAST_P is true if this expression is the target of a
5624 cast.
5626 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5627 class member access expressions [expr.ref].
5629 Returns a representation of the expression. */
5631 static tree
5635 {
5637 location_t loc;
5644 /* Peek at the next token. */
5647 /* Some of the productions are determined by keywords. */
5650 {
5655 {
5656 tree type;
5657 tree expression;
5661 /* All of these can be handled in the same way from the point
5662 of view of parsing. Begin by consuming the token
5663 identifying the cast. */
5666 /* New types cannot be defined in the cast. */
5668 parser->type_definition_forbidden_message
5671 /* Look for the opening `<'. */
5673 /* Parse the type to which we are casting. */
5678 /* Look for the closing `>'. */
5680 /* Restore the old message. */
5683 bool saved_greater_than_is_operator_p
5687 /* And the expression which is being cast. */
5692 parser->greater_than_is_operator_p
5695 /* Only type conversions to integral or enumeration types
5696 can be used in constant-expressions. */
5702 {
5704 postfix_expression
5708 postfix_expression
5712 postfix_expression
5714 tf_warning_or_error);
5717 postfix_expression
5722 }
5723 }
5727 {
5728 tree type;
5732 /* Consume the `typeid' token. */
5734 /* Look for the `(' token. */
5736 /* Types cannot be defined in a `typeid' expression. */
5738 parser->type_definition_forbidden_message
5740 /* We can't be sure yet whether we're looking at a type-id or an
5741 expression. */
5743 /* Try a type-id first. */
5748 /* Look for the `)' token. Otherwise, we can't be sure that
5749 we're not looking at an expression: consider `typeid (int
5750 (3))', for example. */
5752 /* If all went well, simply lookup the type-id. */
5755 /* Otherwise, fall back to the expression variant. */
5756 else
5757 {
5758 tree expression;
5760 /* Look for an expression. */
5762 /* Compute its typeid. */
5764 /* Look for the `)' token. */
5766 }
5767 /* Restore the saved message. */
5769 /* `typeid' may not appear in an integral constant expression. */
5772 }
5776 {
5777 tree type;
5778 /* The syntax permitted here is the same permitted for an
5779 elaborated-type-specifier. */
5784 }
5788 {
5792 {
5797 }
5799 {
5804 }
5805 else
5806 {
5807 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5810 }
5812 postfix_expression =
5816 {
5820 }
5822 {
5827 }
5828 else
5829 {
5831 postfix_expression);
5835 }
5837 }
5841 {
5846 }
5847 else
5854 {
5857 tree p;
5871 tf_warning_or_error);
5874 tf_warning_or_error);
5875 else
5876 {
5880 }
5882 }
5885 {
5886 tree type;
5888 /* If the next thing is a simple-type-specifier, we may be
5889 looking at a functional cast. We could also be looking at
5890 an id-expression. So, we try the functional cast, and if
5891 that doesn't work we fall back to the primary-expression. */
5893 /* Look for the simple-type-specifier. */
5896 CP_PARSER_FLAGS_NONE);
5897 /* Parse the cast itself. */
5899 postfix_expression
5901 /* If that worked, we're done. */
5905 /* If the functional-cast didn't work out, try a
5906 compound-literal. */
5909 {
5914 /* Consume the `('. */
5917 /* Avoid calling cp_parser_type_id pointlessly, see comment
5918 in cp_parser_cast_expression about c++/29234. */
5921 compound_literal_p
5926 /* Roll back the tokens we skipped. */
5931 else
5932 {
5933 /* Parse the type. */
5938 /* Look for the `)'. */
5940 }
5942 /* If things aren't going well, there's no need to
5943 keep going. */
5945 {
5947 /* Parse the brace-enclosed initializer list. */
5950 }
5951 /* If that worked, we're definitely looking at a
5952 compound-literal expression. */
5954 {
5955 /* Warn the user that a compound literal is not
5956 allowed in standard C++. */
5959 /* For simplicity, we disallow compound literals in
5960 constant-expressions. We could
5961 allow compound literals of integer type, whose
5962 initializer was a constant, in constant
5963 expressions. Permitting that usage, as a further
5964 extension, would not change the meaning of any
5965 currently accepted programs. (Of course, as
5966 compound literals are not part of ISO C++, the
5967 standard has nothing to say.) */
5969 NIC_NCC))
5970 {
5973 }
5974 /* Form the representation of the compound-literal. */
5975 postfix_expression
5977 tf_warning_or_error);
5979 }
5980 }
5982 /* It must be a primary-expression. */
5983 postfix_expression
5986 decltype_p,
5988 }
5990 }
5992 /* Note that we don't need to worry about calling build_cplus_new on a
5993 class-valued CALL_EXPR in decltype when it isn't the end of the
5994 postfix-expression; unary_complex_lvalue will take care of that for
5995 all these cases. */
5997 /* Keep looping until the postfix-expression is complete. */
5999 {
6003 /* It is not a Koenig lookup function call. */
6004 postfix_expression
6007 /* Peek at the next token. */
6011 {
6014 {
6016 "two consecutive %<[%> shall "
6019 }
6020 postfix_expression
6022 postfix_expression,
6024 decltype_p);
6030 /* postfix-expression ( expression-list [opt] ) */
6031 {
6041 is_builtin_constant_p
6044 {
6045 /* The whole point of __builtin_constant_p is to allow
6046 non-constant expressions to appear as arguments. */
6047 saved_integral_constant_expression_p
6049 saved_non_integral_constant_expression_p
6052 }
6053 args = (cp_parser_parenthesized_expression_list
6058 {
6059 parser->integral_constant_expression_p
6061 parser->non_integral_constant_expression_p
6063 }
6066 {
6069 }
6071 /* Function calls are not permitted in
6072 constant-expressions. */
6075 NIC_FUNC_CALL))
6076 {
6080 }
6085 {
6087 {
6089 {
6092 postfix_expression
6094 complain);
6095 }
6096 else
6097 postfix_expression
6099 }
6100 /* We do not perform argument-dependent lookup if
6101 normal lookup finds a non-function, in accordance
6102 with the expected resolution of DR 218. */
6105 {
6109 /* Do not do argument dependent lookup if regular
6110 lookup finds a member function or a block-scope
6111 function declaration. [basic.lookup.argdep]/3 */
6114 {
6117 postfix_expression
6119 complain);
6120 }
6121 }
6122 }
6125 {
6135 {
6136 postfix_expression
6140 }
6143 {
6144 postfix_expression
6145 = (build_new_method_call
6151 complain));
6152 }
6153 else
6154 postfix_expression
6158 complain);
6159 }
6163 postfix_expression = (build_offset_ref_call_from_tree
6165 complain));
6167 /* A call to a static class member, or a namespace-scope
6168 function. */
6169 postfix_expression
6172 koenig_p,
6173 complain);
6174 else
6175 /* All other function calls. */
6176 postfix_expression
6179 koenig_p,
6180 complain);
6182 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6186 }
6191 /* postfix-expression . template [opt] id-expression
6192 postfix-expression . pseudo-destructor-name
6193 postfix-expression -> template [opt] id-expression
6194 postfix-expression -> pseudo-destructor-name */
6196 /* Consume the `.' or `->' operator. */
6199 postfix_expression
6201 postfix_expression,
6208 /* postfix-expression ++ */
6209 /* Consume the `++' token. */
6211 /* Generate a representation for the complete expression. */
6212 postfix_expression
6214 POSTINCREMENT_EXPR);
6215 /* Increments may not appear in constant-expressions. */
6223 /* postfix-expression -- */
6224 /* Consume the `--' token. */
6226 /* Generate a representation for the complete expression. */
6227 postfix_expression
6229 POSTDECREMENT_EXPR);
6230 /* Decrements may not appear in constant-expressions. */
6242 else
6244 }
6245 }
6247 /* We should never get here. */
6250 }
6252 /* This function parses Cilk Plus array notations. If a normal array expr. is
6253 parsed then the array index is passed back to the caller through *INIT_INDEX
6254 and the function returns a NULL_TREE. If array notation expr. is parsed,
6255 then *INIT_INDEX is ignored by the caller and the function returns
6256 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6257 error_mark_node. */
6259 static tree
6261 tree array_value)
6262 {
6266 {
6269 }
6278 {
6281 }
6283 {
6284 /* Consume the ':'. */
6287 /* If we are here, then we have a case like this A[:]. */
6289 {
6293 }
6297 }
6298 else
6299 {
6300 /* If we are here, then there are three valid possibilities:
6301 1. ARRAY [ EXP ]
6302 2. ARRAY [ EXP : EXP ]
6303 3. ARRAY [ EXP : EXP : EXP ] */
6307 {
6308 /* This indicates that we have a normal array expression. */
6311 }
6313 /* Consume the ':'. */
6317 {
6320 }
6321 }
6326 {
6330 }
6336 }
6338 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6339 by cp_parser_builtin_offsetof. We're looking for
6341 postfix-expression [ expression ]
6342 postfix-expression [ braced-init-list ] (C++11)
6344 FOR_OFFSETOF is set if we're being called in that context, which
6345 changes how we deal with integer constant expressions. */
6347 static tree
6349 tree postfix_expression,
6352 {
6357 /* Consume the `[' token. */
6363 /* Parse the index expression. */
6364 /* ??? For offsetof, there is a question of what to allow here. If
6365 offsetof is not being used in an integral constant expression context,
6366 then we *could* get the right answer by computing the value at runtime.
6367 If we are in an integral constant expression context, then we might
6368 could accept any constant expression; hard to say without analysis.
6369 Rather than open the barn door too wide right away, allow only integer
6370 constant expressions here. */
6373 else
6374 {
6376 {
6383 {
6385 "braced list index is not allowed with array "
6389 }
6390 }
6392 {
6393 /* Here are have these two options:
6394 ARRAY[EXP : EXP] - Array notation expr with default
6395 stride of 1.
6396 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6397 stride. */
6399 postfix_expression);
6402 }
6403 else
6405 }
6409 /* Look for the closing `]'. */
6412 /* Build the ARRAY_REF. */
6416 /* When not doing offsetof, array references are not permitted in
6417 constant-expressions. */
6423 }
6425 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6426 by cp_parser_builtin_offsetof. We're looking for
6428 postfix-expression . template [opt] id-expression
6429 postfix-expression . pseudo-destructor-name
6430 postfix-expression -> template [opt] id-expression
6431 postfix-expression -> pseudo-destructor-name
6433 FOR_OFFSETOF is set if we're being called in that context. That sorta
6434 limits what of the above we'll actually accept, but nevermind.
6435 TOKEN_TYPE is the "." or "->" token, which will already have been
6436 removed from the stream. */
6438 static tree
6441 tree postfix_expression,
6443 location_t location)
6444 {
6445 tree name;
6450 /* If this is a `->' operator, dereference the pointer. */
6453 tf_warning_or_error);
6454 /* Check to see whether or not the expression is type-dependent. */
6456 /* The identifier following the `->' or `.' is not qualified. */
6462 /* Enter the scope corresponding to the type of the object
6463 given by the POSTFIX_EXPRESSION. */
6465 {
6467 /* According to the standard, no expression should ever have
6468 reference type. Unfortunately, we do not currently match
6469 the standard in this respect in that our internal representation
6470 of an expression may have reference type even when the standard
6471 says it does not. Therefore, we have to manually obtain the
6472 underlying type here. */
6474 /* The type of the POSTFIX_EXPRESSION must be complete. */
6476 {
6478 postfix_expression);
6480 }
6481 /* Unlike the object expression in other contexts, *this is not
6482 required to be of complete type for purposes of class member
6483 access (5.2.5) outside the member function body. */
6487 /* Let the name lookup machinery know that we are processing a
6488 class member access expression. */
6490 /* If something went wrong, we want to be able to discern that case,
6491 as opposed to the case where there was no SCOPE due to the type
6492 of expression being dependent. */
6495 /* If the SCOPE was erroneous, make the various semantic analysis
6496 functions exit quickly -- and without issuing additional error
6497 messages. */
6500 }
6502 /* Assume this expression is not a pseudo-destructor access. */
6505 /* If the SCOPE is a scalar type, then, if this is a valid program,
6506 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6507 is type dependent, it can be pseudo-destructor-name or something else.
6508 Try to parse it as pseudo-destructor-name first. */
6510 {
6511 tree s;
6512 tree type;
6515 /* Parse the pseudo-destructor-name. */
6524 {
6526 postfix_expression
6529 }
6530 }
6533 {
6534 /* If the SCOPE is not a scalar type, we are looking at an
6535 ordinary class member access expression, rather than a
6536 pseudo-destructor-name. */
6539 /* Parse the id-expression. */
6540 name = (cp_parser_id_expression
6547 /* In general, build a SCOPE_REF if the member name is qualified.
6548 However, if the name was not dependent and has already been
6549 resolved; there is no need to build the SCOPE_REF. For example;
6551 struct X { void f(); };
6552 template <typename T> void f(T* t) { t->X::f(); }
6554 Even though "t" is dependent, "X::f" is not and has been resolved
6555 to a BASELINK; there is no need to include scope information. */
6557 /* But we do need to remember that there was an explicit scope for
6558 virtual function calls. */
6562 /* If the name is a template-id that names a type, we will get a
6563 TYPE_DECL here. That is invalid code. */
6565 {
6568 }
6569 else
6570 {
6572 {
6574 {
6578 }
6579 else
6582 name,
6583 template_p);
6587 }
6589 adjust_result_of_qualified_name_lookup
6591 postfix_expression
6593 template_p,
6594 tf_warning_or_error);
6595 }
6596 }
6598 /* We no longer need to look up names in the scope of the object on
6599 the left-hand side of the `.' or `->' operator. */
6602 /* Outside of offsetof, these operators may not appear in
6603 constant-expressions. */
6605 && (cp_parser_non_integral_constant_expression
6610 }
6612 /* Parse a parenthesized expression-list.
6614 expression-list:
6615 assignment-expression
6616 expression-list, assignment-expression
6618 attribute-list:
6619 expression-list
6620 identifier
6621 identifier, expression-list
6623 CAST_P is true if this expression is the target of a cast.
6625 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6626 argument pack.
6628 Returns a vector of trees. Each element is a representation of an
6629 assignment-expression. NULL is returned if the ( and or ) are
6630 missing. An empty, but allocated, vector is returned on no
6631 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6632 if we are parsing an attribute list for an attribute that wants a
6633 plain identifier argument, normal_attr for an attribute that wants
6634 an expression, or non_attr if we aren't parsing an attribute list. If
6635 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6636 not all of the expressions in the list were constant. */
6644 {
6650 /* Assume all the expressions will be constant. */
6659 /* Within a parenthesized expression, a `>' token is always
6660 the greater-than operator. */
6661 saved_greater_than_is_operator_p
6665 /* Consume expressions until there are no more. */
6668 {
6669 tree expr;
6671 /* At the beginning of attribute lists, check to see if the
6672 next token is an identifier. */
6675 {
6678 /* Consume the identifier. */
6680 /* Save the identifier. */
6682 }
6683 else
6684 {
6687 /* Parse the next assignment-expression. */
6689 {
6690 /* A braced-init-list. */
6696 }
6698 {
6699 expr = (cp_parser_constant_expression
6704 }
6705 else
6711 /* If we have an ellipsis, then this is an expression
6712 expansion. */
6715 {
6716 /* Consume the `...'. */
6719 /* Build the argument pack. */
6721 }
6723 /* Add it to the list. We add error_mark_node
6724 expressions to the list, so that we can still tell if
6725 the correct form for a parenthesized expression-list
6726 is found. That gives better errors. */
6731 }
6733 /* After the first item, attribute lists look the same as
6734 expression lists. */
6737 get_comma:;
6738 /* If the next token isn't a `,', then we are done. */
6742 /* Otherwise, consume the `,' and keep going. */
6744 }
6747 {
6750 skip_comma:;
6751 /* We try and resync to an unnested comma, as that will give the
6752 user better diagnostics. */
6760 {
6761 parser->greater_than_is_operator_p
6764 }
6765 }
6767 parser->greater_than_is_operator_p
6774 }
6776 /* Parse a pseudo-destructor-name.
6778 pseudo-destructor-name:
6779 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6780 :: [opt] nested-name-specifier template template-id :: ~ type-name
6781 :: [opt] nested-name-specifier [opt] ~ type-name
6783 If either of the first two productions is used, sets *SCOPE to the
6784 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6785 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6786 or ERROR_MARK_NODE if the parse fails. */
6788 static void
6790 tree object,
6793 {
6796 /* Handle ~auto. */
6800 {
6803 "%<~auto%> only available with "
6810 }
6812 /* Assume that things will not work out. */
6815 /* Look for the optional `::' operator. */
6817 /* Look for the optional nested-name-specifier. */
6818 nested_name_specifier_p
6825 /* Now, if we saw a nested-name-specifier, we might be doing the
6826 second production. */
6829 {
6830 /* Consume the `template' keyword. */
6832 /* Parse the template-id. */
6836 class_type,
6838 /* Look for the `::' token. */
6840 }
6841 /* If the next token is not a `~', then there might be some
6842 additional qualification. */
6844 {
6845 /* At this point, we're looking for "type-name :: ~". The type-name
6846 must not be a class-name, since this is a pseudo-destructor. So,
6847 it must be either an enum-name, or a typedef-name -- both of which
6848 are just identifiers. So, we peek ahead to check that the "::"
6849 and "~" tokens are present; if they are not, then we can avoid
6850 calling type_name. */
6854 {
6857 }
6859 /* Look for the type-name. */
6864 /* Look for the `::' token. */
6866 }
6867 else
6870 /* Look for the `~'. */
6873 /* Once we see the ~, this has to be a pseudo-destructor. */
6877 /* Look for the type-name again. We are not responsible for
6878 checking that it matches the first type-name. */
6880 }
6882 /* Parse a unary-expression.
6884 unary-expression:
6885 postfix-expression
6886 ++ cast-expression
6887 -- cast-expression
6888 unary-operator cast-expression
6889 sizeof unary-expression
6890 sizeof ( type-id )
6891 alignof ( type-id ) [C++0x]
6892 new-expression
6893 delete-expression
6895 GNU Extensions:
6897 unary-expression:
6898 __extension__ cast-expression
6899 __alignof__ unary-expression
6900 __alignof__ ( type-id )
6901 alignof unary-expression [C++0x]
6902 __real__ cast-expression
6903 __imag__ cast-expression
6904 && identifier
6905 sizeof ( type-id ) { initializer-list , [opt] }
6906 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6907 __alignof__ ( type-id ) { initializer-list , [opt] }
6909 ADDRESS_P is true iff the unary-expression is appearing as the
6910 operand of the `&' operator. CAST_P is true if this expression is
6911 the target of a cast.
6913 Returns a representation of the expression. */
6915 static tree
6918 {
6922 /* Peek at the next token. */
6924 /* Some keywords give away the kind of expression. */
6926 {
6930 {
6933 {
6936 location_t first_loc;
6939 /* Consume the token. */
6942 /* Parse the operand. */
6947 else
6948 {
6949 /* ISO C++ defines alignof only with types, not with
6950 expressions. So pedwarn if alignof is used with a non-
6951 type expression. However, __alignof__ is ok. */
6954 "ISO C++ does not allow %<alignof%> "
6958 }
6959 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6960 SIZEOF_EXPR with the original operand. */
6962 {
6964 {
6966 {
6969 error_mark_node));
6971 }
6972 else
6976 }
6978 }
6980 }
6989 {
6990 /* The saved value of the PEDANTIC flag. */
6992 tree expr;
6994 /* Save away the PEDANTIC flag. */
6996 /* Parse the cast-expression. */
6998 /* Restore the PEDANTIC flag. */
7002 }
7006 {
7007 tree expression;
7009 /* Consume the `__real__' or `__imag__' token. */
7011 /* Parse the cast-expression. */
7013 /* Create the complete representation. */
7017 expression,
7018 tf_warning_or_error);
7019 }
7027 {
7028 tree expr;
7038 parser->type_definition_forbidden_message
7041 saved_integral_constant_expression_p
7043 saved_non_integral_constant_expression_p
7047 saved_greater_than_is_operator_p
7057 parser->greater_than_is_operator_p
7060 parser->integral_constant_expression_p
7062 parser->non_integral_constant_expression_p
7069 }
7073 }
7074 }
7076 /* Look for the `:: new' and `:: delete', which also signal the
7077 beginning of a new-expression, or delete-expression,
7078 respectively. If the next token is `::', then it might be one of
7079 these. */
7081 {
7084 /* See if the token after the `::' is one of the keywords in
7085 which we're interested. */
7087 /* If it's `new', we have a new-expression. */
7090 /* Similarly, for `delete'. */
7093 }
7095 /* Look for a unary operator. */
7097 /* The `++' and `--' operators can be handled similarly, even though
7098 they are not technically unary-operators in the grammar. */
7100 {
7105 /* Handle the GNU address-of-label extension. */
7108 {
7109 tree identifier;
7110 tree expression;
7113 /* Consume the '&&' token. */
7115 /* Look for the identifier. */
7117 /* Create an expression representing the address. */
7120 NIC_ADDR_LABEL))
7123 }
7124 }
7126 {
7127 tree cast_expression;
7133 /* Consume the operator token. */
7135 /* Parse the cast-expression. */
7136 cast_expression
7141 pidk);
7142 /* Now, build an appropriate representation. */
7144 {
7148 RO_UNARY_STAR,
7149 complain);
7154 /* Fall through. */
7157 cast_expression,
7158 complain);
7165 /* Fall through. */
7175 }
7179 non_constant_p))
7183 }
7187 decltype_p,
7188 pidk);
7189 }
7194 {
7197 }
7199 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7200 unary-operator, the corresponding tree code is returned. */
7202 static enum tree_code
7204 {
7206 {
7227 }
7228 }
7230 /* Parse a new-expression.
7232 new-expression:
7233 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7234 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7236 Returns a representation of the expression. */
7238 static tree
7240 {
7243 tree type;
7246 tree ret;
7248 /* Look for the optional `::' operator. */
7249 global_scope_p
7253 /* Look for the `new' operator. */
7255 /* There's no easy way to tell a new-placement from the
7256 `( type-id )' construct. */
7258 /* Look for a new-placement. */
7260 /* If that didn't work out, there's no new-placement. */
7262 {
7266 }
7268 /* If the next token is a `(', then we have a parenthesized
7269 type-id. */
7271 {
7275 /* Consume the `('. */
7278 /* Parse the type-id. */
7279 parser->type_definition_forbidden_message
7284 /* Look for the closing `)'. */
7287 /* There should not be a direct-new-declarator in this production,
7288 but GCC used to allowed this, so we check and emit a sensible error
7289 message for this case. */
7291 {
7297 }
7298 }
7299 /* Otherwise, there must be a new-type-id. */
7300 else
7303 /* If the next token is a `(' or '{', then we have a new-initializer. */
7307 else
7310 /* A new-expression may not appear in an integral constant
7311 expression. */
7314 else
7315 {
7316 /* Create a representation of the new-expression. */
7318 tf_warning_or_error);
7319 }
7327 }
7329 /* Parse a new-placement.
7331 new-placement:
7332 ( expression-list )
7334 Returns the same representation as for an expression-list. */
7338 {
7341 /* Parse the expression-list. */
7342 expression_list = (cp_parser_parenthesized_expression_list
7348 }
7350 /* Parse a new-type-id.
7352 new-type-id:
7353 type-specifier-seq new-declarator [opt]
7355 Returns the TYPE allocated. If the new-type-id indicates an array
7356 type, *NELTS is set to the number of elements in the last array
7357 bound; the TYPE will not include the last array bound. */
7359 static tree
7361 {
7362 cp_decl_specifier_seq type_specifier_seq;
7368 /* The type-specifier sequence must not contain type definitions.
7369 (It cannot contain declarations of new types either, but if they
7370 are not definitions we will catch that because they are not
7371 complete.) */
7373 parser->type_definition_forbidden_message
7375 /* Parse the type-specifier-seq. */
7379 /* Restore the old message. */
7385 /* Parse the new-declarator. */
7388 /* Determine the number of elements in the last array dimension, if
7389 any. */
7391 /* Skip down to the last array dimension. */
7396 {
7399 }
7404 {
7407 }
7410 {
7417 else
7419 }
7422 }
7424 /* Parse an (optional) new-declarator.
7426 new-declarator:
7427 ptr-operator new-declarator [opt]
7428 direct-new-declarator
7430 Returns the declarator. */
7434 {
7437 cp_cv_quals cv_quals;
7439 /* We don't know if there's a ptr-operator next, or not. */
7441 /* Look for a ptr-operator. */
7443 /* If that worked, look for more new-declarators. */
7445 {
7448 /* Parse another optional declarator. */
7451 declarator = cp_parser_make_indirect_declarator
7455 }
7457 /* If the next token is a `[', there is a direct-new-declarator. */
7462 }
7464 /* Parse a direct-new-declarator.
7466 direct-new-declarator:
7467 [ expression ]
7468 direct-new-declarator [constant-expression]
7470 */
7474 {
7478 {
7479 tree expression;
7482 /* Look for the opening `['. */
7487 /* The standard requires that the expression have integral
7488 type. DR 74 adds enumeration types. We believe that the
7489 real intent is that these expressions be handled like the
7490 expression in a `switch' condition, which also allows
7491 classes with a single conversion to integral or
7492 enumeration type. */
7494 {
7495 expression
7497 expression,
7500 {
7502 "expression in new-declarator must have integral "
7505 }
7506 }
7508 /* Look for the closing `]'. */
7511 /* Add this bound to the declarator. */
7514 /* If the next token is not a `[', then there are no more
7515 bounds. */
7518 }
7521 }
7523 /* Parse a new-initializer.
7525 new-initializer:
7526 ( expression-list [opt] )
7527 braced-init-list
7529 Returns a representation of the expression-list. */
7533 {
7537 {
7538 tree t;
7545 }
7546 else
7547 expression_list = (cp_parser_parenthesized_expression_list
7553 }
7555 /* Parse a delete-expression.
7557 delete-expression:
7558 :: [opt] delete cast-expression
7559 :: [opt] delete [ ] cast-expression
7561 Returns a representation of the expression. */
7563 static tree
7565 {
7568 tree expression;
7570 /* Look for the optional `::' operator. */
7571 global_scope_p
7575 /* Look for the `delete' keyword. */
7577 /* See if the array syntax is in use. */
7579 {
7580 /* Consume the `[' token. */
7582 /* Look for the `]' token. */
7584 /* Remember that this is the `[]' construct. */
7586 }
7587 else
7590 /* Parse the cast-expression. */
7593 /* A delete-expression may not appear in an integral constant
7594 expression. */
7599 tf_warning_or_error);
7600 }
7602 /* Returns true if TOKEN may start a cast-expression and false
7603 otherwise. */
7605 static bool
7607 {
7610 {
7651 /* In ((type ()) () the last () isn't a valid cast-expression,
7652 so the whole must be parsed as postfix-expression. */
7656 /* '[' may start a primary-expression in obj-c++. */
7662 }
7663 }
7665 /* Parse a cast-expression.
7667 cast-expression:
7668 unary-expression
7669 ( type-id ) cast-expression
7671 ADDRESS_P is true iff the unary-expression is appearing as the
7672 operand of the `&' operator. CAST_P is true if this expression is
7673 the target of a cast.
7675 Returns a representation of the expression. */
7677 static tree
7680 {
7681 /* If it's a `(', then we might be looking at a cast. */
7683 {
7689 /* There's no way to know yet whether or not this is a cast.
7690 For example, `(int (3))' is a unary-expression, while `(int)
7691 3' is a cast. So, we resort to parsing tentatively. */
7693 /* Types may not be defined in a cast. */
7695 parser->type_definition_forbidden_message
7697 /* Consume the `('. */
7699 /* A very tricky bit is that `(struct S) { 3 }' is a
7700 compound-literal (which we permit in C++ as an extension).
7701 But, that construct is not a cast-expression -- it is a
7702 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7703 is legal; if the compound-literal were a cast-expression,
7704 you'd need an extra set of parentheses.) But, if we parse
7705 the type-id, and it happens to be a class-specifier, then we
7706 will commit to the parse at that point, because we cannot
7707 undo the action that is done when creating a new class. So,
7708 then we cannot back up and do a postfix-expression.
7709 Another tricky case is the following (c++/29234):
7711 struct S { void operator () (); };
7713 void foo ()
7714 {
7715 ( S()() );
7716 }
7718 As a type-id we parse the parenthesized S()() as a function
7719 returning a function, groktypename complains and we cannot
7720 back up in this case either.
7722 Therefore, we scan ahead to the closing `)', and check to see
7723 if the tokens after the `)' can start a cast-expression. Otherwise
7724 we are dealing with an unary-expression, a postfix-expression
7725 or something else.
7727 Save tokens so that we can put them back. */
7730 /* We may be looking at a cast-expression. */
7731 cast_expression_p
7736 /* Roll back the tokens we skipped. */
7738 /* If we aren't looking at a cast-expression, simulate an error so
7739 that the call to cp_parser_parse_definitely below will fail. */
7742 else
7743 {
7746 /* Look for the type-id. */
7748 /* Look for the closing `)'. */
7751 }
7753 /* Restore the saved message. */
7756 /* At this point this can only be either a cast or a
7757 parenthesized ctor such as `(T ())' that looks like a cast to
7758 function returning T. */
7760 {
7766 pidk);
7768 /* Warn about old-style casts, if so requested. */
7775 /* Only type conversions to integral or enumeration types
7776 can be used in constant-expressions. */
7779 NIC_CAST))
7782 /* Perform the cast. */
7785 }
7786 else
7788 }
7790 /* If we get here, then it's not a cast, so it must be a
7791 unary-expression. */
7794 }
7796 /* Parse a binary expression of the general form:
7798 pm-expression:
7799 cast-expression
7800 pm-expression .* cast-expression
7801 pm-expression ->* cast-expression
7803 multiplicative-expression:
7804 pm-expression
7805 multiplicative-expression * pm-expression
7806 multiplicative-expression / pm-expression
7807 multiplicative-expression % pm-expression
7809 additive-expression:
7810 multiplicative-expression
7811 additive-expression + multiplicative-expression
7812 additive-expression - multiplicative-expression
7814 shift-expression:
7815 additive-expression
7816 shift-expression << additive-expression
7817 shift-expression >> additive-expression
7819 relational-expression:
7820 shift-expression
7821 relational-expression < shift-expression
7822 relational-expression > shift-expression
7823 relational-expression <= shift-expression
7824 relational-expression >= shift-expression
7826 GNU Extension:
7828 relational-expression:
7829 relational-expression <? shift-expression
7830 relational-expression >? shift-expression
7832 equality-expression:
7833 relational-expression
7834 equality-expression == relational-expression
7835 equality-expression != relational-expression
7837 and-expression:
7838 equality-expression
7839 and-expression & equality-expression
7841 exclusive-or-expression:
7842 and-expression
7843 exclusive-or-expression ^ and-expression
7845 inclusive-or-expression:
7846 exclusive-or-expression
7847 inclusive-or-expression | exclusive-or-expression
7849 logical-and-expression:
7850 inclusive-or-expression
7851 logical-and-expression && inclusive-or-expression
7853 logical-or-expression:
7854 logical-and-expression
7855 logical-or-expression || logical-and-expression
7857 All these are implemented with a single function like:
7859 binary-expression:
7860 simple-cast-expression
7861 binary-expression <token> binary-expression
7863 CAST_P is true if this expression is the target of a cast.
7865 The binops_by_token map is used to get the tree codes for each <token> type.
7866 binary-expressions are associated according to a precedence table. */
7868 #define TOKEN_PRECEDENCE(token) \
7869 (((token->type == CPP_GREATER \
7870 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7871 && !parser->greater_than_is_operator_p) \
7872 ? PREC_NOT_OPERATOR \
7873 : binops_by_token[token->type].prec)
7875 static tree
7881 {
7882 cp_parser_expression_stack stack;
7884 cp_parser_expression_stack_entry current;
7885 tree rhs;
7889 tree overload;
7891 /* Parse the first expression. */
7901 {
7902 /* Get an operator token. */
7908 {
7910 "%<>>%> operator is treated"
7914 }
7918 /* Popping an entry off the stack means we completed a subexpression:
7919 - either we found a token which is not an operator (`>' where it is not
7920 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7921 will happen repeatedly;
7922 - or, we found an operator which has lower priority. This is the case
7923 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7924 parsing `3 * 4'. */
7926 {
7929 else
7931 }
7933 get_rhs:
7937 /* We used the operator token. */
7940 /* For "false && x" or "true || x", x will never be executed;
7941 disable warnings while evaluating it. */
7947 /* Extract another operand. It may be the RHS of this expression
7948 or the LHS of a new, higher priority expression. */
7952 /* Get another operator token. Look up its precedence to avoid
7953 building a useless (immediately popped) stack entry for common
7954 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7958 {
7959 /* ... and prepare to parse the RHS of the new, higher priority
7960 expression. Since precedence levels on the stack are
7961 monotonically increasing, we do not have to care about
7962 stack overflows. */
7971 pop:
7973 /* If the stack is not empty, we have parsed into LHS the right side
7974 (`4' in the example above) of an expression we had suspended.
7975 We can use the information on the stack to recover the LHS (`3')
7976 from the stack together with the tree code (`MULT_EXPR'), and
7977 the precedence of the higher level subexpression
7978 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7979 which will be used to actually build the additive expression. */
7984 }
7986 /* Undo the disabling of warnings done above. */
7993 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7994 ERROR_MARK for everything that is not a binary expression.
7995 This makes warn_about_parentheses miss some warnings that
7996 involve unary operators. For unary expressions we should
7997 pass the correct tree_code unless the unary expression was
7998 surrounded by parentheses.
7999 */
8005 == tcc_comparison
8008 else
8017 /* If the binary operator required the use of an overloaded operator,
8018 then this expression cannot be an integral constant-expression.
8019 An overloaded operator can be used even if both operands are
8020 otherwise permissible in an integral constant-expression if at
8021 least one of the operands is of enumeration type. */
8025 NIC_OVERLOADED))
8027 }
8030 }
8032 static tree
8037 {
8040 }
8042 /* Parse the `? expression : assignment-expression' part of a
8043 conditional-expression. The LOGICAL_OR_EXPR is the
8044 logical-or-expression that started the conditional-expression.
8045 Returns a representation of the entire conditional-expression.
8047 This routine is used by cp_parser_assignment_expression.
8049 ? expression : assignment-expression
8051 GNU Extensions:
8053 ? : assignment-expression */
8055 static tree
8057 {
8058 tree expr;
8059 tree assignment_expr;
8063 /* Consume the `?' token. */
8068 {
8071 /* Implicit true clause. */
8075 }
8076 else
8077 {
8080 /* Parse the expression. */
8083 c_inhibit_evaluation_warnings +=
8087 }
8089 /* The next token should be a `:'. */
8091 /* Parse the assignment-expression. */
8095 /* Build the conditional-expression. */
8097 expr,
8098 assignment_expr,
8099 tf_warning_or_error);
8100 }
8102 /* Parse an assignment-expression.
8104 assignment-expression:
8105 conditional-expression
8106 logical-or-expression assignment-operator assignment_expression
8107 throw-expression
8109 CAST_P is true if this expression is the target of a cast.
8110 DECLTYPE_P is true if this expression is the operand of decltype.
8112 Returns a representation for the expression. */
8114 static tree
8117 {
8118 tree expr;
8120 /* If the next token is the `throw' keyword, then we're looking at
8121 a throw-expression. */
8124 /* Otherwise, it must be that we are looking at a
8125 logical-or-expression. */
8126 else
8127 {
8128 /* Parse the binary expressions (logical-or-expression). */
8130 decltype_p,
8132 /* If the next token is a `?' then we're actually looking at a
8133 conditional-expression. */
8136 else
8137 {
8140 /* If it's an assignment-operator, we're using the second
8141 production. */
8142 enum tree_code assignment_operator
8145 {
8147 location_t saved_input_location;
8149 /* Parse the right-hand side of the assignment. */
8155 /* An assignment may not appear in a
8156 constant-expression. */
8158 NIC_ASSIGNMENT))
8160 /* Build the assignment expression. Its default
8161 location is the location of the '=' token. */
8165 assignment_operator,
8166 rhs,
8169 }
8170 }
8171 }
8174 }
8176 static tree
8179 {
8182 }
8184 /* Parse an (optional) assignment-operator.
8186 assignment-operator: one of
8187 = *= /= %= += -= >>= <<= &= ^= |=
8189 GNU Extension:
8191 assignment-operator: one of
8192 <?= >?=
8194 If the next token is an assignment operator, the corresponding tree
8195 code is returned, and the token is consumed. For example, for
8196 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8197 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8198 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8199 operator, ERROR_MARK is returned. */
8201 static enum tree_code
8203 {
8207 /* Peek at the next token. */
8211 {
8257 /* Nothing else is an assignment operator. */
8259 }
8261 /* If it was an assignment operator, consume it. */
8266 }
8268 /* Parse an expression.
8270 expression:
8271 assignment-expression
8272 expression , assignment-expression
8274 CAST_P is true if this expression is the target of a cast.
8275 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8276 except possibly parenthesized or on the RHS of a comma (N3276).
8278 Returns a representation of the expression. */
8280 static tree
8283 {
8288 {
8289 tree assignment_expression;
8291 /* Parse the next assignment-expression. */
8292 assignment_expression
8295 /* We don't create a temporary for a call that is the immediate operand
8296 of decltype or on the RHS of a comma. But when we see a comma, we
8297 need to create a temporary for a call on the LHS. */
8302 assignment_expression
8306 /* If this is the first assignment-expression, we can just
8307 save it away. */
8310 else
8312 assignment_expression,
8314 /* If the next token is not a comma, then we are done with the
8315 expression. */
8318 /* Consume the `,'. */
8321 /* A comma operator cannot appear in a constant-expression. */
8324 }
8327 }
8331 {
8333 }
8335 /* Parse a constant-expression.
8337 constant-expression:
8338 conditional-expression
8340 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8341 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8342 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8343 is false, NON_CONSTANT_P should be NULL. */
8345 static tree
8349 {
8353 tree expression;
8355 /* It might seem that we could simply parse the
8356 conditional-expression, and then check to see if it were
8357 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8358 one that the compiler can figure out is constant, possibly after
8359 doing some simplifications or optimizations. The standard has a
8360 precise definition of constant-expression, and we must honor
8361 that, even though it is somewhat more restrictive.
8363 For example:
8365 int i[(2, 3)];
8367 is not a legal declaration, because `(2, 3)' is not a
8368 constant-expression. The `,' operator is forbidden in a
8369 constant-expression. However, GCC's constant-folding machinery
8370 will fold this operation to an INTEGER_CST for `3'. */
8372 /* Save the old settings. */
8374 saved_allow_non_integral_constant_expression_p
8377 /* We are now parsing a constant-expression. */
8379 parser->allow_non_integral_constant_expression_p
8382 /* Although the grammar says "conditional-expression", we parse an
8383 "assignment-expression", which also permits "throw-expression"
8384 and the use of assignment operators. In the case that
8385 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8386 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8387 actually essential that we look for an assignment-expression.
8388 For example, cp_parser_initializer_clauses uses this function to
8389 determine whether a particular assignment-expression is in fact
8390 constant. */
8392 /* Restore the old settings. */
8393 parser->integral_constant_expression_p
8395 parser->allow_non_integral_constant_expression_p
8398 {
8399 /* Require an rvalue constant expression here; that's what our
8400 callers expect. Reference constant expressions are handled
8401 separately in e.g. cp_parser_template_argument. */
8406 }
8409 parser->non_integral_constant_expression_p
8413 }
8415 /* Parse __builtin_offsetof.
8417 offsetof-expression:
8418 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8420 offsetof-member-designator:
8421 id-expression
8422 | offsetof-member-designator "." id-expression
8423 | offsetof-member-designator "[" expression "]"
8424 | offsetof-member-designator "->" id-expression */
8426 static tree
8428 {
8431 cp_id_kind dummy;
8434 /* We're about to accept non-integral-constant things, but will
8435 definitely yield an integral constant expression. Save and
8436 restore these values around our local parsing. */
8440 /* Consume the "__builtin_offsetof" token. */
8442 /* Consume the opening `('. */
8444 /* Parse the type-id. */
8446 /* Look for the `,'. */
8450 /* Build the (type *)null that begins the traditional offsetof macro. */
8452 tf_warning_or_error);
8454 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8458 {
8461 {
8463 /* offsetof-member-designator "[" expression "]" */
8469 /* offsetof-member-designator "->" identifier */
8472 /* FALLTHRU */
8475 /* offsetof-member-designator "." identifier */
8483 /* Consume the ")" token. */
8488 /* Error. We know the following require will fail, but
8489 that gives the proper error message. */
8494 }
8495 }
8497 success:
8498 /* If we're processing a template, we can't finish the semantics yet.
8499 Otherwise we can fold the entire expression now. */
8502 else
8505 failure:
8510 }
8512 /* Parse a trait expression.
8514 Returns a representation of the expression, the underlying type
8515 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8517 static tree
8519 {
8520 cp_trait_kind kind;
8523 cp_decl_specifier_seq decl_specs;
8526 {
8603 }
8605 /* Consume the token. */
8615 /* Build a trivial decl-specifier-seq. */
8619 /* Call grokdeclarator to figure out what type this is. */
8624 {
8632 /* Build a trivial decl-specifier-seq. */
8636 /* Call grokdeclarator to figure out what type this is. */
8639 }
8643 /* Complete the trait expression, which may mean either processing
8644 the trait expr now or saving it for template instantiation. */
8646 {
8655 }
8656 }
8658 /* Lambdas that appear in variable initializer or default argument scope
8659 get that in their mangling, so we need to record it. We might as well
8660 use the count for function and namespace scopes as well. */
8664 {
8665 tree t;
8670 static void
8672 {
8673 tree_int ti;
8675 /* Once we're inside a function, we ignore other scopes and just push
8676 the function again so that popping works properly. */
8683 {
8684 /* Don't reset the count if we're still in the same function. */
8687 }
8688 }
8690 static void
8692 {
8695 }
8697 static void
8699 {
8702 {
8705 }
8707 }
8709 /* Parse a lambda expression.
8711 lambda-expression:
8712 lambda-introducer lambda-declarator [opt] compound-statement
8714 Returns a representation of the expression. */
8716 static tree
8718 {
8720 tree type;
8727 {
8729 {
8733 }
8735 }
8737 /* We may be in the middle of deferred access check. Disable
8738 it now. */
8749 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8752 /* Now that we've started the type, add the capture fields for any
8753 explicit captures. */
8756 {
8757 /* Inside the class, surrounding template-parameter-lists do not apply. */
8758 unsigned int saved_num_template_parameter_lists
8762 bool fully_implicit_function_template_p
8766 bool auto_is_implicit_function_template_parm_p
8777 /* By virtue of defining a local class, a lambda expression has access to
8778 the private variables of enclosing classes. */
8785 {
8788 }
8790 /* The capture list was built up in reverse order; fix that now. */
8802 parser->fully_implicit_function_template_p
8806 parser->auto_is_implicit_function_template_parm_p
8808 }
8812 /* This field is only used during parsing of the lambda. */
8815 /* This lambda shouldn't have any proxies left at this point. */
8817 /* And now that we're done, push proxies for an enclosing lambda. */
8822 else
8824 }
8826 /* Parse the beginning of a lambda expression.
8828 lambda-introducer:
8829 [ lambda-capture [opt] ]
8831 LAMBDA_EXPR is the current representation of the lambda expression. */
8833 static void
8835 {
8836 /* Need commas after the first capture. */
8839 /* Eat the leading `['. */
8842 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8850 {
8853 }
8856 {
8858 tree capture_id;
8859 tree capture_init_expr;
8863 enum capture_kind_type
8864 {
8865 BY_COPY,
8866 BY_REFERENCE
8867 };
8871 {
8874 }
8878 else
8881 /* Possibly capture `this'. */
8883 {
8893 explicit_init_p);
8895 }
8897 /* Remember whether we want to capture as a reference or not. */
8899 {
8902 }
8904 /* Get the identifier. */
8909 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8910 delimiters, but I modified this to stop on unnested ']' as well. It
8911 was already changed to stop on unnested '}', so the
8912 "closing_parenthesis" name is no more misleading with my change. */
8913 {
8919 }
8921 /* Find the initializer for this capture. */
8925 {
8927 /* An explicit initializer exists. */
8930 "lambda capture initializers "
8936 {
8939 }
8940 }
8941 else
8942 {
8945 /* Turn the identifier into an id-expression. */
8946 capture_init_expr
8951 {
8954 }
8958 {
8961 capture_init_expr);
8964 }
8967 {
8970 capture_init_expr))
8973 }
8975 capture_init_expr
8976 = finish_id_expression
8978 capture_init_expr,
8992 {
8995 }
8996 else
8998 }
9002 {
9007 capture_id);
9011 "capture of %qD redundant with by-reference capture "
9013 }
9016 capture_id,
9017 capture_init_expr,
9019 explicit_init_p);
9020 }
9023 }
9025 /* Parse the (optional) middle of a lambda expression.
9027 lambda-declarator:
9028 < template-parameter-list [opt] >
9029 ( parameter-declaration-clause [opt] )
9030 attribute-specifier [opt]
9031 mutable [opt]
9032 exception-specification [opt]
9033 lambda-return-type-clause [opt]
9035 LAMBDA_EXPR is the current representation of the lambda expression. */
9037 static bool
9039 {
9040 /* 5.1.1.4 of the standard says:
9041 If a lambda-expression does not include a lambda-declarator, it is as if
9042 the lambda-declarator were ().
9043 This means an empty parameter list, no attributes, and no exception
9044 specification. */
9050 /* The template-parameter-list is optional, but must begin with
9051 an opening angle if present. */
9053 {
9056 "lambda templates are only available with "
9065 /* We just processed one more parameter list. */
9067 }
9069 /* The parameter-declaration-clause is optional (unless
9070 template-parameter-list was given), but must begin with an
9071 opening parenthesis if present. */
9073 {
9078 /* Parse parameters. */
9081 /* Default arguments shall not be specified in the
9082 parameter-declaration-clause of a lambda-declarator. */
9092 /* Parse optional `mutable' keyword. */
9094 {
9097 }
9099 /* Parse optional exception specification. */
9102 /* Parse optional trailing return type. */
9104 {
9108 }
9110 /* The function parameters must be in scope all the way until after the
9111 trailing-return-type in case of decltype. */
9113 }
9117 /* Create the function call operator.
9119 Messing with declarators like this is no uglier than building up the
9120 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9121 other code. */
9122 {
9123 cp_decl_specifier_seq return_type_specs;
9125 tree fco;
9132 else
9133 /* Maybe we will deduce the return type later. */
9139 sfk_none);
9144 VIRT_SPEC_UNSPECIFIED,
9145 REF_QUAL_NONE,
9146 exception_spec,
9151 declarator,
9152 attributes);
9154 {
9157 /* Give the object parameter a different name. */
9159 }
9161 {
9165 }
9174 }
9175 }
9177 /* Parse the body of a lambda expression, which is simply
9179 compound-statement
9181 but which requires special handling.
9182 LAMBDA_EXPR is the current representation of the lambda expression. */
9184 static void
9186 {
9191 else
9192 /* Still increment function_depth so that we don't GC in the
9193 middle of an expression. */
9195 /* Clear this in case we're in the middle of a default argument. */
9198 /* Finish the function call operator
9199 - class_specifier
9200 + late_parsing_for_member
9201 + function_definition_after_declarator
9202 + ctor_initializer_opt_and_function_body */
9203 {
9205 tree body;
9207 tree compound_stmt;
9208 tree cap;
9210 /* Let the front end know that we are going to be defining this
9211 function. */
9213 NULL_TREE,
9222 /* Push the proxies for any explicit captures. */
9229 /* 5.1.1.4 of the standard says:
9230 If a lambda-expression does not include a trailing-return-type, it
9231 is as if the trailing-return-type denotes the following type:
9232 * if the compound-statement is of the form
9233 { return attribute-specifier [opt] expression ; }
9234 the type of the returned expression after lvalue-to-rvalue
9235 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9236 (_conv.array_ 4.2), and function-to-pointer conversion
9237 (_conv.func_ 4.3);
9238 * otherwise, void. */
9240 /* In a lambda that has neither a lambda-return-type-clause
9241 nor a deducible form, errors should be reported for return statements
9242 in the body. Since we used void as the placeholder return type, parsing
9243 the body as usual will give such desired behavior. */
9247 {
9251 /* Parse tentatively in case there's more after the initial return
9252 statement. */
9263 {
9267 /* Will get error here if type not deduced yet. */
9271 }
9272 }
9275 {
9280 }
9284 out:
9288 /* Finish the function and generate code for it if necessary. */
9291 /* Only expand if the call op is not a template. */
9294 }
9299 else
9301 }
9303 /* Statements [gram.stmt.stmt] */
9305 /* Parse a statement.
9307 statement:
9308 labeled-statement
9309 expression-statement
9310 compound-statement
9311 selection-statement
9312 iteration-statement
9313 jump-statement
9314 declaration-statement
9315 try-block
9317 C++11:
9319 statement:
9320 labeled-statement
9321 attribute-specifier-seq (opt) expression-statement
9322 attribute-specifier-seq (opt) compound-statement
9323 attribute-specifier-seq (opt) selection-statement
9324 attribute-specifier-seq (opt) iteration-statement
9325 attribute-specifier-seq (opt) jump-statement
9326 declaration-statement
9327 attribute-specifier-seq (opt) try-block
9329 TM Extension:
9331 statement:
9332 atomic-statement
9334 IN_COMPOUND is true when the statement is nested inside a
9335 cp_parser_compound_statement; this matters for certain pragmas.
9337 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9338 is a (possibly labeled) if statement which is not enclosed in braces
9339 and has an else clause. This is used to implement -Wparentheses. */
9341 static void
9344 {
9349 restart:
9352 /* There is no statement yet. */
9358 /* In obj-c++, seeing '[[' might be the either the beginning of
9359 c++11 attributes, or a nested objc-message-expression. So
9360 let's parse the c++11 attributes tentatively. */
9364 {
9367 }
9369 /* Peek at the next token. */
9371 /* Remember the location of the first token in the statement. */
9373 /* If this is a keyword, then that will often determine what kind of
9374 statement we have. */
9376 {
9380 {
9383 /* Looks like a labeled-statement with a case label.
9384 Parse the label, and then use tail recursion to parse
9385 the statement. */
9407 /* Objective-C++ exception-handling constructs. */
9421 /* This must be a namespace alias definition. */
9434 /* It might be a keyword like `int' that can start a
9435 declaration-statement. */
9437 }
9438 }
9440 {
9441 /* If the next token is a `:', then we are looking at a
9442 labeled-statement. */
9445 {
9446 /* Looks like a labeled-statement with an ordinary label.
9447 Parse the label, and then use tail recursion to parse
9448 the statement. */
9452 }
9453 }
9454 /* Anything that starts with a `{' must be a compound-statement. */
9457 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9458 a statement all its own. */
9460 {
9461 /* Only certain OpenMP pragmas are attached to statements, and thus
9462 are considered statements themselves. All others are not. In
9463 the context of a compound, accept the pragma as a "statement" and
9464 return so that we can check for a close brace. Otherwise we
9465 require a real statement and must go back and read one. */
9471 }
9473 {
9476 }
9478 /* Everything else must be a declaration-statement or an
9479 expression-statement. Try for the declaration-statement
9480 first, unless we are looking at a `;', in which case we know that
9481 we have an expression-statement. */
9483 {
9485 {
9487 {
9488 /* Attributes should be parsed as part of the the
9489 declaration, so let's un-parse them. */
9492 }
9495 /* Try to parse the declaration-statement. */
9497 /* If that worked, we're done. */
9500 }
9501 /* Look for an expression-statement instead. */
9503 }
9505 /* Set the line number for the statement. */
9509 /* Note that for now, we don't do anything with c++11 statements
9510 parsed at this level. */
9513 OPT_Wattributes,
9515 }
9517 /* Parse the label for a labeled-statement, i.e.
9519 identifier :
9520 case constant-expression :
9521 default :
9523 GNU Extension:
9524 case constant-expression ... constant-expression : statement
9526 When a label is parsed without errors, the label is added to the
9527 parse tree by the finish_* functions, so this function doesn't
9528 have to return the label. */
9530 static void
9532 {
9537 /* The next token should be an identifier. */
9541 {
9544 }
9548 {
9550 {
9554 /* Consume the `case' token. */
9556 /* Parse the constant-expression. */
9559 NULL);
9563 {
9564 /* Consume the `...' token. */
9566 expr_hi =
9569 NULL);
9570 /* We don't need to emit warnings here, as the common code
9571 will do this for us. */
9572 }
9573 else
9578 else
9581 expr);
9582 }
9586 /* Consume the `default' token. */
9591 else
9596 /* Anything else must be an ordinary label. */
9599 }
9601 /* Require the `:' token. */
9604 /* An ordinary label may optionally be followed by attributes.
9605 However, this is only permitted if the attributes are then
9606 followed by a semicolon. This is because, for backward
9607 compatibility, when parsing
9608 lab: __attribute__ ((unused)) int i;
9609 we want the attribute to attach to "i", not "lab". */
9612 {
9613 tree attrs;
9620 ;
9621 else
9623 }
9629 }
9631 /* Parse an expression-statement.
9633 expression-statement:
9634 expression [opt] ;
9636 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9637 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9638 indicates whether this expression-statement is part of an
9639 expression statement. */
9641 static tree
9643 {
9647 /* If the next token is a ';', then there is no expression
9648 statement. */
9650 {
9654 {
9657 }
9658 }
9660 /* Give a helpful message for "A<T>::type t;" and the like. */
9663 {
9670 {
9671 /* A::A a; */
9676 }
9677 }
9679 /* Consume the final `;'. */
9684 /* This is the final expression statement of a statement
9685 expression. */
9691 }
9693 /* Parse a compound-statement.
9695 compound-statement:
9696 { statement-seq [opt] }
9698 GNU extension:
9700 compound-statement:
9701 { label-declaration-seq [opt] statement-seq [opt] }
9703 label-declaration-seq:
9704 label-declaration
9705 label-declaration-seq label-declaration
9707 Returns a tree representing the statement. */
9709 static tree
9712 {
9713 tree compound_stmt;
9715 /* Consume the `{'. */
9722 /* Begin the compound-statement. */
9724 /* If the next keyword is `__label__' we have a label declaration. */
9727 /* Parse an (optional) statement-seq. */
9729 /* Finish the compound-statement. */
9731 /* Consume the `}'. */
9735 }
9737 /* Parse an (optional) statement-seq.
9739 statement-seq:
9740 statement
9741 statement-seq [opt] statement */
9743 static void
9745 {
9746 /* Scan statements until there aren't any more. */
9748 {
9751 /* If we are looking at a `}', then we have run out of
9752 statements; the same is true if we have reached the end
9753 of file, or have stumbled upon a stray '@end'. */
9760 /* If we are in a compound statement and find 'else' then
9761 something went wrong. */
9763 {
9766 else
9767 {
9770 }
9771 }
9773 /* Parse the statement. */
9775 }
9776 }
9778 /* Parse a selection-statement.
9780 selection-statement:
9781 if ( condition ) statement
9782 if ( condition ) statement else statement
9783 switch ( condition ) statement
9785 Returns the new IF_STMT or SWITCH_STMT.
9787 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9788 is a (possibly labeled) if statement which is not enclosed in
9789 braces and has an else clause. This is used to implement
9790 -Wparentheses. */
9792 static tree
9794 {
9801 /* Peek at the next token. */
9804 /* See what kind of keyword it is. */
9807 {
9810 {
9811 tree statement;
9812 tree condition;
9814 /* Look for the `('. */
9816 {
9819 }
9821 /* Begin the selection-statement. */
9824 else
9827 /* Parse the condition. */
9829 /* Look for the `)'. */
9835 {
9839 /* Add the condition. */
9842 /* Parse the then-clause. */
9846 {
9854 }
9855 else
9861 /* If the next token is `else', parse the else-clause. */
9863 RID_ELSE))
9864 {
9865 /* Consume the `else' keyword. */
9868 /* Parse the else-clause. */
9870 {
9871 location_t loc;
9878 }
9879 else
9884 /* If we are currently parsing a then-clause, then
9885 IF_P will not be NULL. We set it to true to
9886 indicate that this if statement has an else clause.
9887 This may trigger the Wparentheses warning below
9888 when we get back up to the parent if statement. */
9891 }
9892 else
9893 {
9894 /* This if statement does not have an else clause. If
9895 NESTED_IF is true, then the then-clause is an if
9896 statement which does have an else clause. We warn
9897 about the potential ambiguity. */
9900 "suggest explicit braces to avoid ambiguous"
9902 }
9904 /* Now we're all done with the if-statement. */
9906 }
9907 else
9908 {
9912 /* Add the condition. */
9915 /* Parse the body of the switch-statement. */
9924 /* Now we're all done with the switch-statement. */
9926 }
9929 }
9935 }
9936 }
9938 /* Parse a condition.
9940 condition:
9941 expression
9942 type-specifier-seq declarator = initializer-clause
9943 type-specifier-seq declarator braced-init-list
9945 GNU Extension:
9947 condition:
9948 type-specifier-seq declarator asm-specification [opt]
9949 attributes [opt] = assignment-expression
9951 Returns the expression that should be tested. */
9953 static tree
9955 {
9956 cp_decl_specifier_seq type_specifiers;
9960 /* Try the declaration first. */
9962 /* New types are not allowed in the type-specifier-seq for a
9963 condition. */
9965 parser->type_definition_forbidden_message
9967 /* Parse the type-specifier-seq. */
9969 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9972 /* Restore the saved message. */
9974 /* If all is well, we might be looking at a declaration. */
9976 {
9977 tree decl;
9978 tree asm_specification;
9979 tree attributes;
9983 /* Parse the declarator. */
9988 /* Parse the attributes. */
9990 /* Parse the asm-specification. */
9992 /* If the next token is not an `=' or '{', then we might still be
9993 looking at an expression. For example:
9995 if (A(a).x)
9997 looks like a decl-specifier-seq and a declarator -- but then
9998 there is no `=', so this is an expression. */
10003 /* If we did see an `=' or '{', then we are looking at a declaration
10004 for sure. */
10006 {
10007 tree pushed_scope;
10011 /* Create the declaration. */
10017 /* Parse the initializer. */
10019 {
10023 }
10024 else
10025 {
10026 /* Consume the `='. */
10029 }
10033 /* Process the initializer. */
10036 asm_specification,
10037 flags);
10043 }
10044 }
10045 /* If we didn't even get past the declarator successfully, we are
10046 definitely not looking at a declaration. */
10047 else
10050 /* Otherwise, we are looking at an expression. */
10052 }
10054 /* Parses a for-statement or range-for-statement until the closing ')',
10055 not included. */
10057 static tree
10059 {
10063 /* Begin the for-statement. */
10066 /* Parse the initialization. */
10071 else
10073 }
10075 static tree
10077 {
10078 /* Normal for loop */
10081 tree stmt;
10084 /* The for-init-statement has already been parsed in
10085 cp_parser_for_init_statement, so no work is needed here. */
10088 /* If there's a condition, process it. */
10092 {
10096 }
10098 /* Look for the `;'. */
10101 /* If there's an expression, process it. */
10107 }
10109 /* Tries to parse a range-based for-statement:
10111 range-based-for:
10112 decl-specifier-seq declarator : expression
10114 The decl-specifier-seq declarator and the `:' are already parsed by
10115 cp_parser_for_init_statement. If processing_template_decl it returns a
10116 newly created RANGE_FOR_STMT; if not, it is converted to a
10117 regular FOR_STMT. */
10119 static tree
10122 {
10126 {
10129 }
10130 else
10133 /* If in template, STMT is converted to a normal for-statement
10134 at instantiation. If not, it is done just ahead. */
10136 {
10144 /* do_auto_deduction doesn't mess with template init-lists. */
10147 }
10148 else
10149 {
10152 }
10154 }
10156 /* Subroutine of cp_convert_range_for: given the initializer expression,
10157 builds up the range temporary. */
10159 static tree
10161 {
10164 /* Find out the type deduced by the declaration
10165 `auto &&__range = range_expr'. */
10170 /* Create the __range variable. */
10177 }
10179 /* Used by cp_parser_range_for in template context: we aren't going to
10180 do a full conversion yet, but we still need to resolve auto in the
10181 type of the for-range-declaration if present. This is basically
10182 a shortcut version of cp_convert_range_for. */
10184 static void
10186 {
10189 {
10192 iter_type = (cp_parser_perform_range_for_lookup
10195 {
10197 iter_type);
10199 tf_warning_or_error);
10202 }
10203 }
10204 }
10206 /* Converts a range-based for-statement into a normal
10207 for-statement, as per the definition.
10209 for (RANGE_DECL : RANGE_EXPR)
10210 BLOCK
10212 should be equivalent to:
10214 {
10215 auto &&__range = RANGE_EXPR;
10216 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10217 __begin != __end;
10218 ++__begin)
10219 {
10220 RANGE_DECL = *__begin;
10221 BLOCK
10222 }
10223 }
10225 If RANGE_EXPR is an array:
10226 BEGIN_EXPR = __range
10227 END_EXPR = __range + ARRAY_SIZE(__range)
10228 Else if RANGE_EXPR has a member 'begin' or 'end':
10229 BEGIN_EXPR = __range.begin()
10230 END_EXPR = __range.end()
10231 Else:
10232 BEGIN_EXPR = begin(__range)
10233 END_EXPR = end(__range);
10235 If __range has a member 'begin' but not 'end', or vice versa, we must
10236 still use the second alternative (it will surely fail, however).
10237 When calling begin()/end() in the third alternative we must use
10238 argument dependent lookup, but always considering 'std' as an associated
10239 namespace. */
10241 tree
10244 {
10250 /* If an error happened previously do nothing or else a lot of
10251 unhelpful errors would be issued. */
10253 else
10254 {
10255 tree range_temp;
10259 /* Can't bind a reference to an array of runtime bound. */
10261 else
10262 {
10267 LOOKUP_ONLYCONVERTING);
10269 }
10272 }
10274 /* The new for initialization statement. */
10282 LOOKUP_ONLYCONVERTING);
10291 LOOKUP_ONLYCONVERTING);
10295 /* The new for condition. */
10302 /* The new increment expression. */
10305 tf_warning_or_error);
10308 /* The declaration is initialized with *__begin inside the loop body. */
10311 tf_warning_or_error),
10313 LOOKUP_ONLYCONVERTING);
10316 }
10318 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10319 We need to solve both at the same time because the method used
10320 depends on the existence of members begin or end.
10321 Returns the type deduced for the iterator expression. */
10323 static tree
10325 {
10327 {
10330 }
10333 {
10338 }
10340 {
10341 /* If RANGE is an array, we will use pointer arithmetic. */
10344 range,
10348 }
10349 else
10350 {
10351 /* If it is not an array, we must do a bit of magic. */
10361 tf_warning_or_error);
10364 tf_warning_or_error);
10367 {
10368 /* Use the member functions. */
10371 else
10377 else
10380 }
10381 else
10382 {
10383 /* Use global functions with ADL. */
10390 tf_warning_or_error);
10392 tf_warning_or_error);
10394 tf_warning_or_error);
10396 tf_warning_or_error);
10399 }
10401 /* Last common checks. */
10403 {
10404 /* If one of the expressions is an error do no more checks. */
10407 }
10410 /* Can happen, when, eg, in a template context, Koenig lookup
10411 can't resolve begin/end (c++/58503). */
10413 else
10414 {
10416 /* The unqualified type of the __begin and __end temporaries should
10417 be the same, as required by the multiple auto declaration. */
10423 }
10424 }
10425 }
10427 /* Helper function for cp_parser_perform_range_for_lookup.
10428 Builds a tree for RANGE.IDENTIFIER(). */
10430 static tree
10432 {
10445 tf_warning_or_error);
10448 }
10450 /* Parse an iteration-statement.
10452 iteration-statement:
10453 while ( condition ) statement
10454 do statement while ( expression ) ;
10455 for ( for-init-statement condition [opt] ; expression [opt] )
10456 statement
10458 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10460 static tree
10462 {
10465 tree statement;
10468 /* Peek at the next token. */
10473 /* Remember whether or not we are already within an iteration
10474 statement. */
10477 /* See what kind of keyword it is. */
10480 {
10482 {
10483 tree condition;
10485 /* Begin the while-statement. */
10487 /* Look for the `('. */
10489 /* Parse the condition. */
10492 /* Look for the `)'. */
10494 /* Parse the dependent statement. */
10498 /* We're done with the while-statement. */
10500 }
10504 {
10505 tree expression;
10507 /* Begin the do-statement. */
10509 /* Parse the body of the do-statement. */
10514 /* Look for the `while' keyword. */
10516 /* Look for the `('. */
10518 /* Parse the expression. */
10520 /* We're done with the do-statement. */
10522 /* Look for the `)'. */
10524 /* Look for the `;'. */
10526 }
10530 {
10531 /* Look for the `('. */
10536 /* Look for the `)'. */
10539 /* Parse the body of the for-statement. */
10544 /* We're done with the for-statement. */
10546 }
10553 }
10556 }
10558 /* Parse a for-init-statement or the declarator of a range-based-for.
10559 Returns true if a range-based-for declaration is seen.
10561 for-init-statement:
10562 expression-statement
10563 simple-declaration */
10565 static bool
10567 {
10568 /* If the next token is a `;', then we have an empty
10569 expression-statement. Grammatically, this is also a
10570 simple-declaration, but an invalid one, because it does not
10571 declare anything. Therefore, if we did not handle this case
10572 specially, we would issue an error message about an invalid
10573 declaration. */
10575 {
10581 /* We're going to speculatively look for a declaration, falling back
10582 to an expression, if necessary. */
10584 /* Parse the declaration. */
10587 decl);
10590 {
10591 /* It is a range-for, consume the ':' */
10595 {
10597 "range-based %<for%> loops are not allowed "
10600 }
10601 }
10602 else
10603 /* The ';' is not consumed yet because we told
10604 cp_parser_simple_declaration not to. */
10609 /* If the tentative parse failed, then we shall need to look for an
10610 expression-statement. */
10611 }
10612 /* If we are here, it is an expression-statement. */
10615 }
10617 /* Parse a jump-statement.
10619 jump-statement:
10620 break ;
10621 continue ;
10622 return expression [opt] ;
10623 return braced-init-list ;
10624 goto identifier ;
10626 GNU extension:
10628 jump-statement:
10629 goto * expression ;
10631 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10633 static tree
10635 {
10641 /* Peek at the next token. */
10646 /* See what kind of keyword it is. */
10649 {
10653 {
10673 }
10679 {
10686 /* Fall through. */
10696 }
10701 {
10702 tree expr;
10706 {
10710 }
10713 else
10714 /* If the next token is a `;', then there is no
10715 expression. */
10717 /* Build the return-statement. */
10719 /* Look for the final `;'. */
10721 }
10725 /* Create the goto-statement. */
10727 {
10728 /* Issue a warning about this use of a GNU extension. */
10730 /* Consume the '*' token. */
10732 /* Parse the dependent expression. */
10734 }
10735 else
10737 /* Look for the final `;'. */
10744 }
10747 }
10749 /* Parse a declaration-statement.
10751 declaration-statement:
10752 block-declaration */
10754 static void
10756 {
10759 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10762 /* Parse the block-declaration. */
10765 /* Free any declarators allocated. */
10767 }
10769 /* Some dependent statements (like `if (cond) statement'), are
10770 implicitly in their own scope. In other words, if the statement is
10771 a single statement (as opposed to a compound-statement), it is
10772 none-the-less treated as if it were enclosed in braces. Any
10773 declarations appearing in the dependent statement are out of scope
10774 after control passes that point. This function parses a statement,
10775 but ensures that is in its own scope, even if it is not a
10776 compound-statement.
10778 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10779 is a (possibly labeled) if statement which is not enclosed in
10780 braces and has an else clause. This is used to implement
10781 -Wparentheses.
10783 Returns the new statement. */
10785 static tree
10787 {
10788 tree statement;
10793 /* Mark if () ; with a special NOP_EXPR. */
10795 {
10799 }
10800 /* if a compound is opened, we simply parse the statement directly. */
10803 /* If the token is not a `{', then we must take special action. */
10804 else
10805 {
10806 /* Create a compound-statement. */
10808 /* Parse the dependent-statement. */
10810 /* Finish the dummy compound-statement. */
10812 }
10814 /* Return the statement. */
10816 }
10818 /* For some dependent statements (like `while (cond) statement'), we
10819 have already created a scope. Therefore, even if the dependent
10820 statement is a compound-statement, we do not want to create another
10821 scope. */
10823 static void
10825 {
10826 /* If the token is a `{', then we must take special action. */
10829 else
10830 {
10831 /* Avoid calling cp_parser_compound_statement, so that we
10832 don't create a new scope. Do everything else by hand. */
10834 /* If the next keyword is `__label__' we have a label declaration. */
10837 /* Parse an (optional) statement-seq. */
10840 }
10841 }
10843 /* Declarations [gram.dcl.dcl] */
10845 /* Parse an optional declaration-sequence.
10847 declaration-seq:
10848 declaration
10849 declaration-seq declaration */
10851 static void
10853 {
10855 {
10866 {
10867 /* A declaration consisting of a single semicolon is
10868 invalid. Allow it unless we're being pedantic. */
10873 }
10875 /* If we're entering or exiting a region that's implicitly
10876 extern "C", modify the lang context appropriately. */
10878 {
10881 }
10883 {
10886 }
10889 {
10890 /* A top-level declaration can consist solely of a #pragma.
10891 A nested declaration cannot, so this is done here and not
10892 in cp_parser_declaration. (A #pragma at block scope is
10893 handled in cp_parser_statement.) */
10896 }
10898 /* Parse the declaration itself. */
10900 }
10901 }
10903 /* Parse a declaration.
10905 declaration:
10906 block-declaration
10907 function-definition
10908 template-declaration
10909 explicit-instantiation
10910 explicit-specialization
10911 linkage-specification
10912 namespace-definition
10914 GNU extension:
10916 declaration:
10917 __extension__ declaration */
10919 static void
10921 {
10922 cp_token token1;
10923 cp_token token2;
10928 /* Check for the `__extension__' keyword. */
10930 {
10931 /* Parse the qualified declaration. */
10933 /* Restore the PEDANTIC flag. */
10937 }
10939 /* Try to figure out what kind of declaration is present. */
10944 else
10945 {
10948 }
10950 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10953 /* If the next token is `extern' and the following token is a string
10954 literal, then we have a linkage specification. */
10958 /* If the next token is `template', then we have either a template
10959 declaration, an explicit instantiation, or an explicit
10960 specialization. */
10962 {
10963 /* `template <>' indicates a template specialization. */
10967 /* `template <' indicates a template declaration. */
10970 /* Anything else must be an explicit instantiation. */
10971 else
10973 }
10974 /* If the next token is `export', then we have a template
10975 declaration. */
10978 /* If the next token is `extern', 'static' or 'inline' and the one
10979 after that is `template', we have a GNU extended explicit
10980 instantiation directive. */
10987 /* If the next token is `namespace', check for a named or unnamed
10988 namespace definition. */
10994 /* An unnamed namespace definition. */
10998 /* An inline (associated) namespace definition. */
11002 /* Objective-C++ declaration/definition. */
11009 /* We must have either a block declaration or a function
11010 definition. */
11011 else
11012 /* Try to parse a block-declaration, or a function-definition. */
11015 /* Free any declarators allocated. */
11017 }
11019 /* Parse a block-declaration.
11021 block-declaration:
11022 simple-declaration
11023 asm-definition
11024 namespace-alias-definition
11025 using-declaration
11026 using-directive
11028 GNU Extension:
11030 block-declaration:
11031 __extension__ block-declaration
11033 C++0x Extension:
11035 block-declaration:
11036 static_assert-declaration
11038 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11039 part of a declaration-statement. */
11041 static void
11044 {
11048 /* Check for the `__extension__' keyword. */
11050 {
11051 /* Parse the qualified declaration. */
11053 /* Restore the PEDANTIC flag. */
11057 }
11059 /* Peek at the next token to figure out which kind of declaration is
11060 present. */
11063 /* If the next keyword is `asm', we have an asm-definition. */
11065 {
11069 }
11070 /* If the next keyword is `namespace', we have a
11071 namespace-alias-definition. */
11074 /* If the next keyword is `using', we have a
11075 using-declaration, a using-directive, or an alias-declaration. */
11077 {
11082 /* If the token after `using' is `namespace', then we have a
11083 using-directive. */
11087 /* If the second token after 'using' is '=', then we have an
11088 alias-declaration. */
11094 /* Otherwise, it's a using-declaration. */
11095 else
11098 }
11099 /* If the next keyword is `__label__' we have a misplaced label
11100 declaration. */
11102 {
11106 /* If the next token is now a `;', consume it. */
11109 }
11110 /* If the next token is `static_assert' we have a static assertion. */
11113 /* Anything else must be a simple-declaration. */
11114 else
11117 }
11119 /* Parse a simple-declaration.
11121 simple-declaration:
11122 decl-specifier-seq [opt] init-declarator-list [opt] ;
11124 init-declarator-list:
11125 init-declarator
11126 init-declarator-list , init-declarator
11128 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11129 function-definition as a simple-declaration.
11131 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11132 parsed declaration if it is an uninitialized single declarator not followed
11133 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11134 if present, will not be consumed. */
11136 static void
11140 {
11141 cp_decl_specifier_seq decl_specifiers;
11148 /* Defer access checks until we know what is being declared; the
11149 checks for names appearing in the decl-specifier-seq should be
11150 done as if we were in the scope of the thing being declared. */
11153 /* Parse the decl-specifier-seq. We have to keep track of whether
11154 or not the decl-specifier-seq declares a named class or
11155 enumeration type, since that is the only case in which the
11156 init-declarator-list is allowed to be empty.
11158 [dcl.dcl]
11160 In a simple-declaration, the optional init-declarator-list can be
11161 omitted only when declaring a class or enumeration, that is when
11162 the decl-specifier-seq contains either a class-specifier, an
11163 elaborated-type-specifier, or an enum-specifier. */
11165 CP_PARSER_FLAGS_OPTIONAL,
11168 /* We no longer need to defer access checks. */
11171 /* In a block scope, a valid declaration must always have a
11172 decl-specifier-seq. By not trying to parse declarators, we can
11173 resolve the declaration/expression ambiguity more quickly. */
11176 {
11179 }
11181 /* If the next two tokens are both identifiers, the code is
11182 erroneous. The usual cause of this situation is code like:
11184 T t;
11186 where "T" should name a type -- but does not. */
11189 {
11190 /* If parsing tentatively, we should commit; we really are
11191 looking at a declaration. */
11193 /* Give up. */
11195 }
11197 /* If we have seen at least one decl-specifier, and the next token
11198 is not a parenthesis, then we must be looking at a declaration.
11199 (After "int (" we might be looking at a functional cast.) */
11206 /* Keep going until we hit the `;' at the end of the simple
11207 declaration. */
11210 CPP_SEMICOLON))
11211 {
11214 tree decl;
11217 {
11218 /* If we are processing next declarator, coma is expected */
11224 }
11225 else
11228 /* Parse the init-declarator. */
11231 function_definition_allowed_p,
11233 declares_class_or_enum,
11235 maybe_range_for_decl);
11236 /* If an error occurred while parsing tentatively, exit quickly.
11237 (That usually happens when in the body of a function; each
11238 statement is treated as a declaration-statement until proven
11239 otherwise.) */
11242 /* Handle function definitions specially. */
11244 {
11245 /* If the next token is a `,', then we are probably
11246 processing something like:
11248 void f() {}, *p;
11250 which is erroneous. */
11252 {
11255 "mixing"
11257 }
11258 /* Otherwise, we're done with the list of declarators. */
11259 else
11260 {
11263 }
11264 }
11267 /* The next token should be either a `,' or a `;'. */
11269 /* If it's a `,', there are more declarators to come. */
11272 /* If it's a `;', we are done. */
11275 /* Anything else is an error. */
11276 else
11277 {
11278 /* If we have already issued an error message we don't need
11279 to issue another one. */
11283 /* Skip tokens until we reach the end of the statement. */
11285 /* If the next token is now a `;', consume it. */
11289 }
11290 /* After the first time around, a function-definition is not
11291 allowed -- even if it was OK at first. For example:
11293 int i, f() {}
11295 is not valid. */
11297 }
11299 /* Issue an error message if no declarators are present, and the
11300 decl-specifier-seq does not itself declare a class or
11301 enumeration: [dcl.dcl]/3. */
11303 {
11305 {
11309 /* Ensure an error is issued anyway when finish_decltype_type,
11310 called via cp_parser_decl_specifier_seq, returns a class or
11311 an enumeration (c++/51786). */
11314 }
11315 /* Perform any deferred access checks. */
11317 }
11319 /* Consume the `;'. */
11323 done:
11325 }
11327 /* Parse a decl-specifier-seq.
11329 decl-specifier-seq:
11330 decl-specifier-seq [opt] decl-specifier
11331 decl-specifier attribute-specifier-seq [opt] (C++11)
11333 decl-specifier:
11334 storage-class-specifier
11335 type-specifier
11336 function-specifier
11337 friend
11338 typedef
11340 GNU Extension:
11342 decl-specifier:
11343 attributes
11345 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11347 The parser flags FLAGS is used to control type-specifier parsing.
11349 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11350 flags:
11352 1: one of the decl-specifiers is an elaborated-type-specifier
11353 (i.e., a type declaration)
11354 2: one of the decl-specifiers is an enum-specifier or a
11355 class-specifier (i.e., a type definition)
11357 */
11359 static void
11361 cp_parser_flags flags,
11364 {
11368 cp_decl_spec ds;
11370 /* Clear DECL_SPECS. */
11373 /* Assume no class or enumeration type is declared. */
11376 /* Keep reading specifiers until there are no more to read. */
11378 {
11383 /* Peek at the next token. */
11386 /* Save the first token of the decl spec list for error
11387 reporting. */
11390 /* Handle attributes. */
11392 {
11393 /* Parse the attributes. */
11396 /* In a sequence of declaration specifiers, c++11 attributes
11397 appertain to the type that precede them. In that case
11398 [dcl.spec]/1 says:
11400 The attribute-specifier-seq affects the type only for
11401 the declaration it appears in, not other declarations
11402 involving the same type.
11404 But for now let's force the user to position the
11405 attribute either at the beginning of the declaration or
11406 after the declarator-id, which would clearly mean that it
11407 applies to the declarator. */
11409 {
11411 /* The c++11 attribute is at the beginning of the
11412 declaration. It appertains to the entity being
11414 else
11415 {
11417 {
11418 /* This is an attribute following a
11419 class-specifier. */
11424 }
11425 else
11426 {
11427 decl_specs->std_attributes
11429 attrs);
11432 }
11434 }
11435 }
11437 decl_specs->attributes
11439 attrs);
11443 }
11444 /* Assume we will find a decl-specifier keyword. */
11446 /* If the next token is an appropriate keyword, we can simply
11447 add it to the list. */
11449 {
11450 /* decl-specifier:
11451 friend
11452 constexpr */
11455 {
11458 }
11459 else
11460 {
11462 /* Consume the token. */
11464 }
11472 /* function-specifier:
11473 inline
11474 virtual
11475 explicit */
11482 /* decl-specifier:
11483 typedef */
11486 /* Consume the token. */
11488 /* A constructor declarator cannot appear in a typedef. */
11490 /* The "typedef" keyword can only occur in a declaration; we
11491 may as well commit at this point. */
11498 /* storage-class-specifier:
11499 auto
11500 register
11501 static
11502 extern
11503 mutable
11505 GNU Extension:
11506 thread */
11509 {
11510 /* Consume the token. */
11513 /* Complain about `auto' as a storage specifier, if
11514 we're complaining about C++0x compatibility. */
11518 /* Set the storage class anyway. */
11520 token);
11521 }
11522 else
11523 /* C++0x auto type-specifier. */
11531 /* Consume the token. */
11534 token);
11537 /* Consume the token. */
11543 /* We did not yet find a decl-specifier yet. */
11546 }
11556 /* Constructors are a special case. The `S' in `S()' is not a
11557 decl-specifier; it is the beginning of the declarator. */
11558 constructor_p
11559 = (!found_decl_spec
11560 && constructor_possible_p
11561 && (cp_parser_constructor_declarator_p
11564 /* If we don't have a DECL_SPEC yet, then we must be looking at
11565 a type-specifier. */
11567 {
11570 tree type_spec;
11572 type_spec
11574 decl_specs,
11580 /* If this type-specifier referenced a user-defined type
11581 (a typedef, class-name, etc.), then we can't allow any
11582 more such type-specifiers henceforth.
11584 [dcl.spec]
11586 The longest sequence of decl-specifiers that could
11587 possibly be a type name is taken as the
11588 decl-specifier-seq of a declaration. The sequence shall
11589 be self-consistent as described below.
11591 [dcl.type]
11593 As a general rule, at most one type-specifier is allowed
11594 in the complete decl-specifier-seq of a declaration. The
11595 only exceptions are the following:
11597 -- const or volatile can be combined with any other
11598 type-specifier.
11600 -- signed or unsigned can be combined with char, long,
11601 short, or int.
11603 -- ..
11605 Example:
11607 typedef char* Pc;
11608 void g (const int Pc);
11610 Here, Pc is *not* part of the decl-specifier seq; it's
11611 the declarator. Therefore, once we see a type-specifier
11612 (other than a cv-qualifier), we forbid any additional
11613 user-defined types. We *do* still allow things like `int
11614 int' to be considered a decl-specifier-seq, and issue the
11615 error message later. */
11618 /* A constructor declarator cannot follow a type-specifier. */
11620 {
11625 }
11626 }
11628 /* If we still do not have a DECL_SPEC, then there are no more
11629 decl-specifiers. */
11634 /* After we see one decl-specifier, further decl-specifiers are
11635 always optional. */
11637 }
11639 /* Don't allow a friend specifier with a class definition. */
11644 }
11646 /* Parse an (optional) storage-class-specifier.
11648 storage-class-specifier:
11649 auto
11650 register
11651 static
11652 extern
11653 mutable
11655 GNU Extension:
11657 storage-class-specifier:
11658 thread
11660 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11662 static tree
11664 {
11666 {
11670 /* Fall through for C++98. */
11677 /* Consume the token. */
11682 }
11683 }
11685 /* Parse an (optional) function-specifier.
11687 function-specifier:
11688 inline
11689 virtual
11690 explicit
11692 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11693 Updates DECL_SPECS, if it is non-NULL. */
11695 static tree
11698 {
11701 {
11707 /* 14.5.2.3 [temp.mem]
11709 A member function template shall not be virtual. */
11712 else
11722 }
11724 /* Consume the token. */
11726 }
11728 /* Parse a linkage-specification.
11730 linkage-specification:
11731 extern string-literal { declaration-seq [opt] }
11732 extern string-literal declaration */
11734 static void
11736 {
11737 tree linkage;
11739 /* Look for the `extern' keyword. */
11742 /* Look for the string-literal. */
11745 /* Transform the literal into an identifier. If the literal is a
11746 wide-character string, or contains embedded NULs, then we can't
11747 handle it as the user wants. */
11750 {
11752 /* Assume C++ linkage. */
11754 }
11755 else
11758 /* We're now using the new linkage. */
11761 /* If the next token is a `{', then we're using the first
11762 production. */
11764 {
11767 /* Consume the `{' token. */
11769 /* Parse the declarations. */
11771 /* Look for the closing `}'. */
11773 }
11774 /* Otherwise, there's just one declaration. */
11775 else
11776 {
11779 saved_in_unbraced_linkage_specification_p
11783 parser->in_unbraced_linkage_specification_p
11785 }
11787 /* We're done with the linkage-specification. */
11789 }
11791 /* Parse a static_assert-declaration.
11793 static_assert-declaration:
11794 static_assert ( constant-expression , string-literal ) ;
11796 If MEMBER_P, this static_assert is a class member. */
11798 static void
11800 {
11801 tree condition;
11802 tree message;
11804 location_t saved_loc;
11807 /* Peek at the `static_assert' token so we can keep track of exactly
11808 where the static assertion started. */
11812 /* Look for the `static_assert' keyword. */
11814 RT_STATIC_ASSERT))
11817 /* We know we are in a static assertion; commit to any tentative
11818 parse. */
11822 /* Parse the `(' starting the static assertion condition. */
11825 /* Parse the constant-expression. Allow a non-constant expression
11826 here in order to give better diagnostics in finish_static_assert. */
11827 condition =
11832 /* Parse the separating `,'. */
11835 /* Parse the string-literal message. */
11840 /* A `)' completes the static assertion. */
11847 /* A semicolon terminates the declaration. */
11850 /* Complete the static assertion, which may mean either processing
11851 the static assert now or saving it for template instantiation. */
11853 }
11855 /* Parse the expression in decltype ( expression ). */
11857 static tree
11860 {
11862 tree expr;
11864 /* First, try parsing an id-expression. */
11875 {
11878 cp_id_kind idk;
11882 /* Lookup the name we got back from the id-expression. */
11893 {
11894 /* Complete lookup of the id-expression. */
11895 expr = (finish_id_expression
11908 /* We found an id-expression, but it was something that we
11909 should not have found. This is an error, not something
11910 we can recover from, so note that we found an
11911 id-expression and we'll recover as gracefully as
11912 possible. */
11914 }
11919 /* We have an id-expression. */
11921 }
11924 {
11925 /* Abort the id-expression parse. */
11928 /* Parsing tentatively, again. */
11931 /* Parse a class member access. */
11939 /* We have an id-expression. */
11941 }
11944 /* We have parsed the complete id-expression or member access. */
11946 else
11947 {
11948 /* Abort our attempt to parse an id-expression or member access
11949 expression. */
11952 /* Parse a full expression. */
11955 }
11958 }
11960 /* Parse a `decltype' type. Returns the type.
11962 simple-type-specifier:
11963 decltype ( expression )
11964 C++14 proposal:
11965 decltype ( auto ) */
11967 static tree
11969 {
11970 tree expr;
11979 {
11980 /* Already parsed. */
11983 }
11985 /* Look for the `decltype' token. */
11989 /* Parse the opening `('. */
11993 /* decltype (auto) */
11996 {
12003 }
12005 /* Types cannot be defined in a `decltype' expression. Save away the
12006 old message. */
12009 /* And create the new one. */
12010 parser->type_definition_forbidden_message
12013 /* The restrictions on constant-expressions do not apply inside
12014 decltype expressions. */
12015 saved_integral_constant_expression_p
12017 saved_non_integral_constant_expression_p
12021 /* Within a parenthesized expression, a `>' token is always
12022 the greater-than operator. */
12023 saved_greater_than_is_operator_p
12027 /* Do not actually evaluate the expression. */
12030 /* Do not warn about problems with the expression. */
12035 /* Go back to evaluating expressions. */
12039 /* The `>' token might be the end of a template-id or
12040 template-parameter-list now. */
12041 parser->greater_than_is_operator_p
12044 /* Restore the old message and the integral constant expression
12045 flags. */
12047 parser->integral_constant_expression_p
12049 parser->non_integral_constant_expression_p
12052 /* Parse to the closing `)'. */
12054 {
12058 }
12061 tf_warning_or_error);
12063 rewrite:
12064 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12065 it again. */
12072 }
12074 /* Special member functions [gram.special] */
12076 /* Parse a conversion-function-id.
12078 conversion-function-id:
12079 operator conversion-type-id
12081 Returns an IDENTIFIER_NODE representing the operator. */
12083 static tree
12085 {
12086 tree type;
12087 tree saved_scope;
12088 tree saved_qualifying_scope;
12089 tree saved_object_scope;
12092 /* Look for the `operator' token. */
12095 /* When we parse the conversion-type-id, the current scope will be
12096 reset. However, we need that information in able to look up the
12097 conversion function later, so we save it here. */
12101 /* We must enter the scope of the class so that the names of
12102 entities declared within the class are available in the
12103 conversion-type-id. For example, consider:
12105 struct S {
12106 typedef int I;
12107 operator I();
12108 };
12110 S::operator I() { ... }
12112 In order to see that `I' is a type-name in the definition, we
12113 must be in the scope of `S'. */
12116 /* Parse the conversion-type-id. */
12118 /* Leave the scope of the class, if any. */
12121 /* Restore the saved scope. */
12125 /* If the TYPE is invalid, indicate failure. */
12129 }
12131 /* Parse a conversion-type-id:
12133 conversion-type-id:
12134 type-specifier-seq conversion-declarator [opt]
12136 Returns the TYPE specified. */
12138 static tree
12140 {
12141 tree attributes;
12142 cp_decl_specifier_seq type_specifiers;
12144 tree type_specified;
12147 /* Parse the attributes. */
12151 parser->type_definition_forbidden_message
12154 /* Parse the type-specifiers. */
12161 /* If that didn't work, stop. */
12164 /* Parse the conversion-declarator. */
12172 /* Don't give this error when parsing tentatively. This happens to
12173 work because we always parse this definitively once. */
12176 {
12178 {
12181 }
12185 }
12188 }
12190 /* Parse an (optional) conversion-declarator.
12192 conversion-declarator:
12193 ptr-operator conversion-declarator [opt]
12195 */
12199 {
12202 cp_cv_quals cv_quals;
12204 /* We don't know if there's a ptr-operator next, or not. */
12206 /* Try the ptr-operator. */
12209 /* If it worked, look for more conversion-declarators. */
12211 {
12214 /* Parse another optional declarator. */
12217 declarator = cp_parser_make_indirect_declarator
12221 }
12224 }
12226 /* Parse an (optional) ctor-initializer.
12228 ctor-initializer:
12229 : mem-initializer-list
12231 Returns TRUE iff the ctor-initializer was actually present. */
12233 static bool
12235 {
12236 /* If the next token is not a `:', then there is no
12237 ctor-initializer. */
12239 {
12240 /* Do default initialization of any bases and members. */
12245 }
12247 /* Consume the `:' token. */
12249 /* And the mem-initializer-list. */
12253 }
12255 /* Parse a mem-initializer-list.
12257 mem-initializer-list:
12258 mem-initializer ... [opt]
12259 mem-initializer ... [opt] , mem-initializer-list */
12261 static void
12263 {
12268 /* Let the semantic analysis code know that we are starting the
12269 mem-initializer-list. */
12274 /* Loop through the list. */
12276 {
12277 tree mem_initializer;
12280 /* Parse the mem-initializer. */
12282 /* If the next token is a `...', we're expanding member initializers. */
12284 {
12285 /* Consume the `...'. */
12288 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12289 can be expanded but members cannot. */
12292 {
12297 }
12299 /* Construct the pack expansion type. */
12302 }
12305 {
12309 }
12310 /* Look for a target constructor. */
12314 {
12317 {
12321 }
12323 }
12324 /* Add it to the list, unless it was erroneous. */
12326 {
12329 }
12330 /* If the next token is not a `,', we're done. */
12333 /* Consume the `,' token. */
12335 }
12337 /* Perform semantic analysis. */
12340 }
12342 /* Parse a mem-initializer.
12344 mem-initializer:
12345 mem-initializer-id ( expression-list [opt] )
12346 mem-initializer-id braced-init-list
12348 GNU extension:
12350 mem-initializer:
12351 ( expression-list [opt] )
12353 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12354 class) or FIELD_DECL (for a non-static data member) to initialize;
12355 the TREE_VALUE is the expression-list. An empty initialization
12356 list is represented by void_list_node. */
12358 static tree
12360 {
12361 tree mem_initializer_id;
12362 tree expression_list;
12363 tree member;
12366 /* Find out what is being initialized. */
12368 {
12372 }
12373 else
12374 {
12378 }
12384 {
12391 }
12392 else
12393 {
12403 }
12413 }
12415 /* Parse a mem-initializer-id.
12417 mem-initializer-id:
12418 :: [opt] nested-name-specifier [opt] class-name
12419 identifier
12421 Returns a TYPE indicating the class to be initializer for the first
12422 production. Returns an IDENTIFIER_NODE indicating the data member
12423 to be initialized for the second production. */
12425 static tree
12427 {
12431 tree id;
12435 /* `typename' is not allowed in this context ([temp.res]). */
12437 {
12439 "keyword %<typename%> not allowed in this context (a qualified "
12442 }
12443 /* Look for the optional `::' operator. */
12444 global_scope_p
12448 /* Look for the optional nested-name-specifier. The simplest way to
12449 implement:
12451 [temp.res]
12453 The keyword `typename' is not permitted in a base-specifier or
12454 mem-initializer; in these contexts a qualified name that
12455 depends on a template-parameter is implicitly assumed to be a
12456 type name.
12458 is to assume that we have seen the `typename' keyword at this
12459 point. */
12460 nested_name_specifier_p
12469 /* If there is a `::' operator or a nested-name-specifier, then we
12470 are definitely looking for a class-name. */
12475 typename_type,
12479 /* Otherwise, we could also be looking for an ordinary identifier. */
12481 /* Try a class-name. */
12485 none_type,
12489 /* If we found one, we're done. */
12492 /* Otherwise, look for an ordinary identifier. */
12494 }
12496 /* Overloading [gram.over] */
12498 /* Parse an operator-function-id.
12500 operator-function-id:
12501 operator operator
12503 Returns an IDENTIFIER_NODE for the operator which is a
12504 human-readable spelling of the identifier, e.g., `operator +'. */
12506 static tree
12508 {
12509 /* Look for the `operator' keyword. */
12512 /* And then the name of the operator itself. */
12514 }
12516 /* Return an identifier node for a user-defined literal operator.
12517 The suffix identifier is chained to the operator name identifier. */
12519 static tree
12521 {
12522 tree identifier;
12529 }
12531 /* Parse an operator.
12533 operator:
12534 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12535 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12536 || ++ -- , ->* -> () []
12538 GNU Extensions:
12540 operator:
12541 <? >? <?= >?=
12543 Returns an IDENTIFIER_NODE for the operator which is a
12544 human-readable spelling of the identifier, e.g., `operator +'. */
12546 static tree
12548 {
12553 /* Peek at the next token. */
12555 /* Figure out which operator we have. */
12557 {
12559 {
12562 /* The keyword should be either `new' or `delete'. */
12567 else
12570 /* Consume the `new' or `delete' token. */
12573 /* Peek at the next token. */
12575 /* If it's a `[' token then this is the array variant of the
12576 operator. */
12578 {
12579 /* Consume the `[' token. */
12581 /* Look for the `]' token. */
12585 }
12586 /* Otherwise, we have the non-array variant. */
12587 else
12591 }
12738 /* Consume the `('. */
12740 /* Look for the matching `)'. */
12745 /* Consume the `['. */
12747 /* Look for the matching `]'. */
12756 /* Fall through. */
12762 {
12765 }
12767 {
12770 }
12771 /* Consume the string. */
12773 /* Look for the suffix identifier. */
12776 {
12779 {
12782 }
12783 }
12785 {
12789 }
12790 else
12791 {
12794 }
12801 /* Fall through. */
12807 {
12810 }
12811 {
12814 {
12817 }
12819 /* Consume the user-defined string literal. */
12822 {
12825 }
12826 else
12828 }
12831 /* Anything else is an error. */
12833 }
12835 /* If we have selected an identifier, we need to consume the
12836 operator token. */
12839 /* Otherwise, no valid operator name was present. */
12840 else
12841 {
12844 }
12847 }
12849 /* Parse a template-declaration.
12851 template-declaration:
12852 export [opt] template < template-parameter-list > declaration
12854 If MEMBER_P is TRUE, this template-declaration occurs within a
12855 class-specifier.
12857 The grammar rule given by the standard isn't correct. What
12858 is really meant is:
12860 template-declaration:
12861 export [opt] template-parameter-list-seq
12862 decl-specifier-seq [opt] init-declarator [opt] ;
12863 export [opt] template-parameter-list-seq
12864 function-definition
12866 template-parameter-list-seq:
12867 template-parameter-list-seq [opt]
12868 template < template-parameter-list > */
12870 static void
12872 {
12873 /* Check for `export'. */
12875 {
12876 /* Consume the `export' token. */
12878 /* Warn that we do not support `export'. */
12880 }
12883 }
12885 /* Parse a template-parameter-list.
12887 template-parameter-list:
12888 template-parameter
12889 template-parameter-list , template-parameter
12891 Returns a TREE_LIST. Each node represents a template parameter.
12892 The nodes are connected via their TREE_CHAINs. */
12894 static tree
12896 {
12901 /* The loop below parses the template parms. We first need to know
12902 the total number of template parms to be able to compute proper
12903 canonical types of each dependent type. So after the loop, when
12904 we know the total number of template parms,
12905 end_template_parm_list computes the proper canonical types and
12906 fixes up the dependent types accordingly. */
12908 {
12909 tree parameter;
12912 location_t parm_loc;
12914 /* Parse the template-parameter. */
12919 /* Add it to the list. */
12922 parm_loc,
12923 parameter,
12924 is_non_type,
12925 is_parameter_pack);
12926 else
12927 {
12930 }
12932 /* If the next token is not a `,', we're done. */
12935 /* Otherwise, consume the `,' token. */
12937 }
12940 }
12942 /* Parse a template-parameter.
12944 template-parameter:
12945 type-parameter
12946 parameter-declaration
12948 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12949 the parameter. The TREE_PURPOSE is the default value, if any.
12950 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12951 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12952 set to true iff this parameter is a parameter pack. */
12954 static tree
12957 {
12961 tree parm;
12963 /* Assume it is a type parameter or a template parameter. */
12965 /* Assume it not a parameter pack. */
12967 /* Peek at the next token. */
12969 /* If it is `class' or `template', we have a type-parameter. */
12972 /* If it is `class' or `typename' we do not know yet whether it is a
12973 type parameter or a non-type parameter. Consider:
12975 template <typename T, typename T::X X> ...
12977 or:
12979 template <class C, class D*> ...
12981 Here, the first parameter is a type parameter, and the second is
12982 a non-type parameter. We can tell by looking at the token after
12983 the identifier -- if it is a `,', `=', or `>' then we have a type
12984 parameter. */
12986 {
12987 /* Peek at the token after `class' or `typename'. */
12989 /* If it's an ellipsis, we have a template type parameter
12990 pack. */
12993 /* If it's an identifier, skip it. */
12996 /* Now, see if the token looks like the end of a template
12997 parameter. */
13002 }
13004 /* Otherwise, it is a non-type parameter.
13006 [temp.param]
13008 When parsing a default template-argument for a non-type
13009 template-parameter, the first non-nested `>' is taken as the end
13010 of the template parameter-list rather than a greater-than
13011 operator. */
13013 parameter_declarator
13020 /* If the parameter declaration is marked as a parameter pack, set
13021 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13022 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13023 grokdeclarator. */
13026 {
13029 }
13032 {
13033 /* Can happen in some cases of erroneous input (c++/34892). */
13035 /* Consume the `...' for better error recovery. */
13037 }
13038 /* If the next token is an ellipsis, and we don't already have it
13039 marked as a parameter pack, then we have a parameter pack (that
13040 has no declarator). */
13043 && (declarator_can_be_parameter_pack
13045 {
13046 /* Consume the `...'. */
13051 }
13052 /* We might end up with a pack expansion as the type of the non-type
13053 template parameter, in which case this is a non-type template
13054 parameter pack. */
13057 {
13061 }
13064 {
13065 /* Parameter packs cannot have default arguments. However, a
13066 user may try to do so, so we'll parse them and give an
13067 appropriate diagnostic here. */
13071 /* Find the name of the parameter pack. */
13080 else
13084 /* Parse the default argument, but throw away the result. */
13086 }
13096 }
13098 /* Parse a type-parameter.
13100 type-parameter:
13101 class identifier [opt]
13102 class identifier [opt] = type-id
13103 typename identifier [opt]
13104 typename identifier [opt] = type-id
13105 template < template-parameter-list > class identifier [opt]
13106 template < template-parameter-list > class identifier [opt]
13107 = id-expression
13109 GNU Extension (variadic templates):
13111 type-parameter:
13112 class ... identifier [opt]
13113 typename ... identifier [opt]
13115 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13116 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13117 the declaration of the parameter.
13119 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13121 static tree
13123 {
13125 tree parameter;
13127 /* Look for a keyword to tell us what kind of parameter this is. */
13133 {
13136 {
13137 tree identifier;
13138 tree default_argument;
13140 /* If the next token is an ellipsis, we have a template
13141 argument pack. */
13143 {
13144 /* Consume the `...' token. */
13149 }
13151 /* If the next token is an identifier, then it names the
13152 parameter. */
13155 else
13158 /* Create the parameter. */
13161 /* If the next token is an `=', we have a default argument. */
13163 {
13164 /* Consume the `=' token. */
13166 /* Parse the default-argument. */
13170 /* Template parameter packs cannot have default
13171 arguments. */
13173 {
13176 "template parameter pack %qD cannot have a "
13178 else
13180 "template parameter packs cannot have "
13183 }
13185 }
13186 else
13189 /* Create the combined representation of the parameter and the
13190 default argument. */
13192 }
13196 {
13197 tree identifier;
13198 tree default_argument;
13200 /* Look for the `<'. */
13202 /* Parse the template-parameter-list. */
13204 /* Look for the `>'. */
13206 /* Look for the `class' keyword. */
13208 /* If the next token is an ellipsis, we have a template
13209 argument pack. */
13211 {
13212 /* Consume the `...' token. */
13217 }
13218 /* If the next token is an `=', then there is a
13219 default-argument. If the next token is a `>', we are at
13220 the end of the parameter-list. If the next token is a `,',
13221 then we are at the end of this parameter. */
13225 {
13227 /* Treat invalid names as if the parameter were nameless. */
13230 }
13231 else
13234 /* Create the template parameter. */
13236 identifier);
13238 /* If the next token is an `=', then there is a
13239 default-argument. */
13241 {
13244 /* Consume the `='. */
13246 /* Parse the id-expression. */
13248 /* save token before parsing the id-expression, for error
13249 reporting */
13251 default_argument
13259 /* If the id-expression was a template-id that refers to
13260 a template-class, we already have the declaration here,
13261 so no further lookup is needed. */
13262 ;
13263 else
13264 /* Look up the name. */
13265 default_argument
13267 none_type,
13273 /* See if the default argument is valid. */
13274 default_argument
13277 /* Template parameter packs cannot have default
13278 arguments. */
13280 {
13283 "template parameter pack %qD cannot "
13285 identifier);
13286 else
13290 }
13292 }
13293 else
13296 /* Create the combined representation of the parameter and the
13297 default argument. */
13299 }
13305 }
13308 }
13310 /* Parse a template-id.
13312 template-id:
13313 template-name < template-argument-list [opt] >
13315 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13316 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13317 returned. Otherwise, if the template-name names a function, or set
13318 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13319 names a class, returns a TYPE_DECL for the specialization.
13321 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13322 uninstantiated templates. */
13324 static tree
13330 {
13332 tree templ;
13333 tree arguments;
13334 tree template_id;
13341 /* If the next token corresponds to a template-id, there is no need
13342 to reparse it. */
13345 {
13348 /* Get the stored value. */
13350 /* Perform any access checks that were deferred. */
13353 {
13358 tf_warning_or_error);
13359 }
13360 /* Return the stored value. */
13362 }
13364 /* Avoid performing name lookup if there is no possibility of
13365 finding a template-id. */
13368 && !cp_parser_nth_token_starts_template_argument_list_p
13370 {
13373 }
13375 /* Remember where the template-id starts. */
13381 /* Parse the template-name. */
13384 check_dependency_p,
13385 is_declaration,
13386 tag_type,
13389 {
13392 }
13394 /* If we find the sequence `[:' after a template-name, it's probably
13395 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13396 parse correctly the argument list. */
13403 {
13405 /* Change `:' into `::'. */
13407 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13408 CPP_LESS. */
13411 /* Parse the arguments. */
13414 {
13415 /* If we couldn't parse an argument list, then we revert our changes
13416 and return simply an error. Maybe this is not a template-id
13417 after all. */
13422 }
13423 /* Otherwise, emit an error about the invalid digraph, but continue
13424 parsing because we got our argument list. */
13427 {
13430 "%<<:%> is an alternate spelling for %<[%>."
13433 {
13435 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13438 }
13439 }
13440 }
13441 else
13442 {
13443 /* Look for the `<' that starts the template-argument-list. */
13445 {
13448 }
13449 /* Parse the arguments. */
13451 }
13453 /* Build a representation of the specialization. */
13456 TEMPLATE_ID_EXPR,
13460 {
13462 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13463 template (rather than some instantiation thereof) only if
13464 is not nested within some other construct. For example, in
13465 "template <typename T> void f(T) { A<T>::", A<T> is just an
13466 instantiation of A. */
13469 CPP_SCOPE));
13470 template_id
13472 }
13473 else
13474 {
13475 /* If it's not a class-template or a template-template, it should be
13476 a function-template. */
13482 }
13484 /* If parsing tentatively, replace the sequence of tokens that makes
13485 up the template-id with a CPP_TEMPLATE_ID token. That way,
13486 should we re-parse the token stream, we will not have to repeat
13487 the effort required to do the parse, nor will we issue duplicate
13488 error messages about problems during instantiation of the
13489 template. */
13491 /* Don't do this if we had a parse error in a declarator; re-parsing
13492 might succeed if a name changes meaning (60361). */
13496 {
13499 /* Reset the contents of the START_OF_ID token. */
13501 /* Retrieve any deferred checks. Do not pop this access checks yet
13502 so the memory will not be reclaimed during token replacing below. */
13508 /* Purge all subsequent tokens. */
13511 /* ??? Can we actually assume that, if template_id ==
13512 error_mark_node, we will have issued a diagnostic to the
13513 user, as opposed to simply marking the tentative parse as
13514 failed? */
13517 }
13521 }
13523 /* Parse a template-name.
13525 template-name:
13526 identifier
13528 The standard should actually say:
13530 template-name:
13531 identifier
13532 operator-function-id
13534 A defect report has been filed about this issue.
13536 A conversion-function-id cannot be a template name because they cannot
13537 be part of a template-id. In fact, looking at this code:
13539 a.operator K<int>()
13541 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13542 It is impossible to call a templated conversion-function-id with an
13543 explicit argument list, since the only allowed template parameter is
13544 the type to which it is converting.
13546 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13547 `template' keyword, in a construction like:
13549 T::template f<3>()
13551 In that case `f' is taken to be a template-name, even though there
13552 is no way of knowing for sure.
13554 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13555 name refers to a set of overloaded functions, at least one of which
13556 is a template, or an IDENTIFIER_NODE with the name of the template,
13557 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13558 names are looked up inside uninstantiated templates. */
13560 static tree
13567 {
13568 tree identifier;
13569 tree decl;
13570 tree fns;
13573 /* If the next token is `operator', then we have either an
13574 operator-function-id or a conversion-function-id. */
13576 {
13577 /* We don't know whether we're looking at an
13578 operator-function-id or a conversion-function-id. */
13580 /* Try an operator-function-id. */
13582 /* If that didn't work, try a conversion-function-id. */
13584 {
13587 }
13588 }
13589 /* Look for the identifier. */
13590 else
13593 /* If we didn't find an identifier, we don't have a template-id. */
13597 /* If the name immediately followed the `template' keyword, then it
13598 is a template-name. However, if the next token is not `<', then
13599 we do not treat it as a template-name, since it is not being used
13600 as part of a template-id. This enables us to handle constructs
13601 like:
13603 template <typename T> struct S { S(); };
13604 template <typename T> S<T>::S();
13606 correctly. We would treat `S' as a template -- if it were `S<T>'
13607 -- but we do not if there is no `<'. */
13611 {
13612 /* In a declaration, in a dependent context, we pretend that the
13613 "template" keyword was present in order to improve error
13614 recovery. For example, given:
13616 template <typename T> void f(T::X<int>);
13618 we want to treat "X<int>" as a template-id. */
13620 && !template_keyword_p
13622 && check_dependency_p
13624 /* Do not do this for dtors (or ctors), since they never
13625 need the template keyword before their name. */
13627 {
13630 /* Explain what went wrong. */
13632 identifier);
13635 /* If parsing tentatively, find the location of the "<" token. */
13638 /* Parse the template arguments so that we can issue error
13639 messages about them. */
13642 /* Skip tokens until we find a good place from which to
13643 continue parsing. */
13648 /* If parsing tentatively, permanently remove the
13649 template argument list. That will prevent duplicate
13650 error messages from being issued about the missing
13651 "template" keyword. */
13657 }
13659 /* If the "template" keyword is present, then there is generally
13660 no point in doing name-lookup, so we just return IDENTIFIER.
13661 But, if the qualifying scope is non-dependent then we can
13662 (and must) do name-lookup normally. */
13668 }
13670 /* Look up the name. */
13672 tag_type,
13675 check_dependency_p,
13679 /* If DECL is a template, then the name was a template-name. */
13681 ;
13682 else
13683 {
13686 /* The standard does not explicitly indicate whether a name that
13687 names a set of overloaded declarations, some of which are
13688 templates, is a template-name. However, such a name should
13689 be a template-name; otherwise, there is no way to form a
13690 template-id for the overloaded templates. */
13698 {
13699 /* The name does not name a template. */
13702 }
13703 }
13705 /* If DECL is dependent, and refers to a function, then just return
13706 its name; we will look it up again during template instantiation. */
13708 {
13712 }
13715 }
13717 /* Parse a template-argument-list.
13719 template-argument-list:
13720 template-argument ... [opt]
13721 template-argument-list , template-argument ... [opt]
13723 Returns a TREE_VEC containing the arguments. */
13725 static tree
13727 {
13732 tree vec;
13739 /* Even if the template-id appears in an integral
13740 constant-expression, the contents of the argument list do
13741 not. */
13747 /* Parse the arguments. */
13748 do
13749 {
13750 tree argument;
13753 /* Consume the comma. */
13756 /* Parse the template-argument. */
13759 /* If the next token is an ellipsis, we're expanding a template
13760 argument pack. */
13762 {
13764 {
13768 }
13769 /* Consume the `...' token. */
13772 /* Make the argument into a TYPE_PACK_EXPANSION or
13773 EXPR_PACK_EXPANSION. */
13775 }
13778 {
13782 {
13785 }
13786 else
13788 }
13790 }
13803 #ifdef ENABLE_CHECKING
13805 #endif
13807 }
13809 /* Parse a template-argument.
13811 template-argument:
13812 assignment-expression
13813 type-id
13814 id-expression
13816 The representation is that of an assignment-expression, type-id, or
13817 id-expression -- except that the qualified id-expression is
13818 evaluated, so that the value returned is either a DECL or an
13819 OVERLOAD.
13821 Although the standard says "assignment-expression", it forbids
13822 throw-expressions or assignments in the template argument.
13823 Therefore, we use "conditional-expression" instead. */
13825 static tree
13827 {
13828 tree argument;
13834 cp_id_kind idk;
13836 /* There's really no way to know what we're looking at, so we just
13837 try each alternative in order.
13839 [temp.arg]
13841 In a template-argument, an ambiguity between a type-id and an
13842 expression is resolved to a type-id, regardless of the form of
13843 the corresponding template-parameter.
13845 Therefore, we try a type-id first. */
13848 /* If there was no error parsing the type-id but the next token is a
13849 '>>', our behavior depends on which dialect of C++ we're
13850 parsing. In C++98, we probably found a typo for '> >'. But there
13851 are type-id which are also valid expressions. For instance:
13853 struct X { int operator >> (int); };
13854 template <int V> struct Foo {};
13855 Foo<X () >> 5> r;
13857 Here 'X()' is a valid type-id of a function type, but the user just
13858 wanted to write the expression "X() >> 5". Thus, we remember that we
13859 found a valid type-id, but we still try to parse the argument as an
13860 expression to see what happens.
13862 In C++0x, the '>>' will be considered two separate '>'
13863 tokens. */
13867 {
13870 }
13871 else
13872 {
13873 /* If the next token isn't a `,' or a `>', then this argument wasn't
13874 really finished. This means that the argument is not a valid
13875 type-id. */
13878 /* If that worked, we're done. */
13881 }
13882 /* We're still not sure what the argument will be. */
13884 /* Try a template. */
13892 /* If the next token isn't a `,' or a `>', then this argument wasn't
13893 really finished. */
13897 {
13898 /* Figure out what is being referred to. If the id-expression
13899 was for a class template specialization, then we will have a
13900 TYPE_DECL at this point. There is no need to do name lookup
13901 at this point in that case. */
13904 none_type,
13913 }
13916 /* It must be a non-type argument. There permitted cases are given
13917 in [temp.arg.nontype]:
13919 -- an integral constant-expression of integral or enumeration
13920 type; or
13922 -- the name of a non-type template-parameter; or
13924 -- the name of an object or function with external linkage...
13926 -- the address of an object or function with external linkage...
13928 -- a pointer to member... */
13929 /* Look for a non-type template parameter. */
13931 {
13943 }
13945 /* If the next token is "&", the argument must be the address of an
13946 object or function with external linkage. */
13949 {
13952 }
13953 /* See if we might have an id-expression. */
13960 {
13963 address_p,
13970 else
13971 {
13972 tree probe;
13975 {
13976 /* Strip the dereference temporarily. */
13979 }
13981 /* If we're in a template, we represent a qualified-id referring
13982 to a static data member as a SCOPE_REF even if the scope isn't
13983 dependent so that we can check access control later. */
13988 {
13989 /* A variable without external linkage might still be a
13990 valid constant-expression, so no error is issued here
13991 if the external-linkage check fails. */
13994 }
13996 /* All overloaded functions are allowed; if the external
13997 linkage test does not pass, an error will be issued
13998 later. */
13999 ;
14003 /* A pointer-to-member. */
14004 ;
14006 ;
14007 else
14011 {
14014 tf_warning_or_error);
14015 else
14018 }
14019 }
14020 }
14021 /* If the argument started with "&", there are no other valid
14022 alternatives at this point. */
14024 {
14027 }
14029 /* If the argument wasn't successfully parsed as a type-id followed
14030 by '>>', the argument can only be a constant expression now.
14031 Otherwise, we try parsing the constant-expression tentatively,
14032 because the argument could really be a type-id. */
14044 /* We did our best to parse the argument as a non type-id, but that
14045 was the only alternative that matched (albeit with a '>' after
14046 it). We can assume it's just a typo from the user, and a
14047 diagnostic will then be issued. */
14049 }
14051 /* Parse an explicit-instantiation.
14053 explicit-instantiation:
14054 template declaration
14056 Although the standard says `declaration', what it really means is:
14058 explicit-instantiation:
14059 template decl-specifier-seq [opt] declarator [opt] ;
14061 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14062 supposed to be allowed. A defect report has been filed about this
14063 issue.
14065 GNU Extension:
14067 explicit-instantiation:
14068 storage-class-specifier template
14069 decl-specifier-seq [opt] declarator [opt] ;
14070 function-specifier template
14071 decl-specifier-seq [opt] declarator [opt] ; */
14073 static void
14075 {
14077 cp_decl_specifier_seq decl_specifiers;
14082 /* Look for an (optional) storage-class-specifier or
14083 function-specifier. */
14085 {
14086 extension_specifier
14089 extension_specifier
14092 }
14094 /* Look for the `template' keyword. */
14096 /* Let the front end know that we are processing an explicit
14097 instantiation. */
14099 /* [temp.explicit] says that we are supposed to ignore access
14100 control while processing explicit instantiation directives. */
14102 /* Parse a decl-specifier-seq. */
14104 CP_PARSER_FLAGS_OPTIONAL,
14107 /* If there was exactly one decl-specifier, and it declared a class,
14108 and there's no declarator, then we have an explicit type
14109 instantiation. */
14111 {
14112 tree type;
14116 /* Turn access control back on for names used during
14117 template instantiation. */
14122 }
14123 else
14124 {
14126 tree decl;
14128 /* Parse the declarator. */
14129 declarator
14139 {
14142 "explicit instantiation shall not use"
14146 "explicit instantiation shall not use"
14151 /* Turn access control back on for names used during
14152 template instantiation. */
14154 /* Do the explicit instantiation. */
14156 }
14157 else
14158 {
14160 /* Skip the body of the explicit instantiation. */
14162 }
14163 }
14164 /* We're done with the instantiation. */
14170 }
14172 /* Parse an explicit-specialization.
14174 explicit-specialization:
14175 template < > declaration
14177 Although the standard says `declaration', what it really means is:
14179 explicit-specialization:
14180 template <> decl-specifier [opt] init-declarator [opt] ;
14181 template <> function-definition
14182 template <> explicit-specialization
14183 template <> template-declaration */
14185 static void
14187 {
14191 /* Look for the `template' keyword. */
14193 /* Look for the `<'. */
14195 /* Look for the `>'. */
14197 /* We have processed another parameter list. */
14199 /* [temp]
14201 A template ... explicit specialization ... shall not have C
14202 linkage. */
14204 {
14206 /* Give it C++ linkage to avoid confusing other parts of the
14207 front end. */
14210 }
14211 else
14213 /* Let the front end know that we are beginning a specialization. */
14215 {
14218 }
14220 /* If the next keyword is `template', we need to figure out whether
14221 or not we're looking a template-declaration. */
14223 {
14228 else
14230 }
14231 else
14232 /* Parse the dependent declaration. */
14238 /* We're done with the specialization. */
14240 /* For the erroneous case of a template with C linkage, we pushed an
14241 implicit C++ linkage scope; exit that scope now. */
14244 /* We're done with this parameter list. */
14246 }
14248 /* Parse a type-specifier.
14250 type-specifier:
14251 simple-type-specifier
14252 class-specifier
14253 enum-specifier
14254 elaborated-type-specifier
14255 cv-qualifier
14257 GNU Extension:
14259 type-specifier:
14260 __complex__
14262 Returns a representation of the type-specifier. For a
14263 class-specifier, enum-specifier, or elaborated-type-specifier, a
14264 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14266 The parser flags FLAGS is used to control type-specifier parsing.
14268 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14269 in a decl-specifier-seq.
14271 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14272 class-specifier, enum-specifier, or elaborated-type-specifier, then
14273 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14274 if a type is declared; 2 if it is defined. Otherwise, it is set to
14275 zero.
14277 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14278 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14279 is set to FALSE. */
14281 static tree
14283 cp_parser_flags flags,
14288 {
14294 /* Assume this type-specifier does not declare a new type. */
14297 /* And that it does not specify a cv-qualifier. */
14300 /* Peek at the next token. */
14303 /* If we're looking at a keyword, we can use that to guide the
14304 production we choose. */
14307 {
14312 /* Look for the enum-specifier. */
14314 /* If that worked, we're done. */
14316 {
14321 type_spec,
14322 token,
14325 }
14326 else
14329 /* Any of these indicate either a class-specifier, or an
14330 elaborated-type-specifier. */
14337 /* Parse tentatively so that we can back up if we don't find a
14338 class-specifier. */
14340 /* Look for the class-specifier. */
14343 /* If that worked, we're done. */
14345 {
14350 type_spec,
14351 token,
14354 }
14356 /* Fall through. */
14357 elaborated_type_specifier:
14358 /* We're declaring (not defining) a class or enum. */
14362 /* Fall through. */
14364 /* Look for an elaborated-type-specifier. */
14365 type_spec
14366 = (cp_parser_elaborated_type_specifier
14369 is_declaration));
14372 type_spec,
14373 token,
14396 /* The `__complex__' keyword is a GNU extension. */
14402 }
14404 /* Handle simple keywords. */
14406 {
14408 {
14411 }
14413 }
14415 /* If we do not already have a type-specifier, assume we are looking
14416 at a simple-type-specifier. */
14418 decl_specs,
14419 flags);
14421 /* If we didn't find a type-specifier, and a type-specifier was not
14422 optional in this context, issue an error message. */
14424 {
14427 }
14430 }
14432 /* Parse a simple-type-specifier.
14434 simple-type-specifier:
14435 :: [opt] nested-name-specifier [opt] type-name
14436 :: [opt] nested-name-specifier template template-id
14437 char
14438 wchar_t
14439 bool
14440 short
14441 int
14442 long
14443 signed
14444 unsigned
14445 float
14446 double
14447 void
14449 C++0x Extension:
14451 simple-type-specifier:
14452 auto
14453 decltype ( expression )
14454 char16_t
14455 char32_t
14456 __underlying_type ( type-id )
14458 GNU Extension:
14460 simple-type-specifier:
14461 __int128
14462 __typeof__ unary-expression
14463 __typeof__ ( type-id )
14464 __typeof__ ( type-id ) { initializer-list , [opt] }
14466 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14467 appropriately updated. */
14469 static tree
14472 cp_parser_flags flags)
14473 {
14477 /* Peek at the next token. */
14480 /* If we're looking at a keyword, things are easy. */
14482 {
14542 {
14546 {
14549 "use of %<auto%> in lambda parameter declaration "
14550 "only available with "
14552 }
14555 "use of %<auto%> in parameter declaration "
14556 "only available with "
14558 else
14560 "ISO C++ forbids use of %<auto%> in parameter "
14562 }
14563 else
14568 /* Since DR 743, decltype can either be a simple-type-specifier by
14569 itself or begin a nested-name-specifier. Parsing it will replace
14570 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14571 handling below decide what to do. */
14577 /* Consume the `typeof' token. */
14579 /* Parse the operand to `typeof'. */
14581 /* If it is not already a TYPE, take its type. */
14587 token,
14596 token,
14606 token,
14611 }
14613 /* If token is an already-parsed decltype not followed by ::,
14614 it's a simple-type-specifier. */
14617 {
14621 token,
14625 }
14627 /* If the type-specifier was for a built-in type, we're done. */
14629 {
14630 /* Record the type. */
14637 type,
14638 token,
14643 /* Consume the token. */
14646 /* There is no valid C++ program where a non-template type is
14647 followed by a "<". That usually indicates that the user thought
14648 that the type was a template. */
14653 }
14655 /* The type-specifier must be a user-defined type. */
14657 {
14661 /* Don't gobble tokens or issue error messages if this is an
14662 optional type-specifier. */
14666 /* Look for the optional `::' operator. */
14667 global_p
14671 /* Look for the nested-name specifier. */
14672 qualified_p
14680 /* If we have seen a nested-name-specifier, and the next token
14681 is `template', then we are using the template-id production. */
14684 {
14685 /* Look for the template-id. */
14689 none_type,
14691 /* If the template-id did not name a type, we are out of
14692 luck. */
14694 {
14697 }
14698 }
14699 /* Otherwise, look for a type-name. */
14700 else
14702 /* Keep track of all name-lookups performed in class scopes. */
14704 && !global_p
14705 && !qualified_p
14709 /* If it didn't work out, we don't have a TYPE. */
14715 token,
14717 }
14719 /* If we didn't get a type-name, issue an error message. */
14721 {
14724 }
14727 {
14728 /* See if TYPE is an Objective-C type, and if so, parse and
14729 accept any protocol references following it. Do this before
14730 the cp_parser_check_for_invalid_template_id() call, because
14731 Objective-C types can be followed by '<...>' which would
14732 enclose protocol names rather than template arguments, and so
14733 everything is fine. */
14736 {
14740 /* Clobber the "unqualified" type previously entered into
14741 DECL_SPECS with the new, improved protocol-qualified version. */
14746 }
14748 /* There is no valid C++ program where a non-template type is
14749 followed by a "<". That usually indicates that the user
14750 thought that the type was a template. */
14752 none_type,
14754 }
14757 }
14759 /* Parse a type-name.
14761 type-name:
14762 class-name
14763 enum-name
14764 typedef-name
14765 simple-template-id [in c++0x]
14767 enum-name:
14768 identifier
14770 typedef-name:
14771 identifier
14773 Returns a TYPE_DECL for the type. */
14775 static tree
14777 {
14778 tree type_decl;
14780 /* We can't know yet whether it is a class-name or not. */
14782 /* Try a class-name. */
14786 none_type,
14790 /* If it's not a class-name, keep looking. */
14792 {
14794 /* It must be a typedef-name or an enum-name. */
14798 /* It is either a simple-template-id representing an
14799 instantiation of an alias template... */
14803 none_type,
14805 /* Note that this must be an instantiation of an alias template
14806 because [temp.names]/6 says:
14808 A template-id that names an alias template specialization
14809 is a type-name.
14811 Whereas [temp.names]/7 says:
14813 A simple-template-id that names a class template
14814 specialization is a class-name. */
14819 else
14823 /* ... Or a typedef-name or an enum-name. */
14825 }
14828 }
14830 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14832 enum-name:
14833 identifier
14835 typedef-name:
14836 identifier
14838 Returns a TYPE_DECL for the type. */
14840 static tree
14842 {
14843 tree type_decl;
14844 tree identifier;
14851 /* Look up the type-name. */
14858 {
14859 /* See if this is an Objective-C type. */
14864 }
14866 /* Issue an error if we did not find a type-name. */
14868 /* In Objective-C, we have the complication that class names are
14869 normally type names and start declarations (eg, the
14870 "NSObject" in "NSObject *object;"), but can be used in an
14871 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14872 is an expression. So, a classname followed by a dot is not a
14873 valid type-name. */
14876 {
14881 }
14882 /* Remember that the name was used in the definition of the
14883 current class so that we can check later to see if the
14884 meaning would have been different after the class was
14885 entirely defined. */
14891 }
14893 /* Parse an elaborated-type-specifier. Note that the grammar given
14894 here incorporates the resolution to DR68.
14896 elaborated-type-specifier:
14897 class-key :: [opt] nested-name-specifier [opt] identifier
14898 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14899 enum-key :: [opt] nested-name-specifier [opt] identifier
14900 typename :: [opt] nested-name-specifier identifier
14901 typename :: [opt] nested-name-specifier template [opt]
14902 template-id
14904 GNU extension:
14906 elaborated-type-specifier:
14907 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14908 class-key attributes :: [opt] nested-name-specifier [opt]
14909 template [opt] template-id
14910 enum attributes :: [opt] nested-name-specifier [opt] identifier
14912 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14913 declared `friend'. If IS_DECLARATION is TRUE, then this
14914 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14915 something is being declared.
14917 Returns the TYPE specified. */
14919 static tree
14923 {
14925 tree identifier;
14928 tree globalscope;
14931 /* See if we're looking at the `enum' keyword. */
14933 {
14934 /* Consume the `enum' token. */
14936 /* Remember that it's an enumeration type. */
14938 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14939 enums) is used here. */
14942 {
14946 /* Consume the `struct' or `class' and parse it anyway. */
14948 }
14949 /* Parse the attributes. */
14951 }
14952 /* Or, it might be `typename'. */
14954 RID_TYPENAME))
14955 {
14956 /* Consume the `typename' token. */
14958 /* Remember that it's a `typename' type. */
14960 }
14961 /* Otherwise it must be a class-key. */
14962 else
14963 {
14967 /* Parse the attributes. */
14969 }
14971 /* Look for the `::' operator. */
14974 /* Look for the nested-name-specifier. */
14976 {
14981 is_declaration))
14983 }
14984 else
14985 /* Even though `typename' is not present, the proposed resolution
14986 to Core Issue 180 says that in `class A<T>::B', `B' should be
14987 considered a type-name, even if `A<T>' is dependent. */
14992 is_declaration);
14993 /* For everything but enumeration types, consider a template-id.
14994 For an enumeration type, consider only a plain identifier. */
14996 {
14998 tree decl;
15000 /* Allow the `template' keyword. */
15002 /* If we didn't see `template', we don't know if there's a
15003 template-id or not. */
15006 /* Parse the template-id. */
15010 tag_type,
15011 is_declaration);
15012 /* If we didn't find a template-id, look for an ordinary
15013 identifier. */
15015 ;
15016 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15017 in effect, then we must assume that, upon instantiation, the
15018 template will correspond to a class. */
15022 typename_type,
15024 /* If the `typename' keyword is in effect and DECL is not a type
15025 decl, then type is non existent. */
15027 ;
15033 }
15036 {
15041 {
15044 }
15046 /* For a `typename', we needn't call xref_tag. */
15050 identifier,
15052 /* Look up a qualified name in the usual way. */
15054 {
15055 tree decl;
15056 tree ambiguous_decls;
15059 tag_type,
15066 /* If the lookup was ambiguous, an error will already have been
15067 issued. */
15071 /* If we are parsing friend declaration, DECL may be a
15072 TEMPLATE_DECL tree node here. However, we need to check
15073 whether this TEMPLATE_DECL results in valid code. Consider
15074 the following example:
15076 namespace N {
15077 template <class T> class C {};
15078 }
15079 class X {
15080 template <class T> friend class N::C; // #1, valid code
15081 };
15082 template <class T> class Y {
15083 friend class N::C; // #2, invalid code
15084 };
15086 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15087 name lookup of `N::C'. We see that friend declaration must
15088 be template for the code to be valid. Note that
15089 processing_template_decl does not work here since it is
15090 always 1 for the above two cases. */
15092 decl = (cp_parser_maybe_treat_template_as_class
15097 {
15100 identifier,
15103 }
15106 {
15110 allow_template);
15114 }
15116 /* Forward declarations of nested types, such as
15118 class C1::C2;
15119 class C1::C2::C3;
15121 are invalid unless all components preceding the final '::'
15122 are complete. If all enclosing types are complete, these
15123 declarations become merely pointless.
15125 Invalid forward declarations of nested types are errors
15126 caught elsewhere in parsing. Those that are pointless arrive
15127 here. */
15134 }
15135 else
15136 {
15137 /* An elaborated-type-specifier sometimes introduces a new type and
15138 sometimes names an existing type. Normally, the rule is that it
15139 introduces a new type only if there is not an existing type of
15140 the same name already in scope. For example, given:
15142 struct S {};
15143 void f() { struct S s; }
15145 the `struct S' in the body of `f' is the same `struct S' as in
15146 the global scope; the existing definition is used. However, if
15147 there were no global declaration, this would introduce a new
15148 local class named `S'.
15150 An exception to this rule applies to the following code:
15152 namespace N { struct S; }
15154 Here, the elaborated-type-specifier names a new type
15155 unconditionally; even if there is already an `S' in the
15156 containing scope this declaration names a new type.
15157 This exception only applies if the elaborated-type-specifier
15158 forms the complete declaration:
15160 [class.name]
15162 A declaration consisting solely of `class-key identifier ;' is
15163 either a redeclaration of the name in the current scope or a
15164 forward declaration of the identifier as a class name. It
15165 introduces the name into the current scope.
15167 We are in this situation precisely when the next token is a `;'.
15169 An exception to the exception is that a `friend' declaration does
15170 *not* name a new type; i.e., given:
15172 struct S { friend struct T; };
15174 `T' is not a new type in the scope of `S'.
15176 Also, `new struct S' or `sizeof (struct S)' never results in the
15177 definition of a new type; a new type can only be declared in a
15178 declaration context. */
15180 tag_scope ts;
15184 /* Friends have special name lookup rules. */
15188 CPP_SEMICOLON))
15189 /* This is a `class-key identifier ;' */
15191 else
15194 template_p =
15198 /* An unqualified name was used to reference this type, so
15199 there were no qualifying templates. */
15206 }
15207 }
15212 /* Allow attributes on forward declarations of classes. */
15214 {
15224 else
15227 }
15230 {
15231 /* Indicate whether this class was declared as a `class' or as a
15232 `struct'. */
15236 }
15238 /* A "<" cannot follow an elaborated type specifier. If that
15239 happens, the user was probably trying to form a template-id. */
15244 }
15246 /* Parse an enum-specifier.
15248 enum-specifier:
15249 enum-head { enumerator-list [opt] }
15250 enum-head { enumerator-list , } [C++0x]
15252 enum-head:
15253 enum-key identifier [opt] enum-base [opt]
15254 enum-key nested-name-specifier identifier enum-base [opt]
15256 enum-key:
15257 enum
15258 enum class [C++0x]
15259 enum struct [C++0x]
15261 enum-base: [C++0x]
15262 : type-specifier-seq
15264 opaque-enum-specifier:
15265 enum-key identifier enum-base [opt] ;
15267 GNU Extensions:
15268 enum-key attributes[opt] identifier [opt] enum-base [opt]
15269 { enumerator-list [opt] }attributes[opt]
15270 enum-key attributes[opt] identifier [opt] enum-base [opt]
15271 { enumerator-list, }attributes[opt] [C++0x]
15273 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15274 if the token stream isn't an enum-specifier after all. */
15276 static tree
15278 {
15279 tree identifier;
15281 tree prev_scope;
15283 tree attributes;
15296 /* Parse tentatively so that we can back up if we don't find a
15297 enum-specifier. */
15300 /* Caller guarantees that the current token is 'enum', an identifier
15301 possibly follows, and the token after that is an opening brace.
15302 If we don't have an identifier, fabricate an anonymous name for
15303 the enumeration being defined. */
15306 /* Parse the "class" or "struct", which indicates a scoped
15307 enumeration type in C++0x. */
15310 {
15314 /* Consume the `struct' or `class' token. */
15318 }
15322 /* Clear the qualification. */
15327 /* Figure out in what scope the declaration is being placed. */
15333 nested_name_specifier
15341 {
15342 tree name;
15346 enum_type,
15351 input_location);
15353 {
15356 {
15357 /* Are template enums allowed in ISO? */
15361 /* ignore a typename reference, for it will be solved by name
15362 in start_enum. */
15364 }
15365 }
15368 else
15371 }
15372 else
15373 {
15376 else
15377 {
15383 }
15384 }
15387 /* Check for the `:' that denotes a specified underlying type in C++0x.
15388 Note that a ':' could also indicate a bitfield width, however. */
15390 {
15391 cp_decl_specifier_seq type_specifiers;
15393 /* Consume the `:'. */
15396 /* Parse the type-specifier-seq. */
15401 /* At this point this is surely not elaborated type specifier. */
15410 /* If that didn't work, stop. */
15412 {
15418 }
15419 }
15421 /* Look for the `{' but don't consume it yet. */
15423 {
15425 {
15428 {
15431 }
15432 }
15433 /* An opaque-enum-specifier must have a ';' here. */
15436 {
15439 {
15442 }
15443 }
15444 }
15450 {
15452 {
15456 }
15458 {
15460 }
15461 }
15463 /* Issue an error message if type-definitions are forbidden here. */
15466 else
15467 /* Create the new type. We do this before consuming the opening
15468 brace so the enum will be recorded as being on the line of its
15469 tag (or the 'enum' keyword, if there is no tag). */
15473 /* If the next token is not '{' it is an opaque-enum-specifier or an
15474 elaborated-type-specifier. */
15476 {
15480 {
15481 /* The following catches invalid code such as:
15482 enum class S<int>::E { A, B, C }; */
15490 {
15494 nested_name_specifier);
15496 }
15497 /* If that scope does not contain the scope in which the
15498 class was originally declared, the program is invalid. */
15500 nested_name_specifier))
15501 {
15504 "declaration of %qD in namespace %qD which does not "
15507 else
15509 "declaration of %qD in %qD which does not "
15513 }
15514 }
15519 /* Consume the opening brace. */
15526 {
15530 }
15531 else
15532 {
15537 }
15541 /* If the next token is not '}', then there are some enumerators. */
15543 {
15547 }
15548 else
15551 /* Consume the final '}'. */
15557 }
15558 else
15559 {
15560 /* If a ';' follows, then it is an opaque-enum-specifier
15561 and additional restrictions apply. */
15563 {
15570 }
15571 }
15573 /* Look for trailing attributes to apply to this enumeration, and
15574 apply them if appropriate. */
15576 {
15580 trailing_attr,
15582 }
15584 /* Finish up the enumeration. */
15586 {
15591 }
15594 {
15596 {
15599 }
15601 {
15603 }
15604 }
15605 out:
15608 }
15610 /* Parse an enumerator-list. The enumerators all have the indicated
15611 TYPE.
15613 enumerator-list:
15614 enumerator-definition
15615 enumerator-list , enumerator-definition */
15617 static void
15619 {
15621 {
15622 /* Parse an enumerator-definition. */
15625 /* If the next token is not a ',', we've reached the end of
15626 the list. */
15629 /* Otherwise, consume the `,' and keep going. */
15631 /* If the next token is a `}', there is a trailing comma. */
15633 {
15638 }
15639 }
15640 }
15642 /* Parse an enumerator-definition. The enumerator has the indicated
15643 TYPE.
15645 enumerator-definition:
15646 enumerator
15647 enumerator = constant-expression
15649 enumerator:
15650 identifier */
15652 static void
15654 {
15655 tree identifier;
15656 tree value;
15657 location_t loc;
15659 /* Save the input location because we are interested in the location
15660 of the identifier and not the location of the explicit value. */
15663 /* Look for the identifier. */
15668 /* If the next token is an '=', then there is an explicit value. */
15670 {
15671 /* Consume the `=' token. */
15673 /* Parse the value. */
15676 NULL);
15677 }
15678 else
15681 /* If we are processing a template, make sure the initializer of the
15682 enumerator doesn't contain any bare template parameter pack. */
15686 /* integral_constant_value will pull out this expression, so make sure
15687 it's folded as appropriate. */
15690 /* Create the enumerator. */
15692 }
15694 /* Parse a namespace-name.
15696 namespace-name:
15697 original-namespace-name
15698 namespace-alias
15700 Returns the NAMESPACE_DECL for the namespace. */
15702 static tree
15704 {
15705 tree identifier;
15706 tree namespace_decl;
15710 /* Get the name of the namespace. */
15715 /* Look up the identifier in the currently active scope. Look only
15716 for namespaces, due to:
15718 [basic.lookup.udir]
15720 When looking up a namespace-name in a using-directive or alias
15721 definition, only namespace names are considered.
15723 And:
15725 [basic.lookup.qual]
15727 During the lookup of a name preceding the :: scope resolution
15728 operator, object, function, and enumerator names are ignored.
15730 (Note that cp_parser_qualifying_entity only calls this
15731 function if the token after the name is the scope resolution
15732 operator.) */
15734 none_type,
15740 /* If it's not a namespace, issue an error. */
15743 {
15748 }
15751 }
15753 /* Parse a namespace-definition.
15755 namespace-definition:
15756 named-namespace-definition
15757 unnamed-namespace-definition
15759 named-namespace-definition:
15760 original-namespace-definition
15761 extension-namespace-definition
15763 original-namespace-definition:
15764 namespace identifier { namespace-body }
15766 extension-namespace-definition:
15767 namespace original-namespace-name { namespace-body }
15769 unnamed-namespace-definition:
15770 namespace { namespace-body } */
15772 static void
15774 {
15781 {
15785 }
15786 else
15789 /* Look for the `namespace' keyword. */
15792 /* Get the name of the namespace. We do not attempt to distinguish
15793 between an original-namespace-definition and an
15794 extension-namespace-definition at this point. The semantic
15795 analysis routines are responsible for that. */
15798 else
15801 /* Parse any specified attributes. */
15804 /* Look for the `{' to start the namespace. */
15806 /* Start the namespace. */
15809 /* "inline namespace" is equivalent to a stub namespace definition
15810 followed by a strong using directive. */
15812 {
15814 /* Set up namespace association. */
15818 /* Import the contents of the inline namespace. */
15822 }
15826 /* Parse the body of the namespace. */
15832 /* Finish the namespace. */
15834 /* Look for the final `}'. */
15836 }
15838 /* Parse a namespace-body.
15840 namespace-body:
15841 declaration-seq [opt] */
15843 static void
15845 {
15847 }
15849 /* Parse a namespace-alias-definition.
15851 namespace-alias-definition:
15852 namespace identifier = qualified-namespace-specifier ; */
15854 static void
15856 {
15857 tree identifier;
15858 tree namespace_specifier;
15862 /* Look for the `namespace' keyword. */
15864 /* Look for the identifier. */
15868 /* Look for the `=' token. */
15871 {
15873 /* Skip the definition. */
15878 }
15880 /* Look for the qualified-namespace-specifier. */
15881 namespace_specifier
15883 /* Look for the `;' token. */
15886 /* Register the alias in the symbol table. */
15888 }
15890 /* Parse a qualified-namespace-specifier.
15892 qualified-namespace-specifier:
15893 :: [opt] nested-name-specifier [opt] namespace-name
15895 Returns a NAMESPACE_DECL corresponding to the specified
15896 namespace. */
15898 static tree
15900 {
15901 /* Look for the optional `::'. */
15905 /* Look for the optional nested-name-specifier. */
15913 }
15915 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15916 access declaration.
15918 using-declaration:
15919 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15920 using :: unqualified-id ;
15922 access-declaration:
15923 qualified-id ;
15925 */
15927 static bool
15930 {
15934 tree decl;
15935 tree identifier;
15936 tree qscope;
15941 {
15944 }
15945 else
15946 {
15947 /* Look for the `using' keyword. */
15950 /* Peek at the next token. */
15952 /* See if it's `typename'. */
15954 {
15955 /* Remember that we've seen it. */
15957 /* Consume the `typename' token. */
15959 }
15960 }
15962 /* Look for the optional global scope qualification. */
15963 global_scope_p
15968 /* If we saw `typename', or didn't see `::', then there must be a
15969 nested-name-specifier present. */
15971 {
15977 {
15980 }
15981 }
15982 /* Otherwise, we could be in either of the two productions. In that
15983 case, treat the nested-name-specifier as optional. */
15984 else
15994 /* Something has already gone wrong; there's no need to parse
15995 further. Since an error has occurred, the return value of
15996 cp_parser_parse_definitely will be false, as required. */
16000 /* Parse the unqualified-id. */
16008 {
16013 }
16015 /* The function we call to handle a using-declaration is different
16016 depending on what scope we are in. */
16018 ;
16021 /* [namespace.udecl]
16023 A using declaration shall not name a template-id. */
16026 else
16027 {
16029 {
16030 /* Create the USING_DECL. */
16037 {
16040 }
16041 else
16042 /* Add it to the list of members in this class. */
16044 }
16045 else
16046 {
16048 identifier,
16055 {
16058 }
16061 else
16063 }
16064 }
16066 /* Look for the final `;'. */
16071 "access declarations are deprecated "
16072 "in favour of using-declarations; "
16076 }
16078 /* Parse an alias-declaration.
16080 alias-declaration:
16081 using identifier attribute-specifier-seq [opt] = type-id */
16083 static tree
16085 {
16087 location_t id_location;
16089 cp_decl_specifier_seq decl_specs;
16093 /* Look for the `using' keyword. */
16094 cp_token *using_token
16116 /* Now we are going to parse the type-id of the declaration. */
16118 /*
16119 [dcl.type]/3 says:
16121 "A type-specifier-seq shall not define a class or enumeration
16122 unless it appears in the type-id of an alias-declaration (7.1.3) that
16123 is not the declaration of a template-declaration."
16125 In other words, if we currently are in an alias template, the
16126 type-id should not define a type.
16128 So let's set parser->type_definition_forbidden_message in that
16129 case; cp_parser_check_type_definition (called by
16130 cp_parser_class_specifier) will then emit an error if a type is
16131 defined in the type-id. */
16133 {
16137 }
16141 /* Restore the error message if need be. */
16146 {
16149 }
16154 {
16157 }
16159 /* A typedef-name can also be introduced by an alias-declaration. The
16160 identifier following the using keyword becomes a typedef-name. It has
16161 the same semantics as if it were introduced by the typedef
16162 specifier. In particular, it does not define a new type and it shall
16163 not appear in the type-id. */
16168 {
16171 ds_attribute,
16172 attrs_token);
16173 }
16175 ds_typedef,
16176 using_token);
16178 ds_alias,
16179 using_token);
16188 else
16199 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16200 added into the symbol table; otherwise, return the TYPE_DECL. */
16204 {
16208 }
16211 }
16213 /* Parse a using-directive.
16215 using-directive:
16216 using namespace :: [opt] nested-name-specifier [opt]
16217 namespace-name ; */
16219 static void
16221 {
16222 tree namespace_decl;
16223 tree attribs;
16225 /* Look for the `using' keyword. */
16227 /* And the `namespace' keyword. */
16229 /* Look for the optional `::' operator. */
16231 /* And the optional nested-name-specifier. */
16237 /* Get the namespace being used. */
16239 /* And any specified attributes. */
16241 /* Update the symbol table. */
16243 /* Look for the final `;'. */
16245 }
16247 /* Parse an asm-definition.
16249 asm-definition:
16250 asm ( string-literal ) ;
16252 GNU Extension:
16254 asm-definition:
16255 asm volatile [opt] ( string-literal ) ;
16256 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16257 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16258 : asm-operand-list [opt] ) ;
16259 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16260 : asm-operand-list [opt]
16261 : asm-clobber-list [opt] ) ;
16262 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16263 : asm-clobber-list [opt]
16264 : asm-goto-list ) ; */
16266 static void
16268 {
16269 tree string;
16274 tree asm_stmt;
16282 /* Look for the `asm' keyword. */
16284 /* See if the next token is `volatile'. */
16287 {
16288 /* Remember that we saw the `volatile' keyword. */
16290 /* Consume the token. */
16292 }
16296 {
16297 /* Remember that we saw the `goto' keyword. */
16299 /* Consume the token. */
16301 }
16302 /* Look for the opening `('. */
16305 /* Look for the string. */
16308 {
16312 }
16314 /* If we're allowing GNU extensions, check for the extended assembly
16315 syntax. Unfortunately, the `:' tokens need not be separated by
16316 a space in C, and so, for compatibility, we tolerate that here
16317 too. Doing that means that we have to treat the `::' operator as
16318 two `:' tokens. */
16323 {
16328 /* The extended syntax was used. */
16331 /* Look for outputs. */
16333 {
16334 /* Consume the `:'. */
16336 /* Parse the output-operands. */
16338 CPP_COLON)
16340 CPP_SCOPE)
16342 CPP_CLOSE_PAREN)
16348 }
16349 /* If the next token is `::', there are no outputs, and the
16350 next token is the beginning of the inputs. */
16352 /* The inputs are coming next. */
16355 /* Look for inputs. */
16358 {
16359 /* Consume the `:' or `::'. */
16361 /* Parse the output-operands. */
16363 CPP_COLON)
16365 CPP_SCOPE)
16367 CPP_CLOSE_PAREN))
16372 }
16374 /* The clobbers are coming next. */
16377 /* Look for clobbers. */
16380 {
16382 /* Consume the `:' or `::'. */
16384 /* Parse the clobbers. */
16386 CPP_COLON)
16388 CPP_CLOSE_PAREN))
16390 }
16393 /* The labels are coming next. */
16396 /* Look for labels. */
16399 {
16401 /* Consume the `:' or `::'. */
16403 /* Parse the labels. */
16405 }
16409 }
16413 /* Look for the closing `)'. */
16421 {
16422 /* Create the ASM_EXPR. */
16424 {
16427 /* If the extended syntax was not used, mark the ASM_EXPR. */
16429 {
16435 }
16436 }
16437 else
16439 }
16440 }
16442 /* Declarators [gram.dcl.decl] */
16444 /* Parse an init-declarator.
16446 init-declarator:
16447 declarator initializer [opt]
16449 GNU Extension:
16451 init-declarator:
16452 declarator asm-specification [opt] attributes [opt] initializer [opt]
16454 function-definition:
16455 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16456 function-body
16457 decl-specifier-seq [opt] declarator function-try-block
16459 GNU Extension:
16461 function-definition:
16462 __extension__ function-definition
16464 TM Extension:
16466 function-definition:
16467 decl-specifier-seq [opt] declarator function-transaction-block
16469 The DECL_SPECIFIERS apply to this declarator. Returns a
16470 representation of the entity declared. If MEMBER_P is TRUE, then
16471 this declarator appears in a class scope. The new DECL created by
16472 this declarator is returned.
16474 The CHECKS are access checks that should be performed once we know
16475 what entity is being declared (and, therefore, what classes have
16476 befriended it).
16478 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16479 for a function-definition here as well. If the declarator is a
16480 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16481 be TRUE upon return. By that point, the function-definition will
16482 have been completely parsed.
16484 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16485 is FALSE.
16487 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16488 parsed declaration if it is an uninitialized single declarator not followed
16489 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16490 if present, will not be consumed. If returned, this declarator will be
16491 created with SD_INITIALIZED but will not call cp_finish_decl. */
16493 static tree
16502 {
16506 tree prefix_attributes;
16508 tree asm_specification;
16509 tree initializer;
16511 tree scope;
16513 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16514 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16515 "(...)". */
16525 /* Gather the attributes that were provided with the
16526 decl-specifiers. */
16529 /* Assume that this is not the declarator for a function
16530 definition. */
16534 /* Default arguments are only permitted for function parameters. */
16538 /* Defer access checks while parsing the declarator; we cannot know
16539 what names are accessible until we know what is being
16540 declared. */
16543 /* Parse the declarator. */
16545 declarator
16549 member_p);
16550 /* Gather up the deferred checks. */
16555 /* If the DECLARATOR was erroneous, there's no need to go
16556 further. */
16560 /* Check that the number of template-parameter-lists is OK. */
16570 /* Figure out what scope the entity declared by the DECLARATOR is
16571 located in. `grokdeclarator' sometimes changes the scope, so
16572 we compute it now. */
16575 /* Perform any lookups in the declared type which were thought to be
16576 dependent, but are not in the scope of the declarator. */
16577 decl_specifiers->type
16580 /* If we're allowing GNU extensions, look for an
16581 asm-specification. */
16583 {
16584 /* Look for an asm-specification. */
16587 }
16588 else
16591 /* Look for attributes. */
16595 /* Peek at the next token. */
16599 {
16600 /* Check to see if the token indicates the start of a
16601 function-definition. */
16603 {
16605 {
16606 /* If a function-definition should not appear here, issue an
16607 error message. */
16611 }
16613 location_t func_brace_location
16616 /* Neither attributes nor an asm-specification are allowed
16617 on a function-definition. */
16620 "an asm-specification is not allowed "
16624 "attributes are not allowed "
16626 /* This is a function-definition. */
16629 /* Parse the function definition. */
16632 decl_specifiers,
16633 declarator,
16634 prefix_attributes);
16635 else
16636 decl =
16637 (cp_parser_function_definition_from_specifiers_and_declarator
16641 {
16642 /* This is where the prologue starts... */
16645 }
16648 }
16649 }
16651 /* [dcl.dcl]
16653 Only in function declarations for constructors, destructors, and
16654 type conversions can the decl-specifier-seq be omitted.
16656 We explicitly postpone this check past the point where we handle
16657 function-definitions because we tolerate function-definitions
16658 that are missing their return types in some modes. */
16660 {
16664 }
16666 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16670 {
16678 {
16684 }
16685 }
16686 else
16687 {
16688 /* If the init-declarator isn't initialized and isn't followed by a
16689 `,' or `;', it's not a valid init-declarator. */
16692 {
16695 else
16696 {
16699 }
16700 }
16703 }
16705 /* Because start_decl has side-effects, we should only call it if we
16706 know we're going ahead. By this point, we know that we cannot
16707 possibly be looking at any other construct. */
16710 /* If the decl specifiers were bad, issue an error now that we're
16711 sure this was intended to be a declarator. Then continue
16712 declaring the variable(s), as int, to try to cut down on further
16713 errors. */
16716 {
16719 }
16721 /* Check to see whether or not this declaration is a friend. */
16724 /* Enter the newly declared entry in the symbol table. If we're
16725 processing a declaration in a class-specifier, we wait until
16726 after processing the initializer. */
16728 {
16735 /* Adjust location of decl if declarator->id_loc is more appropriate:
16736 set, and decl wasn't merged with another decl, in which case its
16737 location would be different from input_location, and more accurate. */
16742 }
16744 /* Enter the SCOPE. That way unqualified names appearing in the
16745 initializer will be looked up in SCOPE. */
16748 /* Perform deferred access control checks, now that we know in which
16749 SCOPE the declared entity resides. */
16751 {
16754 /* If the entity being declared is a function, pretend that we
16755 are in its scope. If it is a `friend', it may have access to
16756 things that would not otherwise be accessible. */
16758 {
16761 }
16763 /* Perform access checks for template parameters. */
16766 /* Perform the access control checks for the declarator and the
16767 decl-specifiers. */
16770 /* Restore the saved value. */
16773 }
16775 /* Parse the initializer. */
16780 {
16782 {
16786 else
16787 {
16788 /* If the declaration was erroneous, we don't really
16789 know what the user intended, so just silently
16790 consume the initializer. */
16798 }
16799 }
16800 else
16801 {
16802 /* We want to record the extra mangling scope for in-class
16803 initializers of class members and initializers of static data
16804 member templates. The former involves deferring
16805 parsing of the initializer until end of class as with default
16806 arguments. So right here we only handle the latter. */
16816 }
16817 }
16819 /* The old parser allows attributes to appear after a parenthesized
16820 initializer. Mark Mitchell proposed removing this functionality
16821 on the GCC mailing lists on 2002-08-13. This parser accepts the
16822 attributes -- but ignores them. */
16829 /* A non-template declaration involving a function parameter list containing
16830 an implicit template parameter will have been made into a template. If it
16831 turns out that the resulting declaration is not an actual function then
16832 finish the template declaration here. An error message will already have
16833 been issued. */
16836 {
16838 {
16841 }
16843 }
16845 /* For an in-class declaration, use `grokfield' to create the
16846 declaration. */
16848 {
16850 {
16853 }
16861 }
16863 /* Finish processing the declaration. But, skip member
16864 declarations. */
16866 {
16869 asm_specification,
16870 /* If the initializer is in parentheses, then this is
16871 a direct-initialization, which means that an
16872 `explicit' constructor is OK. Otherwise, an
16873 `explicit' constructor cannot be used. */
16876 }
16879 /* Core issue #226 (C++0x only): A default template-argument
16880 shall not be specified in a friend class template
16881 declaration. */
16890 {
16893 else
16895 }
16898 }
16900 /* Parse a declarator.
16902 declarator:
16903 direct-declarator
16904 ptr-operator declarator
16906 abstract-declarator:
16907 ptr-operator abstract-declarator [opt]
16908 direct-abstract-declarator
16910 GNU Extensions:
16912 declarator:
16913 attributes [opt] direct-declarator
16914 attributes [opt] ptr-operator declarator
16916 abstract-declarator:
16917 attributes [opt] ptr-operator abstract-declarator [opt]
16918 attributes [opt] direct-abstract-declarator
16920 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16921 detect constructor, destructor or conversion operators. It is set
16922 to -1 if the declarator is a name, and +1 if it is a
16923 function. Otherwise it is set to zero. Usually you just want to
16924 test for >0, but internally the negative value is used.
16926 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16927 a decl-specifier-seq unless it declares a constructor, destructor,
16928 or conversion. It might seem that we could check this condition in
16929 semantic analysis, rather than parsing, but that makes it difficult
16930 to handle something like `f()'. We want to notice that there are
16931 no decl-specifiers, and therefore realize that this is an
16932 expression, not a declaration.)
16934 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16935 the declarator is a direct-declarator of the form "(...)".
16937 MEMBER_P is true iff this declarator is a member-declarator. */
16941 cp_parser_declarator_kind dcl_kind,
16945 {
16948 cp_cv_quals cv_quals;
16949 tree class_type;
16952 /* Assume this is not a constructor, destructor, or type-conversion
16953 operator. */
16960 /* Check for the ptr-operator production. */
16962 /* Parse the ptr-operator. */
16968 /* If that worked, then we have a ptr-operator. */
16970 {
16971 /* If a ptr-operator was found, then this declarator was not
16972 parenthesized. */
16975 /* The dependent declarator is optional if we are parsing an
16976 abstract-declarator. */
16980 /* Parse the dependent declarator. */
16986 /* If we are parsing an abstract-declarator, we must handle the
16987 case where the dependent declarator is absent. */
16992 declarator = cp_parser_make_indirect_declarator
16994 }
16995 /* Everything else is a direct-declarator. */
16996 else
16997 {
17000 CPP_OPEN_PAREN);
17002 ctor_dtor_or_conv_p,
17003 member_p);
17004 }
17009 }
17011 /* Parse a direct-declarator or direct-abstract-declarator.
17013 direct-declarator:
17014 declarator-id
17015 direct-declarator ( parameter-declaration-clause )
17016 cv-qualifier-seq [opt]
17017 ref-qualifier [opt]
17018 exception-specification [opt]
17019 direct-declarator [ constant-expression [opt] ]
17020 ( declarator )
17022 direct-abstract-declarator:
17023 direct-abstract-declarator [opt]
17024 ( parameter-declaration-clause )
17025 cv-qualifier-seq [opt]
17026 ref-qualifier [opt]
17027 exception-specification [opt]
17028 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17029 ( abstract-declarator )
17031 Returns a representation of the declarator. DCL_KIND is
17032 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17033 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17034 we are parsing a direct-declarator. It is
17035 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17036 of ambiguity we prefer an abstract declarator, as per
17037 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17038 cp_parser_declarator. */
17042 cp_parser_declarator_kind dcl_kind,
17045 {
17055 {
17056 /* Peek at the next token. */
17059 {
17060 /* This is either a parameter-declaration-clause, or a
17061 parenthesized declarator. When we know we are parsing a
17062 named declarator, it must be a parenthesized declarator
17063 if FIRST is true. For instance, `(int)' is a
17064 parameter-declaration-clause, with an omitted
17065 direct-abstract-declarator. But `((*))', is a
17066 parenthesized abstract declarator. Finally, when T is a
17067 template parameter `(T)' is a
17068 parameter-declaration-clause, and not a parenthesized
17069 named declarator.
17071 We first try and parse a parameter-declaration-clause,
17072 and then try a nested declarator (if FIRST is true).
17074 It is not an error for it not to be a
17075 parameter-declaration-clause, even when FIRST is
17076 false. Consider,
17078 int i (int);
17079 int i (3);
17081 The first is the declaration of a function while the
17082 second is the definition of a variable, including its
17083 initializer.
17085 Having seen only the parenthesis, we cannot know which of
17086 these two alternatives should be selected. Even more
17087 complex are examples like:
17089 int i (int (a));
17090 int i (int (3));
17092 The former is a function-declaration; the latter is a
17093 variable initialization.
17095 Thus again, we try a parameter-declaration-clause, and if
17096 that fails, we back out and return. */
17099 {
17100 tree params;
17103 /* In a member-declarator, the only valid interpretation
17104 of a parenthesis is the start of a
17105 parameter-declaration-clause. (It is invalid to
17106 initialize a static data member with a parenthesized
17107 initializer; only the "=" form of initialization is
17108 permitted.) */
17112 /* Consume the `('. */
17115 {
17116 /* If this is going to be an abstract declarator, we're
17117 in a declarator and we can't have default args. */
17120 }
17124 /* Parse the parameter-declaration-clause. */
17127 /* Consume the `)'. */
17130 /* If all went well, parse the cv-qualifier-seq,
17131 ref-qualifier and the exception-specification. */
17133 {
17134 cp_cv_quals cv_quals;
17135 cp_virt_specifiers virt_specifiers;
17136 cp_ref_qualifier ref_qual;
17137 tree exception_specification;
17138 tree late_return;
17139 tree attrs;
17149 /* Parse the cv-qualifier-seq. */
17151 /* Parse the ref-qualifier. */
17153 /* And the exception-specification. */
17154 exception_specification
17159 /* In here, we handle cases where attribute is used after
17160 the function declaration. For example:
17161 void func (int x) __attribute__((vector(..))); */
17164 {
17168 CPP_SEMICOLON)
17170 CPP_OPEN_BRACE))
17173 ;
17174 else
17176 }
17177 late_return = (cp_parser_late_return_type_opt
17182 /* Parse the virt-specifier-seq. */
17185 /* Create the function-declarator. */
17187 params,
17188 cv_quals,
17189 virt_specifiers,
17190 ref_qual,
17191 exception_specification,
17192 late_return);
17194 /* Any subsequent parameter lists are to do with
17195 return type, so are not those of the declared
17196 function. */
17198 }
17200 /* Remove the function parms from scope. */
17204 /* Repeat the main loop. */
17206 }
17208 /* If this is the first, we can try a parenthesized
17209 declarator. */
17211 {
17217 /* Consume the `('. */
17219 /* Parse the nested declarator. */
17222 declarator
17225 member_p);
17228 /* Expect a `)'. */
17235 }
17236 /* Otherwise, we must be done. */
17237 else
17239 }
17243 {
17244 /* Parse an array-declarator. */
17253 /* Consume the `['. */
17255 /* Peek at the next token. */
17257 /* If the next token is `]', then there is no
17258 constant-expression. */
17260 {
17262 bounds
17272 {
17273 /* Normally, the array bound must be an integral constant
17274 expression. However, as an extension, we allow VLAs
17275 in function scopes as long as they aren't part of a
17276 parameter declaration. */
17280 }
17283 {
17284 /* Remember this wasn't a constant-expression. */
17287 }
17288 }
17289 else
17291 /* Look for the closing `]'. */
17293 {
17296 }
17301 }
17303 {
17304 {
17305 tree qualifying_scope;
17306 tree unqualified_name;
17307 tree attrs;
17308 special_function_kind sfk;
17313 /* Parse a declarator-id */
17316 {
17319 /* If we see an ellipsis, we should be looking at a
17320 parameter pack. */
17322 {
17323 /* Consume the `...' */
17327 }
17328 }
17331 unqualified_name
17335 {
17339 {
17340 /* Check whether an error occurred. */
17343 /* We already consumed the ellipsis to mark a
17344 parameter pack, but we have no way to report it,
17345 so abort the tentative parse. We will be exiting
17346 immediately anyway. */
17348 }
17349 else
17355 && (qualifying_scope
17357 {
17360 }
17361 }
17366 {
17371 }
17377 {
17378 /* In the declaration of a member of a template class
17379 outside of the class itself, the SCOPE will sometimes
17380 be a TYPENAME_TYPE. For example, given:
17382 template <typename T>
17383 int S<T>::R::i = 3;
17385 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17386 this context, we must resolve S<T>::R to an ordinary
17387 type, rather than a typename type.
17389 The reason we normally avoid resolving TYPENAME_TYPEs
17390 is that a specialization of `S' might render
17391 `S<T>::R' not a type. However, if `S' is
17392 specialized, then this `i' will not be used, so there
17393 is no harm in resolving the types here. */
17394 tree type;
17396 /* Resolve the TYPENAME_TYPE. */
17399 /* If that failed, the declarator is invalid. */
17401 {
17404 "cannot define member of dependent typedef "
17406 else
17411 }
17413 }
17418 {
17419 tree class_type;
17424 else
17428 {
17431 {
17434 {
17438 "use %<%T::%D%> instead of %<%T::%D%> to "
17440 class_type,
17445 }
17446 else
17448 }
17449 else
17450 {
17451 /* We do not attempt to print the declarator
17452 here because we do not have enough
17453 information about its original syntactic
17454 form. */
17458 }
17459 }
17462 {
17468 for an anonymous type, even if the type
17469 got a name for linkage purposes. */
17472 class_type))
17473 {
17476 }
17484 }
17485 }
17487 unqualified_name,
17488 sfk);
17495 }
17497 handle_declarator:;
17500 {
17501 /* Any names that appear after the declarator-id for a
17502 member are looked up in the containing scope. */
17504 {
17505 /* But declarations with qualified-ids can't appear in a
17506 function. */
17510 }
17512 }
17516 /* Default args are only allowed on function
17517 declarations. */
17519 else
17523 }
17524 /* We're done. */
17525 else
17527 }
17529 /* For an abstract declarator, we might wind up with nothing at this
17530 point. That's an error; the declarator is not optional. */
17534 /* If we entered a scope, we must exit it now. */
17542 }
17544 /* Parse a ptr-operator.
17546 ptr-operator:
17547 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17548 * cv-qualifier-seq [opt]
17549 &
17550 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17551 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17553 GNU Extension:
17555 ptr-operator:
17556 & cv-qualifier-seq [opt]
17558 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17559 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17560 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17561 filled in with the TYPE containing the member. *CV_QUALS is
17562 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17563 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17564 Note that the tree codes returned by this function have nothing
17565 to do with the types of trees that will be eventually be created
17566 to represent the pointer or reference type being parsed. They are
17567 just constants with suggestive names. */
17568 static enum tree_code
17573 {
17578 /* Assume that it's not a pointer-to-member. */
17580 /* And that there are no cv-qualifiers. */
17583 /* Peek at the next token. */
17586 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17596 {
17597 /* Consume the `*', `&' or `&&'. */
17600 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17601 `&', if we are allowing GNU extensions. (The only qualifier
17602 that can legally appear after `&' is `restrict', but that is
17603 enforced during semantic analysis. */
17611 }
17612 else
17613 {
17614 /* Try the pointer-to-member case. */
17616 /* Look for the optional `::' operator. */
17619 /* Look for the nested-name specifier. */
17626 /* If we found it, and the next token is a `*', then we are
17627 indeed looking at a pointer-to-member operator. */
17630 {
17631 /* Indicate that the `*' operator was used. */
17639 else
17640 {
17641 /* The type of which the member is a member is given by the
17642 current SCOPE. */
17644 /* The next name will not be qualified. */
17648 /* Look for optional c++11 attributes. */
17652 /* Look for the optional cv-qualifier-seq. */
17654 }
17655 }
17656 /* If that didn't work we don't have a ptr-operator. */
17659 }
17662 }
17664 /* Parse an (optional) cv-qualifier-seq.
17666 cv-qualifier-seq:
17667 cv-qualifier cv-qualifier-seq [opt]
17669 cv-qualifier:
17670 const
17671 volatile
17673 GNU Extension:
17675 cv-qualifier:
17676 __restrict__
17678 Returns a bitmask representing the cv-qualifiers. */
17680 static cp_cv_quals
17682 {
17686 {
17688 cp_cv_quals cv_qualifier;
17690 /* Peek at the next token. */
17692 /* See if it's a cv-qualifier. */
17694 {
17710 }
17716 {
17719 }
17720 else
17721 {
17724 }
17725 }
17728 }
17730 /* Parse an (optional) ref-qualifier
17732 ref-qualifier:
17733 &
17734 &&
17736 Returns cp_ref_qualifier representing ref-qualifier. */
17738 static cp_ref_qualifier
17740 {
17743 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17748 {
17753 {
17765 }
17770 {
17773 }
17774 else
17775 {
17778 }
17779 }
17782 }
17784 /* Parse an (optional) virt-specifier-seq.
17786 virt-specifier-seq:
17787 virt-specifier virt-specifier-seq [opt]
17789 virt-specifier:
17790 override
17791 final
17793 Returns a bitmask representing the virt-specifiers. */
17795 static cp_virt_specifiers
17797 {
17801 {
17803 cp_virt_specifiers virt_specifier;
17805 /* Peek at the next token. */
17807 /* See if it's a virt-specifier-qualifier. */
17811 {
17814 }
17816 {
17819 }
17821 {
17823 }
17824 else
17828 {
17831 }
17832 else
17833 {
17836 }
17837 }
17839 }
17841 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17842 is in scope even though it isn't real. */
17844 static void
17846 {
17847 tree this_parm;
17850 {
17851 /* We don't clear this between NSDMIs. Is it already what we want? */
17856 }
17859 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17861 current_class_ref
17864 }
17866 /* Return true iff our current scope is a non-static data member
17867 initializer. */
17869 bool
17871 {
17872 /* We recognize NSDMI context by the context-less 'this' pointer set up
17873 by the function above. */
17877 }
17879 /* Parse a late-specified return type, if any. This is not a separate
17880 non-terminal, but part of a function declarator, which looks like
17882 -> trailing-type-specifier-seq abstract-declarator(opt)
17884 Returns the type indicated by the type-id.
17886 In addition to this this parses any queued up omp declare simd
17887 clauses and Cilk Plus SIMD-enabled function's vector attributes.
17889 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17890 function. */
17892 static tree
17894 cp_cv_quals quals)
17895 {
17899 && declarator
17905 /* Peek at the next token. */
17907 /* A late-specified return type is indicated by an initial '->'. */
17914 {
17915 /* DR 1207: 'this' is in scope in the trailing return type. */
17917 }
17920 {
17921 /* Consume the ->. */
17925 }
17928 declarator->std_attributes
17932 declarator->std_attributes
17937 {
17940 }
17943 }
17945 /* Parse a declarator-id.
17947 declarator-id:
17948 id-expression
17949 :: [opt] nested-name-specifier [opt] type-name
17951 In the `id-expression' case, the value returned is as for
17952 cp_parser_id_expression if the id-expression was an unqualified-id.
17953 If the id-expression was a qualified-id, then a SCOPE_REF is
17954 returned. The first operand is the scope (either a NAMESPACE_DECL
17955 or TREE_TYPE), but the second is still just a representation of an
17956 unqualified-id. */
17958 static tree
17960 {
17961 tree id;
17962 /* The expression must be an id-expression. Assume that qualified
17963 names are the names of types so that:
17965 template <class T>
17966 int S<T>::R::i = 3;
17968 will work; we must treat `S<T>::R' as the name of a type.
17969 Similarly, assume that qualified names are templates, where
17970 required, so that:
17972 template <class T>
17973 int S<T>::R<T>::i = 3;
17975 will work, too. */
17981 optional_p);
17985 }
17987 /* Parse a type-id.
17989 type-id:
17990 type-specifier-seq abstract-declarator [opt]
17992 Returns the TYPE specified. */
17994 static tree
17997 {
17998 cp_decl_specifier_seq type_specifier_seq;
18001 /* Parse the type-specifier-seq. */
18003 is_trailing_return,
18008 /* There might or might not be an abstract declarator. */
18010 /* Look for the declarator. */
18011 abstract_declarator
18015 /* Check to see if there really was a declarator. */
18020 /* None of the valid uses of 'auto' in C++14 involve the type-id
18021 nonterminal, but it is valid in a trailing-return-type. */
18024 {
18025 /* A type-id with type 'auto' is only ok if the abstract declarator
18026 is a function declarator with a late-specified return type. */
18031 else
18032 {
18035 }
18036 }
18039 is_template_arg);
18040 }
18043 {
18045 }
18048 {
18049 tree r;
18051 parser->type_definition_forbidden_message
18056 {
18059 }
18061 }
18064 {
18066 }
18068 /* Parse a type-specifier-seq.
18070 type-specifier-seq:
18071 type-specifier type-specifier-seq [opt]
18073 GNU extension:
18075 type-specifier-seq:
18076 attributes type-specifier-seq [opt]
18078 If IS_DECLARATION is true, we are at the start of a "condition" or
18079 exception-declaration, so we might be followed by a declarator-id.
18081 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18082 i.e. we've just seen "->".
18084 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18086 static void
18091 {
18096 /* Clear the TYPE_SPECIFIER_SEQ. */
18099 /* In the context of a trailing return type, enum E { } is an
18100 elaborated-type-specifier followed by a function-body, not an
18101 enum-specifier. */
18105 /* Parse the type-specifiers and attributes. */
18107 {
18108 tree type_specifier;
18111 /* Check for attributes first. */
18113 {
18118 }
18120 /* record the token of the beginning of the type specifier seq,
18121 for error reporting purposes*/
18125 /* Look for the type-specifier. */
18127 flags,
18128 type_specifier_seq,
18130 NULL,
18133 {
18134 /* If the first type-specifier could not be found, this is not a
18135 type-specifier-seq at all. */
18137 {
18138 /* Set in_declarator_p to avoid skipping to the semicolon. */
18150 }
18151 /* If subsequent type-specifiers could not be found, the
18152 type-specifier-seq is complete. */
18154 }
18157 /* The standard says that a condition can be:
18159 type-specifier-seq declarator = assignment-expression
18161 However, given:
18163 struct S {};
18164 if (int S = ...)
18166 we should treat the "S" as a declarator, not as a
18167 type-specifier. The standard doesn't say that explicitly for
18168 type-specifier-seq, but it does say that for
18169 decl-specifier-seq in an ordinary declaration. Perhaps it
18170 would be clearer just to allow a decl-specifier-seq here, and
18171 then add a semantic restriction that if any decl-specifiers
18172 that are not type-specifiers appear, the program is invalid. */
18175 }
18176 }
18178 /* Return whether the function currently being declared has an associated
18179 template parameter list. */
18181 static bool
18183 {
18196 }
18198 /* Parse a parameter-declaration-clause.
18200 parameter-declaration-clause:
18201 parameter-declaration-list [opt] ... [opt]
18202 parameter-declaration-list , ...
18204 Returns a representation for the parameter declarations. A return
18205 value of NULL indicates a parameter-declaration-clause consisting
18206 only of an ellipsis. */
18208 static tree
18210 {
18211 tree parameters;
18220 parser->auto_is_implicit_function_template_parm_p
18222 }
18228 && !processing_template_parmlist
18234 /* Peek at the next token. */
18236 /* Check for trivial parameter-declaration-clauses. */
18238 {
18239 /* Consume the `...' token. */
18242 }
18244 /* There are no parameters. */
18245 {
18246 #ifndef NO_IMPLICIT_EXTERN_C
18251 else
18252 #endif
18254 }
18255 /* Check for `(void)', too, which is a special case. */
18259 {
18260 /* Consume the `void' token. */
18262 /* There are no parameters. */
18264 }
18266 /* Parse the parameter-declaration-list. */
18268 /* If a parse error occurred while parsing the
18269 parameter-declaration-list, then the entire
18270 parameter-declaration-clause is erroneous. */
18274 /* Peek at the next token. */
18276 /* If it's a `,', the clause should terminate with an ellipsis. */
18278 {
18279 /* Consume the `,'. */
18281 /* Expect an ellipsis. */
18282 ellipsis_p
18284 }
18285 /* It might also be `...' if the optional trailing `,' was
18286 omitted. */
18288 {
18289 /* Consume the `...' token. */
18291 /* And remember that we saw it. */
18293 }
18294 else
18297 /* Finish the parameter list. */
18302 }
18304 /* Parse a parameter-declaration-list.
18306 parameter-declaration-list:
18307 parameter-declaration
18308 parameter-declaration-list , parameter-declaration
18310 Returns a representation of the parameter-declaration-list, as for
18311 cp_parser_parameter_declaration_clause. However, the
18312 `void_list_node' is never appended to the list. Upon return,
18313 *IS_ERROR will be true iff an error occurred. */
18315 static tree
18317 {
18323 /* Assume all will go well. */
18325 /* The special considerations that apply to a function within an
18326 unbraced linkage specifications do not apply to the parameters
18327 to the function. */
18328 saved_in_unbraced_linkage_specification_p
18332 /* Look for more parameters. */
18334 {
18342 /* Parse the parameter. */
18343 parameter
18348 /* We don't know yet if the enclosing context is deprecated, so wait
18349 and warn in grokparms if appropriate. */
18353 {
18354 /* If a function parameter pack was specified and an implicit template
18355 parameter was introduced during cp_parser_parameter_declaration,
18356 change any implicit parameters introduced into packs. */
18360 {
18368 }
18372 PARM,
18375 }
18379 /* If a parse error occurred parsing the parameter declaration,
18380 then the entire parameter-declaration-list is erroneous. */
18382 {
18386 }
18396 {
18400 }
18402 /* Add the new parameter to the list. */
18406 /* Peek at the next token. */
18409 /* These are for Objective-C++ */
18412 /* The parameter-declaration-list is complete. */
18415 {
18418 /* Peek at the next token. */
18420 /* If it's an ellipsis, then the list is complete. */
18423 /* Otherwise, there must be more parameters. Consume the
18424 `,'. */
18426 /* When parsing something like:
18428 int i(float f, double d)
18430 we can tell after seeing the declaration for "f" that we
18431 are not looking at an initialization of a variable "i",
18432 but rather at the declaration of a function "i".
18434 Due to the fact that the parsing of template arguments
18435 (as specified to a template-id) requires backtracking we
18436 cannot use this technique when inside a template argument
18437 list. */
18441 /* However, a parameter-declaration of the form
18442 "float(f)" (which is a valid declaration of a
18443 parameter "f") can also be interpreted as an
18444 expression (the conversion of "f" to "float"). */
18447 }
18448 else
18449 {
18457 }
18458 }
18460 parser->in_unbraced_linkage_specification_p
18463 /* Reset implicit_template_scope if we are about to leave the function
18464 parameter list that introduced it. Note that for out-of-line member
18465 definitions, there will be one or more class scopes before we get to
18466 the template parameter scope. */
18470 {
18474 {
18477 }
18478 }
18481 }
18483 /* Parse a parameter declaration.
18485 parameter-declaration:
18486 decl-specifier-seq ... [opt] declarator
18487 decl-specifier-seq declarator = assignment-expression
18488 decl-specifier-seq ... [opt] abstract-declarator [opt]
18489 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18491 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18492 declares a template parameter. (In that case, a non-nested `>'
18493 token encountered during the parsing of the assignment-expression
18494 is not interpreted as a greater-than operator.)
18496 Returns a representation of the parameter, or NULL if an error
18497 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18498 true iff the declarator is of the form "(p)". */
18504 {
18506 cp_decl_specifier_seq decl_specifiers;
18508 tree default_argument;
18512 /* In a template parameter, `>' is not an operator.
18514 [temp.param]
18516 When parsing a default template-argument for a non-type
18517 template-parameter, the first non-nested `>' is taken as the end
18518 of the template parameter-list rather than a greater-than
18519 operator. */
18521 /* Type definitions may not appear in parameter types. */
18523 parser->type_definition_forbidden_message
18526 /* Parse the declaration-specifiers. */
18528 CP_PARSER_FLAGS_NONE,
18532 /* Complain about missing 'typename' or other invalid type names. */
18537 /* If an error occurred, there's no reason to attempt to parse the
18538 rest of the declaration. */
18540 {
18543 }
18545 /* Peek at the next token. */
18548 /* If the next token is a `)', `,', `=', `>', or `...', then there
18549 is no declarator. However, when variadic templates are enabled,
18550 there may be a declarator following `...'. */
18555 {
18559 }
18560 /* Otherwise, there should be a declarator. */
18561 else
18562 {
18566 /* After seeing a decl-specifier-seq, if the next token is not a
18567 "(", there is no possibility that the code is a valid
18568 expression. Therefore, if parsing tentatively, we commit at
18569 this point. */
18571 /* In an expression context, having seen:
18573 (int((char ...
18575 we cannot be sure whether we are looking at a
18576 function-type (taking a "char" as a parameter) or a cast
18577 of some object of type "char" to "int". */
18583 /* Parse the declarator. */
18586 CP_PARSER_DECLARATOR_EITHER,
18588 parenthesized_p,
18591 /* After the declarator, allow more attributes. */
18592 decl_specifiers.attributes
18595 }
18597 /* If the next token is an ellipsis, and we have not seen a
18598 declarator name, and the type of the declarator contains parameter
18599 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18600 a parameter pack expansion expression. Otherwise, leave the
18601 ellipsis for a C-style variadic function. */
18604 {
18615 {
18616 /* Consume the `...'. */
18620 /* Build a pack expansion type */
18623 else
18625 }
18626 }
18628 /* The restriction on defining new types applies only to the type
18629 of the parameter, not to the default argument. */
18632 /* If the next token is `=', then process a default argument. */
18634 {
18636 /* If we are defining a class, then the tokens that make up the
18637 default argument must be saved and processed later. */
18642 /* Outside of a class definition, we can just parse the
18643 assignment-expression. */
18644 else
18645 default_argument
18649 {
18652 else
18653 {
18655 "default arguments are only "
18658 }
18659 }
18663 {
18664 /* Find the name of the parameter pack. */
18671 template_parm_p
18677 else
18679 template_parm_p
18686 }
18687 }
18688 else
18692 declarator,
18693 default_argument);
18694 }
18696 /* Parse a default argument and return it.
18698 TEMPLATE_PARM_P is true if this is a default argument for a
18699 non-type template parameter. */
18700 static tree
18702 {
18708 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18709 set correctly. */
18712 /* Local variable names (and the `this' keyword) may not
18713 appear in a default argument. */
18716 /* Parse the assignment-expression. */
18721 /* The "this" pointer is not valid in a default argument. */
18723 {
18728 }
18729 default_argument
18731 /* Restore the "this" pointer. */
18733 {
18736 }
18745 }
18747 /* Parse a function-body.
18749 function-body:
18750 compound_statement */
18752 static void
18754 {
18756 }
18758 /* Parse a ctor-initializer-opt followed by a function-body. Return
18759 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18760 is true we are parsing a function-try-block. */
18762 static bool
18765 {
18773 /* Begin the function body. */
18775 /* Parse the optional ctor-initializer. */
18778 /* If we're parsing a constexpr constructor definition, we need
18779 to check that the constructor body is indeed empty. However,
18780 before we get to cp_parser_function_body lot of junk has been
18781 generated, so we can't just check that we have an empty block.
18782 Rather we take a snapshot of the outermost block, and check whether
18783 cp_parser_function_body changed its state. */
18785 {
18789 }
18790 /* Parse the function-body. */
18794 /* Finish the function body. */
18798 }
18800 /* Parse an initializer.
18802 initializer:
18803 = initializer-clause
18804 ( expression-list )
18806 Returns an expression representing the initializer. If no
18807 initializer is present, NULL_TREE is returned.
18809 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18810 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18811 set to TRUE if there is no initializer present. If there is an
18812 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18813 is set to true; otherwise it is set to false. */
18815 static tree
18818 {
18820 tree init;
18822 /* Peek at the next token. */
18825 /* Let our caller know whether or not this initializer was
18826 parenthesized. */
18828 /* Assume that the initializer is constant. */
18832 {
18833 /* Consume the `='. */
18835 /* Parse the initializer-clause. */
18837 }
18839 {
18844 non_constant_p);
18849 }
18851 {
18856 }
18857 else
18858 {
18859 /* Anything else is an error. */
18862 }
18865 }
18867 /* Parse an initializer-clause.
18869 initializer-clause:
18870 assignment-expression
18871 braced-init-list
18873 Returns an expression representing the initializer.
18875 If the `assignment-expression' production is used the value
18876 returned is simply a representation for the expression.
18878 Otherwise, calls cp_parser_braced_list. */
18880 static tree
18882 {
18883 tree initializer;
18885 /* Assume the expression is constant. */
18888 /* If it is not a `{', then we are looking at an
18889 assignment-expression. */
18891 {
18892 initializer
18895 non_constant_p);
18896 }
18897 else
18901 }
18903 /* Parse a brace-enclosed initializer list.
18905 braced-init-list:
18906 { initializer-list , [opt] }
18907 { }
18909 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18910 the elements of the initializer-list (or NULL, if the last
18911 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18912 NULL_TREE. There is no way to detect whether or not the optional
18913 trailing `,' was provided. NON_CONSTANT_P is as for
18914 cp_parser_initializer. */
18916 static tree
18918 {
18919 tree initializer;
18921 /* Consume the `{' token. */
18923 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18925 /* If it's not a `}', then there is a non-trivial initializer. */
18927 {
18928 /* Parse the initializer list. */
18931 /* A trailing `,' token is allowed. */
18934 }
18935 else
18937 /* Now, there should be a trailing `}'. */
18941 }
18943 /* Parse an initializer-list.
18945 initializer-list:
18946 initializer-clause ... [opt]
18947 initializer-list , initializer-clause ... [opt]
18949 GNU Extension:
18951 initializer-list:
18952 designation initializer-clause ...[opt]
18953 initializer-list , designation initializer-clause ...[opt]
18955 designation:
18956 . identifier =
18957 identifier :
18958 [ constant-expression ] =
18960 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18961 for the initializer. If the INDEX of the elt is non-NULL, it is the
18962 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18963 as for cp_parser_initializer. */
18967 {
18970 /* Assume all of the expressions are constant. */
18973 /* Parse the rest of the list. */
18975 {
18977 tree designator;
18978 tree initializer;
18981 /* If the next token is an identifier and the following one is a
18982 colon, we are looking at the GNU designated-initializer
18983 syntax. */
18987 {
18988 /* Warn the user that they are using an extension. */
18991 /* Consume the identifier. */
18993 /* Consume the `:'. */
18995 }
18996 /* Also handle the C99 syntax, '. id ='. */
19001 {
19002 /* Warn the user that they are using an extension. */
19005 /* Consume the `.'. */
19007 /* Consume the identifier. */
19009 /* Consume the `='. */
19011 }
19012 /* Also handle C99 array designators, '[ const ] ='. */
19016 {
19017 /* In C++11, [ could start a lambda-introducer. */
19029 }
19030 else
19033 /* Parse the initializer. */
19036 /* If any clause is non-constant, so is the entire initializer. */
19040 /* If we have an ellipsis, this is an initializer pack
19041 expansion. */
19043 {
19044 /* Consume the `...'. */
19047 /* Turn the initializer into an initializer expansion. */
19049 }
19051 /* Add it to the vector. */
19054 /* If the next token is not a comma, we have reached the end of
19055 the list. */
19059 /* Peek at the next token. */
19061 /* If the next token is a `}', then we're still done. An
19062 initializer-clause can have a trailing `,' after the
19063 initializer-list and before the closing `}'. */
19067 /* Consume the `,' token. */
19069 }
19072 }
19074 /* Classes [gram.class] */
19076 /* Parse a class-name.
19078 class-name:
19079 identifier
19080 template-id
19082 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19083 to indicate that names looked up in dependent types should be
19084 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19085 keyword has been used to indicate that the name that appears next
19086 is a template. TAG_TYPE indicates the explicit tag given before
19087 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19088 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19089 is the class being defined in a class-head.
19091 Returns the TYPE_DECL representing the class. */
19093 static tree
19101 {
19102 tree decl;
19103 tree scope;
19108 /* All class-names start with an identifier. */
19111 {
19114 }
19116 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19117 to a template-id, so we save it here. */
19122 /* Any name names a type if we're following the `typename' keyword
19123 in a qualified name where the enclosing scope is type-dependent. */
19126 /* Handle the common case (an identifier, but not a template-id)
19127 efficiently. */
19130 {
19134 /* Look for the identifier. */
19138 /* If the next token isn't an identifier, we are certainly not
19139 looking at a class-name. */
19142 /* If we know this is a type-name, there's no need to look it
19143 up. */
19146 else
19147 {
19148 tree ambiguous_decls;
19149 /* If we already know that this lookup is ambiguous, then
19150 we've already issued an error message; there's no reason
19151 to check again. */
19153 {
19156 }
19157 /* If the next token is a `::', then the name must be a type
19158 name.
19160 [basic.lookup.qual]
19162 During the lookup for a name preceding the :: scope
19163 resolution operator, object, function, and enumerator
19164 names are ignored. */
19167 /* Look up the name. */
19169 tag_type,
19172 check_dependency_p,
19176 {
19180 }
19181 }
19182 }
19183 else
19184 {
19185 /* Try a template-id. */
19187 check_dependency_p,
19188 tag_type,
19189 is_declaration);
19192 }
19196 /* If this is a typename, create a TYPENAME_TYPE. */
19198 {
19203 }
19207 /* Check to see that it is really the name of a class. */
19211 /* Situations like this:
19213 template <typename T> struct A {
19214 typename T::template X<int>::I i;
19215 };
19217 are problematic. Is `T::template X<int>' a class-name? The
19218 standard does not seem to be definitive, but there is no other
19219 valid interpretation of the following `::'. Therefore, those
19220 names are considered class-names. */
19221 {
19225 }
19229 /* In Objective-C 2.0, a classname followed by '.' starts a
19230 dot-syntax expression, and it's not a type-name. */
19242 }
19244 /* Parse a class-specifier.
19246 class-specifier:
19247 class-head { member-specification [opt] }
19249 Returns the TREE_TYPE representing the class. */
19251 static tree
19253 {
19254 tree type;
19268 /* Parse the class-head. */
19271 /* If the class-head was a semantic disaster, skip the entire body
19272 of the class. */
19274 {
19278 }
19280 /* Look for the `{'. */
19282 {
19285 }
19289 /* Issue an error message if type-definitions are forbidden here. */
19291 /* Remember that we are defining one more class. */
19293 /* Inside the class, surrounding template-parameter-lists do not
19294 apply. */
19295 saved_num_template_parameter_lists
19298 /* We are not in a function body. */
19301 /* Or in a loop. */
19304 /* Or in a switch. */
19307 /* We are not immediately inside an extern "lang" block. */
19308 saved_in_unbraced_linkage_specification_p
19312 /* Start the class. */
19314 {
19317 }
19321 /* If the type is erroneous, skip the entire body of the class. */
19323 else
19324 /* Parse the member-specification. */
19327 /* Look for the trailing `}'. */
19329 /* Look for trailing attributes to apply to this class. */
19337 /* We've finished a type definition. Check for the common syntax
19338 error of forgetting a semicolon after the definition. We need to
19339 be careful, as we can't just check for not-a-semicolon and be done
19340 with it; the user might have typed:
19342 class X { } c = ...;
19343 class X { } *p = ...;
19345 and so forth. Instead, enumerate all the possible tokens that
19346 might follow this production; if we don't see one of them, then
19347 complain and silently insert the semicolon. */
19348 {
19353 /* Don't try to parse c++11 attributes here. As per the
19354 grammar, that should be a task for
19355 cp_parser_decl_specifier_seq. */
19359 {
19370 /* While it's legal for type qualifiers and storage class
19371 specifiers to follow type definitions in the grammar, only
19372 compiler testsuites contain code like that. Assume that if
19373 we see such code, then what we're really seeing is a case
19374 like:
19376 class X { }
19377 const <type> var = ...;
19379 or
19381 class Y { }
19382 static <type> func (...) ...
19384 i.e. the qualifier or specifier applies to the next
19385 declaration. To do so, however, we need to look ahead one
19386 more token to see if *that* token is a type specifier.
19388 This code could be improved to handle:
19390 class Z { }
19391 static const <type> var = ...; */
19394 {
19397 /* Handling user-defined types here would be nice, but very
19398 tricky. */
19399 want_semicolon
19402 }
19406 }
19408 /* If we don't have a type, then something is very wrong and we
19409 shouldn't try to do anything clever. Likewise for not seeing the
19410 closing brace. */
19412 {
19413 cp_token_position prev
19424 else
19427 /* Unget one token and smash it to look as though we encountered
19428 a semicolon in the input stream. */
19433 }
19434 }
19436 /* If this class is not itself within the scope of another class,
19437 then we need to parse the bodies of all of the queued function
19438 definitions. Note that the queued functions defined in a class
19439 are not always processed immediately following the
19440 class-specifier for that class. Consider:
19442 struct A {
19443 struct B { void f() { sizeof (A); } };
19444 };
19446 If `f' were processed before the processing of `A' were
19447 completed, there would be no way to compute the size of `A'.
19448 Note that the nesting we are interested in here is lexical --
19449 not the semantic nesting given by TYPE_CONTEXT. In particular,
19450 for:
19452 struct A { struct B; };
19453 struct A::B { void f() { } };
19455 there is no need to delay the parsing of `A::B::f'. */
19457 {
19458 tree decl;
19465 /* In a first pass, parse default arguments to the functions.
19466 Then, in a second pass, parse the bodies of the functions.
19467 This two-phased approach handles cases like:
19469 struct S {
19470 void f() { g(); }
19471 void g(int i = 3);
19472 };
19474 */
19476 {
19478 /* If there are default arguments that have not yet been processed,
19479 take care of them now. */
19481 {
19486 }
19487 /* Make sure that any template parameters are in scope. */
19489 /* Parse the default argument expressions. */
19491 /* Remove any template parameters from the symbol table. */
19493 }
19495 /* Now parse any NSDMIs. */
19499 {
19501 {
19506 }
19509 }
19515 /* Now parse the body of the functions. */
19517 {
19518 /* OpenMP UDRs need to be parsed before all other functions. */
19525 }
19526 else
19530 }
19532 /* Put back any saved access checks. */
19535 /* Restore saved state. */
19539 parser->num_template_parameter_lists
19541 parser->in_unbraced_linkage_specification_p
19545 }
19547 static tree
19549 {
19550 tree ret;
19555 }
19557 /* Parse a class-head.
19559 class-head:
19560 class-key identifier [opt] base-clause [opt]
19561 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19562 class-key nested-name-specifier [opt] template-id
19563 base-clause [opt]
19565 class-virt-specifier:
19566 final
19568 GNU Extensions:
19569 class-key attributes identifier [opt] base-clause [opt]
19570 class-key attributes nested-name-specifier identifier base-clause [opt]
19571 class-key attributes nested-name-specifier [opt] template-id
19572 base-clause [opt]
19574 Upon return BASES is initialized to the list of base classes (or
19575 NULL, if there are none) in the same form returned by
19576 cp_parser_base_clause.
19578 Returns the TYPE of the indicated class. Sets
19579 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19580 involving a nested-name-specifier was used, and FALSE otherwise.
19582 Returns error_mark_node if this is not a class-head.
19584 Returns NULL_TREE if the class-head is syntactically valid, but
19585 semantically invalid in a way that means we should skip the entire
19586 body of the class. */
19588 static tree
19591 {
19592 tree nested_name_specifier;
19596 tree attributes;
19597 tree bases;
19607 /* Assume no nested-name-specifier will be present. */
19609 /* Assume no template parameter lists will be used in defining the
19610 type. */
19614 /* Look for the class-key. */
19619 /* Parse the attributes. */
19622 /* If the next token is `::', that is invalid -- but sometimes
19623 people do try to write:
19625 struct ::S {};
19627 Handle this gracefully by accepting the extra qualifier, and then
19628 issuing an error about it later if this really is a
19629 class-head. If it turns out just to be an elaborated type
19630 specifier, remain silent. */
19636 /* Determine the name of the class. Begin by looking for an
19637 optional nested-name-specifier. */
19639 nested_name_specifier
19645 /* If there was a nested-name-specifier, then there *must* be an
19646 identifier. */
19648 {
19650 /* Although the grammar says `identifier', it really means
19651 `class-name' or `template-name'. You are only allowed to
19652 define a class that has already been declared with this
19653 syntax.
19655 The proposed resolution for Core Issue 180 says that wherever
19656 you see `class T::X' you should treat `X' as a type-name.
19658 It is OK to define an inaccessible class; for example:
19660 class A { class B; };
19661 class A::B {};
19663 We do not know if we will see a class-name, or a
19664 template-name. We look for a class-name first, in case the
19665 class-name is a template-id; if we looked for the
19666 template-name first we would stop after the template-name. */
19671 class_type,
19675 /* If that didn't work, ignore the nested-name-specifier. */
19677 {
19683 }
19684 /* If we could not find a corresponding TYPE, treat this
19685 declaration like an unqualified declaration. */
19688 /* Otherwise, count the number of templates used in TYPE and its
19689 containing scopes. */
19690 else
19691 {
19692 tree scope;
19704 }
19705 }
19706 /* Otherwise, the identifier is optional. */
19707 else
19708 {
19709 /* We don't know whether what comes next is a template-id,
19710 an identifier, or nothing at all. */
19712 /* Check for a template-id. */
19717 class_key,
19719 /* If that didn't work, it could still be an identifier. */
19721 {
19723 {
19726 }
19727 else
19729 }
19730 else
19731 {
19734 }
19735 }
19740 {
19742 class_key,
19744 }
19747 /* If it's not a `:' or a `{' then we can't really be looking at a
19748 class-head, since a class-head only appears as part of a
19749 class-specifier. We have to detect this situation before calling
19750 xref_tag, since that has irreversible side-effects. */
19752 {
19756 }
19758 /* At this point, we're going ahead with the class-specifier, even
19759 if some other problem occurs. */
19762 {
19767 }
19768 /* Issue the error about the overly-qualified name now. */
19770 {
19775 }
19777 {
19782 }
19784 {
19785 tree scope;
19787 /* Reject typedef-names in class heads. */
19789 {
19792 type);
19795 }
19797 /* Figure out in what scope the declaration is being placed. */
19799 /* If that scope does not contain the scope in which the
19800 class was originally declared, the program is invalid. */
19802 {
19805 "declaration of %qD in namespace %qD which does not "
19808 else
19814 }
19815 /* [dcl.meaning]
19817 A declarator-id shall not be qualified except for the
19818 definition of a ... nested class outside of its class
19819 ... [or] the definition or explicit instantiation of a
19820 class member of a namespace outside of its namespace. */
19822 {
19827 }
19828 }
19829 /* An explicit-specialization must be preceded by "template <>". If
19830 it is not, try to recover gracefully. */
19834 {
19838 /* Take the same action that would have been taken by
19839 cp_parser_explicit_specialization. */
19842 }
19843 /* There must be no "return" statements between this point and the
19844 end of this function; set "type "to the correct return value and
19845 use "goto done;" to return. */
19846 /* Make sure that the right number of template parameters were
19847 present. */
19851 {
19852 /* If something went wrong, there is no point in even trying to
19853 process the class-definition. */
19856 }
19858 /* Look up the type. */
19860 {
19864 {
19868 }
19869 else
19870 {
19873 }
19876 }
19878 {
19879 tree class_type;
19881 /* Given:
19883 template <typename T> struct S { struct T };
19884 template <typename T> struct S<T>::T { };
19886 we will get a TYPENAME_TYPE when processing the definition of
19887 `S::T'. We need to resolve it to the actual type before we
19888 try to define it. */
19890 {
19895 else
19896 {
19899 }
19900 }
19904 {
19907 }
19910 /* Enter the scope indicated by the nested-name-specifier. */
19912 /* Get the canonical version of this type. */
19914 /* Call push_template_decl if it seems like we should be defining a
19915 template either from the template headers or the type we're
19916 defining, so that we diagnose both extra and missing headers. */
19922 {
19925 {
19928 }
19929 }
19933 }
19935 {
19936 /* If the class was unnamed, create a dummy name. */
19941 }
19943 /* Indicate whether this class was declared as a `class' or as a
19944 `struct'. */
19949 /* If this type was already complete, and we see another definition,
19950 that's an error. */
19952 {
19954 type);
19956 type);
19959 }
19964 {
19965 /* Apply attributes now, before any use of the class as a template
19966 argument in its base list. */
19969 }
19971 /* We will have entered the scope containing the class; the names of
19972 base classes should be looked up in that context. For example:
19974 struct A { struct B {}; struct C; };
19975 struct A::C : B {};
19977 is valid. */
19979 /* Get the list of base-classes, if there is one. */
19981 {
19982 /* PR59482: enter the class scope so that base-specifiers are looked
19983 up correctly. */
19987 /* PR59482: get out of the previously pushed class scope so that the
19988 subsequent pops pop the right thing. */
19991 }
19992 else
19995 /* If we're really defining a class, process the base classes.
19996 If they're invalid, fail. */
20001 done:
20002 /* Leave the scope given by the nested-name-specifier. We will
20003 enter the class scope itself while processing the members. */
20008 {
20011 }
20017 out:
20020 }
20022 /* Parse a class-key.
20024 class-key:
20025 class
20026 struct
20027 union
20029 Returns the kind of class-key specified, or none_type to indicate
20030 error. */
20032 static enum tag_types
20034 {
20038 /* Look for the class-key. */
20043 /* Check to see if the TOKEN is a class-key. */
20048 }
20050 /* Parse an (optional) member-specification.
20052 member-specification:
20053 member-declaration member-specification [opt]
20054 access-specifier : member-specification [opt] */
20056 static void
20058 {
20060 {
20064 /* Peek at the next token. */
20066 /* If it's a `}', or EOF then we've seen all the members. */
20072 /* See if this token is a keyword. */
20075 {
20079 /* Consume the access-specifier. */
20081 /* Remember which access-specifier is active. */
20083 /* Look for the `:'. */
20088 /* Accept #pragmas at class scope. */
20090 {
20093 }
20095 /* Otherwise, the next construction must be a
20096 member-declaration. */
20098 }
20099 }
20100 }
20102 /* Parse a member-declaration.
20104 member-declaration:
20105 decl-specifier-seq [opt] member-declarator-list [opt] ;
20106 function-definition ; [opt]
20107 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20108 using-declaration
20109 template-declaration
20110 alias-declaration
20112 member-declarator-list:
20113 member-declarator
20114 member-declarator-list , member-declarator
20116 member-declarator:
20117 declarator pure-specifier [opt]
20118 declarator constant-initializer [opt]
20119 identifier [opt] : constant-expression
20121 GNU Extensions:
20123 member-declaration:
20124 __extension__ member-declaration
20126 member-declarator:
20127 declarator attributes [opt] pure-specifier [opt]
20128 declarator attributes [opt] constant-initializer [opt]
20129 identifier [opt] attributes [opt] : constant-expression
20131 C++0x Extensions:
20133 member-declaration:
20134 static_assert-declaration */
20136 static void
20138 {
20139 cp_decl_specifier_seq decl_specifiers;
20140 tree prefix_attributes;
20141 tree decl;
20150 /* Check for the `__extension__' keyword. */
20152 {
20153 /* Recurse. */
20155 /* Restore the old value of the PEDANTIC flag. */
20159 }
20161 /* Check for a template-declaration. */
20163 {
20164 /* An explicit specialization here is an error condition, and we
20165 expect the specialization handler to detect and report this. */
20169 else
20173 }
20175 /* Check for a using-declaration. */
20177 {
20179 {
20180 /* Parse the using-declaration. */
20184 }
20185 else
20186 {
20187 tree decl;
20191 /* Note that if we actually see the '=' token after the
20192 identifier, cp_parser_alias_declaration commits the
20193 tentative parse. In that case, we really expects an
20194 alias-declaration. Otherwise, we expect a using
20195 declaration. */
20196 alias_decl_expected =
20202 else
20206 }
20207 }
20209 /* Check for @defs. */
20211 {
20216 {
20221 }
20223 }
20225 /* If the next token is `static_assert' we have a static assertion. */
20227 {
20230 }
20237 /* Parse the decl-specifier-seq. */
20240 CP_PARSER_FLAGS_OPTIONAL,
20243 /* Check for an invalid type-name. */
20247 /* If there is no declarator, then the decl-specifier-seq should
20248 specify a type. */
20250 {
20251 /* If there was no decl-specifier-seq, and the next token is a
20252 `;', then we have something like:
20254 struct S { ; };
20256 [class.mem]
20258 Each member-declaration shall declare at least one member
20259 name of the class. */
20261 {
20265 }
20266 else
20267 {
20268 tree type;
20270 /* See if this declaration is a friend. */
20272 /* If there were decl-specifiers, check to see if there was
20273 a class-declaration. */
20276 /* Nested classes have already been added to the class, but
20277 a `friend' needs to be explicitly registered. */
20279 {
20280 /* If the `friend' keyword was present, the friend must
20281 be introduced with a class-key. */
20284 "in C++03 a class-key must be used "
20286 /* In this case:
20288 template <typename T> struct A {
20289 friend struct A<T>::B;
20290 };
20292 A<T>::B will be represented by a TYPENAME_TYPE, and
20293 therefore not recognized by check_tag_decl. */
20295 {
20299 }
20302 "friend declaration does not name a class or "
20304 else
20307 }
20308 /* If there is no TYPE, an error message will already have
20309 been issued. */
20311 ;
20312 /* An anonymous aggregate has to be handled specially; such
20313 a declaration really declares a data member (with a
20314 particular type), as opposed to a nested class. */
20316 {
20317 /* C++11 9.5/6. */
20320 "a storage class on an anonymous aggregate "
20323 /* Remove constructors and such from TYPE, now that we
20324 know it is an anonymous aggregate. */
20326 /* And make the corresponding data member. */
20329 /* Add it to the class. */
20331 }
20332 else
20333 cp_parser_check_access_in_redeclaration
20336 }
20337 }
20338 else
20339 {
20342 /* Clear attributes from the decl_specifiers but keep them
20343 around as prefix attributes that apply them to the entity
20344 being declared. */
20348 /* See if these declarations will be friends. */
20351 /* Keep going until we hit the `;' at the end of the
20352 declaration. */
20354 {
20356 tree first_attribute;
20358 /* Peek at the next token. */
20361 /* Check for a bitfield declaration. */
20366 {
20367 tree identifier;
20368 tree width;
20370 /* Get the name of the bitfield. Note that we cannot just
20371 check TOKEN here because it may have been invalidated by
20372 the call to cp_lexer_peek_nth_token above. */
20375 else
20378 /* Consume the `:' token. */
20380 /* Get the width of the bitfield. */
20381 width
20384 NULL);
20386 /* Look for attributes that apply to the bitfield. */
20388 /* Remember which attributes are prefix attributes and
20389 which are not. */
20391 /* Combine the attributes. */
20394 /* Create the bitfield declaration. */
20397 identifier,
20398 sfk_none)
20401 width,
20402 attributes);
20403 }
20404 else
20405 {
20407 tree initializer;
20408 tree asm_specification;
20411 /* Parse the declarator. */
20412 declarator
20418 /* If something went wrong parsing the declarator, make sure
20419 that we at least consume some tokens. */
20421 {
20422 /* Skip to the end of the statement. */
20424 /* If the next token is not a semicolon, that is
20425 probably because we just skipped over the body of
20426 a function. So, we consume a semicolon if
20427 present, but do not issue an error message if it
20428 is not present. */
20430 CPP_SEMICOLON))
20433 }
20436 cp_parser_check_for_definition_in_return_type
20440 /* Look for an asm-specification. */
20442 /* Look for attributes that apply to the declaration. */
20444 /* Remember which attributes are prefix attributes and
20445 which are not. */
20447 /* Combine the attributes. */
20450 /* If it's an `=', then we have a constant-initializer or a
20451 pure-specifier. It is not correct to parse the
20452 initializer before registering the member declaration
20453 since the member declaration should be in scope while
20454 its initializer is processed. However, the rest of the
20455 front end does not yet provide an interface that allows
20456 us to handle this correctly. */
20458 {
20459 /* In [class.mem]:
20461 A pure-specifier shall be used only in the declaration of
20462 a virtual function.
20464 A member-declarator can contain a constant-initializer
20465 only if it declares a static member of integral or
20466 enumeration type.
20468 Therefore, if the DECLARATOR is for a function, we look
20469 for a pure-specifier; otherwise, we look for a
20470 constant-initializer. When we call `grokfield', it will
20471 perform more stringent semantics checks. */
20483 {
20485 /* Don't require a constant rvalue in C++11, since we
20486 might want a reference constant. We'll enforce
20487 constancy later. */
20489 /* Parse the initializer. */
20492 }
20493 else
20494 /* Parse the initializer. */
20496 }
20499 {
20503 else
20505 }
20506 /* Otherwise, there is no initializer. */
20507 else
20510 /* See if we are probably looking at a function
20511 definition. We are certainly not looking at a
20512 member-declarator. Calling `grokfield' has
20513 side-effects, so we must not do it unless we are sure
20514 that we are looking at a member-declarator. */
20517 {
20518 /* The grammar does not allow a pure-specifier to be
20519 used when a member function is defined. (It is
20520 possible that this fact is an oversight in the
20521 standard, since a pure function may be defined
20522 outside of the class-specifier. */
20528 declarator,
20529 attributes);
20532 /* If the member was not a friend, declare it here. */
20535 /* Peek at the next token. */
20537 /* If the next token is a semicolon, consume it. */
20541 }
20542 else
20545 /* Create the declaration. */
20550 {
20553 else
20555 }
20556 }
20560 /* Reset PREFIX_ATTRIBUTES. */
20566 /* If there is any qualification still in effect, clear it
20567 now; we will be starting fresh with the next declarator. */
20571 /* If it's a `,', then there are more declarators. */
20573 {
20576 {
20580 }
20581 }
20582 /* If the next token isn't a `;', then we have a parse error. */
20584 CPP_SEMICOLON))
20585 {
20586 /* The next token might be a ways away from where the
20587 actual semicolon is missing. Find the previous token
20588 and use that for our error position. */
20593 /* Assume that the user meant to provide a semicolon. If
20594 we were to cp_parser_skip_to_end_of_statement, we might
20595 skip to a semicolon inside a member function definition
20596 and issue nonsensical error messages. */
20598 }
20601 {
20602 /* Add DECL to the list of members. */
20611 /* Add DECL to the queue of NSDMI to be parsed later. */
20613 }
20617 }
20618 }
20621 out:
20623 }
20625 /* Parse a pure-specifier.
20627 pure-specifier:
20628 = 0
20630 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20631 Otherwise, ERROR_MARK_NODE is returned. */
20633 static tree
20635 {
20638 /* Look for the `=' token. */
20641 /* Look for the `0' token. */
20650 /* Accept = default or = delete in c++0x mode. */
20653 {
20656 }
20658 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20660 {
20665 }
20667 {
20670 }
20673 }
20675 /* Parse a constant-initializer.
20677 constant-initializer:
20678 = constant-expression
20680 Returns a representation of the constant-expression. */
20682 static tree
20684 {
20685 /* Look for the `=' token. */
20689 /* It is invalid to write:
20691 struct S { static const int i = { 7 }; };
20693 */
20695 {
20698 /* Consume the opening brace. */
20700 /* Skip the initializer. */
20702 /* Look for the trailing `}'. */
20706 }
20710 NULL);
20711 }
20713 /* Derived classes [gram.class.derived] */
20715 /* Parse a base-clause.
20717 base-clause:
20718 : base-specifier-list
20720 base-specifier-list:
20721 base-specifier ... [opt]
20722 base-specifier-list , base-specifier ... [opt]
20724 Returns a TREE_LIST representing the base-classes, in the order in
20725 which they were declared. The representation of each node is as
20726 described by cp_parser_base_specifier.
20728 In the case that no bases are specified, this function will return
20729 NULL_TREE, not ERROR_MARK_NODE. */
20731 static tree
20733 {
20736 /* Look for the `:' that begins the list. */
20739 /* Scan the base-specifier-list. */
20741 {
20743 tree base;
20746 /* Look for the base-specifier. */
20748 /* Look for the (optional) ellipsis. */
20750 {
20751 /* Consume the `...'. */
20755 }
20757 /* Add BASE to the front of the list. */
20759 {
20761 /* Make this a pack expansion type. */
20765 {
20768 }
20769 }
20770 /* Peek at the next token. */
20772 /* If it's not a comma, then the list is complete. */
20775 /* Consume the `,'. */
20777 }
20779 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20780 base class had a qualified name. However, the next name that
20781 appears is certainly not qualified. */
20787 }
20789 /* Parse a base-specifier.
20791 base-specifier:
20792 :: [opt] nested-name-specifier [opt] class-name
20793 virtual access-specifier [opt] :: [opt] nested-name-specifier
20794 [opt] class-name
20795 access-specifier virtual [opt] :: [opt] nested-name-specifier
20796 [opt] class-name
20798 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20799 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20800 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20801 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20803 static tree
20805 {
20813 tree type;
20815 /* Process the optional `virtual' and `access-specifier'. */
20817 {
20818 /* Peek at the next token. */
20820 /* Process `virtual'. */
20822 {
20824 /* If `virtual' appears more than once, issue an error. */
20826 {
20830 }
20834 /* Consume the `virtual' token. */
20842 /* If more than one access specifier appears, issue an
20843 error. */
20846 {
20850 }
20854 /* Consume the access-specifier. */
20862 }
20863 }
20864 /* It is not uncommon to see programs mechanically, erroneously, use
20865 the 'typename' keyword to denote (dependent) qualified types
20866 as base classes. */
20868 {
20873 else
20875 "keyword %<typename%> not allowed in this context "
20878 }
20880 /* Look for the optional `::' operator. */
20882 /* Look for the nested-name-specifier. The simplest way to
20883 implement:
20885 [temp.res]
20887 The keyword `typename' is not permitted in a base-specifier or
20888 mem-initializer; in these contexts a qualified name that
20889 depends on a template-parameter is implicitly assumed to be a
20890 type name.
20892 is to pretend that we have seen the `typename' keyword at this
20893 point. */
20897 typename_type,
20899 /* If the base class is given by a qualified name, assume that names
20900 we see are type names or templates, as appropriate. */
20906 /* DR 950 allows decltype as a base-specifier. */
20908 else
20909 {
20910 /* Otherwise, look for the class-name. */
20912 class_scope_p,
20913 template_p,
20914 typename_type,
20919 }
20925 }
20927 /* Exception handling [gram.exception] */
20929 /* Parse an (optional) noexcept-specification.
20931 noexcept-specification:
20932 noexcept ( constant-expression ) [opt]
20934 If no noexcept-specification is present, returns NULL_TREE.
20935 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20936 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20937 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20938 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20939 in which case a boolean condition is returned instead. */
20941 static tree
20946 {
20950 /* Peek at the next token. */
20953 /* Is it a noexcept-specification? */
20955 {
20956 tree expr;
20960 {
20964 {
20965 /* Types may not be defined in an exception-specification. */
20967 parser->type_definition_forbidden_message
20972 /* Restore the saved message. */
20974 }
20975 else
20976 {
20979 }
20982 }
20983 else
20984 {
20988 }
20990 /* We cannot build a noexcept-spec right away because this will check
20991 that expr is a constexpr. */
20994 else
20996 }
20997 else
20999 }
21001 /* Parse an (optional) exception-specification.
21003 exception-specification:
21004 throw ( type-id-list [opt] )
21006 Returns a TREE_LIST representing the exception-specification. The
21007 TREE_VALUE of each node is a type. */
21009 static tree
21011 {
21013 tree type_id_list;
21016 /* Peek at the next token. */
21019 /* Is it a noexcept-specification? */
21025 /* If it's not `throw', then there's no exception-specification. */
21029 #if 0
21030 /* Enable this once a lot of code has transitioned to noexcept? */
21034 #endif
21036 /* Consume the `throw'. */
21039 /* Look for the `('. */
21042 /* Peek at the next token. */
21044 /* If it's not a `)', then there is a type-id-list. */
21046 {
21047 /* Types may not be defined in an exception-specification. */
21049 parser->type_definition_forbidden_message
21051 /* Parse the type-id-list. */
21053 /* Restore the saved message. */
21055 }
21056 else
21059 /* Look for the `)'. */
21063 }
21065 /* Parse an (optional) type-id-list.
21067 type-id-list:
21068 type-id ... [opt]
21069 type-id-list , type-id ... [opt]
21071 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21072 in the order that the types were presented. */
21074 static tree
21076 {
21080 {
21082 tree type;
21084 /* Get the next type-id. */
21086 /* Parse the optional ellipsis. */
21088 {
21089 /* Consume the `...'. */
21092 /* Turn the type into a pack expansion expression. */
21094 }
21095 /* Add it to the list. */
21097 /* Peek at the next token. */
21099 /* If it is not a `,', we are done. */
21102 /* Consume the `,'. */
21104 }
21107 }
21109 /* Parse a try-block.
21111 try-block:
21112 try compound-statement handler-seq */
21114 static tree
21116 {
21117 tree try_block;
21127 }
21129 /* Parse a function-try-block.
21131 function-try-block:
21132 try ctor-initializer [opt] function-body handler-seq */
21134 static bool
21136 {
21137 tree compound_stmt;
21138 tree try_block;
21141 /* Look for the `try' keyword. */
21144 /* Let the rest of the front end know where we are. */
21146 /* Parse the function-body. */
21147 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21149 /* We're done with the `try' part. */
21151 /* Parse the handlers. */
21153 /* We're done with the handlers. */
21157 }
21159 /* Parse a handler-seq.
21161 handler-seq:
21162 handler handler-seq [opt] */
21164 static void
21166 {
21168 {
21171 /* Parse the handler. */
21173 /* Peek at the next token. */
21175 /* If it's not `catch' then there are no more handlers. */
21178 }
21179 }
21181 /* Parse a handler.
21183 handler:
21184 catch ( exception-declaration ) compound-statement */
21186 static void
21188 {
21189 tree handler;
21190 tree declaration;
21200 }
21202 /* Parse an exception-declaration.
21204 exception-declaration:
21205 type-specifier-seq declarator
21206 type-specifier-seq abstract-declarator
21207 type-specifier-seq
21208 ...
21210 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21211 ellipsis variant is used. */
21213 static tree
21215 {
21216 cp_decl_specifier_seq type_specifiers;
21220 /* If it's an ellipsis, it's easy to handle. */
21222 {
21223 /* Consume the `...' token. */
21226 }
21228 /* Types may not be defined in exception-declarations. */
21230 parser->type_definition_forbidden_message
21233 /* Parse the type-specifier-seq. */
21237 /* If it's a `)', then there is no declarator. */
21240 else
21246 /* Restore the saved message. */
21253 }
21255 /* Parse a throw-expression.
21257 throw-expression:
21258 throw assignment-expression [opt]
21260 Returns a THROW_EXPR representing the throw-expression. */
21262 static tree
21264 {
21265 tree expression;
21270 /* Figure out whether or not there is an assignment-expression
21271 following the "throw" keyword. */
21279 else
21284 }
21286 /* GNU Extensions */
21288 /* Parse an (optional) asm-specification.
21290 asm-specification:
21291 asm ( string-literal )
21293 If the asm-specification is present, returns a STRING_CST
21294 corresponding to the string-literal. Otherwise, returns
21295 NULL_TREE. */
21297 static tree
21299 {
21301 tree asm_specification;
21303 /* Peek at the next token. */
21305 /* If the next token isn't the `asm' keyword, then there's no
21306 asm-specification. */
21310 /* Consume the `asm' token. */
21312 /* Look for the `('. */
21315 /* Look for the string-literal. */
21318 /* Look for the `)'. */
21322 }
21324 /* Parse an asm-operand-list.
21326 asm-operand-list:
21327 asm-operand
21328 asm-operand-list , asm-operand
21330 asm-operand:
21331 string-literal ( expression )
21332 [ string-literal ] string-literal ( expression )
21334 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21335 each node is the expression. The TREE_PURPOSE is itself a
21336 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21337 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21338 is a STRING_CST for the string literal before the parenthesis. Returns
21339 ERROR_MARK_NODE if any of the operands are invalid. */
21341 static tree
21343 {
21348 {
21349 tree string_literal;
21350 tree expression;
21351 tree name;
21354 {
21355 /* Consume the `[' token. */
21357 /* Read the operand name. */
21362 /* Look for the closing `]'. */
21364 }
21365 else
21367 /* Look for the string-literal. */
21370 /* Look for the `('. */
21372 /* Parse the expression. */
21374 /* Look for the `)'. */
21382 /* Add this operand to the list. */
21384 expression,
21385 asm_operands);
21386 /* If the next token is not a `,', there are no more
21387 operands. */
21390 /* Consume the `,'. */
21392 }
21395 }
21397 /* Parse an asm-clobber-list.
21399 asm-clobber-list:
21400 string-literal
21401 asm-clobber-list , string-literal
21403 Returns a TREE_LIST, indicating the clobbers in the order that they
21404 appeared. The TREE_VALUE of each node is a STRING_CST. */
21406 static tree
21408 {
21412 {
21413 tree string_literal;
21415 /* Look for the string literal. */
21417 /* Add it to the list. */
21419 /* If the next token is not a `,', then the list is
21420 complete. */
21423 /* Consume the `,' token. */
21425 }
21428 }
21430 /* Parse an asm-label-list.
21432 asm-label-list:
21433 identifier
21434 asm-label-list , identifier
21436 Returns a TREE_LIST, indicating the labels in the order that they
21437 appeared. The TREE_VALUE of each node is a label. */
21439 static tree
21441 {
21445 {
21448 /* Look for the identifier. */
21451 {
21454 {
21460 }
21461 }
21462 /* If the next token is not a `,', then the list is
21463 complete. */
21466 /* Consume the `,' token. */
21468 }
21471 }
21473 /* Return TRUE iff the next tokens in the stream are possibly the
21474 beginning of a GNU extension attribute. */
21476 static bool
21478 {
21480 }
21482 /* Return TRUE iff the next tokens in the stream are possibly the
21483 beginning of a standard C++-11 attribute specifier. */
21485 static bool
21487 {
21489 }
21491 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21492 beginning of a standard C++-11 attribute specifier. */
21494 static bool
21496 {
21504 }
21506 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21507 beginning of a GNU extension attribute. */
21509 static bool
21511 {
21515 }
21517 /* Return true iff the next tokens can be the beginning of either a
21518 GNU attribute list, or a standard C++11 attribute sequence. */
21520 static bool
21522 {
21525 }
21527 /* Return true iff the next Nth tokens can be the beginning of either
21528 a GNU attribute list, or a standard C++11 attribute sequence. */
21530 static bool
21532 {
21535 }
21537 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21538 of GNU attributes, or return NULL. */
21540 static tree
21542 {
21546 }
21548 #define CILK_SIMD_FN_CLAUSE_MASK \
21549 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
21550 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
21551 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
21552 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
21553 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
21555 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
21556 vector [(<clauses>)] */
21558 static void
21560 {
21564 {
21569 }
21572 {
21575 paren_scope++;
21576 }
21578 {
21581 paren_scope++;
21583 paren_scope--;
21584 /* Do not push the last ')' */
21587 }
21596 }
21598 /* Parse an (optional) series of attributes.
21600 attributes:
21601 attributes attribute
21603 attribute:
21604 __attribute__ (( attribute-list [opt] ))
21606 The return value is as for cp_parser_gnu_attribute_list. */
21608 static tree
21610 {
21614 {
21616 tree attribute_list;
21619 /* Peek at the next token. */
21621 /* If it's not `__attribute__', then we're done. */
21625 /* Consume the `__attribute__' keyword. */
21627 /* Look for the two `(' tokens. */
21631 /* Peek at the next token. */
21634 /* Parse the attribute-list. */
21636 else
21637 /* If the next token is a `)', then there is no attribute
21638 list. */
21641 /* Look for the two `)' tokens. */
21649 /* Add these new attributes to the list. */
21651 }
21654 }
21656 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
21657 "__vector" or "__vector__." */
21661 {
21665 }
21667 /* Parse a GNU attribute-list.
21669 attribute-list:
21670 attribute
21671 attribute-list , attribute
21673 attribute:
21674 identifier
21675 identifier ( identifier )
21676 identifier ( identifier , expression-list )
21677 identifier ( expression-list )
21679 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21680 to an attribute. The TREE_PURPOSE of each node is the identifier
21681 indicating which attribute is in use. The TREE_VALUE represents
21682 the arguments, if any. */
21684 static tree
21686 {
21692 {
21694 tree identifier;
21695 tree attribute;
21697 /* Look for the identifier. We also allow keywords here; for
21698 example `__attribute__ ((const))' is legal. */
21702 {
21705 /* Consume the token, but save it since we need it for the
21706 SIMD enabled function parsing. */
21709 /* Save away the identifier that indicates which attribute
21710 this is. */
21712 /* For keywords, use the canonical spelling, not the
21713 parsed identifier. */
21719 /* Peek at the next token. */
21721 /* If it's an `(', then parse the attribute arguments. */
21723 {
21728 {
21731 }
21732 else
21733 vec = cp_parser_parenthesized_expression_list
21739 else
21740 {
21743 }
21744 /* Save the arguments away. */
21746 }
21748 {
21751 }
21754 {
21755 /* Add this attribute to the list. */
21758 }
21761 }
21762 /* Now, look for more attributes. If the next token isn't a
21763 `,', we're done. */
21767 /* Consume the comma and keep going. */
21769 }
21772 /* We built up the list in reverse order. */
21774 }
21776 /* Parse a standard C++11 attribute.
21778 The returned representation is a TREE_LIST which TREE_PURPOSE is
21779 the scoped name of the attribute, and the TREE_VALUE is its
21780 arguments list.
21782 Note that the scoped name of the attribute is itself a TREE_LIST
21783 which TREE_PURPOSE is the namespace of the attribute, and
21784 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21785 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21786 and which TREE_PURPOSE is directly the attribute name.
21788 Clients of the attribute code should use get_attribute_namespace
21789 and get_attribute_name to get the actual namespace and name of
21790 attributes, regardless of their being GNU or C++11 attributes.
21792 attribute:
21793 attribute-token attribute-argument-clause [opt]
21795 attribute-token:
21796 identifier
21797 attribute-scoped-token
21799 attribute-scoped-token:
21800 attribute-namespace :: identifier
21802 attribute-namespace:
21803 identifier
21805 attribute-argument-clause:
21806 ( balanced-token-seq )
21808 balanced-token-seq:
21809 balanced-token [opt]
21810 balanced-token-seq balanced-token
21812 balanced-token:
21813 ( balanced-token-seq )
21814 [ balanced-token-seq ]
21815 { balanced-token-seq }. */
21817 static tree
21819 {
21823 /* First, parse name of the the attribute, a.k.a
21824 attribute-token. */
21841 {
21842 /* We are seeing a scoped attribute token. */
21852 else
21853 {
21857 }
21859 NULL_TREE);
21861 }
21862 else
21863 {
21865 NULL_TREE);
21866 /* C++11 noreturn attribute is equivalent to GNU's. */
21869 /* C++14 deprecated attribute is equivalent to GNU's. */
21872 }
21874 /* Now parse the optional argument clause of the attribute. */
21879 {
21885 /* A GNU attribute that takes an identifier in parameter. */
21888 vec = cp_parser_parenthesized_expression_list
21894 else
21895 {
21898 }
21902 else
21904 }
21907 }
21909 /* Parse a list of standard C++-11 attributes.
21911 attribute-list:
21912 attribute [opt]
21913 attribute-list , attribute[opt]
21914 attribute ...
21915 attribute-list , attribute ...
21916 */
21918 static tree
21920 {
21925 {
21930 {
21933 }
21938 }
21941 }
21943 /* Parse a standard C++-11 attribute specifier.
21945 attribute-specifier:
21946 [ [ attribute-list ] ]
21947 alignment-specifier
21949 alignment-specifier:
21950 alignas ( type-id ... [opt] )
21951 alignas ( alignment-expression ... [opt] ). */
21953 static tree
21955 {
21961 {
21970 else
21971 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21972 when we are sure that we have actually parsed them. */
21974 }
21975 else
21976 {
21977 tree alignas_expr;
21979 /* Look for an alignment-specifier. */
21991 {
21994 }
22000 {
22004 alignas_expr =
22012 }
22015 {
22018 }
22022 /* Build the C++-11 representation of an 'aligned'
22023 attribute. */
22024 attributes =
22028 }
22031 }
22033 /* Parse a standard C++-11 attribute-specifier-seq.
22035 attribute-specifier-seq:
22036 attribute-specifier-seq [opt] attribute-specifier
22037 */
22039 static tree
22041 {
22045 {
22054 }
22058 }
22060 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22061 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22062 current value of the PEDANTIC flag, regardless of whether or not
22063 the `__extension__' keyword is present. The caller is responsible
22064 for restoring the value of the PEDANTIC flag. */
22066 static bool
22068 {
22069 /* Save the old value of the PEDANTIC flag. */
22073 {
22074 /* Consume the `__extension__' token. */
22076 /* We're not being pedantic while the `__extension__' keyword is
22077 in effect. */
22081 }
22084 }
22086 /* Parse a label declaration.
22088 label-declaration:
22089 __label__ label-declarator-seq ;
22091 label-declarator-seq:
22092 identifier , label-declarator-seq
22093 identifier */
22095 static void
22097 {
22098 /* Look for the `__label__' keyword. */
22102 {
22103 tree identifier;
22105 /* Look for an identifier. */
22107 /* If we failed, stop. */
22110 /* Declare it as a label. */
22112 /* If the next token is a `;', stop. */
22115 /* Look for the `,' separating the label declarations. */
22117 }
22119 /* Look for the final `;'. */
22121 }
22123 /* Support Functions */
22125 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22126 NAME should have one of the representations used for an
22127 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22128 is returned. If PARSER->SCOPE is a dependent type, then a
22129 SCOPE_REF is returned.
22131 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22132 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22133 was formed. Abstractly, such entities should not be passed to this
22134 function, because they do not need to be looked up, but it is
22135 simpler to check for this special case here, rather than at the
22136 call-sites.
22138 In cases not explicitly covered above, this function returns a
22139 DECL, OVERLOAD, or baselink representing the result of the lookup.
22140 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22141 is returned.
22143 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22144 (e.g., "struct") that was used. In that case bindings that do not
22145 refer to types are ignored.
22147 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22148 ignored.
22150 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22151 are ignored.
22153 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22154 types.
22156 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22157 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22158 NULL_TREE otherwise. */
22160 static tree
22167 location_t name_location)
22168 {
22169 tree decl;
22172 /* Assume that the lookup will be unambiguous. */
22176 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22177 no longer valid. Note that if we are parsing tentatively, and
22178 the parse fails, OBJECT_TYPE will be automatically restored. */
22184 /* A template-id has already been resolved; there is no lookup to
22185 do. */
22189 {
22193 }
22195 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22196 it should already have been checked to make sure that the name
22197 used matches the type being destroyed. */
22199 {
22200 tree type;
22202 /* Figure out to which type this destructor applies. */
22207 else
22209 /* If that's not a class type, there is no destructor. */
22216 /* If it was a class type, return the destructor. */
22218 }
22220 /* By this point, the NAME should be an ordinary identifier. If
22221 the id-expression was a qualified name, the qualifying scope is
22222 stored in PARSER->SCOPE at this point. */
22225 /* Perform the lookup. */
22227 {
22233 /* If the SCOPE is dependent, the lookup must be deferred until
22234 the template is instantiated -- unless we are explicitly
22235 looking up names in uninstantiated templates. Even then, we
22236 cannot look up the name if the scope is not a class type; it
22237 might, for example, be a template type parameter. */
22242 /* Defer lookup. */
22244 else
22245 {
22248 /* If PARSER->SCOPE is a dependent type, then it must be a
22249 class type, and we must not be checking dependencies;
22250 otherwise, we would have processed this lookup above. So
22251 that PARSER->SCOPE is not considered a dependent base by
22252 lookup_member, we must enter the scope here. */
22256 /* If the PARSER->SCOPE is a template specialization, it
22257 may be instantiated during name lookup. In that case,
22258 errors may be issued. Even if we rollback the current
22259 tentative parse, those errors are valid. */
22264 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22265 lookup result and the nested-name-specifier nominates a class C:
22266 * if the name specified after the nested-name-specifier, when
22267 looked up in C, is the injected-class-name of C (Clause 9), or
22268 * if the name specified after the nested-name-specifier is the
22269 same as the identifier or the simple-template-id's template-
22270 name in the last component of the nested-name-specifier,
22271 the name is instead considered to name the constructor of
22272 class C. [ Note: for example, the constructor is not an
22273 acceptable lookup result in an elaborated-type-specifier so
22274 the constructor would not be used in place of the
22275 injected-class-name. --end note ] Such a constructor name
22276 shall be used only in the declarator-id of a declaration that
22277 names a constructor or in a using-declaration. */
22285 /* If we have a single function from a using decl, pull it out. */
22292 }
22294 /* If the scope is a dependent type and either we deferred lookup or
22295 we did lookup but didn't find the name, rememeber the name. */
22298 {
22300 {
22301 tree type;
22303 /* The resolution to Core Issue 180 says that `struct
22304 A::B' should be considered a type-name, even if `A'
22305 is dependent. */
22310 }
22314 CPP_CLOSE_PAREN)))
22318 else
22321 is_template);
22322 }
22325 }
22327 {
22328 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22329 OBJECT_TYPE is not a class. */
22331 /* If the OBJECT_TYPE is a template specialization, it may
22332 be instantiated during name lookup. In that case, errors
22333 may be issued. Even if we rollback the current tentative
22334 parse, those errors are valid. */
22336 name,
22339 tf_warning_or_error);
22340 else
22344 /* Look it up in the enclosing context. */
22350 }
22351 else
22352 {
22358 }
22360 /* If the lookup failed, let our caller know. */
22364 /* Pull out the template from an injected-class-name (or multiple). */
22368 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22370 {
22373 /* The error message we have to print is too complicated for
22374 cp_parser_error, so we incorporate its actions directly. */
22376 {
22378 name);
22380 }
22382 }
22390 /* If we have resolved the name of a member declaration, check to
22391 see if the declaration is accessible. When the name resolves to
22392 set of overloaded functions, accessibility is checked when
22393 overload resolution is done.
22395 During an explicit instantiation, access is not checked at all,
22396 as per [temp.explicit]. */
22403 }
22405 /* Like cp_parser_lookup_name, but for use in the typical case where
22406 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22407 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22409 static tree
22411 {
22413 none_type,
22418 location);
22419 }
22421 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22422 the current context, return the TYPE_DECL. If TAG_NAME_P is
22423 true, the DECL indicates the class being defined in a class-head,
22424 or declared in an elaborated-type-specifier.
22426 Otherwise, return DECL. */
22428 static tree
22430 {
22431 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22432 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22434 struct A {
22435 template <typename T> struct B;
22436 };
22438 template <typename T> struct A::B {};
22440 Similarly, in an elaborated-type-specifier:
22442 namespace N { struct X{}; }
22444 struct A {
22445 template <typename T> friend struct N::X;
22446 };
22448 However, if the DECL refers to a class type, and we are in
22449 the scope of the class, then the name lookup automatically
22450 finds the TYPE_DECL created by build_self_reference rather
22451 than a TEMPLATE_DECL. For example, in:
22453 template <class T> struct S {
22454 S s;
22455 };
22457 there is no need to handle such case. */
22463 }
22465 /* If too many, or too few, template-parameter lists apply to the
22466 declarator, issue an error message. Returns TRUE if all went well,
22467 and FALSE otherwise. */
22469 static bool
22472 location_t declarator_location)
22473 {
22475 {
22477 {
22485 /* If the DECLARATOR has the form `X<y>' then it uses one
22486 additional level of template parameters. */
22489 return cp_parser_check_template_parameters
22491 }
22506 }
22508 }
22510 /* NUM_TEMPLATES were used in the current declaration. If that is
22511 invalid, return FALSE and issue an error messages. Otherwise,
22512 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22513 declarator and we can print more accurate diagnostics. */
22515 static bool
22518 location_t location,
22520 {
22521 /* If there are the same number of template classes and parameter
22522 lists, that's OK. */
22525 /* If there are more, but only one more, then we are referring to a
22526 member template. That's OK too. */
22529 /* If there are more template classes than parameter lists, we have
22530 something like:
22532 template <class T> void S<T>::R<T>::f (); */
22534 {
22544 else
22547 }
22548 /* Otherwise, there are too many template parameter lists. We have
22549 something like:
22551 template <class T> template <class U> void S::f(); */
22554 }
22556 /* Parse an optional `::' token indicating that the following name is
22557 from the global namespace. If so, PARSER->SCOPE is set to the
22558 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22559 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22560 Returns the new value of PARSER->SCOPE, if the `::' token is
22561 present, and NULL_TREE otherwise. */
22563 static tree
22565 {
22568 /* Peek at the next token. */
22570 /* If we're looking at a `::' token then we're starting from the
22571 global namespace, not our current location. */
22573 {
22574 /* Consume the `::' token. */
22576 /* Set the SCOPE so that we know where to start the lookup. */
22582 }
22584 {
22588 }
22591 }
22593 /* Returns TRUE if the upcoming token sequence is the start of a
22594 constructor declarator. If FRIEND_P is true, the declarator is
22595 preceded by the `friend' specifier. */
22597 static bool
22599 {
22602 tree nested_name_specifier;
22605 /* The common case is that this is not a constructor declarator, so
22606 try to avoid doing lots of work if at all possible. It's not
22607 valid declare a constructor at function scope. */
22610 /* And only certain tokens can begin a constructor declarator. */
22618 /* Parse tentatively; we are going to roll back all of the tokens
22619 consumed here. */
22621 /* Assume that we are looking at a constructor declarator. */
22624 /* Look for the optional `::' operator. */
22627 /* Look for the nested-name-specifier. */
22628 nested_name_specifier
22639 /* Outside of a class-specifier, there must be a
22640 nested-name-specifier. */
22646 /* If we have a class scope, this is easy; DR 147 says that S::S always
22647 names the constructor, and no other qualified name could. */
22650 {
22660 }
22661 /* If we still think that this might be a constructor-declarator,
22662 look for a class-name. */
22664 {
22665 /* If we have:
22667 template <typename T> struct S {
22668 S();
22669 };
22671 we must recognize that the nested `S' names a class. */
22672 tree type_decl;
22676 none_type,
22680 /* If there was no class-name, then this is not a constructor.
22681 Otherwise, if we are in a class-specifier and we aren't
22682 handling a friend declaration, check that its type matches
22683 current_class_type (c++/38313). Note: error_mark_node
22684 is left alone for error recovery purposes. */
22686 && (outside_class_specifier_p
22691 /* If we're still considering a constructor, we have to see a `(',
22692 to begin the parameter-declaration-clause, followed by either a
22693 `)', an `...', or a decl-specifier. We need to check for a
22694 type-specifier to avoid being fooled into thinking that:
22696 S (f) (int);
22698 is a constructor. (It is actually a function named `f' that
22699 takes one parameter (of type `int') and returns a value of type
22700 `S'. */
22708 /* A parameter declaration begins with a decl-specifier,
22709 which is either the "attribute" keyword, a storage class
22710 specifier, or (usually) a type-specifier. */
22712 {
22713 tree type;
22717 /* Names appearing in the type-specifier should be looked up
22718 in the scope of the class. */
22721 else
22722 {
22725 {
22729 {
22732 }
22733 }
22735 }
22737 /* Inside the constructor parameter list, surrounding
22738 template-parameter-lists do not apply. */
22739 saved_num_template_parameter_lists
22743 /* Look for the type-specifier. */
22745 CP_PARSER_FLAGS_NONE,
22751 parser->num_template_parameter_lists
22754 /* Leave the scope of the class. */
22759 }
22760 }
22762 /* We did not really want to consume any tokens. */
22766 }
22768 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22769 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22770 they must be performed once we are in the scope of the function.
22772 Returns the function defined. */
22774 static tree
22775 cp_parser_function_definition_from_specifiers_and_declarator
22778 tree attributes,
22780 {
22781 tree fn;
22784 /* Begin the function-definition. */
22787 /* The things we're about to see are not directly qualified by any
22788 template headers we've seen thus far. */
22791 /* If there were names looked up in the decl-specifier-seq that we
22792 did not check, check them now. We must wait until we are in the
22793 scope of the function to perform the checks, since the function
22794 might be a friend. */
22798 {
22801 }
22804 {
22805 /* Skip the entire function. */
22808 }
22810 {
22811 /* Seen already, skip it. An error message has already been output. */
22815 /* If this is a function from a class, pop the nested class. */
22818 }
22819 else
22820 {
22821 timevar_id_t tv;
22824 else
22830 }
22833 }
22835 /* Parse the part of a function-definition that follows the
22836 declarator. INLINE_P is TRUE iff this function is an inline
22837 function defined within a class-specifier.
22839 Returns the function defined. */
22841 static tree
22844 {
22845 tree fn;
22851 bool fully_implicit_function_template_p
22854 tree implicit_template_parms
22857 cp_binding_level* implicit_template_scope
22863 /* If the next token is `return', then the code may be trying to
22864 make use of the "named return value" extension that G++ used to
22865 support. */
22868 {
22869 /* Consume the `return' keyword. */
22871 /* Look for the identifier that indicates what value is to be
22872 returned. */
22874 /* Issue an error message. */
22877 /* Skip tokens until we reach the start of the function body. */
22879 {
22886 }
22887 }
22888 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22889 anything declared inside `f'. */
22890 saved_in_unbraced_linkage_specification_p
22893 /* Inside the function, surrounding template-parameter-lists do not
22894 apply. */
22895 saved_num_template_parameter_lists
22901 /* If the next token is `try', `__transaction_atomic', or
22902 `__transaction_relaxed`, then we are looking at either function-try-block
22903 or function-transaction-block. Note that all of these include the
22904 function-body. */
22907 RID_TRANSACTION_ATOMIC);
22909 RID_TRANSACTION_RELAXED))
22911 RID_TRANSACTION_RELAXED);
22914 else
22915 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22920 /* Finish the function. */
22923 /* Generate code for it, if necessary. */
22925 /* Restore the saved values. */
22926 parser->in_unbraced_linkage_specification_p
22928 parser->num_template_parameter_lists
22932 parser->fully_implicit_function_template_p
22934 parser->implicit_template_parms
22936 parser->implicit_template_scope
22943 }
22945 /* Parse a template-declaration, assuming that the `export' (and
22946 `extern') keywords, if present, has already been scanned. MEMBER_P
22947 is as for cp_parser_template_declaration. */
22949 static void
22951 {
22954 tree parameter_list;
22959 /* Look for the `template' keyword. */
22964 /* And the `<'. */
22968 {
22969 /* 14.5.2.2 [temp.mem]
22971 A local class shall not have member templates. */
22976 }
22977 /* [temp]
22979 A template ... shall not have C linkage. */
22981 {
22983 /* Give it C++ linkage to avoid confusing other parts of the
22984 front end. */
22987 }
22988 else
22991 /* We cannot perform access checks on the template parameter
22992 declarations until we know what is being declared, just as we
22993 cannot check the decl-specifier list. */
22996 /* If the next token is `>', then we have an invalid
22997 specialization. Rather than complain about an invalid template
22998 parameter, issue an error message here. */
23000 {
23004 }
23005 else
23006 {
23007 /* Parse the template parameters. */
23009 }
23011 /* Get the deferred access checks from the parameter list. These
23012 will be checked once we know what is being declared, as for a
23013 member template the checks must be performed in the scope of the
23014 class containing the member. */
23017 /* Look for the `>'. */
23019 /* We just processed one more parameter list. */
23021 /* If the next token is `template', there are more template
23022 parameters. */
23024 RID_TEMPLATE))
23029 else
23030 {
23031 /* There are no access checks when parsing a template, as we do not
23032 know if a specialization will be a friend. */
23036 checks,
23037 member_p,
23042 /* If this is a member template declaration, let the front
23043 end know. */
23045 {
23050 }
23055 }
23056 /* We are done with the current parameter list. */
23061 /* Finish up. */
23064 /* Check the template arguments for a literal operator template. */
23068 {
23072 else
23073 {
23076 {
23082 }
23084 {
23092 }
23093 else
23095 }
23098 " Expected non-type template argument pack <char...>"
23100 decl);
23101 }
23102 /* Register member declarations. */
23105 /* For the erroneous case of a template with C linkage, we pushed an
23106 implicit C++ linkage scope; exit that scope now. */
23109 /* If DECL is a function template, we must return to parse it later.
23110 (Even though there is no definition, there might be default
23111 arguments that need handling.) */
23115 }
23117 /* Perform the deferred access checks from a template-parameter-list.
23118 CHECKS is a TREE_LIST of access checks, as returned by
23119 get_deferred_access_checks. */
23121 static void
23122 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23123 {
23127 }
23129 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23130 `function-definition' sequence that follows a template header.
23131 If MEMBER_P is true, this declaration appears in a class scope.
23133 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23134 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23136 static tree
23142 {
23145 cp_decl_specifier_seq decl_specifiers;
23149 /* This function is only used when processing a template
23150 declaration. */
23154 /* Defer access checks until we know what is being declared. */
23157 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23158 alternative. */
23161 CP_PARSER_FLAGS_OPTIONAL,
23167 /* There are no template typedefs. */
23169 {
23173 }
23175 /* Gather up the access checks that occurred the
23176 decl-specifier-seq. */
23179 /* Check for the declaration of a template class. */
23181 {
23183 {
23186 /* In this case:
23188 struct C {
23189 friend template <typename T> struct A<T>::B;
23190 };
23192 A<T>::B will be represented by a TYPENAME_TYPE, and
23193 therefore not recognized by shadow_tag. */
23195 && !decl
23202 else
23205 /* Perform access checks for template parameters. */
23207 }
23208 }
23210 /* Complain about missing 'typename' or other invalid type names. */
23213 {
23214 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23215 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23216 the rest of this declaration. */
23219 }
23221 /* If it's not a template class, try for a template function. If
23222 the next token is a `;', then this declaration does not declare
23223 anything. But, if there were errors in the decl-specifiers, then
23224 the error might well have come from an attempted class-specifier.
23225 In that case, there's no need to warn about a missing declarator. */
23229 {
23232 checks,
23234 member_p,
23235 declares_class_or_enum,
23237 NULL);
23239 /* 7.1.1-1 [dcl.stc]
23241 A storage-class-specifier shall not be specified in an explicit
23242 specialization... */
23244 && explicit_specialization_p
23246 {
23250 }
23254 }
23256 /* Look for a trailing `;' after the declaration. */
23262 out:
23265 /* Clear any current qualification; whatever comes next is the start
23266 of something new. */
23272 }
23274 /* Parse a cast-expression that is not the operand of a unary "&". */
23276 static tree
23278 {
23281 }
23283 /* Parse a functional cast to TYPE. Returns an expression
23284 representing the cast. */
23286 static tree
23288 {
23290 tree expression_list;
23291 tree cast;
23298 {
23306 tf_warning_or_error);
23307 }
23316 else
23317 {
23320 }
23323 tf_warning_or_error);
23324 /* [expr.const]/1: In an integral constant expression "only type
23325 conversions to integral or enumeration type can be used". */
23331 NIC_CONSTRUCTOR))
23334 }
23336 /* Save the tokens that make up the body of a member function defined
23337 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23338 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23339 specifiers applied to the declaration. Returns the FUNCTION_DECL
23340 for the member function. */
23342 static tree
23346 tree attributes)
23347 {
23350 tree fn;
23352 /* Create the FUNCTION_DECL. */
23355 /* If something went badly wrong, bail out now. */
23357 {
23358 /* If there's a function-body, skip it. */
23363 }
23365 /* Remember it, if there default args to post process. */
23368 /* Save away the tokens that make up the body of the
23369 function. */
23371 /* Handle function try blocks. */
23374 /* We can have braced-init-list mem-initializers before the fn body. */
23376 {
23379 {
23380 /* cache_group will stop after an un-nested { } pair, too. */
23384 /* variadic mem-inits have ... after the ')'. */
23387 }
23388 }
23390 /* Handle function try blocks. */
23395 /* Save away the inline definition; we will process it when the
23396 class is complete. */
23400 /* We need to know that this was defined in the class, so that
23401 friend templates are handled correctly. */
23404 /* Add FN to the queue of functions to be parsed later. */
23408 }
23410 /* Save the tokens that make up the in-class initializer for a non-static
23411 data member. Returns a DEFAULT_ARG. */
23413 static tree
23415 {
23417 }
23419 /* Parse a template-argument-list, as well as the trailing ">" (but
23420 not the opening "<"). See cp_parser_template_argument_list for the
23421 return value. */
23423 static tree
23425 {
23426 tree arguments;
23427 tree saved_scope;
23428 tree saved_qualifying_scope;
23429 tree saved_object_scope;
23434 /* [temp.names]
23436 When parsing a template-id, the first non-nested `>' is taken as
23437 the end of the template-argument-list rather than a greater-than
23438 operator. */
23439 saved_greater_than_is_operator_p
23442 /* Parsing the argument list may modify SCOPE, so we save it
23443 here. */
23447 /* We need to evaluate the template arguments, even though this
23448 template-id may be nested within a "sizeof". */
23453 /* Parse the template-argument-list itself. */
23457 else
23459 /* Look for the `>' that ends the template-argument-list. If we find
23460 a '>>' instead, it's probably just a typo. */
23462 {
23464 {
23465 /* In C++0x, a `>>' in a template argument list or cast
23466 expression is considered to be two separate `>'
23467 tokens. So, change the current token to a `>', but don't
23468 consume it: it will be consumed later when the outer
23469 template argument list (or cast expression) is parsed.
23470 Note that this replacement of `>' for `>>' is necessary
23471 even if we are parsing tentatively: in the tentative
23472 case, after calling
23473 cp_parser_enclosed_template_argument_list we will always
23474 throw away all of the template arguments and the first
23475 closing `>', either because the template argument list
23476 was erroneous or because we are replacing those tokens
23477 with a CPP_TEMPLATE_ID token. The second `>' (which will
23478 not have been thrown away) is needed either to close an
23479 outer template argument list or to complete a new-style
23480 cast. */
23483 }
23485 {
23486 /* If we're in a nested template argument list, the '>>' has
23487 to be a typo for '> >'. We emit the error message, but we
23488 continue parsing and we push a '>' as next token, so that
23489 the argument list will be parsed correctly. Note that the
23490 global source location is still on the token before the
23491 '>>', so we need to say explicitly where we want it. */
23497 }
23498 else
23499 {
23500 /* If this is not a nested template argument list, the '>>'
23501 is a typo for '>'. Emit an error message and continue.
23502 Same deal about the token location, but here we can get it
23503 right by consuming the '>>' before issuing the diagnostic. */
23506 "spurious %<>>%>, use %<>%> to terminate "
23508 }
23509 }
23510 else
23512 /* The `>' token might be a greater-than operator again now. */
23513 parser->greater_than_is_operator_p
23515 /* Restore the SAVED_SCOPE. */
23523 }
23525 /* MEMBER_FUNCTION is a member function, or a friend. If default
23526 arguments, or the body of the function have not yet been parsed,
23527 parse them now. */
23529 static void
23531 {
23533 /* If this member is a template, get the underlying
23534 FUNCTION_DECL. */
23538 /* There should not be any class definitions in progress at this
23539 point; the bodies of members are only parsed outside of all class
23540 definitions. */
23542 /* While we're parsing the member functions we might encounter more
23543 classes. We want to handle them right away, but we don't want
23544 them getting mixed up with functions that are currently in the
23545 queue. */
23548 /* Make sure that any template parameters are in scope. */
23551 /* If the body of the function has not yet been parsed, parse it
23552 now. */
23554 {
23555 tree function_scope;
23558 /* The function is no longer pending; we are processing it. */
23563 /* If this is a local class, enter the scope of the containing
23564 function. */
23569 /* Push the body of the function onto the lexer stack. */
23572 /* Let the front end know that we going to be defining this
23573 function. */
23577 /* Don't do access checking if it is a templated function. */
23581 /* #pragma omp declare reduction needs special parsing. */
23583 {
23588 }
23589 else
23590 /* Now, parse the body of the function. */
23597 /* Leave the scope of the containing function. */
23601 }
23603 /* Remove any template parameters from the symbol table. */
23606 /* Restore the queue. */
23609 }
23611 /* If DECL contains any default args, remember it on the unparsed
23612 functions queue. */
23614 static void
23616 {
23617 tree probe;
23620 probe;
23623 {
23627 }
23628 }
23630 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23631 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23632 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23633 from the parameter-type-list. */
23635 static tree
23638 {
23640 tree parsed_arg;
23646 /* Push the saved tokens for the default argument onto the parser's
23647 lexer stack. */
23653 /* Parse the default argument. */
23664 {
23665 /* In a non-template class, check conversions now. In a template,
23666 we'll wait and instantiate these as needed. */
23669 tf_warning_or_error);
23670 else
23671 {
23678 /* This represents the whole initialization. */
23680 }
23681 }
23683 /* If the token stream has not been completely used up, then
23684 there was extra junk after the end of the default
23685 argument. */
23687 {
23690 else
23692 }
23694 /* Revert to the main lexer. */
23698 }
23700 /* FIELD is a non-static data member with an initializer which we saved for
23701 later; parse it now. */
23703 static void
23705 {
23706 tree def;
23713 NULL_TREE);
23719 }
23721 /* FN is a FUNCTION_DECL which may contains a parameter with an
23722 unparsed DEFAULT_ARG. Parse the default args now. This function
23723 assumes that the current scope is the scope in which the default
23724 argument should be processed. */
23726 static void
23728 {
23732 /* While we're parsing the default args, we might (due to the
23733 statement expression extension) encounter more classes. We want
23734 to handle them right away, but we don't want them getting mixed
23735 up with default args that are currently in the queue. */
23738 /* Local variable names (and the `this' keyword) may not appear
23739 in a default argument. */
23750 {
23752 tree parsed_arg;
23754 tree copy;
23761 /* This can happen for a friend declaration for a function
23762 already declared with default arguments. */
23765 parsed_arg
23767 default_arg,
23770 {
23772 }
23776 /* Update any instantiations we've already created. */
23780 }
23784 /* Make sure no default arg is missing. */
23787 /* Restore the state of local_variables_forbidden_p. */
23790 /* Restore the queue. */
23792 }
23794 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23796 sizeof ... ( identifier )
23798 where the 'sizeof' token has already been consumed. */
23800 static tree
23802 {
23803 /* Consume the `...'. */
23810 else
23818 /* The name is not qualified. */
23836 }
23838 /* Parse the operand of `sizeof' (or a similar operator). Returns
23839 either a TYPE or an expression, depending on the form of the
23840 input. The KEYWORD indicates which kind of expression we have
23841 encountered. */
23843 static tree
23845 {
23852 /* If it's a `...', then we are computing the length of a parameter
23853 pack. */
23858 /* Types cannot be defined in a `sizeof' expression. Save away the
23859 old message. */
23861 /* And create the new one. */
23867 /* The restrictions on constant-expressions do not apply inside
23868 sizeof expressions. */
23869 saved_integral_constant_expression_p
23871 saved_non_integral_constant_expression_p
23875 /* Do not actually evaluate the expression. */
23878 /* If it's a `(', then we might be looking at the type-id
23879 construction. */
23881 {
23885 /* We can't be sure yet whether we're looking at a type-id or an
23886 expression. */
23888 /* Consume the `('. */
23890 /* Note: as a GNU Extension, compound literals are considered
23891 postfix-expressions as they are in C99, so they are valid
23892 arguments to sizeof. See comment in cp_parser_cast_expression
23893 for details. */
23895 /* Skip tokens until the next token is a closing parenthesis.
23896 If we find the closing `)', and the next token is a `{', then
23897 we are looking at a compound-literal. */
23898 compound_literal_p
23902 /* Roll back the tokens we skipped. */
23904 /* If we were looking at a compound-literal, simulate an error
23905 so that the call to cp_parser_parse_definitely below will
23906 fail. */
23909 else
23910 {
23913 /* Look for the type-id. */
23915 /* Look for the closing `)'. */
23918 }
23920 /* If all went well, then we're done. */
23922 {
23923 cp_decl_specifier_seq decl_specs;
23925 /* Build a trivial decl-specifier-seq. */
23929 /* Call grokdeclarator to figure out what type this is. */
23932 TYPENAME,
23935 }
23936 }
23938 /* If the type-id production did not work out, then we must be
23939 looking at the unary-expression production. */
23944 /* Go back to evaluating expressions. */
23948 /* Free the message we created. */
23950 /* And restore the old one. */
23952 parser->integral_constant_expression_p
23954 parser->non_integral_constant_expression_p
23958 }
23960 /* If the current declaration has no declarator, return true. */
23962 static bool
23964 {
23965 /* If the next token is a `;' or a `,' then there is no
23966 declarator. */
23969 }
23971 /* Update the DECL_SPECS to reflect the storage class indicated by
23972 KEYWORD. */
23974 static void
23979 {
23980 cp_storage_class storage_class;
23983 {
23987 }
23989 {
23992 }
23997 {
24000 }
24003 {
24021 }
24025 /* A storage class specifier cannot be applied alongside a typedef
24026 specifier. If there is a typedef specifier present then set
24027 conflicting_specifiers_p which will trigger an error later
24028 on in grokdeclarator. */
24031 }
24033 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24034 is true, the type is a class or enum definition. */
24036 static void
24038 tree type_spec,
24041 {
24044 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24045 (with, for example, in "typedef int wchar_t;") we remember that
24046 this is what happened. In system headers, we ignore these
24047 declarations so that G++ can work with system headers that are not
24048 C++-safe. */
24050 && !type_definition_p
24060 {
24063 ds_redefined_builtin_type_spec,
24064 token);
24066 {
24070 }
24071 }
24074 else
24075 {
24080 }
24081 }
24083 /* True iff TOKEN is the GNU keyword __thread. */
24085 static bool
24087 {
24090 }
24092 /* Set the location for a declarator specifier and check if it is
24093 duplicated.
24095 DECL_SPECS is the sequence of declarator specifiers onto which to
24096 set the location.
24098 DS is the single declarator specifier to set which location is to
24099 be set onto the existing sequence of declarators.
24101 LOCATION is the location for the declarator specifier to
24102 consider. */
24104 static void
24107 {
24116 {
24120 }
24121 else
24122 {
24124 {
24128 else
24129 {
24132 OPT_Wlong_long,
24134 }
24135 }
24137 {
24142 else
24144 }
24145 else
24146 {
24162 "__complex"
24163 };
24166 }
24167 }
24168 }
24170 /* Return true iff the declarator specifier DS is present in the
24171 sequence of declarator specifiers DECL_SPECS. */
24173 bool
24175 cp_decl_spec ds)
24176 {
24183 }
24185 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24186 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24188 static bool
24190 {
24192 }
24194 /* Issue an error message indicating that TOKEN_DESC was expected.
24195 If KEYWORD is true, it indicated this function is called by
24196 cp_parser_require_keword and the required token can only be
24197 a indicated keyword. */
24199 static void
24201 required_token token_desc,
24203 {
24205 {
24274 }
24276 {
24278 {
24357 }
24358 }
24359 else
24361 }
24365 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24366 issue an error message indicating that TOKEN_DESC was expected.
24368 Returns the token consumed, if the token had the appropriate type.
24369 Otherwise, returns NULL. */
24374 required_token token_desc)
24375 {
24378 else
24379 {
24380 /* Output the MESSAGE -- unless we're parsing tentatively. */
24384 }
24385 }
24387 /* An error message is produced if the next token is not '>'.
24388 All further tokens are skipped until the desired token is
24389 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24391 static void
24393 {
24394 /* Current level of '< ... >'. */
24396 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24399 /* Are we ready, yet? If not, issue error message. */
24403 /* Skip tokens until the desired token is found. */
24405 {
24406 /* Peek at the next token. */
24408 {
24416 /* C++0x views the `>>' operator as two `>' tokens, but
24417 C++98 does not. */
24420 {
24421 /* We've hit a `>>' where the first `>' closes the
24422 template argument list, and the second `>' is
24423 spurious. Just consume the `>>' and stop; we've
24424 already produced at least one error. */
24427 }
24428 /* Fall through for C++0x, so we handle the second `>' in
24429 the `>>'. */
24433 {
24434 /* We've reached the token we want, consume it and stop. */
24437 }
24456 /* The '>' was probably forgotten, don't look further. */
24461 }
24463 /* Consume this token. */
24465 }
24466 }
24468 /* If the next token is the indicated keyword, consume it. Otherwise,
24469 issue an error message indicating that TOKEN_DESC was expected.
24471 Returns the token consumed, if the token had the appropriate type.
24472 Otherwise, returns NULL. */
24477 required_token token_desc)
24478 {
24482 {
24485 }
24488 }
24490 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24491 function-definition. */
24493 static bool
24495 {
24498 /* A ctor-initializer begins with a `:'. */
24500 /* A function-try-block begins with `try'. */
24502 /* A function-transaction-block begins with `__transaction_atomic'
24503 or `__transaction_relaxed'. */
24506 /* The named return value extension begins with `return'. */
24508 }
24510 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24511 definition. */
24513 static bool
24515 {
24522 }
24524 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24525 C++0x) ending a template-argument. */
24527 static bool
24529 {
24537 }
24539 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24540 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24542 static bool
24545 {
24551 /* Check for the sequence `<::' in the original code. It would be lexed as
24552 `[:', where `[' is a digraph, and there is no whitespace before
24553 `:'. */
24555 {
24560 }
24562 }
24564 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24565 or none_type otherwise. */
24567 static enum tag_types
24569 {
24571 {
24581 }
24582 }
24584 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24586 static void
24588 {
24592 {
24596 type))
24599 }
24600 }
24602 /* Issue an error message if DECL is redeclared with different
24603 access than its original declaration [class.access.spec/3].
24604 This applies to nested classes and nested class templates.
24605 [class.mem/1]. */
24607 static void
24609 {
24618 }
24620 /* Look for the `template' keyword, as a syntactic disambiguator.
24621 Return TRUE iff it is present, in which case it will be
24622 consumed. */
24624 static bool
24626 {
24628 {
24629 /* In C++98 the `template' keyword can only be used within templates;
24630 outside templates the parser can always figure out what is a
24631 template and what is not. In C++11, per the resolution of DR 468,
24632 `template' is allowed in cases where it is not strictly necessary. */
24635 {
24638 "in C++98 %<template%> (as a disambiguator) is only "
24640 /* If this part of the token stream is rescanned, the same
24641 error message would be generated. So, we purge the token
24642 from the stream. */
24645 }
24646 else
24647 {
24648 /* Consume the `template' keyword. */
24651 }
24652 }
24654 }
24656 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24657 set PARSER->SCOPE, and perform other related actions. */
24659 static void
24661 {
24667 /* Get the stored value. */
24669 /* Perform any access checks that were deferred. */
24672 {
24677 }
24678 /* Set the scope from the stored value. */
24682 }
24684 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24685 encounter the end of a block before what we were looking for. */
24687 static bool
24691 {
24693 {
24696 /* Abort a parenthesized expression if we encounter a semicolon. */
24700 /* If we've reached the end of the file, stop. */
24706 /* We've hit the end of an enclosing block, so there's been some
24707 kind of syntax error. */
24710 /* Consume the token. */
24712 /* See if it starts a new group. */
24714 {
24716 /* In theory this should probably check end == '}', but
24717 cp_parser_save_member_function_body needs it to exit
24718 after either '}' or ')' when called with ')'. */
24721 }
24723 {
24727 }
24732 }
24733 }
24735 /* Like above, for caching a default argument or NSDMI. Both of these are
24736 terminated by a non-nested comma, but it can be unclear whether or not a
24737 comma is nested in a template argument list unless we do more parsing.
24738 In order to handle this ambiguity, when we encounter a ',' after a '<'
24739 we try to parse what follows as a parameter-declaration-list (in the
24740 case of a default argument) or a member-declarator (in the case of an
24741 NSDMI). If that succeeds, then we stop caching. */
24743 static tree
24745 {
24750 tree default_argument;
24752 /* Add tokens until we have processed the entire default
24753 argument. We add the range [first_token, token). */
24756 {
24757 /* For list-initialization, this is straightforward. */
24760 }
24762 {
24765 /* Peek at the next token. */
24767 /* What we do depends on what token we have. */
24769 {
24770 /* In valid code, a default argument must be
24771 immediately followed by a `,' `)', or `...'. */
24774 {
24775 /* If we've seen a '<', we might be in a
24776 template-argument-list. Until Core issue 325 is
24777 resolved, we don't know how this situation ought
24778 to be handled, so try to DTRT. We check whether
24779 what comes after the comma is a valid parameter
24780 declaration list. If it is, then the comma ends
24781 the default argument; otherwise the default
24782 argument continues. */
24785 /* Set ITALP so cp_parser_parameter_declaration_list
24786 doesn't decide to commit to this parse. */
24794 {
24800 }
24801 else
24802 {
24806 }
24813 }
24816 /* If we run into a non-nested `;', `}', or `]',
24817 then the code is invalid -- but the default
24818 argument is certainly over. */
24823 /* Handle correctly int n = sizeof ... ( p ); */
24826 /* Update DEPTH, if necessary. */
24841 /* This might be the comparison operator, or it might
24842 start a template argument list. */
24849 /* Fall through for C++0x, which treats the `>>'
24850 operator like two `>' tokens in certain
24851 cases. */
24855 {
24856 /* This might be an operator, or it might close a
24857 template argument list. But if a previous '<'
24858 started a template argument list, this will have
24859 closed it, so we can't be in one anymore. */
24863 }
24866 /* If we run out of tokens, issue an error message. */
24875 /* In these cases, we should look for template-ids.
24876 For example, if the default argument is
24877 `X<int, double>()', we need to do name lookup to
24878 figure out whether or not `X' is a template; if
24879 so, the `,' does not end the default argument.
24881 That is not yet done. */
24886 }
24888 /* If we've reached the end, stop. */
24892 /* Add the token to the token block. */
24894 }
24896 /* Create a DEFAULT_ARG to represent the unparsed default
24897 argument. */
24904 }
24906 /* Begin parsing tentatively. We always save tokens while parsing
24907 tentatively so that if the tentative parsing fails we can restore the
24908 tokens. */
24910 static void
24912 {
24913 /* Enter a new parsing context. */
24915 /* Begin saving tokens. */
24917 /* In order to avoid repetitive access control error messages,
24918 access checks are queued up until we are no longer parsing
24919 tentatively. */
24921 }
24923 /* Commit to the currently active tentative parse. */
24925 static void
24927 {
24931 /* Mark all of the levels as committed. */
24934 {
24941 }
24942 }
24944 /* Commit to the topmost currently active tentative parse.
24946 Note that this function shouldn't be called when there are
24947 irreversible side-effects while in a tentative state. For
24948 example, we shouldn't create a permanent entry in the symbol
24949 table, or issue an error message that might not apply if the
24950 tentative parse is aborted. */
24952 static void
24954 {
24959 {
24967 }
24968 }
24970 /* Abort the currently active tentative parse. All consumed tokens
24971 will be rolled back, and no diagnostics will be issued. */
24973 static void
24975 {
24979 /* Now, pretend that we want to see if the construct was
24980 successfully parsed. */
24982 }
24984 /* Stop parsing tentatively. If a parse error has occurred, restore the
24985 token stream. Otherwise, commit to the tokens we have consumed.
24986 Returns true if no error occurred; false otherwise. */
24988 static bool
24990 {
24994 /* Remember whether or not an error occurred, since we are about to
24995 destroy that information. */
24997 /* Remove the topmost context from the stack. */
25000 /* If no parse errors occurred, commit to the tentative parse. */
25002 {
25003 /* Commit to the tokens read tentatively, unless that was
25004 already done. */
25009 }
25010 /* Otherwise, if errors occurred, roll back our state so that things
25011 are just as they were before we began the tentative parse. */
25012 else
25013 {
25016 }
25017 /* Add the context to the front of the free list. */
25022 }
25024 /* Returns true if we are parsing tentatively and are not committed to
25025 this tentative parse. */
25027 static bool
25029 {
25032 }
25034 /* Returns nonzero iff an error has occurred during the most recent
25035 tentative parse. */
25037 static bool
25039 {
25042 }
25044 /* Returns nonzero if GNU extensions are allowed. */
25046 static bool
25048 {
25050 }
25051 \f
25052 /* Objective-C++ Productions */
25055 /* Parse an Objective-C expression, which feeds into a primary-expression
25056 above.
25058 objc-expression:
25059 objc-message-expression
25060 objc-string-literal
25061 objc-encode-expression
25062 objc-protocol-expression
25063 objc-selector-expression
25065 Returns a tree representation of the expression. */
25067 static tree
25069 {
25070 /* Try to figure out what kind of declaration is present. */
25074 {
25084 {
25096 }
25102 }
25105 }
25107 /* Parse an Objective-C message expression.
25109 objc-message-expression:
25110 [ objc-message-receiver objc-message-args ]
25112 Returns a representation of an Objective-C message. */
25114 static tree
25116 {
25125 }
25127 /* Parse an objc-message-receiver.
25129 objc-message-receiver:
25130 expression
25131 simple-type-specifier
25133 Returns a representation of the type or expression. */
25135 static tree
25137 {
25138 tree rcv;
25140 /* An Objective-C message receiver may be either (1) a type
25141 or (2) an expression. */
25150 CP_PARSER_FLAGS_NONE);
25153 }
25155 /* Parse the arguments and selectors comprising an Objective-C message.
25157 objc-message-args:
25158 objc-selector
25159 objc-selector-args
25160 objc-selector-args , objc-comma-args
25162 objc-selector-args:
25163 objc-selector [opt] : assignment-expression
25164 objc-selector-args objc-selector [opt] : assignment-expression
25166 objc-comma-args:
25167 assignment-expression
25168 objc-comma-args , assignment-expression
25170 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25171 selector arguments and TREE_VALUE containing a list of comma
25172 arguments. */
25174 static tree
25176 {
25182 {
25188 /* Detect if we have a unary selector. */
25197 sel_args
25202 }
25204 /* Handle non-selector arguments, if any. */
25206 {
25207 tree arg;
25212 addl_args
25217 }
25220 {
25223 }
25226 }
25228 /* Parse an Objective-C encode expression.
25230 objc-encode-expression:
25231 @encode objc-typename
25233 Returns an encoded representation of the type argument. */
25235 static tree
25237 {
25238 tree type;
25248 {
25252 }
25254 /* This happens if we find @encode(T) (where T is a template
25255 typename or something dependent on a template typename) when
25256 parsing a template. In that case, we can't compile it
25257 immediately, but we rather create an AT_ENCODE_EXPR which will
25258 need to be instantiated when the template is used.
25259 */
25261 {
25265 }
25268 }
25270 /* Parse an Objective-C @defs expression. */
25272 static tree
25274 {
25275 tree name;
25283 }
25285 /* Parse an Objective-C protocol expression.
25287 objc-protocol-expression:
25288 @protocol ( identifier )
25290 Returns a representation of the protocol expression. */
25292 static tree
25294 {
25295 tree proto;
25303 }
25305 /* Parse an Objective-C selector expression.
25307 objc-selector-expression:
25308 @selector ( objc-method-signature )
25310 objc-method-signature:
25311 objc-selector
25312 objc-selector-seq
25314 objc-selector-seq:
25315 objc-selector :
25316 objc-selector-seq objc-selector :
25318 Returns a representation of the method selector. */
25320 static tree
25322 {
25334 {
25343 {
25344 /* Detect if we have a unary selector. */
25346 {
25349 }
25350 else
25351 {
25353 }
25354 }
25359 {
25360 sel_seq
25363 sel_seq
25366 }
25367 else
25368 sel_seq
25373 }
25375 finish_selector:
25379 }
25381 /* Parse a list of identifiers.
25383 objc-identifier-list:
25384 identifier
25385 objc-identifier-list , identifier
25387 Returns a TREE_LIST of identifier nodes. */
25389 static tree
25391 {
25392 tree identifier;
25393 tree list;
25404 {
25411 identifier));
25413 }
25416 }
25418 /* Parse an Objective-C alias declaration.
25420 objc-alias-declaration:
25421 @compatibility_alias identifier identifier ;
25423 This function registers the alias mapping with the Objective-C front end.
25424 It returns nothing. */
25426 static void
25428 {
25436 }
25438 /* Parse an Objective-C class forward-declaration.
25440 objc-class-declaration:
25441 @class objc-identifier-list ;
25443 The function registers the forward declarations with the Objective-C
25444 front end. It returns nothing. */
25446 static void
25448 {
25451 {
25452 tree id;
25462 else
25464 }
25466 }
25468 /* Parse a list of Objective-C protocol references.
25470 objc-protocol-refs-opt:
25471 objc-protocol-refs [opt]
25473 objc-protocol-refs:
25474 < objc-identifier-list >
25476 Returns a TREE_LIST of identifiers, if any. */
25478 static tree
25480 {
25484 {
25488 }
25491 }
25493 /* Parse a Objective-C visibility specification. */
25495 static void
25497 {
25501 {
25516 }
25518 /* Eat '@private'/'@protected'/'@public'. */
25520 }
25522 /* Parse an Objective-C method type. Return 'true' if it is a class
25523 (+) method, and 'false' if it is an instance (-) method. */
25527 {
25530 else
25532 }
25534 /* Parse an Objective-C protocol qualifier. */
25536 static tree
25538 {
25551 {
25556 }
25559 }
25561 /* Parse an Objective-C typename. */
25563 static tree
25565 {
25569 {
25575 /* An ObjC type name may consist of just protocol qualifiers, in which
25576 case the type shall default to 'id'. */
25578 {
25581 /* If the type could not be parsed, an error has already
25582 been produced. For error recovery, behave as if it had
25583 not been specified, which will use the default type
25584 'id'. */
25586 {
25588 /* We need to skip to the closing parenthesis as
25589 cp_parser_type_id() does not seem to do it for
25590 us. */
25595 }
25596 }
25600 }
25603 }
25605 /* Check to see if TYPE refers to an Objective-C selector name. */
25607 static bool
25609 {
25615 }
25617 /* Parse an Objective-C selector. */
25619 static tree
25621 {
25625 {
25628 }
25630 /* C++ operator names are allowed to appear in ObjC selectors. */
25632 {
25645 }
25646 }
25648 /* Parse an Objective-C params list. */
25650 static tree
25652 {
25658 {
25668 /* Detect if we have a unary selector. */
25671 {
25674 }
25678 {
25679 /* Something went quite wrong. There should be a colon
25680 here, but there is not. Stop parsing parameters. */
25682 }
25684 /* New ObjC allows attributes on parameters too. */
25689 params
25692 type_name,
25693 identifier,
25694 parm_attr));
25697 }
25700 {
25703 }
25705 /* We allow tail attributes for the method. */
25707 {
25715 }
25718 {
25721 }
25723 }
25725 /* Parse the non-keyword Objective-C params. */
25727 static tree
25730 {
25736 {
25738 tree parm;
25744 {
25749 }
25751 /* TODO: parse attributes for tail parameters. */
25760 }
25762 /* We allow tail attributes for the method. */
25764 {
25766 {
25771 }
25772 else
25773 /* We have an error, but parse the attributes, so that we can
25774 carry on. */
25780 }
25783 }
25785 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25787 static void
25789 {
25792 /* If the next token is `extern' and the following token is a string
25793 literal, then we have a linkage specification. */
25795 && cp_parser_is_pure_string_literal
25798 /* Handle #pragma, if any. */
25801 /* Allow stray semicolons. */
25804 /* Mark methods as optional or required, when building protocols. */
25806 {
25809 }
25811 {
25814 }
25817 /* Other stray characters must generate errors. */
25819 {
25823 }
25824 /* Finally, try to parse a block-declaration, or a function-definition. */
25825 else
25827 }
25829 /* Parse a method signature. */
25831 static tree
25833 {
25849 }
25851 static bool
25853 {
25854 tree tattr;
25859 /* If the attributes are followed by a method introducer, this is not allowed.
25860 Dump the attributes and flag the situation. */
25865 /* Otherwise, the attributes introduce some interstitial code, possibly so
25866 rewind to allow that check. */
25869 }
25871 /* Parse an Objective-C method prototype list. */
25873 static void
25875 {
25879 {
25881 {
25886 else
25890 {
25894 }
25897 }
25903 OPT_Wattributes,
25905 else
25906 /* Allow for interspersed non-ObjC++ code. */
25910 }
25914 else
25918 }
25920 /* Parse an Objective-C method definition list. */
25922 static void
25924 {
25928 {
25929 tree meth;
25932 {
25938 else
25943 {
25947 }
25949 NULL_TREE);
25951 /* For historical reasons, we accept an optional semicolon. */
25958 {
25965 }
25966 }
25967 /* The following case will be removed once @synthesize is
25968 completely implemented. */
25979 else
25980 /* Allow for interspersed non-ObjC++ code. */
25984 }
25988 else
25992 }
25994 /* Parse Objective-C ivars. */
25996 static void
25998 {
26009 {
26010 cp_decl_specifier_seq declspecs;
26012 tree prefix_attributes;
26020 CP_PARSER_FLAGS_OPTIONAL,
26024 /* auto, register, static, extern, mutable. */
26026 {
26029 }
26031 /* thread_local. */
26033 {
26036 }
26038 /* typedef. */
26040 {
26043 }
26048 /* Keep going until we hit the `;' at the end of the
26049 declaration. */
26051 {
26056 /* Check for a (possibly unnamed) bitfield declaration. */
26064 {
26065 /* Get the name of the bitfield. */
26068 sfk_none);
26070 eat_colon:
26072 /* Get the width of the bitfield. */
26073 width
26076 NULL);
26077 }
26078 else
26079 {
26080 /* Parse the declarator. */
26081 declarator
26086 }
26088 /* Look for attributes that apply to the ivar. */
26090 /* Remember which attributes are prefix attributes and
26091 which are not. */
26093 /* Combine the attributes. */
26097 /* Create the bitfield declaration. */
26099 width,
26100 attributes);
26101 else
26106 /* Add the instance variable. */
26110 /* Reset PREFIX_ATTRIBUTES. */
26119 {
26122 }
26124 }
26128 }
26133 /* Do not consume the RID_AT_END, so it will be read again as terminating
26134 the @interface of @implementation. */
26138 /* For historical reasons, we accept an optional semicolon. */
26141 }
26143 /* Parse an Objective-C protocol declaration. */
26145 static void
26147 {
26153 {
26158 }
26160 /* See if we have a forward declaration or a definition. */
26163 /* Try a forward declaration first. */
26165 {
26167 {
26168 tree id;
26178 else
26180 }
26182 }
26184 /* Ok, we got a full-fledged definition (or at least should). */
26185 else
26186 {
26191 }
26192 }
26194 /* Parse an Objective-C superclass or category. */
26196 static void
26201 {
26207 {
26210 }
26212 {
26215 /* If there is no category name, and this is an @interface, we
26216 have a class extension. */
26218 {
26221 }
26222 else
26226 }
26227 }
26229 /* Parse an Objective-C class interface. */
26231 static void
26233 {
26240 {
26241 /* It's hard to recover because even if valid @interface stuff
26242 is to follow, we can't compile it (or validate it) if we
26243 don't even know which class it refers to. Let's assume this
26244 was a stray '@interface' token in the stream and skip it.
26245 */
26247 }
26252 /* We have either a class or a category on our hands. */
26255 else
26256 {
26258 /* Handle instance variable declarations, if any. */
26261 }
26264 }
26266 /* Parse an Objective-C class implementation. */
26268 static void
26270 {
26277 {
26278 /* It's hard to recover because even if valid @implementation
26279 stuff is to follow, we can't compile it (or validate it) if
26280 we don't even know which class it refers to. Let's assume
26281 this was a stray '@implementation' token in the stream and
26282 skip it.
26283 */
26285 }
26289 /* We have either a class or a category on our hands. */
26292 else
26293 {
26295 /* Handle instance variable declarations, if any. */
26298 }
26301 }
26303 /* Consume the @end token and finish off the implementation. */
26305 static void
26307 {
26310 }
26312 /* Parse an Objective-C declaration. */
26314 static void
26316 {
26317 /* Try to figure out what kind of declaration is present. */
26322 {
26338 }
26341 {
26364 }
26365 }
26367 /* Parse an Objective-C try-catch-finally statement.
26369 objc-try-catch-finally-stmt:
26370 @try compound-statement objc-catch-clause-seq [opt]
26371 objc-finally-clause [opt]
26373 objc-catch-clause-seq:
26374 objc-catch-clause objc-catch-clause-seq [opt]
26376 objc-catch-clause:
26377 @catch ( objc-exception-declaration ) compound-statement
26379 objc-finally-clause:
26380 @finally compound-statement
26382 objc-exception-declaration:
26383 parameter-declaration
26384 '...'
26386 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26388 Returns NULL_TREE.
26390 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26391 for C. Keep them in sync. */
26393 static tree
26395 {
26396 location_t location;
26397 tree stmt;
26402 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26403 node, lest it get absorbed into the surrounding block. */
26409 {
26418 {
26419 /* We have "@catch (...)" (where the '...' are literally
26420 what is in the code). Skip the '...'.
26421 parameter_declaration is set to NULL_TREE, and
26422 objc_being_catch_clauses() knows that that means
26423 '...'. */
26426 }
26427 else
26428 {
26429 /* We have "@catch (NSException *exception)" or something
26430 like that. Parse the parameter declaration. */
26434 else
26439 }
26442 else
26443 {
26444 /* If there was no open parenthesis, we are recovering from
26445 an error, and we are trying to figure out what mistake
26446 the user has made. */
26448 /* If there is an immediate closing parenthesis, the user
26449 probably forgot the opening one (ie, they typed "@catch
26450 NSException *e)". Parse the closing parenthesis and keep
26451 going. */
26455 /* If these is no immediate closing parenthesis, the user
26456 probably doesn't know that parenthesis are required at
26457 all (ie, they typed "@catch NSException *e"). So, just
26458 forget about the closing parenthesis and keep going. */
26459 }
26463 }
26465 {
26468 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26469 node, lest it get absorbed into the surrounding block. */
26473 }
26476 }
26478 /* Parse an Objective-C synchronized statement.
26480 objc-synchronized-stmt:
26481 @synchronized ( expression ) compound-statement
26483 Returns NULL_TREE. */
26485 static tree
26487 {
26488 location_t location;
26499 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26500 node, lest it get absorbed into the surrounding block. */
26505 }
26507 /* Parse an Objective-C throw statement.
26509 objc-throw-stmt:
26510 @throw assignment-expression [opt] ;
26512 Returns a constructed '@throw' statement. */
26514 static tree
26516 {
26528 }
26530 /* Parse an Objective-C statement. */
26532 static tree
26534 {
26535 /* Try to figure out what kind of declaration is present. */
26539 {
26550 }
26553 }
26555 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26556 look ahead to see if an objc keyword follows the attributes. This
26557 is to detect the use of prefix attributes on ObjC @interface and
26558 @protocol. */
26560 static bool
26562 {
26567 {
26570 }
26573 }
26575 /* This routine is a minimal replacement for
26576 c_parser_struct_declaration () used when parsing the list of
26577 types/names or ObjC++ properties. For example, when parsing the
26578 code
26580 @property (readonly) int a, b, c;
26582 this function is responsible for parsing "int a, int b, int c" and
26583 returning the declarations as CHAIN of DECLs.
26585 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26586 similar parsing. */
26587 static tree
26589 {
26591 cp_decl_specifier_seq declspecs;
26593 tree prefix_attributes;
26596 CP_PARSER_FLAGS_NONE,
26603 /* auto, register, static, extern, mutable. */
26605 {
26608 }
26610 /* thread_local. */
26612 {
26615 }
26617 /* typedef. */
26619 {
26622 }
26627 /* Keep going until we hit the `;' at the end of the declaration. */
26629 {
26634 /* Parse the declarator. */
26638 /* Look for attributes that apply to the ivar. */
26640 /* Remember which attributes are prefix attributes and
26641 which are not. */
26643 /* Combine the attributes. */
26653 /* Reset PREFIX_ATTRIBUTES. */
26664 {
26667 }
26668 else
26670 }
26672 }
26674 /* Parse an Objective-C @property declaration. The syntax is:
26676 objc-property-declaration:
26677 '@property' objc-property-attributes[opt] struct-declaration ;
26679 objc-property-attributes:
26680 '(' objc-property-attribute-list ')'
26682 objc-property-attribute-list:
26683 objc-property-attribute
26684 objc-property-attribute-list, objc-property-attribute
26686 objc-property-attribute
26687 'getter' = identifier
26688 'setter' = identifier
26689 'readonly'
26690 'readwrite'
26691 'assign'
26692 'retain'
26693 'copy'
26694 'nonatomic'
26696 For example:
26697 @property NSString *name;
26698 @property (readonly) id object;
26699 @property (retain, nonatomic, getter=getTheName) id name;
26700 @property int a, b, c;
26702 PS: This function is identical to
26703 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26704 static void
26706 {
26707 /* The following variables hold the attributes of the properties as
26708 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26709 seen. When we see an attribute, we set them to 'true' (if they
26710 are boolean properties) or to the identifier (if they have an
26711 argument, ie, for getter and setter). Note that here we only
26712 parse the list of attributes, check the syntax and accumulate the
26713 attributes that we find. objc_add_property_declaration() will
26714 then process the information. */
26724 /* 'properties' is the list of properties that we read. Usually a
26725 single one, but maybe more (eg, in "@property int a, b, c;" there
26726 are three). */
26727 tree properties;
26728 location_t loc;
26734 /* Parse the optional attribute list... */
26736 {
26737 /* Eat the '('. */
26741 {
26747 {
26750 }
26754 {
26765 {
26769 else
26774 }
26777 {
26781 }
26783 {
26785 {
26788 }
26789 else
26793 else
26795 }
26796 else
26797 {
26799 {
26802 }
26803 else
26805 }
26811 }
26818 else
26820 }
26822 /* FIXME: "@property (setter, assign);" will generate a spurious
26823 "error: expected ‘)’ before ‘,’ token". This is because
26824 cp_parser_require, unlike the C counterpart, will produce an
26825 error even if we are in error recovery. */
26827 {
26832 }
26833 }
26835 /* ... and the property declaration(s). */
26839 {
26841 /* If the next token is now a `;', consume it. */
26845 }
26849 else
26850 {
26851 /* Comma-separated properties are chained together in
26852 reverse order; add them one by one. */
26861 }
26864 }
26866 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26868 objc-synthesize-declaration:
26869 @synthesize objc-synthesize-identifier-list ;
26871 objc-synthesize-identifier-list:
26872 objc-synthesize-identifier
26873 objc-synthesize-identifier-list, objc-synthesize-identifier
26875 objc-synthesize-identifier
26876 identifier
26877 identifier = identifier
26879 For example:
26880 @synthesize MyProperty;
26881 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26883 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26884 for C. Keep them in sync.
26885 */
26886 static void
26888 {
26890 location_t loc;
26895 {
26899 {
26902 }
26904 {
26908 {
26911 }
26912 }
26913 else
26918 else
26920 }
26923 }
26925 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26927 objc-dynamic-declaration:
26928 @dynamic identifier-list ;
26930 For example:
26931 @dynamic MyProperty;
26932 @dynamic MyProperty, AnotherProperty;
26934 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26935 for C. Keep them in sync.
26936 */
26937 static void
26939 {
26941 location_t loc;
26946 {
26947 tree property;
26950 {
26953 }
26957 else
26959 }
26962 }
26964 \f
26965 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26967 /* Returns name of the next clause.
26968 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26969 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26970 returned and the token is consumed. */
26972 static pragma_omp_clause
26974 {
26986 {
26991 {
27094 }
27095 }
27101 }
27103 /* Validate that a clause of the given type does not already exist. */
27105 static void
27108 {
27109 tree c;
27113 {
27116 }
27117 }
27119 /* OpenMP 2.5:
27120 variable-list:
27121 identifier
27122 variable-list , identifier
27124 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27125 colon). An opening parenthesis will have been consumed by the caller.
27127 If KIND is nonzero, create the appropriate node and install the decl
27128 in OMP_CLAUSE_DECL and add the node to the head of the list.
27130 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27131 return the list created.
27133 COLON can be NULL if only closing parenthesis should end the list,
27134 or pointer to bool which will receive false if the list is terminated
27135 by closing parenthesis or true if the list is terminated by colon. */
27137 static tree
27140 {
27144 {
27147 }
27149 {
27166 {
27168 {
27174 {
27181 NULL);
27183 parser->colon_corrects_to_scope_p
27187 else
27188 {
27189 /* Look for `:'. */
27193 CPP_CLOSE_SQUARE))
27196 NULL);
27197 }
27198 /* Look for the closing `]'. */
27200 RT_CLOSE_SQUARE))
27203 }
27207 }
27213 }
27214 else
27217 get_comma:
27221 }
27227 {
27231 }
27234 {
27237 /* Try to resync to an unnested comma. Copied from
27238 cp_parser_parenthesized_expression_list. */
27239 skip_comma:
27248 }
27251 }
27253 /* Similarly, but expect leading and trailing parenthesis. This is a very
27254 common case for omp clauses. */
27256 static tree
27258 {
27262 }
27264 /* OpenMP 3.0:
27265 collapse ( constant-expression ) */
27267 static tree
27269 {
27271 location_t loc;
27272 HOST_WIDE_INT n;
27292 {
27295 }
27303 }
27305 /* OpenMP 2.5:
27306 default ( shared | none ) */
27308 static tree
27310 {
27312 tree c;
27317 {
27322 {
27337 }
27340 }
27341 else
27342 {
27343 invalid_kind:
27345 }
27361 }
27363 /* OpenMP 3.1:
27364 final ( expression ) */
27366 static tree
27368 {
27389 }
27391 /* OpenMP 2.5:
27392 if ( expression ) */
27394 static tree
27396 {
27417 }
27419 /* OpenMP 3.1:
27420 mergeable */
27422 static tree
27425 {
27426 tree c;
27429 location);
27434 }
27436 /* OpenMP 2.5:
27437 nowait */
27439 static tree
27442 {
27443 tree c;
27450 }
27452 /* OpenMP 2.5:
27453 num_threads ( expression ) */
27455 static tree
27457 location_t location)
27458 {
27480 }
27482 /* OpenMP 2.5:
27483 ordered */
27485 static tree
27488 {
27489 tree c;
27497 }
27499 /* OpenMP 2.5:
27500 reduction ( reduction-operator : variable-list )
27502 reduction-operator:
27503 One of: + * - & ^ | && ||
27505 OpenMP 3.1:
27507 reduction-operator:
27508 One of: + * - & ^ | && || min max
27510 OpenMP 4.0:
27512 reduction-operator:
27513 One of: + * - & ^ | && ||
27514 id-expression */
27516 static tree
27518 {
27526 {
27536 }
27540 else
27541 {
27552 {
27582 }
27583 else
27584 {
27586 resync_fail:
27591 }
27592 }
27598 NULL);
27600 {
27603 }
27606 }
27608 /* OpenMP 2.5:
27609 schedule ( schedule-kind )
27610 schedule ( schedule-kind , expression )
27612 schedule-kind:
27613 static | dynamic | guided | runtime | auto */
27615 static tree
27617 {
27626 {
27631 {
27652 }
27653 }
27658 else
27663 {
27678 else
27683 }
27691 invalid_kind:
27693 resync_fail:
27698 }
27700 /* OpenMP 3.0:
27701 untied */
27703 static tree
27706 {
27707 tree c;
27714 }
27716 /* OpenMP 4.0:
27717 inbranch
27718 notinbranch */
27720 static tree
27723 {
27728 }
27730 /* OpenMP 4.0:
27731 parallel
27732 for
27733 sections
27734 taskgroup */
27736 static tree
27740 {
27744 }
27746 /* OpenMP 4.0:
27747 num_teams ( expression ) */
27749 static tree
27751 location_t location)
27752 {
27774 }
27776 /* OpenMP 4.0:
27777 thread_limit ( expression ) */
27779 static tree
27781 location_t location)
27782 {
27804 }
27806 /* OpenMP 4.0:
27807 aligned ( variable-list )
27808 aligned ( variable-list : constant-expression ) */
27810 static tree
27812 {
27823 {
27833 }
27839 }
27841 /* OpenMP 4.0:
27842 linear ( variable-list )
27843 linear ( variable-list : expression ) */
27845 static tree
27848 {
27859 {
27863 {
27866 }
27874 }
27880 }
27882 /* OpenMP 4.0:
27883 safelen ( constant-expression ) */
27885 static tree
27887 location_t location)
27888 {
27909 }
27911 /* OpenMP 4.0:
27912 simdlen ( constant-expression ) */
27914 static tree
27916 location_t location)
27917 {
27938 }
27940 /* OpenMP 4.0:
27941 depend ( depend-kind : variable-list )
27943 depend-kind:
27944 in | out | inout */
27946 static tree
27948 {
27956 {
27966 else
27968 }
27969 else
27977 NULL);
27984 invalid_kind:
27986 resync_fail:
27991 }
27993 /* OpenMP 4.0:
27994 map ( map-kind : variable-list )
27995 map ( variable-list )
27997 map-kind:
27998 alloc | to | from | tofrom */
28000 static tree
28002 {
28011 {
28023 else
28024 {
28030 }
28033 }
28036 NULL);
28042 }
28044 /* OpenMP 4.0:
28045 device ( expression ) */
28047 static tree
28049 location_t location)
28050 {
28072 }
28074 /* OpenMP 4.0:
28075 dist_schedule ( static )
28076 dist_schedule ( static , expression ) */
28078 static tree
28080 location_t location)
28081 {
28094 {
28105 }
28110 location);
28114 invalid_kind:
28116 resync_fail:
28121 }
28123 /* OpenMP 4.0:
28124 proc_bind ( proc-bind-kind )
28126 proc-bind-kind:
28127 master | close | spread */
28129 static tree
28131 location_t location)
28132 {
28133 tree c;
28140 {
28150 else
28152 }
28153 else
28162 location);
28167 invalid_kind:
28169 resync_fail:
28174 }
28176 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28177 is a bitmask in MASK. Return the list of clauses found; the result
28178 of clause default goes in *pdefault. */
28180 static tree
28184 {
28191 {
28192 pragma_omp_clause c_kind;
28203 {
28215 clauses);
28229 clauses);
28238 clauses);
28262 clauses);
28276 clauses);
28293 OMP_CLAUSE_NOTINBRANCH,
28302 {
28303 clause_not_first:
28307 }
28332 clauses);
28337 clauses);
28342 clauses);
28405 }
28410 {
28411 /* Remove the invalid clause(s) from the list to avoid
28412 confusing the rest of the compiler. */
28415 }
28416 }
28417 saw_error:
28418 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
28419 no reason to skip to the end. */
28425 }
28427 /* OpenMP 2.5:
28428 structured-block:
28429 statement
28431 In practice, we're also interested in adding the statement to an
28432 outer node. So it is convenient if we work around the fact that
28433 cp_parser_statement calls add_stmt. */
28435 static unsigned
28437 {
28440 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28441 This preserves the "not within loop or switch" style error messages
28442 for nonsense cases like
28443 void foo() {
28444 #pragma omp single
28445 break;
28446 }
28447 */
28452 }
28454 static void
28456 {
28458 }
28460 static tree
28462 {
28470 }
28472 /* OpenMP 2.5:
28473 # pragma omp atomic new-line
28474 expression-stmt
28476 expression-stmt:
28477 x binop= expr | x++ | ++x | x-- | --x
28478 binop:
28479 +, *, -, /, &, ^, |, <<, >>
28481 where x is an lvalue expression with scalar type.
28483 OpenMP 3.1:
28484 # pragma omp atomic new-line
28485 update-stmt
28487 # pragma omp atomic read new-line
28488 read-stmt
28490 # pragma omp atomic write new-line
28491 write-stmt
28493 # pragma omp atomic update new-line
28494 update-stmt
28496 # pragma omp atomic capture new-line
28497 capture-stmt
28499 # pragma omp atomic capture new-line
28500 capture-block
28502 read-stmt:
28503 v = x
28504 write-stmt:
28505 x = expr
28506 update-stmt:
28507 expression-stmt | x = x binop expr
28508 capture-stmt:
28509 v = expression-stmt
28510 capture-block:
28511 { v = x; update-stmt; } | { update-stmt; v = x; }
28513 OpenMP 4.0:
28514 update-stmt:
28515 expression-stmt | x = x binop expr | x = expr binop x
28516 capture-stmt:
28517 v = update-stmt
28518 capture-block:
28519 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28521 where x and v are lvalue expressions with scalar type. */
28523 static void
28525 {
28533 {
28545 else
28549 }
28552 {
28557 {
28560 }
28561 }
28565 {
28576 else
28582 {
28583 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28584 opcode. */
28589 }
28593 {
28596 }
28597 else
28598 {
28605 }
28608 }
28610 restart:
28615 {
28622 /* FALLTHROUGH */
28632 /* FALLTHROUGH */
28647 /* Undo effects of boolean_increment for post {in,de}crement. */
28649 /* FALLTHRU */
28653 {
28654 /* Undo effects of boolean_increment. */
28656 {
28657 /* This is pre or post increment. */
28662 && !structured_block
28666 }
28667 }
28668 /* FALLTHRU */
28671 {
28706 {
28710 }
28713 {
28719 {
28724 }
28726 {
28737 {
28739 {
28744 }
28745 else
28747 }
28751 }
28754 {
28761 }
28765 }
28769 {
28772 {
28780 }
28782 {
28787 }
28822 }
28833 /* FALLTHROUGH */
28838 }
28845 }
28846 stmt_done:
28848 {
28861 }
28863 {
28866 }
28867 done:
28873 saw_error:
28876 {
28880 {
28884 }
28885 }
28886 }
28889 /* OpenMP 2.5:
28890 # pragma omp barrier new-line */
28892 static void
28894 {
28897 }
28899 /* OpenMP 2.5:
28900 # pragma omp critical [(name)] new-line
28901 structured-block */
28903 static tree
28905 {
28909 {
28921 }
28926 }
28928 /* OpenMP 2.5:
28929 # pragma omp flush flush-vars[opt] new-line
28931 flush-vars:
28932 ( variable-list ) */
28934 static void
28936 {
28942 }
28944 /* Helper function, to parse omp for increment expression. */
28946 static tree
28948 {
28953 {
28956 }
28959 {
28968 /* Fall through: OpenMP disallows NE_EXPR. */
28971 }
28973 /* If decl is an iterator, preserve LHS and RHS of the relational
28974 expr until finish_omp_for. */
28984 }
28986 /* Helper function, to parse omp for increment expression. */
28988 static tree
28990 {
28994 cp_id_kind idk;
28998 {
29006 }
29014 {
29019 }
29026 {
29030 }
29042 do
29043 {
29050 {
29052 {
29055 else
29057 tf_warning_or_error);
29058 }
29059 else
29062 }
29063 }
29067 {
29071 }
29072 else
29076 }
29078 /* Parse the initialization statement of either an OpenMP for loop or
29079 a Cilk Plus for loop.
29081 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29082 Plus.
29084 Return true if the resulting construct should have an
29085 OMP_CLAUSE_PRIVATE added to it. */
29087 static bool
29095 {
29101 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29103 init-expr:
29104 var = lb
29105 integer-type var = lb
29106 random-access-iterator-type var = lb
29107 pointer-type var = lb
29108 */
29109 cp_decl_specifier_seq type_specifiers;
29111 /* First, try to parse as an initialized declaration. See
29112 cp_parser_condition, from whence the bulk of this is copied. */
29119 {
29120 /* If parsing a type specifier seq succeeded, then this
29121 MUST be a initialized declaration. */
29126 CP_PARSER_DECLARATOR_NAMED,
29136 else
29137 {
29147 {
29149 CPP_OPEN_PAREN))
29150 {
29154 else
29157 }
29158 else
29159 /* Trigger an error. */
29164 }
29168 {
29176 {
29179 auto_node);
29184 }
29187 asm_specification,
29188 LOOKUP_ONLYCONVERTING);
29190 {
29193 }
29194 else
29197 }
29198 else
29199 {
29200 /* Consume '='. */
29204 non_class:
29207 else
29210 asm_specification,
29211 LOOKUP_ONLYCONVERTING);
29212 }
29216 }
29217 }
29218 else
29219 {
29220 cp_id_kind idk;
29221 /* If parsing a type specifier sequence failed, then
29222 this MUST be a simple expression. */
29227 && decl
29230 {
29231 tree rhs;
29238 rhs,
29239 tf_warning_or_error));
29241 }
29242 else
29243 {
29248 {
29252 }
29253 }
29254 }
29256 }
29258 /* Parse the restricted form of the for statement allowed by OpenMP. */
29260 static tree
29263 {
29267 location_t loc_first;
29286 {
29289 location_t loc;
29292 {
29295 }
29304 add_private_clause
29312 {
29315 {
29321 }
29322 else
29324 }
29331 {
29336 {
29340 }
29343 {
29344 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29345 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29354 }
29355 else
29356 {
29361 }
29362 }
29365 {
29366 tree c;
29368 {
29377 decl);
29381 decl);
29382 }
29384 {
29389 {
29392 }
29393 }
29394 }
29403 {
29404 /* If decl is an iterator, preserve the operator on decl
29405 until finish_omp_for. */
29407 && ((processing_template_decl
29411 else
29415 }
29430 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29431 in between the collapsed for loops to be still considered perfectly
29432 nested. Hopefully the final version clarifies this.
29433 For now handle (multiple) {'s and empty statements. */
29435 do
29436 {
29440 {
29442 bracecount++;
29443 }
29447 else
29448 {
29455 }
29456 }
29460 {
29463 }
29464 }
29466 /* Note that we saved the original contents of this flag when we entered
29467 the structured block, and so we don't need to re-save it here. */
29470 else
29473 /* Note that the grammar doesn't call for a structured block here,
29474 though the loop as a whole is a structured block. */
29481 else
29486 {
29488 {
29490 nbraces--;
29491 }
29494 else
29495 {
29497 {
29500 }
29505 }
29506 }
29513 }
29515 /* Helper function for OpenMP parsing, split clauses and call
29516 finish_omp_clauses on each of the set of clauses afterwards. */
29518 static void
29521 {
29527 }
29529 /* OpenMP 4.0:
29530 #pragma omp simd simd-clause[optseq] new-line
29531 for-loop */
29533 #define OMP_SIMD_CLAUSE_MASK \
29534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29542 static tree
29545 {
29557 {
29560 }
29571 }
29573 /* OpenMP 2.5:
29574 #pragma omp for for-clause[optseq] new-line
29575 for-loop
29577 OpenMP 4.0:
29578 #pragma omp for simd for-simd-clause[optseq] new-line
29579 for-loop */
29581 #define OMP_FOR_CLAUSE_MASK \
29582 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29591 static tree
29594 {
29605 {
29610 {
29618 cclauses);
29622 cclauses);
29634 }
29635 }
29637 {
29640 }
29645 {
29648 }
29659 }
29661 /* OpenMP 2.5:
29662 # pragma omp master new-line
29663 structured-block */
29665 static tree
29667 {
29671 }
29673 /* OpenMP 2.5:
29674 # pragma omp ordered new-line
29675 structured-block */
29677 static tree
29679 {
29683 }
29685 /* OpenMP 2.5:
29687 section-scope:
29688 { section-sequence }
29690 section-sequence:
29691 section-directive[opt] structured-block
29692 section-sequence section-directive structured-block */
29694 static tree
29696 {
29707 {
29711 }
29714 {
29722 {
29726 }
29728 {
29731 }
29736 }
29747 }
29749 /* OpenMP 2.5:
29750 # pragma omp sections sections-clause[optseq] newline
29751 sections-scope */
29753 #define OMP_SECTIONS_CLAUSE_MASK \
29754 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29760 static tree
29763 {
29775 {
29778 }
29785 }
29787 /* OpenMP 2.5:
29788 # pragma omp parallel parallel-clause[optseq] new-line
29789 structured-block
29790 # pragma omp parallel for parallel-for-clause[optseq] new-line
29791 structured-block
29792 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
29793 structured-block
29795 OpenMP 4.0:
29796 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
29797 structured-block */
29799 #define OMP_PARALLEL_CLAUSE_MASK \
29800 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29810 static tree
29813 {
29822 {
29835 block);
29838 }
29840 {
29844 }
29846 {
29849 }
29851 {
29855 {
29865 block);
29868 }
29869 }
29879 }
29881 /* OpenMP 2.5:
29882 # pragma omp single single-clause[optseq] new-line
29883 structured-block */
29885 #define OMP_SINGLE_CLAUSE_MASK \
29886 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29891 static tree
29893 {
29903 }
29905 /* OpenMP 3.0:
29906 # pragma omp task task-clause[optseq] new-line
29907 structured-block */
29909 #define OMP_TASK_CLAUSE_MASK \
29910 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29911 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29912 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29913 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29914 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29920 static tree
29922 {
29933 }
29935 /* OpenMP 3.0:
29936 # pragma omp taskwait new-line */
29938 static void
29940 {
29943 }
29945 /* OpenMP 3.1:
29946 # pragma omp taskyield new-line */
29948 static void
29950 {
29953 }
29955 /* OpenMP 4.0:
29956 # pragma omp taskgroup new-line
29957 structured-block */
29959 static tree
29961 {
29965 }
29968 /* OpenMP 2.5:
29969 # pragma omp threadprivate (variable-list) */
29971 static void
29973 {
29974 tree vars;
29980 }
29982 /* OpenMP 4.0:
29983 # pragma omp cancel cancel-clause[optseq] new-line */
29985 #define OMP_CANCEL_CLAUSE_MASK \
29986 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
29990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29992 static void
29994 {
29998 }
30000 /* OpenMP 4.0:
30001 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30003 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30004 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30009 static void
30011 {
30012 tree clauses;
30016 {
30021 {
30024 }
30025 }
30027 {
30031 }
30034 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30036 pragma_tok);
30038 }
30040 /* OpenMP 4.0:
30041 #pragma omp distribute distribute-clause[optseq] new-line
30042 for-loop */
30044 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30045 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30050 static tree
30053 {
30062 {
30070 else
30073 {
30079 {
30082 cclauses);
30083 else
30085 cclauses);
30086 }
30091 cclauses);
30092 else
30094 cclauses);
30106 }
30107 }
30109 {
30112 }
30117 {
30120 }
30131 }
30133 /* OpenMP 4.0:
30134 # pragma omp teams teams-clause[optseq] new-line
30135 structured-block */
30137 #define OMP_TEAMS_CLAUSE_MASK \
30138 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30146 static tree
30149 {
30158 {
30162 {
30170 cclauses);
30174 cclauses);
30185 }
30186 }
30188 {
30191 }
30196 {
30199 }
30207 }
30209 /* OpenMP 4.0:
30210 # pragma omp target data target-data-clause[optseq] new-line
30211 structured-block */
30213 #define OMP_TARGET_DATA_CLAUSE_MASK \
30214 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30218 static tree
30220 {
30232 }
30234 /* OpenMP 4.0:
30235 # pragma omp target update target-update-clause[optseq] new-line */
30237 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30238 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30243 static bool
30246 {
30248 {
30250 "%<#pragma omp target update%> may only be "
30254 }
30256 tree clauses
30261 {
30263 "%<#pragma omp target update must contain at least one "
30266 }
30274 }
30276 /* OpenMP 4.0:
30277 # pragma omp target target-clause[optseq] new-line
30278 structured-block */
30280 #define OMP_TARGET_CLAUSE_MASK \
30281 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30285 static bool
30288 {
30290 {
30294 }
30297 {
30302 {
30327 }
30329 {
30332 }
30334 {
30338 }
30340 {
30343 }
30344 }
30358 }
30360 /* OpenMP 4.0:
30361 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30363 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30364 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30371 static void
30374 {
30376 cp_omp_declare_simd_data data;
30378 {
30383 }
30394 {
30398 {
30411 }
30416 "%<#pragma omp declare simd%> not immediately followed by "
30420 }
30421 }
30423 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
30424 This function is modelled similar to the late parsing of omp declare
30425 simd. */
30427 static tree
30429 {
30435 {
30441 }
30443 {
30447 }
30452 {
30459 NULL);
30473 }
30478 }
30480 /* Finalize #pragma omp declare simd clauses after direct declarator has
30481 been parsed, and put that into "omp declare simd" attribute. */
30483 static tree
30485 {
30491 {
30496 }
30501 {
30519 }
30523 }
30526 /* OpenMP 4.0:
30527 # pragma omp declare target new-line
30528 declarations and definitions
30529 # pragma omp end declare target new-line */
30531 static void
30533 {
30536 }
30538 static void
30540 {
30543 {
30546 }
30548 {
30552 {
30555 }
30558 else
30559 {
30563 }
30564 }
30565 else
30566 {
30570 }
30574 "%<#pragma omp end declare target%> without corresponding "
30576 else
30578 }
30580 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30581 expression and optional initializer clause of
30582 #pragma omp declare reduction. We store the expression(s) as
30583 either 3, 6 or 7 special statements inside of the artificial function's
30584 body. The first two statements are DECL_EXPRs for the artificial
30585 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30586 expression that uses those variables.
30587 If there was any INITIALIZER clause, this is followed by further statements,
30588 the fourth and fifth statements are DECL_EXPRs for the artificial
30589 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30590 constructor variant (first token after open paren is not omp_priv),
30591 then the sixth statement is a statement with the function call expression
30592 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30593 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30594 to initialize the OMP_PRIV artificial variable and there is seventh
30595 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30597 static bool
30599 {
30611 tree combiner;
30626 {
30629 }
30632 {
30639 {
30642 }
30658 {
30662 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30666 == CPP_CLOSE_PAREN
30669 {
30673 }
30678 }
30679 else
30680 {
30696 {
30701 }
30703 tree arg;
30716 }
30727 }
30733 }
30735 /* OpenMP 4.0
30736 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30737 initializer-clause[opt] new-line
30739 initializer-clause:
30740 initializer (omp_priv initializer)
30741 initializer (function-name (argument-list)) */
30743 static void
30746 {
30756 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
30763 {
30795 }
30807 /* Types may not be defined in declare reduction type list. */
30810 parser->type_definition_forbidden_message
30816 saved_colon_doesnt_start_class_def_p
30821 {
30825 ;
30846 else
30851 else
30853 }
30855 /* Restore the saved message. */
30858 parser->colon_doesnt_start_class_def_p
30863 {
30864 fail:
30867 }
30873 {
30874 tree fntype
30877 NULL_TREE);
30896 {
30901 }
30903 {
30905 {
30914 }
30921 }
30922 else
30923 {
30926 }
30929 else
30932 {
30935 }
30937 {
30940 else
30945 }
30950 else
30951 {
30960 }
30967 }
30971 done:
30972 /* Free any declarators allocated. */
30974 }
30976 /* OpenMP 4.0
30977 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30978 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30979 initializer-clause[opt] new-line
30980 #pragma omp declare target new-line */
30982 static void
30985 {
30987 {
30992 {
30995 context);
30997 }
31000 {
31003 context);
31005 }
31007 {
31010 }
31012 {
31016 }
31017 }
31021 }
31023 /* Main entry point to OpenMP statement pragmas. */
31025 static void
31027 {
31028 tree stmt;
31033 {
31081 }
31085 }
31086 \f
31087 /* Transactional Memory parsing routines. */
31089 /* Parse a transaction attribute.
31091 txn-attribute:
31092 attribute
31093 [ [ identifier ] ]
31095 ??? Simplify this when C++0x bracket attributes are
31096 implemented properly. */
31098 static tree
31100 {
31115 {
31119 /* For keywords, use the canonical spelling,
31120 not the parsed identifier. */
31124 }
31125 else
31129 error1:
31132 }
31134 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31136 transaction-statement:
31137 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31138 compound-statement
31139 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31140 */
31142 static tree
31144 {
31159 else
31160 {
31164 }
31166 /* Parse a noexcept specification. */
31169 /* Keep track if we're in the lexical scope of an outer transaction. */
31181 }
31183 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31185 transaction-expression:
31186 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31187 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31188 */
31190 static tree
31192 {
31217 /* Set this early. This might mean that we allow transaction_cancel in
31218 an expression that we find out later actually has to be a constexpr.
31219 However, we expect that cxx_constant_value will be able to deal with
31220 this; also, if the noexcept has no constexpr, then what we parse next
31221 really is a transaction's body. */
31224 /* Parse a noexcept specification. */
31230 {
31237 }
31238 else
31239 {
31240 /* The only expression that is available got parsed for the noexcept
31241 already. noexcept is true then. */
31244 }
31253 }
31255 /* Parse a function-transaction-block.
31257 function-transaction-block:
31258 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31259 function-body
31260 __transaction_atomic txn-attribute[opt] function-try-block
31261 __transaction_relaxed ctor-initializer[opt] function-body
31262 __transaction_relaxed function-try-block
31263 */
31265 static bool
31267 {
31283 else
31284 {
31288 }
31296 else
31297 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31305 }
31307 /* Parse a __transaction_cancel statement.
31309 cancel-statement:
31310 __transaction_cancel txn-attribute[opt] ;
31311 __transaction_cancel txn-attribute[opt] throw-expression ;
31313 ??? Cancel and throw is not yet implemented. */
31315 static tree
31317 {
31323 RT_TRANSACTION_CANCEL);
31330 /* ??? Parse cancel-and-throw here. */
31335 {
31339 }
31341 {
31345 }
31347 {
31350 {
31356 }
31357 }
31359 {
31363 }
31369 }
31370 \f
31371 /* The parser. */
31375 \f
31376 /* Special handling for the first token or line in the file. The first
31377 thing in the file might be #pragma GCC pch_preprocess, which loads a
31378 PCH file, which is a GC collection point. So we need to handle this
31379 first pragma without benefit of an existing lexer structure.
31381 Always returns one token to the caller in *FIRST_TOKEN. This is
31382 either the true first token of the file, or the first token after
31383 the initial pragma. */
31385 static void
31387 {
31396 {
31403 }
31404 else
31407 /* Skip to the end of the pragma. */
31411 /* Now actually load the PCH file. */
31415 /* Read one more token to return to our caller. We have to do this
31416 after reading the PCH file in, since its pointers have to be
31417 live. */
31419 }
31421 /* Normal parsing of a pragma token. Here we can (and must) use the
31422 regular lexer. */
31424 static bool
31426 {
31438 {
31446 {
31456 }
31461 {
31471 }
31476 {
31482 "%<#pragma omp taskwait%> may only be "
31487 }
31492 {
31498 "%<#pragma omp taskyield%> may only be "
31503 }
31508 {
31514 "%<#pragma omp cancel%> may only be "
31519 }
31524 {
31530 "%<#pragma omp cancellation point%> may only be "
31535 }
31573 "%<#pragma omp section%> may only be used in "
31578 {
31585 {
31588 }
31591 }
31595 {
31599 }
31608 bad_stmt:
31611 }
31615 }
31617 /* The interface the pragma parsers have to the lexer. */
31619 enum cpp_ttype
31621 {
31634 else
31635 {
31639 }
31642 }
31644 \f
31645 /* External interface. */
31647 /* Parse one entire translation unit. */
31649 void
31651 {
31655 {
31658 }
31666 }
31668 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
31669 vectorlength clause:
31670 Syntax:
31671 vectorlength ( constant-expression ) */
31673 static tree
31676 {
31678 tree expr;
31679 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
31680 safelen clause. Thus, vectorlength is represented as OMP 4.0
31681 safelen. For SIMD-enabled function it is represented by OMP 4.0
31682 simdlen. */
31685 loc);
31686 else
31688 loc);
31696 /* If expr == error_mark_node, then don't emit any errors nor
31697 create a clause. if any of the above functions returns
31698 error mark node then they would have emitted an error message. */
31700 ;
31708 else
31709 {
31710 tree c;
31712 {
31717 }
31718 else
31719 {
31724 }
31725 }
31730 }
31732 /* Handles the Cilk Plus #pragma simd linear clause.
31733 Syntax:
31734 linear ( simd-linear-variable-list )
31736 simd-linear-variable-list:
31737 simd-linear-variable
31738 simd-linear-variable-list , simd-linear-variable
31740 simd-linear-variable:
31741 id-expression
31742 id-expression : simd-linear-step
31744 simd-linear-step:
31745 conditional-expression */
31747 static tree
31749 {
31755 {
31759 }
31764 {
31767 {
31771 }
31778 {
31782 }
31783 else
31784 {
31788 /* If present, parse the linear step. Otherwise, assume the default
31789 value of 1. */
31791 {
31798 {
31799 /* If an error has occurred, then the whole pragma is
31800 considered ill-formed. Thus, no reason to keep
31801 parsing. */
31804 }
31812 else
31814 "step size must be an integer constant "
31816 }
31818 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
31824 }
31829 else
31830 {
31835 }
31836 }
31840 }
31842 /* Returns the name of the next clause. If the clause is not
31843 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
31844 token is not consumed. Otherwise, the appropriate enum from the
31845 pragma_simd_clause is returned and the token is consumed. */
31847 static pragma_omp_clause
31849 {
31850 pragma_omp_clause clause_type;
31867 else
31872 }
31874 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
31876 static tree
31878 {
31883 {
31884 pragma_omp_clause c_kind;
31891 /* Use the OpenMP 4.0 equivalent function. */
31894 /* Use the OpenMP 4.0 equivalent function. */
31896 clauses);
31898 /* Use the OMP 4.0 equivalent function. */
31900 clauses);
31902 /* Use the OMP 4.0 equivalent function. */
31904 else
31905 {
31909 }
31910 }
31916 else
31918 }
31920 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
31922 static void
31924 {
31931 {
31935 }
31945 }
31947 /* Create an identifier for a generic parameter type (a synthesized
31948 template parameter implied by `auto' or a concept identifier). */
31951 static tree
31953 {
31957 }
31959 /* Predicate that behaves as is_auto_or_concept but matches the parent
31960 node of the generic type rather than the generic type itself. This
31961 allows for type transformation in add_implicit_template_parms. */
31965 {
31967 }
31969 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
31970 (creating a new template parameter list if necessary). Returns the newly
31971 created template type parm. */
31973 tree
31975 {
31978 /* We are either continuing a function template that already contains implicit
31979 template parameters, creating a new fully-implicit function template, or
31980 extending an existing explicit function template with implicit template
31981 parameters. */
31989 {
31993 }
31994 else
31995 {
31996 /* Roll back to the existing template parameter scope (in the case of
31997 extending an explicit function template) or introduce a new template
31998 parameter scope ahead of the function parameter scope (or class scope
31999 in the case of out-of-line member definitions). The function scope is
32000 added back after template parameter synthesis below. */
32005 {
32008 }
32010 {
32011 /* If not defining a class, then any class scope is a scope level in
32012 an out-of-line member definition. In this case simply wind back
32013 beyond the first such scope to inject the template parameter list.
32014 Otherwise wind back to the class being defined. The latter can
32015 occur in class member friend declarations such as:
32017 class A {
32018 void foo (auto);
32019 };
32020 class B {
32021 friend void A::foo (auto);
32022 };
32024 The template parameter list synthesized for the friend declaration
32025 must be injected in the scope of 'B'. This can also occur in
32026 erroneous cases such as:
32028 struct A {
32029 struct B {
32030 void foo (auto);
32031 };
32032 void B::foo (auto) {}
32033 };
32035 Here the attempted definition of 'B::foo' within 'A' is ill-formed
32036 but, nevertheless, the template parameter list synthesized for the
32037 declarator should be injected into the scope of 'A' as if the
32038 ill-formed template was specified explicitly. */
32041 {
32044 }
32045 }
32051 {
32052 /* Introduce a new template parameter list for implicit template
32053 parameters. */
32057 parser->implicit_template_scope
32064 }
32065 else
32066 {
32067 /* Synthesize implicit template parameters at the end of the explicit
32068 template parameter list. */
32075 parser->implicit_template_parms
32077 }
32078 }
32080 /* Synthesize a new template parameter and track the current template
32081 parameter chain with implicit_template_parms. */
32085 synth_id);
32086 tree new_parm
32088 input_location,
32095 parser->implicit_template_parms
32097 else
32102 /* If creating a fully implicit function template, start the new implicit
32103 template parameter list with this synthesized type, otherwise grow the
32104 current template parameter list. */
32107 {
32114 }
32115 else
32116 {
32121 }
32126 }
32128 /* Finish the declaration of a fully implicit function template. Such a
32129 template has no explicit template parameter list so has not been through the
32130 normal template head and tail processing. synthesize_implicit_template_parm
32131 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32132 provided if the declaration is a class member such that its template
32133 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32134 form is returned. Otherwise NULL_TREE is returned. */
32136 tree
32138 {
32143 {
32147 }
32157 }