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/binary_upgrade.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/publicationcmds.h"
#include "commands/trigger.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/optimizer.h"
#include "pgstat.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  inprogressent
 
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 inprogressent InProgressEnt
 
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, int ndef)
 
static int AttrDefaultCmp (const void *a, const void *b)
 
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 (bool debug_discard)
 
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, RelFileNumber relfilenumber, Oid reltablespace, bool shared_relation, bool mapped_relation, char relpersistence, char relkind)
 
void RelationSetNewRelfilenumber (Relation relation, char persistence)
 
void RelationAssumeNewRelfilelocator (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)
 
BitmapsetRelationGetIdentityKeyBitmap (Relation relation)
 
void RelationGetExclusionInfo (Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
 
void RelationBuildPublicationDesc (Relation relation, PublicationDesc *pubdesc)
 
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 InProgressEntin_progress_list
 
static int in_progress_list_len
 
static int in_progress_list_maxlen
 
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:184
static int eoxact_list_len
Definition: relcache.c:186

Definition at line 189 of file relcache.c.

◆ INITRELCACHESIZE

#define INITRELCACHESIZE   400

Definition at line 3931 of file relcache.c.

◆ MAX_EOXACT_LIST

#define MAX_EOXACT_LIST   32

Definition at line 184 of file relcache.c.

◆ NUM_CRITICAL_LOCAL_INDEXES

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

◆ NUM_CRITICAL_LOCAL_RELS

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

◆ NUM_CRITICAL_SHARED_INDEXES

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

◆ NUM_CRITICAL_SHARED_RELS

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

◆ RECOVER_RELATION_BUILD_MEMORY

#define RECOVER_RELATION_BUILD_MEMORY   0

Definition at line 102 of file relcache.c.

◆ RelationCacheDelete

#define RelationCacheDelete (   RELATION)
Value:
do { \
RelIdCacheEnt *hentry; \
&((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:953
#define WARNING
Definition: elog.h:36
static HTAB * RelationIdCache
Definition: relcache.c:134

Definition at line 243 of file relcache.c.

◆ RelationCacheInsert

#define RelationCacheInsert (   RELATION,
  replace_allowed 
)
Value:
do { \
RelIdCacheEnt *hentry; bool found; \
&((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)
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:405
#define RelationHasReferenceCountZero(relation)
Definition: rel.h:487
#define RelationGetRelationName(relation)
Definition: rel.h:537

Definition at line 209 of file relcache.c.

◆ RelationIdCacheLookup

#define RelationIdCacheLookup (   ID,
  RELATION 
)
Value:
do { \
RelIdCacheEnt *hentry; \
&(ID), \
HASH_FIND, NULL); \
if (hentry) \
RELATION = hentry->reldesc; \
else \
RELATION = NULL; \
} while(0)

Definition at line 231 of file relcache.c.

◆ RELCACHE_INIT_FILEMAGIC

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

Definition at line 93 of file relcache.c.

◆ SWAPFIELD

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

Typedef Documentation

◆ InProgressEnt

typedef struct inprogressent InProgressEnt

◆ OpClassCacheEnt

◆ RelIdCacheEnt

typedef struct relidcacheent RelIdCacheEnt

Function Documentation

◆ AllocateRelationDesc()

static Relation AllocateRelationDesc ( Form_pg_class  relp)
static

Definition at line 407 of file relcache.c.

408 {
409  Relation relation;
410  MemoryContext oldcxt;
411  Form_pg_class relationForm;
412 
413  /* Relcache entries must live in CacheMemoryContext */
415 
416  /*
417  * allocate and zero space for new relation descriptor
418  */
419  relation = (Relation) palloc0(sizeof(RelationData));
420 
421  /* make sure relation is marked as having no open file yet */
422  relation->rd_smgr = NULL;
423 
424  /*
425  * Copy the relation tuple form
426  *
427  * We only allocate space for the fixed fields, ie, CLASS_TUPLE_SIZE. The
428  * variable-length fields (relacl, reloptions) are NOT stored in the
429  * relcache --- there'd be little point in it, since we don't copy the
430  * tuple's nulls bitmap and hence wouldn't know if the values are valid.
431  * Bottom line is that relacl *cannot* be retrieved from the relcache. Get
432  * it from the syscache if you need it. The same goes for the original
433  * form of reloptions (however, we do store the parsed form of reloptions
434  * in rd_options).
435  */
436  relationForm = (Form_pg_class) palloc(CLASS_TUPLE_SIZE);
437 
438  memcpy(relationForm, relp, CLASS_TUPLE_SIZE);
439 
440  /* initialize relation tuple form */
441  relation->rd_rel = relationForm;
442 
443  /* and allocate attribute tuple form storage */
444  relation->rd_att = CreateTemplateTupleDesc(relationForm->relnatts);
445  /* which we mark as a reference-counted tupdesc */
446  relation->rd_att->tdrefcount = 1;
447 
448  MemoryContextSwitchTo(oldcxt);
449 
450  return relation;
451 }
void * palloc0(Size size)
Definition: mcxt.c:1241
MemoryContext CacheMemoryContext
Definition: mcxt.c:144
void * palloc(Size size)
Definition: mcxt.c:1210
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:138
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define CLASS_TUPLE_SIZE
Definition: pg_class.h:145
struct RelationData * Relation
Definition: relcache.h:27
TupleDesc rd_att
Definition: rel.h:111
SMgrRelation rd_smgr
Definition: rel.h:57
Form_pg_class rd_rel
Definition: rel.h:110
int tdrefcount
Definition: tupdesc.h:84
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:45

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

Referenced by RelationBuildDesc().

◆ AtEOSubXact_cleanup()

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

Definition at line 3384 of file relcache.c.

3386 {
3387  /*
3388  * Is it a relation created in the current subtransaction?
3389  *
3390  * During subcommit, mark it as belonging to the parent, instead, as long
3391  * as it has not been dropped. Otherwise simply delete the relcache entry.
3392  * --- it isn't interesting any longer.
3393  */
3394  if (relation->rd_createSubid == mySubid)
3395  {
3396  /*
3397  * Valid rd_droppedSubid means the corresponding relation is dropped
3398  * but the relcache entry is preserved for at-commit pending sync. We
3399  * need to drop it explicitly here not to make the entry orphan.
3400  */
3401  Assert(relation->rd_droppedSubid == mySubid ||
3403  if (isCommit && relation->rd_droppedSubid == InvalidSubTransactionId)
3404  relation->rd_createSubid = parentSubid;
3405  else if (RelationHasReferenceCountZero(relation))
3406  {
3407  /* allow the entry to be removed */
3412  RelationClearRelation(relation, false);
3413  return;
3414  }
3415  else
3416  {
3417  /*
3418  * Hmm, somewhere there's a (leaked?) reference to the relation.
3419  * We daren't remove the entry for fear of dereferencing a
3420  * dangling pointer later. Bleat, and transfer it to the parent
3421  * subtransaction so we can try again later. This must be just a
3422  * WARNING to avoid error-during-error-recovery loops.
3423  */
3424  relation->rd_createSubid = parentSubid;
3425  elog(WARNING, "cannot remove relcache entry for \"%s\" because it has nonzero refcount",
3426  RelationGetRelationName(relation));
3427  }
3428  }
3429 
3430  /*
3431  * Likewise, update or drop any new-relfilenumber-in-subtransaction record
3432  * or drop record.
3433  */
3434  if (relation->rd_newRelfilelocatorSubid == mySubid)
3435  {
3436  if (isCommit)
3437  relation->rd_newRelfilelocatorSubid = parentSubid;
3438  else
3440  }
3441 
3442  if (relation->rd_firstRelfilelocatorSubid == mySubid)
3443  {
3444  if (isCommit)
3445  relation->rd_firstRelfilelocatorSubid = parentSubid;
3446  else
3448  }
3449 
3450  if (relation->rd_droppedSubid == mySubid)
3451  {
3452  if (isCommit)
3453  relation->rd_droppedSubid = parentSubid;
3454  else
3456  }
3457 }
#define InvalidSubTransactionId
Definition: c.h:642
Assert(fmt[strlen(fmt) - 1] !='\n')
static void RelationClearRelation(Relation relation, bool rebuild)
Definition: relcache.c:2495
SubTransactionId rd_firstRelfilelocatorSubid
Definition: rel.h:105
SubTransactionId rd_newRelfilelocatorSubid
Definition: rel.h:103
SubTransactionId rd_createSubid
Definition: rel.h:102
SubTransactionId rd_droppedSubid
Definition: rel.h:108

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

Referenced by AtEOSubXact_RelationCache().

◆ AtEOSubXact_RelationCache()

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

Definition at line 3329 of file relcache.c.

3331 {
3333  RelIdCacheEnt *idhentry;
3334  int i;
3335 
3336  /*
3337  * Forget in_progress_list. This is relevant when we're aborting due to
3338  * an error during RelationBuildDesc(). We don't commit subtransactions
3339  * during RelationBuildDesc().
3340  */
3341  Assert(in_progress_list_len == 0 || !isCommit);
3343 
3344  /*
3345  * Unless the eoxact_list[] overflowed, we only need to examine the rels
3346  * listed in it. Otherwise fall back on a hash_seq_search scan. Same
3347  * logic as in AtEOXact_RelationCache.
3348  */
3350  {
3352  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
3353  {
3354  AtEOSubXact_cleanup(idhentry->reldesc, isCommit,
3355  mySubid, parentSubid);
3356  }
3357  }
3358  else
3359  {
3360  for (i = 0; i < eoxact_list_len; i++)
3361  {
3362  idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
3363  &eoxact_list[i],
3364  HASH_FIND,
3365  NULL);
3366  if (idhentry != NULL)
3367  AtEOSubXact_cleanup(idhentry->reldesc, isCommit,
3368  mySubid, parentSubid);
3369  }
3370  }
3371 
3372  /* Don't reset the list; we still need more cleanup later */
3373 }
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1431
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1421
@ HASH_FIND
Definition: hsearch.h:113
int i
Definition: isn.c:73
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:224
static Oid eoxact_list[MAX_EOXACT_LIST]
Definition: relcache.c:185
static int in_progress_list_len
Definition: relcache.c:171
static void AtEOSubXact_cleanup(Relation relation, bool isCommit, SubTransactionId mySubid, SubTransactionId parentSubid)
Definition: relcache.c:3384
static bool eoxact_list_overflowed
Definition: relcache.c:187
Relation reldesc
Definition: relcache.c:131

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

Referenced by AbortSubTransaction(), and CommitSubTransaction().

◆ AtEOXact_cleanup()

static void AtEOXact_cleanup ( Relation  relation,
bool  isCommit 
)
static

Definition at line 3247 of file relcache.c.

3248 {
3249  bool clear_relcache = false;
3250 
3251  /*
3252  * The relcache entry's ref count should be back to its normal
3253  * not-in-a-transaction state: 0 unless it's nailed in cache.
3254  *
3255  * In bootstrap mode, this is NOT true, so don't check it --- the
3256  * bootstrap code expects relations to stay open across start/commit
3257  * transaction calls. (That seems bogus, but it's not worth fixing.)
3258  *
3259  * Note: ideally this check would be applied to every relcache entry, not
3260  * just those that have eoxact work to do. But it's not worth forcing a
3261  * scan of the whole relcache just for this. (Moreover, doing so would
3262  * mean that assert-enabled testing never tests the hash_search code path
3263  * above, which seems a bad idea.)
3264  */
3265 #ifdef USE_ASSERT_CHECKING
3267  {
3268  int expected_refcnt;
3269 
3270  expected_refcnt = relation->rd_isnailed ? 1 : 0;
3271  Assert(relation->rd_refcnt == expected_refcnt);
3272  }
3273 #endif
3274 
3275  /*
3276  * Is the relation live after this transaction ends?
3277  *
3278  * During commit, clear the relcache entry if it is preserved after
3279  * relation drop, in order not to orphan the entry. During rollback,
3280  * clear the relcache entry if the relation is created in the current
3281  * transaction since it isn't interesting any longer once we are out of
3282  * the transaction.
3283  */
3284  clear_relcache =
3285  (isCommit ?
3288 
3289  /*
3290  * Since we are now out of the transaction, reset the subids to zero. That
3291  * also lets RelationClearRelation() drop the relcache entry.
3292  */
3297 
3298  if (clear_relcache)
3299  {
3300  if (RelationHasReferenceCountZero(relation))
3301  {
3302  RelationClearRelation(relation, false);
3303  return;
3304  }
3305  else
3306  {
3307  /*
3308  * Hmm, somewhere there's a (leaked?) reference to the relation.
3309  * We daren't remove the entry for fear of dereferencing a
3310  * dangling pointer later. Bleat, and mark it as not belonging to
3311  * the current transaction. Hopefully it'll get cleaned up
3312  * eventually. This must be just a WARNING to avoid
3313  * error-during-error-recovery loops.
3314  */
3315  elog(WARNING, "cannot remove relcache entry for \"%s\" because it has nonzero refcount",
3316  RelationGetRelationName(relation));
3317  }
3318  }
3319 }
int rd_refcnt
Definition: rel.h:58
bool rd_isnailed
Definition: rel.h:61

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

Referenced by AtEOXact_RelationCache().

◆ AtEOXact_RelationCache()

void AtEOXact_RelationCache ( bool  isCommit)

Definition at line 3177 of file relcache.c.

3178 {
3180  RelIdCacheEnt *idhentry;
3181  int i;
3182 
3183  /*
3184  * Forget in_progress_list. This is relevant when we're aborting due to
3185  * an error during RelationBuildDesc().
3186  */
3187  Assert(in_progress_list_len == 0 || !isCommit);
3189 
3190  /*
3191  * Unless the eoxact_list[] overflowed, we only need to examine the rels
3192  * listed in it. Otherwise fall back on a hash_seq_search scan.
3193  *
3194  * For simplicity, eoxact_list[] entries are not deleted till end of
3195  * top-level transaction, even though we could remove them at
3196  * subtransaction end in some cases, or remove relations from the list if
3197  * they are cleared for other reasons. Therefore we should expect the
3198  * case that list entries are not found in the hashtable; if not, there's
3199  * nothing to do for them.
3200  */
3202  {
3204  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
3205  {
3206  AtEOXact_cleanup(idhentry->reldesc, isCommit);
3207  }
3208  }
3209  else
3210  {
3211  for (i = 0; i < eoxact_list_len; i++)
3212  {
3213  idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
3214  &eoxact_list[i],
3215  HASH_FIND,
3216  NULL);
3217  if (idhentry != NULL)
3218  AtEOXact_cleanup(idhentry->reldesc, isCommit);
3219  }
3220  }
3221 
3222  if (EOXactTupleDescArrayLen > 0)
3223  {
3224  Assert(EOXactTupleDescArray != NULL);
3225  for (i = 0; i < NextEOXactTupleDescNum; i++)
3228  EOXactTupleDescArray = NULL;
3229  }
3230 
3231  /* Now we're out of the transaction and can clear the lists */
3232  eoxact_list_len = 0;
3233  eoxact_list_overflowed = false;
3236 }
void pfree(void *pointer)
Definition: mcxt.c:1436
static int NextEOXactTupleDescNum
Definition: relcache.c:203
static int EOXactTupleDescArrayLen
Definition: relcache.c:204
static void AtEOXact_cleanup(Relation relation, bool isCommit)
Definition: relcache.c:3247
static TupleDesc * EOXactTupleDescArray
Definition: relcache.c:202
void FreeTupleDesc(TupleDesc tupdesc)
Definition: tupdesc.c:309

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

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

◆ AttrDefaultCmp()

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

Definition at line 4503 of file relcache.c.

4504 {
4505  const AttrDefault *ada = (const AttrDefault *) a;
4506  const AttrDefault *adb = (const AttrDefault *) b;
4507 
4508  return ada->adnum - adb->adnum;
4509 }
int b
Definition: isn.c:70
int a
Definition: isn.c:69
AttrNumber adnum
Definition: tupdesc.h:24

References a, AttrDefault::adnum, and b.

Referenced by AttrDefaultFetch().

◆ AttrDefaultFetch()

static void AttrDefaultFetch ( Relation  relation,
int  ndef 
)
static

Definition at line 4423 of file relcache.c.

4424 {
4425  AttrDefault *attrdef;
4426  Relation adrel;
4427  SysScanDesc adscan;
4428  ScanKeyData skey;
4429  HeapTuple htup;
4430  int found = 0;
4431 
4432  /* Allocate array with room for as many entries as expected */
4433  attrdef = (AttrDefault *)
4435  ndef * sizeof(AttrDefault));
4436 
4437  /* Search pg_attrdef for relevant entries */
4438  ScanKeyInit(&skey,
4439  Anum_pg_attrdef_adrelid,
4440  BTEqualStrategyNumber, F_OIDEQ,
4441  ObjectIdGetDatum(RelationGetRelid(relation)));
4442 
4443  adrel = table_open(AttrDefaultRelationId, AccessShareLock);
4444  adscan = systable_beginscan(adrel, AttrDefaultIndexId, true,
4445  NULL, 1, &skey);
4446 
4447  while (HeapTupleIsValid(htup = systable_getnext(adscan)))
4448  {
4449  Form_pg_attrdef adform = (Form_pg_attrdef) GETSTRUCT(htup);
4450  Datum val;
4451  bool isnull;
4452 
4453  /* protect limited size of array */
4454  if (found >= ndef)
4455  {
4456  elog(WARNING, "unexpected pg_attrdef record found for attribute %d of relation \"%s\"",
4457  adform->adnum, RelationGetRelationName(relation));
4458  break;
4459  }
4460 
4461  val = fastgetattr(htup,
4462  Anum_pg_attrdef_adbin,
4463  adrel->rd_att, &isnull);
4464  if (isnull)
4465  elog(WARNING, "null adbin for attribute %d of relation \"%s\"",
4466  adform->adnum, RelationGetRelationName(relation));
4467  else
4468  {
4469  /* detoast and convert to cstring in caller's context */
4470  char *s = TextDatumGetCString(val);
4471 
4472  attrdef[found].adnum = adform->adnum;
4473  attrdef[found].adbin = MemoryContextStrdup(CacheMemoryContext, s);
4474  pfree(s);
4475  found++;
4476  }
4477  }
4478 
4479  systable_endscan(adscan);
4480  table_close(adrel, AccessShareLock);
4481 
4482  if (found != ndef)
4483  elog(WARNING, "%d pg_attrdef record(s) missing for relation \"%s\"",
4484  ndef - found, RelationGetRelationName(relation));
4485 
4486  /*
4487  * Sort the AttrDefault entries by adnum, for the convenience of
4488  * equalTupleDescs(). (Usually, they already will be in order, but this
4489  * might not be so if systable_getnext isn't using an index.)
4490  */
4491  if (found > 1)
4492  qsort(attrdef, found, sizeof(AttrDefault), AttrDefaultCmp);
4493 
4494  /* Install array only after it's fully valid */
4495  relation->rd_att->constr->defval = attrdef;
4496  relation->rd_att->constr->num_defval = found;
4497 }
#define TextDatumGetCString(d)
Definition: builtins.h:95
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:599
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:506
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:387
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
static Datum fastgetattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
Definition: htup_details.h:749
long val
Definition: informix.c:664
#define AccessShareLock
Definition: lockdefs.h:36
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:1048
char * MemoryContextStrdup(MemoryContext context, const char *string)
Definition: mcxt.c:1611
FormData_pg_attrdef * Form_pg_attrdef
Definition: pg_attrdef.h:49
#define qsort(a, b, c, d)
Definition: port.h:445
uintptr_t Datum
Definition: postgres.h:64
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
#define RelationGetRelid(relation)
Definition: rel.h:503
static int AttrDefaultCmp(const void *a, const void *b)
Definition: relcache.c:4503
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
#define BTEqualStrategyNumber
Definition: stratnum.h:31
char * adbin
Definition: tupdesc.h:25
AttrDefault * defval
Definition: tupdesc.h:39
uint16 num_defval
Definition: tupdesc.h:42
TupleConstr * constr
Definition: tupdesc.h:85
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40

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

Referenced by RelationBuildTupleDesc().

◆ BuildHardcodedDescriptor()

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

Definition at line 4358 of file relcache.c.

4359 {
4360  TupleDesc result;
4361  MemoryContext oldcxt;
4362  int i;
4363 
4365 
4366  result = CreateTemplateTupleDesc(natts);
4367  result->tdtypeid = RECORDOID; /* not right, but we don't care */
4368  result->tdtypmod = -1;
4369 
4370  for (i = 0; i < natts; i++)
4371  {
4372  memcpy(TupleDescAttr(result, i), &attrs[i], ATTRIBUTE_FIXED_PART_SIZE);
4373  /* make sure attcacheoff is valid */
4374  TupleDescAttr(result, i)->attcacheoff = -1;
4375  }
4376 
4377  /* initialize first attribute's attcacheoff, cf RelationBuildTupleDesc */
4378  TupleDescAttr(result, 0)->attcacheoff = 0;
4379 
4380  /* Note: we don't bother to set up a TupleConstr entry */
4381 
4382  MemoryContextSwitchTo(oldcxt);
4383 
4384  return result;
4385 }
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:199
int32 tdtypmod
Definition: tupdesc.h:83
Oid tdtypeid
Definition: tupdesc.h:82
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92

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

Referenced by GetPgClassDescriptor(), and GetPgIndexDescriptor().

◆ CheckConstraintCmp()

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

Definition at line 4607 of file relcache.c.

4608 {
4609  const ConstrCheck *ca = (const ConstrCheck *) a;
4610  const ConstrCheck *cb = (const ConstrCheck *) b;
4611 
4612  return strcmp(ca->ccname, cb->ccname);
4613 }
char * ccname
Definition: tupdesc.h:30

References a, b, and ConstrCheck::ccname.

Referenced by CheckConstraintFetch().

◆ CheckConstraintFetch()

static void CheckConstraintFetch ( Relation  relation)
static

Definition at line 4518 of file relcache.c.

4519 {
4520  ConstrCheck *check;
4521  int ncheck = relation->rd_rel->relchecks;
4522  Relation conrel;
4523  SysScanDesc conscan;
4524  ScanKeyData skey[1];
4525  HeapTuple htup;
4526  int found = 0;
4527 
4528  /* Allocate array with room for as many entries as expected */
4529  check = (ConstrCheck *)
4531  ncheck * sizeof(ConstrCheck));
4532 
4533  /* Search pg_constraint for relevant entries */
4534  ScanKeyInit(&skey[0],
4535  Anum_pg_constraint_conrelid,
4536  BTEqualStrategyNumber, F_OIDEQ,
4537  ObjectIdGetDatum(RelationGetRelid(relation)));
4538 
4539  conrel = table_open(ConstraintRelationId, AccessShareLock);
4540  conscan = systable_beginscan(conrel, ConstraintRelidTypidNameIndexId, true,
4541  NULL, 1, skey);
4542 
4543  while (HeapTupleIsValid(htup = systable_getnext(conscan)))
4544  {
4546  Datum val;
4547  bool isnull;
4548 
4549  /* We want check constraints only */
4550  if (conform->contype != CONSTRAINT_CHECK)
4551  continue;
4552 
4553  /* protect limited size of array */
4554  if (found >= ncheck)
4555  {
4556  elog(WARNING, "unexpected pg_constraint record found for relation \"%s\"",
4557  RelationGetRelationName(relation));
4558  break;
4559  }
4560 
4561  check[found].ccvalid = conform->convalidated;
4562  check[found].ccnoinherit = conform->connoinherit;
4564  NameStr(conform->conname));
4565 
4566  /* Grab and test conbin is actually set */
4567  val = fastgetattr(htup,
4568  Anum_pg_constraint_conbin,
4569  conrel->rd_att, &isnull);
4570  if (isnull)
4571  elog(WARNING, "null conbin for relation \"%s\"",
4572  RelationGetRelationName(relation));
4573  else
4574  {
4575  /* detoast and convert to cstring in caller's context */
4576  char *s = TextDatumGetCString(val);
4577 
4578  check[found].ccbin = MemoryContextStrdup(CacheMemoryContext, s);
4579  pfree(s);
4580  found++;
4581  }
4582  }
4583 
4584  systable_endscan(conscan);
4585  table_close(conrel, AccessShareLock);
4586 
4587  if (found != ncheck)
4588  elog(WARNING, "%d pg_constraint record(s) missing for relation \"%s\"",
4589  ncheck - found, RelationGetRelationName(relation));
4590 
4591  /*
4592  * Sort the records by name. This ensures that CHECKs are applied in a
4593  * deterministic order, and it also makes equalTupleDescs() faster.
4594  */
4595  if (found > 1)
4596  qsort(check, found, sizeof(ConstrCheck), CheckConstraintCmp);
4597 
4598  /* Install array only after it's fully valid */
4599  relation->rd_att->constr->check = check;
4600  relation->rd_att->constr->num_check = found;
4601 }
#define NameStr(name)
Definition: c.h:730
FormData_pg_constraint * Form_pg_constraint
static int CheckConstraintCmp(const void *a, const void *b)
Definition: relcache.c:4607
bool ccnoinherit
Definition: tupdesc.h:33
bool ccvalid
Definition: tupdesc.h:32
char * ccbin
Definition: tupdesc.h:31
ConstrCheck * check
Definition: tupdesc.h:40
uint16 num_check
Definition: tupdesc.h:43

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

