File Manager

Hackfut Security File Manager

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

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

📁 ..
📄 amapi.h(6.3 KB)
📄 amvalidate.h(1.19 KB)
📄 attnum.h(1.52 KB)
📄 brin.h(948 B)
📄 brin_internal.h(3.3 KB)
📄 brin_page.h(2.68 KB)
📄 brin_pageops.h(1.28 KB)
📄 brin_revmap.h(1.23 KB)
📄 brin_tuple.h(3.05 KB)
📄 brin_xlog.h(3.28 KB)
📄 clog.h(1.54 KB)
📄 commit_ts.h(2.09 KB)
📄 genam.h(7.31 KB)
📄 generic_xlog.h(1.42 KB)
📄 gin.h(2.3 KB)
📄 gin_private.h(33.12 KB)
📄 gist.h(6.51 KB)
📄 gist_private.h(19.82 KB)
📄 gistscan.h(729 B)
📄 hash.h(13.54 KB)
📄 heapam.h(7.76 KB)
📄 heapam_xlog.h(12.61 KB)
📄 hio.h(1.26 KB)
📄 htup.h(3.16 KB)
📄 htup_details.h(28.31 KB)
📄 itup.h(4.36 KB)
📄 multixact.h(5.13 KB)
📄 nbtree.h(30.22 KB)
📄 parallel.h(2.28 KB)
📄 printtup.h(1.03 KB)
📄 reloptions.h(8.88 KB)
📄 relscan.h(5.63 KB)
📄 rewriteheap.h(1.79 KB)
📄 rmgr.h(609 B)
📄 rmgrlist.h(2.97 KB)
📄 sdir.h(1.43 KB)
📄 skey.h(6.26 KB)
📄 slru.h(5.49 KB)
📄 spgist.h(7.04 KB)
📄 spgist_private.h(21.82 KB)
📄 stratnum.h(2.67 KB)
📄 subtrans.h(973 B)
📄 sysattr.h(890 B)
📄 timeline.h(1.59 KB)
📄 transam.h(6.29 KB)
📄 tsmapi.h(2.55 KB)
📄 tupconvert.h(1.4 KB)
📄 tupdesc.h(4.36 KB)
📄 tupmacs.h(7.16 KB)
📄 tuptoaster.h(7.18 KB)
📄 twophase.h(1.82 KB)
📄 twophase_rmgr.h(1.24 KB)
📄 valid.h(1.4 KB)
📄 visibilitymap.h(1.77 KB)
📄 xact.h(12.29 KB)
📄 xlog.h(10.91 KB)
📄 xlog_fn.h(1.41 KB)
📄 xlog_internal.h(10.29 KB)
📄 xlogdefs.h(3.11 KB)
📄 xloginsert.h(2.28 KB)
📄 xlogreader.h(7.11 KB)
📄 xlogrecord.h(7.76 KB)
📄 xlogutils.h(1.76 KB)

Editing: amapi.h

/*-------------------------------------------------------------------------
 *
 * amapi.h
 *	  API for Postgres index access methods.
 *
 * Copyright (c) 2015-2016, PostgreSQL Global Development Group
 *
 * src/include/access/amapi.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef AMAPI_H
#define AMAPI_H

#include "access/genam.h"

/*
 * We don't wish to include planner header files here, since most of an index
 * AM's implementation isn't concerned with those data structures.  To allow
 * declaring amcostestimate_function here, use forward struct references.
 */
struct PlannerInfo;
struct IndexPath;

/* Likewise, this file shouldn't depend on execnodes.h. */
struct IndexInfo;

/*
 * Properties for amproperty API.  This list covers properties known to the
 * core code, but an index AM can define its own properties, by matching the
 * string property name.
 */
typedef enum IndexAMProperty
{
	AMPROP_UNKNOWN = 0,			/* anything not known to core code */
	AMPROP_ASC,					/* column properties */
	AMPROP_DESC,
	AMPROP_NULLS_FIRST,
	AMPROP_NULLS_LAST,
	AMPROP_ORDERABLE,
	AMPROP_DISTANCE_ORDERABLE,
	AMPROP_RETURNABLE,
	AMPROP_SEARCH_ARRAY,
	AMPROP_SEARCH_NULLS,
	AMPROP_CLUSTERABLE,			/* index properties */
	AMPROP_INDEX_SCAN,
	AMPROP_BITMAP_SCAN,
	AMPROP_BACKWARD_SCAN,
	AMPROP_CAN_ORDER,			/* AM properties */
	AMPROP_CAN_UNIQUE,
	AMPROP_CAN_MULTI_COL,
	AMPROP_CAN_EXCLUDE
} IndexAMProperty;

/*
 * Callback function signatures --- see indexam.sgml for more info.
 */

/* build new index */
typedef IndexBuildResult *(*ambuild_function) (Relation heapRelation,
													  Relation indexRelation,
												struct IndexInfo *indexInfo);

/* build empty index */
typedef void (*ambuildempty_function) (Relation indexRelation);

