1996-10-27 10:55:05 +01:00
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
|
#
|
|
|
|
|
# Makefile--
|
|
|
|
|
# Makefile for storage/lmgr
|
|
|
|
|
#
|
|
|
|
|
# IDENTIFICATION
|
2010-09-20 22:08:53 +02:00
|
|
|
# src/backend/storage/lmgr/Makefile
|
1996-10-27 10:55:05 +01:00
|
|
|
#
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
|
|
|
|
2000-08-31 18:12:35 +02:00
|
|
|
subdir = src/backend/storage/lmgr
|
|
|
|
|
top_builddir = ../../../..
|
|
|
|
|
include $(top_builddir)/src/Makefile.global
|
1996-10-27 10:55:05 +01:00
|
|
|
|
Implement genuine serializable isolation level.
Until now, our Serializable mode has in fact been what's called Snapshot
Isolation, which allows some anomalies that could not occur in any
serialized ordering of the transactions. This patch fixes that using a
method called Serializable Snapshot Isolation, based on research papers by
Michael J. Cahill (see README-SSI for full references). In Serializable
Snapshot Isolation, transactions run like they do in Snapshot Isolation,
but a predicate lock manager observes the reads and writes performed and
aborts transactions if it detects that an anomaly might occur. This method
produces some false positives, ie. it sometimes aborts transactions even
though there is no anomaly.
To track reads we implement predicate locking, see storage/lmgr/predicate.c.
Whenever a tuple is read, a predicate lock is acquired on the tuple. Shared
memory is finite, so when a transaction takes many tuple-level locks on a
page, the locks are promoted to a single page-level lock, and further to a
single relation level lock if necessary. To lock key values with no matching
tuple, a sequential scan always takes a relation-level lock, and an index
scan acquires a page-level lock that covers the search key, whether or not
there are any matching keys at the moment.
A predicate lock doesn't conflict with any regular locks or with another
predicate locks in the normal sense. They're only used by the predicate lock
manager to detect the danger of anomalies. Only serializable transactions
participate in predicate locking, so there should be no extra overhead for
for other transactions.
Predicate locks can't be released at commit, but must be remembered until
all the transactions that overlapped with it have completed. That means that
we need to remember an unbounded amount of predicate locks, so we apply a
lossy but conservative method of tracking locks for committed transactions.
If we run short of shared memory, we overflow to a new "pg_serial" SLRU
pool.
We don't currently allow Serializable transactions in Hot Standby mode.
That would be hard, because even read-only transactions can cause anomalies
that wouldn't otherwise occur.
Serializable isolation mode now means the new fully serializable level.
Repeatable Read gives you the old Snapshot Isolation level that we have
always had.
Kevin Grittner and Dan Ports, reviewed by Jeff Davis, Heikki Linnakangas and
Anssi Kääriäinen
2011-02-07 22:46:51 +01:00
|
|
|
OBJS = lmgr.o lock.o proc.o deadlock.o lwlock.o spin.o s_lock.o predicate.o
|
1996-10-27 10:55:05 +01:00
|
|
|
|
2008-02-19 11:30:09 +01:00
|
|
|
include $(top_srcdir)/src/backend/common.mk
|
1996-10-27 10:55:05 +01:00
|
|
|
|
2006-04-29 00:54:31 +02:00
|
|
|
ifdef TAS
|
|
|
|
|
TASPATH = $(top_builddir)/src/backend/port/tas.o
|
|
|
|
|
endif
|
|
|
|
|
|
2004-06-19 21:43:11 +02:00
|
|
|
s_lock_test: s_lock.c $(top_builddir)/src/port/libpgport.a
|
2004-10-07 02:08:04 +02:00
|
|
|
$(CC) $(CPPFLAGS) $(CFLAGS) -DS_LOCK_TEST=1 $(srcdir)/s_lock.c \
|
2006-04-29 00:54:31 +02:00
|
|
|
$(TASPATH) -L $(top_builddir)/src/port -lpgport -o s_lock_test
|
2004-06-19 21:43:11 +02:00
|
|
|
|
|
|
|
|
check: s_lock_test
|
2001-09-27 21:10:02 +02:00
|
|
|
./s_lock_test
|
|
|
|
|
|
2010-11-23 21:27:50 +01:00
|
|
|
clean distclean maintainer-clean:
|
2008-02-19 11:30:09 +01:00
|
|
|
rm -f s_lock_test
|
