1
# Copyright (C) 2006, 2007 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
"""MutableTree object.
19
See MutableTree for more details.
23
from bzrlib.lazy_import import lazy_import
24
lazy_import(globals(), """
32
from bzrlib.osutils import dirname
33
from bzrlib.revisiontree import RevisionTree
34
from bzrlib.trace import mutter, warning
42
from bzrlib.decorators import needs_read_lock, needs_write_lock
43
from bzrlib.osutils import splitpath
44
from bzrlib.symbol_versioning import DEPRECATED_PARAMETER
47
def needs_tree_write_lock(unbound):
48
"""Decorate unbound to take out and release a tree_write lock."""
49
def tree_write_locked(self, *args, **kwargs):
50
self.lock_tree_write()
52
return unbound(self, *args, **kwargs)
55
tree_write_locked.__doc__ = unbound.__doc__
56
tree_write_locked.__name__ = unbound.__name__
57
return tree_write_locked
60
class MutableTree(tree.Tree):
61
"""A MutableTree is a specialisation of Tree which is able to be mutated.
63
Generally speaking these mutations are only possible within a lock_write
64
context, and will revert if the lock is broken abnormally - but this cannot
65
be guaranteed - depending on the exact implementation of the mutable state.
67
The most common form of Mutable Tree is WorkingTree, see bzrlib.workingtree.
68
For tests we also have MemoryTree which is a MutableTree whose contents are
71
For now, we are not treating MutableTree as an interface to provide
72
conformance tests for - rather we are testing MemoryTree specifically, and
73
interface testing implementations of WorkingTree.
75
A mutable tree always has an associated Branch and BzrDir object - the
76
branch and bzrdir attributes.
79
@needs_tree_write_lock
80
def add(self, files, ids=None, kinds=None):
81
"""Add paths to the set of versioned paths.
83
Note that the command line normally calls smart_add instead,
84
which can automatically recurse.
86
This adds the files to the inventory, so that they will be
87
recorded by the next commit.
89
:param files: List of paths to add, relative to the base of the tree.
90
:param ids: If set, use these instead of automatically generated ids.
91
Must be the same length as the list of files, but may
92
contain None for ids that are to be autogenerated.
93
:param kinds: Optional parameter to specify the kinds to be used for
96
TODO: Perhaps callback with the ids and paths as they're added.
98
if isinstance(files, basestring):
99
# XXX: Passing a single string is inconsistent and should be
101
if not (ids is None or isinstance(ids, basestring)):
102
raise AssertionError()
103
if not (kinds is None or isinstance(kinds, basestring)):
104
raise AssertionError()
108
if kinds is not None:
111
files = [path.strip('/') for path in files]
114
ids = [None] * len(files)
116
if not (len(ids) == len(files)):
117
raise AssertionError()
119
kinds = [None] * len(files)
120
elif not len(kinds) == len(files):
121
raise AssertionError()
123
# generic constraint checks:
124
if self.is_control_filename(f):
125
raise errors.ForbiddenControlFileError(filename=f)
127
# fill out file kinds for all files [not needed when we stop
128
# caring about the instantaneous file kind within a uncommmitted tree
130
self._gather_kinds(files, kinds)
131
self._add(files, ids, kinds)
133
def add_reference(self, sub_tree):
134
"""Add a TreeReference to the tree, pointing at sub_tree"""
135
raise errors.UnsupportedOperation(self.add_reference, self)
137
def _add_reference(self, sub_tree):
138
"""Standard add_reference implementation, for use by subclasses"""
140
sub_tree_path = self.relpath(sub_tree.basedir)
141
except errors.PathNotChild:
142
raise errors.BadReferenceTarget(self, sub_tree,
143
'Target not inside tree.')
144
sub_tree_id = sub_tree.get_root_id()
145
if sub_tree_id == self.get_root_id():
146
raise errors.BadReferenceTarget(self, sub_tree,
147
'Trees have the same root id.')
148
if sub_tree_id in self.inventory:
149
raise errors.BadReferenceTarget(self, sub_tree,
150
'Root id already present in tree')
151
self._add([sub_tree_path], [sub_tree_id], ['tree-reference'])
153
def _add(self, files, ids, kinds):
154
"""Helper function for add - updates the inventory.
156
:param files: sequence of pathnames, relative to the tree root
157
:param ids: sequence of suggested ids for the files (may be None)
158
:param kinds: sequence of inventory kinds of the files (i.e. may
159
contain "tree-reference")
161
raise NotImplementedError(self._add)
163
@needs_tree_write_lock
164
def apply_inventory_delta(self, changes):
165
"""Apply changes to the inventory as an atomic operation.
167
:param changes: An inventory delta to apply to the working tree's
170
:seealso Inventory.apply_delta: For details on the changes parameter.
174
inv.apply_delta(changes)
175
self._write_inventory(inv)
178
def commit(self, message=None, revprops=None, *args,
180
# avoid circular imports
181
from bzrlib import commit
184
possible_master_transports=[]
185
if not 'branch-nick' in revprops:
186
revprops['branch-nick'] = self.branch._get_nick(
187
kwargs.get('local', False),
188
possible_master_transports)
189
author = kwargs.pop('author', None)
190
if author is not None:
191
if 'author' in revprops:
192
# XXX: maybe we should just accept one of them?
193
raise AssertionError('author property given twice')
194
revprops['author'] = author
195
# args for wt.commit start at message from the Commit.commit method,
196
args = (message, ) + args
197
for hook in MutableTree.hooks['start_commit']:
199
committed_id = commit.Commit().commit(working_tree=self,
201
possible_master_transports=possible_master_transports,
205
def _gather_kinds(self, files, kinds):
206
"""Helper function for add - sets the entries of kinds."""
207
raise NotImplementedError(self._gather_kinds)
209
def get_file_with_stat(self, file_id, path=None):
210
"""Get a file handle and stat object for file_id.
212
The default implementation returns (self.get_file, None) for backwards
215
:param file_id: The file id to read.
216
:param path: The path of the file, if it is known.
217
:return: A tuple (file_handle, stat_value_or_None). If the tree has
218
no stat facility, or need for a stat cache feedback during commit,
219
it may return None for the second element of the tuple.
221
return (self.get_file(file_id, path), None)
224
def last_revision(self):
225
"""Return the revision id of the last commit performed in this tree.
227
In early tree formats the result of last_revision is the same as the
228
branch last_revision, but that is no longer the case for modern tree
231
last_revision returns the left most parent id, or None if there are no
234
last_revision was deprecated as of 0.11. Please use get_parent_ids
237
raise NotImplementedError(self.last_revision)
239
def lock_tree_write(self):
240
"""Lock the working tree for write, and the branch for read.
242
This is useful for operations which only need to mutate the working
243
tree. Taking out branch write locks is a relatively expensive process
244
and may fail if the branch is on read only media. So branch write locks
245
should only be taken out when we are modifying branch data - such as in
246
operations like commit, pull, uncommit and update.
248
raise NotImplementedError(self.lock_tree_write)
250
def lock_write(self):
251
"""Lock the tree and its branch. This allows mutating calls to be made.
253
Some mutating methods will take out implicit write locks, but in
254
general you should always obtain a write lock before calling mutating
257
raise NotImplementedError(self.lock_write)
260
def mkdir(self, path, file_id=None):
261
"""Create a directory in the tree. if file_id is None, one is assigned.
263
:param path: A unicode file path.
264
:param file_id: An optional file-id.
265
:return: the file id of the new directory.
267
raise NotImplementedError(self.mkdir)
269
def _observed_sha1(self, file_id, path, (sha1, stat_value)):
270
"""Tell the tree we have observed a paths sha1.
272
The intent of this function is to allow trees that have a hashcache to
273
update the hashcache during commit. If the observed file is too new
274
(based on the stat_value) to be safely hash-cached the tree will ignore
277
The default implementation does nothing.
279
:param file_id: The file id
280
:param path: The file path
281
:param sha1: The sha 1 that was observed.
282
:param stat_value: A stat result for the file the sha1 was read from.
287
def put_file_bytes_non_atomic(self, file_id, bytes):
288
"""Update the content of a file in the tree.
290
Note that the file is written in-place rather than being
291
written to a temporary location and renamed. As a consequence,
292
readers can potentially see the file half-written.
294
:param file_id: file-id of the file
295
:param bytes: the new file contents
297
raise NotImplementedError(self.put_file_bytes_non_atomic)
299
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
300
"""Set the parents ids of the working tree.
302
:param revision_ids: A list of revision_ids.
304
raise NotImplementedError(self.set_parent_ids)
306
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
307
"""Set the parents of the working tree.
309
:param parents_list: A list of (revision_id, tree) tuples.
310
If tree is None, then that element is treated as an unreachable
311
parent tree - i.e. a ghost.
313
raise NotImplementedError(self.set_parent_trees)
315
@needs_tree_write_lock
316
def smart_add(self, file_list, recurse=True, action=None, save=True):
317
"""Version file_list, optionally recursing into directories.
319
This is designed more towards DWIM for humans than API clarity.
320
For the specific behaviour see the help for cmd_add().
322
:param action: A reporter to be called with the inventory, parent_ie,
323
path and kind of the path being added. It may return a file_id if
324
a specific one should be used.
325
:param save: Save the inventory after completing the adds. If False
326
this provides dry-run functionality by doing the add and not saving
328
:return: A tuple - files_added, ignored_files. files_added is the count
329
of added files, and ignored_files is a dict mapping files that were
330
ignored to the rule that caused them to be ignored.
332
# not in an inner loop; and we want to remove direct use of this,
333
# so here as a reminder for now. RBC 20070703
334
from bzrlib.inventory import InventoryEntry
336
action = add.AddAction()
339
# no paths supplied: add the entire tree.
341
# mutter("smart add of %r")
348
# validate user file paths and convert all paths to tree
349
# relative : it's cheaper to make a tree relative path an abspath
350
# than to convert an abspath to tree relative.
351
for filepath in file_list:
352
rf = _FastPath(self.relpath(filepath))
353
# validate user parameters. Our recursive code avoids adding new files
354
# that need such validation
355
if self.is_control_filename(rf.raw_path):
356
raise errors.ForbiddenControlFileError(filename=rf.raw_path)
358
abspath = self.abspath(rf.raw_path)
359
kind = osutils.file_kind(abspath)
360
if kind == 'directory':
361
# schedule the dir for scanning
364
if not InventoryEntry.versionable_kind(kind):
365
raise errors.BadFileKindError(filename=abspath, kind=kind)
366
# ensure the named path is added, so that ignore rules in the later directory
368
# we dont have a parent ie known yet.: use the relatively slower inventory
370
versioned = inv.has_filename(rf.raw_path)
373
added.extend(_add_one_and_parent(self, inv, None, rf, kind, action))
376
# no need to walk any directories at all.
377
if len(added) > 0 and save:
378
self._write_inventory(inv)
379
return added, ignored
381
# only walk the minimal parents needed: we have user_dirs to override
385
is_inside = osutils.is_inside_or_parent_of_any
386
for path in sorted(user_dirs):
387
if (prev_dir is None or not is_inside([prev_dir], path.raw_path)):
388
dirs_to_add.append((path, None))
389
prev_dir = path.raw_path
391
# dirs_to_add is initialised to a list of directories, but as we scan
392
# directories we append files to it.
393
# XXX: We should determine kind of files when we scan them rather than
394
# adding to this list. RBC 20070703
395
for directory, parent_ie in dirs_to_add:
396
# directory is tree-relative
397
abspath = self.abspath(directory.raw_path)
399
# get the contents of this directory.
401
# find the kind of the path being added.
402
kind = osutils.file_kind(abspath)
404
if not InventoryEntry.versionable_kind(kind):
405
warning("skipping %s (can't add file of kind '%s')", abspath, kind)
408
if parent_ie is not None:
409
versioned = directory.base_path in parent_ie.children
411
# without the parent ie, use the relatively slower inventory
413
versioned = inv.has_filename(directory.raw_path)
415
if kind == 'directory':
417
sub_branch = bzrdir.BzrDir.open(abspath)
419
except errors.NotBranchError:
421
except errors.UnsupportedFormatError:
426
if directory.raw_path == '':
427
# mutter("tree root doesn't need to be added")
431
# mutter("%r is already versioned", abspath)
433
# XXX: This is wrong; people *might* reasonably be trying to add
434
# subtrees as subtrees. This should probably only be done in formats
435
# which can represent subtrees, and even then perhaps only when
436
# the user asked to add subtrees. At the moment you can add them
437
# specially through 'join --reference', which is perhaps
438
# reasonable: adding a new reference is a special operation and
439
# can have a special behaviour. mbp 20070306
440
mutter("%r is a nested bzr tree", abspath)
442
_add_one(self, inv, parent_ie, directory, kind, action)
443
added.append(directory.raw_path)
445
if kind == 'directory' and not sub_tree:
446
if parent_ie is not None:
448
this_ie = parent_ie.children[directory.base_path]
450
# without the parent ie, use the relatively slower inventory
452
this_id = inv.path2id(directory.raw_path)
456
this_ie = inv[this_id]
458
for subf in sorted(os.listdir(abspath)):
459
# here we could use TreeDirectory rather than
460
# string concatenation.
461
subp = osutils.pathjoin(directory.raw_path, subf)
462
# TODO: is_control_filename is very slow. Make it faster.
463
# TreeDirectory.is_control_filename could also make this
464
# faster - its impossible for a non root dir to have a
466
if self.is_control_filename(subp):
467
mutter("skip control directory %r", subp)
468
elif subf in this_ie.children:
469
# recurse into this already versioned subdir.
470
dirs_to_add.append((_FastPath(subp, subf), this_ie))
472
# user selection overrides ignoes
473
# ignore while selecting files - if we globbed in the
474
# outer loop we would ignore user files.
475
ignore_glob = self.is_ignored(subp)
476
if ignore_glob is not None:
477
# mutter("skip ignored sub-file %r", subp)
478
ignored.setdefault(ignore_glob, []).append(subp)
480
#mutter("queue to add sub-file %r", subp)
481
dirs_to_add.append((_FastPath(subp, subf), this_ie))
485
self._write_inventory(inv)
487
self.read_working_inventory()
488
return added, ignored
490
def update_basis_by_delta(self, new_revid, delta):
491
"""Update the parents of this tree after a commit.
493
This gives the tree one parent, with revision id new_revid. The
494
inventory delta is applied to the current basis tree to generate the
495
inventory for the parent new_revid, and all other parent trees are
498
All the changes in the delta should be changes synchronising the basis
499
tree with some or all of the working tree, with a change to a directory
500
requiring that its contents have been recursively included. That is,
501
this is not a general purpose tree modification routine, but a helper
502
for commit which is not required to handle situations that do not arise
505
:param new_revid: The new revision id for the trees parent.
506
:param delta: An inventory delta (see apply_inventory_delta) describing
507
the changes from the current left most parent revision to new_revid.
509
# if the tree is updated by a pull to the branch, as happens in
510
# WorkingTree2, when there was no separation between branch and tree,
511
# then just clear merges, efficiency is not a concern for now as this
512
# is legacy environments only, and they are slow regardless.
513
if self.last_revision() == new_revid:
514
self.set_parent_ids([new_revid])
516
# generic implementation based on Inventory manipulation. See
517
# WorkingTree classes for optimised versions for specific format trees.
518
basis = self.basis_tree()
520
inventory = basis.inventory
522
inventory.apply_delta(delta)
523
rev_tree = RevisionTree(self.branch.repository, inventory, new_revid)
524
self.set_parent_trees([(new_revid, rev_tree)])
527
class MutableTreeHooks(hooks.Hooks):
528
"""A dictionary mapping a hook name to a list of callables for mutabletree
533
"""Create the default hooks.
536
hooks.Hooks.__init__(self)
537
# Invoked before a commit is done in a tree. New in 1.4
538
self['start_commit'] = []
541
# install the default hooks into the MutableTree class.
542
MutableTree.hooks = MutableTreeHooks()
545
class _FastPath(object):
546
"""A path object with fast accessors for things like basename."""
548
__slots__ = ['raw_path', 'base_path']
550
def __init__(self, path, base_path=None):
551
"""Construct a FastPath from path."""
552
if base_path is None:
553
self.base_path = osutils.basename(path)
555
self.base_path = base_path
558
def __cmp__(self, other):
559
return cmp(self.raw_path, other.raw_path)
562
return hash(self.raw_path)
565
def _add_one_and_parent(tree, inv, parent_ie, path, kind, action):
566
"""Add a new entry to the inventory and automatically add unversioned parents.
568
:param inv: Inventory which will receive the new entry.
569
:param parent_ie: Parent inventory entry if known, or None. If
570
None, the parent is looked up by name and used if present, otherwise it
571
is recursively added.
572
:param kind: Kind of new entry (file, directory, etc)
573
:param action: callback(inv, parent_ie, path, kind); return ignored.
574
:return: A list of paths which have been added.
576
# Nothing to do if path is already versioned.
577
# This is safe from infinite recursion because the tree root is
579
if parent_ie is not None:
580
# we have a parent ie already
583
# slower but does not need parent_ie
584
if inv.has_filename(path.raw_path):
586
# its really not there : add the parent
587
# note that the dirname use leads to some extra str copying etc but as
588
# there are a limited number of dirs we can be nested under, it should
589
# generally find it very fast and not recurse after that.
590
added = _add_one_and_parent(tree, inv, None,
591
_FastPath(dirname(path.raw_path)), 'directory', action)
592
parent_id = inv.path2id(dirname(path.raw_path))
593
parent_ie = inv[parent_id]
594
_add_one(tree, inv, parent_ie, path, kind, action)
595
return added + [path.raw_path]
598
def _add_one(tree, inv, parent_ie, path, kind, file_id_callback):
599
"""Add a new entry to the inventory.
601
:param inv: Inventory which will receive the new entry.
602
:param parent_ie: Parent inventory entry.
603
:param kind: Kind of new entry (file, directory, etc)
604
:param file_id_callback: callback(inv, parent_ie, path, kind); return a
605
file_id or None to generate a new file id
608
file_id = file_id_callback(inv, parent_ie, path, kind)
609
entry = inv.make_entry(kind, path.base_path, parent_ie.file_id,
added
removed
bzrlib/mutabletree.py
