mirror of
https://github.com/zebrajr/postgres.git
synced 2025-12-08 07:38:44 +01:00
db3c4c3a2d
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.
27 lines
832 B
C
27 lines
832 B
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* nodeHashjoin.h
|
|
*
|
|
*
|
|
*
|
|
* Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $Id: nodeHashjoin.h,v 1.16 1999/10/13 15:02:26 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef NODEHASHJOIN_H
|
|
#define NODEHASHJOIN_H
|
|
|
|
#include "nodes/plannodes.h"
|
|
#include "storage/buffile.h"
|
|
|
|
extern TupleTableSlot *ExecHashJoin(HashJoin *node);
|
|
extern bool ExecInitHashJoin(HashJoin *node, EState *estate, Plan *parent);
|
|
extern int ExecCountSlotsHashJoin(HashJoin *node);
|
|
extern void ExecEndHashJoin(HashJoin *node);
|
|
extern void ExecHashJoinSaveTuple(HeapTuple heapTuple, BufFile *file);
|
|
extern void ExecReScanHashJoin(HashJoin *node, ExprContext *exprCtxt, Plan *parent);
|
|
|
|
#endif /* NODEHASHJOIN_H */
|