1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
|
# Copyright (C) 2005 Canonical Ltd
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
# TODO: Don't allow WorkingTrees to be constructed for remote branches.
# FIXME: I don't know if writing out the cache from the destructor is really a
# good idea, because destructors are considered poor taste in Python, and
# it's not predictable when it will be written out.
import os
import bzrlib.tree
from errors import BzrCheckError
from trace import mutter
class WorkingTree(bzrlib.tree.Tree):
"""Working copy tree.
The inventory is held in the `Branch` working-inventory, and the
files are in a directory on disk.
It is possible for a `WorkingTree` to have a filename which is
not listed in the Inventory and vice versa.
"""
def __init__(self, basedir, inv):
from bzrlib.hashcache import HashCache
from bzrlib.trace import note, mutter
self._inventory = inv
self.basedir = basedir
self.path2id = inv.path2id
# update the whole cache up front and write to disk if anything changed;
# in the future we might want to do this more selectively
hc = self._hashcache = HashCache(basedir)
hc.read()
hc.scan()
if hc.needs_write:
mutter("write hc")
hc.write()
def __del__(self):
if self._hashcache.needs_write:
self._hashcache.write()
def __iter__(self):
"""Iterate through file_ids for this tree.
file_ids are in a WorkingTree if they are in the working inventory
and the working file exists.
"""
inv = self._inventory
for path, ie in inv.iter_entries():
if os.path.exists(self.abspath(path)):
yield ie.file_id
def __repr__(self):
return "<%s of %s>" % (self.__class__.__name__,
getattr(self, 'basedir', None))
def abspath(self, filename):
return os.path.join(self.basedir, filename)
def has_filename(self, filename):
return os.path.exists(self.abspath(filename))
def get_file(self, file_id):
return self.get_file_byname(self.id2path(file_id))
def get_file_byname(self, filename):
return file(self.abspath(filename), 'rb')
def _get_store_filename(self, file_id):
## XXX: badly named; this isn't in the store at all
return self.abspath(self.id2path(file_id))
def has_id(self, file_id):
# files that have been deleted are excluded
inv = self._inventory
if not inv.has_id(file_id):
return False
path = inv.id2path(file_id)
return os.path.exists(self.abspath(path))
__contains__ = has_id
def get_file_size(self, file_id):
# is this still called?
raise NotImplementedError()
def get_file_sha1(self, file_id):
path = self._inventory.id2path(file_id)
return self._hashcache.get_sha1(path)
def file_class(self, filename):
if self.path2id(filename):
return 'V'
elif self.is_ignored(filename):
return 'I'
else:
return '?'
def list_files(self):
"""Recursively list all files as (path, class, kind, id).
Lists, but does not descend into unversioned directories.
This does not include files that have been deleted in this
tree.
Skips the control directory.
"""
from osutils import appendpath, file_kind
import os
inv = self._inventory
def descend(from_dir_relpath, from_dir_id, dp):
ls = os.listdir(dp)
ls.sort()
for f in ls:
## TODO: If we find a subdirectory with its own .bzr
## directory, then that is a separate tree and we
## should exclude it.
if bzrlib.BZRDIR == f:
continue
# path within tree
fp = appendpath(from_dir_relpath, f)
# absolute path
fap = appendpath(dp, f)
f_ie = inv.get_child(from_dir_id, f)
if f_ie:
c = 'V'
elif self.is_ignored(fp):
c = 'I'
else:
c = '?'
fk = file_kind(fap)
if f_ie:
if f_ie.kind != fk:
raise BzrCheckError("file %r entered as kind %r id %r, "
"now of kind %r"
% (fap, f_ie.kind, f_ie.file_id, fk))
yield fp, c, fk, (f_ie and f_ie.file_id)
if fk != 'directory':
continue
if c != 'V':
# don't descend unversioned directories
continue
for ff in descend(fp, f_ie.file_id, fap):
yield ff
for f in descend('', inv.root.file_id, self.basedir):
yield f
def unknowns(self):
for subp in self.extras():
if not self.is_ignored(subp):
yield subp
def extras(self):
"""Yield all unknown files in this WorkingTree.
If there are any unknown directories then only the directory is
returned, not all its children. But if there are unknown files
under a versioned subdirectory, they are returned.
Currently returned depth-first, sorted by name within directories.
"""
## TODO: Work from given directory downwards
from osutils import isdir, appendpath
for path, dir_entry in self.inventory.directories():
mutter("search for unknowns in %r" % path)
dirabs = self.abspath(path)
if not isdir(dirabs):
# e.g. directory deleted
continue
fl = []
for subf in os.listdir(dirabs):
if (subf != '.bzr'
and (subf not in dir_entry.children)):
fl.append(subf)
fl.sort()
for subf in fl:
subp = appendpath(path, subf)
yield subp
def ignored_files(self):
"""Yield list of PATH, IGNORE_PATTERN"""
for subp in self.extras():
pat = self.is_ignored(subp)
if pat != None:
yield subp, pat
def get_ignore_list(self):
"""Return list of ignore patterns.
Cached in the Tree object after the first call.
"""
if hasattr(self, '_ignorelist'):
return self._ignorelist
l = bzrlib.DEFAULT_IGNORE[:]
if self.has_filename(bzrlib.IGNORE_FILENAME):
f = self.get_file_byname(bzrlib.IGNORE_FILENAME)
l.extend([line.rstrip("\n\r") for line in f.readlines()])
self._ignorelist = l
return l
def is_ignored(self, filename):
r"""Check whether the filename matches an ignore pattern.
Patterns containing '/' or '\' need to match the whole path;
others match against only the last component.
If the file is ignored, returns the pattern which caused it to
be ignored, otherwise None. So this can simply be used as a
boolean if desired."""
# TODO: Use '**' to match directories, and other extended
# globbing stuff from cvs/rsync.
# XXX: fnmatch is actually not quite what we want: it's only
# approximately the same as real Unix fnmatch, and doesn't
# treat dotfiles correctly and allows * to match /.
# Eventually it should be replaced with something more
# accurate.
import fnmatch
from osutils import splitpath
for pat in self.get_ignore_list():
if '/' in pat or '\\' in pat:
# as a special case, you can put ./ at the start of a
# pattern; this is good to match in the top-level
# only;
if (pat[:2] == './') or (pat[:2] == '.\\'):
newpat = pat[2:]
else:
newpat = pat
if fnmatch.fnmatchcase(filename, newpat):
return pat
else:
if fnmatch.fnmatchcase(splitpath(filename)[-1], pat):
return pat
else:
return None
|