| blob | 80d65a84af09292639260ae1e4df041934fde5be |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 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/>. */
22 #define INCLUDE_UNIQUE_PTR
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
116 };
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
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2268 /* Classes [gram.class] */
2270 static tree cp_parser_class_name
2272 static tree cp_parser_class_specifier
2274 static tree cp_parser_class_head
2276 static enum tag_types cp_parser_class_key
2278 static void cp_parser_type_parameter_key
2280 static void cp_parser_member_specification_opt
2282 static void cp_parser_member_declaration
2284 static tree cp_parser_pure_specifier
2286 static tree cp_parser_constant_initializer
2289 /* Derived classes [gram.class.derived] */
2291 static tree cp_parser_base_clause
2293 static tree cp_parser_base_specifier
2296 /* Special member functions [gram.special] */
2298 static tree cp_parser_conversion_function_id
2300 static tree cp_parser_conversion_type_id
2304 static void cp_parser_ctor_initializer_opt
2306 static void cp_parser_mem_initializer_list
2308 static tree cp_parser_mem_initializer
2310 static tree cp_parser_mem_initializer_id
2313 /* Overloading [gram.over] */
2315 static cp_expr cp_parser_operator_function_id
2317 static cp_expr cp_parser_operator
2320 /* Templates [gram.temp] */
2322 static void cp_parser_template_declaration
2324 static tree cp_parser_template_parameter_list
2326 static tree cp_parser_template_parameter
2328 static tree cp_parser_type_parameter
2330 static tree cp_parser_template_id
2332 static tree cp_parser_template_name
2334 static tree cp_parser_template_argument_list
2336 static tree cp_parser_template_argument
2338 static void cp_parser_explicit_instantiation
2340 static void cp_parser_explicit_specialization
2343 /* Exception handling [gram.exception] */
2345 static tree cp_parser_try_block
2347 static void cp_parser_function_try_block
2349 static void cp_parser_handler_seq
2351 static void cp_parser_handler
2353 static tree cp_parser_exception_declaration
2355 static tree cp_parser_throw_expression
2357 static tree cp_parser_exception_specification_opt
2359 static tree cp_parser_type_id_list
2362 /* GNU Extensions */
2364 static tree cp_parser_asm_specification_opt
2366 static tree cp_parser_asm_operand_list
2368 static tree cp_parser_asm_clobber_list
2370 static tree cp_parser_asm_label_list
2372 static bool cp_next_tokens_can_be_attribute_p
2374 static bool cp_next_tokens_can_be_gnu_attribute_p
2376 static bool cp_next_tokens_can_be_std_attribute_p
2378 static bool cp_nth_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_gnu_attribute_p
2382 static bool cp_nth_tokens_can_be_attribute_p
2384 static tree cp_parser_attributes_opt
2386 static tree cp_parser_gnu_attributes_opt
2388 static tree cp_parser_gnu_attribute_list
2390 static tree cp_parser_std_attribute
2392 static tree cp_parser_std_attribute_spec
2394 static tree cp_parser_std_attribute_spec_seq
2396 static bool cp_parser_extension_opt
2398 static void cp_parser_label_declaration
2401 /* Concept Extensions */
2403 static tree cp_parser_requires_clause
2405 static tree cp_parser_requires_clause_opt
2407 static tree cp_parser_requires_expression
2409 static tree cp_parser_requirement_parameter_list
2411 static tree cp_parser_requirement_body
2413 static tree cp_parser_requirement_list
2415 static tree cp_parser_requirement
2417 static tree cp_parser_simple_requirement
2419 static tree cp_parser_compound_requirement
2421 static tree cp_parser_type_requirement
2423 static tree cp_parser_nested_requirement
2426 /* Transactional Memory Extensions */
2428 static tree cp_parser_transaction
2430 static tree cp_parser_transaction_expression
2432 static void cp_parser_function_transaction
2434 static tree cp_parser_transaction_cancel
2438 pragma_external,
2439 pragma_member,
2440 pragma_objc_icode,
2441 pragma_stmt,
2442 pragma_compound
2443 };
2444 static bool cp_parser_pragma
2447 /* Objective-C++ Productions */
2449 static tree cp_parser_objc_message_receiver
2451 static tree cp_parser_objc_message_args
2453 static tree cp_parser_objc_message_expression
2455 static cp_expr cp_parser_objc_encode_expression
2457 static tree cp_parser_objc_defs_expression
2459 static tree cp_parser_objc_protocol_expression
2461 static tree cp_parser_objc_selector_expression
2463 static cp_expr cp_parser_objc_expression
2465 static bool cp_parser_objc_selector_p
2467 static tree cp_parser_objc_selector
2469 static tree cp_parser_objc_protocol_refs_opt
2471 static void cp_parser_objc_declaration
2473 static tree cp_parser_objc_statement
2475 static bool cp_parser_objc_valid_prefix_attributes
2477 static void cp_parser_objc_at_property_declaration
2479 static void cp_parser_objc_at_synthesize_declaration
2481 static void cp_parser_objc_at_dynamic_declaration
2483 static tree cp_parser_objc_struct_declaration
2486 /* Utility Routines */
2488 static cp_expr cp_parser_lookup_name
2490 static tree cp_parser_lookup_name_simple
2492 static tree cp_parser_maybe_treat_template_as_class
2494 static bool cp_parser_check_declarator_template_parameters
2496 static bool cp_parser_check_template_parameters
2498 static cp_expr cp_parser_simple_cast_expression
2500 static tree cp_parser_global_scope_opt
2502 static bool cp_parser_constructor_declarator_p
2504 static tree cp_parser_function_definition_from_specifiers_and_declarator
2506 static tree cp_parser_function_definition_after_declarator
2508 static bool cp_parser_template_declaration_after_export
2510 static void cp_parser_perform_template_parameter_access_checks
2512 static tree cp_parser_single_declaration
2514 static cp_expr cp_parser_functional_cast
2516 static tree cp_parser_save_member_function_body
2518 static tree cp_parser_save_nsdmi
2520 static tree cp_parser_enclosed_template_argument_list
2522 static void cp_parser_save_default_args
2524 static void cp_parser_late_parsing_for_member
2526 static tree cp_parser_late_parse_one_default_arg
2528 static void cp_parser_late_parsing_nsdmi
2530 static void cp_parser_late_parsing_default_args
2532 static tree cp_parser_sizeof_operand
2534 static cp_expr cp_parser_trait_expr
2536 static bool cp_parser_declares_only_class_p
2538 static void cp_parser_set_storage_class
2540 static void cp_parser_set_decl_spec_type
2542 static void set_and_check_decl_spec_loc
2545 static bool cp_parser_friend_p
2547 static void cp_parser_required_error
2553 static bool cp_parser_token_starts_function_definition_p
2555 static bool cp_parser_next_token_starts_class_definition_p
2557 static bool cp_parser_next_token_ends_template_argument_p
2559 static bool cp_parser_nth_token_starts_template_argument_list_p
2561 static enum tag_types cp_parser_token_is_class_key
2563 static enum tag_types cp_parser_token_is_type_parameter_key
2565 static void cp_parser_check_class_key
2567 static void cp_parser_check_access_in_redeclaration
2569 static bool cp_parser_optional_template_keyword
2571 static void cp_parser_pre_parsed_nested_name_specifier
2573 static bool cp_parser_cache_group
2575 static tree cp_parser_cache_defarg
2577 static void cp_parser_parse_tentatively
2579 static void cp_parser_commit_to_tentative_parse
2581 static void cp_parser_commit_to_topmost_tentative_parse
2583 static void cp_parser_abort_tentative_parse
2585 static bool cp_parser_parse_definitely
2589 static bool cp_parser_uncommitted_to_tentative_parse_p
2591 static void cp_parser_error
2593 static void cp_parser_name_lookup_error
2595 static bool cp_parser_simulate_error
2597 static bool cp_parser_check_type_definition
2599 static void cp_parser_check_for_definition_in_return_type
2601 static void cp_parser_check_for_invalid_template_id
2603 static bool cp_parser_non_integral_constant_expression
2605 static void cp_parser_diagnose_invalid_type_name
2607 static bool cp_parser_parse_and_diagnose_invalid_type_name
2609 static int cp_parser_skip_to_closing_parenthesis
2611 static void cp_parser_skip_to_end_of_statement
2613 static void cp_parser_consume_semicolon_at_end_of_statement
2615 static void cp_parser_skip_to_end_of_block_or_statement
2617 static bool cp_parser_skip_to_closing_brace
2619 static void cp_parser_skip_to_end_of_template_parameter_list
2621 static void cp_parser_skip_to_pragma_eol
2623 static bool cp_parser_error_occurred
2625 static bool cp_parser_allow_gnu_extensions_p
2627 static bool cp_parser_is_pure_string_literal
2629 static bool cp_parser_is_string_literal
2631 static bool cp_parser_is_keyword
2633 static tree cp_parser_make_typename_type
2637 static bool cp_parser_compound_literal_p
2639 static bool cp_parser_array_designator_p
2641 static bool cp_parser_init_statement_p
2643 static bool cp_parser_skip_to_closing_square_bracket
2646 /* Concept-related syntactic transformations */
2651 // -------------------------------------------------------------------------- //
2652 // Unevaluated Operand Guard
2653 //
2654 // Implementation of an RAII helper for unevaluated operand parsing.
2656 {
2659 }
2662 {
2665 }
2667 // -------------------------------------------------------------------------- //
2668 // Tentative Parsing
2670 /* Returns nonzero if we are parsing tentatively. */
2674 {
2676 }
2678 /* Returns nonzero if TOKEN is a string literal. */
2680 static bool
2682 {
2688 }
2690 /* Returns nonzero if TOKEN is a string literal
2691 of a user-defined string literal. */
2693 static bool
2695 {
2702 }
2704 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2706 static bool
2708 {
2710 }
2712 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2713 PRAGMA_NONE. */
2715 static enum pragma_kind
2717 {
2720 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2722 }
2724 /* Helper function for cp_parser_error.
2725 Having peeked a token of kind TOK1_KIND that might signify
2726 a conflict marker, peek successor tokens to determine
2727 if we actually do have a conflict marker.
2728 Specifically, we consider a run of 7 '<', '=' or '>' characters
2729 at the start of a line as a conflict marker.
2730 These come through the lexer as three pairs and a single,
2731 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2732 If it returns true, *OUT_LOC is written to with the location/range
2733 of the marker. */
2735 static bool
2738 {
2749 /* It must be at the start of the line. */
2754 /* We have a conflict marker. Construct a location of the form:
2755 <<<<<<<
2756 ^~~~~~~
2757 with start == caret, finishing at the end of the marker. */
2762 }
2764 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2765 RT_CLOSE_PAREN. */
2769 {
2771 {
2779 }
2780 }
2782 /* Attempt to convert TOKEN_DESC from a required_token to an
2783 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2785 static enum cpp_ttype
2787 {
2789 {
2810 /* Use CPP_EOF as a "no completions possible" code. */
2812 }
2813 }
2816 /* Subroutine of cp_parser_error and cp_parser_required_error.
2818 Issue a diagnostic of the form
2819 FILE:LINE: MESSAGE before TOKEN
2820 where TOKEN is the next token in the input stream. MESSAGE
2821 (specified by the caller) is usually of the form "expected
2822 OTHER-TOKEN".
2824 This bypasses the check for tentative passing, and potentially
2825 adds material needed by cp_parser_required_error.
2827 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2828 suggesting insertion of the missing token.
2830 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2831 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2832 location. */
2834 static void
2836 required_token missing_token_desc,
2837 location_t matching_location)
2838 {
2840 /* This diagnostic makes more sense if it is tagged to the line
2841 of the token we just peeked at. */
2845 {
2850 }
2852 /* If this is actually a conflict marker, report it as such. */
2856 {
2857 location_t loc;
2859 {
2862 }
2863 }
2870 {
2871 /* Potentially supply a fix-it hint, suggesting to add the
2872 missing token immediately after the *previous* token.
2873 This may move the primary location within richloc. */
2875 location_t prev_token_loc
2879 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2880 Attempt to consolidate diagnostics by printing it as a
2881 secondary range within the main diagnostic. */
2883 added_matching_location
2885 }
2887 /* Actually emit the error. */
2889 /* Because c_parser_error does not understand
2890 CPP_KEYWORD, keywords are treated like
2891 identifiers. */
2896 {
2897 /* If we weren't able to consolidate matching_location, then
2898 print it as a secondary diagnostic. */
2903 }
2904 }
2906 /* If not parsing tentatively, issue a diagnostic of the form
2907 FILE:LINE: MESSAGE before TOKEN
2908 where TOKEN is the next token in the input stream. MESSAGE
2909 (specified by the caller) is usually of the form "expected
2910 OTHER-TOKEN". */
2912 static void
2914 {
2917 }
2919 /* Issue an error about name-lookup failing. NAME is the
2920 IDENTIFIER_NODE DECL is the result of
2921 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2922 the thing that we hoped to find. */
2924 static void
2926 tree name,
2927 tree decl,
2928 name_lookup_error desired,
2929 location_t location)
2930 {
2931 /* If name lookup completely failed, tell the user that NAME was not
2932 declared. */
2934 {
2947 else
2949 }
2951 {
2953 {
2970 }
2971 }
2973 {
2975 {
2985 name);
2989 }
2990 }
2991 else
2992 {
2994 {
3007 }
3008 }
3009 }
3011 /* If we are parsing tentatively, remember that an error has occurred
3012 during this tentative parse. Returns true if the error was
3013 simulated; false if a message should be issued by the caller. */
3015 static bool
3017 {
3019 {
3022 }
3024 }
3026 /* This function is called when a type is defined. If type
3027 definitions are forbidden at this point, an error message is
3028 issued. */
3030 static bool
3032 {
3033 /* If types are forbidden here, issue a message. */
3035 {
3036 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3037 in the message need to be interpreted. */
3040 }
3042 }
3044 /* This function is called when the DECLARATOR is processed. The TYPE
3045 was a type defined in the decl-specifiers. If it is invalid to
3046 define a type in the decl-specifiers for DECLARATOR, an error is
3047 issued. TYPE_LOCATION is the location of TYPE and is used
3048 for error reporting. */
3050 static void
3053 {
3054 /* [dcl.fct] forbids type definitions in return types.
3055 Unfortunately, it's not easy to know whether or not we are
3056 processing a return type until after the fact. */
3064 {
3069 type);
3070 }
3071 }
3073 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3074 "<" in any valid C++ program. If the next token is indeed "<",
3075 issue a message warning the user about what appears to be an
3076 invalid attempt to form a template-id. LOCATION is the location
3077 of the type-specifier (TYPE) */
3079 static void
3081 tree type,
3083 location_t location)
3084 {
3088 {
3094 {
3097 else
3099 }
3100 else
3102 /* Remember the location of the invalid "<". */
3105 /* Consume the "<". */
3107 /* Parse the template arguments. */
3109 /* Permanently remove the invalid template arguments so that
3110 this error message is not issued again. */
3113 }
3114 }
3116 /* If parsing an integral constant-expression, issue an error message
3117 about the fact that THING appeared and return true. Otherwise,
3118 return false. In either case, set
3119 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3121 static bool
3123 non_integral_constant thing)
3124 {
3127 {
3129 {
3132 {
3135 "ISO C++ forbids using a floating-point literal "
3140 "enumeration type cannot appear in a "
3231 }
3235 }
3236 }
3238 }
3240 /* Emit a diagnostic for an invalid type name. This function commits
3241 to the current active tentative parse, if any. (Otherwise, the
3242 problematic construct might be encountered again later, resulting
3243 in duplicate error messages.) LOCATION is the location of ID. */
3245 static void
3247 location_t location)
3248 {
3251 /* Try to lookup the identifier. */
3258 /* If the lookup was ambiguous, an error will already have
3259 been issued. */
3261 /* If the lookup found a template-name, it means that the user forgot
3262 to specify an argument list. Emit a useful error message. */
3264 {
3267 decl);
3272 }
3276 /* Something like 'unsigned A a;' */
3279 {
3280 /* Issue an error message. */
3281 name_hint hint;
3285 {
3291 }
3292 else
3294 /* If we're in a template class, it's possible that the user was
3295 referring to a type from a base class. For example:
3297 template <typename T> struct A { typedef T X; };
3298 template <typename T> struct B : public A<T> { X x; };
3300 The user should have said "typename A<T>::X". */
3316 {
3317 tree b;
3320 b;
3322 {
3326 {
3327 tree field;
3328 /* Go from a particular instantiation of the
3329 template (which will have an empty TYPE_FIELDs),
3330 to the main version. */
3333 field;
3337 {
3342 }
3345 }
3346 }
3347 }
3348 }
3349 /* Here we diagnose qualified-ids where the scope is actually correct,
3350 but the identifier does not resolve to a valid type name. */
3352 {
3354 {
3363 else
3372 }
3375 {
3376 /* A<T>::A<T>() */
3382 }
3385 {
3388 "need %<typename%> before %<%T::%D::%E%> because "
3392 id,
3395 else
3399 }
3401 {
3413 else
3419 }
3420 else
3422 }
3423 }
3425 /* Check for a common situation where a type-name should be present,
3426 but is not, and issue a sensible error message. Returns true if an
3427 invalid type-name was detected.
3429 The situation handled by this function are variable declarations of the
3430 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3431 Usually, `ID' should name a type, but if we got here it means that it
3432 does not. We try to emit the best possible error message depending on
3433 how exactly the id-expression looks like. */
3435 static bool
3437 {
3438 tree id;
3441 /* Avoid duplicate error about ambiguous lookup. */
3443 {
3447 }
3456 /* If the next token is a (, this is a function with no explicit return
3457 type, i.e. constructor, destructor or conversion op. */
3460 {
3463 }
3467 /* Emit a diagnostic for the invalid type. */
3469 out:
3470 /* If we aren't in the middle of a declarator (i.e. in a
3471 parameter-declaration-clause), skip to the end of the declaration;
3472 there's no point in trying to process it. */
3476 }
3478 /* Consume tokens up to, and including, the next non-nested closing `)'.
3479 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3480 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3481 found an unnested token of that type. */
3483 static int
3486 cpp_ttype or_ttype,
3488 {
3498 {
3501 /* Have we found what we're looking for before the closing paren? */
3507 {
3510 /* If we've run out of tokens, then there is no closing `)'. */
3513 /* This is good for lambda expression capture-lists. */
3523 /* This matches the processing in skip_to_end_of_statement. */
3543 {
3547 }
3552 }
3554 /* Consume the token. */
3556 }
3557 }
3559 /* Consume tokens up to, and including, the next non-nested closing `)'.
3560 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3561 are doing error recovery. Returns -1 if OR_COMMA is true and we
3562 found an unnested token of that type. */
3564 static int
3569 {
3573 }
3575 /* Consume tokens until we reach the end of the current statement.
3576 Normally, that will be just before consuming a `;'. However, if a
3577 non-nested `}' comes first, then we stop before consuming that. */
3579 static void
3581 {
3584 /* Unwind generic function template scope if necessary. */
3589 {
3593 {
3596 /* If we've run out of tokens, stop. */
3600 /* If the next token is a `;', we have reached the end of the
3601 statement. */
3607 /* If this is a non-nested '}', stop before consuming it.
3608 That way, when confronted with something like:
3610 { 3 + }
3612 we stop before consuming the closing '}', even though we
3613 have not yet reached a `;'. */
3617 /* If it is the closing '}' for a block that we have
3618 scanned, stop -- but only after consuming the token.
3619 That way given:
3621 void f g () { ... }
3622 typedef int I;
3624 we will stop after the body of the erroneously declared
3625 function, but before consuming the following `typedef'
3626 declaration. */
3628 {
3631 }
3640 }
3642 /* Consume the token. */
3644 }
3645 }
3647 /* This function is called at the end of a statement or declaration.
3648 If the next token is a semicolon, it is consumed; otherwise, error
3649 recovery is attempted. */
3651 static void
3653 {
3654 /* Look for the trailing `;'. */
3656 {
3657 /* If there is additional (erroneous) input, skip to the end of
3658 the statement. */
3660 /* If the next token is now a `;', consume it. */
3663 }
3664 }
3666 /* Skip tokens until we have consumed an entire block, or until we
3667 have consumed a non-nested `;'. */
3669 static void
3671 {
3674 /* Unwind generic function template scope if necessary. */
3679 {
3683 {
3686 /* If we've run out of tokens, stop. */
3690 /* Stop if this is an unnested ';'. */
3696 /* Stop if this is an unnested '}', or closes the outermost
3697 nesting level. */
3698 nesting_depth--;
3706 /* Nest. */
3707 nesting_depth++;
3712 }
3714 /* Consume the token. */
3716 }
3717 }
3719 /* Skip tokens until a non-nested closing curly brace is the next
3720 token, or there are no more tokens. Return true in the first case,
3721 false otherwise. */
3723 static bool
3725 {
3729 {
3733 {
3736 /* If we've run out of tokens, stop. */
3740 /* If the next token is a non-nested `}', then we have reached
3741 the end of the current block. */
3747 /* If it the next token is a `{', then we are entering a new
3748 block. Consume the entire block. */
3754 }
3756 /* Consume the token. */
3758 }
3759 }
3761 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3762 parameter is the PRAGMA token, allowing us to purge the entire pragma
3763 sequence. */
3765 static void
3767 {
3772 do
3776 /* Ensure that the pragma is not parsed again. */
3778 }
3780 /* Require pragma end of line, resyncing with it as necessary. The
3781 arguments are as for cp_parser_skip_to_pragma_eol. */
3783 static void
3785 {
3789 }
3791 /* This is a simple wrapper around make_typename_type. When the id is
3792 an unresolved identifier node, we can provide a superior diagnostic
3793 using cp_parser_diagnose_invalid_type_name. */
3795 static tree
3797 location_t id_location)
3798 {
3799 tree result;
3801 {
3807 }
3809 }
3811 /* This is a wrapper around the
3812 make_{pointer,ptrmem,reference}_declarator functions that decides
3813 which one to call based on the CODE and CLASS_TYPE arguments. The
3814 CODE argument should be one of the values returned by
3815 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3816 appertain to the pointer or reference. */
3820 cp_cv_quals cv_qualifiers,
3822 tree attributes)
3823 {
3830 else
3840 }
3842 /* Create a new C++ parser. */
3846 {
3851 /* cp_lexer_new_main is called before doing GC allocation because
3852 cp_lexer_new_main might load a PCH file. */
3855 /* Initialize the binops_by_token so that we can get the tree
3856 directly from the token. */
3864 /* For now, we always accept GNU extensions. */
3867 /* The `>' token is a greater-than operator, not the end of a
3868 template-id. */
3873 /* We are not parsing a constant-expression. */
3878 /* Local variable names are not forbidden. */
3881 /* We are not processing an `extern "C"' declaration. */
3884 /* We are not processing a declarator. */
3887 /* We are not processing a template-argument-list. */
3890 /* We are not in an iteration statement. */
3893 /* We are not in a switch statement. */
3896 /* We are not parsing a type-id inside an expression. */
3899 /* Declarations aren't implicitly extern "C". */
3902 /* String literals should be translated to the execution character set. */
3905 /* We are not parsing a function body. */
3908 /* We can correct until told otherwise. */
3911 /* The unparsed function queue is empty. */
3914 /* There are no classes being defined. */
3917 /* No template parameters apply. */
3920 /* Special parsing data structures. */
3924 /* Not declaring an implicit function template. */
3930 /* Allow constrained-type-specifiers. */
3933 /* We haven't yet seen an 'extern "C"'. */
3937 }
3939 /* Create a cp_lexer structure which will emit the tokens in CACHE
3940 and push it onto the parser's lexer stack. This is used for delayed
3941 parsing of in-class method bodies and default arguments, and should
3942 not be confused with tentative parsing. */
3943 static void
3945 {
3950 /* Move the current source position to that of the first token in the
3951 new lexer. */
3953 }
3955 /* Pop the top lexer off the parser stack. This is never used for the
3956 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3957 static void
3959 {
3964 /* Put the current source position back where it was before this
3965 lexer was pushed. */
3967 }
3969 /* Lexical conventions [gram.lex] */
3971 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3972 identifier. */
3974 static cp_expr
3976 {
3979 /* Look for the identifier. */
3981 /* Return the value. */
3984 else
3986 }
3988 /* Parse a sequence of adjacent string constants. Returns a
3989 TREE_STRING representing the combined, nul-terminated string
3990 constant. If TRANSLATE is true, translate the string to the
3991 execution character set. If WIDE_OK is true, a wide string is
3992 invalid here.
3994 C++98 [lex.string] says that if a narrow string literal token is
3995 adjacent to a wide string literal token, the behavior is undefined.
3996 However, C99 6.4.5p4 says that this results in a wide string literal.
3997 We follow C99 here, for consistency with the C front end.
3999 This code is largely lifted from lex_string() in c-lex.c.
4001 FUTURE: ObjC++ will need to handle @-strings here. */
4002 static cp_expr
4005 {
4006 tree value;
4013 tree string_tree;
4019 {
4022 }
4027 {
4031 }
4032 else
4033 {
4036 }
4039 /* Try to avoid the overhead of creating and destroying an obstack
4040 for the common case of just one string. */
4043 {
4051 {
4055 }
4056 else
4060 }
4061 else
4062 {
4067 do
4068 {
4070 count++;
4075 {
4078 {
4081 }
4084 {
4089 }
4091 }
4092 else
4096 {
4100 {
4104 "unsupported non-standard concatenation "
4106 }
4107 }
4115 {
4119 }
4120 else
4121 {
4125 }
4126 }
4129 /* A string literal built by concatenation has its caret=start at
4130 the start of the initial string, and its finish at the finish of
4131 the final string literal. */
4135 }
4138 {
4141 }
4145 {
4150 {
4165 }
4170 {
4175 else
4177 }
4178 }
4179 else
4180 /* cpp_interpret_string has issued an error. */
4187 }
4189 /* Look up a literal operator with the name and the exact arguments. */
4191 static tree
4193 {
4194 tree decl;
4200 {
4206 {
4209 {
4219 }
4222 /* May be this should be sufficient_parms_p instead,
4223 depending on how exactly should user-defined literals
4224 work in presence of default arguments on the literal
4225 operator parameters. */
4228 }
4229 }
4232 }
4234 /* Parse a user-defined char constant. Returns a call to a user-defined
4235 literal operator taking the character as an argument. */
4237 static cp_expr
4239 {
4247 /* Build up a call to the user-defined operator */
4248 /* Lookup the name we got back from the id-expression. */
4253 {
4258 }
4262 }
4264 /* A subroutine of cp_parser_userdef_numeric_literal to
4265 create a char... template parameter pack from a string node. */
4267 static tree
4269 {
4270 tree charvec;
4276 /* Fill in CHARVEC with all of the parameters. */
4281 /* Build the argument packs. */
4287 }
4289 /* A subroutine of cp_parser_userdef_numeric_literal to
4290 create a char... template parameter pack from a string node. */
4292 static tree
4294 {
4295 tree charvec;
4306 /* First template parm is character type. */
4309 /* Fill in CHARVEC with all of the parameters. */
4316 /* Build the argument packs. */
4322 }
4324 /* Parse a user-defined numeric constant. returns a call to a user-defined
4325 literal operator. */
4327 static cp_expr
4329 {
4340 /* Look for a literal operator taking the exact type of numeric argument
4341 as the literal value. */
4346 {
4348 tf_warning_or_error);
4351 {
4354 long_long_unsigned_type_node);
4355 }
4356 else
4357 {
4361 long_double_type_node);
4365 }
4369 }
4372 /* If the numeric argument didn't work, look for a raw literal
4373 operator taking a const char* argument consisting of the number
4374 in string format. */
4379 {
4381 tf_warning_or_error);
4384 }
4387 /* If the raw literal didn't work, look for a non-type template
4388 function with parameter pack char.... Call the function with
4389 template parameter characters representing the number. */
4393 {
4397 tf_warning_or_error);
4400 }
4404 /* In C++14 the standard library defines complex number suffixes that
4405 conflict with GNU extensions. Prefer them if <complex> is #included. */
4415 {
4420 {
4421 /* No <complex>, so pedwarn and use GNU semantics. */
4424 }
4425 }
4427 bool complained
4434 {
4436 "(from <complex>) to enable the C++14 user-defined literal "
4441 }
4448 else
4449 {
4450 /* Use the built-in semantics. */
4451 tree type;
4453 {
4456 else
4458 }
4467 }
4470 /* Avoid repeated diagnostics. */
4473 }
4475 /* Parse a user-defined string constant. Returns a call to a user-defined
4476 literal operator taking a character pointer and the length of the string
4477 as arguments. */
4479 static tree
4481 {
4490 /* Build up a call to the user-defined operator. */
4491 /* Lookup the name we got back from the id-expression. */
4498 {
4500 tf_warning_or_error);
4503 }
4506 /* Look for a template function with typename parameter CharT
4507 and parameter pack CharT... Call the function with
4508 template parameter characters representing the string. */
4512 {
4516 tf_warning_or_error);
4519 }
4525 }
4528 /* Basic concepts [gram.basic] */
4530 /* Parse a translation-unit.
4532 translation-unit:
4533 declaration-seq [opt]
4535 Returns TRUE if all went well. */
4537 static bool
4539 {
4540 /* The address of the first non-permanent object on the declarator
4541 obstack. */
4546 /* Create the declarator obstack, if necessary. */
4548 {
4550 /* Create the error declarator. */
4552 /* Create the empty parameter list. */
4554 UNKNOWN_LOCATION);
4555 /* Remember where the base of the declarator obstack lies. */
4557 }
4561 /* If there are no tokens left then all went well. */
4563 {
4564 /* Get rid of the token array; we don't need it any more. */
4568 /* This file might have been a context that's implicitly extern
4569 "C". If so, pop the lang context. (Only relevant for PCH.) */
4571 {
4574 }
4576 /* Finish up. */
4580 }
4581 else
4582 {
4585 }
4587 /* Make sure the declarator obstack was fully cleaned up. */
4591 /* All went well. */
4593 }
4595 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4596 decltype context. */
4600 {
4605 }
4607 /* We're about to parse a collection of statements. If we're currently
4608 parsing tentatively, set up a firewall so that any nested
4609 cp_parser_commit_to_tentative_parse won't affect the current context. */
4611 static cp_token_position
4613 {
4620 }
4622 /* We've finished parsing the collection of statements. Wrap up the
4623 firewall and replace the relevant tokens with the parsed form. */
4625 static void
4627 tree expr)
4628 {
4632 /* Finish the firewall level. */
4634 /* And remember the result of the parse for when we try again. */
4640 }
4642 /* Like the above functions, but let the user modify the tokens. Used by
4643 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4644 later parses, so it makes sense to localize the effects of
4645 cp_parser_commit_to_tentative_parse. */
4647 struct tentative_firewall
4648 {
4653 {
4654 /* If we're currently parsing tentatively, start a committed level as a
4655 firewall and then an inner tentative parse. */
4657 {
4661 }
4662 }
4665 {
4667 {
4668 /* Finish the inner tentative parse and the firewall, propagating any
4669 uncommitted error state to the outer tentative parse. */
4675 }
4676 }
4677 };
4679 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4680 This class is for tracking such a matching pair of symbols.
4681 In particular, it tracks the location of the first token,
4682 so that if the second token is missing, we can highlight the
4683 location of the first token when notifying the user about the
4684 problem. */
4687 class token_pair
4688 {
4690 /* token_pair's ctor. */
4693 /* If the next token is the opening symbol for this pair, consume it and
4694 return true.
4695 Otherwise, issue an error and return false.
4696 In either case, record the location of the opening token. */
4699 {
4703 }
4705 /* Consume the next token from PARSER, recording its location as
4706 that of the opening token within the pair. */
4709 {
4714 }
4716 /* If the next token is the closing symbol for this pair, consume it
4717 and return it.
4718 Otherwise, issue an error, highlighting the location of the
4719 corresponding opening token, and return NULL. */
4722 {
4725 m_open_loc);
4726 }
4729 location_t m_open_loc;
4730 };
4732 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4734 struct matching_paren_traits
4735 {
4740 };
4742 /* "matching_parens" is a token_pair<T> class for tracking matching
4743 pairs of parentheses. */
4747 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4749 struct matching_brace_traits
4750 {
4755 };
4757 /* "matching_braces" is a token_pair<T> class for tracking matching
4758 pairs of braces. */
4763 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4764 enclosing parentheses. */
4766 static cp_expr
4768 {
4771 /* Consume the '('. */
4773 matching_parens parens;
4775 /* Start the statement-expression. */
4777 /* Parse the compound-statement. */
4779 /* Finish up. */
4781 /* Consume the ')'. */
4789 }
4791 /* Expressions [gram.expr] */
4793 /* Parse a fold-operator.
4795 fold-operator:
4796 - * / % ^ & | = < > << >>
4797 = -= *= /= %= ^= &= |= <<= >>=
4798 == != <= >= && || , .* ->*
4800 This returns the tree code corresponding to the matched operator
4801 as an int. When the current token matches a compound assignment
4802 opertor, the resulting tree code is the negative value of the
4803 non-assignment operator. */
4805 static int
4807 {
4809 {
4849 }
4850 }
4852 /* Returns true if CODE indicates a binary expression, which is not allowed in
4853 the LHS of a fold-expression. More codes will need to be added to use this
4854 function in other contexts. */
4856 static bool
4858 {
4860 {
4893 }
4894 }
4896 /* If the next token is a suitable fold operator, consume it and return as
4897 the function above. */
4899 static int
4901 {
4907 }
4909 /* Parse a fold-expression.
4911 fold-expression:
4912 ( ... folding-operator cast-expression)
4913 ( cast-expression folding-operator ... )
4914 ( cast-expression folding operator ... folding-operator cast-expression)
4916 Note that the '(' and ')' are matched in primary expression. */
4918 static cp_expr
4920 {
4921 cp_id_kind pidk;
4923 // Left fold.
4925 {
4929 {
4932 }
4939 }
4944 {
4947 }
4950 {
4953 }
4956 /* The operands of a fold-expression are cast-expressions, so binary or
4957 conditional expressions are not allowed. We check this here to avoid
4958 tentative parsing. */
4968 // Right fold.
4973 {
4976 }
4979 // Binary left or right fold.
4984 }
4986 /* Parse a primary-expression.
4988 primary-expression:
4989 literal
4990 this
4991 ( expression )
4992 id-expression
4993 lambda-expression (C++11)
4995 GNU Extensions:
4997 primary-expression:
4998 ( compound-statement )
4999 __builtin_va_arg ( assignment-expression , type-id )
5000 __builtin_offsetof ( type-id , offsetof-expression )
5002 C++ Extensions:
5003 __has_nothrow_assign ( type-id )
5004 __has_nothrow_constructor ( type-id )
5005 __has_nothrow_copy ( type-id )
5006 __has_trivial_assign ( type-id )
5007 __has_trivial_constructor ( type-id )
5008 __has_trivial_copy ( type-id )
5009 __has_trivial_destructor ( type-id )
5010 __has_virtual_destructor ( type-id )
5011 __is_abstract ( type-id )
5012 __is_base_of ( type-id , type-id )
5013 __is_class ( type-id )
5014 __is_empty ( type-id )
5015 __is_enum ( type-id )
5016 __is_final ( type-id )
5017 __is_literal_type ( type-id )
5018 __is_pod ( type-id )
5019 __is_polymorphic ( type-id )
5020 __is_std_layout ( type-id )
5021 __is_trivial ( type-id )
5022 __is_union ( type-id )
5024 Objective-C++ Extension:
5026 primary-expression:
5027 objc-expression
5029 literal:
5030 __null
5032 ADDRESS_P is true iff this expression was immediately preceded by
5033 "&" and therefore might denote a pointer-to-member. CAST_P is true
5034 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5035 true iff this expression is a template argument.
5037 Returns a representation of the expression. Upon return, *IDK
5038 indicates what kind of id-expression (if any) was present. */
5040 static cp_expr
5047 {
5050 /* Assume the primary expression is not an id-expression. */
5053 /* Peek at the next token. */
5056 {
5057 /* literal:
5058 integer-literal
5059 character-literal
5060 floating-literal
5061 string-literal
5062 boolean-literal
5063 pointer-literal
5064 user-defined-literal */
5076 {
5080 }
5081 /* Floating-point literals are only allowed in an integral
5082 constant expression if they are cast to an integral or
5083 enumeration type. */
5087 {
5088 /* CAST_P will be set even in invalid code like "int(2.7 +
5089 ...)". Therefore, we have to check that the next token
5090 is sure to end the cast. */
5092 {
5097 enumerator-definition. */
5099 /* The curly brace at the end of an enum-specifier. */
5101 /* The end of a statement. */
5103 /* The end of the cast-expression. */
5105 /* The end of an array bound. */
5107 /* The closing ">" in a template-argument-list. */
5110 /* C++0x only: A ">>" treated like two ">" tokens,
5111 in a template-argument-list. */
5116 }
5118 /* If we are within a cast, then the constraint that the
5119 cast is to an integral or enumeration type will be
5120 checked at that point. If we are not within a cast, then
5121 this code is invalid. */
5124 }
5144 /* ??? Should wide strings be allowed when parser->translate_strings_p
5145 is false (i.e. in attributes)? If not, we can kill the third
5146 argument to cp_parser_string_literal. */
5152 /* If we see `( { ' then we are looking at the beginning of
5153 a GNU statement-expression. */
5156 {
5157 /* Statement-expressions are not allowed by the standard. */
5161 /* And they're not allowed outside of a function-body; you
5162 cannot, for example, write:
5164 int i = ({ int j = 3; j + 1; });
5166 at class or namespace scope. */
5169 {
5171 "statement-expressions are not allowed outside "
5177 }
5178 else
5180 }
5181 /* Otherwise it's a normal parenthesized expression. */
5182 {
5183 cp_expr expr;
5188 /* Consume the `('. */
5189 matching_parens parens;
5191 /* Within a parenthesized expression, a `>' token is always
5192 the greater-than operator. */
5193 saved_greater_than_is_operator_p
5198 /* Left fold expression. */
5200 else
5201 /* Parse the parenthesized expression. */
5206 {
5213 }
5214 else
5215 /* Let the front end know that this expression was
5216 enclosed in parentheses. This matters in case, for
5217 example, the expression is of the form `A::B', since
5218 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5219 not. */
5222 /* DR 705: Wrapping an unqualified name in parentheses
5223 suppresses arg-dependent lookup. We want to pass back
5224 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5225 (c++/37862), but none of the others. */
5229 /* The `>' token might be the end of a template-id or
5230 template-parameter-list now. */
5231 parser->greater_than_is_operator_p
5234 /* Consume the `)'. */
5243 }
5246 {
5248 {
5249 /* We might have an Objective-C++ message. */
5252 /* If that works out, we're done ... */
5255 /* ... else, fall though to see if it's a lambda. */
5256 }
5258 /* Don't warn about a failed tentative parse. */
5263 }
5267 /* We have an Objective-C++ string literal. */
5274 {
5275 /* These two are the boolean literals. */
5283 /* The `__null' literal. */
5288 /* The `nullptr' literal. */
5293 /* Recognize the `this' keyword. */
5297 {
5301 }
5302 /* Pointers cannot appear in constant-expressions. */
5307 /* The `operator' keyword can be the beginning of an
5308 id-expression. */
5315 {
5316 non_integral_constant name;
5318 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5319 __func__ are the names of variables -- but they are
5320 treated specially. Therefore, they are handled here,
5321 rather than relying on the generic id-expression logic
5322 below. Grammatically, these names are id-expressions.
5324 Consume the token. */
5328 {
5340 }
5345 /* Look up the name. */
5347 }
5350 {
5351 tree expression;
5352 tree type;
5353 source_location type_location;
5354 location_t start_loc
5356 /* The `__builtin_va_arg' construct is used to handle
5357 `va_arg'. Consume the `__builtin_va_arg' token. */
5359 /* Look for the opening `('. */
5360 matching_parens parens;
5362 /* Now, parse the assignment-expression. */
5364 /* Look for the `,'. */
5367 /* Parse the type-id. */
5368 {
5371 }
5372 /* Look for the closing `)'. */
5373 location_t finish_loc
5376 /* Using `va_arg' in a constant-expression is not
5377 allowed. */
5379 NIC_VA_ARG))
5381 /* Construct a location of the form:
5382 __builtin_va_arg (v, int)
5383 ~~~~~~~~~~~~~~~~~~~~~^~~~
5384 with the caret at the type, ranging from the start of the
5385 "__builtin_va_arg" token to the close paren. */
5386 location_t combined_loc
5389 }
5424 // C++ concepts
5428 /* Objective-C++ expressions. */
5438 {
5443 }
5444 /* FALLTHRU */
5448 }
5450 /* An id-expression can start with either an identifier, a
5451 `::' as the beginning of a qualified-id, or the "operator"
5452 keyword. */
5457 {
5458 id_expression:
5459 cp_expr id_expression;
5460 cp_expr decl;
5466 /* Parse the id-expression. */
5467 id_expression
5484 /* If we have a template-id, then no further lookup is
5485 required. If the template-id was for a template-class, we
5486 will sometimes have a TYPE_DECL at this point. */
5490 /* Look up the name. */
5491 else
5492 {
5493 tree ambiguous_decls;
5495 /* If we already know that this lookup is ambiguous, then
5496 we've already issued an error message; there's no reason
5497 to check again. */
5500 {
5503 }
5506 none_type,
5507 template_p,
5512 /* If the lookup was ambiguous, an error will already have
5513 been issued. */
5517 /* In Objective-C++, we may have an Objective-C 2.0
5518 dot-syntax for classes here. */
5523 {
5524 tree component;
5531 component);
5532 /* Build a location of the form:
5533 expr.component
5534 ~~~~~^~~~~~~~~
5535 with caret at the start of the component name (at
5536 input_location), ranging from the start of the id_expression
5537 to the end of the component name. */
5538 location_t combined_loc
5543 }
5545 /* In Objective-C++, an instance variable (ivar) may be preferred
5546 to whatever cp_parser_lookup_name() found.
5547 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5548 rest of c-family, we have to do a little extra work to preserve
5549 any location information in cp_expr "decl". Given that
5550 objc_lookup_ivar is implemented in "c-family" and "objc", we
5551 have a trip through the pure "tree" type, rather than cp_expr.
5552 Naively copying it back to "decl" would implicitly give the
5553 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5554 store an EXPR_LOCATION. Hence we only update "decl" (and
5555 hence its location_t) if we get back a different tree node. */
5557 id_expression);
5561 /* If name lookup gives us a SCOPE_REF, then the
5562 qualifying scope was dependent. */
5564 {
5565 /* At this point, we do not know if DECL is a valid
5566 integral constant expression. We assume that it is
5567 in fact such an expression, so that code like:
5569 template <int N> struct A {
5570 int a[B<N>::i];
5571 };
5573 is accepted. At template-instantiation time, we
5574 will check that B<N>::i is actually a constant. */
5576 }
5577 /* Check to see if DECL is a local variable in a context
5578 where that is forbidden. */
5581 {
5582 /* It might be that we only found DECL because we are
5583 trying to be generous with pre-ISO scoping rules.
5584 For example, consider:
5586 int i;
5587 void g() {
5588 for (int i = 0; i < 10; ++i) {}
5589 extern void f(int j = i);
5590 }
5592 Here, name look up will originally find the out
5593 of scope `i'. We need to issue a warning message,
5594 but then use the global `i'. */
5597 {
5602 }
5603 }
5604 }
5606 decl = (finish_id_expression
5608 idk,
5613 template_arg_p,
5620 }
5622 /* Anything else is an error. */
5626 }
5627 }
5635 {
5638 }
5640 /* Parse an id-expression.
5642 id-expression:
5643 unqualified-id
5644 qualified-id
5646 qualified-id:
5647 :: [opt] nested-name-specifier template [opt] unqualified-id
5648 :: identifier
5649 :: operator-function-id
5650 :: template-id
5652 Return a representation of the unqualified portion of the
5653 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5654 a `::' or nested-name-specifier.
5656 Often, if the id-expression was a qualified-id, the caller will
5657 want to make a SCOPE_REF to represent the qualified-id. This
5658 function does not do this in order to avoid wastefully creating
5659 SCOPE_REFs when they are not required.
5661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5662 `template' keyword.
5664 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5665 uninstantiated templates.
5667 If *TEMPLATE_P is non-NULL, it is set to true iff the
5668 `template' keyword is used to explicitly indicate that the entity
5669 named is a template.
5671 If DECLARATOR_P is true, the id-expression is appearing as part of
5672 a declarator, rather than as part of an expression. */
5674 static cp_expr
5681 {
5685 /* Assume the `template' keyword was not used. */
5689 /* Look for the optional `::' operator. */
5690 global_scope_p
5691 = (!template_keyword_p
5696 /* Look for the optional nested-name-specifier. */
5697 nested_name_specifier_p
5700 check_dependency_p,
5702 declarator_p,
5703 template_keyword_p)
5706 /* If there is a nested-name-specifier, then we are looking at
5707 the first qualified-id production. */
5709 {
5710 tree saved_scope;
5711 tree saved_object_scope;
5712 tree saved_qualifying_scope;
5713 cp_expr unqualified_id;
5716 /* See if the next token is the `template' keyword. */
5720 /* Name lookup we do during the processing of the
5721 unqualified-id might obliterate SCOPE. */
5725 /* Process the final unqualified-id. */
5727 check_dependency_p,
5728 declarator_p,
5730 /* Restore the SAVED_SCOPE for our caller. */
5736 }
5737 /* Otherwise, if we are in global scope, then we are looking at one
5738 of the other qualified-id productions. */
5740 {
5742 tree id;
5744 /* Peek at the next token. */
5747 /* If it's an identifier, and the next token is not a "<", then
5748 we can avoid the template-id case. This is an optimization
5749 for this common case. */
5751 && !cp_parser_nth_token_starts_template_argument_list_p
5756 /* Try a template-id. */
5760 none_type,
5761 declarator_p);
5762 /* If that worked, we're done. */
5766 /* Peek at the next token. (Changes in the token buffer may
5767 have invalidated the pointer obtained above.) */
5771 {
5778 /* Fall through. */
5783 }
5784 }
5785 else
5788 declarator_p,
5789 optional_p);
5790 }
5792 /* Parse an unqualified-id.
5794 unqualified-id:
5795 identifier
5796 operator-function-id
5797 conversion-function-id
5798 ~ class-name
5799 template-id
5801 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5802 keyword, in a construct like `A::template ...'.
5804 Returns a representation of unqualified-id. For the `identifier'
5805 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5806 production a BIT_NOT_EXPR is returned; the operand of the
5807 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5808 other productions, see the documentation accompanying the
5809 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5810 names are looked up in uninstantiated templates. If DECLARATOR_P
5811 is true, the unqualified-id is appearing as part of a declarator,
5812 rather than as part of an expression. */
5814 static cp_expr
5820 {
5823 /* Peek at the next token. */
5827 {
5829 {
5830 tree id;
5832 /* We don't know yet whether or not this will be a
5833 template-id. */
5835 /* Try a template-id. */
5837 check_dependency_p,
5838 none_type,
5839 declarator_p);
5840 /* If it worked, we're done. */
5843 /* Otherwise, it's an ordinary identifier. */
5845 }
5849 check_dependency_p,
5850 none_type,
5851 declarator_p);
5854 {
5855 tree type_decl;
5856 tree qualifying_scope;
5857 tree object_scope;
5858 tree scope;
5861 /* Consume the `~' token. */
5863 /* Parse the class-name. The standard, as written, seems to
5864 say that:
5866 template <typename T> struct S { ~S (); };
5867 template <typename T> S<T>::~S() {}
5869 is invalid, since `~' must be followed by a class-name, but
5870 `S<T>' is dependent, and so not known to be a class.
5871 That's not right; we need to look in uninstantiated
5872 templates. A further complication arises from:
5874 template <typename T> void f(T t) {
5875 t.T::~T();
5876 }
5878 Here, it is not possible to look up `T' in the scope of `T'
5879 itself. We must look in both the current scope, and the
5880 scope of the containing complete expression.
5882 Yet another issue is:
5884 struct S {
5885 int S;
5886 ~S();
5887 };
5889 S::~S() {}
5891 The standard does not seem to say that the `S' in `~S'
5892 should refer to the type `S' and not the data member
5893 `S::S'. */
5895 /* DR 244 says that we look up the name after the "~" in the
5896 same scope as we looked up the qualifying name. That idea
5897 isn't fully worked out; it's more complicated than that. */
5902 /* Check for invalid scopes. */
5904 {
5908 }
5910 {
5914 scope);
5919 }
5922 /* If the name is of the form "X::~X" it's OK even if X is a
5923 typedef. */
5932 {
5935 }
5937 /* ~auto means the destructor of whatever the object is. */
5939 {
5942 "%<~auto%> only available with "
5946 }
5948 /* If there was an explicit qualification (S::~T), first look
5949 in the scope given by the qualification (i.e., S).
5951 Note: in the calls to cp_parser_class_name below we pass
5952 typename_type so that lookup finds the injected-class-name
5953 rather than the constructor. */
5957 {
5962 typename_type,
5965 declarator_p);
5968 }
5969 /* In "N::S::~S", look in "N" as well. */
5971 {
5976 type_decl
5980 typename_type,
5983 declarator_p);
5986 }
5987 /* In "p->S::~T", look in the scope given by "*p" as well. */
5989 {
5994 type_decl
5998 typename_type,
6001 declarator_p);
6004 }
6005 /* Look in the surrounding context. */
6007 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 {
6024 /* We couldn't find a type with this name. If we're parsing
6025 tentatively, fail and try something else. */
6027 {
6030 }
6031 /* Otherwise, accept it and check for a match at instantiation
6032 time. */
6037 }
6038 }
6039 /* If an error occurred, assume that the name of the
6040 destructor is the same as the name of the qualifying
6041 class. That allows us to keep parsing after running
6042 into ill-formed destructor names. */
6048 /* Check that destructor name and scope match. */
6050 {
6057 }
6059 /* [class.dtor]
6061 A typedef-name that names a class shall not be used as the
6062 identifier in the declarator for a destructor declaration. */
6069 type_decl);
6072 }
6076 {
6077 cp_expr id;
6079 /* This could be a template-id, so we try that first. */
6081 /* Try a template-id. */
6084 none_type,
6085 declarator_p);
6086 /* If that worked, we're done. */
6089 /* We still don't know whether we're looking at an
6090 operator-function-id or a conversion-function-id. */
6092 /* Try an operator-function-id. */
6094 /* If that didn't work, try a conversion-function-id. */
6098 {
6099 /* 17.6.3.3.5 */
6104 "literal operator suffixes not preceded by %<_%>"
6106 }
6109 }
6110 /* Fall through. */
6117 }
6118 }
6120 /* Parse an (optional) nested-name-specifier.
6122 nested-name-specifier: [C++98]
6123 class-or-namespace-name :: nested-name-specifier [opt]
6124 class-or-namespace-name :: template nested-name-specifier [opt]
6126 nested-name-specifier: [C++0x]
6127 type-name ::
6128 namespace-name ::
6129 nested-name-specifier identifier ::
6130 nested-name-specifier template [opt] simple-template-id ::
6132 PARSER->SCOPE should be set appropriately before this function is
6133 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6134 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6135 in name lookups.
6137 Sets PARSER->SCOPE to the class (TYPE) or namespace
6138 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6139 it unchanged if there is no nested-name-specifier. Returns the new
6140 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6142 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6143 part of a declaration and/or decl-specifier. */
6145 static tree
6152 {
6157 /* Remember where the nested-name-specifier starts. */
6159 {
6162 }
6165 {
6166 tree new_scope;
6167 tree old_scope;
6168 tree saved_qualifying_scope;
6170 /* Spot cases that cannot be the beginning of a
6171 nested-name-specifier. */
6174 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6175 the already parsed nested-name-specifier. */
6177 {
6178 /* Grab the nested-name-specifier and continue the loop. */
6180 /* If we originally encountered this nested-name-specifier
6181 with IS_DECLARATION set to false, we will not have
6182 resolved TYPENAME_TYPEs, so we must do so here. */
6185 {
6190 }
6193 }
6195 /* Spot cases that cannot be the beginning of a
6196 nested-name-specifier. On the second and subsequent times
6197 through the loop, we look for the `template' keyword. */
6199 ;
6200 /* A template-id can start a nested-name-specifier. */
6202 ;
6203 /* DR 743: decltype can be used in a nested-name-specifier. */
6205 ;
6206 else
6207 {
6208 /* If the next token is not an identifier, then it is
6209 definitely not a type-name or namespace-name. */
6212 /* If the following token is neither a `<' (to begin a
6213 template-id), nor a `::', then we are not looking at a
6214 nested-name-specifier. */
6220 {
6224 "found %<:%> in nested-name-specifier, "
6227 }
6230 && !cp_parser_nth_token_starts_template_argument_list_p
6233 }
6235 /* The nested-name-specifier is optional, so we parse
6236 tentatively. */
6239 /* Look for the optional `template' keyword, if this isn't the
6240 first time through the loop. */
6244 /* Save the old scope since the name lookup we are about to do
6245 might destroy it. */
6248 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6249 look up names in "X<T>::I" in order to determine that "Y" is
6250 a template. So, if we have a typename at this point, we make
6251 an effort to look through it. */
6253 && !typename_keyword_p
6258 /* Parse the qualifying entity. */
6259 new_scope
6261 typename_keyword_p,
6262 template_keyword_p,
6263 check_dependency_p,
6264 type_p,
6265 is_declaration);
6266 /* Look for the `::' token. */
6269 /* If we found what we wanted, we keep going; otherwise, we're
6270 done. */
6272 {
6275 /* Restore the OLD_SCOPE since it was valid before the
6276 failed attempt at finding the last
6277 class-or-namespace-name. */
6281 /* If the next token is a decltype, and the one after that is a
6282 `::', then the decltype has failed to resolve to a class or
6283 enumeration type. Give this error even when parsing
6284 tentatively since it can't possibly be valid--and we're going
6285 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6286 won't get another chance.*/
6290 {
6297 /* As below. */
6300 }
6304 {
6305 /* If we have a non-type template-id followed by ::, it can't
6306 possibly be valid. */
6311 {
6314 {
6320 }
6321 else
6322 {
6323 /* Variable template. */
6328 }
6335 /* As below. */
6339 }
6340 }
6344 /* If the next token is an identifier, and the one after
6345 that is a `::', then any valid interpretation would have
6346 found a class-or-namespace-name. */
6352 {
6355 {
6357 {
6358 tree decl;
6359 tree ambiguous_decls;
6362 none_type,
6371 decl);
6373 {
6374 // cp_parser_lookup_name has the same diagnostic,
6375 // thus make sure to emit it at most once.
6378 {
6383 }
6385 }
6386 else
6387 {
6389 cp_parser_name_lookup_error
6392 else
6393 cp_parser_name_lookup_error
6396 }
6397 }
6400 /* Treat this as a successful nested-name-specifier
6401 due to:
6403 [basic.lookup.qual]
6405 If the name found is not a class-name (clause
6406 _class_) or namespace-name (_namespace.def_), the
6407 program is ill-formed. */
6409 }
6411 }
6413 }
6414 /* We've found one valid nested-name-specifier. */
6416 /* Name lookup always gives us a DECL. */
6419 /* Uses of "template" must be followed by actual templates. */
6431 new_scope);
6432 /* If it is a class scope, try to complete it; we are about to
6433 be looking up names inside the class. */
6435 /* Since checking types for dependency can be expensive,
6436 avoid doing it if the type is already complete. */
6438 /* Do not try to complete dependent types. */
6440 {
6442 /* If it is a typedef to current class, use the current
6443 class instead, as the typedef won't have any names inside
6444 it yet. */
6448 }
6449 /* Make sure we look in the right scope the next time through
6450 the loop. */
6452 }
6454 /* If parsing tentatively, replace the sequence of tokens that makes
6455 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6456 token. That way, should we re-parse the token stream, we will
6457 not have to repeat the effort required to do the parse, nor will
6458 we issue duplicate error messages. */
6460 {
6464 /* Reset the contents of the START token. */
6466 /* Retrieve any deferred checks. Do not pop this access checks yet
6467 so the memory will not be reclaimed during token replacing below. */
6475 /* Purge all subsequent tokens. */
6477 }
6483 }
6485 /* Parse a nested-name-specifier. See
6486 cp_parser_nested_name_specifier_opt for details. This function
6487 behaves identically, except that it will an issue an error if no
6488 nested-name-specifier is present. */
6490 static tree
6496 {
6497 tree scope;
6499 /* Look for the nested-name-specifier. */
6501 typename_keyword_p,
6502 check_dependency_p,
6503 type_p,
6504 is_declaration);
6505 /* If it was not present, issue an error message. */
6507 {
6510 }
6513 }
6515 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6516 this is either a class-name or a namespace-name (which corresponds
6517 to the class-or-namespace-name production in the grammar). For
6518 C++0x, it can also be a type-name that refers to an enumeration
6519 type or a simple-template-id.
6521 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6522 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6523 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6524 TYPE_P is TRUE iff the next name should be taken as a class-name,
6525 even the same name is declared to be another entity in the same
6526 scope.
6528 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6529 specified by the class-or-namespace-name. If neither is found the
6530 ERROR_MARK_NODE is returned. */
6532 static tree
6539 {
6540 tree saved_scope;
6541 tree saved_qualifying_scope;
6542 tree saved_object_scope;
6543 tree scope;
6547 /* DR 743: decltype can appear in a nested-name-specifier. */
6549 {
6553 {
6556 }
6560 }
6562 /* Before we try to parse the class-name, we must save away the
6563 current PARSER->SCOPE since cp_parser_class_name will destroy
6564 it. */
6568 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6569 there is no need to look for a namespace-name. */
6570 only_class_p = template_keyword_p
6575 typename_keyword_p,
6576 template_keyword_p,
6578 check_dependency_p,
6580 is_declaration,
6583 /* If that didn't work, try for a namespace-name. */
6585 {
6586 /* Restore the saved scope. */
6590 /* If we are not looking at an identifier followed by the scope
6591 resolution operator, then this is not part of a
6592 nested-name-specifier. (Note that this function is only used
6593 to parse the components of a nested-name-specifier.) */
6598 }
6601 }
6603 /* Return true if we are looking at a compound-literal, false otherwise. */
6605 static bool
6607 {
6610 /* Skip tokens until the next token is a closing parenthesis.
6611 If we find the closing `)', and the next token is a `{', then
6612 we are looking at a compound-literal. */
6613 bool compound_literal_p
6618 /* Roll back the tokens we skipped. */
6622 }
6624 /* Return true if EXPR is the integer constant zero or a complex constant
6625 of zero, without any folding, but ignoring location wrappers. */
6627 static bool
6629 {
6632 }
6634 /* Parse a postfix-expression.
6636 postfix-expression:
6637 primary-expression
6638 postfix-expression [ expression ]
6639 postfix-expression ( expression-list [opt] )
6640 simple-type-specifier ( expression-list [opt] )
6641 typename :: [opt] nested-name-specifier identifier
6642 ( expression-list [opt] )
6643 typename :: [opt] nested-name-specifier template [opt] template-id
6644 ( expression-list [opt] )
6645 postfix-expression . template [opt] id-expression
6646 postfix-expression -> template [opt] id-expression
6647 postfix-expression . pseudo-destructor-name
6648 postfix-expression -> pseudo-destructor-name
6649 postfix-expression ++
6650 postfix-expression --
6651 dynamic_cast < type-id > ( expression )
6652 static_cast < type-id > ( expression )
6653 reinterpret_cast < type-id > ( expression )
6654 const_cast < type-id > ( expression )
6655 typeid ( expression )
6656 typeid ( type-id )
6658 GNU Extension:
6660 postfix-expression:
6661 ( type-id ) { initializer-list , [opt] }
6663 This extension is a GNU version of the C99 compound-literal
6664 construct. (The C99 grammar uses `type-name' instead of `type-id',
6665 but they are essentially the same concept.)
6667 If ADDRESS_P is true, the postfix expression is the operand of the
6668 `&' operator. CAST_P is true if this expression is the target of a
6669 cast.
6671 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6672 class member access expressions [expr.ref].
6674 Returns a representation of the expression. */
6676 static cp_expr
6680 {
6682 location_t loc;
6688 /* Peek at the next token. */
6693 /* Some of the productions are determined by keywords. */
6696 {
6701 {
6702 tree type;
6703 cp_expr expression;
6707 /* All of these can be handled in the same way from the point
6708 of view of parsing. Begin by consuming the token
6709 identifying the cast. */
6712 /* New types cannot be defined in the cast. */
6714 parser->type_definition_forbidden_message
6717 /* Look for the opening `<'. */
6719 /* Parse the type to which we are casting. */
6724 /* Look for the closing `>'. */
6726 /* Restore the old message. */
6729 bool saved_greater_than_is_operator_p
6733 /* And the expression which is being cast. */
6734 matching_parens parens;
6738 RT_CLOSE_PAREN);
6742 parser->greater_than_is_operator_p
6745 /* Only type conversions to integral or enumeration types
6746 can be used in constant-expressions. */
6749 {
6752 }
6755 {
6757 postfix_expression
6761 postfix_expression
6765 postfix_expression
6767 tf_warning_or_error);
6770 postfix_expression
6775 }
6777 /* Construct a location e.g. :
6778 reinterpret_cast <int *> (expr)
6779 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6780 ranging from the start of the "*_cast" token to the final closing
6781 paren, with the caret at the start. */
6784 }
6788 {
6789 tree type;
6793 /* Consume the `typeid' token. */
6795 /* Look for the `(' token. */
6796 matching_parens parens;
6798 /* Types cannot be defined in a `typeid' expression. */
6800 parser->type_definition_forbidden_message
6802 /* We can't be sure yet whether we're looking at a type-id or an
6803 expression. */
6805 /* Try a type-id first. */
6810 /* Look for the `)' token. Otherwise, we can't be sure that
6811 we're not looking at an expression: consider `typeid (int
6812 (3))', for example. */
6814 /* If all went well, simply lookup the type-id. */
6817 /* Otherwise, fall back to the expression variant. */
6818 else
6819 {
6820 tree expression;
6822 /* Look for an expression. */
6824 /* Compute its typeid. */
6826 /* Look for the `)' token. */
6828 }
6829 /* Restore the saved message. */
6831 /* `typeid' may not appear in an integral constant expression. */
6835 /* Construct a location e.g. :
6836 typeid (expr)
6837 ^~~~~~~~~~~~~
6838 ranging from the start of the "typeid" token to the final closing
6839 paren, with the caret at the start. */
6841 {
6842 location_t typeid_loc
6846 }
6847 }
6851 {
6852 tree type;
6853 /* The syntax permitted here is the same permitted for an
6854 elaborated-type-specifier. */
6861 }
6867 {
6870 tree p;
6877 {
6880 }
6886 {
6889 postfix_expression
6891 else
6892 {
6896 }
6902 tf_warning_or_error);
6903 else
6904 {
6908 }
6913 postfix_expression
6917 postfix_expression
6920 else
6921 {
6925 }
6930 }
6932 }
6935 {
6936 tree type;
6938 /* If the next thing is a simple-type-specifier, we may be
6939 looking at a functional cast. We could also be looking at
6940 an id-expression. So, we try the functional cast, and if
6941 that doesn't work we fall back to the primary-expression. */
6943 /* Look for the simple-type-specifier. */
6947 CP_PARSER_FLAGS_NONE);
6949 /* Parse the cast itself. */
6951 postfix_expression
6953 /* If that worked, we're done. */
6957 /* If the functional-cast didn't work out, try a
6958 compound-literal. */
6961 {
6966 matching_parens parens;
6969 /* Avoid calling cp_parser_type_id pointlessly, see comment
6970 in cp_parser_cast_expression about c++/29234. */
6973 else
6974 {
6975 /* Parse the type. */
6981 }
6983 /* If things aren't going well, there's no need to
6984 keep going. */
6986 {
6988 /* Parse the brace-enclosed initializer list. */
6991 }
6992 /* If that worked, we're definitely looking at a
6993 compound-literal expression. */
6995 {
6996 /* Warn the user that a compound literal is not
6997 allowed in standard C++. */
7000 /* For simplicity, we disallow compound literals in
7001 constant-expressions. We could
7002 allow compound literals of integer type, whose
7003 initializer was a constant, in constant
7004 expressions. Permitting that usage, as a further
7005 extension, would not change the meaning of any
7006 currently accepted programs. (Of course, as
7007 compound literals are not part of ISO C++, the
7008 standard has nothing to say.) */
7010 NIC_NCC))
7011 {
7014 }
7015 /* Form the representation of the compound-literal. */
7016 postfix_expression
7021 }
7022 }
7024 /* It must be a primary-expression. */
7025 postfix_expression
7028 decltype_p,
7030 }
7032 }
7034 /* Note that we don't need to worry about calling build_cplus_new on a
7035 class-valued CALL_EXPR in decltype when it isn't the end of the
7036 postfix-expression; unary_complex_lvalue will take care of that for
7037 all these cases. */
7039 /* Keep looping until the postfix-expression is complete. */
7041 {
7045 /* It is not a Koenig lookup function call. */
7046 postfix_expression
7049 /* Peek at the next token. */
7053 {
7056 {
7058 "two consecutive %<[%> shall "
7061 }
7062 postfix_expression
7064 postfix_expression,
7066 decltype_p);
7075 /* postfix-expression ( expression-list [opt] ) */
7076 {
7087 is_builtin_constant_p
7090 {
7091 /* The whole point of __builtin_constant_p is to allow
7092 non-constant expressions to appear as arguments. */
7093 saved_integral_constant_expression_p
7095 saved_non_integral_constant_expression_p
7098 }
7099 args = (cp_parser_parenthesized_expression_list
7106 {
7107 parser->integral_constant_expression_p
7109 parser->non_integral_constant_expression_p
7111 }
7114 {
7117 }
7119 /* Function calls are not permitted in
7120 constant-expressions. */
7123 NIC_FUNC_CALL))
7124 {
7128 }
7133 {
7135 {
7137 {
7140 postfix_expression
7142 complain);
7143 }
7144 else
7145 postfix_expression
7147 }
7148 /* We do not perform argument-dependent lookup if
7149 normal lookup finds a non-function, in accordance
7150 with the expected resolution of DR 218. */
7153 {
7157 /* Do not do argument dependent lookup if regular
7158 lookup finds a member function or a block-scope
7159 function declaration. [basic.lookup.argdep]/3 */
7162 {
7165 postfix_expression
7167 complain);
7168 }
7169 }
7170 }
7176 {
7183 }
7186 {
7196 {
7198 postfix_expression
7202 }
7205 {
7206 postfix_expression
7207 = (build_new_method_call
7213 complain));
7214 }
7215 else
7216 postfix_expression
7220 complain);
7221 }
7225 postfix_expression = (build_offset_ref_call_from_tree
7227 complain));
7229 /* A call to a static class member, or a namespace-scope
7230 function. */
7231 postfix_expression
7234 koenig_p,
7235 complain);
7236 else
7237 /* All other function calls. */
7238 postfix_expression
7241 koenig_p,
7242 complain);
7245 {
7247 start_loc,
7248 close_paren_loc);
7250 }
7252 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7256 }
7261 /* postfix-expression . template [opt] id-expression
7262 postfix-expression . pseudo-destructor-name
7263 postfix-expression -> template [opt] id-expression
7264 postfix-expression -> pseudo-destructor-name */
7266 /* Consume the `.' or `->' operator. */
7269 postfix_expression
7271 postfix_expression,
7278 /* postfix-expression ++ */
7279 /* Consume the `++' token. */
7281 /* Generate a representation for the complete expression. */
7282 postfix_expression
7284 POSTINCREMENT_EXPR);
7285 /* Increments may not appear in constant-expressions. */
7293 /* postfix-expression -- */
7294 /* Consume the `--' token. */
7296 /* Generate a representation for the complete expression. */
7297 postfix_expression
7299 POSTDECREMENT_EXPR);
7300 /* Decrements may not appear in constant-expressions. */
7311 return is_member_access
7312 ? postfix_expression
7314 else
7316 }
7317 }
7319 /* We should never get here. */
7322 }
7324 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7325 by cp_parser_builtin_offsetof. We're looking for
7327 postfix-expression [ expression ]
7328 postfix-expression [ braced-init-list ] (C++11)
7330 FOR_OFFSETOF is set if we're being called in that context, which
7331 changes how we deal with integer constant expressions. */
7333 static tree
7335 tree postfix_expression,
7338 {
7343 /* Consume the `[' token. */
7349 /* Parse the index expression. */
7350 /* ??? For offsetof, there is a question of what to allow here. If
7351 offsetof is not being used in an integral constant expression context,
7352 then we *could* get the right answer by computing the value at runtime.
7353 If we are in an integral constant expression context, then we might
7354 could accept any constant expression; hard to say without analysis.
7355 Rather than open the barn door too wide right away, allow only integer
7356 constant expressions here. */
7359 else
7360 {
7362 {
7367 }
7368 else
7370 }
7374 /* Look for the closing `]'. */
7377 /* Build the ARRAY_REF. */
7381 /* When not doing offsetof, array references are not permitted in
7382 constant-expressions. */
7388 }
7390 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7391 by cp_parser_builtin_offsetof. We're looking for
7393 postfix-expression . template [opt] id-expression
7394 postfix-expression . pseudo-destructor-name
7395 postfix-expression -> template [opt] id-expression
7396 postfix-expression -> pseudo-destructor-name
7398 FOR_OFFSETOF is set if we're being called in that context. That sorta
7399 limits what of the above we'll actually accept, but nevermind.
7400 TOKEN_TYPE is the "." or "->" token, which will already have been
7401 removed from the stream. */
7403 static tree
7406 cp_expr postfix_expression,
7408 location_t location)
7409 {
7410 tree name;
7416 /* If this is a `->' operator, dereference the pointer. */
7419 tf_warning_or_error);
7420 /* Check to see whether or not the expression is type-dependent and
7421 not the current instantiation. */
7423 /* The identifier following the `->' or `.' is not qualified. */
7429 /* Enter the scope corresponding to the type of the object
7430 given by the POSTFIX_EXPRESSION. */
7432 {
7434 /* According to the standard, no expression should ever have
7435 reference type. Unfortunately, we do not currently match
7436 the standard in this respect in that our internal representation
7437 of an expression may have reference type even when the standard
7438 says it does not. Therefore, we have to manually obtain the
7439 underlying type here. */
7441 /* The type of the POSTFIX_EXPRESSION must be complete. */
7442 /* Unlike the object expression in other contexts, *this is not
7443 required to be of complete type for purposes of class member
7444 access (5.2.5) outside the member function body. */
7447 && !(processing_template_decl
7448 && current_class_type
7449 && (same_type_ignoring_top_level_qualifiers_p
7451 {
7454 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7456 {
7457 /* In a template, be permissive by treating an object expression
7458 of incomplete type as dependent (after a pedwarn). */
7459 diagnostic_t kind = (processing_template_decl
7461 ? DK_PEDWARN
7463 cxx_incomplete_type_diagnostic
7469 {
7472 }
7473 }
7474 }
7477 {
7478 /* Let the name lookup machinery know that we are processing a
7479 class member access expression. */
7481 /* If something went wrong, we want to be able to discern that case,
7482 as opposed to the case where there was no SCOPE due to the type
7483 of expression being dependent. */
7486 /* If the SCOPE was erroneous, make the various semantic analysis
7487 functions exit quickly -- and without issuing additional error
7488 messages. */
7491 }
7492 }
7495 /* Tell cp_parser_lookup_name that there was an object, even though it's
7496 type-dependent. */
7499 /* Assume this expression is not a pseudo-destructor access. */
7502 /* If the SCOPE is a scalar type, then, if this is a valid program,
7503 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7504 is type dependent, it can be pseudo-destructor-name or something else.
7505 Try to parse it as pseudo-destructor-name first. */
7507 {
7508 tree s;
7509 tree type;
7512 /* Parse the pseudo-destructor-name. */
7521 {
7523 postfix_expression
7526 }
7527 }
7530 {
7531 /* If the SCOPE is not a scalar type, we are looking at an
7532 ordinary class member access expression, rather than a
7533 pseudo-destructor-name. */
7536 /* Parse the id-expression. */
7537 name = (cp_parser_id_expression
7544 /* In general, build a SCOPE_REF if the member name is qualified.
7545 However, if the name was not dependent and has already been
7546 resolved; there is no need to build the SCOPE_REF. For example;
7548 struct X { void f(); };
7549 template <typename T> void f(T* t) { t->X::f(); }
7551 Even though "t" is dependent, "X::f" is not and has been resolved
7552 to a BASELINK; there is no need to include scope information. */
7554 /* But we do need to remember that there was an explicit scope for
7555 virtual function calls. */
7559 /* If the name is a template-id that names a type, we will get a
7560 TYPE_DECL here. That is invalid code. */
7562 {
7565 }
7566 else
7567 {
7569 {
7571 {
7575 }
7576 else
7579 name,
7580 template_p);
7584 }
7586 adjust_result_of_qualified_name_lookup
7588 postfix_expression
7590 template_p,
7591 tf_warning_or_error);
7592 /* Build a location e.g.:
7593 ptr->access_expr
7594 ~~~^~~~~~~~~~~~~
7595 where the caret is at the deref token, ranging from
7596 the start of postfix_expression to the end of the access expr. */
7597 location_t end_loc
7599 location_t combined_loc
7602 }
7603 }
7605 /* We no longer need to look up names in the scope of the object on
7606 the left-hand side of the `.' or `->' operator. */
7609 /* Outside of offsetof, these operators may not appear in
7610 constant-expressions. */
7612 && (cp_parser_non_integral_constant_expression
7617 }
7619 /* Parse a parenthesized expression-list.
7621 expression-list:
7622 assignment-expression
7623 expression-list, assignment-expression
7625 attribute-list:
7626 expression-list
7627 identifier
7628 identifier, expression-list
7630 CAST_P is true if this expression is the target of a cast.
7632 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7633 argument pack.
7635 WRAP_LOCATIONS_P is true if expressions within this list for which
7636 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7637 their source locations.
7639 Returns a vector of trees. Each element is a representation of an
7640 assignment-expression. NULL is returned if the ( and or ) are
7641 missing. An empty, but allocated, vector is returned on no
7642 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7643 if we are parsing an attribute list for an attribute that wants a
7644 plain identifier argument, normal_attr for an attribute that wants
7645 an expression, or non_attr if we aren't parsing an attribute list. If
7646 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7647 not all of the expressions in the list were constant.
7648 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7649 will be written to with the location of the closing parenthesis. If
7650 an error occurs, it may or may not be written to. */
7660 {
7666 /* Assume all the expressions will be constant. */
7670 matching_parens parens;
7676 /* Within a parenthesized expression, a `>' token is always
7677 the greater-than operator. */
7678 saved_greater_than_is_operator_p
7684 /* Consume expressions until there are no more. */
7687 {
7688 /* At the beginning of attribute lists, check to see if the
7689 next token is an identifier. */
7692 {
7695 /* Consume the identifier. */
7697 /* Save the identifier. */
7699 }
7700 else
7701 {
7704 /* Parse the next assignment-expression. */
7706 {
7707 /* A braced-init-list. */
7713 }
7715 {
7716 expr = (cp_parser_constant_expression
7721 }
7722 else
7724 cast_p);
7729 /* If we have an ellipsis, then this is an expression
7730 expansion. */
7733 {
7734 /* Consume the `...'. */
7737 /* Build the argument pack. */
7739 }
7744 /* Add it to the list. We add error_mark_node
7745 expressions to the list, so that we can still tell if
7746 the correct form for a parenthesized expression-list
7747 is found. That gives better errors. */
7752 }
7754 /* After the first item, attribute lists look the same as
7755 expression lists. */
7758 get_comma:;
7759 /* If the next token isn't a `,', then we are done. */
7763 /* Otherwise, consume the `,' and keep going. */
7765 }
7771 {
7774 skip_comma:;
7775 /* We try and resync to an unnested comma, as that will give the
7776 user better diagnostics. */
7784 {
7785 parser->greater_than_is_operator_p
7788 }
7789 }
7791 parser->greater_than_is_operator_p
7798 }
7800 /* Parse a pseudo-destructor-name.
7802 pseudo-destructor-name:
7803 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7804 :: [opt] nested-name-specifier template template-id :: ~ type-name
7805 :: [opt] nested-name-specifier [opt] ~ type-name
7807 If either of the first two productions is used, sets *SCOPE to the
7808 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7809 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7810 or ERROR_MARK_NODE if the parse fails. */
7812 static void
7814 tree object,
7817 {
7820 /* Handle ~auto. */
7824 {
7827 "%<~auto%> only available with "
7834 }
7836 /* Assume that things will not work out. */
7839 /* Look for the optional `::' operator. */
7841 /* Look for the optional nested-name-specifier. */
7842 nested_name_specifier_p
7849 /* Now, if we saw a nested-name-specifier, we might be doing the
7850 second production. */
7853 {
7854 /* Consume the `template' keyword. */
7856 /* Parse the template-id. */
7860 class_type,
7862 /* Look for the `::' token. */
7864 }
7865 /* If the next token is not a `~', then there might be some
7866 additional qualification. */
7868 {
7869 /* At this point, we're looking for "type-name :: ~". The type-name
7870 must not be a class-name, since this is a pseudo-destructor. So,
7871 it must be either an enum-name, or a typedef-name -- both of which
7872 are just identifiers. So, we peek ahead to check that the "::"
7873 and "~" tokens are present; if they are not, then we can avoid
7874 calling type_name. */
7878 {
7881 }
7883 /* Look for the type-name. */
7888 /* Look for the `::' token. */
7890 }
7891 else
7894 /* Look for the `~'. */
7897 /* Once we see the ~, this has to be a pseudo-destructor. */
7901 /* Look for the type-name again. We are not responsible for
7902 checking that it matches the first type-name. */
7904 }
7906 /* Parse a unary-expression.
7908 unary-expression:
7909 postfix-expression
7910 ++ cast-expression
7911 -- cast-expression
7912 unary-operator cast-expression
7913 sizeof unary-expression
7914 sizeof ( type-id )
7915 alignof ( type-id ) [C++0x]
7916 new-expression
7917 delete-expression
7919 GNU Extensions:
7921 unary-expression:
7922 __extension__ cast-expression
7923 __alignof__ unary-expression
7924 __alignof__ ( type-id )
7925 alignof unary-expression [C++0x]
7926 __real__ cast-expression
7927 __imag__ cast-expression
7928 && identifier
7929 sizeof ( type-id ) { initializer-list , [opt] }
7930 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7931 __alignof__ ( type-id ) { initializer-list , [opt] }
7933 ADDRESS_P is true iff the unary-expression is appearing as the
7934 operand of the `&' operator. CAST_P is true if this expression is
7935 the target of a cast.
7937 Returns a representation of the expression. */
7939 static cp_expr
7942 {
7946 /* Peek at the next token. */
7948 /* Some keywords give away the kind of expression. */
7950 {
7954 {
7957 {
7963 /* Consume the token. */
7965 /* Parse the operand. */
7970 else
7971 {
7972 /* ISO C++ defines alignof only with types, not with
7973 expressions. So pedwarn if alignof is used with a non-
7974 type expression. However, __alignof__ is ok. */
7977 "ISO C++ does not allow %<alignof%> "
7981 }
7982 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7983 SIZEOF_EXPR with the original operand. */
7985 {
7987 {
7989 {
7992 error_mark_node));
7994 }
7995 else
7999 }
8000 }
8002 /* Construct a location e.g. :
8003 alignof (expr)
8004 ^~~~~~~~~~~~~~
8005 with start == caret at the start of the "alignof"/"sizeof"
8006 token, with the endpoint at the final closing paren. */
8007 location_t finish_loc
8009 location_t compound_loc
8016 }
8025 {
8026 /* The saved value of the PEDANTIC flag. */
8028 tree expr;
8030 /* Save away the PEDANTIC flag. */
8032 /* Parse the cast-expression. */
8034 /* Restore the PEDANTIC flag. */
8038 }
8042 {
8043 tree expression;
8045 /* Consume the `__real__' or `__imag__' token. */
8047 /* Parse the cast-expression. */
8049 /* Create the complete representation. */
8053 expression,
8054 tf_warning_or_error);
8055 }
8063 {
8064 tree expr;
8073 matching_parens parens;
8077 parser->type_definition_forbidden_message
8080 saved_integral_constant_expression_p
8082 saved_non_integral_constant_expression_p
8086 saved_greater_than_is_operator_p
8098 parser->greater_than_is_operator_p
8101 parser->integral_constant_expression_p
8103 parser->non_integral_constant_expression_p
8108 location_t finish_loc
8112 /* Construct a location of the form:
8113 noexcept (expr)
8114 ^~~~~~~~~~~~~~~
8115 with start == caret, finishing at the close-paren. */
8116 location_t noexcept_loc
8120 noexcept_loc);
8121 }
8125 }
8126 }
8128 /* Look for the `:: new' and `:: delete', which also signal the
8129 beginning of a new-expression, or delete-expression,
8130 respectively. If the next token is `::', then it might be one of
8131 these. */
8133 {
8136 /* See if the token after the `::' is one of the keywords in
8137 which we're interested. */
8139 /* If it's `new', we have a new-expression. */
8142 /* Similarly, for `delete'. */
8145 }
8147 /* Look for a unary operator. */
8149 /* The `++' and `--' operators can be handled similarly, even though
8150 they are not technically unary-operators in the grammar. */
8152 {
8157 /* Handle the GNU address-of-label extension. */
8160 {
8161 tree identifier;
8162 tree expression;
8165 /* Consume the '&&' token. */
8167 /* Look for the identifier. */
8168 location_t finish_loc
8171 /* Construct a location of the form:
8172 &&label
8173 ^~~~~~~
8174 with caret==start at the "&&", finish at the end of the label. */
8175 location_t combined_loc
8177 /* Create an expression representing the address. */
8180 NIC_ADDR_LABEL))
8183 }
8184 }
8186 {
8187 cp_expr cast_expression;
8193 /* Consume the operator token. */
8197 /* Parse the cast-expression. */
8198 cast_expression
8203 pidk);
8205 /* Make a location:
8206 OP_TOKEN CAST_EXPRESSION
8207 ^~~~~~~~~~~~~~~~~~~~~~~~~
8208 with start==caret at the operator token, and
8209 extending to the end of the cast_expression. */
8212 /* Now, build an appropriate representation. */
8214 {
8218 RO_UNARY_STAR,
8219 complain);
8220 /* TODO: build_x_indirect_ref does not always honor the
8221 location, so ensure it is set. */
8227 /* Fall through. */
8230 cast_expression,
8231 complain);
8232 /* TODO: build_x_unary_op does not always honor the location,
8233 so ensure it is set. */
8241 /* Fall through. */
8243 /* Immediately fold negation of a constant, unless the constant is 0
8244 (since -0 == 0) or it would overflow. */
8249 {
8252 cast_expression);
8254 {
8257 }
8258 }
8259 /* Fall through. */
8268 }
8272 non_constant_p))
8276 }
8280 decltype_p,
8281 pidk);
8282 }
8284 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8285 unary-operator, the corresponding tree code is returned. */
8287 static enum tree_code
8289 {
8291 {
8312 }
8313 }
8315 /* Parse a new-expression.
8317 new-expression:
8318 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8319 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8321 Returns a representation of the expression. */
8323 static tree
8325 {
8328 tree type;
8331 tree ret;
8335 /* Look for the optional `::' operator. */
8336 global_scope_p
8340 /* Look for the `new' operator. */
8342 /* There's no easy way to tell a new-placement from the
8343 `( type-id )' construct. */
8345 /* Look for a new-placement. */
8347 /* If that didn't work out, there's no new-placement. */
8349 {
8353 }
8355 /* If the next token is a `(', then we have a parenthesized
8356 type-id. */
8358 {
8362 /* Consume the `('. */
8363 matching_parens parens;
8366 /* Parse the type-id. */
8367 parser->type_definition_forbidden_message
8369 {
8372 }
8375 /* Look for the closing `)'. */
8378 /* There should not be a direct-new-declarator in this production,
8379 but GCC used to allowed this, so we check and emit a sensible error
8380 message for this case. */
8382 {
8388 }
8389 }
8390 /* Otherwise, there must be a new-type-id. */
8391 else
8394 /* If the next token is a `(' or '{', then we have a new-initializer. */
8399 else
8402 /* A new-expression may not appear in an integral constant
8403 expression. */
8406 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8407 of a new-type-id or type-id of a new-expression, the new-expression shall
8408 contain a new-initializer of the form ( assignment-expression )".
8409 Additionally, consistently with the spirit of DR 1467, we want to accept
8410 'new auto { 2 }' too. */
8416 {
8418 "initialization of new-expression for type %<auto%> "
8421 }
8422 else
8423 {
8424 /* Construct a location e.g.:
8425 ptr = new int[100]
8426 ^~~~~~~~~~~~
8427 with caret == start at the start of the "new" token, and the end
8428 at the end of the final token we consumed. */
8433 /* Create a representation of the new-expression. */
8435 tf_warning_or_error);
8437 }
8445 }
8447 /* Parse a new-placement.
8449 new-placement:
8450 ( expression-list )
8452 Returns the same representation as for an expression-list. */
8456 {
8459 /* Parse the expression-list. */
8460 expression_list = (cp_parser_parenthesized_expression_list
8469 }
8471 /* Parse a new-type-id.
8473 new-type-id:
8474 type-specifier-seq new-declarator [opt]
8476 Returns the TYPE allocated. If the new-type-id indicates an array
8477 type, *NELTS is set to the number of elements in the last array
8478 bound; the TYPE will not include the last array bound. */
8480 static tree
8482 {
8483 cp_decl_specifier_seq type_specifier_seq;
8489 /* The type-specifier sequence must not contain type definitions.
8490 (It cannot contain declarations of new types either, but if they
8491 are not definitions we will catch that because they are not
8492 complete.) */
8494 parser->type_definition_forbidden_message
8496 /* Parse the type-specifier-seq. */
8500 /* Restore the old message. */
8506 /* Parse the new-declarator. */
8509 /* Determine the number of elements in the last array dimension, if
8510 any. */
8512 /* Skip down to the last array dimension. */
8517 {
8520 }
8525 {
8528 }
8531 {
8538 else
8540 }
8543 }
8545 /* Parse an (optional) new-declarator.
8547 new-declarator:
8548 ptr-operator new-declarator [opt]
8549 direct-new-declarator
8551 Returns the declarator. */
8555 {
8558 cp_cv_quals cv_quals;
8560 /* We don't know if there's a ptr-operator next, or not. */
8562 /* Look for a ptr-operator. */
8564 /* If that worked, look for more new-declarators. */
8566 {
8569 /* Parse another optional declarator. */
8572 declarator = cp_parser_make_indirect_declarator
8576 }
8578 /* If the next token is a `[', there is a direct-new-declarator. */
8583 }
8585 /* Parse a direct-new-declarator.
8587 direct-new-declarator:
8588 [ expression ]
8589 direct-new-declarator [constant-expression]
8591 */
8595 {
8599 {
8600 tree expression;
8603 /* Look for the opening `['. */
8608 /* The standard requires that the expression have integral
8609 type. DR 74 adds enumeration types. We believe that the
8610 real intent is that these expressions be handled like the
8611 expression in a `switch' condition, which also allows
8612 classes with a single conversion to integral or
8613 enumeration type. */
8615 {
8616 expression
8618 expression,
8621 {
8623 "expression in new-declarator must have integral "
8626 }
8627 }
8629 /* Look for the closing `]'. */
8632 /* Add this bound to the declarator. */
8635 /* If the next token is not a `[', then there are no more
8636 bounds. */
8639 }
8642 }
8644 /* Parse a new-initializer.
8646 new-initializer:
8647 ( expression-list [opt] )
8648 braced-init-list
8650 Returns a representation of the expression-list. */
8654 {
8658 {
8659 tree t;
8666 }
8667 else
8668 expression_list = (cp_parser_parenthesized_expression_list
8674 }
8676 /* Parse a delete-expression.
8678 delete-expression:
8679 :: [opt] delete cast-expression
8680 :: [opt] delete [ ] cast-expression
8682 Returns a representation of the expression. */
8684 static tree
8686 {
8689 tree expression;
8691 /* Look for the optional `::' operator. */
8692 global_scope_p
8696 /* Look for the `delete' keyword. */
8698 /* See if the array syntax is in use. */
8700 {
8701 /* Consume the `[' token. */
8703 /* Look for the `]' token. */
8705 /* Remember that this is the `[]' construct. */
8707 }
8708 else
8711 /* Parse the cast-expression. */
8714 /* A delete-expression may not appear in an integral constant
8715 expression. */
8720 tf_warning_or_error);
8721 }
8723 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8724 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8725 0 otherwise. */
8727 static int
8729 {
8732 {
8774 /* In ((type ()) () the last () isn't a valid cast-expression,
8775 so the whole must be parsed as postfix-expression. */
8780 /* '[' may start a primary-expression in obj-c++ and in C++11,
8781 as a lambda-expression, eg, '(void)[]{}'. */
8788 /* '++' and '--' may or may not start a cast-expression:
8790 struct T { void operator++(int); };
8791 void f() { (T())++; }
8793 vs
8795 int a;
8796 (int)++a; */
8801 }
8802 }
8804 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8805 in the order: const_cast, static_cast, reinterpret_cast.
8807 Don't suggest dynamic_cast.
8809 Return the first legal cast kind found, or NULL otherwise. */
8813 {
8814 tree trial;
8816 /* Reuse the parser logic by attempting to build the various kinds of
8817 cast, with "complain" disabled.
8818 Identify the first such cast that is valid. */
8820 /* Don't attempt to run such logic within template processing. */
8824 /* First try const_cast. */
8829 /* If that fails, try static_cast. */
8834 /* Finally, try reinterpret_cast. */
8839 /* No such cast possible. */
8841 }
8843 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8844 suggesting how to convert a C-style cast of the form:
8846 (DST_TYPE)ORIG_EXPR
8848 to a C++-style cast.
8850 The primary range of RICHLOC is asssumed to be that of the original
8851 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8852 of the parens in the C-style cast. */
8854 static void
8857 tree dst_type)
8858 {
8859 /* This function is non-trivial, so bail out now if the warning isn't
8860 going to be emitted. */
8864 /* Try to find a legal C++ cast, trying them in order:
8865 const_cast, static_cast, reinterpret_cast. */
8870 /* Replace the open paren with "CAST_SUGGESTION<". */
8871 pretty_printer pp;
8875 /* Replace the close paren with "> (". */
8878 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8880 }
8883 /* Parse a cast-expression.
8885 cast-expression:
8886 unary-expression
8887 ( type-id ) cast-expression
8889 ADDRESS_P is true iff the unary-expression is appearing as the
8890 operand of the `&' operator. CAST_P is true if this expression is
8891 the target of a cast.
8893 Returns a representation of the expression. */
8895 static cp_expr
8898 {
8899 /* If it's a `(', then we might be looking at a cast. */
8901 {
8907 /* There's no way to know yet whether or not this is a cast.
8908 For example, `(int (3))' is a unary-expression, while `(int)
8909 3' is a cast. So, we resort to parsing tentatively. */
8911 /* Types may not be defined in a cast. */
8913 parser->type_definition_forbidden_message
8915 /* Consume the `('. */
8916 matching_parens parens;
8921 /* A very tricky bit is that `(struct S) { 3 }' is a
8922 compound-literal (which we permit in C++ as an extension).
8923 But, that construct is not a cast-expression -- it is a
8924 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8925 is legal; if the compound-literal were a cast-expression,
8926 you'd need an extra set of parentheses.) But, if we parse
8927 the type-id, and it happens to be a class-specifier, then we
8928 will commit to the parse at that point, because we cannot
8929 undo the action that is done when creating a new class. So,
8930 then we cannot back up and do a postfix-expression.
8932 Another tricky case is the following (c++/29234):
8934 struct S { void operator () (); };
8936 void foo ()
8937 {
8938 ( S()() );
8939 }
8941 As a type-id we parse the parenthesized S()() as a function
8942 returning a function, groktypename complains and we cannot
8943 back up in this case either.
8945 Therefore, we scan ahead to the closing `)', and check to see
8946 if the tokens after the `)' can start a cast-expression. Otherwise
8947 we are dealing with an unary-expression, a postfix-expression
8948 or something else.
8950 Yet another tricky case, in C++11, is the following (c++/54891):
8952 (void)[]{};
8954 The issue is that usually, besides the case of lambda-expressions,
8955 the parenthesized type-id cannot be followed by '[', and, eg, we
8956 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8957 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8958 we don't commit, we try a cast-expression, then an unary-expression.
8960 Save tokens so that we can put them back. */
8963 /* We may be looking at a cast-expression. */
8966 cast_expression
8969 /* Roll back the tokens we skipped. */
8971 /* If we aren't looking at a cast-expression, simulate an error so
8972 that the call to cp_parser_error_occurred below returns true. */
8975 else
8976 {
8979 /* Look for the type-id. */
8981 /* Look for the closing `)'. */
8986 }
8988 /* Restore the saved message. */
8991 /* At this point this can only be either a cast or a
8992 parenthesized ctor such as `(T ())' that looks like a cast to
8993 function returning T. */
8995 {
8996 /* Only commit if the cast-expression doesn't start with
8997 '++', '--', or '[' in C++11. */
9005 pidk);
9008 {
9009 /* Warn about old-style casts, if so requested. */
9014 {
9020 }
9022 /* Only type conversions to integral or enumeration types
9023 can be used in constant-expressions. */
9026 NIC_CAST))
9029 /* Perform the cast. */
9030 /* Make a location:
9031 (TYPE) EXPR
9032 ^~~~~~~~~~~
9033 with start==caret at the open paren, extending to the
9034 end of "expr". */
9036 open_paren_loc,
9040 }
9041 }
9042 else
9044 }
9046 /* If we get here, then it's not a cast, so it must be a
9047 unary-expression. */
9050 }
9052 /* Parse a binary expression of the general form:
9054 pm-expression:
9055 cast-expression
9056 pm-expression .* cast-expression
9057 pm-expression ->* cast-expression
9059 multiplicative-expression:
9060 pm-expression
9061 multiplicative-expression * pm-expression
9062 multiplicative-expression / pm-expression
9063 multiplicative-expression % pm-expression
9065 additive-expression:
9066 multiplicative-expression
9067 additive-expression + multiplicative-expression
9068 additive-expression - multiplicative-expression
9070 shift-expression:
9071 additive-expression
9072 shift-expression << additive-expression
9073 shift-expression >> additive-expression
9075 relational-expression:
9076 shift-expression
9077 relational-expression < shift-expression
9078 relational-expression > shift-expression
9079 relational-expression <= shift-expression
9080 relational-expression >= shift-expression
9082 GNU Extension:
9084 relational-expression:
9085 relational-expression <? shift-expression
9086 relational-expression >? shift-expression
9088 equality-expression:
9089 relational-expression
9090 equality-expression == relational-expression
9091 equality-expression != relational-expression
9093 and-expression:
9094 equality-expression
9095 and-expression & equality-expression
9097 exclusive-or-expression:
9098 and-expression
9099 exclusive-or-expression ^ and-expression
9101 inclusive-or-expression:
9102 exclusive-or-expression
9103 inclusive-or-expression | exclusive-or-expression
9105 logical-and-expression:
9106 inclusive-or-expression
9107 logical-and-expression && inclusive-or-expression
9109 logical-or-expression:
9110 logical-and-expression
9111 logical-or-expression || logical-and-expression
9113 All these are implemented with a single function like:
9115 binary-expression:
9116 simple-cast-expression
9117 binary-expression <token> binary-expression
9119 CAST_P is true if this expression is the target of a cast.
9121 The binops_by_token map is used to get the tree codes for each <token> type.
9122 binary-expressions are associated according to a precedence table. */
9124 #define TOKEN_PRECEDENCE(token) \
9125 (((token->type == CPP_GREATER \
9126 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9127 && !parser->greater_than_is_operator_p) \
9128 ? PREC_NOT_OPERATOR \
9129 : binops_by_token[token->type].prec)
9131 static cp_expr
9137 {
9138 cp_parser_expression_stack stack;
9140 cp_parser_expression_stack_entry current;
9141 cp_expr rhs;
9145 tree overload;
9147 /* Parse the first expression. */
9158 {
9159 /* Get an operator token. */
9165 {
9167 "%<>>%> operator is treated"
9171 }
9176 /* This is a fold-expression; handle it later. */
9179 /* Popping an entry off the stack means we completed a subexpression:
9180 - either we found a token which is not an operator (`>' where it is not
9181 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9182 will happen repeatedly;
9183 - or, we found an operator which has lower priority. This is the case
9184 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9185 parsing `3 * 4'. */
9187 {
9190 else
9192 }
9194 get_rhs:
9198 /* We used the operator token. */
9201 /* For "false && x" or "true || x", x will never be executed;
9202 disable warnings while evaluating it. */
9204 c_inhibit_evaluation_warnings +=
9207 c_inhibit_evaluation_warnings +=
9210 /* Extract another operand. It may be the RHS of this expression
9211 or the LHS of a new, higher priority expression. */
9216 /* Get another operator token. Look up its precedence to avoid
9217 building a useless (immediately popped) stack entry for common
9218 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9225 {
9226 /* ... and prepare to parse the RHS of the new, higher priority
9227 expression. Since precedence levels on the stack are
9228 monotonically increasing, we do not have to care about
9229 stack overflows. */
9238 pop:
9240 /* If the stack is not empty, we have parsed into LHS the right side
9241 (`4' in the example above) of an expression we had suspended.
9242 We can use the information on the stack to recover the LHS (`3')
9243 from the stack together with the tree code (`MULT_EXPR'), and
9244 the precedence of the higher level subexpression
9245 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9246 which will be used to actually build the additive expression. */
9251 }
9253 /* Undo the disabling of warnings done above. */
9255 c_inhibit_evaluation_warnings -=
9258 c_inhibit_evaluation_warnings -=
9264 /* Avoid warning for !!x == y. */
9269 /* Avoid warning for !b == y where b is boolean. */
9273 /* Avoid warning for !!b == y where b is boolean. */
9286 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9287 ERROR_MARK for everything that is not a binary expression.
9288 This makes warn_about_parentheses miss some warnings that
9289 involve unary operators. For unary expressions we should
9290 pass the correct tree_code unless the unary expression was
9291 surrounded by parentheses.
9292 */
9299 == tcc_comparison
9302 else
9303 {
9308 /* TODO: build_x_binary_op doesn't always honor the location. */
9310 }
9313 /* If the binary operator required the use of an overloaded operator,
9314 then this expression cannot be an integral constant-expression.
9315 An overloaded operator can be used even if both operands are
9316 otherwise permissible in an integral constant-expression if at
9317 least one of the operands is of enumeration type. */
9321 NIC_OVERLOADED))
9323 }
9326 }
9328 static cp_expr
9333 {
9336 }
9338 /* Parse the `? expression : assignment-expression' part of a
9339 conditional-expression. The LOGICAL_OR_EXPR is the
9340 logical-or-expression that started the conditional-expression.
9341 Returns a representation of the entire conditional-expression.
9343 This routine is used by cp_parser_assignment_expression.
9345 ? expression : assignment-expression
9347 GNU Extensions:
9349 ? : assignment-expression */
9351 static tree
9353 {
9355 cp_expr assignment_expr;
9359 /* Consume the `?' token. */
9364 {
9367 /* Implicit true clause. */
9369 c_inhibit_evaluation_warnings +=
9372 }
9373 else
9374 {
9377 /* Parse the expression. */
9378 c_inhibit_evaluation_warnings +=
9381 c_inhibit_evaluation_warnings +=
9385 }
9387 /* The next token should be a `:'. */
9389 /* Parse the assignment-expression. */
9391 c_inhibit_evaluation_warnings -=
9394 /* Make a location:
9395 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9396 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9397 with the caret at the "?", ranging from the start of
9398 the logical_or_expr to the end of the assignment_expr. */
9403 /* Build the conditional-expression. */
9405 expr,
9406 assignment_expr,
9407 tf_warning_or_error);
9408 }
9410 /* Parse an assignment-expression.
9412 assignment-expression:
9413 conditional-expression
9414 logical-or-expression assignment-operator assignment_expression
9415 throw-expression
9417 CAST_P is true if this expression is the target of a cast.
9418 DECLTYPE_P is true if this expression is the operand of decltype.
9420 Returns a representation for the expression. */
9422 static cp_expr
9425 {
9426 cp_expr expr;
9428 /* If the next token is the `throw' keyword, then we're looking at
9429 a throw-expression. */
9432 /* Otherwise, it must be that we are looking at a
9433 logical-or-expression. */
9434 else
9435 {
9436 /* Parse the binary expressions (logical-or-expression). */
9438 decltype_p,
9440 /* If the next token is a `?' then we're actually looking at a
9441 conditional-expression. */
9444 else
9445 {
9448 /* If it's an assignment-operator, we're using the second
9449 production. */
9450 enum tree_code assignment_operator
9453 {
9456 /* Parse the right-hand side of the assignment. */
9463 /* An assignment may not appear in a
9464 constant-expression. */
9466 NIC_ASSIGNMENT))
9468 /* Build the assignment expression. Its default
9469 location:
9470 LHS = RHS
9471 ~~~~^~~~~
9472 is the location of the '=' token as the
9473 caret, ranging from the start of the lhs to the
9474 end of the rhs. */
9479 assignment_operator,
9480 rhs,
9482 /* TODO: build_x_modify_expr doesn't honor the location,
9483 so we must set it here. */
9485 }
9486 }
9487 }
9490 }
9492 /* Parse an (optional) assignment-operator.
9494 assignment-operator: one of
9495 = *= /= %= += -= >>= <<= &= ^= |=
9497 GNU Extension:
9499 assignment-operator: one of
9500 <?= >?=
9502 If the next token is an assignment operator, the corresponding tree
9503 code is returned, and the token is consumed. For example, for
9504 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9505 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9506 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9507 operator, ERROR_MARK is returned. */
9509 static enum tree_code
9511 {
9515 /* Peek at the next token. */
9519 {
9565 /* Nothing else is an assignment operator. */
9567 }
9569 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9574 /* If it was an assignment operator, consume it. */
9579 }
9581 /* Parse an expression.
9583 expression:
9584 assignment-expression
9585 expression , assignment-expression
9587 CAST_P is true if this expression is the target of a cast.
9588 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9589 except possibly parenthesized or on the RHS of a comma (N3276).
9591 Returns a representation of the expression. */
9593 static cp_expr
9596 {
9601 {
9602 cp_expr assignment_expression;
9604 /* Parse the next assignment-expression. */
9605 assignment_expression
9608 /* We don't create a temporary for a call that is the immediate operand
9609 of decltype or on the RHS of a comma. But when we see a comma, we
9610 need to create a temporary for a call on the LHS. */
9615 assignment_expression
9619 /* If this is the first assignment-expression, we can just
9620 save it away. */
9623 else
9624 {
9625 /* Create a location with caret at the comma, ranging
9626 from the start of the LHS to the end of the RHS. */
9631 assignment_expression,
9634 }
9635 /* If the next token is not a comma, or we're in a fold-expression, then
9636 we are done with the expression. */
9640 /* Consume the `,'. */
9643 /* A comma operator cannot appear in a constant-expression. */
9646 }
9649 }
9651 /* Parse a constant-expression.
9653 constant-expression:
9654 conditional-expression
9656 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9657 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9658 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9659 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9660 only parse a conditional-expression, otherwise parse an
9661 assignment-expression. See below for rationale. */
9663 static cp_expr
9668 {
9672 cp_expr expression;
9674 /* It might seem that we could simply parse the
9675 conditional-expression, and then check to see if it were
9676 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9677 one that the compiler can figure out is constant, possibly after
9678 doing some simplifications or optimizations. The standard has a
9679 precise definition of constant-expression, and we must honor
9680 that, even though it is somewhat more restrictive.
9682 For example:
9684 int i[(2, 3)];
9686 is not a legal declaration, because `(2, 3)' is not a
9687 constant-expression. The `,' operator is forbidden in a
9688 constant-expression. However, GCC's constant-folding machinery
9689 will fold this operation to an INTEGER_CST for `3'. */
9691 /* Save the old settings. */
9693 saved_allow_non_integral_constant_expression_p
9696 /* We are now parsing a constant-expression. */
9698 parser->allow_non_integral_constant_expression_p
9701 /* Although the grammar says "conditional-expression", when not STRICT_P,
9702 we parse an "assignment-expression", which also permits
9703 "throw-expression" and the use of assignment operators. In the case
9704 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9705 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9706 actually essential that we look for an assignment-expression.
9707 For example, cp_parser_initializer_clauses uses this function to
9708 determine whether a particular assignment-expression is in fact
9709 constant. */
9711 {
9712 /* Parse the binary expressions (logical-or-expression). */
9715 /* If the next token is a `?' then we're actually looking at
9716 a conditional-expression; otherwise we're done. */
9719 }
9720 else
9722 /* Restore the old settings. */
9723 parser->integral_constant_expression_p
9725 parser->allow_non_integral_constant_expression_p
9728 {
9729 /* Require an rvalue constant expression here; that's what our
9730 callers expect. Reference constant expressions are handled
9731 separately in e.g. cp_parser_template_argument. */
9740 }
9743 parser->non_integral_constant_expression_p
9747 }
9749 /* Parse __builtin_offsetof.
9751 offsetof-expression:
9752 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9754 offsetof-member-designator:
9755 id-expression
9756 | offsetof-member-designator "." id-expression
9757 | offsetof-member-designator "[" expression "]"
9758 | offsetof-member-designator "->" id-expression */
9760 static cp_expr
9762 {
9764 tree type;
9765 cp_expr expr;
9766 cp_id_kind dummy;
9768 location_t finish_loc;
9770 /* We're about to accept non-integral-constant things, but will
9771 definitely yield an integral constant expression. Save and
9772 restore these values around our local parsing. */
9778 /* Consume the "__builtin_offsetof" token. */
9780 /* Consume the opening `('. */
9781 matching_parens parens;
9783 /* Parse the type-id. */
9786 /* Look for the `,'. */
9790 /* Build the (type *)null that begins the traditional offsetof macro. */
9791 tree object_ptr
9793 tf_warning_or_error);
9795 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9799 {
9802 {
9804 /* offsetof-member-designator "[" expression "]" */
9810 /* offsetof-member-designator "->" identifier */
9813 /* FALLTHRU */
9816 /* offsetof-member-designator "." identifier */
9824 /* Consume the ")" token. */
9830 /* Error. We know the following require will fail, but
9831 that gives the proper error message. */
9836 }
9837 }
9839 success:
9840 /* Make a location of the form:
9841 __builtin_offsetof (struct s, f)
9842 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9843 with caret at the type-id, ranging from the start of the
9844 "_builtin_offsetof" token to the close paren. */
9846 /* The result will be an INTEGER_CST, so we need to explicitly
9847 preserve the location. */
9850 failure:
9856 }
9858 /* Parse a trait expression.
9860 Returns a representation of the expression, the underlying type
9861 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9863 static cp_expr
9865 {
9866 cp_trait_kind kind;
9872 {
9974 }
9976 /* Get location of initial token. */
9979 /* Consume the token. */
9982 matching_parens parens;
9985 {
9988 }
9994 {
9997 {
10000 }
10004 }
10006 {
10008 {
10012 {
10015 }
10019 }
10020 }
10025 /* Construct a location of the form:
10026 __is_trivially_copyable(_Tp)
10027 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10028 with start == caret, finishing at the close-paren. */
10031 /* Complete the trait expression, which may mean either processing
10032 the trait expr now or saving it for template instantiation. */
10034 {
10043 }
10044 }
10046 /* Parse a lambda expression.
10048 lambda-expression:
10049 lambda-introducer lambda-declarator [opt] compound-statement
10051 Returns a representation of the expression. */
10053 static cp_expr
10055 {
10057 tree type;
10065 {
10067 {
10071 }
10073 }
10075 {
10077 {
10080 }
10082 }
10084 /* We may be in the middle of deferred access check. Disable
10085 it now. */
10096 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10099 /* Now that we've started the type, add the capture fields for any
10100 explicit captures. */
10103 {
10104 /* Inside the class, surrounding template-parameter-lists do not apply. */
10105 unsigned int saved_num_template_parameter_lists
10109 bool fully_implicit_function_template_p
10113 bool auto_is_implicit_function_template_parm_p
10124 /* By virtue of defining a local class, a lambda expression has access to
10125 the private variables of enclosing classes. */
10133 {
10138 }
10140 {
10143 }
10145 /* The capture list was built up in reverse order; fix that now. */
10157 parser->fully_implicit_function_template_p
10161 parser->auto_is_implicit_function_template_parm_p
10163 }
10165 /* This field is only used during parsing of the lambda. */
10168 /* This lambda shouldn't have any proxies left at this point. */
10170 /* And now that we're done, push proxies for an enclosing lambda. */
10175 else
10183 }
10185 /* Parse the beginning of a lambda expression.
10187 lambda-introducer:
10188 [ lambda-capture [opt] ]
10190 LAMBDA_EXPR is the current representation of the lambda expression. */
10192 static void
10194 {
10195 /* Need commas after the first capture. */
10198 /* Eat the leading `['. */
10201 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10209 {
10212 }
10215 {
10217 tree capture_id;
10218 tree capture_init_expr;
10222 enum capture_kind_type
10223 {
10224 BY_COPY,
10225 BY_REFERENCE
10226 };
10230 {
10233 }
10237 else
10240 /* Possibly capture `this'. */
10242 {
10253 explicit_init_p);
10255 }
10257 /* Possibly capture `*this'. */
10260 {
10271 explicit_init_p);
10273 }
10275 /* Remember whether we want to capture as a reference or not. */
10277 {
10280 }
10282 /* Get the identifier. */
10287 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10288 delimiters, but I modified this to stop on unnested ']' as well. It
10289 was already changed to stop on unnested '}', so the
10290 "closing_parenthesis" name is no more misleading with my change. */
10291 {
10297 }
10299 /* Find the initializer for this capture. */
10303 {
10305 /* An explicit initializer exists. */
10308 "lambda capture initializers "
10314 {
10317 }
10318 }
10319 else
10320 {
10323 /* Turn the identifier into an id-expression. */
10324 capture_init_expr
10329 {
10332 }
10336 {
10339 capture_init_expr);
10343 }
10346 {
10349 capture_init_expr))
10353 }
10355 capture_init_expr
10356 = finish_id_expression
10358 capture_init_expr,
10372 {
10375 }
10376 else
10378 }
10382 {
10387 capture_id);
10391 "capture of %qD redundant with by-reference capture "
10393 }
10396 capture_id,
10397 capture_init_expr,
10399 explicit_init_p);
10400 }
10403 }
10405 /* Parse the (optional) middle of a lambda expression.
10407 lambda-declarator:
10408 < template-parameter-list [opt] >
10409 ( parameter-declaration-clause [opt] )
10410 attribute-specifier [opt]
10411 decl-specifier-seq [opt]
10412 exception-specification [opt]
10413 lambda-return-type-clause [opt]
10415 LAMBDA_EXPR is the current representation of the lambda expression. */
10417 static bool
10419 {
10420 /* 5.1.1.4 of the standard says:
10421 If a lambda-expression does not include a lambda-declarator, it is as if
10422 the lambda-declarator were ().
10423 This means an empty parameter list, no attributes, and no exception
10424 specification. */
10431 cp_decl_specifier_seq lambda_specs;
10434 /* The template-parameter-list is optional, but must begin with
10435 an opening angle if present. */
10437 {
10440 "lambda templates are only available with "
10444 "lambda templates are only available with "
10453 /* We just processed one more parameter list. */
10455 }
10457 /* The parameter-declaration-clause is optional (unless
10458 template-parameter-list was given), but must begin with an
10459 opening parenthesis if present. */
10461 {
10462 matching_parens parens;
10467 /* Parse parameters. */
10470 /* Default arguments shall not be specified in the
10471 parameter-declaration-clause of a lambda-declarator. */
10482 /* In the decl-specifier-seq of the lambda-declarator, each
10483 decl-specifier shall either be mutable or constexpr. */
10487 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10490 {
10495 }
10499 /* Parse optional exception specification. */
10502 /* Parse optional trailing return type. */
10504 {
10507 }
10509 /* The function parameters must be in scope all the way until after the
10510 trailing-return-type in case of decltype. */
10512 }
10516 /* Create the function call operator.
10518 Messing with declarators like this is no uglier than building up the
10519 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10520 other code. */
10521 {
10522 cp_decl_specifier_seq return_type_specs;
10524 tree fco;
10531 else
10532 /* Maybe we will deduce the return type later. */
10536 {
10540 else
10543 }
10552 VIRT_SPEC_UNSPECIFIED,
10553 REF_QUAL_NONE,
10554 tx_qual,
10555 exception_spec,
10561 declarator,
10562 attributes);
10564 {
10567 /* Give the object parameter a different name. */
10571 }
10573 {
10577 }
10586 }
10587 }
10589 /* Parse the body of a lambda expression, which is simply
10591 compound-statement
10593 but which requires special handling.
10594 LAMBDA_EXPR is the current representation of the lambda expression. */
10596 static void
10598 {
10605 else
10606 /* Still increment function_depth so that we don't GC in the
10607 middle of an expression. */
10612 /* Clear this in case we're in the middle of a default argument. */
10616 {
10620 matching_braces braces;
10623 {
10626 /* Originally C++11 required us to peek for 'return expr'; and
10627 process it specially here to deduce the return type. N3638
10628 removed the need for that. */
10636 }
10639 }
10646 else
10648 }
10650 /* Statements [gram.stmt.stmt] */
10652 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10654 static void
10656 {
10663 }
10665 /* Parse a statement.
10667 statement:
10668 labeled-statement
10669 expression-statement
10670 compound-statement
10671 selection-statement
10672 iteration-statement
10673 jump-statement
10674 declaration-statement
10675 try-block
10677 C++11:
10679 statement:
10680 labeled-statement
10681 attribute-specifier-seq (opt) expression-statement
10682 attribute-specifier-seq (opt) compound-statement
10683 attribute-specifier-seq (opt) selection-statement
10684 attribute-specifier-seq (opt) iteration-statement
10685 attribute-specifier-seq (opt) jump-statement
10686 declaration-statement
10687 attribute-specifier-seq (opt) try-block
10689 init-statement:
10690 expression-statement
10691 simple-declaration
10693 TM Extension:
10695 statement:
10696 atomic-statement
10698 IN_COMPOUND is true when the statement is nested inside a
10699 cp_parser_compound_statement; this matters for certain pragmas.
10701 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10702 is a (possibly labeled) if statement which is not enclosed in braces
10703 and has an else clause. This is used to implement -Wparentheses.
10705 CHAIN is a vector of if-else-if conditions. */
10707 static void
10711 {
10716 restart:
10719 /* There is no statement yet. */
10725 /* In obj-c++, seeing '[[' might be the either the beginning of
10726 c++11 attributes, or a nested objc-message-expression. So
10727 let's parse the c++11 attributes tentatively. */
10731 {
10734 }
10736 /* Peek at the next token. */
10738 /* Remember the location of the first token in the statement. */
10741 /* If this is a keyword, then that will often determine what kind of
10742 statement we have. */
10744 {
10748 {
10751 /* Looks like a labeled-statement with a case label.
10752 Parse the label, and then use tail recursion to parse
10753 the statement. */
10776 /* Objective-C++ exception-handling constructs. */
10790 /* This must be a namespace alias definition. */
10806 /* It might be a keyword like `int' that can start a
10807 declaration-statement. */
10809 }
10810 }
10812 {
10813 /* If the next token is a `:', then we are looking at a
10814 labeled-statement. */
10817 {
10818 /* Looks like a labeled-statement with an ordinary label.
10819 Parse the label, and then use tail recursion to parse
10820 the statement. */
10825 }
10826 }
10827 /* Anything that starts with a `{' must be a compound-statement. */
10830 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10831 a statement all its own. */
10833 {
10834 /* Only certain OpenMP pragmas are attached to statements, and thus
10835 are considered statements themselves. All others are not. In
10836 the context of a compound, accept the pragma as a "statement" and
10837 return so that we can check for a close brace. Otherwise we
10838 require a real statement and must go back and read one. */
10844 }
10846 {
10849 }
10851 /* Everything else must be a declaration-statement or an
10852 expression-statement. Try for the declaration-statement
10853 first, unless we are looking at a `;', in which case we know that
10854 we have an expression-statement. */
10856 {
10858 {
10860 {
10861 /* Attributes should be parsed as part of the the
10862 declaration, so let's un-parse them. */
10865 }
10868 /* Try to parse the declaration-statement. */
10870 /* If that worked, we're done. */
10873 }
10874 /* All preceding labels have been parsed at this point. */
10878 /* Look for an expression-statement instead. */
10881 /* Handle [[fallthrough]];. */
10883 {
10884 /* The next token after the fallthrough attribute is ';'. */
10886 {
10887 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10889 IFN_FALLTHROUGH,
10892 }
10893 else
10897 }
10898 }
10900 /* Set the line number for the statement. */
10904 /* Allow "[[fallthrough]];", but warn otherwise. */
10907 OPT_Wattributes,
10909 }
10911 /* Parse the label for a labeled-statement, i.e.
10913 identifier :
10914 case constant-expression :
10915 default :
10917 GNU Extension:
10918 case constant-expression ... constant-expression : statement
10920 When a label is parsed without errors, the label is added to the
10921 parse tree by the finish_* functions, so this function doesn't
10922 have to return the label. */
10924 static void
10926 {
10931 /* The next token should be an identifier. */
10935 {
10938 }
10940 /* Remember whether this case or a user-defined label is allowed to fall
10941 through to. */
10946 {
10948 {
10952 /* Consume the `case' token. */
10954 /* Parse the constant-expression. */
10961 {
10962 /* Consume the `...' token. */
10968 /* We don't need to emit warnings here, as the common code
10969 will do this for us. */
10970 }
10971 else
10975 {
10979 }
10980 else
10983 expr);
10984 }
10988 /* Consume the `default' token. */
10992 {
10996 }
10997 else
11002 /* Anything else must be an ordinary label. */
11007 }
11009 /* Require the `:' token. */
11012 /* An ordinary label may optionally be followed by attributes.
11013 However, this is only permitted if the attributes are then
11014 followed by a semicolon. This is because, for backward
11015 compatibility, when parsing
11016 lab: __attribute__ ((unused)) int i;
11017 we want the attribute to attach to "i", not "lab". */
11020 {
11021 tree attrs;
11028 ;
11029 else
11031 }
11037 }
11039 /* Parse an expression-statement.
11041 expression-statement:
11042 expression [opt] ;
11044 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11045 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11046 indicates whether this expression-statement is part of an
11047 expression statement. */
11049 static tree
11051 {
11056 /* There might be attribute fallthrough. */
11059 /* If the next token is a ';', then there is no expression
11060 statement. */
11062 {
11066 {
11069 }
11070 }
11072 /* Handle [[fallthrough]];. */
11074 {
11075 /* The next token after the fallthrough attribute is ';'. */
11077 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11080 else
11084 }
11086 /* Allow "[[fallthrough]];", but warn otherwise. */
11091 /* Give a helpful message for "A<T>::type t;" and the like. */
11094 {
11101 {
11102 /* A::A a; */
11107 }
11108 }
11110 /* Consume the final `;'. */
11115 /* This is the final expression statement of a statement
11116 expression. */
11122 }
11124 /* Parse a compound-statement.
11126 compound-statement:
11127 { statement-seq [opt] }
11129 GNU extension:
11131 compound-statement:
11132 { label-declaration-seq [opt] statement-seq [opt] }
11134 label-declaration-seq:
11135 label-declaration
11136 label-declaration-seq label-declaration
11138 Returns a tree representing the statement. */
11140 static tree
11143 {
11144 tree compound_stmt;
11145 matching_braces braces;
11147 /* Consume the `{'. */
11154 /* Begin the compound-statement. */
11156 /* If the next keyword is `__label__' we have a label declaration. */
11159 /* Parse an (optional) statement-seq. */
11161 /* Finish the compound-statement. */
11163 /* Consume the `}'. */
11167 }
11169 /* Parse an (optional) statement-seq.
11171 statement-seq:
11172 statement
11173 statement-seq [opt] statement */
11175 static void
11177 {
11178 /* Scan statements until there aren't any more. */
11180 {
11183 /* If we are looking at a `}', then we have run out of
11184 statements; the same is true if we have reached the end
11185 of file, or have stumbled upon a stray '@end'. */
11192 /* If we are in a compound statement and find 'else' then
11193 something went wrong. */
11195 {
11198 else
11199 {
11202 }
11203 }
11205 /* Parse the statement. */
11207 }
11208 }
11210 /* Return true if we're looking at (init; cond), false otherwise. */
11212 static bool
11214 {
11215 /* Save tokens so that we can put them back. */
11218 /* Look for ';' that is not nested in () or {}. */
11221 CPP_SEMICOLON,
11224 /* Roll back the tokens we skipped. */
11228 }
11230 /* Parse a selection-statement.
11232 selection-statement:
11233 if ( init-statement [opt] condition ) statement
11234 if ( init-statement [opt] condition ) statement else statement
11235 switch ( init-statement [opt] condition ) statement
11237 Returns the new IF_STMT or SWITCH_STMT.
11239 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11240 is a (possibly labeled) if statement which is not enclosed in
11241 braces and has an else clause. This is used to implement
11242 -Wparentheses.
11244 CHAIN is a vector of if-else-if conditions. This is used to implement
11245 -Wduplicated-cond. */
11247 static tree
11250 {
11253 token_indent_info guard_tinfo;
11258 /* Peek at the next token. */
11262 /* See what kind of keyword it is. */
11265 {
11268 {
11269 tree statement;
11270 tree condition;
11275 RID_CONSTEXPR))
11276 {
11282 }
11284 /* Look for the `('. */
11285 matching_parens parens;
11287 {
11290 }
11292 /* Begin the selection-statement. */
11294 {
11297 }
11298 else
11301 /* Parse the optional init-statement. */
11303 {
11304 tree decl;
11307 "init-statement in selection statements only available "
11310 }
11312 /* Parse the condition. */
11314 /* Look for the `)'. */
11320 {
11324 /* Add the condition. */
11331 /* Parse the then-clause. */
11335 /* Outside a template, the non-selected branch of a constexpr
11336 if is a 'discarded statement', i.e. unevaluated. */
11341 {
11344 }
11347 guard_tinfo);
11354 {
11358 }
11360 /* If the next token is `else', parse the else-clause. */
11362 RID_ELSE))
11363 {
11367 {
11370 }
11372 guard_tinfo
11374 /* Consume the `else' keyword. */
11377 {
11379 RID_IF)
11381 {
11382 /* We've got "if (COND) else if (COND2)". Start
11383 the condition chain and add COND as the first
11384 element. */
11388 {
11389 /* Wrap it in a NOP_EXPR so that we can set the
11390 location of the condition. */
11392 condition);
11395 }
11396 }
11398 RID_IF))
11399 {
11400 /* This is if-else without subsequent if. Zap the
11401 condition chain; we would have already warned at
11402 this point. */
11405 }
11406 }
11408 /* Parse the else-clause. */
11414 /* If we are currently parsing a then-clause, then
11415 IF_P will not be NULL. We set it to true to
11416 indicate that this if statement has an else clause.
11417 This may trigger the Wparentheses warning below
11418 when we get back up to the parent if statement. */
11423 {
11427 }
11428 }
11429 else
11430 {
11431 /* This if statement does not have an else clause. If
11432 NESTED_IF is true, then the then-clause has an if
11433 statement which does have an else clause. We warn
11434 about the potential ambiguity. */
11437 "suggest explicit braces to avoid ambiguous"
11440 {
11441 /* We don't need the condition chain anymore. */
11444 }
11445 }
11447 /* Now we're all done with the if-statement. */
11449 }
11450 else
11451 {
11455 /* Add the condition. */
11458 /* Parse the body of the switch-statement. */
11464 guard_tinfo);
11468 /* Now we're all done with the switch-statement. */
11470 }
11473 }
11479 }
11480 }
11482 /* Parse a condition.
11484 condition:
11485 expression
11486 type-specifier-seq declarator = initializer-clause
11487 type-specifier-seq declarator braced-init-list
11489 GNU Extension:
11491 condition:
11492 type-specifier-seq declarator asm-specification [opt]
11493 attributes [opt] = assignment-expression
11495 Returns the expression that should be tested. */
11497 static tree
11499 {
11500 cp_decl_specifier_seq type_specifiers;
11504 /* Try the declaration first. */
11506 /* New types are not allowed in the type-specifier-seq for a
11507 condition. */
11509 parser->type_definition_forbidden_message
11511 /* Parse the type-specifier-seq. */
11513 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11516 /* Restore the saved message. */
11518 /* If all is well, we might be looking at a declaration. */
11520 {
11521 tree decl;
11522 tree asm_specification;
11523 tree attributes;
11527 /* Parse the declarator. */
11533 /* Parse the attributes. */
11535 /* Parse the asm-specification. */
11537 /* If the next token is not an `=' or '{', then we might still be
11538 looking at an expression. For example:
11540 if (A(a).x)
11542 looks like a decl-specifier-seq and a declarator -- but then
11543 there is no `=', so this is an expression. */
11548 /* If we did see an `=' or '{', then we are looking at a declaration
11549 for sure. */
11551 {
11552 tree pushed_scope;
11556 /* Create the declaration. */
11562 /* Parse the initializer. */
11564 {
11568 }
11569 else
11570 {
11571 /* Consume the `='. */
11574 }
11578 /* Process the initializer. */
11581 asm_specification,
11582 flags);
11588 }
11589 }
11590 /* If we didn't even get past the declarator successfully, we are
11591 definitely not looking at a declaration. */
11592 else
11595 /* Otherwise, we are looking at an expression. */
11597 }
11599 /* Parses a for-statement or range-for-statement until the closing ')',
11600 not included. */
11602 static tree
11604 {
11608 /* Begin the for-statement. */
11611 /* Parse the initialization. */
11616 else
11618 }
11620 static tree
11623 {
11624 /* Normal for loop */
11627 tree stmt;
11630 /* The init-statement has already been parsed in
11631 cp_parser_init_statement, so no work is needed here. */
11634 /* If there's a condition, process it. */
11638 {
11642 }
11644 {
11648 }
11650 /* Look for the `;'. */
11653 /* If there's an expression, process it. */
11659 }
11661 /* Tries to parse a range-based for-statement:
11663 range-based-for:
11664 decl-specifier-seq declarator : expression
11666 The decl-specifier-seq declarator and the `:' are already parsed by
11667 cp_parser_init_statement. If processing_template_decl it returns a
11668 newly created RANGE_FOR_STMT; if not, it is converted to a
11669 regular FOR_STMT. */
11671 static tree
11674 {
11681 /* Get the range declaration momentarily out of the way so that
11682 the range expression doesn't clash with it. */
11684 {
11686 {
11688 /* For decomposition declaration get all of the corresponding
11689 declarations out of the way. */
11693 {
11699 {
11705 }
11706 }
11707 }
11709 {
11714 }
11715 }
11718 {
11721 }
11722 else
11725 /* Put the range declaration(s) back into scope. */
11727 {
11731 }
11733 /* If in template, STMT is converted to a normal for-statement
11734 at instantiation. If not, it is done just ahead. */
11736 {
11746 /* do_auto_deduction doesn't mess with template init-lists. */
11749 }
11750 else
11751 {
11755 unroll);
11756 }
11758 }
11760 /* Subroutine of cp_convert_range_for: given the initializer expression,
11761 builds up the range temporary. */
11763 static tree
11765 {
11768 /* Find out the type deduced by the declaration
11769 `auto &&__range = range_expr'. */
11774 /* Create the __range variable. */
11781 }
11783 /* Used by cp_parser_range_for in template context: we aren't going to
11784 do a full conversion yet, but we still need to resolve auto in the
11785 type of the for-range-declaration if present. This is basically
11786 a shortcut version of cp_convert_range_for. */
11788 static void
11790 {
11793 {
11796 iter_type = (cp_parser_perform_range_for_lookup
11799 {
11801 iter_type);
11803 RO_UNARY_STAR,
11804 tf_warning_or_error);
11807 }
11808 }
11809 }
11811 /* Converts a range-based for-statement into a normal
11812 for-statement, as per the definition.
11814 for (RANGE_DECL : RANGE_EXPR)
11815 BLOCK
11817 should be equivalent to:
11819 {
11820 auto &&__range = RANGE_EXPR;
11821 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11822 __begin != __end;
11823 ++__begin)
11824 {
11825 RANGE_DECL = *__begin;
11826 BLOCK
11827 }
11828 }
11830 If RANGE_EXPR is an array:
11831 BEGIN_EXPR = __range
11832 END_EXPR = __range + ARRAY_SIZE(__range)
11833 Else if RANGE_EXPR has a member 'begin' or 'end':
11834 BEGIN_EXPR = __range.begin()
11835 END_EXPR = __range.end()
11836 Else:
11837 BEGIN_EXPR = begin(__range)
11838 END_EXPR = end(__range);
11840 If __range has a member 'begin' but not 'end', or vice versa, we must
11841 still use the second alternative (it will surely fail, however).
11842 When calling begin()/end() in the third alternative we must use
11843 argument dependent lookup, but always considering 'std' as an associated
11844 namespace. */
11846 tree
11850 {
11858 /* If an error happened previously do nothing or else a lot of
11859 unhelpful errors would be issued. */
11861 else
11862 {
11863 tree range_temp;
11867 /* Can't bind a reference to an array of runtime bound. */
11869 else
11870 {
11875 LOOKUP_ONLYCONVERTING);
11877 }
11880 }
11882 /* The new for initialization statement. */
11890 LOOKUP_ONLYCONVERTING);
11901 LOOKUP_ONLYCONVERTING);
11905 /* The new for condition. */
11912 /* The new increment expression. */
11915 tf_warning_or_error);
11921 /* The declaration is initialized with *__begin inside the loop body. */
11924 tf_warning_or_error),
11926 LOOKUP_ONLYCONVERTING);
11931 }
11933 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11934 We need to solve both at the same time because the method used
11935 depends on the existence of members begin or end.
11936 Returns the type deduced for the iterator expression. */
11938 static tree
11940 {
11942 {
11945 }
11948 {
11953 }
11955 {
11956 /* If RANGE is an array, we will use pointer arithmetic. */
11959 range,
11963 }
11964 else
11965 {
11966 /* If it is not an array, we must do a bit of magic. */
11976 tf_warning_or_error);
11979 tf_warning_or_error);
11982 {
11983 /* Use the member functions. */
11986 else
11992 else
11995 }
11996 else
11997 {
11998 /* Use global functions with ADL. */
12005 tf_warning_or_error);
12007 tf_warning_or_error);
12009 tf_warning_or_error);
12011 tf_warning_or_error);
12014 }
12016 /* Last common checks. */
12018 {
12019 /* If one of the expressions is an error do no more checks. */
12022 }
12025 /* Can happen, when, eg, in a template context, Koenig lookup
12026 can't resolve begin/end (c++/58503). */
12028 else
12029 {
12031 /* The unqualified type of the __begin and __end temporaries should
12032 be the same, as required by the multiple auto declaration. */
12034 {
12041 /* P0184R0 allows __begin and __end to have different types,
12042 but make sure they are comparable so we can give a better
12044 else
12048 }
12050 }
12051 }
12052 }
12054 /* Helper function for cp_parser_perform_range_for_lookup.
12055 Builds a tree for RANGE.IDENTIFIER(). */
12057 static tree
12059 {
12072 tf_warning_or_error);
12075 }
12077 /* Parse an iteration-statement.
12079 iteration-statement:
12080 while ( condition ) statement
12081 do statement while ( expression ) ;
12082 for ( init-statement condition [opt] ; expression [opt] )
12083 statement
12085 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12087 static tree
12090 {
12093 tree statement;
12095 token_indent_info guard_tinfo;
12097 /* Peek at the next token. */
12104 /* Remember whether or not we are already within an iteration
12105 statement. */
12108 /* See what kind of keyword it is. */
12111 {
12113 {
12114 tree condition;
12116 /* Begin the while-statement. */
12118 /* Look for the `('. */
12119 matching_parens parens;
12121 /* Parse the condition. */
12124 /* Look for the `)'. */
12126 /* Parse the dependent statement. */
12132 /* We're done with the while-statement. */
12134 }
12138 {
12139 tree expression;
12141 /* Begin the do-statement. */
12143 /* Parse the body of the do-statement. */
12150 /* Look for the `while' keyword. */
12152 /* Look for the `('. */
12153 matching_parens parens;
12155 /* Parse the expression. */
12157 /* We're done with the do-statement. */
12159 /* Look for the `)'. */
12161 /* Look for the `;'. */
12163 }
12167 {
12168 /* Look for the `('. */
12169 matching_parens parens;
12174 /* Look for the `)'. */
12177 /* Parse the body of the for-statement. */
12184 /* We're done with the for-statement. */
12186 }
12193 }
12196 }
12198 /* Parse a init-statement or the declarator of a range-based-for.
12199 Returns true if a range-based-for declaration is seen.
12201 init-statement:
12202 expression-statement
12203 simple-declaration */
12205 static bool
12207 {
12208 /* If the next token is a `;', then we have an empty
12209 expression-statement. Grammatically, this is also a
12210 simple-declaration, but an invalid one, because it does not
12211 declare anything. Therefore, if we did not handle this case
12212 specially, we would issue an error message about an invalid
12213 declaration. */
12215 {
12219 /* A colon is used in range-based for. */
12222 /* We're going to speculatively look for a declaration, falling back
12223 to an expression, if necessary. */
12225 /* Parse the declaration. */
12228 decl);
12231 {
12232 /* It is a range-for, consume the ':' */
12236 {
12238 "range-based %<for%> loops only available with "
12241 }
12242 }
12243 else
12244 /* The ';' is not consumed yet because we told
12245 cp_parser_simple_declaration not to. */
12250 /* If the tentative parse failed, then we shall need to look for an
12251 expression-statement. */
12252 }
12253 /* If we are here, it is an expression-statement. */
12256 }
12258 /* Parse a jump-statement.
12260 jump-statement:
12261 break ;
12262 continue ;
12263 return expression [opt] ;
12264 return braced-init-list ;
12265 goto identifier ;
12267 GNU extension:
12269 jump-statement:
12270 goto * expression ;
12272 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12274 static tree
12276 {
12282 /* Peek at the next token. */
12287 /* See what kind of keyword it is. */
12290 {
12294 {
12311 }
12317 {
12321 /* Fall through. */
12331 }
12336 {
12337 tree expr;
12341 {
12345 }
12348 else
12349 /* If the next token is a `;', then there is no
12350 expression. */
12352 /* Build the return-statement. */
12355 else
12357 /* Look for the final `;'. */
12359 }
12365 {
12368 }
12370 /* Create the goto-statement. */
12372 {
12373 /* Issue a warning about this use of a GNU extension. */
12375 /* Consume the '*' token. */
12377 /* Parse the dependent expression. */
12379 }
12380 else
12382 /* Look for the final `;'. */
12389 }
12392 }
12394 /* Parse a declaration-statement.
12396 declaration-statement:
12397 block-declaration */
12399 static void
12401 {
12404 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12407 /* Parse the block-declaration. */
12410 /* Free any declarators allocated. */
12412 }
12414 /* Some dependent statements (like `if (cond) statement'), are
12415 implicitly in their own scope. In other words, if the statement is
12416 a single statement (as opposed to a compound-statement), it is
12417 none-the-less treated as if it were enclosed in braces. Any
12418 declarations appearing in the dependent statement are out of scope
12419 after control passes that point. This function parses a statement,
12420 but ensures that is in its own scope, even if it is not a
12421 compound-statement.
12423 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12424 is a (possibly labeled) if statement which is not enclosed in
12425 braces and has an else clause. This is used to implement
12426 -Wparentheses.
12428 CHAIN is a vector of if-else-if conditions. This is used to implement
12429 -Wduplicated-cond.
12431 Returns the new statement. */
12433 static tree
12437 {
12438 tree statement;
12441 token_indent_info body_tinfo
12447 /* Mark if () ; with a special NOP_EXPR. */
12449 {
12460 }
12461 /* if a compound is opened, we simply parse the statement directly. */
12464 /* If the token is not a `{', then we must take special action. */
12465 else
12466 {
12467 /* Create a compound-statement. */
12469 /* Parse the dependent-statement. */
12472 /* Finish the dummy compound-statement. */
12474 }
12476 token_indent_info next_tinfo
12485 /* Return the statement. */
12487 }
12489 /* For some dependent statements (like `while (cond) statement'), we
12490 have already created a scope. Therefore, even if the dependent
12491 statement is a compound-statement, we do not want to create another
12492 scope. */
12494 static void
12497 {
12498 /* If the token is a `{', then we must take special action. */
12500 {
12501 token_indent_info body_tinfo
12507 token_indent_info next_tinfo
12516 }
12517 else
12518 {
12519 /* Avoid calling cp_parser_compound_statement, so that we
12520 don't create a new scope. Do everything else by hand. */
12521 matching_braces braces;
12523 /* If the next keyword is `__label__' we have a label declaration. */
12526 /* Parse an (optional) statement-seq. */
12529 }
12530 }
12532 /* Declarations [gram.dcl.dcl] */
12534 /* Parse an optional declaration-sequence.
12536 declaration-seq:
12537 declaration
12538 declaration-seq declaration */
12540 static void
12542 {
12544 {
12555 {
12556 /* A declaration consisting of a single semicolon is
12557 invalid. Allow it unless we're being pedantic. */
12562 }
12564 /* If we're entering or exiting a region that's implicitly
12565 extern "C", modify the lang context appropriately. */
12567 {
12570 }
12572 {
12575 }
12578 {
12579 /* A top-level declaration can consist solely of a #pragma.
12580 A nested declaration cannot, so this is done here and not
12581 in cp_parser_declaration. (A #pragma at block scope is
12582 handled in cp_parser_statement.) */
12585 }
12587 /* Parse the declaration itself. */
12589 }
12590 }
12592 /* Parse a declaration.
12594 declaration:
12595 block-declaration
12596 function-definition
12597 template-declaration
12598 explicit-instantiation
12599 explicit-specialization
12600 linkage-specification
12601 namespace-definition
12603 C++17:
12604 deduction-guide
12606 GNU extension:
12608 declaration:
12609 __extension__ declaration */
12611 static void
12613 {
12614 cp_token token1;
12615 cp_token token2;
12620 /* Check for the `__extension__' keyword. */
12622 {
12623 /* Parse the qualified declaration. */
12625 /* Restore the PEDANTIC flag. */
12629 }
12631 /* Try to figure out what kind of declaration is present. */
12636 else
12637 {
12640 }
12642 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12645 /* If the next token is `extern' and the following token is a string
12646 literal, then we have a linkage specification. */
12650 /* If the next token is `template', then we have either a template
12651 declaration, an explicit instantiation, or an explicit
12652 specialization. */
12654 {
12655 /* `template <>' indicates a template specialization. */
12659 /* `template <' indicates a template declaration. */
12662 /* Anything else must be an explicit instantiation. */
12663 else
12665 }
12666 /* If the next token is `export', then we have a template
12667 declaration. */
12670 /* If the next token is `extern', 'static' or 'inline' and the one
12671 after that is `template', we have a GNU extended explicit
12672 instantiation directive. */
12679 /* If the next token is `namespace', check for a named or unnamed
12680 namespace definition. */
12689 /* An unnamed namespace definition. */
12693 /* An inline (associated) namespace definition. */
12697 /* Objective-C++ declaration/definition. */
12704 /* At this point we may have a template declared by a concept
12705 introduction. */
12710 else
12711 /* Try to parse a block-declaration, or a function-definition. */
12714 /* Free any declarators allocated. */
12716 }
12718 /* Parse a block-declaration.
12720 block-declaration:
12721 simple-declaration
12722 asm-definition
12723 namespace-alias-definition
12724 using-declaration
12725 using-directive
12727 GNU Extension:
12729 block-declaration:
12730 __extension__ block-declaration
12732 C++0x Extension:
12734 block-declaration:
12735 static_assert-declaration
12737 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12738 part of a declaration-statement. */
12740 static void
12743 {
12747 /* Check for the `__extension__' keyword. */
12749 {
12750 /* Parse the qualified declaration. */
12752 /* Restore the PEDANTIC flag. */
12756 }
12758 /* Peek at the next token to figure out which kind of declaration is
12759 present. */
12762 /* If the next keyword is `asm', we have an asm-definition. */
12764 {
12768 }
12769 /* If the next keyword is `namespace', we have a
12770 namespace-alias-definition. */
12773 /* If the next keyword is `using', we have a
12774 using-declaration, a using-directive, or an alias-declaration. */
12776 {
12781 /* If the token after `using' is `namespace', then we have a
12782 using-directive. */
12786 /* If the second token after 'using' is '=', then we have an
12787 alias-declaration. */
12793 /* Otherwise, it's a using-declaration. */
12794 else
12797 }
12798 /* If the next keyword is `__label__' we have a misplaced label
12799 declaration. */
12801 {
12805 /* If the next token is now a `;', consume it. */
12808 }
12809 /* If the next token is `static_assert' we have a static assertion. */
12812 /* Anything else must be a simple-declaration. */
12813 else
12816 }
12818 /* Parse a simple-declaration.
12820 simple-declaration:
12821 decl-specifier-seq [opt] init-declarator-list [opt] ;
12822 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12823 brace-or-equal-initializer ;
12825 init-declarator-list:
12826 init-declarator
12827 init-declarator-list , init-declarator
12829 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12830 function-definition as a simple-declaration.
12832 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12833 parsed declaration if it is an uninitialized single declarator not followed
12834 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12835 if present, will not be consumed. */
12837 static void
12841 {
12842 cp_decl_specifier_seq decl_specifiers;
12851 /* Defer access checks until we know what is being declared; the
12852 checks for names appearing in the decl-specifier-seq should be
12853 done as if we were in the scope of the thing being declared. */
12856 /* Parse the decl-specifier-seq. We have to keep track of whether
12857 or not the decl-specifier-seq declares a named class or
12858 enumeration type, since that is the only case in which the
12859 init-declarator-list is allowed to be empty.
12861 [dcl.dcl]
12863 In a simple-declaration, the optional init-declarator-list can be
12864 omitted only when declaring a class or enumeration, that is when
12865 the decl-specifier-seq contains either a class-specifier, an
12866 elaborated-type-specifier, or an enum-specifier. */
12868 CP_PARSER_FLAGS_OPTIONAL,
12871 /* We no longer need to defer access checks. */
12874 /* In a block scope, a valid declaration must always have a
12875 decl-specifier-seq. By not trying to parse declarators, we can
12876 resolve the declaration/expression ambiguity more quickly. */
12879 {
12882 }
12884 /* If the next two tokens are both identifiers, the code is
12885 erroneous. The usual cause of this situation is code like:
12887 T t;
12889 where "T" should name a type -- but does not. */
12892 {
12893 /* If parsing tentatively, we should commit; we really are
12894 looking at a declaration. */
12896 /* Give up. */
12898 }
12900 /* If we have seen at least one decl-specifier, and the next token
12901 is not a parenthesis, then we must be looking at a declaration.
12902 (After "int (" we might be looking at a functional cast.) */
12909 /* Look for C++17 decomposition declaration. */
12917 {
12918 tree decl
12920 maybe_range_for_decl,
12923 /* The next token should be either a `,' or a `;'. */
12925 /* If it's a `;', we are done. */
12928 /* Anything else is an error. */
12929 else
12930 {
12931 /* If we have already issued an error message we don't need
12932 to issue another one. */
12937 /* Skip tokens until we reach the end of the statement. */
12939 /* If the next token is now a `;', consume it. */
12943 }
12944 }
12945 else
12948 tree last_type;
12950 /* NULL_TREE if both variable and function declaration are allowed,
12951 error_mark_node if function declaration are not allowed and
12952 a FUNCTION_DECL that should be diagnosed if it is followed by
12953 variable declarations. */
12954 tree auto_function_declaration;
12957 auto_specifier_p
12961 /* Keep going until we hit the `;' at the end of the simple
12962 declaration. */
12965 CPP_SEMICOLON))
12966 {
12969 tree decl;
12973 {
12974 /* If we are processing next declarator, comma is expected */
12979 {
12983 }
12984 }
12985 else
12988 /* Parse the init-declarator. */
12991 function_definition_allowed_p,
12993 declares_class_or_enum,
12995 maybe_range_for_decl,
12998 /* If an error occurred while parsing tentatively, exit quickly.
12999 (That usually happens when in the body of a function; each
13000 statement is treated as a declaration-statement until proven
13001 otherwise.) */
13006 {
13007 /* If the init-declarator-list contains more than one
13008 init-declarator, they shall all form declarations of
13009 variables. */
13011 auto_function_declaration
13015 {
13017 "non-variable %qD in declaration with more than one "
13022 }
13023 }
13027 {
13031 {
13032 /* If the list of declarators contains more than one declarator,
13033 the type of each declared variable is determined as described
13034 above. If the type deduced for the template parameter U is not
13035 the same in each deduction, the program is ill-formed. */
13040 }
13041 else
13043 }
13045 /* Handle function definitions specially. */
13047 {
13048 /* If the next token is a `,', then we are probably
13049 processing something like:
13051 void f() {}, *p;
13053 which is erroneous. */
13055 {
13058 "mixing"
13060 }
13061 /* Otherwise, we're done with the list of declarators. */
13062 else
13063 {
13066 }
13067 }
13070 /* The next token should be either a `,' or a `;'. */
13072 /* If it's a `,', there are more declarators to come. */
13075 /* If it's a `;', we are done. */
13079 {
13084 }
13085 /* Anything else is an error. */
13086 else
13087 {
13088 /* If we have already issued an error message we don't need
13089 to issue another one. */
13094 /* Skip tokens until we reach the end of the statement. */
13096 /* If the next token is now a `;', consume it. */
13100 }
13101 /* After the first time around, a function-definition is not
13102 allowed -- even if it was OK at first. For example:
13104 int i, f() {}
13106 is not valid. */
13108 }
13110 /* Issue an error message if no declarators are present, and the
13111 decl-specifier-seq does not itself declare a class or
13112 enumeration: [dcl.dcl]/3. */
13114 {
13116 {
13120 /* Ensure an error is issued anyway when finish_decltype_type,
13121 called via cp_parser_decl_specifier_seq, returns a class or
13122 an enumeration (c++/51786). */
13125 }
13126 /* Perform any deferred access checks. */
13128 }
13130 /* Consume the `;'. */
13131 finish:
13135 {
13141 }
13143 done:
13145 }
13147 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13148 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13149 initializer ; */
13151 static tree
13156 {
13161 /* Parse the identifier-list. */
13165 {
13173 }
13177 {
13183 else
13184 {
13187 }
13188 }
13194 tree pushed_scope;
13201 NULL_TREE);
13208 cp_expr e;
13209 cp_decl_specifier_seq decl_specs;
13214 {
13217 else
13220 tree elt_pushed_scope;
13226 {
13227 /* Ensure we've diagnosed redeclaration if we aren't creating
13228 a new VAR_DECL. */
13231 }
13232 else
13236 }
13239 {
13242 }
13246 {
13254 || (is_direct_init
13257 {
13261 }
13264 {
13269 }
13270 }
13272 {
13274 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13275 the underlying DECL. */
13277 }
13283 {
13286 }
13289 }
13291 /* Parse a decl-specifier-seq.
13293 decl-specifier-seq:
13294 decl-specifier-seq [opt] decl-specifier
13295 decl-specifier attribute-specifier-seq [opt] (C++11)
13297 decl-specifier:
13298 storage-class-specifier
13299 type-specifier
13300 function-specifier
13301 friend
13302 typedef
13304 GNU Extension:
13306 decl-specifier:
13307 attributes
13309 Concepts Extension:
13311 decl-specifier:
13312 concept
13314 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13316 The parser flags FLAGS is used to control type-specifier parsing.
13318 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13319 flags:
13321 1: one of the decl-specifiers is an elaborated-type-specifier
13322 (i.e., a type declaration)
13323 2: one of the decl-specifiers is an enum-specifier or a
13324 class-specifier (i.e., a type definition)
13326 */
13328 static void
13330 cp_parser_flags flags,
13333 {
13337 cp_decl_spec ds;
13339 /* Clear DECL_SPECS. */
13342 /* Assume no class or enumeration type is declared. */
13345 /* Keep reading specifiers until there are no more to read. */
13347 {
13352 /* Peek at the next token. */
13355 /* Save the first token of the decl spec list for error
13356 reporting. */
13359 /* Handle attributes. */
13361 {
13362 /* Parse the attributes. */
13365 /* In a sequence of declaration specifiers, c++11 attributes
13366 appertain to the type that precede them. In that case
13367 [dcl.spec]/1 says:
13369 The attribute-specifier-seq affects the type only for
13370 the declaration it appears in, not other declarations
13371 involving the same type.
13373 But for now let's force the user to position the
13374 attribute either at the beginning of the declaration or
13375 after the declarator-id, which would clearly mean that it
13376 applies to the declarator. */
13378 {
13380 /* The c++11 attribute is at the beginning of the
13381 declaration. It appertains to the entity being
13383 else
13384 {
13386 {
13387 /* This is an attribute following a
13388 class-specifier. */
13393 }
13394 else
13395 {
13396 decl_specs->std_attributes
13398 attrs);
13401 }
13403 }
13404 }
13406 decl_specs->attributes
13408 attrs);
13412 }
13413 /* Assume we will find a decl-specifier keyword. */
13415 /* If the next token is an appropriate keyword, we can simply
13416 add it to the list. */
13418 {
13419 /* decl-specifier:
13420 friend
13421 constexpr */
13424 {
13429 }
13430 else
13431 {
13433 /* Consume the token. */
13435 }
13448 /* function-specifier:
13449 inline
13450 virtual
13451 explicit */
13458 /* decl-specifier:
13459 typedef */
13462 /* Consume the token. */
13464 /* A constructor declarator cannot appear in a typedef. */
13466 /* The "typedef" keyword can only occur in a declaration; we
13467 may as well commit at this point. */
13474 /* storage-class-specifier:
13475 auto
13476 register
13477 static
13478 extern
13479 mutable
13481 GNU Extension:
13482 thread */
13485 {
13486 /* Consume the token. */
13489 /* Complain about `auto' as a storage specifier, if
13490 we're complaining about C++0x compatibility. */
13494 "%<auto%> changes meaning in C++11; "
13497 /* Set the storage class anyway. */
13499 token);
13500 }
13501 else
13502 /* C++0x auto type-specifier. */
13510 /* Consume the token. */
13513 token);
13516 /* Consume the token. */
13522 /* We did not yet find a decl-specifier yet. */
13525 }
13542 /* Constructors are a special case. The `S' in `S()' is not a
13543 decl-specifier; it is the beginning of the declarator. */
13544 constructor_p
13545 = (!found_decl_spec
13546 && constructor_possible_p
13547 && (cp_parser_constructor_declarator_p
13550 /* If we don't have a DECL_SPEC yet, then we must be looking at
13551 a type-specifier. */
13553 {
13556 tree type_spec;
13558 type_spec
13560 decl_specs,
13566 /* If this type-specifier referenced a user-defined type
13567 (a typedef, class-name, etc.), then we can't allow any
13568 more such type-specifiers henceforth.
13570 [dcl.spec]
13572 The longest sequence of decl-specifiers that could
13573 possibly be a type name is taken as the
13574 decl-specifier-seq of a declaration. The sequence shall
13575 be self-consistent as described below.
13577 [dcl.type]
13579 As a general rule, at most one type-specifier is allowed
13580 in the complete decl-specifier-seq of a declaration. The
13581 only exceptions are the following:
13583 -- const or volatile can be combined with any other
13584 type-specifier.
13586 -- signed or unsigned can be combined with char, long,
13587 short, or int.
13589 -- ..
13591 Example:
13593 typedef char* Pc;
13594 void g (const int Pc);
13596 Here, Pc is *not* part of the decl-specifier seq; it's
13597 the declarator. Therefore, once we see a type-specifier
13598 (other than a cv-qualifier), we forbid any additional
13599 user-defined types. We *do* still allow things like `int
13600 int' to be considered a decl-specifier-seq, and issue the
13601 error message later. */
13604 /* A constructor declarator cannot follow a type-specifier. */
13606 {
13611 }
13612 }
13614 /* If we still do not have a DECL_SPEC, then there are no more
13615 decl-specifiers. */
13620 /* After we see one decl-specifier, further decl-specifiers are
13621 always optional. */
13623 }
13625 /* Don't allow a friend specifier with a class definition. */
13630 }
13632 /* Parse an (optional) storage-class-specifier.
13634 storage-class-specifier:
13635 auto
13636 register
13637 static
13638 extern
13639 mutable
13641 GNU Extension:
13643 storage-class-specifier:
13644 thread
13646 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13648 static tree
13650 {
13652 {
13656 /* Fall through for C++98. */
13664 /* Consume the token. */
13669 }
13670 }
13672 /* Parse an (optional) function-specifier.
13674 function-specifier:
13675 inline
13676 virtual
13677 explicit
13679 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13680 Updates DECL_SPECS, if it is non-NULL. */
13682 static tree
13685 {
13688 {
13694 /* 14.5.2.3 [temp.mem]
13696 A member function template shall not be virtual. */
13700 else
13710 }
13712 /* Consume the token. */
13714 }
13716 /* Parse a linkage-specification.
13718 linkage-specification:
13719 extern string-literal { declaration-seq [opt] }
13720 extern string-literal declaration */
13722 static void
13724 {
13725 tree linkage;
13727 /* Look for the `extern' keyword. */
13728 cp_token *extern_token
13731 /* Look for the string-literal. */
13735 /* Transform the literal into an identifier. If the literal is a
13736 wide-character string, or contains embedded NULs, then we can't
13737 handle it as the user wants. */
13740 {
13742 /* Assume C++ linkage. */
13744 }
13745 else
13748 /* We're now using the new linkage. */
13751 /* Preserve the location of the the innermost linkage specification,
13752 tracking the locations of nested specifications via a local. */
13753 location_t saved_location
13755 /* Construct a location ranging from the start of the "extern" to
13756 the end of the string-literal, with the caret at the start, e.g.:
13757 extern "C" {
13758 ^~~~~~~~~~
13759 */
13760 parser->innermost_linkage_specification_location
13765 /* If the next token is a `{', then we're using the first
13766 production. */
13768 {
13772 /* Consume the `{' token. */
13773 matching_braces braces;
13775 /* Parse the declarations. */
13777 /* Look for the closing `}'. */
13779 }
13780 /* Otherwise, there's just one declaration. */
13781 else
13782 {
13785 saved_in_unbraced_linkage_specification_p
13789 parser->in_unbraced_linkage_specification_p
13791 }
13793 /* We're done with the linkage-specification. */
13796 /* Restore location of parent linkage specification, if any. */
13798 }
13800 /* Parse a static_assert-declaration.
13802 static_assert-declaration:
13803 static_assert ( constant-expression , string-literal ) ;
13804 static_assert ( constant-expression ) ; (C++17)
13806 If MEMBER_P, this static_assert is a class member. */
13808 static void
13810 {
13811 cp_expr condition;
13812 location_t token_loc;
13813 tree message;
13816 /* Peek at the `static_assert' token so we can keep track of exactly
13817 where the static assertion started. */
13820 /* Look for the `static_assert' keyword. */
13822 RT_STATIC_ASSERT))
13825 /* We know we are in a static assertion; commit to any tentative
13826 parse. */
13830 /* Parse the `(' starting the static assertion condition. */
13831 matching_parens parens;
13834 /* Parse the constant-expression. Allow a non-constant expression
13835 here in order to give better diagnostics in finish_static_assert. */
13836 condition =
13842 {
13845 "static_assert without a message "
13847 /* Eat the ')' */
13852 }
13853 else
13854 {
13855 /* Parse the separating `,'. */
13858 /* Parse the string-literal message. */
13863 /* A `)' completes the static assertion. */
13869 }
13871 /* A semicolon terminates the declaration. */
13874 /* Get the location for the static assertion. Use that of the
13875 condition if available, otherwise, use that of the "static_assert"
13876 token. */
13881 /* Complete the static assertion, which may mean either processing
13882 the static assert now or saving it for template instantiation. */
13884 }
13886 /* Parse the expression in decltype ( expression ). */
13888 static tree
13891 {
13893 tree expr;
13895 /* Since we're going to preserve any side-effects from this parse, set up a
13896 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13897 in the expression. */
13900 /* First, try parsing an id-expression. */
13911 {
13914 cp_id_kind idk;
13918 /* Lookup the name we got back from the id-expression. */
13928 {
13929 /* Complete lookup of the id-expression. */
13930 expr = (finish_id_expression
13943 /* We found an id-expression, but it was something that we
13944 should not have found. This is an error, not something
13945 we can recover from, so note that we found an
13946 id-expression and we'll recover as gracefully as
13947 possible. */
13949 }
13954 /* We have an id-expression. */
13956 }
13959 {
13960 /* Abort the id-expression parse. */
13963 /* Parsing tentatively, again. */
13966 /* Parse a class member access. */
13974 /* We have an id-expression. */
13976 }
13979 /* We have parsed the complete id-expression or member access. */
13981 else
13982 {
13983 /* Abort our attempt to parse an id-expression or member access
13984 expression. */
13987 /* Parse a full expression. */
13990 }
13993 }
13995 /* Parse a `decltype' type. Returns the type.
13997 simple-type-specifier:
13998 decltype ( expression )
13999 C++14 proposal:
14000 decltype ( auto ) */
14002 static tree
14004 {
14005 tree expr;
14014 {
14015 /* Already parsed. */
14018 }
14020 /* Look for the `decltype' token. */
14024 /* Parse the opening `('. */
14025 matching_parens parens;
14029 /* decltype (auto) */
14032 {
14039 }
14041 /* Types cannot be defined in a `decltype' expression. Save away the
14042 old message. */
14045 /* And create the new one. */
14046 parser->type_definition_forbidden_message
14049 /* The restrictions on constant-expressions do not apply inside
14050 decltype expressions. */
14051 saved_integral_constant_expression_p
14053 saved_non_integral_constant_expression_p
14057 /* Within a parenthesized expression, a `>' token is always
14058 the greater-than operator. */
14059 saved_greater_than_is_operator_p
14063 /* Do not actually evaluate the expression. */
14066 /* Do not warn about problems with the expression. */
14071 /* Go back to evaluating expressions. */
14075 /* The `>' token might be the end of a template-id or
14076 template-parameter-list now. */
14077 parser->greater_than_is_operator_p
14080 /* Restore the old message and the integral constant expression
14081 flags. */
14083 parser->integral_constant_expression_p
14085 parser->non_integral_constant_expression_p
14088 /* Parse to the closing `)'. */
14090 {
14094 }
14097 tf_warning_or_error);
14099 rewrite:
14100 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14101 it again. */
14110 }
14112 /* Special member functions [gram.special] */
14114 /* Parse a conversion-function-id.
14116 conversion-function-id:
14117 operator conversion-type-id
14119 Returns an IDENTIFIER_NODE representing the operator. */
14121 static tree
14123 {
14124 tree type;
14125 tree saved_scope;
14126 tree saved_qualifying_scope;
14127 tree saved_object_scope;
14130 /* Look for the `operator' token. */
14133 /* When we parse the conversion-type-id, the current scope will be
14134 reset. However, we need that information in able to look up the
14135 conversion function later, so we save it here. */
14139 /* We must enter the scope of the class so that the names of
14140 entities declared within the class are available in the
14141 conversion-type-id. For example, consider:
14143 struct S {
14144 typedef int I;
14145 operator I();
14146 };
14148 S::operator I() { ... }
14150 In order to see that `I' is a type-name in the definition, we
14151 must be in the scope of `S'. */
14154 /* Parse the conversion-type-id. */
14156 /* Leave the scope of the class, if any. */
14159 /* Restore the saved scope. */
14163 /* If the TYPE is invalid, indicate failure. */
14167 }
14169 /* Parse a conversion-type-id:
14171 conversion-type-id:
14172 type-specifier-seq conversion-declarator [opt]
14174 Returns the TYPE specified. */
14176 static tree
14178 {
14179 tree attributes;
14180 cp_decl_specifier_seq type_specifiers;
14182 tree type_specified;
14185 /* Parse the attributes. */
14189 parser->type_definition_forbidden_message
14192 /* Parse the type-specifiers. */
14199 /* If that didn't work, stop. */
14202 /* Parse the conversion-declarator. */
14210 /* Don't give this error when parsing tentatively. This happens to
14211 work because we always parse this definitively once. */
14214 {
14216 {
14219 }
14223 }
14226 }
14228 /* Parse an (optional) conversion-declarator.
14230 conversion-declarator:
14231 ptr-operator conversion-declarator [opt]
14233 */
14237 {
14240 cp_cv_quals cv_quals;
14242 /* We don't know if there's a ptr-operator next, or not. */
14244 /* Try the ptr-operator. */
14247 /* If it worked, look for more conversion-declarators. */
14249 {
14252 /* Parse another optional declarator. */
14255 declarator = cp_parser_make_indirect_declarator
14259 }
14262 }
14264 /* Parse an (optional) ctor-initializer.
14266 ctor-initializer:
14267 : mem-initializer-list */
14269 static void
14271 {
14272 /* If the next token is not a `:', then there is no
14273 ctor-initializer. */
14275 {
14276 /* Do default initialization of any bases and members. */
14280 }
14282 /* Consume the `:' token. */
14284 /* And the mem-initializer-list. */
14286 }
14288 /* Parse a mem-initializer-list.
14290 mem-initializer-list:
14291 mem-initializer ... [opt]
14292 mem-initializer ... [opt] , mem-initializer-list */
14294 static void
14296 {
14301 /* Let the semantic analysis code know that we are starting the
14302 mem-initializer-list. */
14307 /* Loop through the list. */
14309 {
14310 tree mem_initializer;
14313 /* Parse the mem-initializer. */
14315 /* If the next token is a `...', we're expanding member initializers. */
14317 {
14318 /* Consume the `...'. */
14321 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14322 can be expanded but members cannot. */
14325 {
14330 }
14332 /* Construct the pack expansion type. */
14335 }
14338 {
14342 }
14343 /* Look for a target constructor. */
14347 {
14350 {
14354 }
14356 }
14357 /* Add it to the list, unless it was erroneous. */
14359 {
14362 }
14363 /* If the next token is not a `,', we're done. */
14366 /* Consume the `,' token. */
14368 }
14370 /* Perform semantic analysis. */
14373 }
14375 /* Parse a mem-initializer.
14377 mem-initializer:
14378 mem-initializer-id ( expression-list [opt] )
14379 mem-initializer-id braced-init-list
14381 GNU extension:
14383 mem-initializer:
14384 ( expression-list [opt] )
14386 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14387 class) or FIELD_DECL (for a non-static data member) to initialize;
14388 the TREE_VALUE is the expression-list. An empty initialization
14389 list is represented by void_list_node. */
14391 static tree
14393 {
14394 tree mem_initializer_id;
14395 tree expression_list;
14396 tree member;
14399 /* Find out what is being initialized. */
14401 {
14405 }
14406 else
14407 {
14411 }
14417 {
14424 }
14425 else
14426 {
14436 }
14446 }
14448 /* Parse a mem-initializer-id.
14450 mem-initializer-id:
14451 :: [opt] nested-name-specifier [opt] class-name
14452 decltype-specifier (C++11)
14453 identifier
14455 Returns a TYPE indicating the class to be initialized for the first
14456 production (and the second in C++11). Returns an IDENTIFIER_NODE
14457 indicating the data member to be initialized for the last production. */
14459 static tree
14461 {
14465 tree id;
14469 /* `typename' is not allowed in this context ([temp.res]). */
14471 {
14473 "keyword %<typename%> not allowed in this context (a qualified "
14476 }
14477 /* Look for the optional `::' operator. */
14478 global_scope_p
14482 /* Look for the optional nested-name-specifier. The simplest way to
14483 implement:
14485 [temp.res]
14487 The keyword `typename' is not permitted in a base-specifier or
14488 mem-initializer; in these contexts a qualified name that
14489 depends on a template-parameter is implicitly assumed to be a
14490 type name.
14492 is to assume that we have seen the `typename' keyword at this
14493 point. */
14494 nested_name_specifier_p
14503 /* If there is a `::' operator or a nested-name-specifier, then we
14504 are definitely looking for a class-name. */
14509 typename_type,
14513 /* Otherwise, we could also be looking for an ordinary identifier. */
14516 /* Try a decltype-specifier. */
14518 else
14519 /* Otherwise, try a class-name. */
14523 none_type,
14527 /* If we found one, we're done. */
14530 /* Otherwise, look for an ordinary identifier. */
14532 }
14534 /* Overloading [gram.over] */
14536 /* Parse an operator-function-id.
14538 operator-function-id:
14539 operator operator
14541 Returns an IDENTIFIER_NODE for the operator which is a
14542 human-readable spelling of the identifier, e.g., `operator +'. */
14544 static cp_expr
14546 {
14547 /* Look for the `operator' keyword. */
14550 /* And then the name of the operator itself. */
14552 }
14554 /* Return an identifier node for a user-defined literal operator.
14555 The suffix identifier is chained to the operator name identifier. */
14557 tree
14559 {
14560 tree identifier;
14567 }
14569 /* Parse an operator.
14571 operator:
14572 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14573 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14574 || ++ -- , ->* -> () []
14576 GNU Extensions:
14578 operator:
14579 <? >? <?= >?=
14581 Returns an IDENTIFIER_NODE for the operator which is a
14582 human-readable spelling of the identifier, e.g., `operator +'. */
14584 static cp_expr
14586 {
14591 /* Peek at the next token. */
14596 /* Figure out which operator we have. */
14601 {
14603 {
14604 /* The keyword should be either `new' or `delete'. */
14609 else
14612 /* Consume the `new' or `delete' token. */
14615 /* Peek at the next token. */
14617 /* If it's a `[' token then this is the array variant of the
14618 operator. */
14620 {
14621 /* Consume the `[' token. */
14623 /* Look for the `]' token. */
14628 }
14632 }
14790 {
14791 /* Consume the `('. */
14792 matching_parens parens;
14794 /* Look for the matching `)'. */
14799 }
14802 /* Consume the `['. */
14804 /* Look for the matching `]'. */
14813 /* FALLTHRU */
14822 {
14829 /* Consume the string. */
14835 {
14838 }
14839 else
14840 {
14842 /* Look for the suffix identifier. */
14847 {
14851 }
14852 else
14853 {
14856 }
14857 }
14862 {
14865 }
14868 {
14871 }
14873 {
14876 }
14878 }
14881 /* Anything else is an error. */
14883 }
14885 /* If we have selected an identifier, we need to consume the
14886 operator token. */
14888 {
14892 }
14893 /* Otherwise, no valid operator name was present. */
14894 else
14895 {
14898 }
14901 }
14903 /* Parse a template-declaration.
14905 template-declaration:
14906 export [opt] template < template-parameter-list > declaration
14908 If MEMBER_P is TRUE, this template-declaration occurs within a
14909 class-specifier.
14911 The grammar rule given by the standard isn't correct. What
14912 is really meant is:
14914 template-declaration:
14915 export [opt] template-parameter-list-seq
14916 decl-specifier-seq [opt] init-declarator [opt] ;
14917 export [opt] template-parameter-list-seq
14918 function-definition
14920 template-parameter-list-seq:
14921 template-parameter-list-seq [opt]
14922 template < template-parameter-list >
14924 Concept Extensions:
14926 template-parameter-list-seq:
14927 template < template-parameter-list > requires-clause [opt]
14929 requires-clause:
14930 requires logical-or-expression */
14932 static void
14934 {
14935 /* Check for `export'. */
14937 {
14938 /* Consume the `export' token. */
14940 /* Warn that we do not support `export'. */
14942 }
14945 }
14947 /* Parse a template-parameter-list.
14949 template-parameter-list:
14950 template-parameter
14951 template-parameter-list , template-parameter
14953 Returns a TREE_LIST. Each node represents a template parameter.
14954 The nodes are connected via their TREE_CHAINs. */
14956 static tree
14958 {
14963 /* The loop below parses the template parms. We first need to know
14964 the total number of template parms to be able to compute proper
14965 canonical types of each dependent type. So after the loop, when
14966 we know the total number of template parms,
14967 end_template_parm_list computes the proper canonical types and
14968 fixes up the dependent types accordingly. */
14970 {
14971 tree parameter;
14974 location_t parm_loc;
14976 /* Parse the template-parameter. */
14981 /* Add it to the list. */
14984 parm_loc,
14985 parameter,
14986 is_non_type,
14987 is_parameter_pack);
14988 else
14989 {
14992 }
14994 /* If the next token is not a `,', we're done. */
14997 /* Otherwise, consume the `,' token. */
14999 }
15002 }
15004 /* Parse a introduction-list.
15006 introduction-list:
15007 introduced-parameter
15008 introduction-list , introduced-parameter
15010 introduced-parameter:
15011 ...[opt] identifier
15013 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15014 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15015 WILDCARD_DECL will also have DECL_NAME set and token location in
15016 DECL_SOURCE_LOCATION. */
15018 static tree
15020 {
15024 {
15029 /* Build placeholder. */
15037 /* If the next token is not a `,', we're done. */
15040 /* Otherwise, consume the `,' token. */
15042 }
15044 /* Convert the vec into a TREE_VEC. */
15047 tree parm;
15053 }
15055 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15056 is an abstract declarator. */
15060 {
15065 }
15067 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15068 is an abstract declarator. */
15072 {
15076 else
15078 }
15080 /* Returns true if DECL represents a constrained-parameter. */
15084 {
15089 }
15091 /* Returns true if PARM declares a constrained-parameter. */
15095 {
15097 }
15099 /* Check that the type parameter is only a declarator-id, and that its
15100 type is not cv-qualified. */
15102 bool
15105 {
15110 {
15113 }
15115 /* Don't allow cv-qualified type parameters. */
15118 {
15121 }
15124 }
15126 /* Finish parsing/processing a template type parameter and checking
15127 various restrictions. */
15131 tree id,
15133 {
15136 else
15138 }
15140 static tree
15142 {
15143 /* FIXME: This should probably be copied, and we may need to adjust
15144 the template parameter depths. */
15154 }
15156 /* Finish parsing/processing a template template parameter by borrowing
15157 the template parameter list from the prototype parameter. */
15159 static tree
15161 tree proto,
15162 tree id,
15164 {
15168 }
15170 /* Create a new non-type template parameter from the given PARM
15171 declarator. */
15173 static tree
15176 {
15182 }
15184 /* Build a constrained template parameter based on the PARMDECL
15185 declarator. The type of PARMDECL is the constrained type, which
15186 refers to the prototype template parameter that ultimately
15187 specifies the type of the declared parameter. */
15189 static tree
15194 {
15200 /* A template parameter constrained by a variadic concept shall also
15201 be declared as a template parameter pack. */
15206 /* Build the parameter. Return an error if the declarator was invalid. */
15207 tree parm;
15212 parmdecl);
15213 else
15218 /* Finish the parameter decl and create a node attaching the
15219 default argument and constraint. */
15224 }
15226 /* Returns true if the parsed type actually represents the declaration
15227 of a type template-parameter. */
15231 {
15234 }
15237 /* Returns true if the parsed type actually represents the declaration of
15238 a template template-parameter. */
15240 static bool
15242 {
15245 }
15247 /* Parse a default argument for a type template-parameter.
15248 Note that diagnostics are handled in cp_parser_template_parameter. */
15250 static tree
15252 {
15255 /* Consume the `=' token. */
15260 /* Parse the default-argument. */
15266 {
15270 }
15273 }
15275 /* Parse a default argument for a template template-parameter. */
15277 static tree
15279 {
15284 /* Consume the `='. */
15286 /* Parse the id-expression. */
15288 /* save token before parsing the id-expression, for error
15289 reporting */
15291 tree default_argument
15299 /* If the id-expression was a template-id that refers to
15300 a template-class, we already have the declaration here,
15301 so no further lookup is needed. */
15302 ;
15303 else
15304 /* Look up the name. */
15305 default_argument
15307 none_type,
15313 /* See if the default argument is valid. */
15317 }
15319 /* Parse a template-parameter.
15321 template-parameter:
15322 type-parameter
15323 parameter-declaration
15325 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15326 the parameter. The TREE_PURPOSE is the default value, if any.
15327 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15328 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15329 set to true iff this parameter is a parameter pack. */
15331 static tree
15334 {
15337 tree parm;
15339 /* Assume it is a type parameter or a template parameter. */
15341 /* Assume it not a parameter pack. */
15343 /* Peek at the next token. */
15345 /* If it is `template', we have a type-parameter. */
15348 /* If it is `class' or `typename' we do not know yet whether it is a
15349 type parameter or a non-type parameter. Consider:
15351 template <typename T, typename T::X X> ...
15353 or:
15355 template <class C, class D*> ...
15357 Here, the first parameter is a type parameter, and the second is
15358 a non-type parameter. We can tell by looking at the token after
15359 the identifier -- if it is a `,', `=', or `>' then we have a type
15360 parameter. */
15362 {
15363 /* Peek at the token after `class' or `typename'. */
15365 /* If it's an ellipsis, we have a template type parameter
15366 pack. */
15369 /* If it's an identifier, skip it. */
15372 /* Now, see if the token looks like the end of a template
15373 parameter. */
15378 }
15380 /* Otherwise, it is a non-type parameter or a constrained parameter.
15382 [temp.param]
15384 When parsing a default template-argument for a non-type
15385 template-parameter, the first non-nested `>' is taken as the end
15386 of the template parameter-list rather than a greater-than
15387 operator. */
15388 parameter_declarator
15395 /* If the parameter declaration is marked as a parameter pack, set
15396 *IS_PARAMETER_PACK to notify the caller. */
15401 {
15402 /* Can happen in some cases of erroneous input (c++/34892). */
15404 /* Consume the `...' for better error recovery. */
15406 }
15408 // The parameter may have been constrained.
15411 parameter_declarator,
15412 is_non_type,
15413 is_parameter_pack);
15415 // Now we're sure that the parameter is a non-type parameter.
15426 }
15428 /* Parse a type-parameter.
15430 type-parameter:
15431 class identifier [opt]
15432 class identifier [opt] = type-id
15433 typename identifier [opt]
15434 typename identifier [opt] = type-id
15435 template < template-parameter-list > class identifier [opt]
15436 template < template-parameter-list > class identifier [opt]
15437 = id-expression
15439 GNU Extension (variadic templates):
15441 type-parameter:
15442 class ... identifier [opt]
15443 typename ... identifier [opt]
15445 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15446 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15447 the declaration of the parameter.
15449 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15451 static tree
15453 {
15455 tree parameter;
15457 /* Look for a keyword to tell us what kind of parameter this is. */
15463 {
15466 {
15467 tree identifier;
15468 tree default_argument;
15470 /* If the next token is an ellipsis, we have a template
15471 argument pack. */
15473 {
15474 /* Consume the `...' token. */
15479 }
15481 /* If the next token is an identifier, then it names the
15482 parameter. */
15485 else
15488 /* Create the parameter. */
15491 /* If the next token is an `=', we have a default argument. */
15493 {
15494 default_argument
15497 /* Template parameter packs cannot have default
15498 arguments. */
15500 {
15503 "template parameter pack %qD cannot have a "
15505 else
15507 "template parameter packs cannot have "
15510 }
15513 }
15514 else
15517 /* Create the combined representation of the parameter and the
15518 default argument. */
15520 }
15524 {
15525 tree identifier;
15526 tree default_argument;
15528 /* Look for the `<'. */
15530 /* Parse the template-parameter-list. */
15532 /* Look for the `>'. */
15535 // If template requirements are present, parse them.
15537 {
15542 }
15544 /* Look for the `class' or 'typename' keywords. */
15546 /* If the next token is an ellipsis, we have a template
15547 argument pack. */
15549 {
15550 /* Consume the `...' token. */
15555 }
15556 /* If the next token is an `=', then there is a
15557 default-argument. If the next token is a `>', we are at
15558 the end of the parameter-list. If the next token is a `,',
15559 then we are at the end of this parameter. */
15563 {
15565 /* Treat invalid names as if the parameter were nameless. */
15568 }
15569 else
15572 /* Create the template parameter. */
15574 identifier);
15576 /* If the next token is an `=', then there is a
15577 default-argument. */
15579 {
15580 default_argument
15583 /* Template parameter packs cannot have default
15584 arguments. */
15586 {
15589 "template parameter pack %qD cannot "
15591 identifier);
15592 else
15596 }
15597 }
15598 else
15601 /* Create the combined representation of the parameter and the
15602 default argument. */
15604 }
15610 }
15613 }
15615 /* Parse a template-id.
15617 template-id:
15618 template-name < template-argument-list [opt] >
15620 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15621 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15622 returned. Otherwise, if the template-name names a function, or set
15623 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15624 names a class, returns a TYPE_DECL for the specialization.
15626 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15627 uninstantiated templates. */
15629 static tree
15635 {
15636 tree templ;
15637 tree arguments;
15638 tree template_id;
15643 /* If the next token corresponds to a template-id, there is no need
15644 to reparse it. */
15647 {
15650 }
15652 /* Avoid performing name lookup if there is no possibility of
15653 finding a template-id. */
15656 && !cp_parser_nth_token_starts_template_argument_list_p
15658 {
15661 }
15663 /* Remember where the template-id starts. */
15669 /* Parse the template-name. */
15672 check_dependency_p,
15673 is_declaration,
15674 tag_type,
15677 {
15680 }
15682 /* Since we're going to preserve any side-effects from this parse, set up a
15683 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15684 in the template arguments. */
15687 /* If we find the sequence `[:' after a template-name, it's probably
15688 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15689 parse correctly the argument list. */
15696 {
15698 /* Change `:' into `::'. */
15700 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15701 CPP_LESS. */
15704 /* Parse the arguments. */
15707 {
15708 /* If we couldn't parse an argument list, then we revert our changes
15709 and return simply an error. Maybe this is not a template-id
15710 after all. */
15715 }
15716 /* Otherwise, emit an error about the invalid digraph, but continue
15717 parsing because we got our argument list. */
15720 {
15723 "%<<:%> is an alternate spelling for %<[%>."
15726 {
15728 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15731 }
15732 }
15733 }
15734 else
15735 {
15736 /* Look for the `<' that starts the template-argument-list. */
15738 {
15741 }
15742 /* Parse the arguments. */
15744 }
15746 /* Set the location to be of the form:
15747 template-name < template-argument-list [opt] >
15748 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15749 with caret == start at the start of the template-name,
15750 ranging until the closing '>'. */
15751 location_t finish_loc
15753 location_t combined_loc
15756 /* Build a representation of the specialization. */
15759 TEMPLATE_ID_EXPR,
15763 {
15765 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15766 template (rather than some instantiation thereof) only if
15767 is not nested within some other construct. For example, in
15768 "template <typename T> void f(T) { A<T>::", A<T> is just an
15769 instantiation of A. */
15772 CPP_SCOPE));
15773 template_id
15775 }
15776 /* A template-like identifier may be a partial concept id. */
15782 {
15786 }
15787 else
15788 {
15789 /* If it's not a class-template or a template-template, it should be
15790 a function-template. */
15798 }
15800 /* If parsing tentatively, replace the sequence of tokens that makes
15801 up the template-id with a CPP_TEMPLATE_ID token. That way,
15802 should we re-parse the token stream, we will not have to repeat
15803 the effort required to do the parse, nor will we issue duplicate
15804 error messages about problems during instantiation of the
15805 template. */
15807 /* Don't do this if we had a parse error in a declarator; re-parsing
15808 might succeed if a name changes meaning (60361). */
15812 {
15813 /* Reset the contents of the START_OF_ID token. */
15817 /* We must mark the lookup as kept, so we don't throw it away on
15818 the first parse. */
15822 /* Retrieve any deferred checks. Do not pop this access checks yet
15823 so the memory will not be reclaimed during token replacing below. */
15829 /* Purge all subsequent tokens. */
15832 /* ??? Can we actually assume that, if template_id ==
15833 error_mark_node, we will have issued a diagnostic to the
15834 user, as opposed to simply marking the tentative parse as
15835 failed? */
15838 }
15842 }
15844 /* Parse a template-name.
15846 template-name:
15847 identifier
15849 The standard should actually say:
15851 template-name:
15852 identifier
15853 operator-function-id
15855 A defect report has been filed about this issue.
15857 A conversion-function-id cannot be a template name because they cannot
15858 be part of a template-id. In fact, looking at this code:
15860 a.operator K<int>()
15862 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15863 It is impossible to call a templated conversion-function-id with an
15864 explicit argument list, since the only allowed template parameter is
15865 the type to which it is converting.
15867 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15868 `template' keyword, in a construction like:
15870 T::template f<3>()
15872 In that case `f' is taken to be a template-name, even though there
15873 is no way of knowing for sure.
15875 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15876 name refers to a set of overloaded functions, at least one of which
15877 is a template, or an IDENTIFIER_NODE with the name of the template,
15878 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15879 names are looked up inside uninstantiated templates. */
15881 static tree
15888 {
15889 tree identifier;
15890 tree decl;
15893 /* If the next token is `operator', then we have either an
15894 operator-function-id or a conversion-function-id. */
15896 {
15897 /* We don't know whether we're looking at an
15898 operator-function-id or a conversion-function-id. */
15900 /* Try an operator-function-id. */
15902 /* If that didn't work, try a conversion-function-id. */
15904 {
15907 }
15908 }
15909 /* Look for the identifier. */
15910 else
15913 /* If we didn't find an identifier, we don't have a template-id. */
15917 /* If the name immediately followed the `template' keyword, then it
15918 is a template-name. However, if the next token is not `<', then
15919 we do not treat it as a template-name, since it is not being used
15920 as part of a template-id. This enables us to handle constructs
15921 like:
15923 template <typename T> struct S { S(); };
15924 template <typename T> S<T>::S();
15926 correctly. We would treat `S' as a template -- if it were `S<T>'
15927 -- but we do not if there is no `<'. */
15931 {
15932 /* In a declaration, in a dependent context, we pretend that the
15933 "template" keyword was present in order to improve error
15934 recovery. For example, given:
15936 template <typename T> void f(T::X<int>);
15938 we want to treat "X<int>" as a template-id. */
15940 && !template_keyword_p
15942 && check_dependency_p
15944 /* Do not do this for dtors (or ctors), since they never
15945 need the template keyword before their name. */
15947 {
15950 /* Explain what went wrong. */
15952 identifier);
15955 /* If parsing tentatively, find the location of the "<" token. */
15958 /* Parse the template arguments so that we can issue error
15959 messages about them. */
15962 /* Skip tokens until we find a good place from which to
15963 continue parsing. */
15968 /* If parsing tentatively, permanently remove the
15969 template argument list. That will prevent duplicate
15970 error messages from being issued about the missing
15971 "template" keyword. */
15978 }
15980 /* If the "template" keyword is present, then there is generally
15981 no point in doing name-lookup, so we just return IDENTIFIER.
15982 But, if the qualifying scope is non-dependent then we can
15983 (and must) do name-lookup normally. */
15985 {
15991 {
15992 /* We're optimizing away the call to cp_parser_lookup_name, but
15993 we still need to do this. */
15996 }
15997 }
15998 }
16000 /* Look up the name. */
16002 tag_type,
16005 check_dependency_p,
16011 /* If DECL is a template, then the name was a template-name. */
16013 {
16017 }
16018 else
16019 {
16020 /* The standard does not explicitly indicate whether a name that
16021 names a set of overloaded declarations, some of which are
16022 templates, is a template-name. However, such a name should
16023 be a template-name; otherwise, there is no way to form a
16024 template-id for the overloaded templates. */
16033 {
16034 /* The name does not name a template. */
16037 }
16038 }
16040 /* If DECL is dependent, and refers to a function, then just return
16041 its name; we will look it up again during template instantiation. */
16043 {
16047 }
16050 }
16052 /* Parse a template-argument-list.
16054 template-argument-list:
16055 template-argument ... [opt]
16056 template-argument-list , template-argument ... [opt]
16058 Returns a TREE_VEC containing the arguments. */
16060 static tree
16062 {
16067 tree vec;
16074 /* Even if the template-id appears in an integral
16075 constant-expression, the contents of the argument list do
16076 not. */
16082 /* Parse the arguments. */
16083 do
16084 {
16085 tree argument;
16088 /* Consume the comma. */
16091 /* Parse the template-argument. */
16094 /* If the next token is an ellipsis, we're expanding a template
16095 argument pack. */
16097 {
16099 {
16103 }
16104 /* Consume the `...' token. */
16107 /* Make the argument into a TYPE_PACK_EXPANSION or
16108 EXPR_PACK_EXPANSION. */
16110 }
16113 {
16117 {
16120 }
16121 else
16123 }
16125 }
16141 }
16143 /* Parse a template-argument.
16145 template-argument:
16146 assignment-expression
16147 type-id
16148 id-expression
16150 The representation is that of an assignment-expression, type-id, or
16151 id-expression -- except that the qualified id-expression is
16152 evaluated, so that the value returned is either a DECL or an
16153 OVERLOAD.
16155 Although the standard says "assignment-expression", it forbids
16156 throw-expressions or assignments in the template argument.
16157 Therefore, we use "conditional-expression" instead. */
16159 static tree
16161 {
16162 tree argument;
16168 cp_id_kind idk;
16170 /* There's really no way to know what we're looking at, so we just
16171 try each alternative in order.
16173 [temp.arg]
16175 In a template-argument, an ambiguity between a type-id and an
16176 expression is resolved to a type-id, regardless of the form of
16177 the corresponding template-parameter.
16179 Therefore, we try a type-id first. */
16182 /* If there was no error parsing the type-id but the next token is a
16183 '>>', our behavior depends on which dialect of C++ we're
16184 parsing. In C++98, we probably found a typo for '> >'. But there
16185 are type-id which are also valid expressions. For instance:
16187 struct X { int operator >> (int); };
16188 template <int V> struct Foo {};
16189 Foo<X () >> 5> r;
16191 Here 'X()' is a valid type-id of a function type, but the user just
16192 wanted to write the expression "X() >> 5". Thus, we remember that we
16193 found a valid type-id, but we still try to parse the argument as an
16194 expression to see what happens.
16196 In C++0x, the '>>' will be considered two separate '>'
16197 tokens. */
16201 {
16204 }
16205 else
16206 {
16207 /* If the next token isn't a `,' or a `>', then this argument wasn't
16208 really finished. This means that the argument is not a valid
16209 type-id. */
16212 /* If that worked, we're done. */
16215 }
16216 /* We're still not sure what the argument will be. */
16218 /* Try a template. */
16226 /* If the next token isn't a `,' or a `>', then this argument wasn't
16227 really finished. */
16231 {
16232 /* Figure out what is being referred to. If the id-expression
16233 was for a class template specialization, then we will have a
16234 TYPE_DECL at this point. There is no need to do name lookup
16235 at this point in that case. */
16238 none_type,
16244 /* Handle a constrained-type-specifier for a non-type template
16245 parameter. */
16251 }
16253 {
16257 }
16258 /* It must be a non-type argument. In C++17 any constant-expression is
16259 allowed. */
16263 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16265 -- an integral constant-expression of integral or enumeration
16266 type; or
16268 -- the name of a non-type template-parameter; or
16270 -- the name of an object or function with external linkage...
16272 -- the address of an object or function with external linkage...
16274 -- a pointer to member... */
16275 /* Look for a non-type template parameter. */
16277 {
16289 }
16291 /* If the next token is "&", the argument must be the address of an
16292 object or function with external linkage. */
16295 {
16298 }
16299 /* See if we might have an id-expression. */
16306 {
16309 address_p,
16316 else
16317 {
16318 tree probe;
16321 {
16322 /* Strip the dereference temporarily. */
16325 }
16327 /* If we're in a template, we represent a qualified-id referring
16328 to a static data member as a SCOPE_REF even if the scope isn't
16329 dependent so that we can check access control later. */
16334 {
16335 /* A variable without external linkage might still be a
16336 valid constant-expression, so no error is issued here
16337 if the external-linkage check fails. */
16340 }
16342 /* All overloaded functions are allowed; if the external
16343 linkage test does not pass, an error will be issued
16344 later. */
16345 ;
16349 /* A pointer-to-member. */
16350 ;
16352 ;
16353 else
16357 {
16360 tf_warning_or_error);
16361 else
16364 }
16365 }
16366 }
16367 /* If the argument started with "&", there are no other valid
16368 alternatives at this point. */
16370 {
16373 }
16375 general_expr:
16376 /* If the argument wasn't successfully parsed as a type-id followed
16377 by '>>', the argument can only be a constant expression now.
16378 Otherwise, we try parsing the constant-expression tentatively,
16379 because the argument could really be a type-id. */
16385 else
16386 {
16387 /* With C++17 generalized non-type template arguments we need to handle
16388 lvalue constant expressions, too. */
16391 }
16399 /* We did our best to parse the argument as a non type-id, but that
16400 was the only alternative that matched (albeit with a '>' after
16401 it). We can assume it's just a typo from the user, and a
16402 diagnostic will then be issued. */
16404 }
16406 /* Parse an explicit-instantiation.
16408 explicit-instantiation:
16409 template declaration
16411 Although the standard says `declaration', what it really means is:
16413 explicit-instantiation:
16414 template decl-specifier-seq [opt] declarator [opt] ;
16416 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16417 supposed to be allowed. A defect report has been filed about this
16418 issue.
16420 GNU Extension:
16422 explicit-instantiation:
16423 storage-class-specifier template
16424 decl-specifier-seq [opt] declarator [opt] ;
16425 function-specifier template
16426 decl-specifier-seq [opt] declarator [opt] ; */
16428 static void
16430 {
16432 cp_decl_specifier_seq decl_specifiers;
16437 /* Look for an (optional) storage-class-specifier or
16438 function-specifier. */
16440 {
16441 extension_specifier
16444 extension_specifier
16447 }
16449 /* Look for the `template' keyword. */
16451 /* Let the front end know that we are processing an explicit
16452 instantiation. */
16454 /* [temp.explicit] says that we are supposed to ignore access
16455 control while processing explicit instantiation directives. */
16457 /* Parse a decl-specifier-seq. */
16459 CP_PARSER_FLAGS_OPTIONAL,
16462 /* If there was exactly one decl-specifier, and it declared a class,
16463 and there's no declarator, then we have an explicit type
16464 instantiation. */
16466 {
16467 tree type;
16471 /* Turn access control back on for names used during
16472 template instantiation. */
16477 }
16478 else
16479 {
16481 tree decl;
16483 /* Parse the declarator. */
16484 declarator
16495 {
16498 "explicit instantiation shall not use"
16502 "explicit instantiation shall not use"
16507 /* Turn access control back on for names used during
16508 template instantiation. */
16510 /* Do the explicit instantiation. */
16512 }
16513 else
16514 {
16516 /* Skip the body of the explicit instantiation. */
16518 }
16519 }
16520 /* We're done with the instantiation. */
16526 }
16528 /* Parse an explicit-specialization.
16530 explicit-specialization:
16531 template < > declaration
16533 Although the standard says `declaration', what it really means is:
16535 explicit-specialization:
16536 template <> decl-specifier [opt] init-declarator [opt] ;
16537 template <> function-definition
16538 template <> explicit-specialization
16539 template <> template-declaration */
16541 static void
16543 {
16547 /* Look for the `template' keyword. */
16549 /* Look for the `<'. */
16551 /* Look for the `>'. */
16553 /* We have processed another parameter list. */
16555 /* [temp]
16557 A template ... explicit specialization ... shall not have C
16558 linkage. */
16560 {
16563 /* Give it C++ linkage to avoid confusing other parts of the
16564 front end. */
16567 }
16568 else
16570 /* Let the front end know that we are beginning a specialization. */
16572 {
16575 }
16577 /* If the next keyword is `template', we need to figure out whether
16578 or not we're looking a template-declaration. */
16580 {
16585 else
16587 }
16588 else
16589 /* Parse the dependent declaration. */
16595 /* We're done with the specialization. */
16597 /* For the erroneous case of a template with C linkage, we pushed an
16598 implicit C++ linkage scope; exit that scope now. */
16601 /* We're done with this parameter list. */
16603 }
16605 /* Parse a type-specifier.
16607 type-specifier:
16608 simple-type-specifier
16609 class-specifier
16610 enum-specifier
16611 elaborated-type-specifier
16612 cv-qualifier
16614 GNU Extension:
16616 type-specifier:
16617 __complex__
16619 Returns a representation of the type-specifier. For a
16620 class-specifier, enum-specifier, or elaborated-type-specifier, a
16621 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16623 The parser flags FLAGS is used to control type-specifier parsing.
16625 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16626 in a decl-specifier-seq.
16628 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16629 class-specifier, enum-specifier, or elaborated-type-specifier, then
16630 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16631 if a type is declared; 2 if it is defined. Otherwise, it is set to
16632 zero.
16634 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16635 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16636 is set to FALSE. */
16638 static tree
16640 cp_parser_flags flags,
16645 {
16651 /* Assume this type-specifier does not declare a new type. */
16654 /* And that it does not specify a cv-qualifier. */
16657 /* Peek at the next token. */
16660 /* If we're looking at a keyword, we can use that to guide the
16661 production we choose. */
16664 {
16669 /* Look for the enum-specifier. */
16671 /* If that worked, we're done. */
16673 {
16678 type_spec,
16679 token,
16682 }
16683 else
16686 /* Any of these indicate either a class-specifier, or an
16687 elaborated-type-specifier. */
16694 /* Parse tentatively so that we can back up if we don't find a
16695 class-specifier. */
16697 /* Look for the class-specifier. */
16700 /* If that worked, we're done. */
16702 {
16707 type_spec,
16708 token,
16711 }
16713 /* Fall through. */
16714 elaborated_type_specifier:
16715 /* We're declaring (not defining) a class or enum. */
16719 /* Fall through. */
16721 /* Look for an elaborated-type-specifier. */
16722 type_spec
16723 = (cp_parser_elaborated_type_specifier
16726 is_declaration));
16729 type_spec,
16730 token,
16753 /* The `__complex__' keyword is a GNU extension. */
16759 }
16761 /* Handle simple keywords. */
16763 {
16765 {
16768 }
16770 }
16772 /* If we do not already have a type-specifier, assume we are looking
16773 at a simple-type-specifier. */
16775 decl_specs,
16776 flags);
16778 /* If we didn't find a type-specifier, and a type-specifier was not
16779 optional in this context, issue an error message. */
16781 {
16784 }
16787 }
16789 /* Parse a simple-type-specifier.
16791 simple-type-specifier:
16792 :: [opt] nested-name-specifier [opt] type-name
16793 :: [opt] nested-name-specifier template template-id
16794 char
16795 wchar_t
16796 bool
16797 short
16798 int
16799 long
16800 signed
16801 unsigned
16802 float
16803 double
16804 void
16806 C++11 Extension:
16808 simple-type-specifier:
16809 auto
16810 decltype ( expression )
16811 char16_t
16812 char32_t
16813 __underlying_type ( type-id )
16815 C++17 extension:
16817 nested-name-specifier(opt) template-name
16819 GNU Extension:
16821 simple-type-specifier:
16822 __int128
16823 __typeof__ unary-expression
16824 __typeof__ ( type-id )
16825 __typeof__ ( type-id ) { initializer-list , [opt] }
16827 Concepts Extension:
16829 simple-type-specifier:
16830 constrained-type-specifier
16832 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16833 appropriately updated. */
16835 static tree
16838 cp_parser_flags flags)
16839 {
16844 /* Peek at the next token. */
16847 /* If we're looking at a keyword, things are easy. */
16849 {
16884 {
16887 }
16916 {
16917 /* The 'auto' might be the placeholder return type for a function decl
16918 with trailing return type. */
16927 {
16929 {
16936 }
16939 {
16942 }
16945 }
16949 {
16952 }
16955 {
16958 }
16959 else
16963 {
16966 "use of %<auto%> in lambda parameter declaration "
16967 "only available with "
16969 }
16972 "use of %<auto%> in parameter declaration "
16973 "only available with "
16977 "ISO C++ forbids use of %<auto%> in parameter "
16979 }
16980 else
16985 /* Since DR 743, decltype can either be a simple-type-specifier by
16986 itself or begin a nested-name-specifier. Parsing it will replace
16987 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16988 handling below decide what to do. */
16994 /* Consume the `typeof' token. */
16996 /* Parse the operand to `typeof'. */
16998 /* If it is not already a TYPE, take its type. */
17004 token,
17013 token,
17023 token,
17028 }
17030 /* If token is an already-parsed decltype not followed by ::,
17031 it's a simple-type-specifier. */
17034 {
17037 {
17039 token,
17041 /* Remember that we are handling a decltype in order to
17042 implement the resolution of DR 1510 when the argument
17043 isn't instantiation dependent. */
17045 }
17048 }
17050 /* If the type-specifier was for a built-in type, we're done. */
17052 {
17053 /* Record the type. */
17060 type,
17061 token,
17066 /* Consume the token. */
17072 /* There is no valid C++ program where a non-template type is
17073 followed by a "<". That usually indicates that the user thought
17074 that the type was a template. */
17079 }
17081 /* The type-specifier must be a user-defined type. */
17083 {
17087 /* Don't gobble tokens or issue error messages if this is an
17088 optional type-specifier. */
17094 /* Look for the optional `::' operator. */
17095 global_p
17099 /* Look for the nested-name specifier. */
17100 qualified_p
17107 /* If we have seen a nested-name-specifier, and the next token
17108 is `template', then we are using the template-id production. */
17111 {
17112 /* Look for the template-id. */
17116 none_type,
17118 /* If the template-id did not name a type, we are out of
17119 luck. */
17121 {
17124 }
17125 }
17126 /* Otherwise, look for a type-name. */
17127 else
17129 /* Keep track of all name-lookups performed in class scopes. */
17131 && !global_p
17132 && !qualified_p
17136 /* If it didn't work out, we don't have a TYPE. */
17141 {
17155 {
17157 none_type,
17167 else
17168 {
17173 }
17174 }
17175 else
17181 }
17184 token,
17186 }
17188 /* If we didn't get a type-name, issue an error message. */
17190 {
17193 }
17196 {
17197 /* See if TYPE is an Objective-C type, and if so, parse and
17198 accept any protocol references following it. Do this before
17199 the cp_parser_check_for_invalid_template_id() call, because
17200 Objective-C types can be followed by '<...>' which would
17201 enclose protocol names rather than template arguments, and so
17202 everything is fine. */
17205 {
17209 /* Clobber the "unqualified" type previously entered into
17210 DECL_SPECS with the new, improved protocol-qualified version. */
17215 }
17217 /* There is no valid C++ program where a non-template type is
17218 followed by a "<". That usually indicates that the user
17219 thought that the type was a template. */
17221 none_type,
17223 }
17226 }
17228 /* Parse a type-name.
17230 type-name:
17231 class-name
17232 enum-name
17233 typedef-name
17234 simple-template-id [in c++0x]
17236 enum-name:
17237 identifier
17239 typedef-name:
17240 identifier
17242 Concepts:
17244 type-name:
17245 concept-name
17246 partial-concept-id
17248 concept-name:
17249 identifier
17251 Returns a TYPE_DECL for the type. */
17253 static tree
17255 {
17257 }
17259 /* See above. */
17260 static tree
17262 {
17263 tree type_decl;
17265 /* We can't know yet whether it is a class-name or not. */
17267 /* Try a class-name. */
17269 typename_keyword_p,
17271 none_type,
17275 /* If it's not a class-name, keep looking. */
17277 {
17279 /* It must be a typedef-name or an enum-name. */
17283 /* It is either a simple-template-id representing an
17284 instantiation of an alias template... */
17288 none_type,
17290 /* Note that this must be an instantiation of an alias template
17291 because [temp.names]/6 says:
17293 A template-id that names an alias template specialization
17294 is a type-name.
17296 Whereas [temp.names]/7 says:
17298 A simple-template-id that names a class template
17299 specialization is a class-name.
17301 With concepts, this could also be a partial-concept-id that
17302 declares a non-type template parameter. */
17309 else
17313 /* ... Or a typedef-name or an enum-name. */
17315 }
17318 }
17320 /* Check if DECL and ARGS can form a constrained-type-specifier.
17321 If ARGS is non-null, we try to form a concept check of the
17322 form DECL<?, ARGS> where ? is a wildcard that matches any
17323 kind of template argument. If ARGS is NULL, then we try to
17324 form a concept check of the form DECL<?>. */
17326 static tree
17329 {
17332 /* If we a constrained-type-specifier cannot be deduced. */
17336 /* A constrained type specifier can only be found in an
17337 overload set or as a reference to a template declaration.
17339 FIXME: This might be masking a bug. It's possible that
17340 that the deduction below is causing template specializations
17341 to be formed with the wildcard as an argument. */
17345 /* Try to build a call expression that evaluates the
17346 concept. This can fail if the overload set refers
17347 only to non-templates. */
17353 /* Deduce the checked constraint and the prototype parameter.
17355 FIXME: In certain cases, failure to deduce should be a
17356 diagnosable error. */
17357 tree conc;
17358 tree proto;
17362 /* In template parameter scope, this results in a constrained
17363 parameter. Return a descriptor of that parm. */
17367 /* In a parameter-declaration-clause, constrained-type
17368 specifiers result in invented template parameters. */
17370 {
17373 }
17374 else
17375 {
17376 /* Otherwise, we're in a context where the constrained
17377 type name is deduced and the constraint applies
17378 after deduction. */
17380 }
17383 }
17385 /* If DECL refers to a concept, return a TYPE_DECL representing
17386 the result of using the constrained type specifier in the
17387 current context. DECL refers to a concept if
17389 - it is an overload set containing a function concept taking a single
17390 type argument, or
17392 - it is a variable concept taking a single type argument. */
17394 static tree
17396 {
17402 else
17404 }
17406 /* Check if DECL and ARGS form a partial-concept-id. If so,
17407 assign ID to the resulting constrained placeholder.
17409 Returns true if the partial-concept-id designates a placeholder
17410 and false otherwise. Note that *id is set to NULL_TREE in
17411 this case. */
17413 static tree
17415 {
17417 }
17419 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17420 or a concept-name.
17422 enum-name:
17423 identifier
17425 typedef-name:
17426 identifier
17428 concept-name:
17429 identifier
17431 Returns a TYPE_DECL for the type. */
17433 static tree
17435 {
17436 tree type_decl;
17437 tree identifier;
17444 /* Look up the type-name. */
17449 /* If we found an overload set, then it may refer to a concept-name. */
17455 {
17456 /* See if this is an Objective-C type. */
17461 }
17463 /* Issue an error if we did not find a type-name. */
17465 /* In Objective-C, we have the complication that class names are
17466 normally type names and start declarations (eg, the
17467 "NSObject" in "NSObject *object;"), but can be used in an
17468 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17469 is an expression. So, a classname followed by a dot is not a
17470 valid type-name. */
17473 {
17478 }
17479 /* Remember that the name was used in the definition of the
17480 current class so that we can check later to see if the
17481 meaning would have been different after the class was
17482 entirely defined. */
17488 }
17490 /* Parse an elaborated-type-specifier. Note that the grammar given
17491 here incorporates the resolution to DR68.
17493 elaborated-type-specifier:
17494 class-key :: [opt] nested-name-specifier [opt] identifier
17495 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17496 enum-key :: [opt] nested-name-specifier [opt] identifier
17497 typename :: [opt] nested-name-specifier identifier
17498 typename :: [opt] nested-name-specifier template [opt]
17499 template-id
17501 GNU extension:
17503 elaborated-type-specifier:
17504 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17505 class-key attributes :: [opt] nested-name-specifier [opt]
17506 template [opt] template-id
17507 enum attributes :: [opt] nested-name-specifier [opt] identifier
17509 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17510 declared `friend'. If IS_DECLARATION is TRUE, then this
17511 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17512 something is being declared.
17514 Returns the TYPE specified. */
17516 static tree
17520 {
17522 tree identifier;
17525 tree globalscope;
17528 /* See if we're looking at the `enum' keyword. */
17530 {
17531 /* Consume the `enum' token. */
17533 /* Remember that it's an enumeration type. */
17535 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17536 enums) is used here. */
17540 {
17547 /* Consume the `struct' or `class' and parse it anyway. */
17549 }
17550 /* Parse the attributes. */
17552 }
17553 /* Or, it might be `typename'. */
17555 RID_TYPENAME))
17556 {
17557 /* Consume the `typename' token. */
17559 /* Remember that it's a `typename' type. */
17561 }
17562 /* Otherwise it must be a class-key. */
17563 else
17564 {
17568 /* Parse the attributes. */
17570 }
17572 /* Look for the `::' operator. */
17575 /* Look for the nested-name-specifier. */
17576 tree nested_name_specifier;
17578 {
17579 nested_name_specifier
17584 is_declaration);
17587 }
17588 else
17589 /* Even though `typename' is not present, the proposed resolution
17590 to Core Issue 180 says that in `class A<T>::B', `B' should be
17591 considered a type-name, even if `A<T>' is dependent. */
17592 nested_name_specifier
17597 is_declaration);
17598 /* For everything but enumeration types, consider a template-id.
17599 For an enumeration type, consider only a plain identifier. */
17601 {
17603 tree decl;
17605 /* Allow the `template' keyword. */
17607 /* If we didn't see `template', we don't know if there's a
17608 template-id or not. */
17611 /* Parse the template-id. */
17615 tag_type,
17616 is_declaration);
17617 /* If we didn't find a template-id, look for an ordinary
17618 identifier. */
17620 ;
17621 /* We can get here when cp_parser_template_id, called by
17622 cp_parser_class_name with tag_type == none_type, succeeds
17623 and caches a BASELINK. Then, when called again here,
17624 instead of failing and returning an error_mark_node
17625 returns it (see template/typename17.C in C++11).
17626 ??? Could we diagnose this earlier? */
17628 {
17631 }
17632 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17633 in effect, then we must assume that, upon instantiation, the
17634 template will correspond to a class. */
17638 typename_type,
17640 /* If the `typename' keyword is in effect and DECL is not a type
17641 decl, then type is non existent. */
17643 ;
17645 {
17649 /* If the next token is a semicolon, this must be a specialization,
17650 instantiation, or friend declaration. Check the scope while we
17651 still know whether or not we had a nested-name-specifier. */
17656 }
17659 }
17662 {
17667 {
17670 }
17672 /* For a `typename', we needn't call xref_tag. */
17678 /* Template parameter lists apply only if we are not within a
17679 function parameter list. */
17680 bool template_parm_lists_apply
17689 /* Look up a qualified name in the usual way. */
17691 {
17692 tree decl;
17693 tree ambiguous_decls;
17696 tag_type,
17703 /* If the lookup was ambiguous, an error will already have been
17704 issued. */
17708 /* If we are parsing friend declaration, DECL may be a
17709 TEMPLATE_DECL tree node here. However, we need to check
17710 whether this TEMPLATE_DECL results in valid code. Consider
17711 the following example:
17713 namespace N {
17714 template <class T> class C {};
17715 }
17716 class X {
17717 template <class T> friend class N::C; // #1, valid code
17718 };
17719 template <class T> class Y {
17720 friend class N::C; // #2, invalid code
17721 };
17723 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17724 name lookup of `N::C'. We see that friend declaration must
17725 be template for the code to be valid. Note that
17726 processing_template_decl does not work here since it is
17727 always 1 for the above two cases. */
17729 decl = (cp_parser_maybe_treat_template_as_class
17734 {
17736 identifier,
17739 }
17742 {
17746 allow_template);
17750 }
17752 /* Forward declarations of nested types, such as
17754 class C1::C2;
17755 class C1::C2::C3;
17757 are invalid unless all components preceding the final '::'
17758 are complete. If all enclosing types are complete, these
17759 declarations become merely pointless.
17761 Invalid forward declarations of nested types are errors
17762 caught elsewhere in parsing. Those that are pointless arrive
17763 here. */
17770 }
17771 else
17772 {
17773 /* An elaborated-type-specifier sometimes introduces a new type and
17774 sometimes names an existing type. Normally, the rule is that it
17775 introduces a new type only if there is not an existing type of
17776 the same name already in scope. For example, given:
17778 struct S {};
17779 void f() { struct S s; }
17781 the `struct S' in the body of `f' is the same `struct S' as in
17782 the global scope; the existing definition is used. However, if
17783 there were no global declaration, this would introduce a new
17784 local class named `S'.
17786 An exception to this rule applies to the following code:
17788 namespace N { struct S; }
17790 Here, the elaborated-type-specifier names a new type
17791 unconditionally; even if there is already an `S' in the
17792 containing scope this declaration names a new type.
17793 This exception only applies if the elaborated-type-specifier
17794 forms the complete declaration:
17796 [class.name]
17798 A declaration consisting solely of `class-key identifier ;' is
17799 either a redeclaration of the name in the current scope or a
17800 forward declaration of the identifier as a class name. It
17801 introduces the name into the current scope.
17803 We are in this situation precisely when the next token is a `;'.
17805 An exception to the exception is that a `friend' declaration does
17806 *not* name a new type; i.e., given:
17808 struct S { friend struct T; };
17810 `T' is not a new type in the scope of `S'.
17812 Also, `new struct S' or `sizeof (struct S)' never results in the
17813 definition of a new type; a new type can only be declared in a
17814 declaration context. */
17816 tag_scope ts;
17820 /* Friends have special name lookup rules. */
17824 CPP_SEMICOLON))
17825 /* This is a `class-key identifier ;' */
17827 else
17830 template_p =
17831 (template_parm_lists_apply
17834 /* An unqualified name was used to reference this type, so
17835 there were no qualifying templates. */
17843 }
17844 }
17849 /* Allow attributes on forward declarations of classes. */
17851 {
17861 else
17864 }
17867 {
17868 /* Indicate whether this class was declared as a `class' or as a
17869 `struct'. */
17873 }
17875 /* A "<" cannot follow an elaborated type specifier. If that
17876 happens, the user was probably trying to form a template-id. */
17881 }
17883 /* Parse an enum-specifier.
17885 enum-specifier:
17886 enum-head { enumerator-list [opt] }
17887 enum-head { enumerator-list , } [C++0x]
17889 enum-head:
17890 enum-key identifier [opt] enum-base [opt]
17891 enum-key nested-name-specifier identifier enum-base [opt]
17893 enum-key:
17894 enum
17895 enum class [C++0x]
17896 enum struct [C++0x]
17898 enum-base: [C++0x]
17899 : type-specifier-seq
17901 opaque-enum-specifier:
17902 enum-key identifier enum-base [opt] ;
17904 GNU Extensions:
17905 enum-key attributes[opt] identifier [opt] enum-base [opt]
17906 { enumerator-list [opt] }attributes[opt]
17907 enum-key attributes[opt] identifier [opt] enum-base [opt]
17908 { enumerator-list, }attributes[opt] [C++0x]
17910 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17911 if the token stream isn't an enum-specifier after all. */
17913 static tree
17915 {
17916 tree identifier;
17918 tree prev_scope;
17920 tree attributes;
17933 /* Parse tentatively so that we can back up if we don't find a
17934 enum-specifier. */
17937 /* Caller guarantees that the current token is 'enum', an identifier
17938 possibly follows, and the token after that is an opening brace.
17939 If we don't have an identifier, fabricate an anonymous name for
17940 the enumeration being defined. */
17943 /* Parse the "class" or "struct", which indicates a scoped
17944 enumeration type in C++0x. */
17947 {
17951 /* Consume the `struct' or `class' token. */
17955 }
17959 /* Clear the qualification. */
17964 /* Figure out in what scope the declaration is being placed. */
17970 nested_name_specifier
17978 {
17979 tree name;
17983 enum_type,
17988 input_location);
17990 {
17993 {
17994 /* Are template enums allowed in ISO? */
17998 /* ignore a typename reference, for it will be solved by name
17999 in start_enum. */
18001 }
18002 }
18005 else
18006 {
18011 }
18012 }
18013 else
18014 {
18017 else
18018 {
18024 }
18025 }
18028 /* Check for the `:' that denotes a specified underlying type in C++0x.
18029 Note that a ':' could also indicate a bitfield width, however. */
18031 {
18032 cp_decl_specifier_seq type_specifiers;
18034 /* Consume the `:'. */
18037 /* Parse the type-specifier-seq. */
18042 /* At this point this is surely not elaborated type specifier. */
18051 /* If that didn't work, stop. */
18053 {
18059 }
18060 }
18062 /* Look for the `{' but don't consume it yet. */
18064 {
18066 {
18069 {
18072 }
18073 }
18074 /* An opaque-enum-specifier must have a ';' here. */
18077 {
18080 {
18083 }
18084 }
18085 }
18091 {
18093 {
18097 }
18099 {
18101 }
18102 }
18104 /* Issue an error message if type-definitions are forbidden here. */
18107 else
18108 /* Create the new type. We do this before consuming the opening
18109 brace so the enum will be recorded as being on the line of its
18110 tag (or the 'enum' keyword, if there is no tag). */
18114 /* If the next token is not '{' it is an opaque-enum-specifier or an
18115 elaborated-type-specifier. */
18117 {
18121 {
18122 /* The following catches invalid code such as:
18123 enum class S<int>::E { A, B, C }; */
18131 {
18135 nested_name_specifier);
18137 }
18140 {
18142 "%qT for enum declaration does not name a class "
18145 }
18146 /* If that scope does not contain the scope in which the
18147 class was originally declared, the program is invalid. */
18149 nested_name_specifier))
18150 {
18153 "declaration of %qD in namespace %qD which does not "
18156 else
18158 "declaration of %qD in %qD which does not "
18162 }
18163 /* If that scope is the scope where the declaration is being placed
18164 the program is invalid. */
18168 {
18172 }
18173 }
18178 /* Consume the opening brace. */
18179 matching_braces braces;
18186 {
18190 }
18191 else
18192 {
18198 }
18202 /* If the next token is not '}', then there are some enumerators. */
18204 {
18208 }
18209 else
18212 /* Consume the final '}'. */
18218 }
18219 else
18220 {
18221 /* If a ';' follows, then it is an opaque-enum-specifier
18222 and additional restrictions apply. */
18224 {
18231 }
18232 }
18234 /* Look for trailing attributes to apply to this enumeration, and
18235 apply them if appropriate. */
18237 {
18240 trailing_attr,
18242 }
18244 /* Finish up the enumeration. */
18246 {
18251 }
18254 {
18256 {
18259 }
18261 {
18263 }
18264 }
18265 out:
18268 }
18270 /* Parse an enumerator-list. The enumerators all have the indicated
18271 TYPE.
18273 enumerator-list:
18274 enumerator-definition
18275 enumerator-list , enumerator-definition */
18277 static void
18279 {
18281 {
18282 /* Parse an enumerator-definition. */
18285 /* If the next token is not a ',', we've reached the end of
18286 the list. */
18289 /* Otherwise, consume the `,' and keep going. */
18291 /* If the next token is a `}', there is a trailing comma. */
18293 {
18298 }
18299 }
18300 }
18302 /* Parse an enumerator-definition. The enumerator has the indicated
18303 TYPE.
18305 enumerator-definition:
18306 enumerator
18307 enumerator = constant-expression
18309 enumerator:
18310 identifier
18312 GNU Extensions:
18314 enumerator-definition:
18315 enumerator attributes [opt]
18316 enumerator attributes [opt] = constant-expression */
18318 static void
18320 {
18321 tree identifier;
18322 tree value;
18323 location_t loc;
18325 /* Save the input location because we are interested in the location
18326 of the identifier and not the location of the explicit value. */
18329 /* Look for the identifier. */
18334 /* Parse any specified attributes. */
18337 /* If the next token is an '=', then there is an explicit value. */
18339 {
18340 /* Consume the `=' token. */
18342 /* Parse the value. */
18344 }
18345 else
18348 /* If we are processing a template, make sure the initializer of the
18349 enumerator doesn't contain any bare template parameter pack. */
18353 /* Create the enumerator. */
18355 }
18357 /* Parse a namespace-name.
18359 namespace-name:
18360 original-namespace-name
18361 namespace-alias
18363 Returns the NAMESPACE_DECL for the namespace. */
18365 static tree
18367 {
18368 tree identifier;
18369 tree namespace_decl;
18373 /* Get the name of the namespace. */
18378 /* Look up the identifier in the currently active scope. Look only
18379 for namespaces, due to:
18381 [basic.lookup.udir]
18383 When looking up a namespace-name in a using-directive or alias
18384 definition, only namespace names are considered.
18386 And:
18388 [basic.lookup.qual]
18390 During the lookup of a name preceding the :: scope resolution
18391 operator, object, function, and enumerator names are ignored.
18393 (Note that cp_parser_qualifying_entity only calls this
18394 function if the token after the name is the scope resolution
18395 operator.) */
18397 none_type,
18403 /* If it's not a namespace, issue an error. */
18406 {
18408 {
18414 }
18417 }
18420 }
18422 /* Parse a namespace-definition.
18424 namespace-definition:
18425 named-namespace-definition
18426 unnamed-namespace-definition
18428 named-namespace-definition:
18429 original-namespace-definition
18430 extension-namespace-definition
18432 original-namespace-definition:
18433 namespace identifier { namespace-body }
18435 extension-namespace-definition:
18436 namespace original-namespace-name { namespace-body }
18438 unnamed-namespace-definition:
18439 namespace { namespace-body } */
18441 static void
18443 {
18444 tree identifier;
18453 {
18456 }
18458 /* Look for the `namespace' keyword. */
18459 cp_token* token
18462 /* Parse any specified attributes before the identifier. */
18466 {
18470 {
18473 /* Parse any attributes specified after the identifier. */
18475 }
18482 "nested namespace definitions only available with "
18485 /* Nested namespace names can create new namespaces (unlike
18486 other qualified-ids). */
18489 else
18492 }
18504 /* Start the namespace. */
18511 /* Look for the `{' to validate starting the namespace. */
18512 matching_braces braces;
18514 {
18515 /* Parse the body of the namespace. */
18518 /* Look for the final `}'. */
18520 }
18525 /* Pop the nested namespace definitions. */
18528 }
18530 /* Parse a namespace-body.
18532 namespace-body:
18533 declaration-seq [opt] */
18535 static void
18537 {
18539 }
18541 /* Parse a namespace-alias-definition.
18543 namespace-alias-definition:
18544 namespace identifier = qualified-namespace-specifier ; */
18546 static void
18548 {
18549 tree identifier;
18550 tree namespace_specifier;
18554 /* Look for the `namespace' keyword. */
18556 /* Look for the identifier. */
18560 /* Look for the `=' token. */
18563 {
18565 /* Skip the definition. */
18570 }
18572 /* Look for the qualified-namespace-specifier. */
18573 namespace_specifier
18575 /* Look for the `;' token. */
18578 /* Register the alias in the symbol table. */
18580 }
18582 /* Parse a qualified-namespace-specifier.
18584 qualified-namespace-specifier:
18585 :: [opt] nested-name-specifier [opt] namespace-name
18587 Returns a NAMESPACE_DECL corresponding to the specified
18588 namespace. */
18590 static tree
18592 {
18593 /* Look for the optional `::'. */
18597 /* Look for the optional nested-name-specifier. */
18605 }
18607 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18608 access declaration.
18610 using-declaration:
18611 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18612 using :: unqualified-id ;
18614 access-declaration:
18615 qualified-id ;
18617 */
18619 static bool
18622 {
18626 tree decl;
18627 tree identifier;
18628 tree qscope;
18633 {
18636 }
18637 else
18638 {
18639 /* Look for the `using' keyword. */
18642 again:
18643 /* Peek at the next token. */
18645 /* See if it's `typename'. */
18647 {
18648 /* Remember that we've seen it. */
18650 /* Consume the `typename' token. */
18652 }
18653 }
18655 /* Look for the optional global scope qualification. */
18656 global_scope_p
18661 /* If we saw `typename', or didn't see `::', then there must be a
18662 nested-name-specifier present. */
18664 {
18670 {
18673 }
18674 }
18675 /* Otherwise, we could be in either of the two productions. In that
18676 case, treat the nested-name-specifier as optional. */
18677 else
18689 /* Something has already gone wrong; there's no need to parse
18690 further. Since an error has occurred, the return value of
18691 cp_parser_parse_definitely will be false, as required. */
18695 /* Parse the unqualified-id. */
18703 {
18708 }
18710 {
18715 "pack expansion in using-declaration only available "
18718 }
18720 /* The function we call to handle a using-declaration is different
18721 depending on what scope we are in. */
18723 ;
18726 /* [namespace.udecl]
18728 A using declaration shall not name a template-id. */
18731 else
18732 {
18734 {
18735 /* Create the USING_DECL. */
18742 {
18745 }
18746 else
18747 /* Add it to the list of members in this class. */
18749 }
18750 else
18751 {
18753 identifier,
18760 {
18763 }
18766 else
18768 }
18769 }
18773 {
18777 "comma-separated list in using-declaration only available "
18780 }
18782 /* Look for the final `;'. */
18787 "access declarations are deprecated "
18788 "in favour of using-declarations; "
18792 }
18794 /* Parse an alias-declaration.
18796 alias-declaration:
18797 using identifier attribute-specifier-seq [opt] = type-id */
18799 static tree
18801 {
18803 location_t id_location;
18805 cp_decl_specifier_seq decl_specs;
18809 /* Look for the `using' keyword. */
18810 cp_token *using_token
18832 /* Now we are going to parse the type-id of the declaration. */
18834 /*
18835 [dcl.type]/3 says:
18837 "A type-specifier-seq shall not define a class or enumeration
18838 unless it appears in the type-id of an alias-declaration (7.1.3) that
18839 is not the declaration of a template-declaration."
18841 In other words, if we currently are in an alias template, the
18842 type-id should not define a type.
18844 So let's set parser->type_definition_forbidden_message in that
18845 case; cp_parser_check_type_definition (called by
18846 cp_parser_class_specifier) will then emit an error if a type is
18847 defined in the type-id. */
18849 {
18853 }
18857 /* Restore the error message if need be. */
18863 {
18866 }
18868 /* A typedef-name can also be introduced by an alias-declaration. The
18869 identifier following the using keyword becomes a typedef-name. It has
18870 the same semantics as if it were introduced by the typedef
18871 specifier. In particular, it does not define a new type and it shall
18872 not appear in the type-id. */
18877 {
18880 ds_attribute,
18881 attrs_token);
18882 }
18884 ds_typedef,
18885 using_token);
18887 ds_alias,
18888 using_token);
18897 else
18903 // Attach constraints to the alias declaration.
18905 {
18909 }
18916 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18917 added into the symbol table; otherwise, return the TYPE_DECL. */
18921 {
18925 }
18928 }
18930 /* Parse a using-directive.
18932 using-directive:
18933 using namespace :: [opt] nested-name-specifier [opt]
18934 namespace-name ; */
18936 static void
18938 {
18939 tree namespace_decl;
18940 tree attribs;
18942 /* Look for the `using' keyword. */
18944 /* And the `namespace' keyword. */
18946 /* Look for the optional `::' operator. */
18948 /* And the optional nested-name-specifier. */
18954 /* Get the namespace being used. */
18956 /* And any specified attributes. */
18959 /* Update the symbol table. */
18962 else
18965 /* Look for the final `;'. */
18967 }
18969 /* Parse an asm-definition.
18971 asm-definition:
18972 asm ( string-literal ) ;
18974 GNU Extension:
18976 asm-definition:
18977 asm volatile [opt] ( string-literal ) ;
18978 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18979 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18980 : asm-operand-list [opt] ) ;
18981 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18982 : asm-operand-list [opt]
18983 : asm-clobber-list [opt] ) ;
18984 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18985 : asm-clobber-list [opt]
18986 : asm-goto-list ) ; */
18988 static void
18990 {
18991 tree string;
18996 tree asm_stmt;
19004 /* Look for the `asm' keyword. */
19009 {
19012 }
19014 /* See if the next token is `volatile'. */
19017 {
19018 /* Remember that we saw the `volatile' keyword. */
19020 /* Consume the token. */
19022 }
19026 {
19027 /* Remember that we saw the `goto' keyword. */
19029 /* Consume the token. */
19031 }
19032 /* Look for the opening `('. */
19035 /* Look for the string. */
19038 {
19042 }
19044 /* If we're allowing GNU extensions, check for the extended assembly
19045 syntax. Unfortunately, the `:' tokens need not be separated by
19046 a space in C, and so, for compatibility, we tolerate that here
19047 too. Doing that means that we have to treat the `::' operator as
19048 two `:' tokens. */
19053 {
19058 /* The extended syntax was used. */
19061 /* Look for outputs. */
19063 {
19064 /* Consume the `:'. */
19066 /* Parse the output-operands. */
19068 CPP_COLON)
19070 CPP_SCOPE)
19072 CPP_CLOSE_PAREN)
19074 {
19078 }
19079 }
19080 /* If the next token is `::', there are no outputs, and the
19081 next token is the beginning of the inputs. */
19083 /* The inputs are coming next. */
19086 /* Look for inputs. */
19089 {
19090 /* Consume the `:' or `::'. */
19092 /* Parse the output-operands. */
19094 CPP_COLON)
19096 CPP_SCOPE)
19098 CPP_CLOSE_PAREN))
19099 {
19103 }
19104 }
19106 /* The clobbers are coming next. */
19109 /* Look for clobbers. */
19112 {
19114 /* Consume the `:' or `::'. */
19116 /* Parse the clobbers. */
19118 CPP_COLON)
19120 CPP_CLOSE_PAREN))
19122 }
19125 /* The labels are coming next. */
19128 /* Look for labels. */
19131 {
19133 /* Consume the `:' or `::'. */
19135 /* Parse the labels. */
19137 }
19141 }
19145 /* Look for the closing `)'. */
19153 {
19154 /* Create the ASM_EXPR. */
19156 {
19159 /* If the extended syntax was not used, mark the ASM_EXPR. */
19161 {
19167 }
19168 }
19169 else
19171 }
19172 }
19174 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19175 type that comes from the decl-specifier-seq. */
19177 static tree
19179 {
19182 {
19195 }
19198 }
19200 /* Declarators [gram.dcl.decl] */
19202 /* Parse an init-declarator.
19204 init-declarator:
19205 declarator initializer [opt]
19207 GNU Extension:
19209 init-declarator:
19210 declarator asm-specification [opt] attributes [opt] initializer [opt]
19212 function-definition:
19213 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19214 function-body
19215 decl-specifier-seq [opt] declarator function-try-block
19217 GNU Extension:
19219 function-definition:
19220 __extension__ function-definition
19222 TM Extension:
19224 function-definition:
19225 decl-specifier-seq [opt] declarator function-transaction-block
19227 The DECL_SPECIFIERS apply to this declarator. Returns a
19228 representation of the entity declared. If MEMBER_P is TRUE, then
19229 this declarator appears in a class scope. The new DECL created by
19230 this declarator is returned.
19232 The CHECKS are access checks that should be performed once we know
19233 what entity is being declared (and, therefore, what classes have
19234 befriended it).
19236 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19237 for a function-definition here as well. If the declarator is a
19238 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19239 be TRUE upon return. By that point, the function-definition will
19240 have been completely parsed.
19242 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19243 is FALSE.
19245 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19246 parsed declaration if it is an uninitialized single declarator not followed
19247 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19248 if present, will not be consumed. If returned, this declarator will be
19249 created with SD_INITIALIZED but will not call cp_finish_decl.
19251 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19252 and there is an initializer, the pointed location_t is set to the
19253 location of the '=' or `(', or '{' in C++11 token introducing the
19254 initializer. */
19256 static tree
19267 {
19271 tree prefix_attributes;
19273 tree asm_specification;
19274 tree initializer;
19276 tree scope;
19278 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19279 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19280 "(...)". */
19291 /* Gather the attributes that were provided with the
19292 decl-specifiers. */
19295 /* Assume that this is not the declarator for a function
19296 definition. */
19300 /* Default arguments are only permitted for function parameters. */
19304 /* Defer access checks while parsing the declarator; we cannot know
19305 what names are accessible until we know what is being
19306 declared. */
19311 /* Parse the declarator. */
19312 declarator
19317 /* Gather up the deferred checks. */
19322 /* If the DECLARATOR was erroneous, there's no need to go
19323 further. */
19327 /* Check that the number of template-parameter-lists is OK. */
19337 /* Figure out what scope the entity declared by the DECLARATOR is
19338 located in. `grokdeclarator' sometimes changes the scope, so
19339 we compute it now. */
19342 /* Perform any lookups in the declared type which were thought to be
19343 dependent, but are not in the scope of the declarator. */
19344 decl_specifiers->type
19347 /* If we're allowing GNU extensions, look for an
19348 asm-specification. */
19350 {
19351 /* Look for an asm-specification. */
19354 }
19355 else
19358 /* Look for attributes. */
19362 /* Peek at the next token. */
19368 {
19369 /* Handle C++17 deduction guides. */
19373 {
19381 {
19385 }
19386 }
19388 /* Check to see if the token indicates the start of a
19389 function-definition. */
19391 {
19393 {
19394 /* If a function-definition should not appear here, issue an
19395 error message. */
19399 }
19401 location_t func_brace_location
19404 /* Neither attributes nor an asm-specification are allowed
19405 on a function-definition. */
19408 "an asm-specification is not allowed "
19412 "attributes are not allowed "
19414 /* This is a function-definition. */
19417 /* Parse the function definition. */
19420 decl_specifiers,
19421 declarator,
19422 prefix_attributes);
19423 else
19424 decl =
19425 (cp_parser_function_definition_from_specifiers_and_declarator
19429 {
19430 /* This is where the prologue starts... */
19433 }
19436 }
19437 }
19439 {
19440 /* A non-template declaration involving a function parameter list
19441 containing an implicit template parameter will be made into a
19442 template. If the resulting declaration is not going to be an
19443 actual function then finish the template scope here to prevent it.
19444 An error message will be issued once we have a decl to talk about.
19446 FIXME probably we should do type deduction rather than create an
19447 implicit template, but the standard currently doesn't allow it. */
19450 }
19452 /* [dcl.dcl]
19454 Only in function declarations for constructors, destructors, type
19455 conversions, and deduction guides can the decl-specifier-seq be omitted.
19457 We explicitly postpone this check past the point where we handle
19458 function-definitions because we tolerate function-definitions
19459 that are missing their return types in some modes. */
19461 {
19465 }
19467 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19471 {
19482 {
19488 }
19489 }
19490 else
19491 {
19492 /* If the init-declarator isn't initialized and isn't followed by a
19493 `,' or `;', it's not a valid init-declarator. */
19496 {
19499 else
19500 {
19504 }
19505 }
19508 }
19510 /* Because start_decl has side-effects, we should only call it if we
19511 know we're going ahead. By this point, we know that we cannot
19512 possibly be looking at any other construct. */
19515 /* Enter the newly declared entry in the symbol table. If we're
19516 processing a declaration in a class-specifier, we wait until
19517 after processing the initializer. */
19519 {
19527 /* Adjust location of decl if declarator->id_loc is more appropriate:
19528 set, and decl wasn't merged with another decl, in which case its
19529 location would be different from input_location, and more accurate. */
19534 }
19536 /* Enter the SCOPE. That way unqualified names appearing in the
19537 initializer will be looked up in SCOPE. */
19540 /* Perform deferred access control checks, now that we know in which
19541 SCOPE the declared entity resides. */
19543 {
19546 /* If the entity being declared is a function, pretend that we
19547 are in its scope. If it is a `friend', it may have access to
19548 things that would not otherwise be accessible. */
19550 {
19553 }
19555 /* Perform access checks for template parameters. */
19558 /* Perform the access control checks for the declarator and the
19559 decl-specifiers. */
19562 /* Restore the saved value. */
19565 }
19567 /* Parse the initializer. */
19572 {
19574 {
19577 else
19578 {
19579 /* If the declaration was erroneous, we don't really
19580 know what the user intended, so just silently
19581 consume the initializer. */
19588 }
19589 }
19590 else
19591 {
19592 /* We want to record the extra mangling scope for in-class
19593 initializers of class members and initializers of static data
19594 member templates. The former involves deferring
19595 parsing of the initializer until end of class as with default
19596 arguments. So right here we only handle the latter. */
19606 }
19607 }
19609 /* The old parser allows attributes to appear after a parenthesized
19610 initializer. Mark Mitchell proposed removing this functionality
19611 on the GCC mailing lists on 2002-08-13. This parser accepts the
19612 attributes -- but ignores them. */
19619 /* And now complain about a non-function implicit template. */
19624 /* For an in-class declaration, use `grokfield' to create the
19625 declaration. */
19627 {
19629 {
19632 }
19641 }
19643 /* Finish processing the declaration. But, skip member
19644 declarations. */
19646 {
19649 asm_specification,
19650 /* If the initializer is in parentheses, then this is
19651 a direct-initialization, which means that an
19652 `explicit' constructor is OK. Otherwise, an
19653 `explicit' constructor cannot be used. */
19656 }
19659 /* Core issue #226 (C++0x only): A default template-argument
19660 shall not be specified in a friend class template
19661 declaration. */
19670 {
19673 else
19675 }
19682 }
19684 /* Parse a declarator.
19686 declarator:
19687 direct-declarator
19688 ptr-operator declarator
19690 abstract-declarator:
19691 ptr-operator abstract-declarator [opt]
19692 direct-abstract-declarator
19694 GNU Extensions:
19696 declarator:
19697 attributes [opt] direct-declarator
19698 attributes [opt] ptr-operator declarator
19700 abstract-declarator:
19701 attributes [opt] ptr-operator abstract-declarator [opt]
19702 attributes [opt] direct-abstract-declarator
19704 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19705 detect constructors, destructors, deduction guides, or conversion operators.
19706 It is set to -1 if the declarator is a name, and +1 if it is a
19707 function. Otherwise it is set to zero. Usually you just want to
19708 test for >0, but internally the negative value is used.
19710 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19711 a decl-specifier-seq unless it declares a constructor, destructor,
19712 or conversion. It might seem that we could check this condition in
19713 semantic analysis, rather than parsing, but that makes it difficult
19714 to handle something like `f()'. We want to notice that there are
19715 no decl-specifiers, and therefore realize that this is an
19716 expression, not a declaration.)
19718 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19719 the declarator is a direct-declarator of the form "(...)".
19721 MEMBER_P is true iff this declarator is a member-declarator.
19723 FRIEND_P is true iff this declarator is a friend. */
19727 cp_parser_declarator_kind dcl_kind,
19731 {
19734 cp_cv_quals cv_quals;
19735 tree class_type;
19738 /* Assume this is not a constructor, destructor, or type-conversion
19739 operator. */
19746 /* Check for the ptr-operator production. */
19748 /* Parse the ptr-operator. */
19754 /* If that worked, then we have a ptr-operator. */
19756 {
19757 /* If a ptr-operator was found, then this declarator was not
19758 parenthesized. */
19761 /* The dependent declarator is optional if we are parsing an
19762 abstract-declarator. */
19766 /* Parse the dependent declarator. */
19771 friend_p);
19773 /* If we are parsing an abstract-declarator, we must handle the
19774 case where the dependent declarator is absent. */
19779 declarator = cp_parser_make_indirect_declarator
19781 }
19782 /* Everything else is a direct-declarator. */
19783 else
19784 {
19787 CPP_OPEN_PAREN);
19789 ctor_dtor_or_conv_p,
19791 }
19796 }
19798 /* Parse a direct-declarator or direct-abstract-declarator.
19800 direct-declarator:
19801 declarator-id
19802 direct-declarator ( parameter-declaration-clause )
19803 cv-qualifier-seq [opt]
19804 ref-qualifier [opt]
19805 exception-specification [opt]
19806 direct-declarator [ constant-expression [opt] ]
19807 ( declarator )
19809 direct-abstract-declarator:
19810 direct-abstract-declarator [opt]
19811 ( parameter-declaration-clause )
19812 cv-qualifier-seq [opt]
19813 ref-qualifier [opt]
19814 exception-specification [opt]
19815 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19816 ( abstract-declarator )
19818 Returns a representation of the declarator. DCL_KIND is
19819 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19820 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19821 we are parsing a direct-declarator. It is
19822 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19823 of ambiguity we prefer an abstract declarator, as per
19824 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19825 as for cp_parser_declarator. */
19829 cp_parser_declarator_kind dcl_kind,
19832 {
19843 {
19844 /* Peek at the next token. */
19847 {
19848 /* This is either a parameter-declaration-clause, or a
19849 parenthesized declarator. When we know we are parsing a
19850 named declarator, it must be a parenthesized declarator
19851 if FIRST is true. For instance, `(int)' is a
19852 parameter-declaration-clause, with an omitted
19853 direct-abstract-declarator. But `((*))', is a
19854 parenthesized abstract declarator. Finally, when T is a
19855 template parameter `(T)' is a
19856 parameter-declaration-clause, and not a parenthesized
19857 named declarator.
19859 We first try and parse a parameter-declaration-clause,
19860 and then try a nested declarator (if FIRST is true).
19862 It is not an error for it not to be a
19863 parameter-declaration-clause, even when FIRST is
19864 false. Consider,
19866 int i (int);
19867 int i (3);
19869 The first is the declaration of a function while the
19870 second is the definition of a variable, including its
19871 initializer.
19873 Having seen only the parenthesis, we cannot know which of
19874 these two alternatives should be selected. Even more
19875 complex are examples like:
19877 int i (int (a));
19878 int i (int (3));
19880 The former is a function-declaration; the latter is a
19881 variable initialization.
19883 Thus again, we try a parameter-declaration-clause, and if
19884 that fails, we back out and return. */
19887 {
19888 tree params;
19893 /* In a member-declarator, the only valid interpretation
19894 of a parenthesis is the start of a
19895 parameter-declaration-clause. (It is invalid to
19896 initialize a static data member with a parenthesized
19897 initializer; only the "=" form of initialization is
19898 permitted.) */
19902 /* Consume the `('. */
19903 matching_parens parens;
19906 {
19907 /* If this is going to be an abstract declarator, we're
19908 in a declarator and we can't have default args. */
19911 }
19915 /* Parse the parameter-declaration-clause. */
19918 /* Consume the `)'. */
19921 /* If all went well, parse the cv-qualifier-seq,
19922 ref-qualifier and the exception-specification. */
19924 {
19925 cp_cv_quals cv_quals;
19926 cp_virt_specifiers virt_specifiers;
19927 cp_ref_qualifier ref_qual;
19928 tree exception_specification;
19929 tree late_return;
19930 tree attrs;
19940 /* Parse the cv-qualifier-seq. */
19942 /* Parse the ref-qualifier. */
19944 /* Parse the tx-qualifier. */
19946 /* And the exception-specification. */
19947 exception_specification
19952 /* In here, we handle cases where attribute is used after
19953 the function declaration. For example:
19954 void func (int x) __attribute__((vector(..))); */
19957 late_return = (cp_parser_late_return_type_opt
19961 /* Parse the virt-specifier-seq. */
19964 /* Create the function-declarator. */
19966 params,
19967 cv_quals,
19968 virt_specifiers,
19969 ref_qual,
19970 tx_qual,
19971 exception_specification,
19972 late_return,
19973 requires_clause);
19976 /* Any subsequent parameter lists are to do with
19977 return type, so are not those of the declared
19978 function. */
19980 }
19982 /* Remove the function parms from scope. */
19986 /* Repeat the main loop. */
19988 }
19990 /* If this is the first, we can try a parenthesized
19991 declarator. */
19993 {
20000 /* Consume the `('. */
20001 matching_parens parens;
20003 /* Parse the nested declarator. */
20006 declarator
20012 /* Expect a `)'. */
20020 }
20021 /* Otherwise, we must be done. */
20022 else
20024 }
20028 {
20029 /* Parse an array-declarator. */
20039 /* Consume the `['. */
20041 /* Peek at the next token. */
20043 /* If the next token is `]', then there is no
20044 constant-expression. */
20046 {
20048 bounds
20058 {
20059 /* Normally, the array bound must be an integral constant
20060 expression. However, as an extension, we allow VLAs
20061 in function scopes as long as they aren't part of a
20062 parameter declaration. */
20066 }
20069 {
20070 /* Remember this wasn't a constant-expression. */
20073 }
20074 }
20075 else
20077 /* Look for the closing `]'. */
20079 {
20082 }
20087 }
20089 {
20090 {
20091 tree qualifying_scope;
20092 tree unqualified_name;
20093 tree attrs;
20094 special_function_kind sfk;
20099 /* Parse a declarator-id */
20102 {
20105 /* If we see an ellipsis, we should be looking at a
20106 parameter pack. */
20108 {
20109 /* Consume the `...' */
20113 }
20114 }
20117 unqualified_name
20121 {
20125 {
20126 /* Check whether an error occurred. */
20129 /* We already consumed the ellipsis to mark a
20130 parameter pack, but we have no way to report it,
20131 so abort the tentative parse. We will be exiting
20132 immediately anyway. */
20134 }
20135 else
20141 && (qualifying_scope
20143 {
20146 }
20147 }
20152 {
20157 }
20163 {
20164 /* In the declaration of a member of a template class
20165 outside of the class itself, the SCOPE will sometimes
20166 be a TYPENAME_TYPE. For example, given:
20168 template <typename T>
20169 int S<T>::R::i = 3;
20171 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20172 this context, we must resolve S<T>::R to an ordinary
20173 type, rather than a typename type.
20175 The reason we normally avoid resolving TYPENAME_TYPEs
20176 is that a specialization of `S' might render
20177 `S<T>::R' not a type. However, if `S' is
20178 specialized, then this `i' will not be used, so there
20179 is no harm in resolving the types here. */
20180 tree type;
20182 /* Resolve the TYPENAME_TYPE. */
20185 /* If that failed, the declarator is invalid. */
20187 {
20190 "cannot define member of dependent typedef "
20192 else
20197 }
20199 }
20204 {
20205 tree class_type;
20210 else
20214 {
20218 {
20219 /* We do not attempt to print the declarator
20220 here because we do not have enough
20221 information about its original syntactic
20222 form. */
20226 }
20229 {
20233 "use %<%T::%D%> instead of %<%T::%D%> to "
20235 class_type,
20240 }
20242 }
20245 {
20252 for an unnamed type, even if the type
20253 got a name for linkage purposes. */
20255 /* Handle correctly (c++/19200):
20257 struct S {
20258 struct T{};
20259 friend void S(T);
20260 };
20262 and also:
20264 namespace N {
20265 void S();
20266 }
20268 struct S {
20269 friend void N::S();
20270 }; */
20273 class_type))
20282 }
20283 }
20285 unqualified_name,
20286 sfk);
20293 }
20295 handle_declarator:;
20298 {
20299 /* Any names that appear after the declarator-id for a
20300 member are looked up in the containing scope. */
20302 {
20303 /* But declarations with qualified-ids can't appear in a
20304 function. */
20308 }
20310 }
20314 /* Default args are only allowed on function
20315 declarations. */
20317 else
20321 }
20322 /* We're done. */
20323 else
20325 }
20327 /* For an abstract declarator, we might wind up with nothing at this
20328 point. That's an error; the declarator is not optional. */
20332 {
20333 /* Record overly parenthesized declarator so we can give a
20334 diagnostic about confusing decl/expr disambiguation. */
20336 {
20337 /* If the open and close parens are on different lines, this
20338 is probably a formatting thing, so ignore. */
20343 }
20346 }
20348 /* If we entered a scope, we must exit it now. */
20356 }
20358 /* Parse a ptr-operator.
20360 ptr-operator:
20361 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20362 * cv-qualifier-seq [opt]
20363 &
20364 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20365 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20367 GNU Extension:
20369 ptr-operator:
20370 & cv-qualifier-seq [opt]
20372 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20373 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20374 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20375 filled in with the TYPE containing the member. *CV_QUALS is
20376 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20377 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20378 Note that the tree codes returned by this function have nothing
20379 to do with the types of trees that will be eventually be created
20380 to represent the pointer or reference type being parsed. They are
20381 just constants with suggestive names. */
20382 static enum tree_code
20387 {
20392 /* Assume that it's not a pointer-to-member. */
20394 /* And that there are no cv-qualifiers. */
20397 /* Peek at the next token. */
20400 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20410 {
20411 /* Consume the `*', `&' or `&&'. */
20414 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20415 `&', if we are allowing GNU extensions. (The only qualifier
20416 that can legally appear after `&' is `restrict', but that is
20417 enforced during semantic analysis. */
20425 }
20426 else
20427 {
20428 /* Try the pointer-to-member case. */
20430 /* Look for the optional `::' operator. */
20433 /* Look for the nested-name specifier. */
20440 /* If we found it, and the next token is a `*', then we are
20441 indeed looking at a pointer-to-member operator. */
20444 {
20445 /* Indicate that the `*' operator was used. */
20453 else
20454 {
20455 /* The type of which the member is a member is given by the
20456 current SCOPE. */
20458 /* The next name will not be qualified. */
20462 /* Look for optional c++11 attributes. */
20466 /* Look for the optional cv-qualifier-seq. */
20468 }
20469 }
20470 /* If that didn't work we don't have a ptr-operator. */
20473 }
20476 }
20478 /* Parse an (optional) cv-qualifier-seq.
20480 cv-qualifier-seq:
20481 cv-qualifier cv-qualifier-seq [opt]
20483 cv-qualifier:
20484 const
20485 volatile
20487 GNU Extension:
20489 cv-qualifier:
20490 __restrict__
20492 Returns a bitmask representing the cv-qualifiers. */
20494 static cp_cv_quals
20496 {
20500 {
20502 cp_cv_quals cv_qualifier;
20504 /* Peek at the next token. */
20506 /* See if it's a cv-qualifier. */
20508 {
20524 }
20530 {
20535 }
20536 else
20537 {
20540 }
20541 }
20544 }
20546 /* Parse an (optional) ref-qualifier
20548 ref-qualifier:
20549 &
20550 &&
20552 Returns cp_ref_qualifier representing ref-qualifier. */
20554 static cp_ref_qualifier
20556 {
20559 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20564 {
20569 {
20581 }
20586 {
20589 }
20590 else
20591 {
20594 }
20595 }
20598 }
20600 /* Parse an optional tx-qualifier.
20602 tx-qualifier:
20603 transaction_safe
20604 transaction_safe_dynamic */
20606 static tree
20608 {
20611 {
20616 {
20620 {
20623 {
20626 }
20627 else
20629 }
20630 }
20631 }
20633 }
20635 /* Parse an (optional) virt-specifier-seq.
20637 virt-specifier-seq:
20638 virt-specifier virt-specifier-seq [opt]
20640 virt-specifier:
20641 override
20642 final
20644 Returns a bitmask representing the virt-specifiers. */
20646 static cp_virt_specifiers
20648 {
20652 {
20654 cp_virt_specifiers virt_specifier;
20656 /* Peek at the next token. */
20658 /* See if it's a virt-specifier-qualifier. */
20662 {
20665 }
20667 {
20670 }
20672 {
20674 }
20675 else
20679 {
20684 }
20685 else
20686 {
20689 }
20690 }
20692 }
20694 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20695 is in scope even though it isn't real. */
20697 void
20699 {
20700 tree this_parm;
20703 {
20704 /* We don't clear this between NSDMIs. Is it already what we want? */
20711 }
20714 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20716 current_class_ref
20719 }
20721 /* Return true iff our current scope is a non-static data member
20722 initializer. */
20724 bool
20726 {
20727 /* We recognize NSDMI context by the context-less 'this' pointer set up
20728 by the function above. */
20734 }
20736 /* Parse a late-specified return type, if any. This is not a separate
20737 non-terminal, but part of a function declarator, which looks like
20739 -> trailing-type-specifier-seq abstract-declarator(opt)
20741 Returns the type indicated by the type-id.
20743 In addition to this, parse any queued up #pragma omp declare simd
20744 clauses, and #pragma acc routine clauses.
20746 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20747 function. */
20749 static tree
20752 {
20756 && declarator
20760 && declarator
20763 /* Peek at the next token. */
20765 /* A late-specified return type is indicated by an initial '->'. */
20776 {
20777 /* DR 1207: 'this' is in scope in the trailing return type. */
20779 }
20782 {
20783 /* Consume the ->. */
20787 }
20789 /* Function declarations may be followed by a trailing
20790 requires-clause. */
20794 declarator->attributes
20798 declarator->attributes
20803 {
20806 }
20809 }
20811 /* Parse a declarator-id.
20813 declarator-id:
20814 id-expression
20815 :: [opt] nested-name-specifier [opt] type-name
20817 In the `id-expression' case, the value returned is as for
20818 cp_parser_id_expression if the id-expression was an unqualified-id.
20819 If the id-expression was a qualified-id, then a SCOPE_REF is
20820 returned. The first operand is the scope (either a NAMESPACE_DECL
20821 or TREE_TYPE), but the second is still just a representation of an
20822 unqualified-id. */
20824 static tree
20826 {
20827 tree id;
20828 /* The expression must be an id-expression. Assume that qualified
20829 names are the names of types so that:
20831 template <class T>
20832 int S<T>::R::i = 3;
20834 will work; we must treat `S<T>::R' as the name of a type.
20835 Similarly, assume that qualified names are templates, where
20836 required, so that:
20838 template <class T>
20839 int S<T>::R<T>::i = 3;
20841 will work, too. */
20847 optional_p);
20851 }
20853 /* Parse a type-id.
20855 type-id:
20856 type-specifier-seq abstract-declarator [opt]
20858 Returns the TYPE specified. */
20860 static tree
20863 {
20864 cp_decl_specifier_seq type_specifier_seq;
20867 /* Parse the type-specifier-seq. */
20869 is_trailing_return,
20874 /* A bare template name as a template argument is a template template
20875 argument, not a placeholder, so fail parsing it as a type argument. */
20876 {
20880 }
20884 /* There might or might not be an abstract declarator. */
20886 /* Look for the declarator. */
20887 abstract_declarator
20892 /* Check to see if there really was a declarator. */
20897 /* The concepts TS allows 'auto' as a type-id. */
20899 /* None of the valid uses of 'auto' in C++14 involve the type-id
20900 nonterminal, but it is valid in a trailing-return-type. */
20903 {
20904 /* A type-id with type 'auto' is only ok if the abstract declarator
20905 is a function declarator with a late-specified return type.
20907 A type-id with 'auto' is also valid in a trailing-return-type
20908 in a compound-requirement. */
20915 else
20916 {
20919 {
20921 auto_node);
20923 tmpl);
20924 }
20925 else
20928 }
20929 }
20932 is_template_arg);
20933 }
20935 static tree
20937 {
20939 }
20941 static tree
20943 {
20944 tree r;
20946 parser->type_definition_forbidden_message
20951 {
20954 }
20956 }
20958 static tree
20960 {
20962 }
20964 /* Parse a type-specifier-seq.
20966 type-specifier-seq:
20967 type-specifier type-specifier-seq [opt]
20969 GNU extension:
20971 type-specifier-seq:
20972 attributes type-specifier-seq [opt]
20974 If IS_DECLARATION is true, we are at the start of a "condition" or
20975 exception-declaration, so we might be followed by a declarator-id.
20977 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20978 i.e. we've just seen "->".
20980 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20982 static void
20987 {
20992 /* Clear the TYPE_SPECIFIER_SEQ. */
20995 /* In the context of a trailing return type, enum E { } is an
20996 elaborated-type-specifier followed by a function-body, not an
20997 enum-specifier. */
21001 /* Parse the type-specifiers and attributes. */
21003 {
21004 tree type_specifier;
21007 /* Check for attributes first. */
21009 {
21014 }
21016 /* record the token of the beginning of the type specifier seq,
21017 for error reporting purposes*/
21021 /* Look for the type-specifier. */
21023 flags,
21024 type_specifier_seq,
21026 NULL,
21029 {
21030 /* If the first type-specifier could not be found, this is not a
21031 type-specifier-seq at all. */
21033 {
21034 /* Set in_declarator_p to avoid skipping to the semicolon. */
21046 }
21047 /* If subsequent type-specifiers could not be found, the
21048 type-specifier-seq is complete. */
21050 }
21053 /* The standard says that a condition can be:
21055 type-specifier-seq declarator = assignment-expression
21057 However, given:
21059 struct S {};
21060 if (int S = ...)
21062 we should treat the "S" as a declarator, not as a
21063 type-specifier. The standard doesn't say that explicitly for
21064 type-specifier-seq, but it does say that for
21065 decl-specifier-seq in an ordinary declaration. Perhaps it
21066 would be clearer just to allow a decl-specifier-seq here, and
21067 then add a semantic restriction that if any decl-specifiers
21068 that are not type-specifiers appear, the program is invalid. */
21071 }
21072 }
21074 /* Return whether the function currently being declared has an associated
21075 template parameter list. */
21077 static bool
21079 {
21092 }
21094 /* Parse a parameter-declaration-clause.
21096 parameter-declaration-clause:
21097 parameter-declaration-list [opt] ... [opt]
21098 parameter-declaration-list , ...
21100 Returns a representation for the parameter declarations. A return
21101 value of NULL indicates a parameter-declaration-clause consisting
21102 only of an ellipsis. */
21104 static tree
21106 {
21107 tree parameters;
21116 parser->auto_is_implicit_function_template_parm_p
21118 }
21124 && !processing_template_parmlist
21130 /* Peek at the next token. */
21132 /* Check for trivial parameter-declaration-clauses. */
21134 {
21135 /* Consume the `...' token. */
21138 }
21140 /* There are no parameters. */
21141 {
21142 #ifndef NO_IMPLICIT_EXTERN_C
21147 else
21148 #endif
21150 }
21151 /* Check for `(void)', too, which is a special case. */
21155 {
21156 /* Consume the `void' token. */
21158 /* There are no parameters. */
21160 }
21162 /* Parse the parameter-declaration-list. */
21164 /* If a parse error occurred while parsing the
21165 parameter-declaration-list, then the entire
21166 parameter-declaration-clause is erroneous. */
21170 /* Peek at the next token. */
21172 /* If it's a `,', the clause should terminate with an ellipsis. */
21174 {
21175 /* Consume the `,'. */
21177 /* Expect an ellipsis. */
21178 ellipsis_p
21180 }
21181 /* It might also be `...' if the optional trailing `,' was
21182 omitted. */
21184 {
21185 /* Consume the `...' token. */
21187 /* And remember that we saw it. */
21189 }
21190 else
21193 /* Finish the parameter list. */
21198 }
21200 /* Parse a parameter-declaration-list.
21202 parameter-declaration-list:
21203 parameter-declaration
21204 parameter-declaration-list , parameter-declaration
21206 Returns a representation of the parameter-declaration-list, as for
21207 cp_parser_parameter_declaration_clause. However, the
21208 `void_list_node' is never appended to the list. Upon return,
21209 *IS_ERROR will be true iff an error occurred. */
21211 static tree
21213 {
21219 /* Assume all will go well. */
21221 /* The special considerations that apply to a function within an
21222 unbraced linkage specifications do not apply to the parameters
21223 to the function. */
21224 saved_in_unbraced_linkage_specification_p
21228 /* Look for more parameters. */
21230 {
21238 /* Parse the parameter. */
21239 parameter
21244 /* We don't know yet if the enclosing context is deprecated, so wait
21245 and warn in grokparms if appropriate. */
21249 {
21250 /* If a function parameter pack was specified and an implicit template
21251 parameter was introduced during cp_parser_parameter_declaration,
21252 change any implicit parameters introduced into packs. */
21256 {
21264 }
21268 PARM,
21273 }
21277 /* If a parse error occurred parsing the parameter declaration,
21278 then the entire parameter-declaration-list is erroneous. */
21280 {
21284 }
21294 {
21298 }
21300 /* Add the new parameter to the list. */
21304 /* Peek at the next token. */
21307 /* These are for Objective-C++ */
21310 /* The parameter-declaration-list is complete. */
21313 {
21316 /* Peek at the next token. */
21318 /* If it's an ellipsis, then the list is complete. */
21321 /* Otherwise, there must be more parameters. Consume the
21322 `,'. */
21324 /* When parsing something like:
21326 int i(float f, double d)
21328 we can tell after seeing the declaration for "f" that we
21329 are not looking at an initialization of a variable "i",
21330 but rather at the declaration of a function "i".
21332 Due to the fact that the parsing of template arguments
21333 (as specified to a template-id) requires backtracking we
21334 cannot use this technique when inside a template argument
21335 list. */
21339 /* However, a parameter-declaration of the form
21340 "float(f)" (which is a valid declaration of a
21341 parameter "f") can also be interpreted as an
21342 expression (the conversion of "f" to "float"). */
21345 }
21346 else
21347 {
21355 }
21356 }
21358 parser->in_unbraced_linkage_specification_p
21361 /* Reset implicit_template_scope if we are about to leave the function
21362 parameter list that introduced it. Note that for out-of-line member
21363 definitions, there will be one or more class scopes before we get to
21364 the template parameter scope. */
21368 {
21372 {
21375 }
21376 }
21379 }
21381 /* Parse a parameter declaration.
21383 parameter-declaration:
21384 decl-specifier-seq ... [opt] declarator
21385 decl-specifier-seq declarator = assignment-expression
21386 decl-specifier-seq ... [opt] abstract-declarator [opt]
21387 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21389 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21390 declares a template parameter. (In that case, a non-nested `>'
21391 token encountered during the parsing of the assignment-expression
21392 is not interpreted as a greater-than operator.)
21394 Returns a representation of the parameter, or NULL if an error
21395 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21396 true iff the declarator is of the form "(p)". */
21402 {
21404 cp_decl_specifier_seq decl_specifiers;
21406 tree default_argument;
21411 /* In a template parameter, `>' is not an operator.
21413 [temp.param]
21415 When parsing a default template-argument for a non-type
21416 template-parameter, the first non-nested `>' is taken as the end
21417 of the template parameter-list rather than a greater-than
21418 operator. */
21420 /* Type definitions may not appear in parameter types. */
21422 parser->type_definition_forbidden_message
21425 /* Parse the declaration-specifiers. */
21428 CP_PARSER_FLAGS_NONE,
21432 /* Complain about missing 'typename' or other invalid type names. */
21437 /* If an error occurred, there's no reason to attempt to parse the
21438 rest of the declaration. */
21440 {
21443 }
21445 /* Peek at the next token. */
21448 /* If the next token is a `)', `,', `=', `>', or `...', then there
21449 is no declarator. However, when variadic templates are enabled,
21450 there may be a declarator following `...'. */
21455 {
21459 }
21460 /* Otherwise, there should be a declarator. */
21461 else
21462 {
21466 /* After seeing a decl-specifier-seq, if the next token is not a
21467 "(", there is no possibility that the code is a valid
21468 expression. Therefore, if parsing tentatively, we commit at
21469 this point. */
21471 /* In an expression context, having seen:
21473 (int((char ...
21475 we cannot be sure whether we are looking at a
21476 function-type (taking a "char" as a parameter) or a cast
21477 of some object of type "char" to "int". */
21483 /* Parse the declarator. */
21486 CP_PARSER_DECLARATOR_EITHER,
21488 parenthesized_p,
21492 /* After the declarator, allow more attributes. */
21493 decl_specifiers.attributes
21497 /* If the declarator is a template parameter pack, remember that and
21498 clear the flag in the declarator itself so we don't get errors
21499 from grokdeclarator. */
21501 {
21504 }
21505 }
21507 /* If the next token is an ellipsis, and we have not seen a declarator
21508 name, and if either the type of the declarator contains parameter
21509 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21510 for, eg, abbreviated integral type names), then we actually have a
21511 parameter pack expansion expression. Otherwise, leave the ellipsis
21512 for a C-style variadic function. */
21515 {
21526 {
21527 /* Consume the `...'. */
21531 /* Build a pack expansion type */
21536 else
21538 }
21539 }
21541 /* The restriction on defining new types applies only to the type
21542 of the parameter, not to the default argument. */
21545 /* If the next token is `=', then process a default argument. */
21547 {
21550 /* If we are defining a class, then the tokens that make up the
21551 default argument must be saved and processed later. */
21557 // A constrained-type-specifier may declare a type template-parameter.
21559 default_argument
21562 // A constrained-type-specifier may declare a template-template-parameter.
21564 default_argument
21567 /* Outside of a class definition, we can just parse the
21568 assignment-expression. */
21569 else
21570 default_argument
21574 {
21576 "default arguments are only "
21578 }
21580 || template_parameter_pack_p
21583 {
21584 /* Find the name of the parameter pack. */
21591 template_parm_p
21597 else
21599 template_parm_p
21606 }
21607 }
21608 else
21611 /* Generate a location for the parameter, ranging from the start of the
21612 initial token to the end of the final token (using input_location for
21613 the latter, set up by cp_lexer_set_source_position_from_token when
21614 consuming tokens).
21616 If we have a identifier, then use it for the caret location, e.g.
21618 extern int callee (int one, int (*two)(int, int), float three);
21619 ~~~~~~^~~~~~~~~~~~~~
21621 otherwise, reuse the start location for the caret location e.g.:
21623 extern int callee (int one, int (*)(int, int), float three);
21624 ^~~~~~~~~~~~~~~~~
21626 */
21632 input_location);
21635 declarator,
21636 default_argument,
21637 param_loc,
21638 template_parameter_pack_p);
21639 }
21641 /* Parse a default argument and return it.
21643 TEMPLATE_PARM_P is true if this is a default argument for a
21644 non-type template parameter. */
21645 static tree
21647 {
21653 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21654 set correctly. */
21657 /* Local variable names (and the `this' keyword) may not
21658 appear in a default argument. */
21661 /* Parse the assignment-expression. */
21666 /* The "this" pointer is not valid in a default argument. */
21668 {
21673 }
21674 default_argument
21676 /* Restore the "this" pointer. */
21678 {
21681 }
21690 }
21692 /* Parse a function-body.
21694 function-body:
21695 compound_statement */
21697 static void
21699 {
21703 }
21705 /* Parse a ctor-initializer-opt followed by a function-body. Return
21706 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21707 is true we are parsing a function-try-block. */
21709 static void
21712 {
21719 /* Begin the function body. */
21721 /* Parse the optional ctor-initializer. */
21724 /* If we're parsing a constexpr constructor definition, we need
21725 to check that the constructor body is indeed empty. However,
21726 before we get to cp_parser_function_body lot of junk has been
21727 generated, so we can't just check that we have an empty block.
21728 Rather we take a snapshot of the outermost block, and check whether
21729 cp_parser_function_body changed its state. */
21731 {
21735 }
21736 /* Parse the function-body. */
21740 /* Finish the function body. */
21742 }
21744 /* Parse an initializer.
21746 initializer:
21747 = initializer-clause
21748 ( expression-list )
21750 Returns an expression representing the initializer. If no
21751 initializer is present, NULL_TREE is returned.
21753 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21754 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21755 set to TRUE if there is no initializer present. If there is an
21756 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21757 is set to true; otherwise it is set to false. */
21759 static tree
21762 {
21764 tree init;
21766 /* Peek at the next token. */
21769 /* Let our caller know whether or not this initializer was
21770 parenthesized. */
21772 /* Assume that the initializer is constant. */
21776 {
21777 /* Consume the `='. */
21779 /* Parse the initializer-clause. */
21781 }
21783 {
21788 non_constant_p);
21793 }
21795 {
21800 }
21801 else
21802 {
21803 /* Anything else is an error. */
21806 }
21812 }
21814 /* Parse an initializer-clause.
21816 initializer-clause:
21817 assignment-expression
21818 braced-init-list
21820 Returns an expression representing the initializer.
21822 If the `assignment-expression' production is used the value
21823 returned is simply a representation for the expression.
21825 Otherwise, calls cp_parser_braced_list. */
21827 static cp_expr
21829 {
21830 cp_expr initializer;
21832 /* Assume the expression is constant. */
21835 /* If it is not a `{', then we are looking at an
21836 assignment-expression. */
21838 {
21839 initializer
21842 non_constant_p);
21843 }
21844 else
21848 }
21850 /* Parse a brace-enclosed initializer list.
21852 braced-init-list:
21853 { initializer-list , [opt] }
21854 { designated-initializer-list , [opt] }
21855 { }
21857 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21858 the elements of the initializer-list (or NULL, if the last
21859 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21860 NULL_TREE. There is no way to detect whether or not the optional
21861 trailing `,' was provided. NON_CONSTANT_P is as for
21862 cp_parser_initializer. */
21864 static cp_expr
21866 {
21867 tree initializer;
21870 /* Consume the `{' token. */
21871 matching_braces braces;
21873 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21875 /* If it's not a `}', then there is a non-trivial initializer. */
21877 {
21878 /* Parse the initializer list. */
21881 /* A trailing `,' token is allowed. */
21884 }
21885 else
21887 /* Now, there should be a trailing `}'. */
21893 /* Build a location of the form:
21894 { ... }
21895 ^~~~~~~
21896 with caret==start at the open brace, finish at the close brace. */
21900 }
21902 /* Consume tokens up to, and including, the next non-nested closing `]'.
21903 Returns true iff we found a closing `]'. */
21905 static bool
21907 {
21911 {
21915 {
21918 /* If we've run out of tokens, then there is no closing `]'. */
21927 {
21930 }
21935 }
21937 /* Consume the token. */
21939 }
21940 }
21942 /* Return true if we are looking at an array-designator, false otherwise. */
21944 static bool
21946 {
21947 /* Consume the `['. */
21952 /* Skip tokens until the next token is a closing square bracket.
21953 If we find the closing `]', and the next token is a `=', then
21954 we are looking at an array designator. */
21955 bool array_designator_p
21959 /* Roll back the tokens we skipped. */
21963 }
21965 /* Parse an initializer-list.
21967 initializer-list:
21968 initializer-clause ... [opt]
21969 initializer-list , initializer-clause ... [opt]
21971 C++2A Extension:
21973 designated-initializer-list:
21974 designated-initializer-clause
21975 designated-initializer-list , designated-initializer-clause
21977 designated-initializer-clause:
21978 designator brace-or-equal-initializer
21980 designator:
21981 . identifier
21983 GNU Extension:
21985 initializer-list:
21986 designation initializer-clause ...[opt]
21987 initializer-list , designation initializer-clause ...[opt]
21989 designation:
21990 . identifier =
21991 identifier :
21992 [ constant-expression ] =
21994 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21995 for the initializer. If the INDEX of the elt is non-NULL, it is the
21996 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21997 as for cp_parser_initializer. */
22001 {
22006 /* Assume all of the expressions are constant. */
22009 /* Parse the rest of the list. */
22011 {
22013 tree designator;
22014 tree initializer;
22018 /* Handle the C++2A syntax, '. id ='. */
22026 {
22029 "C++ designated initializers only available with "
22031 /* Consume the `.'. */
22033 /* Consume the identifier. */
22036 /* Consume the `='. */
22038 }
22039 /* Also, if the next token is an identifier and the following one is a
22040 colon, we are looking at the GNU designated-initializer
22041 syntax. */
22046 {
22047 /* Warn the user that they are using an extension. */
22050 /* Consume the identifier. */
22052 /* Consume the `:'. */
22054 }
22055 /* Also handle C99 array designators, '[ const ] ='. */
22059 {
22060 /* In C++11, [ could start a lambda-introducer. */
22066 {
22069 }
22070 else
22071 {
22076 }
22081 && (!require_potential_rvalue_constant_expression
22085 /* Warn the user that they are using an extension. */
22088 }
22089 else
22093 {
22096 }
22100 {
22104 }
22108 /* Parse the initializer. */
22111 /* If any clause is non-constant, so is the entire initializer. */
22115 /* If we have an ellipsis, this is an initializer pack
22116 expansion. */
22118 {
22121 /* Consume the `...'. */
22128 /* Turn the initializer into an initializer expansion. */
22130 }
22132 /* Add it to the vector. */
22135 /* If the next token is not a comma, we have reached the end of
22136 the list. */
22140 /* Peek at the next token. */
22142 /* If the next token is a `}', then we're still done. An
22143 initializer-clause can have a trailing `,' after the
22144 initializer-list and before the closing `}'. */
22148 /* Consume the `,' token. */
22150 }
22152 /* The same identifier shall not appear in multiple designators
22153 of a designated-initializer-list. */
22155 {
22160 {
22162 {
22164 "%<.%s%> designator used multiple times in "
22168 }
22169 else
22171 }
22175 }
22178 }
22180 /* Classes [gram.class] */
22182 /* Parse a class-name.
22184 class-name:
22185 identifier
22186 template-id
22188 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22189 to indicate that names looked up in dependent types should be
22190 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22191 keyword has been used to indicate that the name that appears next
22192 is a template. TAG_TYPE indicates the explicit tag given before
22193 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22194 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22195 is the class being defined in a class-head. If ENUM_OK is TRUE,
22196 enum-names are also accepted.
22198 Returns the TYPE_DECL representing the class. */
22200 static tree
22209 {
22210 tree decl;
22211 tree scope;
22216 /* All class-names start with an identifier. */
22219 {
22222 }
22224 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22225 to a template-id, so we save it here. */
22230 /* Any name names a type if we're following the `typename' keyword
22231 in a qualified name where the enclosing scope is type-dependent. */
22234 /* Handle the common case (an identifier, but not a template-id)
22235 efficiently. */
22238 {
22242 /* Look for the identifier. */
22246 /* If the next token isn't an identifier, we are certainly not
22247 looking at a class-name. */
22250 /* If we know this is a type-name, there's no need to look it
22251 up. */
22254 else
22255 {
22256 tree ambiguous_decls;
22257 /* If we already know that this lookup is ambiguous, then
22258 we've already issued an error message; there's no reason
22259 to check again. */
22261 {
22264 }
22265 /* If the next token is a `::', then the name must be a type
22266 name.
22268 [basic.lookup.qual]
22270 During the lookup for a name preceding the :: scope
22271 resolution operator, object, function, and enumerator
22272 names are ignored. */
22275 /* Look up the name. */
22277 tag_type,
22280 check_dependency_p,
22284 {
22288 }
22289 }
22290 }
22291 else
22292 {
22293 /* Try a template-id. */
22295 check_dependency_p,
22296 tag_type,
22297 is_declaration);
22300 }
22304 /* If this is a typename, create a TYPENAME_TYPE. */
22306 {
22311 }
22315 /* Check to see that it is really the name of a class. */
22319 /* Situations like this:
22321 template <typename T> struct A {
22322 typename T::template X<int>::I i;
22323 };
22325 are problematic. Is `T::template X<int>' a class-name? The
22326 standard does not seem to be definitive, but there is no other
22327 valid interpretation of the following `::'. Therefore, those
22328 names are considered class-names. */
22329 {
22333 }
22338 /* In Objective-C 2.0, a classname followed by '.' starts a
22339 dot-syntax expression, and it's not a type-name. */
22351 }
22353 /* Parse a class-specifier.
22355 class-specifier:
22356 class-head { member-specification [opt] }
22358 Returns the TREE_TYPE representing the class. */
22360 static tree
22362 {
22363 tree type;
22377 /* Parse the class-head. */
22380 /* If the class-head was a semantic disaster, skip the entire body
22381 of the class. */
22383 {
22387 }
22389 /* Look for the `{'. */
22390 matching_braces braces;
22392 {
22395 }
22400 /* Issue an error message if type-definitions are forbidden here. */
22402 /* Remember that we are defining one more class. */
22404 /* Inside the class, surrounding template-parameter-lists do not
22405 apply. */
22406 saved_num_template_parameter_lists
22409 /* We are not in a function body. */
22412 /* Or in a loop. */
22415 /* Or in a switch. */
22418 /* We are not immediately inside an extern "lang" block. */
22419 saved_in_unbraced_linkage_specification_p
22423 // Associate constraints with the type.
22427 /* Start the class. */
22429 {
22432 }
22436 /* If the type is erroneous, skip the entire body of the class. */
22438 else
22439 /* Parse the member-specification. */
22442 /* Look for the trailing `}'. */
22444 /* Look for trailing attributes to apply to this class. */
22452 /* We've finished a type definition. Check for the common syntax
22453 error of forgetting a semicolon after the definition. We need to
22454 be careful, as we can't just check for not-a-semicolon and be done
22455 with it; the user might have typed:
22457 class X { } c = ...;
22458 class X { } *p = ...;
22460 and so forth. Instead, enumerate all the possible tokens that
22461 might follow this production; if we don't see one of them, then
22462 complain and silently insert the semicolon. */
22463 {
22468 /* Don't try to parse c++11 attributes here. As per the
22469 grammar, that should be a task for
22470 cp_parser_decl_specifier_seq. */
22474 {
22485 /* While it's legal for type qualifiers and storage class
22486 specifiers to follow type definitions in the grammar, only
22487 compiler testsuites contain code like that. Assume that if
22488 we see such code, then what we're really seeing is a case
22489 like:
22491 class X { }
22492 const <type> var = ...;
22494 or
22496 class Y { }
22497 static <type> func (...) ...
22499 i.e. the qualifier or specifier applies to the next
22500 declaration. To do so, however, we need to look ahead one
22501 more token to see if *that* token is a type specifier.
22503 This code could be improved to handle:
22505 class Z { }
22506 static const <type> var = ...; */
22509 {
22512 /* Handling user-defined types here would be nice, but very
22513 tricky. */
22514 want_semicolon
22517 }
22521 }
22523 /* If we don't have a type, then something is very wrong and we
22524 shouldn't try to do anything clever. Likewise for not seeing the
22525 closing brace. */
22527 {
22528 /* Locate the closing brace. */
22529 cp_token_position prev
22534 /* We want to suggest insertion of a ';' immediately *after* the
22535 closing brace, so, if we can, offset the location by 1 column. */
22542 /* If we successfully offset the location, suggest the fix-it. */
22555 else
22558 /* Unget one token and smash it to look as though we encountered
22559 a semicolon in the input stream. */
22564 }
22565 }
22567 /* If this class is not itself within the scope of another class,
22568 then we need to parse the bodies of all of the queued function
22569 definitions. Note that the queued functions defined in a class
22570 are not always processed immediately following the
22571 class-specifier for that class. Consider:
22573 struct A {
22574 struct B { void f() { sizeof (A); } };
22575 };
22577 If `f' were processed before the processing of `A' were
22578 completed, there would be no way to compute the size of `A'.
22579 Note that the nesting we are interested in here is lexical --
22580 not the semantic nesting given by TYPE_CONTEXT. In particular,
22581 for:
22583 struct A { struct B; };
22584 struct A::B { void f() { } };
22586 there is no need to delay the parsing of `A::B::f'. */
22588 {
22589 tree decl;
22596 /* In a first pass, parse default arguments to the functions.
22597 Then, in a second pass, parse the bodies of the functions.
22598 This two-phased approach handles cases like:
22600 struct S {
22601 void f() { g(); }
22602 void g(int i = 3);
22603 };
22605 */
22607 {
22609 /* If there are default arguments that have not yet been processed,
22610 take care of them now. */
22612 {
22617 }
22618 /* Make sure that any template parameters are in scope. */
22620 /* Parse the default argument expressions. */
22622 /* Remove any template parameters from the symbol table. */
22624 }
22626 /* Now parse any NSDMIs. */
22630 {
22632 {
22637 }
22640 }
22647 /* Now do some post-NSDMI bookkeeping. */
22653 /* Now parse the body of the functions. */
22655 {
22656 /* OpenMP UDRs need to be parsed before all other functions. */
22663 }
22664 else
22668 }
22669 else
22672 /* Put back any saved access checks. */
22675 /* Restore saved state. */
22679 parser->num_template_parameter_lists
22681 parser->in_unbraced_linkage_specification_p
22685 }
22687 static tree
22689 {
22690 tree ret;
22695 }
22697 /* Parse a class-head.
22699 class-head:
22700 class-key identifier [opt] base-clause [opt]
22701 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22702 class-key nested-name-specifier [opt] template-id
22703 base-clause [opt]
22705 class-virt-specifier:
22706 final
22708 GNU Extensions:
22709 class-key attributes identifier [opt] base-clause [opt]
22710 class-key attributes nested-name-specifier identifier base-clause [opt]
22711 class-key attributes nested-name-specifier [opt] template-id
22712 base-clause [opt]
22714 Upon return BASES is initialized to the list of base classes (or
22715 NULL, if there are none) in the same form returned by
22716 cp_parser_base_clause.
22718 Returns the TYPE of the indicated class. Sets
22719 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22720 involving a nested-name-specifier was used, and FALSE otherwise.
22722 Returns error_mark_node if this is not a class-head.
22724 Returns NULL_TREE if the class-head is syntactically valid, but
22725 semantically invalid in a way that means we should skip the entire
22726 body of the class. */
22728 static tree
22731 {
22732 tree nested_name_specifier;
22736 tree attributes;
22737 tree bases;
22747 /* Assume no nested-name-specifier will be present. */
22749 /* Assume no template parameter lists will be used in defining the
22750 type. */
22754 /* Look for the class-key. */
22761 /* Parse the attributes. */
22764 /* If the next token is `::', that is invalid -- but sometimes
22765 people do try to write:
22767 struct ::S {};
22769 Handle this gracefully by accepting the extra qualifier, and then
22770 issuing an error about it later if this really is a
22771 class-head. If it turns out just to be an elaborated type
22772 specifier, remain silent. */
22778 /* Determine the name of the class. Begin by looking for an
22779 optional nested-name-specifier. */
22781 nested_name_specifier
22787 /* If there was a nested-name-specifier, then there *must* be an
22788 identifier. */
22793 {
22795 /* Although the grammar says `identifier', it really means
22796 `class-name' or `template-name'. You are only allowed to
22797 define a class that has already been declared with this
22798 syntax.
22800 The proposed resolution for Core Issue 180 says that wherever
22801 you see `class T::X' you should treat `X' as a type-name.
22803 It is OK to define an inaccessible class; for example:
22805 class A { class B; };
22806 class A::B {};
22808 We do not know if we will see a class-name, or a
22809 template-name. We look for a class-name first, in case the
22810 class-name is a template-id; if we looked for the
22811 template-name first we would stop after the template-name. */
22818 class_type,
22822 /* If that didn't work, ignore the nested-name-specifier. */
22824 {
22830 }
22831 /* If we could not find a corresponding TYPE, treat this
22832 declaration like an unqualified declaration. */
22835 /* Otherwise, count the number of templates used in TYPE and its
22836 containing scopes. */
22837 else
22838 {
22839 tree scope;
22851 }
22852 }
22853 /* Otherwise, the identifier is optional. */
22854 else
22855 {
22856 /* We don't know whether what comes next is a template-id,
22857 an identifier, or nothing at all. */
22859 /* Check for a template-id. */
22864 class_key,
22866 /* If that didn't work, it could still be an identifier. */
22868 {
22870 {
22873 }
22874 else
22876 }
22877 else
22878 {
22881 }
22882 }
22887 {
22889 class_key,
22891 }
22894 /* If it's not a `:' or a `{' then we can't really be looking at a
22895 class-head, since a class-head only appears as part of a
22896 class-specifier. We have to detect this situation before calling
22897 xref_tag, since that has irreversible side-effects. */
22899 {
22903 }
22905 /* At this point, we're going ahead with the class-specifier, even
22906 if some other problem occurs. */
22909 {
22914 }
22915 /* Issue the error about the overly-qualified name now. */
22917 {
22922 }
22924 {
22929 }
22931 {
22932 tree scope;
22935 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22936 keyword template shall not appear at the top level. */
22940 /* Reject typedef-names in class heads. */
22942 {
22945 type);
22948 }
22950 /* Figure out in what scope the declaration is being placed. */
22952 /* If that scope does not contain the scope in which the
22953 class was originally declared, the program is invalid. */
22955 {
22958 "declaration of %qD in namespace %qD which does not "
22961 else
22967 }
22968 /* [dcl.meaning]
22970 A declarator-id shall not be qualified except for the
22971 definition of a ... nested class outside of its class
22972 ... [or] the definition or explicit instantiation of a
22973 class member of a namespace outside of its namespace. */
22975 {
22980 }
22981 }
22982 /* An explicit-specialization must be preceded by "template <>". If
22983 it is not, try to recover gracefully. */
22986 && !processing_template_parmlist
22988 {
22989 /* Build a location of this form:
22990 struct typename <ARGS>
22991 ^~~~~~~~~~~~~~~~~~~~~~
22992 with caret==start at the start token, and
22993 finishing at the end of the type. */
22994 location_t reported_loc
22996 class_head_start_location,
23002 "an explicit specialization must be preceded by"
23005 /* Take the same action that would have been taken by
23006 cp_parser_explicit_specialization. */
23009 }
23010 /* There must be no "return" statements between this point and the
23011 end of this function; set "type "to the correct return value and
23012 use "goto done;" to return. */
23013 /* Make sure that the right number of template parameters were
23014 present. */
23018 {
23019 /* If something went wrong, there is no point in even trying to
23020 process the class-definition. */
23023 }
23025 /* Look up the type. */
23027 {
23031 {
23035 }
23036 else
23037 {
23041 /* Check the scope while we still know whether or not we had a
23042 nested-name-specifier. */
23045 }
23048 }
23050 {
23051 tree class_type;
23053 /* Given:
23055 template <typename T> struct S { struct T };
23056 template <typename T> struct S<T>::T { };
23058 we will get a TYPENAME_TYPE when processing the definition of
23059 `S::T'. We need to resolve it to the actual type before we
23060 try to define it. */
23062 {
23067 else
23068 {
23071 }
23072 }
23076 {
23079 }
23082 /* Enter the scope indicated by the nested-name-specifier. */
23084 /* Get the canonical version of this type. */
23086 /* Call push_template_decl if it seems like we should be defining a
23087 template either from the template headers or the type we're
23088 defining, so that we diagnose both extra and missing headers. */
23092 {
23095 {
23098 }
23099 }
23103 }
23105 {
23106 /* If the class was unnamed, create a dummy name. */
23110 ? ts_within_enclosing_non_class
23114 }
23116 /* Indicate whether this class was declared as a `class' or as a
23117 `struct'. */
23122 /* If this type was already complete, and we see another definition,
23123 that's an error. */
23125 {
23127 type);
23129 type);
23132 }
23137 {
23138 /* Apply attributes now, before any use of the class as a template
23139 argument in its base list. */
23142 }
23144 /* We will have entered the scope containing the class; the names of
23145 base classes should be looked up in that context. For example:
23147 struct A { struct B {}; struct C; };
23148 struct A::C : B {};
23150 is valid. */
23152 /* Get the list of base-classes, if there is one. */
23154 {
23155 /* PR59482: enter the class scope so that base-specifiers are looked
23156 up correctly. */
23160 /* PR59482: get out of the previously pushed class scope so that the
23161 subsequent pops pop the right thing. */
23164 }
23165 else
23168 /* If we're really defining a class, process the base classes.
23169 If they're invalid, fail. */
23173 done:
23174 /* Leave the scope given by the nested-name-specifier. We will
23175 enter the class scope itself while processing the members. */
23180 {
23183 }
23189 out:
23192 }
23194 /* Parse a class-key.
23196 class-key:
23197 class
23198 struct
23199 union
23201 Returns the kind of class-key specified, or none_type to indicate
23202 error. */
23204 static enum tag_types
23206 {
23210 /* Look for the class-key. */
23215 /* Check to see if the TOKEN is a class-key. */
23220 }
23222 /* Parse a type-parameter-key.
23224 type-parameter-key:
23225 class
23226 typename
23227 */
23229 static void
23231 {
23232 /* Look for the type-parameter-key. */
23236 {
23239 /* typename is not allowed in a template template parameter
23240 by the standard until C++17. */
23242 "ISO C++ forbids typename key in template template parameter;"
23244 }
23245 else
23249 }
23251 /* Parse an (optional) member-specification.
23253 member-specification:
23254 member-declaration member-specification [opt]
23255 access-specifier : member-specification [opt] */
23257 static void
23259 {
23261 {
23265 /* Peek at the next token. */
23267 /* If it's a `}', or EOF then we've seen all the members. */
23273 /* See if this token is a keyword. */
23276 {
23280 /* Consume the access-specifier. */
23282 /* Remember which access-specifier is active. */
23284 /* Look for the `:'. */
23289 /* Accept #pragmas at class scope. */
23291 {
23294 }
23296 /* Otherwise, the next construction must be a
23297 member-declaration. */
23299 }
23300 }
23301 }
23303 /* Parse a member-declaration.
23305 member-declaration:
23306 decl-specifier-seq [opt] member-declarator-list [opt] ;
23307 function-definition ; [opt]
23308 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23309 using-declaration
23310 template-declaration
23311 alias-declaration
23313 member-declarator-list:
23314 member-declarator
23315 member-declarator-list , member-declarator
23317 member-declarator:
23318 declarator pure-specifier [opt]
23319 declarator constant-initializer [opt]
23320 identifier [opt] : constant-expression
23322 GNU Extensions:
23324 member-declaration:
23325 __extension__ member-declaration
23327 member-declarator:
23328 declarator attributes [opt] pure-specifier [opt]
23329 declarator attributes [opt] constant-initializer [opt]
23330 identifier [opt] attributes [opt] : constant-expression
23332 C++0x Extensions:
23334 member-declaration:
23335 static_assert-declaration */
23337 static void
23339 {
23340 cp_decl_specifier_seq decl_specifiers;
23341 tree prefix_attributes;
23342 tree decl;
23351 /* Check for the `__extension__' keyword. */
23353 {
23354 /* Recurse. */
23356 /* Restore the old value of the PEDANTIC flag. */
23360 }
23362 /* Check for a template-declaration. */
23364 {
23365 /* An explicit specialization here is an error condition, and we
23366 expect the specialization handler to detect and report this. */
23370 else
23374 }
23375 /* Check for a template introduction. */
23379 /* Check for a using-declaration. */
23381 {
23383 {
23384 /* Parse the using-declaration. */
23388 }
23389 else
23390 {
23391 tree decl;
23395 /* Note that if we actually see the '=' token after the
23396 identifier, cp_parser_alias_declaration commits the
23397 tentative parse. In that case, we really expect an
23398 alias-declaration. Otherwise, we expect a using
23399 declaration. */
23400 alias_decl_expected =
23406 else
23410 }
23411 }
23413 /* Check for @defs. */
23415 {
23420 {
23425 }
23427 }
23429 /* If the next token is `static_assert' we have a static assertion. */
23431 {
23434 }
23441 /* Parse the decl-specifier-seq. */
23444 CP_PARSER_FLAGS_OPTIONAL,
23447 /* Check for an invalid type-name. */
23451 /* If there is no declarator, then the decl-specifier-seq should
23452 specify a type. */
23454 {
23455 /* If there was no decl-specifier-seq, and the next token is a
23456 `;', then we have something like:
23458 struct S { ; };
23460 [class.mem]
23462 Each member-declaration shall declare at least one member
23463 name of the class. */
23465 {
23468 {
23472 }
23473 }
23474 else
23475 {
23476 tree type;
23478 /* See if this declaration is a friend. */
23480 /* If there were decl-specifiers, check to see if there was
23481 a class-declaration. */
23484 /* Nested classes have already been added to the class, but
23485 a `friend' needs to be explicitly registered. */
23487 {
23488 /* If the `friend' keyword was present, the friend must
23489 be introduced with a class-key. */
23492 "in C++03 a class-key must be used "
23494 /* In this case:
23496 template <typename T> struct A {
23497 friend struct A<T>::B;
23498 };
23500 A<T>::B will be represented by a TYPENAME_TYPE, and
23501 therefore not recognized by check_tag_decl. */
23503 {
23507 }
23510 "friend declaration does not name a class or "
23512 else
23515 }
23516 /* If there is no TYPE, an error message will already have
23517 been issued. */
23519 ;
23520 /* An anonymous aggregate has to be handled specially; such
23521 a declaration really declares a data member (with a
23522 particular type), as opposed to a nested class. */
23524 {
23525 /* C++11 9.5/6. */
23528 "a storage class on an anonymous aggregate "
23531 /* Remove constructors and such from TYPE, now that we
23532 know it is an anonymous aggregate. */
23534 /* And make the corresponding data member. */
23537 /* Add it to the class. */
23539 }
23540 else
23541 cp_parser_check_access_in_redeclaration
23544 }
23545 }
23546 else
23547 {
23550 /* Clear attributes from the decl_specifiers but keep them
23551 around as prefix attributes that apply them to the entity
23552 being declared. */
23556 /* See if these declarations will be friends. */
23559 /* Keep going until we hit the `;' at the end of the
23560 declaration. */
23562 {
23564 tree first_attribute;
23565 tree initializer;
23569 /* Peek at the next token. */
23572 /* The following code wants to know early if it is a bit-field
23573 or some other declaration. Attributes can appear before
23574 the `:' token, but are hopefully rare enough that the
23575 simplicity of the tentative lookup pays off. */
23580 {
23588 }
23590 /* Check for a bitfield declaration. */
23596 {
23597 tree identifier;
23598 tree width;
23603 else
23606 /* Look for attributes that apply to the bitfield. */
23609 /* Consume the `:' token. */
23612 /* Get the width of the bitfield. */
23616 /* In C++2A and as extension for C++11 and above we allow
23617 default member initializers for bit-fields. */
23622 CPP_OPEN_BRACE)))
23623 {
23624 location_t loc
23630 "default member initializers for bit-fields "
23631 "only available with -std=c++2a or "
23636 {
23640 }
23641 }
23642 else
23643 {
23644 /* Look for attributes that apply to the bitfield after
23645 the `:' token and width. This is where GCC used to
23646 parse attributes in the past, pedwarn if there is
23647 a std attribute. */
23650 "ISO C++ allows bit-field attributes only "
23654 }
23658 /* Remember which attributes are prefix attributes and
23659 which are not. */
23661 /* Combine the attributes. */
23664 /* Create the bitfield declaration. */
23667 identifier,
23668 sfk_none)
23672 attributes);
23673 }
23674 else
23675 {
23677 tree asm_specification;
23680 /* Parse the declarator. */
23681 declarator
23686 friend_p);
23688 /* If something went wrong parsing the declarator, make sure
23689 that we at least consume some tokens. */
23691 {
23692 /* Skip to the end of the statement. */
23694 /* If the next token is not a semicolon, that is
23695 probably because we just skipped over the body of
23696 a function. So, we consume a semicolon if
23697 present, but do not issue an error message if it
23698 is not present. */
23700 CPP_SEMICOLON))
23703 }
23706 cp_parser_check_for_definition_in_return_type
23710 /* Look for an asm-specification. */
23712 /* Look for attributes that apply to the declaration. */
23714 /* Remember which attributes are prefix attributes and
23715 which are not. */
23717 /* Combine the attributes. */
23720 /* If it's an `=', then we have a constant-initializer or a
23721 pure-specifier. It is not correct to parse the
23722 initializer before registering the member declaration
23723 since the member declaration should be in scope while
23724 its initializer is processed. However, the rest of the
23725 front end does not yet provide an interface that allows
23726 us to handle this correctly. */
23728 {
23729 /* In [class.mem]:
23731 A pure-specifier shall be used only in the declaration of
23732 a virtual function.
23734 A member-declarator can contain a constant-initializer
23735 only if it declares a static member of integral or
23736 enumeration type.
23738 Therefore, if the DECLARATOR is for a function, we look
23739 for a pure-specifier; otherwise, we look for a
23740 constant-initializer. When we call `grokfield', it will
23741 perform more stringent semantics checks. */
23753 {
23755 /* Don't require a constant rvalue in C++11, since we
23756 might want a reference constant. We'll enforce
23757 constancy later. */
23759 /* Parse the initializer. */
23762 }
23763 else
23764 /* Parse the initializer. */
23766 }
23769 {
23773 else
23775 }
23776 /* Otherwise, there is no initializer. */
23777 else
23780 /* See if we are probably looking at a function
23781 definition. We are certainly not looking at a
23782 member-declarator. Calling `grokfield' has
23783 side-effects, so we must not do it unless we are sure
23784 that we are looking at a member-declarator. */
23787 {
23788 /* The grammar does not allow a pure-specifier to be
23789 used when a member function is defined. (It is
23790 possible that this fact is an oversight in the
23791 standard, since a pure function may be defined
23792 outside of the class-specifier. */
23798 declarator,
23799 attributes);
23802 /* If the member was not a friend, declare it here. */
23805 /* Peek at the next token. */
23807 /* If the next token is a semicolon, consume it. */
23809 {
23810 location_t semicolon_loc
23815 "extra %<;%> after in-class "
23817 }
23819 }
23820 else
23823 /* Create the declaration. */
23828 {
23831 else
23833 }
23834 }
23839 /* Reset PREFIX_ATTRIBUTES. */
23845 /* If there is any qualification still in effect, clear it
23846 now; we will be starting fresh with the next declarator. */
23850 /* If it's a `,', then there are more declarators. */
23852 {
23855 {
23861 }
23862 }
23863 /* If the next token isn't a `;', then we have a parse error. */
23865 CPP_SEMICOLON))
23866 {
23867 /* The next token might be a ways away from where the
23868 actual semicolon is missing. Find the previous token
23869 and use that for our error position. */
23876 /* Assume that the user meant to provide a semicolon. If
23877 we were to cp_parser_skip_to_end_of_statement, we might
23878 skip to a semicolon inside a member function definition
23879 and issue nonsensical error messages. */
23881 }
23884 {
23885 /* Add DECL to the list of members. */
23887 /* Explicitly include, eg, NSDMIs, for better error
23888 recovery (c++/58650). */
23896 /* Add DECL to the queue of NSDMI to be parsed later. */
23898 }
23902 }
23903 }
23906 out:
23908 }
23910 /* Parse a pure-specifier.
23912 pure-specifier:
23913 = 0
23915 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23916 Otherwise, ERROR_MARK_NODE is returned. */
23918 static tree
23920 {
23923 /* Look for the `=' token. */
23926 /* Look for the `0' token. */
23935 /* Accept = default or = delete in c++0x mode. */
23938 {
23941 }
23943 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23945 {
23950 }
23952 {
23955 }
23958 }
23960 /* Parse a constant-initializer.
23962 constant-initializer:
23963 = constant-expression
23965 Returns a representation of the constant-expression. */
23967 static tree
23969 {
23970 /* Look for the `=' token. */
23974 /* It is invalid to write:
23976 struct S { static const int i = { 7 }; };
23978 */
23980 {
23983 /* Consume the opening brace. */
23984 matching_braces braces;
23986 /* Skip the initializer. */
23988 /* Look for the trailing `}'. */
23992 }
23995 }
23997 /* Derived classes [gram.class.derived] */
23999 /* Parse a base-clause.
24001 base-clause:
24002 : base-specifier-list
24004 base-specifier-list:
24005 base-specifier ... [opt]
24006 base-specifier-list , base-specifier ... [opt]
24008 Returns a TREE_LIST representing the base-classes, in the order in
24009 which they were declared. The representation of each node is as
24010 described by cp_parser_base_specifier.
24012 In the case that no bases are specified, this function will return
24013 NULL_TREE, not ERROR_MARK_NODE. */
24015 static tree
24017 {
24020 /* Look for the `:' that begins the list. */
24023 /* Scan the base-specifier-list. */
24025 {
24027 tree base;
24030 /* Look for the base-specifier. */
24032 /* Look for the (optional) ellipsis. */
24034 {
24035 /* Consume the `...'. */
24039 }
24041 /* Add BASE to the front of the list. */
24043 {
24045 /* Make this a pack expansion type. */
24049 {
24052 }
24053 }
24054 /* Peek at the next token. */
24056 /* If it's not a comma, then the list is complete. */
24059 /* Consume the `,'. */
24061 }
24063 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24064 base class had a qualified name. However, the next name that
24065 appears is certainly not qualified. */
24071 }
24073 /* Parse a base-specifier.
24075 base-specifier:
24076 :: [opt] nested-name-specifier [opt] class-name
24077 virtual access-specifier [opt] :: [opt] nested-name-specifier
24078 [opt] class-name
24079 access-specifier virtual [opt] :: [opt] nested-name-specifier
24080 [opt] class-name
24082 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24083 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24084 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24085 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24087 static tree
24089 {
24097 tree type;
24099 /* Process the optional `virtual' and `access-specifier'. */
24101 {
24102 /* Peek at the next token. */
24104 /* Process `virtual'. */
24106 {
24108 /* If `virtual' appears more than once, issue an error. */
24110 {
24114 }
24118 /* Consume the `virtual' token. */
24126 /* If more than one access specifier appears, issue an
24127 error. */
24130 {
24134 }
24138 /* Consume the access-specifier. */
24146 }
24147 }
24148 /* It is not uncommon to see programs mechanically, erroneously, use
24149 the 'typename' keyword to denote (dependent) qualified types
24150 as base classes. */
24152 {
24157 else
24159 "keyword %<typename%> not allowed in this context "
24162 }
24164 /* Look for the optional `::' operator. */
24166 /* Look for the nested-name-specifier. The simplest way to
24167 implement:
24169 [temp.res]
24171 The keyword `typename' is not permitted in a base-specifier or
24172 mem-initializer; in these contexts a qualified name that
24173 depends on a template-parameter is implicitly assumed to be a
24174 type name.
24176 is to pretend that we have seen the `typename' keyword at this
24177 point. */
24183 /* If the base class is given by a qualified name, assume that names
24184 we see are type names or templates, as appropriate. */
24190 /* DR 950 allows decltype as a base-specifier. */
24192 else
24193 {
24194 /* Otherwise, look for the class-name. */
24196 class_scope_p,
24197 template_p,
24198 typename_type,
24203 }
24209 }
24211 /* Exception handling [gram.exception] */
24213 /* Parse an (optional) noexcept-specification.
24215 noexcept-specification:
24216 noexcept ( constant-expression ) [opt]
24218 If no noexcept-specification is present, returns NULL_TREE.
24219 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24220 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24221 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24222 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24223 in which case a boolean condition is returned instead. */
24225 static tree
24230 {
24234 /* Peek at the next token. */
24237 /* Is it a noexcept-specification? */
24239 {
24240 tree expr;
24244 {
24245 matching_parens parens;
24249 {
24250 /* Types may not be defined in an exception-specification. */
24252 parser->type_definition_forbidden_message
24257 /* Restore the saved message. */
24259 }
24260 else
24261 {
24264 }
24267 }
24268 else
24269 {
24273 }
24275 /* We cannot build a noexcept-spec right away because this will check
24276 that expr is a constexpr. */
24279 else
24281 }
24282 else
24284 }
24286 /* Parse an (optional) exception-specification.
24288 exception-specification:
24289 throw ( type-id-list [opt] )
24291 Returns a TREE_LIST representing the exception-specification. The
24292 TREE_VALUE of each node is a type. */
24294 static tree
24296 {
24298 tree type_id_list;
24301 /* Peek at the next token. */
24304 /* Is it a noexcept-specification? */
24310 /* If it's not `throw', then there's no exception-specification. */
24316 /* Consume the `throw'. */
24319 /* Look for the `('. */
24320 matching_parens parens;
24323 /* Peek at the next token. */
24325 /* If it's not a `)', then there is a type-id-list. */
24327 {
24328 /* Types may not be defined in an exception-specification. */
24330 parser->type_definition_forbidden_message
24332 /* Parse the type-id-list. */
24334 /* Restore the saved message. */
24338 {
24342 }
24345 "dynamic exception specifications are deprecated in "
24347 }
24348 /* In C++17, throw() is equivalent to noexcept (true). throw()
24349 is deprecated in C++11 and above as well, but is still widely used,
24350 so don't warn about it yet. */
24353 else
24356 /* Look for the `)'. */
24360 }
24362 /* Parse an (optional) type-id-list.
24364 type-id-list:
24365 type-id ... [opt]
24366 type-id-list , type-id ... [opt]
24368 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24369 in the order that the types were presented. */
24371 static tree
24373 {
24377 {
24379 tree type;
24383 /* Get the next type-id. */
24385 /* Check for invalid 'auto'. */
24387 {
24391 }
24392 /* Parse the optional ellipsis. */
24394 {
24395 /* Consume the `...'. */
24398 /* Turn the type into a pack expansion expression. */
24400 }
24401 /* Add it to the list. */
24403 /* Peek at the next token. */
24405 /* If it is not a `,', we are done. */
24408 /* Consume the `,'. */
24410 }
24413 }
24415 /* Parse a try-block.
24417 try-block:
24418 try compound-statement handler-seq */
24420 static tree
24422 {
24423 tree try_block;
24437 }
24439 /* Parse a function-try-block.
24441 function-try-block:
24442 try ctor-initializer [opt] function-body handler-seq */
24444 static void
24446 {
24447 tree compound_stmt;
24448 tree try_block;
24450 /* Look for the `try' keyword. */
24453 /* Let the rest of the front end know where we are. */
24455 /* Parse the function-body. */
24456 cp_parser_ctor_initializer_opt_and_function_body
24458 /* We're done with the `try' part. */
24460 /* Parse the handlers. */
24462 /* We're done with the handlers. */
24464 }
24466 /* Parse a handler-seq.
24468 handler-seq:
24469 handler handler-seq [opt] */
24471 static void
24473 {
24475 {
24478 /* Parse the handler. */
24480 /* Peek at the next token. */
24482 /* If it's not `catch' then there are no more handlers. */
24485 }
24486 }
24488 /* Parse a handler.
24490 handler:
24491 catch ( exception-declaration ) compound-statement */
24493 static void
24495 {
24496 tree handler;
24497 tree declaration;
24501 matching_parens parens;
24508 }
24510 /* Parse an exception-declaration.
24512 exception-declaration:
24513 type-specifier-seq declarator
24514 type-specifier-seq abstract-declarator
24515 type-specifier-seq
24516 ...
24518 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24519 ellipsis variant is used. */
24521 static tree
24523 {
24524 cp_decl_specifier_seq type_specifiers;
24528 /* If it's an ellipsis, it's easy to handle. */
24530 {
24531 /* Consume the `...' token. */
24534 }
24536 /* Types may not be defined in exception-declarations. */
24538 parser->type_definition_forbidden_message
24541 /* Parse the type-specifier-seq. */
24545 /* If it's a `)', then there is no declarator. */
24548 else
24555 /* Restore the saved message. */
24562 }
24564 /* Parse a throw-expression.
24566 throw-expression:
24567 throw assignment-expression [opt]
24569 Returns a THROW_EXPR representing the throw-expression. */
24571 static tree
24573 {
24574 tree expression;
24579 /* Figure out whether or not there is an assignment-expression
24580 following the "throw" keyword. */
24588 else
24592 }
24594 /* GNU Extensions */
24596 /* Parse an (optional) asm-specification.
24598 asm-specification:
24599 asm ( string-literal )
24601 If the asm-specification is present, returns a STRING_CST
24602 corresponding to the string-literal. Otherwise, returns
24603 NULL_TREE. */
24605 static tree
24607 {
24609 tree asm_specification;
24611 /* Peek at the next token. */
24613 /* If the next token isn't the `asm' keyword, then there's no
24614 asm-specification. */
24618 /* Consume the `asm' token. */
24620 /* Look for the `('. */
24621 matching_parens parens;
24624 /* Look for the string-literal. */
24627 /* Look for the `)'. */
24631 }
24633 /* Parse an asm-operand-list.
24635 asm-operand-list:
24636 asm-operand
24637 asm-operand-list , asm-operand
24639 asm-operand:
24640 string-literal ( expression )
24641 [ string-literal ] string-literal ( expression )
24643 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24644 each node is the expression. The TREE_PURPOSE is itself a
24645 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24646 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24647 is a STRING_CST for the string literal before the parenthesis. Returns
24648 ERROR_MARK_NODE if any of the operands are invalid. */
24650 static tree
24652 {
24657 {
24658 tree string_literal;
24659 tree expression;
24660 tree name;
24663 {
24664 /* Consume the `[' token. */
24666 /* Read the operand name. */
24671 /* Look for the closing `]'. */
24673 }
24674 else
24676 /* Look for the string-literal. */
24679 /* Look for the `('. */
24680 matching_parens parens;
24682 /* Parse the expression. */
24684 /* Look for the `)'. */
24692 /* Add this operand to the list. */
24694 expression,
24695 asm_operands);
24696 /* If the next token is not a `,', there are no more
24697 operands. */
24700 /* Consume the `,'. */
24702 }
24705 }
24707 /* Parse an asm-clobber-list.
24709 asm-clobber-list:
24710 string-literal
24711 asm-clobber-list , string-literal
24713 Returns a TREE_LIST, indicating the clobbers in the order that they
24714 appeared. The TREE_VALUE of each node is a STRING_CST. */
24716 static tree
24718 {
24722 {
24723 tree string_literal;
24725 /* Look for the string literal. */
24727 /* Add it to the list. */
24729 /* If the next token is not a `,', then the list is
24730 complete. */
24733 /* Consume the `,' token. */
24735 }
24738 }
24740 /* Parse an asm-label-list.
24742 asm-label-list:
24743 identifier
24744 asm-label-list , identifier
24746 Returns a TREE_LIST, indicating the labels in the order that they
24747 appeared. The TREE_VALUE of each node is a label. */
24749 static tree
24751 {
24755 {
24758 /* Look for the identifier. */
24761 {
24764 {
24770 }
24771 }
24772 /* If the next token is not a `,', then the list is
24773 complete. */
24776 /* Consume the `,' token. */
24778 }
24781 }
24783 /* Return TRUE iff the next tokens in the stream are possibly the
24784 beginning of a GNU extension attribute. */
24786 static bool
24788 {
24790 }
24792 /* Return TRUE iff the next tokens in the stream are possibly the
24793 beginning of a standard C++-11 attribute specifier. */
24795 static bool
24797 {
24799 }
24801 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24802 beginning of a standard C++-11 attribute specifier. */
24804 static bool
24806 {
24814 }
24816 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24817 beginning of a GNU extension attribute. */
24819 static bool
24821 {
24825 }
24827 /* Return true iff the next tokens can be the beginning of either a
24828 GNU attribute list, or a standard C++11 attribute sequence. */
24830 static bool
24832 {
24835 }
24837 /* Return true iff the next Nth tokens can be the beginning of either
24838 a GNU attribute list, or a standard C++11 attribute sequence. */
24840 static bool
24842 {
24845 }
24847 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24848 of GNU attributes, or return NULL. */
24850 static tree
24852 {
24856 }
24858 /* Parse an (optional) series of attributes.
24860 attributes:
24861 attributes attribute
24863 attribute:
24864 __attribute__ (( attribute-list [opt] ))
24866 The return value is as for cp_parser_gnu_attribute_list. */
24868 static tree
24870 {
24874 {
24876 tree attribute_list;
24879 /* Peek at the next token. */
24881 /* If it's not `__attribute__', then we're done. */
24885 /* Consume the `__attribute__' keyword. */
24887 /* Look for the two `(' tokens. */
24888 matching_parens outer_parens;
24890 matching_parens inner_parens;
24893 /* Peek at the next token. */
24896 /* Parse the attribute-list. */
24898 else
24899 /* If the next token is a `)', then there is no attribute
24900 list. */
24903 /* Look for the two `)' tokens. */
24911 /* Add these new attributes to the list. */
24913 }
24916 }
24918 /* Parse a GNU attribute-list.
24920 attribute-list:
24921 attribute
24922 attribute-list , attribute
24924 attribute:
24925 identifier
24926 identifier ( identifier )
24927 identifier ( identifier , expression-list )
24928 identifier ( expression-list )
24930 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24931 to an attribute. The TREE_PURPOSE of each node is the identifier
24932 indicating which attribute is in use. The TREE_VALUE represents
24933 the arguments, if any. */
24935 static tree
24937 {
24943 {
24945 tree identifier;
24946 tree attribute;
24948 /* Look for the identifier. We also allow keywords here; for
24949 example `__attribute__ ((const))' is legal. */
24953 {
24956 /* Consume the token, but save it since we need it for the
24957 SIMD enabled function parsing. */
24960 /* Save away the identifier that indicates which attribute
24961 this is. */
24963 /* For keywords, use the canonical spelling, not the
24964 parsed identifier. */
24971 /* Peek at the next token. */
24973 /* If it's an `(', then parse the attribute arguments. */
24975 {
24979 vec = cp_parser_parenthesized_expression_list
24985 else
24986 {
24989 }
24990 /* Save the arguments away. */
24992 }
24995 {
24996 /* Add this attribute to the list. */
24999 }
25002 }
25003 /* Now, look for more attributes. If the next token isn't a
25004 `,', we're done. */
25008 /* Consume the comma and keep going. */
25010 }
25013 /* We built up the list in reverse order. */
25015 }
25017 /* Parse a standard C++11 attribute.
25019 The returned representation is a TREE_LIST which TREE_PURPOSE is
25020 the scoped name of the attribute, and the TREE_VALUE is its
25021 arguments list.
25023 Note that the scoped name of the attribute is itself a TREE_LIST
25024 which TREE_PURPOSE is the namespace of the attribute, and
25025 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25026 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25027 and which TREE_PURPOSE is directly the attribute name.
25029 Clients of the attribute code should use get_attribute_namespace
25030 and get_attribute_name to get the actual namespace and name of
25031 attributes, regardless of their being GNU or C++11 attributes.
25033 attribute:
25034 attribute-token attribute-argument-clause [opt]
25036 attribute-token:
25037 identifier
25038 attribute-scoped-token
25040 attribute-scoped-token:
25041 attribute-namespace :: identifier
25043 attribute-namespace:
25044 identifier
25046 attribute-argument-clause:
25047 ( balanced-token-seq )
25049 balanced-token-seq:
25050 balanced-token [opt]
25051 balanced-token-seq balanced-token
25053 balanced-token:
25054 ( balanced-token-seq )
25055 [ balanced-token-seq ]
25056 { balanced-token-seq }. */
25058 static tree
25060 {
25064 /* First, parse name of the attribute, a.k.a attribute-token. */
25081 {
25082 /* We are seeing a scoped attribute token. */
25097 else
25098 {
25102 }
25106 NULL_TREE);
25108 }
25111 NULL_TREE);
25112 else
25113 {
25116 NULL_TREE);
25117 /* C++11 noreturn attribute is equivalent to GNU's. */
25120 /* C++14 deprecated attribute is equivalent to GNU's. */
25123 /* C++17 fallthrough attribute is equivalent to GNU's. */
25126 /* Transactional Memory TS optimize_for_synchronized attribute is
25127 equivalent to GNU transaction_callable. */
25131 /* Transactional Memory attributes are GNU attributes. */
25134 }
25136 /* Now parse the optional argument clause of the attribute. */
25141 {
25147 /* A GNU attribute that takes an identifier in parameter. */
25150 vec = cp_parser_parenthesized_expression_list
25156 else
25157 {
25160 }
25164 else
25166 }
25169 }
25171 /* Check that the attribute ATTRIBUTE appears at most once in the
25172 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25173 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25174 isn't implemented yet in GCC. */
25176 static void
25178 {
25180 {
25190 }
25191 }
25193 /* Parse a list of standard C++-11 attributes.
25195 attribute-list:
25196 attribute [opt]
25197 attribute-list , attribute[opt]
25198 attribute ...
25199 attribute-list , attribute ...
25200 */
25202 static tree
25204 {
25209 {
25214 {
25218 }
25221 {
25226 else
25227 {
25232 }
25234 }
25238 }
25241 }
25243 /* Parse a standard C++-11 attribute specifier.
25245 attribute-specifier:
25246 [ [ attribute-using-prefix [opt] attribute-list ] ]
25247 alignment-specifier
25249 attribute-using-prefix:
25250 using attribute-namespace :
25252 alignment-specifier:
25253 alignas ( type-id ... [opt] )
25254 alignas ( alignment-expression ... [opt] ). */
25256 static tree
25258 {
25264 {
25271 {
25282 {
25286 "attribute using prefix only available "
25292 }
25293 else
25295 }
25302 else
25303 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25304 when we are sure that we have actually parsed them. */
25306 }
25307 else
25308 {
25309 tree alignas_expr;
25311 /* Look for an alignment-specifier. */
25322 matching_parens parens;
25330 {
25337 }
25342 /* Handle alignas (pack...). */
25344 {
25347 }
25349 /* Something went wrong, so don't build the attribute. */
25356 /* Build the C++-11 representation of an 'aligned'
25357 attribute. */
25358 attributes =
25361 alignas_expr);
25362 }
25365 }
25367 /* Parse a standard C++-11 attribute-specifier-seq.
25369 attribute-specifier-seq:
25370 attribute-specifier-seq [opt] attribute-specifier
25371 */
25373 static tree
25375 {
25380 {
25389 else
25392 }
25395 }
25397 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25398 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25399 current value of the PEDANTIC flag, regardless of whether or not
25400 the `__extension__' keyword is present. The caller is responsible
25401 for restoring the value of the PEDANTIC flag. */
25403 static bool
25405 {
25406 /* Save the old value of the PEDANTIC flag. */
25410 {
25411 /* Consume the `__extension__' token. */
25413 /* We're not being pedantic while the `__extension__' keyword is
25414 in effect. */
25418 }
25421 }
25423 /* Parse a label declaration.
25425 label-declaration:
25426 __label__ label-declarator-seq ;
25428 label-declarator-seq:
25429 identifier , label-declarator-seq
25430 identifier */
25432 static void
25434 {
25435 /* Look for the `__label__' keyword. */
25439 {
25440 tree identifier;
25442 /* Look for an identifier. */
25444 /* If we failed, stop. */
25447 /* Declare it as a label. */
25449 /* If the next token is a `;', stop. */
25452 /* Look for the `,' separating the label declarations. */
25454 }
25456 /* Look for the final `;'. */
25458 }
25460 // -------------------------------------------------------------------------- //
25461 // Requires Clause
25463 // Parse a requires clause.
25464 //
25465 // requires-clause:
25466 // 'requires' logical-or-expression
25467 //
25468 // The required logical-or-expression must be a constant expression. Note
25469 // that we don't check that the expression is constepxr here. We defer until
25470 // we analyze constraints and then, we only check atomic constraints.
25471 static tree
25473 {
25474 // Parse the requires clause so that it is not automatically folded.
25482 }
25484 // Optionally parse a requires clause:
25485 static tree
25487 {
25490 {
25493 {
25496 /* Parse and discard the requires-clause. */
25499 }
25501 }
25504 }
25507 /*---------------------------------------------------------------------------
25508 Requires expressions
25509 ---------------------------------------------------------------------------*/
25511 /* Parse a requires expression
25513 requirement-expression:
25514 'requires' requirement-parameter-list [opt] requirement-body */
25515 static tree
25517 {
25521 /* A requires-expression shall appear only within a concept
25522 definition or a requires-clause.
25524 TODO: Implement this diagnostic correctly. */
25526 {
25530 }
25533 {
25534 /* Local parameters are delared as variables within the scope
25535 of the expression. They are not visible past the end of
25536 the expression. Expressions within the requires-expression
25537 are unevaluated. */
25538 struct scope_sentinel
25539 {
25541 {
25544 }
25547 {
25550 }
25553 /* Parse the optional parameter list. */
25555 {
25559 }
25560 else
25563 /* Parse the requirement body. */
25567 }
25569 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25570 the parm chain. */
25573 }
25575 /* Parse a parameterized requirement.
25577 requirement-parameter-list:
25578 '(' parameter-declaration-clause ')' */
25579 static tree
25581 {
25582 matching_parens parens;
25592 }
25594 /* Parse the body of a requirement.
25596 requirement-body:
25597 '{' requirement-list '}' */
25598 static tree
25600 {
25601 matching_braces braces;
25611 }
25613 /* Parse a list of requirements.
25615 requirement-list:
25616 requirement
25617 requirement-list ';' requirement[opt] */
25618 static tree
25620 {
25623 {
25630 /* If we see a semi-colon, consume it. */
25634 /* Stop processing at the end of the list. */
25637 }
25639 /* Reverse the order of requirements so they are analyzed in
25640 declaration order. */
25642 }
25644 /* Parse a syntactic requirement or type requirement.
25646 requirement:
25647 simple-requirement
25648 compound-requirement
25649 type-requirement
25650 nested-requirement */
25651 static tree
25653 {
25660 else
25662 }
25664 /* Parse a simple requirement.
25666 simple-requirement:
25667 expression ';' */
25668 static tree
25670 {
25679 }
25681 /* Parse a type requirement
25683 type-requirement
25684 nested-name-specifier [opt] required-type-name ';'
25686 required-type-name:
25687 type-name
25688 'template' [opt] simple-template-id */
25689 static tree
25691 {
25694 // Save the scope before parsing name specifiers.
25705 tree type;
25707 {
25716 }
25717 else
25736 }
25738 /* Parse a compound requirement
25740 compound-requirement:
25741 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25742 static tree
25744 {
25745 /* Parse an expression enclosed in '{ }'s. */
25746 matching_braces braces;
25757 /* Parse the optional noexcept. */
25760 {
25763 }
25765 /* Parse the optional trailing return type. */
25768 {
25776 }
25779 }
25781 /* Parse a nested requirement. This is the same as a requires clause.
25783 nested-requirement:
25784 requires-clause */
25785 static tree
25787 {
25793 }
25795 /* Support Functions */
25797 /* Return the appropriate prefer_type argument for lookup_name_real based on
25798 tag_type and template_mem_access. */
25802 {
25803 /* DR 141: When looking in the current enclosing context for a template-name
25804 after -> or ., only consider class templates. */
25808 {
25812 }
25813 }
25815 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25816 NAME should have one of the representations used for an
25817 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25818 is returned. If PARSER->SCOPE is a dependent type, then a
25819 SCOPE_REF is returned.
25821 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25822 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25823 was formed. Abstractly, such entities should not be passed to this
25824 function, because they do not need to be looked up, but it is
25825 simpler to check for this special case here, rather than at the
25826 call-sites.
25828 In cases not explicitly covered above, this function returns a
25829 DECL, OVERLOAD, or baselink representing the result of the lookup.
25830 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25831 is returned.
25833 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25834 (e.g., "struct") that was used. In that case bindings that do not
25835 refer to types are ignored.
25837 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25838 ignored.
25840 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25841 are ignored.
25843 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25844 types.
25846 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25847 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25848 NULL_TREE otherwise. */
25850 static cp_expr
25857 location_t name_location)
25858 {
25859 tree decl;
25862 /* Assume that the lookup will be unambiguous. */
25866 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25867 no longer valid. Note that if we are parsing tentatively, and
25868 the parse fails, OBJECT_TYPE will be automatically restored. */
25874 /* A template-id has already been resolved; there is no lookup to
25875 do. */
25879 {
25883 }
25885 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25886 it should already have been checked to make sure that the name
25887 used matches the type being destroyed. */
25889 {
25890 tree type;
25892 /* Figure out to which type this destructor applies. */
25897 else
25899 /* If that's not a class type, there is no destructor. */
25910 }
25912 /* By this point, the NAME should be an ordinary identifier. If
25913 the id-expression was a qualified name, the qualifying scope is
25914 stored in PARSER->SCOPE at this point. */
25917 /* Perform the lookup. */
25919 {
25925 /* If the SCOPE is dependent, the lookup must be deferred until
25926 the template is instantiated -- unless we are explicitly
25927 looking up names in uninstantiated templates. Even then, we
25928 cannot look up the name if the scope is not a class type; it
25929 might, for example, be a template type parameter. */
25934 /* Defer lookup. */
25936 else
25937 {
25940 /* If PARSER->SCOPE is a dependent type, then it must be a
25941 class type, and we must not be checking dependencies;
25942 otherwise, we would have processed this lookup above. So
25943 that PARSER->SCOPE is not considered a dependent base by
25944 lookup_member, we must enter the scope here. */
25948 /* If the PARSER->SCOPE is a template specialization, it
25949 may be instantiated during name lookup. In that case,
25950 errors may be issued. Even if we rollback the current
25951 tentative parse, those errors are valid. */
25956 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25957 lookup result and the nested-name-specifier nominates a class C:
25958 * if the name specified after the nested-name-specifier, when
25959 looked up in C, is the injected-class-name of C (Clause 9), or
25960 * if the name specified after the nested-name-specifier is the
25961 same as the identifier or the simple-template-id's template-
25962 name in the last component of the nested-name-specifier,
25963 the name is instead considered to name the constructor of
25964 class C. [ Note: for example, the constructor is not an
25965 acceptable lookup result in an elaborated-type-specifier so
25966 the constructor would not be used in place of the
25967 injected-class-name. --end note ] Such a constructor name
25968 shall be used only in the declarator-id of a declaration that
25969 names a constructor or in a using-declaration. */
25977 /* If we have a single function from a using decl, pull it out. */
25984 }
25986 /* If the scope is a dependent type and either we deferred lookup or
25987 we did lookup but didn't find the name, rememeber the name. */
25990 {
25992 {
25993 tree type;
25995 /* The resolution to Core Issue 180 says that `struct
25996 A::B' should be considered a type-name, even if `A'
25997 is dependent. */
26002 }
26006 CPP_CLOSE_PAREN)))
26010 else
26013 is_template);
26014 }
26017 }
26019 {
26020 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26021 OBJECT_TYPE is not a class. */
26023 /* If the OBJECT_TYPE is a template specialization, it may
26024 be instantiated during name lookup. In that case, errors
26025 may be issued. Even if we rollback the current tentative
26026 parse, those errors are valid. */
26028 name,
26031 tf_warning_or_error);
26032 else
26036 /* Look it up in the enclosing context. DR 141: When looking for a
26037 template-name after -> or ., only consider class templates. */
26042 /* The object is type-dependent, so we can't look anything up; we used
26043 this to get the DR 141 behavior. */
26047 }
26048 else
26049 {
26055 }
26057 /* If the lookup failed, let our caller know. */
26061 /* Pull out the template from an injected-class-name (or multiple). */
26065 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26067 {
26070 /* The error message we have to print is too complicated for
26071 cp_parser_error, so we incorporate its actions directly. */
26073 {
26075 name);
26077 }
26079 }
26087 /* If we have resolved the name of a member declaration, check to
26088 see if the declaration is accessible. When the name resolves to
26089 set of overloaded functions, accessibility is checked when
26090 overload resolution is done.
26092 During an explicit instantiation, access is not checked at all,
26093 as per [temp.explicit]. */
26100 }
26102 /* Like cp_parser_lookup_name, but for use in the typical case where
26103 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26104 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26106 static tree
26108 {
26110 none_type,
26115 location);
26116 }
26118 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26119 the current context, return the TYPE_DECL. If TAG_NAME_P is
26120 true, the DECL indicates the class being defined in a class-head,
26121 or declared in an elaborated-type-specifier.
26123 Otherwise, return DECL. */
26125 static tree
26127 {
26128 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26129 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26131 struct A {
26132 template <typename T> struct B;
26133 };
26135 template <typename T> struct A::B {};
26137 Similarly, in an elaborated-type-specifier:
26139 namespace N { struct X{}; }
26141 struct A {
26142 template <typename T> friend struct N::X;
26143 };
26145 However, if the DECL refers to a class type, and we are in
26146 the scope of the class, then the name lookup automatically
26147 finds the TYPE_DECL created by build_self_reference rather
26148 than a TEMPLATE_DECL. For example, in:
26150 template <class T> struct S {
26151 S s;
26152 };
26154 there is no need to handle such case. */
26160 }
26162 /* If too many, or too few, template-parameter lists apply to the
26163 declarator, issue an error message. Returns TRUE if all went well,
26164 and FALSE otherwise. */
26166 static bool
26169 location_t declarator_location)
26170 {
26172 {
26174 {
26182 /* If the DECLARATOR has the form `X<y>' then it uses one
26183 additional level of template parameters. */
26186 return cp_parser_check_template_parameters
26188 }
26204 }
26206 }
26208 /* NUM_TEMPLATES were used in the current declaration. If that is
26209 invalid, return FALSE and issue an error messages. Otherwise,
26210 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26211 declarator and we can print more accurate diagnostics. */
26213 static bool
26216 location_t location,
26218 {
26219 /* If there are the same number of template classes and parameter
26220 lists, that's OK. */
26223 /* If there are more, but only one more, then we are referring to a
26224 member template. That's OK too. */
26227 /* If there are more template classes than parameter lists, we have
26228 something like:
26230 template <class T> void S<T>::R<T>::f (); */
26232 {
26242 else
26245 }
26246 /* Otherwise, there are too many template parameter lists. We have
26247 something like:
26249 template <class T> template <class U> void S::f(); */
26252 }
26254 /* Parse an optional `::' token indicating that the following name is
26255 from the global namespace. If so, PARSER->SCOPE is set to the
26256 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26257 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26258 Returns the new value of PARSER->SCOPE, if the `::' token is
26259 present, and NULL_TREE otherwise. */
26261 static tree
26263 {
26266 /* Peek at the next token. */
26268 /* If we're looking at a `::' token then we're starting from the
26269 global namespace, not our current location. */
26271 {
26272 /* Consume the `::' token. */
26274 /* Set the SCOPE so that we know where to start the lookup. */
26280 }
26282 {
26286 }
26289 }
26291 /* Returns TRUE if the upcoming token sequence is the start of a
26292 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26293 declarator is preceded by the `friend' specifier. */
26295 static bool
26297 {
26300 tree nested_name_specifier;
26303 /* The common case is that this is not a constructor declarator, so
26304 try to avoid doing lots of work if at all possible. It's not
26305 valid declare a constructor at function scope. */
26308 /* And only certain tokens can begin a constructor declarator. */
26316 /* Parse tentatively; we are going to roll back all of the tokens
26317 consumed here. */
26319 /* Assume that we are looking at a constructor declarator. */
26322 /* Look for the optional `::' operator. */
26325 /* Look for the nested-name-specifier. */
26326 nested_name_specifier
26337 /* Outside of a class-specifier, there must be a
26338 nested-name-specifier. Except in C++17 mode, where we
26339 might be declaring a guiding declaration. */
26346 /* If we have a class scope, this is easy; DR 147 says that S::S always
26347 names the constructor, and no other qualified name could. */
26350 {
26360 }
26361 /* If we still think that this might be a constructor-declarator,
26362 look for a class-name. */
26364 {
26365 /* If we have:
26367 template <typename T> struct S {
26368 S();
26369 };
26371 we must recognize that the nested `S' names a class. */
26375 tree type_decl;
26379 none_type,
26386 {
26392 none_type,
26397 else
26399 }
26401 /* If there was no class-name, then this is not a constructor.
26402 Otherwise, if we are in a class-specifier and we aren't
26403 handling a friend declaration, check that its type matches
26404 current_class_type (c++/38313). Note: error_mark_node
26405 is left alone for error recovery purposes. */
26407 && (outside_class_specifier_p
26413 /* If we're still considering a constructor, we have to see a `(',
26414 to begin the parameter-declaration-clause, followed by either a
26415 `)', an `...', or a decl-specifier. We need to check for a
26416 type-specifier to avoid being fooled into thinking that:
26418 S (f) (int);
26420 is a constructor. (It is actually a function named `f' that
26421 takes one parameter (of type `int') and returns a value of type
26422 `S'. */
26430 /* A parameter declaration begins with a decl-specifier,
26431 which is either the "attribute" keyword, a storage class
26432 specifier, or (usually) a type-specifier. */
26434 {
26435 tree type;
26439 /* Names appearing in the type-specifier should be looked up
26440 in the scope of the class. */
26444 {
26447 {
26451 {
26454 }
26455 }
26457 }
26459 /* Inside the constructor parameter list, surrounding
26460 template-parameter-lists do not apply. */
26461 saved_num_template_parameter_lists
26465 /* Look for the type-specifier. */
26467 CP_PARSER_FLAGS_NONE,
26473 parser->num_template_parameter_lists
26476 /* Leave the scope of the class. */
26481 }
26482 }
26484 /* We did not really want to consume any tokens. */
26488 }
26490 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26491 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26492 they must be performed once we are in the scope of the function.
26494 Returns the function defined. */
26496 static tree
26497 cp_parser_function_definition_from_specifiers_and_declarator
26500 tree attributes,
26502 {
26503 tree fn;
26506 /* Begin the function-definition. */
26509 /* The things we're about to see are not directly qualified by any
26510 template headers we've seen thus far. */
26513 /* If there were names looked up in the decl-specifier-seq that we
26514 did not check, check them now. We must wait until we are in the
26515 scope of the function to perform the checks, since the function
26516 might be a friend. */
26520 {
26525 }
26528 {
26529 /* Skip the entire function. */
26532 }
26534 {
26535 /* Seen already, skip it. An error message has already been output. */
26539 /* If this is a function from a class, pop the nested class. */
26542 }
26543 else
26544 {
26545 timevar_id_t tv;
26548 else
26554 }
26557 }
26559 /* Parse the part of a function-definition that follows the
26560 declarator. INLINE_P is TRUE iff this function is an inline
26561 function defined within a class-specifier.
26563 Returns the function defined. */
26565 static tree
26568 {
26569 tree fn;
26574 bool fully_implicit_function_template_p
26577 tree implicit_template_parms
26580 cp_binding_level* implicit_template_scope
26586 /* If the next token is `return', then the code may be trying to
26587 make use of the "named return value" extension that G++ used to
26588 support. */
26591 {
26592 /* Consume the `return' keyword. */
26594 /* Look for the identifier that indicates what value is to be
26595 returned. */
26597 /* Issue an error message. */
26600 /* Skip tokens until we reach the start of the function body. */
26602 {
26609 }
26610 }
26611 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26612 anything declared inside `f'. */
26613 saved_in_unbraced_linkage_specification_p
26616 /* Inside the function, surrounding template-parameter-lists do not
26617 apply. */
26618 saved_num_template_parameter_lists
26622 /* If the next token is `try', `__transaction_atomic', or
26623 `__transaction_relaxed`, then we are looking at either function-try-block
26624 or function-transaction-block. Note that all of these include the
26625 function-body. */
26629 RID_TRANSACTION_RELAXED))
26633 else
26634 cp_parser_ctor_initializer_opt_and_function_body
26637 /* Finish the function. */
26639 /* Generate code for it, if necessary. */
26641 /* Restore the saved values. */
26642 parser->in_unbraced_linkage_specification_p
26644 parser->num_template_parameter_lists
26648 parser->fully_implicit_function_template_p
26650 parser->implicit_template_parms
26652 parser->implicit_template_scope
26659 }
26661 /* Parse a template-declaration body (following argument list). */
26663 static void
26665 tree parameter_list,
26667 {
26671 /* We just processed one more parameter list. */
26674 /* Get the deferred access checks from the parameter list. These
26675 will be checked once we know what is being declared, as for a
26676 member template the checks must be performed in the scope of the
26677 class containing the member. */
26680 /* Tentatively parse for a new template parameter list, which can either be
26681 the template keyword or a template introduction. */
26687 else
26688 {
26689 /* There are no access checks when parsing a template, as we do not
26690 know if a specialization will be a friend. */
26694 checks,
26695 member_p,
26700 /* If this is a member template declaration, let the front
26701 end know. */
26703 {
26708 }
26713 }
26714 /* We are done with the current parameter list. */
26719 /* Finish up. */
26722 /* Check the template arguments for a literal operator template. */
26726 {
26730 else
26731 {
26734 {
26740 }
26742 {
26751 }
26752 else
26754 }
26756 {
26759 " Expected non-type template argument pack <char...>"
26761 decl);
26762 else
26765 decl);
26766 }
26767 }
26769 /* Register member declarations. */
26772 /* If DECL is a function template, we must return to parse it later.
26773 (Even though there is no definition, there might be default
26774 arguments that need handling.) */
26778 }
26780 /* Parse a template introduction header for a template-declaration. Returns
26781 false if tentative parse fails. */
26783 static bool
26785 {
26792 /* Look for the optional `::' operator. */
26795 /* Look for the nested-name-specifier. */
26805 /* Look up the concept for which we will be matching
26806 template parameters. */
26816 /* Look for opening brace for introduction. */
26817 matching_braces braces;
26825 /* Build vector of placeholder parameters and grab
26826 matching identifiers. */
26829 /* The introduction-list shall not be empty. */
26832 {
26835 }
26837 /* Look for closing brace for introduction. */
26842 {
26846 }
26848 /* Build and associate the constraint. */
26851 {
26853 member_p);
26855 }
26859 }
26861 /* Parse a normal template-declaration following the template keyword. */
26863 static void
26865 {
26866 tree parameter_list;
26870 /* Look for the `<' token. */
26874 {
26875 /* 14.5.2.2 [temp.mem]
26877 A local class shall not have member templates. */
26882 }
26883 /* [temp]
26885 A template ... shall not have C linkage. */
26887 {
26890 /* Give it C++ linkage to avoid confusing other parts of the
26891 front end. */
26894 }
26895 else
26898 /* We cannot perform access checks on the template parameter
26899 declarations until we know what is being declared, just as we
26900 cannot check the decl-specifier list. */
26903 /* If the next token is `>', then we have an invalid
26904 specialization. Rather than complain about an invalid template
26905 parameter, issue an error message here. */
26907 {
26911 }
26912 else
26913 {
26914 /* Parse the template parameters. */
26916 }
26918 /* Look for the `>'. */
26921 /* Manage template requirements */
26923 {
26928 }
26931 member_p);
26933 /* For the erroneous case of a template with C linkage, we pushed an
26934 implicit C++ linkage scope; exit that scope now. */
26937 }
26939 /* Parse a template-declaration, assuming that the `export' (and
26940 `extern') keywords, if present, has already been scanned. MEMBER_P
26941 is as for cp_parser_template_declaration. */
26943 static bool
26945 {
26947 {
26951 }
26956 }
26958 /* Perform the deferred access checks from a template-parameter-list.
26959 CHECKS is a TREE_LIST of access checks, as returned by
26960 get_deferred_access_checks. */
26962 static void
26963 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26964 {
26968 }
26970 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26971 `function-definition' sequence that follows a template header.
26972 If MEMBER_P is true, this declaration appears in a class scope.
26974 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26975 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26977 static tree
26983 {
26986 cp_decl_specifier_seq decl_specifiers;
26990 /* This function is only used when processing a template
26991 declaration. */
26995 /* Defer access checks until we know what is being declared. */
26998 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26999 alternative. */
27002 CP_PARSER_FLAGS_OPTIONAL,
27008 /* There are no template typedefs. */
27010 {
27014 }
27016 /* Gather up the access checks that occurred the
27017 decl-specifier-seq. */
27020 /* Check for the declaration of a template class. */
27022 {
27025 {
27026 // If this is a declaration, but not a definition, associate
27027 // any constraints with the type declaration. Constraints
27028 // are associated with definitions in cp_parser_class_specifier.
27034 /* In this case:
27036 struct C {
27037 friend template <typename T> struct A<T>::B;
27038 };
27040 A<T>::B will be represented by a TYPENAME_TYPE, and
27041 therefore not recognized by shadow_tag. */
27043 && !decl
27050 else
27053 /* Perform access checks for template parameters. */
27056 /* Give a helpful diagnostic for
27057 template <class T> struct A { } a;
27058 if we aren't already recovering from an error. */
27061 {
27063 "a class template declaration must not declare "
27067 }
27068 }
27069 }
27071 /* Complain about missing 'typename' or other invalid type names. */
27074 {
27075 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27076 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27077 the rest of this declaration. */
27080 }
27082 /* If it's not a template class, try for a template function. If
27083 the next token is a `;', then this declaration does not declare
27084 anything. But, if there were errors in the decl-specifiers, then
27085 the error might well have come from an attempted class-specifier.
27086 In that case, there's no need to warn about a missing declarator. */
27090 {
27093 checks,
27095 member_p,
27096 declares_class_or_enum,
27100 /* 7.1.1-1 [dcl.stc]
27102 A storage-class-specifier shall not be specified in an explicit
27103 specialization... */
27105 && explicit_specialization_p
27107 {
27111 }
27115 }
27117 /* Look for a trailing `;' after the declaration. */
27123 out:
27126 /* Clear any current qualification; whatever comes next is the start
27127 of something new. */
27133 }
27135 /* Parse a cast-expression that is not the operand of a unary "&". */
27137 static cp_expr
27139 {
27142 }
27144 /* Parse a functional cast to TYPE. Returns an expression
27145 representing the cast. */
27147 static cp_expr
27149 {
27151 tree expression_list;
27152 cp_expr cast;
27161 {
27171 /* Create a location of the form:
27172 type_name{i, f}
27173 ^~~~~~~~~~~~~~~
27174 with caret == start at the start of the type name,
27175 finishing at the closing brace. */
27176 location_t finish_loc
27179 finish_loc);
27182 }
27191 else
27192 {
27195 }
27198 tf_warning_or_error);
27199 /* [expr.const]/1: In an integral constant expression "only type
27200 conversions to integral or enumeration type can be used". */
27206 NIC_CONSTRUCTOR))
27209 /* Create a location of the form:
27210 float(i)
27211 ^~~~~~~~
27212 with caret == start at the start of the type name,
27213 finishing at the closing paren. */
27214 location_t finish_loc
27219 }
27221 /* Save the tokens that make up the body of a member function defined
27222 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27223 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27224 specifiers applied to the declaration. Returns the FUNCTION_DECL
27225 for the member function. */
27227 static tree
27231 tree attributes)
27232 {
27235 tree fn;
27238 /* Create the FUNCTION_DECL. */
27242 /* If something went badly wrong, bail out now. */
27244 {
27245 /* If there's a function-body, skip it. */
27250 }
27252 /* Remember it, if there default args to post process. */
27255 /* Save away the tokens that make up the body of the
27256 function. */
27262 RID_TRANSACTION_ATOMIC))
27263 {
27265 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27272 {
27278 }
27279 else
27282 {
27286 }
27287 }
27289 /* Handle function try blocks. */
27291 {
27294 }
27295 /* We can have braced-init-list mem-initializers before the fn body. */
27297 {
27300 {
27301 /* cache_group will stop after an un-nested { } pair, too. */
27305 /* variadic mem-inits have ... after the ')'. */
27308 }
27309 }
27311 /* Handle function try blocks. */
27317 /* Save away the inline definition; we will process it when the
27318 class is complete. */
27322 /* We need to know that this was defined in the class, so that
27323 friend templates are handled correctly. */
27326 /* Add FN to the queue of functions to be parsed later. */
27330 }
27332 /* Save the tokens that make up the in-class initializer for a non-static
27333 data member. Returns a DEFAULT_ARG. */
27335 static tree
27337 {
27339 }
27341 /* Parse a template-argument-list, as well as the trailing ">" (but
27342 not the opening "<"). See cp_parser_template_argument_list for the
27343 return value. */
27345 static tree
27347 {
27348 tree arguments;
27349 tree saved_scope;
27350 tree saved_qualifying_scope;
27351 tree saved_object_scope;
27356 /* [temp.names]
27358 When parsing a template-id, the first non-nested `>' is taken as
27359 the end of the template-argument-list rather than a greater-than
27360 operator. */
27361 saved_greater_than_is_operator_p
27364 /* Parsing the argument list may modify SCOPE, so we save it
27365 here. */
27369 /* We need to evaluate the template arguments, even though this
27370 template-id may be nested within a "sizeof". */
27375 /* Parse the template-argument-list itself. */
27379 else
27381 /* Look for the `>' that ends the template-argument-list. If we find
27382 a '>>' instead, it's probably just a typo. */
27384 {
27386 {
27387 /* In C++0x, a `>>' in a template argument list or cast
27388 expression is considered to be two separate `>'
27389 tokens. So, change the current token to a `>', but don't
27390 consume it: it will be consumed later when the outer
27391 template argument list (or cast expression) is parsed.
27392 Note that this replacement of `>' for `>>' is necessary
27393 even if we are parsing tentatively: in the tentative
27394 case, after calling
27395 cp_parser_enclosed_template_argument_list we will always
27396 throw away all of the template arguments and the first
27397 closing `>', either because the template argument list
27398 was erroneous or because we are replacing those tokens
27399 with a CPP_TEMPLATE_ID token. The second `>' (which will
27400 not have been thrown away) is needed either to close an
27401 outer template argument list or to complete a new-style
27402 cast. */
27405 }
27407 {
27408 /* If we're in a nested template argument list, the '>>' has
27409 to be a typo for '> >'. We emit the error message, but we
27410 continue parsing and we push a '>' as next token, so that
27411 the argument list will be parsed correctly. Note that the
27412 global source location is still on the token before the
27413 '>>', so we need to say explicitly where we want it. */
27421 }
27422 else
27423 {
27424 /* If this is not a nested template argument list, the '>>'
27425 is a typo for '>'. Emit an error message and continue.
27426 Same deal about the token location, but here we can get it
27427 right by consuming the '>>' before issuing the diagnostic. */
27430 "spurious %<>>%>, use %<>%> to terminate "
27432 }
27433 }
27434 else
27436 /* The `>' token might be a greater-than operator again now. */
27437 parser->greater_than_is_operator_p
27439 /* Restore the SAVED_SCOPE. */
27447 }
27449 /* MEMBER_FUNCTION is a member function, or a friend. If default
27450 arguments, or the body of the function have not yet been parsed,
27451 parse them now. */
27453 static void
27455 {
27457 /* If this member is a template, get the underlying
27458 FUNCTION_DECL. */
27462 /* There should not be any class definitions in progress at this
27463 point; the bodies of members are only parsed outside of all class
27464 definitions. */
27466 /* While we're parsing the member functions we might encounter more
27467 classes. We want to handle them right away, but we don't want
27468 them getting mixed up with functions that are currently in the
27469 queue. */
27472 /* Make sure that any template parameters are in scope. */
27475 /* If the body of the function has not yet been parsed, parse it
27476 now. */
27478 {
27479 tree function_scope;
27482 /* The function is no longer pending; we are processing it. */
27487 /* If this is a local class, enter the scope of the containing
27488 function. */
27493 /* Push the body of the function onto the lexer stack. */
27496 /* Let the front end know that we going to be defining this
27497 function. */
27501 /* Don't do access checking if it is a templated function. */
27505 /* #pragma omp declare reduction needs special parsing. */
27507 {
27512 }
27513 else
27514 /* Now, parse the body of the function. */
27521 /* Leave the scope of the containing function. */
27525 }
27527 /* Remove any template parameters from the symbol table. */
27530 /* Restore the queue. */
27533 }
27535 /* If DECL contains any default args, remember it on the unparsed
27536 functions queue. */
27538 static void
27540 {
27541 tree probe;
27544 probe;
27547 {
27551 }
27552 }
27554 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27555 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27556 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27557 from the parameter-type-list. */
27559 static tree
27562 {
27564 tree parsed_arg;
27570 /* Push the saved tokens for the default argument onto the parser's
27571 lexer stack. */
27577 /* Parse the default argument. */
27588 {
27589 /* In a non-template class, check conversions now. In a template,
27590 we'll wait and instantiate these as needed. */
27593 tf_warning_or_error);
27596 else
27598 }
27600 /* If the token stream has not been completely used up, then
27601 there was extra junk after the end of the default
27602 argument. */
27604 {
27607 else
27609 }
27611 /* Revert to the main lexer. */
27615 }
27617 /* FIELD is a non-static data member with an initializer which we saved for
27618 later; parse it now. */
27620 static void
27622 {
27623 tree def;
27630 NULL_TREE);
27636 }
27638 /* FN is a FUNCTION_DECL which may contains a parameter with an
27639 unparsed DEFAULT_ARG. Parse the default args now. This function
27640 assumes that the current scope is the scope in which the default
27641 argument should be processed. */
27643 static void
27645 {
27649 /* While we're parsing the default args, we might (due to the
27650 statement expression extension) encounter more classes. We want
27651 to handle them right away, but we don't want them getting mixed
27652 up with default args that are currently in the queue. */
27655 /* Local variable names (and the `this' keyword) may not appear
27656 in a default argument. */
27667 {
27669 tree parsed_arg;
27671 tree copy;
27678 /* This can happen for a friend declaration for a function
27679 already declared with default arguments. */
27682 parsed_arg
27684 default_arg,
27688 /* Update any instantiations we've already created. */
27692 }
27696 /* Make sure no default arg is missing. */
27699 /* Restore the state of local_variables_forbidden_p. */
27702 /* Restore the queue. */
27704 }
27706 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27708 sizeof ... ( identifier )
27710 where the 'sizeof' token has already been consumed. */
27712 static tree
27714 {
27715 /* Consume the `...'. */
27719 matching_parens parens;
27723 else
27731 /* The name is not qualified. */
27750 }
27752 /* Parse the operand of `sizeof' (or a similar operator). Returns
27753 either a TYPE or an expression, depending on the form of the
27754 input. The KEYWORD indicates which kind of expression we have
27755 encountered. */
27757 static tree
27759 {
27766 /* If it's a `...', then we are computing the length of a parameter
27767 pack. */
27772 /* Types cannot be defined in a `sizeof' expression. Save away the
27773 old message. */
27775 /* And create the new one. */
27781 /* The restrictions on constant-expressions do not apply inside
27782 sizeof expressions. */
27783 saved_integral_constant_expression_p
27785 saved_non_integral_constant_expression_p
27789 /* Do not actually evaluate the expression. */
27792 /* If it's a `(', then we might be looking at the type-id
27793 construction. */
27795 {
27798 /* We can't be sure yet whether we're looking at a type-id or an
27799 expression. */
27802 matching_parens parens;
27805 /* Note: as a GNU Extension, compound literals are considered
27806 postfix-expressions as they are in C99, so they are valid
27807 arguments to sizeof. See comment in cp_parser_cast_expression
27808 for details. */
27811 else
27812 {
27815 /* Look for the type-id. */
27817 /* Look for the closing `)'. */
27820 }
27822 /* If all went well, then we're done. */
27824 {
27825 cp_decl_specifier_seq decl_specs;
27827 /* Build a trivial decl-specifier-seq. */
27831 /* Call grokdeclarator to figure out what type this is. */
27834 TYPENAME,
27837 }
27838 }
27840 /* If the type-id production did not work out, then we must be
27841 looking at the unary-expression production. */
27845 /* Go back to evaluating expressions. */
27849 /* Free the message we created. */
27851 /* And restore the old one. */
27853 parser->integral_constant_expression_p
27855 parser->non_integral_constant_expression_p
27859 }
27861 /* If the current declaration has no declarator, return true. */
27863 static bool
27865 {
27866 /* If the next token is a `;' or a `,' then there is no
27867 declarator. */
27870 }
27872 /* Update the DECL_SPECS to reflect the storage class indicated by
27873 KEYWORD. */
27875 static void
27880 {
27881 cp_storage_class storage_class;
27884 {
27888 }
27890 {
27893 }
27898 {
27901 }
27904 {
27922 }
27926 /* A storage class specifier cannot be applied alongside a typedef
27927 specifier. If there is a typedef specifier present then set
27928 conflicting_specifiers_p which will trigger an error later
27929 on in grokdeclarator. */
27932 }
27934 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27935 is true, the type is a class or enum definition. */
27937 static void
27939 tree type_spec,
27942 {
27945 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27946 (with, for example, in "typedef int wchar_t;") we remember that
27947 this is what happened. In system headers, we ignore these
27948 declarations so that G++ can work with system headers that are not
27949 C++-safe. */
27951 && !type_definition_p
27961 {
27964 ds_redefined_builtin_type_spec,
27965 token);
27967 {
27971 }
27972 }
27975 else
27976 {
27981 }
27982 }
27984 /* True iff TOKEN is the GNU keyword __thread. */
27986 static bool
27988 {
27991 }
27993 /* Set the location for a declarator specifier and check if it is
27994 duplicated.
27996 DECL_SPECS is the sequence of declarator specifiers onto which to
27997 set the location.
27999 DS is the single declarator specifier to set which location is to
28000 be set onto the existing sequence of declarators.
28002 LOCATION is the location for the declarator specifier to
28003 consider. */
28005 static void
28008 {
28017 {
28021 }
28022 else
28023 {
28025 {
28029 else
28030 {
28033 OPT_Wlong_long,
28035 }
28036 }
28038 {
28043 else
28044 {
28048 }
28049 }
28050 else
28051 {
28067 "__complex"
28068 };
28072 }
28073 }
28074 }
28076 /* Return true iff the declarator specifier DS is present in the
28077 sequence of declarator specifiers DECL_SPECS. */
28079 bool
28081 cp_decl_spec ds)
28082 {
28089 }
28091 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28092 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28094 static bool
28096 {
28098 }
28100 /* Issue an error message indicating that TOKEN_DESC was expected.
28101 If KEYWORD is true, it indicated this function is called by
28102 cp_parser_require_keword and the required token can only be
28103 a indicated keyword.
28105 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28106 within any error as the location of an "opening" token matching
28107 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28108 RT_CLOSE_PAREN). */
28110 static void
28112 required_token token_desc,
28114 location_t matching_location)
28115 {
28121 {
28190 }
28193 {
28195 {
28273 }
28274 }
28278 }
28281 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28282 issue an error message indicating that TOKEN_DESC was expected.
28284 Returns the token consumed, if the token had the appropriate type.
28285 Otherwise, returns NULL.
28287 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28288 within any error as the location of an "opening" token matching
28289 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28290 RT_CLOSE_PAREN). */
28295 required_token token_desc,
28296 location_t matching_location)
28297 {
28300 else
28301 {
28302 /* Output the MESSAGE -- unless we're parsing tentatively. */
28305 matching_location);
28307 }
28308 }
28310 /* An error message is produced if the next token is not '>'.
28311 All further tokens are skipped until the desired token is
28312 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28314 static void
28316 {
28317 /* Current level of '< ... >'. */
28319 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28322 /* Are we ready, yet? If not, issue error message. */
28326 /* Skip tokens until the desired token is found. */
28328 {
28329 /* Peek at the next token. */
28331 {
28339 /* C++0x views the `>>' operator as two `>' tokens, but
28340 C++98 does not. */
28343 {
28344 /* We've hit a `>>' where the first `>' closes the
28345 template argument list, and the second `>' is
28346 spurious. Just consume the `>>' and stop; we've
28347 already produced at least one error. */
28350 }
28351 /* Fall through for C++0x, so we handle the second `>' in
28352 the `>>'. */
28357 {
28358 /* We've reached the token we want, consume it and stop. */
28361 }
28380 /* The '>' was probably forgotten, don't look further. */
28385 }
28387 /* Consume this token. */
28389 }
28390 }
28392 /* If the next token is the indicated keyword, consume it. Otherwise,
28393 issue an error message indicating that TOKEN_DESC was expected.
28395 Returns the token consumed, if the token had the appropriate type.
28396 Otherwise, returns NULL. */
28401 required_token token_desc)
28402 {
28406 {
28408 UNKNOWN_LOCATION);
28410 }
28413 }
28415 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28416 function-definition. */
28418 static bool
28420 {
28423 /* A ctor-initializer begins with a `:'. */
28425 /* A function-try-block begins with `try'. */
28427 /* A function-transaction-block begins with `__transaction_atomic'
28428 or `__transaction_relaxed'. */
28431 /* The named return value extension begins with `return'. */
28433 }
28435 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28436 definition. */
28438 static bool
28440 {
28447 }
28449 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28450 C++0x) ending a template-argument. */
28452 static bool
28454 {
28462 }
28464 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28465 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28467 static bool
28470 {
28476 /* Check for the sequence `<::' in the original code. It would be lexed as
28477 `[:', where `[' is a digraph, and there is no whitespace before
28478 `:'. */
28480 {
28485 }
28487 }
28489 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28490 or none_type otherwise. */
28492 static enum tag_types
28494 {
28496 {
28506 }
28507 }
28509 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28510 or none_type otherwise or if the token is null. */
28512 static enum tag_types
28514 {
28519 {
28527 }
28528 }
28530 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28532 static void
28534 {
28538 {
28542 type))
28545 }
28546 }
28548 /* Issue an error message if DECL is redeclared with different
28549 access than its original declaration [class.access.spec/3].
28550 This applies to nested classes, nested class templates and
28551 enumerations [class.mem/1]. */
28553 static void
28555 {
28566 }
28568 /* Look for the `template' keyword, as a syntactic disambiguator.
28569 Return TRUE iff it is present, in which case it will be
28570 consumed. */
28572 static bool
28574 {
28576 {
28577 /* In C++98 the `template' keyword can only be used within templates;
28578 outside templates the parser can always figure out what is a
28579 template and what is not. In C++11, per the resolution of DR 468,
28580 `template' is allowed in cases where it is not strictly necessary. */
28583 {
28586 "in C++98 %<template%> (as a disambiguator) is only "
28588 /* If this part of the token stream is rescanned, the same
28589 error message would be generated. So, we purge the token
28590 from the stream. */
28593 }
28594 else
28595 {
28596 /* Consume the `template' keyword. */
28599 }
28600 }
28602 }
28604 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28605 set PARSER->SCOPE, and perform other related actions. */
28607 static void
28609 {
28612 /* Get the stored value. */
28614 /* Set the scope from the stored value. */
28618 }
28620 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28621 encounter the end of a block before what we were looking for. */
28623 static bool
28627 {
28629 {
28632 /* Abort a parenthesized expression if we encounter a semicolon. */
28636 /* If we've reached the end of the file, stop. */
28642 /* We've hit the end of an enclosing block, so there's been some
28643 kind of syntax error. */
28646 /* Consume the token. */
28648 /* See if it starts a new group. */
28650 {
28652 /* In theory this should probably check end == '}', but
28653 cp_parser_save_member_function_body needs it to exit
28654 after either '}' or ')' when called with ')'. */
28657 }
28659 {
28663 }
28668 }
28669 }
28671 /* Like above, for caching a default argument or NSDMI. Both of these are
28672 terminated by a non-nested comma, but it can be unclear whether or not a
28673 comma is nested in a template argument list unless we do more parsing.
28674 In order to handle this ambiguity, when we encounter a ',' after a '<'
28675 we try to parse what follows as a parameter-declaration-list (in the
28676 case of a default argument) or a member-declarator (in the case of an
28677 NSDMI). If that succeeds, then we stop caching. */
28679 static tree
28681 {
28686 tree default_argument;
28688 /* Add tokens until we have processed the entire default
28689 argument. We add the range [first_token, token). */
28692 {
28693 /* For list-initialization, this is straightforward. */
28696 }
28698 {
28701 /* Peek at the next token. */
28703 /* What we do depends on what token we have. */
28705 {
28706 /* In valid code, a default argument must be
28707 immediately followed by a `,' `)', or `...'. */
28710 {
28711 /* If we've seen a '<', we might be in a
28712 template-argument-list. Until Core issue 325 is
28713 resolved, we don't know how this situation ought
28714 to be handled, so try to DTRT. We check whether
28715 what comes after the comma is a valid parameter
28716 declaration list. If it is, then the comma ends
28717 the default argument; otherwise the default
28718 argument continues. */
28722 /* Set ITALP so cp_parser_parameter_declaration_list
28723 doesn't decide to commit to this parse. */
28730 {
28731 /* Parse declarators until we reach a non-comma or
28732 somthing that cannot be an initializer.
28733 Just checking whether we're looking at a single
28734 declarator is insufficient. Consider:
28735 int var = tuple<T,U>::x;
28736 The template parameter 'U' looks exactly like a
28737 declarator. */
28738 do
28739 {
28750 }
28752 /* If we met an '=' or ';' then the original comma
28753 was the end of the NSDMI. Otherwise assume
28754 we're still in the NSDMI. */
28757 }
28758 else
28759 {
28764 }
28771 }
28772 /* FALLTHRU */
28775 /* If we run into a non-nested `;', `}', or `]',
28776 then the code is invalid -- but the default
28777 argument is certainly over. */
28782 /* Handle correctly int n = sizeof ... ( p ); */
28785 /* Update DEPTH, if necessary. */
28800 /* This might be the comparison operator, or it might
28801 start a template argument list. */
28808 /* Fall through for C++0x, which treats the `>>'
28809 operator like two `>' tokens in certain
28810 cases. */
28815 {
28816 /* This might be an operator, or it might close a
28817 template argument list. But if a previous '<'
28818 started a template argument list, this will have
28819 closed it, so we can't be in one anymore. */
28823 }
28826 /* If we run out of tokens, issue an error message. */
28834 /* In these cases, we should look for template-ids.
28835 For example, if the default argument is
28836 `X<int, double>()', we need to do name lookup to
28837 figure out whether or not `X' is a template; if
28838 so, the `,' does not end the default argument.
28840 That is not yet done. */
28845 }
28847 /* If we've reached the end, stop. */
28851 /* Add the token to the token block. */
28853 }
28855 /* Create a DEFAULT_ARG to represent the unparsed default
28856 argument. */
28863 }
28865 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28867 location_t
28869 {
28874 }
28876 /* Begin parsing tentatively. We always save tokens while parsing
28877 tentatively so that if the tentative parsing fails we can restore the
28878 tokens. */
28880 static void
28882 {
28883 /* Enter a new parsing context. */
28885 /* Begin saving tokens. */
28887 /* In order to avoid repetitive access control error messages,
28888 access checks are queued up until we are no longer parsing
28889 tentatively. */
28891 }
28893 /* Commit to the currently active tentative parse. */
28895 static void
28897 {
28901 /* Mark all of the levels as committed. */
28904 {
28911 }
28912 }
28914 /* Commit to the topmost currently active tentative parse.
28916 Note that this function shouldn't be called when there are
28917 irreversible side-effects while in a tentative state. For
28918 example, we shouldn't create a permanent entry in the symbol
28919 table, or issue an error message that might not apply if the
28920 tentative parse is aborted. */
28922 static void
28924 {
28929 {
28937 }
28938 }
28940 /* Abort the currently active tentative parse. All consumed tokens
28941 will be rolled back, and no diagnostics will be issued. */
28943 static void
28945 {
28949 /* Now, pretend that we want to see if the construct was
28950 successfully parsed. */
28952 }
28954 /* Stop parsing tentatively. If a parse error has occurred, restore the
28955 token stream. Otherwise, commit to the tokens we have consumed.
28956 Returns true if no error occurred; false otherwise. */
28958 static bool
28960 {
28964 /* Remember whether or not an error occurred, since we are about to
28965 destroy that information. */
28967 /* Remove the topmost context from the stack. */
28970 /* If no parse errors occurred, commit to the tentative parse. */
28972 {
28973 /* Commit to the tokens read tentatively, unless that was
28974 already done. */
28979 }
28980 /* Otherwise, if errors occurred, roll back our state so that things
28981 are just as they were before we began the tentative parse. */
28982 else
28983 {
28986 }
28987 /* Add the context to the front of the free list. */
28992 }
28994 /* Returns true if we are parsing tentatively and are not committed to
28995 this tentative parse. */
28997 static bool
28999 {
29002 }
29004 /* Returns nonzero iff an error has occurred during the most recent
29005 tentative parse. */
29007 static bool
29009 {
29012 }
29014 /* Returns nonzero if GNU extensions are allowed. */
29016 static bool
29018 {
29020 }
29021 \f
29022 /* Objective-C++ Productions */
29025 /* Parse an Objective-C expression, which feeds into a primary-expression
29026 above.
29028 objc-expression:
29029 objc-message-expression
29030 objc-string-literal
29031 objc-encode-expression
29032 objc-protocol-expression
29033 objc-selector-expression
29035 Returns a tree representation of the expression. */
29037 static cp_expr
29039 {
29040 /* Try to figure out what kind of declaration is present. */
29044 {
29054 {
29066 }
29067 /* FALLTHRU */
29073 }
29076 }
29078 /* Parse an Objective-C message expression.
29080 objc-message-expression:
29081 [ objc-message-receiver objc-message-args ]
29083 Returns a representation of an Objective-C message. */
29085 static tree
29087 {
29099 /* Construct a location e.g.
29100 [self func1:5]
29101 ^~~~~~~~~~~~~~
29102 ranging from the '[' to the ']', with the caret at the start. */
29107 }
29109 /* Parse an objc-message-receiver.
29111 objc-message-receiver:
29112 expression
29113 simple-type-specifier
29115 Returns a representation of the type or expression. */
29117 static tree
29119 {
29120 tree rcv;
29122 /* An Objective-C message receiver may be either (1) a type
29123 or (2) an expression. */
29127 /* If that worked out, fine. */
29134 CP_PARSER_FLAGS_NONE);
29141 }
29143 /* Parse the arguments and selectors comprising an Objective-C message.
29145 objc-message-args:
29146 objc-selector
29147 objc-selector-args
29148 objc-selector-args , objc-comma-args
29150 objc-selector-args:
29151 objc-selector [opt] : assignment-expression
29152 objc-selector-args objc-selector [opt] : assignment-expression
29154 objc-comma-args:
29155 assignment-expression
29156 objc-comma-args , assignment-expression
29158 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29159 selector arguments and TREE_VALUE containing a list of comma
29160 arguments. */
29162 static tree
29164 {
29170 {
29176 /* Detect if we have a unary selector. */
29185 sel_args
29190 }
29192 /* Handle non-selector arguments, if any. */
29194 {
29195 tree arg;
29200 addl_args
29205 }
29208 {
29211 }
29214 }
29216 /* Parse an Objective-C encode expression.
29218 objc-encode-expression:
29219 @encode objc-typename
29221 Returns an encoded representation of the type argument. */
29223 static cp_expr
29225 {
29226 tree type;
29231 matching_parens parens;
29238 {
29242 }
29244 /* This happens if we find @encode(T) (where T is a template
29245 typename or something dependent on a template typename) when
29246 parsing a template. In that case, we can't compile it
29247 immediately, but we rather create an AT_ENCODE_EXPR which will
29248 need to be instantiated when the template is used.
29249 */
29251 {
29255 }
29258 /* Build a location of the form:
29259 @encode(int)
29260 ^~~~~~~~~~~~
29261 with caret==start at the @ token, finishing at the close paren. */
29262 location_t combined_loc
29267 }
29269 /* Parse an Objective-C @defs expression. */
29271 static tree
29273 {
29274 tree name;
29277 matching_parens parens;
29283 }
29285 /* Parse an Objective-C protocol expression.
29287 objc-protocol-expression:
29288 @protocol ( identifier )
29290 Returns a representation of the protocol expression. */
29292 static tree
29294 {
29295 tree proto;
29299 matching_parens parens;
29304 /* Build a location of the form:
29305 @protocol(prot)
29306 ^~~~~~~~~~~~~~~
29307 with caret==start at the @ token, finishing at the close paren. */
29308 location_t combined_loc
29314 }
29316 /* Parse an Objective-C selector expression.
29318 objc-selector-expression:
29319 @selector ( objc-method-signature )
29321 objc-method-signature:
29322 objc-selector
29323 objc-selector-seq
29325 objc-selector-seq:
29326 objc-selector :
29327 objc-selector-seq objc-selector :
29329 Returns a representation of the method selector. */
29331 static tree
29333 {
29340 matching_parens parens;
29346 {
29355 {
29356 /* Detect if we have a unary selector. */
29358 {
29361 }
29362 else
29363 {
29365 }
29366 }
29371 {
29372 sel_seq
29375 sel_seq
29378 }
29379 else
29380 sel_seq
29385 }
29387 finish_selector:
29391 /* Build a location of the form:
29392 @selector(func)
29393 ^~~~~~~~~~~~~~~
29394 with caret==start at the @ token, finishing at the close paren. */
29395 location_t combined_loc
29399 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29402 }
29404 /* Parse a list of identifiers.
29406 objc-identifier-list:
29407 identifier
29408 objc-identifier-list , identifier
29410 Returns a TREE_LIST of identifier nodes. */
29412 static tree
29414 {
29415 tree identifier;
29416 tree list;
29427 {
29434 identifier));
29436 }
29439 }
29441 /* Parse an Objective-C alias declaration.
29443 objc-alias-declaration:
29444 @compatibility_alias identifier identifier ;
29446 This function registers the alias mapping with the Objective-C front end.
29447 It returns nothing. */
29449 static void
29451 {
29459 }
29461 /* Parse an Objective-C class forward-declaration.
29463 objc-class-declaration:
29464 @class objc-identifier-list ;
29466 The function registers the forward declarations with the Objective-C
29467 front end. It returns nothing. */
29469 static void
29471 {
29474 {
29475 tree id;
29485 else
29487 }
29489 }
29491 /* Parse a list of Objective-C protocol references.
29493 objc-protocol-refs-opt:
29494 objc-protocol-refs [opt]
29496 objc-protocol-refs:
29497 < objc-identifier-list >
29499 Returns a TREE_LIST of identifiers, if any. */
29501 static tree
29503 {
29507 {
29511 }
29514 }
29516 /* Parse a Objective-C visibility specification. */
29518 static void
29520 {
29524 {
29539 }
29541 /* Eat '@private'/'@protected'/'@public'. */
29543 }
29545 /* Parse an Objective-C method type. Return 'true' if it is a class
29546 (+) method, and 'false' if it is an instance (-) method. */
29550 {
29553 else
29555 }
29557 /* Parse an Objective-C protocol qualifier. */
29559 static tree
29561 {
29574 {
29579 }
29582 }
29584 /* Parse an Objective-C typename. */
29586 static tree
29588 {
29592 {
29595 matching_parens parens;
29599 /* An ObjC type name may consist of just protocol qualifiers, in which
29600 case the type shall default to 'id'. */
29602 {
29605 /* If the type could not be parsed, an error has already
29606 been produced. For error recovery, behave as if it had
29607 not been specified, which will use the default type
29608 'id'. */
29610 {
29612 /* We need to skip to the closing parenthesis as
29613 cp_parser_type_id() does not seem to do it for
29614 us. */
29619 }
29620 }
29624 }
29627 }
29629 /* Check to see if TYPE refers to an Objective-C selector name. */
29631 static bool
29633 {
29639 }
29641 /* Parse an Objective-C selector. */
29643 static tree
29645 {
29649 {
29652 }
29654 /* C++ operator names are allowed to appear in ObjC selectors. */
29656 {
29669 }
29670 }
29672 /* Parse an Objective-C params list. */
29674 static tree
29676 {
29682 {
29692 /* Detect if we have a unary selector. */
29695 {
29698 }
29702 {
29703 /* Something went quite wrong. There should be a colon
29704 here, but there is not. Stop parsing parameters. */
29706 }
29708 /* New ObjC allows attributes on parameters too. */
29713 params
29716 type_name,
29717 identifier,
29718 parm_attr));
29721 }
29724 {
29727 }
29729 /* We allow tail attributes for the method. */
29731 {
29739 }
29742 {
29745 }
29747 }
29749 /* Parse the non-keyword Objective-C params. */
29751 static tree
29754 {
29760 {
29762 tree parm;
29768 {
29773 }
29775 /* TODO: parse attributes for tail parameters. */
29784 }
29786 /* We allow tail attributes for the method. */
29788 {
29790 {
29795 }
29796 else
29797 /* We have an error, but parse the attributes, so that we can
29798 carry on. */
29804 }
29807 }
29809 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29811 static void
29813 {
29816 /* If the next token is `extern' and the following token is a string
29817 literal, then we have a linkage specification. */
29819 && cp_parser_is_pure_string_literal
29822 /* Handle #pragma, if any. */
29825 /* Allow stray semicolons. */
29828 /* Mark methods as optional or required, when building protocols. */
29830 {
29833 }
29835 {
29838 }
29841 /* Other stray characters must generate errors. */
29843 {
29847 }
29848 /* Finally, try to parse a block-declaration, or a function-definition. */
29849 else
29851 }
29853 /* Parse a method signature. */
29855 static tree
29857 {
29873 }
29875 static bool
29877 {
29878 tree tattr;
29883 /* If the attributes are followed by a method introducer, this is not allowed.
29884 Dump the attributes and flag the situation. */
29889 /* Otherwise, the attributes introduce some interstitial code, possibly so
29890 rewind to allow that check. */
29893 }
29895 /* Parse an Objective-C method prototype list. */
29897 static void
29899 {
29903 {
29905 {
29910 else
29914 {
29918 }
29921 }
29927 OPT_Wattributes,
29929 else
29930 /* Allow for interspersed non-ObjC++ code. */
29934 }
29938 else
29942 }
29944 /* Parse an Objective-C method definition list. */
29946 static void
29948 {
29952 {
29953 tree meth;
29956 {
29962 else
29967 {
29971 }
29973 NULL_TREE);
29975 /* For historical reasons, we accept an optional semicolon. */
29982 {
29989 }
29990 }
29991 /* The following case will be removed once @synthesize is
29992 completely implemented. */
30003 else
30004 /* Allow for interspersed non-ObjC++ code. */
30008 }
30012 else
30016 }
30018 /* Parse Objective-C ivars. */
30020 static void
30022 {
30033 {
30034 cp_decl_specifier_seq declspecs;
30036 tree prefix_attributes;
30044 CP_PARSER_FLAGS_OPTIONAL,
30048 /* auto, register, static, extern, mutable. */
30050 {
30053 }
30055 /* thread_local. */
30057 {
30060 }
30062 /* typedef. */
30064 {
30067 }
30072 /* Keep going until we hit the `;' at the end of the
30073 declaration. */
30075 {
30080 /* Check for a (possibly unnamed) bitfield declaration. */
30088 {
30089 /* Get the name of the bitfield. */
30092 sfk_none);
30094 eat_colon:
30096 /* Get the width of the bitfield. */
30097 width
30099 }
30100 else
30101 {
30102 /* Parse the declarator. */
30103 declarator
30109 }
30111 /* Look for attributes that apply to the ivar. */
30113 /* Remember which attributes are prefix attributes and
30114 which are not. */
30116 /* Combine the attributes. */
30120 /* Create the bitfield declaration. */
30123 else
30128 /* Add the instance variable. */
30132 /* Reset PREFIX_ATTRIBUTES. */
30141 {
30144 }
30146 }
30150 }
30155 /* Do not consume the RID_AT_END, so it will be read again as terminating
30156 the @interface of @implementation. */
30160 /* For historical reasons, we accept an optional semicolon. */
30163 }
30165 /* Parse an Objective-C protocol declaration. */
30167 static void
30169 {
30175 {
30180 }
30182 /* See if we have a forward declaration or a definition. */
30185 /* Try a forward declaration first. */
30187 {
30189 {
30190 tree id;
30200 else
30202 }
30204 }
30206 /* Ok, we got a full-fledged definition (or at least should). */
30207 else
30208 {
30213 }
30214 }
30216 /* Parse an Objective-C superclass or category. */
30218 static void
30223 {
30229 {
30232 }
30234 {
30235 matching_parens parens;
30238 /* If there is no category name, and this is an @interface, we
30239 have a class extension. */
30241 {
30244 }
30245 else
30249 }
30250 }
30252 /* Parse an Objective-C class interface. */
30254 static void
30256 {
30263 {
30264 /* It's hard to recover because even if valid @interface stuff
30265 is to follow, we can't compile it (or validate it) if we
30266 don't even know which class it refers to. Let's assume this
30267 was a stray '@interface' token in the stream and skip it.
30268 */
30270 }
30275 /* We have either a class or a category on our hands. */
30278 else
30279 {
30281 /* Handle instance variable declarations, if any. */
30284 }
30287 }
30289 /* Parse an Objective-C class implementation. */
30291 static void
30293 {
30300 {
30301 /* It's hard to recover because even if valid @implementation
30302 stuff is to follow, we can't compile it (or validate it) if
30303 we don't even know which class it refers to. Let's assume
30304 this was a stray '@implementation' token in the stream and
30305 skip it.
30306 */
30308 }
30312 /* We have either a class or a category on our hands. */
30315 else
30316 {
30318 /* Handle instance variable declarations, if any. */
30321 }
30324 }
30326 /* Consume the @end token and finish off the implementation. */
30328 static void
30330 {
30333 }
30335 /* Parse an Objective-C declaration. */
30337 static void
30339 {
30340 /* Try to figure out what kind of declaration is present. */
30345 {
30361 }
30364 {
30387 }
30388 }
30390 /* Parse an Objective-C try-catch-finally statement.
30392 objc-try-catch-finally-stmt:
30393 @try compound-statement objc-catch-clause-seq [opt]
30394 objc-finally-clause [opt]
30396 objc-catch-clause-seq:
30397 objc-catch-clause objc-catch-clause-seq [opt]
30399 objc-catch-clause:
30400 @catch ( objc-exception-declaration ) compound-statement
30402 objc-finally-clause:
30403 @finally compound-statement
30405 objc-exception-declaration:
30406 parameter-declaration
30407 '...'
30409 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30411 Returns NULL_TREE.
30413 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30414 for C. Keep them in sync. */
30416 static tree
30418 {
30419 location_t location;
30420 tree stmt;
30425 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30426 node, lest it get absorbed into the surrounding block. */
30432 {
30436 matching_parens parens;
30442 {
30443 /* We have "@catch (...)" (where the '...' are literally
30444 what is in the code). Skip the '...'.
30445 parameter_declaration is set to NULL_TREE, and
30446 objc_being_catch_clauses() knows that that means
30447 '...'. */
30450 }
30451 else
30452 {
30453 /* We have "@catch (NSException *exception)" or something
30454 like that. Parse the parameter declaration. */
30458 else
30463 }
30466 else
30467 {
30468 /* If there was no open parenthesis, we are recovering from
30469 an error, and we are trying to figure out what mistake
30470 the user has made. */
30472 /* If there is an immediate closing parenthesis, the user
30473 probably forgot the opening one (ie, they typed "@catch
30474 NSException *e)". Parse the closing parenthesis and keep
30475 going. */
30479 /* If these is no immediate closing parenthesis, the user
30480 probably doesn't know that parenthesis are required at
30481 all (ie, they typed "@catch NSException *e"). So, just
30482 forget about the closing parenthesis and keep going. */
30483 }
30487 }
30489 {
30492 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30493 node, lest it get absorbed into the surrounding block. */
30497 }
30500 }
30502 /* Parse an Objective-C synchronized statement.
30504 objc-synchronized-stmt:
30505 @synchronized ( expression ) compound-statement
30507 Returns NULL_TREE. */
30509 static tree
30511 {
30512 location_t location;
30519 matching_parens parens;
30524 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30525 node, lest it get absorbed into the surrounding block. */
30530 }
30532 /* Parse an Objective-C throw statement.
30534 objc-throw-stmt:
30535 @throw assignment-expression [opt] ;
30537 Returns a constructed '@throw' statement. */
30539 static tree
30541 {
30553 }
30555 /* Parse an Objective-C statement. */
30557 static tree
30559 {
30560 /* Try to figure out what kind of declaration is present. */
30564 {
30575 }
30578 }
30580 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30581 look ahead to see if an objc keyword follows the attributes. This
30582 is to detect the use of prefix attributes on ObjC @interface and
30583 @protocol. */
30585 static bool
30587 {
30592 {
30595 }
30598 }
30600 /* This routine is a minimal replacement for
30601 c_parser_struct_declaration () used when parsing the list of
30602 types/names or ObjC++ properties. For example, when parsing the
30603 code
30605 @property (readonly) int a, b, c;
30607 this function is responsible for parsing "int a, int b, int c" and
30608 returning the declarations as CHAIN of DECLs.
30610 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30611 similar parsing. */
30612 static tree
30614 {
30616 cp_decl_specifier_seq declspecs;
30618 tree prefix_attributes;
30621 CP_PARSER_FLAGS_NONE,
30628 /* auto, register, static, extern, mutable. */
30630 {
30633 }
30635 /* thread_local. */
30637 {
30640 }
30642 /* typedef. */
30644 {
30647 }
30652 /* Keep going until we hit the `;' at the end of the declaration. */
30654 {
30659 /* Parse the declarator. */
30663 /* Look for attributes that apply to the ivar. */
30665 /* Remember which attributes are prefix attributes and
30666 which are not. */
30668 /* Combine the attributes. */
30678 /* Reset PREFIX_ATTRIBUTES. */
30689 {
30692 }
30693 else
30695 }
30697 }
30699 /* Parse an Objective-C @property declaration. The syntax is:
30701 objc-property-declaration:
30702 '@property' objc-property-attributes[opt] struct-declaration ;
30704 objc-property-attributes:
30705 '(' objc-property-attribute-list ')'
30707 objc-property-attribute-list:
30708 objc-property-attribute
30709 objc-property-attribute-list, objc-property-attribute
30711 objc-property-attribute
30712 'getter' = identifier
30713 'setter' = identifier
30714 'readonly'
30715 'readwrite'
30716 'assign'
30717 'retain'
30718 'copy'
30719 'nonatomic'
30721 For example:
30722 @property NSString *name;
30723 @property (readonly) id object;
30724 @property (retain, nonatomic, getter=getTheName) id name;
30725 @property int a, b, c;
30727 PS: This function is identical to
30728 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30729 static void
30731 {
30732 /* The following variables hold the attributes of the properties as
30733 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30734 seen. When we see an attribute, we set them to 'true' (if they
30735 are boolean properties) or to the identifier (if they have an
30736 argument, ie, for getter and setter). Note that here we only
30737 parse the list of attributes, check the syntax and accumulate the
30738 attributes that we find. objc_add_property_declaration() will
30739 then process the information. */
30749 /* 'properties' is the list of properties that we read. Usually a
30750 single one, but maybe more (eg, in "@property int a, b, c;" there
30751 are three). */
30752 tree properties;
30753 location_t loc;
30759 /* Parse the optional attribute list... */
30761 {
30762 /* Eat the '('. */
30763 matching_parens parens;
30767 {
30773 {
30776 }
30780 {
30791 {
30795 else
30800 }
30803 {
30807 }
30809 {
30811 {
30814 }
30815 else
30819 else
30821 }
30822 else
30823 {
30825 {
30828 }
30829 else
30831 }
30837 }
30844 else
30846 }
30848 /* FIXME: "@property (setter, assign);" will generate a spurious
30849 "error: expected ‘)’ before ‘,’ token". This is because
30850 cp_parser_require, unlike the C counterpart, will produce an
30851 error even if we are in error recovery. */
30853 {
30858 }
30859 }
30861 /* ... and the property declaration(s). */
30865 {
30867 /* If the next token is now a `;', consume it. */
30871 }
30875 else
30876 {
30877 /* Comma-separated properties are chained together in
30878 reverse order; add them one by one. */
30887 }
30890 }
30892 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30894 objc-synthesize-declaration:
30895 @synthesize objc-synthesize-identifier-list ;
30897 objc-synthesize-identifier-list:
30898 objc-synthesize-identifier
30899 objc-synthesize-identifier-list, objc-synthesize-identifier
30901 objc-synthesize-identifier
30902 identifier
30903 identifier = identifier
30905 For example:
30906 @synthesize MyProperty;
30907 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30909 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30910 for C. Keep them in sync.
30911 */
30912 static void
30914 {
30916 location_t loc;
30921 {
30925 {
30928 }
30930 {
30934 {
30937 }
30938 }
30939 else
30944 else
30946 }
30949 }
30951 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30953 objc-dynamic-declaration:
30954 @dynamic identifier-list ;
30956 For example:
30957 @dynamic MyProperty;
30958 @dynamic MyProperty, AnotherProperty;
30960 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30961 for C. Keep them in sync.
30962 */
30963 static void
30965 {
30967 location_t loc;
30972 {
30973 tree property;
30976 {
30979 }
30983 else
30985 }
30988 }
30990 \f
30991 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30993 /* Returns name of the next clause.
30994 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30995 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30996 returned and the token is consumed. */
30998 static pragma_omp_clause
31000 {
31016 {
31021 {
31198 }
31199 }
31205 }
31207 /* Validate that a clause of the given type does not already exist. */
31209 static void
31212 {
31213 tree c;
31217 {
31220 }
31221 }
31223 /* OpenMP 2.5:
31224 variable-list:
31225 identifier
31226 variable-list , identifier
31228 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31229 colon). An opening parenthesis will have been consumed by the caller.
31231 If KIND is nonzero, create the appropriate node and install the decl
31232 in OMP_CLAUSE_DECL and add the node to the head of the list.
31234 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31235 return the list created.
31237 COLON can be NULL if only closing parenthesis should end the list,
31238 or pointer to bool which will receive false if the list is terminated
31239 by closing parenthesis or true if the list is terminated by colon. */
31241 static tree
31244 {
31248 {
31251 }
31253 {
31258 && current_class_ptr
31260 {
31266 }
31267 else
31268 {
31281 }
31283 ;
31285 {
31287 {
31289 /* The OpenACC cache directive explicitly only allows "array
31290 elements or subarrays". */
31292 {
31296 }
31297 /* FALLTHROUGH. */
31302 {
31303 location_t loc
31308 decl
31312 }
31313 /* FALLTHROUGH. */
31317 {
31325 parser->colon_corrects_to_scope_p
31329 else
31330 {
31331 /* Look for `:'. */
31335 CPP_CLOSE_SQUARE))
31337 }
31338 /* Look for the closing `]'. */
31340 RT_CLOSE_SQUARE))
31344 }
31348 }
31354 }
31355 else
31358 get_comma:
31362 }
31368 {
31372 }
31375 {
31378 /* Try to resync to an unnested comma. Copied from
31379 cp_parser_parenthesized_expression_list. */
31380 skip_comma:
31389 }
31392 }
31394 /* Similarly, but expect leading and trailing parenthesis. This is a very
31395 common case for omp clauses. */
31397 static tree
31399 {
31403 }
31405 /* OpenACC 2.0:
31406 copy ( variable-list )
31407 copyin ( variable-list )
31408 copyout ( variable-list )
31409 create ( variable-list )
31410 delete ( variable-list )
31411 present ( variable-list )
31412 present_or_copy ( variable-list )
31413 pcopy ( variable-list )
31414 present_or_copyin ( variable-list )
31415 pcopyin ( variable-list )
31416 present_or_copyout ( variable-list )
31417 pcopyout ( variable-list )
31418 present_or_create ( variable-list )
31419 pcreate ( variable-list ) */
31421 static tree
31423 tree list)
31424 {
31427 {
31473 }
31481 }
31483 /* OpenACC 2.0:
31484 deviceptr ( variable-list ) */
31486 static tree
31488 {
31492 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31493 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31494 variable-list must only allow for pointer variables. */
31497 {
31504 }
31507 }
31509 /* OpenACC 2.0:
31510 auto
31511 independent
31512 nohost
31513 seq */
31515 static tree
31519 {
31524 }
31526 /* OpenACC:
31527 num_gangs ( expression )
31528 num_workers ( expression )
31529 vector_length ( expression ) */
31531 static tree
31534 {
31537 matching_parens parens;
31545 {
31550 }
31558 }
31560 /* OpenACC:
31562 gang [( gang-arg-list )]
31563 worker [( [num:] int-expr )]
31564 vector [( [length:] int-expr )]
31566 where gang-arg is one of:
31568 [num:] int-expr
31569 static: size-expr
31571 and size-expr may be:
31573 *
31574 int-expr
31575 */
31577 static tree
31580 {
31590 {
31591 matching_parens parens;
31594 do
31595 {
31599 /* Gang static argument. */
31602 {
31610 {
31613 }
31615 /* Check for the '*' argument. */
31619 CPP_CLOSE_PAREN)))
31620 {
31625 {
31628 }
31630 }
31631 }
31632 /* Worker num: argument and vector length: arguments. */
31636 {
31639 }
31641 /* Now collect the actual argument. */
31643 {
31646 }
31658 {
31661 }
31663 }
31668 }
31682 cleanup_error:
31685 }
31687 /* OpenACC 2.0:
31688 tile ( size-expr-list ) */
31690 static tree
31692 {
31696 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31697 so, but the spec authors never considered such a case and have
31698 differing opinions on what it might mean, including 'not
31699 allowed'.) */
31702 clause_loc);
31707 do
31708 {
31715 {
31718 }
31719 else
31723 }
31726 /* Consume the trailing ')'. */
31734 }
31736 /* OpenACC 2.0
31737 Parse wait clause or directive parameters. */
31739 static tree
31741 {
31751 {
31756 }
31763 {
31767 {
31770 else
31771 {
31778 }
31779 }
31780 }
31783 }
31785 /* OpenACC:
31786 wait ( int-expr-list ) */
31788 static tree
31790 {
31799 }
31801 /* OpenMP 3.0:
31802 collapse ( constant-expression ) */
31804 static tree
31806 {
31808 location_t loc;
31809 HOST_WIDE_INT n;
31812 matching_parens parens;
31830 {
31833 }
31842 }
31844 /* OpenMP 2.5:
31845 default ( none | shared )
31847 OpenACC:
31848 default ( none | present ) */
31850 static tree
31853 {
31855 tree c;
31857 matching_parens parens;
31861 {
31866 {
31887 }
31890 }
31891 else
31892 {
31893 invalid_kind:
31896 else
31898 }
31915 }
31917 /* OpenMP 3.1:
31918 final ( expression ) */
31920 static tree
31922 {
31925 matching_parens parens;
31944 }
31946 /* OpenMP 2.5:
31947 if ( expression )
31949 OpenMP 4.5:
31950 if ( directive-name-modifier : expression )
31952 directive-name-modifier:
31953 parallel | task | taskloop | target data | target | target update
31954 | target enter data | target exit data */
31956 static tree
31959 {
31963 matching_parens parens;
31968 {
31980 {
31983 {
31996 else
31997 {
31998 location_t loc
32003 }
32006 {
32008 {
32013 }
32015 {
32016 location_t loc
32020 }
32021 }
32022 }
32023 }
32025 {
32027 {
32030 }
32031 else
32032 {
32034 {
32035 location_t loc
32038 }
32040 }
32041 }
32042 }
32054 {
32057 {
32060 {
32070 }
32072 p);
32074 }
32076 {
32079 else
32082 }
32085 {
32089 }
32090 }
32098 }
32100 /* OpenMP 3.1:
32101 mergeable */
32103 static tree
32106 {
32107 tree c;
32110 location);
32115 }
32117 /* OpenMP 2.5:
32118 nowait */
32120 static tree
32123 {
32124 tree c;
32131 }
32133 /* OpenMP 2.5:
32134 num_threads ( expression ) */
32136 static tree
32138 location_t location)
32139 {
32142 matching_parens parens;
32162 }
32164 /* OpenMP 4.5:
32165 num_tasks ( expression ) */
32167 static tree
32169 location_t location)
32170 {
32173 matching_parens parens;
32193 }
32195 /* OpenMP 4.5:
32196 grainsize ( expression ) */
32198 static tree
32200 location_t location)
32201 {
32204 matching_parens parens;
32224 }
32226 /* OpenMP 4.5:
32227 priority ( expression ) */
32229 static tree
32231 location_t location)
32232 {
32235 matching_parens parens;
32255 }
32257 /* OpenMP 4.5:
32258 hint ( expression ) */
32260 static tree
32262 location_t location)
32263 {
32266 matching_parens parens;
32285 }
32287 /* OpenMP 4.5:
32288 defaultmap ( tofrom : scalar ) */
32290 static tree
32292 location_t location)
32293 {
32297 matching_parens parens;
32302 {
32305 }
32309 {
32312 }
32318 {
32321 }
32325 {
32328 }
32334 location);
32340 out_err:
32345 }
32347 /* OpenMP 2.5:
32348 ordered
32350 OpenMP 4.5:
32351 ordered ( constant-expression ) */
32353 static tree
32356 {
32358 HOST_WIDE_INT n;
32364 {
32365 matching_parens parens;
32382 {
32384 "ordered argument needs positive constant integer "
32387 }
32388 }
32394 }
32396 /* OpenMP 2.5:
32397 reduction ( reduction-operator : variable-list )
32399 reduction-operator:
32400 One of: + * - & ^ | && ||
32402 OpenMP 3.1:
32404 reduction-operator:
32405 One of: + * - & ^ | && || min max
32407 OpenMP 4.0:
32409 reduction-operator:
32410 One of: + * - & ^ | && ||
32411 id-expression */
32413 static tree
32415 {
32423 {
32433 }
32437 else
32438 {
32449 {
32479 }
32480 else
32481 {
32483 resync_fail:
32488 }
32489 }
32495 NULL);
32497 {
32500 }
32503 }
32505 /* OpenMP 2.5:
32506 schedule ( schedule-kind )
32507 schedule ( schedule-kind , expression )
32509 schedule-kind:
32510 static | dynamic | guided | runtime | auto
32512 OpenMP 4.5:
32513 schedule ( schedule-modifier : schedule-kind )
32514 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32516 schedule-modifier:
32517 simd
32518 monotonic
32519 nonmonotonic */
32521 static tree
32523 {
32527 matching_parens parens;
32534 {
32543 else
32549 else
32550 {
32553 }
32554 }
32557 {
32562 {
32583 }
32584 }
32589 else
32595 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32597 {
32601 }
32604 {
32619 else
32624 }
32636 invalid_kind:
32638 resync_fail:
32643 }
32645 /* OpenMP 3.0:
32646 untied */
32648 static tree
32651 {
32652 tree c;
32659 }
32661 /* OpenMP 4.0:
32662 inbranch
32663 notinbranch */
32665 static tree
32668 {
32673 }
32675 /* OpenMP 4.0:
32676 parallel
32677 for
32678 sections
32679 taskgroup */
32681 static tree
32685 {
32689 }
32691 /* OpenMP 4.5:
32692 nogroup */
32694 static tree
32697 {
32702 }
32704 /* OpenMP 4.5:
32705 simd
32706 threads */
32708 static tree
32712 {
32717 }
32719 /* OpenMP 4.0:
32720 num_teams ( expression ) */
32722 static tree
32724 location_t location)
32725 {
32728 matching_parens parens;
32748 }
32750 /* OpenMP 4.0:
32751 thread_limit ( expression ) */
32753 static tree
32755 location_t location)
32756 {
32759 matching_parens parens;
32779 }
32781 /* OpenMP 4.0:
32782 aligned ( variable-list )
32783 aligned ( variable-list : constant-expression ) */
32785 static tree
32787 {
32791 matching_parens parens;
32799 {
32809 }
32815 }
32817 /* OpenMP 4.0:
32818 linear ( variable-list )
32819 linear ( variable-list : expression )
32821 OpenMP 4.5:
32822 linear ( modifier ( variable-list ) )
32823 linear ( modifier ( variable-list ) : expression ) */
32825 static tree
32828 {
32833 matching_parens parens;
32838 {
32850 else
32852 }
32857 else
32858 {
32867 }
32870 {
32875 {
32886 {
32889 }
32892 }
32903 }
32906 {
32909 }
32912 }
32914 /* OpenMP 4.0:
32915 safelen ( constant-expression ) */
32917 static tree
32919 location_t location)
32920 {
32923 matching_parens parens;
32942 }
32944 /* OpenMP 4.0:
32945 simdlen ( constant-expression ) */
32947 static tree
32949 location_t location)
32950 {
32953 matching_parens parens;
32972 }
32974 /* OpenMP 4.5:
32975 vec:
32976 identifier [+/- integer]
32977 vec , identifier [+/- integer]
32978 */
32980 static tree
32982 tree list)
32983 {
32987 {
32990 }
32993 {
33000 else
33001 {
33002 t = cp_parser_lookup_name_simple
33007 id_loc);
33008 }
33014 {
33017 }
33021 {
33024 }
33028 {
33031 }
33034 add_to_vector:
33036 {
33040 }
33046 }
33049 {
33055 }
33057 }
33059 /* OpenMP 4.0:
33060 depend ( depend-kind : variable-list )
33062 depend-kind:
33063 in | out | inout
33065 OpenMP 4.5:
33066 depend ( source )
33068 depend ( sink : vec ) */
33070 static tree
33072 {
33076 matching_parens parens;
33081 {
33095 else
33097 }
33098 else
33104 {
33114 }
33121 else
33122 {
33128 }
33131 invalid_kind:
33133 resync_fail:
33138 }
33140 /* OpenMP 4.0:
33141 map ( map-kind : variable-list )
33142 map ( variable-list )
33144 map-kind:
33145 alloc | to | from | tofrom
33147 OpenMP 4.5:
33148 map-kind:
33149 alloc | to | from | tofrom | release | delete
33151 map ( always [,] map-kind: variable-list ) */
33153 static tree
33155 {
33164 {
33169 {
33172 nth++;
33178 {
33183 }
33184 }
33185 }
33189 {
33203 else
33204 {
33210 }
33213 }
33216 {
33220 }
33223 NULL);
33229 }
33231 /* OpenMP 4.0:
33232 device ( expression ) */
33234 static tree
33236 location_t location)
33237 {
33240 matching_parens parens;
33260 }
33262 /* OpenMP 4.0:
33263 dist_schedule ( static )
33264 dist_schedule ( static , expression ) */
33266 static tree
33268 location_t location)
33269 {
33272 matching_parens parens;
33283 {
33294 }
33299 location);
33303 invalid_kind:
33305 resync_fail:
33310 }
33312 /* OpenMP 4.0:
33313 proc_bind ( proc-bind-kind )
33315 proc-bind-kind:
33316 master | close | spread */
33318 static tree
33320 location_t location)
33321 {
33322 tree c;
33329 {
33339 else
33341 }
33342 else
33351 location);
33356 invalid_kind:
33358 resync_fail:
33363 }
33365 /* OpenACC:
33366 async [( int-expr )] */
33368 static tree
33370 {
33377 {
33378 matching_parens parens;
33387 }
33397 }
33399 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33400 is a bitmask in MASK. Return the list of clauses found. */
33402 static tree
33406 {
33411 {
33412 location_t here;
33413 pragma_omp_clause c_kind;
33414 omp_clause_code code;
33425 {
33477 clauses);
33495 OMP_CLAUSE_INDEPENDENT,
33507 clauses);
33513 clauses);
33537 clauses);
33559 clauses);
33571 clauses);
33585 }
33590 {
33591 /* Remove the invalid clause(s) from the list to avoid
33592 confusing the rest of the compiler. */
33595 }
33596 }
33598 saw_error:
33605 }
33607 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33608 is a bitmask in MASK. Return the list of clauses found; the result
33609 of clause default goes in *pdefault. */
33611 static tree
33615 {
33621 {
33622 pragma_omp_clause c_kind;
33633 {
33645 clauses);
33659 clauses);
33679 clauses);
33684 clauses);
33694 clauses);
33728 clauses);
33742 clauses);
33757 OMP_CLAUSE_NOTINBRANCH,
33766 {
33767 clause_not_first:
33771 }
33801 clauses);
33802 else
33812 clauses);
33830 {
33835 }
33878 clauses
33884 clauses
33892 }
33897 {
33898 /* Remove the invalid clause(s) from the list to avoid
33899 confusing the rest of the compiler. */
33902 }
33903 }
33904 saw_error:
33907 {
33910 else
33912 }
33914 }
33916 /* OpenMP 2.5:
33917 structured-block:
33918 statement
33920 In practice, we're also interested in adding the statement to an
33921 outer node. So it is convenient if we work around the fact that
33922 cp_parser_statement calls add_stmt. */
33924 static unsigned
33926 {
33929 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33930 This preserves the "not within loop or switch" style error messages
33931 for nonsense cases like
33932 void foo() {
33933 #pragma omp single
33934 break;
33935 }
33936 */
33941 }
33943 static void
33945 {
33947 }
33949 static tree
33951 {
33959 }
33961 /* OpenMP 2.5:
33962 # pragma omp atomic new-line
33963 expression-stmt
33965 expression-stmt:
33966 x binop= expr | x++ | ++x | x-- | --x
33967 binop:
33968 +, *, -, /, &, ^, |, <<, >>
33970 where x is an lvalue expression with scalar type.
33972 OpenMP 3.1:
33973 # pragma omp atomic new-line
33974 update-stmt
33976 # pragma omp atomic read new-line
33977 read-stmt
33979 # pragma omp atomic write new-line
33980 write-stmt
33982 # pragma omp atomic update new-line
33983 update-stmt
33985 # pragma omp atomic capture new-line
33986 capture-stmt
33988 # pragma omp atomic capture new-line
33989 capture-block
33991 read-stmt:
33992 v = x
33993 write-stmt:
33994 x = expr
33995 update-stmt:
33996 expression-stmt | x = x binop expr
33997 capture-stmt:
33998 v = expression-stmt
33999 capture-block:
34000 { v = x; update-stmt; } | { update-stmt; v = x; }
34002 OpenMP 4.0:
34003 update-stmt:
34004 expression-stmt | x = x binop expr | x = expr binop x
34005 capture-stmt:
34006 v = update-stmt
34007 capture-block:
34008 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34010 where x and v are lvalue expressions with scalar type. */
34012 static void
34014 {
34022 {
34027 {
34033 }
34034 }
34036 {
34048 else
34052 }
34054 {
34060 {
34065 {
34068 }
34069 }
34070 }
34074 {
34084 else
34089 {
34090 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34091 opcode. */
34096 }
34100 {
34103 }
34104 else
34105 {
34111 }
34114 }
34116 restart:
34120 {
34127 /* FALLTHROUGH */
34137 /* FALLTHROUGH */
34152 /* Undo effects of boolean_increment for post {in,de}crement. */
34154 /* FALLTHRU */
34158 {
34159 /* Undo effects of boolean_increment. */
34161 {
34162 /* This is pre or post increment. */
34167 && !structured_block
34171 }
34172 }
34173 /* FALLTHRU */
34176 {
34211 {
34215 }
34218 {
34224 {
34229 }
34231 {
34243 {
34245 {
34250 }
34251 else
34253 }
34257 }
34260 {
34267 }
34271 }
34275 {
34278 {
34286 }
34288 {
34293 }
34328 }
34339 /* FALLTHROUGH */
34344 }
34351 }
34352 stmt_done:
34354 {
34365 }
34367 {
34370 }
34371 done:
34377 saw_error:
34380 {
34384 {
34388 }
34389 }
34390 }
34393 /* OpenMP 2.5:
34394 # pragma omp barrier new-line */
34396 static void
34398 {
34401 }
34403 /* OpenMP 2.5:
34404 # pragma omp critical [(name)] new-line
34405 structured-block
34407 OpenMP 4.5:
34408 # pragma omp critical [(name) [hint(expression)]] new-line
34409 structured-block */
34411 #define OMP_CRITICAL_CLAUSE_MASK \
34412 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34414 static tree
34416 {
34420 {
34421 matching_parens parens;
34435 OMP_CRITICAL_CLAUSE_MASK,
34437 }
34438 else
34443 }
34445 /* OpenMP 2.5:
34446 # pragma omp flush flush-vars[opt] new-line
34448 flush-vars:
34449 ( variable-list ) */
34451 static void
34453 {
34459 }
34461 /* Helper function, to parse omp for increment expression. */
34463 static tree
34465 {
34470 {
34473 }
34476 {
34483 /* Fall through: OpenMP disallows NE_EXPR. */
34487 }
34489 /* If decl is an iterator, preserve LHS and RHS of the relational
34490 expr until finish_omp_for. */
34501 }
34503 /* Helper function, to parse omp for increment expression. */
34505 static tree
34507 {
34511 cp_id_kind idk;
34515 {
34524 }
34533 {
34538 }
34545 {
34549 }
34562 do
34563 {
34570 {
34572 {
34575 else
34577 tf_warning_or_error);
34578 }
34579 else
34582 }
34583 }
34587 {
34593 }
34594 else
34598 }
34600 /* Parse the initialization statement of an OpenMP for loop.
34602 Return true if the resulting construct should have an
34603 OMP_CLAUSE_PRIVATE added to it. */
34605 static tree
34613 {
34619 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34621 init-expr:
34622 var = lb
34623 integer-type var = lb
34624 random-access-iterator-type var = lb
34625 pointer-type var = lb
34626 */
34627 cp_decl_specifier_seq type_specifiers;
34629 /* First, try to parse as an initialized declaration. See
34630 cp_parser_condition, from whence the bulk of this is copied. */
34637 {
34638 /* If parsing a type specifier seq succeeded, then this
34639 MUST be a initialized declaration. */
34644 CP_PARSER_DECLARATOR_NAMED,
34655 else
34656 {
34666 {
34668 CPP_OPEN_PAREN))
34671 else
34672 /* Trigger an error. */
34677 }
34681 {
34689 {
34692 auto_node);
34697 }
34700 asm_specification,
34701 LOOKUP_ONLYCONVERTING);
34704 {
34707 }
34708 else
34709 {
34712 {
34714 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34716 {
34720 {
34724 }
34726 }
34728 {
34733 }
34734 }
34735 }
34737 }
34738 else
34739 {
34740 /* Consume '='. */
34744 non_class:
34747 else
34750 asm_specification,
34751 LOOKUP_ONLYCONVERTING);
34752 }
34756 }
34757 }
34758 else
34759 {
34760 cp_id_kind idk;
34761 /* If parsing a type specifier sequence failed, then
34762 this MUST be a simple expression. */
34768 && decl
34771 {
34782 {
34787 }
34792 }
34794 && decl
34797 {
34798 tree rhs;
34806 rhs,
34807 tf_warning_or_error));
34810 }
34811 else
34812 {
34817 {
34821 }
34822 }
34823 }
34825 }
34827 /* Parse the restricted form of the for statement allowed by OpenMP. */
34829 static tree
34832 {
34836 location_t loc_first;
34847 {
34850 }
34853 {
34856 }
34859 {
34865 }
34867 {
34870 {
34872 "%<linear%> clause may not be specified together "
34875 }
34876 else
34878 }
34891 {
34894 location_t loc;
34897 {
34901 }
34904 matching_parens parens;
34911 add_private_clause
34917 {
34920 {
34926 }
34927 else
34929 }
34936 {
34941 {
34945 }
34948 {
34949 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34953 {
34956 }
34957 else
34958 {
34961 }
34963 }
34964 else
34965 {
34970 }
34971 }
34974 {
34975 tree c;
34977 {
34986 decl);
34990 decl);
34991 }
34993 {
34998 else
35003 {
35006 /* For linear, signal that we need to fill up
35007 the so far unknown linear step. */
35010 }
35011 }
35012 }
35021 {
35022 /* If decl is an iterator, preserve the operator on decl
35023 until finish_omp_for. */
35025 && ((processing_template_decl
35030 else
35034 }
35046 {
35049 }
35054 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35055 in between the collapsed for loops to be still considered perfectly
35056 nested. Hopefully the final version clarifies this.
35057 For now handle (multiple) {'s and empty statements. */
35060 {
35064 {
35066 bracecount++;
35067 }
35071 else
35072 {
35079 }
35080 }
35083 {
35086 }
35087 }
35092 /* Note that we saved the original contents of this flag when we entered
35093 the structured block, and so we don't need to re-save it here. */
35096 /* Note that the grammar doesn't call for a structured block here,
35097 though the loop as a whole is a structured block. */
35104 else
35109 {
35111 {
35113 nbraces--;
35114 }
35117 else
35118 {
35120 {
35123 }
35128 }
35129 }
35132 {
35136 else
35138 }
35142 }
35144 /* Helper function for OpenMP parsing, split clauses and call
35145 finish_omp_clauses on each of the set of clauses afterwards. */
35147 static void
35150 {
35156 }
35158 /* OpenMP 4.0:
35159 #pragma omp simd simd-clause[optseq] new-line
35160 for-loop */
35162 #define OMP_SIMD_CLAUSE_MASK \
35163 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35172 static tree
35176 {
35187 {
35191 OMP_CLAUSE_ORDERED);
35193 {
35195 "%<ordered%> clause with parameter may not be specified "
35198 }
35199 }
35210 }
35212 /* OpenMP 2.5:
35213 #pragma omp for for-clause[optseq] new-line
35214 for-loop
35216 OpenMP 4.0:
35217 #pragma omp for simd for-simd-clause[optseq] new-line
35218 for-loop */
35220 #define OMP_FOR_CLAUSE_MASK \
35221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35231 static tree
35235 {
35242 /* parallel for{, simd} disallows nowait clause, but for
35243 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35246 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35251 {
35256 {
35280 }
35281 }
35283 {
35286 }
35288 /* Composite distribute parallel for disallows linear clause. */
35295 {
35298 }
35309 }
35311 /* OpenMP 2.5:
35312 # pragma omp master new-line
35313 structured-block */
35315 static tree
35317 {
35321 }
35323 /* OpenMP 2.5:
35324 # pragma omp ordered new-line
35325 structured-block
35327 OpenMP 4.5:
35328 # pragma omp ordered ordered-clauses new-line
35329 structured-block */
35331 #define OMP_ORDERED_CLAUSE_MASK \
35332 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35335 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35336 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35338 static bool
35341 {
35345 {
35350 {
35352 {
35355 }
35357 {
35359 "%<depend%> clause may only be used in compound "
35363 }
35364 tree clauses
35366 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35370 }
35371 }
35373 tree clauses
35384 }
35386 /* OpenMP 2.5:
35388 section-scope:
35389 { section-sequence }
35391 section-sequence:
35392 section-directive[opt] structured-block
35393 section-sequence section-directive structured-block */
35395 static tree
35397 {
35402 matching_braces braces;
35410 {
35414 }
35417 {
35425 {
35429 }
35431 {
35434 }
35439 }
35450 }
35452 /* OpenMP 2.5:
35453 # pragma omp sections sections-clause[optseq] newline
35454 sections-scope */
35456 #define OMP_SECTIONS_CLAUSE_MASK \
35457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35463 static tree
35466 {
35478 {
35481 }
35488 }
35490 /* OpenMP 2.5:
35491 # pragma omp parallel parallel-clause[optseq] new-line
35492 structured-block
35493 # pragma omp parallel for parallel-for-clause[optseq] new-line
35494 structured-block
35495 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35496 structured-block
35498 OpenMP 4.0:
35499 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35500 structured-block */
35502 #define OMP_PARALLEL_CLAUSE_MASK \
35503 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35513 static tree
35517 {
35524 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35530 {
35538 if_p);
35542 if_p);
35545 block);
35550 }
35551 /* When combined with distribute, parallel has to be followed by for.
35552 #pragma omp target parallel is allowed though. */
35556 {
35560 }
35562 {
35565 }
35567 {
35571 {
35581 block);
35584 }
35585 }
35590 {
35593 }
35601 }
35603 /* OpenMP 2.5:
35604 # pragma omp single single-clause[optseq] new-line
35605 structured-block */
35607 #define OMP_SINGLE_CLAUSE_MASK \
35608 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35613 static tree
35615 {
35625 }
35627 /* OpenMP 3.0:
35628 # pragma omp task task-clause[optseq] new-line
35629 structured-block */
35631 #define OMP_TASK_CLAUSE_MASK \
35632 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35643 static tree
35645 {
35656 }
35658 /* OpenMP 3.0:
35659 # pragma omp taskwait new-line */
35661 static void
35663 {
35666 }
35668 /* OpenMP 3.1:
35669 # pragma omp taskyield new-line */
35671 static void
35673 {
35676 }
35678 /* OpenMP 4.0:
35679 # pragma omp taskgroup new-line
35680 structured-block */
35682 static tree
35684 {
35688 if_p));
35689 }
35692 /* OpenMP 2.5:
35693 # pragma omp threadprivate (variable-list) */
35695 static void
35697 {
35698 tree vars;
35704 }
35706 /* OpenMP 4.0:
35707 # pragma omp cancel cancel-clause[optseq] new-line */
35709 #define OMP_CANCEL_CLAUSE_MASK \
35710 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35716 static void
35718 {
35722 }
35724 /* OpenMP 4.0:
35725 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35727 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35728 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35730 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35733 static void
35736 {
35737 tree clauses;
35741 {
35746 {
35749 }
35750 }
35752 {
35756 }
35759 {
35764 else
35768 }
35771 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35773 pragma_tok);
35775 }
35777 /* OpenMP 4.0:
35778 #pragma omp distribute distribute-clause[optseq] new-line
35779 for-loop */
35781 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35788 static tree
35792 {
35801 {
35809 else
35812 {
35818 {
35822 else
35825 }
35831 else
35845 }
35846 }
35848 {
35851 }
35856 {
35859 }
35870 }
35872 /* OpenMP 4.0:
35873 # pragma omp teams teams-clause[optseq] new-line
35874 structured-block */
35876 #define OMP_TEAMS_CLAUSE_MASK \
35877 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35885 static tree
35889 {
35898 {
35902 {
35927 }
35928 }
35930 {
35933 }
35938 {
35941 }
35950 }
35952 /* OpenMP 4.0:
35953 # pragma omp target data target-data-clause[optseq] new-line
35954 structured-block */
35956 #define OMP_TARGET_DATA_CLAUSE_MASK \
35957 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35962 static tree
35964 {
35965 tree clauses
35970 {
35973 {
35990 "%<#pragma omp target data%> with map-type other "
35991 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35995 }
35997 }
36000 {
36003 "%<#pragma omp target data%> must contain at least "
36006 }
36017 }
36019 /* OpenMP 4.5:
36020 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36021 structured-block */
36023 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36024 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36030 static tree
36033 {
36036 {
36041 {
36044 }
36045 }
36047 {
36051 }
36054 {
36060 }
36062 tree clauses
36067 {
36070 {
36083 "%<#pragma omp target enter data%> with map-type other "
36087 }
36089 }
36092 {
36095 "%<#pragma omp target enter data%> must contain at least "
36098 }
36105 }
36107 /* OpenMP 4.5:
36108 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36109 structured-block */
36111 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36112 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36118 static tree
36121 {
36124 {
36129 {
36132 }
36133 }
36135 {
36139 }
36142 {
36148 }
36150 tree clauses
36155 {
36158 {
36172 "%<#pragma omp target exit data%> with map-type other "
36173 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36177 }
36179 }
36182 {
36185 "%<#pragma omp target exit data%> must contain at least "
36188 }
36195 }
36197 /* OpenMP 4.0:
36198 # pragma omp target update target-update-clause[optseq] new-line */
36200 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36201 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36208 static bool
36211 {
36213 {
36219 }
36221 tree clauses
36226 {
36228 "%<#pragma omp target update%> must contain at least one "
36231 }
36239 }
36241 /* OpenMP 4.0:
36242 # pragma omp target target-clause[optseq] new-line
36243 structured-block */
36245 #define OMP_TARGET_CLAUSE_MASK \
36246 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36256 static bool
36259 {
36263 {
36275 {
36283 {
36284 tree stmt;
36286 {
36289 OMP_TARGET_CLAUSE_MASK,
36294 OMP_TARGET_CLAUSE_MASK,
36299 OMP_TARGET_CLAUSE_MASK,
36304 }
36306 }
36311 {
36315 if_p);
36320 if_p);
36325 if_p);
36329 }
36335 {
36336 /* For combined target teams, ensure the num_teams and
36337 thread_limit clause expressions are evaluated on the host,
36338 before entering the target construct. */
36339 tree c;
36345 {
36354 OMP_CLAUSE_FIRSTPRIVATE);
36359 }
36360 }
36370 }
36372 {
36375 }
36377 {
36381 }
36383 {
36387 }
36389 {
36393 }
36395 {
36398 }
36399 }
36401 {
36404 }
36419 check_clauses:
36421 {
36424 {
36438 "%<#pragma omp target%> with map-type other "
36439 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36443 }
36445 }
36447 }
36449 /* OpenACC 2.0:
36450 # pragma acc cache (variable-list) new-line
36451 */
36453 static tree
36455 {
36470 }
36472 /* OpenACC 2.0:
36473 # pragma acc data oacc-data-clause[optseq] new-line
36474 structured-block */
36476 #define OACC_DATA_CLAUSE_MASK \
36477 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36489 static tree
36491 {
36504 }
36506 /* OpenACC 2.0:
36507 # pragma acc host_data <clauses> new-line
36508 structured-block */
36510 #define OACC_HOST_DATA_CLAUSE_MASK \
36511 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36513 static tree
36515 {
36528 }
36530 /* OpenACC 2.0:
36531 # pragma acc declare oacc-data-clause[optseq] new-line
36532 */
36534 #define OACC_DECLARE_CLAUSE_MASK \
36535 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36548 static tree
36550 {
36559 {
36563 }
36566 {
36570 {
36574 }
36577 {
36589 {
36591 "%qD must be a global variable in "
36593 decl);
36596 }
36601 {
36605 }
36607 {
36609 "invalid use of %<extern%> variable %qD "
36613 }
36615 {
36617 "invalid use of %<global%> variable %qD "
36621 }
36623 }
36628 {
36633 }
36636 {
36637 tree id;
36641 else
36647 {
36650 {
36653 {
36657 }
36658 }
36659 }
36660 }
36661 }
36674 }
36676 /* OpenACC 2.0:
36677 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36679 or
36681 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36683 LOC is the location of the #pragma token.
36684 */
36686 #define OACC_ENTER_DATA_CLAUSE_MASK \
36687 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36695 #define OACC_EXIT_DATA_CLAUSE_MASK \
36696 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36702 static tree
36705 {
36714 {
36719 }
36726 else
36731 {
36735 }
36743 }
36745 /* OpenACC 2.0:
36746 # pragma acc loop oacc-loop-clause[optseq] new-line
36747 structured-block */
36749 #define OACC_LOOP_CLAUSE_MASK \
36750 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36761 static tree
36764 {
36773 {
36779 }
36788 }
36790 /* OpenACC 2.0:
36791 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36792 structured-block
36794 or
36796 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36797 structured-block
36798 */
36800 #define OACC_KERNELS_CLAUSE_MASK \
36801 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36819 #define OACC_PARALLEL_CLAUSE_MASK \
36820 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36841 static tree
36844 {
36845 omp_clause_mask mask;
36848 {
36861 }
36864 {
36868 {
36871 tree clauses;
36873 if_p);
36875 }
36876 }
36885 }
36887 /* OpenACC 2.0:
36888 # pragma acc update oacc-update-clause[optseq] new-line
36889 */
36891 #define OACC_UPDATE_CLAUSE_MASK \
36892 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36899 static tree
36901 {
36908 {
36910 "%<#pragma acc update%> must contain at least one "
36913 }
36921 }
36923 /* OpenACC 2.0:
36924 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36926 LOC is the location of the #pragma token.
36927 */
36929 #define OACC_WAIT_CLAUSE_MASK \
36930 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36932 static tree
36934 {
36948 }
36950 /* OpenMP 4.0:
36951 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36953 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36954 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36961 static void
36964 {
36966 cp_omp_declare_simd_data data;
36968 {
36973 /* It is safe to take the address of a local variable; it will only be
36974 used while this scope is live. */
36976 }
36978 /* Store away all pragma tokens. */
36990 {
36994 {
37007 }
37012 "%<#pragma omp declare simd%> not immediately followed by "
37016 }
37017 }
37019 /* Finalize #pragma omp declare simd clauses after direct declarator has
37020 been parsed, and put that into "omp declare simd" attribute. */
37022 static tree
37024 {
37030 {
37034 }
37039 {
37057 }
37061 }
37064 /* OpenMP 4.0:
37065 # pragma omp declare target new-line
37066 declarations and definitions
37067 # pragma omp end declare target new-line
37069 OpenMP 4.5:
37070 # pragma omp declare target ( extended-list ) new-line
37072 # pragma omp declare target declare-target-clauses[seq] new-line */
37074 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37075 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37078 static void
37080 {
37083 clauses
37087 {
37089 clauses);
37092 }
37093 else
37094 {
37098 }
37101 "%<#pragma omp declare target%> with clauses in between "
37102 "%<#pragma omp declare target%> without clauses and "
37105 {
37111 {
37114 }
37115 else
37118 {
37120 "%qD specified both in declare target %<link%> and %<to%>"
37123 }
37125 {
37132 {
37135 {
37139 }
37140 }
37141 }
37142 }
37143 }
37145 static void
37147 {
37150 {
37153 }
37155 {
37159 {
37162 }
37165 else
37166 {
37170 }
37171 }
37172 else
37173 {
37177 }
37181 "%<#pragma omp end declare target%> without corresponding "
37183 else
37185 }
37187 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37188 expression and optional initializer clause of
37189 #pragma omp declare reduction. We store the expression(s) as
37190 either 3, 6 or 7 special statements inside of the artificial function's
37191 body. The first two statements are DECL_EXPRs for the artificial
37192 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37193 expression that uses those variables.
37194 If there was any INITIALIZER clause, this is followed by further statements,
37195 the fourth and fifth statements are DECL_EXPRs for the artificial
37196 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37197 constructor variant (first token after open paren is not omp_priv),
37198 then the sixth statement is a statement with the function call expression
37199 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37200 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37201 to initialize the OMP_PRIV artificial variable and there is seventh
37202 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37204 static bool
37206 {
37218 tree combiner;
37233 {
37236 }
37239 {
37241 matching_parens parens;
37247 {
37250 }
37266 {
37270 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37274 == CPP_CLOSE_PAREN
37277 {
37281 }
37286 }
37287 else
37288 {
37304 {
37309 }
37311 tree arg;
37324 }
37335 }
37339 UNKNOWN_LOCATION);
37342 }
37344 /* OpenMP 4.0
37345 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37346 initializer-clause[opt] new-line
37348 initializer-clause:
37349 initializer (omp_priv initializer)
37350 initializer (function-name (argument-list)) */
37352 static void
37355 {
37365 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37372 {
37404 }
37416 /* Types may not be defined in declare reduction type list. */
37419 parser->type_definition_forbidden_message
37425 saved_colon_doesnt_start_class_def_p
37430 {
37434 ;
37453 else
37458 else
37460 }
37462 /* Restore the saved message. */
37465 parser->colon_doesnt_start_class_def_p
37470 {
37471 fail:
37474 }
37480 {
37481 tree fntype
37484 NULL_TREE);
37504 {
37509 }
37511 {
37513 {
37522 }
37529 }
37530 else
37531 {
37534 }
37537 else
37540 {
37543 }
37545 {
37548 else
37553 }
37558 else
37559 {
37568 }
37575 }
37579 done:
37580 /* Free any declarators allocated. */
37582 }
37584 /* OpenMP 4.0
37585 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37586 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37587 initializer-clause[opt] new-line
37588 #pragma omp declare target new-line */
37590 static bool
37593 {
37595 {
37600 {
37603 context);
37605 }
37608 {
37611 context);
37613 }
37615 {
37618 }
37620 {
37624 }
37625 }
37630 }
37632 /* OpenMP 4.5:
37633 #pragma omp taskloop taskloop-clause[optseq] new-line
37634 for-loop
37636 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37637 for-loop */
37639 #define OMP_TASKLOOP_CLAUSE_MASK \
37640 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37655 static tree
37659 {
37668 {
37673 {
37697 }
37698 }
37700 {
37703 }
37708 {
37711 }
37717 if_p);
37723 }
37726 /* OpenACC 2.0:
37727 # pragma acc routine oacc-routine-clause[optseq] new-line
37728 function-definition
37730 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37731 */
37733 #define OACC_ROUTINE_CLAUSE_MASK \
37734 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37740 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37741 component, which must resolve to a declared namespace-scope
37742 function. The clauses are either processed directly (for a named
37743 function), or defered until the immediatley following declaration
37744 is parsed. */
37746 static void
37749 {
37751 /* The checking for "another pragma following this one" in the "no optional
37752 '( name )'" case makes sure that we dont re-enter. */
37755 cp_oacc_routine_data data;
37761 /* It is safe to take the address of a local variable; it will only be
37762 used while this scope is live. */
37765 /* Look for optional '( name )'. */
37767 {
37768 matching_parens parens;
37771 /* We parse the name as an id-expression. If it resolves to
37772 anything other than a non-overloaded function at namespace
37773 scope, it's an error. */
37787 {
37791 }
37793 data.clauses
37801 {
37806 }
37808 /* Perhaps we should use the same rule as declarations in different
37809 namespaces? */
37811 {
37816 }
37819 {
37823 }
37827 }
37829 {
37830 /* Store away all pragma tokens. */
37841 /* Emit a helpful diagnostic if there's another pragma following this
37842 one. */
37844 {
37847 /* ..., and then just keep going. */
37849 }
37851 /* We only have to consider the pragma_external case here. */
37856 else
37859 }
37860 }
37862 /* Finalize #pragma acc routine clauses after direct declarator has
37863 been parsed. */
37865 static tree
37867 {
37872 {
37874 "%<#pragma acc routine%> not immediately followed by "
37877 }
37894 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37895 fndecl_seen. */
37898 }
37900 /* Apply any saved OpenACC routine clauses to a just-parsed
37901 declaration. */
37903 static void
37905 {
37907 {
37908 /* Keep going if we're in error reporting mode. */
37914 {
37916 "%<#pragma acc routine%> not immediately followed by"
37920 }
37922 {
37925 }
37928 {
37933 }
37936 {
37944 }
37946 /* Process the routine's dimension clauses. */
37950 /* Add an "omp declare target" attribute. */
37955 /* Don't unset parser->oacc_routine here: we may still need it to
37956 diagnose wrong usage. But, remember that we've used this "#pragma acc
37957 routine". */
37959 }
37960 }
37962 /* Main entry point to OpenMP statement pragmas. */
37964 static void
37966 {
37967 tree stmt;
37972 {
37995 if_p);
38000 if_p);
38017 if_p);
38022 if_p);
38030 if_p);
38039 if_p);
38053 if_p);
38058 if_p);
38062 }
38065 }
38066 \f
38067 /* Transactional Memory parsing routines. */
38069 /* Parse a transaction attribute.
38071 txn-attribute:
38072 attribute
38073 [ [ identifier ] ]
38075 We use this instead of cp_parser_attributes_opt for transactions to avoid
38076 the pedwarn in C++98 mode. */
38078 static tree
38080 {
38095 {
38099 /* For keywords, use the canonical spelling,
38100 not the parsed identifier. */
38104 }
38105 else
38109 error1:
38112 }
38114 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38116 transaction-statement:
38117 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38118 compound-statement
38119 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38120 */
38122 static tree
38124 {
38135 else
38136 {
38140 }
38142 /* Parse a noexcept specification. */
38146 {
38147 /* cancel-and-throw is unimplemented. */
38150 }
38151 else
38154 /* Keep track if we're in the lexical scope of an outer transaction. */
38166 }
38168 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38170 transaction-expression:
38171 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38172 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38173 */
38175 static tree
38177 {
38190 keyword == RID_TRANSACTION_RELAXED
38204 /* Set this early. This might mean that we allow transaction_cancel in
38205 an expression that we find out later actually has to be a constexpr.
38206 However, we expect that cxx_constant_value will be able to deal with
38207 this; also, if the noexcept has no constexpr, then what we parse next
38208 really is a transaction's body. */
38211 /* Parse a noexcept specification. */
38217 {
38218 matching_parens parens;
38225 }
38226 else
38227 {
38228 /* The only expression that is available got parsed for the noexcept
38229 already. noexcept is true then. */
38232 }
38241 }
38243 /* Parse a function-transaction-block.
38245 function-transaction-block:
38246 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38247 function-body
38248 __transaction_atomic txn-attribute[opt] function-try-block
38249 __transaction_relaxed ctor-initializer[opt] function-body
38250 __transaction_relaxed function-try-block
38251 */
38253 static void
38255 {
38270 else
38271 {
38275 }
38283 else
38284 cp_parser_ctor_initializer_opt_and_function_body
38290 }
38292 /* Parse a __transaction_cancel statement.
38294 cancel-statement:
38295 __transaction_cancel txn-attribute[opt] ;
38296 __transaction_cancel txn-attribute[opt] throw-expression ;
38298 ??? Cancel and throw is not yet implemented. */
38300 static tree
38302 {
38308 RT_TRANSACTION_CANCEL);
38315 /* ??? Parse cancel-and-throw here. */
38320 {
38324 }
38326 {
38330 }
38332 {
38335 {
38341 }
38342 }
38344 {
38348 }
38354 }
38355 \f
38356 /* The parser. */
38360 \f
38361 /* Special handling for the first token or line in the file. The first
38362 thing in the file might be #pragma GCC pch_preprocess, which loads a
38363 PCH file, which is a GC collection point. So we need to handle this
38364 first pragma without benefit of an existing lexer structure.
38366 Always returns one token to the caller in *FIRST_TOKEN. This is
38367 either the true first token of the file, or the first token after
38368 the initial pragma. */
38370 static void
38372 {
38381 {
38388 }
38389 else
38392 /* Skip to the end of the pragma. */
38396 /* Now actually load the PCH file. */
38400 /* Read one more token to return to our caller. We have to do this
38401 after reading the PCH file in, since its pointers have to be
38402 live. */
38404 }
38406 /* Parse a pragma GCC ivdep. */
38408 static bool
38410 {
38413 }
38415 /* Parse a pragma GCC unroll. */
38417 static unsigned short
38419 {
38429 {
38431 " assignment-expression that evaluates to a non-negative"
38434 }
38435 else
38436 {
38440 }
38443 }
38445 /* Normal parsing of a pragma token. Here we can (and must) use the
38446 regular lexer. */
38448 static bool
38450 {
38453 tree stmt;
38464 {
38472 {
38482 }
38487 {
38497 }
38502 {
38513 }
38518 {
38529 }
38534 {
38545 }
38565 {
38570 }
38578 {
38583 }
38591 {
38595 }
38601 {
38606 }
38614 {
38619 }
38674 "%<#pragma omp section%> may only be used in "
38679 {
38681 {
38685 }
38691 {
38695 }
38696 else
38702 {
38705 }
38708 }
38711 {
38713 {
38717 }
38718 const unsigned short unroll
38724 {
38728 }
38729 else
38735 {
38738 }
38741 }
38748 bad_stmt:
38751 }
38755 }
38757 /* The interface the pragma parsers have to the lexer. */
38759 enum cpp_ttype
38761 {
38773 else
38774 {
38778 }
38781 }
38783 \f
38784 /* External interface. */
38786 /* Parse one entire translation unit. */
38788 void
38790 {
38803 }
38805 /* Create an identifier for a generic parameter type (a synthesized
38806 template parameter implied by `auto' or a concept identifier). */
38809 static tree
38811 {
38815 }
38817 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38818 (creating a new template parameter list if necessary). Returns the newly
38819 created template type parm. */
38821 static tree
38823 {
38826 /* Before committing to modifying any scope, if we're in an
38827 implicit template scope, and we're trying to synthesize a
38828 constrained parameter, try to find a previous parameter with
38829 the same name. This is the same-type rule for abbreviated
38830 function templates.
38832 NOTE: We can generate implicit parameters when tentatively
38833 parsing a nested name specifier, only to reject that parse
38834 later. However, matching the same template-id as part of a
38835 direct-declarator should generate an identical template
38836 parameter, so this rule will merge them. */
38838 {
38841 {
38843 {
38846 /* Return the TEMPLATE_PARM_INDEX. */
38849 }
38851 }
38852 }
38854 /* We are either continuing a function template that already contains implicit
38855 template parameters, creating a new fully-implicit function template, or
38856 extending an existing explicit function template with implicit template
38857 parameters. */
38865 {
38869 }
38870 else
38871 {
38872 /* Roll back to the existing template parameter scope (in the case of
38873 extending an explicit function template) or introduce a new template
38874 parameter scope ahead of the function parameter scope (or class scope
38875 in the case of out-of-line member definitions). The function scope is
38876 added back after template parameter synthesis below. */
38881 {
38884 }
38886 {
38887 /* If not defining a class, then any class scope is a scope level in
38888 an out-of-line member definition. In this case simply wind back
38889 beyond the first such scope to inject the template parameter list.
38890 Otherwise wind back to the class being defined. The latter can
38891 occur in class member friend declarations such as:
38893 class A {
38894 void foo (auto);
38895 };
38896 class B {
38897 friend void A::foo (auto);
38898 };
38900 The template parameter list synthesized for the friend declaration
38901 must be injected in the scope of 'B'. This can also occur in
38902 erroneous cases such as:
38904 struct A {
38905 struct B {
38906 void foo (auto);
38907 };
38908 void B::foo (auto) {}
38909 };
38911 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38912 but, nevertheless, the template parameter list synthesized for the
38913 declarator should be injected into the scope of 'A' as if the
38914 ill-formed template was specified explicitly. */
38917 {
38920 }
38921 }
38927 {
38928 /* Introduce a new template parameter list for implicit template
38929 parameters. */
38933 parser->implicit_template_scope
38940 }
38941 else
38942 {
38943 /* Synthesize implicit template parameters at the end of the explicit
38944 template parameter list. */
38951 parser->implicit_template_parms
38953 }
38954 }
38956 /* Synthesize a new template parameter and track the current template
38957 parameter chain with implicit_template_parms. */
38961 tree synth_tmpl_parm;
38965 synth_tmpl_parm
38968 synth_tmpl_parm
38970 else
38971 {
38975 }
38977 // Attach the constraint to the parm before processing.
38980 tree new_parm
38982 input_location,
38983 node,
38987 // Chain the new parameter to the list of implicit parameters.
38989 parser->implicit_template_parms
38991 else
38996 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38999 /* If creating a fully implicit function template, start the new implicit
39000 template parameter list with this synthesized type, otherwise grow the
39001 current template parameter list. */
39004 {
39011 }
39012 else
39013 {
39018 }
39020 // If the new parameter was constrained, we need to add that to the
39021 // constraints in the template parameter list.
39023 {
39027 }
39032 }
39034 /* Finish the declaration of a fully implicit function template. Such a
39035 template has no explicit template parameter list so has not been through the
39036 normal template head and tail processing. synthesize_implicit_template_parm
39037 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39038 provided if the declaration is a class member such that its template
39039 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39040 form is returned. Otherwise NULL_TREE is returned. */
39042 static tree
39044 {
39049 {
39053 }
39063 }
39065 /* Helper function for diagnostics that have complained about things
39066 being used with 'extern "C"' linkage.
39068 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39070 void
39072 {
39076 }