1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
<!--$Id: cam_conv.so,v 10.14 2003/10/18 19:16:02 bostic Exp $-->
<!--Copyright 1997-2004 by Sleepycat Software, Inc.-->
<!--All rights reserved.-->
<!--See the file LICENSE for redistribution information.-->
<html>
<head>
<title>Berkeley DB Reference Guide: Berkeley DB Concurrent Data Store locking conventions</title>
<meta name="description" content="Berkeley DB: An embedded database programmatic toolkit.">
<meta name="keywords" content="embedded,database,programmatic,toolkit,btree,hash,hashing,transaction,transactions,locking,logging,access method,access methods,Java,C,C++">
</head>
<body bgcolor=white>
<a name="2"><!--meow--></a>
<table width="100%"><tr valign=top>
<td><h3><dl><dt>Berkeley DB Reference Guide:<dd>Locking Subsystem</dl></h3></td>
<td align=right><a href="../lock/twopl.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../lock/am_conv.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
<p>
<h3 align=center>Berkeley DB Concurrent Data Store locking conventions</h3>
<p>The Berkeley DB Concurrent Data Store product has a simple set of conventions for locking. It
provides multiple-reader/single-writer semantics, but not per-page
locking or transaction recoverability. As such, it does its locking
entirely in the Berkeley DB interface layer.</p>
<p>The object it locks is the file, identified by its unique file number.
The locking matrix is not one of the two standard lock modes, instead,
we use a four-lock set, consisting of the following:</p>
<dl compact>
<dt>DB_LOCK_NG<dd>not granted (always 0)
<dt>DB_LOCK_READ<dd>read (shared)
<dt>DB_LOCK_WRITE<dd>write (exclusive)
<dt>DB_LOCK_IWRITE<dd>intention-to-write (shared with NG and READ, but conflicts with WRITE and IWRITE)
</dl>
<p>The IWRITE lock is used for cursors that will be used for updating
(IWRITE locks are implicitly obtained for write operations through the
Berkeley DB handles, for example, <a href="../../api_c/db_put.html">DB->put</a> or <a href="../../api_c/db_del.html">DB->del</a>). While
the cursor is reading, the IWRITE lock is held; but as soon as the
cursor is about to modify the database, the IWRITE is upgraded to a
WRITE lock. This upgrade blocks until all readers have exited the
database. Because only one IWRITE lock is allowed at any one time, no
two cursors can ever try to upgrade to a WRITE lock at the same time,
and therefore deadlocks are prevented, which is essential because Berkeley DB Concurrent Data Store
does not include deadlock detection and recovery.</p>
<p>Applications that need to lock compatibly with Berkeley DB Concurrent Data Store must obey the
following rules:</p>
<ol>
<p><li>Use only lock modes DB_LOCK_NG, DB_LOCK_READ, DB_LOCK_WRITE,
DB_LOCK_IWRITE.
<p><li>Never attempt to acquire a WRITE lock on an object that is
already locked with a READ lock.
</ol>
<table width="100%"><tr><td><br></td><td align=right><a href="../lock/twopl.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../lock/am_conv.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
<p><font size=1><a href="../../sleepycat/legal.html">Copyright (c) 1996-2004</a> <a href="http://www.sleepycat.com">Sleepycat Software, Inc.</a> - All rights reserved.</font>
</body>
</html>
|
