Re: [PATCHES] putting CHECK_FOR_INTERRUPTS in qsort_comparetup()

Peter Eisentraut <peter_e@gmx.net> writes:
> The merge sort is here:

> http://sourceware.org/cgi-bin/cvsweb.cgi/libc/stdlib/msort.c?rev=1.21&content-type=text/x-cvsweb-markup&cvsroot=glibc

> It uses alloca, so we're good here.

Uh ... but it also uses malloc, and potentially a honkin' big malloc at
that (up to a quarter of physical RAM).  So I'm worried again.

Anyway, Qingqing's question still needs to be answered: how can a sort
of under 30k items take so long?

            regards, tom lane