PostgreSQL Source Code  git master
relcache.c File Reference
#include "postgres.h"
#include <sys/file.h>
#include <fcntl.h>
#include <unistd.h>
#include "access/htup_details.h"
#include "access/multixact.h"
#include "access/nbtree.h"
#include "access/parallel.h"
#include "access/reloptions.h"
#include "access/sysattr.h"
#include "access/table.h"
#include "access/tableam.h"
#include "access/tupdesc_details.h"
#include "access/xact.h"
#include "access/xlog.h"
#include "catalog/catalog.h"
#include "catalog/indexing.h"
#include "catalog/namespace.h"
#include "catalog/partition.h"
#include "catalog/pg_am.h"
#include "catalog/pg_amproc.h"
#include "catalog/pg_attrdef.h"
#include "catalog/pg_auth_members.h"
#include "catalog/pg_authid.h"
#include "catalog/pg_constraint.h"
#include "catalog/pg_database.h"
#include "catalog/pg_namespace.h"
#include "catalog/pg_opclass.h"
#include "catalog/pg_proc.h"
#include "catalog/pg_publication.h"
#include "catalog/pg_rewrite.h"
#include "catalog/pg_shseclabel.h"
#include "catalog/pg_statistic_ext.h"
#include "catalog/pg_subscription.h"
#include "catalog/pg_tablespace.h"
#include "catalog/pg_trigger.h"
#include "catalog/pg_type.h"
#include "catalog/schemapg.h"
#include "catalog/storage.h"
#include "commands/policy.h"
#include "commands/trigger.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/optimizer.h"
#include "rewrite/rewriteDefine.h"
#include "rewrite/rowsecurity.h"
#include "storage/lmgr.h"
#include "storage/smgr.h"
#include "utils/array.h"
#include "utils/builtins.h"
#include "utils/datum.h"
#include "utils/fmgroids.h"
#include "utils/inval.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "utils/relmapper.h"
#include "utils/resowner_private.h"
#include "utils/snapmgr.h"
#include "utils/syscache.h"
Include dependency graph for relcache.c:

Go to the source code of this file.

Data Structures

struct  relidcacheent
 
struct  opclasscacheent
 

Macros

#define RELCACHE_INIT_FILEMAGIC   0x573266 /* version ID value */
 
#define RECOVER_RELATION_BUILD_MEMORY   0
 
#define MAX_EOXACT_LIST   32
 
#define EOXactListAdd(rel)
 
#define RelationCacheInsert(RELATION, replace_allowed)
 
#define RelationIdCacheLookup(ID, RELATION)
 
#define RelationCacheDelete(RELATION)
 
#define SWAPFIELD(fldtype, fldname)
 
#define INITRELCACHESIZE   400
 
#define NUM_CRITICAL_SHARED_RELS   5 /* fix if you change list above */
 
#define NUM_CRITICAL_LOCAL_RELS   4 /* fix if you change list above */
 
#define NUM_CRITICAL_LOCAL_INDEXES   7 /* fix if you change list above */
 
#define NUM_CRITICAL_SHARED_INDEXES   6 /* fix if you change list above */
 

Typedefs

typedef struct relidcacheent RelIdCacheEnt
 
typedef struct opclasscacheent OpClassCacheEnt
 

Functions

static void RelationDestroyRelation (Relation relation, bool remember_tupdesc)
 
static void RelationClearRelation (Relation relation, bool rebuild)
 
static void RelationReloadIndexInfo (Relation relation)
 
static void RelationReloadNailed (Relation relation)
 
static void RelationFlushRelation (Relation relation)
 
static void RememberToFreeTupleDescAtEOX (TupleDesc td)
 
static void AtEOXact_cleanup (Relation relation, bool isCommit)
 
static void AtEOSubXact_cleanup (Relation relation, bool isCommit, SubTransactionId mySubid, SubTransactionId parentSubid)
 
static bool load_relcache_init_file (bool shared)
 
static void write_relcache_init_file (bool shared)
 
static void write_item (const void *data, Size len, FILE *fp)
 
static void formrdesc (const char *relationName, Oid relationReltype, bool isshared, int natts, const FormData_pg_attribute *attrs)
 
static HeapTuple ScanPgRelation (Oid targetRelId, bool indexOK, bool force_non_historic)
 
static Relation AllocateRelationDesc (Form_pg_class relp)
 
static void RelationParseRelOptions (Relation relation, HeapTuple tuple)
 
static void RelationBuildTupleDesc (Relation relation)
 
static Relation RelationBuildDesc (Oid targetRelId, bool insertIt)
 
static void RelationInitPhysicalAddr (Relation relation)
 
static void load_critical_index (Oid indexoid, Oid heapoid)
 
static TupleDesc GetPgClassDescriptor (void)
 
static TupleDesc GetPgIndexDescriptor (void)
 
static void AttrDefaultFetch (Relation relation)
 
static void CheckConstraintFetch (Relation relation)
 
static int CheckConstraintCmp (const void *a, const void *b)
 
static void InitIndexAmRoutine (Relation relation)
 
static void IndexSupportInitialize (oidvector *indclass, RegProcedure *indexSupport, Oid *opFamily, Oid *opcInType, StrategyNumber maxSupportNumber, AttrNumber maxAttributeNumber)
 
static OpClassCacheEntLookupOpclassInfo (Oid operatorClassOid, StrategyNumber numSupport)
 
static void RelationCacheInitFileRemoveInDir (const char *tblspcpath)
 
static void unlink_initfile (const char *initfilename, int elevel)
 
static void RelationBuildRuleLock (Relation relation)
 
static bool equalRuleLocks (RuleLock *rlock1, RuleLock *rlock2)
 
static bool equalPolicy (RowSecurityPolicy *policy1, RowSecurityPolicy *policy2)
 
static bool equalRSDesc (RowSecurityDesc *rsdesc1, RowSecurityDesc *rsdesc2)
 
void RelationInitIndexAccessInfo (Relation relation)
 
static void InitTableAmRoutine (Relation relation)
 
void RelationInitTableAccessMethod (Relation relation)
 
Relation RelationIdGetRelation (Oid relationId)
 
void RelationIncrementReferenceCount (Relation rel)
 
void RelationDecrementReferenceCount (Relation rel)
 
void RelationClose (Relation relation)
 
void RelationForgetRelation (Oid rid)
 
void RelationCacheInvalidateEntry (Oid relationId)
 
void RelationCacheInvalidate (void)
 
void RelationCloseSmgrByOid (Oid relationId)
 
void AtEOXact_RelationCache (bool isCommit)
 
void AtEOSubXact_RelationCache (bool isCommit, SubTransactionId mySubid, SubTransactionId parentSubid)
 
Relation RelationBuildLocalRelation (const char *relname, Oid relnamespace, TupleDesc tupDesc, Oid relid, Oid accessmtd, Oid relfilenode, Oid reltablespace, bool shared_relation, bool mapped_relation, char relpersistence, char relkind)
 
void RelationSetNewRelfilenode (Relation relation, char persistence)
 
void RelationAssumeNewRelfilenode (Relation relation)
 
void RelationCacheInitialize (void)
 
void RelationCacheInitializePhase2 (void)
 
void RelationCacheInitializePhase3 (void)
 
static TupleDesc BuildHardcodedDescriptor (int natts, const FormData_pg_attribute *attrs)
 
ListRelationGetFKeyList (Relation relation)
 
ListRelationGetIndexList (Relation relation)
 
ListRelationGetStatExtList (Relation relation)
 
Oid RelationGetPrimaryKeyIndex (Relation relation)
 
Oid RelationGetReplicaIndex (Relation relation)
 
ListRelationGetIndexExpressions (Relation relation)
 
ListRelationGetDummyIndexExpressions (Relation relation)
 
ListRelationGetIndexPredicate (Relation relation)
 
BitmapsetRelationGetIndexAttrBitmap (Relation relation, IndexAttrBitmapKind attrKind)
 
void RelationGetExclusionInfo (Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
 
struct PublicationActionsGetRelationPublicationActions (Relation relation)
 
DatumRelationGetIndexRawAttOptions (Relation indexrel)
 
static bytea ** CopyIndexAttOptions (bytea **srcopts, int natts)
 
bytea ** RelationGetIndexAttOptions (Relation relation, bool copy)
 
int errtable (Relation rel)
 
int errtablecol (Relation rel, int attnum)
 
int errtablecolname (Relation rel, const char *colname)
 
int errtableconstraint (Relation rel, const char *conname)
 
bool RelationIdIsInInitFile (Oid relationId)
 
void RelationCacheInitFilePreInvalidate (void)
 
void RelationCacheInitFilePostInvalidate (void)
 
void RelationCacheInitFileRemove (void)
 

Variables

static const FormData_pg_attribute Desc_pg_class [Natts_pg_class] = {Schema_pg_class}
 
static const FormData_pg_attribute Desc_pg_attribute [Natts_pg_attribute] = {Schema_pg_attribute}
 
static const FormData_pg_attribute Desc_pg_proc [Natts_pg_proc] = {Schema_pg_proc}
 
static const FormData_pg_attribute Desc_pg_type [Natts_pg_type] = {Schema_pg_type}
 
static const FormData_pg_attribute Desc_pg_database [Natts_pg_database] = {Schema_pg_database}
 
static const FormData_pg_attribute Desc_pg_authid [Natts_pg_authid] = {Schema_pg_authid}
 
static const FormData_pg_attribute Desc_pg_auth_members [Natts_pg_auth_members] = {Schema_pg_auth_members}
 
static const FormData_pg_attribute Desc_pg_index [Natts_pg_index] = {Schema_pg_index}
 
static const FormData_pg_attribute Desc_pg_shseclabel [Natts_pg_shseclabel] = {Schema_pg_shseclabel}
 
static const FormData_pg_attribute Desc_pg_subscription [Natts_pg_subscription] = {Schema_pg_subscription}
 
static HTABRelationIdCache
 
bool criticalRelcachesBuilt = false
 
bool criticalSharedRelcachesBuilt = false
 
static long relcacheInvalsReceived = 0L
 
static Oid eoxact_list [MAX_EOXACT_LIST]
 
static int eoxact_list_len = 0
 
static bool eoxact_list_overflowed = false
 
static TupleDescEOXactTupleDescArray
 
static int NextEOXactTupleDescNum = 0
 
static int EOXactTupleDescArrayLen = 0
 
static HTABOpClassCache = NULL
 

Macro Definition Documentation

◆ EOXactListAdd

#define EOXactListAdd (   rel)
Value:
do { \
eoxact_list[eoxact_list_len++] = (rel)->rd_id; \
else \
eoxact_list_overflowed = true; \
} while (0)
#define MAX_EOXACT_LIST
Definition: relcache.c:163
static int eoxact_list_len
Definition: relcache.c:165

Definition at line 168 of file relcache.c.

Referenced by RelationAssumeNewRelfilenode(), and RelationBuildLocalRelation().

◆ INITRELCACHESIZE

#define INITRELCACHESIZE   400

Definition at line 3754 of file relcache.c.

Referenced by RelationCacheInitialize().

◆ MAX_EOXACT_LIST

#define MAX_EOXACT_LIST   32

Definition at line 163 of file relcache.c.

◆ NUM_CRITICAL_LOCAL_INDEXES

#define NUM_CRITICAL_LOCAL_INDEXES   7 /* fix if you change list above */

Referenced by load_relcache_init_file().

◆ NUM_CRITICAL_LOCAL_RELS

#define NUM_CRITICAL_LOCAL_RELS   4 /* fix if you change list above */

Referenced by load_relcache_init_file().

◆ NUM_CRITICAL_SHARED_INDEXES

#define NUM_CRITICAL_SHARED_INDEXES   6 /* fix if you change list above */

Referenced by load_relcache_init_file().

◆ NUM_CRITICAL_SHARED_RELS

#define NUM_CRITICAL_SHARED_RELS   5 /* fix if you change list above */

Referenced by load_relcache_init_file().

◆ RECOVER_RELATION_BUILD_MEMORY

#define RECOVER_RELATION_BUILD_MEMORY   0

Definition at line 101 of file relcache.c.

◆ RelationCacheDelete

#define RelationCacheDelete (   RELATION)
Value:
do { \
RelIdCacheEnt *hentry; \
(void *) &((RELATION)->rd_id), \
HASH_REMOVE, NULL); \
if (hentry == NULL) \
elog(WARNING, "failed to delete relcache entry for OID %u", \
(RELATION)->rd_id); \
} while(0)
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
static HTAB * RelationIdCache
Definition: relcache.c:131
#define WARNING
Definition: elog.h:40

Definition at line 222 of file relcache.c.

Referenced by RelationClearRelation().

◆ RelationCacheInsert

#define RelationCacheInsert (   RELATION,
  replace_allowed 
)
Value:
do { \
RelIdCacheEnt *hentry; bool found; \
(void *) &((RELATION)->rd_id), \
HASH_ENTER, &found); \
if (found) \
{ \
/* see comments in RelationBuildDesc and RelationBuildLocalRelation */ \
Relation _old_rel = hentry->reldesc; \
Assert(replace_allowed); \
hentry->reldesc = (RELATION); \
RelationDestroyRelation(_old_rel, false); \
elog(WARNING, "leaking still-referenced relcache entry for \"%s\"", \
} \
else \
hentry->reldesc = (RELATION); \
} while(0)
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
static HTAB * RelationIdCache
Definition: relcache.c:131
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define WARNING
Definition: elog.h:40
#define RelationHasReferenceCountZero(relation)
Definition: rel.h:440
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392

Definition at line 188 of file relcache.c.

Referenced by formrdesc(), load_relcache_init_file(), RelationBuildDesc(), and RelationBuildLocalRelation().

◆ RelationIdCacheLookup

#define RelationIdCacheLookup (   ID,
  RELATION 
)
Value:
do { \
RelIdCacheEnt *hentry; \
(void *) &(ID), \
HASH_FIND, NULL); \
if (hentry) \
RELATION = hentry->reldesc; \
else \
RELATION = NULL; \
} while(0)
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
static HTAB * RelationIdCache
Definition: relcache.c:131

Definition at line 210 of file relcache.c.

Referenced by RelationCacheInvalidateEntry(), RelationCloseSmgrByOid(), RelationForgetRelation(), and RelationIdGetRelation().

◆ RELCACHE_INIT_FILEMAGIC

#define RELCACHE_INIT_FILEMAGIC   0x573266 /* version ID value */

Definition at line 90 of file relcache.c.

Referenced by load_relcache_init_file(), and write_relcache_init_file().

◆ SWAPFIELD

#define SWAPFIELD (   fldtype,
  fldname 
)
Value:
do { \
fldtype _tmp = newrel->fldname; \
newrel->fldname = relation->fldname; \
relation->fldname = _tmp; \
} while (0)

Referenced by RelationClearRelation().

Typedef Documentation

◆ OpClassCacheEnt

◆ RelIdCacheEnt

typedef struct relidcacheent RelIdCacheEnt

Function Documentation

◆ AllocateRelationDesc()

static Relation AllocateRelationDesc ( Form_pg_class  relp)
static

Definition at line 385 of file relcache.c.

References CacheMemoryContext, CLASS_TUPLE_SIZE, CreateTemplateTupleDesc(), MemoryContextSwitchTo(), palloc(), palloc0(), RelationData::rd_att, RelationData::rd_rel, RelationData::rd_smgr, and TupleDescData::tdrefcount.

Referenced by RelationBuildDesc().

386 {
387  Relation relation;
388  MemoryContext oldcxt;
389  Form_pg_class relationForm;
390 
391  /* Relcache entries must live in CacheMemoryContext */
393 
394  /*
395  * allocate and zero space for new relation descriptor
396  */
397  relation = (Relation) palloc0(sizeof(RelationData));
398 
399  /* make sure relation is marked as having no open file yet */
400  relation->rd_smgr = NULL;
401 
402  /*
403  * Copy the relation tuple form
404  *
405  * We only allocate space for the fixed fields, ie, CLASS_TUPLE_SIZE. The
406  * variable-length fields (relacl, reloptions) are NOT stored in the
407  * relcache --- there'd be little point in it, since we don't copy the
408  * tuple's nulls bitmap and hence wouldn't know if the values are valid.
409  * Bottom line is that relacl *cannot* be retrieved from the relcache. Get
410  * it from the syscache if you need it. The same goes for the original
411  * form of reloptions (however, we do store the parsed form of reloptions
412  * in rd_options).
413  */
414  relationForm = (Form_pg_class) palloc(CLASS_TUPLE_SIZE);
415 
416  memcpy(relationForm, relp, CLASS_TUPLE_SIZE);
417 
418  /* initialize relation tuple form */
419  relation->rd_rel = relationForm;
420 
421  /* and allocate attribute tuple form storage */
422  relation->rd_att = CreateTemplateTupleDesc(relationForm->relnatts);
423  /* which we mark as a reference-counted tupdesc */
424  relation->rd_att->tdrefcount = 1;
425 
426  MemoryContextSwitchTo(oldcxt);
427 
428  return relation;
429 }
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
Form_pg_class rd_rel
Definition: rel.h:109
struct RelationData * Relation
Definition: relcache.h:27
void * palloc0(Size size)
Definition: mcxt.c:980
TupleDesc rd_att
Definition: rel.h:110
#define CLASS_TUPLE_SIZE
Definition: pg_class.h:145
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
void * palloc(Size size)
Definition: mcxt.c:949
int tdrefcount
Definition: tupdesc.h:84
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ AtEOSubXact_cleanup()

static void AtEOSubXact_cleanup ( Relation  relation,
bool  isCommit,
SubTransactionId  mySubid,
SubTransactionId  parentSubid 
)
static

Definition at line 3254 of file relcache.c.

References Assert, elog, InvalidSubTransactionId, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_newRelfilenodeSubid, RelationClearRelation(), RelationGetRelationName, RelationHasReferenceCountZero, and WARNING.

Referenced by AtEOSubXact_RelationCache().

3256 {
3257  /*
3258  * Is it a relation created in the current subtransaction?
3259  *
3260  * During subcommit, mark it as belonging to the parent, instead, as long
3261  * as it has not been dropped. Otherwise simply delete the relcache entry.
3262  * --- it isn't interesting any longer.
3263  */
3264  if (relation->rd_createSubid == mySubid)
3265  {
3266  /*
3267  * Valid rd_droppedSubid means the corresponding relation is dropped
3268  * but the relcache entry is preserved for at-commit pending sync. We
3269  * need to drop it explicitly here not to make the entry orphan.
3270  */
3271  Assert(relation->rd_droppedSubid == mySubid ||
3273  if (isCommit && relation->rd_droppedSubid == InvalidSubTransactionId)
3274  relation->rd_createSubid = parentSubid;
3275  else if (RelationHasReferenceCountZero(relation))
3276  {
3277  /* allow the entry to be removed */
3282  RelationClearRelation(relation, false);
3283  return;
3284  }
3285  else
3286  {
3287  /*
3288  * Hmm, somewhere there's a (leaked?) reference to the relation.
3289  * We daren't remove the entry for fear of dereferencing a
3290  * dangling pointer later. Bleat, and transfer it to the parent
3291  * subtransaction so we can try again later. This must be just a
3292  * WARNING to avoid error-during-error-recovery loops.
3293  */
3294  relation->rd_createSubid = parentSubid;
3295  elog(WARNING, "cannot remove relcache entry for \"%s\" because it has nonzero refcount",
3296  RelationGetRelationName(relation));
3297  }
3298  }
3299 
3300  /*
3301  * Likewise, update or drop any new-relfilenode-in-subtransaction record
3302  * or drop record.
3303  */
3304  if (relation->rd_newRelfilenodeSubid == mySubid)
3305  {
3306  if (isCommit)
3307  relation->rd_newRelfilenodeSubid = parentSubid;
3308  else
3310  }
3311 
3312  if (relation->rd_firstRelfilenodeSubid == mySubid)
3313  {
3314  if (isCommit)
3315  relation->rd_firstRelfilenodeSubid = parentSubid;
3316  else
3318  }
3319 
3320  if (relation->rd_droppedSubid == mySubid)
3321  {
3322  if (isCommit)
3323  relation->rd_droppedSubid = parentSubid;
3324  else
3326  }
3327 }
static void RelationClearRelation(Relation relation, bool rebuild)
Definition: relcache.c:2424
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define WARNING
Definition: elog.h:40
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
#define Assert(condition)
Definition: c.h:738
#define InvalidSubTransactionId
Definition: c.h:519
#define RelationHasReferenceCountZero(relation)
Definition: rel.h:440
#define elog(elevel,...)
Definition: elog.h:214
SubTransactionId rd_droppedSubid
Definition: rel.h:107

◆ AtEOSubXact_RelationCache()

void AtEOSubXact_RelationCache ( bool  isCommit,
SubTransactionId  mySubid,
SubTransactionId  parentSubid 
)

Definition at line 3207 of file relcache.c.

References AtEOSubXact_cleanup(), eoxact_list, eoxact_list_len, eoxact_list_overflowed, HASH_FIND, hash_search(), hash_seq_init(), hash_seq_search(), i, relidcacheent::reldesc, and status().

Referenced by AbortSubTransaction(), and CommitSubTransaction().

3209 {
3211  RelIdCacheEnt *idhentry;
3212  int i;
3213 
3214  /*
3215  * Unless the eoxact_list[] overflowed, we only need to examine the rels
3216  * listed in it. Otherwise fall back on a hash_seq_search scan. Same
3217  * logic as in AtEOXact_RelationCache.
3218  */
3220  {
3221  hash_seq_init(&status, RelationIdCache);
3222  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
3223  {
3224  AtEOSubXact_cleanup(idhentry->reldesc, isCommit,
3225  mySubid, parentSubid);
3226  }
3227  }
3228  else
3229  {
3230  for (i = 0; i < eoxact_list_len; i++)
3231  {
3232  idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
3233  (void *) &eoxact_list[i],
3234  HASH_FIND,
3235  NULL);
3236  if (idhentry != NULL)
3237  AtEOSubXact_cleanup(idhentry->reldesc, isCommit,
3238  mySubid, parentSubid);
3239  }
3240  }
3241 
3242  /* Don't reset the list; we still need more cleanup later */
3243 }
static Oid eoxact_list[MAX_EOXACT_LIST]
Definition: relcache.c:164
static void AtEOSubXact_cleanup(Relation relation, bool isCommit, SubTransactionId mySubid, SubTransactionId parentSubid)
Definition: relcache.c:3254
Relation reldesc
Definition: relcache.c:128
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
static HTAB * RelationIdCache
Definition: relcache.c:131
static bool eoxact_list_overflowed
Definition: relcache.c:166
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1391
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1381
int i
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:225
static int eoxact_list_len
Definition: relcache.c:165

◆ AtEOXact_cleanup()

static void AtEOXact_cleanup ( Relation  relation,
bool  isCommit 
)
static

Definition at line 3125 of file relcache.c.

References Assert, elog, InvalidSubTransactionId, IsBootstrapProcessingMode, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_isnailed, RelationData::rd_newRelfilenodeSubid, RelationData::rd_refcnt, RelationClearRelation(), RelationGetRelationName, RelationHasReferenceCountZero, and WARNING.

