From db3c4c3a2d980dcdd9a19feeddd11230587f0d21 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Wed, 13 Oct 1999 15:02:32 +0000 Subject: Split 'BufFile' routines out of fd.c into a new module, buffile.c. Extend BufFile so that it handles multi-segment temporary files transparently. This allows sorts and hashes to work with data exceeding 2Gig (or whatever the local limit on file size is). Change psort.c to use relative seeks instead of absolute seeks for backwards scanning, so that it won't fail when the data volume exceeds 2Gig. --- src/backend/executor/nodeHash.c | 9 ++------- 1 file changed, 2 insertions(+), 7 deletions(-) (limited to 'src/backend/executor/nodeHash.c') diff --git a/src/backend/executor/nodeHash.c b/src/backend/executor/nodeHash.c index 214cc7f0696..c6295acf723 100644 --- a/src/backend/executor/nodeHash.c +++ b/src/backend/executor/nodeHash.c @@ -6,7 +6,7 @@ * Copyright (c) 1994, Regents of the University of California * * - * $Id: nodeHash.c,v 1.38 1999/07/17 20:16:58 momjian Exp $ + * $Id: nodeHash.c,v 1.39 1999/10/13 15:02:25 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -75,12 +75,7 @@ ExecHash(Hash *node) * ---------------- */ for (i = 0; i < nbatch; i++) - { - File tfile = OpenTemporaryFile(); - - Assert(tfile >= 0); - hashtable->innerBatchFile[i] = BufFileCreate(tfile); - } + hashtable->innerBatchFile[i] = BufFileCreateTemp(); } /* ---------------- -- cgit v1.2.3