/* insert this tuple */
typedef bool (*aminsert_function) (Relation indexRelation,
											   Datum *values,
											   bool *isnull,
											   ItemPointer heap_tid,
											   Relation heapRelation,
											   IndexUniqueCheck checkUnique);

/* bulk delete */
typedef IndexBulkDeleteResult *(*ambulkdelete_function) (IndexVacuumInfo *info,
												IndexBulkDeleteResult *stats,
											IndexBulkDeleteCallback callback,
													   void *callback_state);

/* post-VACUUM cleanup */
typedef IndexBulkDeleteResult *(*amvacuumcleanup_function) (IndexVacuumInfo *info,
											   IndexBulkDeleteResult *stats);

/* can indexscan return IndexTuples? */
typedef bool (*amcanreturn_function) (Relation indexRelation, int attno);

/* estimate cost of an indexscan */
typedef void (*amcostestimate_function) (struct PlannerInfo *root,
													 struct IndexPath *path,
													 double loop_count,
													 Cost *indexStartupCost,
													 Cost *indexTotalCost,
											   Selectivity *indexSelectivity,
												   double *indexCorrelation);

/* parse index reloptions */
typedef bytea *(*amoptions_function) (Datum reloptions,
												  bool validate);

/* report AM, index, or index column property */
typedef bool (*amproperty_function) (Oid index_oid, int attno,
								  IndexAMProperty prop, const char *propname,
												 bool *res, bool *isnull);

/* validate definition of an opclass for this AM */
typedef bool (*amvalidate_function) (Oid opclassoid);

/* prepare for index scan */
typedef IndexScanDesc (*ambeginscan_function) (Relation indexRelation,
														   int nkeys,
														   int norderbys);

/* (re)start index scan */
typedef void (*amrescan_function) (IndexScanDesc scan,
											   ScanKey keys,
											   int nkeys,
											   ScanKey orderbys,
											   int norderbys);

/* next valid tuple */
typedef bool (*amgettuple_function) (IndexScanDesc scan,
												 ScanDirection direction);

/* fetch all valid tuples */
typedef int64 (*amgetbitmap_function) (IndexScanDesc scan,
												   TIDBitmap *tbm);

/* end index scan */
typedef void (*amendscan_function) (IndexScanDesc scan);

/* mark current scan position */
typedef void (*ammarkpos_function) (IndexScanDesc scan);

/* restore marked scan position */
typedef void (*amrestrpos_function) (IndexScanDesc scan);

/*
 * API struct for an index AM.  Note this must be stored in a single palloc'd
 * chunk of memory.
 */
typedef struct IndexAmRoutine
{
	NodeTag		type;

/*
	 * Total number of strategies (operators) by which we can traverse/search
	 * this AM.  Zero if AM does not have a fixed set of strategy assignments.
	 */
	uint16		amstrategies;
	/* total number of support functions that this AM uses */
	uint16		amsupport;
	/* does AM support ORDER BY indexed column's value? */
	bool		amcanorder;
	/* does AM support ORDER BY result of an operator on indexed column? */
	bool		amcanorderbyop;
	/* does AM support backward scanning? */
	bool		amcanbackward;
	/* does AM support UNIQUE indexes? */
	bool		amcanunique;
	/* does AM support multi-column indexes? */
	bool		amcanmulticol;
	/* does AM require scans to have a constraint on the first index column? */
	bool		amoptionalkey;
	/* does AM handle ScalarArrayOpExpr quals? */
	bool		amsearcharray;
	/* does AM handle IS NULL/IS NOT NULL quals? */
	bool		amsearchnulls;
	/* can index storage data type differ from column data type? */
	bool		amstorage;
	/* can an index of this type be clustered on? */
	bool		amclusterable;
	/* does AM handle predicate locks? */
	bool		ampredlocks;
	/* type of data stored in index, or InvalidOid if variable */
	Oid			amkeytype;

/* interface functions */
	ambuild_function ambuild;
	ambuildempty_function ambuildempty;
	aminsert_function aminsert;
	ambulkdelete_function ambulkdelete;
	amvacuumcleanup_function amvacuumcleanup;
	amcanreturn_function amcanreturn;	/* can be NULL */
	amcostestimate_function amcostestimate;
	amoptions_function amoptions;
	amproperty_function amproperty;		/* can be NULL */
	amvalidate_function amvalidate;
	ambeginscan_function ambeginscan;
	amrescan_function amrescan;
	amgettuple_function amgettuple;		/* can be NULL */
	amgetbitmap_function amgetbitmap;	/* can be NULL */
	amendscan_function amendscan;
	ammarkpos_function ammarkpos;		/* can be NULL */
	amrestrpos_function amrestrpos;		/* can be NULL */
} IndexAmRoutine;

/* Functions in access/index/amapi.c */
extern IndexAmRoutine *GetIndexAmRoutine(Oid amhandler);
extern IndexAmRoutine *GetIndexAmRoutineByAmId(Oid amoid, bool noerror);

extern Datum amvalidate(PG_FUNCTION_ARGS);

#endif   /* AMAPI_H */

Hackfut Security File Manager

Editing: amapi.h

Upload File

Create Folder