Referenced by RelationBuildTupleDesc().

◆ CopyIndexAttOptions()

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

Definition at line 5825 of file relcache.c.

5826 {
5827  bytea **opts = palloc(sizeof(*opts) * natts);
5828 
5829  for (int i = 0; i < natts; i++)
5830  {
5831  bytea *opt = srcopts[i];
5832 
5833  opts[i] = !opt ? NULL : (bytea *)
5834  DatumGetPointer(datumCopy(PointerGetDatum(opt), false, -1));
5835  }
5836 
5837  return opts;
5838 }
Datum datumCopy(Datum value, bool typByVal, int typLen)
Definition: datum.c:132
static AmcheckOptions opts
Definition: pg_amcheck.c:110
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
Definition: c.h:671

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

Referenced by RelationGetIndexAttOptions().

◆ equalPolicy()

static bool equalPolicy ( RowSecurityPolicy policy1,
RowSecurityPolicy policy2 
)
static

Definition at line 951 of file relcache.c.

952 {
953  int i;
954  Oid *r1,
955  *r2;
956 
957  if (policy1 != NULL)
958  {
959  if (policy2 == NULL)
960  return false;
961 
962  if (policy1->polcmd != policy2->polcmd)
963  return false;
964  if (policy1->hassublinks != policy2->hassublinks)
965  return false;
966  if (strcmp(policy1->policy_name, policy2->policy_name) != 0)
967  return false;
968  if (ARR_DIMS(policy1->roles)[0] != ARR_DIMS(policy2->roles)[0])
969  return false;
970 
971  r1 = (Oid *) ARR_DATA_PTR(policy1->roles);
972  r2 = (Oid *) ARR_DATA_PTR(policy2->roles);
973 
974  for (i = 0; i < ARR_DIMS(policy1->roles)[0]; i++)
975  {
976  if (r1[i] != r2[i])
977  return false;
978  }
979 
980  if (!equal(policy1->qual, policy2->qual))
981  return false;
982  if (!equal(policy1->with_check_qual, policy2->with_check_qual))
983  return false;
984  }
985  else if (policy2 != NULL)
986  return false;
987 
988  return true;
989 }
#define ARR_DATA_PTR(a)
Definition: array.h:315
#define ARR_DIMS(a)
Definition: array.h:287
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:223
unsigned int Oid
Definition: postgres_ext.h:31
ArrayType * roles
Definition: rowsecurity.h:24
Expr * with_check_qual
Definition: rowsecurity.h:27

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().

◆ equalRSDesc()

static bool equalRSDesc ( RowSecurityDesc rsdesc1,
RowSecurityDesc rsdesc2 
)
static

Definition at line 997 of file relcache.c.

998 {
999  ListCell *lc,
1000  *rc;
1001 
1002  if (rsdesc1 == NULL && rsdesc2 == NULL)
1003  return true;
1004 
1005  if ((rsdesc1 != NULL && rsdesc2 == NULL) ||
1006  (rsdesc1 == NULL && rsdesc2 != NULL))
1007  return false;
1008 
1009  if (list_length(rsdesc1->policies) != list_length(rsdesc2->policies))
1010  return false;
1011 
1012  /* RelationBuildRowSecurity should build policies in order */
1013  forboth(lc, rsdesc1->policies, rc, rsdesc2->policies)
1014  {
1017 
1018  if (!equalPolicy(l, r))
1019  return false;
1020  }
1021 
1022  return true;
1023 }
#define lfirst(lc)
Definition: pg_list.h:172
static int list_length(const List *l)
Definition: pg_list.h:152
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:467
static bool equalPolicy(RowSecurityPolicy *policy1, RowSecurityPolicy *policy2)
Definition: relcache.c:951

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

Referenced by RelationClearRelation().

◆ equalRuleLocks()

static bool equalRuleLocks ( RuleLock rlock1,
RuleLock rlock2 
)
static

Definition at line 906 of file relcache.c.

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

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

Referenced by RelationClearRelation().

◆ errtable()

int errtable ( Relation  rel)

Definition at line 5906 of file relcache.c.

5907 {
5911 
5912  return 0; /* return value does not matter */
5913 }
int err_generic_string(int field, const char *str)
Definition: elog.c:1511
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3331
#define PG_DIAG_SCHEMA_NAME
Definition: postgres_ext.h:64
#define PG_DIAG_TABLE_NAME
Definition: postgres_ext.h:65
#define RelationGetNamespace(relation)
Definition: rel.h:544

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().

◆ errtablecol()

int errtablecol ( Relation  rel,
int  attnum 
)

Definition at line 5923 of file relcache.c.

5924 {
5925  TupleDesc reldesc = RelationGetDescr(rel);
5926  const char *colname;
5927 
5928  /* Use reldesc if it's a user attribute, else consult the catalogs */
5929  if (attnum > 0 && attnum <= reldesc->natts)
5930  colname = NameStr(TupleDescAttr(reldesc, attnum - 1)->attname);
5931  else
5932  colname = get_attname(RelationGetRelid(rel), attnum, false);
5933 
5934  return errtablecolname(rel, colname);
5935 }
char * get_attname(Oid relid, AttrNumber attnum, bool missing_ok)
Definition: lsyscache.c:826
NameData attname
Definition: pg_attribute.h:41
int16 attnum
Definition: pg_attribute.h:83
#define RelationGetDescr(relation)
Definition: rel.h:529
int errtablecolname(Relation rel, const char *colname)
Definition: relcache.c:5947

References attname, attnum, errtablecolname(), get_attname(), NameStr, RelationGetDescr, RelationGetRelid, and TupleDescAttr.

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

◆ errtablecolname()

int errtablecolname ( Relation  rel,
const char *  colname 
)

Definition at line 5947 of file relcache.c.

5948 {
5949  errtable(rel);
5951 
5952  return 0; /* return value does not matter */
5953 }
#define PG_DIAG_COLUMN_NAME
Definition: postgres_ext.h:66
int errtable(Relation rel)
Definition: relcache.c:5906

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

Referenced by errtablecol().

◆ errtableconstraint()

int errtableconstraint ( Relation  rel,
const char *  conname 
)

◆ formrdesc()

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

Definition at line 1866 of file relcache.c.

1869 {
1870  Relation relation;
1871  int i;
1872  bool has_not_null;
1873 
1874  /*
1875  * allocate new relation desc, clear all fields of reldesc
1876  */
1877  relation = (Relation) palloc0(sizeof(RelationData));
1878 
1879  /* make sure relation is marked as having no open file yet */
1880  relation->rd_smgr = NULL;
1881 
1882  /*
1883  * initialize reference count: 1 because it is nailed in cache
1884  */
1885  relation->rd_refcnt = 1;
1886 
1887  /*
1888  * all entries built with this routine are nailed-in-cache; none are for
1889  * new or temp relations.
1890  */
1891  relation->rd_isnailed = true;
1896  relation->rd_backend = InvalidBackendId;
1897  relation->rd_islocaltemp = false;
1898 
1899  /*
1900  * initialize relation tuple form
1901  *
1902  * The data we insert here is pretty incomplete/bogus, but it'll serve to
1903  * get us launched. RelationCacheInitializePhase3() will read the real
1904  * data from pg_class and replace what we've done here. Note in
1905  * particular that relowner is left as zero; this cues
1906  * RelationCacheInitializePhase3 that the real data isn't there yet.
1907  */
1909 
1910  namestrcpy(&relation->rd_rel->relname, relationName);
1911  relation->rd_rel->relnamespace = PG_CATALOG_NAMESPACE;
1912  relation->rd_rel->reltype = relationReltype;
1913 
1914  /*
1915  * It's important to distinguish between shared and non-shared relations,
1916  * even at bootstrap time, to make sure we know where they are stored.
1917  */
1918  relation->rd_rel->relisshared = isshared;
1919  if (isshared)
1920  relation->rd_rel->reltablespace = GLOBALTABLESPACE_OID;
1921 
1922  /* formrdesc is used only for permanent relations */
1923  relation->rd_rel->relpersistence = RELPERSISTENCE_PERMANENT;
1924 
1925  /* ... and they're always populated, too */
1926  relation->rd_rel->relispopulated = true;
1927 
1928  relation->rd_rel->relreplident = REPLICA_IDENTITY_NOTHING;
1929  relation->rd_rel->relpages = 0;
1930  relation->rd_rel->reltuples = -1;
1931  relation->rd_rel->relallvisible = 0;
1932  relation->rd_rel->relkind = RELKIND_RELATION;
1933  relation->rd_rel->relnatts = (int16) natts;
1934  relation->rd_rel->relam = HEAP_TABLE_AM_OID;
1935 
1936  /*
1937  * initialize attribute tuple form
1938  *
1939  * Unlike the case with the relation tuple, this data had better be right
1940  * because it will never be replaced. The data comes from
1941  * src/include/catalog/ headers via genbki.pl.
1942  */
1943  relation->rd_att = CreateTemplateTupleDesc(natts);
1944  relation->rd_att->tdrefcount = 1; /* mark as refcounted */
1945 
1946  relation->rd_att->tdtypeid = relationReltype;
1947  relation->rd_att->tdtypmod = -1; /* just to be sure */
1948 
1949  /*
1950  * initialize tuple desc info
1951  */
1952  has_not_null = false;
1953  for (i = 0; i < natts; i++)
1954  {
1955  memcpy(TupleDescAttr(relation->rd_att, i),
1956  &attrs[i],
1958  has_not_null |= attrs[i].attnotnull;
1959  /* make sure attcacheoff is valid */
1960  TupleDescAttr(relation->rd_att, i)->attcacheoff = -1;
1961  }
1962 
1963  /* initialize first attribute's attcacheoff, cf RelationBuildTupleDesc */
1964  TupleDescAttr(relation->rd_att, 0)->attcacheoff = 0;
1965 
1966  /* mark not-null status */
1967  if (has_not_null)
1968  {
1969  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
1970 
1971  constr->has_not_null = true;
1972  relation->rd_att->constr = constr;
1973  }
1974 
1975  /*
1976  * initialize relation id from info in att array (my, this is ugly)
1977  */
1978  RelationGetRelid(relation) = TupleDescAttr(relation->rd_att, 0)->attrelid;
1979 
1980  /*
1981  * All relations made with formrdesc are mapped. This is necessarily so
1982  * because there is no other way to know what filenumber they currently
1983  * have. In bootstrap mode, add them to the initial relation mapper data,
1984  * specifying that the initial filenumber is the same as the OID.
1985  */
1986  relation->rd_rel->relfilenode = InvalidRelFileNumber;
1989  RelationGetRelid(relation),
1990  isshared, true);
1991 
1992  /*
1993  * initialize the relation lock manager information
1994  */
1995  RelationInitLockInfo(relation); /* see lmgr.c */
1996 
1997  /*
1998  * initialize physical addressing information for the relation
1999  */
2000  RelationInitPhysicalAddr(relation);
2001 
2002  /*
2003  * initialize the table am handler
2004  */
2005  relation->rd_rel->relam = HEAP_TABLE_AM_OID;
2006  relation->rd_tableam = GetHeapamTableAmRoutine();
2007 
2008  /*
2009  * initialize the rel-has-index flag, using hardwired knowledge
2010  */
2012  {
2013  /* In bootstrap mode, we have no indexes */
2014  relation->rd_rel->relhasindex = false;
2015  }
2016  else
2017  {
2018  /* Otherwise, all the rels formrdesc is used for have indexes */
2019  relation->rd_rel->relhasindex = true;
2020  }
2021 
2022  /*
2023  * add new reldesc to relcache
2024  */
2025  RelationCacheInsert(relation, false);
2026 
2027  /* It's fully valid */
2028  relation->rd_isvalid = true;
2029 }
#define InvalidBackendId
Definition: backendid.h:23
signed short int16
Definition: c.h:477
const TableAmRoutine * GetHeapamTableAmRoutine(void)
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:72
void namestrcpy(Name name, const char *str)
Definition: name.c:233
#define RelationCacheInsert(RELATION, replace_allowed)
Definition: relcache.c:209
static void RelationInitPhysicalAddr(Relation relation)
Definition: relcache.c:1311
void RelationMapUpdateMap(Oid relationId, RelFileNumber fileNumber, bool shared, bool immediate)
Definition: relmapper.c:325
#define InvalidRelFileNumber
Definition: relpath.h:26
const struct TableAmRoutine * rd_tableam
Definition: rel.h:187
bool rd_isvalid
Definition: rel.h:62
bool rd_islocaltemp
Definition: rel.h:60
BackendId rd_backend
Definition: rel.h:59
bool has_not_null
Definition: tupdesc.h:44

References ATTRIBUTE_FIXED_PART_SIZE, CLASS_TUPLE_SIZE, TupleDescData::constr, CreateTemplateTupleDesc(), GetHeapamTableAmRoutine(), TupleConstr::has_not_null, i, InvalidBackendId, InvalidRelFileNumber, InvalidSubTransactionId, IsBootstrapProcessingMode, namestrcpy(), palloc0(), RelationData::rd_att, RelationData::rd_backend, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilelocatorSubid, RelationData::rd_islocaltemp, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_newRelfilelocatorSubid, 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().

◆ GetPgClassDescriptor()

static TupleDesc GetPgClassDescriptor ( void  )
static

Definition at line 4388 of file relcache.c.

