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(), """
31
from bzrlib.osutils import dirname
32
from bzrlib.trace import mutter, warning
40
from bzrlib.decorators import needs_read_lock, needs_write_lock
41
from bzrlib.osutils import splitpath
42
from bzrlib.symbol_versioning import DEPRECATED_PARAMETER
45
def needs_tree_write_lock(unbound):
46
"""Decorate unbound to take out and release a tree_write lock."""
47
def tree_write_locked(self, *args, **kwargs):
48
self.lock_tree_write()
50
return unbound(self, *args, **kwargs)
53
tree_write_locked.__doc__ = unbound.__doc__
54
tree_write_locked.__name__ = unbound.__name__
55
return tree_write_locked
58
class MutableTree(tree.Tree):
59
"""A MutableTree is a specialisation of Tree which is able to be mutated.
61
Generally speaking these mutations are only possible within a lock_write
62
context, and will revert if the lock is broken abnormally - but this cannot
63
be guaranteed - depending on the exact implementation of the mutable state.
65
The most common form of Mutable Tree is WorkingTree, see bzrlib.workingtree.
66
For tests we also have MemoryTree which is a MutableTree whose contents are
69
For now, we are not treating MutableTree as an interface to provide
70
conformance tests for - rather we are testing MemoryTree specifically, and
71
interface testing implementations of WorkingTree.
73
A mutable tree always has an associated Branch and BzrDir object - the
74
branch and bzrdir attributes.
77
@needs_tree_write_lock
78
def add(self, files, ids=None, kinds=None):
79
"""Add paths to the set of versioned paths.
81
Note that the command line normally calls smart_add instead,
82
which can automatically recurse.
84
This adds the files to the inventory, so that they will be
85
recorded by the next commit.
87
:param files: List of paths to add, relative to the base of the tree.
88
:param ids: If set, use these instead of automatically generated ids.
89
Must be the same length as the list of files, but may
90
contain None for ids that are to be autogenerated.
91
:param kinds: Optional parameter to specify the kinds to be used for
94
TODO: Perhaps callback with the ids and paths as they're added.
96
if isinstance(files, basestring):
97
assert(ids is None or isinstance(ids, basestring))
98
assert(kinds is None or isinstance(kinds, basestring))
102
if kinds is not None:
105
files = [path.strip('/') for path in files]
108
ids = [None] * len(files)
110
assert(len(ids) == len(files))
112
kinds = [None] * len(files)
114
assert(len(kinds) == len(files))
116
# generic constraint checks:
117
if self.is_control_filename(f):
118
raise errors.ForbiddenControlFileError(filename=f)
120
# fill out file kinds for all files [not needed when we stop
121
# caring about the instantaneous file kind within a uncommmitted tree
123
self._gather_kinds(files, kinds)
124
self._add(files, ids, kinds)
126
def add_reference(self, sub_tree):
127
"""Add a TreeReference to the tree, pointing at sub_tree"""
128
raise errors.UnsupportedOperation(self.add_reference, self)
130
def _add_reference(self, sub_tree):
131
"""Standard add_reference implementation, for use by subclasses"""
133
sub_tree_path = self.relpath(sub_tree.basedir)
134
except errors.PathNotChild:
135
raise errors.BadReferenceTarget(self, sub_tree,
136
'Target not inside tree.')
137
sub_tree_id = sub_tree.get_root_id()
138
if sub_tree_id == self.get_root_id():
139
raise errors.BadReferenceTarget(self, sub_tree,
140
'Trees have the same root id.')
141
if sub_tree_id in self.inventory:
142
raise errors.BadReferenceTarget(self, sub_tree,
143
'Root id already present in tree')
144
self._add([sub_tree_path], [sub_tree_id], ['tree-reference'])
146
def _add(self, files, ids, kinds):
147
"""Helper function for add - updates the inventory.
149
:param files: sequence of pathnames, relative to the tree root
150
:param ids: sequence of suggested ids for the files (may be None)
151
:param kinds: sequence of inventory kinds of the files (i.e. may
152
contain "tree-reference")
154
raise NotImplementedError(self._add)
156
@needs_tree_write_lock
157
def apply_inventory_delta(self, changes):
158
"""Apply changes to the inventory as an atomic operation.
160
The argument is a set of changes to apply. It must describe a
161
valid result, but the order is not important. Specifically,
162
intermediate stages *may* be invalid, such as when two files
165
The changes should be structured as a list of tuples, of the form
166
(old_path, new_path, file_id, new_entry). For creation, old_path
167
must be None. For deletion, new_path and new_entry must be None.
168
file_id is always non-None. For renames and other mutations, all
169
values must be non-None.
171
If the new_entry is a directory, its children should be an empty
172
dict. Children are handled by apply_inventory_delta itself.
174
:param changes: A list of tuples for the change to apply:
175
[(old_path, new_path, file_id, new_inventory_entry), ...]
180
for old_path, file_id in sorted(((op, f) for op, np, f, e in changes
181
if op is not None), reverse=True):
182
if file_id not in inv:
184
children[file_id] = getattr(inv[file_id], 'children', {})
185
inv.remove_recursive_id(file_id)
186
for new_path, new_entry in sorted((np, e) for op, np, f, e in
187
changes if np is not None):
188
if getattr(new_entry, 'children', None) is not None:
189
new_entry.children = children.get(new_entry.file_id, {})
191
self._write_inventory(inv)
194
def commit(self, message=None, revprops=None, *args,
196
# avoid circular imports
197
from bzrlib import commit
200
if not 'branch-nick' in revprops:
201
revprops['branch-nick'] = self.branch.nick
202
author = kwargs.pop('author', None)
203
if author is not None:
204
assert 'author' not in revprops
205
revprops['author'] = author
206
# args for wt.commit start at message from the Commit.commit method,
207
args = (message, ) + args
208
committed_id = commit.Commit().commit(working_tree=self,
209
revprops=revprops, *args, **kwargs)
212
def _gather_kinds(self, files, kinds):
213
"""Helper function for add - sets the entries of kinds."""
214
raise NotImplementedError(self._gather_kinds)
217
def last_revision(self):
218
"""Return the revision id of the last commit performed in this tree.
220
In early tree formats the result of last_revision is the same as the
221
branch last_revision, but that is no longer the case for modern tree
224
last_revision returns the left most parent id, or None if there are no
227
last_revision was deprecated as of 0.11. Please use get_parent_ids
230
raise NotImplementedError(self.last_revision)
232
def lock_tree_write(self):
233
"""Lock the working tree for write, and the branch for read.
235
This is useful for operations which only need to mutate the working
236
tree. Taking out branch write locks is a relatively expensive process
237
and may fail if the branch is on read only media. So branch write locks
238
should only be taken out when we are modifying branch data - such as in
239
operations like commit, pull, uncommit and update.
241
raise NotImplementedError(self.lock_tree_write)
243
def lock_write(self):
244
"""Lock the tree and its branch. This allows mutating calls to be made.
246
Some mutating methods will take out implicit write locks, but in
247
general you should always obtain a write lock before calling mutating
250
raise NotImplementedError(self.lock_write)
253
def mkdir(self, path, file_id=None):
254
"""Create a directory in the tree. if file_id is None, one is assigned.
256
:param path: A unicode file path.
257
:param file_id: An optional file-id.
258
:return: the file id of the new directory.
260
raise NotImplementedError(self.mkdir)
262
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
263
"""Set the parents ids of the working tree.
265
:param revision_ids: A list of revision_ids.
267
raise NotImplementedError(self.set_parent_ids)
269
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
270
"""Set the parents of the working tree.
272
:param parents_list: A list of (revision_id, tree) tuples.
273
If tree is None, then that element is treated as an unreachable
274
parent tree - i.e. a ghost.
276
raise NotImplementedError(self.set_parent_trees)
278
@needs_tree_write_lock
279
def smart_add(self, file_list, recurse=True, action=None, save=True):
280
"""Version file_list, optionally recursing into directories.
282
This is designed more towards DWIM for humans than API clarity.
283
For the specific behaviour see the help for cmd_add().
285
:param action: A reporter to be called with the inventory, parent_ie,
286
path and kind of the path being added. It may return a file_id if
287
a specific one should be used.
288
:param save: Save the inventory after completing the adds. If False
289
this provides dry-run functionality by doing the add and not saving
291
:return: A tuple - files_added, ignored_files. files_added is the count
292
of added files, and ignored_files is a dict mapping files that were
293
ignored to the rule that caused them to be ignored.
295
# not in an inner loop; and we want to remove direct use of this,
296
# so here as a reminder for now. RBC 20070703
297
from bzrlib.inventory import InventoryEntry
298
assert isinstance(recurse, bool)
300
action = add.AddAction()
303
# no paths supplied: add the entire tree.
305
# mutter("smart add of %r")
312
# validate user file paths and convert all paths to tree
313
# relative : it's cheaper to make a tree relative path an abspath
314
# than to convert an abspath to tree relative.
315
for filepath in file_list:
316
rf = _FastPath(self.relpath(filepath))
317
# validate user parameters. Our recursive code avoids adding new files
318
# that need such validation
319
if self.is_control_filename(rf.raw_path):
320
raise errors.ForbiddenControlFileError(filename=rf.raw_path)
322
abspath = self.abspath(rf.raw_path)
323
kind = osutils.file_kind(abspath)
324
if kind == 'directory':
325
# schedule the dir for scanning
328
if not InventoryEntry.versionable_kind(kind):
329
raise errors.BadFileKindError(filename=abspath, kind=kind)
330
# ensure the named path is added, so that ignore rules in the later directory
332
# we dont have a parent ie known yet.: use the relatively slower inventory
334
versioned = inv.has_filename(rf.raw_path)
337
added.extend(_add_one_and_parent(self, inv, None, rf, kind, action))
340
# no need to walk any directories at all.
341
if len(added) > 0 and save:
342
self._write_inventory(inv)
343
return added, ignored
345
# only walk the minimal parents needed: we have user_dirs to override
349
is_inside = osutils.is_inside_or_parent_of_any
350
for path in sorted(user_dirs):
351
if (prev_dir is None or not is_inside([prev_dir], path.raw_path)):
352
dirs_to_add.append((path, None))
353
prev_dir = path.raw_path
355
# dirs_to_add is initialised to a list of directories, but as we scan
356
# directories we append files to it.
357
# XXX: We should determine kind of files when we scan them rather than
358
# adding to this list. RBC 20070703
359
for directory, parent_ie in dirs_to_add:
360
# directory is tree-relative
361
abspath = self.abspath(directory.raw_path)
363
# get the contents of this directory.
365
# find the kind of the path being added.
366
kind = osutils.file_kind(abspath)
368
if not InventoryEntry.versionable_kind(kind):
369
warning("skipping %s (can't add file of kind '%s')", abspath, kind)
372
if parent_ie is not None:
373
versioned = directory.base_path in parent_ie.children
375
# without the parent ie, use the relatively slower inventory
377
versioned = inv.has_filename(directory.raw_path)
379
if kind == 'directory':
381
sub_branch = bzrdir.BzrDir.open(abspath)
383
except errors.NotBranchError:
385
except errors.UnsupportedFormatError:
390
if directory.raw_path == '':
391
# mutter("tree root doesn't need to be added")
395
# mutter("%r is already versioned", abspath)
397
# XXX: This is wrong; people *might* reasonably be trying to add
398
# subtrees as subtrees. This should probably only be done in formats
399
# which can represent subtrees, and even then perhaps only when
400
# the user asked to add subtrees. At the moment you can add them
401
# specially through 'join --reference', which is perhaps
402
# reasonable: adding a new reference is a special operation and
403
# can have a special behaviour. mbp 20070306
404
mutter("%r is a nested bzr tree", abspath)
406
_add_one(self, inv, parent_ie, directory, kind, action)
407
added.append(directory.raw_path)
409
if kind == 'directory' and not sub_tree:
410
if parent_ie is not None:
412
this_ie = parent_ie.children[directory.base_path]
414
# without the parent ie, use the relatively slower inventory
416
this_id = inv.path2id(directory.raw_path)
420
this_ie = inv[this_id]
422
for subf in sorted(os.listdir(abspath)):
423
# here we could use TreeDirectory rather than
424
# string concatenation.
425
subp = osutils.pathjoin(directory.raw_path, subf)
426
# TODO: is_control_filename is very slow. Make it faster.
427
# TreeDirectory.is_control_filename could also make this
428
# faster - its impossible for a non root dir to have a
430
if self.is_control_filename(subp):
431
mutter("skip control directory %r", subp)
432
elif subf in this_ie.children:
433
# recurse into this already versioned subdir.
434
dirs_to_add.append((_FastPath(subp, subf), this_ie))
436
# user selection overrides ignoes
437
# ignore while selecting files - if we globbed in the
438
# outer loop we would ignore user files.
439
ignore_glob = self.is_ignored(subp)
440
if ignore_glob is not None:
441
# mutter("skip ignored sub-file %r", subp)
442
ignored.setdefault(ignore_glob, []).append(subp)
444
#mutter("queue to add sub-file %r", subp)
445
dirs_to_add.append((_FastPath(subp, subf), this_ie))
449
self._write_inventory(inv)
451
self.read_working_inventory()
452
return added, ignored
455
class _FastPath(object):
456
"""A path object with fast accessors for things like basename."""
458
__slots__ = ['raw_path', 'base_path']
460
def __init__(self, path, base_path=None):
461
"""Construct a FastPath from path."""
462
if base_path is None:
463
self.base_path = osutils.basename(path)
465
self.base_path = base_path
468
def __cmp__(self, other):
469
return cmp(self.raw_path, other.raw_path)
472
return hash(self.raw_path)
475
def _add_one_and_parent(tree, inv, parent_ie, path, kind, action):
476
"""Add a new entry to the inventory and automatically add unversioned parents.
478
:param inv: Inventory which will receive the new entry.
479
:param parent_ie: Parent inventory entry if known, or None. If
480
None, the parent is looked up by name and used if present, otherwise it
481
is recursively added.
482
:param kind: Kind of new entry (file, directory, etc)
483
:param action: callback(inv, parent_ie, path, kind); return ignored.
484
:return: A list of paths which have been added.
486
# Nothing to do if path is already versioned.
487
# This is safe from infinite recursion because the tree root is
489
if parent_ie is not None:
490
# we have a parent ie already
493
# slower but does not need parent_ie
494
if inv.has_filename(path.raw_path):
496
# its really not there : add the parent
497
# note that the dirname use leads to some extra str copying etc but as
498
# there are a limited number of dirs we can be nested under, it should
499
# generally find it very fast and not recurse after that.
500
added = _add_one_and_parent(tree, inv, None,
501
_FastPath(dirname(path.raw_path)), 'directory', action)
502
parent_id = inv.path2id(dirname(path.raw_path))
503
parent_ie = inv[parent_id]
504
_add_one(tree, inv, parent_ie, path, kind, action)
505
return added + [path.raw_path]
508
def _add_one(tree, inv, parent_ie, path, kind, file_id_callback):
509
"""Add a new entry to the inventory.
511
:param inv: Inventory which will receive the new entry.
512
:param parent_ie: Parent inventory entry.
513
:param kind: Kind of new entry (file, directory, etc)
514
:param file_id_callback: callback(inv, parent_ie, path, kind); return a
515
file_id or None to generate a new file id
518
file_id = file_id_callback(inv, parent_ie, path, kind)
519
entry = inv.make_entry(kind, path.base_path, parent_ie.file_id,
added
removed
bzrlib/mutabletree.py
