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: itup.h

/*-------------------------------------------------------------------------
 *
 * itup.h
 *	  POSTGRES index tuple definitions.
 *
 *
 * Portions Copyright (c) 1996-2016, 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: unused
	 * 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
/* bit 0x2000 is not used at present */
#define INDEX_VAR_MASK	0x4000
#define INDEX_NULL_MASK 0x8000

#define IndexTupleSize(itup)		((Size) (((IndexTuple) (itup))->t_info & INDEX_SIZE_MASK))
#define IndexTupleDSize(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) ? \
	( \
		(tupleDesc)->attrs[(attnum)-1]->attcacheoff >= 0 ? \
		( \
			fetchatt((tupleDesc)->attrs[(attnum)-1], \
			(char *) (tup) + IndexInfoFindDataOffset((tup)->t_info) \
			+ (tupleDesc)->attrs[(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 item pointer.
 */
#define MinIndexTupleSize MAXALIGN(sizeof(IndexTupleData) + 1)
#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);

#endif   /* ITUP_H */

Hackfut Security File Manager

Editing: itup.h

Upload File

Create Folder