pg_query 2.2.0 → 6.1.0

data/ext/pg_query/include/access/itup.h

@@ -1,161 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * itup.h
- *	  POSTGRES index tuple definitions.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/itup.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef ITUP_H
-#define ITUP_H
-
-#include "access/tupdesc.h"
-#include "access/tupmacs.h"
-#include "storage/bufpage.h"
-#include "storage/itemptr.h"
-
-/*
- * Index tuple header structure
- *
- * All index tuples start with IndexTupleData.  If the HasNulls bit is set,
- * this is followed by an IndexAttributeBitMapData.  The index attribute
- * values follow, beginning at a MAXALIGN boundary.
- *
- * Note that the space allocated for the bitmap does not vary with the number
- * of attributes; that is because we don't have room to store the number of
- * attributes in the header.  Given the MAXALIGN constraint there's no space
- * savings to be had anyway, for usual values of INDEX_MAX_KEYS.
- */
-
-typedef struct IndexTupleData
-{
-	ItemPointerData t_tid;		/* reference TID to heap tuple */
-
-	/* ---------------
-	 * t_info is laid out in the following fashion:
-	 *
-	 * 15th (high) bit: has nulls
-	 * 14th bit: has var-width attributes
-	 * 13th bit: AM-defined meaning
-	 * 12-0 bit: size of tuple
-	 * ---------------
-	 */
-
-	unsigned short t_info;		/* various info about tuple */
-
-} IndexTupleData;				/* MORE DATA FOLLOWS AT END OF STRUCT */
-
-typedef IndexTupleData *IndexTuple;
-
-typedef struct IndexAttributeBitMapData
-{
-	bits8		bits[(INDEX_MAX_KEYS + 8 - 1) / 8];
-}			IndexAttributeBitMapData;
-
-typedef IndexAttributeBitMapData * IndexAttributeBitMap;
-
-/*
- * t_info manipulation macros
- */
-#define INDEX_SIZE_MASK 0x1FFF
-#define INDEX_AM_RESERVED_BIT 0x2000	/* reserved for index-AM specific
-										 * usage */
-#define INDEX_VAR_MASK	0x4000
-#define INDEX_NULL_MASK 0x8000
-
-#define IndexTupleSize(itup)		((Size) ((itup)->t_info & INDEX_SIZE_MASK))
-#define IndexTupleHasNulls(itup)	((((IndexTuple) (itup))->t_info & INDEX_NULL_MASK))
-#define IndexTupleHasVarwidths(itup) ((((IndexTuple) (itup))->t_info & INDEX_VAR_MASK))
-
-
-/*
- * Takes an infomask as argument (primarily because this needs to be usable
- * at index_form_tuple time so enough space is allocated).
- */
-#define IndexInfoFindDataOffset(t_info) \
-( \
-	(!((t_info) & INDEX_NULL_MASK)) ? \
-	( \
-		(Size)MAXALIGN(sizeof(IndexTupleData)) \
-	) \
-	: \
-	( \
-		(Size)MAXALIGN(sizeof(IndexTupleData) + sizeof(IndexAttributeBitMapData)) \
-	) \
-)
-
-/* ----------------
- *		index_getattr
- *
- *		This gets called many times, so we macro the cacheable and NULL
- *		lookups, and call nocache_index_getattr() for the rest.
- *
- * ----------------
- */
-#define index_getattr(tup, attnum, tupleDesc, isnull) \
-( \
-	AssertMacro(PointerIsValid(isnull) && (attnum) > 0), \
-	*(isnull) = false, \
-	!IndexTupleHasNulls(tup) ? \
-	( \
-		TupleDescAttr((tupleDesc), (attnum)-1)->attcacheoff >= 0 ? \
-		( \
-			fetchatt(TupleDescAttr((tupleDesc), (attnum)-1), \
-			(char *) (tup) + IndexInfoFindDataOffset((tup)->t_info) \
-			+ TupleDescAttr((tupleDesc), (attnum)-1)->attcacheoff) \
-		) \
-		: \
-			nocache_index_getattr((tup), (attnum), (tupleDesc)) \
-	) \
-	: \
-	( \
-		(att_isnull((attnum)-1, (char *)(tup) + sizeof(IndexTupleData))) ? \
-		( \
-			*(isnull) = true, \
-			(Datum)NULL \
-		) \
-		: \
-		( \
-			nocache_index_getattr((tup), (attnum), (tupleDesc)) \
-		) \
-	) \
-)
-
-/*
- * MaxIndexTuplesPerPage is an upper bound on the number of tuples that can
- * fit on one index page.  An index tuple must have either data or a null
- * bitmap, so we can safely assume it's at least 1 byte bigger than a bare
- * IndexTupleData struct.  We arrive at the divisor because each tuple
- * must be maxaligned, and it must have an associated line pointer.
- *
- * To be index-type-independent, this does not account for any special space
- * on the page, and is thus conservative.
- *
- * Note: in btree non-leaf pages, the first tuple has no key (it's implicitly
- * minus infinity), thus breaking the "at least 1 byte bigger" assumption.
- * On such a page, N tuples could take one MAXALIGN quantum less space than
- * estimated here, seemingly allowing one more tuple than estimated here.
- * But such a page always has at least MAXALIGN special space, so we're safe.
- */
-#define MaxIndexTuplesPerPage	\
-	((int) ((BLCKSZ - SizeOfPageHeaderData) / \
-			(MAXALIGN(sizeof(IndexTupleData) + 1) + sizeof(ItemIdData))))
-
-
-/* routines in indextuple.c */
-extern IndexTuple index_form_tuple(TupleDesc tupleDescriptor,
-								   Datum *values, bool *isnull);
-extern Datum nocache_index_getattr(IndexTuple tup, int attnum,
-								   TupleDesc tupleDesc);
-extern void index_deform_tuple(IndexTuple tup, TupleDesc tupleDescriptor,
-							   Datum *values, bool *isnull);
-extern IndexTuple CopyIndexTuple(IndexTuple source);
-extern IndexTuple index_truncate_tuple(TupleDesc sourceDescriptor,
-									   IndexTuple source, int leavenatts);
-
-#endif							/* ITUP_H */

