| blob | bdaf7fdcc92a0507acdb979fdb996ae838818c2b |
1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
13 any later version.
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
44 /* The various kinds of conversion. */
47 ck_identity,
48 ck_lvalue,
49 ck_qual,
50 ck_std,
51 ck_ptr,
52 ck_pmem,
53 ck_base,
54 ck_ref_bind,
55 ck_user,
56 ck_ambig,
57 ck_list,
58 ck_aggr,
59 ck_rvalue
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
66 cr_identity,
67 cr_exact,
68 cr_promotion,
69 cr_std,
70 cr_pbool,
71 cr_user,
72 cr_ellipsis,
73 cr_bad
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
82 /* The kind of conversion represented by this step. */
83 conversion_kind kind;
84 /* The rank of this conversion. */
85 conversion_rank rank;
90 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
91 temporary should be created to hold the result of the
92 conversion. */
94 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
95 from a pointer-to-derived to pointer-to-base is being performed. */
97 /* If KIND is ck_ref_bind, true when either an lvalue reference is
98 being bound to an lvalue expression or an rvalue reference is
99 being bound to an rvalue expression. */
102 /* The type of the expression resulting from the conversion. */
103 tree type;
105 /* The next conversion in the chain. Since the conversions are
106 arranged from outermost to innermost, the NEXT conversion will
107 actually be performed before this conversion. This variant is
108 used only when KIND is neither ck_identity nor ck_ambig. */
110 /* The expression at the beginning of the conversion chain. This
111 variant is used only if KIND is ck_identity or ck_ambig. */
112 tree expr;
113 /* The array of conversions for an initializer_list. */
116 /* The function candidate corresponding to this conversion
117 sequence. This field is only used if KIND is ck_user. */
119 };
121 #define CONVERSION_RANK(NODE) \
122 ((NODE)->bad_p ? cr_bad \
123 : (NODE)->ellipsis_p ? cr_ellipsis \
124 : (NODE)->user_conv_p ? cr_user \
125 : (NODE)->rank)
136 #define convert_like(CONV, EXPR, COMPLAIN) \
137 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
140 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
141 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
164 static void add_builtin_candidates
167 static void add_builtin_candidate
171 static void build_builtin_candidate
206 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
207 NAME can take many forms... */
209 bool
211 {
212 /* Just accept something we've already complained about. */
221 {
227 else
229 }
230 else
231 {
232 /* In the case of:
234 template <class T> struct S { ~S(); };
235 int i;
236 i.~S();
238 NAME will be a class template. */
241 }
246 }
248 /* We want the address of a function or method. We avoid creating a
249 pointer-to-member function. */
251 tree
253 {
256 /* We have to do these by hand to avoid real pointer to member
257 functions. */
259 {
261 {
265 }
267 }
268 else
272 }
274 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
275 POINTER_TYPE to those. Note, pointer to member function types
276 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
277 two variants. build_call_a is the primitive taking an array of
278 arguments, while build_call_n is a wrapper that handles varargs. */
280 tree
282 {
285 else
286 {
296 }
297 }
299 tree
301 {
304 tree decl;
305 tree result_type;
306 tree fntype;
319 {
322 {
323 /* We invoke build_call directly for several library
324 functions. These may have been declared normally if
325 we're building libgcc, so we can't just check
326 DECL_ARTIFICIAL. */
331 }
332 }
333 else
336 /* We check both the decl and the type; a function may be known not to
337 throw without being declared throw(). */
351 /* Don't pass empty class objects by value. This is useful
352 for tags in STL, which are used to control overload resolution.
353 We don't need to handle other cases of copying empty classes. */
358 {
362 }
369 }
371 /* Build something of the form ptr->method (args)
372 or object.method (args). This can also build
373 calls to constructors, and find friends.
375 Member functions always take their class variable
376 as a pointer.
378 INSTANCE is a class instance.
380 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
382 PARMS help to figure out what that NAME really refers to.
384 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
385 down to the real instance type to use for access checking. We need this
386 information to get protected accesses correct.
388 FLAGS is the logical disjunction of zero or more LOOKUP_
389 flags. See cp-tree.h for more info.
391 If this is all OK, calls build_function_call with the resolved
392 member function.
394 This function must also handle being called to perform
395 initialization, promotion/coercion of arguments, and
396 instantiation of default parameters.
398 Note that NAME may refer to an instance variable name. If
399 `operator()()' is defined for the type of that field, then we return
400 that result. */
402 /* New overloading code. */
410 };
413 /* The FUNCTION_DECL that will be called if this candidate is
414 selected by overload resolution. */
415 tree fn;
416 /* The arguments to use when calling this function. */
417 tree args;
418 /* The implicit conversion sequences for each of the arguments to
419 FN. */
421 /* The number of implicit conversion sequences. */
423 /* If FN is a user-defined conversion, the standard conversion
424 sequence from the type returned by FN to the desired destination
425 type. */
428 /* If FN is a member function, the binfo indicating the path used to
429 qualify the name of FN at the call site. This path is used to
430 determine whether or not FN is accessible if it is selected by
431 overload resolution. The DECL_CONTEXT of FN will always be a
432 (possibly improper) base of this binfo. */
433 tree access_path;
434 /* If FN is a non-static member function, the binfo indicating the
435 subobject to which the `this' pointer should be converted if FN
436 is selected by overload resolution. The type pointed to the by
437 the `this' pointer must correspond to the most derived class
438 indicated by the CONVERSION_PATH. */
439 tree conversion_path;
440 tree template_decl;
443 };
445 /* Returns true iff T is a null pointer constant in the sense of
446 [conv.ptr]. */
448 bool
450 {
451 /* [conv.ptr]
453 A null pointer constant is an integral constant expression
454 (_expr.const_) rvalue of integer type that evaluates to zero. */
459 {
463 }
465 }
467 /* Returns nonzero if PARMLIST consists of only default parms and/or
468 ellipsis. */
470 bool
472 {
478 }
480 /* Allocate N bytes of memory from the conversion obstack. The memory
481 is zeroed before being returned. */
485 {
488 {
491 }
495 }
497 /* Dynamically allocate a conversion. */
501 {
506 }
508 #ifdef ENABLE_CHECKING
510 /* Make sure that all memory on the conversion obstack has been
511 freed. */
513 void
515 {
519 }
523 /* Dynamically allocate an array of N conversions. */
527 {
529 }
533 {
537 /* Note that the caller is responsible for filling in t->cand for
538 user-defined conversions. */
544 {
560 }
566 }
568 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
569 specialization of std::initializer_list<T>, if such a conversion is
570 possible. */
574 {
580 tree val;
583 {
584 conversion *sub
591 }
599 {
607 }
610 }
612 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
613 aggregate class, if such a conversion is possible. */
617 {
623 {
627 {
632 }
635 }
643 }
645 /* Build a representation of the identity conversion from EXPR to
646 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
650 {
658 }
660 /* Converting from EXPR to TYPE was ambiguous in the sense that there
661 were multiple user-defined conversions to accomplish the job.
662 Build a conversion that indicates that ambiguity. */
666 {
674 }
676 tree
678 {
682 }
684 /* Returns the standard conversion path (see [conv]) from type FROM to type
685 TO, if any. For proper handling of null pointer constants, you must
686 also pass the expression EXPR to convert from. If C_CAST_P is true,
687 this conversion is coming from a C-style cast. */
692 {
699 {
702 }
708 {
713 }
720 {
724 }
726 {
728 {
729 tree bitfield_type;
732 {
735 }
736 }
738 }
740 /* Allow conversion between `__complex__' data types. */
742 {
743 /* The standard conversion sequence to convert FROM to TO is
744 the standard conversion sequence to perform componentwise
745 conversion. */
750 {
753 }
754 else
758 }
768 {
769 /* For backwards brain damage compatibility, allow interconversion of
770 pointers and integers with a pedwarn. */
773 }
775 {
776 /* For backwards brain damage compatibility, allow interconversion of
777 enums and integers with a pedwarn. */
780 }
783 {
784 tree to_pointee;
785 tree from_pointee;
790 ;
794 {
795 from = build_pointer_type
799 }
801 {
806 && (same_type_ignoring_top_level_qualifiers_p
809 {
813 }
816 }
819 /* [conv.ptr]
821 An rvalue of type "pointer to cv D," where D is a
822 class type, can be converted to an rvalue of type
823 "pointer to cv B," where B is a base class (clause
824 _class.derived_) of D. If B is an inaccessible
825 (clause _class.access_) or ambiguous
826 (_class.member.lookup_) base class of D, a program
827 that necessitates this conversion is ill-formed.
828 Therefore, we use DERIVED_FROM_P, and do not check
829 access or uniqueness. */
831 {
832 from =
838 }
841 {
844 }
845 else
846 {
849 }
854 /* In a C-style cast, we ignore CV-qualification because we
855 are allowed to perform a static_cast followed by a
856 const_cast. */
861 /* converting from string constant to char *. */
864 {
867 }
868 else
872 }
874 {
894 }
896 {
897 /* [conv.bool]
899 An rvalue of arithmetic, unscoped enumeration, pointer, or
900 pointer to member type can be converted to an rvalue of type
901 bool. */
906 {
914 }
917 }
918 /* We don't check for ENUMERAL_TYPE here because there are no standard
919 conversions to enum type. */
920 /* As an extension, allow conversion to complex type. */
922 {
928 /* Give this a better rank if it's a promotion. */
932 }
938 {
942 /* The derived-to-base conversion indicates the initialization
943 of a parameter with base type from an object of a derived
944 type. A temporary object is created to hold the result of
945 the conversion unless we're binding directly to a reference. */
947 }
948 else
955 }
957 /* Returns nonzero if T1 is reference-related to T2. */
959 static bool
961 {
965 /* [dcl.init.ref]
967 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
968 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
969 of T2. */
973 }
975 /* Returns nonzero if T1 is reference-compatible with T2. */
977 static bool
979 {
980 /* [dcl.init.ref]
982 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
983 reference-related to T2 and cv1 is the same cv-qualification as,
984 or greater cv-qualification than, cv2. */
987 }
989 /* Determine whether or not the EXPR (of class type S) can be
990 converted to T as in [over.match.ref]. */
994 {
995 tree conversions;
996 tree arglist;
998 tree t;
1007 /* [over.match.ref]
1009 Assuming that "cv1 T" is the underlying type of the reference
1010 being initialized, and "cv S" is the type of the initializer
1011 expression, with S a class type, the candidate functions are
1012 selected as follows:
1014 --The conversion functions of S and its base classes are
1015 considered. Those that are not hidden within S and yield type
1016 "reference to cv2 T2", where "cv1 T" is reference-compatible
1017 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1019 The argument list has one argument, which is the initializer
1020 expression. */
1024 /* Conceptually, we should take the address of EXPR and put it in
1025 the argument list. Unfortunately, however, that can result in
1026 error messages, which we should not issue now because we are just
1027 trying to find a conversion operator. Therefore, we use NULL,
1028 cast to the appropriate type. */
1035 {
1039 {
1045 /* If this is a template function, try to get an exact
1046 match. */
1048 {
1051 NULL_TREE,
1052 arglist,
1053 reference_type,
1056 LOOKUP_NORMAL,
1057 DEDUCE_CONV);
1060 {
1061 /* Now, see if the conversion function really returns
1062 an lvalue of the appropriate type. From the
1063 point of view of unification, simply returning an
1064 rvalue of the right type is good enough. */
1069 {
1072 }
1073 }
1074 }
1080 LOOKUP_NORMAL);
1083 {
1085 /* Build a standard conversion sequence indicating the
1086 binding from the reference type returned by the
1087 function to the desired REFERENCE_TYPE. */
1088 identity_conv
1091 NULL_TREE);
1092 cand->second_conv
1093 = (direct_reference_binding
1099 }
1100 }
1102 }
1105 /* If none of the conversion functions worked out, let our caller
1106 know. */
1114 /* Now that we know that this is the function we're going to use fix
1115 the dummy first argument. */
1120 /* Build a user-defined conversion sequence representing the
1121 conversion. */
1127 /* Merge it with the standard conversion sequence from the
1128 conversion function's return type to the desired type. */
1135 }
1137 /* A reference of the indicated TYPE is being bound directly to the
1138 expression represented by the implicit conversion sequence CONV.
1139 Return a conversion sequence for this binding. */
1143 {
1144 tree t;
1151 /* [over.ics.rank]
1153 When a parameter of reference type binds directly
1154 (_dcl.init.ref_) to an argument expression, the implicit
1155 conversion sequence is the identity conversion, unless the
1156 argument expression has a type that is a derived class of the
1157 parameter type, in which case the implicit conversion sequence is
1158 a derived-to-base Conversion.
1160 If the parameter binds directly to the result of applying a
1161 conversion function to the argument expression, the implicit
1162 conversion sequence is a user-defined conversion sequence
1163 (_over.ics.user_), with the second standard conversion sequence
1164 either an identity conversion or, if the conversion function
1165 returns an entity of a type that is a derived class of the
1166 parameter type, a derived-to-base conversion. */
1168 {
1169 /* Represent the derived-to-base conversion. */
1171 /* We will actually be binding to the base-class subobject in
1172 the derived class, so we mark this conversion appropriately.
1173 That way, convert_like knows not to generate a temporary. */
1175 }
1177 }
1179 /* Returns the conversion path from type FROM to reference type TO for
1180 purposes of reference binding. For lvalue binding, either pass a
1181 reference type to FROM or an lvalue expression to EXPR. If the
1182 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1183 the conversion returned. If C_CAST_P is true, this
1184 conversion is coming from a C-style cast. */
1188 {
1192 tree tfrom;
1198 {
1203 }
1206 {
1207 /* Anything with reference type is an lvalue. */
1210 }
1218 /* Figure out whether or not the types are reference-related and
1219 reference compatible. We have do do this after stripping
1220 references from FROM. */
1222 /* If this is a C cast, first convert to an appropriately qualified
1223 type, so that we can later do a const_cast to the desired type. */
1229 /* Directly bind reference when target expression's type is compatible with
1230 the reference and expression is an lvalue. In DR391, the wording in
1231 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1232 const and rvalue references to rvalues of compatible class type. */
1234 && (lvalue_p
1238 {
1239 /* [dcl.init.ref]
1241 If the initializer expression
1243 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1244 is reference-compatible with "cv2 T2,"
1246 the reference is bound directly to the initializer expression
1247 lvalue.
1249 [...]
1250 If the initializer expression is an rvalue, with T2 a class type,
1251 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1252 is bound to the object represented by the rvalue or to a sub-object
1253 within that object. */
1259 /* The top-level caller requested that we pretend that the lvalue
1260 be treated as an rvalue. */
1262 else
1263 conv->rvaluedness_matches_p
1268 /* For the purposes of overload resolution, we ignore the fact
1269 this expression is a bitfield or packed field. (In particular,
1270 [over.ics.ref] says specifically that a function with a
1271 non-const reference parameter is viable even if the
1272 argument is a bitfield.)
1274 However, when we actually call the function we must create
1275 a temporary to which to bind the reference. If the
1276 reference is volatile, or isn't const, then we cannot make
1277 a temporary, so we just issue an error when the conversion
1278 actually occurs. */
1282 }
1283 /* [class.conv.fct] A conversion function is never used to convert a
1284 (possibly cv-qualified) object to the (possibly cv-qualified) same
1285 object type (or a reference to it), to a (possibly cv-qualified) base
1286 class of that type (or a reference to it).... */
1289 {
1290 /* [dcl.init.ref]
1292 If the initializer expression
1294 -- has a class type (i.e., T2 is a class type) can be
1295 implicitly converted to an lvalue of type "cv3 T3," where
1296 "cv1 T1" is reference-compatible with "cv3 T3". (this
1297 conversion is selected by enumerating the applicable
1298 conversion functions (_over.match.ref_) and choosing the
1299 best one through overload resolution. (_over.match_).
1301 the reference is bound to the lvalue result of the conversion
1302 in the second case. */
1306 }
1308 /* From this point on, we conceptually need temporaries, even if we
1309 elide them. Only the cases above are "direct bindings". */
1313 /* [over.ics.rank]
1315 When a parameter of reference type is not bound directly to an
1316 argument expression, the conversion sequence is the one required
1317 to convert the argument expression to the underlying type of the
1318 reference according to _over.best.ics_. Conceptually, this
1319 conversion sequence corresponds to copy-initializing a temporary
1320 of the underlying type with the argument expression. Any
1321 difference in top-level cv-qualification is subsumed by the
1322 initialization itself and does not constitute a conversion. */
1324 /* [dcl.init.ref]
1326 Otherwise, the reference shall be to a non-volatile const type.
1328 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1332 /* [dcl.init.ref]
1334 Otherwise, a temporary of type "cv1 T1" is created and
1335 initialized from the initializer expression using the rules for a
1336 non-reference copy initialization. If T1 is reference-related to
1337 T2, cv1 must be the same cv-qualification as, or greater
1338 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1342 /* We're generating a temporary now, but don't bind any more in the
1343 conversion (specifically, don't slice the temporary returned by a
1344 conversion operator). */
1348 flags);
1353 /* This reference binding, unlike those above, requires the
1354 creation of a temporary. */
1359 }
1361 /* Returns the implicit conversion sequence (see [over.ics]) from type
1362 FROM to type TO. The optional expression EXPR may affect the
1363 conversion. FLAGS are the usual overloading flags. Only
1364 LOOKUP_NO_CONVERSION is significant. If C_CAST_P is true, this
1365 conversion is coming from a C-style cast. */
1370 {
1379 else
1393 {
1407 /* We used to try to bind a reference to a temporary here, but that
1408 is now handled after the recursive call to this function at the end
1409 of reference_binding. */
1411 }
1414 }
1416 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1417 functions. */
1425 {
1440 }
1442 /* Create an overload candidate for the function or method FN called with
1443 the argument list ARGLIST and add it to CANDIDATES. FLAGS is passed on
1444 to implicit_conversion.
1446 CTYPE, if non-NULL, is the type we want to pretend this function
1447 comes from for purposes of overload resolution. */
1454 {
1459 tree orig_arglist;
1462 /* At this point we should not see any functions which haven't been
1463 explicitly declared, except for friend functions which will have
1464 been found using argument dependent lookup. */
1467 /* The `this', `in_chrg' and VTT arguments to constructors are not
1468 considered in overload resolution. */
1470 {
1474 }
1475 else
1481 /* 13.3.2 - Viable functions [over.match.viable]
1482 First, to be a viable function, a candidate function shall have enough
1483 parameters to agree in number with the arguments in the list.
1485 We need to check this first; otherwise, checking the ICSes might cause
1486 us to produce an ill-formed template instantiation. */
1490 {
1494 }
1499 /* Make sure there are default args for the rest of the parms. */
1506 /* Second, for F to be a viable function, there shall exist for each
1507 argument an implicit conversion sequence that converts that argument
1508 to the corresponding parameter of F. */
1514 {
1527 {
1531 /* The type of the implicit object parameter ('this') for
1532 overload resolution is not always the same as for the
1533 function itself; conversion functions are considered to
1534 be members of the class being converted, and functions
1535 introduced by a using-declaration are considered to be
1536 members of the class that uses them.
1538 Since build_over_call ignores the ICS for the `this'
1539 parameter, we can just change the parm type. */
1541 {
1542 parmtype
1546 }
1554 }
1555 else
1556 {
1559 }
1566 {
1569 }
1577 }
1579 out:
1582 }
1584 /* Create an overload candidate for the conversion function FN which will
1585 be invoked for expression OBJ, producing a pointer-to-function which
1586 will in turn be called with the argument list ARGLIST, and add it to
1587 CANDIDATES. FLAGS is passed on to implicit_conversion.
1589 Actually, we don't really care about FN; we care about the type it
1590 converts to. There may be multiple conversion functions that will
1591 convert to that type, and we rely on build_user_type_conversion_1 to
1592 choose the best one; so when we create our candidate, we record the type
1593 instead of the function. */
1598 {
1615 /* Don't bother looking up the same type twice. */
1620 {
1627 flags);
1633 else
1634 {
1637 }
1652 }
1662 }
1664 static void
1668 {
1682 {
1689 {
1691 /* We need something for printing the candidate. */
1693 }
1697 }
1699 /* For COND_EXPR we rearranged the arguments; undo that now. */
1701 {
1708 else
1710 }
1716 viable);
1717 }
1719 static bool
1721 {
1723 }
1725 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1727 static bool
1729 {
1730 /* [over.built]
1732 In this section, the term promoted integral type is used to refer
1733 to those integral types which are preserved by integral promotion
1734 (including e.g. int and long but excluding e.g. char).
1735 Similarly, the term promoted arithmetic type refers to promoted
1736 integral types plus floating types. */
1740 }
1742 /* Create any builtin operator overload candidates for the operator in
1743 question given the converted operand types TYPE1 and TYPE2. The other
1744 args are passed through from add_builtin_candidates to
1745 build_builtin_candidate.
1747 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1748 If CODE is requires candidates operands of the same type of the kind
1749 of which TYPE1 and TYPE2 are, we add both candidates
1750 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1752 static void
1756 {
1758 {
1766 }
1769 {
1771 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1772 and VQ is either volatile or empty, there exist candidate operator
1773 functions of the form
1774 VQ T& operator++(VQ T&);
1775 T operator++(VQ T&, int);
1776 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1777 type other than bool, and VQ is either volatile or empty, there exist
1778 candidate operator functions of the form
1779 VQ T& operator--(VQ T&);
1780 T operator--(VQ T&, int);
1781 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1782 complete object type, and VQ is either volatile or empty, there exist
1783 candidate operator functions of the form
1784 T*VQ& operator++(T*VQ&);
1785 T*VQ& operator--(T*VQ&);
1786 T* operator++(T*VQ&, int);
1787 T* operator--(T*VQ&, int); */
1796 {
1799 }
1802 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1803 exist candidate operator functions of the form
1805 T& operator*(T*);
1807 8 For every function type T, there exist candidate operator functions of
1808 the form
1809 T& operator*(T*); */
1818 /* 9 For every type T, there exist candidate operator functions of the form
1819 T* operator+(T*);
1821 10For every promoted arithmetic type T, there exist candidate operator
1822 functions of the form
1823 T operator+(T);
1824 T operator-(T); */
1834 /* 11For every promoted integral type T, there exist candidate operator
1835 functions of the form
1836 T operator~(T); */
1843 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1844 is the same type as C2 or is a derived class of C2, T is a complete
1845 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1846 there exist candidate operator functions of the form
1847 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1848 where CV12 is the union of CV1 and CV2. */
1853 {
1861 }
1864 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1865 didate operator functions of the form
1866 LR operator*(L, R);
1867 LR operator/(L, R);
1868 LR operator+(L, R);
1869 LR operator-(L, R);
1870 bool operator<(L, R);
1871 bool operator>(L, R);
1872 bool operator<=(L, R);
1873 bool operator>=(L, R);
1874 bool operator==(L, R);
1875 bool operator!=(L, R);
1876 where LR is the result of the usual arithmetic conversions between
1877 types L and R.
1879 14For every pair of types T and I, where T is a cv-qualified or cv-
1880 unqualified complete object type and I is a promoted integral type,
1881 there exist candidate operator functions of the form
1882 T* operator+(T*, I);
1883 T& operator[](T*, I);
1884 T* operator-(T*, I);
1885 T* operator+(I, T*);
1886 T& operator[](I, T*);
1888 15For every T, where T is a pointer to complete object type, there exist
1889 candidate operator functions of the form112)
1890 ptrdiff_t operator-(T, T);
1892 16For every pointer or enumeration type T, there exist candidate operator
1893 functions of the form
1894 bool operator<(T, T);
1895 bool operator>(T, T);
1896 bool operator<=(T, T);
1897 bool operator>=(T, T);
1898 bool operator==(T, T);
1899 bool operator!=(T, T);
1901 17For every pointer to member type T, there exist candidate operator
1902 functions of the form
1903 bool operator==(T, T);
1904 bool operator!=(T, T); */
1910 {
1913 }
1926 {
1929 }
1931 {
1934 }
1935 /* Fall through. */
1952 {
1955 }
1959 {
1962 }
1970 {
1973 }
1975 {
1978 }
1981 /* 18For every pair of promoted integral types L and R, there exist candi-
1982 date operator functions of the form
1983 LR operator%(L, R);
1984 LR operator&(L, R);
1985 LR operator^(L, R);
1986 LR operator|(L, R);
1987 L operator<<(L, R);
1988 L operator>>(L, R);
1989 where LR is the result of the usual arithmetic conversions between
1990 types L and R. */
2002 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2003 type, VQ is either volatile or empty, and R is a promoted arithmetic
2004 type, there exist candidate operator functions of the form
2005 VQ L& operator=(VQ L&, R);
2006 VQ L& operator*=(VQ L&, R);
2007 VQ L& operator/=(VQ L&, R);
2008 VQ L& operator+=(VQ L&, R);
2009 VQ L& operator-=(VQ L&, R);
2011 20For every pair T, VQ), where T is any type and VQ is either volatile
2012 or empty, there exist candidate operator functions of the form
2013 T*VQ& operator=(T*VQ&, T*);
2015 21For every pair T, VQ), where T is a pointer to member type and VQ is
2016 either volatile or empty, there exist candidate operator functions of
2017 the form
2018 VQ T& operator=(VQ T&, T);
2020 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2021 unqualified complete object type, VQ is either volatile or empty, and
2022 I is a promoted integral type, there exist candidate operator func-
2023 tions of the form
2024 T*VQ& operator+=(T*VQ&, I);
2025 T*VQ& operator-=(T*VQ&, I);
2027 23For every triple L, VQ, R), where L is an integral or enumeration
2028 type, VQ is either volatile or empty, and R is a promoted integral
2029 type, there exist candidate operator functions of the form
2031 VQ L& operator%=(VQ L&, R);
2032 VQ L& operator<<=(VQ L&, R);
2033 VQ L& operator>>=(VQ L&, R);
2034 VQ L& operator&=(VQ L&, R);
2035 VQ L& operator^=(VQ L&, R);
2036 VQ L& operator|=(VQ L&, R); */
2040 {
2044 {
2047 }
2073 {
2076 }
2081 }
2086 /* [over.built]
2088 For every pair of promoted arithmetic types L and R, there
2089 exist candidate operator functions of the form
2091 LR operator?(bool, L, R);
2093 where LR is the result of the usual arithmetic conversions
2094 between types L and R.
2096 For every type T, where T is a pointer or pointer-to-member
2097 type, there exist candidate operator functions of the form T
2098 operator?(bool, T, T); */
2102 /* That's OK. */
2105 /* Otherwise, the types should be pointers. */
2110 /* We don't check that the two types are the same; the logic
2111 below will actually create two candidates; one in which both
2112 parameter types are TYPE1, and one in which both parameter
2113 types are TYPE2. */
2118 }
2120 /* If we're dealing with two pointer types or two enumeral types,
2121 we need candidates for both of them. */
2130 {
2131 build_builtin_candidate
2133 build_builtin_candidate
2136 }
2138 build_builtin_candidate
2140 }
2142 tree
2144 {
2150 }
2152 /* There are three conditions of builtin candidates:
2154 1) bool-taking candidates. These are the same regardless of the input.
2155 2) pointer-pair taking candidates. These are generated for each type
2156 one of the input types converts to.
2157 3) arithmetic candidates. According to the standard, we should generate
2158 all of these, but I'm trying not to...
2160 Here we generate a superset of the possible candidates for this particular
2161 case. That is a subset of the full set the standard defines, plus some
2162 other cases which the standard disallows. add_builtin_candidate will
2163 filter out the invalid set. */
2165 static void
2169 {
2173 /* TYPES[i] is the set of possible builtin-operator parameter types
2174 we will consider for the Ith argument. These are represented as
2175 a TREE_LIST; the TREE_VALUE of each node is the potential
2176 parameter type. */
2180 {
2183 else
2185 }
2188 {
2189 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2190 and VQ is either volatile or empty, there exist candidate operator
2191 functions of the form
2192 VQ T& operator++(VQ T&); */
2202 /* 24There also exist candidate operator functions of the form
2203 bool operator!(bool);
2204 bool operator&&(bool, bool);
2205 bool operator||(bool, bool); */
2208 build_builtin_candidate
2215 build_builtin_candidate
2233 /* Fall through. */
2237 }
2242 {
2244 ;
2246 {
2247 tree convs;
2255 {
2262 }
2268 {
2281 {
2287 }
2291 }
2292 }
2293 else
2294 {
2300 {
2306 }
2308 }
2309 }
2311 /* Run through the possible parameter types of both arguments,
2312 creating candidates with those parameter types. */
2314 {
2317 add_builtin_candidate
2320 else
2321 add_builtin_candidate
2324 }
2325 }
2328 /* If TMPL can be successfully instantiated as indicated by
2329 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2331 TMPL is the template. EXPLICIT_TARGS are any explicit template
2332 arguments. ARGLIST is the arguments provided at the call-site.
2333 The RETURN_TYPE is the desired type for conversion operators. If
2334 OBJ is NULL_TREE, FLAGS and CTYPE are as for add_function_candidate.
2335 If an OBJ is supplied, FLAGS and CTYPE are ignored, and OBJ is as for
2336 add_conv_candidate. */
2343 unification_kind_t strict)
2344 {
2350 tree fn;
2352 /* We don't do deduction on the in-charge parameter, the VTT
2353 parameter or 'this'. */
2363 args_without_in_chrg,
2373 /* In [class.copy]:
2375 A member function template is never instantiated to perform the
2376 copy of a class object to an object of its class type.
2378 It's a little unclear what this means; the standard explicitly
2379 does allow a template to be used to copy a class. For example,
2380 in:
2382 struct A {
2383 A(A&);
2384 template <class T> A(const T&);
2385 };
2386 const A f ();
2387 void g () { A a (f ()); }
2389 the member template will be used to make the copy. The section
2390 quoted above appears in the paragraph that forbids constructors
2391 whose only parameter is (a possibly cv-qualified variant of) the
2392 class type, and a logical interpretation is that the intent was
2393 to forbid the instantiation of member templates which would then
2394 have that form. */
2396 {
2399 ctype))
2401 }
2404 /* Aha, this is a conversion function. */
2407 else
2412 /* This situation can occur if a member template of a template
2413 class is specialized. Then, instantiate_template might return
2414 an instantiation of the specialization, in which case the
2415 DECL_TI_TEMPLATE field will point at the original
2416 specialization. For example:
2418 template <class T> struct S { template <class U> void f(U);
2419 template <> void f(int) {}; };
2420 S<double> sd;
2421 sd.f(3);
2423 Here, TMPL will be template <class U> S<double>::f(U).
2424 And, instantiate template will give us the specialization
2425 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2426 for this will point at template <class T> template <> S<T>::f(int),
2427 so that we can find the definition. For the purposes of
2428 overload resolution, however, we want the original TMPL. */
2430 else
2434 }
2441 unification_kind_t strict)
2442 {
2443 return
2448 }
2455 {
2456 return
2460 }
2462 /* The CANDS are the set of candidates that were considered for
2463 overload resolution. Return the set of viable candidates. If none
2464 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2465 is true if a candidate should be considered viable only if it is
2466 strictly viable. */
2472 {
2483 {
2486 {
2492 }
2493 else
2495 }
2498 }
2500 static bool
2502 {
2507 }
2509 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2510 words, it is about to become the "this" pointer for a member
2511 function call. Take the address of the object. */
2513 static tree
2515 {
2516 /* In a template, we are only concerned about the type of the
2517 expression, so we can take a shortcut. */
2522 }
2524 /* Returns true iff functions are equivalent. Equivalent functions are
2525 not '==' only if one is a function-local extern function or if
2526 both are extern "C". */
2530 {
2535 }
2537 /* Print information about one overload candidate CANDIDATE. MSGSTR
2538 is the text to print before the candidate itself.
2540 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2541 to have been run through gettext by the caller. This wart makes
2542 life simpler in print_z_candidates and for the translators. */
2544 static void
2546 {
2548 {
2558 else
2561 }
2566 else
2568 }
2570 static void
2572 {
2577 /* There may be duplicates in the set of candidates. We put off
2578 checking this condition as long as possible, since we have no way
2579 to eliminate duplicates from a set of functions in less than n^2
2580 time. Now we are about to emit an error message, so it is more
2581 permissible to go slowly. */
2583 {
2585 /* Skip builtin candidates and conversion functions. */
2590 {
2594 else
2596 }
2597 }
2605 {
2606 /* Indent successive candidates by the width of the translation
2607 of the above string. */
2614 do
2615 {
2618 }
2620 }
2621 }
2623 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2624 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2625 the result of the conversion function to convert it to the final
2626 desired type. Merge the two sequences into a single sequence,
2627 and return the merged sequence. */
2631 {
2636 /* Find the end of the second conversion sequence. */
2641 /* Replace the identity conversion with the user conversion
2642 sequence. */
2645 /* The entire sequence is a user-conversion sequence. */
2649 }
2651 /* Returns the best overload candidate to perform the requested
2652 conversion. This function is used for three the overloading situations
2653 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2654 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2655 per [dcl.init.ref], so we ignore temporary bindings. */
2659 {
2669 /* We represent conversion within a hierarchy using RVALUE_CONV and
2670 BASE_CONV, as specified by [over.best.ics]; these become plain
2671 constructor calls, as specified in [dcl.init]. */
2679 {
2684 {
2685 /* [class.conv.fct] A conversion function is never used to
2686 convert a (possibly cv-qualified) object to the (possibly
2687 cv-qualified) same object type (or a reference to it), to a
2688 (possibly cv-qualified) base class of that type (or a
2689 reference to it)... */
2690 }
2691 else
2693 }
2698 /* It's OK to bind a temporary for converting constructor arguments, but
2699 not in converting the return value of a conversion operator. */
2704 {
2705 tree t;
2712 {
2714 /* We still allow more conversions within an init-list. */
2716 /* But not for the copy ctor. */
2717 |LOOKUP_NO_COPY_CTOR_CONVERSION
2719 }
2720 else
2722 /* We should never try to call the abstract or base constructor
2723 from here. */
2727 }
2729 {
2740 flags,
2741 DEDUCE_CALL);
2742 else
2746 flags);
2749 {
2752 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2753 set, then this is copy-initialization. In that case, "The
2754 result of the call is then used to direct-initialize the
2755 object that is the destination of the copy-initialization."
2756 [dcl.init]
2758 We represent this in the conversion sequence with an
2759 rvalue conversion, which means a constructor call. */
2762 cand->second_conv
2764 }
2765 }
2771 {
2772 tree fns;
2775 /* If we are called to convert to a reference type, we are trying to
2776 find an lvalue binding, so don't even consider temporaries. If
2777 we don't find an lvalue binding, the caller will try again to
2778 look for a temporary binding. */
2783 {
2786 /* [over.match.funcs] For conversion functions, the function
2787 is considered to be a member of the class of the implicit
2788 object argument for the purpose of defining the type of
2789 the implicit object parameter.
2791 So we pass fromtype as CTYPE to add_*_candidate. */
2795 NULL_TREE,
2798 conversion_path,
2799 flags,
2800 DEDUCE_CONV);
2801 else
2803 args,
2805 conversion_path,
2806 flags);
2809 {
2810 conversion *ics
2816 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2817 copy-initialization. In that case, "The result of the
2818 call is then used to direct-initialize the object that is
2819 the destination of the copy-initialization." [dcl.init]
2821 We represent this in the conversion sequence with an
2822 rvalue conversion, which means a constructor call. But
2823 don't add a second rvalue conversion if there's already
2824 one there. Which there really shouldn't be, but it's
2825 harmless since we'd add it here anyway. */
2836 }
2837 }
2838 }
2846 {
2848 {
2852 }
2859 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2860 ambiguous conversion is no worse than another user-defined
2861 conversion. */
2864 }
2866 /* Build the user conversion sequence. */
2867 conv = build_conv
2874 /* Combine it with the second conversion sequence. */
2882 }
2884 tree
2886 {
2891 {
2896 }
2898 }
2900 /* Do any initial processing on the arguments to a function call. */
2902 static tree
2904 {
2905 tree t;
2907 {
2913 {
2916 }
2919 }
2921 }
2923 /* Perform overload resolution on FN, which is called with the ARGS.
2925 Return the candidate function selected by overload resolution, or
2926 NULL if the event that overload resolution failed. In the case
2927 that overload resolution fails, *CANDIDATES will be the set of
2928 candidates considered, and ANY_VIABLE_P will be set to true or
2929 false to indicate whether or not any of the candidates were
2930 viable.
2932 The ARGS should already have gone through RESOLVE_ARGS before this
2933 function is called. */
2937 tree args,
2940 {
2948 /* Check FN and ARGS. */
2956 {
2960 }
2962 /* Add the various candidate functions. */
2966 LOOKUP_NORMAL,
2967 candidates);
2975 }
2977 /* Return an expression for a call to FN (a namespace-scope function,
2978 or a static member function) with the ARGS. */
2980 tree
2982 tsubst_flags_t complain)
2983 {
2987 tree result;
2993 /* If this function was found without using argument dependent
2994 lookup, then we want to ignore any undeclared friend
2995 functions. */
2997 {
3002 {
3007 }
3008 }
3010 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3016 {
3018 {
3026 else
3031 }
3033 }
3034 else
3037 /* Free all the conversions we allocated. */
3041 }
3043 /* Build a call to a global operator new. FNNAME is the name of the
3044 operator (either "operator new" or "operator new[]") and ARGS are
3045 the arguments provided. *SIZE points to the total number of bytes
3046 required by the allocation, and is updated if that is changed here.
3047 *COOKIE_SIZE is non-NULL if a cookie should be used. If this
3048 function determines that no cookie should be used, after all,
3049 *COOKIE_SIZE is set to NULL_TREE. If FN is non-NULL, it will be
3050 set, upon return, to the allocation function called. */
3052 tree
3056 {
3057 tree fns;
3069 /* Based on:
3071 [expr.new]
3073 If this lookup fails to find the name, or if the allocated type
3074 is not a class type, the allocation function's name is looked
3075 up in the global scope.
3077 we disregard block-scope declarations of "operator new". */
3080 /* Figure out what function is being called. */
3083 /* If no suitable function could be found, issue an error message
3084 and give up. */
3086 {
3090 else
3096 }
3098 /* If a cookie is required, add some extra space. Whether
3099 or not a cookie is required cannot be determined until
3100 after we know which function was called. */
3102 {
3105 {
3107 /* In G++ 3.2, the check was implemented incorrectly; it
3108 looked at the placement expression, rather than the
3109 type of the function. */
3112 ptr_type_node))
3114 }
3115 else
3116 {
3117 tree arg_types;
3120 /* Skip the size_t parameter. */
3122 /* Check the remaining parameters (if any). */
3126 ptr_type_node))
3128 }
3129 /* If we need a cookie, adjust the number of bytes allocated. */
3131 {
3132 /* Update the total size. */
3134 /* Update the argument list to reflect the adjusted size. */
3136 }
3137 else
3139 }
3141 /* Tell our caller which function we decided to call. */
3145 /* Build the CALL_EXPR. */
3147 }
3149 static tree
3151 {
3160 {
3162 /* It's no good looking for an overloaded operator() on a
3163 pointer-to-member-function. */
3164 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
3166 }
3169 {
3173 }
3174 else
3182 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3186 {
3191 {
3199 else
3200 add_function_candidate
3203 }
3204 }
3209 {
3221 {
3224 add_template_conv_candidate
3228 else
3232 }
3233 }
3237 {
3239 {
3242 }
3244 }
3245 else
3246 {
3249 {
3251 {
3255 }
3257 }
3258 /* Since cand->fn will be a type, not a function, for a conversion
3259 function, we must be careful not to unconditionally look at
3260 DECL_NAME here. */
3264 else
3265 {
3267 complain);
3270 }
3271 }
3273 /* Free all the conversions we allocated. */
3277 }
3279 static void
3282 {
3287 else
3291 {
3315 else
3319 }
3320 }
3322 /* Return the implicit conversion sequence that could be used to
3323 convert E1 to E2 in [expr.cond]. */
3327 {
3333 /* [expr.cond]
3335 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3336 implicitly converted (clause _conv_) to the type "reference to
3337 T2", subject to the constraint that in the conversion the
3338 reference must bind directly (_dcl.init.ref_) to E1. */
3340 {
3342 t1,
3343 e1,
3345 LOOKUP_NO_TEMP_BIND);
3348 }
3350 /* [expr.cond]
3352 If E1 and E2 have class type, and the underlying class types are
3353 the same or one is a base class of the other: E1 can be converted
3354 to match E2 if the class of T2 is the same type as, or a base
3355 class of, the class of T1, and the cv-qualification of T2 is the
3356 same cv-qualification as, or a greater cv-qualification than, the
3357 cv-qualification of T1. If the conversion is applied, E1 is
3358 changed to an rvalue of type T2 that still refers to the original
3359 source class object (or the appropriate subobject thereof). */
3362 {
3364 {
3369 else
3372 }
3373 else
3375 }
3376 else
3377 /* [expr.cond]
3379 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3380 converted to the type that expression E2 would have if E2 were
3381 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3383 LOOKUP_NORMAL);
3384 }
3386 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3387 arguments to the conditional expression. */
3389 tree
3391 tsubst_flags_t complain)
3392 {
3393 tree arg2_type;
3394 tree arg3_type;
3402 /* As a G++ extension, the second argument to the conditional can be
3403 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3404 c'.) If the second operand is omitted, make sure it is
3405 calculated only once. */
3407 {
3412 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3415 else
3417 }
3419 /* [expr.cond]
3421 The first expression is implicitly converted to bool (clause
3422 _conv_). */
3425 /* If something has already gone wrong, just pass that fact up the
3426 tree. */
3432 /* [expr.cond]
3434 If either the second or the third operand has type (possibly
3435 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3436 array-to-pointer (_conv.array_), and function-to-pointer
3437 (_conv.func_) standard conversions are performed on the second
3438 and third operands. */
3442 {
3443 /* Do the conversions. We don't these for `void' type arguments
3444 since it can't have any effect and since decay_conversion
3445 does not handle that case gracefully. */
3453 /* [expr.cond]
3455 One of the following shall hold:
3457 --The second or the third operand (but not both) is a
3458 throw-expression (_except.throw_); the result is of the
3459 type of the other and is an rvalue.
3461 --Both the second and the third operands have type void; the
3462 result is of type void and is an rvalue.
3464 We must avoid calling force_rvalue for expressions of type
3465 "void" because it will complain that their value is being
3466 used. */
3469 {
3474 }
3477 {
3482 }
3485 else
3486 {
3488 {
3491 "is of type %<void%>, "
3492 "but the third operand is neither a throw-expression "
3494 else
3496 "is of type %<void%>, "
3497 "but the second operand is neither a throw-expression "
3499 }
3501 }
3505 }
3506 /* [expr.cond]
3508 Otherwise, if the second and third operand have different types,
3509 and either has (possibly cv-qualified) class type, an attempt is
3510 made to convert each of those operands to the type of the other. */
3513 {
3517 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3523 /* [expr.cond]
3525 If both can be converted, or one can be converted but the
3526 conversion is ambiguous, the program is ill-formed. If
3527 neither can be converted, the operands are left unchanged and
3528 further checking is performed as described below. If exactly
3529 one conversion is possible, that conversion is applied to the
3530 chosen operand and the converted operand is used in place of
3531 the original operand for the remainder of this section. */
3536 {
3540 }
3542 {
3546 /* Even if CONV2 is a valid conversion, the result of the
3547 conversion may be invalid. For example, if ARG3 has type
3548 "volatile X", and X does not have a copy constructor
3549 accepting a "volatile X&", then even if ARG2 can be
3550 converted to X, the conversion will fail. */
3553 }
3555 {
3561 }
3563 /* Free all the conversions we allocated. */
3569 /* If, after the conversion, both operands have class type,
3570 treat the cv-qualification of both operands as if it were the
3571 union of the cv-qualification of the operands.
3573 The standard is not clear about what to do in this
3574 circumstance. For example, if the first operand has type
3575 "const X" and the second operand has a user-defined
3576 conversion to "volatile X", what is the type of the second
3577 operand after this step? Making it be "const X" (matching
3578 the first operand) seems wrong, as that discards the
3579 qualification without actually performing a copy. Leaving it
3580 as "volatile X" seems wrong as that will result in the
3581 conditional expression failing altogether, even though,
3582 according to this step, the one operand could be converted to
3583 the type of the other. */
3591 }
3593 /* [expr.cond]
3595 If the second and third operands are lvalues and have the same
3596 type, the result is of that type and is an lvalue. */
3600 {
3603 }
3605 /* [expr.cond]
3607 Otherwise, the result is an rvalue. If the second and third
3608 operand do not have the same type, and either has (possibly
3609 cv-qualified) class type, overload resolution is used to
3610 determine the conversions (if any) to be applied to the operands
3611 (_over.match.oper_, _over.built_). */
3615 {
3620 /* Rearrange the arguments so that add_builtin_candidate only has
3621 to know about two args. In build_builtin_candidates, the
3622 arguments are unscrambled. */
3627 COND_EXPR,
3628 NOP_EXPR,
3630 args,
3631 LOOKUP_NORMAL);
3633 /* [expr.cond]
3635 If the overload resolution fails, the program is
3636 ill-formed. */
3639 {
3641 {
3644 }
3646 }
3649 {
3651 {
3654 }
3656 }
3658 /* [expr.cond]
3660 Otherwise, the conversions thus determined are applied, and
3661 the converted operands are used in place of the original
3662 operands for the remainder of this section. */
3669 }
3671 /* [expr.cond]
3673 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3674 and function-to-pointer (_conv.func_) standard conversions are
3675 performed on the second and third operands.
3677 We need to force the lvalue-to-rvalue conversion here for class types,
3678 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3679 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3680 regions. */
3693 /* [expr.cond]
3695 After those conversions, one of the following shall hold:
3697 --The second and third operands have the same type; the result is of
3698 that type. */
3701 /* [expr.cond]
3703 --The second and third operands have arithmetic or enumeration
3704 type; the usual arithmetic conversions are performed to bring
3705 them to a common type, and the result is of that type. */
3710 {
3711 /* In this case, there is always a common type. */
3713 arg3_type);
3717 {
3722 }
3728 {
3732 }
3736 }
3737 /* [expr.cond]
3739 --The second and third operands have pointer type, or one has
3740 pointer type and the other is a null pointer constant; pointer
3741 conversions (_conv.ptr_) and qualification conversions
3742 (_conv.qual_) are performed to bring them to their composite
3743 pointer type (_expr.rel_). The result is of the composite
3744 pointer type.
3746 --The second and third operands have pointer to member type, or
3747 one has pointer to member type and the other is a null pointer
3748 constant; pointer to member conversions (_conv.mem_) and
3749 qualification conversions (_conv.qual_) are performed to bring
3750 them to a common type, whose cv-qualification shall match the
3751 cv-qualification of either the second or the third operand.
3752 The result is of the common type. */
3760 {
3763 complain);
3768 }
3771 {
3776 }
3778 valid_operands:
3781 /* We can't use result_type below, as fold might have returned a
3782 throw_expr. */
3785 {
3786 /* Expand both sides into the same slot, hopefully the target of
3787 the ?: expression. We used to check for TARGET_EXPRs here,
3788 but now we sometimes wrap them in NOP_EXPRs so the test would
3789 fail. */
3792 /* If this expression is an rvalue, but might be mistaken for an
3793 lvalue, we must add a NON_LVALUE_EXPR. */
3795 }
3798 }
3800 /* OPERAND is an operand to an expression. Perform necessary steps
3801 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3802 returned. */
3804 static tree
3806 {
3808 {
3811 /* Make sure the template type is instantiated now. */
3813 }
3816 }
3818 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3819 OVERLOAD) to the CANDIDATES, returning an updated list of
3820 CANDIDATES. The ARGS are the arguments provided to the call,
3821 without any implicit object parameter. The EXPLICIT_TARGS are
3822 explicit template arguments provided. TEMPLATE_ONLY is true if
3823 only template functions should be considered. CONVERSION_PATH,
3824 ACCESS_PATH, and FLAGS are as for add_function_candidate. */
3826 static void
3832 {
3833 tree ctype;
3834 tree non_static_args;
3837 /* Delay creating the implicit this parameter until it is needed. */
3841 {
3842 tree fn;
3843 tree fn_args;
3846 /* Figure out which set of arguments to use. */
3848 {
3849 /* If this function is a non-static member, prepend the implicit
3850 object parameter. */
3856 }
3857 else
3858 /* Otherwise, just use the list of arguments provided. */
3863 fn,
3864 ctype,
3865 explicit_targs,
3866 fn_args,
3867 NULL_TREE,
3868 access_path,
3869 conversion_path,
3870 flags,
3871 DEDUCE_CALL);
3874 fn,
3875 ctype,
3876 fn_args,
3877 access_path,
3878 conversion_path,
3879 flags);
3881 }
3882 }
3884 tree
3887 {
3906 {
3910 }
3911 else
3917 {
3922 /* Use build_op_new_call and build_op_delete_call instead. */
3936 }
3942 {
3949 }
3964 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3967 /* Add namespace-scope operators to the list of functions to
3968 consider. */
3972 /* Add class-member operators to the candidate set. */
3974 {
3975 tree fns;
3979 {
3982 }
3989 }
3991 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
3992 to know about two args; a builtin candidate will always have a first
3993 parameter of type bool. We'll handle that in
3994 build_builtin_candidate. */
3996 {
4000 }
4001 else
4002 {
4006 }
4011 {
4014 /* For these, the built-in candidates set is empty
4015 [over.match.oper]/3. We don't want non-strict matches
4016 because exact matches are always possible with built-in
4017 operators. The built-in candidate set for COMPONENT_REF
4018 would be empty too, but since there are no such built-in
4019 operators, we accept non-strict matches for them. */
4026 }
4030 {
4032 {
4035 /* Don't try anything fancy if we're not allowed to produce
4036 errors. */
4040 /* Look for an `operator++ (int)'. If they didn't have
4041 one, then we fall back to the old way of doing things. */
4045 fnname,
4049 else
4055 /* The caller will deal with these. */
4065 {
4068 }
4071 }
4072 }
4073 else
4074 {
4077 {
4079 {
4082 }
4084 }
4086 {
4092 else
4094 }
4095 else
4096 {
4097 /* Give any warnings we noticed during overload resolution. */
4099 {
4103 }
4105 /* Check for comparison of different enum types. */
4107 {
4119 {
4123 }
4127 }
4129 /* We need to strip any leading REF_BIND so that bitfields
4130 don't cause errors. This should not remove any important
4131 conversions, because builtins don't apply to class
4132 objects directly. */
4138 {
4143 }
4145 {
4150 }
4153 {
4157 }
4158 }
4159 }
4161 user_defined_result_ready:
4163 /* Free all the conversions we allocated. */
4169 builtin:
4171 {
4224 complain),
4225 arg2);
4227 /* The caller will deal with these. */
4235 }
4237 }
4239 /* Build a call to operator delete. This has to be handled very specially,
4240 because the restrictions on what signatures match are different from all
4241 other call instances. For a normal delete, only a delete taking (void *)
4242 or (void *, size_t) is accepted. For a placement delete, only an exact
4243 match with the placement new is accepted.
4245 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4246 ADDR is the pointer to be deleted.
4247 SIZE is the size of the memory block to be deleted.
4248 GLOBAL_P is true if the delete-expression should not consider
4249 class-specific delete operators.
4250 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4252 If this call to "operator delete" is being generated as part to
4253 deallocate memory allocated via a new-expression (as per [expr.new]
4254 which requires that if the initialization throws an exception then
4255 we call a deallocation function), then ALLOC_FN is the allocation
4256 function. */
4258 tree
4261 tree alloc_fn)
4262 {
4277 /* In [class.free]
4279 If the result of the lookup is ambiguous or inaccessible, or if
4280 the lookup selects a placement deallocation function, the
4281 program is ill-formed.
4283 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4284 {
4288 }
4289 else
4295 /* Strip const and volatile from addr. */
4299 {
4300 /* Get the parameter types for the allocation function that is
4301 being called. */
4304 }
4305 else
4306 {
4307 /* First try it without the size argument. */
4309 }
4311 /* We make two tries at finding a matching `operator delete'. On
4312 the first pass, we look for a one-operator (or placement)
4313 operator delete. If we're not doing placement delete, then on
4314 the second pass we look for a two-argument delete. */
4316 {
4317 /* Go through the `operator delete' functions looking for one
4318 with a matching type. */
4320 fn;
4322 {
4323 tree t;
4325 /* The first argument must be "void *". */
4330 /* On the first pass, check the rest of the arguments. */
4332 {
4335 {
4340 }
4343 }
4344 /* On the second pass, look for a function with exactly two
4345 arguments: "void *" and "size_t". */
4347 /* For "operator delete(void *, ...)" there will be
4348 no second argument, but we will not get an exact
4349 match above. */
4350 && t
4354 }
4356 /* If we found a match, we're done. */
4359 }
4361 /* If we have a matching function, call it. */
4363 {
4364 /* Make sure we have the actual function, and not an
4365 OVERLOAD. */
4368 /* If the FN is a member function, make sure that it is
4369 accessible. */
4374 {
4375 /* The placement args might not be suitable for overload
4376 resolution at this point, so build the call directly. */
4385 }
4386 else
4387 {
4388 tree args;
4391 else
4395 }
4396 }
4398 /* [expr.new]
4400 If no unambiguous matching deallocation function can be found,
4401 propagating the exception does not cause the object's memory to
4402 be freed. */
4404 {
4407 alloc_fn);
4409 }
4414 }
4416 /* If the current scope isn't allowed to access DECL along
4417 BASETYPE_PATH, give an error. The most derived class in
4418 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4419 the declaration to use in the error diagnostic. */
4421 bool
4423 {
4427 {
4432 else
4436 }
4439 }
4441 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4442 bitwise or of LOOKUP_* values. If any errors are warnings are
4443 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4444 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4445 to NULL. */
4447 static tree
4450 {
4455 complete_ctor_identifier,
4462 else
4465 }
4467 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4468 EXPR is implicitly converted to type TOTYPE.
4469 FN and ARGNUM are used for diagnostics. */
4471 static void
4473 {
4476 /* Issue warnings about peculiar, but valid, uses of NULL. */
4478 {
4482 else
4484 }
4486 /* Issue warnings if "false" is converted to a NULL pointer */
4491 }
4493 /* Perform the conversions in CONVS on the expression EXPR. FN and
4494 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4495 indicates the `this' argument of a method. INNER is nonzero when
4496 being called to continue a conversion chain. It is negative when a
4497 reference binding will be applied, positive otherwise. If
4498 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4499 conversions will be emitted if appropriate. If C_CAST_P is true,
4500 this conversion is coming from a C-style cast; in that case,
4501 conversions to inaccessible bases are permitted. */
4503 static tree
4507 {
4509 diagnostic_t diag_kind;
4518 {
4521 {
4523 {
4527 complain);
4529 }
4534 complain);
4537 }
4539 {
4543 }
4544 else
4548 }
4554 {
4556 {
4561 /* When converting from an init list we consider explicit
4562 constructors, but actually trying to call one is an error. */
4564 {
4568 else
4570 }
4572 /* Set user_conv_p on the argument conversions, so rvalue/base
4573 handling knows not to allow any more UDCs. */
4579 /* If this is a constructor or a function returning an aggr type,
4580 we need to build up a TARGET_EXPR. */
4585 }
4589 /* Convert a constant to its underlying value, unless we are
4590 about to bind it to a reference, in which case we need to
4591 leave it as an lvalue. */
4593 {
4596 /* If __null has been converted to an integer type, we do not
4597 want to warn about uses of EXPR as an integer, rather than
4598 as a pointer. */
4600 }
4603 /* Call build_user_type_conversion again for the error. */
4604 return build_user_type_conversion
4608 {
4609 /* Conversion to std::initializer_list<T>. */
4616 /* Convert all the elements. */
4618 {
4625 }
4626 /* Build up the array. */
4627 elttype = cp_build_qualified_type
4634 /* Call the private constructor. */
4636 new_ctor = build_special_member_call
4640 }
4647 };
4652 c_cast_p,
4653 complain);
4658 {
4663 /* Else fall through. */
4666 {
4667 /* We are going to bind a reference directly to a base-class
4668 subobject of EXPR. */
4669 /* Build an expression for `*((base*) &expr)'. */
4675 }
4677 /* Copy-initialization where the cv-unqualified version of the source
4678 type is the same class as, or a derived class of, the class of the
4679 destination [is treated as direct-initialization]. [dcl.init] */
4682 /* This conversion is being done in the context of a user-defined
4683 conversion (i.e. the second step of copy-initialization), so
4684 don't allow any more. */
4688 {
4694 }
4698 {
4701 /* If necessary, create a temporary.
4703 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
4704 that need temporaries, even when their types are reference
4705 compatible with the type of reference being bound, so the
4706 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
4707 doesn't fail. */
4711 {
4717 {
4719 {
4720 /* If the reference is volatile or non-const, we
4721 cannot create a temporary. */
4728 else
4730 }
4732 }
4733 /* If the source is a packed field, and we must use a copy
4734 constructor, then building the target expr will require
4735 binding the field to the reference parameter to the
4736 copy constructor, and we'll end up with an infinite
4737 loop. If we can use a bitwise copy, then we'll be
4738 OK. */
4742 {
4747 }
4749 {
4752 }
4754 }
4756 /* Take the address of the thing to which we will bind the
4757 reference. */
4762 /* Convert it to a pointer to the type referred to by the
4763 reference. This will adjust the pointer if a derived to
4764 base conversion is being performed. */
4766 expr);
4767 /* Convert the pointer to the desired reference type. */
4769 }
4775 /* Warn about deprecated conversion if appropriate. */
4787 c_cast_p);
4791 }
4798 else
4802 }
4804 /* Build a call to __builtin_trap. */
4806 static tree
4808 {
4814 }
4816 /* ARG is being passed to a varargs function. Perform any conversions
4817 required. Return the converted value. */
4819 tree
4821 {
4822 /* [expr.call]
4824 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
4825 standard conversions are performed. */
4827 /* [expr.call]
4829 If the argument has integral or enumeration type that is subject
4830 to the integral promotions (_conv.prom_), or a floating point
4831 type that is subject to the floating point promotion
4832 (_conv.fpprom_), the value of the argument is converted to the
4833 promoted type before the call. */
4845 {
4846 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
4847 here and do a bitwise copy, but now cp_expr_size will abort if we
4848 try to do that.
4849 If the call appears in the context of a sizeof expression,
4850 there is no need to emit a warning, since the expression won't be
4851 evaluated. We keep the builtin_trap just as a safety check. */
4857 integer_zero_node);
4858 }
4861 }
4863 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
4865 tree
4867 {
4877 {
4878 /* Remove reference types so we don't ICE later on. */
4880 /* Undefined behavior [expr.call] 5.2.2/7. */
4888 }
4891 }
4893 /* TYPE has been given to va_arg. Apply the default conversions which
4894 would have happened when passed via ellipsis. Return the promoted
4895 type, or the passed type if there is no change. */
4897 tree
4899 {
4900 tree promote;
4902 /* Perform the array-to-pointer and function-to-pointer
4903 conversions. */
4911 }
4913 /* ARG is a default argument expression being passed to a parameter of
4914 the indicated TYPE, which is a parameter to FN. Do any required
4915 conversions. Return the converted value. */
4919 tree
4921 {
4923 tree t;
4925 /* If the ARG is an unparsed default argument expression, the
4926 conversion cannot be performed. */
4928 {
4933 }
4935 /* Detect recursion. */
4938 {
4941 }
4950 {
4954 tf_warning_or_error);
4955 }
4956 else
4957 {
4958 /* We must make a copy of ARG, in case subsequent processing
4959 alters any part of it. For example, during gimplification a
4960 cast of the form (T) &X::f (where "f" is a member function)
4961 will lead to replacing the PTRMEM_CST for &X::f with a
4962 VAR_DECL. We can avoid the copy for constants, since they
4963 are never modified in place. */
4968 tf_warning_or_error);
4970 }
4975 }
4977 /* Returns the type which will really be used for passing an argument of
4978 type TYPE. */
4980 tree
4982 {
4983 /* Pass classes with copy ctors by invisible reference. */
4985 {
4987 /* There are no other pointers to this temporary. */
4989 }
4998 }
5000 /* Actually perform the appropriate conversion. */
5002 tree
5004 {
5005 tree bitfield_type;
5007 /* If VAL is a bitfield, then -- since it has already been converted
5008 to TYPE -- it cannot have a precision greater than TYPE.
5010 If it has a smaller precision, we must widen it here. For
5011 example, passing "int f:3;" to a function expecting an "int" will
5012 not result in any conversion before this point.
5014 If the precision is the same we must not risk widening. For
5015 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5016 often have type "int", even though the C++ type for the field is
5017 "long long". If the value is being passed to a function
5018 expecting an "int", then no conversions will be required. But,
5019 if we call convert_bitfield_to_declared_type, the bitfield will
5020 be converted to "long long". */
5027 ;
5028 /* Pass classes with copy ctors by invisible reference. */
5038 {
5047 }
5049 }
5051 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5052 which no conversions at all should be done. This is true for some
5053 builtins which don't act like normal functions. */
5055 static bool
5057 {
5060 {
5070 }
5073 }
5075 /* Subroutine of the various build_*_call functions. Overload resolution
5076 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5077 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5078 bitmask of various LOOKUP_* flags which apply to the call itself. */
5080 static tree
5082 {
5097 /* In a template, there is no need to perform all of the work that
5098 is normally done. We are only interested in the type of the call
5099 expression, i.e., the return type of the function. Any semantic
5100 errors will be deferred until the template is instantiated. */
5102 {
5103 tree expr;
5104 tree return_type;
5112 }
5114 /* Give any warnings we noticed during overload resolution. */
5116 {
5120 }
5122 /* Make =delete work with SFINAE. */
5127 {
5128 /* If FN is a template function, two cases must be considered.
5129 For example:
5131 struct A {
5132 protected:
5133 template <class T> void f();
5134 };
5135 template <class T> struct B {
5136 protected:
5137 void g();
5138 };
5139 struct C : A, B<int> {
5140 using A::f; // #1
5141 using B<int>::g; // #2
5142 };
5144 In case #1 where `A::f' is a member template, DECL_ACCESS is
5145 recorded in the primary template but not in its specialization.
5146 We check access of FN using its primary template.
5148 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5149 because it is a member of class template B, DECL_ACCESS is
5150 recorded in the specialization `B<int>::g'. We cannot use its
5151 primary template because `B<T>::g' and `B<int>::g' may have
5152 different access. */
5157 else
5159 }
5165 /* Find maximum size of vector to hold converted arguments. */
5172 /* The implicit parameters to a constructor are not considered by overload
5173 resolution, and must be of the proper type. */
5175 {
5179 /* We should never try to call the abstract constructor. */
5183 {
5187 }
5188 }
5189 /* Bypass access control for 'this' parameter. */
5191 {
5194 tree converted_arg;
5195 tree base_binfo;
5198 {
5202 else
5204 }
5206 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5207 X is called for an object that is not of type X, or of a type
5208 derived from X, the behavior is undefined.
5210 So we can assume that anything passed as 'this' is non-null, and
5211 optimize accordingly. */
5213 /* Convert to the base in which the function was declared. */
5219 /* Check that the base class is accessible. */
5225 /* If fn was found by a using declaration, the conversion path
5226 will be to the derived class, not the base declaring fn. We
5227 must convert from derived to base. */
5238 }
5242 {
5247 /* Don't make a copy here if build_call is going to. */
5253 val = convert_like_with_context
5259 else
5261 }
5263 /* Default arguments */
5268 /* Ellipsis */
5270 {
5274 else
5277 }
5285 /* Avoid actually calling copy constructors and copy assignment operators,
5286 if possible. */
5293 {
5294 tree targ;
5297 /* Pull out the real argument, disregarding const-correctness. */
5303 {
5308 }
5309 else
5314 else
5317 /* [class.copy]: the copy constructor is implicitly defined even if
5318 the implementation elided its use. */
5320 {
5323 }
5325 /* If we're creating a temp and we already have one, don't create a
5326 new one. If we're not creating a temp but we get one, use
5327 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5328 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5329 temp or an INIT_EXPR otherwise. */
5331 {
5336 }
5340 {
5341 tree to = stabilize_reference
5346 }
5347 }
5351 {
5352 tree to = stabilize_reference
5359 {
5362 }
5363 else
5364 {
5365 /* We must only copy the non-tail padding parts.
5366 Use __builtin_memcpy for the bitwise copy. */
5378 }
5381 }
5387 {
5388 tree t;
5394 /* Warn about deprecated virtual functions now, since we're about
5395 to throw away the decl. */
5405 else
5408 }
5409 else
5413 }
5415 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5416 This function performs no overload resolution, conversion, or other
5417 high-level operations. */
5419 tree
5421 {
5422 tree fndecl;
5426 /* If this call might throw an exception, note that fact. */
5433 /* Check that arguments to builtin functions match the expectations. */
5440 /* Some built-in function calls will be evaluated at compile-time in
5441 fold (). */
5454 }
5458 /* Make an expression which yields the address of the Java interface
5459 method FN. This is achieved by generating a call to libjava's
5460 _Jv_LookupInterfaceMethodIdx(). */
5462 static tree
5464 {
5470 {
5475 endlink)));
5476 java_iface_lookup_fn
5480 }
5482 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5483 This is the first entry in the vtable. */
5485 tf_warning_or_error),
5486 integer_zero_node);
5488 /* Get the java.lang.Class pointer for the interface being called. */
5493 {
5495 iface);
5497 }
5501 /* Determine the itable index of FN. */
5504 {
5509 i++;
5510 }
5515 java_iface_lookup_fn);
5518 }
5520 /* Returns the value to use for the in-charge parameter when making a
5521 call to a function with the indicated NAME.
5523 FIXME:Can't we find a neater way to do this mapping? */
5525 tree
5527 {
5538 /* This function should only be called with one of the names listed
5539 above. */
5542 }
5544 /* Build a call to a constructor, destructor, or an assignment
5545 operator for INSTANCE, an expression with class type. NAME
5546 indicates the special member function to call; ARGS are the
5547 arguments. BINFO indicates the base of INSTANCE that is to be
5548 passed as the `this' parameter to the member function called.
5550 FLAGS are the LOOKUP_* flags to use when processing the call.
5552 If NAME indicates a complete object constructor, INSTANCE may be
5553 NULL_TREE. In this case, the caller will call build_cplus_new to
5554 store the newly constructed object into a VAR_DECL. */
5556 tree
5559 {
5560 tree fns;
5561 /* The type of the subobject to be constructed or destroyed. */
5562 tree class_type;
5571 {
5572 /* Resolve the name. */
5577 }
5583 /* Handle the special case where INSTANCE is NULL_TREE. */
5585 {
5588 }
5589 else
5590 {
5596 /* Convert to the base class, if necessary. */
5599 {
5601 /* For constructors and destructors, either the base is
5602 non-virtual, or it is virtual but we are doing the
5603 conversion from a constructor or destructor for the
5604 complete object. In either case, we can convert
5605 statically. */
5607 else
5608 /* However, for assignment operators, we must convert
5609 dynamically if the base is virtual. */
5612 }
5613 }
5619 /* When making a call to a constructor or destructor for a subobject
5620 that uses virtual base classes, pass down a pointer to a VTT for
5621 the subobject. */
5625 {
5626 tree vtt;
5627 tree sub_vtt;
5629 /* If the current function is a complete object constructor
5630 or destructor, then we fetch the VTT directly.
5631 Otherwise, we look it up using the VTT we were given. */
5637 current_vtt_parm,
5638 vtt);
5644 }
5649 complain);
5650 }
5652 /* Return the NAME, as a C string. The NAME indicates a function that
5653 is a member of TYPE. *FREE_P is set to true if the caller must
5654 free the memory returned.
5656 Rather than go through all of this, we should simply set the names
5657 of constructors and destructors appropriately, and dispense with
5658 ctor_identifier, dtor_identifier, etc. */
5662 {
5665 /* Assume that we will not allocate memory. */
5667 /* Constructors and destructors are special. */
5669 {
5670 pretty_name
5672 /* For a destructor, add the '~'. */
5676 {
5678 /* Remember that we need to free the memory allocated. */
5680 }
5681 }
5683 {
5686 TFF_PLAIN_IDENTIFIER),
5687 NULL);
5688 /* Remember that we need to free the memory allocated. */
5690 }
5691 else
5695 }
5697 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
5698 be set, upon return, to the function called. */
5700 tree
5704 {
5708 tree access_binfo;
5709 tree optype;
5711 tree name;
5712 tree user_args;
5713 tree call;
5714 tree fn;
5715 tree class_type;
5718 tree orig_instance;
5719 tree orig_fns;
5720 tree orig_args;
5725 /* We don't know what function we're going to call, yet. */
5735 {
5739 }
5745 /* Dismantle the baselink to collect all the information we need. */
5752 {
5756 }
5767 {
5770 }
5772 /* The USER_ARGS are the arguments we will display to users if an
5773 error occurs. The USER_ARGS should not include any
5774 compiler-generated arguments. The "this" pointer hasn't been
5775 added yet. However, we must remove the VTT pointer if this is a
5776 call to a base-class constructor or destructor. */
5779 {
5780 /* Callers should explicitly indicate whether they want to construct
5781 the complete object or just the part without virtual bases. */
5783 /* Similarly for destructors. */
5785 /* Remove the VTT pointer, if present. */
5789 }
5791 /* Process the argument list. */
5798 /* It's OK to call destructors and constructors on cv-qualified objects.
5799 Therefore, convert the INSTANCE_PTR to the unqualified type, if
5800 necessary. */
5803 {
5807 }
5811 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
5812 initializer, not T({ }). If the type doesn't have a list ctor,
5813 break apart the list into separate ctor args. */
5818 {
5821 }
5826 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5830 {
5832 tree this_arglist;
5834 /* We can end up here for copy-init of same or base class. */
5841 else
5845 /* A member template. */
5847 class_type,
5848 explicit_targs,
5850 access_binfo,
5851 conversion_path,
5852 flags,
5853 DEDUCE_CALL);
5856 class_type,
5857 this_arglist,
5858 access_binfo,
5859 conversion_path,
5860 flags);
5861 }
5865 {
5867 {
5870 else
5871 {
5881 }
5883 }
5885 }
5886 else
5887 {
5890 {
5895 {
5898 user_args);
5902 }
5904 }
5905 else
5906 {
5915 /* This is not an error, it is runtime undefined
5916 behavior. */
5918 "abstract virtual %q#D called from constructor"
5920 fn);
5924 {
5927 fn);
5929 }
5930 else
5931 {
5935 /* Now we know what function is being called. */
5938 /* Build the actual CALL_EXPR. */
5940 /* In an expression of the form `a->f()' where `f' turns
5941 out to be a static member function, `a' is
5942 none-the-less evaluated. */
5951 /* An explicit call of the form "x->~X()" has type
5952 "void". However, on platforms where destructors
5953 return "this" (i.e., those where
5954 targetm.cxx.cdtor_returns_this is true), such calls
5955 will appear to have a return value of pointer type
5956 to the low-level call machinery. We do not want to
5957 change the low-level machinery, since we want to be
5958 able to optimize "delete f()" on such platforms as
5959 "operator delete(~X(f()))" (rather than generating
5960 "t = f(), ~X(t), operator delete (t)"). */
5962 }
5963 }
5964 }
5967 call = (build_min_non_dep_call_list
5970 orig_args));
5972 /* Free all the conversions we allocated. */
5976 }
5978 /* Returns true iff standard conversion sequence ICS1 is a proper
5979 subsequence of ICS2. */
5981 static bool
5983 {
5984 /* We can assume that a conversion of the same code
5985 between the same types indicates a subsequence since we only get
5986 here if the types we are converting from are the same. */
5993 {
6001 /* At this point, ICS1 cannot be a proper subsequence of
6002 ICS2. We can get a USER_CONV when we are comparing the
6003 second standard conversion sequence of two user conversion
6004 sequences. */
6014 }
6015 }
6017 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6018 be any _TYPE nodes. */
6020 bool
6022 {
6026 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6027 considers every class derived from itself. */
6030 }
6032 /* We build the ICS for an implicit object parameter as a pointer
6033 conversion sequence. However, such a sequence should be compared
6034 as if it were a reference conversion sequence. If ICS is the
6035 implicit conversion sequence for an implicit object parameter,
6036 modify it accordingly. */
6038 static void
6040 {
6042 {
6043 /* [over.match.funcs]
6045 For non-static member functions, the type of the
6046 implicit object parameter is "reference to cv X"
6047 where X is the class of which the function is a
6048 member and cv is the cv-qualification on the member
6049 function declaration. */
6051 tree reference_type;
6053 /* The `this' parameter is a pointer to a class type. Make the
6054 implicit conversion talk about a reference to that same class
6055 type. */
6068 }
6069 }
6071 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6072 and return the initial reference binding conversion. Otherwise,
6073 leave *ICS unchanged and return NULL. */
6077 {
6079 {
6085 }
6088 }
6090 /* Compare two implicit conversion sequences according to the rules set out in
6091 [over.ics.rank]. Return values:
6093 1: ics1 is better than ics2
6094 -1: ics2 is better than ics1
6095 0: ics1 and ics2 are indistinguishable */
6097 static int
6099 {
6100 tree from_type1;
6101 tree from_type2;
6102 tree to_type1;
6103 tree to_type2;
6110 /* REF_BINDING is nonzero if the result of the conversion sequence
6111 is a reference type. In that case REF_CONV is the reference
6112 binding conversion. */
6116 /* Handle implicit object parameters. */
6120 /* Handle reference parameters. */
6124 /* [over.ics.rank]
6126 When comparing the basic forms of implicit conversion sequences (as
6127 defined in _over.best.ics_)
6129 --a standard conversion sequence (_over.ics.scs_) is a better
6130 conversion sequence than a user-defined conversion sequence
6131 or an ellipsis conversion sequence, and
6133 --a user-defined conversion sequence (_over.ics.user_) is a
6134 better conversion sequence than an ellipsis conversion sequence
6135 (_over.ics.ellipsis_). */
6145 {
6146 /* XXX Isn't this an extension? */
6147 /* Both ICS are bad. We try to make a decision based on what
6148 would have happened if they'd been good. */
6156 /* We couldn't make up our minds; try to figure it out below. */
6157 }
6160 /* Both conversions are ellipsis conversions. */
6163 /* User-defined conversion sequence U1 is a better conversion sequence
6164 than another user-defined conversion sequence U2 if they contain the
6165 same user-defined conversion operator or constructor and if the sec-
6166 ond standard conversion sequence of U1 is better than the second
6167 standard conversion sequence of U2. */
6170 {
6181 /* Conversion to std::initializer_list is better than other
6182 user-defined conversions. */
6185 {
6190 else
6192 }
6197 /* We can just fall through here, after setting up
6198 FROM_TYPE1 and FROM_TYPE2. */
6201 }
6202 else
6203 {
6207 /* We're dealing with two standard conversion sequences.
6209 [over.ics.rank]
6211 Standard conversion sequence S1 is a better conversion
6212 sequence than standard conversion sequence S2 if
6214 --S1 is a proper subsequence of S2 (comparing the conversion
6215 sequences in the canonical form defined by _over.ics.scs_,
6216 excluding any Lvalue Transformation; the identity
6217 conversion sequence is considered to be a subsequence of
6218 any non-identity conversion sequence */
6229 }
6231 /* One sequence can only be a subsequence of the other if they start with
6232 the same type. They can start with different types when comparing the
6233 second standard conversion sequence in two user-defined conversion
6234 sequences. */
6236 {
6241 }
6243 /* [over.ics.rank]
6245 Or, if not that,
6247 --the rank of S1 is better than the rank of S2 (by the rules
6248 defined below):
6250 Standard conversion sequences are ordered by their ranks: an Exact
6251 Match is a better conversion than a Promotion, which is a better
6252 conversion than a Conversion.
6254 Two conversion sequences with the same rank are indistinguishable
6255 unless one of the following rules applies:
6257 --A conversion that is not a conversion of a pointer, or pointer
6258 to member, to bool is better than another conversion that is such
6259 a conversion.
6261 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6262 so that we do not have to check it explicitly. */
6271 /* A conversion from scalar arithmetic type to complex is worse than a
6272 conversion between scalar arithmetic types. */
6279 {
6282 else
6284 }
6290 {
6295 }
6296 /* The rules for pointers to members A::* are just like the rules
6297 for pointers A*, except opposite: if B is derived from A then
6298 A::* converts to B::*, not vice versa. For that reason, we
6299 switch the from_ and to_ variables here. */
6306 {
6311 }
6316 {
6317 /* This was one of the pointer or pointer-like conversions.
6319 [over.ics.rank]
6321 --If class B is derived directly or indirectly from class A,
6322 conversion of B* to A* is better than conversion of B* to
6323 void*, and conversion of A* to void* is better than
6324 conversion of B* to void*. */
6327 {
6329 deref_from_type2))
6332 deref_from_type1))
6334 }
6337 {
6339 {
6341 {
6343 deref_to_type1))
6345 }
6346 /* We know that DEREF_TO_TYPE1 is `void' here. */
6348 deref_to_type2))
6350 }
6351 }
6354 {
6355 /* [over.ics.rank]
6357 --If class B is derived directly or indirectly from class A
6358 and class C is derived directly or indirectly from B,
6360 --conversion of C* to B* is better than conversion of C* to
6361 A*,
6363 --conversion of B* to A* is better than conversion of C* to
6364 A* */
6366 {
6368 deref_to_type2))
6371 deref_to_type1))
6373 }
6375 {
6377 deref_from_type1))
6380 deref_from_type2))
6382 }
6383 }
6384 }
6387 {
6390 /* [over.ics.rank]
6392 --binding of an expression of type C to a reference of type
6393 B& is better than binding an expression of type C to a
6394 reference of type A&
6396 --conversion of C to B is better than conversion of C to A, */
6399 {
6404 }
6405 }
6408 {
6411 /* [over.ics.rank]
6413 --binding of an expression of type B to a reference of type
6414 A& is better than binding an expression of type C to a
6415 reference of type A&,
6417 --conversion of B to A is better than conversion of C to A */
6420 {
6425 }
6426 }
6428 /* [over.ics.rank]
6430 --S1 and S2 differ only in their qualification conversion and yield
6431 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6432 qualification signature of type T1 is a proper subset of the cv-
6433 qualification signature of type T2 */
6437 {
6441 }
6443 /* [over.ics.rank]
6445 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6446 to an implicit object parameter, and either S1 binds an lvalue reference
6447 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6448 reference to an rvalue and S2 binds an lvalue reference
6449 (C++0x draft standard, 13.3.3.2)
6451 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6452 types to which the references refer are the same type except for
6453 top-level cv-qualifiers, and the type to which the reference
6454 initialized by S2 refers is more cv-qualified than the type to
6455 which the reference initialized by S1 refers */
6458 {
6462 {
6467 }
6472 }
6474 /* Neither conversion sequence is better than the other. */
6476 }
6478 /* The source type for this standard conversion sequence. */
6480 static tree
6482 {
6484 {
6489 }
6491 }
6493 /* Note a warning about preferring WINNER to LOSER. We do this by storing
6494 a pointer to LOSER and re-running joust to produce the warning if WINNER
6495 is actually used. */
6497 static void
6499 {
6505 }
6507 /* Compare two candidates for overloading as described in
6508 [over.match.best]. Return values:
6510 1: cand1 is better than cand2
6511 -1: cand2 is better than cand1
6512 0: cand1 and cand2 are indistinguishable */
6514 static int
6516 {
6522 /* Candidates that involve bad conversions are always worse than those
6523 that don't. */
6529 /* If we have two pseudo-candidates for conversions to the same type,
6530 or two candidates for the same function, arbitrarily pick one. */
6535 /* a viable function F1
6536 is defined to be a better function than another viable function F2 if
6537 for all arguments i, ICSi(F1) is not a worse conversion sequence than
6538 ICSi(F2), and then */
6540 /* for some argument j, ICSj(F1) is a better conversion sequence than
6541 ICSj(F2) */
6543 /* For comparing static and non-static member functions, we ignore
6544 the implicit object parameter of the non-static function. The
6545 standard says to pretend that the static function has an object
6546 parm, but that won't work with operator overloading. */
6549 {
6557 else
6558 {
6561 }
6562 }
6565 {
6571 {
6584 {
6591 else
6596 {
6600 }
6601 else
6603 }
6606 {
6609 }
6611 }
6612 }
6614 /* warn about confusing overload resolution for user-defined conversions,
6615 either between a constructor and a conversion op, or between two
6616 conversion ops. */
6620 {
6626 else
6629 /* We don't want to complain about `X::operator T1 ()'
6630 beating `X::operator T2 () const', when T2 is a no less
6631 cv-qualified version of T1. */
6634 {
6639 {
6642 }
6645 }
6646 else
6652 {
6659 {
6661 }
6662 }
6663 else
6665 }
6670 /* or, if not that,
6671 F1 is a non-template function and F2 is a template function
6672 specialization. */
6679 /* or, if not that,
6680 F1 and F2 are template functions and the function template for F1 is
6681 more specialized than the template for F2 according to the partial
6682 ordering rules. */
6685 {
6686 winner = more_specialized_fn
6689 /* [temp.func.order]: The presence of unused ellipsis and default
6690 arguments has no effect on the partial ordering of function
6691 templates. add_function_candidate() will not have
6692 counted the "this" argument for constructors. */
6696 }
6698 /* or, if not that,
6699 the context is an initialization by user-defined conversion (see
6700 _dcl.init_ and _over.match.user_) and the standard conversion
6701 sequence from the return type of F1 to the destination type (i.e.,
6702 the type of the entity being initialized) is a better conversion
6703 sequence than the standard conversion sequence from the return type
6704 of F2 to the destination type. */
6707 {
6711 }
6713 /* Check whether we can discard a builtin candidate, either because we
6714 have two identical ones or matching builtin and non-builtin candidates.
6716 (Pedantically in the latter case the builtin which matched the user
6717 function should not be added to the overload set, but we spot it here.
6719 [over.match.oper]
6720 ... the builtin candidates include ...
6721 - do not have the same parameter type list as any non-template
6722 non-member candidate. */
6726 {
6732 {
6734 /* Two built-in candidates; arbitrarily pick one. */
6737 /* cand1 is built-in; prefer cand2. */
6739 else
6740 /* cand2 is built-in; prefer cand1. */
6742 }
6743 }
6745 /* If the two functions are the same (this can happen with declarations
6746 in multiple scopes and arg-dependent lookup), arbitrarily choose one. */
6751 tweak:
6753 /* Extension: If the worst conversion for one candidate is worse than the
6754 worst conversion for the other, take the first. */
6756 {
6761 {
6766 }
6772 {
6774 {
6776 "ISO C++ says that these are ambiguous, even "
6777 "though the worst conversion for the first is better than "
6781 }
6782 else
6785 }
6786 }
6790 }
6792 /* Given a list of candidates for overloading, find the best one, if any.
6793 This algorithm has a worst case of O(2n) (winner is last), and a best
6794 case of O(n/2) (totally ambiguous); much better than a sorting
6795 algorithm. */
6799 {
6804 /* Walk through the list once, comparing each current champ to the next
6805 candidate, knocking out a candidate or two with each comparison. */
6808 {
6812 else
6813 {
6815 {
6820 }
6821 else
6822 {
6825 }
6828 }
6829 }
6831 /* Make sure the champ is better than all the candidates it hasn't yet
6832 been compared to. */
6835 challenger != champ
6838 {
6842 }
6845 }
6847 /* Returns nonzero if things of type FROM can be converted to TO. */
6849 bool
6851 {
6853 }
6855 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
6857 bool
6859 {
6864 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6868 flags);
6871 /* Free all the conversions we allocated. */
6875 }
6877 /* Like can_convert_arg, but allows dubious conversions as well. */
6879 bool
6881 {
6885 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6887 /* Try to perform the conversion. */
6889 LOOKUP_NORMAL);
6890 /* Free all the conversions we allocated. */
6894 }
6896 /* Convert EXPR to TYPE. Return the converted expression.
6898 Note that we allow bad conversions here because by the time we get to
6899 this point we are committed to doing the conversion. If we end up
6900 doing a bad conversion, convert_like will complain. */
6902 tree
6904 {
6911 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6916 LOOKUP_NORMAL);
6918 {
6922 }
6924 {
6925 /* In a template, we are only concerned about determining the
6926 type of non-dependent expressions, so we do not have to
6927 perform the actual conversion. */
6930 }
6931 else
6934 /* Free all the conversions we allocated. */
6938 }
6940 /* Convert EXPR to TYPE (as a direct-initialization) if that is
6941 permitted. If the conversion is valid, the converted expression is
6942 returned. Otherwise, NULL_TREE is returned, except in the case
6943 that TYPE is a class type; in that case, an error is issued. If
6944 C_CAST_P is true, then this direction initialization is taking
6945 place as part of a static_cast being attempted as part of a C-style
6946 cast. */
6948 tree
6950 tree expr,
6952 tsubst_flags_t complain)
6953 {
6959 /* [dcl.init]
6961 If the destination type is a (possibly cv-qualified) class type:
6963 -- If the initialization is direct-initialization ...,
6964 constructors are considered. ... If no constructor applies, or
6965 the overload resolution is ambiguous, the initialization is
6966 ill-formed. */
6968 {
6973 }
6975 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6979 c_cast_p,
6980 LOOKUP_NORMAL);
6983 else
6986 c_cast_p,
6987 tf_warning_or_error);
6989 /* Free all the conversions we allocated. */
6993 }
6995 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
6996 is being bound to a temporary. Create and return a new VAR_DECL
6997 with the indicated TYPE; this variable will store the value to
6998 which the reference is bound. */
7000 tree
7002 {
7003 tree var;
7005 /* Create the variable. */
7008 /* Register the variable. */
7010 {
7011 /* Namespace-scope or local static; give it a mangled name. */
7012 tree name;
7019 }
7020 else
7021 /* Create a new cleanup level if necessary. */
7025 }
7027 /* EXPR is the initializer for a variable DECL of reference or
7028 std::initializer_list type. Create, push and return a new VAR_DECL
7029 for the initializer so that it will live as long as DECL. Any
7030 cleanup for the new variable is returned through CLEANUP, and the
7031 code to initialize the new variable is returned through INITP. */
7033 tree
7035 {
7036 tree init;
7037 tree type;
7038 tree var;
7040 /* Create the temporary variable. */
7044 /* If the rvalue is the result of a function call it will be
7045 a TARGET_EXPR. If it is some other construct (such as a
7046 member access expression where the underlying object is
7047 itself the result of a function call), turn it into a
7048 TARGET_EXPR here. It is important that EXPR be a
7049 TARGET_EXPR below since otherwise the INIT_EXPR will
7050 attempt to make a bitwise copy of EXPR to initialize
7051 VAR. */
7054 /* Create the INIT_EXPR that will initialize the temporary
7055 variable. */
7058 {
7063 else
7066 /* We must be careful to destroy the temporary only
7067 after its initialization has taken place. If the
7068 initialization throws an exception, then the
7069 destructor should not be run. We cannot simply
7070 transform INIT into something like:
7072 (INIT, ({ CLEANUP_STMT; }))
7074 because emit_local_var always treats the
7075 initializer as a full-expression. Thus, the
7076 destructor would run too early; it would run at the
7077 end of initializing the reference variable, rather
7078 than at the end of the block enclosing the
7079 reference variable.
7081 The solution is to pass back a cleanup expression
7082 which the caller is responsible for attaching to
7083 the statement tree. */
7084 }
7085 else
7086 {
7090 static_aggregates);
7091 }
7095 }
7097 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7098 initializing a variable of that TYPE. If DECL is non-NULL, it is
7099 the VAR_DECL being initialized with the EXPR. (In that case, the
7100 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7101 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7102 return, if *CLEANUP is no longer NULL, it will be an expression
7103 that should be pushed as a cleanup after the returned expression
7104 is used to initialize DECL.
7106 Return the converted expression. */
7108 tree
7110 {
7117 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7121 LOOKUP_NORMAL);
7123 {
7129 else
7134 }
7136 /* If DECL is non-NULL, then this special rule applies:
7138 [class.temporary]
7140 The temporary to which the reference is bound or the temporary
7141 that is the complete object to which the reference is bound
7142 persists for the lifetime of the reference.
7144 The temporaries created during the evaluation of the expression
7145 initializing the reference, except the temporary to which the
7146 reference is bound, are destroyed at the end of the
7147 full-expression in which they are created.
7149 In that case, we store the converted expression into a new
7150 VAR_DECL in a new scope.
7152 However, we want to be careful not to create temporaries when
7153 they are not required. For example, given:
7155 struct B {};
7156 struct D : public B {};
7157 D f();
7158 const B& b = f();
7160 there is no need to copy the return value from "f"; we can just
7161 extend its lifetime. Similarly, given:
7163 struct S {};
7164 struct T { operator S(); };
7165 T t;
7166 const S& s = t;
7168 we can extend the lifetime of the return value of the conversion
7169 operator. */
7172 {
7173 tree var;
7174 tree base_conv_type;
7176 /* Skip over the REF_BIND. */
7178 /* If the next conversion is a BASE_CONV, skip that too -- but
7179 remember that the conversion was required. */
7181 {
7184 }
7185 else
7187 /* Perform the remainder of the conversion. */
7193 tf_warning_or_error);
7196 else
7197 {
7199 {
7200 tree init;
7202 /* Use its address to initialize the reference variable. */
7210 }
7211 else
7212 /* Take the address of EXPR. */
7214 /* If a BASE_CONV was required, perform it now. */
7216 expr = (perform_implicit_conversion
7218 tf_warning_or_error));
7220 }
7221 }
7222 else
7223 /* Perform the conversion. */
7226 /* Free all the conversions we allocated. */
7230 }
7232 /* Returns true iff TYPE is some variant of std::initializer_list. */
7234 bool
7236 {
7240 }
7242 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7243 will accept an argument list of a single std::initializer_list<T>. */
7245 bool
7247 {
7249 tree arg;
7261 /* There are more non-defaulted parms. */
7265 }