This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: [PATCH] Fix PR29512, O(c^N) complexity algorithm in the i386 backend

From: Mark Mitchell <mark at codesourcery dot com>
To: Jan Hubicka <jh at suse dot cz>
Cc: Richard Guenther <rguenther at suse dot de>, gcc-patches at gcc dot gnu dot org
Date: Sat, 21 Oct 2006 17:30:20 -0700
Subject: Re: [PATCH] Fix PR29512, O(c^N) complexity algorithm in the i386 backend
References: <Pine.LNX.4.64.0610201057130.8942@zhemvz.fhfr.qr> <20061020110812.GE610@kam.mff.cuni.cz>

Jan Hubicka wrote:

But the BINFO walking is redundant
completely anyway, as we are only interested in seeing all structure
data members which are also available by walking the TYPE_FIELDs like
the rest of the middle-end does.


This is very important, so I would feel safer if some C++ person can
confirm this. The patch is potentially ABI breaking...

I don't see a problem with this change.

--
Mark Mitchell
CodeSourcery
mark@codesourcery.com
(650) 331-3385 x713

References:
- [PATCH] Fix PR29512, O(c^N) complexity algorithm in the i386 backend
  - From: Richard Guenther
- Re: [PATCH] Fix PR29512, O(c^N) complexity algorithm in the i386 backend
  - From: Jan Hubicka

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]