| 1 |
/* { dg-skip-if "" { *-*-darwin* } } */ |
| 2 |
/* { dg-options "-mdejagnu-cpu=power7 -mdejagnu-tune=power8 -O3 -w" } */ |
| 3 |
/* { dg-require-effective-target powerpc_vsx } */ |
| 4 |
|
| 5 |
/* target/67211, compiler got a 'insn does not satisfy its constraints' error. */ |
| 6 |
|
| 7 |
template <typename _InputIterator, typename _ForwardIterator> |
| 8 |
void find_first_of(_InputIterator, _InputIterator, _ForwardIterator p3, |
| 9 |
_ForwardIterator p4) { |
| 10 |
for (; p3 != p4; ++p3) |
| 11 |
; |
| 12 |
} |
| 13 |
|
| 14 |
template <typename, typename, typename> struct A { |
| 15 |
int _S_buffer_size; |
| 16 |
int *_M_cur; |
| 17 |
int *_M_first; |
| 18 |
int *_M_last; |
| 19 |
int **_M_node; |
| 20 |
void operator++() { |
| 21 |
if (_M_cur == _M_last) |
| 22 |
m_fn1(_M_node + 1); |
| 23 |
} |
| 24 |
void m_fn1(int **p1) { |
| 25 |
_M_node = p1; |
| 26 |
_M_first = *p1; |
| 27 |
_M_last = _M_first + _S_buffer_size; |
| 28 |
} |
| 29 |
}; |
| 30 |
|
| 31 |
template <typename _Tp, typename _Ref, typename _Ptr> |
| 32 |
bool operator==(A<_Tp, _Ref, _Ptr>, A<_Tp, _Ref, _Ptr>); |
| 33 |
template <typename _Tp, typename _Ref, typename _Ptr> |
| 34 |
bool operator!=(A<_Tp, _Ref, _Ptr> p1, A<_Tp, _Ref, _Ptr> p2) { |
| 35 |
return p1 == p2; |
| 36 |
} |
| 37 |
|
| 38 |
class B { |
| 39 |
public: |
| 40 |
A<int, int, int> m_fn2(); |
| 41 |
}; |
| 42 |
struct { |
| 43 |
B j; |
| 44 |
} a; |
| 45 |
void Linked() { |
| 46 |
A<int, int, int> b, c, d; |
| 47 |
find_first_of(d, c, b, a.j.m_fn2()); |
| 48 |
} |