relation.c File Reference

#include "postgres.h"
#include "access/genam.h"
#include "access/table.h"
#include "catalog/namespace.h"
#include "catalog/pg_am_d.h"
#include "catalog/pg_subscription_rel.h"
#include "executor/executor.h"
#include "nodes/makefuncs.h"
#include "replication/logicalrelation.h"
#include "replication/worker_internal.h"
#include "utils/inval.h"

Include dependency graph for relation.c:

Go to the source code of this file.

Data Structures
struct	LogicalRepPartMapEntry

Typedefs
typedef struct LogicalRepPartMapEntry	LogicalRepPartMapEntry

Functions
static Oid	FindLogicalRepLocalIndex (Relation localrel, LogicalRepRelation *remoterel, AttrMap *attrMap)
static void	logicalrep_relmap_invalidate_cb (Datum arg, Oid reloid)
static void	logicalrep_relmap_init (void)
static void	logicalrep_relmap_free_entry (LogicalRepRelMapEntry *entry)
void	logicalrep_relmap_update (LogicalRepRelation *remoterel)
static int	logicalrep_rel_att_by_name (LogicalRepRelation *remoterel, const char *attname)
static void	logicalrep_report_missing_attrs (LogicalRepRelation *remoterel, Bitmapset *missingatts)
static void	logicalrep_rel_mark_updatable (LogicalRepRelMapEntry *entry)
LogicalRepRelMapEntry *	logicalrep_rel_open (LogicalRepRelId remoteid, LOCKMODE lockmode)
void	logicalrep_rel_close (LogicalRepRelMapEntry *rel, LOCKMODE lockmode)
static void	logicalrep_partmap_invalidate_cb (Datum arg, Oid reloid)
void	logicalrep_partmap_reset_relmap (LogicalRepRelation *remoterel)
static void	logicalrep_partmap_init (void)
LogicalRepRelMapEntry *	logicalrep_partition_open (LogicalRepRelMapEntry *root, Relation partrel, AttrMap *map)
static Oid	FindUsableIndexForReplicaIdentityFull (Relation localrel, AttrMap *attrmap)
bool	IsIndexUsableForReplicaIdentityFull (IndexInfo *indexInfo, AttrMap *attrmap)
Oid	GetRelationIdentityOrPK (Relation rel)

Variables
static MemoryContext	LogicalRepRelMapContext = NULL
static HTAB *	LogicalRepRelMap = NULL
static MemoryContext	LogicalRepPartMapContext = NULL
static HTAB *	LogicalRepPartMap = NULL

Typedef Documentation

LogicalRepPartMapEntry

typedef struct LogicalRepPartMapEntry LogicalRepPartMapEntry

Function Documentation

FindLogicalRepLocalIndex()

static Oid FindLogicalRepLocalIndex ( Relation  localrel, LogicalRepRelation *  remoterel, AttrMap *  attrMap  )

static

Definition at line 872 of file relation.c.

