Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
backendid.h	730 B	-rw-r--r--
barrier.h	6.6 KB	-rw-r--r--
block.h	3.21 KB	-rw-r--r--
buf.h	1.06 KB	-rw-r--r--
buf_internals.h	7.79 KB	-rw-r--r--
buffile.h	1.67 KB	-rw-r--r--
bufmgr.h	7.2 KB	-rw-r--r--
bufpage.h	12.91 KB	-rw-r--r--
copydir.h	561 B	-rw-r--r--
fd.h	3.56 KB	-rw-r--r--
freespace.h	1.23 KB	-rw-r--r--
fsm_internals.h	2.24 KB	-rw-r--r--
indexfsm.h	795 B	-rw-r--r--
ipc.h	2.54 KB	-rw-r--r--
item.h	469 B	-rw-r--r--
itemid.h	4.24 KB	-rw-r--r--
itemptr.h	3.72 KB	-rw-r--r--
large_object.h	2.89 KB	-rw-r--r--
latch.h	5.28 KB	-rw-r--r--
lmgr.h	3.22 KB	-rw-r--r--
lock.h	21.16 KB	-rw-r--r--
lwlock.h	3.58 KB	-rw-r--r--
off.h	1.58 KB	-rw-r--r--
pg_sema.h	2.41 KB	-rw-r--r--
pg_shmem.h	1.95 KB	-rw-r--r--
pmsignal.h	2.03 KB	-rw-r--r--
pos.h	1.56 KB	-rw-r--r--
predicate.h	2.56 KB	-rw-r--r--
predicate_internals.h	16.98 KB	-rw-r--r--
proc.h	9.58 KB	-rw-r--r--
procarray.h	2.96 KB	-rw-r--r--
procsignal.h	1.76 KB	-rw-r--r--
reinit.h	588 B	-rw-r--r--
relfilenode.h	4.31 KB	-rw-r--r--
s_lock.h	28 KB	-rw-r--r--
shmem.h	2.63 KB	-rw-r--r--
sinval.h	4.97 KB	-rw-r--r--
sinvaladt.h	1.49 KB	-rw-r--r--
smgr.h	5.67 KB	-rw-r--r--
spin.h	2.71 KB	-rw-r--r--
standby.h	3.97 KB	-rw-r--r--

Code Editor : fsm_internals.h

/*-------------------------------------------------------------------------
 *
 * fsm_internal.h
 *	  internal functions for free space map
 *
 *
 * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * src/include/storage/fsm_internals.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef FSM_INTERNALS_H
#define FSM_INTERNALS_H

#include "storage/buf.h"
#include "storage/bufpage.h"

/*
 * Structure of a FSM page. See src/backend/storage/freespace/README for
 * details.
 */
typedef struct
{
	/*
	 * fsm_search_avail() tries to spread the load of multiple backends by
	 * returning different pages to different backends in a round-robin
	 * fashion. fp_next_slot points to the next slot to be returned (assuming
	 * there's enough space on it for the request). It's defined as an int,
	 * because it's updated without an exclusive lock. uint16 would be more
	 * appropriate, but int is more likely to be atomically
	 * fetchable/storable.
	 */
	int			fp_next_slot;

/*
	 * fp_nodes contains the binary tree, stored in array. The first
	 * NonLeafNodesPerPage elements are upper nodes, and the following
	 * LeafNodesPerPage elements are leaf nodes. Unused nodes are zero.
	 */
	uint8		fp_nodes[1];
} FSMPageData;

typedef FSMPageData *FSMPage;

/*
 * Number of non-leaf and leaf nodes, and nodes in total, on an FSM page.
 * These definitions are internal to fsmpage.c.
 */
#define NodesPerPage (BLCKSZ - MAXALIGN(SizeOfPageHeaderData) - \
					  offsetof(FSMPageData, fp_nodes))

#define NonLeafNodesPerPage (BLCKSZ / 2 - 1)
#define LeafNodesPerPage (NodesPerPage - NonLeafNodesPerPage)

/*
 * Number of FSM "slots" on a FSM page. This is what should be used
 * outside fsmpage.c.
 */
#define SlotsPerFSMPage LeafNodesPerPage

/* Prototypes for functions in fsmpage.c */
extern int fsm_search_avail(Buffer buf, uint8 min_cat, bool advancenext,
				 bool exclusive_lock_held);
extern uint8 fsm_get_avail(Page page, int slot);
extern uint8 fsm_get_max_avail(Page page);
extern bool fsm_set_avail(Page page, int slot, uint8 value);
extern bool fsm_truncate_avail(Page page, int nslots);
extern bool fsm_rebuild_page(Page page);

#endif   /* FSM_INTERNALS_H */

${this.title}

Code Editor : fsm_internals.h