2008-10-21 20:13:35 +04:00
|
|
|
//===--- Overload.h - C++ Overloading ---------------------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the data structures and types used in C++
|
|
|
|
// overload resolution.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_CLANG_SEMA_OVERLOAD_H
|
|
|
|
#define LLVM_CLANG_SEMA_OVERLOAD_H
|
|
|
|
|
2009-12-10 02:02:17 +03:00
|
|
|
#include "clang/AST/Decl.h"
|
2010-05-08 21:41:32 +04:00
|
|
|
#include "clang/AST/DeclTemplate.h"
|
2010-01-13 12:16:55 +03:00
|
|
|
#include "clang/AST/Expr.h"
|
2010-05-08 21:41:32 +04:00
|
|
|
#include "clang/AST/TemplateBase.h"
|
2009-12-10 02:02:17 +03:00
|
|
|
#include "clang/AST/Type.h"
|
2010-03-19 10:35:19 +03:00
|
|
|
#include "clang/AST/UnresolvedSet.h"
|
2011-07-28 23:46:48 +04:00
|
|
|
#include "clang/Sema/SemaFixItUtils.h"
|
2009-12-10 02:02:17 +03:00
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2008-10-21 20:13:35 +04:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2012-01-14 20:32:05 +04:00
|
|
|
#include "llvm/Support/Allocator.h"
|
2008-10-21 20:13:35 +04:00
|
|
|
|
|
|
|
namespace clang {
|
2009-12-10 02:02:17 +03:00
|
|
|
class ASTContext;
|
2008-11-03 22:09:14 +03:00
|
|
|
class CXXConstructorDecl;
|
2009-12-10 02:02:17 +03:00
|
|
|
class CXXConversionDecl;
|
2008-10-21 20:13:35 +04:00
|
|
|
class FunctionDecl;
|
2010-08-25 00:38:10 +04:00
|
|
|
class Sema;
|
2008-10-21 20:13:35 +04:00
|
|
|
|
2009-12-10 02:02:17 +03:00
|
|
|
/// OverloadingResult - Capture the result of performing overload
|
|
|
|
/// resolution.
|
|
|
|
enum OverloadingResult {
|
|
|
|
OR_Success, ///< Overload resolution succeeded.
|
|
|
|
OR_No_Viable_Function, ///< No viable function found.
|
|
|
|
OR_Ambiguous, ///< Ambiguous candidates found.
|
2010-04-08 02:52:07 +04:00
|
|
|
OR_Deleted ///< Succeeded, but refers to a deleted function.
|
2009-12-10 02:02:17 +03:00
|
|
|
};
|
2010-08-25 00:38:10 +04:00
|
|
|
|
|
|
|
enum OverloadCandidateDisplayKind {
|
|
|
|
/// Requests that all candidates be shown. Viable candidates will
|
|
|
|
/// be printed first.
|
|
|
|
OCD_AllCandidates,
|
|
|
|
|
|
|
|
/// Requests that only viable candidates be shown.
|
|
|
|
OCD_ViableCandidates
|
|
|
|
};
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// ImplicitConversionKind - The kind of implicit conversion used to
|
|
|
|
/// convert an argument to a parameter's type. The enumerator values
|
|
|
|
/// match with Table 9 of (C++ 13.3.3.1.1) and are listed such that
|
|
|
|
/// better conversion kinds have smaller values.
|
|
|
|
enum ImplicitConversionKind {
|
Initial implementation of function overloading in C.
This commit adds a new attribute, "overloadable", that enables C++
function overloading in C. The attribute can only be added to function
declarations, e.g.,
int *f(int) __attribute__((overloadable));
If the "overloadable" attribute exists on a function with a given
name, *all* functions with that name (and in that scope) must have the
"overloadable" attribute. Sets of overloaded functions with the
"overloadable" attribute then follow the normal C++ rules for
overloaded functions, e.g., overloads must have different
parameter-type-lists from each other.
When calling an overloaded function in C, we follow the same
overloading rules as C++, with three extensions to the set of standard
conversions:
- A value of a given struct or union type T can be converted to the
type T. This is just the identity conversion. (In C++, this would
go through a copy constructor).
- A value of pointer type T* can be converted to a value of type U*
if T and U are compatible types. This conversion has Conversion
rank (it's considered a pointer conversion in C).
- A value of type T can be converted to a value of type U if T and U
are compatible (and are not both pointer types). This conversion
has Conversion rank (it's considered to be a new kind of
conversion unique to C, a "compatible" conversion).
Known defects (and, therefore, next steps):
1) The standard-conversion handling does not understand conversions
involving _Complex or vector extensions, so it is likely to get
these wrong. We need to add these conversions.
2) All overloadable functions with the same name will have the same
linkage name, which means we'll get a collision in the linker (if
not sooner). We'll need to mangle the names of these functions.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@64336 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-12 02:02:49 +03:00
|
|
|
ICK_Identity = 0, ///< Identity conversion (no conversion)
|
|
|
|
ICK_Lvalue_To_Rvalue, ///< Lvalue-to-rvalue conversion (C++ 4.1)
|
|
|
|
ICK_Array_To_Pointer, ///< Array-to-pointer conversion (C++ 4.2)
|
|
|
|
ICK_Function_To_Pointer, ///< Function-to-pointer (C++ 4.3)
|
2009-12-09 03:47:37 +03:00
|
|
|
ICK_NoReturn_Adjustment, ///< Removal of noreturn from a type (Clang)
|
Initial implementation of function overloading in C.
This commit adds a new attribute, "overloadable", that enables C++
function overloading in C. The attribute can only be added to function
declarations, e.g.,
int *f(int) __attribute__((overloadable));
If the "overloadable" attribute exists on a function with a given
name, *all* functions with that name (and in that scope) must have the
"overloadable" attribute. Sets of overloaded functions with the
"overloadable" attribute then follow the normal C++ rules for
overloaded functions, e.g., overloads must have different
parameter-type-lists from each other.
When calling an overloaded function in C, we follow the same
overloading rules as C++, with three extensions to the set of standard
conversions:
- A value of a given struct or union type T can be converted to the
type T. This is just the identity conversion. (In C++, this would
go through a copy constructor).
- A value of pointer type T* can be converted to a value of type U*
if T and U are compatible types. This conversion has Conversion
rank (it's considered a pointer conversion in C).
- A value of type T can be converted to a value of type U if T and U
are compatible (and are not both pointer types). This conversion
has Conversion rank (it's considered to be a new kind of
conversion unique to C, a "compatible" conversion).
Known defects (and, therefore, next steps):
1) The standard-conversion handling does not understand conversions
involving _Complex or vector extensions, so it is likely to get
these wrong. We need to add these conversions.
2) All overloadable functions with the same name will have the same
linkage name, which means we'll get a collision in the linker (if
not sooner). We'll need to mangle the names of these functions.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@64336 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-12 02:02:49 +03:00
|
|
|
ICK_Qualification, ///< Qualification conversions (C++ 4.4)
|
|
|
|
ICK_Integral_Promotion, ///< Integral promotions (C++ 4.5)
|
|
|
|
ICK_Floating_Promotion, ///< Floating point promotions (C++ 4.6)
|
2009-02-12 03:15:05 +03:00
|
|
|
ICK_Complex_Promotion, ///< Complex promotions (Clang extension)
|
Initial implementation of function overloading in C.
This commit adds a new attribute, "overloadable", that enables C++
function overloading in C. The attribute can only be added to function
declarations, e.g.,
int *f(int) __attribute__((overloadable));
If the "overloadable" attribute exists on a function with a given
name, *all* functions with that name (and in that scope) must have the
"overloadable" attribute. Sets of overloaded functions with the
"overloadable" attribute then follow the normal C++ rules for
overloaded functions, e.g., overloads must have different
parameter-type-lists from each other.
When calling an overloaded function in C, we follow the same
overloading rules as C++, with three extensions to the set of standard
conversions:
- A value of a given struct or union type T can be converted to the
type T. This is just the identity conversion. (In C++, this would
go through a copy constructor).
- A value of pointer type T* can be converted to a value of type U*
if T and U are compatible types. This conversion has Conversion
rank (it's considered a pointer conversion in C).
- A value of type T can be converted to a value of type U if T and U
are compatible (and are not both pointer types). This conversion
has Conversion rank (it's considered to be a new kind of
conversion unique to C, a "compatible" conversion).
Known defects (and, therefore, next steps):
1) The standard-conversion handling does not understand conversions
involving _Complex or vector extensions, so it is likely to get
these wrong. We need to add these conversions.
2) All overloadable functions with the same name will have the same
linkage name, which means we'll get a collision in the linker (if
not sooner). We'll need to mangle the names of these functions.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@64336 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-12 02:02:49 +03:00
|
|
|
ICK_Integral_Conversion, ///< Integral conversions (C++ 4.7)
|
|
|
|
ICK_Floating_Conversion, ///< Floating point conversions (C++ 4.8)
|
2009-02-12 03:15:05 +03:00
|
|
|
ICK_Complex_Conversion, ///< Complex conversions (C99 6.3.1.6)
|
Initial implementation of function overloading in C.
This commit adds a new attribute, "overloadable", that enables C++
function overloading in C. The attribute can only be added to function
declarations, e.g.,
int *f(int) __attribute__((overloadable));
If the "overloadable" attribute exists on a function with a given
name, *all* functions with that name (and in that scope) must have the
"overloadable" attribute. Sets of overloaded functions with the
"overloadable" attribute then follow the normal C++ rules for
overloaded functions, e.g., overloads must have different
parameter-type-lists from each other.
When calling an overloaded function in C, we follow the same
overloading rules as C++, with three extensions to the set of standard
conversions:
- A value of a given struct or union type T can be converted to the
type T. This is just the identity conversion. (In C++, this would
go through a copy constructor).
- A value of pointer type T* can be converted to a value of type U*
if T and U are compatible types. This conversion has Conversion
rank (it's considered a pointer conversion in C).
- A value of type T can be converted to a value of type U if T and U
are compatible (and are not both pointer types). This conversion
has Conversion rank (it's considered to be a new kind of
conversion unique to C, a "compatible" conversion).
Known defects (and, therefore, next steps):
1) The standard-conversion handling does not understand conversions
involving _Complex or vector extensions, so it is likely to get
these wrong. We need to add these conversions.
2) All overloadable functions with the same name will have the same
linkage name, which means we'll get a collision in the linker (if
not sooner). We'll need to mangle the names of these functions.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@64336 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-12 02:02:49 +03:00
|
|
|
ICK_Floating_Integral, ///< Floating-integral conversions (C++ 4.9)
|
|
|
|
ICK_Pointer_Conversion, ///< Pointer conversions (C++ 4.10)
|
|
|
|
ICK_Pointer_Member, ///< Pointer-to-member conversions (C++ 4.11)
|
|
|
|
ICK_Boolean_Conversion, ///< Boolean conversions (C++ 4.12)
|
|
|
|
ICK_Compatible_Conversion, ///< Conversions between compatible types in C99
|
|
|
|
ICK_Derived_To_Base, ///< Derived-to-base (C++ [over.best.ics])
|
2010-05-19 02:42:18 +04:00
|
|
|
ICK_Vector_Conversion, ///< Vector conversions
|
|
|
|
ICK_Vector_Splat, ///< A vector splat from an arithmetic type
|
2010-02-25 10:20:54 +03:00
|
|
|
ICK_Complex_Real, ///< Complex-real conversions (C99 6.3.1.7)
|
2011-02-12 22:07:46 +03:00
|
|
|
ICK_Block_Pointer_Conversion, ///< Block Pointer conversions
|
2013-02-17 02:21:38 +04:00
|
|
|
ICK_TransparentUnionConversion, ///< Transparent Union Conversions
|
2011-06-16 03:02:42 +04:00
|
|
|
ICK_Writeback_Conversion, ///< Objective-C ARC writeback conversion
|
2013-02-07 20:05:33 +04:00
|
|
|
ICK_Zero_Event_Conversion, ///< Zero constant to event (OpenCL1.2 6.12.10)
|
Initial implementation of function overloading in C.
This commit adds a new attribute, "overloadable", that enables C++
function overloading in C. The attribute can only be added to function
declarations, e.g.,
int *f(int) __attribute__((overloadable));
If the "overloadable" attribute exists on a function with a given
name, *all* functions with that name (and in that scope) must have the
"overloadable" attribute. Sets of overloaded functions with the
"overloadable" attribute then follow the normal C++ rules for
overloaded functions, e.g., overloads must have different
parameter-type-lists from each other.
When calling an overloaded function in C, we follow the same
overloading rules as C++, with three extensions to the set of standard
conversions:
- A value of a given struct or union type T can be converted to the
type T. This is just the identity conversion. (In C++, this would
go through a copy constructor).
- A value of pointer type T* can be converted to a value of type U*
if T and U are compatible types. This conversion has Conversion
rank (it's considered a pointer conversion in C).
- A value of type T can be converted to a value of type U if T and U
are compatible (and are not both pointer types). This conversion
has Conversion rank (it's considered to be a new kind of
conversion unique to C, a "compatible" conversion).
Known defects (and, therefore, next steps):
1) The standard-conversion handling does not understand conversions
involving _Complex or vector extensions, so it is likely to get
these wrong. We need to add these conversions.
2) All overloadable functions with the same name will have the same
linkage name, which means we'll get a collision in the linker (if
not sooner). We'll need to mangle the names of these functions.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@64336 91177308-0d34-0410-b5e6-96231b3b80d8
2009-02-12 02:02:49 +03:00
|
|
|
ICK_Num_Conversion_Kinds ///< The number of conversion kinds
|
2008-10-21 20:13:35 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
/// ImplicitConversionCategory - The category of an implicit
|
|
|
|
/// conversion kind. The enumerator values match with Table 9 of
|
|
|
|
/// (C++ 13.3.3.1.1) and are listed such that better conversion
|
|
|
|
/// categories have smaller values.
|
|
|
|
enum ImplicitConversionCategory {
|
|
|
|
ICC_Identity = 0, ///< Identity
|
|
|
|
ICC_Lvalue_Transformation, ///< Lvalue transformation
|
|
|
|
ICC_Qualification_Adjustment, ///< Qualification adjustment
|
|
|
|
ICC_Promotion, ///< Promotion
|
|
|
|
ICC_Conversion ///< Conversion
|
|
|
|
};
|
|
|
|
|
2009-09-09 19:08:12 +04:00
|
|
|
ImplicitConversionCategory
|
2008-10-21 20:13:35 +04:00
|
|
|
GetConversionCategory(ImplicitConversionKind Kind);
|
|
|
|
|
|
|
|
/// ImplicitConversionRank - The rank of an implicit conversion
|
|
|
|
/// kind. The enumerator values match with Table 9 of (C++
|
|
|
|
/// 13.3.3.1.1) and are listed such that better conversion ranks
|
|
|
|
/// have smaller values.
|
|
|
|
enum ImplicitConversionRank {
|
2011-06-16 03:02:42 +04:00
|
|
|
ICR_Exact_Match = 0, ///< Exact Match
|
|
|
|
ICR_Promotion, ///< Promotion
|
|
|
|
ICR_Conversion, ///< Conversion
|
|
|
|
ICR_Complex_Real_Conversion, ///< Complex <-> Real conversion
|
|
|
|
ICR_Writeback_Conversion ///< ObjC ARC writeback conversion
|
2008-10-21 20:13:35 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
ImplicitConversionRank GetConversionRank(ImplicitConversionKind Kind);
|
|
|
|
|
2012-01-18 09:21:49 +04:00
|
|
|
/// NarrowingKind - The kind of narrowing conversion being performed by a
|
|
|
|
/// standard conversion sequence according to C++11 [dcl.init.list]p7.
|
|
|
|
enum NarrowingKind {
|
|
|
|
/// Not a narrowing conversion.
|
|
|
|
NK_Not_Narrowing,
|
|
|
|
|
|
|
|
/// A narrowing conversion by virtue of the source and destination types.
|
|
|
|
NK_Type_Narrowing,
|
|
|
|
|
|
|
|
/// A narrowing conversion, because a constant expression got narrowed.
|
|
|
|
NK_Constant_Narrowing,
|
|
|
|
|
|
|
|
/// A narrowing conversion, because a non-constant-expression variable might
|
|
|
|
/// have got narrowed.
|
|
|
|
NK_Variable_Narrowing
|
|
|
|
};
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// StandardConversionSequence - represents a standard conversion
|
|
|
|
/// sequence (C++ 13.3.3.1.1). A standard conversion sequence
|
|
|
|
/// contains between zero and three conversions. If a particular
|
|
|
|
/// conversion is not needed, it will be set to the identity conversion
|
|
|
|
/// (ICK_Identity). Note that the three conversions are
|
|
|
|
/// specified as separate members (rather than in an array) so that
|
|
|
|
/// we can keep the size of a standard conversion sequence to a
|
|
|
|
/// single word.
|
2010-08-25 09:32:35 +04:00
|
|
|
class StandardConversionSequence {
|
|
|
|
public:
|
2008-10-21 20:13:35 +04:00
|
|
|
/// First -- The first conversion can be an lvalue-to-rvalue
|
|
|
|
/// conversion, array-to-pointer conversion, or
|
|
|
|
/// function-to-pointer conversion.
|
|
|
|
ImplicitConversionKind First : 8;
|
|
|
|
|
|
|
|
/// Second - The second conversion can be an integral promotion,
|
|
|
|
/// floating point promotion, integral conversion, floating point
|
|
|
|
/// conversion, floating-integral conversion, pointer conversion,
|
|
|
|
/// pointer-to-member conversion, or boolean conversion.
|
|
|
|
ImplicitConversionKind Second : 8;
|
|
|
|
|
|
|
|
/// Third - The third conversion can be a qualification conversion.
|
|
|
|
ImplicitConversionKind Third : 8;
|
|
|
|
|
2011-01-26 18:36:03 +03:00
|
|
|
/// \brief Whether this is the deprecated conversion of a
|
2009-09-09 19:08:12 +04:00
|
|
|
/// string literal to a pointer to non-const character data
|
2008-10-29 05:00:59 +03:00
|
|
|
/// (C++ 4.2p2).
|
2011-01-26 17:52:12 +03:00
|
|
|
unsigned DeprecatedStringLiteralToCharPtr : 1;
|
2008-10-21 20:13:35 +04:00
|
|
|
|
2011-06-16 03:02:42 +04:00
|
|
|
/// \brief Whether the qualification conversion involves a change in the
|
|
|
|
/// Objective-C lifetime (for automatic reference counting).
|
|
|
|
unsigned QualificationIncludesObjCLifetime : 1;
|
|
|
|
|
2008-12-19 20:40:08 +03:00
|
|
|
/// IncompatibleObjC - Whether this is an Objective-C conversion
|
|
|
|
/// that we should warn about (if we actually use it).
|
2011-01-26 17:52:12 +03:00
|
|
|
unsigned IncompatibleObjC : 1;
|
2008-12-19 20:40:08 +03:00
|
|
|
|
2009-09-09 19:08:12 +04:00
|
|
|
/// ReferenceBinding - True when this is a reference binding
|
2008-10-29 17:50:44 +03:00
|
|
|
/// (C++ [over.ics.ref]).
|
2011-01-26 17:52:12 +03:00
|
|
|
unsigned ReferenceBinding : 1;
|
2008-10-29 17:50:44 +03:00
|
|
|
|
2009-09-09 19:08:12 +04:00
|
|
|
/// DirectBinding - True when this is a reference binding that is a
|
2008-10-29 17:50:44 +03:00
|
|
|
/// direct binding (C++ [dcl.init.ref]).
|
2011-01-26 17:52:12 +03:00
|
|
|
unsigned DirectBinding : 1;
|
|
|
|
|
|
|
|
/// \brief Whether this is an lvalue reference binding (otherwise, it's
|
|
|
|
/// an rvalue reference binding).
|
|
|
|
unsigned IsLvalueReference : 1;
|
|
|
|
|
|
|
|
/// \brief Whether we're binding to a function lvalue.
|
|
|
|
unsigned BindsToFunctionLvalue : 1;
|
|
|
|
|
|
|
|
/// \brief Whether we're binding to an rvalue.
|
|
|
|
unsigned BindsToRvalue : 1;
|
|
|
|
|
2011-01-26 22:41:18 +03:00
|
|
|
/// \brief Whether this binds an implicit object argument to a
|
|
|
|
/// non-static member function without a ref-qualifier.
|
|
|
|
unsigned BindsImplicitObjectArgumentWithoutRefQualifier : 1;
|
|
|
|
|
2011-06-16 03:02:42 +04:00
|
|
|
/// \brief Whether this binds a reference to an object with a different
|
|
|
|
/// Objective-C lifetime qualifier.
|
|
|
|
unsigned ObjCLifetimeConversionBinding : 1;
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// FromType - The type that this conversion is converting
|
2008-10-23 04:40:37 +04:00
|
|
|
/// from. This is an opaque pointer that can be translated into a
|
|
|
|
/// QualType.
|
2008-10-21 20:13:35 +04:00
|
|
|
void *FromTypePtr;
|
|
|
|
|
2010-01-27 06:51:04 +03:00
|
|
|
/// ToType - The types that this conversion is converting to in
|
|
|
|
/// each step. This is an opaque pointer that can be translated
|
|
|
|
/// into a QualType.
|
|
|
|
void *ToTypePtrs[3];
|
2008-10-21 20:13:35 +04:00
|
|
|
|
2008-11-03 22:09:14 +03:00
|
|
|
/// CopyConstructor - The copy constructor that is used to perform
|
|
|
|
/// this conversion, when the conversion is actually just the
|
|
|
|
/// initialization of an object via copy constructor. Such
|
|
|
|
/// conversions are either identity conversions or derived-to-base
|
|
|
|
/// conversions.
|
|
|
|
CXXConstructorDecl *CopyConstructor;
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
void setFromType(QualType T) { FromTypePtr = T.getAsOpaquePtr(); }
|
2010-01-27 06:51:04 +03:00
|
|
|
void setToType(unsigned Idx, QualType T) {
|
|
|
|
assert(Idx < 3 && "To type index is out of range");
|
|
|
|
ToTypePtrs[Idx] = T.getAsOpaquePtr();
|
|
|
|
}
|
|
|
|
void setAllToTypes(QualType T) {
|
|
|
|
ToTypePtrs[0] = T.getAsOpaquePtr();
|
|
|
|
ToTypePtrs[1] = ToTypePtrs[0];
|
|
|
|
ToTypePtrs[2] = ToTypePtrs[0];
|
|
|
|
}
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
QualType getFromType() const {
|
|
|
|
return QualType::getFromOpaquePtr(FromTypePtr);
|
|
|
|
}
|
2010-01-27 06:51:04 +03:00
|
|
|
QualType getToType(unsigned Idx) const {
|
|
|
|
assert(Idx < 3 && "To type index is out of range");
|
|
|
|
return QualType::getFromOpaquePtr(ToTypePtrs[Idx]);
|
2010-01-12 03:44:57 +03:00
|
|
|
}
|
|
|
|
|
2009-09-09 19:08:12 +04:00
|
|
|
void setAsIdentityConversion();
|
2010-05-24 02:10:15 +04:00
|
|
|
|
|
|
|
bool isIdentityConversion() const {
|
2011-06-05 10:15:20 +04:00
|
|
|
return Second == ICK_Identity && Third == ICK_Identity;
|
2010-05-24 02:10:15 +04:00
|
|
|
}
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
ImplicitConversionRank getRank() const;
|
2012-01-19 03:55:52 +04:00
|
|
|
NarrowingKind getNarrowingKind(ASTContext &Context, const Expr *Converted,
|
2012-03-24 03:55:39 +04:00
|
|
|
APValue &ConstantValue,
|
|
|
|
QualType &ConstantType) const;
|
2008-10-21 20:13:35 +04:00
|
|
|
bool isPointerConversionToBool() const;
|
2008-10-23 04:40:37 +04:00
|
|
|
bool isPointerConversionToVoidPointer(ASTContext& Context) const;
|
2008-10-21 20:13:35 +04:00
|
|
|
void DebugPrint() const;
|
|
|
|
};
|
|
|
|
|
|
|
|
/// UserDefinedConversionSequence - Represents a user-defined
|
|
|
|
/// conversion sequence (C++ 13.3.3.1.2).
|
|
|
|
struct UserDefinedConversionSequence {
|
2011-11-01 19:53:09 +04:00
|
|
|
/// \brief Represents the standard conversion that occurs before
|
|
|
|
/// the actual user-defined conversion.
|
2008-10-21 20:13:35 +04:00
|
|
|
///
|
2011-11-01 19:53:09 +04:00
|
|
|
/// C++11 13.3.3.1.2p1:
|
2008-10-21 20:13:35 +04:00
|
|
|
/// If the user-defined conversion is specified by a constructor
|
|
|
|
/// (12.3.1), the initial standard conversion sequence converts
|
|
|
|
/// the source type to the type required by the argument of the
|
|
|
|
/// constructor. If the user-defined conversion is specified by
|
|
|
|
/// a conversion function (12.3.2), the initial standard
|
|
|
|
/// conversion sequence converts the source type to the implicit
|
|
|
|
/// object parameter of the conversion function.
|
|
|
|
StandardConversionSequence Before;
|
|
|
|
|
2009-11-06 03:23:08 +03:00
|
|
|
/// EllipsisConversion - When this is true, it means user-defined
|
|
|
|
/// conversion sequence starts with a ... (elipsis) conversion, instead of
|
|
|
|
/// a standard conversion. In this case, 'Before' field must be ignored.
|
|
|
|
// FIXME. I much rather put this as the first field. But there seems to be
|
|
|
|
// a gcc code gen. bug which causes a crash in a test. Putting it here seems
|
|
|
|
// to work around the crash.
|
|
|
|
bool EllipsisConversion : 1;
|
2011-10-05 11:56:41 +04:00
|
|
|
|
|
|
|
/// HadMultipleCandidates - When this is true, it means that the
|
|
|
|
/// conversion function was resolved from an overloaded set having
|
|
|
|
/// size greater than 1.
|
|
|
|
bool HadMultipleCandidates : 1;
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// After - Represents the standard conversion that occurs after
|
|
|
|
/// the actual user-defined conversion.
|
|
|
|
StandardConversionSequence After;
|
2009-09-09 19:08:12 +04:00
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// ConversionFunction - The function that will perform the
|
2011-11-01 19:53:09 +04:00
|
|
|
/// user-defined conversion. Null if the conversion is an
|
|
|
|
/// aggregate initialization from an initializer list.
|
2008-10-21 20:13:35 +04:00
|
|
|
FunctionDecl* ConversionFunction;
|
|
|
|
|
2011-01-20 04:32:05 +03:00
|
|
|
/// \brief The declaration that we found via name lookup, which might be
|
|
|
|
/// the same as \c ConversionFunction or it might be a using declaration
|
|
|
|
/// that refers to \c ConversionFunction.
|
2011-09-21 12:36:56 +04:00
|
|
|
DeclAccessPair FoundConversionFunction;
|
2011-11-01 19:53:09 +04:00
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
void DebugPrint() const;
|
|
|
|
};
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
/// Represents an ambiguous user-defined conversion sequence.
|
|
|
|
struct AmbiguousConversionSequence {
|
2011-07-20 10:58:45 +04:00
|
|
|
typedef SmallVector<FunctionDecl*, 4> ConversionSet;
|
2010-01-12 03:44:57 +03:00
|
|
|
|
|
|
|
void *FromTypePtr;
|
|
|
|
void *ToTypePtr;
|
|
|
|
char Buffer[sizeof(ConversionSet)];
|
|
|
|
|
|
|
|
QualType getFromType() const {
|
|
|
|
return QualType::getFromOpaquePtr(FromTypePtr);
|
|
|
|
}
|
|
|
|
QualType getToType() const {
|
|
|
|
return QualType::getFromOpaquePtr(ToTypePtr);
|
|
|
|
}
|
|
|
|
void setFromType(QualType T) { FromTypePtr = T.getAsOpaquePtr(); }
|
|
|
|
void setToType(QualType T) { ToTypePtr = T.getAsOpaquePtr(); }
|
|
|
|
|
|
|
|
ConversionSet &conversions() {
|
|
|
|
return *reinterpret_cast<ConversionSet*>(Buffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
const ConversionSet &conversions() const {
|
|
|
|
return *reinterpret_cast<const ConversionSet*>(Buffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
void addConversion(FunctionDecl *D) {
|
|
|
|
conversions().push_back(D);
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef ConversionSet::iterator iterator;
|
|
|
|
iterator begin() { return conversions().begin(); }
|
|
|
|
iterator end() { return conversions().end(); }
|
|
|
|
|
|
|
|
typedef ConversionSet::const_iterator const_iterator;
|
|
|
|
const_iterator begin() const { return conversions().begin(); }
|
|
|
|
const_iterator end() const { return conversions().end(); }
|
|
|
|
|
|
|
|
void construct();
|
|
|
|
void destruct();
|
|
|
|
void copyFrom(const AmbiguousConversionSequence &);
|
|
|
|
};
|
|
|
|
|
2010-01-13 12:16:55 +03:00
|
|
|
/// BadConversionSequence - Records information about an invalid
|
|
|
|
/// conversion sequence.
|
|
|
|
struct BadConversionSequence {
|
|
|
|
enum FailureKind {
|
|
|
|
no_conversion,
|
|
|
|
unrelated_class,
|
|
|
|
suppressed_user,
|
2011-01-26 22:30:28 +03:00
|
|
|
bad_qualifiers,
|
|
|
|
lvalue_ref_to_rvalue,
|
|
|
|
rvalue_ref_to_lvalue
|
2010-01-13 12:16:55 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
// This can be null, e.g. for implicit object arguments.
|
|
|
|
Expr *FromExpr;
|
|
|
|
|
|
|
|
FailureKind Kind;
|
|
|
|
|
|
|
|
private:
|
|
|
|
// The type we're converting from (an opaque QualType).
|
|
|
|
void *FromTy;
|
|
|
|
|
|
|
|
// The type we're converting to (an opaque QualType).
|
|
|
|
void *ToTy;
|
|
|
|
|
|
|
|
public:
|
|
|
|
void init(FailureKind K, Expr *From, QualType To) {
|
|
|
|
init(K, From->getType(), To);
|
|
|
|
FromExpr = From;
|
|
|
|
}
|
|
|
|
void init(FailureKind K, QualType From, QualType To) {
|
|
|
|
Kind = K;
|
|
|
|
FromExpr = 0;
|
|
|
|
setFromType(From);
|
|
|
|
setToType(To);
|
|
|
|
}
|
|
|
|
|
|
|
|
QualType getFromType() const { return QualType::getFromOpaquePtr(FromTy); }
|
|
|
|
QualType getToType() const { return QualType::getFromOpaquePtr(ToTy); }
|
|
|
|
|
|
|
|
void setFromExpr(Expr *E) {
|
|
|
|
FromExpr = E;
|
|
|
|
setFromType(E->getType());
|
|
|
|
}
|
|
|
|
void setFromType(QualType T) { FromTy = T.getAsOpaquePtr(); }
|
|
|
|
void setToType(QualType T) { ToTy = T.getAsOpaquePtr(); }
|
|
|
|
};
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// ImplicitConversionSequence - Represents an implicit conversion
|
2009-09-09 19:08:12 +04:00
|
|
|
/// sequence, which may be a standard conversion sequence
|
2009-04-16 21:51:27 +04:00
|
|
|
/// (C++ 13.3.3.1.1), user-defined conversion sequence (C++ 13.3.3.1.2),
|
2008-10-21 20:13:35 +04:00
|
|
|
/// or an ellipsis conversion sequence (C++ 13.3.3.1.3).
|
2010-08-25 09:32:35 +04:00
|
|
|
class ImplicitConversionSequence {
|
|
|
|
public:
|
2008-10-21 20:13:35 +04:00
|
|
|
/// Kind - The kind of implicit conversion sequence. BadConversion
|
|
|
|
/// specifies that there is no conversion from the source type to
|
2010-01-12 03:44:57 +03:00
|
|
|
/// the target type. AmbiguousConversion represents the unique
|
|
|
|
/// ambiguous conversion (C++0x [over.best.ics]p10).
|
2008-10-21 20:13:35 +04:00
|
|
|
enum Kind {
|
|
|
|
StandardConversion = 0,
|
|
|
|
UserDefinedConversion,
|
2010-01-12 03:44:57 +03:00
|
|
|
AmbiguousConversion,
|
2008-10-21 20:13:35 +04:00
|
|
|
EllipsisConversion,
|
|
|
|
BadConversion
|
|
|
|
};
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
private:
|
2010-02-25 04:37:24 +03:00
|
|
|
enum {
|
|
|
|
Uninitialized = BadConversion + 1
|
|
|
|
};
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// ConversionKind - The kind of implicit conversion sequence.
|
2012-02-28 02:38:26 +04:00
|
|
|
unsigned ConversionKind : 30;
|
2011-11-01 19:53:09 +04:00
|
|
|
|
|
|
|
/// \brief Whether the argument is an initializer list.
|
|
|
|
bool ListInitializationSequence : 1;
|
2008-10-21 20:13:35 +04:00
|
|
|
|
2012-02-28 02:38:26 +04:00
|
|
|
/// \brief Whether the target is really a std::initializer_list, and the
|
|
|
|
/// sequence only represents the worst element conversion.
|
|
|
|
bool StdInitializerListElement : 1;
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
void setKind(Kind K) {
|
2010-02-25 04:37:24 +03:00
|
|
|
destruct();
|
2010-01-12 03:44:57 +03:00
|
|
|
ConversionKind = K;
|
|
|
|
}
|
|
|
|
|
2010-02-25 04:37:24 +03:00
|
|
|
void destruct() {
|
|
|
|
if (ConversionKind == AmbiguousConversion) Ambiguous.destruct();
|
|
|
|
}
|
|
|
|
|
2010-01-12 03:44:57 +03:00
|
|
|
public:
|
2008-10-21 20:13:35 +04:00
|
|
|
union {
|
|
|
|
/// When ConversionKind == StandardConversion, provides the
|
|
|
|
/// details of the standard conversion sequence.
|
|
|
|
StandardConversionSequence Standard;
|
|
|
|
|
|
|
|
/// When ConversionKind == UserDefinedConversion, provides the
|
|
|
|
/// details of the user-defined conversion sequence.
|
|
|
|
UserDefinedConversionSequence UserDefined;
|
2010-01-12 03:44:57 +03:00
|
|
|
|
|
|
|
/// When ConversionKind == AmbiguousConversion, provides the
|
|
|
|
/// details of the ambiguous conversion.
|
|
|
|
AmbiguousConversionSequence Ambiguous;
|
2010-01-13 12:16:55 +03:00
|
|
|
|
|
|
|
/// When ConversionKind == BadConversion, provides the details
|
|
|
|
/// of the bad conversion.
|
|
|
|
BadConversionSequence Bad;
|
2008-10-21 20:13:35 +04:00
|
|
|
};
|
2010-01-12 03:44:57 +03:00
|
|
|
|
2011-11-19 13:56:57 +04:00
|
|
|
ImplicitConversionSequence()
|
2012-02-28 02:38:26 +04:00
|
|
|
: ConversionKind(Uninitialized), ListInitializationSequence(false),
|
|
|
|
StdInitializerListElement(false)
|
|
|
|
{}
|
2010-01-12 03:44:57 +03:00
|
|
|
~ImplicitConversionSequence() {
|
2010-02-25 04:37:24 +03:00
|
|
|
destruct();
|
2010-01-12 03:44:57 +03:00
|
|
|
}
|
|
|
|
ImplicitConversionSequence(const ImplicitConversionSequence &Other)
|
2011-11-19 13:56:57 +04:00
|
|
|
: ConversionKind(Other.ConversionKind),
|
2012-02-28 02:38:26 +04:00
|
|
|
ListInitializationSequence(Other.ListInitializationSequence),
|
|
|
|
StdInitializerListElement(Other.StdInitializerListElement)
|
2010-01-12 03:44:57 +03:00
|
|
|
{
|
|
|
|
switch (ConversionKind) {
|
2010-02-25 04:37:24 +03:00
|
|
|
case Uninitialized: break;
|
2010-01-12 03:44:57 +03:00
|
|
|
case StandardConversion: Standard = Other.Standard; break;
|
|
|
|
case UserDefinedConversion: UserDefined = Other.UserDefined; break;
|
|
|
|
case AmbiguousConversion: Ambiguous.copyFrom(Other.Ambiguous); break;
|
|
|
|
case EllipsisConversion: break;
|
2010-01-13 12:16:55 +03:00
|
|
|
case BadConversion: Bad = Other.Bad; break;
|
2010-01-12 03:44:57 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ImplicitConversionSequence &
|
|
|
|
operator=(const ImplicitConversionSequence &Other) {
|
2010-02-25 04:37:24 +03:00
|
|
|
destruct();
|
2010-01-12 03:44:57 +03:00
|
|
|
new (this) ImplicitConversionSequence(Other);
|
|
|
|
return *this;
|
|
|
|
}
|
2009-09-23 04:58:07 +04:00
|
|
|
|
2010-02-25 04:37:24 +03:00
|
|
|
Kind getKind() const {
|
|
|
|
assert(isInitialized() && "querying uninitialized conversion");
|
|
|
|
return Kind(ConversionKind);
|
|
|
|
}
|
2010-04-18 02:01:05 +04:00
|
|
|
|
|
|
|
/// \brief Return a ranking of the implicit conversion sequence
|
|
|
|
/// kind, where smaller ranks represent better conversion
|
|
|
|
/// sequences.
|
|
|
|
///
|
|
|
|
/// In particular, this routine gives user-defined conversion
|
|
|
|
/// sequences and ambiguous conversion sequences the same rank,
|
|
|
|
/// per C++ [over.best.ics]p10.
|
|
|
|
unsigned getKindRank() const {
|
|
|
|
switch (getKind()) {
|
|
|
|
case StandardConversion:
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
case UserDefinedConversion:
|
|
|
|
case AmbiguousConversion:
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
case EllipsisConversion:
|
|
|
|
return 2;
|
|
|
|
|
|
|
|
case BadConversion:
|
|
|
|
return 3;
|
|
|
|
}
|
|
|
|
|
2012-01-17 10:56:22 +04:00
|
|
|
llvm_unreachable("Invalid ImplicitConversionSequence::Kind!");
|
2010-04-18 02:01:05 +04:00
|
|
|
}
|
|
|
|
|
2010-02-25 04:37:24 +03:00
|
|
|
bool isBad() const { return getKind() == BadConversion; }
|
|
|
|
bool isStandard() const { return getKind() == StandardConversion; }
|
|
|
|
bool isEllipsis() const { return getKind() == EllipsisConversion; }
|
|
|
|
bool isAmbiguous() const { return getKind() == AmbiguousConversion; }
|
|
|
|
bool isUserDefined() const { return getKind() == UserDefinedConversion; }
|
2011-09-24 21:48:00 +04:00
|
|
|
bool isFailure() const { return isBad() || isAmbiguous(); }
|
2010-02-25 04:37:24 +03:00
|
|
|
|
|
|
|
/// Determines whether this conversion sequence has been
|
|
|
|
/// initialized. Most operations should never need to query
|
|
|
|
/// uninitialized conversions and should assert as above.
|
|
|
|
bool isInitialized() const { return ConversionKind != Uninitialized; }
|
|
|
|
|
|
|
|
/// Sets this sequence as a bad conversion for an explicit argument.
|
|
|
|
void setBad(BadConversionSequence::FailureKind Failure,
|
|
|
|
Expr *FromExpr, QualType ToType) {
|
|
|
|
setKind(BadConversion);
|
|
|
|
Bad.init(Failure, FromExpr, ToType);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Sets this sequence as a bad conversion for an implicit argument.
|
|
|
|
void setBad(BadConversionSequence::FailureKind Failure,
|
|
|
|
QualType FromType, QualType ToType) {
|
|
|
|
setKind(BadConversion);
|
|
|
|
Bad.init(Failure, FromType, ToType);
|
2010-01-12 03:44:57 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
void setStandard() { setKind(StandardConversion); }
|
|
|
|
void setEllipsis() { setKind(EllipsisConversion); }
|
|
|
|
void setUserDefined() { setKind(UserDefinedConversion); }
|
|
|
|
void setAmbiguous() {
|
2010-02-25 04:37:24 +03:00
|
|
|
if (ConversionKind == AmbiguousConversion) return;
|
2010-01-12 03:44:57 +03:00
|
|
|
ConversionKind = AmbiguousConversion;
|
|
|
|
Ambiguous.construct();
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:53:09 +04:00
|
|
|
/// \brief Whether this sequence was created by the rules of
|
|
|
|
/// list-initialization sequences.
|
|
|
|
bool isListInitializationSequence() const {
|
|
|
|
return ListInitializationSequence;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setListInitializationSequence() {
|
|
|
|
ListInitializationSequence = true;
|
|
|
|
}
|
|
|
|
|
2012-02-28 02:38:26 +04:00
|
|
|
/// \brief Whether the target is really a std::initializer_list, and the
|
|
|
|
/// sequence only represents the worst element conversion.
|
|
|
|
bool isStdInitializerListElement() const {
|
|
|
|
return StdInitializerListElement;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setStdInitializerListElement(bool V = true) {
|
|
|
|
StdInitializerListElement = V;
|
|
|
|
}
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
// The result of a comparison between implicit conversion
|
|
|
|
// sequences. Use Sema::CompareImplicitConversionSequences to
|
|
|
|
// actually perform the comparison.
|
|
|
|
enum CompareKind {
|
2008-10-22 18:17:15 +04:00
|
|
|
Better = -1,
|
|
|
|
Indistinguishable = 0,
|
|
|
|
Worse = 1
|
2008-10-21 20:13:35 +04:00
|
|
|
};
|
|
|
|
|
2010-08-25 00:38:10 +04:00
|
|
|
void DiagnoseAmbiguousConversion(Sema &S,
|
|
|
|
SourceLocation CaretLoc,
|
|
|
|
const PartialDiagnostic &PDiag) const;
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
void DebugPrint() const;
|
|
|
|
};
|
|
|
|
|
2010-01-13 12:16:55 +03:00
|
|
|
enum OverloadFailureKind {
|
|
|
|
ovl_fail_too_many_arguments,
|
|
|
|
ovl_fail_too_few_arguments,
|
|
|
|
ovl_fail_bad_conversion,
|
2010-01-23 08:17:32 +03:00
|
|
|
ovl_fail_bad_deduction,
|
|
|
|
|
|
|
|
/// This conversion candidate was not considered because it
|
|
|
|
/// duplicates the work of a trivial or derived-to-base
|
|
|
|
/// conversion.
|
|
|
|
ovl_fail_trivial_conversion,
|
|
|
|
|
|
|
|
/// This conversion candidate is not viable because its result
|
|
|
|
/// type is not implicitly convertible to the desired type.
|
2010-04-13 03:42:09 +04:00
|
|
|
ovl_fail_bad_final_conversion,
|
|
|
|
|
|
|
|
/// This conversion function template specialization candidate is not
|
|
|
|
/// viable because the final conversion was not an exact match.
|
2011-10-03 03:49:40 +04:00
|
|
|
ovl_fail_final_conversion_not_exact,
|
|
|
|
|
|
|
|
/// (CUDA) This candidate was not viable because the callee
|
|
|
|
/// was not accessible from the caller's target (i.e. host->device,
|
|
|
|
/// global->host, device->host).
|
|
|
|
ovl_fail_bad_target
|
2010-01-13 12:16:55 +03:00
|
|
|
};
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// OverloadCandidate - A single candidate in an overload set (C++ 13.3).
|
|
|
|
struct OverloadCandidate {
|
Implement support for operator overloading using candidate operator
functions for built-in operators, e.g., the builtin
bool operator==(int const*, int const*)
can be used for the expression "x1 == x2" given:
struct X {
operator int const*();
} x1, x2;
The scheme for handling these built-in operators is relatively simple:
for each candidate required by the standard, create a special kind of
candidate function for the built-in. If overload resolution picks the
built-in operator, we perform the appropriate conversions on the
arguments and then let the normal built-in operator take care of it.
There may be some optimization opportunity left: if we can reduce the
number of built-in operator overloads we generate, overload resolution
for these cases will go faster. However, one must be careful when
doing this: GCC generates too few operator overloads in our little
test program, and fails to compile it because none of the overloads it
generates match.
Note that we only support operator overload for non-member binary
operators at the moment. The other operators will follow.
As part of this change, ImplicitCastExpr can now be an lvalue.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@59148 91177308-0d34-0410-b5e6-96231b3b80d8
2008-11-12 20:17:38 +03:00
|
|
|
/// Function - The actual function that this candidate
|
2009-09-09 19:08:12 +04:00
|
|
|
/// represents. When NULL, this is a built-in candidate
|
|
|
|
/// (C++ [over.oper]) or a surrogate for a conversion to a
|
2008-11-20 01:57:39 +03:00
|
|
|
/// function pointer or reference (C++ [over.call.object]).
|
2008-10-21 20:13:35 +04:00
|
|
|
FunctionDecl *Function;
|
2008-11-20 01:57:39 +03:00
|
|
|
|
2010-03-19 10:35:19 +03:00
|
|
|
/// FoundDecl - The original declaration that was looked up /
|
|
|
|
/// invented / otherwise found, together with its access.
|
|
|
|
/// Might be a UsingShadowDecl or a FunctionTemplateDecl.
|
|
|
|
DeclAccessPair FoundDecl;
|
|
|
|
|
Implement support for operator overloading using candidate operator
functions for built-in operators, e.g., the builtin
bool operator==(int const*, int const*)
can be used for the expression "x1 == x2" given:
struct X {
operator int const*();
} x1, x2;
The scheme for handling these built-in operators is relatively simple:
for each candidate required by the standard, create a special kind of
candidate function for the built-in. If overload resolution picks the
built-in operator, we perform the appropriate conversions on the
arguments and then let the normal built-in operator take care of it.
There may be some optimization opportunity left: if we can reduce the
number of built-in operator overloads we generate, overload resolution
for these cases will go faster. However, one must be careful when
doing this: GCC generates too few operator overloads in our little
test program, and fails to compile it because none of the overloads it
generates match.
Note that we only support operator overload for non-member binary
operators at the moment. The other operators will follow.
As part of this change, ImplicitCastExpr can now be an lvalue.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@59148 91177308-0d34-0410-b5e6-96231b3b80d8
2008-11-12 20:17:38 +03:00
|
|
|
// BuiltinTypes - Provides the return and parameter types of a
|
|
|
|
// built-in overload candidate. Only valid when Function is NULL.
|
|
|
|
struct {
|
|
|
|
QualType ResultTy;
|
|
|
|
QualType ParamTypes[3];
|
|
|
|
} BuiltinTypes;
|
2009-09-09 19:08:12 +04:00
|
|
|
|
2008-11-20 01:57:39 +03:00
|
|
|
/// Surrogate - The conversion function for which this candidate
|
|
|
|
/// is a surrogate, but only if IsSurrogate is true.
|
|
|
|
CXXConversionDecl *Surrogate;
|
2008-10-21 20:13:35 +04:00
|
|
|
|
|
|
|
/// Conversions - The conversion sequences used to convert the
|
2012-01-14 20:32:05 +04:00
|
|
|
/// function arguments to the function parameters, the pointer points to a
|
|
|
|
/// fixed size array with NumConversions elements. The memory is owned by
|
|
|
|
/// the OverloadCandidateSet.
|
|
|
|
ImplicitConversionSequence *Conversions;
|
2008-10-21 20:13:35 +04:00
|
|
|
|
2011-07-19 23:49:12 +04:00
|
|
|
/// The FixIt hints which can be used to fix the Bad candidate.
|
2011-07-28 23:46:48 +04:00
|
|
|
ConversionFixItGenerator Fix;
|
2011-07-19 23:49:12 +04:00
|
|
|
|
2012-01-14 20:32:05 +04:00
|
|
|
/// NumConversions - The number of elements in the Conversions array.
|
|
|
|
unsigned NumConversions;
|
|
|
|
|
2008-10-21 20:13:35 +04:00
|
|
|
/// Viable - True to indicate that this overload candidate is viable.
|
|
|
|
bool Viable;
|
2008-11-08 01:36:19 +03:00
|
|
|
|
2008-11-20 01:57:39 +03:00
|
|
|
/// IsSurrogate - True to indicate that this candidate is a
|
|
|
|
/// surrogate for a conversion to a function pointer or reference
|
|
|
|
/// (C++ [over.call.object]).
|
|
|
|
bool IsSurrogate;
|
|
|
|
|
2008-12-22 08:46:06 +03:00
|
|
|
/// IgnoreObjectArgument - True to indicate that the first
|
|
|
|
/// argument's conversion, which for this function represents the
|
|
|
|
/// implicit object argument, should be ignored. This will be true
|
|
|
|
/// when the candidate is a static member function (where the
|
|
|
|
/// implicit object argument is just a placeholder) or a
|
|
|
|
/// non-static member function when the call doesn't have an
|
|
|
|
/// object argument.
|
|
|
|
bool IgnoreObjectArgument;
|
|
|
|
|
2010-01-13 12:16:55 +03:00
|
|
|
/// FailureKind - The reason why this candidate is not viable.
|
|
|
|
/// Actually an OverloadFailureKind.
|
|
|
|
unsigned char FailureKind;
|
|
|
|
|
2011-01-20 02:54:39 +03:00
|
|
|
/// \brief The number of call arguments that were explicitly provided,
|
|
|
|
/// to be used while performing partial ordering of function templates.
|
|
|
|
unsigned ExplicitCallArguments;
|
|
|
|
|
2010-02-01 21:53:26 +03:00
|
|
|
/// A structure used to record information about a failed
|
|
|
|
/// template argument deduction.
|
|
|
|
struct DeductionFailureInfo {
|
2012-05-07 13:03:25 +04:00
|
|
|
/// A Sema::TemplateDeductionResult.
|
|
|
|
unsigned Result : 8;
|
|
|
|
|
|
|
|
/// \brief Indicates whether a diagnostic is stored in Diagnostic.
|
|
|
|
unsigned HasDiagnostic : 1;
|
2010-02-01 21:53:26 +03:00
|
|
|
|
2010-05-08 21:41:32 +04:00
|
|
|
/// \brief Opaque pointer containing additional data about
|
|
|
|
/// this deduction failure.
|
|
|
|
void *Data;
|
2012-05-07 13:03:25 +04:00
|
|
|
|
|
|
|
/// \brief A diagnostic indicating why deduction failed.
|
|
|
|
union {
|
|
|
|
void *Align;
|
|
|
|
char Diagnostic[sizeof(PartialDiagnosticAt)];
|
|
|
|
};
|
|
|
|
|
|
|
|
/// \brief Retrieve the diagnostic which caused this deduction failure,
|
|
|
|
/// if any.
|
|
|
|
PartialDiagnosticAt *getSFINAEDiagnostic();
|
2010-05-08 21:41:32 +04:00
|
|
|
|
|
|
|
/// \brief Retrieve the template parameter this deduction failure
|
|
|
|
/// refers to, if any.
|
|
|
|
TemplateParameter getTemplateParameter();
|
|
|
|
|
2010-05-09 00:07:26 +04:00
|
|
|
/// \brief Retrieve the template argument list associated with this
|
|
|
|
/// deduction failure, if any.
|
|
|
|
TemplateArgumentList *getTemplateArgumentList();
|
|
|
|
|
2010-05-08 21:41:32 +04:00
|
|
|
/// \brief Return the first template argument this deduction failure
|
|
|
|
/// refers to, if any.
|
|
|
|
const TemplateArgument *getFirstArg();
|
|
|
|
|
|
|
|
/// \brief Return the second template argument this deduction failure
|
|
|
|
/// refers to, if any.
|
|
|
|
const TemplateArgument *getSecondArg();
|
2013-01-31 08:03:12 +04:00
|
|
|
|
|
|
|
/// \brief Return the expression this deduction failure refers to,
|
|
|
|
/// if any.
|
|
|
|
Expr *getExpr();
|
2010-05-08 21:41:32 +04:00
|
|
|
|
|
|
|
/// \brief Free any memory associated with this deduction failure.
|
|
|
|
void Destroy();
|
2010-02-01 21:53:26 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
union {
|
|
|
|
DeductionFailureInfo DeductionFailure;
|
|
|
|
|
|
|
|
/// FinalConversion - For a conversion function (where Function is
|
|
|
|
/// a CXXConversionDecl), the standard conversion that occurs
|
|
|
|
/// after the call to the overload candidate to convert the result
|
|
|
|
/// of calling the conversion function to the required type.
|
|
|
|
StandardConversionSequence FinalConversion;
|
|
|
|
};
|
2010-01-12 03:44:57 +03:00
|
|
|
|
|
|
|
/// hasAmbiguousConversion - Returns whether this overload
|
|
|
|
/// candidate requires an ambiguous conversion or not.
|
|
|
|
bool hasAmbiguousConversion() const {
|
2012-01-14 20:32:05 +04:00
|
|
|
for (unsigned i = 0, e = NumConversions; i != e; ++i) {
|
|
|
|
if (!Conversions[i].isInitialized()) return false;
|
|
|
|
if (Conversions[i].isAmbiguous()) return true;
|
2010-01-12 03:44:57 +03:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2011-07-28 23:46:48 +04:00
|
|
|
|
|
|
|
bool TryToFixBadConversion(unsigned Idx, Sema &S) {
|
|
|
|
bool CanFix = Fix.tryToFixConversion(
|
|
|
|
Conversions[Idx].Bad.FromExpr,
|
|
|
|
Conversions[Idx].Bad.getFromType(),
|
|
|
|
Conversions[Idx].Bad.getToType(), S);
|
|
|
|
|
|
|
|
// If at least one conversion fails, the candidate cannot be fixed.
|
|
|
|
if (!CanFix)
|
|
|
|
Fix.clear();
|
|
|
|
|
|
|
|
return CanFix;
|
|
|
|
}
|
2008-10-21 20:13:35 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
/// OverloadCandidateSet - A set of overload candidates, used in C++
|
|
|
|
/// overload resolution (C++ 13.3).
|
2012-01-14 20:31:55 +04:00
|
|
|
class OverloadCandidateSet {
|
|
|
|
SmallVector<OverloadCandidate, 16> Candidates;
|
2009-09-28 08:47:19 +04:00
|
|
|
llvm::SmallPtrSet<Decl *, 16> Functions;
|
2010-02-09 02:07:23 +03:00
|
|
|
|
2012-01-14 20:32:05 +04:00
|
|
|
// Allocator for OverloadCandidate::Conversions. We store the first few
|
|
|
|
// elements inline to avoid allocation for small sets.
|
2012-01-15 00:16:52 +04:00
|
|
|
llvm::BumpPtrAllocator ConversionSequenceAllocator;
|
2012-01-14 21:23:10 +04:00
|
|
|
|
|
|
|
SourceLocation Loc;
|
|
|
|
|
2012-01-14 20:32:05 +04:00
|
|
|
unsigned NumInlineSequences;
|
2012-01-14 21:23:10 +04:00
|
|
|
char InlineSpace[16 * sizeof(ImplicitConversionSequence)];
|
2012-01-14 20:32:05 +04:00
|
|
|
|
2012-09-18 08:52:05 +04:00
|
|
|
OverloadCandidateSet(const OverloadCandidateSet &) LLVM_DELETED_FUNCTION;
|
|
|
|
void operator=(const OverloadCandidateSet &) LLVM_DELETED_FUNCTION;
|
|
|
|
|
2012-10-09 19:52:25 +04:00
|
|
|
void destroyCandidates();
|
|
|
|
|
2009-09-28 08:47:19 +04:00
|
|
|
public:
|
2012-01-14 21:59:15 +04:00
|
|
|
OverloadCandidateSet(SourceLocation Loc) : Loc(Loc), NumInlineSequences(0){}
|
2012-10-09 19:52:25 +04:00
|
|
|
~OverloadCandidateSet() { destroyCandidates(); }
|
2010-02-09 02:07:23 +03:00
|
|
|
|
|
|
|
SourceLocation getLocation() const { return Loc; }
|
|
|
|
|
2009-09-28 08:47:19 +04:00
|
|
|
/// \brief Determine when this overload candidate will be new to the
|
|
|
|
/// overload set.
|
|
|
|
bool isNewCandidate(Decl *F) {
|
|
|
|
return Functions.insert(F->getCanonicalDecl());
|
|
|
|
}
|
2009-12-10 02:02:17 +03:00
|
|
|
|
|
|
|
/// \brief Clear out all of the candidates.
|
2010-05-08 21:41:32 +04:00
|
|
|
void clear();
|
2010-08-25 00:38:10 +04:00
|
|
|
|
2012-01-14 20:31:55 +04:00
|
|
|
typedef SmallVector<OverloadCandidate, 16>::iterator iterator;
|
|
|
|
iterator begin() { return Candidates.begin(); }
|
|
|
|
iterator end() { return Candidates.end(); }
|
|
|
|
|
|
|
|
size_t size() const { return Candidates.size(); }
|
|
|
|
bool empty() const { return Candidates.empty(); }
|
|
|
|
|
|
|
|
/// \brief Add a new candidate with NumConversions conversion sequence slots
|
|
|
|
/// to the overload set.
|
|
|
|
OverloadCandidate &addCandidate(unsigned NumConversions = 0) {
|
|
|
|
Candidates.push_back(OverloadCandidate());
|
2012-01-14 20:32:05 +04:00
|
|
|
OverloadCandidate &C = Candidates.back();
|
|
|
|
|
|
|
|
// Assign space from the inline array if there are enough free slots
|
|
|
|
// available.
|
2012-01-14 21:59:15 +04:00
|
|
|
if (NumConversions + NumInlineSequences <= 16) {
|
2012-01-14 20:32:05 +04:00
|
|
|
ImplicitConversionSequence *I =
|
|
|
|
(ImplicitConversionSequence*)InlineSpace;
|
|
|
|
C.Conversions = &I[NumInlineSequences];
|
|
|
|
NumInlineSequences += NumConversions;
|
|
|
|
} else {
|
|
|
|
// Otherwise get memory from the allocator.
|
2012-01-15 00:16:52 +04:00
|
|
|
C.Conversions = ConversionSequenceAllocator
|
|
|
|
.Allocate<ImplicitConversionSequence>(NumConversions);
|
2012-01-14 20:32:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
// Construct the new objects.
|
|
|
|
for (unsigned i = 0; i != NumConversions; ++i)
|
|
|
|
new (&C.Conversions[i]) ImplicitConversionSequence();
|
|
|
|
|
|
|
|
C.NumConversions = NumConversions;
|
|
|
|
return C;
|
2012-01-14 20:31:55 +04:00
|
|
|
}
|
|
|
|
|
2010-08-25 00:38:10 +04:00
|
|
|
/// Find the best viable function on this overload set, if it exists.
|
|
|
|
OverloadingResult BestViableFunction(Sema &S, SourceLocation Loc,
|
2010-09-12 12:07:23 +04:00
|
|
|
OverloadCandidateSet::iterator& Best,
|
2011-02-25 22:41:05 +03:00
|
|
|
bool UserDefinedConversion = false);
|
2010-08-25 00:38:10 +04:00
|
|
|
|
|
|
|
void NoteCandidates(Sema &S,
|
|
|
|
OverloadCandidateDisplayKind OCD,
|
2013-01-12 23:30:44 +04:00
|
|
|
ArrayRef<Expr *> Args,
|
2012-10-08 05:11:04 +04:00
|
|
|
StringRef Opc = "",
|
2010-08-25 00:38:10 +04:00
|
|
|
SourceLocation Loc = SourceLocation());
|
2009-09-28 08:47:19 +04:00
|
|
|
};
|
2010-08-25 00:38:10 +04:00
|
|
|
|
|
|
|
bool isBetterOverloadCandidate(Sema &S,
|
|
|
|
const OverloadCandidate& Cand1,
|
|
|
|
const OverloadCandidate& Cand2,
|
2010-09-12 12:07:23 +04:00
|
|
|
SourceLocation Loc,
|
|
|
|
bool UserDefinedConversion = false);
|
2008-10-21 20:13:35 +04:00
|
|
|
} // end namespace clang
|
|
|
|
|
|
|
|
#endif // LLVM_CLANG_SEMA_OVERLOAD_H
|