data/ext/pg_query/include/access/parallel.h

@@ -1,82 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * parallel.h
- *	  Infrastructure for launching parallel workers
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/parallel.h
- *
- *-------------------------------------------------------------------------
- */
-
-#ifndef PARALLEL_H
-#define PARALLEL_H
-
-#include "access/xlogdefs.h"
-#include "lib/ilist.h"
-#include "postmaster/bgworker.h"
-#include "storage/shm_mq.h"
-#include "storage/shm_toc.h"
-
-typedef void (*parallel_worker_main_type) (dsm_segment *seg, shm_toc *toc);
-
-typedef struct ParallelWorkerInfo
-{
-	BackgroundWorkerHandle *bgwhandle;
-	shm_mq_handle *error_mqh;
-	int32		pid;
-} ParallelWorkerInfo;
-
-typedef struct ParallelContext
-{
-	dlist_node	node;
-	SubTransactionId subid;
-	int			nworkers;		/* Maximum number of workers to launch */
-	int			nworkers_to_launch; /* Actual number of workers to launch */
-	int			nworkers_launched;
-	char	   *library_name;
-	char	   *function_name;
-	ErrorContextCallback *error_context_stack;
-	shm_toc_estimator estimator;
-	dsm_segment *seg;
-	void	   *private_memory;
-	shm_toc    *toc;
-	ParallelWorkerInfo *worker;
-	int			nknown_attached_workers;
-	bool	   *known_attached_workers;
-} ParallelContext;
-
-typedef struct ParallelWorkerContext
-{
-	dsm_segment *seg;
-	shm_toc    *toc;
-} ParallelWorkerContext;
-
-extern volatile bool ParallelMessagePending;
-extern PGDLLIMPORT int ParallelWorkerNumber;
-extern PGDLLIMPORT bool InitializingParallelWorker;
-
-#define		IsParallelWorker()		(ParallelWorkerNumber >= 0)
-
-extern ParallelContext *CreateParallelContext(const char *library_name,
-											  const char *function_name, int nworkers);
-extern void InitializeParallelDSM(ParallelContext *pcxt);
-extern void ReinitializeParallelDSM(ParallelContext *pcxt);
-extern void ReinitializeParallelWorkers(ParallelContext *pcxt, int nworkers_to_launch);
-extern void LaunchParallelWorkers(ParallelContext *pcxt);
-extern void WaitForParallelWorkersToAttach(ParallelContext *pcxt);
-extern void WaitForParallelWorkersToFinish(ParallelContext *pcxt);
-extern void DestroyParallelContext(ParallelContext *pcxt);
-extern bool ParallelContextActive(void);
-
-extern void HandleParallelMessageInterrupt(void);
-extern void HandleParallelMessages(void);
-extern void AtEOXact_Parallel(bool isCommit);
-extern void AtEOSubXact_Parallel(bool isCommit, SubTransactionId mySubId);
-extern void ParallelWorkerReportLastRecEnd(XLogRecPtr last_xlog_end);
-
-extern void ParallelWorkerMain(Datum main_arg);
-
-#endif							/* PARALLEL_H */