Referenced by AtEOXact_RelationCache().

3126 {
3127  bool clear_relcache = false;
3128 
3129  /*
3130  * The relcache entry's ref count should be back to its normal
3131  * not-in-a-transaction state: 0 unless it's nailed in cache.
3132  *
3133  * In bootstrap mode, this is NOT true, so don't check it --- the
3134  * bootstrap code expects relations to stay open across start/commit
3135  * transaction calls. (That seems bogus, but it's not worth fixing.)
3136  *
3137  * Note: ideally this check would be applied to every relcache entry, not
3138  * just those that have eoxact work to do. But it's not worth forcing a
3139  * scan of the whole relcache just for this. (Moreover, doing so would
3140  * mean that assert-enabled testing never tests the hash_search code path
3141  * above, which seems a bad idea.)
3142  */
3143 #ifdef USE_ASSERT_CHECKING
3145  {
3146  int expected_refcnt;
3147 
3148  expected_refcnt = relation->rd_isnailed ? 1 : 0;
3149  Assert(relation->rd_refcnt == expected_refcnt);
3150  }
3151 #endif
3152 
3153  /*
3154  * Is the relation live after this transaction ends?
3155  *
3156  * During commit, clear the relcache entry if it is preserved after
3157  * relation drop, in order not to orphan the entry. During rollback,
3158  * clear the relcache entry if the relation is created in the current
3159  * transaction since it isn't interesting any longer once we are out of
3160  * the transaction.
3161  */
3162  clear_relcache =
3163  (isCommit ?
3166 
3167  /*
3168  * Since we are now out of the transaction, reset the subids to zero. That
3169  * also lets RelationClearRelation() drop the relcache entry.
3170  */
3175 
3176  if (clear_relcache)
3177  {
3178  if (RelationHasReferenceCountZero(relation))
3179  {
3180  RelationClearRelation(relation, false);
3181  return;
3182  }
3183  else
3184  {
3185  /*
3186  * Hmm, somewhere there's a (leaked?) reference to the relation.
3187  * We daren't remove the entry for fear of dereferencing a
3188  * dangling pointer later. Bleat, and mark it as not belonging to
3189  * the current transaction. Hopefully it'll get cleaned up
3190  * eventually. This must be just a WARNING to avoid
3191  * error-during-error-recovery loops.
3192  */
3193  elog(WARNING, "cannot remove relcache entry for \"%s\" because it has nonzero refcount",
3194  RelationGetRelationName(relation));
3195  }
3196  }
3197 }
static void RelationClearRelation(Relation relation, bool rebuild)
Definition: relcache.c:2424
bool rd_isnailed
Definition: rel.h:61
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define WARNING
Definition: elog.h:40
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
#define Assert(condition)
Definition: c.h:738
#define InvalidSubTransactionId
Definition: c.h:519
#define RelationHasReferenceCountZero(relation)
Definition: rel.h:440
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
int rd_refcnt
Definition: rel.h:58
#define elog(elevel,...)
Definition: elog.h:214
SubTransactionId rd_droppedSubid
Definition: rel.h:107

◆ AtEOXact_RelationCache()

void AtEOXact_RelationCache ( bool  isCommit)

Definition at line 3062 of file relcache.c.

References Assert, AtEOXact_cleanup(), eoxact_list, eoxact_list_len, eoxact_list_overflowed, EOXactTupleDescArrayLen, FreeTupleDesc(), HASH_FIND, hash_search(), hash_seq_init(), hash_seq_search(), i, NextEOXactTupleDescNum, pfree(), relidcacheent::reldesc, and status().

Referenced by AbortTransaction(), CommitTransaction(), and PrepareTransaction().

3063 {
3065  RelIdCacheEnt *idhentry;
3066  int i;
3067 
3068  /*
3069  * Unless the eoxact_list[] overflowed, we only need to examine the rels
3070  * listed in it. Otherwise fall back on a hash_seq_search scan.
3071  *
3072  * For simplicity, eoxact_list[] entries are not deleted till end of
3073  * top-level transaction, even though we could remove them at
3074  * subtransaction end in some cases, or remove relations from the list if
3075  * they are cleared for other reasons. Therefore we should expect the
3076  * case that list entries are not found in the hashtable; if not, there's
3077  * nothing to do for them.
3078  */
3080  {
3081  hash_seq_init(&status, RelationIdCache);
3082  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
3083  {
3084  AtEOXact_cleanup(idhentry->reldesc, isCommit);
3085  }
3086  }
3087  else
3088  {
3089  for (i = 0; i < eoxact_list_len; i++)
3090  {
3091  idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
3092  (void *) &eoxact_list[i],
3093  HASH_FIND,
3094  NULL);
3095  if (idhentry != NULL)
3096  AtEOXact_cleanup(idhentry->reldesc, isCommit);
3097  }
3098  }
3099 
3100  if (EOXactTupleDescArrayLen > 0)
3101  {
3102  Assert(EOXactTupleDescArray != NULL);
3103  for (i = 0; i < NextEOXactTupleDescNum; i++)
3106  EOXactTupleDescArray = NULL;
3107  }
3108 
3109  /* Now we're out of the transaction and can clear the lists */
3110  eoxact_list_len = 0;
3111  eoxact_list_overflowed = false;
3112  NextEOXactTupleDescNum = 0;
3114 }
static Oid eoxact_list[MAX_EOXACT_LIST]
Definition: relcache.c:164
static int EOXactTupleDescArrayLen
Definition: relcache.c:183
Relation reldesc
Definition: relcache.c:128
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
static HTAB * RelationIdCache
Definition: relcache.c:131
static void AtEOXact_cleanup(Relation relation, bool isCommit)
Definition: relcache.c:3125
static bool eoxact_list_overflowed
Definition: relcache.c:166
static int NextEOXactTupleDescNum
Definition: relcache.c:182
void pfree(void *pointer)
Definition: mcxt.c:1056
#define Assert(condition)
Definition: c.h:738
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1391
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1381
void FreeTupleDesc(TupleDesc tupdesc)
Definition: tupdesc.c:313
int i
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:225
static int eoxact_list_len
Definition: relcache.c:165
static TupleDesc * EOXactTupleDescArray
Definition: relcache.c:181

◆ AttrDefaultFetch()

static void AttrDefaultFetch ( Relation  relation)
static

Definition at line 4234 of file relcache.c.

References AccessShareLock, AttrDefault::adbin, AttrDefault::adnum, AttrDefaultIndexId, BTEqualStrategyNumber, CacheMemoryContext, TupleDescData::constr, TupleConstr::defval, elog, fastgetattr, GETSTRUCT, HeapTupleIsValid, i, MemoryContextStrdup(), NameStr, TupleConstr::num_defval, ObjectIdGetDatum, pfree(), RelationData::rd_att, RelationGetRelationName, RelationGetRelid, ScanKeyInit(), systable_beginscan(), systable_endscan(), systable_getnext(), table_close(), table_open(), TextDatumGetCString, TupleDescAttr, val, and WARNING.

Referenced by RelationBuildTupleDesc().

