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
19
See MemoryTree for more details.
23
from copy import deepcopy
28
revision as _mod_revision,
30
from bzrlib.decorators import needs_read_lock, needs_write_lock
31
from bzrlib.osutils import sha_file
32
from bzrlib.mutabletree import needs_tree_write_lock
33
from bzrlib.transport.memory import MemoryTransport
36
class MemoryTree(mutabletree.MutableTree):
37
"""A MemoryTree is a specialisation of MutableTree.
39
It maintains nearly no state outside of read_lock and write_lock
40
transactions. (it keeps a reference to the branch, and its last-revision
44
def __init__(self, branch, revision_id):
45
"""Construct a MemoryTree for branch using revision_id."""
47
self.bzrdir = branch.bzrdir
48
self._branch_revision_id = revision_id
50
self._lock_mode = None
52
@needs_tree_write_lock
53
def _add(self, files, ids, kinds):
54
"""See MutableTree._add."""
55
for f, file_id, kind in zip(files, ids, kinds):
59
self._inventory.add_path(f, kind=kind)
61
self._inventory.add_path(f, kind=kind, file_id=file_id)
64
"""See Tree.basis_tree()."""
65
return self._basis_tree
68
def create_on_branch(branch):
69
"""Create a MemoryTree for branch, using the last-revision of branch."""
70
revision_id = _mod_revision.ensure_null(branch.last_revision())
71
return MemoryTree(branch, revision_id)
73
def _gather_kinds(self, files, kinds):
74
"""See MutableTree._gather_kinds.
76
This implementation does not care about the file kind of
77
missing files, so is a no-op.
80
def get_file(self, file_id, path=None):
81
"""See Tree.get_file."""
83
path = self.id2path(file_id)
84
return self._file_transport.get(path)
86
def get_file_sha1(self, file_id, path=None, stat_value=None):
87
"""See Tree.get_file_sha1()."""
89
path = self.id2path(file_id)
90
stream = self._file_transport.get(path)
91
return sha_file(stream)
93
def get_root_id(self):
94
return self.path2id('')
96
def _comparison_data(self, entry, path):
97
"""See Tree._comparison_data."""
99
return None, False, None
100
return entry.kind, entry.executable, None
102
def path_content_summary(self, path):
103
"""See Tree.path_content_summary."""
104
id = self.path2id(path)
106
return 'missing', None, None, None
109
bytes = self._file_transport.get_bytes(path)
111
executable = self._inventory[id].executable
112
sha1 = None # no stat cache
113
return (kind, size, executable, sha1)
114
elif kind == 'directory':
115
# memory tree does not support nested trees yet.
116
return kind, None, None, None
117
elif kind == 'symlink':
118
raise NotImplementedError('symlink support')
120
raise NotImplementedError('unknown kind')
122
def _file_size(self, entry, stat_value):
123
"""See Tree._file_size."""
126
return entry.text_size
129
def get_parent_ids(self):
130
"""See Tree.get_parent_ids.
132
This implementation returns the current cached value from
135
return list(self._parent_ids)
137
def has_filename(self, filename):
138
"""See Tree.has_filename()."""
139
return self._file_transport.has(filename)
141
def is_executable(self, file_id, path=None):
142
return self._inventory[file_id].executable
144
def kind(self, file_id):
145
return self._inventory[file_id].kind
147
def mkdir(self, path, file_id=None):
148
"""See MutableTree.mkdir()."""
149
self.add(path, file_id, 'directory')
151
file_id = self.path2id(path)
152
self._file_transport.mkdir(path)
156
def last_revision(self):
157
"""See MutableTree.last_revision."""
158
return self._branch_revision_id
161
"""Lock the memory tree for reading.
163
This triggers population of data from the branch for its revision.
168
self.branch.lock_read()
169
self._lock_mode = "r"
170
self._populate_from_branch()
175
def lock_tree_write(self):
176
"""See MutableTree.lock_tree_write()."""
180
self.branch.lock_read()
181
self._lock_mode = "w"
182
self._populate_from_branch()
183
elif self._lock_mode == "r":
184
raise errors.ReadOnlyError(self)
189
def lock_write(self):
190
"""See MutableTree.lock_write()."""
194
self.branch.lock_write()
195
self._lock_mode = "w"
196
self._populate_from_branch()
197
elif self._lock_mode == "r":
198
raise errors.ReadOnlyError(self)
203
def _populate_from_branch(self):
204
"""Populate the in-tree state from the branch."""
205
self._basis_tree = self.branch.repository.revision_tree(
206
self._branch_revision_id)
207
if self._branch_revision_id == _mod_revision.NULL_REVISION:
208
self._parent_ids = []
210
self._parent_ids = [self._branch_revision_id]
211
self._inventory = deepcopy(self._basis_tree._inventory)
212
self._file_transport = MemoryTransport()
213
# TODO copy the revision trees content, or do it lazy, or something.
214
inventory_entries = self._inventory.iter_entries()
215
for path, entry in inventory_entries:
218
if entry.kind == 'directory':
219
self._file_transport.mkdir(path)
220
elif entry.kind == 'file':
221
self._file_transport.put_file(path,
222
self._basis_tree.get_file(entry.file_id))
224
raise NotImplementedError(self._populate_from_branch)
226
def put_file_bytes_non_atomic(self, file_id, bytes):
227
"""See MutableTree.put_file_bytes_non_atomic."""
228
self._file_transport.put_bytes(self.id2path(file_id), bytes)
233
This frees all cached state when the last lock context for the tree is
237
self._basis_tree = None
238
self._parent_ids = []
239
self._inventory = None
244
self._lock_mode = None
248
@needs_tree_write_lock
249
def unversion(self, file_ids):
250
"""Remove the file ids in file_ids from the current versioned set.
252
When a file_id is unversioned, all of its children are automatically
255
:param file_ids: The file ids to stop versioning.
256
:raises: NoSuchId if any fileid is not currently versioned.
258
# XXX: This should be in mutabletree, but the inventory-save action
259
# is not relevant to memory tree. Until that is done in unlock by
260
# working tree, we cannot share the implementation.
261
for file_id in file_ids:
262
if self._inventory.has_id(file_id):
263
self._inventory.remove_recursive_id(file_id)
265
raise errors.NoSuchId(self, file_id)
267
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
268
"""See MutableTree.set_parent_trees()."""
269
for revision_id in revision_ids:
270
_mod_revision.check_not_reserved_id(revision_id)
271
if len(revision_ids) == 0:
272
self._parent_ids = []
273
self._basis_tree = self.branch.repository.revision_tree(
274
_mod_revision.NULL_REVISION)
276
self._parent_ids = revision_ids
277
self._basis_tree = self.branch.repository.revision_tree(
279
self._branch_revision_id = revision_ids[0]
281
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
282
"""See MutableTree.set_parent_trees()."""
283
if len(parents_list) == 0:
284
self._parent_ids = []
285
self._basis_tree = self.branch.repository.revision_tree(
286
_mod_revision.NULL_REVISION)
288
if parents_list[0][1] is None and not allow_leftmost_as_ghost:
289
# a ghost in the left most parent
290
raise errors.GhostRevisionUnusableHere(parents_list[0][0])
291
self._parent_ids = [parent_id for parent_id, tree in parents_list]
292
if parents_list[0][1] is None or parents_list[0][1] == 'null:':
293
self._basis_tree = self.branch.repository.revision_tree(
294
_mod_revision.NULL_REVISION)
296
self._basis_tree = parents_list[0][1]
297
self._branch_revision_id = parents_list[0][0]
added
removed
bzrlib/memorytree.py
