PostgreSQL Source Code git master
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
lmgr.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * lmgr.c
4 * POSTGRES lock manager code
5 *
6 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1994, Regents of the University of California
8 *
9 *
10 * IDENTIFICATION
11 * src/backend/storage/lmgr/lmgr.c
12 *
13 *-------------------------------------------------------------------------
14 */
15
16#include "postgres.h"
17
18#include "access/subtrans.h"
19#include "access/xact.h"
20#include "catalog/catalog.h"
21#include "commands/progress.h"
22#include "miscadmin.h"
23#include "pgstat.h"
24#include "storage/lmgr.h"
25#include "storage/proc.h"
26#include "storage/procarray.h"
27#include "utils/inval.h"
28
29
30/*
31 * Per-backend counter for generating speculative insertion tokens.
32 *
33 * This may wrap around, but that's OK as it's only used for the short
34 * duration between inserting a tuple and checking that there are no (unique)
35 * constraint violations. It's theoretically possible that a backend sees a
36 * tuple that was speculatively inserted by another backend, but before it has
37 * started waiting on the token, the other backend completes its insertion,
38 * and then performs 2^32 unrelated insertions. And after all that, the
39 * first backend finally calls SpeculativeInsertionLockAcquire(), with the
40 * intention of waiting for the first insertion to complete, but ends up
41 * waiting for the latest unrelated insertion instead. Even then, nothing
42 * particularly bad happens: in the worst case they deadlock, causing one of
43 * the transactions to abort.
44 */
46
47
48/*
49 * Struct to hold context info for transaction lock waits.
50 *
51 * 'oper' is the operation that needs to wait for the other transaction; 'rel'
52 * and 'ctid' specify the address of the tuple being waited for.
53 */
55{
60
61static void XactLockTableWaitErrorCb(void *arg);
62
63/*
64 * RelationInitLockInfo
65 * Initializes the lock information in a relation descriptor.
66 *
67 * relcache.c must call this during creation of any reldesc.
68 */
69void
71{
72 Assert(RelationIsValid(relation));
74
75 relation->rd_lockInfo.lockRelId.relId = RelationGetRelid(relation);
76
77 if (relation->rd_rel->relisshared)
79 else
81}
82
83/*
84 * SetLocktagRelationOid
85 * Set up a locktag for a relation, given only relation OID
86 */
87static inline void
89{
90 Oid dbid;
91
92 if (IsSharedRelation(relid))
93 dbid = InvalidOid;
94 else
95 dbid = MyDatabaseId;
96
97 SET_LOCKTAG_RELATION(*tag, dbid, relid);
98}
99
100/*
101 * LockRelationOid
102 *
103 * Lock a relation given only its OID. This should generally be used
104 * before attempting to open the relation's relcache entry.
105 */
106void
108{
109 LOCKTAG tag;
110 LOCALLOCK *locallock;
112
113 SetLocktagRelationOid(&tag, relid);
114
115 res = LockAcquireExtended(&tag, lockmode, false, false, true, &locallock,
116 false);
117
118 /*
119 * Now that we have the lock, check for invalidation messages, so that we
120 * will update or flush any stale relcache entry before we try to use it.
121 * RangeVarGetRelid() specifically relies on us for this. We can skip
122 * this in the not-uncommon case that we already had the same type of lock
123 * being requested, since then no one else could have modified the
124 * relcache entry in an undesirable way. (In the case where our own xact
125 * modifies the rel, the relcache update happens via
126 * CommandCounterIncrement, not here.)
127 *
128 * However, in corner cases where code acts on tables (usually catalogs)
129 * recursively, we might get here while still processing invalidation
130 * messages in some outer execution of this function or a sibling. The
131 * "cleared" status of the lock tells us whether we really are done
132 * absorbing relevant inval messages.
133 */
134 if (res != LOCKACQUIRE_ALREADY_CLEAR)
135 {
137 MarkLockClear(locallock);
138 }
139}
140
141/*
142 * ConditionalLockRelationOid
143 *
144 * As above, but only lock if we can get the lock without blocking.
145 * Returns true iff the lock was acquired.
146 *
147 * NOTE: we do not currently need conditional versions of all the
148 * LockXXX routines in this file, but they could easily be added if needed.
149 */
150bool
152{
153 LOCKTAG tag;
154 LOCALLOCK *locallock;
156
157 SetLocktagRelationOid(&tag, relid);
158
159 res = LockAcquireExtended(&tag, lockmode, false, true, true, &locallock,
160 false);
161
162 if (res == LOCKACQUIRE_NOT_AVAIL)
163 return false;
164
165 /*
166 * Now that we have the lock, check for invalidation messages; see notes
167 * in LockRelationOid.
168 */
169 if (res != LOCKACQUIRE_ALREADY_CLEAR)
170 {
172 MarkLockClear(locallock);
173 }
174
175 return true;
176}
177
178/*
179 * LockRelationId
180 *
181 * Lock, given a LockRelId. Same as LockRelationOid but take LockRelId as an
182 * input.
183 */
184void
186{
187 LOCKTAG tag;
188 LOCALLOCK *locallock;
190
191 SET_LOCKTAG_RELATION(tag, relid->dbId, relid->relId);
192
193 res = LockAcquireExtended(&tag, lockmode, false, false, true, &locallock,
194 false);
195
196 /*
197 * Now that we have the lock, check for invalidation messages; see notes
198 * in LockRelationOid.
199 */
200 if (res != LOCKACQUIRE_ALREADY_CLEAR)
201 {
203 MarkLockClear(locallock);
204 }
205}
206
207/*
208 * UnlockRelationId
209 *
210 * Unlock, given a LockRelId. This is preferred over UnlockRelationOid
211 * for speed reasons.
212 */
213void
215{
216 LOCKTAG tag;
217
218 SET_LOCKTAG_RELATION(tag, relid->dbId, relid->relId);
219
220 LockRelease(&tag, lockmode, false);
221}
222
223/*
224 * UnlockRelationOid
225 *
226 * Unlock, given only a relation Oid. Use UnlockRelationId if you can.
227 */
228void
230{
231 LOCKTAG tag;
232
233 SetLocktagRelationOid(&tag, relid);
234
235 LockRelease(&tag, lockmode, false);
236}
237
238/*
239 * LockRelation
240 *
241 * This is a convenience routine for acquiring an additional lock on an
242 * already-open relation. Never try to do "relation_open(foo, NoLock)"
243 * and then lock with this.
244 */
245void
246LockRelation(Relation relation, LOCKMODE lockmode)
247{
248 LOCKTAG tag;
249 LOCALLOCK *locallock;
251
253 relation->rd_lockInfo.lockRelId.dbId,
254 relation->rd_lockInfo.lockRelId.relId);
255
256 res = LockAcquireExtended(&tag, lockmode, false, false, true, &locallock,
257 false);
258
259 /*
260 * Now that we have the lock, check for invalidation messages; see notes
261 * in LockRelationOid.
262 */
263 if (res != LOCKACQUIRE_ALREADY_CLEAR)
264 {
266 MarkLockClear(locallock);
267 }
268}
269
270/*
271 * ConditionalLockRelation
272 *
273 * This is a convenience routine for acquiring an additional lock on an
274 * already-open relation. Never try to do "relation_open(foo, NoLock)"
275 * and then lock with this.
276 */
277bool
279{
280 LOCKTAG tag;
281 LOCALLOCK *locallock;
283
285 relation->rd_lockInfo.lockRelId.dbId,
286 relation->rd_lockInfo.lockRelId.relId);
287
288 res = LockAcquireExtended(&tag, lockmode, false, true, true, &locallock,
289 false);
290
291 if (res == LOCKACQUIRE_NOT_AVAIL)
292 return false;
293
294 /*
295 * Now that we have the lock, check for invalidation messages; see notes
296 * in LockRelationOid.
297 */
298 if (res != LOCKACQUIRE_ALREADY_CLEAR)
299 {
301 MarkLockClear(locallock);
302 }
303
304 return true;
305}
306
307/*
308 * UnlockRelation
309 *
310 * This is a convenience routine for unlocking a relation without also
311 * closing it.
312 */
313void
315{
316 LOCKTAG tag;
317
319 relation->rd_lockInfo.lockRelId.dbId,
320 relation->rd_lockInfo.lockRelId.relId);
321
322 LockRelease(&tag, lockmode, false);
323}
324
325/*
326 * CheckRelationLockedByMe
327 *
328 * Returns true if current transaction holds a lock on 'relation' of mode
329 * 'lockmode'. If 'orstronger' is true, a stronger lockmode is also OK.
330 * ("Stronger" is defined as "numerically higher", which is a bit
331 * semantically dubious but is OK for the purposes we use this for.)
332 */
333bool
334CheckRelationLockedByMe(Relation relation, LOCKMODE lockmode, bool orstronger)
335{
336 LOCKTAG tag;
337
339 relation->rd_lockInfo.lockRelId.dbId,
340 relation->rd_lockInfo.lockRelId.relId);
341
342 return LockHeldByMe(&tag, lockmode, orstronger);
343}
344
345/*
346 * CheckRelationOidLockedByMe
347 *
348 * Like the above, but takes an OID as argument.
349 */
350bool
351CheckRelationOidLockedByMe(Oid relid, LOCKMODE lockmode, bool orstronger)
352{
353 LOCKTAG tag;
354
355 SetLocktagRelationOid(&tag, relid);
356
357 return LockHeldByMe(&tag, lockmode, orstronger);
358}
359
360/*
361 * LockHasWaitersRelation
362 *
363 * This is a function to check whether someone else is waiting for a
364 * lock which we are currently holding.
365 */
366bool
368{
369 LOCKTAG tag;
370
372 relation->rd_lockInfo.lockRelId.dbId,
373 relation->rd_lockInfo.lockRelId.relId);
374
375 return LockHasWaiters(&tag, lockmode, false);
376}
377
378/*
379 * LockRelationIdForSession
380 *
381 * This routine grabs a session-level lock on the target relation. The
382 * session lock persists across transaction boundaries. It will be removed
383 * when UnlockRelationIdForSession() is called, or if an ereport(ERROR) occurs,
384 * or if the backend exits.
385 *
386 * Note that one should also grab a transaction-level lock on the rel
387 * in any transaction that actually uses the rel, to ensure that the
388 * relcache entry is up to date.
389 */
390void
392{
393 LOCKTAG tag;
394
395 SET_LOCKTAG_RELATION(tag, relid->dbId, relid->relId);
396
397 (void) LockAcquire(&tag, lockmode, true, false);
398}
399
400/*
401 * UnlockRelationIdForSession
402 */
403void
405{
406 LOCKTAG tag;
407
408 SET_LOCKTAG_RELATION(tag, relid->dbId, relid->relId);
409
410 LockRelease(&tag, lockmode, true);
411}
412
413/*
414 * LockRelationForExtension
415 *
416 * This lock tag is used to interlock addition of pages to relations.
417 * We need such locking because bufmgr/smgr definition of P_NEW is not
418 * race-condition-proof.
419 *
420 * We assume the caller is already holding some type of regular lock on
421 * the relation, so no AcceptInvalidationMessages call is needed here.
422 */
423void
425{
426 LOCKTAG tag;
427
429 relation->rd_lockInfo.lockRelId.dbId,
430 relation->rd_lockInfo.lockRelId.relId);
431
432 (void) LockAcquire(&tag, lockmode, false, false);
433}
434
435/*
436 * ConditionalLockRelationForExtension
437 *
438 * As above, but only lock if we can get the lock without blocking.
439 * Returns true iff the lock was acquired.
440 */
441bool
443{
444 LOCKTAG tag;
445
447 relation->rd_lockInfo.lockRelId.dbId,
448 relation->rd_lockInfo.lockRelId.relId);
449
450 return (LockAcquire(&tag, lockmode, false, true) != LOCKACQUIRE_NOT_AVAIL);
451}
452
453/*
454 * RelationExtensionLockWaiterCount
455 *
456 * Count the number of processes waiting for the given relation extension lock.
457 */
458int
460{
461 LOCKTAG tag;
462
464 relation->rd_lockInfo.lockRelId.dbId,
465 relation->rd_lockInfo.lockRelId.relId);
466
467 return LockWaiterCount(&tag);
468}
469
470/*
471 * UnlockRelationForExtension
472 */
473void
475{
476 LOCKTAG tag;
477
479 relation->rd_lockInfo.lockRelId.dbId,
480 relation->rd_lockInfo.lockRelId.relId);
481
482 LockRelease(&tag, lockmode, false);
483}
484
485/*
486 * LockDatabaseFrozenIds
487 *
488 * This allows one backend per database to execute vac_update_datfrozenxid().
489 */
490void
492{
493 LOCKTAG tag;
494
496
497 (void) LockAcquire(&tag, lockmode, false, false);
498}
499
500/*
501 * LockPage
502 *
503 * Obtain a page-level lock. This is currently used by some index access
504 * methods to lock individual index pages.
505 */
506void
507LockPage(Relation relation, BlockNumber blkno, LOCKMODE lockmode)
508{
509 LOCKTAG tag;
510
512 relation->rd_lockInfo.lockRelId.dbId,
513 relation->rd_lockInfo.lockRelId.relId,
514 blkno);
515
516 (void) LockAcquire(&tag, lockmode, false, false);
517}
518
519/*
520 * ConditionalLockPage
521 *
522 * As above, but only lock if we can get the lock without blocking.
523 * Returns true iff the lock was acquired.
524 */
525bool
527{
528 LOCKTAG tag;
529
531 relation->rd_lockInfo.lockRelId.dbId,
532 relation->rd_lockInfo.lockRelId.relId,
533 blkno);
534
535 return (LockAcquire(&tag, lockmode, false, true) != LOCKACQUIRE_NOT_AVAIL);
536}
537
538/*
539 * UnlockPage
540 */
541void
542UnlockPage(Relation relation, BlockNumber blkno, LOCKMODE lockmode)
543{
544 LOCKTAG tag;
545
547 relation->rd_lockInfo.lockRelId.dbId,
548 relation->rd_lockInfo.lockRelId.relId,
549 blkno);
550
551 LockRelease(&tag, lockmode, false);
552}
553
554/*
555 * LockTuple
556 *
557 * Obtain a tuple-level lock. This is used in a less-than-intuitive fashion
558 * because we can't afford to keep a separate lock in shared memory for every
559 * tuple. See heap_lock_tuple before using this!
560 */
561void
562LockTuple(Relation relation, ItemPointer tid, LOCKMODE lockmode)
563{
564 LOCKTAG tag;
565
567 relation->rd_lockInfo.lockRelId.dbId,
568 relation->rd_lockInfo.lockRelId.relId,
571
572 (void) LockAcquire(&tag, lockmode, false, false);
573}
574
575/*
576 * ConditionalLockTuple
577 *
578 * As above, but only lock if we can get the lock without blocking.
579 * Returns true iff the lock was acquired.
580 */
581bool
583 bool logLockFailure)
584{
585 LOCKTAG tag;
586
588 relation->rd_lockInfo.lockRelId.dbId,
589 relation->rd_lockInfo.lockRelId.relId,
592
593 return (LockAcquireExtended(&tag, lockmode, false, true, true, NULL,
594 logLockFailure) != LOCKACQUIRE_NOT_AVAIL);
595}
596
597/*
598 * UnlockTuple
599 */
600void
601UnlockTuple(Relation relation, ItemPointer tid, LOCKMODE lockmode)
602{
603 LOCKTAG tag;
604
606 relation->rd_lockInfo.lockRelId.dbId,
607 relation->rd_lockInfo.lockRelId.relId,
610
611 LockRelease(&tag, lockmode, false);
612}
613
614/*
615 * XactLockTableInsert
616 *
617 * Insert a lock showing that the given transaction ID is running ---
618 * this is done when an XID is acquired by a transaction or subtransaction.
619 * The lock can then be used to wait for the transaction to finish.
620 */
621void
623{
624 LOCKTAG tag;
625
626 SET_LOCKTAG_TRANSACTION(tag, xid);
627
628 (void) LockAcquire(&tag, ExclusiveLock, false, false);
629}
630
631/*
632 * XactLockTableDelete
633 *
634 * Delete the lock showing that the given transaction ID is running.
635 * (This is never used for main transaction IDs; those locks are only
636 * released implicitly at transaction end. But we do use it for subtrans IDs.)
637 */
638void
640{
641 LOCKTAG tag;
642
643 SET_LOCKTAG_TRANSACTION(tag, xid);
644
645 LockRelease(&tag, ExclusiveLock, false);
646}
647
648/*
649 * XactLockTableWait
650 *
651 * Wait for the specified transaction to commit or abort. If an operation
652 * is specified, an error context callback is set up. If 'oper' is passed as
653 * None, no error context callback is set up.
654 *
655 * Note that this does the right thing for subtransactions: if we wait on a
656 * subtransaction, we will exit as soon as it aborts or its top parent commits.
657 * It takes some extra work to ensure this, because to save on shared memory
658 * the XID lock of a subtransaction is released when it ends, whether
659 * successfully or unsuccessfully. So we have to check if it's "still running"
660 * and if so wait for its parent.
661 */
662void
665{
666 LOCKTAG tag;
669 bool first = true;
670
671 /*
672 * If an operation is specified, set up our verbose error context
673 * callback.
674 */
675 if (oper != XLTW_None)
676 {
679
680 info.rel = rel;
681 info.ctid = ctid;
682 info.oper = oper;
683
685 callback.arg = &info;
686 callback.previous = error_context_stack;
688 }
689
690 for (;;)
691 {
694
695 SET_LOCKTAG_TRANSACTION(tag, xid);
696
697 (void) LockAcquire(&tag, ShareLock, false, false);
698
699 LockRelease(&tag, ShareLock, false);
700
702 break;
703
704 /*
705 * If the Xid belonged to a subtransaction, then the lock would have
706 * gone away as soon as it was finished; for correct tuple visibility,
707 * the right action is to wait on its parent transaction to go away.
708 * But instead of going levels up one by one, we can just wait for the
709 * topmost transaction to finish with the same end result, which also
710 * incurs less locktable traffic.
711 *
712 * Some uses of this function don't involve tuple visibility -- such
713 * as when building snapshots for logical decoding. It is possible to
714 * see a transaction in ProcArray before it registers itself in the
715 * locktable. The topmost transaction in that case is the same xid,
716 * so we try again after a short sleep. (Don't sleep the first time
717 * through, to avoid slowing down the normal case.)
718 */
719 if (!first)
720 pg_usleep(1000L);
721 first = false;
723 }
724
725 if (oper != XLTW_None)
726 error_context_stack = callback.previous;
727}
728
729/*
730 * ConditionalXactLockTableWait
731 *
732 * As above, but only lock if we can get the lock without blocking.
733 * Returns true if the lock was acquired.
734 */
735bool
737{
738 LOCKTAG tag;
739 bool first = true;
740
741 for (;;)
742 {
745
746 SET_LOCKTAG_TRANSACTION(tag, xid);
747
748 if (LockAcquireExtended(&tag, ShareLock, false, true, true, NULL,
749 logLockFailure)
751 return false;
752
753 LockRelease(&tag, ShareLock, false);
754
756 break;
757
758 /* See XactLockTableWait about this case */
759 if (!first)
760 pg_usleep(1000L);
761 first = false;
763 }
764
765 return true;
766}
767
768/*
769 * SpeculativeInsertionLockAcquire
770 *
771 * Insert a lock showing that the given transaction ID is inserting a tuple,
772 * but hasn't yet decided whether it's going to keep it. The lock can then be
773 * used to wait for the decision to go ahead with the insertion, or aborting
774 * it.
775 *
776 * The token is used to distinguish multiple insertions by the same
777 * transaction. It is returned to caller.
778 */
779uint32
781{
782 LOCKTAG tag;
783
785
786 /*
787 * Check for wrap-around. Zero means no token is held, so don't use that.
788 */
791
793
794 (void) LockAcquire(&tag, ExclusiveLock, false, false);
795
797}
798
799/*
800 * SpeculativeInsertionLockRelease
801 *
802 * Delete the lock showing that the given transaction is speculatively
803 * inserting a tuple.
804 */
805void
807{
808 LOCKTAG tag;
809
811
812 LockRelease(&tag, ExclusiveLock, false);
813}
814
815/*
816 * SpeculativeInsertionWait
817 *
818 * Wait for the specified transaction to finish or abort the insertion of a
819 * tuple.
820 */
821void
823{
824 LOCKTAG tag;
825
827
829 Assert(token != 0);
830
831 (void) LockAcquire(&tag, ShareLock, false, false);
832 LockRelease(&tag, ShareLock, false);
833}
834
835/*
836 * XactLockTableWaitErrorCb
837 * Error context callback for transaction lock waits.
838 */
839static void
841{
843
844 /*
845 * We would like to print schema name too, but that would require a
846 * syscache lookup.
847 */
848 if (info->oper != XLTW_None &&
850 {
851 const char *cxt;
852
853 switch (info->oper)
854 {
855 case XLTW_Update:
856 cxt = gettext_noop("while updating tuple (%u,%u) in relation \"%s\"");
857 break;
858 case XLTW_Delete:
859 cxt = gettext_noop("while deleting tuple (%u,%u) in relation \"%s\"");
860 break;
861 case XLTW_Lock:
862 cxt = gettext_noop("while locking tuple (%u,%u) in relation \"%s\"");
863 break;
864 case XLTW_LockUpdated:
865 cxt = gettext_noop("while locking updated version (%u,%u) of tuple in relation \"%s\"");
866 break;
867 case XLTW_InsertIndex:
868 cxt = gettext_noop("while inserting index tuple (%u,%u) in relation \"%s\"");
869 break;
871 cxt = gettext_noop("while checking uniqueness of tuple (%u,%u) in relation \"%s\"");
872 break;
874 cxt = gettext_noop("while rechecking updated tuple (%u,%u) in relation \"%s\"");
875 break;
877 cxt = gettext_noop("while checking exclusion constraint on tuple (%u,%u) in relation \"%s\"");
878 break;
879
880 default:
881 return;
882 }
883
884 errcontext(cxt,
888 }
889}
890
891/*
892 * WaitForLockersMultiple
893 * Wait until no transaction holds locks that conflict with the given
894 * locktags at the given lockmode.
895 *
896 * To do this, obtain the current list of lockers, and wait on their VXIDs
897 * until they are finished.
898 *
899 * Note we don't try to acquire the locks on the given locktags, only the
900 * VXIDs and XIDs of their lock holders; if somebody grabs a conflicting lock
901 * on the objects after we obtained our initial list of lockers, we will not
902 * wait for them.
903 */
904void
906{
907 List *holders = NIL;
908 ListCell *lc;
909 int total = 0;
910 int done = 0;
911
912 /* Done if no locks to wait for */
913 if (locktags == NIL)
914 return;
915
916 /* Collect the transactions we need to wait on */
917 foreach(lc, locktags)
918 {
919 LOCKTAG *locktag = lfirst(lc);
920 int count;
921
922 holders = lappend(holders,
923 GetLockConflicts(locktag, lockmode,
924 progress ? &count : NULL));
925 if (progress)
926 total += count;
927 }
928
929 if (progress)
931
932 /*
933 * Note: GetLockConflicts() never reports our own xid, hence we need not
934 * check for that. Also, prepared xacts are reported and awaited.
935 */
936
937 /* Finally wait for each such transaction to complete */
938 foreach(lc, holders)
939 {
940 VirtualTransactionId *lockholders = lfirst(lc);
941
942 while (VirtualTransactionIdIsValid(*lockholders))
943 {
944 /* If requested, publish who we're going to wait for. */
945 if (progress)
946 {
947 PGPROC *holder = ProcNumberGetProc(lockholders->procNumber);
948
949 if (holder)
951 holder->pid);
952 }
953 VirtualXactLock(*lockholders, true);
954 lockholders++;
955
956 if (progress)
958 }
959 }
960 if (progress)
961 {
962 const int index[] = {
966 };
967 const int64 values[] = {
968 0, 0, 0
969 };
970
972 }
973
974 list_free_deep(holders);
975}
976
977/*
978 * WaitForLockers
979 *
980 * Same as WaitForLockersMultiple, for a single lock tag.
981 */
982void
983WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode, bool progress)
984{
985 List *l;
986
987 l = list_make1(&heaplocktag);
988 WaitForLockersMultiple(l, lockmode, progress);
989 list_free(l);
990}
991
992
993/*
994 * LockDatabaseObject
995 *
996 * Obtain a lock on a general object of the current database. Don't use
997 * this for shared objects (such as tablespaces). It's unwise to apply it
998 * to relations, also, since a lock taken this way will NOT conflict with
999 * locks taken via LockRelation and friends.
1000 */
1001void
1002LockDatabaseObject(Oid classid, Oid objid, uint16 objsubid,
1003 LOCKMODE lockmode)
1004{
1005 LOCKTAG tag;
1006
1009 classid,
1010 objid,
1011 objsubid);
1012
1013 (void) LockAcquire(&tag, lockmode, false, false);
1014
1015 /* Make sure syscaches are up-to-date with any changes we waited for */
1017}
1018
1019/*
1020 * ConditionalLockDatabaseObject
1021 *
1022 * As above, but only lock if we can get the lock without blocking.
1023 * Returns true iff the lock was acquired.
1024 */
1025bool
1027 LOCKMODE lockmode)
1028{
1029 LOCKTAG tag;
1030 LOCALLOCK *locallock;
1032
1035 classid,
1036 objid,
1037 objsubid);
1038
1039 res = LockAcquireExtended(&tag, lockmode, false, true, true, &locallock,
1040 false);
1041
1042 if (res == LOCKACQUIRE_NOT_AVAIL)
1043 return false;
1044
1045 /*
1046 * Now that we have the lock, check for invalidation messages; see notes
1047 * in LockRelationOid.
1048 */
1049 if (res != LOCKACQUIRE_ALREADY_CLEAR)
1050 {
1052 MarkLockClear(locallock);
1053 }
1054
1055 return true;
1056}
1057
1058/*
1059 * UnlockDatabaseObject
1060 */
1061void
1062UnlockDatabaseObject(Oid classid, Oid objid, uint16 objsubid,
1063 LOCKMODE lockmode)
1064{
1065 LOCKTAG tag;
1066
1069 classid,
1070 objid,
1071 objsubid);
1072
1073 LockRelease(&tag, lockmode, false);
1074}
1075
1076/*
1077 * LockSharedObject
1078 *
1079 * Obtain a lock on a shared-across-databases object.
1080 */
1081void
1082LockSharedObject(Oid classid, Oid objid, uint16 objsubid,
1083 LOCKMODE lockmode)
1084{
1085 LOCKTAG tag;
1086
1088 InvalidOid,
1089 classid,
1090 objid,
1091 objsubid);
1092
1093 (void) LockAcquire(&tag, lockmode, false, false);
1094
1095 /* Make sure syscaches are up-to-date with any changes we waited for */
1097}
1098
1099/*
1100 * ConditionalLockSharedObject
1101 *
1102 * As above, but only lock if we can get the lock without blocking.
1103 * Returns true iff the lock was acquired.
1104 */
1105bool
1107 LOCKMODE lockmode)
1108{
1109 LOCKTAG tag;
1110 LOCALLOCK *locallock;
1112
1114 InvalidOid,
1115 classid,
1116 objid,
1117 objsubid);
1118
1119 res = LockAcquireExtended(&tag, lockmode, false, true, true, &locallock,
1120 false);
1121
1122 if (res == LOCKACQUIRE_NOT_AVAIL)
1123 return false;
1124
1125 /*
1126 * Now that we have the lock, check for invalidation messages; see notes
1127 * in LockRelationOid.
1128 */
1129 if (res != LOCKACQUIRE_ALREADY_CLEAR)
1130 {
1132 MarkLockClear(locallock);
1133 }
1134
1135 return true;
1136}
1137
1138/*
1139 * UnlockSharedObject
1140 */
1141void
1142UnlockSharedObject(Oid classid, Oid objid, uint16 objsubid,
1143 LOCKMODE lockmode)
1144{
1145 LOCKTAG tag;
1146
1148 InvalidOid,
1149 classid,
1150 objid,
1151 objsubid);
1152
1153 LockRelease(&tag, lockmode, false);
1154}
1155
1156/*
1157 * LockSharedObjectForSession
1158 *
1159 * Obtain a session-level lock on a shared-across-databases object.
1160 * See LockRelationIdForSession for notes about session-level locks.
1161 */
1162void
1163LockSharedObjectForSession(Oid classid, Oid objid, uint16 objsubid,
1164 LOCKMODE lockmode)
1165{
1166 LOCKTAG tag;
1167
1169 InvalidOid,
1170 classid,
1171 objid,
1172 objsubid);
1173
1174 (void) LockAcquire(&tag, lockmode, true, false);
1175}
1176
1177/*
1178 * UnlockSharedObjectForSession
1179 */
1180void
1182 LOCKMODE lockmode)
1183{
1184 LOCKTAG tag;
1185
1187 InvalidOid,
1188 classid,
1189 objid,
1190 objsubid);
1191
1192 LockRelease(&tag, lockmode, true);
1193}
1194
1195/*
1196 * LockApplyTransactionForSession
1197 *
1198 * Obtain a session-level lock on a transaction being applied on a logical
1199 * replication subscriber. See LockRelationIdForSession for notes about
1200 * session-level locks.
1201 */
1202void
1204 LOCKMODE lockmode)
1205{
1206 LOCKTAG tag;
1207
1210 suboid,
1211 xid,
1212 objid);
1213
1214 (void) LockAcquire(&tag, lockmode, true, false);
1215}
1216
1217/*
1218 * UnlockApplyTransactionForSession
1219 */
1220void
1222 LOCKMODE lockmode)
1223{
1224 LOCKTAG tag;
1225
1228 suboid,
1229 xid,
1230 objid);
1231
1232 LockRelease(&tag, lockmode, true);
1233}
1234
1235/*
1236 * Append a description of a lockable object to buf.
1237 *
1238 * Ideally we would print names for the numeric values, but that requires
1239 * getting locks on system tables, which might cause problems since this is
1240 * typically used to report deadlock situations.
1241 */
1242void
1244{
1245 switch ((LockTagType) tag->locktag_type)
1246 {
1247 case LOCKTAG_RELATION:
1249 _("relation %u of database %u"),
1250 tag->locktag_field2,
1251 tag->locktag_field1);
1252 break;
1255 _("extension of relation %u of database %u"),
1256 tag->locktag_field2,
1257 tag->locktag_field1);
1258 break;
1261 _("pg_database.datfrozenxid of database %u"),
1262 tag->locktag_field1);
1263 break;
1264 case LOCKTAG_PAGE:
1266 _("page %u of relation %u of database %u"),
1267 tag->locktag_field3,
1268 tag->locktag_field2,
1269 tag->locktag_field1);
1270 break;
1271 case LOCKTAG_TUPLE:
1273 _("tuple (%u,%u) of relation %u of database %u"),
1274 tag->locktag_field3,
1275 tag->locktag_field4,
1276 tag->locktag_field2,
1277 tag->locktag_field1);
1278 break;
1281 _("transaction %u"),
1282 tag->locktag_field1);
1283 break;
1286 _("virtual transaction %d/%u"),
1287 tag->locktag_field1,
1288 tag->locktag_field2);
1289 break;
1292 _("speculative token %u of transaction %u"),
1293 tag->locktag_field2,
1294 tag->locktag_field1);
1295 break;
1296 case LOCKTAG_OBJECT:
1298 _("object %u of class %u of database %u"),
1299 tag->locktag_field3,
1300 tag->locktag_field2,
1301 tag->locktag_field1);
1302 break;
1303 case LOCKTAG_USERLOCK:
1304 /* reserved for old contrib code, now on pgfoundry */
1306 _("user lock [%u,%u,%u]"),
1307 tag->locktag_field1,
1308 tag->locktag_field2,
1309 tag->locktag_field3);
1310 break;
1311 case LOCKTAG_ADVISORY:
1313 _("advisory lock [%u,%u,%u,%u]"),
1314 tag->locktag_field1,
1315 tag->locktag_field2,
1316 tag->locktag_field3,
1317 tag->locktag_field4);
1318 break;
1321 _("remote transaction %u of subscription %u of database %u"),
1322 tag->locktag_field3,
1323 tag->locktag_field2,
1324 tag->locktag_field1);
1325 break;
1326 default:
1328 _("unrecognized locktag type %d"),
1329 (int) tag->locktag_type);
1330 break;
1331 }
1332}
1333
1334/*
1335 * GetLockNameFromTagType
1336 *
1337 * Given locktag type, return the corresponding lock name.
1338 */
1339const char *
1341{
1342 if (locktag_type > LOCKTAG_LAST_TYPE)
1343 return "???";
1344 return LockTagTypeNames[locktag_type];
1345}
void pgstat_progress_update_param(int index, int64 val)
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
uint32 BlockNumber
Definition: block.h:31
static Datum values[MAXATTR]
Definition: bootstrap.c:151
#define gettext_noop(x)
Definition: c.h:1167
int64_t int64
Definition: c.h:499
uint16_t uint16
Definition: c.h:501
uint32_t uint32
Definition: c.h:502
uint32 TransactionId
Definition: c.h:623
#define OidIsValid(objectId)
Definition: c.h:746
bool IsSharedRelation(Oid relationId)
Definition: catalog.c:273
ErrorContextCallback * error_context_stack
Definition: elog.c:95
#define _(x)
Definition: elog.c:91
#define errcontext
Definition: elog.h:197
Oid MyDatabaseId
Definition: globals.c:95
Assert(PointerIsAligned(start, uint64))
void AcceptInvalidationMessages(void)
Definition: inval.c:929
static OffsetNumber ItemPointerGetOffsetNumber(const ItemPointerData *pointer)
Definition: itemptr.h:124
static BlockNumber ItemPointerGetBlockNumber(const ItemPointerData *pointer)
Definition: itemptr.h:103
static bool ItemPointerIsValid(const ItemPointerData *pointer)
Definition: itemptr.h:83
List * lappend(List *list, void *datum)
Definition: list.c:339
void list_free(List *list)
Definition: list.c:1546
void list_free_deep(List *list)
Definition: list.c:1560
bool ConditionalLockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:151
void XactLockTableWait(TransactionId xid, Relation rel, ItemPointer ctid, XLTW_Oper oper)
Definition: lmgr.c:663
void LockSharedObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1082
bool ConditionalLockTuple(Relation relation, ItemPointer tid, LOCKMODE lockmode, bool logLockFailure)
Definition: lmgr.c:582
bool ConditionalLockPage(Relation relation, BlockNumber blkno, LOCKMODE lockmode)
Definition: lmgr.c:526
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:229
void LockDatabaseObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1002
void UnlockRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:314
void DescribeLockTag(StringInfo buf, const LOCKTAG *tag)
Definition: lmgr.c:1243
void SpeculativeInsertionWait(TransactionId xid, uint32 token)
Definition: lmgr.c:822
bool ConditionalLockSharedObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1106
void UnlockSharedObjectForSession(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1181
void WaitForLockersMultiple(List *locktags, LOCKMODE lockmode, bool progress)
Definition: lmgr.c:905
void LockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:391
void RelationInitLockInfo(Relation relation)
Definition: lmgr.c:70
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:107
void LockRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:246
void UnlockRelationId(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:214
void WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode, bool progress)
Definition: lmgr.c:983
bool ConditionalXactLockTableWait(TransactionId xid, bool logLockFailure)
Definition: lmgr.c:736
void XactLockTableDelete(TransactionId xid)
Definition: lmgr.c:639
void LockTuple(Relation relation, ItemPointer tid, LOCKMODE lockmode)
Definition: lmgr.c:562
void XactLockTableInsert(TransactionId xid)
Definition: lmgr.c:622
uint32 SpeculativeInsertionLockAcquire(TransactionId xid)
Definition: lmgr.c:780
void LockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:424
bool CheckRelationLockedByMe(Relation relation, LOCKMODE lockmode, bool orstronger)
Definition: lmgr.c:334
void UnlockApplyTransactionForSession(Oid suboid, TransactionId xid, uint16 objid, LOCKMODE lockmode)
Definition: lmgr.c:1221
void SpeculativeInsertionLockRelease(TransactionId xid)
Definition: lmgr.c:806
static void XactLockTableWaitErrorCb(void *arg)
Definition: lmgr.c:840
void LockPage(Relation relation, BlockNumber blkno, LOCKMODE lockmode)
Definition: lmgr.c:507
bool ConditionalLockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:442
bool CheckRelationOidLockedByMe(Oid relid, LOCKMODE lockmode, bool orstronger)
Definition: lmgr.c:351
static void SetLocktagRelationOid(LOCKTAG *tag, Oid relid)
Definition: lmgr.c:88
void UnlockPage(Relation relation, BlockNumber blkno, LOCKMODE lockmode)
Definition: lmgr.c:542
void UnlockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:404
bool ConditionalLockRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:278
static uint32 speculativeInsertionToken
Definition: lmgr.c:45
bool ConditionalLockDatabaseObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1026
void LockDatabaseFrozenIds(LOCKMODE lockmode)
Definition: lmgr.c:491
struct XactLockTableWaitInfo XactLockTableWaitInfo
void UnlockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:474
const char * GetLockNameFromTagType(uint16 locktag_type)
Definition: lmgr.c:1340
void UnlockSharedObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1142
void LockApplyTransactionForSession(Oid suboid, TransactionId xid, uint16 objid, LOCKMODE lockmode)
Definition: lmgr.c:1203
void LockSharedObjectForSession(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1163
void LockRelationId(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:185
bool LockHasWaitersRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:367
void UnlockDatabaseObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:1062
int RelationExtensionLockWaiterCount(Relation relation)
Definition: lmgr.c:459
void UnlockTuple(Relation relation, ItemPointer tid, LOCKMODE lockmode)
Definition: lmgr.c:601
XLTW_Oper
Definition: lmgr.h:25
@ XLTW_FetchUpdated
Definition: lmgr.h:33
@ XLTW_None
Definition: lmgr.h:26
@ XLTW_Lock
Definition: lmgr.h:29
@ XLTW_Delete
Definition: lmgr.h:28
@ XLTW_InsertIndex
Definition: lmgr.h:31
@ XLTW_LockUpdated
Definition: lmgr.h:30
@ XLTW_RecheckExclusionConstr
Definition: lmgr.h:34
@ XLTW_Update
Definition: lmgr.h:27
@ XLTW_InsertIndexUnique
Definition: lmgr.h:32
LockAcquireResult LockAcquire(const LOCKTAG *locktag, LOCKMODE lockmode, bool sessionLock, bool dontWait)
Definition: lock.c:805
bool LockHeldByMe(const LOCKTAG *locktag, LOCKMODE lockmode, bool orstronger)
Definition: lock.c:639
int LockWaiterCount(const LOCKTAG *locktag)
Definition: lock.c:4821
bool LockRelease(const LOCKTAG *locktag, LOCKMODE lockmode, bool sessionLock)
Definition: lock.c:2067
bool VirtualXactLock(VirtualTransactionId vxid, bool wait)
Definition: lock.c:4710
VirtualTransactionId * GetLockConflicts(const LOCKTAG *locktag, LOCKMODE lockmode, int *countp)
Definition: lock.c:3034
LockAcquireResult LockAcquireExtended(const LOCKTAG *locktag, LOCKMODE lockmode, bool sessionLock, bool dontWait, bool reportMemoryError, LOCALLOCK **locallockp, bool logLockFailure)
Definition: lock.c:832
bool LockHasWaiters(const LOCKTAG *locktag, LOCKMODE lockmode, bool sessionLock)
Definition: lock.c:692
void MarkLockClear(LOCALLOCK *locallock)
Definition: lock.c:1916
#define SET_LOCKTAG_DATABASE_FROZEN_IDS(locktag, dboid)
Definition: lock.h:200
#define SET_LOCKTAG_RELATION_EXTEND(locktag, dboid, reloid)
Definition: lock.h:191
LockTagType
Definition: lock.h:137
@ LOCKTAG_OBJECT
Definition: lock.h:146
@ LOCKTAG_RELATION_EXTEND
Definition: lock.h:139
@ LOCKTAG_RELATION
Definition: lock.h:138
@ LOCKTAG_TUPLE
Definition: lock.h:142
@ LOCKTAG_SPECULATIVE_TOKEN
Definition: lock.h:145
@ LOCKTAG_APPLY_TRANSACTION
Definition: lock.h:149
@ LOCKTAG_USERLOCK
Definition: lock.h:147
@ LOCKTAG_DATABASE_FROZEN_IDS
Definition: lock.h:140
@ LOCKTAG_VIRTUALTRANSACTION
Definition: lock.h:144
@ LOCKTAG_TRANSACTION
Definition: lock.h:143
@ LOCKTAG_PAGE
Definition: lock.h:141
@ LOCKTAG_ADVISORY
Definition: lock.h:148
#define SET_LOCKTAG_APPLY_TRANSACTION(locktag, dboid, suboid, xid, objid)
Definition: lock.h:283
#define VirtualTransactionIdIsValid(vxid)
Definition: lock.h:68
#define SET_LOCKTAG_TRANSACTION(locktag, xid)
Definition: lock.h:227
#define SET_LOCKTAG_RELATION(locktag, dboid, reloid)
Definition: lock.h:182
#define SET_LOCKTAG_SPECULATIVE_INSERTION(locktag, xid, token)
Definition: lock.h:248
#define LOCKTAG_LAST_TYPE
Definition: lock.h:153
#define SET_LOCKTAG_PAGE(locktag, dboid, reloid, blocknum)
Definition: lock.h:209
#define SET_LOCKTAG_TUPLE(locktag, dboid, reloid, blocknum, offnum)
Definition: lock.h:218
#define SET_LOCKTAG_OBJECT(locktag, dboid, classoid, objoid, objsubid)
Definition: lock.h:263
LockAcquireResult
Definition: lock.h:501
@ LOCKACQUIRE_ALREADY_CLEAR
Definition: lock.h:505
@ LOCKACQUIRE_NOT_AVAIL
Definition: lock.h:502
int LOCKMODE
Definition: lockdefs.h:26
#define ExclusiveLock
Definition: lockdefs.h:42
#define ShareLock
Definition: lockdefs.h:40
const char *const LockTagTypeNames[]
Definition: lockfuncs.c:28
Operator oper(ParseState *pstate, List *opname, Oid ltypeId, Oid rtypeId, bool noError, int location)
Definition: parse_oper.c:370
void * arg
#define lfirst(lc)
Definition: pg_list.h:172
#define NIL
Definition: pg_list.h:68
#define list_make1(x1)
Definition: pg_list.h:212
static char * buf
Definition: pg_test_fsync.c:72
static int progress
Definition: pgbench.c:262
#define InvalidOid
Definition: postgres_ext.h:35
unsigned int Oid
Definition: postgres_ext.h:30
PGPROC * ProcNumberGetProc(ProcNumber procNumber)
Definition: procarray.c:3138
bool TransactionIdIsInProgress(TransactionId xid)
Definition: procarray.c:1402
#define PROGRESS_WAITFOR_DONE
Definition: progress.h:120
#define PROGRESS_WAITFOR_TOTAL
Definition: progress.h:119
#define PROGRESS_WAITFOR_CURRENT_PID
Definition: progress.h:121
#define RelationGetRelid(relation)
Definition: rel.h:516
#define RelationGetRelationName(relation)
Definition: rel.h:550
#define RelationIsValid(relation)
Definition: rel.h:489
void pg_usleep(long microsec)
Definition: signal.c:53
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:145
Definition: lock.h:166
uint8 locktag_type
Definition: lock.h:171
uint32 locktag_field3
Definition: lock.h:169
uint32 locktag_field1
Definition: lock.h:167
uint16 locktag_field4
Definition: lock.h:170
uint32 locktag_field2
Definition: lock.h:168
Definition: pg_list.h:54
LockRelId lockRelId
Definition: rel.h:46
Definition: rel.h:39
Oid relId
Definition: rel.h:40
Oid dbId
Definition: rel.h:41
Definition: proc.h:163
int pid
Definition: proc.h:183
LockInfoData rd_lockInfo
Definition: rel.h:114
Form_pg_class rd_rel
Definition: rel.h:111
ProcNumber procNumber
Definition: lock.h:62
ItemPointer ctid
Definition: lmgr.c:58
XLTW_Oper oper
Definition: lmgr.c:56
Relation rel
Definition: lmgr.c:57
Definition: type.h:96
TransactionId SubTransGetTopmostTransaction(TransactionId xid)
Definition: subtrans.c:163
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:46
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
#define TransactionIdIsValid(xid)
Definition: transam.h:41
TransactionId GetTopTransactionIdIfAny(void)
Definition: xact.c:441