4235 {
4236  AttrDefault *attrdef = relation->rd_att->constr->defval;
4237  int ndef = relation->rd_att->constr->num_defval;
4238  Relation adrel;
4239  SysScanDesc adscan;
4240  ScanKeyData skey;
4241  HeapTuple htup;
4242  Datum val;
4243  bool isnull;
4244  int found;
4245  int i;
4246 
4247  ScanKeyInit(&skey,
4248  Anum_pg_attrdef_adrelid,
4249  BTEqualStrategyNumber, F_OIDEQ,
4250  ObjectIdGetDatum(RelationGetRelid(relation)));
4251 
4252  adrel = table_open(AttrDefaultRelationId, AccessShareLock);
4253  adscan = systable_beginscan(adrel, AttrDefaultIndexId, true,
4254  NULL, 1, &skey);
4255  found = 0;
4256 
4257  while (HeapTupleIsValid(htup = systable_getnext(adscan)))
4258  {
4259  Form_pg_attrdef adform = (Form_pg_attrdef) GETSTRUCT(htup);
4260  Form_pg_attribute attr = TupleDescAttr(relation->rd_att, adform->adnum - 1);
4261 
4262  for (i = 0; i < ndef; i++)
4263  {
4264  if (adform->adnum != attrdef[i].adnum)
4265  continue;
4266  if (attrdef[i].adbin != NULL)
4267  elog(WARNING, "multiple attrdef records found for attr %s of rel %s",
4268  NameStr(attr->attname),
4269  RelationGetRelationName(relation));
4270  else
4271  found++;
4272 
4273  val = fastgetattr(htup,
4274  Anum_pg_attrdef_adbin,
4275  adrel->rd_att, &isnull);
4276  if (isnull)
4277  elog(WARNING, "null adbin for attr %s of rel %s",
4278  NameStr(attr->attname),
4279  RelationGetRelationName(relation));
4280  else
4281  {
4282  /* detoast and convert to cstring in caller's context */
4283  char *s = TextDatumGetCString(val);
4284 
4286  pfree(s);
4287  }
4288  break;
4289  }
4290 
4291  if (i >= ndef)
4292  elog(WARNING, "unexpected attrdef record found for attr %d of rel %s",
4293  adform->adnum, RelationGetRelationName(relation));
4294  }
4295 
4296  systable_endscan(adscan);
4297  table_close(adrel, AccessShareLock);
4298 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define fastgetattr(tup, attnum, tupleDesc, isnull)
Definition: htup_details.h:712
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
#define AccessShareLock
Definition: lockdefs.h:36
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
AttrDefault * defval
Definition: tupdesc.h:39
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define AttrDefaultIndexId
Definition: indexing.h:89
TupleConstr * constr
Definition: tupdesc.h:85
#define RelationGetRelationName(relation)
Definition: rel.h:490
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
FormData_pg_attrdef * Form_pg_attrdef
Definition: pg_attrdef.h:47
#define WARNING
Definition: elog.h:40
#define TextDatumGetCString(d)
Definition: builtins.h:88
uintptr_t Datum
Definition: postgres.h:367
TupleDesc rd_att
Definition: rel.h:110
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
uint16 num_defval
Definition: tupdesc.h:42
char * MemoryContextStrdup(MemoryContext context, const char *string)
Definition: mcxt.c:1173
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber adnum
Definition: tupdesc.h:24
char * adbin
Definition: tupdesc.h:25
#define NameStr(name)
Definition: c.h:615
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:456
long val
Definition: informix.c:664
#define BTEqualStrategyNumber
Definition: stratnum.h:31
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ BuildHardcodedDescriptor()

static TupleDesc BuildHardcodedDescriptor ( int  natts,
const FormData_pg_attribute attrs 
)
static

Definition at line 4175 of file relcache.c.

References ATTRIBUTE_FIXED_PART_SIZE, CacheMemoryContext, CreateTemplateTupleDesc(), i, MemoryContextSwitchTo(), TupleDescData::tdtypeid, TupleDescData::tdtypmod, and TupleDescAttr.

Referenced by GetPgClassDescriptor(), and GetPgIndexDescriptor().

4176 {
4177  TupleDesc result;
4178  MemoryContext oldcxt;
4179  int i;
4180 
4182 
4183  result = CreateTemplateTupleDesc(natts);
4184  result->tdtypeid = RECORDOID; /* not right, but we don't care */
4185  result->tdtypmod = -1;
4186 
4187  for (i = 0; i < natts; i++)
4188  {
4189  memcpy(TupleDescAttr(result, i), &attrs[i], ATTRIBUTE_FIXED_PART_SIZE);
4190  /* make sure attcacheoff is valid */
4191  TupleDescAttr(result, i)->attcacheoff = -1;
4192  }
4193 
4194  /* initialize first attribute's attcacheoff, cf RelationBuildTupleDesc */
4195  TupleDescAttr(result, 0)->attcacheoff = 0;
4196 
4197  /* Note: we don't bother to set up a TupleConstr entry */
4198 
4199  MemoryContextSwitchTo(oldcxt);
4200 
4201  return result;
4202 }
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
int32 tdtypmod
Definition: tupdesc.h:83
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:185
Oid tdtypeid
Definition: tupdesc.h:82
int i
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ CheckConstraintCmp()

static int CheckConstraintCmp ( const void *  a,
const void *  b 
)
static

Definition at line 4375 of file relcache.c.

References ConstrCheck::ccname.

Referenced by CheckConstraintFetch().

4376 {
4377  const ConstrCheck *ca = (const ConstrCheck *) a;
4378  const ConstrCheck *cb = (const ConstrCheck *) b;
4379 
4380  return strcmp(ca->ccname, cb->ccname);
4381 }
char * ccname
Definition: tupdesc.h:30

◆ CheckConstraintFetch()

static void CheckConstraintFetch ( Relation  relation)
static

Definition at line 4304 of file relcache.c.

References AccessShareLock, BTEqualStrategyNumber, CacheMemoryContext, ConstrCheck::ccbin, ConstrCheck::ccname, ConstrCheck::ccnoinherit, ConstrCheck::ccvalid, TupleConstr::check, CheckConstraintCmp(), TupleDescData::constr, ConstraintRelidTypidNameIndexId, elog, ERROR, fastgetattr, GETSTRUCT, HeapTupleIsValid, MemoryContextStrdup(), NameStr, TupleConstr::num_check, ObjectIdGetDatum, pfree(), qsort, RelationData::rd_att, RelationGetRelationName, RelationGetRelid, ScanKeyInit(), systable_beginscan(), systable_endscan(), systable_getnext(), table_close(), table_open(), TextDatumGetCString, and val.

Referenced by RelationBuildTupleDesc().

4305 {
4306  ConstrCheck *check = relation->rd_att->constr->check;
4307  int ncheck = relation->rd_att->constr->num_check;
4308  Relation conrel;
4309  SysScanDesc conscan;
4310  ScanKeyData skey[1];
4311  HeapTuple htup;
4312  int found = 0;
4313 
4314  ScanKeyInit(&skey[0],
4315  Anum_pg_constraint_conrelid,
4316  BTEqualStrategyNumber, F_OIDEQ,
4317  ObjectIdGetDatum(RelationGetRelid(relation)));
4318 
4319  conrel = table_open(ConstraintRelationId, AccessShareLock);
4320  conscan = systable_beginscan(conrel, ConstraintRelidTypidNameIndexId, true,
4321  NULL, 1, skey);
4322 
4323  while (HeapTupleIsValid(htup = systable_getnext(conscan)))
4324  {
4326  Datum val;
4327  bool isnull;
4328  char *s;
4329 
4330  /* We want check constraints only */
4331  if (conform->contype != CONSTRAINT_CHECK)
4332  continue;
4333 
4334  if (found >= ncheck)
4335  elog(ERROR, "unexpected constraint record found for rel %s",
4336  RelationGetRelationName(relation));
4337 
4338  check[found].ccvalid = conform->convalidated;
4339  check[found].ccnoinherit = conform->connoinherit;
4341  NameStr(conform->conname));
4342 
4343  /* Grab and test conbin is actually set */
4344  val = fastgetattr(htup,
4345  Anum_pg_constraint_conbin,
4346  conrel->rd_att, &isnull);
4347  if (isnull)
4348  elog(ERROR, "null conbin for rel %s",
4349  RelationGetRelationName(relation));
4350 
4351  /* detoast and convert to cstring in caller's context */
4352  s = TextDatumGetCString(val);
4353  check[found].ccbin = MemoryContextStrdup(CacheMemoryContext, s);
4354  pfree(s);
4355 
4356  found++;
4357  }
4358 
4359  systable_endscan(conscan);
4360  table_close(conrel, AccessShareLock);
4361 
4362  if (found != ncheck)
4363  elog(ERROR, "%d constraint record(s) missing for rel %s",
4364  ncheck - found, RelationGetRelationName(relation));
4365 
4366  /* Sort the records so that CHECKs are applied in a deterministic order */
4367  if (ncheck > 1)
4368  qsort(check, ncheck, sizeof(ConstrCheck), CheckConstraintCmp);
4369 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define fastgetattr(tup, attnum, tupleDesc, isnull)
Definition: htup_details.h:712
static int CheckConstraintCmp(const void *a, const void *b)
Definition: relcache.c:4375
#define AccessShareLock
Definition: lockdefs.h:36
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
TupleConstr * constr
Definition: tupdesc.h:85
char * ccname
Definition: tupdesc.h:30
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define TextDatumGetCString(d)
Definition: builtins.h:88
uintptr_t Datum
Definition: postgres.h:367
TupleDesc rd_att
Definition: rel.h:110
uint16 num_check
Definition: tupdesc.h:43
FormData_pg_constraint * Form_pg_constraint
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define ConstraintRelidTypidNameIndexId
Definition: indexing.h:128
char * MemoryContextStrdup(MemoryContext context, const char *string)
Definition: mcxt.c:1173
#define elog(elevel,...)
Definition: elog.h:214
#define NameStr(name)
Definition: c.h:615
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
ConstrCheck * check
Definition: tupdesc.h:40
bool ccvalid
Definition: tupdesc.h:32
#define qsort(a, b, c, d)
Definition: port.h:479
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
char * ccbin
Definition: tupdesc.h:31
#define RelationGetRelid(relation)
Definition: rel.h:456
long val
Definition: informix.c:664
#define BTEqualStrategyNumber
Definition: stratnum.h:31
bool ccnoinherit
Definition: tupdesc.h:33
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ CopyIndexAttOptions()

static bytea** CopyIndexAttOptions ( bytea **  srcopts,
int  natts 
)
static

Definition at line 5409 of file relcache.c.

References datumCopy(), DatumGetPointer, i, palloc(), and PointerGetDatum.

Referenced by RelationGetIndexAttOptions().

5410 {
5411  bytea **opts = palloc(sizeof(*opts) * natts);
5412 
5413  for (int i = 0; i < natts; i++)
5414  {
5415  bytea *opt = srcopts[i];
5416 
5417  opts[i] = !opt ? NULL : (bytea *)
5418  DatumGetPointer(datumCopy(PointerGetDatum(opt), false, -1));
5419  }
5420 
5421  return opts;
5422 }
#define PointerGetDatum(X)
Definition: postgres.h:556
Datum datumCopy(Datum value, bool typByVal, int typLen)
Definition: datum.c:131
#define DatumGetPointer(X)
Definition: postgres.h:549
void * palloc(Size size)
Definition: mcxt.c:949
int i
Definition: c.h:555

◆ equalPolicy()

static bool equalPolicy ( RowSecurityPolicy policy1,
RowSecurityPolicy policy2 
)
static

Definition at line 941 of file relcache.c.

References ARR_DATA_PTR, ARR_DIMS, equal(), RowSecurityPolicy::hassublinks, i, RowSecurityPolicy::polcmd, RowSecurityPolicy::policy_name, RowSecurityPolicy::qual, RowSecurityPolicy::roles, and RowSecurityPolicy::with_check_qual.

Referenced by equalRSDesc().

942 {
943  int i;
944  Oid *r1,
945  *r2;
946 
947  if (policy1 != NULL)
948  {
949  if (policy2 == NULL)
950  return false;
951 
952  if (policy1->polcmd != policy2->polcmd)
953  return false;
954  if (policy1->hassublinks != policy2->hassublinks)
955  return false;
956  if (strcmp(policy1->policy_name, policy2->policy_name) != 0)
957  return false;
958  if (ARR_DIMS(policy1->roles)[0] != ARR_DIMS(policy2->roles)[0])
959  return false;
960 
961  r1 = (Oid *) ARR_DATA_PTR(policy1->roles);
962  r2 = (Oid *) ARR_DATA_PTR(policy2->roles);
963 
964  for (i = 0; i < ARR_DIMS(policy1->roles)[0]; i++)
965  {
966  if (r1[i] != r2[i])
967  return false;
968  }
969 
970  if (!equal(policy1->qual, policy2->qual))
971  return false;
972  if (!equal(policy1->with_check_qual, policy2->with_check_qual))
973  return false;
974  }
975  else if (policy2 != NULL)
976  return false;
977 
978  return true;
979 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3033
unsigned int Oid
Definition: postgres_ext.h:31
#define ARR_DIMS(a)
Definition: array.h:282
#define ARR_DATA_PTR(a)
Definition: array.h:310
Expr * with_check_qual
Definition: rowsecurity.h:27
ArrayType * roles
Definition: rowsecurity.h:24
int i

◆ equalRSDesc()

static bool equalRSDesc ( RowSecurityDesc rsdesc1,
RowSecurityDesc rsdesc2 
)
static

Definition at line 987 of file relcache.c.

References equalPolicy(), forboth, lfirst, list_length(), and RowSecurityDesc::policies.

Referenced by RelationClearRelation().

988 {
989  ListCell *lc,
990  *rc;
991 
992  if (rsdesc1 == NULL && rsdesc2 == NULL)
993  return true;
994 
995  if ((rsdesc1 != NULL && rsdesc2 == NULL) ||
996  (rsdesc1 == NULL && rsdesc2 != NULL))
997  return false;
998 
999  if (list_length(rsdesc1->policies) != list_length(rsdesc2->policies))
1000  return false;
1001 
1002  /* RelationBuildRowSecurity should build policies in order */
1003  forboth(lc, rsdesc1->policies, rc, rsdesc2->policies)
1004  {
1007 
1008  if (!equalPolicy(l, r))
1009  return false;
1010  }
1011 
1012  return true;
1013 }
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:419
static bool equalPolicy(RowSecurityPolicy *policy1, RowSecurityPolicy *policy2)
Definition: relcache.c:941
#define lfirst(lc)
Definition: pg_list.h:190
static int list_length(const List *l)
Definition: pg_list.h:169

◆ equalRuleLocks()

static bool equalRuleLocks ( RuleLock rlock1,
RuleLock rlock2 
)
static

Definition at line 896 of file relcache.c.

References RewriteRule::actions, RewriteRule::enabled, equal(), RewriteRule::event, i, RewriteRule::isInstead, RuleLock::numLocks, RewriteRule::qual, RewriteRule::ruleId, and RuleLock::rules.

Referenced by RelationClearRelation().

897 {
898  int i;
899 
900  /*
901  * As of 7.3 we assume the rule ordering is repeatable, because
902  * RelationBuildRuleLock should read 'em in a consistent order. So just
903  * compare corresponding slots.
904  */
905  if (rlock1 != NULL)
906  {
907  if (rlock2 == NULL)
908  return false;
909  if (rlock1->numLocks != rlock2->numLocks)
910  return false;
911  for (i = 0; i < rlock1->numLocks; i++)
912  {
913  RewriteRule *rule1 = rlock1->rules[i];
914  RewriteRule *rule2 = rlock2->rules[i];
915 
916  if (rule1->ruleId != rule2->ruleId)
917  return false;
918  if (rule1->event != rule2->event)
919  return false;
920  if (rule1->enabled != rule2->enabled)
921  return false;
922  if (rule1->isInstead != rule2->isInstead)
923  return false;
924  if (!equal(rule1->qual, rule2->qual))
925  return false;
926  if (!equal(rule1->actions, rule2->actions))
927  return false;
928  }
929  }
930  else if (rlock2 != NULL)
931  return false;
932  return true;
933 }
Node * qual
Definition: prs2lock.h:28
int numLocks
Definition: prs2lock.h:42
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3033
bool isInstead
Definition: prs2lock.h:31
CmdType event
Definition: prs2lock.h:27
RewriteRule ** rules
Definition: prs2lock.h:43
List * actions
Definition: prs2lock.h:29
int i
Oid ruleId
Definition: prs2lock.h:26
char enabled
Definition: prs2lock.h:30

◆ errtable()

int errtable ( Relation  rel)

Definition at line 5490 of file relcache.c.

References err_generic_string(), get_namespace_name(), PG_DIAG_SCHEMA_NAME, PG_DIAG_TABLE_NAME, RelationGetNamespace, and RelationGetRelationName.

Referenced by ATPrepChangePersistence(), ATRewriteTable(), BuildRelationExtStatistics(), check_default_partition_contents(), errtablecolname(), errtableconstraint(), ExecFindPartition(), and ExecPartitionCheckEmitError().

5491 {
5495 
5496  return 0; /* return value does not matter */
5497 }
#define PG_DIAG_SCHEMA_NAME
Definition: postgres_ext.h:65
#define PG_DIAG_TABLE_NAME
Definition: postgres_ext.h:66
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3191
#define RelationGetRelationName(relation)
Definition: rel.h:490
int err_generic_string(int field, const char *str)
Definition: elog.c:1265
#define RelationGetNamespace(relation)
Definition: rel.h:497

◆ errtablecol()

int errtablecol ( Relation  rel,
int  attnum 
)

Definition at line 5507 of file relcache.c.

References attname, errtablecolname(), get_attname(), NameStr, RelationGetDescr, RelationGetRelid, relidcacheent::reldesc, and TupleDescAttr.

Referenced by AlterDomainNotNull(), ATRewriteTable(), ExecConstraints(), and validateDomainConstraint().

5508 {
5509  TupleDesc reldesc = RelationGetDescr(rel);
5510  const char *colname;
5511 
5512  /* Use reldesc if it's a user attribute, else consult the catalogs */
5513  if (attnum > 0 && attnum <= reldesc->natts)
5514  colname = NameStr(TupleDescAttr(reldesc, attnum - 1)->attname);
5515  else
5516  colname = get_attname(RelationGetRelid(rel), attnum, false);
5517 
5518  return errtablecolname(rel, colname);
5519 }
#define RelationGetDescr(relation)
Definition: rel.h:482
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
NameData attname
Definition: pg_attribute.h:40
int16 attnum
Definition: pg_attribute.h:79
#define NameStr(name)
Definition: c.h:615
char * get_attname(Oid relid, AttrNumber attnum, bool missing_ok)
Definition: lsyscache.c:825
#define RelationGetRelid(relation)
Definition: rel.h:456
int errtablecolname(Relation rel, const char *colname)
Definition: relcache.c:5531

◆ errtablecolname()

int errtablecolname ( Relation  rel,
const char *  colname 
)

Definition at line 5531 of file relcache.c.

References err_generic_string(), errtable(), and PG_DIAG_COLUMN_NAME.

Referenced by errtablecol().

5532 {
5533  errtable(rel);
5535 
5536  return 0; /* return value does not matter */
5537 }
#define PG_DIAG_COLUMN_NAME
Definition: postgres_ext.h:67
int err_generic_string(int field, const char *str)
Definition: elog.c:1265
int errtable(Relation rel)
Definition: relcache.c:5490

◆ errtableconstraint()

int errtableconstraint ( Relation  rel,
const char *  conname 
)

Definition at line 5544 of file relcache.c.

References err_generic_string(), errtable(), and PG_DIAG_CONSTRAINT_NAME.

Referenced by _bt_check_third_page(), _bt_check_unique(), ATPrepChangePersistence(), ATRewriteTable(), check_exclusion_or_unique_constraint(), comparetup_index_btree(), ExecCheckIndexConstraints(), ExecConstraints(), RI_FKey_check(), RI_Initial_Check(), ri_ReportViolation(), and validateCheckConstraint().

5545 {
5546  errtable(rel);
5548 
5549  return 0; /* return value does not matter */
5550 }
#define PG_DIAG_CONSTRAINT_NAME
Definition: postgres_ext.h:69
int err_generic_string(int field, const char *str)
Definition: elog.c:1265
int errtable(Relation rel)
Definition: relcache.c:5490

◆ formrdesc()

static void formrdesc ( const char *  relationName,
Oid  relationReltype,
bool  isshared,
int  natts,
const FormData_pg_attribute attrs 
)
static

Definition at line 1809 of file relcache.c.

References ATTRIBUTE_FIXED_PART_SIZE, CLASS_TUPLE_SIZE, TupleDescData::constr, CreateTemplateTupleDesc(), GetHeapamTableAmRoutine(), TupleConstr::has_not_null, i, InvalidBackendId, InvalidOid, InvalidSubTransactionId, IsBootstrapProcessingMode, namestrcpy(), palloc0(), RelationData::rd_att, RelationData::rd_backend, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_islocaltemp, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_newRelfilenodeSubid, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_smgr, RelationData::rd_tableam, RelationCacheInsert, RelationGetRelid, RelationInitLockInfo(), RelationInitPhysicalAddr(), RelationMapUpdateMap(), TupleDescData::tdrefcount, TupleDescData::tdtypeid, TupleDescData::tdtypmod, and TupleDescAttr.

Referenced by RelationCacheInitializePhase2(), and RelationCacheInitializePhase3().

1812 {
1813  Relation relation;
1814  int i;
1815  bool has_not_null;
1816 
1817  /*
1818  * allocate new relation desc, clear all fields of reldesc
1819  */
1820  relation = (Relation) palloc0(sizeof(RelationData));
1821 
1822  /* make sure relation is marked as having no open file yet */
1823  relation->rd_smgr = NULL;
1824 
1825  /*
1826  * initialize reference count: 1 because it is nailed in cache
1827  */
1828  relation->rd_refcnt = 1;
1829 
1830  /*
1831  * all entries built with this routine are nailed-in-cache; none are for
1832  * new or temp relations.
1833  */
1834  relation->rd_isnailed = true;
1839  relation->rd_backend = InvalidBackendId;
1840  relation->rd_islocaltemp = false;
1841 
1842  /*
1843  * initialize relation tuple form
1844  *
1845  * The data we insert here is pretty incomplete/bogus, but it'll serve to
1846  * get us launched. RelationCacheInitializePhase3() will read the real
1847  * data from pg_class and replace what we've done here. Note in
1848  * particular that relowner is left as zero; this cues
1849  * RelationCacheInitializePhase3 that the real data isn't there yet.
1850  */
1852 
1853  namestrcpy(&relation->rd_rel->relname, relationName);
1854  relation->rd_rel->relnamespace = PG_CATALOG_NAMESPACE;
1855  relation->rd_rel->reltype = relationReltype;
1856 
1857  /*
1858  * It's important to distinguish between shared and non-shared relations,
1859  * even at bootstrap time, to make sure we know where they are stored.
1860  */
1861  relation->rd_rel->relisshared = isshared;
1862  if (isshared)
1863  relation->rd_rel->reltablespace = GLOBALTABLESPACE_OID;
1864 
1865  /* formrdesc is used only for permanent relations */
1866  relation->rd_rel->relpersistence = RELPERSISTENCE_PERMANENT;
1867 
1868  /* ... and they're always populated, too */
1869  relation->rd_rel->relispopulated = true;
1870 
1871  relation->rd_rel->relreplident = REPLICA_IDENTITY_NOTHING;
1872  relation->rd_rel->relpages = 0;
1873  relation->rd_rel->reltuples = 0;
1874  relation->rd_rel->relallvisible = 0;
1875  relation->rd_rel->relkind = RELKIND_RELATION;
1876  relation->rd_rel->relnatts = (int16) natts;
1877  relation->rd_rel->relam = HEAP_TABLE_AM_OID;
1878 
1879  /*
1880  * initialize attribute tuple form
1881  *
1882  * Unlike the case with the relation tuple, this data had better be right
1883  * because it will never be replaced. The data comes from
1884  * src/include/catalog/ headers via genbki.pl.
1885  */
1886  relation->rd_att = CreateTemplateTupleDesc(natts);
1887  relation->rd_att->tdrefcount = 1; /* mark as refcounted */
1888 
1889  relation->rd_att->tdtypeid = relationReltype;
1890  relation->rd_att->tdtypmod = -1; /* just to be sure */
1891 
1892  /*
1893  * initialize tuple desc info
1894  */
1895  has_not_null = false;
1896  for (i = 0; i < natts; i++)
1897  {
1898  memcpy(TupleDescAttr(relation->rd_att, i),
1899  &attrs[i],
1901  has_not_null |= attrs[i].attnotnull;
1902  /* make sure attcacheoff is valid */
1903  TupleDescAttr(relation->rd_att, i)->attcacheoff = -1;
1904  }
1905 
1906  /* initialize first attribute's attcacheoff, cf RelationBuildTupleDesc */
1907  TupleDescAttr(relation->rd_att, 0)->attcacheoff = 0;
1908 
1909  /* mark not-null status */
1910  if (has_not_null)
1911  {
1912  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
1913 
1914  constr->has_not_null = true;
1915  relation->rd_att->constr = constr;
1916  }
1917 
1918  /*
1919  * initialize relation id from info in att array (my, this is ugly)
1920  */
1921  RelationGetRelid(relation) = TupleDescAttr(relation->rd_att, 0)->attrelid;
1922 
1923  /*
1924  * All relations made with formrdesc are mapped. This is necessarily so
1925  * because there is no other way to know what filenode they currently
1926  * have. In bootstrap mode, add them to the initial relation mapper data,
1927  * specifying that the initial filenode is the same as the OID.
1928  */
1929  relation->rd_rel->relfilenode = InvalidOid;
1932  RelationGetRelid(relation),
1933  isshared, true);
1934 
1935  /*
1936  * initialize the relation lock manager information
1937  */
1938  RelationInitLockInfo(relation); /* see lmgr.c */
1939 
1940  /*
1941  * initialize physical addressing information for the relation
1942  */
1943  RelationInitPhysicalAddr(relation);
1944 
1945  /*
1946  * initialize the table am handler
1947  */
1948  relation->rd_rel->relam = HEAP_TABLE_AM_OID;
1949  relation->rd_tableam = GetHeapamTableAmRoutine();
1950 
1951  /*
1952  * initialize the rel-has-index flag, using hardwired knowledge
1953  */
1955  {
1956  /* In bootstrap mode, we have no indexes */
1957  relation->rd_rel->relhasindex = false;
1958  }
1959  else
1960  {
1961  /* Otherwise, all the rels formrdesc is used for have indexes */
1962  relation->rd_rel->relhasindex = true;
1963  }
1964 
1965  /*
1966  * add new reldesc to relcache
1967  */
1968  RelationCacheInsert(relation, false);
1969 
1970  /* It's fully valid */
1971  relation->rd_isvalid = true;
1972 }
signed short int16
Definition: c.h:354
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
bool rd_isnailed
Definition: rel.h:61
bool rd_islocaltemp
Definition: rel.h:60
bool rd_isvalid
Definition: rel.h:62
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
Form_pg_class rd_rel
Definition: rel.h:109
int namestrcpy(Name name, const char *str)
Definition: name.c:250
struct RelationData * Relation
Definition: relcache.h:27
int32 tdtypmod
Definition: tupdesc.h:83
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1274
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:71
TupleConstr * constr
Definition: tupdesc.h:85
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:185
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
#define InvalidBackendId
Definition: backendid.h:23
void * palloc0(Size size)
Definition: mcxt.c:980
const struct TableAmRoutine * rd_tableam
Definition: rel.h:171
TupleDesc rd_att
Definition: rel.h:110
#define InvalidOid
Definition: postgres_ext.h:36
#define RelationCacheInsert(RELATION, replace_allowed)
Definition: relcache.c:188
#define CLASS_TUPLE_SIZE
Definition: pg_class.h:145
BackendId rd_backend
Definition: rel.h:59
#define InvalidSubTransactionId
Definition: c.h:519
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
Oid tdtypeid
Definition: tupdesc.h:82
int rd_refcnt
Definition: rel.h:58
int i
int tdrefcount
Definition: tupdesc.h:84
bool has_not_null
Definition: tupdesc.h:44
#define RelationGetRelid(relation)
Definition: rel.h:456
SubTransactionId rd_droppedSubid
Definition: rel.h:107
void RelationMapUpdateMap(Oid relationId, Oid fileNode, bool shared, bool immediate)
Definition: relmapper.c:261
const TableAmRoutine * GetHeapamTableAmRoutine(void)

◆ GetPgClassDescriptor()

static TupleDesc GetPgClassDescriptor ( void  )
static

Definition at line 4205 of file relcache.c.

References BuildHardcodedDescriptor(), and Desc_pg_class.

Referenced by RelationParseRelOptions().

4206 {
4207  static TupleDesc pgclassdesc = NULL;
4208 
4209  /* Already done? */
4210  if (pgclassdesc == NULL)
4211  pgclassdesc = BuildHardcodedDescriptor(Natts_pg_class,
4212  Desc_pg_class);
4213 
4214  return pgclassdesc;
4215 }
static TupleDesc BuildHardcodedDescriptor(int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:4175
static const FormData_pg_attribute Desc_pg_class[Natts_pg_class]
Definition: relcache.c:108

◆ GetPgIndexDescriptor()

static TupleDesc GetPgIndexDescriptor ( void  )
static

Definition at line 4218 of file relcache.c.

References BuildHardcodedDescriptor(), and Desc_pg_index.

Referenced by RelationGetDummyIndexExpressions(), RelationGetIndexAttrBitmap(), RelationGetIndexExpressions(), RelationGetIndexPredicate(), and RelationInitIndexAccessInfo().

4219 {
4220  static TupleDesc pgindexdesc = NULL;
4221 
4222  /* Already done? */
4223  if (pgindexdesc == NULL)
4224  pgindexdesc = BuildHardcodedDescriptor(Natts_pg_index,
4225  Desc_pg_index);
4226 
4227  return pgindexdesc;
4228 }
static const FormData_pg_attribute Desc_pg_index[Natts_pg_index]
Definition: relcache.c:115
static TupleDesc BuildHardcodedDescriptor(int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:4175

◆ GetRelationPublicationActions()

struct PublicationActions* GetRelationPublicationActions ( Relation  relation)

Definition at line 5299 of file relcache.c.

References CacheMemoryContext, elog, ERROR, get_partition_ancestors(), GetAllTablesPublications(), GetRelationPublications(), GETSTRUCT, HeapTupleIsValid, is_publishable_relation(), lfirst_oid, list_concat_unique_oid(), MemoryContextSwitchTo(), ObjectIdGetDatum, palloc(), palloc0(), pfree(), PublicationActions::pubdelete, PublicationActions::pubinsert, PUBLICATIONOID, PublicationActions::pubtruncate, PublicationActions::pubupdate, RelationData::rd_pubactions, RelationData::rd_rel, RelationGetRelid, ReleaseSysCache(), and SearchSysCache1().

Referenced by CheckCmdReplicaIdentity().

5300 {
5301  List *puboids;
5302  ListCell *lc;
5303  MemoryContext oldcxt;
5304  PublicationActions *pubactions = palloc0(sizeof(PublicationActions));
5305 
5306  /*
5307  * If not publishable, it publishes no actions. (pgoutput_change() will
5308  * ignore it.)
5309  */
5310  if (!is_publishable_relation(relation))
5311  return pubactions;
5312 
5313  if (relation->rd_pubactions)
5314  return memcpy(pubactions, relation->rd_pubactions,
5315  sizeof(PublicationActions));
5316 
5317  /* Fetch the publication membership info. */
5318  puboids = GetRelationPublications(RelationGetRelid(relation));
5319  if (relation->rd_rel->relispartition)
5320  {
5321  /* Add publications that the ancestors are in too. */
5322  List *ancestors = get_partition_ancestors(RelationGetRelid(relation));
5323  ListCell *lc;
5324 
5325  foreach(lc, ancestors)
5326  {
5327  Oid ancestor = lfirst_oid(lc);
5328 
5329  puboids = list_concat_unique_oid(puboids,
5330  GetRelationPublications(ancestor));
5331  }
5332  }
5333  puboids = list_concat_unique_oid(puboids, GetAllTablesPublications());
5334 
5335  foreach(lc, puboids)
5336  {
5337  Oid pubid = lfirst_oid(lc);
5338  HeapTuple tup;
5339  Form_pg_publication pubform;
5340 
5342 
5343  if (!HeapTupleIsValid(tup))
5344  elog(ERROR, "cache lookup failed for publication %u", pubid);
5345 
5346  pubform = (Form_pg_publication) GETSTRUCT(tup);
5347 
5348  pubactions->pubinsert |= pubform->pubinsert;
5349  pubactions->pubupdate |= pubform->pubupdate;
5350  pubactions->pubdelete |= pubform->pubdelete;
5351  pubactions->pubtruncate |= pubform->pubtruncate;
5352 
5353  ReleaseSysCache(tup);
5354 
5355  /*
5356  * If we know everything is replicated, there is no point to check for
5357  * other publications.
5358  */
5359  if (pubactions->pubinsert && pubactions->pubupdate &&
5360  pubactions->pubdelete && pubactions->pubtruncate)
5361  break;
5362  }
5363 
5364  if (relation->rd_pubactions)
5365  {
5366  pfree(relation->rd_pubactions);
5367  relation->rd_pubactions = NULL;
5368  }
5369 
5370  /* Now save copy of the actions in the relcache entry. */
5372  relation->rd_pubactions = palloc(sizeof(PublicationActions));
5373  memcpy(relation->rd_pubactions, pubactions, sizeof(PublicationActions));
5374  MemoryContextSwitchTo(oldcxt);
5375 
5376  return pubactions;
5377 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
PublicationActions * rd_pubactions
Definition: rel.h:150
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
List * GetRelationPublications(Oid relid)
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
List * list_concat_unique_oid(List *list1, const List *list2)
Definition: list.c:1301
bool is_publishable_relation(Relation rel)
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void * palloc0(Size size)
Definition: mcxt.c:980
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * GetAllTablesPublications(void)
void * palloc(Size size)
Definition: mcxt.c:949
#define elog(elevel,...)
Definition: elog.h:214
FormData_pg_publication * Form_pg_publication
Definition: pg_list.h:50
List * get_partition_ancestors(Oid relid)
Definition: partition.c:115
#define RelationGetRelid(relation)
Definition: rel.h:456
#define lfirst_oid(lc)
Definition: pg_list.h:192
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ IndexSupportInitialize()

static void IndexSupportInitialize ( oidvector indclass,
RegProcedure indexSupport,
Oid opFamily,
Oid opcInType,
StrategyNumber  maxSupportNumber,
AttrNumber  maxAttributeNumber 
)
static

Definition at line 1535 of file relcache.c.

References elog, ERROR, LookupOpclassInfo(), OidIsValid, opclasscacheent::opcfamily, opclasscacheent::opcintype, opclasscacheent::supportProcs, and oidvector::values.

Referenced by RelationInitIndexAccessInfo().

1541 {
1542  int attIndex;
1543 
1544  for (attIndex = 0; attIndex < maxAttributeNumber; attIndex++)
1545  {
1546  OpClassCacheEnt *opcentry;
1547 
1548  if (!OidIsValid(indclass->values[attIndex]))
1549  elog(ERROR, "bogus pg_index tuple");
1550 
1551  /* look up the info for this opclass, using a cache */
1552  opcentry = LookupOpclassInfo(indclass->values[attIndex],
1553  maxSupportNumber);
1554 
1555  /* copy cached data into relcache entry */
1556  opFamily[attIndex] = opcentry->opcfamily;
1557  opcInType[attIndex] = opcentry->opcintype;
1558  if (maxSupportNumber > 0)
1559  memcpy(&indexSupport[attIndex * maxSupportNumber],
1560  opcentry->supportProcs,
1561  maxSupportNumber * sizeof(RegProcedure));
1562  }
1563 }
regproc RegProcedure
Definition: c.h:511
#define OidIsValid(objectId)
Definition: c.h:644
#define ERROR
Definition: elog.h:43
RegProcedure * supportProcs
Definition: relcache.c:247
static OpClassCacheEnt * LookupOpclassInfo(Oid operatorClassOid, StrategyNumber numSupport)
Definition: relcache.c:1586
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:602
#define elog(elevel,...)
Definition: elog.h:214

◆ InitIndexAmRoutine()

static void InitIndexAmRoutine ( Relation  relation)
static

Definition at line 1341 of file relcache.c.

References GetIndexAmRoutine(), MemoryContextAlloc(), pfree(), RelationData::rd_amhandler, RelationData::rd_indam, and RelationData::rd_indexcxt.

Referenced by load_relcache_init_file(), and RelationInitIndexAccessInfo().

1342 {
1343  IndexAmRoutine *cached,
1344  *tmp;
1345 
1346  /*
1347  * Call the amhandler in current, short-lived memory context, just in case
1348  * it leaks anything (it probably won't, but let's be paranoid).
1349  */
1350  tmp = GetIndexAmRoutine(relation->rd_amhandler);
1351 
1352  /* OK, now transfer the data into relation's rd_indexcxt. */
1353  cached = (IndexAmRoutine *) MemoryContextAlloc(relation->rd_indexcxt,
1354  sizeof(IndexAmRoutine));
1355  memcpy(cached, tmp, sizeof(IndexAmRoutine));
1356  relation->rd_indam = cached;
1357 
1358  pfree(tmp);
1359 }
struct IndexAmRoutine * rd_indam
Definition: rel.h:188
void pfree(void *pointer)
Definition: mcxt.c:1056
Oid rd_amhandler
Definition: rel.h:166
IndexAmRoutine * GetIndexAmRoutine(Oid amhandler)
Definition: amapi.c:33
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:796
MemoryContext rd_indexcxt
Definition: rel.h:186

◆ InitTableAmRoutine()

static void InitTableAmRoutine ( Relation  relation)
static

Definition at line 1736 of file relcache.c.

References GetTableAmRoutine(), RelationData::rd_amhandler, and RelationData::rd_tableam.

Referenced by RelationInitTableAccessMethod().

1737 {
1738  relation->rd_tableam = GetTableAmRoutine(relation->rd_amhandler);
1739 }
Oid rd_amhandler
Definition: rel.h:166
const TableAmRoutine * GetTableAmRoutine(Oid amhandler)
Definition: tableamapi.c:34
const struct TableAmRoutine * rd_tableam
Definition: rel.h:171

◆ load_critical_index()

static void load_critical_index ( Oid  indexoid,
Oid  heapoid 
)
static

Definition at line 4139 of file relcache.c.

References AccessShareLock, elog, LockRelationOid(), PANIC, RelationData::rd_isnailed, RelationData::rd_refcnt, RelationBuildDesc(), RelationGetIndexAttOptions(), and UnlockRelationOid().

Referenced by RelationCacheInitializePhase3().

4140 {
4141  Relation ird;
4142 
4143  /*
4144  * We must lock the underlying catalog before locking the index to avoid
4145  * deadlock, since RelationBuildDesc might well need to read the catalog,
4146  * and if anyone else is exclusive-locking this catalog and index they'll
4147  * be doing it in that order.
4148  */
4149  LockRelationOid(heapoid, AccessShareLock);
4150  LockRelationOid(indexoid, AccessShareLock);
4151  ird = RelationBuildDesc(indexoid, true);
4152  if (ird == NULL)
4153  elog(PANIC, "could not open critical system index %u", indexoid);
4154  ird->rd_isnailed = true;
4155  ird->rd_refcnt = 1;
4158 
4159  (void) RelationGetIndexAttOptions(ird, false);
4160 }
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:199
bool rd_isnailed
Definition: rel.h:61
#define AccessShareLock
Definition: lockdefs.h:36
#define PANIC
Definition: elog.h:53
static Relation RelationBuildDesc(Oid targetRelId, bool insertIt)
Definition: relcache.c:1028
int rd_refcnt
Definition: rel.h:58
#define elog(elevel,...)
Definition: elog.h:214
bytea ** RelationGetIndexAttOptions(Relation relation, bool copy)
Definition: relcache.c:5429
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:108

◆ load_relcache_init_file()

static bool load_relcache_init_file ( bool  shared)
static

Definition at line 5608 of file relcache.c.

References AllocateFile(), ALLOCSET_SMALL_SIZES, AllocSetContextCreate, IndexAmRoutine::amsupport, Assert, ATTRIBUTE_FIXED_PART_SIZE, CacheMemoryContext, TupleDescData::constr, CreateTemplateTupleDesc(), criticalRelcachesBuilt, criticalSharedRelcachesBuilt, DatabasePath, elog, FreeFile(), GETSTRUCT, TupleConstr::has_not_null, HEAPTUPLESIZE, i, InitIndexAmRoutine(), InvalidOid, InvalidSubTransactionId, MAXPGPATH, MemoryContextAlloc(), MemoryContextAllocZero(), MemoryContextCopyAndSetIdentifier, MemSet, NIL, NUM_CRITICAL_LOCAL_INDEXES, NUM_CRITICAL_LOCAL_RELS, NUM_CRITICAL_SHARED_INDEXES, NUM_CRITICAL_SHARED_RELS, palloc(), palloc0(), pfree(), PG_BINARY_R, RelationData::pgstat_info, RelationData::rd_amcache, RelationData::rd_att, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_exclops, RelationData::rd_exclprocs, RelationData::rd_exclstrats, RelationData::rd_fdwroutine, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_fkeylist, RelationData::rd_fkeyvalid, RelationData::rd_idattr, RelationData::rd_indam, RelationData::rd_indcollation, RelationData::rd_index, RelationData::rd_indexattr, RelationData::rd_indexcxt, RelationData::rd_indexlist, RelationData::rd_indexprs, RelationData::rd_indextuple, RelationData::rd_indexvalid, RelationData::rd_indoption, RelationData::rd_indpred, RelationData::rd_isnailed, RelationData::rd_keyattr, RelationData::rd_newRelfilenodeSubid, RelationData::rd_opcintype, RelationData::rd_opcoptions, RelationData::rd_opfamily, RelationData::rd_options, RelationData::rd_partcheck, RelationData::rd_partcheckcxt, RelationData::rd_partcheckvalid, RelationData::rd_partdesc, RelationData::rd_partkey, RelationData::rd_partkeycxt, RelationData::rd_pdcxt, RelationData::rd_pkattr, RelationData::rd_pkindex, RelationData::rd_pubactions, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_replidindex, RelationData::rd_rsdesc, RelationData::rd_rules, RelationData::rd_rulescxt, RelationData::rd_smgr, RelationData::rd_statlist, RelationData::rd_statvalid, RelationData::rd_support, RelationData::rd_supportinfo, RelationCacheInsert, RelationGetRelationName, RelationInitLockInfo(), RelationInitPhysicalAddr(), RelationInitTableAccessMethod(), RELCACHE_INIT_FILEMAGIC, RELCACHE_INIT_FILENAME, repalloc(), snprintf, HeapTupleData::t_data, TupleDescData::tdrefcount, TupleDescData::tdtypeid, TupleDescData::tdtypmod, RelationData::trigdesc, TupleDescAttr, VARSIZE, and WARNING.

Referenced by RelationCacheInitializePhase2(), and RelationCacheInitializePhase3().

5609 {
5610  FILE *fp;
5611  char initfilename[MAXPGPATH];
5612  Relation *rels;
5613  int relno,
5614  num_rels,
5615  max_rels,
5616  nailed_rels,
5617  nailed_indexes,
5618  magic;
5619  int i;
5620 
5621  if (shared)
5622  snprintf(initfilename, sizeof(initfilename), "global/%s",
5624  else
5625  snprintf(initfilename, sizeof(initfilename), "%s/%s",
5627 
5628  fp = AllocateFile(initfilename, PG_BINARY_R);
5629  if (fp == NULL)
5630  return false;
5631 
5632  /*
5633  * Read the index relcache entries from the file. Note we will not enter
5634  * any of them into the cache if the read fails partway through; this
5635  * helps to guard against broken init files.
5636  */
5637  max_rels = 100;
5638  rels = (Relation *) palloc(max_rels * sizeof(Relation));
5639  num_rels = 0;
5640  nailed_rels = nailed_indexes = 0;
5641 
5642  /* check for correct magic number (compatible version) */
5643  if (fread(&magic, 1, sizeof(magic), fp) != sizeof(magic))
5644  goto read_failed;
5645  if (magic != RELCACHE_INIT_FILEMAGIC)
5646  goto read_failed;
5647 
5648  for (relno = 0;; relno++)
5649  {
5650  Size len;
5651  size_t nread;
5652  Relation rel;
5653  Form_pg_class relform;
5654  bool has_not_null;
5655 
5656  /* first read the relation descriptor length */
5657  nread = fread(&len, 1, sizeof(len), fp);
5658  if (nread != sizeof(len))
5659  {
5660  if (nread == 0)
5661  break; /* end of file */
5662  goto read_failed;
5663  }
5664 
5665  /* safety check for incompatible relcache layout */
5666  if (len != sizeof(RelationData))
5667  goto read_failed;
5668 
5669  /* allocate another relcache header */
5670  if (num_rels >= max_rels)
5671  {
5672  max_rels *= 2;
5673  rels = (Relation *) repalloc(rels, max_rels * sizeof(Relation));
5674  }
5675 
5676  rel = rels[num_rels++] = (Relation) palloc(len);
5677 
5678  /* then, read the Relation structure */
5679  if (fread(rel, 1, len, fp) != len)
5680  goto read_failed;
5681 
5682  /* next read the relation tuple form */
5683  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5684  goto read_failed;
5685 
5686  relform = (Form_pg_class) palloc(len);
5687  if (fread(relform, 1, len, fp) != len)
5688  goto read_failed;
5689 
5690  rel->rd_rel = relform;
5691 
5692  /* initialize attribute tuple forms */
5693  rel->rd_att = CreateTemplateTupleDesc(relform->relnatts);
5694  rel->rd_att->tdrefcount = 1; /* mark as refcounted */
5695 
5696  rel->rd_att->tdtypeid = relform->reltype ? relform->reltype : RECORDOID;
5697  rel->rd_att->tdtypmod = -1; /* just to be sure */
5698 
5699  /* next read all the attribute tuple form data entries */
5700  has_not_null = false;
5701  for (i = 0; i < relform->relnatts; i++)
5702  {
5703  Form_pg_attribute attr = TupleDescAttr(rel->rd_att, i);
5704 
5705  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5706  goto read_failed;
5707  if (len != ATTRIBUTE_FIXED_PART_SIZE)
5708  goto read_failed;
5709  if (fread(attr, 1, len, fp) != len)
5710  goto read_failed;
5711 
5712  has_not_null |= attr->attnotnull;
5713  }
5714 
5715  /* next read the access method specific field */
5716  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5717  goto read_failed;
5718  if (len > 0)
5719  {
5720  rel->rd_options = palloc(len);
5721  if (fread(rel->rd_options, 1, len, fp) != len)
5722  goto read_failed;
5723  if (len != VARSIZE(rel->rd_options))
5724  goto read_failed; /* sanity check */
5725  }
5726  else
5727  {
5728  rel->rd_options = NULL;
5729  }
5730 
5731  /* mark not-null status */
5732  if (has_not_null)
5733  {
5734  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
5735 
5736  constr->has_not_null = true;
5737  rel->rd_att->constr = constr;
5738  }
5739 
5740  /*
5741  * If it's an index, there's more to do. Note we explicitly ignore
5742  * partitioned indexes here.
5743  */
5744  if (rel->rd_rel->relkind == RELKIND_INDEX)
5745  {
5746  MemoryContext indexcxt;
5747  Oid *opfamily;
5748  Oid *opcintype;
5749  RegProcedure *support;
5750  int nsupport;
5751  int16 *indoption;
5752  Oid *indcollation;
5753 
5754  /* Count nailed indexes to ensure we have 'em all */
5755  if (rel->rd_isnailed)
5756  nailed_indexes++;
5757 
5758  /* next, read the pg_index tuple */
5759  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5760  goto read_failed;
5761 
5762  rel->rd_indextuple = (HeapTuple) palloc(len);
5763  if (fread(rel->rd_indextuple, 1, len, fp) != len)
5764  goto read_failed;
5765 
5766  /* Fix up internal pointers in the tuple -- see heap_copytuple */
5767  rel->rd_indextuple->t_data = (HeapTupleHeader) ((char *) rel->rd_indextuple + HEAPTUPLESIZE);
5769 
5770  /*
5771  * prepare index info context --- parameters should match
5772  * RelationInitIndexAccessInfo
5773  */
5775  "index info",
5777  rel->rd_indexcxt = indexcxt;
5780 
5781  /*
5782  * Now we can fetch the index AM's API struct. (We can't store
5783  * that in the init file, since it contains function pointers that
5784  * might vary across server executions. Fortunately, it should be
5785  * safe to call the amhandler even while bootstrapping indexes.)
5786  */
5787  InitIndexAmRoutine(rel);
5788 
5789  /* next, read the vector of opfamily OIDs */
5790  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5791  goto read_failed;
5792 
5793  opfamily = (Oid *) MemoryContextAlloc(indexcxt, len);
5794  if (fread(opfamily, 1, len, fp) != len)
5795  goto read_failed;
5796 
5797  rel->rd_opfamily = opfamily;
5798 
5799  /* next, read the vector of opcintype OIDs */
5800  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5801  goto read_failed;
5802 
5803  opcintype = (Oid *) MemoryContextAlloc(indexcxt, len);
5804  if (fread(opcintype, 1, len, fp) != len)
5805  goto read_failed;
5806 
5807  rel->rd_opcintype = opcintype;
5808 
5809  /* next, read the vector of support procedure OIDs */
5810  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5811  goto read_failed;
5812  support = (RegProcedure *) MemoryContextAlloc(indexcxt, len);
5813  if (fread(support, 1, len, fp) != len)
5814  goto read_failed;
5815 
5816  rel->rd_support = support;
5817 
5818  /* next, read the vector of collation OIDs */
5819  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5820  goto read_failed;
5821 
5822  indcollation = (Oid *) MemoryContextAlloc(indexcxt, len);
5823  if (fread(indcollation, 1, len, fp) != len)
5824  goto read_failed;
5825 
5826  rel->rd_indcollation = indcollation;
5827 
5828  /* finally, read the vector of indoption values */
5829  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5830  goto read_failed;
5831 
5832  indoption = (int16 *) MemoryContextAlloc(indexcxt, len);
5833  if (fread(indoption, 1, len, fp) != len)
5834  goto read_failed;
5835 
5836  rel->rd_indoption = indoption;
5837 
5838  /* finally, read the vector of opcoptions values */
5839  rel->rd_opcoptions = (bytea **)
5840  MemoryContextAllocZero(indexcxt, sizeof(*rel->rd_opcoptions) * relform->relnatts);
5841 
5842  for (i = 0; i < relform->relnatts; i++)
5843  {
5844  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
5845  goto read_failed;
5846 
5847  if (len > 0)
5848  {
5849  rel->rd_opcoptions[i] = (bytea *) MemoryContextAlloc(indexcxt, len);
5850  if (fread(rel->rd_opcoptions[i], 1, len, fp) != len)
5851  goto read_failed;
5852  }
5853  }
5854 
5855  /* set up zeroed fmgr-info vector */
5856  nsupport = relform->relnatts * rel->rd_indam->amsupport;
5857  rel->rd_supportinfo = (FmgrInfo *)
5858  MemoryContextAllocZero(indexcxt, nsupport * sizeof(FmgrInfo));
5859  }
5860  else
5861  {
5862  /* Count nailed rels to ensure we have 'em all */
5863  if (rel->rd_isnailed)
5864  nailed_rels++;
5865 
5866  /* Load table AM data */
5867  if (rel->rd_rel->relkind == RELKIND_RELATION ||
5868  rel->rd_rel->relkind == RELKIND_SEQUENCE ||
5869  rel->rd_rel->relkind == RELKIND_TOASTVALUE ||
5870  rel->rd_rel->relkind == RELKIND_MATVIEW)
5872 
5873  Assert(rel->rd_index == NULL);
5874  Assert(rel->rd_indextuple == NULL);
5875  Assert(rel->rd_indexcxt == NULL);
5876  Assert(rel->rd_indam == NULL);
5877  Assert(rel->rd_opfamily == NULL);
5878  Assert(rel->rd_opcintype == NULL);
5879  Assert(rel->rd_support == NULL);
5880  Assert(rel->rd_supportinfo == NULL);
5881  Assert(rel->rd_indoption == NULL);
5882  Assert(rel->rd_indcollation == NULL);
5883  Assert(rel->rd_opcoptions == NULL);
5884  }
5885 
5886  /*
5887  * Rules and triggers are not saved (mainly because the internal
5888  * format is complex and subject to change). They must be rebuilt if
5889  * needed by RelationCacheInitializePhase3. This is not expected to
5890  * be a big performance hit since few system catalogs have such. Ditto
5891  * for RLS policy data, partition info, index expressions, predicates,
5892  * exclusion info, and FDW info.
5893  */
5894  rel->rd_rules = NULL;
5895  rel->rd_rulescxt = NULL;
5896  rel->trigdesc = NULL;
5897  rel->rd_rsdesc = NULL;
5898  rel->rd_partkey = NULL;
5899  rel->rd_partkeycxt = NULL;
5900  rel->rd_partdesc = NULL;
5901  rel->rd_pdcxt = NULL;
5902  rel->rd_partcheck = NIL;
5903  rel->rd_partcheckvalid = false;
5904  rel->rd_partcheckcxt = NULL;
5905  rel->rd_indexprs = NIL;
5906  rel->rd_indpred = NIL;
5907  rel->rd_exclops = NULL;
5908  rel->rd_exclprocs = NULL;
5909  rel->rd_exclstrats = NULL;
5910  rel->rd_fdwroutine = NULL;
5911 
5912  /*
5913  * Reset transient-state fields in the relcache entry
5914  */
5915  rel->rd_smgr = NULL;
5916  if (rel->rd_isnailed)
5917  rel->rd_refcnt = 1;
5918  else
5919  rel->rd_refcnt = 0;
5920  rel->rd_indexvalid = false;
5921  rel->rd_indexlist = NIL;
5922  rel->rd_pkindex = InvalidOid;
5923  rel->rd_replidindex = InvalidOid;
5924  rel->rd_indexattr = NULL;
5925  rel->rd_keyattr = NULL;
5926  rel->rd_pkattr = NULL;
5927  rel->rd_idattr = NULL;
5928  rel->rd_pubactions = NULL;
5929  rel->rd_statvalid = false;
5930  rel->rd_statlist = NIL;
5931  rel->rd_fkeyvalid = false;
5932  rel->rd_fkeylist = NIL;
5937  rel->rd_amcache = NULL;
5938  MemSet(&rel->pgstat_info, 0, sizeof(rel->pgstat_info));
5939 
5940  /*
5941  * Recompute lock and physical addressing info. This is needed in
5942  * case the pg_internal.init file was copied from some other database
5943  * by CREATE DATABASE.
5944  */
5945  RelationInitLockInfo(rel);
5947  }
5948 
5949  /*
5950  * We reached the end of the init file without apparent problem. Did we
5951  * get the right number of nailed items? This is a useful crosscheck in
5952  * case the set of critical rels or indexes changes. However, that should
5953  * not happen in a normally-running system, so let's bleat if it does.
5954  *
5955  * For the shared init file, we're called before client authentication is
5956  * done, which means that elog(WARNING) will go only to the postmaster
5957  * log, where it's easily missed. To ensure that developers notice bad
5958  * values of NUM_CRITICAL_SHARED_RELS/NUM_CRITICAL_SHARED_INDEXES, we put
5959  * an Assert(false) there.
5960  */
5961  if (shared)
5962  {
5963  if (nailed_rels != NUM_CRITICAL_SHARED_RELS ||
5964  nailed_indexes != NUM_CRITICAL_SHARED_INDEXES)
5965  {
5966  elog(WARNING, "found %d nailed shared rels and %d nailed shared indexes in init file, but expected %d and %d respectively",
5967  nailed_rels, nailed_indexes,
5969  /* Make sure we get developers' attention about this */
5970  Assert(false);
5971  /* In production builds, recover by bootstrapping the relcache */
5972  goto read_failed;
5973  }
5974  }
5975  else
5976  {
5977  if (nailed_rels != NUM_CRITICAL_LOCAL_RELS ||
5978  nailed_indexes != NUM_CRITICAL_LOCAL_INDEXES)
5979  {
5980  elog(WARNING, "found %d nailed rels and %d nailed indexes in init file, but expected %d and %d respectively",
5981  nailed_rels, nailed_indexes,
5983  /* We don't need an Assert() in this case */
5984  goto read_failed;
5985  }
5986  }
5987 
5988  /*
5989  * OK, all appears well.
5990  *
5991  * Now insert all the new relcache entries into the cache.
5992  */
5993  for (relno = 0; relno < num_rels; relno++)
5994  {
5995  RelationCacheInsert(rels[relno], false);
5996  }
5997 
5998  pfree(rels);
5999  FreeFile(fp);
6000 
6001  if (shared)
6003  else
6004  criticalRelcachesBuilt = true;
6005  return true;
6006 
6007  /*
6008  * init file is broken, so do it the hard way. We don't bother trying to
6009  * free the clutter we just allocated; it's not in the relcache so it
6010  * won't hurt.
6011  */
6012 read_failed:
6013  pfree(rels);
6014  FreeFile(fp);
6015 
6016  return false;
6017 }
struct FdwRoutine * rd_fdwroutine
Definition: rel.h:222
signed short int16
Definition: c.h:354
#define NIL
Definition: pg_list.h:65
struct IndexAmRoutine * rd_indam
Definition: rel.h:188
Definition: fmgr.h:56
uint16 amsupport
Definition: amapi.h:173
#define AllocSetContextCreate
Definition: memutils.h:170
HeapTupleData * HeapTuple
Definition: htup.h:71
int16 * rd_indoption
Definition: rel.h:193
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
PublicationActions * rd_pubactions
Definition: rel.h:150
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
struct FmgrInfo * rd_supportinfo
Definition: rel.h:192
Bitmapset * rd_keyattr
Definition: rel.h:146
#define VARSIZE(PTR)
Definition: postgres.h:303
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
void RelationInitTableAccessMethod(Relation relation)
Definition: relcache.c:1745
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
Oid rd_replidindex
Definition: rel.h:139
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:202
bool rd_isnailed
Definition: rel.h:61
regproc RegProcedure
Definition: c.h:511
uint16 * rd_exclstrats
Definition: rel.h:198
#define NUM_CRITICAL_LOCAL_INDEXES
List * rd_indexprs
Definition: rel.h:194
bytea ** rd_opcoptions
Definition: rel.h:200
List * rd_fkeylist
Definition: rel.h:120
bool rd_partcheckvalid
Definition: rel.h:133
#define MemSet(start, val, len)
Definition: c.h:971
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
MemoryContext rd_rulescxt
Definition: rel.h:114
bool criticalSharedRelcachesBuilt
Definition: relcache.c:143
Oid * rd_exclprocs
Definition: rel.h:197
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
#define NUM_CRITICAL_SHARED_INDEXES
#define PG_BINARY_R
Definition: c.h:1235
#define NUM_CRITICAL_SHARED_RELS
static void InitIndexAmRoutine(Relation relation)
Definition: relcache.c:1341
struct HeapTupleData * rd_indextuple
Definition: rel.h:176
HeapTupleHeader t_data
Definition: htup.h:68
struct RelationData * Relation
Definition: relcache.h:27
Form_pg_index rd_index
Definition: rel.h:174
PartitionKey rd_partkey
Definition: rel.h:124
void pfree(void *pointer)
Definition: mcxt.c:1056
#define NUM_CRITICAL_LOCAL_RELS
Oid * rd_indcollation
Definition: rel.h:199
int32 tdtypmod
Definition: tupdesc.h:83
Oid rd_pkindex
Definition: rel.h:138
#define MAXPGPATH
TriggerDesc * trigdesc
Definition: rel.h:115
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1274
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:71
#define MemoryContextCopyAndSetIdentifier(cxt, id)
Definition: memutils.h:97
TupleConstr * constr
Definition: tupdesc.h:85
FILE * AllocateFile(const char *name, const char *mode)
Definition: fd.c:2322
#define RELCACHE_INIT_FILEMAGIC
Definition: relcache.c:90
#define RelationGetRelationName(relation)
Definition: rel.h:490
List * rd_indpred
Definition: rel.h:195
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
Oid * rd_opfamily
Definition: rel.h:189
Oid * rd_exclops
Definition: rel.h:196
PartitionDesc rd_partdesc
Definition: rel.h:128
List * rd_indexlist
Definition: rel.h:137
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:185
struct RowSecurityDesc * rd_rsdesc
Definition: rel.h:117
RegProcedure * rd_support
Definition: rel.h:191
#define WARNING
Definition: elog.h:40
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
SubTransactionId rd_createSubid
Definition: rel.h:102
bool rd_indexvalid
Definition: rel.h:63
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
void * palloc0(Size size)
Definition: mcxt.c:980
TupleDesc rd_att
Definition: rel.h:110
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:839
#define InvalidOid
Definition: postgres_ext.h:36
#define RELCACHE_INIT_FILENAME
Definition: relcache.h:25
Bitmapset * rd_idattr
Definition: rel.h:148
#define RelationCacheInsert(RELATION, replace_allowed)
Definition: relcache.c:188
char * DatabasePath
Definition: globals.c:93
MemoryContext rd_pdcxt
Definition: rel.h:129
#define Assert(condition)
Definition: c.h:738
MemoryContext rd_partkeycxt
Definition: rel.h:125
RuleLock * rd_rules
Definition: rel.h:113
size_t Size
Definition: c.h:466
struct PgStat_TableStatus * pgstat_info
Definition: rel.h:236
#define InvalidSubTransactionId
Definition: c.h:519
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1069
int FreeFile(FILE *file)
Definition: fd.c:2521
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
Bitmapset * rd_pkattr
Definition: rel.h:147
Oid tdtypeid
Definition: tupdesc.h:82
bool rd_statvalid
Definition: rel.h:65
void * palloc(Size size)
Definition: mcxt.c:949
int rd_refcnt
Definition: rel.h:58
#define HEAPTUPLESIZE
Definition: htup.h:73
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:796
#define elog(elevel,...)
Definition: elog.h:214
MemoryContext rd_indexcxt
Definition: rel.h:186
int i
int tdrefcount
Definition: tupdesc.h:84
Definition: c.h:555
MemoryContext rd_partcheckcxt
Definition: rel.h:134
bool criticalRelcachesBuilt
Definition: relcache.c:137
void * rd_amcache
Definition: rel.h:211
Oid * rd_opcintype
Definition: rel.h:190
bool has_not_null
Definition: tupdesc.h:44
List * rd_statlist
Definition: rel.h:142
#define snprintf
Definition: port.h:193
bool rd_fkeyvalid
Definition: rel.h:121
List * rd_partcheck
Definition: rel.h:132
Bitmapset * rd_indexattr
Definition: rel.h:145
bytea * rd_options
Definition: rel.h:157
SubTransactionId rd_droppedSubid
Definition: rel.h:107
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ LookupOpclassInfo()

static OpClassCacheEnt * LookupOpclassInfo ( Oid  operatorClassOid,
StrategyNumber  numSupport 
)
static

Definition at line 1586 of file relcache.c.

References AccessMethodProcedureIndexId, AccessShareLock, Assert, BTEqualStrategyNumber, CacheMemoryContext, CreateCacheMemoryContext(), criticalRelcachesBuilt, elog, HASHCTL::entrysize, ERROR, GETSTRUCT, HASH_BLOBS, hash_create(), HASH_ELEM, HASH_ENTER, hash_search(), HeapTupleIsValid, HASHCTL::keysize, MemoryContextAllocZero(), MemSet, opclasscacheent::numSupport, ObjectIdGetDatum, opclasscacheent::opcfamily, opclasscacheent::opcintype, OpclassOidIndexId, ScanKeyInit(), opclasscacheent::supportProcs, systable_beginscan(), systable_endscan(), systable_getnext(), table_close(), table_open(), and opclasscacheent::valid.

Referenced by IndexSupportInitialize().

1588 {
1589  OpClassCacheEnt *opcentry;
1590  bool found;
1591  Relation rel;
1592  SysScanDesc scan;
1593  ScanKeyData skey[3];
1594  HeapTuple htup;
1595  bool indexOK;
1596 
1597  if (OpClassCache == NULL)
1598  {
1599  /* First time through: initialize the opclass cache */
1600  HASHCTL ctl;
1601 
1602  MemSet(&ctl, 0, sizeof(ctl));
1603  ctl.keysize = sizeof(Oid);
1604  ctl.entrysize = sizeof(OpClassCacheEnt);
1605  OpClassCache = hash_create("Operator class cache", 64,
1606  &ctl, HASH_ELEM | HASH_BLOBS);
1607 
1608  /* Also make sure CacheMemoryContext exists */
1609  if (!CacheMemoryContext)
1611  }
1612 
1613  opcentry = (OpClassCacheEnt *) hash_search(OpClassCache,
1614  (void *) &operatorClassOid,
1615  HASH_ENTER, &found);
1616 
1617  if (!found)
1618  {
1619  /* Need to allocate memory for new entry */
1620  opcentry->valid = false; /* until known OK */
1621  opcentry->numSupport = numSupport;
1622 
1623  if (numSupport > 0)
1624  opcentry->supportProcs = (RegProcedure *)
1626  (numSupport + 1) * sizeof(RegProcedure));
1627  else
1628  opcentry->supportProcs = NULL;
1629  }
1630  else
1631  {
1632  Assert(numSupport == opcentry->numSupport);
1633  }
1634 
1635  /*
1636  * When testing for cache-flush hazards, we intentionally disable the
1637  * operator class cache and force reloading of the info on each call. This
1638  * is helpful because we want to test the case where a cache flush occurs
1639  * while we are loading the info, and it's very hard to provoke that if
1640  * this happens only once per opclass per backend.
1641  */
1642 #if defined(CLOBBER_CACHE_ALWAYS)
1643  opcentry->valid = false;
1644 #endif
1645 
1646  if (opcentry->valid)
1647  return opcentry;
1648 
1649  /*
1650  * Need to fill in new entry.
1651  *
1652  * To avoid infinite recursion during startup, force heap scans if we're
1653  * looking up info for the opclasses used by the indexes we would like to
1654  * reference here.
1655  */
1656  indexOK = criticalRelcachesBuilt ||
1657  (operatorClassOid != OID_BTREE_OPS_OID &&
1658  operatorClassOid != INT2_BTREE_OPS_OID);
1659 
1660  /*
1661  * We have to fetch the pg_opclass row to determine its opfamily and
1662  * opcintype, which are needed to look up related operators and functions.
1663  * It'd be convenient to use the syscache here, but that probably doesn't
1664  * work while bootstrapping.
1665  */
1666  ScanKeyInit(&skey[0],
1667  Anum_pg_opclass_oid,
1668  BTEqualStrategyNumber, F_OIDEQ,
1669  ObjectIdGetDatum(operatorClassOid));
1670  rel = table_open(OperatorClassRelationId, AccessShareLock);
1671  scan = systable_beginscan(rel, OpclassOidIndexId, indexOK,
1672  NULL, 1, skey);
1673 
1674  if (HeapTupleIsValid(htup = systable_getnext(scan)))
1675  {
1676  Form_pg_opclass opclassform = (Form_pg_opclass) GETSTRUCT(htup);
1677 
1678  opcentry->opcfamily = opclassform->opcfamily;
1679  opcentry->opcintype = opclassform->opcintype;
1680  }
1681  else
1682  elog(ERROR, "could not find tuple for opclass %u", operatorClassOid);
1683 
1684  systable_endscan(scan);
1686 
1687  /*
1688  * Scan pg_amproc to obtain support procs for the opclass. We only fetch
1689  * the default ones (those with lefttype = righttype = opcintype).
1690  */
1691  if (numSupport > 0)
1692  {
1693  ScanKeyInit(&skey[0],
1694  Anum_pg_amproc_amprocfamily,
1695  BTEqualStrategyNumber, F_OIDEQ,
1696  ObjectIdGetDatum(opcentry->opcfamily));
1697  ScanKeyInit(&skey[1],
1698  Anum_pg_amproc_amproclefttype,
1699  BTEqualStrategyNumber, F_OIDEQ,
1700  ObjectIdGetDatum(opcentry->opcintype));
1701  ScanKeyInit(&skey[2],
1702  Anum_pg_amproc_amprocrighttype,
1703  BTEqualStrategyNumber, F_OIDEQ,
1704  ObjectIdGetDatum(opcentry->opcintype));
1705  rel = table_open(AccessMethodProcedureRelationId, AccessShareLock);
1706  scan = systable_beginscan(rel, AccessMethodProcedureIndexId, indexOK,
1707  NULL, 3, skey);
1708 
1709  while (HeapTupleIsValid(htup = systable_getnext(scan)))
1710  {
1711  Form_pg_amproc amprocform = (Form_pg_amproc) GETSTRUCT(htup);
1712 
1713  if (amprocform->amprocnum <= 0 ||
1714  (StrategyNumber) amprocform->amprocnum > numSupport)
1715  elog(ERROR, "invalid amproc number %d for opclass %u",
1716  amprocform->amprocnum, operatorClassOid);
1717 
1718  opcentry->supportProcs[amprocform->amprocnum - 1] =
1719  amprocform->amproc;
1720  }
1721 
1722  systable_endscan(scan);
1724  }
1725 
1726  opcentry->valid = true;
1727  return opcentry;
1728 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
struct opclasscacheent OpClassCacheEnt
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define HASH_ELEM
Definition: hsearch.h:87
FormData_pg_amproc * Form_pg_amproc
Definition: pg_amproc.h:68
regproc RegProcedure
Definition: c.h:511
#define AccessShareLock
Definition: lockdefs.h:36
Size entrysize
Definition: hsearch.h:73
uint16 StrategyNumber
Definition: stratnum.h:22
#define MemSet(start, val, len)
Definition: c.h:971
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:908
unsigned int Oid
Definition: postgres_ext.h:31
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
StrategyNumber numSupport
Definition: relcache.c:244
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
RegProcedure * supportProcs
Definition: relcache.c:247
static HTAB * OpClassCache
Definition: relcache.c:250
#define HASH_BLOBS
Definition: hsearch.h:88
#define AccessMethodProcedureIndexId
Definition: indexing.h:84
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:318
Size keysize
Definition: hsearch.h:72
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:839
#define OpclassOidIndexId
Definition: indexing.h:197
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
void CreateCacheMemoryContext(void)
Definition: catcache.c:620
#define elog(elevel,...)
Definition: elog.h:214
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
bool criticalRelcachesBuilt
Definition: relcache.c:137
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
#define BTEqualStrategyNumber
Definition: stratnum.h:31
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationAssumeNewRelfilenode()

void RelationAssumeNewRelfilenode ( Relation  relation)

Definition at line 3731 of file relcache.c.

References EOXactListAdd, GetCurrentSubTransactionId(), InvalidSubTransactionId, RelationData::rd_firstRelfilenodeSubid, and RelationData::rd_newRelfilenodeSubid.

Referenced by ATExecSetTableSpace(), RelationSetNewRelfilenode(), and swap_relation_files().

3732 {
3735  relation->rd_firstRelfilenodeSubid = relation->rd_newRelfilenodeSubid;
3736 
3737  /* Flag relation as needing eoxact cleanup (to clear these fields) */
3738  EOXactListAdd(relation);
3739 }
#define EOXactListAdd(rel)
Definition: relcache.c:168
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
SubTransactionId GetCurrentSubTransactionId(void)
Definition: xact.c:708
#define InvalidSubTransactionId
Definition: c.h:519

◆ RelationBuildDesc()

static Relation RelationBuildDesc ( Oid  targetRelId,
bool  insertIt 
)
static

Definition at line 1028 of file relcache.c.

References AllocateRelationDesc(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, Assert, BackendIdForTempRelations, CurrentMemoryContext, elog, ERROR, GETSTRUCT, GetTempNamespaceBackendId(), heap_freetuple(), HeapTupleIsValid, InvalidBackendId, InvalidOid, InvalidSubTransactionId, IsParallelWorker, isTempOrTempToastNamespace(), MemoryContextDelete(), MemoryContextSwitchTo(), NIL, RelationData::rd_backend, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_fkeylist, RelationData::rd_fkeyvalid, RelationData::rd_islocaltemp, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_newRelfilenodeSubid, RelationData::rd_node, RelationData::rd_partcheck, RelationData::rd_partcheckcxt, RelationData::rd_partcheckvalid, RelationData::rd_partdesc, RelationData::rd_partkey, RelationData::rd_partkeycxt, RelationData::rd_pdcxt, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_rsdesc, RelationData::rd_rules, RelationData::rd_rulescxt, RelationData::rd_smgr, RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationBuildTriggers(), RelationBuildTupleDesc(), RelationCacheInsert, RelationGetRelid, RelationInitIndexAccessInfo(), RelationInitLockInfo(), RelationInitPhysicalAddr(), RelationInitTableAccessMethod(), RelationParseRelOptions(), RelFileNodeSkippingWAL(), ScanPgRelation(), TopSubTransactionId, and RelationData::trigdesc.

Referenced by load_critical_index(), RelationClearRelation(), and RelationIdGetRelation().

1029 {
1030  Relation relation;
1031  Oid relid;
1032  HeapTuple pg_class_tuple;
1033  Form_pg_class relp;
1034 
1035  /*
1036  * This function and its subroutines can allocate a good deal of transient
1037  * data in CurrentMemoryContext. Traditionally we've just leaked that
1038  * data, reasoning that the caller's context is at worst of transaction
1039  * scope, and relcache loads shouldn't happen so often that it's essential
1040  * to recover transient data before end of statement/transaction. However
1041  * that's definitely not true in clobber-cache test builds, and perhaps
1042  * it's not true in other cases. If RECOVER_RELATION_BUILD_MEMORY is not
1043  * zero, arrange to allocate the junk in a temporary context that we'll
1044  * free before returning. Make it a child of caller's context so that it
1045  * will get cleaned up appropriately if we error out partway through.
1046  */
1047 #if RECOVER_RELATION_BUILD_MEMORY
1048  MemoryContext tmpcxt;
1049  MemoryContext oldcxt;
1050 
1052  "RelationBuildDesc workspace",
1054  oldcxt = MemoryContextSwitchTo(tmpcxt);
1055 #endif
1056 
1057  /*
1058  * find the tuple in pg_class corresponding to the given relation id
1059  */
1060  pg_class_tuple = ScanPgRelation(targetRelId, true, false);
1061 
1062  /*
1063  * if no such tuple exists, return NULL
1064  */
1065  if (!HeapTupleIsValid(pg_class_tuple))
1066  {
1067 #if RECOVER_RELATION_BUILD_MEMORY
1068  /* Return to caller's context, and blow away the temporary context */
1069  MemoryContextSwitchTo(oldcxt);
1070  MemoryContextDelete(tmpcxt);
1071 #endif
1072  return NULL;
1073  }
1074 
1075  /*
1076  * get information from the pg_class_tuple
1077  */
1078  relp = (Form_pg_class) GETSTRUCT(pg_class_tuple);
1079  relid = relp->oid;
1080  Assert(relid == targetRelId);
1081 
1082  /*
1083  * allocate storage for the relation descriptor, and copy pg_class_tuple
1084  * to relation->rd_rel.
1085  */
1086  relation = AllocateRelationDesc(relp);
1087 
1088  /*
1089  * initialize the relation's relation id (relation->rd_id)
1090  */
1091  RelationGetRelid(relation) = relid;
1092 
1093  /*
1094  * Normal relations are not nailed into the cache. Since we don't flush
1095  * new relations, it won't be new. It could be temp though.
1096  */
1097  relation->rd_refcnt = 0;
1098  relation->rd_isnailed = false;
1103  switch (relation->rd_rel->relpersistence)
1104  {
1105  case RELPERSISTENCE_UNLOGGED:
1106  case RELPERSISTENCE_PERMANENT:
1107  relation->rd_backend = InvalidBackendId;
1108  relation->rd_islocaltemp = false;
1109  break;
1110  case RELPERSISTENCE_TEMP:
1111  if (isTempOrTempToastNamespace(relation->rd_rel->relnamespace))
1112  {
1113  relation->rd_backend = BackendIdForTempRelations();
1114  relation->rd_islocaltemp = true;
1115  }
1116  else
1117  {
1118  /*
1119  * If it's a temp table, but not one of ours, we have to use
1120  * the slow, grotty method to figure out the owning backend.
1121  *
1122  * Note: it's possible that rd_backend gets set to MyBackendId
1123  * here, in case we are looking at a pg_class entry left over
1124  * from a crashed backend that coincidentally had the same
1125  * BackendId we're using. We should *not* consider such a
1126  * table to be "ours"; this is why we need the separate
1127  * rd_islocaltemp flag. The pg_class entry will get flushed
1128  * if/when we clean out the corresponding temp table namespace
1129  * in preparation for using it.
1130  */
1131  relation->rd_backend =
1132  GetTempNamespaceBackendId(relation->rd_rel->relnamespace);
1133  Assert(relation->rd_backend != InvalidBackendId);
1134  relation->rd_islocaltemp = false;
1135  }
1136  break;
1137  default:
1138  elog(ERROR, "invalid relpersistence: %c",
1139  relation->rd_rel->relpersistence);
1140  break;
1141  }
1142 
1143  /*
1144  * initialize the tuple descriptor (relation->rd_att).
1145  */
1146  RelationBuildTupleDesc(relation);
1147 
1148  /*
1149  * Fetch rules and triggers that affect this relation
1150  */
1151  if (relation->rd_rel->relhasrules)
1152  RelationBuildRuleLock(relation);
1153  else
1154  {
1155  relation->rd_rules = NULL;
1156  relation->rd_rulescxt = NULL;
1157  }
1158 
1159  if (relation->rd_rel->relhastriggers)
1160  RelationBuildTriggers(relation);
1161  else
1162  relation->trigdesc = NULL;
1163 
1164  if (relation->rd_rel->relrowsecurity)
1165  RelationBuildRowSecurity(relation);
1166  else
1167  relation->rd_rsdesc = NULL;
1168 
1169  /* foreign key data is not loaded till asked for */
1170  relation->rd_fkeylist = NIL;
1171  relation->rd_fkeyvalid = false;
1172 
1173  /* partitioning data is not loaded till asked for */
1174  relation->rd_partkey = NULL;
1175  relation->rd_partkeycxt = NULL;
1176  relation->rd_partdesc = NULL;
1177  relation->rd_pdcxt = NULL;
1178  relation->rd_partcheck = NIL;
1179  relation->rd_partcheckvalid = false;
1180  relation->rd_partcheckcxt = NULL;
1181 
1182  /*
1183  * initialize access method information
1184  */
1185  switch (relation->rd_rel->relkind)
1186  {
1187  case RELKIND_INDEX:
1188  case RELKIND_PARTITIONED_INDEX:
1189  Assert(relation->rd_rel->relam != InvalidOid);
1190  RelationInitIndexAccessInfo(relation);
1191  break;
1192  case RELKIND_RELATION:
1193  case RELKIND_TOASTVALUE:
1194  case RELKIND_MATVIEW:
1195  Assert(relation->rd_rel->relam != InvalidOid);
1197  break;
1198  case RELKIND_SEQUENCE:
1199  Assert(relation->rd_rel->relam == InvalidOid);
1201  break;
1202  case RELKIND_VIEW:
1203  case RELKIND_COMPOSITE_TYPE:
1204  case RELKIND_FOREIGN_TABLE:
1205  case RELKIND_PARTITIONED_TABLE:
1206  Assert(relation->rd_rel->relam == InvalidOid);
1207  break;
1208  }
1209 
1210  /* extract reloptions if any */
1211  RelationParseRelOptions(relation, pg_class_tuple);
1212 
1213  /*
1214  * initialize the relation lock manager information
1215  */
1216  RelationInitLockInfo(relation); /* see lmgr.c */
1217 
1218  /*
1219  * initialize physical addressing information for the relation
1220  */
1221  RelationInitPhysicalAddr(relation);
1222 
1223  /* make sure relation is marked as having no open file yet */
1224  relation->rd_smgr = NULL;
1225 
1226  /*
1227  * now we can free the memory allocated for pg_class_tuple
1228  */
1229  heap_freetuple(pg_class_tuple);
1230 
1231  /*
1232  * Insert newly created relation into relcache hash table, if requested.
1233  *
1234  * There is one scenario in which we might find a hashtable entry already
1235  * present, even though our caller failed to find it: if the relation is a
1236  * system catalog or index that's used during relcache load, we might have
1237  * recursively created the same relcache entry during the preceding steps.
1238  * So allow RelationCacheInsert to delete any already-present relcache
1239  * entry for the same OID. The already-present entry should have refcount
1240  * zero (else somebody forgot to close it); in the event that it doesn't,
1241  * we'll elog a WARNING and leak the already-present entry.
1242  */
1243  if (insertIt)
1244  RelationCacheInsert(relation, true);
1245 
1246  /*
1247  * For RelationNeedsWAL() to answer correctly on parallel workers, restore
1248  * rd_firstRelfilenodeSubid. No subtransactions start or end while in
1249  * parallel mode, so the specific SubTransactionId does not matter.
1250  */
1251  if (IsParallelWorker() && RelFileNodeSkippingWAL(relation->rd_node))
1253 
1254  /* It's fully valid */
1255  relation->rd_isvalid = true;
1256 
1257 #if RECOVER_RELATION_BUILD_MEMORY
1258  /* Return to caller's context, and blow away the temporary context */
1259  MemoryContextSwitchTo(oldcxt);
1260  MemoryContextDelete(tmpcxt);
1261 #endif
1262 
1263  return relation;
1264 }
#define NIL
Definition: pg_list.h:65
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:211
#define AllocSetContextCreate
Definition: memutils.h:170
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
void RelationBuildRowSecurity(Relation relation)
Definition: policy.c:192
bool isTempOrTempToastNamespace(Oid namespaceId)
Definition: namespace.c:3181
void RelationInitTableAccessMethod(Relation relation)
Definition: relcache.c:1745
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
bool rd_isnailed
Definition: rel.h:61
bool rd_islocaltemp
Definition: rel.h:60
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
List * rd_fkeylist
Definition: rel.h:120
bool rd_partcheckvalid
Definition: rel.h:133
bool rd_isvalid
Definition: rel.h:62
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
int GetTempNamespaceBackendId(Oid namespaceId)
Definition: namespace.c:3274
MemoryContext rd_rulescxt
Definition: rel.h:114
Form_pg_class rd_rel
Definition: rel.h:109
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
static Relation AllocateRelationDesc(Form_pg_class relp)
Definition: relcache.c:385
#define TopSubTransactionId
Definition: c.h:520
PartitionKey rd_partkey
Definition: rel.h:124
#define ERROR
Definition: elog.h:43
TriggerDesc * trigdesc
Definition: rel.h:115
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1274
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:192
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:71
#define BackendIdForTempRelations()
Definition: backendid.h:34
static void RelationParseRelOptions(Relation relation, HeapTuple tuple)
Definition: relcache.c:440
static void RelationBuildTupleDesc(Relation relation)
Definition: relcache.c:497
MemoryContext CurrentMemoryContext
Definition: mcxt.c:38
PartitionDesc rd_partdesc
Definition: rel.h:128
struct RowSecurityDesc * rd_rsdesc
Definition: rel.h:117
#define IsParallelWorker()
Definition: parallel.h:61
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
#define InvalidBackendId
Definition: backendid.h:23
#define InvalidOid
Definition: postgres_ext.h:36
#define RelationCacheInsert(RELATION, replace_allowed)
Definition: relcache.c:188
RelFileNode rd_node
Definition: rel.h:55
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
MemoryContext rd_pdcxt
Definition: rel.h:129
BackendId rd_backend
Definition: rel.h:59
#define Assert(condition)
Definition: c.h:738
MemoryContext rd_partkeycxt
Definition: rel.h:125
RuleLock * rd_rules
Definition: rel.h:113
#define InvalidSubTransactionId
Definition: c.h:519
bool RelFileNodeSkippingWAL(RelFileNode rnode)
Definition: storage.c:496
void RelationInitIndexAccessInfo(Relation relation)
Definition: relcache.c:1365
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
void RelationBuildTriggers(Relation relation)
Definition: trigger.c:1592
int rd_refcnt
Definition: rel.h:58
static HeapTuple ScanPgRelation(Oid targetRelId, bool indexOK, bool force_non_historic)
Definition: relcache.c:315
#define elog(elevel,...)
Definition: elog.h:214
static void RelationBuildRuleLock(Relation relation)
Definition: relcache.c:735
MemoryContext rd_partcheckcxt
Definition: rel.h:134
bool rd_fkeyvalid
Definition: rel.h:121
#define RelationGetRelid(relation)
Definition: rel.h:456
List * rd_partcheck
Definition: rel.h:132
SubTransactionId rd_droppedSubid
Definition: rel.h:107

◆ RelationBuildLocalRelation()

Relation RelationBuildLocalRelation ( const char *  relname,
Oid  relnamespace,
TupleDesc  tupDesc,
Oid  relid,
Oid  accessmtd,
Oid  relfilenode,
Oid  reltablespace,
bool  shared_relation,
bool  mapped_relation,
char  relpersistence,
char  relkind 
)

Definition at line 3336 of file relcache.c.

References Assert, AssertArg, BackendIdForTempRelations, CacheMemoryContext, CLASS_TUPLE_SIZE, TupleDescData::constr, CreateCacheMemoryContext(), CreateTupleDescCopy(), elog, EOXactListAdd, ERROR, GetCurrentSubTransactionId(), TupleConstr::has_not_null, i, InvalidBackendId, InvalidOid, InvalidSubTransactionId, IsCatalogNamespace(), IsSharedRelation(), isTempOrTempToastNamespace(), MemoryContextSwitchTo(), namestrcpy(), TupleDescData::natts, palloc0(), RelationData::rd_att, RelationData::rd_backend, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_islocaltemp, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_newRelfilenodeSubid, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_smgr, RelationCacheInsert, RelationGetRelid, RelationIncrementReferenceCount(), RelationInitLockInfo(), RelationInitPhysicalAddr(), RelationInitTableAccessMethod(), RelationMapUpdateMap(), TupleDescData::tdrefcount, and TupleDescAttr.

Referenced by heap_create().

3347 {
3348  Relation rel;
3349  MemoryContext oldcxt;
3350  int natts = tupDesc->natts;
3351  int i;
3352  bool has_not_null;
3353  bool nailit;
3354 
3355  AssertArg(natts >= 0);
3356 
3357  /*
3358  * check for creation of a rel that must be nailed in cache.
3359  *
3360  * XXX this list had better match the relations specially handled in
3361  * RelationCacheInitializePhase2/3.
3362  */
3363  switch (relid)
3364  {
3365  case DatabaseRelationId:
3366  case AuthIdRelationId:
3367  case AuthMemRelationId:
3368  case RelationRelationId:
3369  case AttributeRelationId:
3370  case ProcedureRelationId:
3371  case TypeRelationId:
3372  nailit = true;
3373  break;
3374  default:
3375  nailit = false;
3376  break;
3377  }
3378 
3379  /*
3380  * check that hardwired list of shared rels matches what's in the
3381  * bootstrap .bki file. If you get a failure here during initdb, you
3382  * probably need to fix IsSharedRelation() to match whatever you've done
3383  * to the set of shared relations.
3384  */
3385  if (shared_relation != IsSharedRelation(relid))
3386  elog(ERROR, "shared_relation flag for \"%s\" does not match IsSharedRelation(%u)",
3387  relname, relid);
3388 
3389  /* Shared relations had better be mapped, too */
3390  Assert(mapped_relation || !shared_relation);
3391 
3392  /*
3393  * switch to the cache context to create the relcache entry.
3394  */
3395  if (!CacheMemoryContext)
3397 
3399 
3400  /*
3401  * allocate a new relation descriptor and fill in basic state fields.
3402  */
3403  rel = (Relation) palloc0(sizeof(RelationData));
3404 
3405  /* make sure relation is marked as having no open file yet */
3406  rel->rd_smgr = NULL;
3407 
3408  /* mark it nailed if appropriate */
3409  rel->rd_isnailed = nailit;
3410 
3411  rel->rd_refcnt = nailit ? 1 : 0;
3412 
3413  /* it's being created in this transaction */
3418 
3419  /*
3420  * create a new tuple descriptor from the one passed in. We do this
3421  * partly to copy it into the cache context, and partly because the new
3422  * relation can't have any defaults or constraints yet; they have to be
3423  * added in later steps, because they require additions to multiple system
3424  * catalogs. We can copy attnotnull constraints here, however.
3425  */
3426  rel->rd_att = CreateTupleDescCopy(tupDesc);
3427  rel->rd_att->tdrefcount = 1; /* mark as refcounted */
3428  has_not_null = false;
3429  for (i = 0; i < natts; i++)
3430  {
3431  Form_pg_attribute satt = TupleDescAttr(tupDesc, i);
3432  Form_pg_attribute datt = TupleDescAttr(rel->rd_att, i);
3433 
3434  datt->attidentity = satt->attidentity;
3435  datt->attgenerated = satt->attgenerated;
3436  datt->attnotnull = satt->attnotnull;
3437  has_not_null |= satt->attnotnull;
3438  }
3439 
3440  if (has_not_null)
3441  {
3442  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
3443 
3444  constr->has_not_null = true;
3445  rel->rd_att->constr = constr;
3446  }
3447 
3448  /*
3449  * initialize relation tuple form (caller may add/override data later)
3450  */
3452 
3453  namestrcpy(&rel->rd_rel->relname, relname);
3454  rel->rd_rel->relnamespace = relnamespace;
3455 
3456  rel->rd_rel->relkind = relkind;
3457  rel->rd_rel->relnatts = natts;
3458  rel->rd_rel->reltype = InvalidOid;
3459  /* needed when bootstrapping: */
3460  rel->rd_rel->relowner = BOOTSTRAP_SUPERUSERID;
3461 
3462  /* set up persistence and relcache fields dependent on it */
3463  rel->rd_rel->relpersistence = relpersistence;
3464  switch (relpersistence)
3465  {
3466  case RELPERSISTENCE_UNLOGGED:
3467  case RELPERSISTENCE_PERMANENT:
3469  rel->rd_islocaltemp = false;
3470  break;
3471  case RELPERSISTENCE_TEMP:
3472  Assert(isTempOrTempToastNamespace(relnamespace));
3474  rel->rd_islocaltemp = true;
3475  break;
3476  default:
3477  elog(ERROR, "invalid relpersistence: %c", relpersistence);
3478  break;
3479  }
3480 
3481  /* if it's a materialized view, it's not populated initially */
3482  if (relkind == RELKIND_MATVIEW)
3483  rel->rd_rel->relispopulated = false;
3484  else
3485  rel->rd_rel->relispopulated = true;
3486 
3487  /* set replica identity -- system catalogs and non-tables don't have one */
3488  if (!IsCatalogNamespace(relnamespace) &&
3489  (relkind == RELKIND_RELATION ||
3490  relkind == RELKIND_MATVIEW ||
3491  relkind == RELKIND_PARTITIONED_TABLE))
3492  rel->rd_rel->relreplident = REPLICA_IDENTITY_DEFAULT;
3493  else
3494  rel->rd_rel->relreplident = REPLICA_IDENTITY_NOTHING;
3495 
3496  /*
3497  * Insert relation physical and logical identifiers (OIDs) into the right
3498  * places. For a mapped relation, we set relfilenode to zero and rely on
3499  * RelationInitPhysicalAddr to consult the map.
3500  */
3501  rel->rd_rel->relisshared = shared_relation;
3502 
3503  RelationGetRelid(rel) = relid;
3504 
3505  for (i = 0; i < natts; i++)
3506  TupleDescAttr(rel->rd_att, i)->attrelid = relid;
3507 
3508  rel->rd_rel->reltablespace = reltablespace;
3509 
3510  if (mapped_relation)
3511  {
3512  rel->rd_rel->relfilenode = InvalidOid;
3513  /* Add it to the active mapping information */
3514  RelationMapUpdateMap(relid, relfilenode, shared_relation, true);
3515  }
3516  else
3517  rel->rd_rel->relfilenode = relfilenode;
3518 
3519  RelationInitLockInfo(rel); /* see lmgr.c */
3520 
3522 
3523  rel->rd_rel->relam = accessmtd;
3524 
3525  if (relkind == RELKIND_RELATION ||
3526  relkind == RELKIND_SEQUENCE ||
3527  relkind == RELKIND_TOASTVALUE ||
3528  relkind == RELKIND_MATVIEW)
3530 
3531  /*
3532  * Okay to insert into the relcache hash table.
3533  *
3534  * Ordinarily, there should certainly not be an existing hash entry for
3535  * the same OID; but during bootstrap, when we create a "real" relcache
3536  * entry for one of the bootstrap relations, we'll be overwriting the
3537  * phony one created with formrdesc. So allow that to happen for nailed
3538  * rels.
3539  */
3540  RelationCacheInsert(rel, nailit);
3541 
3542  /*
3543  * Flag relation as needing eoxact cleanup (to clear rd_createSubid). We
3544  * can't do this before storing relid in it.
3545  */
3546  EOXactListAdd(rel);
3547 
3548  /*
3549  * done building relcache entry.
3550  */
3551  MemoryContextSwitchTo(oldcxt);
3552 
3553  /* It's fully valid */
3554  rel->rd_isvalid = true;
3555 
3556  /*
3557  * Caller expects us to pin the returned entry.
3558  */
3560 
3561  return rel;
3562 }
TupleDesc CreateTupleDescCopy(TupleDesc tupdesc)
Definition: tupdesc.c:110
#define EOXactListAdd(rel)
Definition: relcache.c:168
bool isTempOrTempToastNamespace(Oid namespaceId)
Definition: namespace.c:3181
void RelationInitTableAccessMethod(Relation relation)
Definition: relcache.c:1745
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
bool rd_isnailed
Definition: rel.h:61
bool rd_islocaltemp
Definition: rel.h:60
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
bool rd_isvalid
Definition: rel.h:62
SubTransactionId rd_newRelfilenodeSubid
Definition: rel.h:103
Form_pg_class rd_rel
Definition: rel.h:109
NameData relname
Definition: pg_class.h:38
int namestrcpy(Name name, const char *str)
Definition: name.c:250
struct RelationData * Relation
Definition: relcache.h:27
#define ERROR
Definition: elog.h:43
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1274
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:71
#define BackendIdForTempRelations()
Definition: backendid.h:34
TupleConstr * constr
Definition: tupdesc.h:85
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
#define AssertArg(condition)
Definition: c.h:740
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
#define InvalidBackendId
Definition: backendid.h:23
void * palloc0(Size size)
Definition: mcxt.c:980
void RelationIncrementReferenceCount(Relation rel)
Definition: relcache.c:2070
bool IsSharedRelation(Oid relationId)
Definition: catalog.c:238
TupleDesc rd_att
Definition: rel.h:110
#define InvalidOid
Definition: postgres_ext.h:36
#define RelationCacheInsert(RELATION, replace_allowed)
Definition: relcache.c:188
#define CLASS_TUPLE_SIZE
Definition: pg_class.h:145
BackendId rd_backend
Definition: rel.h:59
#define Assert(condition)
Definition: c.h:738
SubTransactionId GetCurrentSubTransactionId(void)
Definition: xact.c:708
void CreateCacheMemoryContext(void)
Definition: catcache.c:620
#define InvalidSubTransactionId
Definition: c.h:519
bool IsCatalogNamespace(Oid namespaceId)
Definition: catalog.c:177
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
int rd_refcnt
Definition: rel.h:58
#define elog(elevel,...)
Definition: elog.h:214
int i
int tdrefcount
Definition: tupdesc.h:84
bool has_not_null
Definition: tupdesc.h:44
#define RelationGetRelid(relation)
Definition: rel.h:456
SubTransactionId rd_droppedSubid
Definition: rel.h:107
void RelationMapUpdateMap(Oid relationId, Oid fileNode, bool shared, bool immediate)
Definition: relmapper.c:261
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationBuildRuleLock()

static void RelationBuildRuleLock ( Relation  relation)
static

Definition at line 735 of file relcache.c.

References AccessShareLock, RewriteRule::actions, ALLOCSET_SMALL_SIZES, AllocSetContextCreate, Assert, BTEqualStrategyNumber, CacheMemoryContext, RewriteRule::enabled, RewriteRule::event, GETSTRUCT, heap_getattr, HeapTupleIsValid, RewriteRule::isInstead, sort-test::key, MemoryContextAlloc(), MemoryContextCopyAndSetIdentifier, MemoryContextDelete(), MemoryContextSwitchTo(), RuleLock::numLocks, ObjectIdGetDatum, pfree(), RewriteRule::qual, RelationData::rd_rel, RelationData::rd_rules, RelationData::rd_rulescxt, RelationGetDescr, RelationGetRelationName, RelationGetRelid, repalloc(), RewriteRelRulenameIndexId, RewriteRule::ruleId, RuleLock::rules, rules, ScanKeyInit(), setRuleCheckAsUser(), stringToNode(), systable_beginscan(), systable_endscan(), systable_getnext(), table_close(), table_open(), and TextDatumGetCString.

Referenced by RelationBuildDesc(), and RelationCacheInitializePhase3().

736 {
737  MemoryContext rulescxt;
738  MemoryContext oldcxt;
739  HeapTuple rewrite_tuple;
740  Relation rewrite_desc;
741  TupleDesc rewrite_tupdesc;
742  SysScanDesc rewrite_scan;
744  RuleLock *rulelock;
745  int numlocks;
746  RewriteRule **rules;
747  int maxlocks;
748 
749  /*
750  * Make the private context. Assume it'll not contain much data.
751  */
753  "relation rules",
755  relation->rd_rulescxt = rulescxt;
757  RelationGetRelationName(relation));
758 
759  /*
760  * allocate an array to hold the rewrite rules (the array is extended if
761  * necessary)
762  */
763  maxlocks = 4;
764  rules = (RewriteRule **)
765  MemoryContextAlloc(rulescxt, sizeof(RewriteRule *) * maxlocks);
766  numlocks = 0;
767 
768  /*
769  * form a scan key
770  */
771  ScanKeyInit(&key,
772  Anum_pg_rewrite_ev_class,
773  BTEqualStrategyNumber, F_OIDEQ,
775 
776  /*
777  * open pg_rewrite and begin a scan
778  *
779  * Note: since we scan the rules using RewriteRelRulenameIndexId, we will
780  * be reading the rules in name order, except possibly during
781  * emergency-recovery operations (ie, IgnoreSystemIndexes). This in turn
782  * ensures that rules will be fired in name order.
783  */
784  rewrite_desc = table_open(RewriteRelationId, AccessShareLock);
785  rewrite_tupdesc = RelationGetDescr(rewrite_desc);
786  rewrite_scan = systable_beginscan(rewrite_desc,
788  true, NULL,
789  1, &key);
790 
791  while (HeapTupleIsValid(rewrite_tuple = systable_getnext(rewrite_scan)))
792  {
793  Form_pg_rewrite rewrite_form = (Form_pg_rewrite) GETSTRUCT(rewrite_tuple);
794  bool isnull;
795  Datum rule_datum;
796  char *rule_str;
797  RewriteRule *rule;
798 
799  rule = (RewriteRule *) MemoryContextAlloc(rulescxt,
800  sizeof(RewriteRule));
801 
802  rule->ruleId = rewrite_form->oid;
803 
804  rule->event = rewrite_form->ev_type - '0';
805  rule->enabled = rewrite_form->ev_enabled;
806  rule->isInstead = rewrite_form->is_instead;
807 
808  /*
809  * Must use heap_getattr to fetch ev_action and ev_qual. Also, the
810  * rule strings are often large enough to be toasted. To avoid
811  * leaking memory in the caller's context, do the detoasting here so
812  * we can free the detoasted version.
813  */
814  rule_datum = heap_getattr(rewrite_tuple,
815  Anum_pg_rewrite_ev_action,
816  rewrite_tupdesc,
817  &isnull);
818  Assert(!isnull);
819  rule_str = TextDatumGetCString(rule_datum);
820  oldcxt = MemoryContextSwitchTo(rulescxt);
821  rule->actions = (List *) stringToNode(rule_str);
822  MemoryContextSwitchTo(oldcxt);
823  pfree(rule_str);
824 
825  rule_datum = heap_getattr(rewrite_tuple,
826  Anum_pg_rewrite_ev_qual,
827  rewrite_tupdesc,
828  &isnull);
829  Assert(!isnull);
830  rule_str = TextDatumGetCString(rule_datum);
831  oldcxt = MemoryContextSwitchTo(rulescxt);
832  rule->qual = (Node *) stringToNode(rule_str);
833  MemoryContextSwitchTo(oldcxt);
834  pfree(rule_str);
835 
836  /*
837  * We want the rule's table references to be checked as though by the
838  * table owner, not the user referencing the rule. Therefore, scan
839  * through the rule's actions and set the checkAsUser field on all
840  * rtable entries. We have to look at the qual as well, in case it
841  * contains sublinks.
842  *
843  * The reason for doing this when the rule is loaded, rather than when
844  * it is stored, is that otherwise ALTER TABLE OWNER would have to
845  * grovel through stored rules to update checkAsUser fields. Scanning
846  * the rule tree during load is relatively cheap (compared to
847  * constructing it in the first place), so we do it here.
848  */
849  setRuleCheckAsUser((Node *) rule->actions, relation->rd_rel->relowner);
850  setRuleCheckAsUser(rule->qual, relation->rd_rel->relowner);
851 
852  if (numlocks >= maxlocks)
853  {
854  maxlocks *= 2;
855  rules = (RewriteRule **)
856  repalloc(rules, sizeof(RewriteRule *) * maxlocks);
857  }
858  rules[numlocks++] = rule;
859  }
860 
861  /*
862  * end the scan and close the attribute relation
863  */
864  systable_endscan(rewrite_scan);
865  table_close(rewrite_desc, AccessShareLock);
866 
867  /*
868  * there might not be any rules (if relhasrules is out-of-date)
869  */
870  if (numlocks == 0)
871  {
872  relation->rd_rules = NULL;
873  relation->rd_rulescxt = NULL;
874  MemoryContextDelete(rulescxt);
875  return;
876  }
877 
878  /*
879  * form a RuleLock and insert into relation
880  */
881  rulelock = (RuleLock *) MemoryContextAlloc(rulescxt, sizeof(RuleLock));
882  rulelock->numLocks = numlocks;
883  rulelock->rules = rules;
884 
885  relation->rd_rules = rulelock;
886 }
Node * qual
Definition: prs2lock.h:28
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:211
#define AllocSetContextCreate
Definition: memutils.h:170
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
int numLocks
Definition: prs2lock.h:42
void setRuleCheckAsUser(Node *node, Oid userid)
#define RelationGetDescr(relation)
Definition: rel.h:482
#define RewriteRelRulenameIndexId
Definition: indexing.h:217
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:202
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define AccessShareLock
Definition: lockdefs.h:36
Definition: nodes.h:529
void * stringToNode(const char *str)
Definition: read.c:89
MemoryContext rd_rulescxt
Definition: rel.h:114
Form_pg_class rd_rel
Definition: rel.h:109
bool isInstead
Definition: prs2lock.h:31
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
Definition: localtime.c:72
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define MemoryContextCopyAndSetIdentifier(cxt, id)
Definition: memutils.h:97
CmdType event
Definition: prs2lock.h:27
static struct rule * rules
Definition: zic.c:283
#define RelationGetRelationName(relation)
Definition: rel.h:490
RewriteRule ** rules
Definition: prs2lock.h:43
List * actions
Definition: prs2lock.h:29
#define heap_getattr(tup, attnum, tupleDesc, isnull)
Definition: htup_details.h:762
#define TextDatumGetCString(d)
Definition: builtins.h:88
uintptr_t Datum
Definition: postgres.h:367
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
RuleLock * rd_rules
Definition: rel.h:113
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1069
FormData_pg_rewrite * Form_pg_rewrite
Definition: pg_rewrite.h:52
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:796
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Definition: pg_list.h:50
#define RelationGetRelid(relation)
Definition: rel.h:456
Oid ruleId
Definition: prs2lock.h:26
#define BTEqualStrategyNumber
Definition: stratnum.h:31
MemoryContext CacheMemoryContext
Definition: mcxt.c:47
char enabled
Definition: prs2lock.h:30

◆ RelationBuildTupleDesc()

static void RelationBuildTupleDesc ( Relation  relation)
static

Definition at line 497 of file relcache.c.

References AccessShareLock, AttrDefault::adbin, AttrDefault::adnum, AttrMissing::am_present, AttrMissing::am_value, array_get_element(), Assert, attnum, AttrDefaultFetch(), ATTRIBUTE_FIXED_PART_SIZE, AttributeRelidNumIndexId, BTEqualStrategyNumber, BTGreaterStrategyNumber, CacheMemoryContext, TupleConstr::check, CheckConstraintFetch(), TupleDescData::constr, criticalRelcachesBuilt, datumCopy(), TupleConstr::defval, elog, ERROR, GETSTRUCT, TupleConstr::has_generated_stored, TupleConstr::has_not_null, heap_getattr, HeapTupleIsValid, i, Int16GetDatum, MemoryContextAlloc(), MemoryContextAllocZero(), MemoryContextSwitchTo(), TupleConstr::missing, TupleConstr::num_check, TupleConstr::num_defval, ObjectIdGetDatum, pfree(), RelationData::rd_att, RelationData::rd_rel, RelationGetNumberOfAttributes, RelationGetRelationName, RelationGetRelid, repalloc(), ScanKeyInit(), systable_beginscan(), systable_endscan(), systable_getnext(), table_close(), table_open(), TupleDescData::tdtypeid, TupleDescData::tdtypmod, and TupleDescAttr.

Referenced by RelationBuildDesc().

498 {
499  HeapTuple pg_attribute_tuple;
500  Relation pg_attribute_desc;
501  SysScanDesc pg_attribute_scan;
502  ScanKeyData skey[2];
503  int need;
504  TupleConstr *constr;
505  AttrDefault *attrdef = NULL;
506  AttrMissing *attrmiss = NULL;
507  int ndef = 0;
508 
509  /* fill rd_att's type ID fields (compare heap.c's AddNewRelationTuple) */
510  relation->rd_att->tdtypeid =
511  relation->rd_rel->reltype ? relation->rd_rel->reltype : RECORDOID;
512  relation->rd_att->tdtypmod = -1; /* just to be sure */
513 
515  sizeof(TupleConstr));
516  constr->has_not_null = false;
517  constr->has_generated_stored = false;
518 
519  /*
520  * Form a scan key that selects only user attributes (attnum > 0).
521  * (Eliminating system attribute rows at the index level is lots faster
522  * than fetching them.)
523  */
524  ScanKeyInit(&skey[0],
525  Anum_pg_attribute_attrelid,
526  BTEqualStrategyNumber, F_OIDEQ,
528  ScanKeyInit(&skey[1],
529  Anum_pg_attribute_attnum,
530  BTGreaterStrategyNumber, F_INT2GT,
531  Int16GetDatum(0));
532 
533  /*
534  * Open pg_attribute and begin a scan. Force heap scan if we haven't yet
535  * built the critical relcache entries (this includes initdb and startup
536  * without a pg_internal.init file).
537  */
538  pg_attribute_desc = table_open(AttributeRelationId, AccessShareLock);
539  pg_attribute_scan = systable_beginscan(pg_attribute_desc,
542  NULL,
543  2, skey);
544 
545  /*
546  * add attribute data to relation->rd_att
547  */
548  need = RelationGetNumberOfAttributes(relation);
549 
550  while (HeapTupleIsValid(pg_attribute_tuple = systable_getnext(pg_attribute_scan)))
551  {
552  Form_pg_attribute attp;
553  int attnum;
554 
555  attp = (Form_pg_attribute) GETSTRUCT(pg_attribute_tuple);
556 
557  attnum = attp->attnum;
558  if (attnum <= 0 || attnum > RelationGetNumberOfAttributes(relation))
559  elog(ERROR, "invalid attribute number %d for %s",
560  attp->attnum, RelationGetRelationName(relation));
561 
562 
563  memcpy(TupleDescAttr(relation->rd_att, attnum - 1),
564  attp,
566 
567  /* Update constraint/default info */
568  if (attp->attnotnull)
569  constr->has_not_null = true;
570  if (attp->attgenerated == ATTRIBUTE_GENERATED_STORED)
571  constr->has_generated_stored = true;
572 
573  /* If the column has a default, fill it into the attrdef array */
574  if (attp->atthasdef)
575  {
576  if (attrdef == NULL)
577  attrdef = (AttrDefault *)
580  sizeof(AttrDefault));
581  attrdef[ndef].adnum = attnum;
582  attrdef[ndef].adbin = NULL;
583 
584  ndef++;
585  }
586 
587  /* Likewise for a missing value */
588  if (attp->atthasmissing)
589  {
590  Datum missingval;
591  bool missingNull;
592 
593  /* Do we have a missing value? */
594  missingval = heap_getattr(pg_attribute_tuple,
595  Anum_pg_attribute_attmissingval,
596  pg_attribute_desc->rd_att,
597  &missingNull);
598  if (!missingNull)
599  {
600  /* Yes, fetch from the array */
601  MemoryContext oldcxt;
602  bool is_null;
603  int one = 1;
604  Datum missval;
605 
606  if (attrmiss == NULL)
607  attrmiss = (AttrMissing *)
609  relation->rd_rel->relnatts *
610  sizeof(AttrMissing));
611 
612  missval = array_get_element(missingval,
613  1,
614  &one,
615  -1,
616  attp->attlen,
617  attp->attbyval,
618  attp->attalign,
619  &is_null);
620  Assert(!is_null);
621  if (attp->attbyval)
622  {
623  /* for copy by val just copy the datum direct */
624  attrmiss[attnum - 1].am_value = missval;
625  }
626  else
627  {
628  /* otherwise copy in the correct context */
630  attrmiss[attnum - 1].am_value = datumCopy(missval,
631  attp->attbyval,
632  attp->attlen);
633  MemoryContextSwitchTo(oldcxt);
634  }
635  attrmiss[attnum - 1].am_present = true;
636  }
637  }
638  need--;
639  if (need == 0)
640  break;
641  }
642 
643  /*
644  * end the scan and close the attribute relation
645  */
646  systable_endscan(pg_attribute_scan);
647  table_close(pg_attribute_desc, AccessShareLock);
648 
649  if (need != 0)
650  elog(ERROR, "catalog is missing %d attribute(s) for relid %u",
651  need, RelationGetRelid(relation));
652 
653  /*
654  * The attcacheoff values we read from pg_attribute should all be -1
655  * ("unknown"). Verify this if assert checking is on. They will be
656  * computed when and if needed during tuple access.
657  */
658 #ifdef USE_ASSERT_CHECKING
659  {
660  int i;
661 
662  for (i = 0; i < RelationGetNumberOfAttributes(relation); i++)
663  Assert(TupleDescAttr(relation->rd_att, i)->attcacheoff == -1);
664  }
665 #endif
666 
667  /*
668  * However, we can easily set the attcacheoff value for the first
669  * attribute: it must be zero. This eliminates the need for special cases
670  * for attnum=1 that used to exist in fastgetattr() and index_getattr().
671  */
672  if (RelationGetNumberOfAttributes(relation) > 0)
673  TupleDescAttr(relation->rd_att, 0)->attcacheoff = 0;
674 
675  /*
676  * Set up constraint/default info
677  */
678  if (constr->has_not_null ||
679  constr->has_generated_stored ||
680  ndef > 0 ||
681  attrmiss ||
682  relation->rd_rel->relchecks)
683  {
684  relation->rd_att->constr = constr;
685 
686  if (ndef > 0) /* DEFAULTs */
687  {
688  if (ndef < RelationGetNumberOfAttributes(relation))
689  constr->defval = (AttrDefault *)
690  repalloc(attrdef, ndef * sizeof(AttrDefault));
691  else
692  constr->defval = attrdef;
693  constr->num_defval = ndef;
694  AttrDefaultFetch(relation);
695  }
696  else
697  constr->num_defval = 0;
698 
699  constr->missing = attrmiss;
700 
701  if (relation->rd_rel->relchecks > 0) /* CHECKs */
702  {
703  constr->num_check = relation->rd_rel->relchecks;
704  constr->check = (ConstrCheck *)
706  constr->num_check * sizeof(ConstrCheck));
707  CheckConstraintFetch(relation);
708  }
709  else
710  constr->num_check = 0;
711  }
712  else
713  {
714  pfree(constr);
715  relation->rd_att->constr = NULL;
716  }
717 }
#define AttributeRelidNumIndexId
Definition: indexing.h:96
static void AttrDefaultFetch(Relation relation)
Definition: relcache.c:4234
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define BTGreaterStrategyNumber
Definition: stratnum.h:33
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:462
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define Int16GetDatum(X)
Definition: postgres.h:451
#define AccessShareLock
Definition: lockdefs.h:36
Form_pg_class rd_rel
Definition: rel.h:109
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
AttrDefault * defval
Definition: tupdesc.h:39
struct AttrDefault AttrDefault
bool has_generated_stored
Definition: tupdesc.h:45
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int32 tdtypmod
Definition: tupdesc.h:83
TupleConstr * constr
Definition: tupdesc.h:85
#define RelationGetRelationName(relation)
Definition: rel.h:490
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:185
Datum datumCopy(Datum value, bool typByVal, int typLen)
Definition: datum.c:131
#define heap_getattr(tup, attnum, tupleDesc, isnull)
Definition: htup_details.h:762
uintptr_t Datum
Definition: postgres.h:367
TupleDesc rd_att
Definition: rel.h:110
uint16 num_check
Definition: tupdesc.h:43
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:839
int16 attnum
Definition: pg_attribute.h:79
Datum array_get_element(Datum arraydatum, int nSubscripts, int *indx, int arraytyplen, int elmlen, bool elmbyval, char elmalign, bool *isNull)
Definition: arrayfuncs.c:1820
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
static void CheckConstraintFetch(Relation relation)
Definition: relcache.c:4304
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1069
struct AttrMissing * missing
Definition: tupdesc.h:41
uint16 num_defval
Definition: tupdesc.h:42
Oid tdtypeid
Definition: tupdesc.h:82
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:796
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber adnum
Definition: tupdesc.h:24
char * adbin
Definition: tupdesc.h:25
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
ConstrCheck * check
Definition: tupdesc.h:40
bool criticalRelcachesBuilt
Definition: relcache.c:137
bool has_not_null
Definition: tupdesc.h:44
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:456
#define BTEqualStrategyNumber
Definition: stratnum.h:31
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationCacheInitFilePostInvalidate()

void RelationCacheInitFilePostInvalidate ( void  )

Definition at line 6316 of file relcache.c.

References LWLockRelease().

Referenced by AtEOXact_Inval(), FinishPreparedTransaction(), and ProcessCommittedInvalidationMessages().

6317 {
6318  LWLockRelease(RelCacheInitLock);
6319 }
void LWLockRelease(LWLock *lock)
Definition: lwlock.c:1812

◆ RelationCacheInitFilePreInvalidate()

void RelationCacheInitFilePreInvalidate ( void  )

Definition at line 6291 of file relcache.c.

References DatabasePath, ERROR, LW_EXCLUSIVE, LWLockAcquire(), MAXPGPATH, RELCACHE_INIT_FILENAME, snprintf, and unlink_initfile().

Referenced by AtEOXact_Inval(), FinishPreparedTransaction(), and ProcessCommittedInvalidationMessages().

6292 {
6293  char localinitfname[MAXPGPATH];
6294  char sharedinitfname[MAXPGPATH];
6295 
6296  if (DatabasePath)
6297  snprintf(localinitfname, sizeof(localinitfname), "%s/%s",
6299  snprintf(sharedinitfname, sizeof(sharedinitfname), "global/%s",
6301 
6302  LWLockAcquire(RelCacheInitLock, LW_EXCLUSIVE);
6303 
6304  /*
6305  * The files might not be there if no backend has been started since the
6306  * last removal. But complain about failures other than ENOENT with
6307  * ERROR. Fortunately, it's not too late to abort the transaction if we
6308  * can't get rid of the would-be-obsolete init file.
6309  */
6310  if (DatabasePath)
6311  unlink_initfile(localinitfname, ERROR);
6312  unlink_initfile(sharedinitfname, ERROR);
6313 }
#define ERROR
Definition: elog.h:43
#define MAXPGPATH
#define RELCACHE_INIT_FILENAME
Definition: relcache.h:25
char * DatabasePath
Definition: globals.c:93
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1208
static void unlink_initfile(const char *initfilename, int elevel)
Definition: relcache.c:6388
#define snprintf
Definition: port.h:193

◆ RelationCacheInitFileRemove()

void RelationCacheInitFileRemove ( void  )

Definition at line 6331 of file relcache.c.

References AllocateDir(), dirent::d_name, FreeDir(), LOG, MAXPGPATH, ReadDirExtended(), RelationCacheInitFileRemoveInDir(), RELCACHE_INIT_FILENAME, snprintf, TABLESPACE_VERSION_DIRECTORY, and unlink_initfile().

Referenced by StartupXLOG().

6332 {
6333  const char *tblspcdir = "pg_tblspc";
6334  DIR *dir;
6335  struct dirent *de;
6336  char path[MAXPGPATH + 10 + sizeof(TABLESPACE_VERSION_DIRECTORY)];
6337 
6338  snprintf(path, sizeof(path), "global/%s",
6340  unlink_initfile(path, LOG);
6341 
6342  /* Scan everything in the default tablespace */
6344 
6345  /* Scan the tablespace link directory to find non-default tablespaces */
6346  dir = AllocateDir(tblspcdir);
6347 
6348  while ((de = ReadDirExtended(dir, tblspcdir, LOG)) != NULL)
6349  {
6350  if (strspn(de->d_name, "0123456789") == strlen(de->d_name))
6351  {
6352  /* Scan the tablespace dir for per-database dirs */
6353  snprintf(path, sizeof(path), "%s/%s/%s",
6354  tblspcdir, de->d_name, TABLESPACE_VERSION_DIRECTORY);
6356  }
6357  }
6358 
6359  FreeDir(dir);
6360 }
static void RelationCacheInitFileRemoveInDir(const char *tblspcpath)
Definition: relcache.c:6364
struct dirent * ReadDirExtended(DIR *dir, const char *dirname, int elevel)
Definition: fd.c:2664
#define LOG
Definition: elog.h:26
Definition: dirent.h:9
Definition: dirent.c:25
#define MAXPGPATH
#define TABLESPACE_VERSION_DIRECTORY
Definition: relpath.h:26
DIR * AllocateDir(const char *dirname)
Definition: fd.c:2583
#define RELCACHE_INIT_FILENAME
Definition: relcache.h:25
static void unlink_initfile(const char *initfilename, int elevel)
Definition: relcache.c:6388
char d_name[MAX_PATH]
Definition: dirent.h:14
#define snprintf
Definition: port.h:193
int FreeDir(DIR *dir)
Definition: fd.c:2701

◆ RelationCacheInitFileRemoveInDir()

static void RelationCacheInitFileRemoveInDir ( const char *  tblspcpath)
static

Definition at line 6364 of file relcache.c.

References AllocateDir(), dirent::d_name, FreeDir(), LOG, MAXPGPATH, ReadDirExtended(), RELCACHE_INIT_FILENAME, snprintf, and unlink_initfile().

Referenced by RelationCacheInitFileRemove().

6365 {
6366  DIR *dir;
6367  struct dirent *de;
6368  char initfilename[MAXPGPATH * 2];
6369 
6370  /* Scan the tablespace directory to find per-database directories */
6371  dir = AllocateDir(tblspcpath);
6372 
6373  while ((de = ReadDirExtended(dir, tblspcpath, LOG)) != NULL)
6374  {
6375  if (strspn(de->d_name, "0123456789") == strlen(de->d_name))
6376  {
6377  /* Try to remove the init file in each database */
6378  snprintf(initfilename, sizeof(initfilename), "%s/%s/%s",
6379  tblspcpath, de->d_name, RELCACHE_INIT_FILENAME);
6380  unlink_initfile(initfilename, LOG);
6381  }
6382  }
6383 
6384  FreeDir(dir);
6385 }
struct dirent * ReadDirExtended(DIR *dir, const char *dirname, int elevel)
Definition: fd.c:2664
#define LOG
Definition: elog.h:26
Definition: dirent.h:9
Definition: dirent.c:25
#define MAXPGPATH
DIR * AllocateDir(const char *dirname)
Definition: fd.c:2583
#define RELCACHE_INIT_FILENAME
Definition: relcache.h:25
static void unlink_initfile(const char *initfilename, int elevel)
Definition: relcache.c:6388
char d_name[MAX_PATH]
Definition: dirent.h:14
#define snprintf
Definition: port.h:193
int FreeDir(DIR *dir)
Definition: fd.c:2701

◆ RelationCacheInitialize()

void RelationCacheInitialize ( void  )

Definition at line 3757 of file relcache.c.

References CacheMemoryContext, CreateCacheMemoryContext(), HASHCTL::entrysize, HASH_BLOBS, hash_create(), HASH_ELEM, INITRELCACHESIZE, HASHCTL::keysize, MemSet, and RelationMapInitialize().

Referenced by InitPostgres().

3758 {
3759  HASHCTL ctl;
3760 
3761  /*
3762  * make sure cache memory context exists
3763  */
3764  if (!CacheMemoryContext)
3766 
3767  /*
3768  * create hashtable that indexes the relcache
3769  */
3770  MemSet(&ctl, 0, sizeof(ctl));
3771  ctl.keysize = sizeof(Oid);
3772  ctl.entrysize = sizeof(RelIdCacheEnt);
3773  RelationIdCache = hash_create("Relcache by OID", INITRELCACHESIZE,
3774  &ctl, HASH_ELEM | HASH_BLOBS);
3775 
3776  /*
3777  * relation mapper needs to be initialized too
3778  */
3780 }
void RelationMapInitialize(void)
Definition: relmapper.c:584
#define HASH_ELEM
Definition: hsearch.h:87
struct relidcacheent RelIdCacheEnt
Size entrysize
Definition: hsearch.h:73
#define MemSet(start, val, len)
Definition: c.h:971
static HTAB * RelationIdCache
Definition: relcache.c:131
unsigned int Oid
Definition: postgres_ext.h:31
#define HASH_BLOBS
Definition: hsearch.h:88
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:318
Size keysize
Definition: hsearch.h:72
void CreateCacheMemoryContext(void)
Definition: catcache.c:620
#define INITRELCACHESIZE
Definition: relcache.c:3754
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationCacheInitializePhase2()

void RelationCacheInitializePhase2 ( void  )

Definition at line 3794 of file relcache.c.

References CacheMemoryContext, Desc_pg_auth_members, Desc_pg_authid, Desc_pg_database, Desc_pg_shseclabel, Desc_pg_subscription, formrdesc(), IsBootstrapProcessingMode, load_relcache_init_file(), MemoryContextSwitchTo(), and RelationMapInitializePhase2().

Referenced by InitPostgres().

3795 {
3796  MemoryContext oldcxt;
3797 
3798  /*
3799  * relation mapper needs initialized too
3800  */
3802 
3803  /*
3804  * In bootstrap mode, the shared catalogs aren't there yet anyway, so do
3805  * nothing.
3806  */
3808  return;
3809 
3810  /*
3811  * switch to cache memory context
3812  */
3814 
3815  /*
3816  * Try to load the shared relcache cache file. If unsuccessful, bootstrap
3817  * the cache with pre-made descriptors for the critical shared catalogs.
3818  */
3819  if (!load_relcache_init_file(true))
3820  {
3821  formrdesc("pg_database", DatabaseRelation_Rowtype_Id, true,
3822  Natts_pg_database, Desc_pg_database);
3823  formrdesc("pg_authid", AuthIdRelation_Rowtype_Id, true,
3824  Natts_pg_authid, Desc_pg_authid);
3825  formrdesc("pg_auth_members", AuthMemRelation_Rowtype_Id, true,
3826  Natts_pg_auth_members, Desc_pg_auth_members);
3827  formrdesc("pg_shseclabel", SharedSecLabelRelation_Rowtype_Id, true,
3828  Natts_pg_shseclabel, Desc_pg_shseclabel);
3829  formrdesc("pg_subscription", SubscriptionRelation_Rowtype_Id, true,
3830  Natts_pg_subscription, Desc_pg_subscription);
3831 
3832 #define NUM_CRITICAL_SHARED_RELS 5 /* fix if you change list above */
3833  }
3834 
3835  MemoryContextSwitchTo(oldcxt);
3836 }
static const FormData_pg_attribute Desc_pg_auth_members[Natts_pg_auth_members]
Definition: relcache.c:114
static bool load_relcache_init_file(bool shared)
Definition: relcache.c:5608
void RelationMapInitializePhase2(void)
Definition: relmapper.c:604
static const FormData_pg_attribute Desc_pg_authid[Natts_pg_authid]
Definition: relcache.c:113
static const FormData_pg_attribute Desc_pg_subscription[Natts_pg_subscription]
Definition: relcache.c:117
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static const FormData_pg_attribute Desc_pg_database[Natts_pg_database]
Definition: relcache.c:112
static const FormData_pg_attribute Desc_pg_shseclabel[Natts_pg_shseclabel]
Definition: relcache.c:116
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
static void formrdesc(const char *relationName, Oid relationReltype, bool isshared, int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:1809
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationCacheInitializePhase3()

void RelationCacheInitializePhase3 ( void  )

Definition at line 3853 of file relcache.c.

References AccessMethodProcedureIndexId, Assert, AttributeRelidNumIndexId, AuthIdOidIndexId, AuthIdRolnameIndexId, AuthMemMemRoleIndexId, CacheMemoryContext, CLASS_TUPLE_SIZE, ClassOidIndexId, criticalRelcachesBuilt, criticalSharedRelcachesBuilt, DatabaseNameIndexId, DatabaseOidIndexId, Desc_pg_attribute, Desc_pg_class, Desc_pg_proc, Desc_pg_type, elog, ERROR, FATAL, formrdesc(), GETSTRUCT, hash_seq_init(), hash_seq_search(), hash_seq_term(), HeapTupleIsValid, IndexRelidIndexId, InitCatalogCachePhase2(), InvalidOid, IsBootstrapProcessingMode, load_critical_index(), load_relcache_init_file(), MemoryContextSwitchTo(), ObjectIdGetDatum, OpclassOidIndexId, pfree(), RelationData::rd_att, RelationData::rd_options, RelationData::rd_rel, RelationData::rd_rsdesc, RelationData::rd_rules, RelationData::rd_tableam, RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationBuildTriggers(), RelationDecrementReferenceCount(), RelationGetRelationName, RelationGetRelid, RelationIncrementReferenceCount(), RelationInitTableAccessMethod(), RelationMapInitializePhase3(), RelationParseRelOptions(), relidcacheent::reldesc, ReleaseSysCache(), RELOID, RewriteRelRulenameIndexId, SearchSysCache1(), SharedSecLabelObjectIndexId, status(), TupleDescData::tdtypeid, TupleDescData::tdtypmod, RelationData::trigdesc, TriggerRelidNameIndexId, and write_relcache_init_file().

Referenced by InitPostgres().

3854 {
3856  RelIdCacheEnt *idhentry;
3857  MemoryContext oldcxt;
3858  bool needNewCacheFile = !criticalSharedRelcachesBuilt;
3859 
3860  /*
3861  * relation mapper needs initialized too
3862  */
3864 
3865  /*
3866  * switch to cache memory context
3867  */
3869 
3870  /*
3871  * Try to load the local relcache cache file. If unsuccessful, bootstrap
3872  * the cache with pre-made descriptors for the critical "nailed-in" system
3873  * catalogs.
3874  */
3875  if (IsBootstrapProcessingMode() ||
3876  !load_relcache_init_file(false))
3877  {
3878  needNewCacheFile = true;
3879 
3880  formrdesc("pg_class", RelationRelation_Rowtype_Id, false,
3881  Natts_pg_class, Desc_pg_class);
3882  formrdesc("pg_attribute", AttributeRelation_Rowtype_Id, false,
3883  Natts_pg_attribute, Desc_pg_attribute);
3884  formrdesc("pg_proc", ProcedureRelation_Rowtype_Id, false,
3885  Natts_pg_proc, Desc_pg_proc);
3886  formrdesc("pg_type", TypeRelation_Rowtype_Id, false,
3887  Natts_pg_type, Desc_pg_type);
3888 
3889 #define NUM_CRITICAL_LOCAL_RELS 4 /* fix if you change list above */
3890  }
3891 
3892  MemoryContextSwitchTo(oldcxt);
3893 
3894  /* In bootstrap mode, the faked-up formrdesc info is all we'll have */
3896  return;
3897 
3898  /*
3899  * If we didn't get the critical system indexes loaded into relcache, do
3900  * so now. These are critical because the catcache and/or opclass cache
3901  * depend on them for fetches done during relcache load. Thus, we have an
3902  * infinite-recursion problem. We can break the recursion by doing
3903  * heapscans instead of indexscans at certain key spots. To avoid hobbling
3904  * performance, we only want to do that until we have the critical indexes
3905  * loaded into relcache. Thus, the flag criticalRelcachesBuilt is used to
3906  * decide whether to do heapscan or indexscan at the key spots, and we set
3907  * it true after we've loaded the critical indexes.
3908  *
3909  * The critical indexes are marked as "nailed in cache", partly to make it
3910  * easy for load_relcache_init_file to count them, but mainly because we
3911  * cannot flush and rebuild them once we've set criticalRelcachesBuilt to
3912  * true. (NOTE: perhaps it would be possible to reload them by
3913  * temporarily setting criticalRelcachesBuilt to false again. For now,
3914  * though, we just nail 'em in.)
3915  *
3916  * RewriteRelRulenameIndexId and TriggerRelidNameIndexId are not critical
3917  * in the same way as the others, because the critical catalogs don't
3918  * (currently) have any rules or triggers, and so these indexes can be
3919  * rebuilt without inducing recursion. However they are used during
3920  * relcache load when a rel does have rules or triggers, so we choose to
3921  * nail them for performance reasons.
3922  */
3924  {
3926  RelationRelationId);
3928  AttributeRelationId);
3930  IndexRelationId);
3932  OperatorClassRelationId);
3934  AccessMethodProcedureRelationId);
3936  RewriteRelationId);
3938  TriggerRelationId);
3939 
3940 #define NUM_CRITICAL_LOCAL_INDEXES 7 /* fix if you change list above */
3941 
3942  criticalRelcachesBuilt = true;
3943  }
3944 
3945  /*
3946  * Process critical shared indexes too.
3947  *
3948  * DatabaseNameIndexId isn't critical for relcache loading, but rather for
3949  * initial lookup of MyDatabaseId, without which we'll never find any
3950  * non-shared catalogs at all. Autovacuum calls InitPostgres with a
3951  * database OID, so it instead depends on DatabaseOidIndexId. We also
3952  * need to nail up some indexes on pg_authid and pg_auth_members for use
3953  * during client authentication. SharedSecLabelObjectIndexId isn't
3954  * critical for the core system, but authentication hooks might be
3955  * interested in it.
3956  */
3958  {
3960  DatabaseRelationId);
3962  DatabaseRelationId);
3964  AuthIdRelationId);
3966  AuthIdRelationId);
3968  AuthMemRelationId);
3970  SharedSecLabelRelationId);
3971 
3972 #define NUM_CRITICAL_SHARED_INDEXES 6 /* fix if you change list above */
3973 
3975  }
3976 
3977  /*
3978  * Now, scan all the relcache entries and update anything that might be
3979  * wrong in the results from formrdesc or the relcache cache file. If we
3980  * faked up relcache entries using formrdesc, then read the real pg_class
3981  * rows and replace the fake entries with them. Also, if any of the
3982  * relcache entries have rules, triggers, or security policies, load that
3983  * info the hard way since it isn't recorded in the cache file.
3984  *
3985  * Whenever we access the catalogs to read data, there is a possibility of
3986  * a shared-inval cache flush causing relcache entries to be removed.
3987  * Since hash_seq_search only guarantees to still work after the *current*
3988  * entry is removed, it's unsafe to continue the hashtable scan afterward.
3989  * We handle this by restarting the scan from scratch after each access.
3990  * This is theoretically O(N^2), but the number of entries that actually
3991  * need to be fixed is small enough that it doesn't matter.
3992  */
3993  hash_seq_init(&status, RelationIdCache);
3994 
3995  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
3996  {
3997  Relation relation = idhentry->reldesc;
3998  bool restart = false;
3999 
4000  /*
4001  * Make sure *this* entry doesn't get flushed while we work with it.
4002  */
4004 
4005  /*
4006  * If it's a faked-up entry, read the real pg_class tuple.
4007  */
4008  if (relation->rd_rel->relowner == InvalidOid)
4009  {
4010  HeapTuple htup;
4011  Form_pg_class relp;
4012 
4013  htup = SearchSysCache1(RELOID,
4014  ObjectIdGetDatum(RelationGetRelid(relation)));
4015  if (!HeapTupleIsValid(htup))
4016  elog(FATAL, "cache lookup failed for relation %u",
4017  RelationGetRelid(relation));
4018  relp = (Form_pg_class) GETSTRUCT(htup);
4019 
4020  /*
4021  * Copy tuple to relation->rd_rel. (See notes in
4022  * AllocateRelationDesc())
4023  */
4024  memcpy((char *) relation->rd_rel, (char *) relp, CLASS_TUPLE_SIZE);
4025 
4026  /* Update rd_options while we have the tuple */
4027  if (relation->rd_options)
4028  pfree(relation->rd_options);
4029  RelationParseRelOptions(relation, htup);
4030 
4031  /*
4032  * Check the values in rd_att were set up correctly. (We cannot
4033  * just copy them over now: formrdesc must have set up the rd_att
4034  * data correctly to start with, because it may already have been
4035  * copied into one or more catcache entries.)
4036  */
4037  Assert(relation->rd_att->tdtypeid == relp->reltype);
4038  Assert(relation->rd_att->tdtypmod == -1);
4039 
4040  ReleaseSysCache(htup);
4041 
4042  /* relowner had better be OK now, else we'll loop forever */
4043  if (relation->rd_rel->relowner == InvalidOid)
4044  elog(ERROR, "invalid relowner in pg_class entry for \"%s\"",
4045  RelationGetRelationName(relation));
4046 
4047  restart = true;
4048  }
4049 
4050  /*
4051  * Fix data that isn't saved in relcache cache file.
4052  *
4053  * relhasrules or relhastriggers could possibly be wrong or out of
4054  * date. If we don't actually find any rules or triggers, clear the
4055  * local copy of the flag so that we don't get into an infinite loop
4056  * here. We don't make any attempt to fix the pg_class entry, though.
4057  */
4058  if (relation->rd_rel->relhasrules && relation->rd_rules == NULL)
4059  {
4060  RelationBuildRuleLock(relation);
4061  if (relation->rd_rules == NULL)
4062  relation->rd_rel->relhasrules = false;
4063  restart = true;
4064  }
4065  if (relation->rd_rel->relhastriggers && relation->trigdesc == NULL)
4066  {
4067  RelationBuildTriggers(relation);
4068  if (relation->trigdesc == NULL)
4069  relation->rd_rel->relhastriggers = false;
4070  restart = true;
4071  }
4072 
4073  /*
4074  * Re-load the row security policies if the relation has them, since
4075  * they are not preserved in the cache. Note that we can never NOT
4076  * have a policy while relrowsecurity is true,
4077  * RelationBuildRowSecurity will create a single default-deny policy
4078  * if there is no policy defined in pg_policy.
4079  */
4080  if (relation->rd_rel->relrowsecurity && relation->rd_rsdesc == NULL)
4081  {
4082  RelationBuildRowSecurity(relation);
4083 
4084  Assert(relation->rd_rsdesc != NULL);
4085  restart = true;
4086  }
4087 
4088  /* Reload tableam data if needed */
4089  if (relation->rd_tableam == NULL &&
4090  (relation->rd_rel->relkind == RELKIND_RELATION ||
4091  relation->rd_rel->relkind == RELKIND_SEQUENCE ||
4092  relation->rd_rel->relkind == RELKIND_TOASTVALUE ||
4093  relation->rd_rel->relkind == RELKIND_MATVIEW))
4094  {
4096  Assert(relation->rd_tableam != NULL);
4097 
4098  restart = true;
4099  }
4100 
4101  /* Release hold on the relation */
4103 
4104  /* Now, restart the hashtable scan if needed */
4105  if (restart)
4106  {
4107  hash_seq_term(&status);
4108  hash_seq_init(&status, RelationIdCache);
4109  }
4110  }
4111 
4112  /*
4113  * Lastly, write out new relcache cache files if needed. We don't bother
4114  * to distinguish cases where only one of the two needs an update.
4115  */
4116  if (needNewCacheFile)
4117  {
4118  /*
4119  * Force all the catcaches to finish initializing and thereby open the
4120  * catalogs and indexes they use. This will preload the relcache with
4121  * entries for all the most important system catalogs and indexes, so
4122  * that the init files will be most useful for future backends.
4123  */
4125 
4126  /* now write the files */
4128  write_relcache_init_file(false);
4129  }
4130 }
#define AttributeRelidNumIndexId
Definition: indexing.h:96
static bool load_relcache_init_file(bool shared)
Definition: relcache.c:5608
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define IndexRelidIndexId
Definition: indexing.h:168
#define RewriteRelRulenameIndexId
Definition: indexing.h:217
void RelationBuildRowSecurity(Relation relation)
Definition: policy.c:192
void RelationInitTableAccessMethod(Relation relation)
Definition: relcache.c:1745
Relation reldesc
Definition: relcache.c:128
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
bool criticalSharedRelcachesBuilt
Definition: relcache.c:143
#define AuthIdOidIndexId
Definition: indexing.h:101
static HTAB * RelationIdCache
Definition: relcache.c:131
Form_pg_class rd_rel
Definition: rel.h:109
#define TriggerRelidNameIndexId
Definition: indexing.h:253
void RelationDecrementReferenceCount(Relation rel)
Definition: relcache.c:2083
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int32 tdtypmod
Definition: tupdesc.h:83
#define FATAL
Definition: elog.h:52
static void write_relcache_init_file(bool shared)
Definition: relcache.c:6024
TriggerDesc * trigdesc
Definition: rel.h:115
static void RelationParseRelOptions(Relation relation, HeapTuple tuple)
Definition: relcache.c:440
static void load_critical_index(Oid indexoid, Oid heapoid)
Definition: relcache.c:4139
static const FormData_pg_attribute Desc_pg_proc[Natts_pg_proc]
Definition: relcache.c:110
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define DatabaseOidIndexId
Definition: indexing.h:146
#define ClassOidIndexId
Definition: indexing.h:114
struct RowSecurityDesc * rd_rsdesc
Definition: rel.h:117
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
#define AccessMethodProcedureIndexId
Definition: indexing.h:84
void RelationIncrementReferenceCount(Relation rel)
Definition: relcache.c:2070
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
const struct TableAmRoutine * rd_tableam
Definition: rel.h:171
TupleDesc rd_att
Definition: rel.h:110
#define OpclassOidIndexId
Definition: indexing.h:197
#define InvalidOid
Definition: postgres_ext.h:36
#define CLASS_TUPLE_SIZE
Definition: pg_class.h:145
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
#define AuthMemMemRoleIndexId
Definition: indexing.h:106
RuleLock * rd_rules
Definition: rel.h:113
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1391
#define DatabaseNameIndexId
Definition: indexing.h:144
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1381
#define SharedSecLabelObjectIndexId
Definition: indexing.h:320
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
Oid tdtypeid
Definition: tupdesc.h:82
void RelationBuildTriggers(Relation relation)
Definition: trigger.c:1592
static void formrdesc(const char *relationName, Oid relationReltype, bool isshared, int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:1809
static const FormData_pg_attribute Desc_pg_class[Natts_pg_class]
Definition: relcache.c:108
#define elog(elevel,...)
Definition: elog.h:214
void RelationMapInitializePhase3(void)
Definition: relmapper.c:625
static void RelationBuildRuleLock(Relation relation)
Definition: relcache.c:735
bool criticalRelcachesBuilt
Definition: relcache.c:137
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:225
#define AuthIdRolnameIndexId
Definition: indexing.h:99
void InitCatalogCachePhase2(void)
Definition: syscache.c:1075
#define RelationGetRelid(relation)
Definition: rel.h:456
static const FormData_pg_attribute Desc_pg_type[Natts_pg_type]
Definition: relcache.c:111
bytea * rd_options
Definition: rel.h:157
void hash_seq_term(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1467
static const FormData_pg_attribute Desc_pg_attribute[Natts_pg_attribute]
Definition: relcache.c:109
MemoryContext CacheMemoryContext
Definition: mcxt.c:47

◆ RelationCacheInvalidate()

void RelationCacheInvalidate ( void  )

Definition at line 2824 of file relcache.c.

References Assert, ClassOidIndexId, hash_seq_init(), hash_seq_search(), InvalidSubTransactionId, lappend(), lcons(), lfirst, list_free(), NIL, RelationData::rd_createSubid, RelationData::rd_firstRelfilenodeSubid, RelationData::rd_isnailed, RelationClearRelation(), RelationCloseSmgr, RelationGetRelid, RelationHasReferenceCountZero, RelationInitPhysicalAddr(), RelationIsMapped, RelationMapInvalidateAll(), relcacheInvalsReceived, relidcacheent::reldesc, smgrcloseall(), and status().

Referenced by InvalidateSystemCaches(), and LocalExecuteInvalidationMessage().

2825 {
2827  RelIdCacheEnt *idhentry;
2828  Relation relation;
2829  List *rebuildFirstList = NIL;
2830  List *rebuildList = NIL;
2831  ListCell *l;
2832 
2833  /*
2834  * Reload relation mapping data before starting to reconstruct cache.
2835  */
2837 
2838  /* Phase 1 */
2839  hash_seq_init(&status, RelationIdCache);
2840 
2841  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
2842  {
2843  relation = idhentry->reldesc;
2844 
2845  /* Must close all smgr references to avoid leaving dangling ptrs */
2846  RelationCloseSmgr(relation);
2847 
2848  /*
2849  * Ignore new relations; no other backend will manipulate them before
2850  * we commit. Likewise, before replacing a relation's relfilenode, we
2851  * shall have acquired AccessExclusiveLock and drained any applicable
2852  * pending invalidations.
2853  */
2854  if (relation->rd_createSubid != InvalidSubTransactionId ||
2856  continue;
2857 
2859 
2860  if (RelationHasReferenceCountZero(relation))
2861  {
2862  /* Delete this entry immediately */
2863  Assert(!relation->rd_isnailed);
2864  RelationClearRelation(relation, false);
2865  }
2866  else
2867  {
2868  /*
2869  * If it's a mapped relation, immediately update its rd_node in
2870  * case its relfilenode changed. We must do this during phase 1
2871  * in case the relation is consulted during rebuild of other
2872  * relcache entries in phase 2. It's safe since consulting the
2873  * map doesn't involve any access to relcache entries.
2874  */
2875  if (RelationIsMapped(relation))
2876  RelationInitPhysicalAddr(relation);
2877 
2878  /*
2879  * Add this entry to list of stuff to rebuild in second pass.
2880  * pg_class goes to the front of rebuildFirstList while
2881  * pg_class_oid_index goes to the back of rebuildFirstList, so
2882  * they are done first and second respectively. Other nailed
2883  * relations go to the front of rebuildList, so they'll be done
2884  * next in no particular order; and everything else goes to the
2885  * back of rebuildList.
2886  */
2887  if (RelationGetRelid(relation) == RelationRelationId)
2888  rebuildFirstList = lcons(relation, rebuildFirstList);
2889  else if (RelationGetRelid(relation) == ClassOidIndexId)
2890  rebuildFirstList = lappend(rebuildFirstList, relation);
2891  else if (relation->rd_isnailed)
2892  rebuildList = lcons(relation, rebuildList);
2893  else
2894  rebuildList = lappend(rebuildList, relation);
2895  }
2896  }
2897 
2898  /*
2899  * Now zap any remaining smgr cache entries. This must happen before we
2900  * start to rebuild entries, since that may involve catalog fetches which
2901  * will re-open catalog files.
2902  */
2903  smgrcloseall();
2904 
2905  /* Phase 2: rebuild the items found to need rebuild in phase 1 */
2906  foreach(l, rebuildFirstList)
2907  {
2908  relation = (Relation) lfirst(l);
2909  RelationClearRelation(relation, true);
2910  }
2911  list_free(rebuildFirstList);
2912  foreach(l, rebuildList)
2913  {
2914  relation = (Relation) lfirst(l);
2915  RelationClearRelation(relation, true);
2916  }
2917  list_free(rebuildList);
2918 }
#define NIL
Definition: pg_list.h:65
static long relcacheInvalsReceived
Definition: relcache.c:151
static void RelationClearRelation(Relation relation, bool rebuild)
Definition: relcache.c:2424
bool rd_isnailed
Definition: rel.h:61
Relation reldesc
Definition: relcache.c:128
#define RelationCloseSmgr(relation)
Definition: rel.h:525
static HTAB * RelationIdCache
Definition: relcache.c:131
void smgrcloseall(void)
Definition: smgr.c:286
struct RelationData * Relation
Definition: relcache.h:27
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1274
#define ClassOidIndexId
Definition: indexing.h:114
List * lappend(List *list, void *datum)
Definition: list.c:321
#define RelationIsMapped(relation)
Definition: rel.h:505
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_firstRelfilenodeSubid
Definition: rel.h:105
List * lcons(void *datum, List *list)
Definition: list.c:453
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
#define InvalidSubTransactionId
Definition: c.h:519
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1391
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1381
#define RelationHasReferenceCountZero(relation)
Definition: rel.h:440
void list_free(List *list)
Definition: list.c:1376
void RelationMapInvalidateAll(void)
Definition: relmapper.c:425
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:225
Definition: pg_list.h:50
#define RelationGetRelid(relation)
Definition: rel.h:456

◆ RelationCacheInvalidateEntry()

void RelationCacheInvalidateEntry ( Oid  relationId)

Definition at line 2781 of file relcache.c.

References PointerIsValid, RelationFlushRelation(), RelationIdCacheLookup, and relcacheInvalsReceived.

Referenced by LocalExecuteInvalidationMessage().

2782 {
2783  Relation relation;
2784 
2785  RelationIdCacheLookup(relationId, relation);
2786 
2787  if (PointerIsValid(relation))
2788  {
2790  RelationFlushRelation(relation);
2791  }
2792 }
static long relcacheInvalsReceived
Definition: relcache.c:151
#define RelationIdCacheLookup(ID, RELATION)
Definition: relcache.c:210
static void RelationFlushRelation(Relation relation)
Definition: relcache.c:2704
#define PointerIsValid(pointer)
Definition: c.h:632

◆ RelationClearRelation()

static void RelationClearRelation ( Relation  relation,
bool  rebuild 
)
static

Definition at line 2424 of file relcache.c.

References Assert, CLASS_TUPLE_SIZE, elog, equalRSDesc(), equalRuleLocks(), equalTupleDescs(), ERROR, HistoricSnapshotActive(), InvalidSubTransactionId, IsTransactionState(), MemoryContextSetParent(), pfree(), RelationData::rd_amcache, RelationData::rd_att, RelationData::rd_droppedSubid, RelationData::rd_indexcxt, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_partdesc, RelationData::rd_partkey, RelationData::rd_pdcxt, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_rsdesc, RelationData::rd_rules, RelationBuildDesc(), RelationCacheDelete, RelationCloseSmgr, RelationDestroyRelation(), RelationGetRelid, RelationHasReferenceCountZero, RelationReloadIndexInfo(), RelationReloadNailed(), and SWAPFIELD.

Referenced by AtEOSubXact_cleanup(), AtEOXact_cleanup(), RelationCacheInvalidate(), RelationClose(), RelationFlushRelation(), RelationForgetRelation(), and RelationIdGetRelation().

2425 {
2426  /*
2427  * As per notes above, a rel to be rebuilt MUST have refcnt > 0; while of
2428  * course it would be an equally bad idea to blow away one with nonzero
2429  * refcnt, since that would leave someone somewhere with a dangling
2430  * pointer. All callers are expected to have verified that this holds.
2431  */
2432  Assert(rebuild ?
2433  !RelationHasReferenceCountZero(relation) :
2434  RelationHasReferenceCountZero(relation));
2435 
2436  /*
2437  * Make sure smgr and lower levels close the relation's files, if they
2438  * weren't closed already. If the relation is not getting deleted, the
2439  * next smgr access should reopen the files automatically. This ensures
2440  * that the low-level file access state is updated after, say, a vacuum
2441  * truncation.
2442  */
2443  RelationCloseSmgr(relation);
2444 
2445  /* Free AM cached data, if any */
2446  if (relation->rd_amcache)
2447  pfree(relation->rd_amcache);
2448  relation->rd_amcache = NULL;
2449 
2450  /*
2451  * Treat nailed-in system relations separately, they always need to be
2452  * accessible, so we can't blow them away.
2453  */
2454  if (relation->rd_isnailed)
2455  {
2456  RelationReloadNailed(relation);
2457  return;
2458  }
2459 
2460  /* Mark it invalid until we've finished rebuild */
2461  relation->rd_isvalid = false;
2462 
2463  /* See RelationForgetRelation(). */
2464  if (relation->rd_droppedSubid != InvalidSubTransactionId)
2465  return;
2466 
2467  /*
2468  * Even non-system indexes should not be blown away if they are open and
2469  * have valid index support information. This avoids problems with active
2470  * use of the index support information. As with nailed indexes, we
2471  * re-read the pg_class row to handle possible physical relocation of the
2472  * index, and we check for pg_index updates too.
2473  */
2474  if ((relation->rd_rel->relkind == RELKIND_INDEX ||
2475  relation->rd_rel->relkind == RELKIND_PARTITIONED_INDEX) &&
2476  relation->rd_refcnt > 0 &&
2477  relation->rd_indexcxt != NULL)
2478  {
2479  if (IsTransactionState())
2480  RelationReloadIndexInfo(relation);
2481  return;
2482  }
2483 
2484  /*
2485  * If we're really done with the relcache entry, blow it away. But if
2486  * someone is still using it, reconstruct the whole deal without moving
2487  * the physical RelationData record (so that the someone's pointer is
2488  * still valid).
2489  */
2490  if (!rebuild)
2491  {
2492  /* Remove it from the hash table */
2493  RelationCacheDelete(relation);
2494 
2495  /* And release storage */
2496  RelationDestroyRelation(relation, false);
2497  }
2498  else if (!IsTransactionState())
2499  {
2500  /*
2501  * If we're not inside a valid transaction, we can't do any catalog
2502  * access so it's not possible to rebuild yet. Just exit, leaving
2503  * rd_isvalid = false so that the rebuild will occur when the entry is
2504  * next opened.
2505  *
2506  * Note: it's possible that we come here during subtransaction abort,
2507  * and the reason for wanting to rebuild is that the rel is open in
2508  * the outer transaction. In that case it might seem unsafe to not
2509  * rebuild immediately, since whatever code has the rel already open
2510  * will keep on using the relcache entry as-is. However, in such a
2511  * case the outer transaction should be holding a lock that's
2512  * sufficient to prevent any significant change in the rel's schema,
2513  * so the existing entry contents should be good enough for its
2514  * purposes; at worst we might be behind on statistics updates or the
2515  * like. (See also CheckTableNotInUse() and its callers.) These same
2516  * remarks also apply to the cases above where we exit without having
2517  * done RelationReloadIndexInfo() yet.
2518  */
2519  return;
2520  }
2521  else
2522  {
2523  /*
2524  * Our strategy for rebuilding an open relcache entry is to build a
2525  * new entry from scratch, swap its contents with the old entry, and
2526  * finally delete the new entry (along with any infrastructure swapped
2527  * over from the old entry). This is to avoid trouble in case an
2528  * error causes us to lose control partway through. The old entry
2529  * will still be marked !rd_isvalid, so we'll try to rebuild it again
2530  * on next access. Meanwhile it's not any less valid than it was
2531  * before, so any code that might expect to continue accessing it
2532  * isn't hurt by the rebuild failure. (Consider for example a
2533  * subtransaction that ALTERs a table and then gets canceled partway
2534  * through the cache entry rebuild. The outer transaction should
2535  * still see the not-modified cache entry as valid.) The worst
2536  * consequence of an error is leaking the necessarily-unreferenced new
2537  * entry, and this shouldn't happen often enough for that to be a big
2538  * problem.
2539  *
2540  * When rebuilding an open relcache entry, we must preserve ref count,
2541  * rd_*Subid, and rd_toastoid state. Also attempt to preserve the
2542  * pg_class entry (rd_rel), tupledesc, rewrite-rule, partition key,
2543  * and partition descriptor substructures in place, because various
2544  * places assume that these structures won't move while they are
2545  * working with an open relcache entry. (Note: the refcount
2546  * mechanism for tupledescs might someday allow us to remove this hack
2547  * for the tupledesc.)
2548  *
2549  * Note that this process does not touch CurrentResourceOwner; which
2550  * is good because whatever ref counts the entry may have do not
2551  * necessarily belong to that resource owner.
2552  */
2553  Relation newrel;
2554  Oid save_relid = RelationGetRelid(relation);
2555  bool keep_tupdesc;
2556  bool keep_rules;
2557  bool keep_policies;
2558  bool keep_partkey;
2559 
2560  /* Build temporary entry, but don't link it into hashtable */
2561  newrel = RelationBuildDesc(save_relid, false);
2562  if (newrel == NULL)
2563  {
2564  /*
2565  * We can validly get here, if we're using a historic snapshot in
2566  * whic