{
    Oid         idxoid;
 
    /*
     * We never need index oid for partitioned tables, always rely on leaf
     * partition's index.
     */
    if (localrel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
        return InvalidOid;
 
    /*
     * Simple case, we already have a primary key or a replica identity index.
     */
    idxoid = GetRelationIdentityOrPK(localrel);
    if (OidIsValid(idxoid))
        return idxoid;
 
    if (remoterel->replident == REPLICA_IDENTITY_FULL)
    {
        /*
         * We are looking for one more opportunity for using an index. If
         * there are any indexes defined on the local relation, try to pick a
         * suitable index.
         *
         * The index selection safely assumes that all the columns are going
         * to be available for the index scan given that remote relation has
         * replica identity full.
         *
         * Note that we are not using the planner to find the cheapest method
         * to scan the relation as that would require us to either use lower
         * level planner functions which would be a maintenance burden in the
         * long run or use the full-fledged planner which could cause
         * overhead.
         */
        return FindUsableIndexForReplicaIdentityFull(localrel, attrMap);
    }
 
    return InvalidOid;
}

References FindUsableIndexForReplicaIdentityFull(), GetRelationIdentityOrPK(), InvalidOid, OidIsValid, RelationData::rd_rel, and LogicalRepRelation::replident.

Referenced by logicalrep_partition_open(), and logicalrep_rel_open().

FindUsableIndexForReplicaIdentityFull()

static Oid FindUsableIndexForReplicaIdentityFull ( Relation  localrel, AttrMap *  attrmap  )

static

Definition at line 747 of file relation.c.

{
    List       *idxlist = RelationGetIndexList(localrel);
    ListCell   *lc;
 
    foreach(lc, idxlist)
    {
        Oid         idxoid = lfirst_oid(lc);
        bool        isUsableIdx;
        Relation    idxRel;
        IndexInfo  *idxInfo;
 
        idxRel = index_open(idxoid, AccessShareLock);
        idxInfo = BuildIndexInfo(idxRel);
        isUsableIdx = IsIndexUsableForReplicaIdentityFull(idxInfo, attrmap);
        index_close(idxRel, AccessShareLock);
 
        /* Return the first eligible index found */
        if (isUsableIdx)
            return idxoid;
    }
 
    return InvalidOid;
}

References AccessShareLock, BuildIndexInfo(), index_close(), index_open(), InvalidOid, IsIndexUsableForReplicaIdentityFull(), lfirst_oid, and RelationGetIndexList().

Referenced by FindLogicalRepLocalIndex().

GetRelationIdentityOrPK()

Oid GetRelationIdentityOrPK

(

Relation

rel

)

Definition at line 855 of file relation.c.

{
    Oid         idxoid;
 
    idxoid = RelationGetReplicaIndex(rel);
 
    if (!OidIsValid(idxoid))
        idxoid = RelationGetPrimaryKeyIndex(rel);
 
    return idxoid;
}

References OidIsValid, RelationGetPrimaryKeyIndex(), and RelationGetReplicaIndex().

Referenced by check_relation_updatable(), FindLogicalRepLocalIndex(), FindReplTupleInLocalRel(), and RelationFindReplTupleByIndex().

IsIndexUsableForReplicaIdentityFull()

bool IsIndexUsableForReplicaIdentityFull	(	IndexInfo *	indexInfo,
		AttrMap *	attrmap
	)

Definition at line 808 of file relation.c.

{
    AttrNumber  keycol;
 
    /* Ensure that the index access method has a valid equal strategy */
    if (get_equal_strategy_number_for_am(indexInfo->ii_Am) == InvalidStrategy)
        return false;
 
    /* The index must not be a partial index */
    if (indexInfo->ii_Predicate != NIL)
        return false;
 
    Assert(indexInfo->ii_NumIndexAttrs >= 1);
 
    /* The leftmost index field must not be an expression */
    keycol = indexInfo->ii_IndexAttrNumbers[0];
    if (!AttributeNumberIsValid(keycol))
        return false;
 
    /*
     * And the leftmost index field must reference the remote relation column.
     * This is because if it doesn't, the sequential scan is favorable over
     * index scan in most cases.
     */
    if (attrmap->maplen <= AttrNumberGetAttrOffset(keycol) ||
        attrmap->attnums[AttrNumberGetAttrOffset(keycol)] < 0)
        return false;
 
#ifdef USE_ASSERT_CHECKING
    {
        IndexAmRoutine *amroutine;
 
        /* The given index access method must implement amgettuple. */
        amroutine = GetIndexAmRoutineByAmId(indexInfo->ii_Am, false);
        Assert(amroutine->amgettuple != NULL);
    }
#endif
 
    return true;
}

References IndexAmRoutine::amgettuple, Assert(), AttrMap::attnums, AttributeNumberIsValid, AttrNumberGetAttrOffset, get_equal_strategy_number_for_am(), GetIndexAmRoutineByAmId(), IndexInfo::ii_Am, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_Predicate, InvalidStrategy, AttrMap::maplen, and NIL.

Referenced by FindReplTupleInLocalRel(), and FindUsableIndexForReplicaIdentityFull().

logicalrep_partition_open()

LogicalRepRelMapEntry* logicalrep_partition_open	(	LogicalRepRelMapEntry *	root,
		Relation	partrel,
		AttrMap *	map
	)

Definition at line 603 of file relation.c.

{
    LogicalRepRelMapEntry *entry;
    LogicalRepPartMapEntry *part_entry;
    LogicalRepRelation *remoterel = &root->remoterel;
    Oid         partOid = RelationGetRelid(partrel);
    AttrMap    *attrmap = root->attrmap;
    bool        found;
    MemoryContext oldctx;
 
    if (LogicalRepPartMap == NULL)
        logicalrep_partmap_init();
 
    /* Search for existing entry. */
    part_entry = (LogicalRepPartMapEntry *) hash_search(LogicalRepPartMap,
                                                        &partOid,
                                                        HASH_ENTER, &found);
 
    entry = &part_entry->relmapentry;
 
    /*
     * We must always overwrite entry->localrel with the latest partition
     * Relation pointer, because the Relation pointed to by the old value may
     * have been cleared after the caller would have closed the partition
     * relation after the last use of this entry.  Note that localrelvalid is
     * only updated by the relcache invalidation callback, so it may still be
     * true irrespective of whether the Relation pointed to by localrel has
     * been cleared or not.
     */
    if (found && entry->localrelvalid)
    {
        entry->localrel = partrel;
        return entry;
    }
 
    /* Switch to longer-lived context. */
    oldctx = MemoryContextSwitchTo(LogicalRepPartMapContext);
 
    if (!found)
    {
        memset(part_entry, 0, sizeof(LogicalRepPartMapEntry));
        part_entry->partoid = partOid;
    }
 
    /* Release the no-longer-useful attrmap, if any. */
    if (entry->attrmap)
    {
        free_attrmap(entry->attrmap);
        entry->attrmap = NULL;
    }
 
    if (!entry->remoterel.remoteid)
    {
        int         i;
 
        /* Remote relation is copied as-is from the root entry. */
        entry = &part_entry->relmapentry;
        entry->remoterel.remoteid = remoterel->remoteid;
        entry->remoterel.nspname = pstrdup(remoterel->nspname);
        entry->remoterel.relname = pstrdup(remoterel->relname);
        entry->remoterel.natts = remoterel->natts;
        entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
        entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
        for (i = 0; i < remoterel->natts; i++)
        {
            entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
            entry->remoterel.atttyps[i] = remoterel->atttyps[i];
        }
        entry->remoterel.replident = remoterel->replident;
        entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
    }
 
    entry->localrel = partrel;
    entry->localreloid = partOid;
 
    /*
     * If the partition's attributes don't match the root relation's, we'll
     * need to make a new attrmap which maps partition attribute numbers to
     * remoterel's, instead of the original which maps root relation's
     * attribute numbers to remoterel's.
     *
     * Note that 'map' which comes from the tuple routing data structure
     * contains 1-based attribute numbers (of the parent relation).  However,
     * the map in 'entry', a logical replication data structure, contains
     * 0-based attribute numbers (of the remote relation).
     */
    if (map)
    {
        AttrNumber  attno;
 
        entry->attrmap = make_attrmap(map->maplen);
        for (attno = 0; attno < entry->attrmap->maplen; attno++)
        {
            AttrNumber  root_attno = map->attnums[attno];
 
            /* 0 means it's a dropped attribute.  See comments atop AttrMap. */
            if (root_attno == 0)
                entry->attrmap->attnums[attno] = -1;
            else
                entry->attrmap->attnums[attno] = attrmap->attnums[root_attno - 1];
        }
    }
    else
    {
        /* Lacking copy_attmap, do this the hard way. */
        entry->attrmap = make_attrmap(attrmap->maplen);
        memcpy(entry->attrmap->attnums, attrmap->attnums,
               attrmap->maplen * sizeof(AttrNumber));
    }
 
    /* Set if the table's replica identity is enough to apply update/delete. */
    logicalrep_rel_mark_updatable(entry);
 
    /* state and statelsn are left set to 0. */
    MemoryContextSwitchTo(oldctx);
 
    /*
     * Finding a usable index is an infrequent task. It occurs when an
     * operation is first performed on the relation, or after invalidation of
     * the relation cache entry (such as ANALYZE or CREATE/DROP index on the
     * relation).
     *
     * We also prefer to run this code on the oldctx so that we do not leak
     * anything in the LogicalRepPartMapContext (hence CacheMemoryContext).
     */
    entry->localindexoid = FindLogicalRepLocalIndex(partrel, remoterel,
                                                    entry->attrmap);
 
    entry->localrelvalid = true;
 
    return entry;
}

References LogicalRepRelation::attkeys, LogicalRepRelation::attnames, AttrMap::attnums, LogicalRepRelMapEntry::attrmap, LogicalRepRelation::atttyps, bms_copy(), FindLogicalRepLocalIndex(), free_attrmap(), HASH_ENTER, hash_search(), i, LogicalRepRelMapEntry::localindexoid, LogicalRepRelMapEntry::localrel, LogicalRepRelMapEntry::localreloid, LogicalRepRelMapEntry::localrelvalid, logicalrep_partmap_init(), logicalrep_rel_mark_updatable(), LogicalRepPartMap, LogicalRepPartMapContext, make_attrmap(), AttrMap::maplen, MemoryContextSwitchTo(), LogicalRepRelation::natts, LogicalRepRelation::nspname, palloc(), LogicalRepPartMapEntry::partoid, pstrdup(), RelationGetRelid, LogicalRepPartMapEntry::relmapentry, LogicalRepRelation::relname, LogicalRepRelation::remoteid, LogicalRepRelMapEntry::remoterel, and LogicalRepRelation::replident.

Referenced by apply_handle_tuple_routing().

logicalrep_partmap_init()

static void logicalrep_partmap_init ( void  )

static

Definition at line 568 of file relation.c.

{
    HASHCTL     ctl;
 
    if (!LogicalRepPartMapContext)
        LogicalRepPartMapContext =
            AllocSetContextCreate(CacheMemoryContext,
                                  "LogicalRepPartMapContext",
                                  ALLOCSET_DEFAULT_SIZES);
 
    /* Initialize the relation hash table. */
    ctl.keysize = sizeof(Oid);  /* partition OID */
    ctl.entrysize = sizeof(LogicalRepPartMapEntry);
    ctl.hcxt = LogicalRepPartMapContext;
 
    LogicalRepPartMap = hash_create("logicalrep partition map cache", 64, &ctl,
                                    HASH_ELEM | HASH_BLOBS | HASH_CONTEXT);
 
    /* Watch for invalidation events. */
    CacheRegisterRelcacheCallback(logicalrep_partmap_invalidate_cb,
                                  (Datum) 0);
}

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, CacheMemoryContext, CacheRegisterRelcacheCallback(), HASHCTL::entrysize, HASH_BLOBS, HASH_CONTEXT, hash_create(), HASH_ELEM, HASHCTL::hcxt, HASHCTL::keysize, logicalrep_partmap_invalidate_cb(), LogicalRepPartMap, and LogicalRepPartMapContext.

Referenced by logicalrep_partition_open().

logicalrep_partmap_invalidate_cb()

static void logicalrep_partmap_invalidate_cb ( Datum  arg, Oid  reloid  )

static

Definition at line 493 of file relation.c.

{
    LogicalRepPartMapEntry *entry;
 
    /* Just to be sure. */
    if (LogicalRepPartMap == NULL)
        return;
 
    if (reloid != InvalidOid)
    {
        HASH_SEQ_STATUS status;
 
        hash_seq_init(&status, LogicalRepPartMap);
 
        /* TODO, use inverse lookup hashtable? */
        while ((entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
        {
            if (entry->relmapentry.localreloid == reloid)
            {
                entry->relmapentry.localrelvalid = false;
                hash_seq_term(&status);
                break;
            }
        }
    }
    else
    {
        /* invalidate all cache entries */
        HASH_SEQ_STATUS status;
 
        hash_seq_init(&status, LogicalRepPartMap);
 
        while ((entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
            entry->relmapentry.localrelvalid = false;
    }
}

References hash_seq_init(), hash_seq_search(), hash_seq_term(), InvalidOid, LogicalRepRelMapEntry::localreloid, LogicalRepRelMapEntry::localrelvalid, LogicalRepPartMap, and LogicalRepPartMapEntry::relmapentry.

Referenced by logicalrep_partmap_init().

logicalrep_partmap_reset_relmap()

void logicalrep_partmap_reset_relmap

(

LogicalRepRelation *

remoterel

)

Definition at line 541 of file relation.c.

{
    HASH_SEQ_STATUS status;
    LogicalRepPartMapEntry *part_entry;
    LogicalRepRelMapEntry *entry;
 
    if (LogicalRepPartMap == NULL)
        return;
 
    hash_seq_init(&status, LogicalRepPartMap);
    while ((part_entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
    {
        entry = &part_entry->relmapentry;
 
        if (entry->remoterel.remoteid != remoterel->remoteid)
            continue;
 
        logicalrep_relmap_free_entry(entry);
 
        memset(entry, 0, sizeof(LogicalRepRelMapEntry));
    }
}

References hash_seq_init(), hash_seq_search(), logicalrep_relmap_free_entry(), LogicalRepPartMap, LogicalRepPartMapEntry::relmapentry, LogicalRepRelation::remoteid, and LogicalRepRelMapEntry::remoterel.

Referenced by apply_handle_relation().

logicalrep_rel_att_by_name()

static int logicalrep_rel_att_by_name ( LogicalRepRelation *  remoterel, const char *  attname  )

static

Definition at line 210 of file relation.c.

{
    int         i;
 
    for (i = 0; i < remoterel->natts; i++)
    {
        if (strcmp(remoterel->attnames[i], attname) == 0)
            return i;
    }
 
    return -1;
}

References attname, LogicalRepRelation::attnames, i, and LogicalRepRelation::natts.

Referenced by logicalrep_rel_open().

logicalrep_rel_close()

void logicalrep_rel_close	(	LogicalRepRelMapEntry *	rel,
		LOCKMODE	lockmode
	)

Definition at line 474 of file relation.c.

{
    table_close(rel->localrel, lockmode);
    rel->localrel = NULL;
}

References LogicalRepRelMapEntry::localrel, and table_close().

Referenced by apply_handle_delete(), apply_handle_insert(), apply_handle_truncate(), apply_handle_update(), and copy_table().

logicalrep_rel_mark_updatable()

static void logicalrep_rel_mark_updatable ( LogicalRepRelMapEntry *  entry )

static

Definition at line 275 of file relation.c.

{
    Bitmapset  *idkey;
    LogicalRepRelation *remoterel = &entry->remoterel;
    int         i;
 
    entry->updatable = true;
 
    idkey = RelationGetIndexAttrBitmap(entry->localrel,
                                       INDEX_ATTR_BITMAP_IDENTITY_KEY);
    /* fallback to PK if no replica identity */
    if (idkey == NULL)
    {
        idkey = RelationGetIndexAttrBitmap(entry->localrel,
                                           INDEX_ATTR_BITMAP_PRIMARY_KEY);
 
        /*
         * If no replica identity index and no PK, the published table must
         * have replica identity FULL.
         */
        if (idkey == NULL && remoterel->replident != REPLICA_IDENTITY_FULL)
            entry->updatable = false;
    }
 
    i = -1;
    while ((i = bms_next_member(idkey, i)) >= 0)
    {
        int         attnum = i + FirstLowInvalidHeapAttributeNumber;
 
        if (!AttrNumberIsForUserDefinedAttr(attnum))
            ereport(ERROR,
                    (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
                     errmsg("logical replication target relation \"%s.%s\" uses "
                            "system columns in REPLICA IDENTITY index",
                            remoterel->nspname, remoterel->relname)));
 
        attnum = AttrNumberGetAttrOffset(attnum);
 
        if (entry->attrmap->attnums[attnum] < 0 ||
            !bms_is_member(entry->attrmap->attnums[attnum], remoterel->attkeys))
        {
            entry->updatable = false;
            break;
        }
    }
}

References LogicalRepRelation::attkeys, attnum, AttrMap::attnums, LogicalRepRelMapEntry::attrmap, AttrNumberGetAttrOffset, AttrNumberIsForUserDefinedAttr, bms_is_member(), bms_next_member(), ereport, errcode(), errmsg(), ERROR, FirstLowInvalidHeapAttributeNumber, i, INDEX_ATTR_BITMAP_IDENTITY_KEY, INDEX_ATTR_BITMAP_PRIMARY_KEY, LogicalRepRelMapEntry::localrel, LogicalRepRelation::nspname, RelationGetIndexAttrBitmap(), LogicalRepRelation::relname, LogicalRepRelMapEntry::remoterel, LogicalRepRelation::replident, and LogicalRepRelMapEntry::updatable.

Referenced by logicalrep_partition_open(), and logicalrep_rel_open().

logicalrep_rel_open()

LogicalRepRelMapEntry* logicalrep_rel_open	(	LogicalRepRelId	remoteid,
		LOCKMODE	lockmode
	)

Definition at line 328 of file relation.c.

{
    LogicalRepRelMapEntry *entry;
    bool        found;
    LogicalRepRelation *remoterel;
 
    if (LogicalRepRelMap == NULL)
        logicalrep_relmap_init();
 
    /* Search for existing entry. */
    entry = hash_search(LogicalRepRelMap, &remoteid,
                        HASH_FIND, &found);
 
    if (!found)
        elog(ERROR, "no relation map entry for remote relation ID %u",
             remoteid);
 
    remoterel = &entry->remoterel;
 
    /* Ensure we don't leak a relcache refcount. */
    if (entry->localrel)
        elog(ERROR, "remote relation ID %u is already open", remoteid);
 
    /*
     * When opening and locking a relation, pending invalidation messages are
     * processed which can invalidate the relation.  Hence, if the entry is
     * currently considered valid, try to open the local relation by OID and
     * see if invalidation ensues.
     */
    if (entry->localrelvalid)
    {
        entry->localrel = try_table_open(entry->localreloid, lockmode);
        if (!entry->localrel)
        {
            /* Table was renamed or dropped. */
            entry->localrelvalid = false;
        }
        else if (!entry->localrelvalid)
        {
            /* Note we release the no-longer-useful lock here. */
            table_close(entry->localrel, lockmode);
            entry->localrel = NULL;
        }
    }
 
    /*
     * If the entry has been marked invalid since we last had lock on it,
     * re-open the local relation by name and rebuild all derived data.
     */
    if (!entry->localrelvalid)
    {
        Oid         relid;
        TupleDesc   desc;
        MemoryContext oldctx;
        int         i;
        Bitmapset  *missingatts;
 
        /* Release the no-longer-useful attrmap, if any. */
        if (entry->attrmap)
        {
            free_attrmap(entry->attrmap);
            entry->attrmap = NULL;
        }
 
        /* Try to find and lock the relation by name. */
        relid = RangeVarGetRelid(makeRangeVar(remoterel->nspname,
                                              remoterel->relname, -1),
                                 lockmode, true);
        if (!OidIsValid(relid))
            ereport(ERROR,
                    (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
                     errmsg("logical replication target relation \"%s.%s\" does not exist",
                            remoterel->nspname, remoterel->relname)));
        entry->localrel = table_open(relid, NoLock);
        entry->localreloid = relid;
 
        /* Check for supported relkind. */
        CheckSubscriptionRelkind(entry->localrel->rd_rel->relkind,
                                 remoterel->nspname, remoterel->relname);
 
        /*
         * Build the mapping of local attribute numbers to remote attribute
         * numbers and validate that we don't miss any replicated columns as
         * that would result in potentially unwanted data loss.
         */
        desc = RelationGetDescr(entry->localrel);
        oldctx = MemoryContextSwitchTo(LogicalRepRelMapContext);
        entry->attrmap = make_attrmap(desc->natts);
        MemoryContextSwitchTo(oldctx);
 
        /* check and report missing attrs, if any */
        missingatts = bms_add_range(NULL, 0, remoterel->natts - 1);
        for (i = 0; i < desc->natts; i++)
        {
            int         attnum;
            Form_pg_attribute attr = TupleDescAttr(desc, i);
 
            if (attr->attisdropped || attr->attgenerated)
            {
                entry->attrmap->attnums[i] = -1;
                continue;
            }
 
            attnum = logicalrep_rel_att_by_name(remoterel,
                                                NameStr(attr->attname));
 
            entry->attrmap->attnums[i] = attnum;
            if (attnum >= 0)
                missingatts = bms_del_member(missingatts, attnum);
        }
 
        logicalrep_report_missing_attrs(remoterel, missingatts);
 
        /* be tidy */
        bms_free(missingatts);
 
        /*
         * Set if the table's replica identity is enough to apply
         * update/delete.
         */
        logicalrep_rel_mark_updatable(entry);
 
        /*
         * Finding a usable index is an infrequent task. It occurs when an
         * operation is first performed on the relation, or after invalidation
         * of the relation cache entry (such as ANALYZE or CREATE/DROP index
         * on the relation).
         */
        entry->localindexoid = FindLogicalRepLocalIndex(entry->localrel, remoterel,
                                                        entry->attrmap);
 
        entry->localrelvalid = true;
    }
 
    if (entry->state != SUBREL_STATE_READY)
        entry->state = GetSubscriptionRelState(MySubscription->oid,
                                               entry->localreloid,
                                               &entry->statelsn);
 
    return entry;
}

References attnum, AttrMap::attnums, LogicalRepRelMapEntry::attrmap, bms_add_range(), bms_del_member(), bms_free(), CheckSubscriptionRelkind(), elog(), ereport, errcode(), errmsg(), ERROR, FindLogicalRepLocalIndex(), free_attrmap(), GetSubscriptionRelState(), HASH_FIND, hash_search(), i, LogicalRepRelMapEntry::localindexoid, LogicalRepRelMapEntry::localrel, LogicalRepRelMapEntry::localreloid, LogicalRepRelMapEntry::localrelvalid, logicalrep_rel_att_by_name(), logicalrep_rel_mark_updatable(), logicalrep_relmap_init(), logicalrep_report_missing_attrs(), LogicalRepRelMap, LogicalRepRelMapContext, make_attrmap(), makeRangeVar(), MemoryContextSwitchTo(), MySubscription, NameStr, TupleDescData::natts, LogicalRepRelation::natts, NoLock, LogicalRepRelation::nspname, Subscription::oid, OidIsValid, RangeVarGetRelid, RelationData::rd_rel, RelationGetDescr, LogicalRepRelation::relname, LogicalRepRelMapEntry::remoterel, LogicalRepRelMapEntry::state, LogicalRepRelMapEntry::statelsn, table_close(), table_open(), try_table_open(), and TupleDescAttr.

Referenced by apply_handle_delete(), apply_handle_insert(), apply_handle_truncate(), apply_handle_update(), and copy_table().

logicalrep_relmap_free_entry()

static void logicalrep_relmap_free_entry ( LogicalRepRelMapEntry *  entry )

static

Definition at line 133 of file relation.c.

{
    LogicalRepRelation *remoterel;
 
    remoterel = &entry->remoterel;
 
    pfree(remoterel->nspname);
    pfree(remoterel->relname);
 
    if (remoterel->natts > 0)
    {
        int         i;
 
        for (i = 0; i < remoterel->natts; i++)
            pfree(remoterel->attnames[i]);
 
        pfree(remoterel->attnames);
        pfree(remoterel->atttyps);
    }
    bms_free(remoterel->attkeys);
 
    if (entry->attrmap)
        free_attrmap(entry->attrmap);
}

References LogicalRepRelation::attkeys, LogicalRepRelation::attnames, LogicalRepRelMapEntry::attrmap, LogicalRepRelation::atttyps, bms_free(), free_attrmap(), i, LogicalRepRelation::natts, LogicalRepRelation::nspname, pfree(), LogicalRepRelation::relname, and LogicalRepRelMapEntry::remoterel.

Referenced by logicalrep_partmap_reset_relmap(), and logicalrep_relmap_update().

logicalrep_relmap_init()

static void logicalrep_relmap_init ( void  )

static

Definition at line 106 of file relation.c.

{
    HASHCTL     ctl;
 
    if (!LogicalRepRelMapContext)
        LogicalRepRelMapContext =
            AllocSetContextCreate(CacheMemoryContext,
                                  "LogicalRepRelMapContext",
                                  ALLOCSET_DEFAULT_SIZES);
 
    /* Initialize the relation hash table. */
    ctl.keysize = sizeof(LogicalRepRelId);
    ctl.entrysize = sizeof(LogicalRepRelMapEntry);
    ctl.hcxt = LogicalRepRelMapContext;
 
    LogicalRepRelMap = hash_create("logicalrep relation map cache", 128, &ctl,
                                   HASH_ELEM | HASH_BLOBS | HASH_CONTEXT);
 
    /* Watch for invalidation events. */
    CacheRegisterRelcacheCallback(logicalrep_relmap_invalidate_cb,
                                  (Datum) 0);
}

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate, CacheMemoryContext, CacheRegisterRelcacheCallback(), HASHCTL::entrysize, HASH_BLOBS, HASH_CONTEXT, hash_create(), HASH_ELEM, HASHCTL::hcxt, HASHCTL::keysize, logicalrep_relmap_invalidate_cb(), LogicalRepRelMap, and LogicalRepRelMapContext.

Referenced by logicalrep_rel_open(), and logicalrep_relmap_update().

logicalrep_relmap_invalidate_cb()

static void logicalrep_relmap_invalidate_cb ( Datum  arg, Oid  reloid  )

static

Definition at line 65 of file relation.c.

{
    LogicalRepRelMapEntry *entry;
 
    /* Just to be sure. */
    if (LogicalRepRelMap == NULL)
        return;
 
    if (reloid != InvalidOid)
    {
        HASH_SEQ_STATUS status;
 
        hash_seq_init(&status, LogicalRepRelMap);
 
        /* TODO, use inverse lookup hashtable? */
        while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
        {
            if (entry->localreloid == reloid)
            {
                entry->localrelvalid = false;
                hash_seq_term(&status);
                break;
            }
        }
    }
    else
    {
        /* invalidate all cache entries */
        HASH_SEQ_STATUS status;
 
        hash_seq_init(&status, LogicalRepRelMap);
 
        while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
            entry->localrelvalid = false;
    }
}

References hash_seq_init(), hash_seq_search(), hash_seq_term(), InvalidOid, LogicalRepRelMapEntry::localreloid, LogicalRepRelMapEntry::localrelvalid, and LogicalRepRelMap.

Referenced by logicalrep_relmap_init().

logicalrep_relmap_update()

void logicalrep_relmap_update

(

LogicalRepRelation *

remoterel

)

Definition at line 165 of file relation.c.

{
    MemoryContext oldctx;
    LogicalRepRelMapEntry *entry;
    bool        found;
    int         i;
 
    if (LogicalRepRelMap == NULL)
        logicalrep_relmap_init();
 
    /*
     * HASH_ENTER returns the existing entry if present or creates a new one.
     */
    entry = hash_search(LogicalRepRelMap, &remoterel->remoteid,
                        HASH_ENTER, &found);
 
    if (found)
        logicalrep_relmap_free_entry(entry);
 
    memset(entry, 0, sizeof(LogicalRepRelMapEntry));
 
    /* Make cached copy of the data */
    oldctx = MemoryContextSwitchTo(LogicalRepRelMapContext);
    entry->remoterel.remoteid = remoterel->remoteid;
    entry->remoterel.nspname = pstrdup(remoterel->nspname);
    entry->remoterel.relname = pstrdup(remoterel->relname);
    entry->remoterel.natts = remoterel->natts;
    entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
    entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
    for (i = 0; i < remoterel->natts; i++)
    {
        entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
        entry->remoterel.atttyps[i] = remoterel->atttyps[i];
    }
    entry->remoterel.replident = remoterel->replident;
    entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
    MemoryContextSwitchTo(oldctx);
}

References LogicalRepRelation::attkeys, LogicalRepRelation::attnames, LogicalRepRelation::atttyps, bms_copy(), HASH_ENTER, hash_search(), i, logicalrep_relmap_free_entry(), logicalrep_relmap_init(), LogicalRepRelMap, LogicalRepRelMapContext, MemoryContextSwitchTo(), LogicalRepRelation::natts, LogicalRepRelation::nspname, palloc(), pstrdup(), LogicalRepRelation::relname, LogicalRepRelation::remoteid, LogicalRepRelMapEntry::remoterel, and LogicalRepRelation::replident.

Referenced by apply_handle_relation(), and copy_table().

logicalrep_report_missing_attrs()

static void logicalrep_report_missing_attrs ( LogicalRepRelation *  remoterel, Bitmapset *  missingatts  )

static

Definition at line 227 of file relation.c.

{
    if (!bms_is_empty(missingatts))
    {
        StringInfoData missingattsbuf;
        int         missingattcnt = 0;
        int         i;
 
        initStringInfo(&missingattsbuf);
 
        i = -1;
        while ((i = bms_next_member(missingatts, i)) >= 0)
        {
            missingattcnt++;
            if (missingattcnt == 1)
                appendStringInfo(&missingattsbuf, _("\"%s\""),
                                 remoterel->attnames[i]);
            else
                appendStringInfo(&missingattsbuf, _(", \"%s\""),
                                 remoterel->attnames[i]);
        }
 
        ereport(ERROR,
                (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
                 errmsg_plural("logical replication target relation \"%s.%s\" is missing replicated column: %s",
                               "logical replication target relation \"%s.%s\" is missing replicated columns: %s",
                               missingattcnt,
                               remoterel->nspname,
                               remoterel->relname,
                               missingattsbuf.data)));
    }
}

References _, appendStringInfo(), LogicalRepRelation::attnames, bms_is_empty, bms_next_member(), StringInfoData::data, ereport, errcode(), errmsg_plural(), ERROR, i, initStringInfo(), LogicalRepRelation::nspname, and LogicalRepRelation::relname.

Referenced by logicalrep_rel_open().

Variable Documentation

LogicalRepPartMap

HTAB* LogicalRepPartMap = NULL

static

Definition at line 51 of file relation.c.

Referenced by logicalrep_partition_open(), logicalrep_partmap_init(), logicalrep_partmap_invalidate_cb(), and logicalrep_partmap_reset_relmap().

LogicalRepPartMapContext

MemoryContext LogicalRepPartMapContext = NULL

static

Definition at line 50 of file relation.c.

Referenced by logicalrep_partition_open(), and logicalrep_partmap_init().

LogicalRepRelMap

HTAB* LogicalRepRelMap = NULL

static

Definition at line 37 of file relation.c.

Referenced by logicalrep_rel_open(), logicalrep_relmap_init(), logicalrep_relmap_invalidate_cb(), and logicalrep_relmap_update().

LogicalRepRelMapContext

MemoryContext LogicalRepRelMapContext = NULL

static

Definition at line 35 of file relation.c.

Referenced by logicalrep_rel_open(), logicalrep_relmap_init(), and logicalrep_relmap_update().