1
# Copyright (C) 2006 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
"""On-disk mutex protecting a resource
19
bzr on-disk objects are locked by the existence of a directory with a
20
particular name within the control directory. We use this rather than OS
21
internal locks (such as flock etc) because they can be seen across all
22
transports, including http.
24
Objects can be read if there is only physical read access; therefore
25
readers can never be required to create a lock, though they will
26
check whether a writer is using the lock. Writers can't detect
27
whether anyone else is reading from the resource as they write.
28
This works because of ordering constraints that make sure readers
29
see a consistent view of existing data.
31
Waiting for a lock must be done by polling; this can be aborted after
34
Locks must always be explicitly released, typically from a try/finally
35
block -- they are not released from a finalizer or when Python
38
Locks may fail to be released if the process is abruptly terminated
39
(machine stop, SIGKILL) or if a remote transport becomes permanently
40
disconnected. There is therefore a method to break an existing lock.
41
This should rarely be used, and generally only with user approval.
42
Locks contain some information on when the lock was taken and by who
43
which may guide in deciding whether it can safely be broken. (This is
44
similar to the messages displayed by emacs and vim.) Note that if the
45
lock holder is still alive they will get no notification that the lock
46
has been broken and will continue their work -- so it is important to be
47
sure they are actually dead.
49
A lock is represented on disk by a directory of a particular name,
50
containing an information file. Taking a lock is done by renaming a
51
temporary directory into place. We use temporary directories because
52
for all known transports and filesystems we believe that exactly one
53
attempt to claim the lock will succeed and the others will fail. (Files
54
won't do because some filesystems or transports only have
55
rename-and-overwrite, making it hard to tell who won.)
57
The desired characteristics are:
59
* Locks are not reentrant. (That is, a client that tries to take a
60
lock it already holds may deadlock or fail.)
61
* Stale locks can be guessed at by a heuristic
62
* Lost locks can be broken by any client
63
* Failed lock operations leave little or no mess
64
* Deadlocks are avoided by having a timeout always in use, clients
65
desiring indefinite waits can retry or set a silly big timeout.
67
Storage formats use the locks, and also need to consider concurrency
68
issues underneath the lock. A format may choose not to use a lock
69
at all for some operations.
71
LockDirs always operate over a Transport. The transport may be readonly, in
72
which case the lock can be queried but not acquired.
74
Locks are identified by a path name, relative to a base transport.
76
Calling code will typically want to make sure there is exactly one LockDir
77
object per actual lock on disk. This module does nothing to prevent aliasing
78
and deadlocks will likely occur if the locks are aliased.
80
In the future we may add a "freshen" method which can be called
81
by a lock holder to check that their lock has not been broken, and to
82
update the timestamp within it.
86
>>> from bzrlib.transport.memory import MemoryTransport
87
>>> # typically will be obtained from a BzrDir, Branch, etc
88
>>> t = MemoryTransport()
89
>>> l = LockDir(t, 'sample-lock')
92
>>> # do something here
99
from StringIO import StringIO
102
from bzrlib.errors import (
114
from bzrlib.trace import mutter
115
from bzrlib.transport import Transport
116
from bzrlib.osutils import rand_chars
117
from bzrlib.rio import RioWriter, read_stanza, Stanza
119
# XXX: At the moment there is no consideration of thread safety on LockDir
120
# objects. This should perhaps be updated - e.g. if two threads try to take a
121
# lock at the same time they should *both* get it. But then that's unlikely
124
# TODO: Perhaps store some kind of note like the bzr command line in the lock
127
# TODO: Some kind of callback run while polling a lock to show progress
130
# TODO: Make sure to pass the right file and directory mode bits to all
131
# files/dirs created.
133
_DEFAULT_TIMEOUT_SECONDS = 300
134
_DEFAULT_POLL_SECONDS = 0.5
136
class LockDir(object):
137
"""Write-lock guarding access to data."""
139
__INFO_NAME = '/info'
141
def __init__(self, transport, path, file_modebits=0644, dir_modebits=0755):
142
"""Create a new LockDir object.
144
The LockDir is initially unlocked - this just creates the object.
146
:param transport: Transport which will contain the lock
148
:param path: Path to the lock within the base directory of the
151
assert isinstance(transport, Transport), \
152
("not a transport: %r" % transport)
153
self.transport = transport
155
self._lock_held = False
156
self._fake_read_lock = False
157
self._held_dir = path + '/held'
158
self._held_info_path = self._held_dir + self.__INFO_NAME
159
self._file_modebits = file_modebits
160
self._dir_modebits = dir_modebits
161
self.nonce = rand_chars(20)
164
return '%s(%s%s)' % (self.__class__.__name__,
168
is_held = property(lambda self: self._lock_held)
170
def create(self, mode=None):
171
"""Create the on-disk lock.
173
This is typically only called when the object/directory containing the
174
directory is first created. The lock is not held when it's created.
176
if self.transport.is_readonly():
177
raise UnlockableTransport(self.transport)
178
self.transport.mkdir(self.path, mode=mode)
180
def attempt_lock(self):
181
"""Take the lock; fail if it's already held.
183
If you wish to block until the lock can be obtained, call wait_lock()
186
if self._fake_read_lock:
187
raise LockContention(self)
188
if self.transport.is_readonly():
189
raise UnlockableTransport(self.transport)
191
tmpname = '%s/pending.%s.tmp' % (self.path, rand_chars(20))
192
self.transport.mkdir(tmpname)
194
self._prepare_info(sio)
196
# append will create a new file; we use append rather than put
197
# because we don't want to write to a temporary file and rename
198
# into place, because that's going to happen to the whole
200
self.transport.append(tmpname + self.__INFO_NAME, sio)
201
self.transport.rename(tmpname, self._held_dir)
202
self._lock_held = True
204
except (PathError, DirectoryNotEmpty, FileExists, ResourceBusy), e:
205
mutter("contention on %r: %s", self, e)
206
raise LockContention(self)
209
"""Release a held lock
211
if self._fake_read_lock:
212
self._fake_read_lock = False
214
if not self._lock_held:
215
raise LockNotHeld(self)
216
# rename before deleting, because we can't atomically remove the whole
218
tmpname = '%s/releasing.%s.tmp' % (self.path, rand_chars(20))
219
# gotta own it to unlock
221
self.transport.rename(self._held_dir, tmpname)
222
self._lock_held = False
223
self.transport.delete(tmpname + self.__INFO_NAME)
224
self.transport.rmdir(tmpname)
226
def break_lock(self):
227
"""Break a lock not held by this instance of LockDir.
229
This is a UI centric function: it uses the bzrlib.ui.ui_factory to
230
prompt for input if a lock is detected and there is any doubt about
231
it possibly being still active.
233
self._check_not_locked()
234
holder_info = self.peek()
235
if holder_info is not None:
236
if bzrlib.ui.ui_factory.get_boolean(
237
"Break lock %s held by %s@%s [process #%s]" % (
240
holder_info["hostname"],
241
holder_info["pid"])):
242
self.force_break(holder_info)
244
def force_break(self, dead_holder_info):
245
"""Release a lock held by another process.
247
WARNING: This should only be used when the other process is dead; if
248
it still thinks it has the lock there will be two concurrent writers.
249
In general the user's approval should be sought for lock breaks.
251
dead_holder_info must be the result of a previous LockDir.peek() call;
252
this is used to check that it's still held by the same process that
253
the user decided was dead. If this is not the current holder,
254
LockBreakMismatch is raised.
256
After the lock is broken it will not be held by any process.
257
It is possible that another process may sneak in and take the
258
lock before the breaking process acquires it.
260
if not isinstance(dead_holder_info, dict):
261
raise ValueError("dead_holder_info: %r" % dead_holder_info)
262
self._check_not_locked()
263
current_info = self.peek()
264
if current_info is None:
265
# must have been recently released
267
if current_info != dead_holder_info:
268
raise LockBreakMismatch(self, current_info, dead_holder_info)
269
tmpname = '%s/broken.%s.tmp' % (self.path, rand_chars(20))
270
self.transport.rename(self._held_dir, tmpname)
271
# check that we actually broke the right lock, not someone else;
272
# there's a small race window between checking it and doing the
274
broken_info_path = tmpname + self.__INFO_NAME
275
broken_info = self._read_info_file(broken_info_path)
276
if broken_info != dead_holder_info:
277
raise LockBreakMismatch(self, broken_info, dead_holder_info)
278
self.transport.delete(broken_info_path)
279
self.transport.rmdir(tmpname)
281
def _check_not_locked(self):
282
"""If the lock is held by this instance, raise an error."""
284
raise AssertionError("can't break own lock: %r" % self)
287
"""Make sure that the lock is still held by this locker.
289
This should only fail if the lock was broken by user intervention,
290
or if the lock has been affected by a bug.
292
If the lock is not thought to be held, raises LockNotHeld. If
293
the lock is thought to be held but has been broken, raises
296
if not self._lock_held:
297
raise LockNotHeld(self)
300
# no lock there anymore!
301
raise LockBroken(self)
302
if info.get('nonce') != self.nonce:
303
# there is a lock, but not ours
304
raise LockBroken(self)
306
def _read_info_file(self, path):
307
"""Read one given info file.
309
peek() reads the info file of the lock holder, if any.
311
return self._parse_info(self.transport.get(path))
314
"""Check if the lock is held by anyone.
316
If it is held, this returns the lock info structure as a rio Stanza,
317
which contains some information about the current lock holder.
318
Otherwise returns None.
321
info = self._read_info_file(self._held_info_path)
322
assert isinstance(info, dict), \
323
"bad parse result %r" % info
325
except NoSuchFile, e:
328
def _prepare_info(self, outf):
329
"""Write information about a pending lock to a temporary file.
332
# XXX: is creating this here inefficient?
333
config = bzrlib.config.GlobalConfig()
334
s = Stanza(hostname=socket.gethostname(),
335
pid=str(os.getpid()),
336
start_time=str(int(time.time())),
338
user=config.user_email(),
340
RioWriter(outf).write_stanza(s)
342
def _parse_info(self, info_file):
343
return read_stanza(info_file.readlines()).as_dict()
345
def wait_lock(self, timeout=_DEFAULT_TIMEOUT_SECONDS,
346
poll=_DEFAULT_POLL_SECONDS):
347
"""Wait a certain period for a lock.
349
If the lock can be acquired within the bounded time, it
350
is taken and this returns. Otherwise, LockContention
351
is raised. Either way, this function should return within
352
approximately `timeout` seconds. (It may be a bit more if
353
a transport operation takes a long time to complete.)
355
# XXX: the transport interface doesn't let us guard
356
# against operations there taking a long time.
357
deadline = time.time() + timeout
362
except LockContention:
364
if time.time() + poll < deadline:
367
raise LockContention(self)
369
def lock_write(self):
370
"""Wait for and acquire the lock."""
374
"""Compatibility-mode shared lock.
376
LockDir doesn't support shared read-only locks, so this
377
just pretends that the lock is taken but really does nothing.
379
# At the moment Branches are commonly locked for read, but
380
# we can't rely on that remotely. Once this is cleaned up,
381
# reenable this warning to prevent it coming back in
383
## warn("LockDir.lock_read falls back to write lock")
384
if self._lock_held or self._fake_read_lock:
385
raise LockContention(self)
386
self._fake_read_lock = True
388
def wait(self, timeout=20, poll=0.5):
389
"""Wait a certain period for a lock to be released."""
390
# XXX: the transport interface doesn't let us guard
391
# against operations there taking a long time.
392
deadline = time.time() + timeout
396
if time.time() + poll < deadline:
399
raise LockContention(self)
added
removed
bzrlib/lockdir.py
