From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-429560-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 14502 invoked by alias); 11 Sep 2013 12:13:40 -0000
Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm
Precedence: bulk
List-Id: <gcc-bugs.gcc.gnu.org>
List-Archive: <http://gcc.gnu.org/ml/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-help@gcc.gnu.org>
Sender: gcc-bugs-owner@gcc.gnu.org
Received: (qmail 14464 invoked by uid 48); 11 Sep 2013 12:13:36 -0000
From: "markus at trippelsdorf dot de" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/58389] [4.9 Regression] g++ ICE in ipa_find_reference
Date: Wed, 11 Sep 2013 12:13:00 -0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: tree-optimization
X-Bugzilla-Version: unknown
X-Bugzilla-Keywords:
X-Bugzilla-Severity: major
X-Bugzilla-Who: markus at trippelsdorf dot de
X-Bugzilla-Status: NEW
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 4.9.0
X-Bugzilla-Flags:
X-Bugzilla-Changed-Fields: cc
Message-ID: <bug-58389-4-QtQjC3FDoh@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-58389-4@http.gcc.gnu.org/bugzilla/>
References: <bug-58389-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 7bit
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
X-SW-Source: 2013-09/txt/msg00800.txt.bz2

http://gcc.gnu.org/bugzilla/show_bug.cgi?id=58389

Markus Trippelsdorf <markus at trippelsdorf dot de> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |markus at trippelsdorf dot de

--- Comment #2 from Markus Trippelsdorf <markus at trippelsdorf dot de> ---
Reduced:

template <typename _RandomAccessIterator, typename _Compare>
void __insertion_sort(_RandomAccessIterator, _Compare);
template <typename _RandomAccessIterator, typename _Compare>
void __final_insertion_sort(_RandomAccessIterator p1, _Compare p2) {
  _RandomAccessIterator a;
  if (p1 - a)
    ;
  else
  std:
  __insertion_sort(0, p2);
}
template <typename _RandomAccessIterator, typename _Size, typename _Compare>
void __introsort_loop(_RandomAccessIterator, _Size, _Compare);
template <typename _RandomAccessIterator, typename _Compare>
void sort(_RandomAccessIterator, _RandomAccessIterator p2, _Compare p3) {
std:
  __introsort_loop(0, 0, p3);
  __final_insertion_sort(p2, p3);
}
class A {
public:
  int m_fn1();
  void __lg();
  class B {
  public:
    int i;
    int operator-(B);
  };
};
class C;
class D {
public:
  C *operator->();
};
class F {
  A m_fn1() const;
  D d_ptr;
};
class C {
  friend F;
  void m_fn1();
  A children;
};
void qt_notclosestLeaf();
inline void C::m_fn1() {
  A::B b, c;
  if (children.m_fn1()) {
    sort(c, b, qt_notclosestLeaf);
  }
}
A F::m_fn1() const { const_cast<F *>(this)->d_ptr->m_fn1(); }