This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: Stack Reorganization Patch
- From: Joern Rennecke <joern dot rennecke at superh dot com>
- To: Geert Bosch <bosch at gnat dot com>
- Cc: law at redhat dot com, "Naveen Sharma, Noida" <naveens at noida dot hcltech dot com>, gcc-patches at gcc dot gnu dot org
- Date: Mon, 24 Feb 2003 15:01:44 +0000
- Subject: Re: Stack Reorganization Patch
- Organization: SuperH UK Ltd.
- References: <888ACD81-4671-11D7-A9B1-00039344BF4A@gnat.com>
Geert Bosch wrote:
>
> On Wednesday, Feb 19, 2003, at 10:54 America/New_York, Joern Rennecke
> wrote:
>
> > It should never return zero when we compare different items. But it
> > should return zero when we compare something with itself.
>
> An efficient quicksort implementation will never do this.
But there is no guarantee that qsort will use the quicksort algorithm.
And there is no telling what algorithms will be useful on parallel
computing or even quantum hardware.
Besides, do we want to rely on an efficient qsort implementation for
the correctness of gcc?
--
--------------------------
SuperH (UK) Ltd.
2410 Aztec West / Almondsbury / BRISTOL / BS32 4QX
T:+44 1454 465658