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

/*-------------------------------------------------------------------------
 *
 * relfilenode.h
 *	  Physical access information for relations.
 *
 *
 * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * src/include/storage/relfilenode.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef RELFILENODE_H
#define RELFILENODE_H

#include "storage/backendid.h"

/*
 * The physical storage of a relation consists of one or more forks. The
 * main fork is always created, but in addition to that there can be
 * additional forks for storing various metadata. ForkNumber is used when
 * we need to refer to a specific fork in a relation.
 */
typedef enum ForkNumber
{
	InvalidForkNumber = -1,
	MAIN_FORKNUM = 0,
	FSM_FORKNUM,
	VISIBILITYMAP_FORKNUM,
	INIT_FORKNUM

/*
	 * NOTE: if you add a new fork, change MAX_FORKNUM below and update the
	 * forkNames array in catalog.c
	 */
} ForkNumber;

#define MAX_FORKNUM		INIT_FORKNUM

/*
 * RelFileNode must provide all that we need to know to physically access
 * a relation, with the exception of the backend ID, which can be provided
 * separately. Note, however, that a "physical" relation is comprised of
 * multiple files on the filesystem, as each fork is stored as a separate
 * file, and each fork can be divided into multiple segments. See md.c.
 *
 * spcNode identifies the tablespace of the relation.  It corresponds to
 * pg_tablespace.oid.
 *
 * dbNode identifies the database of the relation.  It is zero for
 * "shared" relations (those common to all databases of a cluster).
 * Nonzero dbNode values correspond to pg_database.oid.
 *
 * relNode identifies the specific relation.  relNode corresponds to
 * pg_class.relfilenode (NOT pg_class.oid, because we need to be able
 * to assign new physical files to relations in some situations).
 * Notice that relNode is only unique within a particular database.
 *
 * Note: spcNode must be GLOBALTABLESPACE_OID if and only if dbNode is
 * zero.  We support shared relations only in the "global" tablespace.
 *
 * Note: in pg_class we allow reltablespace == 0 to denote that the
 * relation is stored in its database's "default" tablespace (as
 * identified by pg_database.dattablespace).  However this shorthand
 * is NOT allowed in RelFileNode structs --- the real tablespace ID
 * must be supplied when setting spcNode.
 *
 * Note: in pg_class, relfilenode can be zero to denote that the relation
 * is a "mapped" relation, whose current true filenode number is available
 * from relmapper.c.  Again, this case is NOT allowed in RelFileNodes.
 *
 * Note: various places use RelFileNode in hashtable keys.  Therefore,
 * there *must not* be any unused padding bytes in this struct.  That
 * should be safe as long as all the fields are of type Oid.
 */
typedef struct RelFileNode
{
	Oid			spcNode;		/* tablespace */
	Oid			dbNode;			/* database */
	Oid			relNode;		/* relation */
} RelFileNode;

/*
 * Augmenting a relfilenode with the backend ID provides all the information
 * we need to locate the physical storage.  The backend ID is InvalidBackendId
 * for regular relations (those accessible to more than one backend), or the
 * owning backend's ID for backend-local relations.  Backend-local relations
 * are always transient and removed in case of a database crash; they are
 * never WAL-logged or fsync'd.
 */
typedef struct RelFileNodeBackend
{
	RelFileNode node;
	BackendId	backend;
} RelFileNodeBackend;

#define RelFileNodeBackendIsTemp(rnode) \
	((rnode).backend != InvalidBackendId)

/*
 * Note: RelFileNodeEquals and RelFileNodeBackendEquals compare relNode first
 * since that is most likely to be different in two unequal RelFileNodes.  It
 * is probably redundant to compare spcNode if the other fields are found equal,
 * but do it anyway to be sure.  Likewise for checking the backend ID in
 * RelFileNodeBackendEquals.
 */
#define RelFileNodeEquals(node1, node2) \
	((node1).relNode == (node2).relNode && \
	 (node1).dbNode == (node2).dbNode && \
	 (node1).spcNode == (node2).spcNode)

#define RelFileNodeBackendEquals(node1, node2) \
	((node1).node.relNode == (node2).node.relNode && \
	 (node1).node.dbNode == (node2).node.dbNode && \
	 (node1).backend == (node2).backend && \
	 (node1).node.spcNode == (node2).node.spcNode)

#endif   /* RELFILENODE_H */

${this.title}

Code Editor : relfilenode.h