Gecko [ goons4good.org ]

Name	Size	Permission	Date
acl.h	12.79 KB	-rw-r--r--	2021-06-15 13:00
array.h	10.68 KB	-rw-r--r--	2021-06-15 13:00
ascii.h	579 B	-rw-r--r--	2021-06-15 13:00
attoptcache.h	725 B	-rw-r--r--	2021-06-15 13:00
builtins.h	47.77 KB	-rw-r--r--	2021-06-15 13:00
bytea.h	1.58 KB	-rw-r--r--	2021-06-15 13:00
cash.h	2.07 KB	-rw-r--r--	2021-06-15 13:00
catcache.h	7.51 KB	-rw-r--r--	2021-06-15 13:00
combocid.h	698 B	-rw-r--r--	2021-06-15 13:00
date.h	7.73 KB	-rw-r--r--	2021-06-15 13:00
datetime.h	9.92 KB	-rw-r--r--	2021-06-15 13:00
datum.h	1.48 KB	-rw-r--r--	2021-06-15 13:00
dynahash.h	498 B	-rw-r--r--	2021-06-15 13:00
dynamic_loader.h	648 B	-rw-r--r--	2021-06-15 13:00
elog.h	12.56 KB	-rw-r--r--	2021-06-15 13:00
errcodes.h	19.61 KB	-rw-r--r--	2021-06-15 13:00
fmgroids.h	61.09 KB	-rw-r--r--	2021-06-15 13:00
fmgrtab.h	1.15 KB	-rw-r--r--	2021-06-15 13:00
formatting.h	1.41 KB	-rw-r--r--	2021-06-15 13:00
geo_decls.h	15.86 KB	-rw-r--r--	2021-06-15 13:00
guc.h	13.19 KB	-rw-r--r--	2021-06-15 13:00
guc_tables.h	7.15 KB	-rw-r--r--	2021-06-15 13:00
help_config.h	432 B	-rw-r--r--	2021-06-15 13:00
hsearch.h	5.51 KB	-rw-r--r--	2021-06-15 13:00
inet.h	2.66 KB	-rw-r--r--	2021-06-15 13:00
int8.h	4.03 KB	-rw-r--r--	2021-06-15 13:00
inval.h	1.81 KB	-rw-r--r--	2021-06-15 13:00
json.h	916 B	-rw-r--r--	2021-06-15 13:00
logtape.h	1.5 KB	-rw-r--r--	2021-06-15 13:00
lsyscache.h	6.51 KB	-rw-r--r--	2021-06-15 13:00
memutils.h	5.2 KB	-rw-r--r--	2021-06-15 13:00
nabstime.h	5.79 KB	-rw-r--r--	2021-06-15 13:00
numeric.h	1.88 KB	-rw-r--r--	2021-06-15 13:00
palloc.h	3.92 KB	-rw-r--r--	2021-06-15 13:00
pg_crc.h	4.36 KB	-rw-r--r--	2021-06-15 13:00
pg_crc_tables.h	19.73 KB	-rw-r--r--	2021-06-15 13:00
pg_locale.h	2.59 KB	-rw-r--r--	2021-06-15 13:00
pg_lzcompress.h	2.97 KB	-rw-r--r--	2021-06-15 13:00
pg_rusage.h	847 B	-rw-r--r--	2021-06-15 13:00
plancache.h	8.02 KB	-rw-r--r--	2021-06-15 13:00
portal.h	9.22 KB	-rw-r--r--	2021-06-15 13:00
probes.h	37.93 KB	-rw-r--r--	2021-06-15 13:00
ps_status.h	668 B	-rw-r--r--	2021-06-15 13:00
rangetypes.h	7.4 KB	-rw-r--r--	2021-06-15 13:00
rbtree.h	2.26 KB	-rw-r--r--	2021-06-15 13:00
rel.h	12.27 KB	-rw-r--r--	2021-06-15 13:00
relcache.h	3.17 KB	-rw-r--r--	2021-06-15 13:00
relmapper.h	1.68 KB	-rw-r--r--	2021-06-15 13:00
reltrigger.h	1.95 KB	-rw-r--r--	2021-06-15 13:00
resowner.h	5.07 KB	-rw-r--r--	2021-06-15 13:00
selfuncs.h	7.5 KB	-rw-r--r--	2021-06-15 13:00
snapmgr.h	1.59 KB	-rw-r--r--	2021-06-15 13:00
snapshot.h	2.59 KB	-rw-r--r--	2021-06-15 13:00
sortsupport.h	5.3 KB	-rw-r--r--	2021-06-15 13:00
spccache.h	556 B	-rw-r--r--	2021-06-15 13:00
syscache.h	5.51 KB	-rw-r--r--	2021-06-15 13:00
timestamp.h	9.5 KB	-rw-r--r--	2021-06-15 13:00
tqual.h	3.5 KB	-rw-r--r--	2021-06-15 13:00
tuplesort.h	4.62 KB	-rw-r--r--	2021-06-15 13:00
tuplestore.h	3.14 KB	-rw-r--r--	2021-06-15 13:00
typcache.h	4.26 KB	-rw-r--r--	2021-06-15 13:00
tzparser.h	1.13 KB	-rw-r--r--	2021-06-15 13:00
uuid.h	861 B	-rw-r--r--	2021-06-15 13:00
varbit.h	4.27 KB	-rw-r--r--	2021-06-15 13:00
xml.h	3.89 KB	-rw-r--r--	2021-06-15 13:00

