1 /*-------------------------------------------------------------------------
4 * POSTGRES relation descriptor (a/k/a relcache entry) definitions.
7 * Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
10 * $PostgreSQL: pgsql/src/include/utils/rel.h,v 1.85 2005/08/12 01:36:05 tgl Exp $
12 *-------------------------------------------------------------------------
17 #include "access/tupdesc.h"
18 #include "catalog/pg_am.h"
19 #include "catalog/pg_class.h"
20 #include "catalog/pg_index.h"
22 #include "rewrite/prs2lock.h"
23 #include "storage/block.h"
24 #include "storage/relfilenode.h"
28 * LockRelId and LockInfo really belong to lmgr.h, but it's more convenient
29 * to declare them here so we can have a LockInfoData field in a Relation.
32 typedef struct LockRelId
34 Oid relId; /* a relation identifier */
35 Oid dbId; /* a database identifier */
38 typedef struct LockInfoData
43 typedef LockInfoData *LockInfo;
46 * Likewise, this struct really belongs to trigger.h, but for convenience
49 typedef struct Trigger
51 Oid tgoid; /* OID of trigger (pg_trigger row) */
52 /* Remaining fields are copied from pg_trigger, see pg_trigger.h */
67 typedef struct TriggerDesc
70 * Index data to identify which triggers are which. Since each
71 * trigger can appear in more than one class, for each class we
72 * provide a list of integer indexes into the triggers array.
74 #define TRIGGER_NUM_EVENT_CLASSES 3
76 uint16 n_before_statement[TRIGGER_NUM_EVENT_CLASSES];
77 uint16 n_before_row[TRIGGER_NUM_EVENT_CLASSES];
78 uint16 n_after_row[TRIGGER_NUM_EVENT_CLASSES];
79 uint16 n_after_statement[TRIGGER_NUM_EVENT_CLASSES];
80 int *tg_before_statement[TRIGGER_NUM_EVENT_CLASSES];
81 int *tg_before_row[TRIGGER_NUM_EVENT_CLASSES];
82 int *tg_after_row[TRIGGER_NUM_EVENT_CLASSES];
83 int *tg_after_statement[TRIGGER_NUM_EVENT_CLASSES];
85 /* The actual array of triggers is here */
92 * Same for the statistics collector data in Relation and scan data.
94 typedef struct PgStat_Info
98 bool heap_scan_counted;
99 bool index_scan_counted;
104 * Cached lookup information for the index access method functions defined
105 * by the pg_am row associated with an index relation.
107 typedef struct RelationAmInfo
110 FmgrInfo ambeginscan;
118 FmgrInfo ambulkdelete;
119 FmgrInfo amvacuumcleanup;
120 FmgrInfo amcostestimate;
125 * Here are the contents of a relation cache entry.
128 typedef struct RelationData
130 RelFileNode rd_node; /* relation physical identifier */
131 /* use "struct" here to avoid needing to include smgr.h: */
132 struct SMgrRelationData *rd_smgr; /* cached file handle, or NULL */
133 BlockNumber rd_targblock; /* current insertion target block, or
134 * InvalidBlockNumber */
135 int rd_refcnt; /* reference count */
136 bool rd_istemp; /* rel uses the local buffer mgr */
137 bool rd_isnailed; /* rel is nailed in cache */
138 bool rd_isvalid; /* relcache entry is valid */
139 char rd_indexvalid; /* state of rd_indexlist: 0 = not valid,
140 * 1 = valid, 2 = temporarily forced */
141 SubTransactionId rd_createSubid; /* rel was created in current xact */
144 * rd_createSubid is the ID of the highest subtransaction the rel has
145 * survived into; or zero if the rel was not created in the current
146 * top transaction. This should be relied on only for optimization
147 * purposes; it is possible for new-ness to be "forgotten" (eg, after
150 Form_pg_class rd_rel; /* RELATION tuple */
151 TupleDesc rd_att; /* tuple descriptor */
152 Oid rd_id; /* relation's object id */
153 List *rd_indexlist; /* list of OIDs of indexes on relation */
154 Oid rd_oidindex; /* OID of unique index on OID, if any */
155 LockInfoData rd_lockInfo; /* lock mgr's info for locking relation */
156 RuleLock *rd_rules; /* rewrite rules */
157 MemoryContext rd_rulescxt; /* private memory cxt for rd_rules, if any */
158 TriggerDesc *trigdesc; /* Trigger info, or NULL if rel has none */
160 /* These are non-NULL only for an index relation: */
161 Form_pg_index rd_index; /* pg_index tuple describing this index */
162 struct HeapTupleData *rd_indextuple; /* all of pg_index tuple */
163 /* "struct HeapTupleData *" avoids need to include htup.h here */
164 oidvector *rd_indclass; /* extracted pointer to rd_index field */
165 Form_pg_am rd_am; /* pg_am tuple for index's AM */
168 * index access support info (used only for an index relation)
170 * Note: only default operators and support procs for each opclass are
171 * cached, namely those with subtype zero. The arrays are indexed by
172 * strategy or support number, which is a sufficient identifier given
175 MemoryContext rd_indexcxt; /* private memory cxt for this stuff */
176 RelationAmInfo *rd_aminfo; /* lookup info for funcs found in pg_am */
177 Oid *rd_operator; /* OIDs of index operators */
178 RegProcedure *rd_support; /* OIDs of support procedures */
179 FmgrInfo *rd_supportinfo; /* lookup info for support procedures */
180 List *rd_indexprs; /* index expression trees, if any */
181 List *rd_indpred; /* index predicate tree, if any */
183 /* statistics collection area */
184 PgStat_Info pgstat_info;
187 typedef RelationData *Relation;
191 * RelationPtr is used in the executor to support index scans
192 * where we have to keep track of several index relations in an
193 * array. -cim 9/10/89
196 typedef Relation *RelationPtr;
201 * True iff relation descriptor is valid.
203 #define RelationIsValid(relation) PointerIsValid(relation)
205 #define InvalidRelation ((Relation) NULL)
208 * RelationHasReferenceCountZero
209 * True iff relation reference count is zero.
212 * Assumes relation descriptor is valid.
214 #define RelationHasReferenceCountZero(relation) \
215 ((bool)((relation)->rd_refcnt == 0))
219 * Returns pg_class tuple for a relation.
222 * Assumes relation descriptor is valid.
224 #define RelationGetForm(relation) ((relation)->rd_rel)
228 * Returns the OID of the relation
230 #define RelationGetRelid(relation) ((relation)->rd_id)
233 * RelationGetNumberOfAttributes
234 * Returns the number of attributes in a relation.
236 #define RelationGetNumberOfAttributes(relation) ((relation)->rd_rel->relnatts)
240 * Returns tuple descriptor for a relation.
242 #define RelationGetDescr(relation) ((relation)->rd_att)
245 * RelationGetRelationName
246 * Returns the rel's name.
248 * Note that the name is only unique within the containing namespace.
250 #define RelationGetRelationName(relation) \
251 (NameStr((relation)->rd_rel->relname))
254 * RelationGetNamespace
255 * Returns the rel's namespace OID.
257 #define RelationGetNamespace(relation) \
258 ((relation)->rd_rel->relnamespace)
262 * Open the relation at the smgr level, if not already done.
264 #define RelationOpenSmgr(relation) \
266 if ((relation)->rd_smgr == NULL) \
267 smgrsetowner(&((relation)->rd_smgr), smgropen((relation)->rd_node)); \
272 * Close the relation at the smgr level, if not already done.
274 * Note: smgrclose should unhook from owner pointer, hence the Assert.
276 #define RelationCloseSmgr(relation) \
278 if ((relation)->rd_smgr != NULL) \
280 smgrclose((relation)->rd_smgr); \
281 Assert((relation)->rd_smgr == NULL); \
287 * If a rel is either temp or newly created in the current transaction,
288 * it can be assumed to be visible only to the current backend.
290 * Beware of multiple eval of argument
292 #define RELATION_IS_LOCAL(relation) \
293 ((relation)->rd_istemp || \
294 (relation)->rd_createSubid != InvalidSubTransactionId)
296 /* routines in utils/cache/relcache.c */
297 extern void RelationIncrementReferenceCount(Relation rel);
298 extern void RelationDecrementReferenceCount(Relation rel);