data/ext/pg_query/include/access/printtup.h

@@ -1,35 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * printtup.h
- *
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/printtup.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef PRINTTUP_H
-#define PRINTTUP_H
-
-#include "utils/portal.h"
-
-extern DestReceiver *printtup_create_DR(CommandDest dest);
-
-extern void SetRemoteDestReceiverParams(DestReceiver *self, Portal portal);
-
-extern void SendRowDescriptionMessage(StringInfo buf,
-									  TupleDesc typeinfo, List *targetlist, int16 *formats);
-
-extern void debugStartup(DestReceiver *self, int operation,
-						 TupleDesc typeinfo);
-extern bool debugtup(TupleTableSlot *slot, DestReceiver *self);
-
-/* XXX these are really in executor/spi.c */
-extern void spi_dest_startup(DestReceiver *self, int operation,
-							 TupleDesc typeinfo);
-extern bool spi_printtup(TupleTableSlot *slot, DestReceiver *self);
-
-#endif							/* PRINTTUP_H */

data/ext/pg_query/include/access/relation.h

@@ -1,28 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * relation.h
- *	  Generic relation related routines.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/relation.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef ACCESS_RELATION_H
-#define ACCESS_RELATION_H
-
-#include "nodes/primnodes.h"
-#include "storage/lockdefs.h"
-#include "utils/relcache.h"
-
-extern Relation relation_open(Oid relationId, LOCKMODE lockmode);
-extern Relation try_relation_open(Oid relationId, LOCKMODE lockmode);
-extern Relation relation_openrv(const RangeVar *relation, LOCKMODE lockmode);
-extern Relation relation_openrv_extended(const RangeVar *relation,
-										 LOCKMODE lockmode, bool missing_ok);
-extern void relation_close(Relation relation, LOCKMODE lockmode);
-
-#endif							/* ACCESS_RELATION_H */

data/ext/pg_query/include/access/relscan.h

