aboutsummaryrefslogtreecommitdiff
path: root/src/backend/access/heap/heapam.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/backend/access/heap/heapam.c')
-rw-r--r--src/backend/access/heap/heapam.c100
1 files changed, 63 insertions, 37 deletions
diff --git a/src/backend/access/heap/heapam.c b/src/backend/access/heap/heapam.c
index 4e9c0ff8bba..35ad3d88ac3 100644
--- a/src/backend/access/heap/heapam.c
+++ b/src/backend/access/heap/heapam.c
@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
- * $PostgreSQL: pgsql/src/backend/access/heap/heapam.c,v 1.200.2.2 2005/11/22 18:23:03 momjian Exp $
+ * $PostgreSQL: pgsql/src/backend/access/heap/heapam.c,v 1.200.2.3 2006/11/17 18:00:25 tgl Exp $
*
*
* INTERFACE ROUTINES
@@ -2080,6 +2080,8 @@ heap_lock_tuple(Relation relation, HeapTuple tuple, Buffer *buffer,
ItemId lp;
PageHeader dp;
TransactionId xid;
+ TransactionId xmax;
+ uint16 old_infomask;
uint16 new_infomask;
LOCKMODE tuple_lock_type;
bool have_tuple_lock = false;
@@ -2119,6 +2121,25 @@ l3:
LockBuffer(*buffer, BUFFER_LOCK_UNLOCK);
/*
+ * If we wish to acquire share lock, and the tuple is already
+ * share-locked by a multixact that includes any subtransaction of the
+ * current top transaction, then we effectively hold the desired lock
+ * already. We *must* succeed without trying to take the tuple lock,
+ * else we will deadlock against anyone waiting to acquire exclusive
+ * lock. We don't need to make any state changes in this case.
+ */
+ if (mode == LockTupleShared &&
+ (infomask & HEAP_XMAX_IS_MULTI) &&
+ MultiXactIdIsCurrent((MultiXactId) xwait))
+ {
+ Assert(infomask & HEAP_XMAX_SHARED_LOCK);
+ /* Probably can't hold tuple lock here, but may as well check */
+ if (have_tuple_lock)
+ UnlockTuple(relation, tid, tuple_lock_type);
+ return HeapTupleMayBeUpdated;
+ }
+
+ /*
* Acquire tuple lock to establish our priority for the tuple.
* LockTuple will release us when we are next-in-line for the tuple.
* We must do this even if we are share-locking.
@@ -2256,25 +2277,49 @@ l3:
}
/*
+ * We might already hold the desired lock (or stronger), possibly under
+ * a different subtransaction of the current top transaction. If so,
+ * there is no need to change state or issue a WAL record. We already
+ * handled the case where this is true for xmax being a MultiXactId,
+ * so now check for cases where it is a plain TransactionId.
+ *
+ * Note in particular that this covers the case where we already hold
+ * exclusive lock on the tuple and the caller only wants shared lock.
+ * It would certainly not do to give up the exclusive lock.
+ */
+ xmax = HeapTupleHeaderGetXmax(tuple->t_data);
+ old_infomask = tuple->t_data->t_infomask;
+
+ if (!(old_infomask & (HEAP_XMAX_INVALID |
+ HEAP_XMAX_COMMITTED |
+ HEAP_XMAX_IS_MULTI)) &&
+ (mode == LockTupleShared ?
+ (old_infomask & HEAP_IS_LOCKED) :
+ (old_infomask & HEAP_XMAX_EXCL_LOCK)) &&
+ TransactionIdIsCurrentTransactionId(xmax))
+ {
+ LockBuffer(*buffer, BUFFER_LOCK_UNLOCK);
+ /* Probably can't hold tuple lock here, but may as well check */
+ if (have_tuple_lock)
+ UnlockTuple(relation, tid, tuple_lock_type);
+ return HeapTupleMayBeUpdated;
+ }
+
+ /*
* Compute the new xmax and infomask to store into the tuple. Note we do
* not modify the tuple just yet, because that would leave it in the wrong
* state if multixact.c elogs.
*/
xid = GetCurrentTransactionId();
- new_infomask = tuple->t_data->t_infomask;
-
- new_infomask &= ~(HEAP_XMAX_COMMITTED |
- HEAP_XMAX_INVALID |
- HEAP_XMAX_IS_MULTI |
- HEAP_IS_LOCKED |
- HEAP_MOVED);
+ new_infomask = old_infomask & ~(HEAP_XMAX_COMMITTED |
+ HEAP_XMAX_INVALID |
+ HEAP_XMAX_IS_MULTI |
+ HEAP_IS_LOCKED |
+ HEAP_MOVED);
if (mode == LockTupleShared)
{
- TransactionId xmax = HeapTupleHeaderGetXmax(tuple->t_data);
- uint16 old_infomask = tuple->t_data->t_infomask;
-
/*
* If this is the first acquisition of a shared lock in the current
* transaction, set my per-backend OldestMemberMXactId setting. We can
@@ -2315,32 +2360,13 @@ l3:
}
else if (TransactionIdIsInProgress(xmax))
{
- if (TransactionIdEquals(xmax, xid))
- {
- /*
- * If the old locker is ourselves, we'll just mark the
- * tuple again with our own TransactionId. However we
- * have to consider the possibility that we had exclusive
- * rather than shared lock before --- if so, be careful to
- * preserve the exclusivity of the lock.
- */
- if (!(old_infomask & HEAP_XMAX_SHARED_LOCK))
- {
- new_infomask &= ~HEAP_XMAX_SHARED_LOCK;
- new_infomask |= HEAP_XMAX_EXCL_LOCK;
- mode = LockTupleExclusive;
- }
- }
- else
- {
- /*
- * If the Xmax is a valid TransactionId, then we need to
- * create a new MultiXactId that includes both the old
- * locker and our own TransactionId.
- */
- xid = MultiXactIdCreate(xmax, xid);
- new_infomask |= HEAP_XMAX_IS_MULTI;
- }
+ /*
+ * If the XMAX is a valid TransactionId, then we need to
+ * create a new MultiXactId that includes both the old
+ * locker and our own TransactionId.
+ */
+ xid = MultiXactIdCreate(xmax, xid);
+ new_infomask |= HEAP_XMAX_IS_MULTI;
}
else
{