Hackfut Security File Manager
Current Path:
/opt/alt/postgresql11/usr/include/pgsql/server/storage
opt
/
alt
/
postgresql11
/
usr
/
include
/
pgsql
/
server
/
storage
/
📁
..
📄
backendid.h
(730 B)
📄
barrier.h
(6.6 KB)
📄
block.h
(3.21 KB)
📄
buf.h
(1.06 KB)
📄
buf_internals.h
(7.79 KB)
📄
buffile.h
(1.67 KB)
📄
bufmgr.h
(7.2 KB)
📄
bufpage.h
(12.91 KB)
📄
copydir.h
(561 B)
📄
fd.h
(3.56 KB)
📄
freespace.h
(1.23 KB)
📄
fsm_internals.h
(2.24 KB)
📄
indexfsm.h
(795 B)
📄
ipc.h
(2.54 KB)
📄
item.h
(469 B)
📄
itemid.h
(4.24 KB)
📄
itemptr.h
(3.72 KB)
📄
large_object.h
(2.89 KB)
📄
latch.h
(5.28 KB)
📄
lmgr.h
(3.22 KB)
📄
lock.h
(21.16 KB)
📄
lwlock.h
(3.58 KB)
📄
off.h
(1.58 KB)
📄
pg_sema.h
(2.41 KB)
📄
pg_shmem.h
(1.95 KB)
📄
pmsignal.h
(2.03 KB)
📄
pos.h
(1.56 KB)
📄
predicate.h
(2.56 KB)
📄
predicate_internals.h
(16.98 KB)
📄
proc.h
(9.58 KB)
📄
procarray.h
(2.96 KB)
📄
procsignal.h
(1.76 KB)
📄
reinit.h
(588 B)
📄
relfilenode.h
(4.31 KB)
📄
s_lock.h
(28 KB)
📄
shmem.h
(2.63 KB)
📄
sinval.h
(4.97 KB)
📄
sinvaladt.h
(1.49 KB)
📄
smgr.h
(5.67 KB)
📄
spin.h
(2.71 KB)
📄
standby.h
(3.97 KB)
Editing: 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 */
Upload File
Create Folder