6 Commits (fe2534e534c0572a71d6f0d2d51a2d058fc3524c)

Author	SHA1	Message	Date
Robert Haas	337b6f5ecf	Speed up in-memory tuplesorting. ... Per recent work by Peter Geoghegan, it's significantly faster to tuplesort on a single sortkey if ApplySortComparator is inlined into quicksort rather reached via a function pointer. It's also faster in general to have a version of quicksort which is specialized for sorting SortTuple objects rather than objects of arbitrary size and type. This requires a couple of additional copies of the quicksort logic, which in this patch are generate using a Perl script. There might be some benefit in adding further specializations here too, but thus far it's not clear that those gains are worth their weight in code footprint.	14 years ago
Magnus Hagander	9f2e211386	Remove cvs keywords from all files.	15 years ago
Neil Conway	b9954fbb4e	Code cleanup for function prototypes: change two K&R-style prototypes ... to ANSI-style, and change "()" -> "(void)". Patch from Stefan Huehner.	19 years ago
Tom Lane	b38900c767	Use Min() instead of min() in qsort, for consistency and to avoid ... redefined-macro warnings on some platforms. Per gripe from Hiroshi Saito.	19 years ago
Bruce Momjian	f99a569a2e	pgindent run for 8.2.	20 years ago
Tom Lane	6edd2b4a91	Switch over to using our own qsort() all the time, as has been proposed ... repeatedly. Now that we don't have to worry about memory leaks from glibc's qsort, we can safely put CHECK_FOR_INTERRUPTS into the tuplesort comparators, as was requested a couple months ago. Also, get rid of non-reentrancy and an extra level of function call in tuplesort.c by providing a variant qsort_arg() API that passes an extra void * argument through to the comparison routine. (We might want to use that in other places too, I didn't look yet.)	20 years ago
Tom Lane	a3f0b3d68f	Improve performance of our private version of qsort. Per recent testing, ... the logic it contained to switch to insertion sort for near-sorted input was in fact a big loss, because it could fairly easily be fooled into applying insertion sort to large subfiles that weren't all that well ordered. Remove that, and instead add a simple check for already-perfectly-sorted input, as per suggestion from Dann Corbit. This adds at worst O(N*lgN) overhead, and usually far less, while sometimes allowing a subfile sort to finish in O(N) time. Preliminary testing says this is an improvement over the basic Bentley & McIlroy code for many nonrandom inputs, and it costs almost nothing when the input is random.	20 years ago
Bruce Momjian	1dc3498251	Standard pgindent run for 8.1.	20 years ago
Tom Lane	06e1d62689	Fix a whole bunch of #includes that were either wrong or redundant. ... The first rule of portability for us is 'thou shalt have no other gods before c.h', and a whole lot of these files were either not including c.h at all, or including random system headers beforehand, either of which sins can mess up largefile support nicely. Once you have included c.h, there is no need to re-include what it includes, either.	21 years ago
Bruce Momjian	b492c3accc	Add parentheses to macros when args are used in computations. Without ... them, the executation behavior could be unexpected.	21 years ago
Neil Conway	af7849f184	License cleanup: crypt.c and qsort.c to latest NetBSD CVS sources, to ... pickup license clarification (3-clause BSD is now used). Add license terms to memcmp.c (also from NetBSD), which previously had none. Finally, pickup an upstream fix to crypt.c (const-ify some arrays).	22 years ago
PostgreSQL Daemon	969685ad44	$Header: -> $PostgreSQL Changes ...	22 years ago
Bruce Momjian	e50f52a074	pgindent run.	24 years ago
Tom Lane	c024fa4cb5	Remove use of __P so that <sys/cdefs.h> is not needed. Per suggestion ... from Martin Renters.	24 years ago
Bruce Momjian	33b3c95200	Complete TODO item: ... * -Add BSD-licensed qsort() for Solaris	24 years ago