| blob | 745c31facc20bf5f77bb347180b3f448b5c6df81 |
1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
13 any later version.
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
44 /* The various kinds of conversion. */
47 ck_identity,
48 ck_lvalue,
49 ck_qual,
50 ck_std,
51 ck_ptr,
52 ck_pmem,
53 ck_base,
54 ck_ref_bind,
55 ck_user,
56 ck_ambig,
57 ck_list,
58 ck_aggr,
59 ck_rvalue
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
66 cr_identity,
67 cr_exact,
68 cr_promotion,
69 cr_std,
70 cr_pbool,
71 cr_user,
72 cr_ellipsis,
73 cr_bad
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
82 /* The kind of conversion represented by this step. */
83 conversion_kind kind;
84 /* The rank of this conversion. */
85 conversion_rank rank;
90 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
91 temporary should be created to hold the result of the
92 conversion. */
94 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
95 from a pointer-to-derived to pointer-to-base is being performed. */
97 /* If KIND is ck_ref_bind, true when either an lvalue reference is
98 being bound to an lvalue expression or an rvalue reference is
99 being bound to an rvalue expression. */
102 /* The type of the expression resulting from the conversion. */
103 tree type;
105 /* The next conversion in the chain. Since the conversions are
106 arranged from outermost to innermost, the NEXT conversion will
107 actually be performed before this conversion. This variant is
108 used only when KIND is neither ck_identity nor ck_ambig. */
110 /* The expression at the beginning of the conversion chain. This
111 variant is used only if KIND is ck_identity or ck_ambig. */
112 tree expr;
113 /* The array of conversions for an initializer_list. */
116 /* The function candidate corresponding to this conversion
117 sequence. This field is only used if KIND is ck_user. */
119 };
121 #define CONVERSION_RANK(NODE) \
122 ((NODE)->bad_p ? cr_bad \
123 : (NODE)->ellipsis_p ? cr_ellipsis \
124 : (NODE)->user_conv_p ? cr_user \
125 : (NODE)->rank)
136 #define convert_like(CONV, EXPR, COMPLAIN) \
137 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
140 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
141 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
164 static void add_builtin_candidates
167 static void add_builtin_candidate
171 static void build_builtin_candidate
206 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
207 NAME can take many forms... */
209 bool
211 {
212 /* Just accept something we've already complained about. */
221 {
227 else
229 }
230 else
231 {
232 /* In the case of:
234 template <class T> struct S { ~S(); };
235 int i;
236 i.~S();
238 NAME will be a class template. */
241 }
246 }
248 /* We want the address of a function or method. We avoid creating a
249 pointer-to-member function. */
251 tree
253 {
256 /* We have to do these by hand to avoid real pointer to member
257 functions. */
259 {
261 {
265 }
267 }
268 else
272 }
274 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
275 POINTER_TYPE to those. Note, pointer to member function types
276 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
277 two variants. build_call_a is the primitive taking an array of
278 arguments, while build_call_n is a wrapper that handles varargs. */
280 tree
282 {
285 else
286 {
296 }
297 }
299 tree
301 {
304 tree decl;
305 tree result_type;
306 tree fntype;
319 {
322 {
323 /* We invoke build_call directly for several library
324 functions. These may have been declared normally if
325 we're building libgcc, so we can't just check
326 DECL_ARTIFICIAL. */
331 }
332 }
333 else
336 /* We check both the decl and the type; a function may be known not to
337 throw without being declared throw(). */
351 /* Don't pass empty class objects by value. This is useful
352 for tags in STL, which are used to control overload resolution.
353 We don't need to handle other cases of copying empty classes. */
358 {
362 }
369 }
371 /* Build something of the form ptr->method (args)
372 or object.method (args). This can also build
373 calls to constructors, and find friends.
375 Member functions always take their class variable
376 as a pointer.
378 INSTANCE is a class instance.
380 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
382 PARMS help to figure out what that NAME really refers to.
384 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
385 down to the real instance type to use for access checking. We need this
386 information to get protected accesses correct.
388 FLAGS is the logical disjunction of zero or more LOOKUP_
389 flags. See cp-tree.h for more info.
391 If this is all OK, calls build_function_call with the resolved
392 member function.
394 This function must also handle being called to perform
395 initialization, promotion/coercion of arguments, and
396 instantiation of default parameters.
398 Note that NAME may refer to an instance variable name. If
399 `operator()()' is defined for the type of that field, then we return
400 that result. */
402 /* New overloading code. */
410 };
413 /* The FUNCTION_DECL that will be called if this candidate is
414 selected by overload resolution. */
415 tree fn;
416 /* The arguments to use when calling this function. */
417 tree args;
418 /* The implicit conversion sequences for each of the arguments to
419 FN. */
421 /* The number of implicit conversion sequences. */
423 /* If FN is a user-defined conversion, the standard conversion
424 sequence from the type returned by FN to the desired destination
425 type. */
428 /* If FN is a member function, the binfo indicating the path used to
429 qualify the name of FN at the call site. This path is used to
430 determine whether or not FN is accessible if it is selected by
431 overload resolution. The DECL_CONTEXT of FN will always be a
432 (possibly improper) base of this binfo. */
433 tree access_path;
434 /* If FN is a non-static member function, the binfo indicating the
435 subobject to which the `this' pointer should be converted if FN
436 is selected by overload resolution. The type pointed to the by
437 the `this' pointer must correspond to the most derived class
438 indicated by the CONVERSION_PATH. */
439 tree conversion_path;
440 tree template_decl;
443 };
445 /* Returns true iff T is a null pointer constant in the sense of
446 [conv.ptr]. */
448 bool
450 {
451 /* [conv.ptr]
453 A null pointer constant is an integral constant expression
454 (_expr.const_) rvalue of integer type that evaluates to zero. */
459 {
463 }
465 }
467 /* Returns nonzero if PARMLIST consists of only default parms and/or
468 ellipsis. */
470 bool
472 {
478 }
480 /* Allocate N bytes of memory from the conversion obstack. The memory
481 is zeroed before being returned. */
485 {
488 {
491 }
495 }
497 /* Dynamically allocate a conversion. */
501 {
506 }
508 #ifdef ENABLE_CHECKING
510 /* Make sure that all memory on the conversion obstack has been
511 freed. */
513 void
515 {
519 }
523 /* Dynamically allocate an array of N conversions. */
527 {
529 }
533 {
537 /* Note that the caller is responsible for filling in t->cand for
538 user-defined conversions. */
544 {
560 }
566 }
568 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
569 specialization of std::initializer_list<T>, if such a conversion is
570 possible. */
574 {
580 tree val;
583 {
584 conversion *sub
591 }
599 {
607 }
610 }
612 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
613 aggregate class, if such a conversion is possible. */
617 {
623 {
627 {
632 }
635 }
643 }
645 /* Build a representation of the identity conversion from EXPR to
646 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
650 {
658 }
660 /* Converting from EXPR to TYPE was ambiguous in the sense that there
661 were multiple user-defined conversions to accomplish the job.
662 Build a conversion that indicates that ambiguity. */
666 {
674 }
676 tree
678 {
682 }
684 /* Returns the standard conversion path (see [conv]) from type FROM to type
685 TO, if any. For proper handling of null pointer constants, you must
686 also pass the expression EXPR to convert from. If C_CAST_P is true,
687 this conversion is coming from a C-style cast. */
692 {
699 {
702 }
708 {
716 }
723 {
727 }
729 {
731 {
732 tree bitfield_type;
735 {
738 }
739 }
741 }
743 /* Allow conversion between `__complex__' data types. */
745 {
746 /* The standard conversion sequence to convert FROM to TO is
747 the standard conversion sequence to perform componentwise
748 conversion. */
753 {
756 }
757 else
761 }
771 {
772 /* For backwards brain damage compatibility, allow interconversion of
773 pointers and integers with a pedwarn. */
776 }
778 {
779 /* For backwards brain damage compatibility, allow interconversion of
780 enums and integers with a pedwarn. */
783 }
786 {
787 tree to_pointee;
788 tree from_pointee;
793 ;
797 {
798 from = build_pointer_type
802 }
804 {
809 && (same_type_ignoring_top_level_qualifiers_p
812 {
816 }
819 }
822 /* [conv.ptr]
824 An rvalue of type "pointer to cv D," where D is a
825 class type, can be converted to an rvalue of type
826 "pointer to cv B," where B is a base class (clause
827 _class.derived_) of D. If B is an inaccessible
828 (clause _class.access_) or ambiguous
829 (_class.member.lookup_) base class of D, a program
830 that necessitates this conversion is ill-formed.
831 Therefore, we use DERIVED_FROM_P, and do not check
832 access or uniqueness. */
834 {
835 from =
841 }
844 {
847 }
848 else
849 {
852 }
857 /* In a C-style cast, we ignore CV-qualification because we
858 are allowed to perform a static_cast followed by a
859 const_cast. */
864 /* converting from string constant to char *. */
867 {
870 }
871 else
875 }
877 {
897 }
899 {
900 /* [conv.bool]
902 An rvalue of arithmetic, unscoped enumeration, pointer, or
903 pointer to member type can be converted to an rvalue of type
904 bool. */
909 {
917 }
920 }
921 /* We don't check for ENUMERAL_TYPE here because there are no standard
922 conversions to enum type. */
923 /* As an extension, allow conversion to complex type. */
925 {
931 /* Give this a better rank if it's a promotion. */
935 }
941 {
945 /* The derived-to-base conversion indicates the initialization
946 of a parameter with base type from an object of a derived
947 type. A temporary object is created to hold the result of
948 the conversion unless we're binding directly to a reference. */
950 }
951 else
958 }
960 /* Returns nonzero if T1 is reference-related to T2. */
962 static bool
964 {
968 /* [dcl.init.ref]
970 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
971 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
972 of T2. */
976 }
978 /* Returns nonzero if T1 is reference-compatible with T2. */
980 static bool
982 {
983 /* [dcl.init.ref]
985 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
986 reference-related to T2 and cv1 is the same cv-qualification as,
987 or greater cv-qualification than, cv2. */
990 }
992 /* Determine whether or not the EXPR (of class type S) can be
993 converted to T as in [over.match.ref]. */
997 {
998 tree conversions;
999 tree arglist;
1001 tree t;
1010 /* [over.match.ref]
1012 Assuming that "cv1 T" is the underlying type of the reference
1013 being initialized, and "cv S" is the type of the initializer
1014 expression, with S a class type, the candidate functions are
1015 selected as follows:
1017 --The conversion functions of S and its base classes are
1018 considered. Those that are not hidden within S and yield type
1019 "reference to cv2 T2", where "cv1 T" is reference-compatible
1020 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1022 The argument list has one argument, which is the initializer
1023 expression. */
1027 /* Conceptually, we should take the address of EXPR and put it in
1028 the argument list. Unfortunately, however, that can result in
1029 error messages, which we should not issue now because we are just
1030 trying to find a conversion operator. Therefore, we use NULL,
1031 cast to the appropriate type. */
1038 {
1042 {
1048 /* If this is a template function, try to get an exact
1049 match. */
1051 {
1054 NULL_TREE,
1055 arglist,
1056 reference_type,
1059 LOOKUP_NORMAL,
1060 DEDUCE_CONV);
1063 {
1064 /* Now, see if the conversion function really returns
1065 an lvalue of the appropriate type. From the
1066 point of view of unification, simply returning an
1067 rvalue of the right type is good enough. */
1072 {
1075 }
1076 }
1077 }
1083 LOOKUP_NORMAL);
1086 {
1088 /* Build a standard conversion sequence indicating the
1089 binding from the reference type returned by the
1090 function to the desired REFERENCE_TYPE. */
1091 identity_conv
1094 NULL_TREE);
1095 cand->second_conv
1096 = (direct_reference_binding
1102 }
1103 }
1105 }
1108 /* If none of the conversion functions worked out, let our caller
1109 know. */
1117 /* Now that we know that this is the function we're going to use fix
1118 the dummy first argument. */
1123 /* Build a user-defined conversion sequence representing the
1124 conversion. */
1130 /* Merge it with the standard conversion sequence from the
1131 conversion function's return type to the desired type. */
1138 }
1140 /* A reference of the indicated TYPE is being bound directly to the
1141 expression represented by the implicit conversion sequence CONV.
1142 Return a conversion sequence for this binding. */
1146 {
1147 tree t;
1154 /* [over.ics.rank]
1156 When a parameter of reference type binds directly
1157 (_dcl.init.ref_) to an argument expression, the implicit
1158 conversion sequence is the identity conversion, unless the
1159 argument expression has a type that is a derived class of the
1160 parameter type, in which case the implicit conversion sequence is
1161 a derived-to-base Conversion.
1163 If the parameter binds directly to the result of applying a
1164 conversion function to the argument expression, the implicit
1165 conversion sequence is a user-defined conversion sequence
1166 (_over.ics.user_), with the second standard conversion sequence
1167 either an identity conversion or, if the conversion function
1168 returns an entity of a type that is a derived class of the
1169 parameter type, a derived-to-base conversion. */
1171 {
1172 /* Represent the derived-to-base conversion. */
1174 /* We will actually be binding to the base-class subobject in
1175 the derived class, so we mark this conversion appropriately.
1176 That way, convert_like knows not to generate a temporary. */
1178 }
1180 }
1182 /* Returns the conversion path from type FROM to reference type TO for
1183 purposes of reference binding. For lvalue binding, either pass a
1184 reference type to FROM or an lvalue expression to EXPR. If the
1185 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1186 the conversion returned. If C_CAST_P is true, this
1187 conversion is coming from a C-style cast. */
1191 {
1195 tree tfrom;
1201 {
1206 }
1209 {
1210 /* Anything with reference type is an lvalue. */
1213 }
1221 /* Figure out whether or not the types are reference-related and
1222 reference compatible. We have do do this after stripping
1223 references from FROM. */
1225 /* If this is a C cast, first convert to an appropriately qualified
1226 type, so that we can later do a const_cast to the desired type. */
1232 /* Directly bind reference when target expression's type is compatible with
1233 the reference and expression is an lvalue. In DR391, the wording in
1234 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1235 const and rvalue references to rvalues of compatible class type. */
1237 && (lvalue_p
1241 {
1242 /* [dcl.init.ref]
1244 If the initializer expression
1246 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1247 is reference-compatible with "cv2 T2,"
1249 the reference is bound directly to the initializer expression
1250 lvalue.
1252 [...]
1253 If the initializer expression is an rvalue, with T2 a class type,
1254 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1255 is bound to the object represented by the rvalue or to a sub-object
1256 within that object. */
1262 /* The top-level caller requested that we pretend that the lvalue
1263 be treated as an rvalue. */
1265 else
1266 conv->rvaluedness_matches_p
1271 /* For the purposes of overload resolution, we ignore the fact
1272 this expression is a bitfield or packed field. (In particular,
1273 [over.ics.ref] says specifically that a function with a
1274 non-const reference parameter is viable even if the
1275 argument is a bitfield.)
1277 However, when we actually call the function we must create
1278 a temporary to which to bind the reference. If the
1279 reference is volatile, or isn't const, then we cannot make
1280 a temporary, so we just issue an error when the conversion
1281 actually occurs. */
1285 }
1286 /* [class.conv.fct] A conversion function is never used to convert a
1287 (possibly cv-qualified) object to the (possibly cv-qualified) same
1288 object type (or a reference to it), to a (possibly cv-qualified) base
1289 class of that type (or a reference to it).... */
1292 {
1293 /* [dcl.init.ref]
1295 If the initializer expression
1297 -- has a class type (i.e., T2 is a class type) can be
1298 implicitly converted to an lvalue of type "cv3 T3," where
1299 "cv1 T1" is reference-compatible with "cv3 T3". (this
1300 conversion is selected by enumerating the applicable
1301 conversion functions (_over.match.ref_) and choosing the
1302 best one through overload resolution. (_over.match_).
1304 the reference is bound to the lvalue result of the conversion
1305 in the second case. */
1309 }
1311 /* From this point on, we conceptually need temporaries, even if we
1312 elide them. Only the cases above are "direct bindings". */
1316 /* [over.ics.rank]
1318 When a parameter of reference type is not bound directly to an
1319 argument expression, the conversion sequence is the one required
1320 to convert the argument expression to the underlying type of the
1321 reference according to _over.best.ics_. Conceptually, this
1322 conversion sequence corresponds to copy-initializing a temporary
1323 of the underlying type with the argument expression. Any
1324 difference in top-level cv-qualification is subsumed by the
1325 initialization itself and does not constitute a conversion. */
1327 /* [dcl.init.ref]
1329 Otherwise, the reference shall be to a non-volatile const type.
1331 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1335 /* [dcl.init.ref]
1337 Otherwise, a temporary of type "cv1 T1" is created and
1338 initialized from the initializer expression using the rules for a
1339 non-reference copy initialization. If T1 is reference-related to
1340 T2, cv1 must be the same cv-qualification as, or greater
1341 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1345 /* We're generating a temporary now, but don't bind any more in the
1346 conversion (specifically, don't slice the temporary returned by a
1347 conversion operator). */
1351 flags);
1356 /* This reference binding, unlike those above, requires the
1357 creation of a temporary. */
1362 }
1364 /* Returns the implicit conversion sequence (see [over.ics]) from type
1365 FROM to type TO. The optional expression EXPR may affect the
1366 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1367 true, this conversion is coming from a C-style cast. */
1372 {
1381 else
1395 {
1409 /* We used to try to bind a reference to a temporary here, but that
1410 is now handled after the recursive call to this function at the end
1411 of reference_binding. */
1413 }
1416 }
1418 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1419 functions. */
1427 {
1442 }
1444 /* Create an overload candidate for the function or method FN called with
1445 the argument list ARGLIST and add it to CANDIDATES. FLAGS is passed on
1446 to implicit_conversion.
1448 CTYPE, if non-NULL, is the type we want to pretend this function
1449 comes from for purposes of overload resolution. */
1456 {
1461 tree orig_arglist;
1464 /* At this point we should not see any functions which haven't been
1465 explicitly declared, except for friend functions which will have
1466 been found using argument dependent lookup. */
1469 /* The `this', `in_chrg' and VTT arguments to constructors are not
1470 considered in overload resolution. */
1472 {
1476 }
1477 else
1483 /* 13.3.2 - Viable functions [over.match.viable]
1484 First, to be a viable function, a candidate function shall have enough
1485 parameters to agree in number with the arguments in the list.
1487 We need to check this first; otherwise, checking the ICSes might cause
1488 us to produce an ill-formed template instantiation. */
1492 {
1496 }
1501 /* Make sure there are default args for the rest of the parms. */
1508 /* Second, for F to be a viable function, there shall exist for each
1509 argument an implicit conversion sequence that converts that argument
1510 to the corresponding parameter of F. */
1516 {
1529 {
1533 /* The type of the implicit object parameter ('this') for
1534 overload resolution is not always the same as for the
1535 function itself; conversion functions are considered to
1536 be members of the class being converted, and functions
1537 introduced by a using-declaration are considered to be
1538 members of the class that uses them.
1540 Since build_over_call ignores the ICS for the `this'
1541 parameter, we can just change the parm type. */
1543 {
1544 parmtype
1548 }
1556 }
1557 else
1558 {
1561 }
1568 {
1571 }
1579 }
1581 out:
1584 }
1586 /* Create an overload candidate for the conversion function FN which will
1587 be invoked for expression OBJ, producing a pointer-to-function which
1588 will in turn be called with the argument list ARGLIST, and add it to
1589 CANDIDATES. FLAGS is passed on to implicit_conversion.
1591 Actually, we don't really care about FN; we care about the type it
1592 converts to. There may be multiple conversion functions that will
1593 convert to that type, and we rely on build_user_type_conversion_1 to
1594 choose the best one; so when we create our candidate, we record the type
1595 instead of the function. */
1600 {
1617 /* Don't bother looking up the same type twice. */
1622 {
1629 flags);
1635 else
1636 {
1639 }
1654 }
1664 }
1666 static void
1670 {
1684 {
1691 {
1693 /* We need something for printing the candidate. */
1695 }
1699 }
1701 /* For COND_EXPR we rearranged the arguments; undo that now. */
1703 {
1710 else
1712 }
1718 viable);
1719 }
1721 static bool
1723 {
1725 }
1727 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1729 static bool
1731 {
1732 /* [over.built]
1734 In this section, the term promoted integral type is used to refer
1735 to those integral types which are preserved by integral promotion
1736 (including e.g. int and long but excluding e.g. char).
1737 Similarly, the term promoted arithmetic type refers to promoted
1738 integral types plus floating types. */
1742 }
1744 /* Create any builtin operator overload candidates for the operator in
1745 question given the converted operand types TYPE1 and TYPE2. The other
1746 args are passed through from add_builtin_candidates to
1747 build_builtin_candidate.
1749 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1750 If CODE is requires candidates operands of the same type of the kind
1751 of which TYPE1 and TYPE2 are, we add both candidates
1752 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1754 static void
1758 {
1760 {
1768 }
1771 {
1773 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1774 and VQ is either volatile or empty, there exist candidate operator
1775 functions of the form
1776 VQ T& operator++(VQ T&);
1777 T operator++(VQ T&, int);
1778 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1779 type other than bool, and VQ is either volatile or empty, there exist
1780 candidate operator functions of the form
1781 VQ T& operator--(VQ T&);
1782 T operator--(VQ T&, int);
1783 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1784 complete object type, and VQ is either volatile or empty, there exist
1785 candidate operator functions of the form
1786 T*VQ& operator++(T*VQ&);
1787 T*VQ& operator--(T*VQ&);
1788 T* operator++(T*VQ&, int);
1789 T* operator--(T*VQ&, int); */
1798 {
1801 }
1804 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1805 exist candidate operator functions of the form
1807 T& operator*(T*);
1809 8 For every function type T, there exist candidate operator functions of
1810 the form
1811 T& operator*(T*); */
1820 /* 9 For every type T, there exist candidate operator functions of the form
1821 T* operator+(T*);
1823 10For every promoted arithmetic type T, there exist candidate operator
1824 functions of the form
1825 T operator+(T);
1826 T operator-(T); */
1836 /* 11For every promoted integral type T, there exist candidate operator
1837 functions of the form
1838 T operator~(T); */
1845 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1846 is the same type as C2 or is a derived class of C2, T is a complete
1847 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1848 there exist candidate operator functions of the form
1849 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1850 where CV12 is the union of CV1 and CV2. */
1855 {
1863 }
1866 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1867 didate operator functions of the form
1868 LR operator*(L, R);
1869 LR operator/(L, R);
1870 LR operator+(L, R);
1871 LR operator-(L, R);
1872 bool operator<(L, R);
1873 bool operator>(L, R);
1874 bool operator<=(L, R);
1875 bool operator>=(L, R);
1876 bool operator==(L, R);
1877 bool operator!=(L, R);
1878 where LR is the result of the usual arithmetic conversions between
1879 types L and R.
1881 14For every pair of types T and I, where T is a cv-qualified or cv-
1882 unqualified complete object type and I is a promoted integral type,
1883 there exist candidate operator functions of the form
1884 T* operator+(T*, I);
1885 T& operator[](T*, I);
1886 T* operator-(T*, I);
1887 T* operator+(I, T*);
1888 T& operator[](I, T*);
1890 15For every T, where T is a pointer to complete object type, there exist
1891 candidate operator functions of the form112)
1892 ptrdiff_t operator-(T, T);
1894 16For every pointer or enumeration type T, there exist candidate operator
1895 functions of the form
1896 bool operator<(T, T);
1897 bool operator>(T, T);
1898 bool operator<=(T, T);
1899 bool operator>=(T, T);
1900 bool operator==(T, T);
1901 bool operator!=(T, T);
1903 17For every pointer to member type T, there exist candidate operator
1904 functions of the form
1905 bool operator==(T, T);
1906 bool operator!=(T, T); */
1912 {
1915 }
1928 {
1931 }
1933 {
1936 }
1937 /* Fall through. */
1954 {
1957 }
1961 {
1964 }
1972 {
1975 }
1977 {
1980 }
1983 /* 18For every pair of promoted integral types L and R, there exist candi-
1984 date operator functions of the form
1985 LR operator%(L, R);
1986 LR operator&(L, R);
1987 LR operator^(L, R);
1988 LR operator|(L, R);
1989 L operator<<(L, R);
1990 L operator>>(L, R);
1991 where LR is the result of the usual arithmetic conversions between
1992 types L and R. */
2004 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2005 type, VQ is either volatile or empty, and R is a promoted arithmetic
2006 type, there exist candidate operator functions of the form
2007 VQ L& operator=(VQ L&, R);
2008 VQ L& operator*=(VQ L&, R);
2009 VQ L& operator/=(VQ L&, R);
2010 VQ L& operator+=(VQ L&, R);
2011 VQ L& operator-=(VQ L&, R);
2013 20For every pair T, VQ), where T is any type and VQ is either volatile
2014 or empty, there exist candidate operator functions of the form
2015 T*VQ& operator=(T*VQ&, T*);
2017 21For every pair T, VQ), where T is a pointer to member type and VQ is
2018 either volatile or empty, there exist candidate operator functions of
2019 the form
2020 VQ T& operator=(VQ T&, T);
2022 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2023 unqualified complete object type, VQ is either volatile or empty, and
2024 I is a promoted integral type, there exist candidate operator func-
2025 tions of the form
2026 T*VQ& operator+=(T*VQ&, I);
2027 T*VQ& operator-=(T*VQ&, I);
2029 23For every triple L, VQ, R), where L is an integral or enumeration
2030 type, VQ is either volatile or empty, and R is a promoted integral
2031 type, there exist candidate operator functions of the form
2033 VQ L& operator%=(VQ L&, R);
2034 VQ L& operator<<=(VQ L&, R);
2035 VQ L& operator>>=(VQ L&, R);
2036 VQ L& operator&=(VQ L&, R);
2037 VQ L& operator^=(VQ L&, R);
2038 VQ L& operator|=(VQ L&, R); */
2042 {
2046 {
2049 }
2075 {
2078 }
2083 }
2088 /* [over.built]
2090 For every pair of promoted arithmetic types L and R, there
2091 exist candidate operator functions of the form
2093 LR operator?(bool, L, R);
2095 where LR is the result of the usual arithmetic conversions
2096 between types L and R.
2098 For every type T, where T is a pointer or pointer-to-member
2099 type, there exist candidate operator functions of the form T
2100 operator?(bool, T, T); */
2104 /* That's OK. */
2107 /* Otherwise, the types should be pointers. */
2112 /* We don't check that the two types are the same; the logic
2113 below will actually create two candidates; one in which both
2114 parameter types are TYPE1, and one in which both parameter
2115 types are TYPE2. */
2120 }
2122 /* If we're dealing with two pointer types or two enumeral types,
2123 we need candidates for both of them. */
2132 {
2133 build_builtin_candidate
2135 build_builtin_candidate
2138 }
2140 build_builtin_candidate
2142 }
2144 tree
2146 {
2152 }
2154 /* There are three conditions of builtin candidates:
2156 1) bool-taking candidates. These are the same regardless of the input.
2157 2) pointer-pair taking candidates. These are generated for each type
2158 one of the input types converts to.
2159 3) arithmetic candidates. According to the standard, we should generate
2160 all of these, but I'm trying not to...
2162 Here we generate a superset of the possible candidates for this particular
2163 case. That is a subset of the full set the standard defines, plus some
2164 other cases which the standard disallows. add_builtin_candidate will
2165 filter out the invalid set. */
2167 static void
2171 {
2175 /* TYPES[i] is the set of possible builtin-operator parameter types
2176 we will consider for the Ith argument. These are represented as
2177 a TREE_LIST; the TREE_VALUE of each node is the potential
2178 parameter type. */
2182 {
2185 else
2187 }
2190 {
2191 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2192 and VQ is either volatile or empty, there exist candidate operator
2193 functions of the form
2194 VQ T& operator++(VQ T&); */
2204 /* 24There also exist candidate operator functions of the form
2205 bool operator!(bool);
2206 bool operator&&(bool, bool);
2207 bool operator||(bool, bool); */
2210 build_builtin_candidate
2217 build_builtin_candidate
2235 /* Fall through. */
2239 }
2244 {
2246 ;
2248 {
2249 tree convs;
2257 {
2264 }
2270 {
2283 {
2289 }
2293 }
2294 }
2295 else
2296 {
2302 {
2308 }
2310 }
2311 }
2313 /* Run through the possible parameter types of both arguments,
2314 creating candidates with those parameter types. */
2316 {
2319 add_builtin_candidate
2322 else
2323 add_builtin_candidate
2326 }
2327 }
2330 /* If TMPL can be successfully instantiated as indicated by
2331 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2333 TMPL is the template. EXPLICIT_TARGS are any explicit template
2334 arguments. ARGLIST is the arguments provided at the call-site.
2335 The RETURN_TYPE is the desired type for conversion operators. If
2336 OBJ is NULL_TREE, FLAGS and CTYPE are as for add_function_candidate.
2337 If an OBJ is supplied, FLAGS and CTYPE are ignored, and OBJ is as for
2338 add_conv_candidate. */
2345 unification_kind_t strict)
2346 {
2352 tree fn;
2354 /* We don't do deduction on the in-charge parameter, the VTT
2355 parameter or 'this'. */
2365 args_without_in_chrg,
2375 /* In [class.copy]:
2377 A member function template is never instantiated to perform the
2378 copy of a class object to an object of its class type.
2380 It's a little unclear what this means; the standard explicitly
2381 does allow a template to be used to copy a class. For example,
2382 in:
2384 struct A {
2385 A(A&);
2386 template <class T> A(const T&);
2387 };
2388 const A f ();
2389 void g () { A a (f ()); }
2391 the member template will be used to make the copy. The section
2392 quoted above appears in the paragraph that forbids constructors
2393 whose only parameter is (a possibly cv-qualified variant of) the
2394 class type, and a logical interpretation is that the intent was
2395 to forbid the instantiation of member templates which would then
2396 have that form. */
2398 {
2401 ctype))
2403 }
2406 /* Aha, this is a conversion function. */
2409 else
2414 /* This situation can occur if a member template of a template
2415 class is specialized. Then, instantiate_template might return
2416 an instantiation of the specialization, in which case the
2417 DECL_TI_TEMPLATE field will point at the original
2418 specialization. For example:
2420 template <class T> struct S { template <class U> void f(U);
2421 template <> void f(int) {}; };
2422 S<double> sd;
2423 sd.f(3);
2425 Here, TMPL will be template <class U> S<double>::f(U).
2426 And, instantiate template will give us the specialization
2427 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2428 for this will point at template <class T> template <> S<T>::f(int),
2429 so that we can find the definition. For the purposes of
2430 overload resolution, however, we want the original TMPL. */
2432 else
2436 }
2443 unification_kind_t strict)
2444 {
2445 return
2450 }
2457 {
2458 return
2462 }
2464 /* The CANDS are the set of candidates that were considered for
2465 overload resolution. Return the set of viable candidates. If none
2466 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2467 is true if a candidate should be considered viable only if it is
2468 strictly viable. */
2474 {
2485 {
2488 {
2494 }
2495 else
2497 }
2500 }
2502 static bool
2504 {
2509 }
2511 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2512 words, it is about to become the "this" pointer for a member
2513 function call. Take the address of the object. */
2515 static tree
2517 {
2518 /* In a template, we are only concerned about the type of the
2519 expression, so we can take a shortcut. */
2524 }
2526 /* Returns true iff functions are equivalent. Equivalent functions are
2527 not '==' only if one is a function-local extern function or if
2528 both are extern "C". */
2532 {
2537 }
2539 /* Print information about one overload candidate CANDIDATE. MSGSTR
2540 is the text to print before the candidate itself.
2542 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2543 to have been run through gettext by the caller. This wart makes
2544 life simpler in print_z_candidates and for the translators. */
2546 static void
2548 {
2550 {
2560 else
2563 }
2568 else
2570 }
2572 static void
2574 {
2579 /* There may be duplicates in the set of candidates. We put off
2580 checking this condition as long as possible, since we have no way
2581 to eliminate duplicates from a set of functions in less than n^2
2582 time. Now we are about to emit an error message, so it is more
2583 permissible to go slowly. */
2585 {
2587 /* Skip builtin candidates and conversion functions. */
2592 {
2596 else
2598 }
2599 }
2607 {
2608 /* Indent successive candidates by the width of the translation
2609 of the above string. */
2616 do
2617 {
2620 }
2622 }
2623 }
2625 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2626 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2627 the result of the conversion function to convert it to the final
2628 desired type. Merge the two sequences into a single sequence,
2629 and return the merged sequence. */
2633 {
2638 /* Find the end of the second conversion sequence. */
2643 /* Replace the identity conversion with the user conversion
2644 sequence. */
2647 /* The entire sequence is a user-conversion sequence. */
2651 }
2653 /* Returns the best overload candidate to perform the requested
2654 conversion. This function is used for three the overloading situations
2655 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2656 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2657 per [dcl.init.ref], so we ignore temporary bindings. */
2661 {
2671 /* We represent conversion within a hierarchy using RVALUE_CONV and
2672 BASE_CONV, as specified by [over.best.ics]; these become plain
2673 constructor calls, as specified in [dcl.init]. */
2681 {
2686 {
2687 /* [class.conv.fct] A conversion function is never used to
2688 convert a (possibly cv-qualified) object to the (possibly
2689 cv-qualified) same object type (or a reference to it), to a
2690 (possibly cv-qualified) base class of that type (or a
2691 reference to it)... */
2692 }
2693 else
2695 }
2700 /* It's OK to bind a temporary for converting constructor arguments, but
2701 not in converting the return value of a conversion operator. */
2706 {
2707 tree t;
2714 {
2716 /* We still allow more conversions within an init-list. */
2718 /* But not for the copy ctor. */
2719 |LOOKUP_NO_COPY_CTOR_CONVERSION
2721 }
2722 else
2724 /* We should never try to call the abstract or base constructor
2725 from here. */
2729 }
2731 {
2742 flags,
2743 DEDUCE_CALL);
2744 else
2748 flags);
2751 {
2754 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2755 set, then this is copy-initialization. In that case, "The
2756 result of the call is then used to direct-initialize the
2757 object that is the destination of the copy-initialization."
2758 [dcl.init]
2760 We represent this in the conversion sequence with an
2761 rvalue conversion, which means a constructor call. */
2764 cand->second_conv
2766 }
2767 }
2773 {
2774 tree fns;
2777 /* If we are called to convert to a reference type, we are trying to
2778 find an lvalue binding, so don't even consider temporaries. If
2779 we don't find an lvalue binding, the caller will try again to
2780 look for a temporary binding. */
2785 {
2788 /* [over.match.funcs] For conversion functions, the function
2789 is considered to be a member of the class of the implicit
2790 object argument for the purpose of defining the type of
2791 the implicit object parameter.
2793 So we pass fromtype as CTYPE to add_*_candidate. */
2797 NULL_TREE,
2800 conversion_path,
2801 flags,
2802 DEDUCE_CONV);
2803 else
2805 args,
2807 conversion_path,
2808 flags);
2811 {
2812 conversion *ics
2818 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2819 copy-initialization. In that case, "The result of the
2820 call is then used to direct-initialize the object that is
2821 the destination of the copy-initialization." [dcl.init]
2823 We represent this in the conversion sequence with an
2824 rvalue conversion, which means a constructor call. But
2825 don't add a second rvalue conversion if there's already
2826 one there. Which there really shouldn't be, but it's
2827 harmless since we'd add it here anyway. */
2838 }
2839 }
2840 }
2848 {
2850 {
2854 }
2861 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2862 ambiguous conversion is no worse than another user-defined
2863 conversion. */
2866 }
2868 /* Build the user conversion sequence. */
2869 conv = build_conv
2876 /* Remember that this was a list-initialization. */
2880 /* Combine it with the second conversion sequence. */
2888 }
2890 tree
2892 {
2897 {
2902 }
2904 }
2906 /* Do any initial processing on the arguments to a function call. */
2908 static tree
2910 {
2911 tree t;
2913 {
2919 {
2922 }
2925 }
2927 }
2929 /* Perform overload resolution on FN, which is called with the ARGS.
2931 Return the candidate function selected by overload resolution, or
2932 NULL if the event that overload resolution failed. In the case
2933 that overload resolution fails, *CANDIDATES will be the set of
2934 candidates considered, and ANY_VIABLE_P will be set to true or
2935 false to indicate whether or not any of the candidates were
2936 viable.
2938 The ARGS should already have gone through RESOLVE_ARGS before this
2939 function is called. */
2943 tree args,
2946 {
2954 /* Check FN and ARGS. */
2962 {
2966 }
2968 /* Add the various candidate functions. */
2972 LOOKUP_NORMAL,
2973 candidates);
2981 }
2983 /* Return an expression for a call to FN (a namespace-scope function,
2984 or a static member function) with the ARGS. */
2986 tree
2988 tsubst_flags_t complain)
2989 {
2993 tree result;
2999 /* If this function was found without using argument dependent
3000 lookup, then we want to ignore any undeclared friend
3001 functions. */
3003 {
3008 {
3013 }
3014 }
3016 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3022 {
3024 {
3032 else
3037 }
3039 }
3040 else
3043 /* Free all the conversions we allocated. */
3047 }
3049 /* Build a call to a global operator new. FNNAME is the name of the
3050 operator (either "operator new" or "operator new[]") and ARGS are
3051 the arguments provided. *SIZE points to the total number of bytes
3052 required by the allocation, and is updated if that is changed here.
3053 *COOKIE_SIZE is non-NULL if a cookie should be used. If this
3054 function determines that no cookie should be used, after all,
3055 *COOKIE_SIZE is set to NULL_TREE. If FN is non-NULL, it will be
3056 set, upon return, to the allocation function called. */
3058 tree
3062 {
3063 tree fns;
3075 /* Based on:
3077 [expr.new]
3079 If this lookup fails to find the name, or if the allocated type
3080 is not a class type, the allocation function's name is looked
3081 up in the global scope.
3083 we disregard block-scope declarations of "operator new". */
3086 /* Figure out what function is being called. */
3089 /* If no suitable function could be found, issue an error message
3090 and give up. */
3092 {
3096 else
3102 }
3104 /* If a cookie is required, add some extra space. Whether
3105 or not a cookie is required cannot be determined until
3106 after we know which function was called. */
3108 {
3111 {
3113 /* In G++ 3.2, the check was implemented incorrectly; it
3114 looked at the placement expression, rather than the
3115 type of the function. */
3118 ptr_type_node))
3120 }
3121 else
3122 {
3123 tree arg_types;
3126 /* Skip the size_t parameter. */
3128 /* Check the remaining parameters (if any). */
3132 ptr_type_node))
3134 }
3135 /* If we need a cookie, adjust the number of bytes allocated. */
3137 {
3138 /* Update the total size. */
3140 /* Update the argument list to reflect the adjusted size. */
3142 }
3143 else
3145 }
3147 /* Tell our caller which function we decided to call. */
3151 /* Build the CALL_EXPR. */
3153 }
3155 static tree
3157 {
3166 {
3168 /* It's no good looking for an overloaded operator() on a
3169 pointer-to-member-function. */
3170 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj);
3172 }
3175 {
3179 }
3180 else
3188 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3192 {
3197 {
3205 else
3206 add_function_candidate
3209 }
3210 }
3215 {
3227 {
3230 add_template_conv_candidate
3234 else
3238 }
3239 }
3243 {
3245 {
3248 }
3250 }
3251 else
3252 {
3255 {
3257 {
3261 }
3263 }
3264 /* Since cand->fn will be a type, not a function, for a conversion
3265 function, we must be careful not to unconditionally look at
3266 DECL_NAME here. */
3270 else
3271 {
3273 complain);
3276 }
3277 }
3279 /* Free all the conversions we allocated. */
3283 }
3285 static void
3288 {
3293 else
3297 {
3321 else
3325 }
3326 }
3328 /* Return the implicit conversion sequence that could be used to
3329 convert E1 to E2 in [expr.cond]. */
3333 {
3339 /* [expr.cond]
3341 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3342 implicitly converted (clause _conv_) to the type "reference to
3343 T2", subject to the constraint that in the conversion the
3344 reference must bind directly (_dcl.init.ref_) to E1. */
3346 {
3348 t1,
3349 e1,
3351 LOOKUP_NO_TEMP_BIND);
3354 }
3356 /* [expr.cond]
3358 If E1 and E2 have class type, and the underlying class types are
3359 the same or one is a base class of the other: E1 can be converted
3360 to match E2 if the class of T2 is the same type as, or a base
3361 class of, the class of T1, and the cv-qualification of T2 is the
3362 same cv-qualification as, or a greater cv-qualification than, the
3363 cv-qualification of T1. If the conversion is applied, E1 is
3364 changed to an rvalue of type T2 that still refers to the original
3365 source class object (or the appropriate subobject thereof). */
3368 {
3370 {
3375 else
3378 }
3379 else
3381 }
3382 else
3383 /* [expr.cond]
3385 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3386 converted to the type that expression E2 would have if E2 were
3387 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3389 LOOKUP_NORMAL);
3390 }
3392 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3393 arguments to the conditional expression. */
3395 tree
3397 tsubst_flags_t complain)
3398 {
3399 tree arg2_type;
3400 tree arg3_type;
3408 /* As a G++ extension, the second argument to the conditional can be
3409 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3410 c'.) If the second operand is omitted, make sure it is
3411 calculated only once. */
3413 {
3418 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3421 else
3423 }
3425 /* [expr.cond]
3427 The first expression is implicitly converted to bool (clause
3428 _conv_). */
3431 /* If something has already gone wrong, just pass that fact up the
3432 tree. */
3438 /* [expr.cond]
3440 If either the second or the third operand has type (possibly
3441 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3442 array-to-pointer (_conv.array_), and function-to-pointer
3443 (_conv.func_) standard conversions are performed on the second
3444 and third operands. */
3448 {
3449 /* Do the conversions. We don't these for `void' type arguments
3450 since it can't have any effect and since decay_conversion
3451 does not handle that case gracefully. */
3459 /* [expr.cond]
3461 One of the following shall hold:
3463 --The second or the third operand (but not both) is a
3464 throw-expression (_except.throw_); the result is of the
3465 type of the other and is an rvalue.
3467 --Both the second and the third operands have type void; the
3468 result is of type void and is an rvalue.
3470 We must avoid calling force_rvalue for expressions of type
3471 "void" because it will complain that their value is being
3472 used. */
3475 {
3480 }
3483 {
3488 }
3491 else
3492 {
3494 {
3497 "is of type %<void%>, "
3498 "but the third operand is neither a throw-expression "
3500 else
3502 "is of type %<void%>, "
3503 "but the second operand is neither a throw-expression "
3505 }
3507 }
3511 }
3512 /* [expr.cond]
3514 Otherwise, if the second and third operand have different types,
3515 and either has (possibly cv-qualified) class type, an attempt is
3516 made to convert each of those operands to the type of the other. */
3519 {
3523 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3529 /* [expr.cond]
3531 If both can be converted, or one can be converted but the
3532 conversion is ambiguous, the program is ill-formed. If
3533 neither can be converted, the operands are left unchanged and
3534 further checking is performed as described below. If exactly
3535 one conversion is possible, that conversion is applied to the
3536 chosen operand and the converted operand is used in place of
3537 the original operand for the remainder of this section. */
3542 {
3546 }
3548 {
3552 /* Even if CONV2 is a valid conversion, the result of the
3553 conversion may be invalid. For example, if ARG3 has type
3554 "volatile X", and X does not have a copy constructor
3555 accepting a "volatile X&", then even if ARG2 can be
3556 converted to X, the conversion will fail. */
3559 }
3561 {
3567 }
3569 /* Free all the conversions we allocated. */
3575 /* If, after the conversion, both operands have class type,
3576 treat the cv-qualification of both operands as if it were the
3577 union of the cv-qualification of the operands.
3579 The standard is not clear about what to do in this
3580 circumstance. For example, if the first operand has type
3581 "const X" and the second operand has a user-defined
3582 conversion to "volatile X", what is the type of the second
3583 operand after this step? Making it be "const X" (matching
3584 the first operand) seems wrong, as that discards the
3585 qualification without actually performing a copy. Leaving it
3586 as "volatile X" seems wrong as that will result in the
3587 conditional expression failing altogether, even though,
3588 according to this step, the one operand could be converted to
3589 the type of the other. */
3597 }
3599 /* [expr.cond]
3601 If the second and third operands are lvalues and have the same
3602 type, the result is of that type and is an lvalue. */
3606 {
3609 }
3611 /* [expr.cond]
3613 Otherwise, the result is an rvalue. If the second and third
3614 operand do not have the same type, and either has (possibly
3615 cv-qualified) class type, overload resolution is used to
3616 determine the conversions (if any) to be applied to the operands
3617 (_over.match.oper_, _over.built_). */
3621 {
3626 /* Rearrange the arguments so that add_builtin_candidate only has
3627 to know about two args. In build_builtin_candidates, the
3628 arguments are unscrambled. */
3633 COND_EXPR,
3634 NOP_EXPR,
3636 args,
3637 LOOKUP_NORMAL);
3639 /* [expr.cond]
3641 If the overload resolution fails, the program is
3642 ill-formed. */
3645 {
3647 {
3650 }
3652 }
3655 {
3657 {
3660 }
3662 }
3664 /* [expr.cond]
3666 Otherwise, the conversions thus determined are applied, and
3667 the converted operands are used in place of the original
3668 operands for the remainder of this section. */
3675 }
3677 /* [expr.cond]
3679 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3680 and function-to-pointer (_conv.func_) standard conversions are
3681 performed on the second and third operands.
3683 We need to force the lvalue-to-rvalue conversion here for class types,
3684 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3685 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3686 regions. */
3699 /* [expr.cond]
3701 After those conversions, one of the following shall hold:
3703 --The second and third operands have the same type; the result is of
3704 that type. */
3707 /* [expr.cond]
3709 --The second and third operands have arithmetic or enumeration
3710 type; the usual arithmetic conversions are performed to bring
3711 them to a common type, and the result is of that type. */
3716 {
3717 /* In this case, there is always a common type. */
3719 arg3_type);
3723 {
3728 }
3734 {
3738 }
3742 }
3743 /* [expr.cond]
3745 --The second and third operands have pointer type, or one has
3746 pointer type and the other is a null pointer constant; pointer
3747 conversions (_conv.ptr_) and qualification conversions
3748 (_conv.qual_) are performed to bring them to their composite
3749 pointer type (_expr.rel_). The result is of the composite
3750 pointer type.
3752 --The second and third operands have pointer to member type, or
3753 one has pointer to member type and the other is a null pointer
3754 constant; pointer to member conversions (_conv.mem_) and
3755 qualification conversions (_conv.qual_) are performed to bring
3756 them to a common type, whose cv-qualification shall match the
3757 cv-qualification of either the second or the third operand.
3758 The result is of the common type. */
3766 {
3769 complain);
3774 }
3777 {
3782 }
3784 valid_operands:
3787 /* We can't use result_type below, as fold might have returned a
3788 throw_expr. */
3791 {
3792 /* Expand both sides into the same slot, hopefully the target of
3793 the ?: expression. We used to check for TARGET_EXPRs here,
3794 but now we sometimes wrap them in NOP_EXPRs so the test would
3795 fail. */
3798 /* If this expression is an rvalue, but might be mistaken for an
3799 lvalue, we must add a NON_LVALUE_EXPR. */
3801 }
3804 }
3806 /* OPERAND is an operand to an expression. Perform necessary steps
3807 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3808 returned. */
3810 static tree
3812 {
3814 {
3817 /* Make sure the template type is instantiated now. */
3819 }
3822 }
3824 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3825 OVERLOAD) to the CANDIDATES, returning an updated list of
3826 CANDIDATES. The ARGS are the arguments provided to the call,
3827 without any implicit object parameter. The EXPLICIT_TARGS are
3828 explicit template arguments provided. TEMPLATE_ONLY is true if
3829 only template functions should be considered. CONVERSION_PATH,
3830 ACCESS_PATH, and FLAGS are as for add_function_candidate. */
3832 static void
3838 {
3839 tree ctype;
3840 tree non_static_args;
3843 /* Delay creating the implicit this parameter until it is needed. */
3847 {
3848 tree fn;
3849 tree fn_args;
3852 /* Figure out which set of arguments to use. */
3854 {
3855 /* If this function is a non-static member, prepend the implicit
3856 object parameter. */
3862 }
3863 else
3864 /* Otherwise, just use the list of arguments provided. */
3869 fn,
3870 ctype,
3871 explicit_targs,
3872 fn_args,
3873 NULL_TREE,
3874 access_path,
3875 conversion_path,
3876 flags,
3877 DEDUCE_CALL);
3880 fn,
3881 ctype,
3882 fn_args,
3883 access_path,
3884 conversion_path,
3885 flags);
3887 }
3888 }
3890 tree
3893 {
3912 {
3916 }
3917 else
3923 {
3928 /* Use build_op_new_call and build_op_delete_call instead. */
3942 }
3948 {
3955 }
3970 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3973 /* Add namespace-scope operators to the list of functions to
3974 consider. */
3978 /* Add class-member operators to the candidate set. */
3980 {
3981 tree fns;
3985 {
3988 }
3995 }
3997 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
3998 to know about two args; a builtin candidate will always have a first
3999 parameter of type bool. We'll handle that in
4000 build_builtin_candidate. */
4002 {
4006 }
4007 else
4008 {
4012 }
4017 {
4020 /* For these, the built-in candidates set is empty
4021 [over.match.oper]/3. We don't want non-strict matches
4022 because exact matches are always possible with built-in
4023 operators. The built-in candidate set for COMPONENT_REF
4024 would be empty too, but since there are no such built-in
4025 operators, we accept non-strict matches for them. */
4032 }
4036 {
4038 {
4041 /* Don't try anything fancy if we're not allowed to produce
4042 errors. */
4046 /* Look for an `operator++ (int)'. If they didn't have
4047 one, then we fall back to the old way of doing things. */
4051 fnname,
4055 else
4061 /* The caller will deal with these. */
4071 {
4074 }
4077 }
4078 }
4079 else
4080 {
4083 {
4085 {
4088 }
4090 }
4092 {
4098 else
4100 }
4101 else
4102 {
4103 /* Give any warnings we noticed during overload resolution. */
4105 {
4109 }
4111 /* Check for comparison of different enum types. */
4113 {
4125 {
4129 }
4133 }
4135 /* We need to strip any leading REF_BIND so that bitfields
4136 don't cause errors. This should not remove any important
4137 conversions, because builtins don't apply to class
4138 objects directly. */
4144 {
4149 }
4151 {
4156 }
4159 {
4163 }
4164 }
4165 }
4167 user_defined_result_ready:
4169 /* Free all the conversions we allocated. */
4175 builtin:
4177 {
4230 complain),
4231 arg2);
4233 /* The caller will deal with these. */
4241 }
4243 }
4245 /* Build a call to operator delete. This has to be handled very specially,
4246 because the restrictions on what signatures match are different from all
4247 other call instances. For a normal delete, only a delete taking (void *)
4248 or (void *, size_t) is accepted. For a placement delete, only an exact
4249 match with the placement new is accepted.
4251 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4252 ADDR is the pointer to be deleted.
4253 SIZE is the size of the memory block to be deleted.
4254 GLOBAL_P is true if the delete-expression should not consider
4255 class-specific delete operators.
4256 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4258 If this call to "operator delete" is being generated as part to
4259 deallocate memory allocated via a new-expression (as per [expr.new]
4260 which requires that if the initialization throws an exception then
4261 we call a deallocation function), then ALLOC_FN is the allocation
4262 function. */
4264 tree
4267 tree alloc_fn)
4268 {
4283 /* In [class.free]
4285 If the result of the lookup is ambiguous or inaccessible, or if
4286 the lookup selects a placement deallocation function, the
4287 program is ill-formed.
4289 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4290 {
4294 }
4295 else
4301 /* Strip const and volatile from addr. */
4305 {
4306 /* Get the parameter types for the allocation function that is
4307 being called. */
4310 }
4311 else
4312 {
4313 /* First try it without the size argument. */
4315 }
4317 /* We make two tries at finding a matching `operator delete'. On
4318 the first pass, we look for a one-operator (or placement)
4319 operator delete. If we're not doing placement delete, then on
4320 the second pass we look for a two-argument delete. */
4322 {
4323 /* Go through the `operator delete' functions looking for one
4324 with a matching type. */
4326 fn;
4328 {
4329 tree t;
4331 /* The first argument must be "void *". */
4336 /* On the first pass, check the rest of the arguments. */
4338 {
4341 {
4346 }
4349 }
4350 /* On the second pass, look for a function with exactly two
4351 arguments: "void *" and "size_t". */
4353 /* For "operator delete(void *, ...)" there will be
4354 no second argument, but we will not get an exact
4355 match above. */
4356 && t
4360 }
4362 /* If we found a match, we're done. */
4365 }
4367 /* If we have a matching function, call it. */
4369 {
4370 /* Make sure we have the actual function, and not an
4371 OVERLOAD. */
4374 /* If the FN is a member function, make sure that it is
4375 accessible. */
4380 {
4381 /* The placement args might not be suitable for overload
4382 resolution at this point, so build the call directly. */
4391 }
4392 else
4393 {
4394 tree args;
4397 else
4401 }
4402 }
4404 /* [expr.new]
4406 If no unambiguous matching deallocation function can be found,
4407 propagating the exception does not cause the object's memory to
4408 be freed. */
4410 {
4413 alloc_fn);
4415 }
4420 }
4422 /* If the current scope isn't allowed to access DECL along
4423 BASETYPE_PATH, give an error. The most derived class in
4424 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4425 the declaration to use in the error diagnostic. */
4427 bool
4429 {
4433 {
4438 else
4442 }
4445 }
4447 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4448 bitwise or of LOOKUP_* values. If any errors are warnings are
4449 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4450 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4451 to NULL. */
4453 static tree
4456 {
4461 complete_ctor_identifier,
4468 else
4471 }
4473 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4474 EXPR is implicitly converted to type TOTYPE.
4475 FN and ARGNUM are used for diagnostics. */
4477 static void
4479 {
4482 /* Issue warnings about peculiar, but valid, uses of NULL. */
4484 {
4488 else
4490 }
4492 /* Issue warnings if "false" is converted to a NULL pointer */
4497 }
4499 /* Perform the conversions in CONVS on the expression EXPR. FN and
4500 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4501 indicates the `this' argument of a method. INNER is nonzero when
4502 being called to continue a conversion chain. It is negative when a
4503 reference binding will be applied, positive otherwise. If
4504 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4505 conversions will be emitted if appropriate. If C_CAST_P is true,
4506 this conversion is coming from a C-style cast; in that case,
4507 conversions to inaccessible bases are permitted. */
4509 static tree
4513 {
4515 diagnostic_t diag_kind;
4524 {
4527 {
4529 {
4533 complain);
4535 }
4540 complain);
4543 }
4545 {
4549 }
4550 else
4554 }
4560 {
4562 {
4567 /* When converting from an init list we consider explicit
4568 constructors, but actually trying to call one is an error. */
4570 {
4574 else
4576 }
4578 /* Set user_conv_p on the argument conversions, so rvalue/base
4579 handling knows not to allow any more UDCs. */
4585 /* If this is a constructor or a function returning an aggr type,
4586 we need to build up a TARGET_EXPR. */
4588 {
4591 /* Remember that this was list-initialization. */
4594 }
4597 }
4601 /* Convert a constant to its underlying value, unless we are
4602 about to bind it to a reference, in which case we need to
4603 leave it as an lvalue. */
4605 {
4608 /* If __null has been converted to an integer type, we do not
4609 want to warn about uses of EXPR as an integer, rather than
4610 as a pointer. */
4612 }
4615 /* Call build_user_type_conversion again for the error. */
4616 return build_user_type_conversion
4620 {
4621 /* Conversion to std::initializer_list<T>. */
4628 /* Convert all the elements. */
4630 {
4637 }
4638 /* Build up the array. */
4639 elttype = cp_build_qualified_type
4646 /* Call the private constructor. */
4648 new_ctor = build_special_member_call
4652 }
4659 };
4664 c_cast_p,
4665 complain);
4670 {
4675 /* Else fall through. */
4678 {
4679 /* We are going to bind a reference directly to a base-class
4680 subobject of EXPR. */
4681 /* Build an expression for `*((base*) &expr)'. */
4687 }
4689 /* Copy-initialization where the cv-unqualified version of the source
4690 type is the same class as, or a derived class of, the class of the
4691 destination [is treated as direct-initialization]. [dcl.init] */
4694 /* This conversion is being done in the context of a user-defined
4695 conversion (i.e. the second step of copy-initialization), so
4696 don't allow any more. */
4700 {
4706 }
4710 {
4713 /* If necessary, create a temporary.
4715 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
4716 that need temporaries, even when their types are reference
4717 compatible with the type of reference being bound, so the
4718 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
4719 doesn't fail. */
4723 {
4729 {
4731 {
4732 /* If the reference is volatile or non-const, we
4733 cannot create a temporary. */
4740 else
4742 }
4744 }
4745 /* If the source is a packed field, and we must use a copy
4746 constructor, then building the target expr will require
4747 binding the field to the reference parameter to the
4748 copy constructor, and we'll end up with an infinite
4749 loop. If we can use a bitwise copy, then we'll be
4750 OK. */
4754 {
4759 }
4761 {
4764 }
4766 }
4768 /* Take the address of the thing to which we will bind the
4769 reference. */
4774 /* Convert it to a pointer to the type referred to by the
4775 reference. This will adjust the pointer if a derived to
4776 base conversion is being performed. */
4778 expr);
4779 /* Convert the pointer to the desired reference type. */
4781 }
4787 /* Warn about deprecated conversion if appropriate. */
4799 c_cast_p);
4803 }
4810 else
4814 }
4816 /* Build a call to __builtin_trap. */
4818 static tree
4820 {
4826 }
4828 /* ARG is being passed to a varargs function. Perform any conversions
4829 required. Return the converted value. */
4831 tree
4833 {
4834 /* [expr.call]
4836 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
4837 standard conversions are performed. */
4839 /* [expr.call]
4841 If the argument has integral or enumeration type that is subject
4842 to the integral promotions (_conv.prom_), or a floating point
4843 type that is subject to the floating point promotion
4844 (_conv.fpprom_), the value of the argument is converted to the
4845 promoted type before the call. */
4857 {
4858 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
4859 here and do a bitwise copy, but now cp_expr_size will abort if we
4860 try to do that.
4861 If the call appears in the context of a sizeof expression,
4862 there is no need to emit a warning, since the expression won't be
4863 evaluated. We keep the builtin_trap just as a safety check. */
4869 integer_zero_node);
4870 }
4873 }
4875 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
4877 tree
4879 {
4889 {
4890 /* Remove reference types so we don't ICE later on. */
4892 /* Undefined behavior [expr.call] 5.2.2/7. */
4900 }
4903 }
4905 /* TYPE has been given to va_arg. Apply the default conversions which
4906 would have happened when passed via ellipsis. Return the promoted
4907 type, or the passed type if there is no change. */
4909 tree
4911 {
4912 tree promote;
4914 /* Perform the array-to-pointer and function-to-pointer
4915 conversions. */
4923 }
4925 /* ARG is a default argument expression being passed to a parameter of
4926 the indicated TYPE, which is a parameter to FN. Do any required
4927 conversions. Return the converted value. */
4931 tree
4933 {
4935 tree t;
4937 /* If the ARG is an unparsed default argument expression, the
4938 conversion cannot be performed. */
4940 {
4945 }
4947 /* Detect recursion. */
4950 {
4953 }
4959 /* Due to:
4961 [dcl.fct.default]
4963 The names in the expression are bound, and the semantic
4964 constraints are checked, at the point where the default
4965 expressions appears.
4967 we must not perform access checks here. */
4971 {
4975 tf_warning_or_error);
4976 }
4977 else
4978 {
4979 /* We must make a copy of ARG, in case subsequent processing
4980 alters any part of it. For example, during gimplification a
4981 cast of the form (T) &X::f (where "f" is a member function)
4982 will lead to replacing the PTRMEM_CST for &X::f with a
4983 VAR_DECL. We can avoid the copy for constants, since they
4984 are never modified in place. */
4989 tf_warning_or_error);
4991 }
4997 }
4999 /* Returns the type which will really be used for passing an argument of
5000 type TYPE. */
5002 tree
5004 {
5005 /* Pass classes with copy ctors by invisible reference. */
5007 {
5009 /* There are no other pointers to this temporary. */
5011 }
5020 }
5022 /* Actually perform the appropriate conversion. */
5024 tree
5026 {
5027 tree bitfield_type;
5029 /* If VAL is a bitfield, then -- since it has already been converted
5030 to TYPE -- it cannot have a precision greater than TYPE.
5032 If it has a smaller precision, we must widen it here. For
5033 example, passing "int f:3;" to a function expecting an "int" will
5034 not result in any conversion before this point.
5036 If the precision is the same we must not risk widening. For
5037 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5038 often have type "int", even though the C++ type for the field is
5039 "long long". If the value is being passed to a function
5040 expecting an "int", then no conversions will be required. But,
5041 if we call convert_bitfield_to_declared_type, the bitfield will
5042 be converted to "long long". */
5049 ;
5050 /* Pass classes with copy ctors by invisible reference. */
5060 {
5069 }
5071 }
5073 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5074 which no conversions at all should be done. This is true for some
5075 builtins which don't act like normal functions. */
5077 static bool
5079 {
5082 {
5092 }
5095 }
5097 /* Subroutine of the various build_*_call functions. Overload resolution
5098 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5099 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5100 bitmask of various LOOKUP_* flags which apply to the call itself. */
5102 static tree
5104 {
5119 /* In a template, there is no need to perform all of the work that
5120 is normally done. We are only interested in the type of the call
5121 expression, i.e., the return type of the function. Any semantic
5122 errors will be deferred until the template is instantiated. */
5124 {
5125 tree expr;
5126 tree return_type;
5134 }
5136 /* Give any warnings we noticed during overload resolution. */
5138 {
5142 }
5144 /* Make =delete work with SFINAE. */
5149 {
5150 /* If FN is a template function, two cases must be considered.
5151 For example:
5153 struct A {
5154 protected:
5155 template <class T> void f();
5156 };
5157 template <class T> struct B {
5158 protected:
5159 void g();
5160 };
5161 struct C : A, B<int> {
5162 using A::f; // #1
5163 using B<int>::g; // #2
5164 };
5166 In case #1 where `A::f' is a member template, DECL_ACCESS is
5167 recorded in the primary template but not in its specialization.
5168 We check access of FN using its primary template.
5170 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5171 because it is a member of class template B, DECL_ACCESS is
5172 recorded in the specialization `B<int>::g'. We cannot use its
5173 primary template because `B<T>::g' and `B<int>::g' may have
5174 different access. */
5179 else
5181 }
5187 /* Find maximum size of vector to hold converted arguments. */
5194 /* The implicit parameters to a constructor are not considered by overload
5195 resolution, and must be of the proper type. */
5197 {
5201 /* We should never try to call the abstract constructor. */
5205 {
5209 }
5210 }
5211 /* Bypass access control for 'this' parameter. */
5213 {
5216 tree converted_arg;
5217 tree base_binfo;
5220 {
5224 else
5226 }
5228 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5229 X is called for an object that is not of type X, or of a type
5230 derived from X, the behavior is undefined.
5232 So we can assume that anything passed as 'this' is non-null, and
5233 optimize accordingly. */
5235 /* Convert to the base in which the function was declared. */
5241 /* Check that the base class is accessible. */
5247 /* If fn was found by a using declaration, the conversion path
5248 will be to the derived class, not the base declaring fn. We
5249 must convert from derived to base. */
5260 }
5264 {
5269 /* Don't make a copy here if build_call is going to. */
5275 val = convert_like_with_context
5281 else
5283 }
5285 /* Default arguments */
5290 /* Ellipsis */
5292 {
5296 else
5299 }
5307 /* Avoid actually calling copy constructors and copy assignment operators,
5308 if possible. */
5315 {
5316 tree targ;
5319 /* Pull out the real argument, disregarding const-correctness. */
5325 {
5330 }
5331 else
5336 else
5341 {
5342 /* Copy-list-initialization doesn't require the copy constructor
5343 to be defined. */
5344 }
5345 /* [class.copy]: the copy constructor is implicitly defined even if
5346 the implementation elided its use. */
5348 {
5351 }
5353 /* If we're creating a temp and we already have one, don't create a
5354 new one. If we're not creating a temp but we get one, use
5355 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5356 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5357 temp or an INIT_EXPR otherwise. */
5359 {
5364 }
5368 {
5369 tree to = stabilize_reference
5374 }
5375 }
5379 {
5380 tree to = stabilize_reference
5387 {
5390 }
5391 else
5392 {
5393 /* We must only copy the non-tail padding parts.
5394 Use __builtin_memcpy for the bitwise copy. */
5406 }
5409 }
5415 {
5416 tree t;
5422 /* Warn about deprecated virtual functions now, since we're about
5423 to throw away the decl. */
5433 else
5436 }
5437 else
5441 }
5443 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5444 This function performs no overload resolution, conversion, or other
5445 high-level operations. */
5447 tree
5449 {
5450 tree fndecl;
5454 /* If this call might throw an exception, note that fact. */
5461 /* Check that arguments to builtin functions match the expectations. */
5468 /* Some built-in function calls will be evaluated at compile-time in
5469 fold (). */
5482 }
5486 /* Make an expression which yields the address of the Java interface
5487 method FN. This is achieved by generating a call to libjava's
5488 _Jv_LookupInterfaceMethodIdx(). */
5490 static tree
5492 {
5498 {
5503 endlink)));
5504 java_iface_lookup_fn
5508 }
5510 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5511 This is the first entry in the vtable. */
5513 tf_warning_or_error),
5514 integer_zero_node);
5516 /* Get the java.lang.Class pointer for the interface being called. */
5521 {
5523 iface);
5525 }
5529 /* Determine the itable index of FN. */
5532 {
5537 i++;
5538 }
5543 java_iface_lookup_fn);
5546 }
5548 /* Returns the value to use for the in-charge parameter when making a
5549 call to a function with the indicated NAME.
5551 FIXME:Can't we find a neater way to do this mapping? */
5553 tree
5555 {
5566 /* This function should only be called with one of the names listed
5567 above. */
5570 }
5572 /* Build a call to a constructor, destructor, or an assignment
5573 operator for INSTANCE, an expression with class type. NAME
5574 indicates the special member function to call; ARGS are the
5575 arguments. BINFO indicates the base of INSTANCE that is to be
5576 passed as the `this' parameter to the member function called.
5578 FLAGS are the LOOKUP_* flags to use when processing the call.
5580 If NAME indicates a complete object constructor, INSTANCE may be
5581 NULL_TREE. In this case, the caller will call build_cplus_new to
5582 store the newly constructed object into a VAR_DECL. */
5584 tree
5587 {
5588 tree fns;
5589 /* The type of the subobject to be constructed or destroyed. */
5590 tree class_type;
5599 {
5600 /* Resolve the name. */
5605 }
5611 /* Handle the special case where INSTANCE is NULL_TREE. */
5613 {
5616 }
5617 else
5618 {
5624 /* Convert to the base class, if necessary. */
5627 {
5629 /* For constructors and destructors, either the base is
5630 non-virtual, or it is virtual but we are doing the
5631 conversion from a constructor or destructor for the
5632 complete object. In either case, we can convert
5633 statically. */
5635 else
5636 /* However, for assignment operators, we must convert
5637 dynamically if the base is virtual. */
5640 }
5641 }
5647 /* When making a call to a constructor or destructor for a subobject
5648 that uses virtual base classes, pass down a pointer to a VTT for
5649 the subobject. */
5653 {
5654 tree vtt;
5655 tree sub_vtt;
5657 /* If the current function is a complete object constructor
5658 or destructor, then we fetch the VTT directly.
5659 Otherwise, we look it up using the VTT we were given. */
5665 current_vtt_parm,
5666 vtt);
5672 }
5677 complain);
5678 }
5680 /* Return the NAME, as a C string. The NAME indicates a function that
5681 is a member of TYPE. *FREE_P is set to true if the caller must
5682 free the memory returned.
5684 Rather than go through all of this, we should simply set the names
5685 of constructors and destructors appropriately, and dispense with
5686 ctor_identifier, dtor_identifier, etc. */
5690 {
5693 /* Assume that we will not allocate memory. */
5695 /* Constructors and destructors are special. */
5697 {
5698 pretty_name
5700 /* For a destructor, add the '~'. */
5704 {
5706 /* Remember that we need to free the memory allocated. */
5708 }
5709 }
5711 {
5714 TFF_PLAIN_IDENTIFIER),
5715 NULL);
5716 /* Remember that we need to free the memory allocated. */
5718 }
5719 else
5723 }
5725 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
5726 be set, upon return, to the function called. */
5728 tree
5732 {
5736 tree access_binfo;
5737 tree optype;
5739 tree name;
5740 tree user_args;
5741 tree call;
5742 tree fn;
5743 tree class_type;
5746 tree orig_instance;
5747 tree orig_fns;
5748 tree orig_args;
5753 /* We don't know what function we're going to call, yet. */
5763 {
5767 }
5773 /* Dismantle the baselink to collect all the information we need. */
5780 {
5784 }
5795 {
5798 }
5800 /* The USER_ARGS are the arguments we will display to users if an
5801 error occurs. The USER_ARGS should not include any
5802 compiler-generated arguments. The "this" pointer hasn't been
5803 added yet. However, we must remove the VTT pointer if this is a
5804 call to a base-class constructor or destructor. */
5807 {
5808 /* Callers should explicitly indicate whether they want to construct
5809 the complete object or just the part without virtual bases. */
5811 /* Similarly for destructors. */
5813 /* Remove the VTT pointer, if present. */
5817 }
5819 /* Process the argument list. */
5826 /* It's OK to call destructors and constructors on cv-qualified objects.
5827 Therefore, convert the INSTANCE_PTR to the unqualified type, if
5828 necessary. */
5831 {
5835 }
5839 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
5840 initializer, not T({ }). If the type doesn't have a list ctor,
5841 break apart the list into separate ctor args. */
5846 {
5849 }
5854 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5858 {
5860 tree this_arglist;
5862 /* We can end up here for copy-init of same or base class. */
5869 else
5873 /* A member template. */
5875 class_type,
5876 explicit_targs,
5878 access_binfo,
5879 conversion_path,
5880 flags,
5881 DEDUCE_CALL);
5884 class_type,
5885 this_arglist,
5886 access_binfo,
5887 conversion_path,
5888 flags);
5889 }
5893 {
5895 {
5898 else
5899 {
5909 }
5911 }
5913 }
5914 else
5915 {
5918 {
5923 {
5926 user_args);
5930 }
5932 }
5933 else
5934 {
5943 /* This is not an error, it is runtime undefined
5944 behavior. */
5946 "abstract virtual %q#D called from constructor"
5948 fn);
5952 {
5955 fn);
5957 }
5958 else
5959 {
5963 /* Now we know what function is being called. */
5966 /* Build the actual CALL_EXPR. */
5968 /* In an expression of the form `a->f()' where `f' turns
5969 out to be a static member function, `a' is
5970 none-the-less evaluated. */
5979 /* An explicit call of the form "x->~X()" has type
5980 "void". However, on platforms where destructors
5981 return "this" (i.e., those where
5982 targetm.cxx.cdtor_returns_this is true), such calls
5983 will appear to have a return value of pointer type
5984 to the low-level call machinery. We do not want to
5985 change the low-level machinery, since we want to be
5986 able to optimize "delete f()" on such platforms as
5987 "operator delete(~X(f()))" (rather than generating
5988 "t = f(), ~X(t), operator delete (t)"). */
5990 }
5991 }
5992 }
5995 {
6001 {
6004 }
6007 call = (build_min_non_dep_call_list
6011 orig_args));
6015 }
6017 /* Free all the conversions we allocated. */
6021 }
6023 /* Returns true iff standard conversion sequence ICS1 is a proper
6024 subsequence of ICS2. */
6026 static bool
6028 {
6029 /* We can assume that a conversion of the same code
6030 between the same types indicates a subsequence since we only get
6031 here if the types we are converting from are the same. */
6038 {
6046 /* At this point, ICS1 cannot be a proper subsequence of
6047 ICS2. We can get a USER_CONV when we are comparing the
6048 second standard conversion sequence of two user conversion
6049 sequences. */
6059 }
6060 }
6062 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6063 be any _TYPE nodes. */
6065 bool
6067 {
6071 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6072 considers every class derived from itself. */
6075 }
6077 /* We build the ICS for an implicit object parameter as a pointer
6078 conversion sequence. However, such a sequence should be compared
6079 as if it were a reference conversion sequence. If ICS is the
6080 implicit conversion sequence for an implicit object parameter,
6081 modify it accordingly. */
6083 static void
6085 {
6087 {
6088 /* [over.match.funcs]
6090 For non-static member functions, the type of the
6091 implicit object parameter is "reference to cv X"
6092 where X is the class of which the function is a
6093 member and cv is the cv-qualification on the member
6094 function declaration. */
6096 tree reference_type;
6098 /* The `this' parameter is a pointer to a class type. Make the
6099 implicit conversion talk about a reference to that same class
6100 type. */
6113 }
6114 }
6116 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6117 and return the initial reference binding conversion. Otherwise,
6118 leave *ICS unchanged and return NULL. */
6122 {
6124 {
6130 }
6133 }
6135 /* Compare two implicit conversion sequences according to the rules set out in
6136 [over.ics.rank]. Return values:
6138 1: ics1 is better than ics2
6139 -1: ics2 is better than ics1
6140 0: ics1 and ics2 are indistinguishable */
6142 static int
6144 {
6145 tree from_type1;
6146 tree from_type2;
6147 tree to_type1;
6148 tree to_type2;
6155 /* REF_BINDING is nonzero if the result of the conversion sequence
6156 is a reference type. In that case REF_CONV is the reference
6157 binding conversion. */
6161 /* Handle implicit object parameters. */
6165 /* Handle reference parameters. */
6169 /* [over.ics.rank]
6171 When comparing the basic forms of implicit conversion sequences (as
6172 defined in _over.best.ics_)
6174 --a standard conversion sequence (_over.ics.scs_) is a better
6175 conversion sequence than a user-defined conversion sequence
6176 or an ellipsis conversion sequence, and
6178 --a user-defined conversion sequence (_over.ics.user_) is a
6179 better conversion sequence than an ellipsis conversion sequence
6180 (_over.ics.ellipsis_). */
6190 {
6191 /* XXX Isn't this an extension? */
6192 /* Both ICS are bad. We try to make a decision based on what
6193 would have happened if they'd been good. */
6201 /* We couldn't make up our minds; try to figure it out below. */
6202 }
6205 /* Both conversions are ellipsis conversions. */
6208 /* User-defined conversion sequence U1 is a better conversion sequence
6209 than another user-defined conversion sequence U2 if they contain the
6210 same user-defined conversion operator or constructor and if the sec-
6211 ond standard conversion sequence of U1 is better than the second
6212 standard conversion sequence of U2. */
6215 {
6226 /* Conversion to std::initializer_list is better than other
6227 user-defined conversions. */
6230 {
6235 else
6237 }
6242 /* We can just fall through here, after setting up
6243 FROM_TYPE1 and FROM_TYPE2. */
6246 }
6247 else
6248 {
6252 /* We're dealing with two standard conversion sequences.
6254 [over.ics.rank]
6256 Standard conversion sequence S1 is a better conversion
6257 sequence than standard conversion sequence S2 if
6259 --S1 is a proper subsequence of S2 (comparing the conversion
6260 sequences in the canonical form defined by _over.ics.scs_,
6261 excluding any Lvalue Transformation; the identity
6262 conversion sequence is considered to be a subsequence of
6263 any non-identity conversion sequence */
6274 }
6276 /* One sequence can only be a subsequence of the other if they start with
6277 the same type. They can start with different types when comparing the
6278 second standard conversion sequence in two user-defined conversion
6279 sequences. */
6281 {
6286 }
6288 /* [over.ics.rank]
6290 Or, if not that,
6292 --the rank of S1 is better than the rank of S2 (by the rules
6293 defined below):
6295 Standard conversion sequences are ordered by their ranks: an Exact
6296 Match is a better conversion than a Promotion, which is a better
6297 conversion than a Conversion.
6299 Two conversion sequences with the same rank are indistinguishable
6300 unless one of the following rules applies:
6302 --A conversion that is not a conversion of a pointer, or pointer
6303 to member, to bool is better than another conversion that is such
6304 a conversion.
6306 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6307 so that we do not have to check it explicitly. */
6316 /* A conversion from scalar arithmetic type to complex is worse than a
6317 conversion between scalar arithmetic types. */
6324 {
6327 else
6329 }
6335 {
6340 }
6341 /* The rules for pointers to members A::* are just like the rules
6342 for pointers A*, except opposite: if B is derived from A then
6343 A::* converts to B::*, not vice versa. For that reason, we
6344 switch the from_ and to_ variables here. */
6351 {
6356 }
6361 {
6362 /* This was one of the pointer or pointer-like conversions.
6364 [over.ics.rank]
6366 --If class B is derived directly or indirectly from class A,
6367 conversion of B* to A* is better than conversion of B* to
6368 void*, and conversion of A* to void* is better than
6369 conversion of B* to void*. */
6372 {
6374 deref_from_type2))
6377 deref_from_type1))
6379 }
6382 {
6384 {
6386 {
6388 deref_to_type1))
6390 }
6391 /* We know that DEREF_TO_TYPE1 is `void' here. */
6393 deref_to_type2))
6395 }
6396 }
6399 {
6400 /* [over.ics.rank]
6402 --If class B is derived directly or indirectly from class A
6403 and class C is derived directly or indirectly from B,
6405 --conversion of C* to B* is better than conversion of C* to
6406 A*,
6408 --conversion of B* to A* is better than conversion of C* to
6409 A* */
6411 {
6413 deref_to_type2))
6416 deref_to_type1))
6418 }
6420 {
6422 deref_from_type1))
6425 deref_from_type2))
6427 }
6428 }
6429 }
6432 {
6435 /* [over.ics.rank]
6437 --binding of an expression of type C to a reference of type
6438 B& is better than binding an expression of type C to a
6439 reference of type A&
6441 --conversion of C to B is better than conversion of C to A, */
6444 {
6449 }
6450 }
6453 {
6456 /* [over.ics.rank]
6458 --binding of an expression of type B to a reference of type
6459 A& is better than binding an expression of type C to a
6460 reference of type A&,
6462 --conversion of B to A is better than conversion of C to A */
6465 {
6470 }
6471 }
6473 /* [over.ics.rank]
6475 --S1 and S2 differ only in their qualification conversion and yield
6476 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6477 qualification signature of type T1 is a proper subset of the cv-
6478 qualification signature of type T2 */
6482 {
6486 }
6488 /* [over.ics.rank]
6490 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6491 to an implicit object parameter, and either S1 binds an lvalue reference
6492 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6493 reference to an rvalue and S2 binds an lvalue reference
6494 (C++0x draft standard, 13.3.3.2)
6496 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6497 types to which the references refer are the same type except for
6498 top-level cv-qualifiers, and the type to which the reference
6499 initialized by S2 refers is more cv-qualified than the type to
6500 which the reference initialized by S1 refers */
6503 {
6507 {
6512 }
6517 }
6519 /* Neither conversion sequence is better than the other. */
6521 }
6523 /* The source type for this standard conversion sequence. */
6525 static tree
6527 {
6529 {
6534 }
6536 }
6538 /* Note a warning about preferring WINNER to LOSER. We do this by storing
6539 a pointer to LOSER and re-running joust to produce the warning if WINNER
6540 is actually used. */
6542 static void
6544 {
6550 }
6552 /* Compare two candidates for overloading as described in
6553 [over.match.best]. Return values:
6555 1: cand1 is better than cand2
6556 -1: cand2 is better than cand1
6557 0: cand1 and cand2 are indistinguishable */
6559 static int
6561 {
6567 /* Candidates that involve bad conversions are always worse than those
6568 that don't. */
6574 /* If we have two pseudo-candidates for conversions to the same type,
6575 or two candidates for the same function, arbitrarily pick one. */
6580 /* a viable function F1
6581 is defined to be a better function than another viable function F2 if
6582 for all arguments i, ICSi(F1) is not a worse conversion sequence than
6583 ICSi(F2), and then */
6585 /* for some argument j, ICSj(F1) is a better conversion sequence than
6586 ICSj(F2) */
6588 /* For comparing static and non-static member functions, we ignore
6589 the implicit object parameter of the non-static function. The
6590 standard says to pretend that the static function has an object
6591 parm, but that won't work with operator overloading. */
6594 {
6602 else
6603 {
6606 }
6607 }
6610 {
6616 {
6629 {
6636 else
6641 {
6645 }
6646 else
6648 }
6651 {
6654 }
6656 }
6657 }
6659 /* warn about confusing overload resolution for user-defined conversions,
6660 either between a constructor and a conversion op, or between two
6661 conversion ops. */
6665 {
6671 else
6674 /* We don't want to complain about `X::operator T1 ()'
6675 beating `X::operator T2 () const', when T2 is a no less
6676 cv-qualified version of T1. */
6679 {
6684 {
6687 }
6690 }
6691 else
6697 {
6704 {
6706 }
6707 }
6708 else
6710 }
6715 /* or, if not that,
6716 F1 is a non-template function and F2 is a template function
6717 specialization. */
6724 /* or, if not that,
6725 F1 and F2 are template functions and the function template for F1 is
6726 more specialized than the template for F2 according to the partial
6727 ordering rules. */
6730 {
6731 winner = more_specialized_fn
6734 /* [temp.func.order]: The presence of unused ellipsis and default
6735 arguments has no effect on the partial ordering of function
6736 templates. add_function_candidate() will not have
6737 counted the "this" argument for constructors. */
6741 }
6743 /* or, if not that,
6744 the context is an initialization by user-defined conversion (see
6745 _dcl.init_ and _over.match.user_) and the standard conversion
6746 sequence from the return type of F1 to the destination type (i.e.,
6747 the type of the entity being initialized) is a better conversion
6748 sequence than the standard conversion sequence from the return type
6749 of F2 to the destination type. */
6752 {
6756 }
6758 /* Check whether we can discard a builtin candidate, either because we
6759 have two identical ones or matching builtin and non-builtin candidates.
6761 (Pedantically in the latter case the builtin which matched the user
6762 function should not be added to the overload set, but we spot it here.
6764 [over.match.oper]
6765 ... the builtin candidates include ...
6766 - do not have the same parameter type list as any non-template
6767 non-member candidate. */
6771 {
6777 {
6779 /* Two built-in candidates; arbitrarily pick one. */
6782 /* cand1 is built-in; prefer cand2. */
6784 else
6785 /* cand2 is built-in; prefer cand1. */
6787 }
6788 }
6790 /* If the two functions are the same (this can happen with declarations
6791 in multiple scopes and arg-dependent lookup), arbitrarily choose one. */
6796 tweak:
6798 /* Extension: If the worst conversion for one candidate is worse than the
6799 worst conversion for the other, take the first. */
6801 {
6806 {
6811 }
6817 {
6819 {
6821 "ISO C++ says that these are ambiguous, even "
6822 "though the worst conversion for the first is better than "
6826 }
6827 else
6830 }
6831 }
6835 }
6837 /* Given a list of candidates for overloading, find the best one, if any.
6838 This algorithm has a worst case of O(2n) (winner is last), and a best
6839 case of O(n/2) (totally ambiguous); much better than a sorting
6840 algorithm. */
6844 {
6849 /* Walk through the list once, comparing each current champ to the next
6850 candidate, knocking out a candidate or two with each comparison. */
6853 {
6857 else
6858 {
6860 {
6865 }
6866 else
6867 {
6870 }
6873 }
6874 }
6876 /* Make sure the champ is better than all the candidates it hasn't yet
6877 been compared to. */
6880 challenger != champ
6883 {
6887 }
6890 }
6892 /* Returns nonzero if things of type FROM can be converted to TO. */
6894 bool
6896 {
6898 }
6900 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
6902 bool
6904 {
6909 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6913 flags);
6916 /* Free all the conversions we allocated. */
6920 }
6922 /* Like can_convert_arg, but allows dubious conversions as well. */
6924 bool
6926 {
6930 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6932 /* Try to perform the conversion. */
6934 LOOKUP_NORMAL);
6935 /* Free all the conversions we allocated. */
6939 }
6941 /* Convert EXPR to TYPE. Return the converted expression.
6943 Note that we allow bad conversions here because by the time we get to
6944 this point we are committed to doing the conversion. If we end up
6945 doing a bad conversion, convert_like will complain. */
6947 tree
6949 {
6956 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6961 LOOKUP_NORMAL);
6963 {
6967 }
6969 {
6970 /* In a template, we are only concerned about determining the
6971 type of non-dependent expressions, so we do not have to
6972 perform the actual conversion. */
6975 }
6976 else
6979 /* Free all the conversions we allocated. */
6983 }
6985 /* Convert EXPR to TYPE (as a direct-initialization) if that is
6986 permitted. If the conversion is valid, the converted expression is
6987 returned. Otherwise, NULL_TREE is returned, except in the case
6988 that TYPE is a class type; in that case, an error is issued. If
6989 C_CAST_P is true, then this direction initialization is taking
6990 place as part of a static_cast being attempted as part of a C-style
6991 cast. */
6993 tree
6995 tree expr,
6997 tsubst_flags_t complain)
6998 {
7004 /* [dcl.init]
7006 If the destination type is a (possibly cv-qualified) class type:
7008 -- If the initialization is direct-initialization ...,
7009 constructors are considered. ... If no constructor applies, or
7010 the overload resolution is ambiguous, the initialization is
7011 ill-formed. */
7013 {
7018 }
7020 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7024 c_cast_p,
7025 LOOKUP_NORMAL);
7028 else
7031 c_cast_p,
7032 tf_warning_or_error);
7034 /* Free all the conversions we allocated. */
7038 }
7040 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7041 is being bound to a temporary. Create and return a new VAR_DECL
7042 with the indicated TYPE; this variable will store the value to
7043 which the reference is bound. */
7045 tree
7047 {
7048 tree var;
7050 /* Create the variable. */
7053 /* Register the variable. */
7055 {
7056 /* Namespace-scope or local static; give it a mangled name. */
7057 tree name;
7064 }
7065 else
7066 /* Create a new cleanup level if necessary. */
7070 }
7072 /* EXPR is the initializer for a variable DECL of reference or
7073 std::initializer_list type. Create, push and return a new VAR_DECL
7074 for the initializer so that it will live as long as DECL. Any
7075 cleanup for the new variable is returned through CLEANUP, and the
7076 code to initialize the new variable is returned through INITP. */
7078 tree
7080 {
7081 tree init;
7082 tree type;
7083 tree var;
7085 /* Create the temporary variable. */
7089 /* If the rvalue is the result of a function call it will be
7090 a TARGET_EXPR. If it is some other construct (such as a
7091 member access expression where the underlying object is
7092 itself the result of a function call), turn it into a
7093 TARGET_EXPR here. It is important that EXPR be a
7094 TARGET_EXPR below since otherwise the INIT_EXPR will
7095 attempt to make a bitwise copy of EXPR to initialize
7096 VAR. */
7099 /* Create the INIT_EXPR that will initialize the temporary
7100 variable. */
7103 {
7108 else
7111 /* We must be careful to destroy the temporary only
7112 after its initialization has taken place. If the
7113 initialization throws an exception, then the
7114 destructor should not be run. We cannot simply
7115 transform INIT into something like:
7117 (INIT, ({ CLEANUP_STMT; }))
7119 because emit_local_var always treats the
7120 initializer as a full-expression. Thus, the
7121 destructor would run too early; it would run at the
7122 end of initializing the reference variable, rather
7123 than at the end of the block enclosing the
7124 reference variable.
7126 The solution is to pass back a cleanup expression
7127 which the caller is responsible for attaching to
7128 the statement tree. */
7129 }
7130 else
7131 {
7135 static_aggregates);
7136 }
7140 }
7142 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7143 initializing a variable of that TYPE. If DECL is non-NULL, it is
7144 the VAR_DECL being initialized with the EXPR. (In that case, the
7145 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7146 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7147 return, if *CLEANUP is no longer NULL, it will be an expression
7148 that should be pushed as a cleanup after the returned expression
7149 is used to initialize DECL.
7151 Return the converted expression. */
7153 tree
7155 {
7162 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7166 LOOKUP_NORMAL);
7168 {
7174 else
7179 }
7181 /* If DECL is non-NULL, then this special rule applies:
7183 [class.temporary]
7185 The temporary to which the reference is bound or the temporary
7186 that is the complete object to which the reference is bound
7187 persists for the lifetime of the reference.
7189 The temporaries created during the evaluation of the expression
7190 initializing the reference, except the temporary to which the
7191 reference is bound, are destroyed at the end of the
7192 full-expression in which they are created.
7194 In that case, we store the converted expression into a new
7195 VAR_DECL in a new scope.
7197 However, we want to be careful not to create temporaries when
7198 they are not required. For example, given:
7200 struct B {};
7201 struct D : public B {};
7202 D f();
7203 const B& b = f();
7205 there is no need to copy the return value from "f"; we can just
7206 extend its lifetime. Similarly, given:
7208 struct S {};
7209 struct T { operator S(); };
7210 T t;
7211 const S& s = t;
7213 we can extend the lifetime of the return value of the conversion
7214 operator. */
7217 {
7218 tree var;
7219 tree base_conv_type;
7221 /* Skip over the REF_BIND. */
7223 /* If the next conversion is a BASE_CONV, skip that too -- but
7224 remember that the conversion was required. */
7226 {
7229 }
7230 else
7232 /* Perform the remainder of the conversion. */
7238 tf_warning_or_error);
7241 else
7242 {
7244 {
7245 tree init;
7247 /* Use its address to initialize the reference variable. */
7255 }
7256 else
7257 /* Take the address of EXPR. */
7259 /* If a BASE_CONV was required, perform it now. */
7261 expr = (perform_implicit_conversion
7263 tf_warning_or_error));
7265 }
7266 }
7267 else
7268 /* Perform the conversion. */
7271 /* Free all the conversions we allocated. */
7275 }
7277 /* Returns true iff TYPE is some variant of std::initializer_list. */
7279 bool
7281 {
7285 }
7287 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7288 will accept an argument list of a single std::initializer_list<T>. */
7290 bool
7292 {
7294 tree arg;
7306 /* There are more non-defaulted parms. */
7310 }