@@ -1,176 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * relscan.h
- *	  POSTGRES relation scan descriptor definitions.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/relscan.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef RELSCAN_H
-#define RELSCAN_H
-
-#include "access/htup_details.h"
-#include "access/itup.h"
-#include "port/atomics.h"
-#include "storage/buf.h"
-#include "storage/spin.h"
-#include "utils/relcache.h"
-
-
-struct ParallelTableScanDescData;
-
-/*
- * Generic descriptor for table scans. This is the base-class for table scans,
- * which needs to be embedded in the scans of individual AMs.
- */
-typedef struct TableScanDescData
-{
-	/* scan parameters */
-	Relation	rs_rd;			/* heap relation descriptor */
-	struct SnapshotData *rs_snapshot;	/* snapshot to see */
-	int			rs_nkeys;		/* number of scan keys */
-	struct ScanKeyData *rs_key; /* array of scan key descriptors */
-
-	/*
-	 * Information about type and behaviour of the scan, a bitmask of members
-	 * of the ScanOptions enum (see tableam.h).
-	 */
-	uint32		rs_flags;
-
-	struct ParallelTableScanDescData *rs_parallel;	/* parallel scan
-													 * information */
-
-} TableScanDescData;
-typedef struct TableScanDescData *TableScanDesc;
-
-/*
- * Shared state for parallel table scan.
- *
- * Each backend participating in a parallel table scan has its own
- * TableScanDesc in backend-private memory, and those objects all contain a
- * pointer to this structure.  The information here must be sufficient to
- * properly initialize each new TableScanDesc as workers join the scan, and it
- * must act as a information what to scan for those workers.
- */
-typedef struct ParallelTableScanDescData
-{
-	Oid			phs_relid;		/* OID of relation to scan */
-	bool		phs_syncscan;	/* report location to syncscan logic? */
-	bool		phs_snapshot_any;	/* SnapshotAny, not phs_snapshot_data? */
-	Size		phs_snapshot_off;	/* data for snapshot */
-} ParallelTableScanDescData;
-typedef struct ParallelTableScanDescData *ParallelTableScanDesc;
-
-/*
- * Shared state for parallel table scans, for block oriented storage.
- */
-typedef struct ParallelBlockTableScanDescData
-{
-	ParallelTableScanDescData base;
-
-	BlockNumber phs_nblocks;	/* # blocks in relation at start of scan */
-	slock_t		phs_mutex;		/* mutual exclusion for setting startblock */
-	BlockNumber phs_startblock; /* starting block number */
-	pg_atomic_uint64 phs_nallocated;	/* number of blocks allocated to
-										 * workers so far. */
-}			ParallelBlockTableScanDescData;
-typedef struct ParallelBlockTableScanDescData *ParallelBlockTableScanDesc;
-
-/*
- * Base class for fetches from a table via an index. This is the base-class
- * for such scans, which needs to be embedded in the respective struct for
- * individual AMs.
- */
-typedef struct IndexFetchTableData
-{
-	Relation	rel;
-} IndexFetchTableData;
-
-/*
- * We use the same IndexScanDescData structure for both amgettuple-based
- * and amgetbitmap-based index scans.  Some fields are only relevant in
- * amgettuple-based scans.
- */
-typedef struct IndexScanDescData
-{
-	/* scan parameters */
-	Relation	heapRelation;	/* heap relation descriptor, or NULL */
-	Relation	indexRelation;	/* index relation descriptor */
-	struct SnapshotData *xs_snapshot;	/* snapshot to see */
-	int			numberOfKeys;	/* number of index qualifier conditions */
-	int			numberOfOrderBys;	/* number of ordering operators */
-	struct ScanKeyData *keyData;	/* array of index qualifier descriptors */
-	struct ScanKeyData *orderByData;	/* array of ordering op descriptors */
-	bool		xs_want_itup;	/* caller requests index tuples */
-	bool		xs_temp_snap;	/* unregister snapshot at scan end? */
-
-	/* signaling to index AM about killing index tuples */
-	bool		kill_prior_tuple;	/* last-returned tuple is dead */
-	bool		ignore_killed_tuples;	/* do not return killed entries */
-	bool		xactStartedInRecovery;	/* prevents killing/seeing killed
-										 * tuples */
-
-	/* index access method's private state */
-	void	   *opaque;			/* access-method-specific info */
-
-	/*
-	 * In an index-only scan, a successful amgettuple call must fill either
-	 * xs_itup (and xs_itupdesc) or xs_hitup (and xs_hitupdesc) to provide the
-	 * data returned by the scan.  It can fill both, in which case the heap
-	 * format will be used.
-	 */
-	IndexTuple	xs_itup;		/* index tuple returned by AM */
-	struct TupleDescData *xs_itupdesc;	/* rowtype descriptor of xs_itup */
-	HeapTuple	xs_hitup;		/* index data returned by AM, as HeapTuple */
-	struct TupleDescData *xs_hitupdesc; /* rowtype descriptor of xs_hitup */
-
-	ItemPointerData xs_heaptid; /* result */
-	bool		xs_heap_continue;	/* T if must keep walking, potential
-									 * further results */
-	IndexFetchTableData *xs_heapfetch;
-
-	bool		xs_recheck;		/* T means scan keys must be rechecked */
-
-	/*
-	 * When fetching with an ordering operator, the values of the ORDER BY
-	 * expressions of the last returned tuple, according to the index.  If
-	 * xs_recheckorderby is true, these need to be rechecked just like the
-	 * scan keys, and the values returned here are a lower-bound on the actual
-	 * values.
-	 */
-	Datum	   *xs_orderbyvals;
-	bool	   *xs_orderbynulls;
-	bool		xs_recheckorderby;
-
-	/* parallel index scan information, in shared memory */
-	struct ParallelIndexScanDescData *parallel_scan;
-}			IndexScanDescData;
-
-/* Generic structure for parallel scans */
-typedef struct ParallelIndexScanDescData
-{
-	Oid			ps_relid;
-	Oid			ps_indexid;
-	Size		ps_offset;		/* Offset in bytes of am specific structure */
-	char		ps_snapshot_data[FLEXIBLE_ARRAY_MEMBER];
-}			ParallelIndexScanDescData;
-
-struct TupleTableSlot;
-
-/* Struct for storage-or-index scans of system tables */
-typedef struct SysScanDescData
-{
-	Relation	heap_rel;		/* catalog being scanned */
-	Relation	irel;			/* NULL if doing heap scan */
-	struct TableScanDescData *scan; /* only valid in storage-scan case */
-	struct IndexScanDescData *iscan;	/* only valid in index-scan case */
-	struct SnapshotData *snapshot;	/* snapshot to unregister at end of scan */
-	struct TupleTableSlot *slot;
-}			SysScanDescData;
-
-#endif							/* RELSCAN_H */

