mirror of https://github.com/citusdata/citus.git
1393 lines
41 KiB
C
1393 lines
41 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* resource_lock.c
|
|
* Locking Infrastructure for Citus.
|
|
*
|
|
* To avoid introducing a new type of locktag - that then could not be
|
|
* displayed by core functionality - we reuse advisory locks. If we'd just
|
|
* reused them directly we'd run into danger conflicting with user-defined
|
|
* advisory locks, but luckily advisory locks only two values for 'field4' in
|
|
* the locktag.
|
|
*
|
|
* Copyright (c) Citus Data, Inc.
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
|
|
#include "postgres.h"
|
|
|
|
#include "c.h"
|
|
#include "miscadmin.h"
|
|
|
|
#include "access/xact.h"
|
|
#include "catalog/namespace.h"
|
|
#include "commands/tablecmds.h"
|
|
#include "storage/lmgr.h"
|
|
#include "utils/builtins.h"
|
|
#include "utils/lsyscache.h"
|
|
#include "utils/varlena.h"
|
|
|
|
#include "distributed/colocation_utils.h"
|
|
#include "distributed/commands.h"
|
|
#include "distributed/coordinator_protocol.h"
|
|
#include "distributed/distributed_planner.h"
|
|
#include "distributed/listutils.h"
|
|
#include "distributed/local_executor.h"
|
|
#include "distributed/metadata_cache.h"
|
|
#include "distributed/metadata_sync.h"
|
|
#include "distributed/metadata_utility.h"
|
|
#include "distributed/multi_executor.h"
|
|
#include "distributed/multi_join_order.h"
|
|
#include "distributed/multi_partitioning_utils.h"
|
|
#include "distributed/reference_table_utils.h"
|
|
#include "distributed/relay_utility.h"
|
|
#include "distributed/remote_commands.h"
|
|
#include "distributed/resource_lock.h"
|
|
#include "distributed/shardinterval_utils.h"
|
|
#include "distributed/utils/array_type.h"
|
|
#include "distributed/version_compat.h"
|
|
#include "distributed/worker_protocol.h"
|
|
#include "distributed/worker_shard_visibility.h"
|
|
#include "distributed/worker_transaction.h"
|
|
|
|
#define LOCK_RELATION_IF_EXISTS \
|
|
"SELECT pg_catalog.lock_relation_if_exists(%s, %s);"
|
|
|
|
/* static definition and declarations */
|
|
struct LockModeToStringType
|
|
{
|
|
LOCKMODE lockMode;
|
|
const char *name;
|
|
};
|
|
|
|
/*
|
|
* list of lock mode mappings, number of items need to be kept in sync
|
|
* with lock_mode_to_string_map_count.
|
|
*/
|
|
static const struct LockModeToStringType lockmode_to_string_map[] = {
|
|
{ NoLock, "NoLock" },
|
|
{ AccessShareLock, "ACCESS SHARE" },
|
|
{ RowShareLock, "ROW SHARE" },
|
|
{ RowExclusiveLock, "ROW EXCLUSIVE" },
|
|
{ ShareUpdateExclusiveLock, "SHARE UPDATE EXCLUSIVE" },
|
|
{ ShareLock, "SHARE" },
|
|
{ ShareRowExclusiveLock, "SHARE ROW EXCLUSIVE" },
|
|
{ ExclusiveLock, "EXCLUSIVE" },
|
|
{ AccessExclusiveLock, "ACCESS EXCLUSIVE" }
|
|
};
|
|
static const int lock_mode_to_string_map_count = sizeof(lockmode_to_string_map) /
|
|
sizeof(lockmode_to_string_map[0]);
|
|
|
|
/*
|
|
* LockRelationRecord holds the oid of a relation to be locked
|
|
* and a boolean inh to determine whether its decendants
|
|
* should be locked as well
|
|
*/
|
|
typedef struct LockRelationRecord
|
|
{
|
|
Oid relationId;
|
|
bool inh;
|
|
} LockRelationRecord;
|
|
|
|
|
|
/* local function forward declarations */
|
|
static LOCKMODE IntToLockMode(int mode);
|
|
static void LockReferencedReferenceShardResources(uint64 shardId, LOCKMODE lockMode);
|
|
static bool AnyTableReplicated(List *shardIntervalList,
|
|
List **replicatedShardIntervalList);
|
|
static void LockShardListResources(List *shardIntervalList, LOCKMODE lockMode);
|
|
static void LockShardListResourcesOnFirstWorker(LOCKMODE lockmode,
|
|
List *shardIntervalList);
|
|
static bool IsFirstWorkerNode();
|
|
static void CitusRangeVarCallbackForLockTable(const RangeVar *rangeVar, Oid relationId,
|
|
Oid oldRelationId, void *arg);
|
|
static AclResult CitusLockTableAclCheck(Oid relationId, LOCKMODE lockmode, Oid userId);
|
|
static void SetLocktagForShardDistributionMetadata(int64 shardId, LOCKTAG *tag);
|
|
|
|
|
|
/* exports for SQL callable functions */
|
|
PG_FUNCTION_INFO_V1(lock_shard_metadata);
|
|
PG_FUNCTION_INFO_V1(lock_shard_resources);
|
|
PG_FUNCTION_INFO_V1(lock_relation_if_exists);
|
|
|
|
/* Config variable managed via guc.c */
|
|
bool EnableAcquiringUnsafeLockFromWorkers = false;
|
|
bool SkipAdvisoryLockPermissionChecks = false;
|
|
|
|
|
|
/*
|
|
* lock_shard_metadata allows the shard distribution metadata to be locked
|
|
* remotely to block concurrent writes from workers in MX tables.
|
|
*
|
|
* This function does not sort the array to avoid deadlock, callers
|
|
* must ensure a consistent order.
|
|
*/
|
|
Datum
|
|
lock_shard_metadata(PG_FUNCTION_ARGS)
|
|
{
|
|
CheckCitusVersion(ERROR);
|
|
|
|
LOCKMODE lockMode = IntToLockMode(PG_GETARG_INT32(0));
|
|
ArrayType *shardIdArrayObject = PG_GETARG_ARRAYTYPE_P(1);
|
|
|
|
if (ARR_NDIM(shardIdArrayObject) == 0)
|
|
{
|
|
ereport(ERROR, (errmsg("no locks specified")));
|
|
}
|
|
|
|
int shardIdCount = ArrayObjectCount(shardIdArrayObject);
|
|
Datum *shardIdArrayDatum = DeconstructArrayObject(shardIdArrayObject);
|
|
|
|
for (int shardIdIndex = 0; shardIdIndex < shardIdCount; shardIdIndex++)
|
|
{
|
|
int64 shardId = DatumGetInt64(shardIdArrayDatum[shardIdIndex]);
|
|
|
|
/*
|
|
* We don't want random users to block writes. The callers of this
|
|
* function either operates on all the colocated placements, such
|
|
* as shard moves, or requires superuser such as adding node.
|
|
* In other words, the coordinator initiated operations has already
|
|
* ensured table owner, we are preventing any malicious attempt to
|
|
* use this function.
|
|
*/
|
|
bool missingOk = true;
|
|
EnsureShardOwner(shardId, missingOk);
|
|
|
|
LockShardDistributionMetadata(shardId, lockMode);
|
|
}
|
|
|
|
PG_RETURN_VOID();
|
|
}
|
|
|
|
|
|
/*
|
|
* EnsureShardOwner gets the shardId and reads pg_dist_partition to find
|
|
* the corresponding relationId. If the relation does not exist, the function
|
|
* returns. If the relation exists, the function ensures if the current
|
|
* user is the owner of the table.
|
|
*
|
|
*/
|
|
void
|
|
EnsureShardOwner(uint64 shardId, bool missingOk)
|
|
{
|
|
Oid relationId = LookupShardRelationFromCatalog(shardId, missingOk);
|
|
|
|
if (!OidIsValid(relationId) && missingOk)
|
|
{
|
|
/*
|
|
* This could happen in two ways. First, a malicious user is trying
|
|
* to acquire locks on non-existing shards. Second, the metadata has
|
|
* not been synced (or not yet visible) to this node. In the second
|
|
* case, there is no point in locking the shards because no other
|
|
* transaction can be accessing the table.
|
|
*/
|
|
return;
|
|
}
|
|
|
|
EnsureTableOwner(relationId);
|
|
}
|
|
|
|
|
|
/*
|
|
* lock_shard_resources allows shard resources to be locked
|
|
* remotely to serialise non-commutative writes on shards.
|
|
*
|
|
* This function does not sort the array to avoid deadlock, callers
|
|
* must ensure a consistent order.
|
|
*/
|
|
Datum
|
|
lock_shard_resources(PG_FUNCTION_ARGS)
|
|
{
|
|
CheckCitusVersion(ERROR);
|
|
|
|
LOCKMODE lockMode = IntToLockMode(PG_GETARG_INT32(0));
|
|
ArrayType *shardIdArrayObject = PG_GETARG_ARRAYTYPE_P(1);
|
|
|
|
if (ARR_NDIM(shardIdArrayObject) == 0)
|
|
{
|
|
ereport(ERROR, (errmsg("no locks specified")));
|
|
}
|
|
|
|
int shardIdCount = ArrayObjectCount(shardIdArrayObject);
|
|
Datum *shardIdArrayDatum = DeconstructArrayObject(shardIdArrayObject);
|
|
|
|
/*
|
|
* The executor calls this UDF for modification queries. So, any user
|
|
* who has the the rights to modify this table are actually able
|
|
* to call the UDF.
|
|
*
|
|
* So, at this point, we make sure that any malicious user who doesn't
|
|
* have modification privileges to call this UDF.
|
|
*
|
|
* Update/Delete/Truncate commands already acquires ExclusiveLock
|
|
* on the executor. However, for INSERTs, the user might have only
|
|
* INSERTs granted, so add a special case for it.
|
|
*/
|
|
AclMode aclMode = ACL_UPDATE | ACL_DELETE | ACL_TRUNCATE;
|
|
AclMaskHow aclMaskHow = ACLMASK_ANY;
|
|
|
|
if (lockMode == RowExclusiveLock)
|
|
{
|
|
aclMode |= ACL_INSERT;
|
|
}
|
|
|
|
for (int shardIdIndex = 0; shardIdIndex < shardIdCount; shardIdIndex++)
|
|
{
|
|
int64 shardId = DatumGetInt64(shardIdArrayDatum[shardIdIndex]);
|
|
|
|
/*
|
|
* We don't want random users to block writes. If the current user
|
|
* has privileges to modify the shard, then the user can already
|
|
* acquire the lock. So, we allow.
|
|
*/
|
|
bool missingOk = true;
|
|
Oid relationId = LookupShardRelationFromCatalog(shardId, missingOk);
|
|
|
|
if (!OidIsValid(relationId) && missingOk)
|
|
{
|
|
/*
|
|
* This could happen in two ways. First, a malicious user is trying
|
|
* to acquire locks on non-existing shards. Second, the metadata has
|
|
* not been synced (or not yet visible) to this node. In the second
|
|
* case, there is no point in locking the shards because no other
|
|
* transaction can be accessing the table.
|
|
*/
|
|
continue;
|
|
}
|
|
|
|
if (!SkipAdvisoryLockPermissionChecks)
|
|
{
|
|
EnsureTablePermissions(relationId, aclMode, aclMaskHow);
|
|
}
|
|
|
|
LockShardResource(shardId, lockMode);
|
|
}
|
|
|
|
PG_RETURN_VOID();
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardListResourcesOnFirstWorker acquires the resource locks for the specified
|
|
* shards on the first worker. Acquiring a lock with or without metadata does not
|
|
* matter for us. So, worker does not have to be an MX node, acquiring the lock
|
|
* on any worker node is enough. Note that the function does not sort the shard list,
|
|
* therefore the caller should sort the shard list in order to avoid deadlocks.
|
|
*/
|
|
static void
|
|
LockShardListResourcesOnFirstWorker(LOCKMODE lockmode, List *shardIntervalList)
|
|
{
|
|
if (!AllowModificationsFromWorkersToReplicatedTables)
|
|
{
|
|
/*
|
|
* Allowing modifications from worker nodes for replicated tables requires
|
|
* to serialize modifications, see AcquireExecutorShardLocksForExecution()
|
|
* for the details.
|
|
*
|
|
* If the user opted for disabling modifications from the workers, we do not
|
|
* need to acquire these remote locks. Returning early saves us from an additional
|
|
* network round-trip.
|
|
*/
|
|
Assert(AnyTableReplicated(shardIntervalList, NULL));
|
|
return;
|
|
}
|
|
|
|
StringInfo lockCommand = makeStringInfo();
|
|
int processedShardIntervalCount = 0;
|
|
int totalShardIntervalCount = list_length(shardIntervalList);
|
|
WorkerNode *firstWorkerNode = GetFirstPrimaryWorkerNode();
|
|
int connectionFlags = 0;
|
|
const char *currentUser = CurrentUserName();
|
|
|
|
appendStringInfo(lockCommand, "SELECT lock_shard_resources(%d, ARRAY[", lockmode);
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
int64 shardId = shardInterval->shardId;
|
|
|
|
appendStringInfo(lockCommand, "%lu", shardId);
|
|
|
|
processedShardIntervalCount++;
|
|
if (processedShardIntervalCount != totalShardIntervalCount)
|
|
{
|
|
appendStringInfo(lockCommand, ", ");
|
|
}
|
|
}
|
|
|
|
appendStringInfo(lockCommand, "])");
|
|
|
|
/* need to hold the lock until commit */
|
|
UseCoordinatedTransaction();
|
|
|
|
/*
|
|
* Use the superuser connection to make sure we are allowed to lock.
|
|
* This also helps ensure we only use one connection.
|
|
*/
|
|
MultiConnection *firstWorkerConnection = GetNodeUserDatabaseConnection(
|
|
connectionFlags,
|
|
firstWorkerNode
|
|
->workerName,
|
|
firstWorkerNode
|
|
->workerPort,
|
|
currentUser,
|
|
NULL);
|
|
|
|
/* the SELECT .. FOR UPDATE breaks if we lose the connection */
|
|
MarkRemoteTransactionCritical(firstWorkerConnection);
|
|
|
|
/* make sure we are in a tranasaction block to hold the lock until commit */
|
|
RemoteTransactionBeginIfNecessary(firstWorkerConnection);
|
|
|
|
/* grab the lock on the first worker node */
|
|
ExecuteCriticalRemoteCommand(firstWorkerConnection, lockCommand->data);
|
|
}
|
|
|
|
|
|
/*
|
|
* IsFirstWorkerNode checks whether the node is the first worker node sorted
|
|
* according to the host name and port number.
|
|
*/
|
|
static bool
|
|
IsFirstWorkerNode()
|
|
{
|
|
List *workerNodeList = ActivePrimaryNonCoordinatorNodeList(NoLock);
|
|
|
|
workerNodeList = SortList(workerNodeList, CompareWorkerNodes);
|
|
|
|
if (list_length(workerNodeList) == 0)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
WorkerNode *firstWorkerNode = (WorkerNode *) linitial(workerNodeList);
|
|
|
|
if (firstWorkerNode->groupId == GetLocalGroupId())
|
|
{
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardListMetadataOnWorkers acquires the matadata locks for the specified shards on
|
|
* metadata workers. Note that the function does not sort the shard list, therefore the
|
|
* caller should sort the shard list in order to avoid deadlocks.
|
|
*/
|
|
void
|
|
LockShardListMetadataOnWorkers(LOCKMODE lockmode, List *shardIntervalList)
|
|
{
|
|
StringInfo lockCommand = makeStringInfo();
|
|
int processedShardIntervalCount = 0;
|
|
int totalShardIntervalCount = list_length(shardIntervalList);
|
|
|
|
if (list_length(shardIntervalList) == 0)
|
|
{
|
|
return;
|
|
}
|
|
|
|
appendStringInfo(lockCommand, "SELECT lock_shard_metadata(%d, ARRAY[", lockmode);
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
int64 shardId = shardInterval->shardId;
|
|
|
|
appendStringInfo(lockCommand, "%lu", shardId);
|
|
|
|
processedShardIntervalCount++;
|
|
if (processedShardIntervalCount != totalShardIntervalCount)
|
|
{
|
|
appendStringInfo(lockCommand, ", ");
|
|
}
|
|
}
|
|
|
|
appendStringInfo(lockCommand, "])");
|
|
|
|
SendCommandToWorkersWithMetadata(lockCommand->data);
|
|
}
|
|
|
|
|
|
/*
|
|
* IntToLockMode verifies whether the specified integer is an accepted lock mode
|
|
* and returns it as a LOCKMODE enum.
|
|
*/
|
|
static LOCKMODE
|
|
IntToLockMode(int mode)
|
|
{
|
|
if (mode == ExclusiveLock)
|
|
{
|
|
return ExclusiveLock;
|
|
}
|
|
else if (mode == ShareLock)
|
|
{
|
|
return ShareLock;
|
|
}
|
|
else if (mode == AccessShareLock)
|
|
{
|
|
return AccessShareLock;
|
|
}
|
|
else if (mode == RowExclusiveLock)
|
|
{
|
|
return RowExclusiveLock;
|
|
}
|
|
else
|
|
{
|
|
elog(ERROR, "unsupported lockmode %d", mode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* LockColocationId returns after acquiring a co-location ID lock, typically used
|
|
* for rebalancing and replication.
|
|
*/
|
|
void
|
|
LockColocationId(int colocationId, LOCKMODE lockMode)
|
|
{
|
|
LOCKTAG tag;
|
|
const bool sessionLock = false;
|
|
const bool dontWait = false;
|
|
|
|
SET_LOCKTAG_REBALANCE_COLOCATION(tag, (int64) colocationId);
|
|
(void) LockAcquire(&tag, lockMode, sessionLock, dontWait);
|
|
}
|
|
|
|
|
|
/*
|
|
* UnlockColocationId releases a co-location ID lock.
|
|
*/
|
|
void
|
|
UnlockColocationId(int colocationId, LOCKMODE lockMode)
|
|
{
|
|
LOCKTAG tag;
|
|
const bool sessionLock = false;
|
|
|
|
SET_LOCKTAG_REBALANCE_COLOCATION(tag, (int64) colocationId);
|
|
LockRelease(&tag, lockMode, sessionLock);
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardDistributionMetadata returns after grabbing a lock for distribution
|
|
* metadata related to the specified shard, blocking if required. Any locks
|
|
* acquired using this method are released at transaction end.
|
|
*/
|
|
void
|
|
LockShardDistributionMetadata(int64 shardId, LOCKMODE lockMode)
|
|
{
|
|
LOCKTAG tag;
|
|
const bool sessionLock = false;
|
|
const bool dontWait = false;
|
|
|
|
SetLocktagForShardDistributionMetadata(shardId, &tag);
|
|
(void) LockAcquire(&tag, lockMode, sessionLock, dontWait);
|
|
}
|
|
|
|
|
|
static void
|
|
SetLocktagForShardDistributionMetadata(int64 shardId, LOCKTAG *tag)
|
|
{
|
|
ShardInterval *shardInterval = LoadShardInterval(shardId);
|
|
Oid citusTableId = shardInterval->relationId;
|
|
CitusTableCacheEntry *citusTable = GetCitusTableCacheEntry(citusTableId);
|
|
uint32 colocationId = citusTable->colocationId;
|
|
|
|
if (colocationId == INVALID_COLOCATION_ID ||
|
|
(!IsCitusTableTypeCacheEntry(citusTable, HASH_DISTRIBUTED) &&
|
|
!IsCitusTableTypeCacheEntry(citusTable, SINGLE_SHARD_DISTRIBUTED)))
|
|
{
|
|
SET_LOCKTAG_SHARD_METADATA_RESOURCE(*tag, MyDatabaseId, shardId);
|
|
}
|
|
else
|
|
{
|
|
SET_LOCKTAG_COLOCATED_SHARDS_METADATA_RESOURCE(*tag, MyDatabaseId, colocationId,
|
|
shardInterval->shardIndex);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* LockReferencedReferenceShardDistributionMetadata acquires shard distribution
|
|
* metadata locks with the given lock mode on the reference tables which has a
|
|
* foreign key from the given relation.
|
|
*
|
|
* It also gets metadata locks on worker nodes to prevent concurrent write
|
|
* operations on reference tables from metadata nodes.
|
|
*/
|
|
void
|
|
LockReferencedReferenceShardDistributionMetadata(uint64 shardId, LOCKMODE lockMode)
|
|
{
|
|
Oid relationId = RelationIdForShard(shardId);
|
|
|
|
CitusTableCacheEntry *cacheEntry = GetCitusTableCacheEntry(relationId);
|
|
List *referencedRelationList = cacheEntry->referencedRelationsViaForeignKey;
|
|
List *shardIntervalList = GetSortedReferenceShardIntervals(referencedRelationList);
|
|
|
|
if (list_length(shardIntervalList) > 0 && ClusterHasKnownMetadataWorkers())
|
|
{
|
|
LockShardListMetadataOnWorkers(lockMode, shardIntervalList);
|
|
}
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
LockShardDistributionMetadata(shardInterval->shardId, lockMode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* LockReferencedReferenceShardResources acquires resource locks with the
|
|
* given lock mode on the reference tables which has a foreign key from
|
|
* the given relation.
|
|
*
|
|
* It also gets resource locks on worker nodes to prevent concurrent write
|
|
* operations on reference tables from metadata nodes.
|
|
*/
|
|
static void
|
|
LockReferencedReferenceShardResources(uint64 shardId, LOCKMODE lockMode)
|
|
{
|
|
Oid relationId = RelationIdForShard(shardId);
|
|
|
|
CitusTableCacheEntry *cacheEntry = GetCitusTableCacheEntry(relationId);
|
|
|
|
/*
|
|
* Note that referencedRelationsViaForeignKey contains transitively referenced
|
|
* relations too.
|
|
*/
|
|
List *referencedRelationList = cacheEntry->referencedRelationsViaForeignKey;
|
|
List *referencedShardIntervalList =
|
|
GetSortedReferenceShardIntervals(referencedRelationList);
|
|
|
|
if (list_length(referencedShardIntervalList) > 0 &&
|
|
ClusterHasKnownMetadataWorkers() &&
|
|
!IsFirstWorkerNode())
|
|
{
|
|
/*
|
|
* When there is metadata, all nodes can write to the reference table,
|
|
* but the writes need to be serialised. To achieve that, all nodes will
|
|
* take the shard resource lock on the first worker node via RPC, except
|
|
* for the first worker node which will just take it the regular way.
|
|
*/
|
|
LockShardListResourcesOnFirstWorker(lockMode, referencedShardIntervalList);
|
|
}
|
|
|
|
ShardInterval *referencedShardInterval = NULL;
|
|
foreach_declared_ptr(referencedShardInterval, referencedShardIntervalList)
|
|
{
|
|
LockShardResource(referencedShardInterval->shardId, lockMode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* GetSortedReferenceShardIntervals iterates through the given relation list,
|
|
* lists the shards of reference tables, and returns the list after sorting.
|
|
*/
|
|
List *
|
|
GetSortedReferenceShardIntervals(List *relationList)
|
|
{
|
|
List *shardIntervalList = NIL;
|
|
|
|
Oid relationId = InvalidOid;
|
|
foreach_declared_oid(relationId, relationList)
|
|
{
|
|
if (!IsCitusTableType(relationId, REFERENCE_TABLE))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
List *currentShardIntervalList = LoadShardIntervalList(relationId);
|
|
shardIntervalList = lappend(shardIntervalList, linitial(
|
|
currentShardIntervalList));
|
|
}
|
|
|
|
shardIntervalList = SortList(shardIntervalList, CompareShardIntervalsById);
|
|
|
|
return shardIntervalList;
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardResource acquires a lock needed to modify data on a remote shard.
|
|
* This task may be assigned to multiple backends at the same time, so the lock
|
|
* manages any concurrency issues associated with shard file fetching and DML
|
|
* command execution.
|
|
*/
|
|
void
|
|
LockShardResource(uint64 shardId, LOCKMODE lockmode)
|
|
{
|
|
LOCKTAG tag;
|
|
const bool sessionLock = false;
|
|
const bool dontWait = false;
|
|
|
|
SET_LOCKTAG_SHARD_RESOURCE(tag, MyDatabaseId, shardId);
|
|
|
|
(void) LockAcquire(&tag, lockmode, sessionLock, dontWait);
|
|
}
|
|
|
|
|
|
/* LockTransactionRecovery acquires a lock for transaction recovery */
|
|
void
|
|
LockTransactionRecovery(LOCKMODE lockmode)
|
|
{
|
|
LOCKTAG tag;
|
|
const bool sessionLock = false;
|
|
const bool dontWait = false;
|
|
|
|
SET_LOCKTAG_CITUS_OPERATION(tag, CITUS_TRANSACTION_RECOVERY);
|
|
|
|
(void) LockAcquire(&tag, lockmode, sessionLock, dontWait);
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardListMetadata takes shared locks on the metadata of all shards in
|
|
* shardIntervalList to prevents concurrent placement changes.
|
|
*/
|
|
void
|
|
LockShardListMetadata(List *shardIntervalList, LOCKMODE lockMode)
|
|
{
|
|
/* lock shards in order of shard id to prevent deadlock */
|
|
shardIntervalList = SortList(shardIntervalList, CompareShardIntervalsById);
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
int64 shardId = shardInterval->shardId;
|
|
|
|
LockShardDistributionMetadata(shardId, lockMode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardsInPlacementListMetadata takes locks on the metadata of all shards in
|
|
* shardPlacementList to prevent concurrent placement changes.
|
|
*/
|
|
void
|
|
LockShardsInPlacementListMetadata(List *shardPlacementList, LOCKMODE lockMode)
|
|
{
|
|
/* lock shards in order of shard id to prevent deadlock */
|
|
shardPlacementList =
|
|
SortList(shardPlacementList, CompareShardPlacementsByShardId);
|
|
|
|
GroupShardPlacement *placement = NULL;
|
|
foreach_declared_ptr(placement, shardPlacementList)
|
|
{
|
|
int64 shardId = placement->shardId;
|
|
|
|
LockShardDistributionMetadata(shardId, lockMode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* SerializeNonCommutativeWrites acquires the required locks to prevent concurrent
|
|
* writes on the given shards.
|
|
*
|
|
* If the modified shard is a reference table's shard and the cluster is an MX
|
|
* cluster we need to get shard resource lock on the first worker node to
|
|
* prevent divergence possibility between placements of the reference table.
|
|
*
|
|
* In other workers, by acquiring a lock on the first worker, we're serializing
|
|
* non-commutative modifications to a reference table. If the node executing the
|
|
* command is the first worker, defined via IsFirstWorker(), we skip acquiring
|
|
* the lock remotely to avoid an extra round-trip and/or self-deadlocks.
|
|
*
|
|
* Finally, if we're not dealing with reference tables on MX cluster, we'll
|
|
* always acquire the lock with LockShardListResources() call.
|
|
*/
|
|
void
|
|
SerializeNonCommutativeWrites(List *shardIntervalList, LOCKMODE lockMode)
|
|
{
|
|
if (shardIntervalList == NIL)
|
|
{
|
|
return;
|
|
}
|
|
|
|
List *replicatedShardList = NIL;
|
|
bool anyTableReplicated = AnyTableReplicated(shardIntervalList, &replicatedShardList);
|
|
|
|
/*
|
|
* Acquire locks on the modified table.
|
|
* If the table is replicated, the locks are first acquired on the first worker node then locally.
|
|
* But if we're already on the first worker, acquiring on the first worker node and locally are the same operation.
|
|
* So we only acquire locally in that case.
|
|
*/
|
|
if (anyTableReplicated && ClusterHasKnownMetadataWorkers() && !IsFirstWorkerNode())
|
|
{
|
|
LockShardListResourcesOnFirstWorker(lockMode, replicatedShardList);
|
|
}
|
|
LockShardListResources(shardIntervalList, lockMode);
|
|
|
|
/*
|
|
* Next, acquire locks on the reference tables that are referenced by a foreign key if there are any.
|
|
* Note that LockReferencedReferenceShardResources() first acquires locks on the first worker,
|
|
* then locally.
|
|
*/
|
|
if (anyTableReplicated)
|
|
{
|
|
ShardInterval *firstShardInterval =
|
|
(ShardInterval *) linitial(replicatedShardList);
|
|
if (ReferenceTableShardId(firstShardInterval->shardId))
|
|
{
|
|
/*
|
|
* Referenced tables can cascade their changes to this table, and we
|
|
* want to serialize changes to keep different replicas consistent.
|
|
*
|
|
* We currently only support foreign keys to reference tables, which are
|
|
* single shard. So, getting the first shard should be sufficient here.
|
|
*/
|
|
LockReferencedReferenceShardResources(firstShardInterval->shardId, lockMode);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* AnyTableReplicated iterates on the shard list and returns true
|
|
* if any of the shard is a replicated table. We qualify replicated
|
|
* tables as any reference table or any distributed table with
|
|
* replication factor > 1.
|
|
*
|
|
* If the optional replicatedShardIntervalList is passed, the function
|
|
* fills it with the replicated shard intervals.
|
|
*/
|
|
static bool
|
|
AnyTableReplicated(List *shardIntervalList, List **replicatedShardIntervalList)
|
|
{
|
|
List *localList = NIL;
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
int64 shardId = shardInterval->shardId;
|
|
|
|
Oid relationId = RelationIdForShard(shardId);
|
|
if (ReferenceTableShardId(shardId))
|
|
{
|
|
localList =
|
|
lappend(localList, LoadShardInterval(shardId));
|
|
}
|
|
else if (!SingleReplicatedTable(relationId))
|
|
{
|
|
localList =
|
|
lappend(localList, LoadShardInterval(shardId));
|
|
}
|
|
}
|
|
|
|
if (replicatedShardIntervalList != NULL)
|
|
{
|
|
*replicatedShardIntervalList = localList;
|
|
}
|
|
|
|
return list_length(localList) > 0;
|
|
}
|
|
|
|
|
|
/*
|
|
* LockShardListResources takes locks on all shards in shardIntervalList to
|
|
* prevent concurrent DML statements on those shards.
|
|
*/
|
|
static void
|
|
LockShardListResources(List *shardIntervalList, LOCKMODE lockMode)
|
|
{
|
|
/* lock shards in order of shard id to prevent deadlock */
|
|
shardIntervalList = SortList(shardIntervalList, CompareShardIntervalsById);
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
int64 shardId = shardInterval->shardId;
|
|
|
|
LockShardResource(shardId, lockMode);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* LockRelationShardResources takes locks on all shards in a list of RelationShards
|
|
* to prevent concurrent DML statements on those shards.
|
|
*/
|
|
void
|
|
LockRelationShardResources(List *relationShardList, LOCKMODE lockMode)
|
|
{
|
|
if (relationShardList == NIL)
|
|
{
|
|
return;
|
|
}
|
|
|
|
List *shardIntervalList = NIL;
|
|
RelationShard *relationShard = NULL;
|
|
foreach_declared_ptr(relationShard, relationShardList)
|
|
{
|
|
uint64 shardId = relationShard->shardId;
|
|
|
|
ShardInterval *shardInterval = LoadShardInterval(shardId);
|
|
|
|
shardIntervalList = lappend(shardIntervalList, shardInterval);
|
|
}
|
|
|
|
/* lock shards in a consistent order to prevent deadlock */
|
|
shardIntervalList = SortList(shardIntervalList, CompareShardIntervalsById);
|
|
SerializeNonCommutativeWrites(shardIntervalList, lockMode);
|
|
}
|
|
|
|
|
|
/*
|
|
* LockParentShardResourceIfPartition checks whether the given shard belongs
|
|
* to a partition. If it does, LockParentShardResourceIfPartition acquires a
|
|
* shard resource lock on the colocated shard of the parent table.
|
|
*/
|
|
void
|
|
LockParentShardResourceIfPartition(List *shardIntervalList, LOCKMODE lockMode)
|
|
{
|
|
List *parentShardIntervalList = NIL;
|
|
|
|
ShardInterval *shardInterval = NULL;
|
|
foreach_declared_ptr(shardInterval, shardIntervalList)
|
|
{
|
|
Oid relationId = shardInterval->relationId;
|
|
|
|
if (PartitionTable(relationId))
|
|
{
|
|
int shardIndex = ShardIndex(shardInterval);
|
|
Oid parentRelationId = PartitionParentOid(relationId);
|
|
uint64 parentShardId = ColocatedShardIdInRelation(parentRelationId,
|
|
shardIndex);
|
|
|
|
ShardInterval *parentShardInterval = LoadShardInterval(parentShardId);
|
|
parentShardIntervalList = lappend(parentShardIntervalList,
|
|
parentShardInterval);
|
|
}
|
|
}
|
|
|
|
LockShardListResources(parentShardIntervalList, lockMode);
|
|
}
|
|
|
|
|
|
/*
|
|
* LockModeTextToLockMode gets a lockMode name and returns its corresponding LOCKMODE.
|
|
* The function errors out if the input lock mode isn't defined in the PostgreSQL's
|
|
* explicit locking table.
|
|
*/
|
|
LOCKMODE
|
|
LockModeTextToLockMode(const char *lockModeName)
|
|
{
|
|
LOCKMODE lockMode = -1;
|
|
|
|
for (int lockIndex = 0; lockIndex < lock_mode_to_string_map_count; lockIndex++)
|
|
{
|
|
const struct LockModeToStringType *lockMap = lockmode_to_string_map + lockIndex;
|
|
if (pg_strncasecmp(lockMap->name, lockModeName, NAMEDATALEN) == 0)
|
|
{
|
|
lockMode = lockMap->lockMode;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* we could not find the lock mode we are looking for */
|
|
if (lockMode == -1)
|
|
{
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_LOCK_NOT_AVAILABLE),
|
|
errmsg("unknown lock mode: %s", lockModeName)));
|
|
}
|
|
|
|
return lockMode;
|
|
}
|
|
|
|
|
|
/*
|
|
* LockModeToLockModeText gets a lockMode enum and returns its corresponding text
|
|
* representation.
|
|
* The function errors out if the input lock mode isn't defined in the PostgreSQL's
|
|
* explicit locking table.
|
|
*/
|
|
const char *
|
|
LockModeToLockModeText(LOCKMODE lockMode)
|
|
{
|
|
const char *lockModeText = NULL;
|
|
|
|
for (int lockIndex = 0; lockIndex < lock_mode_to_string_map_count; lockIndex++)
|
|
{
|
|
const struct LockModeToStringType *lockMap = lockmode_to_string_map + lockIndex;
|
|
if (lockMode == lockMap->lockMode)
|
|
{
|
|
lockModeText = lockMap->name;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* we could not find the lock mode we are looking for */
|
|
if (lockModeText == NULL)
|
|
{
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_LOCK_NOT_AVAILABLE),
|
|
errmsg("unknown lock mode enum: %d", (int) lockMode)));
|
|
}
|
|
|
|
return lockModeText;
|
|
}
|
|
|
|
|
|
/*
|
|
* lock_relation_if_exists gets a relation name and lock mode
|
|
* and returns true if the relation exists and can be locked with
|
|
* the given lock mode. If the relation doesn't exists, the function
|
|
* return false.
|
|
*
|
|
* The relation name should be qualified with the schema name.
|
|
*
|
|
* The function errors out if the lockmode isn't defined in the PostgreSQL's
|
|
* explicit locking table.
|
|
*/
|
|
Datum
|
|
lock_relation_if_exists(PG_FUNCTION_ARGS)
|
|
{
|
|
text *relationName = PG_GETARG_TEXT_P(0);
|
|
text *lockModeText = PG_GETARG_TEXT_P(1);
|
|
char *lockModeCString = text_to_cstring(lockModeText);
|
|
|
|
/* get the lock mode */
|
|
LOCKMODE lockMode = LockModeTextToLockMode(lockModeCString);
|
|
|
|
/* resolve relationId from passed in schema and relation name */
|
|
List *relationNameList = textToQualifiedNameList(relationName);
|
|
RangeVar *relation = makeRangeVarFromNameList(relationNameList);
|
|
|
|
/* lock the relation with the lock mode */
|
|
Oid relationId = RangeVarGetRelidExtended(relation, lockMode, RVR_MISSING_OK,
|
|
CitusRangeVarCallbackForLockTable,
|
|
(void *) &lockMode);
|
|
bool relationExists = OidIsValid(relationId);
|
|
PG_RETURN_BOOL(relationExists);
|
|
}
|
|
|
|
|
|
/*
|
|
* CitusRangeVarCallbackForLockTable is a callback for RangeVarGetRelidExtended used
|
|
* to check whether the user has permission to lock a table in a particular mode.
|
|
*
|
|
* This function is a copy of RangeVarCallbackForLockTable in lockcmds.c adapted to
|
|
* Citus code style.
|
|
*/
|
|
static void
|
|
CitusRangeVarCallbackForLockTable(const RangeVar *rangeVar, Oid relationId,
|
|
Oid oldRelationId, void *arg)
|
|
{
|
|
LOCKMODE lockmode = *(LOCKMODE *) arg;
|
|
|
|
if (!OidIsValid(relationId))
|
|
{
|
|
/* table doesn't exist, so no permissions check */
|
|
return;
|
|
}
|
|
|
|
/* we only allow tables, views and foreign tables to be locked */
|
|
if (!RegularTable(relationId) && !IsForeignTable(relationId))
|
|
{
|
|
ereport(ERROR, (errcode(ERRCODE_WRONG_OBJECT_TYPE),
|
|
errmsg("\"%s\" is not a table", rangeVar->relname)));
|
|
}
|
|
|
|
/* check permissions */
|
|
AclResult aclResult = CitusLockTableAclCheck(relationId, lockmode, GetUserId());
|
|
if (aclResult != ACLCHECK_OK)
|
|
{
|
|
aclcheck_error(aclResult, get_relkind_objtype(get_rel_relkind(relationId)),
|
|
rangeVar->relname);
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* CitusLockTableAclCheck checks whether a user has permission to lock a relation
|
|
* in the given lock mode.
|
|
*
|
|
* This function is a copy of LockTableAclCheck in lockcmds.c adapted to Citus
|
|
* code style.
|
|
*/
|
|
static AclResult
|
|
CitusLockTableAclCheck(Oid relationId, LOCKMODE lockmode, Oid userId)
|
|
{
|
|
AclMode aclMask;
|
|
|
|
/* verify adequate privilege */
|
|
if (lockmode == AccessShareLock)
|
|
{
|
|
aclMask = ACL_SELECT;
|
|
}
|
|
else if (lockmode == RowExclusiveLock)
|
|
{
|
|
aclMask = ACL_INSERT | ACL_UPDATE | ACL_DELETE | ACL_TRUNCATE;
|
|
}
|
|
else
|
|
{
|
|
aclMask = ACL_UPDATE | ACL_DELETE | ACL_TRUNCATE;
|
|
}
|
|
|
|
AclResult aclResult = pg_class_aclcheck(relationId, userId, aclMask);
|
|
|
|
return aclResult;
|
|
}
|
|
|
|
|
|
/*
|
|
* EnsureCanAcquireLock checks if currect user has the permissions
|
|
* to acquire a lock on the table and throws an error if the user does
|
|
* not have the permissions
|
|
*/
|
|
static void
|
|
EnsureCanAcquireLock(Oid relationId, LOCKMODE lockMode)
|
|
{
|
|
AclResult aclResult = CitusLockTableAclCheck(relationId, lockMode,
|
|
GetUserId());
|
|
if (aclResult != ACLCHECK_OK)
|
|
{
|
|
aclcheck_error(aclResult,
|
|
get_relkind_objtype(get_rel_relkind(relationId)),
|
|
get_rel_name(relationId));
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* CreateLockTerminationString creates a string that can be appended to the
|
|
* end of a partial lock command to properly terminate the command
|
|
*/
|
|
static const char *
|
|
CreateLockTerminationString(const char *lockModeText, bool nowait)
|
|
{
|
|
StringInfo lockTerminationStringInfo = makeStringInfo();
|
|
appendStringInfo(lockTerminationStringInfo, nowait ? " IN %s MODE NOWAIT;\n" :
|
|
" IN %s MODE;\n", lockModeText);
|
|
return lockTerminationStringInfo->data;
|
|
}
|
|
|
|
|
|
/*
|
|
* FinishLockCommandIfNecessary appends the lock termination string if the lock command is partial.
|
|
* Sets the partialLockCommand flag to false
|
|
*/
|
|
static void
|
|
FinishLockCommandIfNecessary(StringInfo lockCommand, const char *lockTerminationString,
|
|
bool *partialLockCommand)
|
|
{
|
|
if (*partialLockCommand)
|
|
{
|
|
appendStringInfo(lockCommand, "%s", lockTerminationString);
|
|
}
|
|
|
|
*partialLockCommand = false;
|
|
}
|
|
|
|
|
|
/*
|
|
* LockRelationRecordListMember checks if a relation id is present in the
|
|
* LockRelationRecord list
|
|
*/
|
|
static bool
|
|
LockRelationRecordListMember(List *lockRelationRecordList, Oid relationId)
|
|
{
|
|
LockRelationRecord *record = NULL;
|
|
foreach_declared_ptr(record, lockRelationRecordList)
|
|
{
|
|
if (record->relationId == relationId)
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
/*
|
|
* MakeLockRelationRecord makes a LockRelationRecord using the relation oid
|
|
* and the inh boolean while properly allocating the structure
|
|
*/
|
|
static LockRelationRecord *
|
|
MakeLockRelationRecord(Oid relationId, bool inh)
|
|
{
|
|
LockRelationRecord *lockRelationRecord = palloc(sizeof(LockRelationRecord));
|
|
lockRelationRecord->relationId = relationId;
|
|
lockRelationRecord->inh = inh;
|
|
return lockRelationRecord;
|
|
}
|
|
|
|
|
|
/*
|
|
* ConcatLockRelationRecordList concats a list of LockRelationRecord with
|
|
* another list of LockRelationRecord created from a list of relation oid-s
|
|
* which are not present in the first list and an inh bool which will be
|
|
* applied across all LockRelationRecords
|
|
*/
|
|
static List *
|
|
ConcatLockRelationRecordList(List *lockRelationRecordList, List *relationOidList, bool
|
|
inh)
|
|
{
|
|
List *constructedList = NIL;
|
|
|
|
Oid relationId = InvalidOid;
|
|
foreach_declared_oid(relationId, relationOidList)
|
|
{
|
|
if (!LockRelationRecordListMember(lockRelationRecordList, relationId))
|
|
{
|
|
LockRelationRecord *record = MakeLockRelationRecord(relationId, inh);
|
|
constructedList = lappend(constructedList, (void *) record);
|
|
}
|
|
}
|
|
|
|
return list_concat(lockRelationRecordList, constructedList);
|
|
}
|
|
|
|
|
|
/*
|
|
* AcquireDistributedLockOnRelations_Internal acquire a distributed lock on worker nodes
|
|
* for given list of relations ids. Worker node list is sorted so that the lock
|
|
* is acquired in the same order regardless of which node it was run on.
|
|
*
|
|
* A nowait flag is used to require the locks to be available immediately
|
|
* and if that is not the case, an error will be thrown
|
|
*
|
|
* Notice that no validation or filtering is done on the relationIds, that is the responsibility
|
|
* of this function's caller.
|
|
*/
|
|
static void
|
|
AcquireDistributedLockOnRelations_Internal(List *lockRelationRecordList,
|
|
LOCKMODE lockMode, bool nowait)
|
|
{
|
|
const char *lockModeText = LockModeToLockModeText(lockMode);
|
|
|
|
UseCoordinatedTransaction();
|
|
|
|
StringInfo lockRelationsCommand = makeStringInfo();
|
|
appendStringInfo(lockRelationsCommand, "%s;\n", DISABLE_DDL_PROPAGATION);
|
|
|
|
/*
|
|
* In the following loop, when there are foreign tables, we need to switch from
|
|
* LOCK * statement to lock_relation_if_exists() and vice versa since pg
|
|
* does not support using LOCK on foreign tables.
|
|
*/
|
|
bool startedLockCommand = false;
|
|
|
|
/* create a lock termination string used to terminate a partial lock command */
|
|
const char *lockTerminationString = CreateLockTerminationString(lockModeText, nowait);
|
|
|
|
int lockedRelations = 0;
|
|
LockRelationRecord *lockRelationRecord;
|
|
foreach_declared_ptr(lockRelationRecord, lockRelationRecordList)
|
|
{
|
|
Oid relationId = lockRelationRecord->relationId;
|
|
bool lockDescendants = lockRelationRecord->inh;
|
|
char *qualifiedRelationName = generate_qualified_relation_name(relationId);
|
|
|
|
/*
|
|
* As of pg14 we cannot use LOCK to lock a FOREIGN TABLE
|
|
* so we have to use the lock_relation_if_exist udf
|
|
*/
|
|
if (get_rel_relkind(relationId) == RELKIND_FOREIGN_TABLE)
|
|
{
|
|
FinishLockCommandIfNecessary(lockRelationsCommand, lockTerminationString,
|
|
&startedLockCommand);
|
|
|
|
/*
|
|
* The user should not be able to trigger this codepath
|
|
* with nowait = true or lockDescendants = false since the
|
|
* only way to do that is calling LOCK * IN * MODE NOWAIT;
|
|
* and LOCK ONLY * IN * MODE; respectively but foreign tables
|
|
* cannot be locked with LOCK command as of pg14
|
|
*/
|
|
Assert(nowait == false);
|
|
Assert(lockDescendants == true);
|
|
|
|
/* use lock_relation_if_exits to lock foreign table */
|
|
appendStringInfo(lockRelationsCommand, LOCK_RELATION_IF_EXISTS,
|
|
quote_literal_cstr(qualifiedRelationName),
|
|
quote_literal_cstr(lockModeText));
|
|
appendStringInfoChar(lockRelationsCommand, '\n');
|
|
}
|
|
else if (startedLockCommand)
|
|
{
|
|
/* append relation to partial lock statement */
|
|
appendStringInfo(lockRelationsCommand, ",%s%s",
|
|
lockDescendants ? " " : " ONLY ",
|
|
qualifiedRelationName);
|
|
}
|
|
else
|
|
{
|
|
/* start a new partial lock statement */
|
|
appendStringInfo(lockRelationsCommand, "LOCK%s%s",
|
|
lockDescendants ? " " : " ONLY ",
|
|
qualifiedRelationName);
|
|
startedLockCommand = true;
|
|
}
|
|
|
|
lockedRelations++;
|
|
}
|
|
|
|
if (lockedRelations == 0)
|
|
{
|
|
return;
|
|
}
|
|
|
|
FinishLockCommandIfNecessary(lockRelationsCommand, lockTerminationString,
|
|
&startedLockCommand);
|
|
|
|
appendStringInfo(lockRelationsCommand, ENABLE_DDL_PROPAGATION);
|
|
char *lockCommand = lockRelationsCommand->data;
|
|
|
|
List *workerNodeList = TargetWorkerSetNodeList(METADATA_NODES, NoLock);
|
|
|
|
/*
|
|
* We want to acquire locks in the same order across the nodes.
|
|
* Although relation ids may change, their ordering will not.
|
|
*/
|
|
workerNodeList = SortList(workerNodeList, CompareWorkerNodes);
|
|
|
|
int32 localGroupId = GetLocalGroupId();
|
|
|
|
WorkerNode *workerNode = NULL;
|
|
const char *currentUser = CurrentUserName();
|
|
foreach_declared_ptr(workerNode, workerNodeList)
|
|
{
|
|
/* if local node is one of the targets, acquire the lock locally */
|
|
if (workerNode->groupId == localGroupId)
|
|
{
|
|
ExecuteUtilityCommand(lockCommand);
|
|
continue;
|
|
}
|
|
|
|
SendMetadataCommandListToWorkerListInCoordinatedTransaction(list_make1(
|
|
workerNode),
|
|
currentUser,
|
|
list_make1(
|
|
lockCommand));
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* AcquireDistributedLockOnRelations filters relations before passing them to
|
|
* AcquireDistributedLockOnRelations_Internal to acquire the locks.
|
|
*
|
|
* Only tables, views, and foreign tables can be locked with this function. Other relations
|
|
* will cause an error.
|
|
*
|
|
* Skips non distributed relations.
|
|
* configs parameter is used to configure what relation will be locked and if the lock
|
|
* should throw an error if it cannot be acquired immediately
|
|
*/
|
|
void
|
|
AcquireDistributedLockOnRelations(List *relationList, LOCKMODE lockMode, uint32 configs)
|
|
{
|
|
if (!ClusterHasKnownMetadataWorkers() || !EnableMetadataSync || !EnableDDLPropagation)
|
|
{
|
|
return;
|
|
}
|
|
|
|
/* used to store the relations that will be locked */
|
|
List *distributedRelationRecordsList = NIL;
|
|
|
|
bool nowait = (configs & DIST_LOCK_NOWAIT) > 0;
|
|
|
|
RangeVar *rangeVar = NULL;
|
|
foreach_declared_ptr(rangeVar, relationList)
|
|
{
|
|
Oid relationId = RangeVarGetRelid(rangeVar, NoLock, false);
|
|
|
|
LockRelationRecord *lockRelationRecord = MakeLockRelationRecord(relationId,
|
|
rangeVar->inh);
|
|
|
|
/*
|
|
* Note that allowing the user to lock shards could lead to
|
|
* distributed deadlocks due to shards not being locked when
|
|
* a distributed table is locked.
|
|
* However, because citus.enable_manual_changes_to_shards
|
|
* is a guc which is not visible by default, whoever is using this
|
|
* guc will hopefully know what they're doing and avoid such scenarios.
|
|
*/
|
|
ErrorIfIllegallyChangingKnownShard(relationId);
|
|
|
|
/*
|
|
* we want to prevent under privileged users to trigger establishing connections,
|
|
* that's why we have this additional check. Otherwise, we'd get the errors as
|
|
* soon as we execute the command on any node
|
|
*/
|
|
EnsureCanAcquireLock(relationId, lockMode);
|
|
|
|
bool isView = get_rel_relkind(relationId) == RELKIND_VIEW;
|
|
if ((isView && !IsViewDistributed(relationId)) ||
|
|
(!isView && !ShouldSyncTableMetadata(relationId)))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
if (!LockRelationRecordListMember(distributedRelationRecordsList, relationId))
|
|
{
|
|
distributedRelationRecordsList = lappend(distributedRelationRecordsList,
|
|
(void *) lockRelationRecord);
|
|
}
|
|
|
|
char relkind = get_rel_relkind(relationId);
|
|
bool relationCanBeReferenced = (relkind == RELKIND_RELATION ||
|
|
relkind == RELKIND_PARTITIONED_TABLE);
|
|
if (relationCanBeReferenced &&
|
|
(configs & DIST_LOCK_REFERENCING_TABLES) > 0)
|
|
{
|
|
CitusTableCacheEntry *cacheEntry = GetCitusTableCacheEntry(relationId);
|
|
Assert(cacheEntry != NULL);
|
|
|
|
List *referencingTableList = cacheEntry->referencingRelationsViaForeignKey;
|
|
|
|
/* remove the relations which should not be synced */
|
|
referencingTableList = list_filter_oid(referencingTableList,
|
|
&ShouldSyncTableMetadata);
|
|
|
|
distributedRelationRecordsList = ConcatLockRelationRecordList(
|
|
distributedRelationRecordsList, referencingTableList, true);
|
|
}
|
|
}
|
|
|
|
if (distributedRelationRecordsList != NIL)
|
|
{
|
|
if (!IsCoordinator() && !CoordinatorAddedAsWorkerNode() &&
|
|
!EnableAcquiringUnsafeLockFromWorkers)
|
|
{
|
|
ereport(ERROR,
|
|
(errmsg(
|
|
"Cannot acquire a distributed lock from a worker node since the "
|
|
"coordinator is not in the metadata."),
|
|
errhint(
|
|
"Either run this command on the coordinator or add the coordinator "
|
|
"in the metadata by using: SELECT citus_set_coordinator_host('<hostname>', <port>);\n"
|
|
"Alternatively, though it is not recommended, you can allow this command by running: "
|
|
"SET citus.allow_unsafe_locks_from_workers TO 'on';")));
|
|
}
|
|
|
|
AcquireDistributedLockOnRelations_Internal(distributedRelationRecordsList,
|
|
lockMode, nowait);
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* PreprocessLockStatement makes sure that the lock is allowed
|
|
* before calling AcquireDistributedLockOnRelations on the locked tables/views
|
|
* with flags DIST_LOCK_VIEWS_RECUR and DIST_LOCK_NOWAIT if nowait is true for
|
|
* the lock statement
|
|
*/
|
|
void
|
|
PreprocessLockStatement(LockStmt *stmt, ProcessUtilityContext context)
|
|
{
|
|
bool isTopLevel = context == PROCESS_UTILITY_TOPLEVEL;
|
|
RequireTransactionBlock(isTopLevel, "LOCK TABLE");
|
|
|
|
uint32 nowaitFlag = stmt->nowait ? DIST_LOCK_NOWAIT : 0;
|
|
AcquireDistributedLockOnRelations(stmt->relations, stmt->mode, nowaitFlag);
|
|
}
|