1
# Copyright (C) 2005, 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
"""RevisionTree - a Tree implementation backed by repository data for a revision."""
19
from cStringIO import StringIO
30
class RevisionTree(tree.Tree):
31
"""Tree viewing a previous revision.
33
File text can be retrieved from the text store.
36
def __init__(self, branch, inv, revision_id):
37
# for compatability the 'branch' parameter has not been renamed to
38
# repository at this point. However, we should change RevisionTree's
39
# construction to always be via Repository and not via direct
40
# construction - this will mean that we can change the constructor
41
# with much less chance of breaking client code.
42
self._repository = branch
44
self._revision_id = revision_id
45
self._rules_searcher = None
47
def supports_tree_reference(self):
50
def get_parent_ids(self):
51
"""See Tree.get_parent_ids.
53
A RevisionTree's parents match the revision graph.
55
if self._revision_id in (None, revision.NULL_REVISION):
58
parent_ids = self._repository.get_revision(
59
self._revision_id).parent_ids
62
def get_revision_id(self):
63
"""Return the revision id associated with this tree."""
64
return self._revision_id
66
def get_file_text(self, file_id, path=None):
67
_, content = list(self.iter_files_bytes([(file_id, None)]))[0]
68
return ''.join(content)
70
def get_file(self, file_id, path=None):
71
return StringIO(self.get_file_text(file_id))
73
def iter_files_bytes(self, desired_files):
74
"""See Tree.iter_files_bytes.
76
This version is implemented on top of Repository.extract_files_bytes"""
77
repo_desired_files = [(f, self.inventory[f].revision, i)
78
for f, i in desired_files]
80
for result in self._repository.iter_files_bytes(repo_desired_files):
82
except errors.RevisionNotPresent, e:
83
raise errors.NoSuchFile(e.revision_id)
85
def annotate_iter(self, file_id,
86
default_revision=revision.CURRENT_REVISION):
87
"""See Tree.annotate_iter"""
88
text_key = (file_id, self.inventory[file_id].revision)
89
annotations = self._repository.texts.annotate(text_key)
90
return [(key[-1], line) for key, line in annotations]
92
def get_file_size(self, file_id):
93
"""See Tree.get_file_size"""
94
return self._inventory[file_id].text_size
96
def get_file_sha1(self, file_id, path=None, stat_value=None):
97
ie = self._inventory[file_id]
102
def get_file_mtime(self, file_id, path=None):
103
ie = self._inventory[file_id]
104
revision = self._repository.get_revision(ie.revision)
105
return revision.timestamp
107
def is_executable(self, file_id, path=None):
108
ie = self._inventory[file_id]
109
if ie.kind != "file":
113
def has_filename(self, filename):
114
return bool(self.inventory.path2id(filename))
116
def list_files(self, include_root=False):
117
# The only files returned by this are those from the version
118
entries = self.inventory.iter_entries()
119
# skip the root for compatability with the current apis.
120
if self.inventory.root is not None and not include_root:
121
# skip the root for compatability with the current apis.
123
for path, entry in entries:
124
yield path, 'V', entry.kind, entry.file_id, entry
126
def get_symlink_target(self, file_id):
127
ie = self._inventory[file_id]
128
# Inventories store symlink targets in unicode
129
return ie.symlink_target
131
def get_reference_revision(self, file_id, path=None):
132
return self.inventory[file_id].reference_revision
134
def get_root_id(self):
135
if self.inventory.root:
136
return self.inventory.root.file_id
138
def kind(self, file_id):
139
return self._inventory[file_id].kind
141
def path_content_summary(self, path):
142
"""See Tree.path_content_summary."""
143
id = self.inventory.path2id(path)
145
return ('missing', None, None, None)
146
entry = self._inventory[id]
149
return (kind, entry.text_size, entry.executable, entry.text_sha1)
150
elif kind == 'symlink':
151
return (kind, None, None, entry.symlink_target)
153
return (kind, None, None, None)
155
def _comparison_data(self, entry, path):
157
return None, False, None
158
return entry.kind, entry.executable, None
160
def _file_size(self, entry, stat_value):
161
return entry.text_size
163
def _get_ancestors(self, default_revision):
164
return set(self._repository.get_ancestry(self._revision_id,
168
self._repository.lock_read()
171
return '<%s instance at %x, rev_id=%r>' % (
172
self.__class__.__name__, id(self), self._revision_id)
175
self._repository.unlock()
177
def walkdirs(self, prefix=""):
178
_directory = 'directory'
180
top_id = inv.path2id(prefix)
184
pending = [(prefix, '', _directory, None, top_id, None)]
187
currentdir = pending.pop()
188
# 0 - relpath, 1- basename, 2- kind, 3- stat, id, v-kind
190
relroot = currentdir[0] + '/'
193
# FIXME: stash the node in pending
194
entry = inv[currentdir[4]]
195
for name, child in entry.sorted_children():
196
toppath = relroot + name
197
dirblock.append((toppath, name, child.kind, None,
198
child.file_id, child.kind
200
yield (currentdir[0], entry.file_id), dirblock
201
# push the user specified dirs from dirblock
202
for dir in reversed(dirblock):
203
if dir[2] == _directory:
206
def _get_rules_searcher(self, default_searcher):
207
"""See Tree._get_rules_searcher."""
208
if self._rules_searcher is None:
209
self._rules_searcher = super(RevisionTree,
210
self)._get_rules_searcher(default_searcher)
211
return self._rules_searcher
214
class InterCHKRevisionTree(tree.InterTree):
215
"""Fast path optimiser for RevisionTrees with CHK inventories."""
218
def is_compatible(source, target):
219
if (isinstance(source, RevisionTree)
220
and isinstance(target, RevisionTree)):
222
# Only CHK inventories have id_to_entry attribute
223
source.inventory.id_to_entry
224
target.inventory.id_to_entry
226
except AttributeError:
230
def iter_changes(self, include_unchanged=False,
231
specific_files=None, pb=None, extra_trees=[],
232
require_versioned=True, want_unversioned=False):
233
lookup_trees = [self.source]
235
lookup_trees.extend(extra_trees)
236
if specific_files == []:
237
specific_file_ids = []
239
specific_file_ids = self.target.paths2ids(specific_files,
240
lookup_trees, require_versioned=require_versioned)
242
# FIXME: It should be possible to delegate include_unchanged handling
243
# to CHKInventory.iter_changes and do a better job there -- vila
245
if include_unchanged:
246
changed_file_ids = []
247
for result in self.target.inventory.iter_changes(self.source.inventory):
248
if (specific_file_ids is not None
249
and not result[0] in specific_file_ids):
250
# CHKMap.iter_changes is clean and fast. Better filter out
251
# the specific files *after* it did its job.
254
if include_unchanged:
255
# Keep track of yielded results (cheaper than building the
257
changed_file_ids.append(result[0])
258
if include_unchanged:
259
# CHKMap avoid being O(tree), so we go to O(tree) only if
261
# Now walk the whole inventory, excluding the already yielded
263
changed_file_ids = set(changed_file_ids)
264
for relpath, entry in self.target.inventory.iter_entries():
265
if (specific_file_ids is not None
266
and not entry.file_id in specific_file_ids):
268
if not entry.file_id in changed_file_ids:
269
yield (entry.file_id,
270
(relpath, relpath), # Not renamed
271
False, # Not modified
272
(True, True), # Still versioned
273
(entry.parent_id, entry.parent_id),
274
(entry.name, entry.name),
275
(entry.kind, entry.kind),
276
(entry.executable, entry.executable))
279
tree.InterTree.register_optimiser(InterCHKRevisionTree)
added
removed
bzrlib/revisiontree.py