data/ext/pg_query/include/access/rmgr.h

@@ -1,35 +0,0 @@
-/*
- * rmgr.h
- *
- * Resource managers definition
- *
- * src/include/access/rmgr.h
- */
-#ifndef RMGR_H
-#define RMGR_H
-
-typedef uint8 RmgrId;
-
-/*
- * Built-in resource managers
- *
- * The actual numerical values for each rmgr ID are defined by the order
- * of entries in rmgrlist.h.
- *
- * Note: RM_MAX_ID must fit in RmgrId; widening that type will affect the XLOG
- * file format.
- */
-#define PG_RMGR(symname,name,redo,desc,identify,startup,cleanup,mask) \
-	symname,
-
-typedef enum RmgrIds
-{
-#include "access/rmgrlist.h"
-	RM_NEXT_ID
-} RmgrIds;
-
-#undef PG_RMGR
-
-#define RM_MAX_ID				(RM_NEXT_ID - 1)
-
-#endif							/* RMGR_H */

data/ext/pg_query/include/access/rmgrlist.h

@@ -1,49 +0,0 @@
-/*---------------------------------------------------------------------------
- * rmgrlist.h
- *
- * The resource manager list is kept in its own source file for possible
- * use by automatic tools.  The exact representation of a rmgr is determined
- * by the PG_RMGR macro, which is not defined in this file; it can be
- * defined by the caller for special purposes.
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/rmgrlist.h
- *---------------------------------------------------------------------------
- */
-
-/* there is deliberately not an #ifndef RMGRLIST_H here */
-
-/*
- * List of resource manager entries.  Note that order of entries defines the
- * numerical values of each rmgr's ID, which is stored in WAL records.  New
- * entries should be added at the end, to avoid changing IDs of existing
- * entries.
- *
- * Changes to this list possibly need an XLOG_PAGE_MAGIC bump.
- */
-
-/* symbol name, textual name, redo, desc, identify, startup, cleanup */
-PG_RMGR(RM_XLOG_ID, "XLOG", xlog_redo, xlog_desc, xlog_identify, NULL, NULL, NULL)
-PG_RMGR(RM_XACT_ID, "Transaction", xact_redo, xact_desc, xact_identify, NULL, NULL, NULL)
-PG_RMGR(RM_SMGR_ID, "Storage", smgr_redo, smgr_desc, smgr_identify, NULL, NULL, NULL)
-PG_RMGR(RM_CLOG_ID, "CLOG", clog_redo, clog_desc, clog_identify, NULL, NULL, NULL)
-PG_RMGR(RM_DBASE_ID, "Database", dbase_redo, dbase_desc, dbase_identify, NULL, NULL, NULL)
-PG_RMGR(RM_TBLSPC_ID, "Tablespace", tblspc_redo, tblspc_desc, tblspc_identify, NULL, NULL, NULL)
-PG_RMGR(RM_MULTIXACT_ID, "MultiXact", multixact_redo, multixact_desc, multixact_identify, NULL, NULL, NULL)
-PG_RMGR(RM_RELMAP_ID, "RelMap", relmap_redo, relmap_desc, relmap_identify, NULL, NULL, NULL)
-PG_RMGR(RM_STANDBY_ID, "Standby", standby_redo, standby_desc, standby_identify, NULL, NULL, NULL)
-PG_RMGR(RM_HEAP2_ID, "Heap2", heap2_redo, heap2_desc, heap2_identify, NULL, NULL, heap_mask)
-PG_RMGR(RM_HEAP_ID, "Heap", heap_redo, heap_desc, heap_identify, NULL, NULL, heap_mask)
-PG_RMGR(RM_BTREE_ID, "Btree", btree_redo, btree_desc, btree_identify, btree_xlog_startup, btree_xlog_cleanup, btree_mask)
-PG_RMGR(RM_HASH_ID, "Hash", hash_redo, hash_desc, hash_identify, NULL, NULL, hash_mask)
-PG_RMGR(RM_GIN_ID, "Gin", gin_redo, gin_desc, gin_identify, gin_xlog_startup, gin_xlog_cleanup, gin_mask)
-PG_RMGR(RM_GIST_ID, "Gist", gist_redo, gist_desc, gist_identify, gist_xlog_startup, gist_xlog_cleanup, gist_mask)
-PG_RMGR(RM_SEQ_ID, "Sequence", seq_redo, seq_desc, seq_identify, NULL, NULL, seq_mask)
-PG_RMGR(RM_SPGIST_ID, "SPGist", spg_redo, spg_desc, spg_identify, spg_xlog_startup, spg_xlog_cleanup, spg_mask)
-PG_RMGR(RM_BRIN_ID, "BRIN", brin_redo, brin_desc, brin_identify, NULL, NULL, brin_mask)
-PG_RMGR(RM_COMMIT_TS_ID, "CommitTs", commit_ts_redo, commit_ts_desc, commit_ts_identify, NULL, NULL, NULL)
-PG_RMGR(RM_REPLORIGIN_ID, "ReplicationOrigin", replorigin_redo, replorigin_desc, replorigin_identify, NULL, NULL, NULL)
-PG_RMGR(RM_GENERIC_ID, "Generic", generic_redo, generic_desc, generic_identify, NULL, NULL, generic_mask)
-PG_RMGR(RM_LOGICALMSG_ID, "LogicalMessage", logicalmsg_redo, logicalmsg_desc, logicalmsg_identify, NULL, NULL, NULL)

