| blob | 877f6d9cf1728ec41b7e1e4c4b986af772b88241 |
1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
45 /* The various kinds of conversion. */
48 ck_identity,
49 ck_lvalue,
50 ck_qual,
51 ck_std,
52 ck_ptr,
53 ck_pmem,
54 ck_base,
55 ck_ref_bind,
56 ck_user,
57 ck_ambig,
58 ck_list,
59 ck_aggr,
60 ck_rvalue
63 /* The rank of the conversion. Order of the enumerals matters; better
64 conversions should come earlier in the list. */
67 cr_identity,
68 cr_exact,
69 cr_promotion,
70 cr_std,
71 cr_pbool,
72 cr_user,
73 cr_ellipsis,
74 cr_bad
77 /* An implicit conversion sequence, in the sense of [over.best.ics].
78 The first conversion to be performed is at the end of the chain.
79 That conversion is always a cr_identity conversion. */
83 /* The kind of conversion represented by this step. */
84 conversion_kind kind;
85 /* The rank of this conversion. */
86 conversion_rank rank;
90 /* True if this conversion would be permitted with a bending of
91 language standards, e.g. disregarding pointer qualifiers or
92 converting integers to pointers. */
94 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
95 temporary should be created to hold the result of the
96 conversion. */
98 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
99 from a pointer-to-derived to pointer-to-base is being performed. */
101 /* If KIND is ck_ref_bind, true when either an lvalue reference is
102 being bound to an lvalue expression or an rvalue reference is
103 being bound to an rvalue expression. If KIND is ck_rvalue,
104 true when we should treat an lvalue as an rvalue (12.8p33). If
105 KIND is ck_base, always false. */
108 /* The type of the expression resulting from the conversion. */
109 tree type;
111 /* The next conversion in the chain. Since the conversions are
112 arranged from outermost to innermost, the NEXT conversion will
113 actually be performed before this conversion. This variant is
114 used only when KIND is neither ck_identity, ck_ambig nor
115 ck_list. Please use the next_conversion function instead
116 of using this field directly. */
118 /* The expression at the beginning of the conversion chain. This
119 variant is used only if KIND is ck_identity or ck_ambig. */
120 tree expr;
121 /* The array of conversions for an initializer_list, so this
122 variant is used only when KIN D is ck_list. */
125 /* The function candidate corresponding to this conversion
126 sequence. This field is only used if KIND is ck_user. */
128 };
130 #define CONVERSION_RANK(NODE) \
131 ((NODE)->bad_p ? cr_bad \
132 : (NODE)->ellipsis_p ? cr_ellipsis \
133 : (NODE)->user_conv_p ? cr_user \
134 : (NODE)->rank)
136 #define BAD_CONVERSION_RANK(NODE) \
137 ((NODE)->ellipsis_p ? cr_ellipsis \
138 : (NODE)->user_conv_p ? cr_user \
139 : (NODE)->rank)
148 tsubst_flags_t);
152 #define convert_like(CONV, EXPR, COMPLAIN) \
153 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
156 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
157 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
165 tsubst_flags_t);
180 static void add_builtin_candidates
183 static void add_builtin_candidate
187 static void build_builtin_candidate
197 tsubst_flags_t);
200 tsubst_flags_t);
220 tsubst_flags_t);
224 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
225 NAME can take many forms... */
227 bool
229 {
230 /* Just accept something we've already complained about. */
239 {
245 else
247 }
248 else
249 {
250 /* In the case of:
252 template <class T> struct S { ~S(); };
253 int i;
254 i.~S();
256 NAME will be a class template. */
259 }
264 }
266 /* We want the address of a function or method. We avoid creating a
267 pointer-to-member function. */
269 tree
271 {
274 /* We have to do these by hand to avoid real pointer to member
275 functions. */
277 {
279 {
283 complain);
284 }
286 }
287 else
291 }
293 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
294 POINTER_TYPE to those. Note, pointer to member function types
295 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
296 two variants. build_call_a is the primitive taking an array of
297 arguments, while build_call_n is a wrapper that handles varargs. */
299 tree
301 {
304 else
305 {
315 }
316 }
318 /* Update various flags in cfun and the call itself based on what is being
319 called. Split out of build_call_a so that bot_manip can use it too. */
321 void
323 {
327 /* We check both the decl and the type; a function may be known not to
328 throw without being declared throw(). */
339 }
341 tree
343 {
344 tree decl;
345 tree result_type;
346 tree fntype;
356 /* An rvalue has no cv-qualifiers. */
367 {
368 /* We invoke build_call directly for several library
369 functions. These may have been declared normally if
370 we're building libgcc, so we can't just check
371 DECL_ARTIFICIAL. */
376 }
384 /* Don't pass empty class objects by value. This is useful
385 for tags in STL, which are used to control overload resolution.
386 We don't need to handle other cases of copying empty classes. */
389 {
393 {
397 }
398 }
401 }
403 /* Build something of the form ptr->method (args)
404 or object.method (args). This can also build
405 calls to constructors, and find friends.
407 Member functions always take their class variable
408 as a pointer.
410 INSTANCE is a class instance.
412 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
414 PARMS help to figure out what that NAME really refers to.
416 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
417 down to the real instance type to use for access checking. We need this
418 information to get protected accesses correct.
420 FLAGS is the logical disjunction of zero or more LOOKUP_
421 flags. See cp-tree.h for more info.
423 If this is all OK, calls build_function_call with the resolved
424 member function.
426 This function must also handle being called to perform
427 initialization, promotion/coercion of arguments, and
428 instantiation of default parameters.
430 Note that NAME may refer to an instance variable name. If
431 `operator()()' is defined for the type of that field, then we return
432 that result. */
434 /* New overloading code. */
442 };
444 /* Information for providing diagnostics about why overloading failed. */
447 rr_none,
448 rr_arity,
449 rr_explicit_conversion,
450 rr_template_conversion,
451 rr_arg_conversion,
452 rr_bad_arg_conversion,
453 rr_template_unification,
454 rr_invalid_copy
455 };
458 /* The index of the argument, 0-based. */
460 /* The type of the actual argument. */
461 tree from_type;
462 /* The type of the formal argument. */
463 tree to_type;
464 };
469 /* Information about an arity mismatch. */
471 /* The expected number of arguments. */
473 /* The actual number of arguments in the call. */
475 /* Whether the call was a varargs call. */
478 /* Information about an argument conversion mismatch. */
480 /* Same, but for bad argument conversions. */
482 /* Information about template unification failures. These are the
483 parameters passed to fn_type_unification. */
485 tree tmpl;
486 tree explicit_targs;
490 tree return_type;
491 unification_kind_t strict;
494 /* Information about template instantiation failures. These are the
495 parameters passed to instantiate_template. */
497 tree tmpl;
498 tree targs;
501 };
504 /* The FUNCTION_DECL that will be called if this candidate is
505 selected by overload resolution. */
506 tree fn;
507 /* If not NULL_TREE, the first argument to use when calling this
508 function. */
509 tree first_arg;
510 /* The rest of the arguments to use when calling this function. If
511 there are no further arguments this may be NULL or it may be an
512 empty vector. */
514 /* The implicit conversion sequences for each of the arguments to
515 FN. */
517 /* The number of implicit conversion sequences. */
519 /* If FN is a user-defined conversion, the standard conversion
520 sequence from the type returned by FN to the desired destination
521 type. */
525 /* If FN is a member function, the binfo indicating the path used to
526 qualify the name of FN at the call site. This path is used to
527 determine whether or not FN is accessible if it is selected by
528 overload resolution. The DECL_CONTEXT of FN will always be a
529 (possibly improper) base of this binfo. */
530 tree access_path;
531 /* If FN is a non-static member function, the binfo indicating the
532 subobject to which the `this' pointer should be converted if FN
533 is selected by overload resolution. The type pointed to by
534 the `this' pointer must correspond to the most derived class
535 indicated by the CONVERSION_PATH. */
536 tree conversion_path;
537 tree template_decl;
538 tree explicit_targs;
541 };
543 /* Returns true iff T is a null pointer constant in the sense of
544 [conv.ptr]. */
546 bool
548 {
549 /* [conv.ptr]
551 A null pointer constant is an integral constant expression
552 (_expr.const_) rvalue of integer type that evaluates to zero or
553 an rvalue of type std::nullptr_t. */
557 {
558 /* Core issue 903 says only literal 0 is a null pointer constant. */
564 }
566 }
568 /* Returns true iff T is a null member pointer value (4.11). */
570 bool
572 {
581 else
583 }
585 /* Returns nonzero if PARMLIST consists of only default parms,
586 ellipsis, and/or undeduced parameter packs. */
588 bool
590 {
597 }
599 /* Allocate N bytes of memory from the conversion obstack. The memory
600 is zeroed before being returned. */
604 {
607 {
610 }
614 }
616 /* Allocate rejection reasons. */
620 {
625 }
629 {
635 }
639 {
646 }
650 {
657 }
661 {
667 }
671 {
677 }
684 {
691 /* Copy args to our own storage. */
699 }
703 {
705 }
709 {
712 }
714 /* Dynamically allocate a conversion. */
718 {
723 }
725 #ifdef ENABLE_CHECKING
727 /* Make sure that all memory on the conversion obstack has been
728 freed. */
730 void
732 {
736 }
740 /* Dynamically allocate an array of N conversions. */
744 {
746 }
750 {
754 /* Note that the caller is responsible for filling in t->cand for
755 user-defined conversions. */
761 {
777 }
783 }
785 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
786 specialization of std::initializer_list<T>, if such a conversion is
787 possible. */
791 {
797 tree val;
799 /* Within a list-initialization we can have more user-defined
800 conversions. */
802 /* But no narrowing conversions. */
806 {
807 conversion *sub
814 }
822 {
830 }
833 }
835 /* Return the next conversion of the conversion chain (if applicable),
836 or NULL otherwise. Please use this function instead of directly
837 accessing fields of struct conversion. */
841 {
848 }
850 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
851 is a valid aggregate initializer for array type ATYPE. */
853 static bool
855 {
859 {
865 else
867 complain);
870 }
872 }
874 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
875 aggregate class, if such a conversion is possible. */
879 {
892 {
894 tree val;
900 /* Value-initialization of reference is ill-formed. */
902 else
903 {
907 }
913 else
915 complain);
922 }
934 }
936 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
937 array type, if such a conversion is possible. */
941 {
946 tree val;
953 {
957 }
960 {
961 conversion *sub
973 }
982 }
984 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
985 complex type, if such a conversion is possible. */
989 tsubst_flags_t complain)
990 {
995 tree val;
1004 {
1005 conversion *sub
1017 }
1026 }
1028 /* Build a representation of the identity conversion from EXPR to
1029 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1033 {
1041 }
1043 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1044 were multiple user-defined conversions to accomplish the job.
1045 Build a conversion that indicates that ambiguity. */
1049 {
1057 }
1059 tree
1061 {
1065 }
1067 /* Returns the standard conversion path (see [conv]) from type FROM to type
1068 TO, if any. For proper handling of null pointer constants, you must
1069 also pass the expression EXPR to convert from. If C_CAST_P is true,
1070 this conversion is coming from a C-style cast. */
1075 {
1079 tree qualified_to;
1083 {
1086 }
1093 {
1099 }
1106 {
1110 }
1112 {
1114 {
1115 tree bitfield_type;
1118 {
1121 }
1122 }
1126 }
1128 /* Allow conversion between `__complex__' data types. */
1130 {
1131 /* The standard conversion sequence to convert FROM to TO is
1132 the standard conversion sequence to perform componentwise
1133 conversion. */
1138 {
1141 }
1142 else
1146 }
1149 {
1153 }
1155 /* [conv.ptr]
1156 A null pointer constant can be converted to a pointer type; ... A
1157 null pointer constant of integral type can be converted to an
1158 rvalue of type std::nullptr_t. */
1165 {
1166 /* For backwards brain damage compatibility, allow interconversion of
1167 pointers and integers with a pedwarn. */
1170 }
1172 {
1173 /* For backwards brain damage compatibility, allow interconversion of
1174 enums and integers with a pedwarn. */
1177 }
1180 {
1181 tree to_pointee;
1182 tree from_pointee;
1187 ;
1191 {
1193 from = build_pointer_type
1197 }
1199 {
1204 && (same_type_ignoring_top_level_qualifiers_p
1207 {
1211 }
1214 }
1217 /* [conv.ptr]
1219 An rvalue of type "pointer to cv D," where D is a
1220 class type, can be converted to an rvalue of type
1221 "pointer to cv B," where B is a base class (clause
1222 _class.derived_) of D. If B is an inaccessible
1223 (clause _class.access_) or ambiguous
1224 (_class.member.lookup_) base class of D, a program
1225 that necessitates this conversion is ill-formed.
1226 Therefore, we use DERIVED_FROM_P, and do not check
1227 access or uniqueness. */
1229 {
1230 from =
1236 }
1239 {
1242 }
1243 else
1244 {
1247 }
1252 /* In a C-style cast, we ignore CV-qualification because we
1253 are allowed to perform a static_cast followed by a
1254 const_cast. */
1259 /* converting from string constant to char *. */
1261 /* Allow conversions among compatible ObjC pointer types (base
1262 conversions have been already handled above). */
1267 {
1270 }
1271 else
1275 }
1277 {
1289 tbase,
1295 }
1297 {
1298 /* [conv.bool]
1300 An rvalue of arithmetic, unscoped enumeration, pointer, or
1301 pointer to member type can be converted to an rvalue of type
1302 bool. ... An rvalue of type std::nullptr_t can be converted
1303 to an rvalue of type bool; */
1309 {
1318 }
1321 }
1322 /* We don't check for ENUMERAL_TYPE here because there are no standard
1323 conversions to enum type. */
1324 /* As an extension, allow conversion to complex type. */
1326 {
1333 /* Give this a better rank if it's a promotion. */
1337 }
1343 {
1347 /* The derived-to-base conversion indicates the initialization
1348 of a parameter with base type from an object of a derived
1349 type. A temporary object is created to hold the result of
1350 the conversion unless we're binding directly to a reference. */
1352 }
1353 else
1360 }
1362 /* Returns nonzero if T1 is reference-related to T2. */
1364 bool
1366 {
1373 /* [dcl.init.ref]
1375 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1376 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1377 of T2. */
1381 }
1383 /* Returns nonzero if T1 is reference-compatible with T2. */
1385 static bool
1387 {
1388 /* [dcl.init.ref]
1390 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1391 reference-related to T2 and cv1 is the same cv-qualification as,
1392 or greater cv-qualification than, cv2. */
1395 }
1397 /* A reference of the indicated TYPE is being bound directly to the
1398 expression represented by the implicit conversion sequence CONV.
1399 Return a conversion sequence for this binding. */
1403 {
1404 tree t;
1411 /* [over.ics.rank]
1413 When a parameter of reference type binds directly
1414 (_dcl.init.ref_) to an argument expression, the implicit
1415 conversion sequence is the identity conversion, unless the
1416 argument expression has a type that is a derived class of the
1417 parameter type, in which case the implicit conversion sequence is
1418 a derived-to-base Conversion.
1420 If the parameter binds directly to the result of applying a
1421 conversion function to the argument expression, the implicit
1422 conversion sequence is a user-defined conversion sequence
1423 (_over.ics.user_), with the second standard conversion sequence
1424 either an identity conversion or, if the conversion function
1425 returns an entity of a type that is a derived class of the
1426 parameter type, a derived-to-base conversion. */
1428 {
1429 /* Represent the derived-to-base conversion. */
1431 /* We will actually be binding to the base-class subobject in
1432 the derived class, so we mark this conversion appropriately.
1433 That way, convert_like knows not to generate a temporary. */
1435 }
1437 }
1439 /* Returns the conversion path from type FROM to reference type TO for
1440 purposes of reference binding. For lvalue binding, either pass a
1441 reference type to FROM or an lvalue expression to EXPR. If the
1442 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1443 the conversion returned. If C_CAST_P is true, this
1444 conversion is coming from a C-style cast. */
1448 tsubst_flags_t complain)
1449 {
1453 tree tfrom;
1456 cp_lvalue_kind gl_kind;
1460 {
1465 }
1468 {
1470 /* DR 1288: Otherwise, if the initializer list has a single element
1471 of type E and ... [T's] referenced type is reference-related to E,
1472 the object or reference is initialized from that element... */
1474 {
1480 {
1484 }
1485 }
1486 /* Otherwise, if T is a reference type, a prvalue temporary of the
1487 type referenced by T is copy-list-initialized or
1488 direct-list-initialized, depending on the kind of initialization
1489 for the reference, and the reference is bound to that temporary. */
1492 skip:;
1493 }
1496 {
1501 else
1503 }
1505 {
1508 /* A class prvalue is not a glvalue. */
1510 }
1511 else
1519 /* Figure out whether or not the types are reference-related and
1520 reference compatible. We have do do this after stripping
1521 references from FROM. */
1523 /* If this is a C cast, first convert to an appropriately qualified
1524 type, so that we can later do a const_cast to the desired type. */
1530 /* Directly bind reference when target expression's type is compatible with
1531 the reference and expression is an lvalue. In DR391, the wording in
1532 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1533 const and rvalue references to rvalues of compatible class type.
1534 We should also do direct bindings for non-class xvalues. */
1536 && (is_lvalue
1540 && (gl_kind
1544 {
1545 /* [dcl.init.ref]
1547 If the initializer expression
1549 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1550 is reference-compatible with "cv2 T2,"
1552 the reference is bound directly to the initializer expression
1553 lvalue.
1555 [...]
1556 If the initializer expression is an rvalue, with T2 a class type,
1557 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1558 is bound to the object represented by the rvalue or to a sub-object
1559 within that object. */
1565 /* The top-level caller requested that we pretend that the lvalue
1566 be treated as an rvalue. */
1569 /* Handle rvalue reference to function properly. */
1570 conv->rvaluedness_matches_p
1572 else
1573 conv->rvaluedness_matches_p
1578 /* For the purposes of overload resolution, we ignore the fact
1579 this expression is a bitfield or packed field. (In particular,
1580 [over.ics.ref] says specifically that a function with a
1581 non-const reference parameter is viable even if the
1582 argument is a bitfield.)
1584 However, when we actually call the function we must create
1585 a temporary to which to bind the reference. If the
1586 reference is volatile, or isn't const, then we cannot make
1587 a temporary, so we just issue an error when the conversion
1588 actually occurs. */
1591 /* Don't allow binding of lvalues (other than function lvalues) to
1592 rvalue references. */
1599 }
1600 /* [class.conv.fct] A conversion function is never used to convert a
1601 (possibly cv-qualified) object to the (possibly cv-qualified) same
1602 object type (or a reference to it), to a (possibly cv-qualified) base
1603 class of that type (or a reference to it).... */
1606 {
1607 /* [dcl.init.ref]
1609 If the initializer expression
1611 -- has a class type (i.e., T2 is a class type) can be
1612 implicitly converted to an lvalue of type "cv3 T3," where
1613 "cv1 T1" is reference-compatible with "cv3 T3". (this
1614 conversion is selected by enumerating the applicable
1615 conversion functions (_over.match.ref_) and choosing the
1616 best one through overload resolution. (_over.match_).
1618 the reference is bound to the lvalue result of the conversion
1619 in the second case. */
1621 complain);
1624 }
1626 /* From this point on, we conceptually need temporaries, even if we
1627 elide them. Only the cases above are "direct bindings". */
1631 /* [over.ics.rank]
1633 When a parameter of reference type is not bound directly to an
1634 argument expression, the conversion sequence is the one required
1635 to convert the argument expression to the underlying type of the
1636 reference according to _over.best.ics_. Conceptually, this
1637 conversion sequence corresponds to copy-initializing a temporary
1638 of the underlying type with the argument expression. Any
1639 difference in top-level cv-qualification is subsumed by the
1640 initialization itself and does not constitute a conversion. */
1642 /* [dcl.init.ref]
1644 Otherwise, the reference shall be an lvalue reference to a
1645 non-volatile const type, or the reference shall be an rvalue
1646 reference. */
1650 /* [dcl.init.ref]
1652 Otherwise, a temporary of type "cv1 T1" is created and
1653 initialized from the initializer expression using the rules for a
1654 non-reference copy initialization. If T1 is reference-related to
1655 T2, cv1 must be the same cv-qualification as, or greater
1656 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1660 /* We're generating a temporary now, but don't bind any more in the
1661 conversion (specifically, don't slice the temporary returned by a
1662 conversion operator). */
1665 /* Core issue 899: When [copy-]initializing a temporary to be bound
1666 to the first parameter of a copy constructor (12.8) called with
1667 a single argument in the context of direct-initialization,
1668 explicit conversion functions are also considered.
1670 So don't set LOOKUP_ONLYCONVERTING in that case. */
1681 /* This reference binding, unlike those above, requires the
1682 creation of a temporary. */
1685 {
1687 /* In the second case, if the reference is an rvalue reference and
1688 the second standard conversion sequence of the user-defined
1689 conversion sequence includes an lvalue-to-rvalue conversion, the
1690 program is ill-formed. */
1693 }
1696 }
1698 /* Returns the implicit conversion sequence (see [over.ics]) from type
1699 FROM to type TO. The optional expression EXPR may affect the
1700 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1701 true, this conversion is coming from a C-style cast. */
1706 {
1713 /* Other flags only apply to the primary function in overload
1714 resolution, or after we've chosen one. */
1719 /* FIXME: actually we don't want warnings either, but we can't just
1720 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1721 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1722 We really ought not to issue that warning until we've committed
1723 to that conversion. */
1728 else
1735 {
1739 /* As an extension, allow list-initialization of _Complex. */
1741 {
1745 }
1747 /* Allow conversion from an initializer-list with one element to a
1748 scalar type. */
1750 {
1752 tree elt;
1758 else
1764 {
1767 /* Too many levels of braces, i.e. '{{1}}'. */
1770 }
1771 }
1774 }
1780 {
1792 /* We used to try to bind a reference to a temporary here, but that
1793 is now handled after the recursive call to this function at the end
1794 of reference_binding. */
1796 }
1799 }
1801 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1802 functions. ARGS will not be changed until a single candidate is
1803 selected. */
1811 {
1828 }
1830 /* Return the number of remaining arguments in the parameter list
1831 beginning with ARG. */
1833 static int
1835 {
1840 n++;
1843 }
1845 /* Create an overload candidate for the function or method FN called
1846 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1847 FLAGS is passed on to implicit_conversion.
1849 This does not change ARGS.
1851 CTYPE, if non-NULL, is the type we want to pretend this function
1852 comes from for purposes of overload resolution. */
1859 tsubst_flags_t complain)
1860 {
1864 tree parmnode;
1870 /* At this point we should not see any functions which haven't been
1871 explicitly declared, except for friend functions which will have
1872 been found using argument dependent lookup. */
1875 /* The `this', `in_chrg' and VTT arguments to constructors are not
1876 considered in overload resolution. */
1878 {
1882 {
1885 }
1886 }
1887 else
1893 /* 13.3.2 - Viable functions [over.match.viable]
1894 First, to be a viable function, a candidate function shall have enough
1895 parameters to agree in number with the arguments in the list.
1897 We need to check this first; otherwise, checking the ICSes might cause
1898 us to produce an ill-formed template instantiation. */
1902 {
1906 }
1910 {
1914 }
1915 /* When looking for a function from a subobject from an implicit
1916 copy/move constructor/operator=, don't consider anything that takes (a
1917 reference to) an unrelated type. See c++/44909 and core 1092. */
1919 {
1925 else
1928 {
1931 ctype))
1933 }
1935 /* This only applies at the top level. */
1937 }
1942 /* Second, for F to be a viable function, there shall exist for each
1943 argument an implicit conversion sequence that converts that argument
1944 to the corresponding parameter of F. */
1949 {
1951 tree arg;
1960 else
1969 {
1975 /* The type of the implicit object parameter ('this') for
1976 overload resolution is not always the same as for the
1977 function itself; conversion functions are considered to
1978 be members of the class being converted, and functions
1979 introduced by a using-declaration are considered to be
1980 members of the class that uses them.
1982 Since build_over_call ignores the ICS for the `this'
1983 parameter, we can just change the parm type. */
1985 {
1986 parmtype = cp_build_qualified_type
1989 {
1990 /* If the function has a ref-qualifier, the implicit
1991 object parameter has reference type. */
1994 }
1995 else
1996 {
2000 }
2001 }
2003 /* Core issue 899: When [copy-]initializing a temporary to be bound
2004 to the first parameter of a copy constructor (12.8) called with
2005 a single argument in the context of direct-initialization,
2006 explicit conversion functions are also considered.
2008 So set LOOKUP_COPY_PARM to let reference_binding know that
2009 it's being called in that context. We generalize the above
2010 to handle move constructors and template constructors as well;
2011 the standardese should soon be updated similarly. */
2015 && (same_type_ignoring_top_level_qualifiers_p
2017 {
2020 /* We allow user-defined conversions within init-lists, but
2021 don't list-initialize the copy parm, as that would mean
2022 using two levels of braces for the same type. */
2026 }
2027 else
2033 }
2034 else
2035 {
2039 }
2046 {
2050 }
2053 {
2056 }
2057 }
2059 out:
2062 }
2064 /* Create an overload candidate for the conversion function FN which will
2065 be invoked for expression OBJ, producing a pointer-to-function which
2066 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2067 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2068 passed on to implicit_conversion.
2070 Actually, we don't really care about FN; we care about the type it
2071 converts to. There may be multiple conversion functions that will
2072 convert to that type, and we rely on build_user_type_conversion_1 to
2073 choose the best one; so when we create our candidate, we record the type
2074 instead of the function. */
2080 tsubst_flags_t complain)
2081 {
2099 /* Don't bother looking up the same type twice. */
2104 {
2112 else
2117 {
2121 }
2125 {
2129 }
2130 else
2131 {
2135 }
2142 {
2145 }
2152 }
2156 {
2160 }
2164 }
2166 static void
2170 {
2184 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2185 conversion ops are allowed. We handle that here by just checking for
2186 boolean_type_node because other operators don't ask for it. COND_EXPR
2187 also does contextual conversion to bool for the first operand, but we
2188 handle that in build_conditional_expr, and type1 here is operand 2. */
2193 {
2200 {
2202 /* We need something for printing the candidate. */
2206 }
2208 {
2212 }
2214 }
2216 /* For COND_EXPR we rearranged the arguments; undo that now. */
2218 {
2223 complain);
2226 else
2227 {
2230 boolean_type_node);
2231 }
2232 }
2239 }
2241 static bool
2243 {
2245 }
2247 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2249 static bool
2251 {
2252 /* [over.built]
2254 In this section, the term promoted integral type is used to refer
2255 to those integral types which are preserved by integral promotion
2256 (including e.g. int and long but excluding e.g. char).
2257 Similarly, the term promoted arithmetic type refers to promoted
2258 integral types plus floating types. */
2262 }
2264 /* Create any builtin operator overload candidates for the operator in
2265 question given the converted operand types TYPE1 and TYPE2. The other
2266 args are passed through from add_builtin_candidates to
2267 build_builtin_candidate.
2269 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2270 If CODE is requires candidates operands of the same type of the kind
2271 of which TYPE1 and TYPE2 are, we add both candidates
2272 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2274 static void
2278 tsubst_flags_t complain)
2279 {
2281 {
2289 }
2292 {
2294 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2295 and VQ is either volatile or empty, there exist candidate operator
2296 functions of the form
2297 VQ T& operator++(VQ T&);
2298 T operator++(VQ T&, int);
2299 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2300 type other than bool, and VQ is either volatile or empty, there exist
2301 candidate operator functions of the form
2302 VQ T& operator--(VQ T&);
2303 T operator--(VQ T&, int);
2304 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2305 complete object type, and VQ is either volatile or empty, there exist
2306 candidate operator functions of the form
2307 T*VQ& operator++(T*VQ&);
2308 T*VQ& operator--(T*VQ&);
2309 T* operator++(T*VQ&, int);
2310 T* operator--(T*VQ&, int); */
2319 {
2322 }
2325 /* 7 For every cv-qualified or cv-unqualified object type T, there
2326 exist candidate operator functions of the form
2328 T& operator*(T*);
2330 8 For every function type T, there exist candidate operator functions of
2331 the form
2332 T& operator*(T*); */
2341 /* 9 For every type T, there exist candidate operator functions of the form
2342 T* operator+(T*);
2344 10For every promoted arithmetic type T, there exist candidate operator
2345 functions of the form
2346 T operator+(T);
2347 T operator-(T); */
2357 /* 11For every promoted integral type T, there exist candidate operator
2358 functions of the form
2359 T operator~(T); */
2366 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2367 is the same type as C2 or is a derived class of C2, T is a complete
2368 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2369 there exist candidate operator functions of the form
2370 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2371 where CV12 is the union of CV1 and CV2. */
2375 {
2383 }
2386 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2387 didate operator functions of the form
2388 LR operator*(L, R);
2389 LR operator/(L, R);
2390 LR operator+(L, R);
2391 LR operator-(L, R);
2392 bool operator<(L, R);
2393 bool operator>(L, R);
2394 bool operator<=(L, R);
2395 bool operator>=(L, R);
2396 bool operator==(L, R);
2397 bool operator!=(L, R);
2398 where LR is the result of the usual arithmetic conversions between
2399 types L and R.
2401 14For every pair of types T and I, where T is a cv-qualified or cv-
2402 unqualified complete object type and I is a promoted integral type,
2403 there exist candidate operator functions of the form
2404 T* operator+(T*, I);
2405 T& operator[](T*, I);
2406 T* operator-(T*, I);
2407 T* operator+(I, T*);
2408 T& operator[](I, T*);
2410 15For every T, where T is a pointer to complete object type, there exist
2411 candidate operator functions of the form112)
2412 ptrdiff_t operator-(T, T);
2414 16For every pointer or enumeration type T, there exist candidate operator
2415 functions of the form
2416 bool operator<(T, T);
2417 bool operator>(T, T);
2418 bool operator<=(T, T);
2419 bool operator>=(T, T);
2420 bool operator==(T, T);
2421 bool operator!=(T, T);
2423 17For every pointer to member type T, there exist candidate operator
2424 functions of the form
2425 bool operator==(T, T);
2426 bool operator!=(T, T); */
2433 {
2436 }
2449 {
2452 }
2454 {
2457 }
2458 /* Fall through. */
2474 {
2477 }
2480 {
2483 }
2491 {
2494 }
2496 {
2499 }
2502 /* 18For every pair of promoted integral types L and R, there exist candi-
2503 date operator functions of the form
2504 LR operator%(L, R);
2505 LR operator&(L, R);
2506 LR operator^(L, R);
2507 LR operator|(L, R);
2508 L operator<<(L, R);
2509 L operator>>(L, R);
2510 where LR is the result of the usual arithmetic conversions between
2511 types L and R. */
2519 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2523 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2524 type, VQ is either volatile or empty, and R is a promoted arithmetic
2525 type, there exist candidate operator functions of the form
2526 VQ L& operator=(VQ L&, R);
2527 VQ L& operator*=(VQ L&, R);
2528 VQ L& operator/=(VQ L&, R);
2529 VQ L& operator+=(VQ L&, R);
2530 VQ L& operator-=(VQ L&, R);
2532 20For every pair T, VQ), where T is any type and VQ is either volatile
2533 or empty, there exist candidate operator functions of the form
2534 T*VQ& operator=(T*VQ&, T*);
2536 21For every pair T, VQ), where T is a pointer to member type and VQ is
2537 either volatile or empty, there exist candidate operator functions of
2538 the form
2539 VQ T& operator=(VQ T&, T);
2541 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2542 unqualified complete object type, VQ is either volatile or empty, and
2543 I is a promoted integral type, there exist candidate operator func-
2544 tions of the form
2545 T*VQ& operator+=(T*VQ&, I);
2546 T*VQ& operator-=(T*VQ&, I);
2548 23For every triple L, VQ, R), where L is an integral or enumeration
2549 type, VQ is either volatile or empty, and R is a promoted integral
2550 type, there exist candidate operator functions of the form
2552 VQ L& operator%=(VQ L&, R);
2553 VQ L& operator<<=(VQ L&, R);
2554 VQ L& operator>>=(VQ L&, R);
2555 VQ L& operator&=(VQ L&, R);
2556 VQ L& operator^=(VQ L&, R);
2557 VQ L& operator|=(VQ L&, R); */
2561 {
2565 {
2568 }
2581 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2))
2594 {
2597 }
2602 }
2607 /* [over.built]
2609 For every pair of promoted arithmetic types L and R, there
2610 exist candidate operator functions of the form
2612 LR operator?(bool, L, R);
2614 where LR is the result of the usual arithmetic conversions
2615 between types L and R.
2617 For every type T, where T is a pointer or pointer-to-member
2618 type, there exist candidate operator functions of the form T
2619 operator?(bool, T, T); */
2623 /* That's OK. */
2626 /* Otherwise, the types should be pointers. */
2630 /* We don't check that the two types are the same; the logic
2631 below will actually create two candidates; one in which both
2632 parameter types are TYPE1, and one in which both parameter
2633 types are TYPE2. */
2644 }
2646 /* Make sure we don't create builtin candidates with dependent types. */
2650 {
2651 /* Try to recover if one of the types is non-dependent. But if
2652 there's only one type, there's nothing we can do. */
2655 /* And we lose if both are dependent. */
2658 /* Or if they have different forms. */
2666 }
2668 /* If we're dealing with two pointer types or two enumeral types,
2669 we need candidates for both of them. */
2678 {
2680 {
2682 error_mark_node,
2683 error_mark_node,
2684 CPO_CONVERSION,
2685 tf_none);
2687 {
2688 build_builtin_candidate
2692 }
2693 }
2695 build_builtin_candidate
2697 build_builtin_candidate
2700 }
2702 build_builtin_candidate
2704 }
2706 tree
2708 {
2714 }
2716 /* There are three conditions of builtin candidates:
2718 1) bool-taking candidates. These are the same regardless of the input.
2719 2) pointer-pair taking candidates. These are generated for each type
2720 one of the input types converts to.
2721 3) arithmetic candidates. According to the standard, we should generate
2722 all of these, but I'm trying not to...
2724 Here we generate a superset of the possible candidates for this particular
2725 case. That is a subset of the full set the standard defines, plus some
2726 other cases which the standard disallows. add_builtin_candidate will
2727 filter out the invalid set. */
2729 static void
2733 {
2737 /* TYPES[i] is the set of possible builtin-operator parameter types
2738 we will consider for the Ith argument. */
2743 {
2746 else
2748 }
2751 {
2752 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2753 and VQ is either volatile or empty, there exist candidate operator
2754 functions of the form
2755 VQ T& operator++(VQ T&); */
2765 /* 24There also exist candidate operator functions of the form
2766 bool operator!(bool);
2767 bool operator&&(bool, bool);
2768 bool operator||(bool, bool); */
2771 build_builtin_candidate
2778 build_builtin_candidate
2796 /* Fall through. */
2800 }
2806 {
2808 ;
2810 {
2811 tree convs;
2819 {
2824 }
2830 {
2843 {
2849 }
2853 }
2854 }
2855 else
2856 {
2861 {
2867 }
2869 }
2870 }
2872 /* Run through the possible parameter types of both arguments,
2873 creating candidates with those parameter types. */
2875 {
2877 tree u;
2881 add_builtin_candidate
2884 else
2885 add_builtin_candidate
2888 }
2892 }
2895 /* If TMPL can be successfully instantiated as indicated by
2896 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2898 TMPL is the template. EXPLICIT_TARGS are any explicit template
2899 arguments. ARGLIST is the arguments provided at the call-site.
2900 This does not change ARGLIST. The RETURN_TYPE is the desired type
2901 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2902 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2903 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2911 tsubst_flags_t complain)
2912 {
2922 tree arg;
2924 tree fn;
2928 /* We don't do deduction on the in-charge parameter, the VTT
2929 parameter or 'this'. */
2931 {
2934 else
2936 }
2941 {
2944 else
2946 }
2956 {
2959 }
2963 {
2966 }
2971 args_without_in_chrg,
2972 nargs_without_in_chrg,
2977 {
2978 /* Don't repeat unification later if it already resulted in errors. */
2982 nargs_without_in_chrg,
2984 else
2987 }
2989 /* In [class.copy]:
2991 A member function template is never instantiated to perform the
2992 copy of a class object to an object of its class type.
2994 It's a little unclear what this means; the standard explicitly
2995 does allow a template to be used to copy a class. For example,
2996 in:
2998 struct A {
2999 A(A&);
3000 template <class T> A(const T&);
3001 };
3002 const A f ();
3003 void g () { A a (f ()); }
3005 the member template will be used to make the copy. The section
3006 quoted above appears in the paragraph that forbids constructors
3007 whose only parameter is (a possibly cv-qualified variant of) the
3008 class type, and a logical interpretation is that the intent was
3009 to forbid the instantiation of member templates which would then
3010 have that form. */
3012 {
3015 ctype))
3016 {
3019 }
3020 }
3023 /* Aha, this is a conversion function. */
3026 else
3031 /* This situation can occur if a member template of a template
3032 class is specialized. Then, instantiate_template might return
3033 an instantiation of the specialization, in which case the
3034 DECL_TI_TEMPLATE field will point at the original
3035 specialization. For example:
3037 template <class T> struct S { template <class U> void f(U);
3038 template <> void f(int) {}; };
3039 S<double> sd;
3040 sd.f(3);
3042 Here, TMPL will be template <class U> S<double>::f(U).
3043 And, instantiate template will give us the specialization
3044 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3045 for this will point at template <class T> template <> S<T>::f(int),
3046 so that we can find the definition. For the purposes of
3047 overload resolution, however, we want the original TMPL. */
3049 else
3054 fail:
3057 }
3066 {
3067 return
3072 }
3081 {
3082 return
3086 complain);
3087 }
3089 /* The CANDS are the set of candidates that were considered for
3090 overload resolution. Return the set of viable candidates, or CANDS
3091 if none are viable. If any of the candidates were viable, set
3092 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3093 considered viable only if it is strictly viable. */
3099 {
3104 /* Be strict inside templates, since build_over_call won't actually
3105 do the conversions to get pedwarns. */
3115 {
3118 {
3124 }
3125 else
3127 }
3130 }
3132 static bool
3134 {
3139 }
3141 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3142 words, it is about to become the "this" pointer for a member
3143 function call. Take the address of the object. */
3145 static tree
3147 {
3148 /* In a template, we are only concerned about the type of the
3149 expression, so we can take a shortcut. */
3154 }
3156 /* Returns true iff functions are equivalent. Equivalent functions are
3157 not '==' only if one is a function-local extern function or if
3158 both are extern "C". */
3162 {
3171 }
3173 /* Print information about a candidate being rejected due to INFO. */
3175 static void
3177 {
3179 /* Conversion of implicit `this' argument failed. */
3184 /* Conversion of conversion function return value failed. */
3187 else
3190 }
3192 /* Print information about a candidate with WANT parameters and we found
3193 HAVE. */
3195 static void
3197 {
3202 }
3204 /* Print information about one overload candidate CANDIDATE. MSGSTR
3205 is the text to print before the candidate itself.
3207 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3208 to have been run through gettext by the caller. This wart makes
3209 life simpler in print_z_candidates and for the translators. */
3211 static void
3214 {
3221 {
3232 else
3235 }
3242 else
3244 /* Give the user some information about why this candidate failed. */
3246 {
3250 {
3263 "cannot be converted to %qT with a qualification "
3269 "conversion function specialization to %qT is not an "
3274 /* We use template_unification_error_rejection if unification caused
3275 actual non-SFINAE errors, in which case we don't need to repeat
3276 them here. */
3278 {
3282 }
3283 /* Re-run template unification with diagnostics. */
3287 (make_tree_vec
3298 " a constructor taking a single argument of its own "
3303 /* This candidate didn't have any issues or we failed to
3304 handle a particular code. Either way... */
3306 }
3307 }
3308 }
3310 static void
3312 {
3320 /* Remove non-viable deleted candidates. */
3323 {
3328 else
3330 }
3331 /* ...if there are any non-deleted ones. */
3335 /* There may be duplicates in the set of candidates. We put off
3336 checking this condition as long as possible, since we have no way
3337 to eliminate duplicates from a set of functions in less than n^2
3338 time. Now we are about to emit an error message, so it is more
3339 permissible to go slowly. */
3341 {
3343 /* Skip builtin candidates and conversion functions. */
3348 {
3352 else
3354 }
3355 }
3358 n_candidates++;
3363 }
3365 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3366 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3367 the result of the conversion function to convert it to the final
3368 desired type. Merge the two sequences into a single sequence,
3369 and return the merged sequence. */
3373 {
3379 /* Find the end of the second conversion sequence. */
3381 {
3382 /* The entire sequence is a user-conversion sequence. */
3386 }
3388 /* Replace the identity conversion with the user conversion
3389 sequence. */
3393 }
3395 /* Handle overload resolution for initializing an object of class type from
3396 an initializer list. First we look for a suitable constructor that
3397 takes a std::initializer_list; if we don't find one, we then look for a
3398 non-list constructor.
3400 Parameters are as for add_candidates, except that the arguments are in
3401 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3402 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3404 static void
3411 tsubst_flags_t complain)
3412 {
3417 /* We're looking for a ctor for list-initialization. */
3419 /* And we don't allow narrowing conversions. We also use this flag to
3420 avoid the copy constructor call for copy-list-initialization. */
3423 /* Always use the default constructor if the list is empty (DR 990). */
3426 ;
3427 /* If the class has a list ctor, try passing the list as a single
3428 argument first, but only consider list ctors. */
3430 {
3438 }
3442 /* We aren't looking for list-ctors anymore. */
3444 /* We allow more user-defined conversions within an init-list. */
3450 }
3452 /* Returns the best overload candidate to perform the requested
3453 conversion. This function is used for three the overloading situations
3454 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3455 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3456 per [dcl.init.ref], so we ignore temporary bindings. */
3460 tsubst_flags_t complain)
3461 {
3463 tree fromtype;
3477 /* We represent conversion within a hierarchy using RVALUE_CONV and
3478 BASE_CONV, as specified by [over.best.ics]; these become plain
3479 constructor calls, as specified in [dcl.init]. */
3484 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3485 creating a garbage BASELINK; constructors can't be inherited. */
3489 {
3494 {
3495 /* [class.conv.fct] A conversion function is never used to
3496 convert a (possibly cv-qualified) object to the (possibly
3497 cv-qualified) same object type (or a reference to it), to a
3498 (possibly cv-qualified) base class of that type (or a
3499 reference to it)... */
3500 }
3501 else
3503 }
3510 /* It's OK to bind a temporary for converting constructor arguments, but
3511 not in converting the return value of a conversion operator. */
3516 {
3522 /* We should never try to call the abstract or base constructor
3523 from here. */
3528 {
3529 /* List-initialization. */
3533 }
3534 else
3535 {
3540 }
3543 {
3546 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3547 set, then this is copy-initialization. In that case, "The
3548 result of the call is then used to direct-initialize the
3549 object that is the destination of the copy-initialization."
3550 [dcl.init]
3552 We represent this in the conversion sequence with an
3553 rvalue conversion, which means a constructor call. */
3556 cand->second_conv
3558 }
3559 }
3565 {
3569 /* If we are called to convert to a reference type, we are trying to
3570 find a direct binding, so don't even consider temporaries. If
3571 we don't find a direct binding, the caller will try again to
3572 look for a temporary binding. */
3583 {
3585 conversion *ics
3587 rettype,
3590 complain);
3592 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3593 copy-initialization. In that case, "The result of the
3594 call is then used to direct-initialize the object that is
3595 the destination of the copy-initialization." [dcl.init]
3597 We represent this in the conversion sequence with an
3598 rvalue conversion, which means a constructor call. But
3599 don't add a second rvalue conversion if there's already
3600 one there. Which there really shouldn't be, but it's
3601 harmless since we'd add it here anyway. */
3609 {
3613 }
3616 {
3617 /* 13.3.1.5: For direct-initialization, those explicit
3618 conversion functions that are not hidden within S and
3619 yield type T or a type that can be converted to type T
3620 with a qualification conversion (4.4) are also candidate
3621 functions. */
3622 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3623 I've raised this issue with the committee. --jason 9/2011 */
3626 }
3628 {
3630 cand->reason
3633 }
3636 {
3637 /* 13.3.3.1.2: If the user-defined conversion is specified by
3638 a specialization of a conversion function template, the
3639 second standard conversion sequence shall have exact match
3640 rank. */
3643 }
3644 }
3645 }
3649 {
3653 }
3657 {
3659 {
3663 }
3670 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3671 ambiguous conversion is no worse than another user-defined
3672 conversion. */
3675 }
3677 /* Build the user conversion sequence. */
3678 conv = build_conv
3687 /* Remember that this was a list-initialization. */
3691 /* Combine it with the second conversion sequence. */
3696 }
3698 /* Wrapper for above. */
3700 tree
3702 tsubst_flags_t complain)
3703 {
3705 tree ret;
3711 {
3714 else
3715 {
3718 }
3719 }
3720 else
3725 }
3727 /* Subroutine of convert_nontype_argument.
3729 EXPR is an argument for a template non-type parameter of integral or
3730 enumeration type. Do any necessary conversions (that are permitted for
3731 non-type arguments) to convert it to the parameter type.
3733 If conversion is successful, returns the converted expression;
3734 otherwise, returns error_mark_node. */
3736 tree
3738 {
3741 tree t;
3749 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3756 /* for a non-type template-parameter of integral or
3757 enumeration type, integral promotions (4.5) and integral
3758 conversions (4.7) are applied. */
3759 /* It should be sufficient to check the outermost conversion step, since
3760 there are no qualification conversions to integer type. */
3763 {
3764 /* A conversion function is OK. If it isn't constexpr, we'll
3765 complain later that the argument isn't constant. */
3767 /* The lvalue-to-rvalue conversion is OK. */
3780 /* and fall through. */
3785 }
3789 else
3792 /* Free all the conversions we allocated. */
3796 }
3798 /* Do any initial processing on the arguments to a function call. */
3802 {
3804 tree arg;
3807 {
3811 {
3815 }
3818 }
3820 }
3822 /* Perform overload resolution on FN, which is called with the ARGS.
3824 Return the candidate function selected by overload resolution, or
3825 NULL if the event that overload resolution failed. In the case
3826 that overload resolution fails, *CANDIDATES will be the set of
3827 candidates considered, and ANY_VIABLE_P will be set to true or
3828 false to indicate whether or not any of the candidates were
3829 viable.
3831 The ARGS should already have gone through RESOLVE_ARGS before this
3832 function is called. */
3839 {
3841 tree explicit_targs;
3852 /* Check FN. */
3859 {
3863 }
3865 /* Add the various candidate functions. */
3870 LOOKUP_NORMAL,
3876 else
3881 }
3883 /* Print an error message about being unable to build a call to FN with
3884 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
3885 be located; CANDIDATES is a possibly empty list of such
3886 functions. */
3888 static void
3891 {
3898 else
3903 }
3905 /* Return an expression for a call to FN (a namespace-scope function,
3906 or a static member function) with the ARGS. This may change
3907 ARGS. */
3909 tree
3911 tsubst_flags_t complain)
3912 {
3916 tree result;
3919 {
3923 }
3928 /* If this function was found without using argument dependent
3929 lookup, then we want to ignore any undeclared friend
3930 functions. */
3932 {
3937 {
3941 }
3942 }
3944 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3948 complain);
3951 {
3953 {
3960 }
3962 }
3963 else
3964 {
3966 /* If fn is template_id_expr, the call has explicit template arguments
3967 (e.g. func<int>(5)), communicate this info to build_over_call
3968 through flags so that later we can use it to decide whether to warn
3969 about peculiar null pointer conversion. */
3973 }
3975 /* Free all the conversions we allocated. */
3979 }
3981 /* Build a call to a global operator new. FNNAME is the name of the
3982 operator (either "operator new" or "operator new[]") and ARGS are
3983 the arguments provided. This may change ARGS. *SIZE points to the
3984 total number of bytes required by the allocation, and is updated if
3985 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3986 be used. If this function determines that no cookie should be
3987 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
3988 is not NULL_TREE, it is evaluated before calculating the final
3989 array size, and if it fails, the array size is replaced with
3990 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
3991 is non-NULL, it will be set, upon return, to the allocation
3992 function called. */
3994 tree
3998 {
4000 tree fns;
4007 /* Set to (size_t)-1 if the size check fails. */
4009 {
4015 }
4021 /* Based on:
4023 [expr.new]
4025 If this lookup fails to find the name, or if the allocated type
4026 is not a class type, the allocation function's name is looked
4027 up in the global scope.
4029 we disregard block-scope declarations of "operator new". */
4032 /* Figure out what function is being called. */
4034 complain);
4036 /* If no suitable function could be found, issue an error message
4037 and give up. */
4039 {
4043 }
4045 /* If a cookie is required, add some extra space. Whether
4046 or not a cookie is required cannot be determined until
4047 after we know which function was called. */
4049 {
4052 {
4053 /* In G++ 3.2, the check was implemented incorrectly; it
4054 looked at the placement expression, rather than the
4055 type of the function. */
4059 }
4060 else
4061 {
4062 tree arg_types;
4065 /* Skip the size_t parameter. */
4067 /* Check the remaining parameters (if any). */
4071 ptr_type_node))
4073 }
4074 /* If we need a cookie, adjust the number of bytes allocated. */
4076 {
4077 /* Update the total size. */
4079 /* Set to (size_t)-1 if the size check fails. */
4083 /* Update the argument list to reflect the adjusted size. */
4085 }
4086 else
4088 }
4090 /* Tell our caller which function we decided to call. */
4094 /* Build the CALL_EXPR. */
4096 }
4098 /* Build a new call to operator(). This may change ARGS. */
4100 static tree
4102 {
4116 {
4118 /* It's no good looking for an overloaded operator() on a
4119 pointer-to-member-function. */
4120 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
4122 }
4125 {
4129 }
4130 else
4134 {
4138 }
4140 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4144 {
4152 }
4157 {
4166 {
4173 add_template_conv_candidate
4177 else
4181 }
4182 }
4186 {
4188 {
4192 }
4194 }
4195 else
4196 {
4199 {
4201 {
4205 }
4207 }
4208 /* Since cand->fn will be a type, not a function, for a conversion
4209 function, we must be careful not to unconditionally look at
4210 DECL_NAME here. */
4214 else
4215 {
4217 complain);
4220 }
4221 }
4223 /* Free all the conversions we allocated. */
4227 }
4229 /* Wrapper for above. */
4231 tree
4233 {
4234 tree ret;
4239 }
4241 /* Called by op_error to prepare format strings suitable for the error
4242 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4243 and a suffix (controlled by NTYPES). */
4247 {
4257 else
4261 }
4263 static void
4266 {
4271 else
4275 {
4281 else
4293 else
4303 else
4314 else
4324 else
4329 else
4333 else
4338 }
4339 }
4341 /* Return the implicit conversion sequence that could be used to
4342 convert E1 to E2 in [expr.cond]. */
4346 {
4352 /* [expr.cond]
4354 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4355 implicitly converted (clause _conv_) to the type "lvalue reference to
4356 T2", subject to the constraint that in the conversion the
4357 reference must bind directly (_dcl.init.ref_) to an lvalue. */
4359 {
4361 t1,
4362 e1,
4364 LOOKUP_NO_TEMP_BIND|LOOKUP_NO_RVAL_BIND
4366 complain);
4369 }
4371 /* [expr.cond]
4373 If E1 and E2 have class type, and the underlying class types are
4374 the same or one is a base class of the other: E1 can be converted
4375 to match E2 if the class of T2 is the same type as, or a base
4376 class of, the class of T1, and the cv-qualification of T2 is the
4377 same cv-qualification as, or a greater cv-qualification than, the
4378 cv-qualification of T1. If the conversion is applied, E1 is
4379 changed to an rvalue of type T2 that still refers to the original
4380 source class object (or the appropriate subobject thereof). */
4383 {
4385 {
4390 else
4393 }
4394 else
4396 }
4397 else
4398 /* [expr.cond]
4400 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4401 converted to the type that expression E2 would have if E2 were
4402 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4405 }
4407 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4408 arguments to the conditional expression. */
4410 static tree
4412 tsubst_flags_t complain)
4413 {
4414 tree arg2_type;
4415 tree arg3_type;
4424 /* As a G++ extension, the second argument to the conditional can be
4425 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4426 c'.) If the second operand is omitted, make sure it is
4427 calculated only once. */
4429 {
4434 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4437 else
4439 }
4441 /* If something has already gone wrong, just pass that fact up the
4442 tree. */
4452 {
4457 /* force_rvalue can return error_mark on valid arguments. */
4469 {
4470 /* Rely on the error messages of the scalar version. */
4479 {
4487 }
4491 /* We could pass complain & tf_warning to unsafe_conversion_p,
4492 but the warnings (like Wsign-conversion) have already been
4493 given by the scalar build_conditional_expr_1. We still check
4494 unsafe_conversion_p to forbid truncating long long -> float. */
4496 {
4501 }
4503 {
4508 }
4518 }
4522 {
4528 {
4532 {
4538 }
4540 {
4546 }
4549 }
4550 }
4556 {
4559 "incompatible vector types in conditional expression: "
4563 }
4569 }
4571 /* [expr.cond]
4573 The first expression is implicitly converted to bool (clause
4574 _conv_). */
4576 LOOKUP_NORMAL);
4580 /* [expr.cond]
4582 If either the second or the third operand has type (possibly
4583 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4584 array-to-pointer (_conv.array_), and function-to-pointer
4585 (_conv.func_) standard conversions are performed on the second
4586 and third operands. */
4590 {
4591 /* Do the conversions. We don't these for `void' type arguments
4592 since it can't have any effect and since decay_conversion
4593 does not handle that case gracefully. */
4601 /* [expr.cond]
4603 One of the following shall hold:
4605 --The second or the third operand (but not both) is a
4606 throw-expression (_except.throw_); the result is of the
4607 type of the other and is an rvalue.
4609 --Both the second and the third operands have type void; the
4610 result is of type void and is an rvalue.
4612 We must avoid calling force_rvalue for expressions of type
4613 "void" because it will complain that their value is being
4614 used. */
4617 {
4619 {
4623 }
4626 }
4629 {
4631 {
4635 }
4638 }
4641 else
4642 {
4644 {
4647 "second operand to the conditional operator "
4648 "is of type %<void%>, but the third operand is "
4650 else
4652 "third operand to the conditional operator "
4653 "is of type %<void%>, but the second operand is "
4655 }
4657 }
4661 }
4662 /* [expr.cond]
4664 Otherwise, if the second and third operand have different types,
4665 and either has (possibly cv-qualified) class type, an attempt is
4666 made to convert each of those operands to the type of the other. */
4669 {
4673 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4679 /* [expr.cond]
4681 If both can be converted, or one can be converted but the
4682 conversion is ambiguous, the program is ill-formed. If
4683 neither can be converted, the operands are left unchanged and
4684 further checking is performed as described below. If exactly
4685 one conversion is possible, that conversion is applied to the
4686 chosen operand and the converted operand is used in place of
4687 the original operand for the remainder of this section. */
4692 {
4697 }
4699 {
4703 /* Even if CONV2 is a valid conversion, the result of the
4704 conversion may be invalid. For example, if ARG3 has type
4705 "volatile X", and X does not have a copy constructor
4706 accepting a "volatile X&", then even if ARG2 can be
4707 converted to X, the conversion will fail. */
4710 }
4712 {
4718 }
4720 /* Free all the conversions we allocated. */
4726 /* If, after the conversion, both operands have class type,
4727 treat the cv-qualification of both operands as if it were the
4728 union of the cv-qualification of the operands.
4730 The standard is not clear about what to do in this
4731 circumstance. For example, if the first operand has type
4732 "const X" and the second operand has a user-defined
4733 conversion to "volatile X", what is the type of the second
4734 operand after this step? Making it be "const X" (matching
4735 the first operand) seems wrong, as that discards the
4736 qualification without actually performing a copy. Leaving it
4737 as "volatile X" seems wrong as that will result in the
4738 conditional expression failing altogether, even though,
4739 according to this step, the one operand could be converted to
4740 the type of the other. */
4748 }
4750 /* [expr.cond]
4752 If the second and third operands are glvalues of the same value
4753 category and have the same type, the result is of that type and
4754 value category. */
4758 {
4763 }
4765 /* [expr.cond]
4767 Otherwise, the result is an rvalue. If the second and third
4768 operand do not have the same type, and either has (possibly
4769 cv-qualified) class type, overload resolution is used to
4770 determine the conversions (if any) to be applied to the operands
4771 (_over.match.oper_, _over.built_). */
4775 {
4780 /* Rearrange the arguments so that add_builtin_candidate only has
4781 to know about two args. In build_builtin_candidate, the
4782 arguments are unscrambled. */
4787 COND_EXPR,
4788 NOP_EXPR,
4790 args,
4793 /* [expr.cond]
4795 If the overload resolution fails, the program is
4796 ill-formed. */
4799 {
4801 {
4804 }
4806 }
4809 {
4811 {
4814 }
4816 }
4818 /* [expr.cond]
4820 Otherwise, the conversions thus determined are applied, and
4821 the converted operands are used in place of the original
4822 operands for the remainder of this section. */
4831 }
4833 /* [expr.cond]
4835 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
4836 and function-to-pointer (_conv.func_) standard conversions are
4837 performed on the second and third operands.
4839 We need to force the lvalue-to-rvalue conversion here for class types,
4840 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
4841 that isn't wrapped with a TARGET_EXPR plays havoc with exception
4842 regions. */
4855 /* [expr.cond]
4857 After those conversions, one of the following shall hold:
4859 --The second and third operands have the same type; the result is of
4860 that type. */
4863 /* [expr.cond]
4865 --The second and third operands have arithmetic or enumeration
4866 type; the usual arithmetic conversions are performed to bring
4867 them to a common type, and the result is of that type. */
4872 {
4873 /* In this case, there is always a common type. */
4875 arg3_type);
4878 "implicit conversion from %qT to %qT to "
4880 loc);
4884 {
4888 /* Two enumerators from the same enumeration can have different
4894 }
4901 {
4905 }
4909 }
4910 /* [expr.cond]
4912 --The second and third operands have pointer type, or one has
4913 pointer type and the other is a null pointer constant; pointer
4914 conversions (_conv.ptr_) and qualification conversions
4915 (_conv.qual_) are performed to bring them to their composite
4916 pointer type (_expr.rel_). The result is of the composite
4917 pointer type.
4919 --The second and third operands have pointer to member type, or
4920 one has pointer to member type and the other is a null pointer
4921 constant; pointer to member conversions (_conv.mem_) and
4922 qualification conversions (_conv.qual_) are performed to bring
4923 them to a common type, whose cv-qualification shall match the
4924 cv-qualification of either the second or the third operand.
4925 The result is of the common type. */
4933 {
4936 complain);
4941 }
4944 {
4949 }
4954 valid_operands:
4957 /* Avoid folding within decltype (c++/42013) and noexcept. */
4960 /* We can't use result_type below, as fold might have returned a
4961 throw_expr. */
4964 {
4965 /* Expand both sides into the same slot, hopefully the target of
4966 the ?: expression. We used to check for TARGET_EXPRs here,
4967 but now we sometimes wrap them in NOP_EXPRs so the test would
4968 fail. */
4971 /* If this expression is an rvalue, but might be mistaken for an
4972 lvalue, we must add a NON_LVALUE_EXPR. */
4974 }
4975 else
4979 }
4981 /* Wrapper for above. */
4983 tree
4985 tsubst_flags_t complain)
4986 {
4987 tree ret;
4992 }
4994 /* OPERAND is an operand to an expression. Perform necessary steps
4995 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
4996 returned. */
4998 static tree
5000 {
5002 {
5005 /* Make sure the template type is instantiated now. */
5007 }
5010 }
5012 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5013 OVERLOAD) to the CANDIDATES, returning an updated list of
5014 CANDIDATES. The ARGS are the arguments provided to the call;
5015 if FIRST_ARG is non-null it is the implicit object argument,
5016 otherwise the first element of ARGS is used if needed. The
5017 EXPLICIT_TARGS are explicit template arguments provided.
5018 TEMPLATE_ONLY is true if only template functions should be
5019 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5020 add_function_candidate. */
5022 static void
5024 tree return_type,
5029 tsubst_flags_t complain)
5030 {
5031 tree ctype;
5035 unification_kind_t strict;
5036 tree fn;
5041 /* Precalculate special handling of constructors and conversion ops. */
5044 {
5048 /* We're doing return_type(x). */
5050 else
5051 /* We're doing x.operator return_type(). */
5053 /* [over.match.funcs] For conversion functions, the function
5054 is considered to be a member of the class of the implicit
5055 object argument for the purpose of defining the type of
5056 the implicit object parameter. */
5058 }
5059 else
5060 {
5062 {
5064 /* For list-initialization we consider explicit constructors
5065 and complain if one is chosen. */
5066 check_converting
5069 }
5070 else
5071 {
5074 }
5077 }
5081 else
5082 /* Delay creating the implicit this parameter until it is needed. */
5086 {
5087 tree fn_first_arg;
5097 /* Figure out which set of arguments to use. */
5099 {
5100 /* If this function is a non-static member and we didn't get an
5101 implicit object argument, move it out of args. */
5103 {
5105 tree arg;
5112 }
5116 }
5117 else
5118 {
5119 /* Otherwise, just use the list of arguments provided. */
5122 }
5126 fn,
5127 ctype,
5128 explicit_targs,
5129 fn_first_arg,
5130 fn_args,
5131 return_type,
5132 access_path,
5133 conversion_path,
5134 flags,
5135 strict,
5136 complain);
5139 fn,
5140 ctype,
5141 fn_first_arg,
5142 fn_args,
5143 access_path,
5144 conversion_path,
5145 flags,
5146 complain);
5147 }
5148 }
5150 static tree
5153 {
5156 tree fnname;
5174 {
5178 }
5179 else
5185 {
5190 /* Use build_op_new_call and build_op_delete_call instead. */
5194 /* Use build_op_call instead. */
5201 /* These are saved for the sake of warn_logical_operator. */
5207 }
5213 /* Use build_conditional_expr instead. */
5229 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5232 /* Add namespace-scope operators to the list of functions to
5233 consider. */
5243 /* Add class-member operators to the candidate set. */
5245 {
5246 tree fns;
5250 {
5253 }
5261 }
5262 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5263 only non-member functions that have type T1 or reference to
5264 cv-qualified-opt T1 for the first argument, if the first argument
5265 has an enumeration type, or T2 or reference to cv-qualified-opt
5266 T2 for the second argument, if the the second argument has an
5267 enumeration type. Filter out those that don't match. */
5269 {
5273 {
5283 {
5289 && (same_type_ignoring_top_level_qualifiers_p
5294 }
5296 /* No argument has an appropriate type, so remove this
5297 candidate function from the list. */
5299 {
5302 }
5303 }
5304 }
5310 {
5313 /* For these, the built-in candidates set is empty
5314 [over.match.oper]/3. We don't want non-strict matches
5315 because exact matches are always possible with built-in
5316 operators. The built-in candidate set for COMPONENT_REF
5317 would be empty too, but since there are no such built-in
5318 operators, we accept non-strict matches for them. */
5325 }
5329 {
5331 {
5334 /* Don't try anything fancy if we're not allowed to produce
5335 errors. */
5339 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5340 distinguish between prefix and postfix ++ and
5341 operator++() was used for both, so we allow this with
5342 -fpermissive. */
5343 else
5344 {
5350 }
5357 else
5363 /* The caller will deal with these. */
5373 {
5374 /* If one of the arguments of the operator represents
5375 an invalid use of member function pointer, try to report
5376 a meaningful error ... */
5381 else
5382 {
5383 /* ... Otherwise, report the more generic
5384 "no matching operator found" error */
5387 }
5388 }
5391 }
5392 }
5393 else
5394 {
5397 {
5399 {
5402 }
5404 }
5406 {
5412 else
5414 }
5415 else
5416 {
5417 /* Give any warnings we noticed during overload resolution. */
5419 {
5423 }
5425 /* Check for comparison of different enum types. */
5427 {
5439 {
5443 }
5447 }
5449 /* We need to strip any leading REF_BIND so that bitfields
5450 don't cause errors. This should not remove any important
5451 conversions, because builtins don't apply to class
5452 objects directly. */
5459 {
5463 else
5466 /* We need to call warn_logical_operator before
5467 converting arg2 to a boolean_type, but after
5468 decaying an enumerator to its value. */
5475 }
5477 {
5482 }
5484 }
5485 }
5487 user_defined_result_ready:
5489 /* Free all the conversions we allocated. */
5495 builtin:
5497 {
5510 /* Fall through. */
5549 complain),
5552 /* The caller will deal with these. */
5560 }
5562 }
5564 /* Wrapper for above. */
5566 tree
5570 {
5571 tree ret;
5577 }
5579 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5580 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5582 static bool
5584 {
5585 /* A template instance is never a usual deallocation function,
5586 regardless of its signature. */
5591 /* If a class T has a member deallocation function named operator delete
5592 with exactly one parameter, then that function is a usual
5593 (non-placement) deallocation function. If class T does not declare
5594 such an operator delete but does declare a member deallocation
5595 function named operator delete with exactly two parameters, the second
5596 of which has type std::size_t (18.2), then this function is a usual
5597 deallocation function. */
5604 }
5606 /* Build a call to operator delete. This has to be handled very specially,
5607 because the restrictions on what signatures match are different from all
5608 other call instances. For a normal delete, only a delete taking (void *)
5609 or (void *, size_t) is accepted. For a placement delete, only an exact
5610 match with the placement new is accepted.
5612 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5613 ADDR is the pointer to be deleted.
5614 SIZE is the size of the memory block to be deleted.
5615 GLOBAL_P is true if the delete-expression should not consider
5616 class-specific delete operators.
5617 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5619 If this call to "operator delete" is being generated as part to
5620 deallocate memory allocated via a new-expression (as per [expr.new]
5621 which requires that if the initialization throws an exception then
5622 we call a deallocation function), then ALLOC_FN is the allocation
5623 function. */
5625 tree
5629 {
5643 /* In [class.free]
5645 If the result of the lookup is ambiguous or inaccessible, or if
5646 the lookup selects a placement deallocation function, the
5647 program is ill-formed.
5649 Therefore, we ask lookup_fnfields to complain about ambiguity. */
5650 {
5654 }
5655 else
5661 /* Strip const and volatile from addr. */
5665 {
5666 /* "A declaration of a placement deallocation function matches the
5667 declaration of a placement allocation function if it has the same
5668 number of parameters and, after parameter transformations (8.3.5),
5669 all parameter types except the first are identical."
5671 So we build up the function type we want and ask instantiate_type
5672 to get it for us. */
5684 /* "If the lookup finds the two-parameter form of a usual deallocation
5685 function (3.7.4.2) and that function, considered as a placement
5686 deallocation function, would have been selected as a match for the
5687 allocation function, the program is ill-formed." */
5689 {
5690 /* But if the class has an operator delete (void *), then that is
5691 the usual deallocation function, so we shouldn't complain
5692 about using the operator delete (void *, size_t). */
5695 {
5700 }
5702 {
5705 }
5706 else
5708 ok:;
5709 }
5710 }
5711 else
5712 /* "Any non-placement deallocation function matches a non-placement
5713 allocation function. If the lookup finds a single matching
5714 deallocation function, that function will be called; otherwise, no
5715 deallocation function will be called." */
5718 {
5721 {
5723 /* "If a class T has a member deallocation function named
5724 operator delete with exactly one parameter, then that
5725 function is a usual (non-placement) deallocation
5726 function. If class T does not declare such an operator
5727 delete but does declare a member deallocation function named
5728 operator delete with exactly two parameters, the second of
5729 which has type std::size_t (18.2), then this function is a
5730 usual deallocation function."
5732 So (void*) beats (void*, size_t). */
5735 }
5736 }
5738 /* If we have a matching function, call it. */
5740 {
5743 /* If the FN is a member function, make sure that it is
5744 accessible. */
5747 complain);
5749 /* Core issue 901: It's ok to new a type with deleted delete. */
5754 {
5755 /* The placement args might not be suitable for overload
5756 resolution at this point, so build the call directly. */
5765 }
5766 else
5767 {
5768 tree ret;
5776 }
5777 }
5779 /* [expr.new]
5781 If no unambiguous matching deallocation function can be found,
5782 propagating the exception does not cause the object's memory to
5783 be freed. */
5785 {
5789 alloc_fn);
5791 }
5797 }
5799 /* If the current scope isn't allowed to access DECL along
5800 BASETYPE_PATH, give an error. The most derived class in
5801 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
5802 the declaration to use in the error diagnostic. */
5804 bool
5806 tsubst_flags_t complain)
5807 {
5811 {
5813 {
5818 else
5821 }
5823 }
5826 }
5828 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
5829 bitwise or of LOOKUP_* values. If any errors are warnings are
5830 generated, set *DIAGNOSTIC_FN to "error" or "warning",
5831 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
5832 to NULL. */
5834 static tree
5837 {
5850 else
5853 }
5855 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
5856 EXPR is implicitly converted to type TOTYPE.
5857 FN and ARGNUM are used for diagnostics. */
5859 static void
5861 {
5862 /* Issue warnings about peculiar, but valid, uses of NULL. */
5865 {
5866 source_location loc =
5873 else
5876 }
5878 /* Issue warnings if "false" is converted to a NULL pointer */
5881 {
5884 "converting %<false%> to pointer type for argument %P "
5886 else
5889 }
5890 }
5892 /* Perform the conversions in CONVS on the expression EXPR. FN and
5893 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
5894 indicates the `this' argument of a method. INNER is nonzero when
5895 being called to continue a conversion chain. It is negative when a
5896 reference binding will be applied, positive otherwise. If
5897 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
5898 conversions will be emitted if appropriate. If C_CAST_P is true,
5899 this conversion is coming from a C-style cast; in that case,
5900 conversions to inaccessible bases are permitted. */
5902 static tree
5906 {
5908 diagnostic_t diag_kind;
5924 {
5928 /* Give a helpful error if this is bad because of excess braces. */
5933 {
5939 }
5942 {
5944 {
5951 complain);
5955 complain);
5956 else
5958 }
5960 {
5964 complain);
5966 }
5971 complain);
5974 }
5983 }
5989 {
5991 {
5996 /* When converting from an init list we consider explicit
5997 constructors, but actually trying to call one is an error. */
5999 /* Unless this is for direct-list-initialization. */
6002 {
6007 }
6009 /* If we're initializing from {}, it's value-initialization. */
6013 {
6018 {
6021 }
6023 }
6027 /* Set user_conv_p on the argument conversions, so rvalue/base
6028 handling knows not to allow any more UDCs. */
6034 /* If this is a constructor or a function returning an aggr type,
6035 we need to build up a TARGET_EXPR. */
6037 {
6040 /* Remember that this was list-initialization. */
6043 }
6046 }
6050 {
6056 else
6058 }
6062 /* Convert a constant to its underlying value, unless we are
6063 about to bind it to a reference, in which case we need to
6064 leave it as an lvalue. */
6066 {
6069 /* If __null has been converted to an integer type, we do not
6070 want to warn about uses of EXPR as an integer, rather than
6071 as a pointer. */
6073 }
6076 /* We leave bad_p off ck_ambig because overload resolution considers
6077 it valid, it just fails when we try to perform it. So we need to
6078 check complain here, too. */
6080 {
6081 /* Call build_user_type_conversion again for the error. */
6083 complain);
6087 }
6091 {
6092 /* Conversion to std::initializer_list<T>. */
6100 /* Convert all the elements. */
6102 {
6112 }
6113 /* Build up the array. */
6114 elttype = cp_build_qualified_type
6118 /* Take the address explicitly rather than via decay_conversion
6119 to avoid the error about taking the address of a temporary. */
6125 /* Build up the initializer_list object. */
6133 }
6137 {
6146 }
6149 complain);
6156 };
6161 c_cast_p,
6162 complain);
6167 {
6175 /* Else fall through. */
6178 {
6179 /* We are going to bind a reference directly to a base-class
6180 subobject of EXPR. */
6181 /* Build an expression for `*((base*) &expr)'. */
6187 }
6189 /* Copy-initialization where the cv-unqualified version of the source
6190 type is the same class as, or a derived class of, the class of the
6191 destination [is treated as direct-initialization]. [dcl.init] */
6194 /* This conversion is being done in the context of a user-defined
6195 conversion (i.e. the second step of copy-initialization), so
6196 don't allow any more. */
6202 /* Copy-list-initialization doesn't actually involve a copy. */
6211 {
6215 {
6226 }
6228 /* If necessary, create a temporary.
6230 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6231 that need temporaries, even when their types are reference
6232 compatible with the type of reference being bound, so the
6233 upcoming call to cp_build_addr_expr doesn't fail. */
6237 {
6238 /* Otherwise, a temporary of type "cv1 T1" is created and
6239 initialized from the initializer expression using the rules
6240 for a non-reference copy-initialization (8.5). */
6249 {
6250 /* If the reference is volatile or non-const, we
6251 cannot create a temporary. */
6258 else
6262 }
6263 /* If the source is a packed field, and we must use a copy
6264 constructor, then building the target expr will require
6265 binding the field to the reference parameter to the
6266 copy constructor, and we'll end up with an infinite
6267 loop. If we can use a bitwise copy, then we'll be
6268 OK. */
6272 {
6276 }
6278 {
6281 }
6283 }
6285 /* Take the address of the thing to which we will bind the
6286 reference. */
6291 /* Convert it to a pointer to the type referred to by the
6292 reference. This will adjust the pointer if a derived to
6293 base conversion is being performed. */
6296 /* Convert the pointer to the desired reference type. */
6298 }
6304 /* Warn about deprecated conversion if appropriate. */
6320 }
6327 else
6331 }
6333 /* ARG is being passed to a varargs function. Perform any conversions
6334 required. Return the converted value. */
6336 tree
6338 {
6339 tree arg_type;
6342 /* [expr.call]
6344 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6345 standard conversions are performed. */
6348 /* [expr.call]
6350 If the argument has integral or enumeration type that is subject
6351 to the integral promotions (_conv.prom_), or a floating point
6352 type that is subject to the floating point promotion
6353 (_conv.fpprom_), the value of the argument is converted to the
6354 promoted type before the call. */
6359 {
6363 "implicit conversion from %qT to %qT when passing "
6367 }
6371 {
6373 {
6378 }
6380 }
6386 /* In a template (or ill-formed code), we can have an incomplete type
6387 even after require_complete_type_sfinae, in which case we don't know
6388 whether it has trivial copy or not. */
6390 {
6391 /* Build up a real lvalue-to-rvalue conversion in case the
6392 copy constructor is trivial but not callable. */
6396 /* [expr.call] 5.2.2/7:
6397 Passing a potentially-evaluated argument of class type (Clause 9)
6398 with a non-trivial copy constructor or a non-trivial destructor
6399 with no corresponding parameter is conditionally-supported, with
6400 implementation-defined semantics.
6402 We used to just warn here and do a bitwise copy, but now
6403 cp_expr_size will abort if we try to do that.
6405 If the call appears in the context of a sizeof expression,
6406 it is not potentially-evaluated. */
6410 {
6415 }
6416 }
6419 }
6421 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6423 tree
6425 {
6439 {
6440 /* Remove reference types so we don't ICE later on. */
6442 /* conditionally-supported behavior [expr.call] 5.2.2/7. */
6448 }
6451 }
6453 /* TYPE has been given to va_arg. Apply the default conversions which
6454 would have happened when passed via ellipsis. Return the promoted
6455 type, or the passed type if there is no change. */
6457 tree
6459 {
6460 tree promote;
6462 /* Perform the array-to-pointer and function-to-pointer
6463 conversions. */
6471 }
6473 /* ARG is a default argument expression being passed to a parameter of
6474 the indicated TYPE, which is a parameter to FN. PARMNUM is the
6475 zero-based argument number. Do any required conversions. Return
6476 the converted value. */
6479 void
6483 void
6487 tree
6489 tsubst_flags_t complain)
6490 {
6492 tree t;
6494 /* See through clones. */
6497 /* Detect recursion. */
6500 {
6504 }
6506 /* If the ARG is an unparsed default argument expression, the
6507 conversion cannot be performed. */
6509 {
6514 }
6521 /* Due to:
6523 [dcl.fct.default]
6525 The names in the expression are bound, and the semantic
6526 constraints are checked, at the point where the default
6527 expressions appears.
6529 we must not perform access checks here. */
6531 /* We must make a copy of ARG, in case subsequent processing
6532 alters any part of it. */
6536 complain);
6543 }
6545 /* Returns the type which will really be used for passing an argument of
6546 type TYPE. */
6548 tree
6550 {
6551 /* Pass classes with copy ctors by invisible reference. */
6553 {
6555 /* There are no other pointers to this temporary. */
6557 }
6566 }
6568 /* Actually perform the appropriate conversion. */
6570 tree
6572 {
6573 tree bitfield_type;
6575 /* If VAL is a bitfield, then -- since it has already been converted
6576 to TYPE -- it cannot have a precision greater than TYPE.
6578 If it has a smaller precision, we must widen it here. For
6579 example, passing "int f:3;" to a function expecting an "int" will
6580 not result in any conversion before this point.
6582 If the precision is the same we must not risk widening. For
6583 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
6584 often have type "int", even though the C++ type for the field is
6585 "long long". If the value is being passed to a function
6586 expecting an "int", then no conversions will be required. But,
6587 if we call convert_bitfield_to_declared_type, the bitfield will
6588 be converted to "long long". */
6595 ;
6596 /* Pass classes with copy ctors by invisible reference. */
6607 {
6616 }
6618 }
6620 /* Returns true iff FN is a function with magic varargs, i.e. ones for
6621 which no conversions at all should be done. This is true for some
6622 builtins which don't act like normal functions. */
6624 bool
6626 {
6632 {
6642 }
6645 }
6647 /* Returns the decl of the dispatcher function if FN is a function version. */
6649 tree
6651 {
6661 {
6665 }
6670 }
6672 /* fn is a function version dispatcher that is marked used. Mark all the
6673 semantically identical function versions it will dispatch as used. */
6675 void
6677 {
6694 /* All semantically identical versions are chained. Traverse and mark each
6695 one of them as used. */
6698 {
6701 }
6702 }
6704 /* Subroutine of the various build_*_call functions. Overload resolution
6705 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
6706 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
6707 bitmask of various LOOKUP_* flags which apply to the call itself. */
6709 static tree
6711 {
6719 tree val;
6728 /* In a template, there is no need to perform all of the work that
6729 is normally done. We are only interested in the type of the call
6730 expression, i.e., the return type of the function. Any semantic
6731 errors will be deferred until the template is instantiated. */
6733 {
6735 tree return_type;
6743 else
6744 {
6747 tree arg;
6755 }
6765 }
6767 /* Give any warnings we noticed during overload resolution. */
6769 {
6773 }
6775 /* Make =delete work with SFINAE. */
6780 {
6781 tree access_fn;
6782 /* If FN is a template function, two cases must be considered.
6783 For example:
6785 struct A {
6786 protected:
6787 template <class T> void f();
6788 };
6789 template <class T> struct B {
6790 protected:
6791 void g();
6792 };
6793 struct C : A, B<int> {
6794 using A::f; // #1
6795 using B<int>::g; // #2
6796 };
6798 In case #1 where `A::f' is a member template, DECL_ACCESS is
6799 recorded in the primary template but not in its specialization.
6800 We check access of FN using its primary template.
6802 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
6803 because it is a member of class template B, DECL_ACCESS is
6804 recorded in the specialization `B<int>::g'. We cannot use its
6805 primary template because `B<T>::g' and `B<int>::g' may have
6806 different access. */
6810 else
6815 }
6817 /* If we're checking for implicit delete, don't bother with argument
6818 conversions. */
6820 {
6822 {
6826 }
6830 /* Reject bad conversions now. */
6832 /* else continue to get conversion error. */
6833 }
6835 /* N3276 magic doesn't apply to nested calls. */
6839 /* Find maximum size of vector to hold converted arguments. */
6846 /* The implicit parameters to a constructor are not considered by overload
6847 resolution, and must be of the proper type. */
6849 {
6850 tree object_arg;
6852 {
6855 }
6856 else
6857 {
6860 }
6863 /* We should never try to call the abstract constructor. */
6867 {
6871 }
6872 }
6873 /* Bypass access control for 'this' parameter. */
6875 {
6878 ? first_arg
6881 tree converted_arg;
6882 tree base_binfo;
6885 {
6889 else
6891 }
6893 /* See if the function member or the whole class type is declared
6894 final and the call can be devirtualized. */
6899 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
6900 X is called for an object that is not of type X, or of a type
6901 derived from X, the behavior is undefined.
6903 So we can assume that anything passed as 'this' is non-null, and
6904 optimize accordingly. */
6906 /* Convert to the base in which the function was declared. */
6909 arg,
6912 /* Check that the base class is accessible. */
6915 {
6920 else
6922 }
6923 /* If fn was found by a using declaration, the conversion path
6924 will be to the derived class, not the base declaring fn. We
6925 must convert from derived to base. */
6936 else
6940 }
6945 {
6952 /* If the argument is NULL and used to (implicitly) instantiate a
6953 template function (and bind one of the template arguments to
6954 the type of 'long int'), we don't want to warn about passing NULL
6955 to non-pointer argument.
6956 For example, if we have this template function:
6958 template<typename T> void func(T x) {}
6960 we want to warn (when -Wconversion is enabled) in this case:
6962 void foo() {
6963 func<int>(NULL);
6964 }
6966 but not in this case:
6968 void foo() {
6969 func(NULL);
6970 }
6971 */
6978 /* Warn about initializer_list deduction that isn't currently in the
6979 working draft. */
6981 && flag_deduce_init_list
6985 {
6998 {
7005 }
7006 }
7008 conversion_warning
7009 ? complain
7016 else
7018 }
7020 /* Default arguments */
7022 {
7028 complain);
7029 }
7031 /* Ellipsis */
7033 {
7036 /* Do no conversions for magic varargs. */
7038 else
7041 }
7048 /* Avoid actually calling copy constructors and copy assignment operators,
7049 if possible. */
7056 {
7057 tree targ;
7059 tree fa;
7062 /* Pull out the real argument, disregarding const-correctness. */
7068 {
7073 }
7074 else
7079 else
7082 /* [class.copy]: the copy constructor is implicitly defined even if
7083 the implementation elided its use. */
7085 {
7088 }
7090 /* If we're creating a temp and we already have one, don't create a
7091 new one. If we're not creating a temp but we get one, use
7092 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7093 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7094 temp or an INIT_EXPR otherwise. */
7097 {
7102 }
7104 {
7106 complain));
7110 }
7111 }
7115 {
7116 tree to = stabilize_reference
7123 {
7124 /* Avoid copying empty classes. */
7129 }
7131 {
7134 }
7135 else
7136 {
7137 /* We must only copy the non-tail padding parts. */
7145 build_index_type
7154 }
7157 }
7162 /* FIXME handle trivial default constructor, too. */
7164 /* For calls to a multi-versioned function, overload resolution
7165 returns the function with the highest target priority, that is,
7166 the version that will checked for dispatching first. If this
7167 version is inlinable, a direct call to this version can be made
7168 otherwise the call should go through the dispatcher. */
7173 {
7179 }
7186 /* Don't mess with virtual lookup in fold_non_dependent_expr; virtual
7187 functions can't be constexpr. */
7189 {
7190 tree t;
7196 /* Warn about deprecated virtual functions now, since we're about
7197 to throw away the decl. */
7202 complain);
7208 else
7211 }
7212 else
7213 {
7217 }
7220 }
7222 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7223 This function performs no overload resolution, conversion, or other
7224 high-level operations. */
7226 tree
7228 tsubst_flags_t complain)
7229 {
7230 tree fndecl;
7233 /* Remember roughly where this call is. */
7240 /* Check that arguments to builtin functions match the expectations. */
7247 /* If it is a built-in array notation function, then the return type of
7248 the function is the element type of the array passed in as array
7249 notation (i.e. the first parameter of the function). */
7251 {
7260 {
7261 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7262 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7263 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7264 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7265 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7266 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7267 The pre-defined return-type is the correct one. */
7271 }
7272 }
7274 /* Some built-in function calls will be evaluated at compile-time in
7275 fold (). Set optimize to 1 when folding __builtin_constant_p inside
7276 a constexpr function so that fold_builtin_1 doesn't fold it to 0. */
7279 && current_function_decl
7288 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7289 function call is either the operand of a decltype-specifier or the
7290 right operand of a comma operator that is the operand of a
7291 decltype-specifier, a temporary object is not introduced for the
7292 prvalue. The type of the prvalue may be incomplete. */
7294 {
7301 }
7303 }
7307 /* Make an expression which yields the address of the Java interface
7308 method FN. This is achieved by generating a call to libjava's
7309 _Jv_LookupInterfaceMethodIdx(). */
7311 static tree
7313 {
7319 {
7323 java_iface_lookup_fn
7326 }
7328 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7329 This is the first entry in the vtable. */
7331 tf_warning_or_error),
7332 integer_zero_node);
7334 /* Get the java.lang.Class pointer for the interface being called. */
7339 {
7341 iface);
7343 }
7347 /* Determine the itable index of FN. */
7350 {
7355 i++;
7356 }
7361 java_iface_lookup_fn);
7364 }
7366 /* Returns the value to use for the in-charge parameter when making a
7367 call to a function with the indicated NAME.
7369 FIXME:Can't we find a neater way to do this mapping? */
7371 tree
7373 {
7384 /* This function should only be called with one of the names listed
7385 above. */
7388 }
7390 /* Build a call to a constructor, destructor, or an assignment
7391 operator for INSTANCE, an expression with class type. NAME
7392 indicates the special member function to call; *ARGS are the
7393 arguments. ARGS may be NULL. This may change ARGS. BINFO
7394 indicates the base of INSTANCE that is to be passed as the `this'
7395 parameter to the member function called.
7397 FLAGS are the LOOKUP_* flags to use when processing the call.
7399 If NAME indicates a complete object constructor, INSTANCE may be
7400 NULL_TREE. In this case, the caller will call build_cplus_new to
7401 store the newly constructed object into a VAR_DECL. */
7403 tree
7406 {
7407 tree fns;
7408 /* The type of the subobject to be constructed or destroyed. */
7409 tree class_type;
7411 tree ret;
7420 {
7421 /* Resolve the name. */
7426 }
7432 /* Handle the special case where INSTANCE is NULL_TREE. */
7434 {
7437 }
7438 else
7439 {
7445 /* Convert to the base class, if necessary. */
7448 {
7450 /* For constructors and destructors, either the base is
7451 non-virtual, or it is virtual but we are doing the
7452 conversion from a constructor or destructor for the
7453 complete object. In either case, we can convert
7454 statically. */
7456 else
7457 /* However, for assignment operators, we must convert
7458 dynamically if the base is virtual. */
7461 }
7462 }
7468 /* When making a call to a constructor or destructor for a subobject
7469 that uses virtual base classes, pass down a pointer to a VTT for
7470 the subobject. */
7474 {
7475 tree vtt;
7476 tree sub_vtt;
7478 /* If the current function is a complete object constructor
7479 or destructor, then we fetch the VTT directly.
7480 Otherwise, we look it up using the VTT we were given. */
7488 current_vtt_parm,
7489 vtt);
7492 else
7496 {
7499 }
7502 }
7507 complain);
7521 }
7523 /* Return the NAME, as a C string. The NAME indicates a function that
7524 is a member of TYPE. *FREE_P is set to true if the caller must
7525 free the memory returned.
7527 Rather than go through all of this, we should simply set the names
7528 of constructors and destructors appropriately, and dispense with
7529 ctor_identifier, dtor_identifier, etc. */
7533 {
7536 /* Assume that we will not allocate memory. */
7538 /* Constructors and destructors are special. */
7540 {
7541 pretty_name
7543 /* For a destructor, add the '~'. */
7547 {
7549 /* Remember that we need to free the memory allocated. */
7551 }
7552 }
7554 {
7557 TFF_PLAIN_IDENTIFIER),
7558 NULL);
7559 /* Remember that we need to free the memory allocated. */
7561 }
7562 else
7566 }
7568 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
7569 be set, upon return, to the function called. ARGS may be NULL.
7570 This may change ARGS. */
7572 static tree
7576 {
7581 tree optype;
7583 tree name;
7586 tree call;
7587 tree fn;
7590 tree orig_instance;
7591 tree orig_fns;
7597 /* We don't know what function we're going to call, yet. */
7606 {
7610 }
7615 /* Dismantle the baselink to collect all the information we need. */
7623 {
7627 }
7638 {
7643 }
7646 /* Under DR 147 A::A() is an invalid constructor call,
7647 not a functional cast. */
7649 {
7659 complain);
7661 }
7663 /* Figure out whether to skip the first argument for the error
7664 message we will display to users if an error occurs. We don't
7665 want to display any compiler-generated arguments. The "this"
7666 pointer hasn't been added yet. However, we must remove the VTT
7667 pointer if this is a call to a base-class constructor or
7668 destructor. */
7671 {
7672 /* Callers should explicitly indicate whether they want to construct
7673 the complete object or just the part without virtual bases. */
7675 /* Similarly for destructors. */
7677 /* Remove the VTT pointer, if present. */
7681 }
7683 /* Process the argument list. */
7685 {
7689 }
7691 /* Consider the object argument to be used even if we end up selecting a
7692 static member function. */
7695 /* It's OK to call destructors and constructors on cv-qualified objects.
7696 Therefore, convert the INSTANCE to the unqualified type, if
7697 necessary. */
7700 {
7702 {
7706 }
7707 }
7713 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7716 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
7717 initializer, not T({ }). */
7721 {
7728 /* If the initializer list has no elements and T is a class type with
7729 a default constructor, the object is value-initialized. Handle
7730 this here so we don't need to handle it wherever we use
7731 build_special_member_call. */
7734 /* For a user-provided default constructor, use the normal
7735 mechanisms so that protected access works. */
7740 /* If BASETYPE is an aggregate, we need to do aggregate
7741 initialization. */
7746 {
7753 }
7755 /* Otherwise go ahead with overload resolution. */
7760 }
7761 else
7762 {
7766 }
7771 {
7773 {
7780 else
7781 {
7784 tree arglist;
7795 }
7797 }
7799 }
7800 else
7801 {
7804 {
7807 tree arglist;
7810 {
7816 arglist);
7820 }
7822 }
7823 else
7824 {
7832 {
7833 /* This is not an error, it is runtime undefined
7834 behavior. */
7843 fn);
7844 }
7848 {
7853 {
7854 /* We captured 'this' in the current lambda now that
7855 we know we really need it. */
7857 }
7858 else
7859 {
7862 fn);
7864 }
7865 }
7868 {
7869 /* Optimize away vtable lookup if we know that this
7870 function can't be overridden. We need to check if
7871 the context and the type where we found fn are the same,
7872 actually FN might be defined in a different class
7873 type because of a using-declaration. In this case, we
7874 do not want to perform a non-virtual call. */
7876 && same_type_ignoring_top_level_qualifiers_p
7882 /* Now we know what function is being called. */
7885 /* Build the actual CALL_EXPR. */
7887 /* In an expression of the form `a->f()' where `f' turns
7888 out to be a static member function, `a' is
7889 none-the-less evaluated. */
7898 /* An explicit call of the form "x->~X()" has type
7899 "void". However, on platforms where destructors
7900 return "this" (i.e., those where
7901 targetm.cxx.cdtor_returns_this is true), such calls
7902 will appear to have a return value of pointer type
7903 to the low-level call machinery. We do not want to
7904 change the low-level machinery, since we want to be
7905 able to optimize "delete f()" on such platforms as
7906 "operator delete(~X(f()))" (rather than generating
7907 "t = f(), ~X(t), operator delete (t)"). */
7909 }
7910 }
7911 }
7914 {
7920 {
7923 }
7926 call = (build_min_non_dep_call_vec
7930 orig_args));
7935 }
7937 /* Free all the conversions we allocated. */
7944 }
7946 /* Wrapper for above. */
7948 tree
7952 {
7953 tree ret;
7959 }
7961 /* Returns true iff standard conversion sequence ICS1 is a proper
7962 subsequence of ICS2. */
7964 static bool
7966 {
7967 /* We can assume that a conversion of the same code
7968 between the same types indicates a subsequence since we only get
7969 here if the types we are converting from are the same. */
7976 {
7986 /* At this point, ICS1 cannot be a proper subsequence of
7987 ICS2. We can get a USER_CONV when we are comparing the
7988 second standard conversion sequence of two user conversion
7989 sequences. */
7999 }
8000 }
8002 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8003 be any _TYPE nodes. */
8005 bool
8007 {
8011 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8012 considers every class derived from itself. */
8015 }
8017 /* We build the ICS for an implicit object parameter as a pointer
8018 conversion sequence. However, such a sequence should be compared
8019 as if it were a reference conversion sequence. If ICS is the
8020 implicit conversion sequence for an implicit object parameter,
8021 modify it accordingly. */
8023 static void
8025 {
8027 {
8028 /* [over.match.funcs]
8030 For non-static member functions, the type of the
8031 implicit object parameter is "reference to cv X"
8032 where X is the class of which the function is a
8033 member and cv is the cv-qualification on the member
8034 function declaration. */
8036 tree reference_type;
8038 /* The `this' parameter is a pointer to a class type. Make the
8039 implicit conversion talk about a reference to that same class
8040 type. */
8053 }
8054 }
8056 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8057 and return the initial reference binding conversion. Otherwise,
8058 leave *ICS unchanged and return NULL. */
8062 {
8064 {
8069 }
8072 }
8074 /* Compare two implicit conversion sequences according to the rules set out in
8075 [over.ics.rank]. Return values:
8077 1: ics1 is better than ics2
8078 -1: ics2 is better than ics1
8079 0: ics1 and ics2 are indistinguishable */
8081 static int
8083 {
8084 tree from_type1;
8085 tree from_type2;
8086 tree to_type1;
8087 tree to_type2;
8094 /* REF_BINDING is nonzero if the result of the conversion sequence
8095 is a reference type. In that case REF_CONV is the reference
8096 binding conversion. */
8100 /* Handle implicit object parameters. */
8104 /* Handle reference parameters. */
8108 /* List-initialization sequence L1 is a better conversion sequence than
8109 list-initialization sequence L2 if L1 converts to
8110 std::initializer_list<X> for some X and L2 does not. */
8116 /* [over.ics.rank]
8118 When comparing the basic forms of implicit conversion sequences (as
8119 defined in _over.best.ics_)
8121 --a standard conversion sequence (_over.ics.scs_) is a better
8122 conversion sequence than a user-defined conversion sequence
8123 or an ellipsis conversion sequence, and
8125 --a user-defined conversion sequence (_over.ics.user_) is a
8126 better conversion sequence than an ellipsis conversion sequence
8127 (_over.ics.ellipsis_). */
8137 {
8138 /* Both ICS are bad. We try to make a decision based on what would
8139 have happened if they'd been good. This is not an extension,
8140 we'll still give an error when we build up the call; this just
8141 helps us give a more helpful error message. */
8150 /* We couldn't make up our minds; try to figure it out below. */
8151 }
8154 /* Both conversions are ellipsis conversions. */
8157 /* User-defined conversion sequence U1 is a better conversion sequence
8158 than another user-defined conversion sequence U2 if they contain the
8159 same user-defined conversion operator or constructor and if the sec-
8160 ond standard conversion sequence of U1 is better than the second
8161 standard conversion sequence of U2. */
8163 /* Handle list-conversion with the same code even though it isn't always
8164 ranked as a user-defined conversion and it doesn't have a second
8165 standard conversion sequence; it will still have the desired effect.
8166 Specifically, we need to do the reference binding comparison at the
8167 end of this function. */
8170 {
8186 {
8189 }
8190 else
8191 {
8192 /* For ambiguous or aggregate conversions, use the target type as
8193 a proxy for the conversion function. */
8196 }
8198 /* We can just fall through here, after setting up
8199 FROM_TYPE1 and FROM_TYPE2. */
8202 }
8203 else
8204 {
8208 /* We're dealing with two standard conversion sequences.
8210 [over.ics.rank]
8212 Standard conversion sequence S1 is a better conversion
8213 sequence than standard conversion sequence S2 if
8215 --S1 is a proper subsequence of S2 (comparing the conversion
8216 sequences in the canonical form defined by _over.ics.scs_,
8217 excluding any Lvalue Transformation; the identity
8218 conversion sequence is considered to be a subsequence of
8219 any non-identity conversion sequence */
8230 }
8232 /* One sequence can only be a subsequence of the other if they start with
8233 the same type. They can start with different types when comparing the
8234 second standard conversion sequence in two user-defined conversion
8235 sequences. */
8237 {
8242 }
8244 /* [over.ics.rank]
8246 Or, if not that,
8248 --the rank of S1 is better than the rank of S2 (by the rules
8249 defined below):
8251 Standard conversion sequences are ordered by their ranks: an Exact
8252 Match is a better conversion than a Promotion, which is a better
8253 conversion than a Conversion.
8255 Two conversion sequences with the same rank are indistinguishable
8256 unless one of the following rules applies:
8258 --A conversion that does not a convert a pointer, pointer to member,
8259 or std::nullptr_t to bool is better than one that does.
8261 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8262 so that we do not have to check it explicitly. */
8271 /* A conversion from scalar arithmetic type to complex is worse than a
8272 conversion between scalar arithmetic types. */
8279 {
8282 else
8284 }
8290 {
8295 }
8296 /* The rules for pointers to members A::* are just like the rules
8297 for pointers A*, except opposite: if B is derived from A then
8298 A::* converts to B::*, not vice versa. For that reason, we
8299 switch the from_ and to_ variables here. */
8306 {
8311 }
8316 {
8317 /* This was one of the pointer or pointer-like conversions.
8319 [over.ics.rank]
8321 --If class B is derived directly or indirectly from class A,
8322 conversion of B* to A* is better than conversion of B* to
8323 void*, and conversion of A* to void* is better than
8324 conversion of B* to void*. */
8327 {
8329 deref_from_type2))
8332 deref_from_type1))
8334 }
8337 {
8339 {
8341 {
8343 deref_to_type1))
8345 }
8346 /* We know that DEREF_TO_TYPE1 is `void' here. */
8348 deref_to_type2))
8350 }
8351 }
8354 {
8355 /* [over.ics.rank]
8357 --If class B is derived directly or indirectly from class A
8358 and class C is derived directly or indirectly from B,
8360 --conversion of C* to B* is better than conversion of C* to
8361 A*,
8363 --conversion of B* to A* is better than conversion of C* to
8364 A* */
8366 {
8368 deref_to_type2))
8371 deref_to_type1))
8373 }
8375 {
8377 deref_from_type1))
8380 deref_from_type2))
8382 }
8383 }
8384 }
8387 {
8390 /* [over.ics.rank]
8392 --binding of an expression of type C to a reference of type
8393 B& is better than binding an expression of type C to a
8394 reference of type A&
8396 --conversion of C to B is better than conversion of C to A, */
8399 {
8404 }
8405 }
8408 {
8411 /* [over.ics.rank]
8413 --binding of an expression of type B to a reference of type
8414 A& is better than binding an expression of type C to a
8415 reference of type A&,
8417 --conversion of B to A is better than conversion of C to A */
8420 {
8425 }
8426 }
8428 /* [over.ics.rank]
8430 --S1 and S2 differ only in their qualification conversion and yield
8431 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
8432 qualification signature of type T1 is a proper subset of the cv-
8433 qualification signature of type T2 */
8437 {
8441 }
8443 /* [over.ics.rank]
8445 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
8446 to an implicit object parameter, and either S1 binds an lvalue reference
8447 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
8448 reference to an rvalue and S2 binds an lvalue reference
8449 (C++0x draft standard, 13.3.3.2)
8451 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
8452 types to which the references refer are the same type except for
8453 top-level cv-qualifiers, and the type to which the reference
8454 initialized by S2 refers is more cv-qualified than the type to
8455 which the reference initialized by S1 refers.
8457 DR 1328 [over.match.best]: the context is an initialization by
8458 conversion function for direct reference binding (13.3.1.6) of a
8459 reference to function type, the return type of F1 is the same kind of
8460 reference (i.e. lvalue or rvalue) as the reference being initialized,
8461 and the return type of F2 is not. */
8464 {
8471 {
8474 }
8479 }
8481 /* Neither conversion sequence is better than the other. */
8483 }
8485 /* The source type for this standard conversion sequence. */
8487 static tree
8489 {
8491 {
8496 }
8498 }
8500 /* Note a warning about preferring WINNER to LOSER. We do this by storing
8501 a pointer to LOSER and re-running joust to produce the warning if WINNER
8502 is actually used. */
8504 static void
8506 {
8512 }
8514 /* Compare two candidates for overloading as described in
8515 [over.match.best]. Return values:
8517 1: cand1 is better than cand2
8518 -1: cand2 is better than cand1
8519 0: cand1 and cand2 are indistinguishable */
8521 static int
8523 tsubst_flags_t complain)
8524 {
8530 /* Candidates that involve bad conversions are always worse than those
8531 that don't. */
8537 /* If we have two pseudo-candidates for conversions to the same type,
8538 or two candidates for the same function, arbitrarily pick one. */
8543 /* Prefer a non-deleted function over an implicitly deleted move
8544 constructor or assignment operator. This differs slightly from the
8545 wording for issue 1402 (which says the move op is ignored by overload
8546 resolution), but this way produces better error messages. */
8550 {
8557 }
8559 /* a viable function F1
8560 is defined to be a better function than another viable function F2 if
8561 for all arguments i, ICSi(F1) is not a worse conversion sequence than
8562 ICSi(F2), and then */
8564 /* for some argument j, ICSj(F1) is a better conversion sequence than
8565 ICSj(F2) */
8567 /* For comparing static and non-static member functions, we ignore
8568 the implicit object parameter of the non-static function. The
8569 standard says to pretend that the static function has an object
8570 parm, but that won't work with operator overloading. */
8573 {
8579 /* We're comparing a near-match list constructor and a near-match
8580 non-list constructor. Just treat them as unordered. */
8587 else
8588 {
8591 }
8592 }
8595 {
8601 {
8603 && warn_sign_promo
8615 {
8622 else
8627 {
8631 }
8632 else
8634 }
8637 {
8640 }
8642 }
8643 }
8645 /* warn about confusing overload resolution for user-defined conversions,
8646 either between a constructor and a conversion op, or between two
8647 conversion ops. */
8652 {
8658 else
8661 /* We don't want to complain about `X::operator T1 ()'
8662 beating `X::operator T2 () const', when T2 is a no less
8663 cv-qualified version of T1. */
8666 {
8671 {
8674 }
8677 }
8678 else
8684 {
8691 {
8693 }
8694 }
8695 else
8697 }
8702 /* DR 495 moved this tiebreaker above the template ones. */
8703 /* or, if not that,
8704 the context is an initialization by user-defined conversion (see
8705 _dcl.init_ and _over.match.user_) and the standard conversion
8706 sequence from the return type of F1 to the destination type (i.e.,
8707 the type of the entity being initialized) is a better conversion
8708 sequence than the standard conversion sequence from the return type
8709 of F2 to the destination type. */
8712 {
8716 }
8718 /* or, if not that,
8719 F1 is a non-template function and F2 is a template function
8720 specialization. */
8727 /* or, if not that,
8728 F1 and F2 are template functions and the function template for F1 is
8729 more specialized than the template for F2 according to the partial
8730 ordering rules. */
8733 {
8734 winner = more_specialized_fn
8737 /* [temp.func.order]: The presence of unused ellipsis and default
8738 arguments has no effect on the partial ordering of function
8739 templates. add_function_candidate() will not have
8740 counted the "this" argument for constructors. */
8744 }
8746 /* Check whether we can discard a builtin candidate, either because we
8747 have two identical ones or matching builtin and non-builtin candidates.
8749 (Pedantically in the latter case the builtin which matched the user
8750 function should not be added to the overload set, but we spot it here.
8752 [over.match.oper]
8753 ... the builtin candidates include ...
8754 - do not have the same parameter type list as any non-template
8755 non-member candidate. */
8758 {
8764 {
8766 /* Two built-in candidates; arbitrarily pick one. */
8769 /* cand1 is built-in; prefer cand2. */
8771 else
8772 /* cand2 is built-in; prefer cand1. */
8774 }
8775 }
8777 /* For candidates of a multi-versioned function, make the version with
8778 the highest priority win. This version will be checked for dispatching
8779 first. If this version can be inlined into the caller, the front-end
8780 will simply make a direct call to this function. */
8786 {
8792 /* Check if cand1->fn and cand2->fn are versions of the same function. It
8793 is possible that cand1->fn and cand2->fn are function versions but of
8794 different functions. Check types to see if they are versions of the same
8795 function. */
8798 {
8799 /* Always make the version with the higher priority, more
8800 specialized, win. */
8804 else
8806 }
8807 }
8809 /* If the two function declarations represent the same function (this can
8810 happen with declarations in multiple scopes and arg-dependent lookup),
8811 arbitrarily choose one. But first make sure the default args we're
8812 using match. */
8815 {
8822 {
8823 /* Don't crash if the fn is variadic. */
8828 }
8836 {
8839 {
8841 {
8843 {
8845 "default argument mismatch in "
8847 {
8852 }
8853 }
8854 else
8856 }
8857 else
8860 }
8863 }
8866 }
8868 tweak:
8870 /* Extension: If the worst conversion for one candidate is worse than the
8871 worst conversion for the other, take the first. */
8873 {
8878 {
8883 }
8889 {
8890 /* Don't choose a deleted function over ambiguity. */
8894 {
8896 "ISO C++ says that these are ambiguous, even "
8897 "though the worst conversion for the first is better than "
8901 }
8902 else
8905 }
8906 }
8910 }
8912 /* Given a list of candidates for overloading, find the best one, if any.
8913 This algorithm has a worst case of O(2n) (winner is last), and a best
8914 case of O(n/2) (totally ambiguous); much better than a sorting
8915 algorithm. */
8919 {
8924 /* Walk through the list once, comparing each current champ to the next
8925 candidate, knocking out a candidate or two with each comparison. */
8928 {
8932 else
8933 {
8935 {
8940 }
8941 else
8942 {
8945 }
8948 }
8949 }
8951 /* Make sure the champ is better than all the candidates it hasn't yet
8952 been compared to. */
8955 challenger != champ
8958 {
8962 }
8965 }
8967 /* Returns nonzero if things of type FROM can be converted to TO. */
8969 bool
8971 {
8973 /* implicit_conversion only considers user-defined conversions
8974 if it has an expression for the call argument list. */
8978 }
8980 /* Returns nonzero if things of type FROM can be converted to TO with a
8981 standard conversion. */
8983 bool
8985 {
8987 }
8989 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
8991 bool
8993 tsubst_flags_t complain)
8994 {
8999 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9001 /* We want to discard any access checks done for this test,
9002 as we might not be in the appropriate access context and
9003 we'll do the check again when we actually perform the
9004 conversion. */
9011 /* Discard the access checks now. */
9013 /* Free all the conversions we allocated. */
9017 }
9019 /* Like can_convert_arg, but allows dubious conversions as well. */
9021 bool
9023 tsubst_flags_t complain)
9024 {
9028 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9030 /* Try to perform the conversion. */
9033 /* Free all the conversions we allocated. */
9037 }
9039 /* Convert EXPR to TYPE. Return the converted expression.
9041 Note that we allow bad conversions here because by the time we get to
9042 this point we are committed to doing the conversion. If we end up
9043 doing a bad conversion, convert_like will complain. */
9045 tree
9048 {
9056 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9064 {
9066 {
9067 /* If expr has unknown type, then it is an overloaded function.
9068 Call instantiate_type to get good error messages. */
9073 else
9076 }
9078 }
9080 {
9081 /* In a template, we are only concerned about determining the
9082 type of non-dependent expressions, so we do not have to
9083 perform the actual conversion. But for initializers, we
9084 need to be able to perform it at instantiation
9085 (or fold_non_dependent_expr) time. */
9089 }
9090 else
9093 /* Free all the conversions we allocated. */
9097 }
9099 tree
9101 {
9103 LOOKUP_IMPLICIT);
9104 }
9106 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9107 permitted. If the conversion is valid, the converted expression is
9108 returned. Otherwise, NULL_TREE is returned, except in the case
9109 that TYPE is a class type; in that case, an error is issued. If
9110 C_CAST_P is true, then this direct-initialization is taking
9111 place as part of a static_cast being attempted as part of a C-style
9112 cast. */
9114 tree
9116 tree expr,
9118 tsubst_flags_t complain)
9119 {
9125 /* [dcl.init]
9127 If the destination type is a (possibly cv-qualified) class type:
9129 -- If the initialization is direct-initialization ...,
9130 constructors are considered. ... If no constructor applies, or
9131 the overload resolution is ambiguous, the initialization is
9132 ill-formed. */
9134 {
9140 }
9142 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9146 c_cast_p,
9150 else
9153 c_cast_p,
9154 complain);
9156 /* Free all the conversions we allocated. */
9160 }
9162 /* When initializing a reference that lasts longer than a full-expression,
9163 this special rule applies:
9165 [class.temporary]
9167 The temporary to which the reference is bound or the temporary
9168 that is the complete object to which the reference is bound
9169 persists for the lifetime of the reference.
9171 The temporaries created during the evaluation of the expression
9172 initializing the reference, except the temporary to which the
9173 reference is bound, are destroyed at the end of the
9174 full-expression in which they are created.
9176 In that case, we store the converted expression into a new
9177 VAR_DECL in a new scope.
9179 However, we want to be careful not to create temporaries when
9180 they are not required. For example, given:
9182 struct B {};
9183 struct D : public B {};
9184 D f();
9185 const B& b = f();
9187 there is no need to copy the return value from "f"; we can just
9188 extend its lifetime. Similarly, given:
9190 struct S {};
9191 struct T { operator S(); };
9192 T t;
9193 const S& s = t;
9195 we can extend the lifetime of the return value of the conversion
9196 operator.
9198 The next several functions are involved in this lifetime extension. */
9200 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9201 reference is being bound to a temporary. Create and return a new
9202 VAR_DECL with the indicated TYPE; this variable will store the value to
9203 which the reference is bound. */
9205 tree
9207 {
9208 tree var;
9210 /* Create the variable. */
9213 /* Register the variable. */
9216 {
9217 /* Namespace-scope or local static; give it a mangled name. */
9218 /* FIXME share comdat with decl? */
9219 tree name;
9227 }
9228 else
9229 /* Create a new cleanup level if necessary. */
9233 }
9235 /* EXPR is the initializer for a variable DECL of reference or
9236 std::initializer_list type. Create, push and return a new VAR_DECL
9237 for the initializer so that it will live as long as DECL. Any
9238 cleanup for the new variable is returned through CLEANUP, and the
9239 code to initialize the new variable is returned through INITP. */
9241 static tree
9244 {
9245 tree init;
9246 tree type;
9247 tree var;
9249 /* Create the temporary variable. */
9253 /* If the rvalue is the result of a function call it will be
9254 a TARGET_EXPR. If it is some other construct (such as a
9255 member access expression where the underlying object is
9256 itself the result of a function call), turn it into a
9257 TARGET_EXPR here. It is important that EXPR be a
9258 TARGET_EXPR below since otherwise the INIT_EXPR will
9259 attempt to make a bitwise copy of EXPR to initialize
9260 VAR. */
9266 {
9270 }
9272 /* Recursively extend temps in this initializer. */
9276 /* Any reference temp has a non-trivial initializer. */
9279 /* If the initializer is constant, put it in DECL_INITIAL so we get
9280 static initialization and use in constant expressions. */
9283 {
9285 {
9286 /* 5.19 says that a constant expression can include an
9287 lvalue-rvalue conversion applied to "a glvalue of literal type
9288 that refers to a non-volatile temporary object initialized
9289 with a constant expression". Rather than try to communicate
9290 that this VAR_DECL is a temporary, just mark it constexpr.
9292 Currently this is only useful for initializer_list temporaries,
9293 since reference vars can't appear in constant expressions. */
9297 }
9300 }
9301 else
9302 /* Create the INIT_EXPR that will initialize the temporary
9303 variable. */
9306 {
9311 else
9312 {
9316 }
9318 /* We must be careful to destroy the temporary only
9319 after its initialization has taken place. If the
9320 initialization throws an exception, then the
9321 destructor should not be run. We cannot simply
9322 transform INIT into something like:
9324 (INIT, ({ CLEANUP_STMT; }))
9326 because emit_local_var always treats the
9327 initializer as a full-expression. Thus, the
9328 destructor would run too early; it would run at the
9329 end of initializing the reference variable, rather
9330 than at the end of the block enclosing the
9331 reference variable.
9333 The solution is to pass back a cleanup expression
9334 which the caller is responsible for attaching to
9335 the statement tree. */
9336 }
9337 else
9338 {
9341 {
9344 tls_aggregates);
9345 else
9347 static_aggregates);
9348 }
9349 else
9350 /* Check whether the dtor is callable. */
9352 }
9356 }
9358 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
9359 initializing a variable of that TYPE. */
9361 tree
9364 {
9372 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9378 {
9380 {
9389 else
9393 }
9395 }
9398 /* Perform the conversion. */
9401 /* We gave an error in build_user_type_conversion_1. */
9403 else
9406 /* Free all the conversions we allocated. */
9410 }
9412 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
9413 which is bound either to a reference or a std::initializer_list. */
9415 static tree
9417 {
9422 {
9426 }
9429 /* Deal with binding to a subobject. */
9433 {
9439 }
9441 }
9443 /* INIT is part of the initializer for DECL. If there are any
9444 reference or initializer lists being initialized, extend their
9445 lifetime to match that of DECL. */
9447 tree
9449 {
9456 {
9457 /* The temporary array underlying a std::initializer_list
9458 is handled like a reference temporary. */
9463 {
9467 }
9468 }
9470 {
9476 }
9479 }
9481 /* Returns true iff an initializer for TYPE could contain temporaries that
9482 need to be extended because they are bound to references or
9483 std::initializer_list. */
9485 bool
9487 {
9492 {
9499 }
9501 }
9503 /* Returns true iff TYPE is some variant of std::initializer_list. */
9505 bool
9507 {
9508 /* Look through typedefs. */
9517 }
9519 /* Returns true iff DECL is a list constructor: i.e. a constructor which
9520 will accept an argument list of a single std::initializer_list<T>. */
9522 bool
9524 {
9526 tree arg;
9538 /* There are more non-defaulted parms. */
9542 }