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
import os.path, os, fnmatch
23
from osutils import pumpfile, filesize, quotefn, sha_file, \
24
joinpath, splitpath, appendpath, isdir, isfile, file_kind, fingerprint_file
26
from stat import S_ISREG, S_ISDIR, ST_MODE, ST_SIZE
28
from inventory import Inventory
29
from trace import mutter, note
30
from errors import bailout
36
"""Abstract file tree.
38
There are several subclasses:
40
* `WorkingTree` exists as files on disk editable by the user.
42
* `RevisionTree` is a tree as recorded at some point in the past.
46
Trees contain an `Inventory` object, and also know how to retrieve
47
file texts mentioned in the inventory, either from a working
48
directory or from a store.
50
It is possible for trees to contain files that are not described
51
in their inventory or vice versa; for this use `filenames()`.
53
Trees can be compared, etc, regardless of whether they are working
54
trees or versioned trees.
57
def has_filename(self, filename):
58
"""True if the tree has given filename."""
59
raise NotImplementedError()
61
def has_id(self, file_id):
62
return self.inventory.has_id(file_id)
67
return iter(self.inventory)
69
def id2path(self, file_id):
70
return self.inventory.id2path(file_id)
72
def _get_inventory(self):
73
return self._inventory
75
inventory = property(_get_inventory,
76
doc="Inventory of this Tree")
78
def _check_retrieved(self, ie, f):
79
fp = fingerprint_file(f)
82
if ie.text_size != None:
83
if ie.text_size != fp['size']:
84
bailout("mismatched size for file %r in %r" % (ie.file_id, self._store),
85
["inventory expects %d bytes" % ie.text_size,
86
"file is actually %d bytes" % fp['size'],
87
"store is probably damaged/corrupt"])
89
if ie.text_sha1 != fp['sha1']:
90
bailout("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
91
["inventory expects %s" % ie.text_sha1,
92
"file is actually %s" % fp['sha1'],
93
"store is probably damaged/corrupt"])
96
def print_file(self, fileid):
97
"""Print file with id `fileid` to stdout."""
99
pumpfile(self.get_file(fileid), sys.stdout)
102
def export(self, dest):
103
"""Export this tree to a new directory.
105
`dest` should not exist, and will be created holding the
106
contents of this tree.
108
TODO: To handle subdirectories we need to create the
111
:note: If the export fails, the destination directory will be
112
left in a half-assed state.
115
mutter('export version %r' % self)
117
for dp, ie in inv.iter_entries():
119
fullpath = appendpath(dest, dp)
120
if kind == 'directory':
123
pumpfile(self.get_file(ie.file_id), file(fullpath, 'wb'))
125
bailout("don't know how to export {%s} of kind %r" % (ie.file_id, kind))
126
mutter(" export {%s} kind %s to %s" % (ie.file_id, kind, fullpath))
130
class RevisionTree(Tree):
131
"""Tree viewing a previous revision.
133
File text can be retrieved from the text store.
135
TODO: Some kind of `__repr__` method, but a good one
136
probably means knowing the branch and revision number,
137
or at least passing a description to the constructor.
140
def __init__(self, store, inv):
142
self._inventory = inv
144
def get_file(self, file_id):
145
ie = self._inventory[file_id]
146
f = self._store[ie.text_id]
147
mutter(" get fileid{%s} from %r" % (file_id, self))
148
self._check_retrieved(ie, f)
151
def get_file_size(self, file_id):
152
return self._inventory[file_id].text_size
154
def get_file_sha1(self, file_id):
155
ie = self._inventory[file_id]
158
def has_filename(self, filename):
159
return bool(self.inventory.path2id(filename))
161
def list_files(self):
162
# The only files returned by this are those from the version
163
for path, entry in self.inventory.iter_entries():
164
yield path, 'V', entry.kind, entry.file_id
167
class EmptyTree(Tree):
169
self._inventory = Inventory()
171
def has_filename(self, filename):
174
def list_files(self):
175
if False: # just to make it a generator
180
######################################################################
183
# TODO: Merge these two functions into a single one that can operate
184
# on either a whole tree or a set of files.
186
# TODO: Return the diff in order by filename, not by category or in
187
# random order. Can probably be done by lock-stepping through the
188
# filenames from both trees.
191
def file_status(filename, old_tree, new_tree):
192
"""Return single-letter status, old and new names for a file.
194
The complexity here is in deciding how to represent renames;
195
many complex cases are possible.
197
old_inv = old_tree.inventory
198
new_inv = new_tree.inventory
199
new_id = new_inv.path2id(filename)
200
old_id = old_inv.path2id(filename)
202
if not new_id and not old_id:
203
# easy: doesn't exist in either; not versioned at all
204
if new_tree.is_ignored(filename):
205
return 'I', None, None
207
return '?', None, None
209
# There is now a file of this name, great.
212
# There is no longer a file of this name, but we can describe
213
# what happened to the file that used to have
214
# this name. There are two possibilities: either it was
215
# deleted entirely, or renamed.
217
if new_inv.has_id(old_id):
218
return 'X', old_inv.id2path(old_id), new_inv.id2path(old_id)
220
return 'D', old_inv.id2path(old_id), None
222
# if the file_id is new in this revision, it is added
223
if new_id and not old_inv.has_id(new_id):
226
# if there used to be a file of this name, but that ID has now
227
# disappeared, it is deleted
228
if old_id and not new_inv.has_id(old_id):
235
def find_renames(old_inv, new_inv):
236
for file_id in old_inv:
237
if file_id not in new_inv:
239
old_name = old_inv.id2path(file_id)
240
new_name = new_inv.id2path(file_id)
241
if old_name != new_name:
242
yield (old_name, new_name)
added
removed
bzrlib/tree.py
