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 cStringIO import StringIO
105
from bzrlib.errors import (
117
from bzrlib.trace import mutter, note
118
from bzrlib.transport import Transport
119
from bzrlib.osutils import rand_chars, format_delta
120
from bzrlib.rio import read_stanza, Stanza
124
# XXX: At the moment there is no consideration of thread safety on LockDir
125
# objects. This should perhaps be updated - e.g. if two threads try to take a
126
# lock at the same time they should *both* get it. But then that's unlikely
129
# TODO: Perhaps store some kind of note like the bzr command line in the lock
132
# TODO: Some kind of callback run while polling a lock to show progress
135
# TODO: Make sure to pass the right file and directory mode bits to all
136
# files/dirs created.
139
_DEFAULT_TIMEOUT_SECONDS = 300
140
_DEFAULT_POLL_SECONDS = 1.0
143
class LockDir(object):
144
"""Write-lock guarding access to data."""
146
__INFO_NAME = '/info'
148
def __init__(self, transport, path, file_modebits=0644, dir_modebits=0755):
149
"""Create a new LockDir object.
151
The LockDir is initially unlocked - this just creates the object.
153
:param transport: Transport which will contain the lock
155
:param path: Path to the lock within the base directory of the
158
assert isinstance(transport, Transport), \
159
("not a transport: %r" % transport)
160
self.transport = transport
162
self._lock_held = False
163
self._fake_read_lock = False
164
self._held_dir = path + '/held'
165
self._held_info_path = self._held_dir + self.__INFO_NAME
166
self._file_modebits = file_modebits
167
self._dir_modebits = dir_modebits
168
self.nonce = rand_chars(20)
170
self._report_function = note
173
return '%s(%s%s)' % (self.__class__.__name__,
177
is_held = property(lambda self: self._lock_held)
179
def create(self, mode=None):
180
"""Create the on-disk lock.
182
This is typically only called when the object/directory containing the
183
directory is first created. The lock is not held when it's created.
185
if self.transport.is_readonly():
186
raise UnlockableTransport(self.transport)
187
self.transport.mkdir(self.path, mode=mode)
189
def attempt_lock(self):
190
"""Take the lock; fail if it's already held.
192
If you wish to block until the lock can be obtained, call wait_lock()
195
if self._fake_read_lock:
196
raise LockContention(self)
197
if self.transport.is_readonly():
198
raise UnlockableTransport(self.transport)
200
tmpname = '%s/pending.%s.tmp' % (self.path, rand_chars(20))
202
self.transport.mkdir(tmpname)
204
# This may raise a FileExists exception
205
# which is okay, it will be caught later and determined
206
# to be a LockContention.
207
self.create(mode=self._dir_modebits)
209
# After creating the lock directory, try again
210
self.transport.mkdir(tmpname)
212
info_bytes = self._prepare_info()
213
# We use put_file_non_atomic because we just created a new unique
214
# directory so we don't have to worry about files existing there.
215
# We'll rename the whole directory into place to get atomic
217
self.transport.put_bytes_non_atomic(tmpname + self.__INFO_NAME,
220
self.transport.rename(tmpname, self._held_dir)
221
self._lock_held = True
223
except (PathError, DirectoryNotEmpty, FileExists, ResourceBusy), e:
224
mutter("contention on %r: %s", self, e)
225
raise LockContention(self)
228
"""Release a held lock
230
if self._fake_read_lock:
231
self._fake_read_lock = False
233
if not self._lock_held:
234
raise LockNotHeld(self)
235
# rename before deleting, because we can't atomically remove the whole
237
tmpname = '%s/releasing.%s.tmp' % (self.path, rand_chars(20))
238
# gotta own it to unlock
240
self.transport.rename(self._held_dir, tmpname)
241
self._lock_held = False
242
self.transport.delete(tmpname + self.__INFO_NAME)
243
self.transport.rmdir(tmpname)
245
def break_lock(self):
246
"""Break a lock not held by this instance of LockDir.
248
This is a UI centric function: it uses the bzrlib.ui.ui_factory to
249
prompt for input if a lock is detected and there is any doubt about
250
it possibly being still active.
252
self._check_not_locked()
253
holder_info = self.peek()
254
if holder_info is not None:
255
lock_info = '\n'.join(self._format_lock_info(holder_info))
256
if bzrlib.ui.ui_factory.get_boolean("Break %s" % lock_info):
257
self.force_break(holder_info)
259
def force_break(self, dead_holder_info):
260
"""Release a lock held by another process.
262
WARNING: This should only be used when the other process is dead; if
263
it still thinks it has the lock there will be two concurrent writers.
264
In general the user's approval should be sought for lock breaks.
266
dead_holder_info must be the result of a previous LockDir.peek() call;
267
this is used to check that it's still held by the same process that
268
the user decided was dead. If this is not the current holder,
269
LockBreakMismatch is raised.
271
After the lock is broken it will not be held by any process.
272
It is possible that another process may sneak in and take the
273
lock before the breaking process acquires it.
275
if not isinstance(dead_holder_info, dict):
276
raise ValueError("dead_holder_info: %r" % dead_holder_info)
277
self._check_not_locked()
278
current_info = self.peek()
279
if current_info is None:
280
# must have been recently released
282
if current_info != dead_holder_info:
283
raise LockBreakMismatch(self, current_info, dead_holder_info)
284
tmpname = '%s/broken.%s.tmp' % (self.path, rand_chars(20))
285
self.transport.rename(self._held_dir, tmpname)
286
# check that we actually broke the right lock, not someone else;
287
# there's a small race window between checking it and doing the
289
broken_info_path = tmpname + self.__INFO_NAME
290
broken_info = self._read_info_file(broken_info_path)
291
if broken_info != dead_holder_info:
292
raise LockBreakMismatch(self, broken_info, dead_holder_info)
293
self.transport.delete(broken_info_path)
294
self.transport.rmdir(tmpname)
296
def _check_not_locked(self):
297
"""If the lock is held by this instance, raise an error."""
299
raise AssertionError("can't break own lock: %r" % self)
302
"""Make sure that the lock is still held by this locker.
304
This should only fail if the lock was broken by user intervention,
305
or if the lock has been affected by a bug.
307
If the lock is not thought to be held, raises LockNotHeld. If
308
the lock is thought to be held but has been broken, raises
311
if not self._lock_held:
312
raise LockNotHeld(self)
315
# no lock there anymore!
316
raise LockBroken(self)
317
if info.get('nonce') != self.nonce:
318
# there is a lock, but not ours
319
raise LockBroken(self)
321
def _read_info_file(self, path):
322
"""Read one given info file.
324
peek() reads the info file of the lock holder, if any.
326
return self._parse_info(self.transport.get(path))
329
"""Check if the lock is held by anyone.
331
If it is held, this returns the lock info structure as a rio Stanza,
332
which contains some information about the current lock holder.
333
Otherwise returns None.
336
info = self._read_info_file(self._held_info_path)
337
assert isinstance(info, dict), \
338
"bad parse result %r" % info
340
except NoSuchFile, e:
343
def _prepare_info(self):
344
"""Write information about a pending lock to a temporary file.
347
# XXX: is creating this here inefficient?
348
config = bzrlib.config.GlobalConfig()
350
user = config.user_email()
351
except errors.NoEmailInUsername:
352
user = config.username()
353
s = Stanza(hostname=socket.gethostname(),
354
pid=str(os.getpid()),
355
start_time=str(int(time.time())),
361
def _parse_info(self, info_file):
362
return read_stanza(info_file.readlines()).as_dict()
364
def wait_lock(self, timeout=None, poll=None):
365
"""Wait a certain period for a lock.
367
If the lock can be acquired within the bounded time, it
368
is taken and this returns. Otherwise, LockContention
369
is raised. Either way, this function should return within
370
approximately `timeout` seconds. (It may be a bit more if
371
a transport operation takes a long time to complete.)
374
timeout = _DEFAULT_TIMEOUT_SECONDS
376
poll = _DEFAULT_POLL_SECONDS
378
# XXX: the transport interface doesn't let us guard
379
# against operations there taking a long time.
380
deadline = time.time() + timeout
387
except LockContention:
389
new_info = self.peek()
390
mutter('last_info: %s, new info: %s', last_info, new_info)
391
if new_info is not None and new_info != last_info:
392
if last_info is None:
393
start = 'Unable to obtain'
395
start = 'Lock owner changed for'
397
formatted_info = self._format_lock_info(new_info)
398
if deadline_str is None:
399
deadline_str = time.strftime('%H:%M:%S',
400
time.localtime(deadline))
401
self._report_function('%s %s\n'
403
'%s\n' # locked ... ago
404
'Will continue to try until %s\n',
411
if time.time() + poll < deadline:
414
raise LockContention(self)
416
def lock_write(self):
417
"""Wait for and acquire the lock."""
421
"""Compatibility-mode shared lock.
423
LockDir doesn't support shared read-only locks, so this
424
just pretends that the lock is taken but really does nothing.
426
# At the moment Branches are commonly locked for read, but
427
# we can't rely on that remotely. Once this is cleaned up,
428
# reenable this warning to prevent it coming back in
430
## warn("LockDir.lock_read falls back to write lock")
431
if self._lock_held or self._fake_read_lock:
432
raise LockContention(self)
433
self._fake_read_lock = True
435
def wait(self, timeout=20, poll=0.5):
436
"""Wait a certain period for a lock to be released."""
437
# XXX: the transport interface doesn't let us guard
438
# against operations there taking a long time.
439
deadline = time.time() + timeout
443
if time.time() + poll < deadline:
446
raise LockContention(self)
448
def _format_lock_info(self, info):
449
"""Turn the contents of peek() into something for the user"""
450
lock_url = self.transport.abspath(self.path)
451
delta = time.time() - int(info['start_time'])
453
'lock %s' % (lock_url,),
454
'held by %(user)s on host %(hostname)s [process #%(pid)s]' % info,
455
'locked %s' % (format_delta(delta),),
added
removed
bzrlib/lockdir.py
