diff options
Diffstat (limited to 'src/include/utils/psort.h')
| -rw-r--r-- | src/include/utils/psort.h | 104 |
1 files changed, 54 insertions, 50 deletions
diff --git a/src/include/utils/psort.h b/src/include/utils/psort.h index d7f979c8ff7..fe5e0b2f357 100644 --- a/src/include/utils/psort.h +++ b/src/include/utils/psort.h @@ -1,67 +1,71 @@ /*------------------------------------------------------------------------- * * psort.h-- - * + * * * * Copyright (c) 1994, Regents of the University of California * - * $Id: psort.h,v 1.7 1997/08/19 21:40:48 momjian Exp $ + * $Id: psort.h,v 1.8 1997/09/07 05:02:53 momjian Exp $ * *------------------------------------------------------------------------- */ -#ifndef PSORT_H -#define PSORT_H +#ifndef PSORT_H +#define PSORT_H #include <stdio.h> #include "access/relscan.h" #include "utils/lselect.h" #include "nodes/plannodes.h" -#define MAXTAPES 7 /* 7--See Fig. 70, p273 */ -#define TAPEEXTLEN strlen("pg_psort.xxxxx.xxx") /* TEMPDIR/TAPEEXT */ -#define FREE(x) pfree((char *) x) +#define MAXTAPES 7 /* 7--See Fig. 70, p273 */ +#define TAPEEXTLEN strlen("pg_psort.xxxxx.xxx") /* TEMPDIR/TAPEEXT */ +#define FREE(x) pfree((char *) x) -struct tape { - int tp_dummy; /* (D) */ - int tp_fib; /* (A) */ - FILE *tp_file; /* (TAPE) */ - struct tape *tp_prev; +struct tape +{ + int tp_dummy; /* (D) */ + int tp_fib; /* (A) */ + FILE *tp_file; /* (TAPE) */ + struct tape *tp_prev; }; -struct cmplist { - int cp_attn; /* attribute number */ - int cp_num; /* comparison function code */ - int cp_rev; /* invert comparison flag */ - struct cmplist *cp_next; /* next in chain */ +struct cmplist +{ + int cp_attn; /* attribute number */ + int cp_num; /* comparison function code */ + int cp_rev; /* invert comparison flag */ + struct cmplist *cp_next; /* next in chain */ }; /* This structure preserves the state of psort between calls from different * nodes to its interface functions. Basically, it includes all of the global * variables in psort. In case you were wondering, pointers to these structures - * are included in Sort node structures. -Rex 2.6.1995 + * are included in Sort node structures. -Rex 2.6.1995 */ -typedef struct Psortstate { - LeftistContextData treeContext; +typedef struct Psortstate +{ + LeftistContextData treeContext; - int TapeRange; - int Level; - int TotalDummy; - struct tape Tape[MAXTAPES]; + int TapeRange; + int Level; + int TotalDummy; + struct tape Tape[MAXTAPES]; - int BytesRead; - int BytesWritten; - int tupcount; + int BytesRead; + int BytesWritten; + int tupcount; - struct leftist *Tuples; + struct leftist *Tuples; - FILE *psort_grab_file; - long psort_current; /* could be file offset, or array index */ - long psort_saved; /* could be file offset, or array index */ - bool using_tape_files; + FILE *psort_grab_file; + long psort_current; /* could be file offset, or array + * index */ + long psort_saved;/* could be file offset, or array index */ + bool using_tape_files; - HeapTuple *memtuples; -} Psortstate; + HeapTuple *memtuples; +} Psortstate; #ifdef EBUG #include <stdio.h> @@ -69,36 +73,36 @@ typedef struct Psortstate { #include "storage/buf.h" #include "storage/bufmgr.h" -#define PDEBUG(PROC, S1)\ +#define PDEBUG(PROC, S1)\ elog(DEBUG, "%s:%d>> PROC: %s.", __FILE__, __LINE__, S1) -#define PDEBUG2(PROC, S1, D1)\ +#define PDEBUG2(PROC, S1, D1)\ elog(DEBUG, "%s:%d>> PROC: %s %d.", __FILE__, __LINE__, S1, D1) -#define PDEBUG4(PROC, S1, D1, S2, D2)\ +#define PDEBUG4(PROC, S1, D1, S2, D2)\ elog(DEBUG, "%s:%d>> PROC: %s %d, %s %d.", __FILE__, __LINE__, S1, D1, S2, D2) -#define VDEBUG(VAR, FMT)\ +#define VDEBUG(VAR, FMT)\ elog(DEBUG, "%s:%d>> VAR =FMT", __FILE__, __LINE__, VAR) -#define ASSERT(EXPR, STR)\ +#define ASSERT(EXPR, STR)\ if (!(EXPR)) elog(FATAL, "%s:%d>> %s", __FILE__, __LINE__, STR) -#define TRACE(VAL, CODE)\ +#define TRACE(VAL, CODE)\ if (1) CODE; else #else -#define PDEBUG(MSG) -#define VDEBUG(VAR, FMT) -#define ASSERT(EXPR, MSG) -#define TRACE(VAL, CODE) +#define PDEBUG(MSG) +#define VDEBUG(VAR, FMT) +#define ASSERT(EXPR, MSG) +#define TRACE(VAL, CODE) #endif /* psort.c */ -extern bool psort_begin(Sort *node, int nkeys, ScanKey key); -extern HeapTuple psort_grabtuple(Sort *node); -extern void psort_markpos(Sort *node); -extern void psort_restorepos(Sort *node); -extern void psort_end(Sort *node); +extern bool psort_begin(Sort * node, int nkeys, ScanKey key); +extern HeapTuple psort_grabtuple(Sort * node); +extern void psort_markpos(Sort * node); +extern void psort_restorepos(Sort * node); +extern void psort_end(Sort * node); -#endif /* PSORT_H */ +#endif /* PSORT_H */ |