1
# Copyright (C) 2005 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
"""Tree classes, representing directory at point in time.
21
from cStringIO import StringIO
22
from warnings import warn
25
from bzrlib import delta
26
from bzrlib.decorators import needs_read_lock
27
from bzrlib.errors import BzrError, BzrCheckError
28
from bzrlib import errors
29
from bzrlib.inventory import Inventory
30
from bzrlib.inter import InterObject
31
from bzrlib.osutils import fingerprint_file
32
import bzrlib.revision
33
from bzrlib.trace import mutter, note
37
"""Abstract file tree.
39
There are several subclasses:
41
* `WorkingTree` exists as files on disk editable by the user.
43
* `RevisionTree` is a tree as recorded at some point in the past.
45
Trees contain an `Inventory` object, and also know how to retrieve
46
file texts mentioned in the inventory, either from a working
47
directory or from a store.
49
It is possible for trees to contain files that are not described
50
in their inventory or vice versa; for this use `filenames()`.
52
Trees can be compared, etc, regardless of whether they are working
53
trees or versioned trees.
56
def changes_from(self, other, want_unchanged=False, specific_files=None,
57
extra_trees=None, require_versioned=False):
58
"""Return a TreeDelta of the changes from other to this tree.
60
:param other: A tree to compare with.
61
:param specific_files: An optional list of file paths to restrict the
62
comparison to. When mapping filenames to ids, all matches in all
63
trees (including optional extra_trees) are used, and all children of
64
matched directories are included.
65
:param want_unchanged: An optional boolean requesting the inclusion of
66
unchanged entries in the result.
67
:param extra_trees: An optional list of additional trees to use when
68
mapping the contents of specific_files (paths) to file_ids.
69
:param require_versioned: An optional boolean (defaults to False). When
70
supplied and True all the 'specific_files' must be versioned, or
71
a PathsNotVersionedError will be thrown.
73
The comparison will be performed by an InterTree object looked up on
76
# Martin observes that Tree.changes_from returns a TreeDelta and this
77
# may confuse people, because the class name of the returned object is
78
# a synonym of the object referenced in the method name.
79
return InterTree.get(other, self).compare(
80
want_unchanged=want_unchanged,
81
specific_files=specific_files,
82
extra_trees=extra_trees,
83
require_versioned=require_versioned,
87
"""Get a list of the conflicts in the tree.
89
Each conflict is an instance of bzrlib.conflicts.Conflict.
93
def get_parent_ids(self):
94
"""Get the parent ids for this tree.
96
:return: a list of parent ids. [] is returned to indicate
97
a tree with no parents.
98
:raises: BzrError if the parents are not known.
100
raise NotImplementedError(self.get_parent_ids)
102
def has_filename(self, filename):
103
"""True if the tree has given filename."""
104
raise NotImplementedError()
106
def has_id(self, file_id):
107
return self.inventory.has_id(file_id)
109
__contains__ = has_id
111
def has_or_had_id(self, file_id):
112
if file_id == self.inventory.root.file_id:
114
return self.inventory.has_id(file_id)
117
return iter(self.inventory)
119
def id2path(self, file_id):
120
return self.inventory.id2path(file_id)
122
def iter_entries_by_dir(self):
123
"""Walk the tree in 'by_dir' order.
125
This will yield each entry in the tree as a (path, entry) tuple. The
126
order that they are yielded is: the contents of a directory are
127
preceeded by the parent of a directory, and all the contents of a
128
directory are grouped together.
130
return self.inventory.iter_entries_by_dir()
132
def kind(self, file_id):
133
raise NotImplementedError("subclasses must implement kind")
135
def _get_inventory(self):
136
return self._inventory
138
def get_file_by_path(self, path):
139
return self.get_file(self._inventory.path2id(path))
141
inventory = property(_get_inventory,
142
doc="Inventory of this Tree")
144
def _check_retrieved(self, ie, f):
147
fp = fingerprint_file(f)
150
if ie.text_size != None:
151
if ie.text_size != fp['size']:
152
raise BzrError("mismatched size for file %r in %r" % (ie.file_id, self._store),
153
["inventory expects %d bytes" % ie.text_size,
154
"file is actually %d bytes" % fp['size'],
155
"store is probably damaged/corrupt"])
157
if ie.text_sha1 != fp['sha1']:
158
raise BzrError("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
159
["inventory expects %s" % ie.text_sha1,
160
"file is actually %s" % fp['sha1'],
161
"store is probably damaged/corrupt"])
164
def print_file(self, file_id):
165
"""Print file with id `file_id` to stdout."""
167
sys.stdout.write(self.get_file_text(file_id))
173
"""What files are present in this tree and unknown.
175
:return: an iterator over the unknown files.
182
def filter_unversioned_files(self, paths):
183
"""Filter out paths that are not versioned.
185
:return: set of paths.
187
# NB: we specifically *don't* call self.has_filename, because for
188
# WorkingTrees that can indicate files that exist on disk but that
190
pred = self.inventory.has_filename
191
return set((p for p in paths if not pred(p)))
195
from bzrlib.revisiontree import RevisionTree
198
class EmptyTree(Tree):
201
self._inventory = Inventory()
202
warn('EmptyTree is deprecated as of bzr 0.9 please use '
203
'repository.revision_tree instead.',
204
DeprecationWarning, stacklevel=2)
206
def get_parent_ids(self):
209
def get_symlink_target(self, file_id):
212
def has_filename(self, filename):
215
def list_files(self, include_root=True):
218
def __contains__(self, file_id):
219
return file_id in self._inventory
221
def get_file_sha1(self, file_id, path=None):
225
######################################################################
228
# TODO: Merge these two functions into a single one that can operate
229
# on either a whole tree or a set of files.
231
# TODO: Return the diff in order by filename, not by category or in
232
# random order. Can probably be done by lock-stepping through the
233
# filenames from both trees.
236
def file_status(filename, old_tree, new_tree):
237
"""Return single-letter status, old and new names for a file.
239
The complexity here is in deciding how to represent renames;
240
many complex cases are possible.
242
old_inv = old_tree.inventory
243
new_inv = new_tree.inventory
244
new_id = new_inv.path2id(filename)
245
old_id = old_inv.path2id(filename)
247
if not new_id and not old_id:
248
# easy: doesn't exist in either; not versioned at all
249
if new_tree.is_ignored(filename):
250
return 'I', None, None
252
return '?', None, None
254
# There is now a file of this name, great.
257
# There is no longer a file of this name, but we can describe
258
# what happened to the file that used to have
259
# this name. There are two possibilities: either it was
260
# deleted entirely, or renamed.
262
if new_inv.has_id(old_id):
263
return 'X', old_inv.id2path(old_id), new_inv.id2path(old_id)
265
return 'D', old_inv.id2path(old_id), None
267
# if the file_id is new in this revision, it is added
268
if new_id and not old_inv.has_id(new_id):
271
# if there used to be a file of this name, but that ID has now
272
# disappeared, it is deleted
273
if old_id and not new_inv.has_id(old_id):
280
def find_renames(old_inv, new_inv):
281
for file_id in old_inv:
282
if file_id not in new_inv:
284
old_name = old_inv.id2path(file_id)
285
new_name = new_inv.id2path(file_id)
286
if old_name != new_name:
287
yield (old_name, new_name)
290
def find_ids_across_trees(filenames, trees, require_versioned=True):
291
"""Find the ids corresponding to specified filenames.
293
All matches in all trees will be used, and all children of matched
294
directories will be used.
296
:param filenames: The filenames to find file_ids for
297
:param trees: The trees to find file_ids within
298
:param require_versioned: if true, all specified filenames must occur in
300
:return: a set of file ids for the specified filenames and their children.
304
specified_ids = _find_filename_ids_across_trees(filenames, trees,
306
return _find_children_across_trees(specified_ids, trees)
309
def _find_filename_ids_across_trees(filenames, trees, require_versioned):
310
"""Find the ids corresponding to specified filenames.
312
All matches in all trees will be used.
314
:param filenames: The filenames to find file_ids for
315
:param trees: The trees to find file_ids within
316
:param require_versioned: if true, all specified filenames must occur in
318
:return: a set of file ids for the specified filenames
321
interesting_ids = set()
322
for tree_path in filenames:
325
file_id = tree.inventory.path2id(tree_path)
326
if file_id is not None:
327
interesting_ids.add(file_id)
330
not_versioned.append(tree_path)
331
if len(not_versioned) > 0 and require_versioned:
332
raise errors.PathsNotVersionedError(not_versioned)
333
return interesting_ids
336
def _find_children_across_trees(specified_ids, trees):
337
"""Return a set including specified ids and their children
339
All matches in all trees will be used.
341
:param trees: The trees to find file_ids within
342
:return: a set containing all specified ids and their children
344
interesting_ids = set(specified_ids)
345
pending = interesting_ids
346
# now handle children of interesting ids
347
# we loop so that we handle all children of each id in both trees
348
while len(pending) > 0:
350
for file_id in pending:
352
if file_id not in tree:
354
entry = tree.inventory[file_id]
355
for child in getattr(entry, 'children', {}).itervalues():
356
if child.file_id not in interesting_ids:
357
new_pending.add(child.file_id)
358
interesting_ids.update(new_pending)
359
pending = new_pending
360
return interesting_ids
363
class InterTree(InterObject):
364
"""This class represents operations taking place between two Trees.
366
Its instances have methods like 'compare' and contain references to the
367
source and target trees these operations are to be carried out on.
369
clients of bzrlib should not need to use InterTree directly, rather they
370
should use the convenience methods on Tree such as 'Tree.compare()' which
371
will pass through to InterTree as appropriate.
377
def compare(self, want_unchanged=False, specific_files=None,
378
extra_trees=None, require_versioned=False):
379
"""Return the changes from source to target.
381
:return: A TreeDelta.
382
:param specific_files: An optional list of file paths to restrict the
383
comparison to. When mapping filenames to ids, all matches in all
384
trees (including optional extra_trees) are used, and all children of
385
matched directories are included.
386
:param want_unchanged: An optional boolean requesting the inclusion of
387
unchanged entries in the result.
388
:param extra_trees: An optional list of additional trees to use when
389
mapping the contents of specific_files (paths) to file_ids.
390
:param require_versioned: An optional boolean (defaults to False). When
391
supplied and True all the 'specific_files' must be versioned, or
392
a PathsNotVersionedError will be thrown.
394
# NB: show_status depends on being able to pass in non-versioned files and
395
# report them as unknown
396
trees = (self.source, self.target)
397
if extra_trees is not None:
398
trees = trees + tuple(extra_trees)
399
specific_file_ids = find_ids_across_trees(specific_files,
400
trees, require_versioned=require_versioned)
401
if specific_files and not specific_file_ids:
402
# All files are unversioned, so just return an empty delta
403
# _compare_trees would think we want a complete delta
404
return delta.TreeDelta()
405
return delta._compare_trees(self.source, self.target, want_unchanged,
added
removed
bzrlib/tree.py
