diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2006-06-27 16:53:02 +0000 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2006-06-27 16:53:02 +0000 |
| commit | cdd5178c69c4cc80baedba0c7829c63b9f78d0f5 (patch) | |
| tree | 4b4c06a83e1845d867647207cb970680c9b93c6f /src/backend/access | |
| parent | e99507eaa1cc366bd55c1f05c99e15c0a17b3990 (diff) | |
| download | postgresql-cdd5178c69c4cc80baedba0c7829c63b9f78d0f5.tar.gz postgresql-cdd5178c69c4cc80baedba0c7829c63b9f78d0f5.zip | |
Extend the MinimalTuple concept to tuplesort.c, thereby reducing the
per-tuple space overhead for sorts in memory. I chose to replace the
previous patch that tried to write out the bare minimum amount of data
when sorting on disk; instead, just dump the MinimalTuples as-is. This
wastes 3 to 10 bytes per tuple depending on architecture and null-bitmap
length, but the simplification in the writetup/readtup routines seems
worth it.
Diffstat (limited to 'src/backend/access')
| -rw-r--r-- | src/backend/access/nbtree/nbtsort.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/backend/access/nbtree/nbtsort.c b/src/backend/access/nbtree/nbtsort.c index 396c81949b6..e7293b47b03 100644 --- a/src/backend/access/nbtree/nbtsort.c +++ b/src/backend/access/nbtree/nbtsort.c @@ -56,7 +56,7 @@ * Portions Copyright (c) 1994, Regents of the University of California * * IDENTIFICATION - * $PostgreSQL: pgsql/src/backend/access/nbtree/nbtsort.c,v 1.101 2006/05/08 00:00:10 tgl Exp $ + * $PostgreSQL: pgsql/src/backend/access/nbtree/nbtsort.c,v 1.102 2006/06/27 16:53:02 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -179,7 +179,7 @@ _bt_spooldestroy(BTSpool *btspool) void _bt_spool(IndexTuple itup, BTSpool *btspool) { - tuplesort_puttuple(btspool->sortstate, (void *) itup); + tuplesort_putindextuple(btspool->sortstate, itup); } /* |