Rename

/*-------------------------------------------------------------------------
 *
 * tuplesort.h
 *	  Generalized tuple sorting routines.
 *
 * This module handles sorting of heap tuples, index tuples, or single
 * Datums (and could easily support other kinds of sortable objects,
 * if necessary).  It works efficiently for both small and large amounts
 * of data.  Small amounts are sorted in-memory using qsort().  Large
 * amounts are sorted using temporary files and a standard external sort
 * algorithm.
 *
 * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * src/include/utils/tuplesort.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef TUPLESORT_H
#define TUPLESORT_H

#include "access/itup.h"
#include "executor/tuptable.h"
#include "fmgr.h"
#include "utils/relcache.h"

/* Tuplesortstate is an opaque type whose details are not known outside
 * tuplesort.c.
 */
typedef struct Tuplesortstate Tuplesortstate;

/*
 * We provide multiple interfaces to what is essentially the same code,
 * since different callers have different data to be sorted and want to
 * specify the sort key information differently.  There are two APIs for
 * sorting HeapTuples and two more for sorting IndexTuples.  Yet another
 * API supports sorting bare Datums.
 *
 * The "heap" API actually stores/sorts MinimalTuples, which means it doesn't
 * preserve the system columns (tuple identity and transaction visibility
 * info).  The sort keys are specified by column numbers within the tuples
 * and sort operator OIDs.  We save some cycles by passing and returning the
 * tuples in TupleTableSlots, rather than forming actual HeapTuples (which'd
 * have to be converted to MinimalTuples).  This API works well for sorts
 * executed as parts of plan trees.
 *
 * The "cluster" API stores/sorts full HeapTuples including all visibility
 * info. The sort keys are specified by reference to a btree index that is
 * defined on the relation to be sorted.  Note that putheaptuple/getheaptuple
 * go with this API, not the "begin_heap" one!
 *
 * The "index_btree" API stores/sorts IndexTuples (preserving all their
 * header fields).  The sort keys are specified by a btree index definition.
 *
 * The "index_hash" API is similar to index_btree, but the tuples are
 * actually sorted by their hash codes not the raw data.
 */

extern Tuplesortstate *tuplesort_begin_heap(TupleDesc tupDesc,
					 int nkeys, AttrNumber *attNums,
					 Oid *sortOperators, Oid *sortCollations,
					 bool *nullsFirstFlags,
					 int workMem, bool randomAccess);
extern Tuplesortstate *tuplesort_begin_cluster(TupleDesc tupDesc,
						Relation indexRel,
						int workMem, bool randomAccess);
extern Tuplesortstate *tuplesort_begin_index_btree(Relation indexRel,
							bool enforceUnique,
							int workMem, bool randomAccess);
extern Tuplesortstate *tuplesort_begin_index_hash(Relation indexRel,
						   uint32 hash_mask,
						   int workMem, bool randomAccess);
extern Tuplesortstate *tuplesort_begin_datum(Oid datumType,
					  Oid sortOperator, Oid sortCollation,
					  bool nullsFirstFlag,
					  int workMem, bool randomAccess);

extern void tuplesort_set_bound(Tuplesortstate *state, int64 bound);

extern void tuplesort_puttupleslot(Tuplesortstate *state,
					   TupleTableSlot *slot);
extern void tuplesort_putheaptuple(Tuplesortstate *state, HeapTuple tup);
extern void tuplesort_putindextuple(Tuplesortstate *state, IndexTuple tuple);
extern void tuplesort_putdatum(Tuplesortstate *state, Datum val,
				   bool isNull);

extern void tuplesort_performsort(Tuplesortstate *state);

extern bool tuplesort_gettupleslot(Tuplesortstate *state, bool forward,
					   TupleTableSlot *slot);
extern HeapTuple tuplesort_getheaptuple(Tuplesortstate *state, bool forward,
					   bool *should_free);
extern IndexTuple tuplesort_getindextuple(Tuplesortstate *state, bool forward,
						bool *should_free);
extern bool tuplesort_getdatum(Tuplesortstate *state, bool forward,
				   Datum *val, bool *isNull);

extern void tuplesort_end(Tuplesortstate *state);

extern void tuplesort_get_stats(Tuplesortstate *state,
					const char **sortMethod,
					const char **spaceType,
					long *spaceUsed);

extern int	tuplesort_merge_order(long allowedMem);

/*
 * These routines may only be called if randomAccess was specified 'true'.
 * Likewise, backwards scan in gettuple/getdatum is only allowed if
 * randomAccess was specified.
 */

extern void tuplesort_rescan(Tuplesortstate *state);
extern void tuplesort_markpos(Tuplesortstate *state);
extern void tuplesort_restorepos(Tuplesortstate *state);

#endif   /* TUPLESORT_H */