data/ext/pg_query/include/access/sdir.h

@@ -1,58 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * sdir.h
- *	  POSTGRES scan direction definitions.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/sdir.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef SDIR_H
-#define SDIR_H
-
-
-/*
- * ScanDirection was an int8 for no apparent reason. I kept the original
- * values because I'm not sure if I'll break anything otherwise.  -ay 2/95
- */
-typedef enum ScanDirection
-{
-	BackwardScanDirection = -1,
-	NoMovementScanDirection = 0,
-	ForwardScanDirection = 1
-} ScanDirection;
-
-/*
- * ScanDirectionIsValid
- *		True iff scan direction is valid.
- */
-#define ScanDirectionIsValid(direction) \
-	((bool) (BackwardScanDirection <= (direction) && \
-			 (direction) <= ForwardScanDirection))
-
-/*
- * ScanDirectionIsBackward
- *		True iff scan direction is backward.
- */
-#define ScanDirectionIsBackward(direction) \
-	((bool) ((direction) == BackwardScanDirection))
-
-/*
- * ScanDirectionIsNoMovement
- *		True iff scan direction indicates no movement.
- */
-#define ScanDirectionIsNoMovement(direction) \
-	((bool) ((direction) == NoMovementScanDirection))
-
-/*
- * ScanDirectionIsForward
- *		True iff scan direction is forward.
- */
-#define ScanDirectionIsForward(direction) \
-	((bool) ((direction) == ForwardScanDirection))
-
-#endif							/* SDIR_H */