backport: re PR c++/82159 (ICE: in assign_temp, at function.c:961)
Backported from mainline 2017-10-12 Jakub Jelinek <jakub@redhat.com> PR c++/82159 * expr.c (store_field): Don't optimize away bitsize == 0 store from CALL_EXPR with addressable return type. * g++.dg/opt/pr82159-2.C: New test. From-SVN: r254181
This commit is contained in:
parent
02a55dcbaf
commit
9dccb36f6b
|
@ -1,6 +1,12 @@
|
|||
2017-10-27 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
Backported from mainline
|
||||
2017-10-12 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
PR c++/82159
|
||||
* expr.c (store_field): Don't optimize away bitsize == 0 store
|
||||
from CALL_EXPR with addressable return type.
|
||||
|
||||
2017-09-21 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
PR sanitizer/81715
|
||||
|
|
|
@ -6742,8 +6742,11 @@ store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
|
|||
return const0_rtx;
|
||||
|
||||
/* If we have nothing to store, do nothing unless the expression has
|
||||
side-effects. */
|
||||
if (bitsize == 0)
|
||||
side-effects. Don't do that for zero sized addressable lhs of
|
||||
calls. */
|
||||
if (bitsize == 0
|
||||
&& (!TREE_ADDRESSABLE (TREE_TYPE (exp))
|
||||
|| TREE_CODE (exp) != CALL_EXPR))
|
||||
return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
|
||||
|
||||
if (GET_CODE (target) == CONCAT)
|
||||
|
|
|
@ -1,6 +1,11 @@
|
|||
2017-10-27 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
Backported from mainline
|
||||
2017-10-12 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
PR c++/82159
|
||||
* g++.dg/opt/pr82159-2.C: New test.
|
||||
|
||||
2017-10-04 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
PR c++/82373
|
||||
|
|
|
@ -0,0 +1,65 @@
|
|||
// PR c++/82159
|
||||
// { dg-do compile }
|
||||
// { dg-options "" }
|
||||
|
||||
template <typename T> struct D { T e; };
|
||||
struct F : D<int[0]> {
|
||||
F(const F &);
|
||||
};
|
||||
struct G : F {
|
||||
template <class T> G operator-(T);
|
||||
};
|
||||
template <class T> struct I {
|
||||
typedef typename T::template J<I> ak;
|
||||
};
|
||||
template <class T> struct K { typename I<T>::ak an; };
|
||||
struct H {
|
||||
G l;
|
||||
};
|
||||
struct C {
|
||||
~C();
|
||||
};
|
||||
template <class T> struct M : T {
|
||||
template <typename U, typename V> M(U, V);
|
||||
H h;
|
||||
virtual void foo() { T::bar(&h); }
|
||||
};
|
||||
template <int, typename> class A;
|
||||
template <class> struct B {
|
||||
typedef int BT;
|
||||
struct BC {};
|
||||
template <class T> struct BD {
|
||||
G g;
|
||||
BD(BT, T n) : g(n.l - 0) {}
|
||||
};
|
||||
B(BT, BC);
|
||||
};
|
||||
template <typename> struct O;
|
||||
template <int T, typename U>
|
||||
struct O<B<A<T, U> > > : public B<A<T, U> >::BC {};
|
||||
struct L : B<A<2, double> > {
|
||||
struct P : C {
|
||||
void bar(H *x) {
|
||||
BT a;
|
||||
BD<H>(a, *x);
|
||||
}
|
||||
};
|
||||
template <typename U, typename V> L(U x, V n) : B(x, n) {}
|
||||
int ll;
|
||||
virtual int baz() { M<P>(this, ll); }
|
||||
};
|
||||
template <typename> class Q {
|
||||
O<B<A<2, double> > > q;
|
||||
virtual L baz() { L(0, q); }
|
||||
};
|
||||
template <template <class> class T> struct R {
|
||||
R() { T<int>(); }
|
||||
};
|
||||
struct S {
|
||||
template <class> class J : R<Q> {};
|
||||
};
|
||||
void foo() { K<S> c; }
|
||||
|
||||
int main() {
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue