File Manager

Hackfut Security File Manager

Current Path: /opt/td-agent/embedded/include/postgresql/server/utils

opt / td-agent / embedded / include / postgresql / server / utils /

📁 ..
📄 acl.h(13.83 KB)
📄 aclchk_internal.h(1.42 KB)
📄 array.h(18.84 KB)
📄 arrayaccess.h(2.97 KB)
📄 ascii.h(579 B)
📄 attoptcache.h(725 B)
📄 builtins.h(56.08 KB)
📄 bytea.h(1.63 KB)
📄 cash.h(2.07 KB)
📄 catcache.h(7.4 KB)
📄 combocid.h(870 B)
📄 date.h(7.77 KB)
📄 datetime.h(10.59 KB)
📄 datum.h(1.88 KB)
📄 dynahash.h(498 B)
📄 dynamic_loader.h(648 B)
📄 elog.h(14.74 KB)
📄 errcodes.h(20.1 KB)
📄 evtcache.h(934 B)
📄 expandeddatum.h(6.89 KB)
📄 fmgroids.h(72.24 KB)
📄 fmgrtab.h(1.15 KB)
📄 formatting.h(1.41 KB)
📄 geo_decls.h(16.22 KB)
📄 guc.h(15.6 KB)
📄 guc_tables.h(7.22 KB)
📄 help_config.h(457 B)
📄 hsearch.h(5.97 KB)
📄 index_selfuncs.h(2.16 KB)
📄 inet.h(4.6 KB)
📄 int8.h(4.12 KB)
📄 inval.h(1.71 KB)
📄 json.h(3.26 KB)
📄 jsonapi.h(4.19 KB)
📄 jsonb.h(16.13 KB)
📄 logtape.h(1.5 KB)
📄 lsyscache.h(6.91 KB)
📄 memdebug.h(1.25 KB)
📄 memutils.h(6.16 KB)
📄 nabstime.h(5.79 KB)
📄 numeric.h(1.92 KB)
📄 palloc.h(5.04 KB)
📄 pg_crc.h(3.42 KB)
📄 pg_locale.h(2.63 KB)
📄 pg_lsn.h(1.29 KB)
📄 pg_rusage.h(847 B)
📄 plancache.h(8.36 KB)
📄 portal.h(9.64 KB)
📄 probes.h(6.54 KB)
📄 ps_status.h(668 B)
📄 rangetypes.h(8.31 KB)
📄 rel.h(18.18 KB)
📄 relcache.h(3.79 KB)
📄 relfilenodemap.h(561 B)
📄 relmapper.h(1.8 KB)
📄 reltrigger.h(1.95 KB)
📄 resowner.h(2.52 KB)
📄 resowner_private.h(3.42 KB)
📄 rls.h(1.73 KB)
📄 ruleutils.h(1.2 KB)
📄 sampling.h(1.96 KB)
📄 selfuncs.h(9.39 KB)
📄 snapmgr.h(4.13 KB)
📄 snapshot.h(4.2 KB)
📄 sortsupport.h(10.81 KB)
📄 spccache.h(604 B)
📄 syscache.h(5.91 KB)
📄 timeout.h(2.48 KB)
📄 timestamp.h(10.34 KB)
📄 tqual.h(4.11 KB)
📄 tuplesort.h(4.86 KB)
📄 tuplestore.h(3.23 KB)
📄 typcache.h(5.71 KB)
📄 tzparser.h(1.13 KB)
📄 uuid.h(861 B)
📄 varbit.h(4.31 KB)
📄 xml.h(3.89 KB)

Editing: tuplesort.h

/*-------------------------------------------------------------------------
 *
 * 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-2016, 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 heapRel,
							Relation indexRel,
							bool enforceUnique,
							int workMem, bool randomAccess);
extern Tuplesortstate *tuplesort_begin_index_hash(Relation heapRel,
						   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_putindextuplevalues(Tuplesortstate *state,
							  Relation rel, ItemPointer self,
							  Datum *values, bool *isnull);
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, Datum *abbrev);
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, Datum *abbrev);

extern bool tuplesort_skiptuples(Tuplesortstate *state, int64 ntuples,
					 bool forward);

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(int64 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 */

Hackfut Security File Manager

Editing: tuplesort.h

Upload File

Create Folder