102 lines
3.5 KiB
C++
102 lines
3.5 KiB
C++
|
// RUN: %clang_cc1 -triple i686-unknown-unknown -fsyntax-only -verify %s
|
||
|
|
||
|
// PR6619
|
||
|
template<bool C> struct if_c { };
|
||
|
template<typename T1> struct if_ {
|
||
|
typedef if_c< static_cast<bool>(T1::value)> almost_type_; // expected-note 5{{in instantiation}}
|
||
|
};
|
||
|
template <class Model, void (Model::*)()> struct wrap_constraints { };
|
||
|
template <class Model>
|
||
|
inline char has_constraints_(Model* , // expected-note 2{{while substituting deduced template arguments into function template 'has_constraints_' [with }} \
|
||
|
// expected-note 3{{candidate template ignored}}
|
||
|
wrap_constraints<Model,&Model::constraints>* = 0); // expected-note 2{{in instantiation}}
|
||
|
|
||
|
template <class Model> struct not_satisfied {
|
||
|
static const bool value = sizeof( has_constraints_((Model*)0) == 1); // expected-error 3{{no matching function}}
|
||
|
};
|
||
|
template <class ModelFn> struct requirement_;
|
||
|
template <void(*)()> struct instantiate {
|
||
|
};
|
||
|
template <class Model> struct requirement_<void(*)(Model)> : if_< not_satisfied<Model> >::type { // expected-note 5{{in instantiation}}
|
||
|
};
|
||
|
template <class Model> struct usage_requirements {
|
||
|
};
|
||
|
template < typename TT > struct InputIterator {
|
||
|
typedef instantiate< & requirement_<void(*)(usage_requirements<InputIterator> x)>::failed> boost_concept_check1; // expected-note {{in instantiation}}
|
||
|
};
|
||
|
template < typename TT > struct ForwardIterator : InputIterator<TT> { // expected-note {{in instantiation}}
|
||
|
typedef instantiate< & requirement_<void(*)(usage_requirements<ForwardIterator> x)>::failed> boost_concept_check2; // expected-note {{in instantiation}}
|
||
|
|
||
|
};
|
||
|
typedef instantiate< &requirement_<void(*)(ForwardIterator<char*> x)>::failed> boost_concept_checkX;// expected-note 3{{in instantiation}}
|
||
|
|
||
|
template<typename T> struct X0 { };
|
||
|
template<typename R, typename A1> struct X0<R(A1 param)> { };
|
||
|
|
||
|
template<typename T, typename A1, typename A2>
|
||
|
void instF0(X0<T(A1)> x0a, X0<T(A2)> x0b) {
|
||
|
X0<T(A1)> x0c;
|
||
|
X0<T(A2)> x0d;
|
||
|
}
|
||
|
|
||
|
template void instF0<int, int, float>(X0<int(int)>, X0<int(float)>);
|
||
|
|
||
|
template<typename R, typename A1, R (*ptr)(A1)> struct FuncPtr { };
|
||
|
template<typename A1, int (*ptr)(A1)> struct FuncPtr<int, A1, ptr> { };
|
||
|
|
||
|
template<typename R, typename A1> R unary_func(A1);
|
||
|
|
||
|
template<typename R, typename A1, typename A2>
|
||
|
void use_func_ptr() {
|
||
|
FuncPtr<R, A1, &unary_func<R, A1> > fp1;
|
||
|
FuncPtr<R, A2, &unary_func<R, A2> > fp2;
|
||
|
};
|
||
|
|
||
|
template void use_func_ptr<int, float, double>();
|
||
|
|
||
|
namespace PR6990 {
|
||
|
template < typename , typename = int, typename = int > struct X1;
|
||
|
template <typename >
|
||
|
struct X2;
|
||
|
|
||
|
template <typename = int *, typename TokenT = int,
|
||
|
typename = int( X2<TokenT> &)>
|
||
|
struct X3
|
||
|
{
|
||
|
};
|
||
|
|
||
|
template <typename , typename P>
|
||
|
struct X3_base : X3< X1<int, P> >
|
||
|
{
|
||
|
protected: typedef X1< P> type;
|
||
|
X3<type> e;
|
||
|
};
|
||
|
|
||
|
struct r : X3_base<int, int>
|
||
|
{
|
||
|
};
|
||
|
}
|
||
|
|
||
|
namespace InstantiateFunctionTypedef {
|
||
|
template<typename T>
|
||
|
struct X {
|
||
|
typedef int functype(int, int);
|
||
|
functype func1;
|
||
|
__attribute__((noreturn)) functype func2;
|
||
|
|
||
|
typedef int stdfunctype(int, int) __attribute__((stdcall));
|
||
|
__attribute__((stdcall)) functype stdfunc1;
|
||
|
stdfunctype stdfunc2;
|
||
|
|
||
|
__attribute__((pcs("aapcs"))) functype pcsfunc; // expected-warning {{calling convention 'pcs' ignored for this target}}
|
||
|
};
|
||
|
|
||
|
void f(X<int> x) {
|
||
|
(void)x.func1(1, 2);
|
||
|
(void)x.func2(1, 2);
|
||
|
(void)x.stdfunc1(1, 2);
|
||
|
(void)x.stdfunc2(1, 2);
|
||
|
(void)x.pcsfunc(1, 2);
|
||
|
}
|
||
|
}
|