4389 {
4390  static TupleDesc pgclassdesc = NULL;
4391 
4392  /* Already done? */
4393  if (pgclassdesc == NULL)
4394  pgclassdesc = BuildHardcodedDescriptor(Natts_pg_class,
4395  Desc_pg_class);
4396 
4397  return pgclassdesc;
4398 }
static TupleDesc BuildHardcodedDescriptor(int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:4358
static const FormData_pg_attribute Desc_pg_class[Natts_pg_class]
Definition: relcache.c:111

References BuildHardcodedDescriptor(), and Desc_pg_class.

Referenced by RelationParseRelOptions().

◆ GetPgIndexDescriptor()

static TupleDesc GetPgIndexDescriptor ( void  )
static

Definition at line 4401 of file relcache.c.

4402 {
4403  static TupleDesc pgindexdesc = NULL;
4404 
4405  /* Already done? */
4406  if (pgindexdesc == NULL)
4407  pgindexdesc = BuildHardcodedDescriptor(Natts_pg_index,
4408  Desc_pg_index);
4409 
4410  return pgindexdesc;
4411 }
static const FormData_pg_attribute Desc_pg_index[Natts_pg_index]
Definition: relcache.c:118

References BuildHardcodedDescriptor(), and Desc_pg_index.

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

◆ IndexSupportInitialize()

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

Definition at line 1588 of file relcache.c.

1594 {
1595  int attIndex;
1596 
1597  for (attIndex = 0; attIndex < maxAttributeNumber; attIndex++)
1598  {
1599  OpClassCacheEnt *opcentry;
1600 
1601  if (!OidIsValid(indclass->values[attIndex]))
1602  elog(ERROR, "bogus pg_index tuple");
1603 
1604  /* look up the info for this opclass, using a cache */
1605  opcentry = LookupOpclassInfo(indclass->values[attIndex],
1606  maxSupportNumber);
1607 
1608  /* copy cached data into relcache entry */
1609  opFamily[attIndex] = opcentry->opcfamily;
1610  opcInType[attIndex] = opcentry->opcintype;
1611  if (maxSupportNumber > 0)
1612  memcpy(&indexSupport[attIndex * maxSupportNumber],
1613  opcentry->supportProcs,
1614  maxSupportNumber * sizeof(RegProcedure));
1615  }
1616 }
regproc RegProcedure
Definition: c.h:634
#define OidIsValid(objectId)
Definition: c.h:759
#define ERROR
Definition: elog.h:39
static OpClassCacheEnt * LookupOpclassInfo(Oid operatorClassOid, StrategyNumber numSupport)
Definition: relcache.c:1639
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:717
RegProcedure * supportProcs
Definition: relcache.c:268

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

Referenced by RelationInitIndexAccessInfo().

◆ InitIndexAmRoutine()

static void InitIndexAmRoutine ( Relation  relation)
static

Definition at line 1393 of file relcache.c.

1394 {
1395  IndexAmRoutine *cached,
1396  *tmp;
1397 
1398  /*
1399  * Call the amhandler in current, short-lived memory context, just in case
1400  * it leaks anything (it probably won't, but let's be paranoid).
1401  */
1402  tmp = GetIndexAmRoutine(relation->rd_amhandler);
1403 
1404  /* OK, now transfer the data into relation's rd_indexcxt. */
1405  cached = (IndexAmRoutine *) MemoryContextAlloc(relation->rd_indexcxt,
1406  sizeof(IndexAmRoutine));
1407  memcpy(cached, tmp, sizeof(IndexAmRoutine));
1408  relation->rd_indam = cached;
1409 
1410  pfree(tmp);
1411 }
IndexAmRoutine * GetIndexAmRoutine(Oid amhandler)
Definition: amapi.c:33
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:1005
struct IndexAmRoutine * rd_indam
Definition: rel.h:204
Oid rd_amhandler
Definition: rel.h:182
MemoryContext rd_indexcxt
Definition: rel.h:202

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

Referenced by load_relcache_init_file(), and RelationInitIndexAccessInfo().

◆ InitTableAmRoutine()

static void InitTableAmRoutine ( Relation  relation)
static

Definition at line 1792 of file relcache.c.

1793 {
1794  relation->rd_tableam = GetTableAmRoutine(relation->rd_amhandler);
1795 }
const TableAmRoutine * GetTableAmRoutine(Oid amhandler)
Definition: tableamapi.c:35

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

Referenced by RelationInitTableAccessMethod().

◆ load_critical_index()

static void load_critical_index ( Oid  indexoid,
Oid  heapoid 
)
static

Definition at line 4322 of file relcache.c.

4323 {
4324  Relation ird;
4325 
4326  /*
4327  * We must lock the underlying catalog before locking the index to avoid
4328  * deadlock, since RelationBuildDesc might well need to read the catalog,
4329  * and if anyone else is exclusive-locking this catalog and index they'll
4330  * be doing it in that order.
4331  */
4332  LockRelationOid(heapoid, AccessShareLock);
4333  LockRelationOid(indexoid, AccessShareLock);
4334  ird = RelationBuildDesc(indexoid, true);
4335  if (ird == NULL)
4336  elog(PANIC, "could not open critical system index %u", indexoid);
4337  ird->rd_isnailed = true;
4338  ird->rd_refcnt = 1;
4341 
4342  (void) RelationGetIndexAttOptions(ird, false);
4343 }
#define PANIC
Definition: elog.h:42
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:228
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:109
static Relation RelationBuildDesc(Oid targetRelId, bool insertIt)
Definition: relcache.c:1038
bytea ** RelationGetIndexAttOptions(Relation relation, bool copy)
Definition: relcache.c:5845

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

Referenced by RelationCacheInitializePhase3().

◆ load_relcache_init_file()

static bool load_relcache_init_file ( bool  shared)
static

Definition at line 6024 of file relcache.c.

6025 {
6026  FILE *fp;
6027  char initfilename[MAXPGPATH];
6028  Relation *rels;
6029  int relno,
6030  num_rels,
6031  max_rels,
6032  nailed_rels,
6033  nailed_indexes,
6034  magic;
6035  int i;
6036 
6037  if (shared)
6038  snprintf(initfilename, sizeof(initfilename), "global/%s",
6040  else
6041  snprintf(initfilename, sizeof(initfilename), "%s/%s",
6043 
6044  fp = AllocateFile(initfilename, PG_BINARY_R);
6045  if (fp == NULL)
6046  return false;
6047 
6048  /*
6049  * Read the index relcache entries from the file. Note we will not enter
6050  * any of them into the cache if the read fails partway through; this
6051  * helps to guard against broken init files.
6052  */
6053  max_rels = 100;
6054  rels = (Relation *) palloc(max_rels * sizeof(Relation));
6055  num_rels = 0;
6056  nailed_rels = nailed_indexes = 0;
6057 
6058  /* check for correct magic number (compatible version) */
6059  if (fread(&magic, 1, sizeof(magic), fp) != sizeof(magic))
6060  goto read_failed;
6061  if (magic != RELCACHE_INIT_FILEMAGIC)
6062  goto read_failed;
6063 
6064  for (relno = 0;; relno++)
6065  {
6066  Size len;
6067  size_t nread;
6068  Relation rel;
6069  Form_pg_class relform;
6070  bool has_not_null;
6071 
6072  /* first read the relation descriptor length */
6073  nread = fread(&len, 1, sizeof(len), fp);
6074  if (nread != sizeof(len))
6075  {
6076  if (nread == 0)
6077  break; /* end of file */
6078  goto read_failed;
6079  }
6080 
6081  /* safety check for incompatible relcache layout */
6082  if (len != sizeof(RelationData))
6083  goto read_failed;
6084 
6085  /* allocate another relcache header */
6086  if (num_rels >= max_rels)
6087  {
6088  max_rels *= 2;
6089  rels = (Relation *) repalloc(rels, max_rels * sizeof(Relation));
6090  }
6091 
6092  rel = rels[num_rels++] = (Relation) palloc(len);
6093 
6094  /* then, read the Relation structure */
6095  if (fread(rel, 1, len, fp) != len)
6096  goto read_failed;
6097 
6098  /* next read the relation tuple form */
6099  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6100  goto read_failed;
6101 
6102  relform = (Form_pg_class) palloc(len);
6103  if (fread(relform, 1, len, fp) != len)
6104  goto read_failed;
6105 
6106  rel->rd_rel = relform;
6107 
6108  /* initialize attribute tuple forms */
6109  rel->rd_att = CreateTemplateTupleDesc(relform->relnatts);
6110  rel->rd_att->tdrefcount = 1; /* mark as refcounted */
6111 
6112  rel->rd_att->tdtypeid = relform->reltype ? relform->reltype : RECORDOID;
6113  rel->rd_att->tdtypmod = -1; /* just to be sure */
6114 
6115  /* next read all the attribute tuple form data entries */
6116  has_not_null = false;
6117  for (i = 0; i < relform->relnatts; i++)
6118  {
6119  Form_pg_attribute attr = TupleDescAttr(rel->rd_att, i);
6120 
6121  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6122  goto read_failed;
6124  goto read_failed;
6125  if (fread(attr, 1, len, fp) != len)
6126  goto read_failed;
6127 
6128  has_not_null |= attr->attnotnull;
6129  }
6130 
6131  /* next read the access method specific field */
6132  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6133  goto read_failed;
6134  if (len > 0)
6135  {
6136  rel->rd_options = palloc(len);
6137  if (fread(rel->rd_options, 1, len, fp) != len)
6138  goto read_failed;
6139  if (len != VARSIZE(rel->rd_options))
6140  goto read_failed; /* sanity check */
6141  }
6142  else
6143  {
6144  rel->rd_options = NULL;
6145  }
6146 
6147  /* mark not-null status */
6148  if (has_not_null)
6149  {
6150  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
6151 
6152  constr->has_not_null = true;
6153  rel->rd_att->constr = constr;
6154  }
6155 
6156  /*
6157  * If it's an index, there's more to do. Note we explicitly ignore
6158  * partitioned indexes here.
6159  */
6160  if (rel->rd_rel->relkind == RELKIND_INDEX)
6161  {
6162  MemoryContext indexcxt;
6163  Oid *opfamily;
6164  Oid *opcintype;
6165  RegProcedure *support;
6166  int nsupport;
6167  int16 *indoption;
6168  Oid *indcollation;
6169 
6170  /* Count nailed indexes to ensure we have 'em all */
6171  if (rel->rd_isnailed)
6172  nailed_indexes++;
6173 
6174  /* read the pg_index tuple */
6175  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6176  goto read_failed;
6177 
6178  rel->rd_indextuple = (HeapTuple) palloc(len);
6179  if (fread(rel->rd_indextuple, 1, len, fp) != len)
6180  goto read_failed;
6181 
6182  /* Fix up internal pointers in the tuple -- see heap_copytuple */
6183  rel->rd_indextuple->t_data = (HeapTupleHeader) ((char *) rel->rd_indextuple + HEAPTUPLESIZE);
6185 
6186  /*
6187  * prepare index info context --- parameters should match
6188  * RelationInitIndexAccessInfo
6189  */
6191  "index info",
6193  rel->rd_indexcxt = indexcxt;
6196 
6197  /*
6198  * Now we can fetch the index AM's API struct. (We can't store
6199  * that in the init file, since it contains function pointers that
6200  * might vary across server executions. Fortunately, it should be
6201  * safe to call the amhandler even while bootstrapping indexes.)
6202  */
6203  InitIndexAmRoutine(rel);
6204 
6205  /* read the vector of opfamily OIDs */
6206  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6207  goto read_failed;
6208 
6209  opfamily = (Oid *) MemoryContextAlloc(indexcxt, len);
6210  if (fread(opfamily, 1, len, fp) != len)
6211  goto read_failed;
6212 
6213  rel->rd_opfamily = opfamily;
6214 
6215  /* read the vector of opcintype OIDs */
6216  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6217  goto read_failed;
6218 
6219  opcintype = (Oid *) MemoryContextAlloc(indexcxt, len);
6220  if (fread(opcintype, 1, len, fp) != len)
6221  goto read_failed;
6222 
6223  rel->rd_opcintype = opcintype;
6224 
6225  /* read the vector of support procedure OIDs */
6226  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6227  goto read_failed;
6228  support = (RegProcedure *) MemoryContextAlloc(indexcxt, len);
6229  if (fread(support, 1, len, fp) != len)
6230  goto read_failed;
6231 
6232  rel->rd_support = support;
6233 
6234  /* read the vector of collation OIDs */
6235  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6236  goto read_failed;
6237 
6238  indcollation = (Oid *) MemoryContextAlloc(indexcxt, len);
6239  if (fread(indcollation, 1, len, fp) != len)
6240  goto read_failed;
6241 
6242  rel->rd_indcollation = indcollation;
6243 
6244  /* read the vector of indoption values */
6245  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6246  goto read_failed;
6247 
6248  indoption = (int16 *) MemoryContextAlloc(indexcxt, len);
6249  if (fread(indoption, 1, len, fp) != len)
6250  goto read_failed;
6251 
6252  rel->rd_indoption = indoption;
6253 
6254  /* read the vector of opcoptions values */
6255  rel->rd_opcoptions = (bytea **)
6256  MemoryContextAllocZero(indexcxt, sizeof(*rel->rd_opcoptions) * relform->relnatts);
6257 
6258  for (i = 0; i < relform->relnatts; i++)
6259  {
6260  if (fread(&len, 1, sizeof(len), fp) != sizeof(len))
6261  goto read_failed;
6262 
6263  if (len > 0)
6264  {
6265  rel->rd_opcoptions[i] = (bytea *) MemoryContextAlloc(indexcxt, len);
6266  if (fread(rel->rd_opcoptions[i], 1, len, fp) != len)
6267  goto read_failed;
6268  }
6269  }
6270 
6271  /* set up zeroed fmgr-info vector */
6272  nsupport = relform->relnatts * rel->rd_indam->amsupport;
6273  rel->rd_supportinfo = (FmgrInfo *)
6274  MemoryContextAllocZero(indexcxt, nsupport * sizeof(FmgrInfo));
6275  }
6276  else
6277  {
6278  /* Count nailed rels to ensure we have 'em all */
6279  if (rel->rd_isnailed)
6280  nailed_rels++;
6281 
6282  /* Load table AM data */
6283  if (RELKIND_HAS_TABLE_AM(rel->rd_rel->relkind) || rel->rd_rel->relkind == RELKIND_SEQUENCE)
6285 
6286  Assert(rel->rd_index == NULL);
6287  Assert(rel->rd_indextuple == NULL);
6288  Assert(rel->rd_indexcxt == NULL);
6289  Assert(rel->rd_indam == NULL);
6290  Assert(rel->rd_opfamily == NULL);
6291  Assert(rel->rd_opcintype == NULL);
6292  Assert(rel->rd_support == NULL);
6293  Assert(rel->rd_supportinfo == NULL);
6294  Assert(rel->rd_indoption == NULL);
6295  Assert(rel->rd_indcollation == NULL);
6296  Assert(rel->rd_opcoptions == NULL);
6297  }
6298 
6299  /*
6300  * Rules and triggers are not saved (mainly because the internal
6301  * format is complex and subject to change). They must be rebuilt if
6302  * needed by RelationCacheInitializePhase3. This is not expected to
6303  * be a big performance hit since few system catalogs have such. Ditto
6304  * for RLS policy data, partition info, index expressions, predicates,
6305  * exclusion info, and FDW info.
6306  */
6307  rel->rd_rules = NULL;
6308  rel->rd_rulescxt = NULL;
6309  rel->trigdesc = NULL;
6310  rel->rd_rsdesc = NULL;
6311  rel->rd_partkey = NULL;
6312  rel->rd_partkeycxt = NULL;
6313  rel->rd_partdesc = NULL;
6314  rel->rd_partdesc_nodetached = NULL;
6316  rel->rd_pdcxt = NULL;
6317  rel->rd_pddcxt = NULL;
6318  rel->rd_partcheck = NIL;
6319  rel->rd_partcheckvalid = false;
6320  rel->rd_partcheckcxt = NULL;
6321  rel->rd_indexprs = NIL;
6322  rel->rd_indpred = NIL;
6323  rel->rd_exclops = NULL;
6324  rel->rd_exclprocs = NULL;
6325  rel->rd_exclstrats = NULL;
6326  rel->rd_fdwroutine = NULL;
6327 
6328  /*
6329  * Reset transient-state fields in the relcache entry
6330  */
6331  rel->rd_smgr = NULL;
6332  if (rel->rd_isnailed)
6333  rel->rd_refcnt = 1;
6334  else
6335  rel->rd_refcnt = 0;
6336  rel->rd_indexvalid = false;
6337  rel->rd_indexlist = NIL;
6338  rel->rd_pkindex = InvalidOid;
6339  rel->rd_replidindex = InvalidOid;
6340  rel->rd_attrsvalid = false;
6341  rel->rd_keyattr = NULL;
6342  rel->rd_pkattr = NULL;
6343  rel->rd_idattr = NULL;
6344  rel->rd_pubdesc = NULL;
6345  rel->rd_statvalid = false;
6346  rel->rd_statlist = NIL;
6347  rel->rd_fkeyvalid = false;
6348  rel->rd_fkeylist = NIL;
6353  rel->rd_amcache = NULL;
6354  rel->pgstat_info = NULL;
6355 
6356  /*
6357  * Recompute lock and physical addressing info. This is needed in
6358  * case the pg_internal.init file was copied from some other database
6359  * by CREATE DATABASE.
6360  */
6361  RelationInitLockInfo(rel);
6363  }
6364 
6365  /*
6366  * We reached the end of the init file without apparent problem. Did we
6367  * get the right number of nailed items? This is a useful crosscheck in
6368  * case the set of critical rels or indexes changes. However, that should
6369  * not happen in a normally-running system, so let's bleat if it does.
6370  *
6371  * For the shared init file, we're called before client authentication is
6372  * done, which means that elog(WARNING) will go only to the postmaster
6373  * log, where it's easily missed. To ensure that developers notice bad
6374  * values of NUM_CRITICAL_SHARED_RELS/NUM_CRITICAL_SHARED_INDEXES, we put
6375  * an Assert(false) there.
6376  */
6377  if (shared)
6378  {
6379  if (nailed_rels != NUM_CRITICAL_SHARED_RELS ||
6380  nailed_indexes != NUM_CRITICAL_SHARED_INDEXES)
6381  {
6382  elog(WARNING, "found %d nailed shared rels and %d nailed shared indexes in init file, but expected %d and %d respectively",
6383  nailed_rels, nailed_indexes,
6385  /* Make sure we get developers' attention about this */
6386  Assert(false);
6387  /* In production builds, recover by bootstrapping the relcache */
6388  goto read_failed;
6389  }
6390  }
6391  else
6392  {
6393  if (nailed_rels != NUM_CRITICAL_LOCAL_RELS ||
6394  nailed_indexes != NUM_CRITICAL_LOCAL_INDEXES)
6395  {
6396  elog(WARNING, "found %d nailed rels and %d nailed indexes in init file, but expected %d and %d respectively",
6397  nailed_rels, nailed_indexes,
6399  /* We don't need an Assert() in this case */
6400  goto read_failed;
6401  }
6402  }
6403 
6404  /*
6405  * OK, all appears well.
6406  *
6407  * Now insert all the new relcache entries into the cache.
6408  */
6409  for (relno = 0; relno < num_rels; relno++)
6410  {
6411  RelationCacheInsert(rels[relno], false);
6412  }
6413 
6414  pfree(rels);
6415  FreeFile(fp);
6416 
6417  if (shared)
6419  else
6420  criticalRelcachesBuilt = true;
6421  return true;
6422 
6423  /*
6424  * init file is broken, so do it the hard way. We don't bother trying to
6425  * free the clutter we just allocated; it's not in the relcache so it
6426  * won't hurt.
6427  */
6428 read_failed:
6429  pfree(rels);
6430  FreeFile(fp);
6431 
6432  return false;
6433 }
#define PG_BINARY_R
Definition: c.h:1262
size_t Size
Definition: c.h:589
FILE * AllocateFile(const char *name, const char *mode)
Definition: fd.c:2384
int FreeFile(FILE *file)
Definition: fd.c:2582
char * DatabasePath
Definition: globals.c:97
#define HEAPTUPLESIZE
Definition: htup.h:73
HeapTupleData * HeapTuple
Definition: htup.h:71
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1456
#define AllocSetContextCreate
Definition: memutils.h:129
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:163
#define MemoryContextCopyAndSetIdentifier(cxt, id)
Definition: memutils.h:101
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:207
#define MAXPGPATH
const void size_t len
FormData_pg_index * Form_pg_index
Definition: pg_index.h:70
#define NIL
Definition: pg_list.h:68
#define snprintf
Definition: port.h:238
#define InvalidOid
Definition: postgres_ext.h:36
#define NUM_CRITICAL_LOCAL_RELS
#define NUM_CRITICAL_SHARED_INDEXES
bool criticalRelcachesBuilt
Definition: relcache.c:140
bool criticalSharedRelcachesBuilt
Definition: relcache.c:146
static void InitIndexAmRoutine(Relation relation)
Definition: relcache.c:1393
#define NUM_CRITICAL_SHARED_RELS
void RelationInitTableAccessMethod(Relation relation)
Definition: relcache.c:1801
#define NUM_CRITICAL_LOCAL_INDEXES
#define RELCACHE_INIT_FILEMAGIC
Definition: relcache.c:93
#define RELCACHE_INIT_FILENAME
Definition: relcache.h:25
Definition: fmgr.h:57
HeapTupleHeader t_data
Definition: htup.h:68
uint16 amsupport
Definition: amapi.h:216
List * rd_partcheck
Definition: rel.h:146
Bitmapset * rd_keyattr
Definition: rel.h:160
bool rd_partcheckvalid
Definition: rel.h:147
MemoryContext rd_pdcxt
Definition: rel.h:130
MemoryContext rd_partkeycxt
Definition: rel.h:126
TransactionId rd_partdesc_nodetached_xmin
Definition: rel.h:143
bool rd_indexvalid
Definition: rel.h:63
List * rd_indpred
Definition: rel.h:211
List * rd_fkeylist
Definition: rel.h:121
Oid * rd_exclprocs
Definition: rel.h:213
uint16 * rd_exclstrats
Definition: rel.h:214
List * rd_indexlist
Definition: rel.h:151
struct RowSecurityDesc * rd_rsdesc
Definition: rel.h:118
PartitionDesc rd_partdesc
Definition: rel.h:129
Oid rd_replidindex
Definition: rel.h:153
RegProcedure * rd_support
Definition: rel.h:207
PartitionDesc rd_partdesc_nodetached
Definition: rel.h:133
bytea ** rd_opcoptions
Definition: rel.h:216
PublicationDesc * rd_pubdesc
Definition: rel.h:166
struct FdwRoutine * rd_fdwroutine
Definition: rel.h:238
TriggerDesc * trigdesc
Definition: rel.h:116
Bitmapset * rd_idattr
Definition: rel.h:162
List * rd_indexprs
Definition: rel.h:210
bool rd_attrsvalid
Definition: rel.h:159
Oid * rd_exclops
Definition: rel.h:212
Oid * rd_opcintype
Definition: rel.h:206
struct HeapTupleData * rd_indextuple
Definition: rel.h:192
MemoryContext rd_partcheckcxt
Definition: rel.h:148
int16 * rd_indoption
Definition: rel.h:209
Form_pg_index rd_index
Definition: rel.h:190
void * rd_amcache
Definition: rel.h:227
Oid rd_pkindex
Definition: rel.h:152
bool rd_fkeyvalid
Definition: rel.h:122
bool rd_statvalid
Definition: rel.h:65
List * rd_statlist
Definition: rel.h:156
MemoryContext rd_pddcxt
Definition: rel.h:134
RuleLock * rd_rules
Definition: rel.h:114
struct FmgrInfo * rd_supportinfo
Definition: rel.h:208
Oid * rd_opfamily
Definition: rel.h:205
MemoryContext rd_rulescxt
Definition: rel.h:115
Bitmapset * rd_pkattr
Definition: rel.h:161
PartitionKey rd_partkey
Definition: rel.h:125
bytea * rd_options
Definition: rel.h:173
Oid * rd_indcollation
Definition: rel.h:215
struct PgStat_TableStatus * pgstat_info
Definition: rel.h:253
#define InvalidTransactionId
Definition: transam.h:31
#define VARSIZE(PTR)
Definition: varatt.h:279

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, InvalidTransactionId, len, MAXPGPATH, MemoryContextAlloc(), MemoryContextAllocZero(), MemoryContextCopyAndSetIdentifier, 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_attrsvalid, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_exclops, RelationData::rd_exclprocs, RelationData::rd_exclstrats, RelationData::rd_fdwroutine, RelationData::rd_firstRelfilelocatorSubid, RelationData::rd_fkeylist, RelationData::rd_fkeyvalid, RelationData::rd_idattr, RelationData::rd_indam, RelationData::rd_indcollation, RelationData::rd_index, 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_newRelfilelocatorSubid, 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_partdesc_nodetached, RelationData::rd_partdesc_nodetached_xmin, RelationData::rd_partkey, RelationData::rd_partkeycxt, RelationData::rd_pdcxt, RelationData::rd_pddcxt, RelationData::rd_pkattr, RelationData::rd_pkindex, RelationData::rd_pubdesc, 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().

◆ LookupOpclassInfo()

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

Definition at line 1639 of file relcache.c.

1641 {
1642  OpClassCacheEnt *opcentry;
1643  bool found;
1644  Relation rel;
1645  SysScanDesc scan;
1646  ScanKeyData skey[3];
1647  HeapTuple htup;
1648  bool indexOK;
1649 
1650  if (OpClassCache == NULL)
1651  {
1652  /* First time through: initialize the opclass cache */
1653  HASHCTL ctl;
1654 
1655  /* Also make sure CacheMemoryContext exists */
1656  if (!CacheMemoryContext)
1658 
1659  ctl.keysize = sizeof(Oid);
1660  ctl.entrysize = sizeof(OpClassCacheEnt);
1661  OpClassCache = hash_create("Operator class cache", 64,
1662  &ctl, HASH_ELEM | HASH_BLOBS);
1663  }
1664 
1665  opcentry = (OpClassCacheEnt *) hash_search(OpClassCache,
1666  &operatorClassOid,
1667  HASH_ENTER, &found);
1668 
1669  if (!found)
1670  {
1671  /* Initialize new entry */
1672  opcentry->valid = false; /* until known OK */
1673  opcentry->numSupport = numSupport;
1674  opcentry->supportProcs = NULL; /* filled below */
1675  }
1676  else
1677  {
1678  Assert(numSupport == opcentry->numSupport);
1679  }
1680 
1681  /*
1682  * When aggressively testing cache-flush hazards, we disable the operator
1683  * class cache and force reloading of the info on each call. This models
1684  * no real-world behavior, since the cache entries are never invalidated
1685  * otherwise. However it can be helpful for detecting bugs in the cache
1686  * loading logic itself, such as reliance on a non-nailed index. Given
1687  * the limited use-case and the fact that this adds a great deal of
1688  * expense, we enable it only for high values of debug_discard_caches.
1689  */
1690 #ifdef DISCARD_CACHES_ENABLED
1691  if (debug_discard_caches > 2)
1692  opcentry->valid = false;
1693 #endif
1694 
1695  if (opcentry->valid)
1696  return opcentry;
1697 
1698  /*
1699  * Need to fill in new entry. First allocate space, unless we already did
1700  * so in some previous attempt.
1701  */
1702  if (opcentry->supportProcs == NULL && numSupport > 0)
1703  opcentry->supportProcs = (RegProcedure *)
1705  numSupport * sizeof(RegProcedure));
1706 
1707  /*
1708  * To avoid infinite recursion during startup, force heap scans if we're
1709  * looking up info for the opclasses used by the indexes we would like to
1710  * reference here.
1711  */
1712  indexOK = criticalRelcachesBuilt ||
1713  (operatorClassOid != OID_BTREE_OPS_OID &&
1714  operatorClassOid != INT2_BTREE_OPS_OID);
1715 
1716  /*
1717  * We have to fetch the pg_opclass row to determine its opfamily and
1718  * opcintype, which are needed to look up related operators and functions.
1719  * It'd be convenient to use the syscache here, but that probably doesn't
1720  * work while bootstrapping.
1721  */
1722  ScanKeyInit(&skey[0],
1723  Anum_pg_opclass_oid,
1724  BTEqualStrategyNumber, F_OIDEQ,
1725  ObjectIdGetDatum(operatorClassOid));
1726  rel = table_open(OperatorClassRelationId, AccessShareLock);
1727  scan = systable_beginscan(rel, OpclassOidIndexId, indexOK,
1728  NULL, 1, skey);
1729 
1730  if (HeapTupleIsValid(htup = systable_getnext(scan)))
1731  {
1732  Form_pg_opclass opclassform = (Form_pg_opclass) GETSTRUCT(htup);
1733 
1734  opcentry->opcfamily = opclassform->opcfamily;
1735  opcentry->opcintype = opclassform->opcintype;
1736  }
1737  else
1738  elog(ERROR, "could not find tuple for opclass %u", operatorClassOid);
1739 
1740  systable_endscan(scan);
1742 
1743  /*
1744  * Scan pg_amproc to obtain support procs for the opclass. We only fetch
1745  * the default ones (those with lefttype = righttype = opcintype).
1746  */
1747  if (numSupport > 0)
1748  {
1749  ScanKeyInit(&skey[0],
1750  Anum_pg_amproc_amprocfamily,
1751  BTEqualStrategyNumber, F_OIDEQ,
1752  ObjectIdGetDatum(opcentry->opcfamily));
1753  ScanKeyInit(&skey[1],
1754  Anum_pg_amproc_amproclefttype,
1755  BTEqualStrategyNumber, F_OIDEQ,
1756  ObjectIdGetDatum(opcentry->opcintype));
1757  ScanKeyInit(&skey[2],
1758  Anum_pg_amproc_amprocrighttype,
1759  BTEqualStrategyNumber, F_OIDEQ,
1760  ObjectIdGetDatum(opcentry->opcintype));
1761  rel = table_open(AccessMethodProcedureRelationId, AccessShareLock);
1762  scan = systable_beginscan(rel, AccessMethodProcedureIndexId, indexOK,
1763  NULL, 3, skey);
1764 
1765  while (HeapTupleIsValid(htup = systable_getnext(scan)))
1766  {
1767  Form_pg_amproc amprocform = (Form_pg_amproc) GETSTRUCT(htup);
1768 
1769  if (amprocform->amprocnum <= 0 ||
1770  (StrategyNumber) amprocform->amprocnum > numSupport)
1771  elog(ERROR, "invalid amproc number %d for opclass %u",
1772  amprocform->amprocnum, operatorClassOid);
1773 
1774  opcentry->supportProcs[amprocform->amprocnum - 1] =
1775  amprocform->amproc;
1776  }
1777 
1778  systable_endscan(scan);
1780  }
1781 
1782  opcentry->valid = true;
1783  return opcentry;
1784 }
void CreateCacheMemoryContext(void)
Definition: catcache.c:614
HTAB * hash_create(const char *tabname, long nelem, const HASHCTL *info, int flags)
Definition: dynahash.c:350
@ HASH_ENTER
Definition: hsearch.h:114
#define HASH_ELEM
Definition: hsearch.h:95
#define HASH_BLOBS
Definition: hsearch.h:97
int debug_discard_caches
Definition: inval.c:241
FormData_pg_amproc * Form_pg_amproc
Definition: pg_amproc.h:68
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
static HTAB * OpClassCache
Definition: relcache.c:271
struct opclasscacheent OpClassCacheEnt
uint16 StrategyNumber
Definition: stratnum.h:22
Size keysize
Definition: hsearch.h:75
Size entrysize
Definition: hsearch.h:76
StrategyNumber numSupport
Definition: relcache.c:265

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

Referenced by IndexSupportInitialize().

◆ RelationAssumeNewRelfilelocator()

void RelationAssumeNewRelfilelocator ( Relation  relation)

Definition at line 3908 of file relcache.c.

3909 {
3913 
3914  /* Flag relation as needing eoxact cleanup (to clear these fields) */
3915  EOXactListAdd(relation);
3916 }
#define EOXactListAdd(rel)
Definition: relcache.c:189
SubTransactionId GetCurrentSubTransactionId(void)
Definition: xact.c:780

References EOXactListAdd, GetCurrentSubTransactionId(), InvalidSubTransactionId, RelationData::rd_firstRelfilelocatorSubid, and RelationData::rd_newRelfilelocatorSubid.

Referenced by ATExecSetTableSpace(), reindex_index(), RelationSetNewRelfilenumber(), and swap_relation_files().

◆ RelationBuildDesc()

static Relation RelationBuildDesc ( Oid  targetRelId,
bool  insertIt 
)
static

Definition at line 1038 of file relcache.c.

1039 {
1040  int in_progress_offset;
1041  Relation relation;
1042  Oid relid;
1043  HeapTuple pg_class_tuple;
1044  Form_pg_class relp;
1045 
1046  /*
1047  * This function and its subroutines can allocate a good deal of transient
1048  * data in CurrentMemoryContext. Traditionally we've just leaked that
1049  * data, reasoning that the caller's context is at worst of transaction
1050  * scope, and relcache loads shouldn't happen so often that it's essential
1051  * to recover transient data before end of statement/transaction. However
1052  * that's definitely not true when debug_discard_caches is active, and
1053  * perhaps it's not true in other cases.
1054  *
1055  * When debug_discard_caches is active or when forced to by
1056  * RECOVER_RELATION_BUILD_MEMORY=1, arrange to allocate the junk in a
1057  * temporary context that we'll free before returning. Make it a child of
1058  * caller's context so that it will get cleaned up appropriately if we
1059  * error out partway through.
1060  */
1061 #ifdef MAYBE_RECOVER_RELATION_BUILD_MEMORY
1062  MemoryContext tmpcxt = NULL;
1063  MemoryContext oldcxt = NULL;
1064 
1066  {
1068  "RelationBuildDesc workspace",
1070  oldcxt = MemoryContextSwitchTo(tmpcxt);
1071  }
1072 #endif
1073 
1074  /* Register to catch invalidation messages */
1076  {
1077  int allocsize;
1078 
1079  allocsize = in_progress_list_maxlen * 2;
1081  allocsize * sizeof(*in_progress_list));
1082  in_progress_list_maxlen = allocsize;
1083  }
1084  in_progress_offset = in_progress_list_len++;
1085  in_progress_list[in_progress_offset].reloid = targetRelId;
1086 retry:
1087  in_progress_list[in_progress_offset].invalidated = false;
1088 
1089  /*
1090  * find the tuple in pg_class corresponding to the given relation id
1091  */
1092  pg_class_tuple = ScanPgRelation(targetRelId, true, false);
1093 
1094  /*
1095  * if no such tuple exists, return NULL
1096  */
1097  if (!HeapTupleIsValid(pg_class_tuple))
1098  {
1099 #ifdef MAYBE_RECOVER_RELATION_BUILD_MEMORY
1100  if (tmpcxt)
1101  {
1102  /* Return to caller's context, and blow away the temporary context */
1103  MemoryContextSwitchTo(oldcxt);
1104  MemoryContextDelete(tmpcxt);
1105  }
1106 #endif
1107  Assert(in_progress_offset + 1 == in_progress_list_len);
1109  return NULL;
1110  }
1111 
1112  /*
1113  * get information from the pg_class_tuple
1114  */
1115  relp = (Form_pg_class) GETSTRUCT(pg_class_tuple);
1116  relid = relp->oid;
1117  Assert(relid == targetRelId);
1118 
1119  /*
1120  * allocate storage for the relation descriptor, and copy pg_class_tuple
1121  * to relation->rd_rel.
1122  */
1123  relation = AllocateRelationDesc(relp);
1124 
1125  /*
1126  * initialize the relation's relation id (relation->rd_id)
1127  */
1128  RelationGetRelid(relation) = relid;
1129 
1130  /*
1131  * Normal relations are not nailed into the cache. Since we don't flush
1132  * new relations, it won't be new. It could be temp though.
1133  */
1134  relation->rd_refcnt = 0;
1135  relation->rd_isnailed = false;
1140  switch (relation->rd_rel->relpersistence)
1141  {
1142  case RELPERSISTENCE_UNLOGGED:
1143  case RELPERSISTENCE_PERMANENT:
1144  relation->rd_backend = InvalidBackendId;
1145  relation->rd_islocaltemp = false;
1146  break;
1147  case RELPERSISTENCE_TEMP:
1148  if (isTempOrTempToastNamespace(relation->rd_rel->relnamespace))
1149  {
1150  relation->rd_backend = BackendIdForTempRelations();
1151  relation->rd_islocaltemp = true;
1152  }
1153  else
1154  {
1155  /*
1156  * If it's a temp table, but not one of ours, we have to use
1157  * the slow, grotty method to figure out the owning backend.
1158  *
1159  * Note: it's possible that rd_backend gets set to MyBackendId
1160  * here, in case we are looking at a pg_class entry left over
1161  * from a crashed backend that coincidentally had the same
1162  * BackendId we're using. We should *not* consider such a
1163  * table to be "ours"; this is why we need the separate
1164  * rd_islocaltemp flag. The pg_class entry will get flushed
1165  * if/when we clean out the corresponding temp table namespace
1166  * in preparation for using it.
1167  */
1168  relation->rd_backend =
1169  GetTempNamespaceBackendId(relation->rd_rel->relnamespace);
1170  Assert(relation->rd_backend != InvalidBackendId);
1171  relation->rd_islocaltemp = false;
1172  }
1173  break;
1174  default:
1175  elog(ERROR, "invalid relpersistence: %c",
1176  relation->rd_rel->relpersistence);
1177  break;
1178  }
1179 
1180  /*
1181  * initialize the tuple descriptor (relation->rd_att).
1182  */
1183  RelationBuildTupleDesc(relation);
1184 
1185  /* foreign key data is not loaded till asked for */
1186  relation->rd_fkeylist = NIL;
1187  relation->rd_fkeyvalid = false;
1188 
1189  /* partitioning data is not loaded till asked for */
1190  relation->rd_partkey = NULL;
1191  relation->rd_partkeycxt = NULL;
1192  relation->rd_partdesc = NULL;
1193  relation->rd_partdesc_nodetached = NULL;
1195  relation->rd_pdcxt = NULL;
1196  relation->rd_pddcxt = NULL;
1197  relation->rd_partcheck = NIL;
1198  relation->rd_partcheckvalid = false;
1199  relation->rd_partcheckcxt = NULL;
1200 
1201  /*
1202  * initialize access method information
1203  */
1204  if (relation->rd_rel->relkind == RELKIND_INDEX ||
1205  relation->rd_rel->relkind == RELKIND_PARTITIONED_INDEX)
1206  RelationInitIndexAccessInfo(relation);
1207  else if (RELKIND_HAS_TABLE_AM(relation->rd_rel->relkind) ||
1208  relation->rd_rel->relkind == RELKIND_SEQUENCE)
1210  else
1211  Assert(relation->rd_rel->relam == InvalidOid);
1212 
1213  /* extract reloptions if any */
1214  RelationParseRelOptions(relation, pg_class_tuple);
1215 
1216  /*
1217  * Fetch rules and triggers that affect this relation.
1218  *
1219  * Note that RelationBuildRuleLock() relies on this being done after
1220  * extracting the relation's reloptions.
1221  */
1222  if (relation->rd_rel->relhasrules)
1223  RelationBuildRuleLock(relation);
1224  else
1225  {
1226  relation->rd_rules = NULL;
1227  relation->rd_rulescxt = NULL;
1228  }
1229 
1230  if (relation->rd_rel->relhastriggers)
1231  RelationBuildTriggers(relation);
1232  else
1233  relation->trigdesc = NULL;
1234 
1235  if (relation->rd_rel->relrowsecurity)
1236  RelationBuildRowSecurity(relation);
1237  else
1238  relation->rd_rsdesc = NULL;
1239 
1240  /*
1241  * initialize the relation lock manager information
1242  */
1243  RelationInitLockInfo(relation); /* see lmgr.c */
1244 
1245  /*
1246  * initialize physical addressing information for the relation
1247  */
1248  RelationInitPhysicalAddr(relation);
1249 
1250  /* make sure relation is marked as having no open file yet */
1251  relation->rd_smgr = NULL;
1252 
1253  /*
1254  * now we can free the memory allocated for pg_class_tuple
1255  */
1256  heap_freetuple(pg_class_tuple);
1257 
1258  /*
1259  * If an invalidation arrived mid-build, start over. Between here and the
1260  * end of this function, don't add code that does or reasonably could read
1261  * system catalogs. That range must be free from invalidation processing
1262  * for the !insertIt case. For the insertIt case, RelationCacheInsert()
1263  * will enroll this relation in ordinary relcache invalidation processing,
1264  */
1265  if (in_progress_list[in_progress_offset].invalidated)
1266  {
1267  RelationDestroyRelation(relation, false);
1268  goto retry;
1269  }
1270  Assert(in_progress_offset + 1 == in_progress_list_len);
1272 
1273  /*
1274  * Insert newly created relation into relcache hash table, if requested.
1275  *
1276  * There is one scenario in which we might find a hashtable entry already
1277  * present, even though our caller failed to find it: if the relation is a
1278  * system catalog or index that's used during relcache load, we might have
1279  * recursively created the same relcache entry during the preceding steps.
1280  * So allow RelationCacheInsert to delete any already-present relcache
1281  * entry for the same OID. The already-present entry should have refcount
1282  * zero (else somebody forgot to close it); in the event that it doesn't,
1283  * we'll elog a WARNING and leak the already-present entry.
1284  */
1285  if (insertIt)
1286  RelationCacheInsert(relation, true);
1287 
1288  /* It's fully valid */
1289  relation->rd_isvalid = true;
1290 
1291 #ifdef MAYBE_RECOVER_RELATION_BUILD_MEMORY
1292  if (tmpcxt)
1293  {
1294  /* Return to caller's context, and blow away the temporary context */
1295  MemoryContextSwitchTo(oldcxt);
1296  MemoryContextDelete(tmpcxt);
1297  }
1298 #endif
1299 
1300  return relation;
1301 }
#define BackendIdForTempRelations()
Definition: backendid.h:34
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
MemoryContext CurrentMemoryContext
Definition: mcxt.c:135
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:387
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:153
bool isTempOrTempToastNamespace(Oid namespaceId)
Definition: namespace.c:3224
int GetTempNamespaceBackendId(Oid namespaceId)
Definition: namespace.c:3317
void RelationBuildRowSecurity(Relation relation)
Definition: policy.c:196
#define RECOVER_RELATION_BUILD_MEMORY
Definition: relcache.c:102
static void RelationParseRelOptions(Relation relation, HeapTuple tuple)
Definition: relcache.c:462
static Relation AllocateRelationDesc(Form_pg_class relp)
Definition: relcache.c:407
void RelationInitIndexAccessInfo(Relation relation)
Definition: relcache.c:1417
static int in_progress_list_maxlen
Definition: relcache.c:172
static void RelationDestroyRelation(Relation relation, bool remember_tupdesc)
Definition: relcache.c:2402
static void RelationBuildRuleLock(Relation relation)
Definition: relcache.c:731
static HeapTuple ScanPgRelation(Oid targetRelId, bool indexOK, bool force_non_historic)
Definition: relcache.c:337
static void RelationBuildTupleDesc(Relation relation)
Definition: relcache.c:519
static InProgressEnt * in_progress_list
Definition: relcache.c:170
bool invalidated
Definition: relcache.c:167
void RelationBuildTriggers(Relation relation)
Definition: trigger.c:1867

References AllocateRelationDesc(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, Assert(), BackendIdForTempRelations, CurrentMemoryContext, debug_discard_caches, elog(), ERROR, GETSTRUCT, GetTempNamespaceBackendId(), heap_freetuple(), HeapTupleIsValid, in_progress_list, in_progress_list_len, in_progress_list_maxlen, inprogressent::invalidated, InvalidBackendId, InvalidOid, InvalidSubTransactionId, InvalidTransactionId, isTempOrTempToastNamespace(), MemoryContextDelete(), MemoryContextSwitchTo(), NIL, RelationData::rd_backend, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilelocatorSubid, RelationData::rd_fkeylist, RelationData::rd_fkeyvalid, RelationData::rd_islocaltemp, RelationData::rd_isnailed, RelationData::rd_isvalid, RelationData::rd_newRelfilelocatorSubid, RelationData::rd_partcheck, RelationData::rd_partcheckcxt, RelationData::rd_partcheckvalid, RelationData::rd_partdesc, RelationData::rd_partdesc_nodetached, RelationData::rd_partdesc_nodetached_xmin, RelationData::rd_partkey, RelationData::rd_partkeycxt, RelationData::rd_pdcxt, RelationData::rd_pddcxt, RelationData::rd_refcnt, RelationData::rd_rel, RelationData::rd_rsdesc, RelationData::rd_rules, RelationData::rd_rulescxt, RelationData::rd_smgr, RECOVER_RELATION_BUILD_MEMORY, RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationBuildTriggers(), RelationBuildTupleDesc(), RelationCacheInsert, RelationDestroyRelation(), RelationGetRelid, RelationInitIndexAccessInfo(), RelationInitLockInfo(), RelationInitPhysicalAddr(), RelationInitTableAccessMethod(), RelationParseRelOptions(), inprogressent::reloid, repalloc(), ScanPgRelation(), and RelationData::trigdesc.

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

◆ RelationBuildLocalRelation()

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

Definition at line 3466 of file relcache.c.

3477 {
3478  Relation rel;
3479  MemoryContext oldcxt;
3480  int natts = tupDesc->natts;
3481  int i;
3482  bool has_not_null;
3483  bool nailit;
3484 
3485  Assert(natts >= 0);
3486 
3487  /*
3488  * check for creation of a rel that must be nailed in cache.
3489  *
3490  * XXX this list had better match the relations specially handled in
3491  * RelationCacheInitializePhase2/3.
3492  */
3493  switch (relid)
3494  {
3495  case DatabaseRelationId:
3496  case AuthIdRelationId:
3497  case AuthMemRelationId:
3498  case RelationRelationId:
3499  case AttributeRelationId:
3500  case ProcedureRelationId:
3501  case TypeRelationId:
3502  nailit = true;
3503  break;
3504  default:
3505  nailit = false;
3506  break;
3507  }
3508 
3509  /*
3510  * check that hardwired list of shared rels matches what's in the
3511  * bootstrap .bki file. If you get a failure here during initdb, you
3512  * probably need to fix IsSharedRelation() to match whatever you've done
3513  * to the set of shared relations.
3514  */
3515  if (shared_relation != IsSharedRelation(relid))
3516  elog(ERROR, "shared_relation flag for \"%s\" does not match IsSharedRelation(%u)",
3517  relname, relid);
3518 
3519  /* Shared relations had better be mapped, too */
3520  Assert(mapped_relation || !shared_relation);
3521 
3522  /*
3523  * switch to the cache context to create the relcache entry.
3524  */
3525  if (!CacheMemoryContext)
3527 
3529 
3530  /*
3531  * allocate a new relation descriptor and fill in basic state fields.
3532  */
3533  rel = (Relation) palloc0(sizeof(RelationData));
3534 
3535  /* make sure relation is marked as having no open file yet */
3536  rel->rd_smgr = NULL;
3537 
3538  /* mark it nailed if appropriate */
3539  rel->rd_isnailed = nailit;
3540 
3541  rel->rd_refcnt = nailit ? 1 : 0;
3542 
3543  /* it's being created in this transaction */
3548 
3549  /*
3550  * create a new tuple descriptor from the one passed in. We do this
3551  * partly to copy it into the cache context, and partly because the new
3552  * relation can't have any defaults or constraints yet; they have to be
3553  * added in later steps, because they require additions to multiple system
3554  * catalogs. We can copy attnotnull constraints here, however.
3555  */
3556  rel->rd_att = CreateTupleDescCopy(tupDesc);
3557  rel->rd_att->tdrefcount = 1; /* mark as refcounted */
3558  has_not_null = false;
3559  for (i = 0; i < natts; i++)
3560  {
3561  Form_pg_attribute satt = TupleDescAttr(tupDesc, i);
3562  Form_pg_attribute datt = TupleDescAttr(rel->rd_att, i);
3563 
3564  datt->attidentity = satt->attidentity;
3565  datt->attgenerated = satt->attgenerated;
3566  datt->attnotnull = satt->attnotnull;
3567  has_not_null |= satt->attnotnull;
3568  }
3569 
3570  if (has_not_null)
3571  {
3572  TupleConstr *constr = (TupleConstr *) palloc0(sizeof(TupleConstr));
3573 
3574  constr->has_not_null = true;
3575  rel->rd_att->constr = constr;
3576  }
3577 
3578  /*
3579  * initialize relation tuple form (caller may add/override data later)
3580  */
3582 
3583  namestrcpy(&rel->rd_rel->relname, relname);
3584  rel->rd_rel->relnamespace = relnamespace;
3585 
3586  rel->rd_rel->relkind = relkind;
3587  rel->rd_rel->relnatts = natts;
3588  rel->rd_rel->reltype = InvalidOid;
3589  /* needed when bootstrapping: */
3590  rel->rd_rel->relowner = BOOTSTRAP_SUPERUSERID;
3591 
3592  /* set up persistence and relcache fields dependent on it */
3593  rel->rd_rel->relpersistence = relpersistence;
3594  switch (relpersistence)
3595  {
3596  case RELPERSISTENCE_UNLOGGED:
3597  case RELPERSISTENCE_PERMANENT:
3599  rel->rd_islocaltemp = false;
3600  break;
3601  case RELPERSISTENCE_TEMP:
3602  Assert(isTempOrTempToastNamespace(relnamespace));
3604  rel->rd_islocaltemp = true;
3605  break;
3606  default:
3607  elog(ERROR, "invalid relpersistence: %c", relpersistence);
3608  break;
3609  }
3610 
3611  /* if it's a materialized view, it's not populated initially */
3612  if (relkind == RELKIND_MATVIEW)
3613  rel->rd_rel->relispopulated = false;
3614  else
3615  rel->rd_rel->relispopulated = true;
3616 
3617  /* set replica identity -- system catalogs and non-tables don't have one */
3618  if (!IsCatalogNamespace(relnamespace) &&
3619  (relkind == RELKIND_RELATION ||
3620  relkind == RELKIND_MATVIEW ||
3621  relkind == RELKIND_PARTITIONED_TABLE))
3622  rel->rd_rel->relreplident = REPLICA_IDENTITY_DEFAULT;
3623  else
3624  rel->rd_rel->relreplident = REPLICA_IDENTITY_NOTHING;
3625 
3626  /*
3627  * Insert relation physical and logical identifiers (OIDs) into the right
3628  * places. For a mapped relation, we set relfilenumber to zero and rely
3629  * on RelationInitPhysicalAddr to consult the map.
3630  */
3631  rel->rd_rel->relisshared = shared_relation;
3632 
3633  RelationGetRelid(rel) = relid;
3634 
3635  for (i = 0; i < natts; i++)
3636  TupleDescAttr(rel->rd_att, i)->attrelid = relid;
3637 
3638  rel->rd_rel->reltablespace = reltablespace;
3639 
3640  if (mapped_relation)
3641  {
3642  rel->rd_rel->relfilenode = InvalidRelFileNumber;
3643  /* Add it to the active mapping information */
3644  RelationMapUpdateMap(relid, relfilenumber, shared_relation, true);
3645  }
3646  else
3647  rel->rd_rel->relfilenode = relfilenumber;
3648 
3649  RelationInitLockInfo(rel); /* see lmgr.c */
3650 
3652 
3653  rel->rd_rel->relam = accessmtd;
3654 
3655  /*
3656  * RelationInitTableAccessMethod will do syscache lookups, so we mustn't
3657  * run it in CacheMemoryContext. Fortunately, the remaining steps don't
3658  * require a long-lived current context.
3659  */
3660  MemoryContextSwitchTo(oldcxt);
3661 
3662  if (RELKIND_HAS_TABLE_AM(relkind) || relkind == RELKIND_SEQUENCE)
3664 
3665  /*
3666  * Okay to insert into the relcache hash table.
3667  *
3668  * Ordinarily, there should certainly not be an existing hash entry for
3669  * the same OID; but during bootstrap, when we create a "real" relcache
3670  * entry for one of the bootstrap relations, we'll be overwriting the
3671  * phony one created with formrdesc. So allow that to happen for nailed
3672  * rels.
3673  */
3674  RelationCacheInsert(rel, nailit);
3675 
3676  /*
3677  * Flag relation as needing eoxact cleanup (to clear rd_createSubid). We
3678  * can't do this before storing relid in it.
3679  */
3680  EOXactListAdd(rel);
3681 
3682  /* It's fully valid */
3683  rel->rd_isvalid = true;
3684 
3685  /*
3686  * Caller expects us to pin the returned entry.
3687  */
3689 
3690  return rel;
3691 }
bool IsCatalogNamespace(Oid namespaceId)
Definition: catalog.c:184
bool IsSharedRelation(Oid relationId)
Definition: catalog.c:245
NameData relname
Definition: pg_class.h:38
void RelationIncrementReferenceCount(Relation rel)
Definition: relcache.c:2127
TupleDesc CreateTupleDescCopy(TupleDesc tupdesc)
Definition: tupdesc.c:111

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

Referenced by heap_create().

◆ RelationBuildPublicationDesc()

void RelationBuildPublicationDesc ( Relation  relation,
PublicationDesc pubdesc 
)

Definition at line 5648 of file relcache.c.

5649 {
5650  List *puboids;
5651  ListCell *lc;
5652  MemoryContext oldcxt;
5653  Oid schemaid;
5654  List *ancestors = NIL;
5655  Oid relid = RelationGetRelid(relation);
5656 
5657  /*
5658  * If not publishable, it publishes no actions. (pgoutput_change() will
5659  * ignore it.)
5660  */
5661  if (!is_publishable_relation(relation))
5662  {
5663  memset(pubdesc, 0, sizeof(PublicationDesc));
5664  pubdesc->rf_valid_for_update = true;
5665  pubdesc->rf_valid_for_delete = true;
5666  pubdesc->cols_valid_for_update = true;
5667  pubdesc->cols_valid_for_delete = true;
5668  return;
5669  }
5670 
5671  if (relation->rd_pubdesc)
5672  {
5673  memcpy(pubdesc, relation->rd_pubdesc, sizeof(PublicationDesc));
5674  return;
5675  }
5676 
5677  memset(pubdesc, 0, sizeof(PublicationDesc));
5678  pubdesc->rf_valid_for_update = true;
5679  pubdesc->rf_valid_for_delete = true;
5680  pubdesc->cols_valid_for_update = true;
5681  pubdesc->cols_valid_for_delete = true;
5682 
5683  /* Fetch the publication membership info. */
5684  puboids = GetRelationPublications(relid);
5685  schemaid = RelationGetNamespace(relation);
5686  puboids = list_concat_unique_oid(puboids, GetSchemaPublications(schemaid));
5687 
5688  if (relation->rd_rel->relispartition)
5689  {
5690  /* Add publications that the ancestors are in too. */
5691  ancestors = get_partition_ancestors(relid);
5692 
5693  foreach(lc, ancestors)
5694  {
5695  Oid ancestor = lfirst_oid(lc);
5696 
5697  puboids = list_concat_unique_oid(puboids,
5698  GetRelationPublications(ancestor));
5699  schemaid = get_rel_namespace(ancestor);
5700  puboids = list_concat_unique_oid(puboids,
5701  GetSchemaPublications(schemaid));
5702  }
5703  }
5704  puboids = list_concat_unique_oid(puboids, GetAllTablesPublications());
5705 
5706  foreach(lc, puboids)
5707  {
5708  Oid pubid = lfirst_oid(lc);
5709  HeapTuple tup;
5710  Form_pg_publication pubform;
5711 
5713 
5714  if (!HeapTupleIsValid(tup))
5715  elog(ERROR, "cache lookup failed for publication %u", pubid);
5716 
5717  pubform = (Form_pg_publication) GETSTRUCT(tup);
5718 
5719  pubdesc->pubactions.pubinsert |= pubform->pubinsert;
5720  pubdesc->pubactions.pubupdate |= pubform->pubupdate;
5721  pubdesc->pubactions.pubdelete |= pubform->pubdelete;
5722  pubdesc->pubactions.pubtruncate |= pubform->pubtruncate;
5723 
5724  /*
5725  * Check if all columns referenced in the filter expression are part
5726  * of the REPLICA IDENTITY index or not.
5727  *
5728  * If the publication is FOR ALL TABLES then it means the table has no
5729  * row filters and we can skip the validation.
5730  */
5731  if (!pubform->puballtables &&
5732  (pubform->pubupdate || pubform->pubdelete) &&
5733  pub_rf_contains_invalid_column(pubid, relation, ancestors,
5734  pubform->pubviaroot))
5735  {
5736  if (pubform->pubupdate)
5737  pubdesc->rf_valid_for_update = false;
5738  if (pubform->pubdelete)
5739  pubdesc->rf_valid_for_delete = false;
5740  }
5741 
5742  /*
5743  * Check if all columns are part of the REPLICA IDENTITY index or not.
5744  *
5745  * If the publication is FOR ALL TABLES then it means the table has no
5746  * column list and we can skip the validation.
5747  */
5748  if (!pubform->puballtables &&
5749  (pubform->pubupdate || pubform->pubdelete) &&
5750  pub_collist_contains_invalid_column(pubid, relation, ancestors,
5751  pubform->pubviaroot))
5752  {
5753  if (pubform->pubupdate)
5754  pubdesc->cols_valid_for_update = false;
5755  if (pubform->pubdelete)
5756  pubdesc->cols_valid_for_delete = false;
5757  }
5758 
5759  ReleaseSysCache(tup);
5760 
5761  /*
5762  * If we know everything is replicated and the row filter is invalid
5763  * for update and delete, there is no point to check for other
5764  * publications.
5765  */
5766  if (pubdesc->pubactions.pubinsert && pubdesc->pubactions.pubupdate &&
5767  pubdesc->pubactions.pubdelete && pubdesc->pubactions.pubtruncate &&
5768  !pubdesc->rf_valid_for_update && !pubdesc->rf_valid_for_delete)
5769  break;
5770 
5771  /*
5772  * If we know everything is replicated and the column list is invalid
5773  * for update and delete, there is no point to check for other
5774  * publications.
5775  */
5776  if (pubdesc->pubactions.pubinsert && pubdesc->pubactions.pubupdate &&
5777  pubdesc->pubactions.pubdelete && pubdesc->pubactions.pubtruncate &&
5778  !pubdesc->cols_valid_for_update && !pubdesc->cols_valid_for_delete)
5779  break;
5780  }
5781 
5782  if (relation->rd_pubdesc)
5783  {
5784  pfree(relation->rd_pubdesc);
5785  relation->rd_pubdesc = NULL;
5786  }
5787 
5788  /* Now save copy of the descriptor in the relcache entry. */
5790  relation->rd_pubdesc = palloc(sizeof(PublicationDesc));
5791  memcpy(relation->rd_pubdesc, pubdesc, sizeof(PublicationDesc));
5792  MemoryContextSwitchTo(oldcxt);
5793 }
List * list_concat_unique_oid(List *list1, const List *list2)
Definition: list.c:1468
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1934
List * get_partition_ancestors(Oid relid)
Definition: partition.c:133
#define lfirst_oid(lc)
Definition: pg_list.h:174
List * GetSchemaPublications(Oid schemaid)
List * GetRelationPublications(Oid relid)
List * GetAllTablesPublications(void)
bool is_publishable_relation(Relation rel)
FormData_pg_publication * Form_pg_publication
bool pub_rf_contains_invalid_column(Oid pubid, Relation relation, List *ancestors, bool pubviaroot)
bool pub_collist_contains_invalid_column(Oid pubid, Relation relation, List *ancestors, bool pubviaroot)
Definition: pg_list.h:54
PublicationActions pubactions
bool cols_valid_for_delete
bool cols_valid_for_update
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:865
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:817
@ PUBLICATIONOID
Definition: syscache.h:83

References CacheMemoryContext, PublicationDesc::cols_valid_for_delete, PublicationDesc::cols_valid_for_update, elog(), ERROR, get_partition_ancestors(), get_rel_namespace(), GetAllTablesPublications(), GetRelationPublications(), GetSchemaPublications(), GETSTRUCT, HeapTupleIsValid, is_publishable_relation(), lfirst_oid, list_concat_unique_oid(), MemoryContextSwitchTo(), NIL, ObjectIdGetDatum(), palloc(), pfree(), pub_collist_contains_invalid_column(), pub_rf_contains_invalid_column(), PublicationDesc::pubactions, PublicationActions::pubdelete, PublicationActions::pubinsert, PUBLICATIONOID, PublicationActions::pubtruncate, PublicationActions::pubupdate, RelationData::rd_pubdesc, RelationData::rd_rel, RelationGetNamespace, RelationGetRelid, ReleaseSysCache(), PublicationDesc::rf_valid_for_delete, PublicationDesc::rf_valid_for_update, and SearchSysCache1().

Referenced by CheckCmdReplicaIdentity().

◆ RelationBuildRuleLock()

static void RelationBuildRuleLock ( Relation  relation)
static

Definition at line 731 of file relcache.c.

732 {
733  MemoryContext rulescxt;
734  MemoryContext oldcxt;
735  HeapTuple rewrite_tuple;
736  Relation rewrite_desc;
737  TupleDesc rewrite_tupdesc;
738  SysScanDesc rewrite_scan;
740  RuleLock *rulelock;
741  int numlocks;
742  RewriteRule **rules;
743  int maxlocks;
744 
745  /*
746  * Make the private context. Assume it'll not contain much data.
747  */
749  "relation rules",
751  relation->rd_rulescxt = rulescxt;
753  RelationGetRelationName(relation));
754 
755  /*
756  * allocate an array to hold the rewrite rules (the array is extended if
757  * necessary)
758  */
759  maxlocks = 4;
760  rules = (RewriteRule **)
761  MemoryContextAlloc(rulescxt, sizeof(RewriteRule *) * maxlocks);
762  numlocks = 0;
763 
764  /*
765  * form a scan key
766  */
767  ScanKeyInit(&key,
768  Anum_pg_rewrite_ev_class,
769  BTEqualStrategyNumber, F_OIDEQ,
771 
772  /*
773  * open pg_rewrite and begin a scan
774  *
775  * Note: since we scan the rules using RewriteRelRulenameIndexId, we will
776  * be reading the rules in name order, except possibly during
777  * emergency-recovery operations (ie, IgnoreSystemIndexes). This in turn
778  * ensures that rules will be fired in name order.
779  */
780  rewrite_desc = table_open(RewriteRelationId, AccessShareLock);
781  rewrite_tupdesc = RelationGetDescr(rewrite_desc);
782  rewrite_scan = systable_beginscan(rewrite_desc,
783  RewriteRelRulenameIndexId,
784  true, NULL,
785  1, &key);
786 
787  while (HeapTupleIsValid(rewrite_tuple = systable_getnext(rewrite_scan)))
788  {
789  Form_pg_rewrite rewrite_form = (Form_pg_rewrite) GETSTRUCT(rewrite_tuple);
790  bool isnull;
791  Datum rule_datum;
792  char *rule_str;
793  RewriteRule *rule;
794  Oid check_as_user;
795 
796  rule = (RewriteRule *) MemoryContextAlloc(rulescxt,
797  sizeof(RewriteRule));
798 
799  rule->ruleId = rewrite_form->oid;
800 
801  rule->event = rewrite_form->ev_type - '0';
802  rule->enabled = rewrite_form->ev_enabled;
803  rule->isInstead = rewrite_form->is_instead;
804 
805  /*
806  * Must use heap_getattr to fetch ev_action and ev_qual. Also, the
807  * rule strings are often large enough to be toasted. To avoid
808  * leaking memory in the caller's context, do the detoasting here so
809  * we can free the detoasted version.
810  */
811  rule_datum = heap_getattr(rewrite_tuple,
812  Anum_pg_rewrite_ev_action,
813  rewrite_tupdesc,
814  &isnull);
815  Assert(!isnull);
816  rule_str = TextDatumGetCString(rule_datum);
817  oldcxt = MemoryContextSwitchTo(rulescxt);
818  rule->actions = (List *) stringToNode(rule_str);
819  MemoryContextSwitchTo(oldcxt);
820  pfree(rule_str);
821 
822  rule_datum = heap_getattr(rewrite_tuple,
823  Anum_pg_rewrite_ev_qual,
824  rewrite_tupdesc,
825  &isnull);
826  Assert(!isnull);
827  rule_str = TextDatumGetCString(rule_datum);
828  oldcxt = MemoryContextSwitchTo(rulescxt);
829  rule->qual = (Node *) stringToNode(rule_str);
830  MemoryContextSwitchTo(oldcxt);
831  pfree(rule_str);
832 
833  /*
834  * If this is a SELECT rule defining a view, and the view has
835  * "security_invoker" set, we must perform all permissions checks on
836  * relations referred to by the rule as the invoking user.
837  *
838  * In all other cases (including non-SELECT rules on security invoker
839  * views), perform the permissions checks as the relation owner.
840  */
841  if (rule->event == CMD_SELECT &&
842  relation->rd_rel->relkind == RELKIND_VIEW &&
843  RelationHasSecurityInvoker(relation))
844  check_as_user = InvalidOid;
845  else
846  check_as_user = relation->rd_rel->relowner;
847 
848  /*
849  * Scan through the rule's actions and set the checkAsUser field on
850  * all RTEPermissionInfos. We have to look at the qual as well, in
851  * case it contains sublinks.
852  *
853  * The reason for doing this when the rule is loaded, rather than when
854  * it is stored, is that otherwise ALTER TABLE OWNER would have to
855  * grovel through stored rules to update checkAsUser fields. Scanning
856  * the rule tree during load is relatively cheap (compared to
857  * constructing it in the first place), so we do it here.
858  */
859  setRuleCheckAsUser((Node *) rule->actions, check_as_user);
860  setRuleCheckAsUser(rule->qual, check_as_user);
861 
862  if (numlocks >= maxlocks)
863  {
864  maxlocks *= 2;
865  rules = (RewriteRule **)
866  repalloc(rules, sizeof(RewriteRule *) * maxlocks);
867  }
868  rules[numlocks++] = rule;
869  }
870 
871  /*
872  * end the scan and close the attribute relation
873  */
874  systable_endscan(rewrite_scan);
875  table_close(rewrite_desc, AccessShareLock);
876 
877  /*
878  * there might not be any rules (if relhasrules is out-of-date)
879  */
880  if (numlocks == 0)
881  {
882  relation->rd_rules = NULL;
883  relation->rd_rulescxt = NULL;
884  MemoryContextDelete(rulescxt);
885  return;
886  }
887 
888  /*
889  * form a RuleLock and insert into relation
890  */
891  rulelock = (RuleLock *) MemoryContextAlloc(rulescxt, sizeof(RuleLock));
892  rulelock->numLocks = numlocks;
893  rulelock->rules = rules;
894 
895  relation->rd_rules = rulelock;
896 }
static Datum heap_getattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
Definition: htup_details.h:792
@ CMD_SELECT
Definition: nodes.h:276
FormData_pg_rewrite * Form_pg_rewrite
Definition: pg_rewrite.h:52
void * stringToNode(const char *str)
Definition: read.c:90
#define RelationHasSecurityInvoker(relation)
Definition: rel.h:434
void setRuleCheckAsUser(Node *node, Oid userid)
Definition: nodes.h:129
Definition: localtime.c:73
static struct rule * rules
Definition: zic.c:283

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

Referenced by RelationBuildDesc(), and RelationCacheInitializePhase3().

◆ RelationBuildTupleDesc()

static void RelationBuildTupleDesc ( Relation  relation)
static

Definition at line 519 of file relcache.c.

520 {
521  HeapTuple pg_attribute_tuple;
522  Relation pg_attribute_desc;
523  SysScanDesc pg_attribute_scan;
524  ScanKeyData skey[2];
525  int need;
526  TupleConstr *constr;
527  AttrMissing *attrmiss = NULL;
528  int ndef = 0;
529 
530  /* fill rd_att's type ID fields (compare heap.c's AddNewRelationTuple) */
531  relation->rd_att->tdtypeid =
532  relation->rd_rel->reltype ? relation->rd_rel->reltype : RECORDOID;
533  relation->rd_att->tdtypmod = -1; /* just to be sure */
534 
536  sizeof(TupleConstr));
537  constr->has_not_null = false;
538  constr->has_generated_stored = false;
539 
540  /*
541  * Form a scan key that selects only user attributes (attnum > 0).
542  * (Eliminating system attribute rows at the index level is lots faster
543  * than fetching them.)
544  */
545  ScanKeyInit(&skey[0],
546  Anum_pg_attribute_attrelid,
547  BTEqualStrategyNumber, F_OIDEQ,
549  ScanKeyInit(&skey[1],
550  Anum_pg_attribute_attnum,
551  BTGreaterStrategyNumber, F_INT2GT,
552  Int16GetDatum(0));
553 
554  /*
555  * Open pg_attribute and begin a scan. Force heap scan if we haven't yet
556  * built the critical relcache entries (this includes initdb and startup
557  * without a pg_internal.init file).
558  */
559  pg_attribute_desc = table_open(AttributeRelationId, AccessShareLock);
560  pg_attribute_scan = systable_beginscan(pg_attribute_desc,
561  AttributeRelidNumIndexId,
563  NULL,
564  2, skey);
565 
566  /*
567  * add attribute data to relation->rd_att
568  */
569  need = RelationGetNumberOfAttributes(relation);
570 
571  while (HeapTupleIsValid(pg_attribute_tuple = systable_getnext(pg_attribute_scan)))
572  {
573  Form_pg_attribute attp;
574  int attnum;
575 
576  attp = (Form_pg_attribute) GETSTRUCT(pg_attribute_tuple);
577 
578  attnum = attp->attnum;
579  if (attnum <= 0 || attnum > RelationGetNumberOfAttributes(relation))
580  elog(ERROR, "invalid attribute number %d for relation \"%s\"",
581  attp->attnum, RelationGetRelationName(relation));
582 
583  memcpy(TupleDescAttr(relation->rd_att, attnum - 1),
584  attp,
586 
587  /* Update constraint/default info */
588  if (attp->attnotnull)
589  constr->has_not_null = true;
590  if (attp->attgenerated == ATTRIBUTE_GENERATED_STORED)
591  constr->has_generated_stored = true;
592  if (attp->atthasdef)
593  ndef++;
594 
595  /* If the column has a "missing" value, put it in the attrmiss array */
596  if (attp->atthasmissing)
597  {
598  Datum missingval;
599  bool missingNull;
600 
601  /* Do we have a missing value? */
602  missingval = heap_getattr(pg_attribute_tuple,
603  Anum_pg_attribute_attmissingval,
604  pg_attribute_desc->rd_att,
605  &missingNull);
606  if (!missingNull)
607  {
608  /* Yes, fetch from the array */
609  MemoryContext oldcxt;
610  bool is_null;
611  int one = 1;
612  Datum missval;
613 
614  if (attrmiss == NULL)
615  attrmiss = (AttrMissing *)
617  relation->rd_rel->relnatts *
618  sizeof(AttrMissing));
619 
620  missval = array_get_element(missingval,
621  1,
622  &one,
623  -1,
624  attp->attlen,
625  attp->attbyval,
626  attp->attalign,
627  &is_null);
628  Assert(!is_null);
629  if (attp->attbyval)
630  {
631  /* for copy by val just copy the datum direct */
632  attrmiss[attnum - 1].am_value = missval;
633  }
634  else
635  {
636  /* otherwise copy in the correct context */
638  attrmiss[attnum - 1].am_value = datumCopy(missval,
639  attp->attbyval,
640  attp->attlen);
641  MemoryContextSwitchTo(oldcxt);
642  }
643  attrmiss[attnum - 1].am_present = true;
644  }
645  }
646  need--;
647  if (need == 0)
648  break;
649  }
650 
651  /*
652  * end the scan and close the attribute relation
653  */
654  systable_endscan(pg_attribute_scan);
655  table_close(pg_attribute_desc, AccessShareLock);
656 
657  if (need != 0)
658  elog(ERROR, "pg_attribute catalog is missing %d attribute(s) for relation OID %u",
659  need, RelationGetRelid(relation));
660 
661  /*
662  * The attcacheoff values we read from pg_attribute should all be -1
663  * ("unknown"). Verify this if assert checking is on. They will be
664  * computed when and if needed during tuple access.
665  */
666 #ifdef USE_ASSERT_CHECKING
667  {
668  int i;
669 
670  for (i = 0; i < RelationGetNumberOfAttributes(relation); i++)
671  Assert(TupleDescAttr(relation->rd_att, i)->attcacheoff == -1);
672  }
673 #endif
674 
675  /*
676  * However, we can easily set the attcacheoff value for the first
677  * attribute: it must be zero. This eliminates the need for special cases
678  * for attnum=1 that used to exist in fastgetattr() and index_getattr().
679  */
680  if (RelationGetNumberOfAttributes(relation) > 0)
681  TupleDescAttr(relation->rd_att, 0)->attcacheoff = 0;
682 
683  /*
684  * Set up constraint/default info
685  */
686  if (constr->has_not_null ||
687  constr->has_generated_stored ||
688  ndef > 0 ||
689  attrmiss ||
690  relation->rd_rel->relchecks > 0)
691  {
692  relation->rd_att->constr = constr;
693 
694  if (ndef > 0) /* DEFAULTs */
695  AttrDefaultFetch(relation, ndef);
696  else
697  constr->num_defval = 0;
698 
699  constr->missing = attrmiss;
700 
701  if (relation->rd_rel->relchecks > 0) /* CHECKs */
702  CheckConstraintFetch(relation);
703  else
704  constr->num_check = 0;
705  }
706  else
707  {
708  pfree(constr);
709  relation->rd_att->constr = NULL;
710  }
711 }
Datum array_get_element(Datum arraydatum, int nSubscripts, int *indx, int arraytyplen, int elmlen, bool elmbyval, char elmalign, bool *isNull)
Definition: arrayfuncs.c:1855
static Datum Int16GetDatum(int16 X)
Definition: postgres.h:172
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:509
static void AttrDefaultFetch(Relation relation, int ndef)
Definition: relcache.c:4423
static void CheckConstraintFetch(Relation relation)
Definition: relcache.c:4518
#define BTGreaterStrategyNumber
Definition: stratnum.h:33
bool has_generated_stored
Definition: tupdesc.h:45
struct AttrMissing * missing
Definition: tupdesc.h:41

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

Referenced by RelationBuildDesc().

◆ RelationCacheInitFilePostInvalidate()

void RelationCacheInitFilePostInvalidate ( void  )

Definition at line 6732 of file relcache.c.

6733 {
6734  LWLockRelease(RelCacheInitLock);
6735 }
void LWLockRelease(LWLock *lock)
Definition: lwlock.c:1803

References LWLockRelease().

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

◆ RelationCacheInitFilePreInvalidate()

void RelationCacheInitFilePreInvalidate ( void  )

Definition at line 6707 of file relcache.c.

6708 {
6709  char localinitfname[MAXPGPATH];
6710  char sharedinitfname[MAXPGPATH];
6711 
6712  if (DatabasePath)
6713  snprintf(localinitfname, sizeof(localinitfname), "%s/%s",
6715  snprintf(sharedinitfname, sizeof(sharedinitfname), "global/%s",
6717 
6718  LWLockAcquire(RelCacheInitLock, LW_EXCLUSIVE);
6719 
6720  /*
6721  * The files might not be there if no backend has been started since the
6722  * last removal. But complain about failures other than ENOENT with
6723  * ERROR. Fortunately, it's not too late to abort the transaction if we
6724  * can't get rid of the would-be-obsolete init file.
6725  */
6726  if (DatabasePath)
6727  unlink_initfile(localinitfname, ERROR);
6728  unlink_initfile(sharedinitfname, ERROR);
6729 }
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition: lwlock.c:1195
@ LW_EXCLUSIVE
Definition: lwlock.h:115
static void unlink_initfile(const char *initfilename, int elevel)
Definition: relcache.c:6804

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

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

◆ RelationCacheInitFileRemove()

void RelationCacheInitFileRemove ( void  )

Definition at line 6747 of file relcache.c.

6748 {
6749  const char *tblspcdir = "pg_tblspc";
6750  DIR *dir;
6751  struct dirent *de;
6752  char path[MAXPGPATH + 10 + sizeof(TABLESPACE_VERSION_DIRECTORY)];
6753 
6754  snprintf(path, sizeof(path), "global/%s",
6756  unlink_initfile(path, LOG);
6757 
6758  /* Scan everything in the default tablespace */
6760 
6761  /* Scan the tablespace link directory to find non-default tablespaces */
6762  dir = AllocateDir(tblspcdir);
6763 
6764  while ((de = ReadDirExtended(dir, tblspcdir, LOG)) != NULL)
6765  {
6766  if (strspn(de->d_name, "0123456789") == strlen(de->d_name))
6767  {
6768  /* Scan the tablespace dir for per-database dirs */
6769  snprintf(path, sizeof(path), "%s/%s/%s",
6770  tblspcdir, de->d_name, TABLESPACE_VERSION_DIRECTORY);
6772  }
6773  }
6774 
6775  FreeDir(dir);
6776 }
#define LOG
Definition: elog.h:31
int FreeDir(DIR *dir)
Definition: fd.c:2762
struct dirent * ReadDirExtended(DIR *dir, const char *dirname, int elevel)
Definition: fd.c:2725
DIR * AllocateDir(const char *dirname)
Definition: fd.c:2644
static void RelationCacheInitFileRemoveInDir(const char *tblspcpath)
Definition: relcache.c:6780
#define TABLESPACE_VERSION_DIRECTORY
Definition: relpath.h:33
Definition: dirent.c:26
Definition: dirent.h:10
char d_name[MAX_PATH]
Definition: dirent.h:15

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

Referenced by StartupXLOG().

◆ RelationCacheInitFileRemoveInDir()

static void RelationCacheInitFileRemoveInDir ( const char *  tblspcpath)
static

Definition at line 6780 of file relcache.c.

6781 {
6782  DIR *dir;
6783  struct dirent *de;
6784  char initfilename[MAXPGPATH * 2];
6785 
6786  /* Scan the tablespace directory to find per-database directories */
6787  dir = AllocateDir(tblspcpath);
6788 
6789  while ((de = ReadDirExtended(dir, tblspcpath, LOG)) != NULL)
6790  {
6791  if (strspn(de->d_name, "0123456789") == strlen(de->d_name))
6792  {
6793  /* Try to remove the init file in each database */
6794  snprintf(initfilename, sizeof(initfilename), "%s/%s/%s",
6795  tblspcpath, de->d_name, RELCACHE_INIT_FILENAME);
6796  unlink_initfile(initfilename, LOG);
6797  }
6798  }
6799 
6800  FreeDir(dir);
6801 }

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

Referenced by RelationCacheInitFileRemove().

◆ RelationCacheInitialize()

void RelationCacheInitialize ( void  )

Definition at line 3934 of file relcache.c.

3935 {
3936  HASHCTL ctl;
3937  int allocsize;
3938 
3939  /*
3940  * make sure cache memory context exists
3941  */
3942  if (!CacheMemoryContext)
3944 
3945  /*
3946  * create hashtable that indexes the relcache
3947  */
3948  ctl.keysize = sizeof(Oid);
3949  ctl.entrysize = sizeof(RelIdCacheEnt);
3950  RelationIdCache = hash_create("Relcache by OID", INITRELCACHESIZE,
3951  &ctl, HASH_ELEM | HASH_BLOBS);
3952 
3953  /*
3954  * reserve enough in_progress_list slots for many cases
3955  */
3956  allocsize = 4;
3959  allocsize * sizeof(*in_progress_list));
3960  in_progress_list_maxlen = allocsize;
3961 
3962  /*
3963  * relation mapper needs to be initialized too
3964  */
3966 }
#define INITRELCACHESIZE
Definition: relcache.c:3931
struct relidcacheent RelIdCacheEnt
void RelationMapInitialize(void)
Definition: relmapper.c:649

References CacheMemoryContext, CreateCacheMemoryContext(), HASHCTL::entrysize, HASH_BLOBS, hash_create(), HASH_ELEM, in_progress_list, in_progress_list_maxlen, INITRELCACHESIZE, HASHCTL::keysize, MemoryContextAlloc(), RelationIdCache, and RelationMapInitialize().

Referenced by InitPostgres().

◆ RelationCacheInitializePhase2()

void RelationCacheInitializePhase2 ( void  )

Definition at line 3980 of file relcache.c.

3981 {
3982  MemoryContext oldcxt;
3983 
3984  /*
3985  * relation mapper needs initialized too
3986  */
3988 
3989  /*
3990  * In bootstrap mode, the shared catalogs aren't there yet anyway, so do
3991  * nothing.
3992  */
3994  return;
3995 
3996  /*
3997  * switch to cache memory context
3998  */
4000 
4001  /*
4002  * Try to load the shared relcache cache file. If unsuccessful, bootstrap
4003  * the cache with pre-made descriptors for the critical shared catalogs.
4004  */
4005  if (!load_relcache_init_file(true))
4006  {
4007  formrdesc("pg_database", DatabaseRelation_Rowtype_Id, true,
4008  Natts_pg_database, Desc_pg_database);
4009  formrdesc("pg_authid", AuthIdRelation_Rowtype_Id, true,
4010  Natts_pg_authid, Desc_pg_authid);
4011  formrdesc("pg_auth_members", AuthMemRelation_Rowtype_Id, true,
4012  Natts_pg_auth_members, Desc_pg_auth_members);
4013  formrdesc("pg_shseclabel", SharedSecLabelRelation_Rowtype_Id, true,
4014  Natts_pg_shseclabel, Desc_pg_shseclabel);
4015  formrdesc("pg_subscription", SubscriptionRelation_Rowtype_Id, true,
4016  Natts_pg_subscription, Desc_pg_subscription);
4017 
4018 #define NUM_CRITICAL_SHARED_RELS 5 /* fix if you change list above */
4019  }
4020 
4021  MemoryContextSwitchTo(oldcxt);
4022 }
static bool load_relcache_init_file(bool shared)
Definition: relcache.c:6024
static const FormData_pg_attribute Desc_pg_shseclabel[Natts_pg_shseclabel]
Definition: relcache.c:119
static void formrdesc(const char *relationName, Oid relationReltype, bool isshared, int natts, const FormData_pg_attribute *attrs)
Definition: relcache.c:1866
static const FormData_pg_attribute Desc_pg_database[Natts_pg_database]
Definition: relcache.c:115
static const FormData_pg_attribute Desc_pg_authid[Natts_pg_authid]
Definition: relcache.c:116
static const FormData_pg_attribute Desc_pg_subscription[Natts_pg_subscription]
Definition: relcache.c:120
static const FormData_pg_attribute Desc_pg_auth_members[Natts_pg_auth_members]
Definition: relcache.c:117
void RelationMapInitializePhase2(void)
Definition: relmapper.c:669

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().

◆ RelationCacheInitializePhase3()

void RelationCacheInitializePhase3 ( void  )

Definition at line 4039 of file relcache.c.

4040 {
4042  RelIdCacheEnt *idhentry;
4043  MemoryContext oldcxt;
4044  bool needNewCacheFile = !criticalSharedRelcachesBuilt;
4045 
4046  /*
4047  * relation mapper needs initialized too
4048  */
4050 
4051  /*
4052  * switch to cache memory context
4053  */
4055 
4056  /*
4057  * Try to load the local relcache cache file. If unsuccessful, bootstrap
4058  * the cache with pre-made descriptors for the critical "nailed-in" system
4059  * catalogs.
4060  */
4061  if (IsBootstrapProcessingMode() ||
4062  !load_relcache_init_file(false))
4063  {
4064  needNewCacheFile = true;
4065 
4066  formrdesc("pg_class", RelationRelation_Rowtype_Id, false,
4067  Natts_pg_class, Desc_pg_class);
4068  formrdesc("pg_attribute", AttributeRelation_Rowtype_Id, false,
4069  Natts_pg_attribute, Desc_pg_attribute);
4070  formrdesc("pg_proc", ProcedureRelation_Rowtype_Id, false,
4071  Natts_pg_proc, Desc_pg_proc);
4072  formrdesc("pg_type", TypeRelation_Rowtype_Id, false,
4073  Natts_pg_type, Desc_pg_type);
4074 
4075 #define NUM_CRITICAL_LOCAL_RELS 4 /* fix if you change list above */
4076  }
4077 
4078  MemoryContextSwitchTo(oldcxt);
4079 
4080  /* In bootstrap mode, the faked-up formrdesc info is all we'll have */
4082  return;
4083 
4084  /*
4085  * If we didn't get the critical system indexes loaded into relcache, do
4086  * so now. These are critical because the catcache and/or opclass cache
4087  * depend on them for fetches done during relcache load. Thus, we have an
4088  * infinite-recursion problem. We can break the recursion by doing
4089  * heapscans instead of indexscans at certain key spots. To avoid hobbling
4090  * performance, we only want to do that until we have the critical indexes
4091  * loaded into relcache. Thus, the flag criticalRelcachesBuilt is used to
4092  * decide whether to do heapscan or indexscan at the key spots, and we set
4093  * it true after we've loaded the critical indexes.
4094  *
4095  * The critical indexes are marked as "nailed in cache", partly to make it
4096  * easy for load_relcache_init_file to count them, but mainly because we
4097  * cannot flush and rebuild them once we've set criticalRelcachesBuilt to
4098  * true. (NOTE: perhaps it would be possible to reload them by
4099  * temporarily setting criticalRelcachesBuilt to false again. For now,
4100  * though, we just nail 'em in.)
4101  *
4102  * RewriteRelRulenameIndexId and TriggerRelidNameIndexId are not critical
4103  * in the same way as the others, because the critical catalogs don't
4104  * (currently) have any rules or triggers, and so these indexes can be
4105  * rebuilt without inducing recursion. However they are used during
4106  * relcache load when a rel does have rules or triggers, so we choose to
4107  * nail them for performance reasons.
4108  */
4110  {
4111  load_critical_index(ClassOidIndexId,
4112  RelationRelationId);
4113  load_critical_index(AttributeRelidNumIndexId,
4114  AttributeRelationId);
4115  load_critical_index(IndexRelidIndexId,
4116  IndexRelationId);
4117  load_critical_index(OpclassOidIndexId,
4118  OperatorClassRelationId);
4119  load_critical_index(AccessMethodProcedureIndexId,
4120  AccessMethodProcedureRelationId);
4121  load_critical_index(RewriteRelRulenameIndexId,
4122  RewriteRelationId);
4123  load_critical_index(TriggerRelidNameIndexId,
4124  TriggerRelationId);
4125 
4126 #define NUM_CRITICAL_LOCAL_INDEXES 7 /* fix if you change list above */
4127 
4128  criticalRelcachesBuilt = true;
4129  }
4130 
4131  /*
4132  * Process critical shared indexes too.
4133  *
4134  * DatabaseNameIndexId isn't critical for relcache loading, but rather for
4135  * initial lookup of MyDatabaseId, without which we'll never find any
4136  * non-shared catalogs at all. Autovacuum calls InitPostgres with a
4137  * database OID, so it instead depends on DatabaseOidIndexId. We also
4138  * need to nail up some indexes on pg_authid and pg_auth_members for use
4139  * during client authentication. SharedSecLabelObjectIndexId isn't
4140  * critical for the core system, but authentication hooks might be
4141  * interested in it.
4142  */
4144  {
4145  load_critical_index(DatabaseNameIndexId,
4146  DatabaseRelationId);
4147  load_critical_index(DatabaseOidIndexId,
4148  DatabaseRelationId);
4149  load_critical_index(AuthIdRolnameIndexId,
4150  AuthIdRelationId);
4151  load_critical_index(AuthIdOidIndexId,
4152  AuthIdRelationId);
4153  load_critical_index(AuthMemMemRoleIndexId,
4154  AuthMemRelationId);
4155  load_critical_index(SharedSecLabelObjectIndexId,
4156  SharedSecLabelRelationId);
4157 
4158 #define NUM_CRITICAL_SHARED_INDEXES 6 /* fix if you change list above */
4159 
4161  }
4162 
4163  /*
4164  * Now, scan all the relcache entries and update anything that might be
4165  * wrong in the results from formrdesc or the relcache cache file. If we
4166  * faked up relcache entries using formrdesc, then read the real pg_class
4167  * rows and replace the fake entries with them. Also, if any of the
4168  * relcache entries have rules, triggers, or security policies, load that
4169  * info the hard way since it isn't recorded in the cache file.
4170  *
4171  * Whenever we access the catalogs to read data, there is a possibility of
4172  * a shared-inval cache flush causing relcache entries to be removed.
4173  * Since hash_seq_search only guarantees to still work after the *current*
4174  * entry is removed, it's unsafe to continue the hashtable scan afterward.
4175  * We handle this by restarting the scan from scratch after each access.
4176  * This is theoretically O(N^2), but the number of entries that actually
4177  * need to be fixed is small enough that it doesn't matter.
4178  */
4180 
4181  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
4182  {
4183  Relation relation = idhentry->reldesc;
4184  bool restart = false;
4185 
4186  /*
4187  * Make sure *this* entry doesn't get flushed while we work with it.
4188  */
4190 
4191  /*
4192  * If it's a faked-up entry, read the real pg_class tuple.
4193  */
4194  if (relation->rd_rel->relowner == InvalidOid)
4195  {
4196  HeapTuple htup;
4197  Form_pg_class relp;
4198 
4199  htup = SearchSysCache1(RELOID,
4200  ObjectIdGetDatum(RelationGetRelid(relation)));
4201  if (!HeapTupleIsValid(htup))
4202  elog(FATAL, "cache lookup failed for relation %u",
4203  RelationGetRelid(relation));
4204  relp = (Form_pg_class) GETSTRUCT(htup);
4205 
4206  /*
4207  * Copy tuple to relation->rd_rel. (See notes in
4208  * AllocateRelationDesc())
4209  */
4210  memcpy((char *) relation->rd_rel, (char *) relp, CLASS_TUPLE_SIZE);
4211 
4212  /* Update rd_options while we have the tuple */
4213  if (relation->rd_options)
4214  pfree(relation->rd_options);
4215  RelationParseRelOptions(relation, htup);
4216 
4217  /*
4218  * Check the values in rd_att were set up correctly. (We cannot
4219  * just copy them over now: formrdesc must have set up the rd_att
4220  * data correctly to start with, because it may already have been
4221  * copied into one or more catcache entries.)
4222  */
4223  Assert(relation->rd_att->tdtypeid == relp->reltype);
4224  Assert(relation->rd_att->tdtypmod == -1);
4225 
4226  ReleaseSysCache(htup);
4227 
4228  /* relowner had better be OK now, else we'll loop forever */
4229  if (relation->rd_rel->relowner == InvalidOid)
4230  elog(ERROR, "invalid relowner in pg_class entry for \"%s\"",
4231  RelationGetRelationName(relation));
4232 
4233  restart = true;
4234  }
4235 
4236  /*
4237  * Fix data that isn't saved in relcache cache file.
4238  *
4239  * relhasrules or relhastriggers could possibly be wrong or out of
4240  * date. If we don't actually find any rules or triggers, clear the
4241  * local copy of the flag so that we don't get into an infinite loop
4242  * here. We don't make any attempt to fix the pg_class entry, though.
4243  */
4244  if (relation->rd_rel->relhasrules && relation->rd_rules == NULL)
4245  {
4246  RelationBuildRuleLock(relation);
4247  if (relation->rd_rules == NULL)
4248  relation->rd_rel->relhasrules = false;
4249  restart = true;
4250  }
4251  if (relation->rd_rel->relhastriggers && relation->trigdesc == NULL)
4252  {
4253  RelationBuildTriggers(relation);
4254  if (relation->trigdesc == NULL)
4255  relation->rd_rel->relhastriggers = false;
4256  restart = true;
4257  }
4258 
4259  /*
4260  * Re-load the row security policies if the relation has them, since
4261  * they are not preserved in the cache. Note that we can never NOT
4262  * have a policy while relrowsecurity is true,
4263  * RelationBuildRowSecurity will create a single default-deny policy
4264  * if there is no policy defined in pg_policy.
4265  */
4266  if (relation->rd_rel->relrowsecurity && relation->rd_rsdesc == NULL)
4267  {
4268  RelationBuildRowSecurity(relation);
4269 
4270  Assert(relation->rd_rsdesc != NULL);
4271  restart = true;
4272  }
4273 
4274  /* Reload tableam data if needed */
4275  if (relation->rd_tableam == NULL &&
4276  (RELKIND_HAS_TABLE_AM(relation->rd_rel->relkind) || relation->rd_rel->relkind == RELKIND_SEQUENCE))
4277  {
4279  Assert(relation->rd_tableam != NULL);
4280 
4281  restart = true;
4282  }
4283 
4284  /* Release hold on the relation */
4286 
4287  /* Now, restart the hashtable scan if needed */
4288  if (restart)
4289  {
4292  }
4293  }
4294 
4295  /*
4296  * Lastly, write out new relcache cache files if needed. We don't bother
4297  * to distinguish cases where only one of the two needs an update.
4298  */
4299  if (needNewCacheFile)
4300  {
4301  /*
4302  * Force all the catcaches to finish initializing and thereby open the
4303  * catalogs and indexes they use. This will preload the relcache with
4304  * entries for all the most important system catalogs and indexes, so
4305  * that the init files will be most useful for future backends.
4306  */
4308 
4309  /* now write the files */
4311  write_relcache_init_file(false);
4312  }
4313 }
void hash_seq_term(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1507
#define FATAL
Definition: elog.h:41
void RelationDecrementReferenceCount(Relation rel)
Definition: relcache.c:2140
static const FormData_pg_attribute Desc_pg_attribute[Natts_pg_attribute]
Definition: relcache.c:112
static const FormData_pg_attribute Desc_pg_proc[Natts_pg_proc]
Definition: relcache.c:113
static void write_relcache_init_file(bool shared)
Definition: relcache.c:6440
static const FormData_pg_attribute Desc_pg_type[Natts_pg_type]
Definition: relcache.c:114
static void load_critical_index(Oid indexoid, Oid heapoid)
Definition: relcache.c:4322
void RelationMapInitializePhase3(void)
Definition: relmapper.c:690
void InitCatalogCachePhase2(void)
Definition: syscache.c:776
@ RELOID
Definition: syscache.h:89

References Assert(), CacheMemoryContext, CLASS_TUPLE_SIZE, criticalRelcachesBuilt, criticalSharedRelcachesBuilt, 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, InitCatalogCachePhase2(), InvalidOid, IsBootstrapProcessingMode, load_critical_index(), load_relcache_init_file(), MemoryContextSwitchTo(), ObjectIdGetDatum(), 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, RelationIdCache, RelationIncrementReferenceCount(), RelationInitTableAccessMethod(), RelationMapInitializePhase3(), RelationParseRelOptions(), relidcacheent::reldesc, ReleaseSysCache(), RELOID, SearchSysCache1(), status(), TupleDescData::tdtypeid, TupleDescData::tdtypmod, RelationData::trigdesc, and write_relcache_init_file().

Referenced by InitPostgres().

◆ RelationCacheInvalidate()

void RelationCacheInvalidate ( bool  debug_discard)

Definition at line 2933 of file relcache.c.

2934 {
2936  RelIdCacheEnt *idhentry;
2937  Relation relation;
2938  List *rebuildFirstList = NIL;
2939  List *rebuildList = NIL;
2940  ListCell *l;
2941  int i;
2942 
2943  /*
2944  * Reload relation mapping data before starting to reconstruct cache.
2945  */
2947 
2948  /* Phase 1 */
2950 
2951  while ((idhentry = (RelIdCacheEnt *) hash_seq_search(&status)) != NULL)
2952  {
2953  relation = idhentry->reldesc;
2954 
2955  /* Must close all smgr references to avoid leaving dangling ptrs */
2956  RelationCloseSmgr(relation);
2957 
2958  /*
2959  * Ignore new relations; no other backend will manipulate them before
2960  * we commit. Likewise, before replacing a relation's relfilelocator,
2961  * we shall have acquired AccessExclusiveLock and drained any
2962  * applicable pending invalidations.
2963  */
2964  if (relation->rd_createSubid != InvalidSubTransactionId ||
2966  continue;
2967 
2969 
2970  if (RelationHasReferenceCountZero(relation))
2971  {
2972  /* Delete this entry immediately */
2973  Assert(!relation->rd_isnailed);
2974  RelationClearRelation(relation, false);
2975  }
2976  else
2977  {
2978  /*
2979  * If it's a mapped relation, immediately update its rd_locator in
2980  * case its relfilenumber changed. We must do this during phase 1
2981  * in case the relation is consulted during rebuild of other
2982  * relcache entries in phase 2. It's safe since consulting the
2983  * map doesn't involve any access to relcache entries.
2984  */
2985  if (RelationIsMapped(relation))
2986  RelationInitPhysicalAddr(relation);
2987 
2988  /*
2989  * Add this entry to list of stuff to rebuild in second pass.
2990  * pg_class goes to the front of rebuildFirstList while
2991  * pg_class_oid_index goes to the back of rebuildFirstList, so
2992  * they are done first and second respectively. Other nailed
2993  * relations go to the front of rebuildList, so they'll be done
2994  * next in no particular order; and everything else goes to the
2995  * back of rebuildList.
2996  */
2997  if (RelationGetRelid(relation) == RelationRelationId)
2998  rebuildFirstList = lcons(relation, rebuildFirstList);
2999  else if (RelationGetRelid(relation) == ClassOidIndexId)
3000  rebuildFirstList = lappend(rebuildFirstList, relation);
3001  else if (relation->rd_isnailed)
3002  rebuildList = lcons(relation, rebuildList);
3003  else
3004  rebuildList = lappend(rebuildList, relation);
3005  }
3006  }
3007 
3008  /*
3009  * Now zap any remaining smgr cache entries. This must happen before we
3010  * start to rebuild entries, since that may involve catalog fetches which
3011  * will re-open catalog files.
3012  */
3013  smgrcloseall();
3014 
3015  /* Phase 2: rebuild the items found to need rebuild in phase 1 */
3016  foreach(l, rebuildFirstList)
3017  {
3018  relation = (Relation) lfirst(l);
3019  RelationClearRelation(relation, true);
3020  }
3021  list_free(rebuildFirstList);
3022  foreach(l, rebuildList)
3023  {
3024  relation = (Relation) lfirst(l);
3025  RelationClearRelation(relation, true);
3026  }
3027  list_free(rebuildList);
3028 
3029  if (!debug_discard)
3030  /* Any RelationBuildDesc() on the stack must start over. */
3031  for (i = 0; i < in_progress_list_len; i++)
3032  in_progress_list[i].invalidated = true;
3033 }
List * lappend(List *list, void *datum)
Definition: list.c:338
void list_free(List *list)
Definition: list.c:1545
List * lcons(void *datum, List *list)
Definition: list.c:494
#define RelationIsMapped(relation)
Definition: rel.h:552
static void RelationCloseSmgr(Relation relation)
Definition: rel.h:583
static long relcacheInvalsReceived
Definition: relcache.c:154
void RelationMapInvalidateAll(void)
Definition: relmapper.c:490
void smgrcloseall(void)
Definition: smgr.c:322

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

Referenced by InvalidateSystemCachesExtended(), and LocalExecuteInvalidationMessage().

◆ RelationCacheInvalidateEntry()

void RelationCacheInvalidateEntry ( Oid  relationId)

Definition at line 2877 of file relcache.c.

2878 {
2879  Relation relation;
2880 
2881  RelationIdCacheLookup(relationId, relation);
2882 
2883  if (PointerIsValid(relation))
2884  {
2886  RelationFlushRelation(relation);
2887  }
2888  else
2889  {
2890  int i;
2891 
2892  for (i = 0; i < in_progress_list_len; i++)
2893  if (in_progress_list[i].reloid == relationId)
2894  in_progress_list[i].invalidated = true;
2895  }
2896 }
#define PointerIsValid(pointer)
Definition: c.h:747
#define RelationIdCacheLookup(ID, RELATION)
Definition: relcache.c:231
static void RelationFlushRelation(Relation relation)
Definition: relcache.c:2800

References i, in_progress_list, in_progress_list_len, inprogressent::invalidated, PointerIsValid, RelationFlushRelation(), RelationIdCacheLookup, and relcacheInvalsReceived.

Referenced by LocalExecuteInvalidationMessage().

◆ RelationClearRelation()

static void RelationClearRelation ( Relation  relation,
bool  rebuild 
)
static

Definition at line 2495 of file relcache.c.

2496 {
2497  /*
2498  * As per notes above, a rel to be rebuilt MUST have refcnt > 0; while of
2499  * course it would be an equally bad idea to blow away one with nonzero
2500  * refcnt, since that would leave someone somewhere with a dangling
2501  * pointer. All callers are expected to have verified that this holds.
2502  */
2503  Assert(rebuild ?
2504  !RelationHasReferenceCountZero(relation) :
2505  RelationHasReferenceCountZero(relation));
2506 
2507  /*
2508  * Make sure smgr and lower levels close the relation's files, if they
2509  * weren't closed already. If the relation is not getting deleted, the
2510  * next smgr access should reopen the files automatically. This ensures
2511  * that the low-level file access state is updated after, say, a vacuum
2512  * truncation.
2513  */
2514  RelationCloseSmgr(relation);
2515 
2516  /* Free AM cached data, if any */
2517  if (relation->rd_amcache)
2518  pfree(relation->rd_amcache);
2519  relation->rd_amcache = NULL;
2520 
2521  /*
2522  * Treat nailed-in system relations separately, they always need to be
2523  * accessible, so we can't blow them away.
2524  */
2525  if (relation->rd_isnailed)
2526  {
2527  RelationReloadNailed(relation);
2528  return;
2529  }
2530 
2531  /* Mark it invalid until we've finished rebuild */
2532  relation->rd_isvalid = false;
2533 
2534  /* See RelationForgetRelation(). */
2535  if (relation->rd_droppedSubid != InvalidSubTransactionId)
2536  return;
2537 
2538  /*
2539  * Even non-system indexes should not be blown away if they are open and
2540  * have valid index support information. This avoids problems with active
2541  * use of the index support information. As with nailed indexes, we
2542  * re-read the pg_class row to handle possible physical relocation of the
2543  * index, and we check for pg_index updates too.
2544  */
2545  if ((relation->rd_rel->relkind == RELKIND_INDEX ||
2546  relation->rd_rel->relkind == RELKIND_PARTITIONED_INDEX) &&
2547  relation->rd_refcnt > 0 &&
2548  relation->rd_indexcxt != NULL)
2549  {
2550  if (IsTransactionState())
2551  RelationReloadIndexInfo(relation);
2552  return;
2553  }
2554 
2555  /*
2556  * If we're really done with the relcache entry, blow it away. But if
2557  * someone is still using it, reconstruct the whole deal without moving
2558  * the physical RelationData record (so that the someone's pointer is
2559  * still valid).
2560  */
2561  if (!rebuild)
2562  {
2563  /* Remove it from the hash table */
2564  RelationCacheDelete(relation);
2565 
2566  /* And release storage */
2567  RelationDestroyRelation(relation, false);
2568  }
2569  else if (!IsTransactionState())
2570  {
2571  /*
2572  * If we're not inside a valid transaction, we can't do any catalog
2573  * access so it's not possible to rebuild yet. Just exit, leaving
2574  * rd_isvalid = false so that the rebuild will occur when the entry is
2575  * next opened.
2576  *
2577  * Note: it's possible that we come here during subtransaction abort,
2578  * and the reason for wanting to rebuild is that the rel is open in
2579  * the outer transaction. In that case it might seem unsafe to not
2580  * rebuild immediately, since whatever code has the rel already open
2581  * will keep on using the relcache entry as-is. However, in such a
2582  * case the outer transaction should be holding a lock that's
2583  * sufficient to prevent any significant change in the rel's schema,
2584  * so the existing entry contents should be good enough for its
2585  * purposes; at worst we might be behind on statistics updates or the
2586  * like. (See also CheckTableNotInUse() and its callers.) These same
2587  * remarks also apply to the cases above where we exit without having
2588  * done RelationReloadIndexInfo() yet.
2589  */
2590  return;
2591  }
2592  else
2593  {
2594  /*
2595  * Our strategy for rebuilding an open relcache entry is to build a
2596  * new entry from scratch, swap its contents with the old entry, and
2597  * finally delete the new entry (along with any infrastructure swapped
2598  * over from the old entry). This is to avoid trouble in case an
2599  * error causes us to lose control partway through. The old entry
2600  * will still be marked !rd_isvalid, so we'll try to rebuild it again
2601  * on next access. Meanwhile it's not any less valid than it was
2602  * before, so any code that might expect to continue accessing it
2603  * isn't hurt by the rebuild failure. (Consider for example a
2604  * subtransaction that ALTERs a table and then gets canceled partway
2605  * through the cache entry rebuild. The outer transaction should
2606  * still see the not-modified cache entry as valid.) The worst
2607  * consequence of an error is leaking the necessarily-unreferenced new
2608  * entry, and this shouldn't happen often enough for that to be a big
2609  * problem.
2610  *
2611  * When rebuilding an open relcache entry, we must preserve ref count,
2612  * rd_*Subid, and rd_toastoid state. Also attempt to preserve the
2613  * pg_class entry (rd_rel), tupledesc, rewrite-rule, partition key,
2614  * and partition descriptor substructures in place, because various
2615  * places assume that these structures won't move while they are
2616  * working with an open relcache entry. (Note: the refcount
2617  * mechanism for tupledescs might someday allow us to remove this hack
2618  * for the tupledesc.)
2619  *
2620  * Note that this process does not touch CurrentResourceOwner; which
2621  * is good because whatever ref counts the entry may have do not
2622  * necessarily belong to that resource owner.
2623  */
2624  Relation newrel;
2625  Oid save_relid = RelationGetRelid(relation);
2626  bool keep_tupdesc;
2627  bool keep_rules;
2628  bool keep_policies;
2629  bool keep_partkey;
2630 
2631  /* Build temporary entry, but don't link it into hashtable */
2632  newrel = RelationBuildDesc(save_relid, false);
2633 
2634  /*
2635  * Between here and the end of the swap, don't add code that does or
2636  * reasonably could read system catalogs. That range must be free
2637  * from invalidation processing. See RelationBuildDesc() manipulation
2638  * of in_progress_list.
2639  */
2640 
2641  if (newrel == NULL)
2642  {
2643  /*
2644  * We can validly get here, if we're using a historic snapshot in
2645  * which a relation, accessed from outside logical decoding, is
2646  * still invisible. In that case it's fine to just mark the
2647  * relation as invalid and return - it'll fully get reloaded by
2648  * the cache reset at the end of logical decoding (or at the next
2649  * access). During normal processing we don't want to ignore this
2650  * case as it shouldn't happen there, as explained below.
2651  */
2652  if (HistoricSnapshotActive())
2653  return;
2654 
2655  /*
2656  * This shouldn't happen as dropping a relation is intended to be
2657  * impossible if still referenced (cf. CheckTableNotInUse()). But
2658  * if we get here anyway, we can't just delete the relcache entry,
2659  * as it possibly could get accessed later (as e.g. the error
2660  * might get trapped and handled via a subtransaction rollback).
2661  */
2662  elog(ERROR, "relation %u deleted while still in use", save_relid);
2663  }
2664 
2665  /*
2666  * If we were to, again, have cases of the relkind of a relcache entry
2667  * changing, we would need to ensure that pgstats does not get
2668  * confused.
2669  */
2670  Assert(relation->rd_rel->relkind == newrel->rd_rel->relkind);
2671 
2672  keep_tupdesc = equalTupleDescs(relation->rd_att, newrel->rd_att);
2673  keep_rules = equalRuleLocks(relation->rd_rules, newrel->rd_rules);
2674  keep_policies = equalRSDesc(relation->rd_rsdesc, newrel->rd_rsdesc);
2675  /* partkey is immutable once set up, so we can always keep it */
2676  keep_partkey = (relation->rd_partkey != NULL);
2677 
2678  /*
2679  * Perform swapping of the relcache entry contents. Within this
2680  * process the old entry is momentarily invalid, so there *must* be no
2681  * possibility of CHECK_FOR_INTERRUPTS within this sequence. Do it in
2682  * all-in-line code for safety.
2683  *
2684  * Since the vast majority of fields should be swapped, our method is
2685  * to swap the whole structures and then re-swap those few fields we
2686  * didn't want swapped.
2687  */
2688 #define SWAPFIELD(fldtype, fldname) \
2689  do { \
2690  fldtype _tmp = newrel->fldname; \
2691  newrel->fldname = relation->fldname; \
2692  relation->fldname = _tmp; \
2693  } while (0)
2694 
2695  /* swap all Relation struct fields */
2696  {
2697  RelationData tmpstruct;
2698 
2699  memcpy(&tmpstruct, newrel, sizeof(RelationData));
2700  memcpy(newrel, relation, sizeof(RelationData));
2701  memcpy(relation, &tmpstruct, sizeof(RelationData));
2702  }
2703 
2704  /* rd_smgr must not be swapped, due to back-links from smgr level */
2705  SWAPFIELD(SMgrRelation, rd_smgr);
2706  /* rd_refcnt must be preserved */
2707  SWAPFIELD(int, rd_refcnt);
2708  /* isnailed shouldn't change */
2709  Assert(newrel->rd_isnailed == relation->rd_isnailed);
2710  /* creation sub-XIDs must be preserved */
2711  SWAPFIELD(SubTransactionId, rd_createSubid);
2712  SWAPFIELD(SubTransactionId, rd_newRelfilelocatorSubid);
2713  SWAPFIELD(SubTransactionId, rd_firstRelfilelocatorSubid);
2714  SWAPFIELD(SubTransactionId, rd_droppedSubid);
2715  /* un-swap rd_rel pointers, swap contents instead */
2716  SWAPFIELD(Form_pg_class, rd_rel);
2717  /* ... but actually, we don't have to update newrel->rd_rel */
2718  memcpy(relation->rd_rel, newrel->rd_rel, CLASS_TUPLE_SIZE);
2719  /* preserve old tupledesc, rules, policies if no logical change */
2720  if (keep_tupdesc)
2721  SWAPFIELD(TupleDesc, rd_att);
2722  if (keep_rules)
2723  {
2724  SWAPFIELD(RuleLock *, rd_rules);
2725  SWAPFIELD(MemoryContext, rd_rulescxt);
2726  }
2727  if (keep_policies)
2728  SWAPFIELD(RowSecurityDesc *, rd_rsdesc);
2729  /* toast OID override must be preserved */
2730  SWAPFIELD(Oid, rd_toastoid);
2731  /* pgstat_info / enabled must be preserved */
2732  SWAPFIELD(struct PgStat_TableStatus *, pgstat_info);
2733  SWAPFIELD(bool, pgstat_enabled);
2734  /* preserve old partition key if we have one */
2735  if (keep_partkey)
2736  {
2737  SWAPFIELD(PartitionKey, rd_partkey);
2738  SWAPFIELD(MemoryContext, rd_partkeycxt);
2739  }
2740  if (newrel->rd_pdcxt != NULL || newrel->rd_pddcxt != NULL)
2741  {
2742  /*
2743  * We are rebuilding a partitioned relation with a non-zero
2744  * reference count, so we must keep the old partition descriptor
2745  * around, in case there's a PartitionDirectory with a pointer to
2746  * it. This means we can't free the old rd_pdcxt yet. (This is
2747  * necessary because RelationGetPartitionDesc hands out direct
2748  * pointers to the relcache's data structure, unlike our usual
2749  * practice which is to hand out copies. We'd have the same
2750  * problem with rd_partkey, except that we always preserve that
2751  * once created.)
2752  *
2753  * To ensure that it's not leaked completely, re-attach it to the
2754  * new reldesc, or make it a child of the new reldesc's rd_pdcxt
2755  * in the unlikely event that there is one already. (Compare hack
2756  * in RelationBuildPartitionDesc.) RelationClose will clean up
2757  * any such contexts once the reference count reaches zero.
2758  *
2759  * In the case where the reference count is zero, this code is not
2760  * reached, which should be OK because in that case there should
2761  * be no PartitionDirectory with a pointer to the old entry.
2762  *
2763  * Note that newrel and relation have already been swapped, so the
2764  * "old" partition descriptor is actually the one hanging off of
2765  * newrel.
2766  */
2767  relation->rd_partdesc = NULL; /* ensure rd_partdesc is invalid */
2768  relation->rd_partdesc_nodetached = NULL;
2770  if (relation->rd_pdcxt != NULL) /* probably never happens */
2771  MemoryContextSetParent(newrel->rd_pdcxt, relation->rd_pdcxt);
2772  else
2773  relation->rd_pdcxt = newrel->rd_pdcxt;
2774  if (relation->rd_pddcxt != NULL)
2775  MemoryContextSetParent(newrel->rd_pddcxt, relation->rd_pddcxt);
2776  else
2777  relation->rd_pddcxt = newrel->rd_pddcxt;
2778  /* drop newrel's pointers so we don't destroy it below */
2779  newrel->rd_partdesc = NULL;
2780  newrel->rd_partdesc_nodetached = NULL;
2782  newrel->rd_pdcxt = NULL;
2783  newrel->rd_pddcxt = NULL;
2784  }
2785 
2786 #undef SWAPFIELD
2787 
2788  /* And now we can throw away the temporary entry */
2789  RelationDestroyRelation(newrel, !keep_tupdesc);
2790  }
2791 }
uint32 SubTransactionId
Definition: c.h:640
void MemoryContextSetParent(MemoryContext context, MemoryContext new_parent)
Definition: mcxt.c:530
static bool equalRuleLocks(RuleLock *rlock1, RuleLock *rlock2)
Definition: relcache.c:906
static void RelationReloadNailed(Relation relation)
Definition: relcache.c:2330
#define RelationCacheDelete(RELATION)
Definition: relcache.c:243
static bool equalRSDesc(RowSecurityDesc *rsdesc1, RowSecurityDesc *rsdesc2)
Definition: relcache.c:997
static void RelationReloadIndexInfo(Relation relation)
Definition: relcache.c:2217
#define SWAPFIELD(fldtype, fldname)
bool HistoricSnapshotActive(void)
Definition: snapmgr.c:2103
bool equalTupleDescs(TupleDesc tupdesc1, TupleDesc tupdesc2)
Definition: tupdesc.c:402
bool IsTransactionState(void)
Definition: xact.c:378

References Assert(), CLASS_TUPLE_SIZE, elog(), equalRSDesc(), equalRuleLocks(), equalTupleDescs(), ERROR, HistoricSnapshotActive(), InvalidSubTransactionId, InvalidTransactionId, 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_partdesc_nodetached, RelationData::rd_partdesc_nodetached_xmin, RelationData::rd_partkey, RelationData::rd_pdcxt, RelationData::rd_pddcxt, 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().

◆ RelationClose()

void RelationClose ( Relation  relation)

Definition at line 2160 of file relcache.c.

2161 {
2162  /* Note: no locking manipulations needed */
2164 
2165  /*
2166  * If the relation is no longer open in this session, we can clean up any
2167  * stale partition descriptors it has. This is unlikely, so check to see
2168  * if there are child contexts before expending a call to mcxt.c.
2169  */
2170  if (RelationHasReferenceCountZero(relation))
2171  {
2172  if (relation->rd_pdcxt != NULL &&
2173  relation->rd_pdcxt->firstchild != NULL)
2175 
2176  if (relation->rd_pddcxt != NULL &&
2177  relation->rd_pddcxt->firstchild != NULL)
2179  }
2180 
2181 #ifdef RELCACHE_FORCE_RELEASE
2182  if (RelationHasReferenceCountZero(relation) &&
2183  relation->rd_createSubid == InvalidSubTransactionId &&
2185  RelationClearRelation(relation, false);
2186 #endif
2187 }
void MemoryContextDeleteChildren(MemoryContext context)
Definition: mcxt.c:432
MemoryContext firstchild
Definition: memnodes.h:90

References MemoryContextData::firstchild, InvalidSubTransactionId, MemoryContextDeleteChildren(), RelationData::rd_createSubid, RelationData::rd_firstRelfilelocatorSubid, RelationData::rd_pdcxt, RelationData::rd_pddcxt, RelationClearRelation(), RelationDecrementReferenceCount(), and RelationHasReferenceCountZero.

Referenced by index_close(), init_tuple_slot(), maybe_send_schema(), pgoutput_change(), pgoutput_column_list_init(), pgoutput_row_filter_init(), relation_close(), RelationGetIdentityKeyBitmap(), ReorderBufferProcessTXN(), ReorderBufferToastReplace(), and ResourceOwnerReleaseInternal().

◆ RelationCloseSmgrByOid()

void RelationCloseSmgrByOid ( Oid  relationId)

Definition at line 3042 of file relcache.c.

3043 {
3044  Relation relation;
3045 
3046  RelationIdCacheLookup(relationId, relation);
3047 
3048  if (!PointerIsValid(relation))
3049  return; /* not in cache, nothing to do */
3050 
3051  RelationCloseSmgr(relation);
3052 }

References PointerIsValid, RelationCloseSmgr(), and RelationIdCacheLookup.

Referenced by swap_relation_files().

◆ RelationDecrementReferenceCount()

void RelationDecrementReferenceCount ( Relation  rel)

Definition at line 2140 of file relcache.c.

2141 {
2142  Assert(rel->rd_refcnt > 0);
2143  rel->rd_refcnt -= 1;
2146 }
ResourceOwner CurrentResourceOwner
Definition: resowner.c:146
void ResourceOwnerForgetRelationRef(ResourceOwner owner, Relation rel)
Definition: resowner.c:1129

References Assert(), CurrentResourceOwner, IsBootstrapProcessingMode, RelationData::rd_refcnt, and ResourceOwnerForgetRelationRef().

Referenced by DestroyPartitionDirectory(), heap_endscan(), index_endscan(), RelationCacheInitializePhase3(), RelationClose(), and RelationFlushRelation().

◆ RelationDestroyRelation()

static void RelationDestroyRelation ( Relation  relation,
bool  remember_tupdesc 
)
static

Definition at line 2402 of file relcache.c.

2403 {
2405 
2406  /*
2407  * Make sure smgr and lower levels close the relation's files, if they
2408  * weren't closed already. (This was probably done by caller, but let's
2409  * just be real sure.)
2410  */
2411  RelationCloseSmgr(relation);
2412 
2413  /* break mutual link with stats entry */
2414  pgstat_unlink_relation(relation);
2415 
2416  /*
2417  * Free all the subsidiary data structures of the relcache entry, then the
2418  * entry itself.
2419  */
2420  if (relation->rd_rel)
2421  pfree(relation->rd_rel);
2422  /* can't use DecrTupleDescRefCount here */
2423  Assert(relation->rd_att->tdrefcount > 0);
2424  if (--relation->rd_att->tdrefcount == 0)
2425  {
2426  /*
2427  * If we Rebuilt a relcache entry during a transaction then its
2428  * possible we did that because the TupDesc changed as the result of
2429  * an ALTER TABLE that ran at less than AccessExclusiveLock. It's
2430  * possible someone copied that TupDesc, in which case the copy would
2431  * point to free'd memory. So if we rebuild an entry we keep the
2432  * TupDesc around until end of transaction, to be safe.
2433  */
2434  if (remember_tupdesc)
2436  else
2437  FreeTupleDesc(relation->rd_att);
2438  }
2439  FreeTriggerDesc(relation->trigdesc);
2440  list_free_deep(relation->rd_fkeylist);
2441  list_free(relation->rd_indexlist);
2442  list_free(relation->rd_statlist);
2443  bms_free(relation->rd_keyattr);
2444  bms_free(relation->rd_pkattr);
2445  bms_free(relation->rd_idattr);
2446  bms_free(relation->rd_hotblockingattr);
2447  bms_free(relation->rd_summarizedattr);
2448  if (relation->rd_pubdesc)
2449  pfree(relation->rd_pubdesc);
2450  if (relation->rd_options)
2451  pfree(relation->rd_options);
2452  if (relation->rd_indextuple)
2453  pfree(relation->rd_indextuple);
2454  if (relation->rd_amcache)
2455  pfree(relation->rd_amcache);
2456  if (relation->rd_fdwroutine)
2457  pfree(relation->rd_fdwroutine);
2458  if (relation->rd_indexcxt)
2459  MemoryContextDelete(relation->rd_indexcxt);
2460  if (relation->rd_rulescxt)
2461  MemoryContextDelete(relation->rd_rulescxt);
2462  if (relation->rd_rsdesc)
2463  MemoryContextDelete(relation->rd_rsdesc->rscxt);
2464  if (relation->rd_partkeycxt)
2466  if (relation->rd_pdcxt)
2467  MemoryContextDelete(relation->rd_pdcxt);
2468  if (relation->rd_pddcxt)
2469  MemoryContextDelete(relation->rd_pddcxt);
2470  if (relation->rd_partcheckcxt)
2472  pfree(relation);
2473 }
void bms_free(Bitmapset *a)
Definition: bitmapset.c:209
void list_free_deep(List *list)
Definition: list.c:1559
void pgstat_unlink_relation(Relation rel)
static void RememberToFreeTupleDescAtEOX(TupleDesc td)
Definition: relcache.c:3055
Bitmapset * rd_hotblockingattr
Definition: rel.h:163
Bitmapset * rd_summarizedattr
Definition: rel.h:164
MemoryContext rscxt
Definition: rowsecurity.h:33
void FreeTriggerDesc(TriggerDesc *trigdesc)
Definition: trigger.c:2151

References Assert(), bms_free(), FreeTriggerDesc(), FreeTupleDesc(), list_free(), list_free_deep(), MemoryContextDelete(), pfree(), pgstat_unlink_relation(), RelationData::rd_amcache, RelationData::rd_att, RelationData::rd_fdwroutine, RelationData::rd_fkeylist, RelationData::rd_hotblockingattr, RelationData::rd_idattr, RelationData::rd_indexcxt, RelationData::rd_indexlist, RelationData::rd_indextuple, RelationData::rd_keyattr, RelationData::rd_options, RelationData::rd_partcheckcxt, RelationData::rd_partkeycxt, RelationData::rd_pdcxt, RelationData::rd_pddcxt, RelationData::rd_pkattr, RelationData::rd_pubdesc, RelationData::rd_rel, RelationData::rd_rsdesc, RelationData::rd_rulescxt, RelationData::rd_statlist, RelationData::rd_summarizedattr, RelationCloseSmgr(), RelationHasReferenceCountZero, RememberToFreeTupleDescAtEOX(), RowSecurityDesc::rscxt, TupleDescData::tdrefcount, and RelationData::trigdesc.

Referenced by RelationBuildDesc(), and RelationClearRelation().

◆ RelationFlushRelation()

static void RelationFlushRelation ( Relation  relation)
static

Definition at line 2800 of file relcache.c.

2801 {
2802  if (relation->rd_createSubid != InvalidSubTransactionId ||
2804  {
2805  /*
2806  * New relcache entries are always rebuilt, not flushed; else we'd
2807  * forget the "new" status of the relation. Ditto for the
2808  * new-relfilenumber status.
2809  *
2810  * The rel could have zero refcnt here, so temporarily increment the
2811  * refcnt to ensure it's safe to rebuild it. We can assume that the
2812  * current transaction has some lock on the rel already.
2813  */
2815  RelationClearRelation(relation, true);
2817  }
2818  else
2819  {
2820  /*
2821  * Pre-existing rels can be dropped from the relcache if not open.
2822  */
2823  bool rebuild = !RelationHasReferenceCountZero(relation);
2824 
2825  RelationClearRelation(relation, rebuild);
2826  }
2827 }

References InvalidSubTransactionId, RelationData::rd_createSubid, RelationData::rd_firstRelfilelocatorSubid, RelationClearRelation(), RelationDecrementReferenceCount(), RelationHasReferenceCountZero, and RelationIncrementReferenceCount().

Referenced by RelationCacheInvalidateEntry().

◆ RelationForgetRelation()

void RelationForgetRelation ( Oid  rid)

Definition at line 2833 of file relcache.c.

2834 {
2835  Relation relation;
2836 
2837  RelationIdCacheLookup(rid, relation);
2838 
2839  if (!PointerIsValid(relation))
2840  return; /* not in cache, nothing to do */
2841 
2842  if (!RelationHasReferenceCountZero(relation))
2843  elog(ERROR, "relation %u is still open", rid);
2844 
2846  if (relation->rd_createSubid != InvalidSubTransactionId ||
2848  {
2849  /*
2850  * In the event of subtransaction rollback, we must not forget
2851  * rd_*Subid. Mark the entry "dropped" so RelationClearRelation()
2852  * invalidates it in lieu of destroying it. (If we're in a top
2853  * transaction, we could opt to destroy the entry.)
2854  */
2856  }
2857 
2858  RelationClearRelation(relation, false);
2859 }

References Assert(), elog(), ERROR, GetCurrentSubTransactionId(), InvalidSubTransactionId, PointerIsValid, RelationData::rd_createSubid, RelationData::rd_droppedSubid, RelationData::rd_firstRelfilelocatorSubid, RelationClearRelation(), RelationHasReferenceCountZero, and RelationIdCacheLookup.

Referenced by heap_drop_with_catalog(), and index_drop().

◆ RelationGetDummyIndexExpressions()

List* RelationGetDummyIndexExpressions ( Relation  relation)

Definition at line 5032 of file relcache.c.

5033 {
5034  List *result;
5035  Datum exprsDatum;
5036  bool isnull;
5037  char *exprsString;
5038  List *rawExprs;
5039  ListCell *lc;
5040 
5041  /* Quick exit if there is nothing to do. */
5042  if (relation->rd_indextuple == NULL ||
5043  heap_attisnull(relation->rd_indextuple, Anum_pg_index_indexprs, NULL))
5044  return NIL;
5045 
5046  /* Extract raw node tree(s) from index tuple. */
5047  exprsDatum = heap_getattr(relation->rd_indextuple,
5048  Anum_pg_index_indexprs,
5050  &isnull);
5051  Assert(!isnull);
5052  exprsString = TextDatumGetCString(exprsDatum);
5053  rawExprs = (List *) stringToNode(exprsString);
5054  pfree(exprsString);
5055 
5056  /* Construct null Consts; the typlen and typbyval are arbitrary. */
5057  result = NIL;
5058  foreach(lc, rawExprs)
5059  {
5060  Node *rawExpr = (Node *) lfirst(lc);
5061 
5062  result = lappend(result,
5063  makeConst(exprType(rawExpr),
5064  exprTypmod(rawExpr),
5065  exprCollation(rawExpr),
5066  1,
5067  (Datum) 0,
5068  true,
5069  true));
5070  }
5071 
5072  return result;
5073 }
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:359
Const * makeConst(Oid consttype, int32 consttypmod, Oid constcollid, int constlen, Datum constvalue, bool constisnull, bool constbyval)
Definition: makefuncs.c:301
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:43
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:266
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:764
static TupleDesc GetPgIndexDescriptor(void)
Definition: relcache.c:4401

References Assert(), exprCollation(), exprType(), exprTypmod(), GetPgIndexDescriptor(), heap_attisnull(), heap_getattr(), lappend(), lfirst, makeConst(), NIL, pfree(), RelationData::rd_indextuple, stringToNode(), and TextDatumGetCString.

Referenced by BuildDummyIndexInfo().

◆ RelationGetExclusionInfo()

void RelationGetExclusionInfo ( Relation  indexRelation,
Oid **  operators,
Oid **  procs,
uint16 **  strategies 
)

Definition at line 5516 of file relcache.c.

5520 {
5521  int indnkeyatts;
5522  Oid *ops;
5523  Oid *funcs;
5524  uint16 *strats;
5525  Relation conrel;
5526  SysScanDesc conscan;
5527  ScanKeyData skey[1];
5528  HeapTuple htup;
5529  bool found;
5530  MemoryContext oldcxt;
5531  int i;
5532 
5533  indnkeyatts = IndexRelationGetNumberOfKeyAttributes(indexRelation);
5534 
5535  /* Allocate result space in caller context */
5536  *operators = ops = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
5537  *procs = funcs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
5538  *strategies = strats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
5539 
5540  /* Quick exit if we have the data cached already */
5541  if (indexRelation->rd_exclstrats != NULL)
5542  {
5543  memcpy(ops, indexRelation->rd_exclops, sizeof(Oid) * indnkeyatts);
5544  memcpy(funcs, indexRelation->rd_exclprocs, sizeof(Oid) * indnkeyatts);
5545  memcpy(strats, indexRelation->rd_exclstrats, sizeof(uint16) * indnkeyatts);
5546  return;
5547  }
5548 
5549  /*
5550  * Search pg_constraint for the constraint associated with the index. To
5551  * make this not too painfully slow, we use the index on conrelid; that
5552  * will hold the parent relation's OID not the index's own OID.
5553  *
5554  * Note: if we wanted to rely on the constraint name matching the index's
5555  * name, we could just do a direct lookup using pg_constraint's unique
5556  * index. For the moment it doesn't seem worth requiring that.
5557  */
5558  ScanKeyInit(&skey[0],
5559  Anum_pg_constraint_conrelid,
5560  BTEqualStrategyNumber, F_OIDEQ,
5561  ObjectIdGetDatum(indexRelation->rd_index->indrelid));
5562 
5563  conrel = table_open(ConstraintRelationId, AccessShareLock);
5564  conscan = systable_beginscan(conrel, ConstraintRelidTypidNameIndexId, true,
5565  NULL, 1, skey);
5566  found = false;
5567 
5568  while (HeapTupleIsValid(htup = systable_getnext(conscan)))
5569  {
5571  Datum val;
5572  bool isnull;
5573  ArrayType *arr;
5574  int nelem;
5575 
5576  /* We want the exclusion constraint owning the index */
5577  if (conform->contype != CONSTRAINT_EXCLUSION ||
5578  conform->conindid != RelationGetRelid(indexRelation))
5579  continue;
5580 
5581  /* There should be only one */
5582  if (found)
5583  elog(ERROR, "unexpected exclusion constraint record found for rel %s",
5584  RelationGetRelationName(indexRelation));
5585  found = true;
5586 
5587  /* Extract the operator OIDS from conexclop */
5588  val = fastgetattr(htup,
5589  Anum_pg_constraint_conexclop,
5590  conrel->rd_att, &isnull);
5591  if (isnull)
5592  elog(ERROR, "null conexclop for rel %s",
5593  RelationGetRelationName(indexRelation));
5594 
5595  arr = DatumGetArrayTypeP(val); /* ensure not toasted */
5596  nelem = ARR_DIMS(arr)[0];
5597  if (ARR_NDIM(arr) != 1 ||
5598  nelem != indnkeyatts ||
5599  ARR_HASNULL(arr) ||
5600  ARR_ELEMTYPE(arr) != OIDOID)
5601  elog(ERROR, "conexclop is not a 1-D Oid array");
5602 
5603  memcpy(ops, ARR_DATA_PTR(arr), sizeof(Oid) * indnkeyatts);
5604  }
5605 
5606  systable_endscan(conscan);
5607  table_close(conrel, AccessShareLock);
5608 
5609  if (!found)
5610  elog(ERROR, "exclusion constraint record missing for rel %s",
5611  RelationGetRelationName(indexRelation));
5612 
5613  /* We need the func OIDs and strategy numbers too */
5614  for (i = 0; i < indnkeyatts; i++)
5615  {
5616  funcs[i] = get_opcode(ops[i]);
5617  strats[i] = get_op_opfamily_strategy(ops[i],
5618  indexRelation->rd_opfamily[i]);
5619  /* shouldn't fail, since it was checked at index creation */
5620  if (strats[i] == InvalidStrategy)
5621  elog(ERROR, "could not find strategy for operator %u in family %u",
5622  ops[i], indexRelation->rd_opfamily[i]);
5623  }
5624 
5625  /* Save a copy of the results in the relcache entry. */
5626  oldcxt = MemoryContextSwitchTo(indexRelation->rd_indexcxt);
5627  indexRelation->rd_exclops = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
5628  indexRelation->rd_exclprocs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
5629  indexRelation->rd_exclstrats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
5630  memcpy(indexRelation->rd_exclops, ops, sizeof(Oid) * indnkeyatts);
5631  memcpy(indexRelation->rd_exclprocs, funcs, sizeof(Oid) * indnkeyatts);
5632  memcpy(indexRelation->rd_exclstrats,