15
14
# along with this program; if not, write to the Free Software
16
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
"""Inventories map files to their name in a revision."""
21
__copyright__ = "Copyright (C) 2005 Canonical Ltd."
22
__author__ = "Martin Pool <mbp@canonical.com>"
24
import sys, os.path, types
18
# This should really be an id randomly assigned when the tree is
19
# created, but it's not for now.
23
import sys, os.path, types, re
25
24
from sets import Set
30
29
from elementtree.ElementTree import Element, ElementTree, SubElement
32
31
from xml import XMLMixin
33
from errors import bailout
32
from errors import bailout, BzrError
36
35
from bzrlib.osutils import uuid, quotefn, splitpath, joinpath, appendpath
60
59
>>> i = Inventory()
62
>>> i.add(InventoryEntry('123', 'src', kind='directory'))
63
>>> i.add(InventoryEntry('2323', 'hello.c', parent_id='123'))
62
>>> i.add(InventoryEntry('123', 'src', 'directory', ROOT_ID))
63
>>> i.add(InventoryEntry('2323', 'hello.c', 'file', parent_id='123'))
64
64
>>> for j in i.iter_entries():
67
('src', InventoryEntry('123', 'src', kind='directory', parent_id=None))
67
('src', InventoryEntry('123', 'src', kind='directory', parent_id='TREE_ROOT'))
68
68
('src/hello.c', InventoryEntry('2323', 'hello.c', kind='file', parent_id='123'))
69
>>> i.add(InventoryEntry('2323', 'bye.c', parent_id='123'))
69
>>> i.add(InventoryEntry('2323', 'bye.c', 'file', '123'))
70
70
Traceback (most recent call last):
72
72
BzrError: ('inventory already contains entry with id {2323}', [])
73
>>> i.add(InventoryEntry('2324', 'bye.c', parent_id='123'))
74
>>> i.add(InventoryEntry('2325', 'wibble', parent_id='123', kind='directory'))
73
>>> i.add(InventoryEntry('2324', 'bye.c', 'file', '123'))
74
>>> i.add(InventoryEntry('2325', 'wibble', 'directory', '123'))
75
75
>>> i.path2id('src/wibble')
79
>>> i.add(InventoryEntry('2326', 'wibble.c', parent_id='2325'))
79
>>> i.add(InventoryEntry('2326', 'wibble.c', 'file', '2325'))
81
81
InventoryEntry('2326', 'wibble.c', kind='file', parent_id='2325')
82
82
>>> for j in i.iter_entries():
91
91
>>> i.id2path('2326')
92
92
'src/wibble/wibble.c'
94
:todo: Maybe also keep the full path of the entry, and the children?
94
TODO: Maybe also keep the full path of the entry, and the children?
95
95
But those depend on its position within a particular inventory, and
96
96
it would be nice not to need to hold the backpointer here.
98
def __init__(self, file_id, name, kind='file', text_id=None,
99
# TODO: split InventoryEntry into subclasses for files,
100
# directories, etc etc.
105
def __init__(self, file_id, name, kind, parent_id, text_id=None):
100
106
"""Create an InventoryEntry
102
108
The filename must be a single component, relative to the
103
109
parent directory; it cannot be a whole path or relative name.
105
>>> e = InventoryEntry('123', 'hello.c')
111
>>> e = InventoryEntry('123', 'hello.c', 'file', ROOT_ID)
110
>>> e = InventoryEntry('123', 'src/hello.c')
116
>>> e = InventoryEntry('123', 'src/hello.c', 'file', ROOT_ID)
111
117
Traceback (most recent call last):
112
118
BzrError: ("InventoryEntry name is not a simple filename: 'src/hello.c'", [])
115
if len(splitpath(name)) != 1:
116
bailout('InventoryEntry name is not a simple filename: %r'
120
if '/' in name or '\\' in name:
121
raise BzrCheckError('InventoryEntry name %r is invalid' % name)
119
123
self.file_id = file_id
121
assert kind in ['file', 'directory']
123
126
self.text_id = text_id
124
127
self.parent_id = parent_id
125
self.text_sha1 = None
126
self.text_size = None
128
if kind == 'directory':
133
raise BzrError("unhandled entry kind %r" % kind)
137
def sorted_children(self):
138
l = self.children.items()
130
144
other = InventoryEntry(self.file_id, self.name, self.kind,
131
self.text_id, self.parent_id)
145
self.parent_id, text_id=self.text_id)
132
146
other.text_sha1 = self.text_sha1
133
147
other.text_size = self.text_size
151
165
e.set('file_id', self.file_id)
152
166
e.set('kind', self.kind)
154
if self.text_size is not None:
168
if self.text_size != None:
155
169
e.set('text_size', '%d' % self.text_size)
157
for f in ['text_id', 'text_sha1', 'parent_id']:
171
for f in ['text_id', 'text_sha1']:
158
172
v = getattr(self, f)
176
# to be conservative, we don't externalize the root pointers
177
# for now, leaving them as null in the xml form. in a future
178
# version it will be implied by nested elements.
179
if self.parent_id != ROOT_ID:
180
assert isinstance(self.parent_id, basestring)
181
e.set('parent_id', self.parent_id)
167
188
def from_element(cls, elt):
168
189
assert elt.tag == 'entry'
169
self = cls(elt.get('file_id'), elt.get('name'), elt.get('kind'))
191
## original format inventories don't have a parent_id for
192
## nodes in the root directory, but it's cleaner to use one
194
parent_id = elt.get('parent_id')
195
if parent_id == None:
198
self = cls(elt.get('file_id'), elt.get('name'), elt.get('kind'), parent_id)
170
199
self.text_id = elt.get('text_id')
171
200
self.text_sha1 = elt.get('text_sha1')
172
self.parent_id = elt.get('parent_id')
174
202
## mutter("read inventoryentry: %r" % (elt.attrib))
228
class RootEntry(InventoryEntry):
229
def __init__(self, file_id):
230
self.file_id = file_id
232
self.kind = 'root_directory'
233
self.parent_id = None
236
def __cmp__(self, other):
239
if not isinstance(other, RootEntry):
240
return NotImplemented
241
return cmp(self.file_id, other.file_id) \
242
or cmp(self.children, other.children)
200
246
class Inventory(XMLMixin):
201
247
"""Inventory of versioned files in a tree.
203
An Inventory acts like a set of InventoryEntry items. You can
204
also look files up by their file_id or name.
206
May be read from and written to a metadata file in a tree. To
207
manipulate the inventory (for example to add a file), it is read
208
in, modified, and then written back out.
249
This describes which file_id is present at each point in the tree,
250
and possibly the SHA-1 or other information about the file.
251
Entries can be looked up either by path or by file_id.
210
253
The inventory represents a typical unix file tree, with
211
254
directories containing files and subdirectories. We never store
215
258
returned quickly.
217
260
InventoryEntry objects must not be modified after they are
261
inserted, other than through the Inventory API.
220
263
>>> inv = Inventory()
221
264
>>> inv.write_xml(sys.stdout)
224
>>> inv.add(InventoryEntry('123-123', 'hello.c'))
267
>>> inv.add(InventoryEntry('123-123', 'hello.c', 'file', ROOT_ID))
225
268
>>> inv['123-123'].name
227
>>> for file_id in inv: print file_id
231
271
May be treated as an iterator or set to look up file ids:
250
## TODO: Clear up handling of files in subdirectories; we probably
251
## do want to be able to just look them up by name but this
252
## probably means gradually walking down the path, looking up as we go.
254
## TODO: Make sure only canonical filenames are stored.
256
## TODO: Do something sensible about the possible collisions on
257
## case-losing filesystems. Perhaps we should just always forbid
260
## _tree should probably just be stored as
261
## InventoryEntry._children on each directory.
263
289
def __init__(self):
264
290
"""Create or read an inventory.
266
292
If a working directory is specified, the inventory is read
267
293
from there. If the file is specified, read from that. If not,
268
294
the inventory is created empty.
296
The inventory is created with a default root directory, with
272
# _tree is indexed by parent_id; at each level a map from name
273
# to ie. The None entry is the root.
274
self._tree = {None: {}}
299
self.root = RootEntry(ROOT_ID)
300
self._byid = {self.root.file_id: self.root}
277
303
def __iter__(self):
283
309
return len(self._byid)
286
def iter_entries(self, parent_id=None):
312
def iter_entries(self, from_dir=None):
287
313
"""Return (path, entry) pairs, in order by name."""
288
kids = self._tree[parent_id].items()
317
elif isinstance(from_dir, basestring):
318
from_dir = self._byid[from_dir]
320
kids = from_dir.children.items()
290
322
for name, ie in kids:
292
324
if ie.kind == 'directory':
293
for cn, cie in self.iter_entries(parent_id=ie.file_id):
294
yield joinpath([name, cn]), cie
297
def directories(self, include_root=True):
325
for cn, cie in self.iter_entries(from_dir=ie.file_id):
326
yield os.path.join(name, cn), cie
330
def directories(self):
298
331
"""Return (path, entry) pairs for all directories.
302
for path, entry in self.iter_entries():
303
if entry.kind == 'directory':
333
def descend(parent_ie):
334
parent_name = parent_ie.name
335
yield parent_name, parent_ie
337
# directory children in sorted order
339
for ie in parent_ie.children.itervalues():
340
if ie.kind == 'directory':
341
dn.append((ie.name, ie))
344
for name, child_ie in dn:
345
for sub_name, sub_ie in descend(child_ie):
346
yield appendpath(parent_name, sub_name), sub_ie
348
for name, ie in descend(self.root):
308
def children(self, parent_id):
309
"""Return entries that are direct children of parent_id."""
310
return self._tree[parent_id]
314
# TODO: return all paths and entries
317
353
def __contains__(self, file_id):
318
354
"""True if this entry contains a file with given id.
320
356
>>> inv = Inventory()
321
>>> inv.add(InventoryEntry('123', 'foo.c'))
357
>>> inv.add(InventoryEntry('123', 'foo.c', 'file', ROOT_ID))
331
367
"""Return the entry for given file_id.
333
369
>>> inv = Inventory()
334
>>> inv.add(InventoryEntry('123123', 'hello.c'))
370
>>> inv.add(InventoryEntry('123123', 'hello.c', 'file', ROOT_ID))
335
371
>>> inv['123123'].name
338
return self._byid[file_id]
375
return self._byid[file_id]
378
raise BzrError("can't look up file_id None")
380
raise BzrError("file_id {%s} not in inventory" % file_id)
383
def get_child(self, parent_id, filename):
384
return self[parent_id].children.get(filename)
341
387
def add(self, entry):
344
390
To add a file to a branch ready to be committed, use Branch.add,
345
391
which calls this."""
346
if entry.file_id in self:
392
if entry.file_id in self._byid:
347
393
bailout("inventory already contains entry with id {%s}" % entry.file_id)
349
if entry.parent_id != None:
350
if entry.parent_id not in self:
351
bailout("parent_id %s of new entry not found in inventory"
354
if self._tree[entry.parent_id].has_key(entry.name):
355
bailout("%s is already versioned"
356
% appendpath(self.id2path(entry.parent_id), entry.name))
396
parent = self._byid[entry.parent_id]
398
bailout("parent_id {%s} not in inventory" % entry.parent_id)
400
if parent.children.has_key(entry.name):
401
bailout("%s is already versioned" %
402
appendpath(self.id2path(parent.file_id), entry.name))
358
404
self._byid[entry.file_id] = entry
359
self._tree[entry.parent_id][entry.name] = entry
361
if entry.kind == 'directory':
362
self._tree[entry.file_id] = {}
405
parent.children[entry.name] = entry
365
408
def add_path(self, relpath, kind, file_id=None):
370
413
if len(parts) == 0:
371
414
bailout("cannot re-add root of inventory")
374
417
file_id = bzrlib.branch.gen_file_id(relpath)
376
419
parent_id = self.path2id(parts[:-1])
420
assert parent_id != None
377
421
ie = InventoryEntry(file_id, parts[-1],
378
422
kind=kind, parent_id=parent_id)
379
423
return self.add(ie)
393
437
ie = self[file_id]
395
assert self._tree[ie.parent_id][ie.name] == ie
439
assert self[ie.parent_id].children[ie.name] == ie
397
441
# TODO: Test deleting all children; maybe hoist to a separate
398
442
# deltree method?
399
443
if ie.kind == 'directory':
400
for cie in self._tree[file_id].values():
444
for cie in ie.children.values():
401
445
del self[cie.file_id]
402
del self._tree[file_id]
404
448
del self._byid[file_id]
405
del self._tree[ie.parent_id][ie.name]
449
del self[ie.parent_id].children[ie.name]
408
452
def id_set(self):
422
466
"""Construct from XML Element
424
468
>>> inv = Inventory()
425
>>> inv.add(InventoryEntry('foo.c-123981239', 'foo.c'))
469
>>> inv.add(InventoryEntry('foo.c-123981239', 'foo.c', 'file', ROOT_ID))
426
470
>>> elt = inv.to_element()
427
471
>>> inv2 = Inventory.from_element(elt)
444
488
>>> i2 = Inventory()
447
>>> i1.add(InventoryEntry('123', 'foo'))
491
>>> i1.add(InventoryEntry('123', 'foo', 'file', ROOT_ID))
450
>>> i2.add(InventoryEntry('123', 'foo'))
494
>>> i2.add(InventoryEntry('123', 'foo', 'file', ROOT_ID))
470
def id2path(self, file_id):
471
"""Return as a list the path to file_id."""
514
def get_idpath(self, file_id):
515
"""Return a list of file_ids for the path to an entry.
517
The list contains one element for each directory followed by
518
the id of the file itself. So the length of the returned list
519
is equal to the depth of the file in the tree, counting the
520
root directory as depth 1.
473
523
while file_id != None:
525
ie = self._byid[file_id]
527
bailout("file_id {%s} not found in inventory" % file_id)
528
p.insert(0, ie.file_id)
476
529
file_id = ie.parent_id
533
def id2path(self, file_id):
534
"""Return as a list the path to file_id."""
536
# get all names, skipping root
537
p = [self[fid].name for fid in self.get_idpath(file_id)[1:]]
538
return os.sep.join(p)
487
548
This returns the entry of the last component in the path,
488
549
which may be either a file or a directory.
551
Returns None iff the path is not found.
490
553
if isinstance(name, types.StringTypes):
491
554
name = splitpath(name)
556
mutter("lookup path %r" % name)
496
cie = self._tree[parent_id][f]
561
cie = parent.children[f]
497
562
assert cie.name == f
498
parent_id = cie.file_id
563
assert cie.parent_id == parent.file_id
500
566
# or raise an error?
506
def get_child(self, parent_id, child_name):
507
return self._tree[parent_id].get(child_name)
569
return parent.file_id
510
572
def has_filename(self, names):
514
576
def has_id(self, file_id):
515
assert isinstance(file_id, str)
516
577
return self._byid.has_key(file_id)
522
if __name__ == '__main__':
523
import doctest, inventory
524
doctest.testmod(inventory)
580
def rename(self, file_id, new_parent_id, new_name):
581
"""Move a file within the inventory.
583
This can change either the name, or the parent, or both.
585
This does not move the working file."""
586
if not is_valid_name(new_name):
587
bailout("not an acceptable filename: %r" % new_name)
589
new_parent = self._byid[new_parent_id]
590
if new_name in new_parent.children:
591
bailout("%r already exists in %r" % (new_name, self.id2path(new_parent_id)))
593
new_parent_idpath = self.get_idpath(new_parent_id)
594
if file_id in new_parent_idpath:
595
bailout("cannot move directory %r into a subdirectory of itself, %r"
596
% (self.id2path(file_id), self.id2path(new_parent_id)))
598
file_ie = self._byid[file_id]
599
old_parent = self._byid[file_ie.parent_id]
601
# TODO: Don't leave things messed up if this fails
603
del old_parent.children[file_ie.name]
604
new_parent.children[new_name] = file_ie
606
file_ie.name = new_name
607
file_ie.parent_id = new_parent_id
612
_NAME_RE = re.compile(r'^[^/\\]+$')
614
def is_valid_name(name):
615
return bool(_NAME_RE.match(name))