1
# Copyright (C) 2005, 2006, 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
# FIXME: This refactoring of the workingtree code doesn't seem to keep
18
# the WorkingTree's copy of the inventory in sync with the branch. The
19
# branch modifies its working inventory when it does a commit to make
20
# missing files permanently removed.
22
# TODO: Maybe also keep the full path of the entry, and the children?
23
# But those depend on its position within a particular inventory, and
24
# it would be nice not to need to hold the backpointer here.
26
# This should really be an id randomly assigned when the tree is
27
# created, but it's not for now.
30
from bzrlib.lazy_import import lazy_import
31
lazy_import(globals(), """
48
from bzrlib.errors import (
52
from bzrlib.symbol_versioning import deprecated_in, deprecated_method
53
from bzrlib.trace import mutter
56
class InventoryEntry(object):
57
"""Description of a versioned file.
59
An InventoryEntry has the following fields, which are also
60
present in the XML inventory-entry element:
65
(within the parent directory)
68
file_id of the parent directory, or ROOT_ID
71
the revision_id in which this variation of this file was
75
Indicates that this file should be executable on systems
79
sha-1 of the text of the file
82
size in bytes of the text of the file
84
(reading a version 4 tree created a text_id field.)
89
>>> i.add(InventoryDirectory('123', 'src', ROOT_ID))
90
InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None)
91
>>> i.add(InventoryFile('2323', 'hello.c', parent_id='123'))
92
InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None, revision=None)
93
>>> shouldbe = {0: '', 1: 'src', 2: 'src/hello.c'}
94
>>> for ix, j in enumerate(i.iter_entries()):
95
... print (j[0] == shouldbe[ix], j[1])
97
(True, InventoryDirectory('TREE_ROOT', u'', parent_id=None, revision=None))
98
(True, InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None))
99
(True, InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None, revision=None))
100
>>> i.add(InventoryFile('2324', 'bye.c', '123'))
101
InventoryFile('2324', 'bye.c', parent_id='123', sha1=None, len=None, revision=None)
102
>>> i.add(InventoryDirectory('2325', 'wibble', '123'))
103
InventoryDirectory('2325', 'wibble', parent_id='123', revision=None)
104
>>> i.path2id('src/wibble')
108
>>> i.add(InventoryFile('2326', 'wibble.c', '2325'))
109
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None, revision=None)
111
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None, revision=None)
112
>>> for path, entry in i.iter_entries():
121
>>> i.id2path('2326')
122
'src/wibble/wibble.c'
125
# Constants returned by describe_change()
127
# TODO: These should probably move to some kind of FileChangeDescription
128
# class; that's like what's inside a TreeDelta but we want to be able to
129
# generate them just for one file at a time.
131
MODIFIED_AND_RENAMED = 'modified and renamed'
135
def detect_changes(self, old_entry):
136
"""Return a (text_modified, meta_modified) from this to old_entry.
138
_read_tree_state must have been called on self and old_entry prior to
139
calling detect_changes.
143
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
144
output_to, reverse=False):
145
"""Perform a diff between two entries of the same kind."""
147
def parent_candidates(self, previous_inventories):
148
"""Find possible per-file graph parents.
150
This is currently defined by:
151
- Select the last changed revision in the parent inventory.
152
- Do deal with a short lived bug in bzr 0.8's development two entries
153
that have the same last changed but different 'x' bit settings are
156
# revision:ie mapping for each ie found in previous_inventories.
158
# identify candidate head revision ids.
159
for inv in previous_inventories:
160
if self.file_id in inv:
161
ie = inv[self.file_id]
162
if ie.revision in candidates:
163
# same revision value in two different inventories:
164
# correct possible inconsistencies:
165
# * there was a bug in revision updates with 'x' bit
168
if candidates[ie.revision].executable != ie.executable:
169
candidates[ie.revision].executable = False
170
ie.executable = False
171
except AttributeError:
174
# add this revision as a candidate.
175
candidates[ie.revision] = ie
178
@deprecated_method(deprecated_in((1, 6, 0)))
179
def get_tar_item(self, root, dp, now, tree):
180
"""Get a tarfile item and a file stream for its content."""
181
item = tarfile.TarInfo(osutils.pathjoin(root, dp).encode('utf8'))
182
# TODO: would be cool to actually set it to the timestamp of the
183
# revision it was last changed
185
fileobj = self._put_in_tar(item, tree)
189
"""Return true if the object this entry represents has textual data.
191
Note that textual data includes binary content.
193
Also note that all entries get weave files created for them.
194
This attribute is primarily used when upgrading from old trees that
195
did not have the weave index for all inventory entries.
199
def __init__(self, file_id, name, parent_id, text_id=None):
200
"""Create an InventoryEntry
202
The filename must be a single component, relative to the
203
parent directory; it cannot be a whole path or relative name.
205
>>> e = InventoryFile('123', 'hello.c', ROOT_ID)
210
>>> e = InventoryFile('123', 'src/hello.c', ROOT_ID)
211
Traceback (most recent call last):
212
InvalidEntryName: Invalid entry name: src/hello.c
214
if '/' in name or '\\' in name:
215
raise errors.InvalidEntryName(name=name)
216
self.executable = False
218
self.text_sha1 = None
219
self.text_size = None
220
self.file_id = file_id
222
self.text_id = text_id
223
self.parent_id = parent_id
224
self.symlink_target = None
225
self.reference_revision = None
227
def kind_character(self):
228
"""Return a short kind indicator useful for appending to names."""
229
raise BzrError('unknown kind %r' % self.kind)
231
known_kinds = ('file', 'directory', 'symlink')
233
def _put_in_tar(self, item, tree):
234
"""populate item for stashing in a tar, and return the content stream.
236
If no content is available, return None.
238
raise BzrError("don't know how to export {%s} of kind %r" %
239
(self.file_id, self.kind))
241
@deprecated_method(deprecated_in((1, 6, 0)))
242
def put_on_disk(self, dest, dp, tree):
243
"""Create a representation of self on disk in the prefix dest.
245
This is a template method - implement _put_on_disk in subclasses.
247
fullpath = osutils.pathjoin(dest, dp)
248
self._put_on_disk(fullpath, tree)
249
# mutter(" export {%s} kind %s to %s", self.file_id,
250
# self.kind, fullpath)
252
def _put_on_disk(self, fullpath, tree):
253
"""Put this entry onto disk at fullpath, from tree tree."""
254
raise BzrError("don't know how to export {%s} of kind %r" % (self.file_id, self.kind))
256
def sorted_children(self):
257
return sorted(self.children.items())
260
def versionable_kind(kind):
261
return (kind in ('file', 'directory', 'symlink', 'tree-reference'))
263
def check(self, checker, rev_id, inv, tree):
264
"""Check this inventory entry is intact.
266
This is a template method, override _check for kind specific
269
:param checker: Check object providing context for the checks;
270
can be used to find out what parts of the repository have already
272
:param rev_id: Revision id from which this InventoryEntry was loaded.
273
Not necessarily the last-changed revision for this file.
274
:param inv: Inventory from which the entry was loaded.
275
:param tree: RevisionTree for this entry.
277
if self.parent_id is not None:
278
if not inv.has_id(self.parent_id):
279
raise BzrCheckError('missing parent {%s} in inventory for revision {%s}'
280
% (self.parent_id, rev_id))
281
self._check(checker, rev_id, tree)
283
def _check(self, checker, rev_id, tree):
284
"""Check this inventory entry for kind specific errors."""
285
raise BzrCheckError('unknown entry kind %r in revision {%s}' %
289
"""Clone this inventory entry."""
290
raise NotImplementedError
293
def describe_change(old_entry, new_entry):
294
"""Describe the change between old_entry and this.
296
This smells of being an InterInventoryEntry situation, but as its
297
the first one, we're making it a static method for now.
299
An entry with a different parent, or different name is considered
300
to be renamed. Reparenting is an internal detail.
301
Note that renaming the parent does not trigger a rename for the
304
# TODO: Perhaps return an object rather than just a string
305
if old_entry is new_entry:
306
# also the case of both being None
308
elif old_entry is None:
310
elif new_entry is None:
312
if old_entry.kind != new_entry.kind:
314
text_modified, meta_modified = new_entry.detect_changes(old_entry)
315
if text_modified or meta_modified:
319
# TODO 20060511 (mbp, rbc) factor out 'detect_rename' here.
320
if old_entry.parent_id != new_entry.parent_id:
322
elif old_entry.name != new_entry.name:
326
if renamed and not modified:
327
return InventoryEntry.RENAMED
328
if modified and not renamed:
330
if modified and renamed:
331
return InventoryEntry.MODIFIED_AND_RENAMED
335
return ("%s(%r, %r, parent_id=%r, revision=%r)"
336
% (self.__class__.__name__,
342
def __eq__(self, other):
344
# For the case when objects are cached
346
if not isinstance(other, InventoryEntry):
347
return NotImplemented
349
return ((self.file_id == other.file_id)
350
and (self.name == other.name)
351
and (other.symlink_target == self.symlink_target)
352
and (self.text_sha1 == other.text_sha1)
353
and (self.text_size == other.text_size)
354
and (self.text_id == other.text_id)
355
and (self.parent_id == other.parent_id)
356
and (self.kind == other.kind)
357
and (self.revision == other.revision)
358
and (self.executable == other.executable)
359
and (self.reference_revision == other.reference_revision)
362
def __ne__(self, other):
363
return not (self == other)
366
raise ValueError('not hashable')
368
def _unchanged(self, previous_ie):
369
"""Has this entry changed relative to previous_ie.
371
This method should be overridden in child classes.
374
# different inv parent
375
if previous_ie.parent_id != self.parent_id:
378
elif previous_ie.name != self.name:
380
elif previous_ie.kind != self.kind:
384
def _read_tree_state(self, path, work_tree):
385
"""Populate fields in the inventory entry from the given tree.
387
Note that this should be modified to be a noop on virtual trees
388
as all entries created there are prepopulated.
390
# TODO: Rather than running this manually, we should check the
391
# working sha1 and other expensive properties when they're
392
# first requested, or preload them if they're already known
393
pass # nothing to do by default
395
def _forget_tree_state(self):
399
class RootEntry(InventoryEntry):
401
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
402
'text_id', 'parent_id', 'children', 'executable',
403
'revision', 'symlink_target', 'reference_revision']
405
def _check(self, checker, rev_id, tree):
406
"""See InventoryEntry._check"""
408
def __init__(self, file_id):
409
self.file_id = file_id
411
self.kind = 'directory'
412
self.parent_id = None
415
symbol_versioning.warn('RootEntry is deprecated as of bzr 0.10.'
416
' Please use InventoryDirectory instead.',
417
DeprecationWarning, stacklevel=2)
419
def __eq__(self, other):
420
if not isinstance(other, RootEntry):
421
return NotImplemented
423
return (self.file_id == other.file_id) \
424
and (self.children == other.children)
427
class InventoryDirectory(InventoryEntry):
428
"""A directory in an inventory."""
430
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
431
'text_id', 'parent_id', 'children', 'executable',
432
'revision', 'symlink_target', 'reference_revision']
434
def _check(self, checker, rev_id, tree):
435
"""See InventoryEntry._check"""
436
if self.text_sha1 is not None or self.text_size is not None or self.text_id is not None:
437
raise BzrCheckError('directory {%s} has text in revision {%s}'
438
% (self.file_id, rev_id))
441
other = InventoryDirectory(self.file_id, self.name, self.parent_id)
442
other.revision = self.revision
443
# note that children are *not* copied; they're pulled across when
447
def __init__(self, file_id, name, parent_id):
448
super(InventoryDirectory, self).__init__(file_id, name, parent_id)
450
self.kind = 'directory'
452
def kind_character(self):
453
"""See InventoryEntry.kind_character."""
456
def _put_in_tar(self, item, tree):
457
"""See InventoryEntry._put_in_tar."""
458
item.type = tarfile.DIRTYPE
465
def _put_on_disk(self, fullpath, tree):
466
"""See InventoryEntry._put_on_disk."""
470
class InventoryFile(InventoryEntry):
471
"""A file in an inventory."""
473
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
474
'text_id', 'parent_id', 'children', 'executable',
475
'revision', 'symlink_target', 'reference_revision']
477
def _check(self, checker, tree_revision_id, tree):
478
"""See InventoryEntry._check"""
479
key = (self.file_id, self.revision)
480
if key in checker.checked_texts:
481
prev_sha = checker.checked_texts[key]
482
if prev_sha != self.text_sha1:
484
'mismatched sha1 on {%s} in {%s} (%s != %s) %r' %
485
(self.file_id, tree_revision_id, prev_sha, self.text_sha1,
488
checker.repeated_text_cnt += 1
491
checker.checked_text_cnt += 1
492
# We can't check the length, because Weave doesn't store that
493
# information, and the whole point of looking at the weave's
494
# sha1sum is that we don't have to extract the text.
495
if (self.text_sha1 != tree._repository.texts.get_sha1s([key])[key]):
496
raise BzrCheckError('text {%s} version {%s} wrong sha1' % key)
497
checker.checked_texts[key] = self.text_sha1
500
other = InventoryFile(self.file_id, self.name, self.parent_id)
501
other.executable = self.executable
502
other.text_id = self.text_id
503
other.text_sha1 = self.text_sha1
504
other.text_size = self.text_size
505
other.revision = self.revision
508
def detect_changes(self, old_entry):
509
"""See InventoryEntry.detect_changes."""
510
text_modified = (self.text_sha1 != old_entry.text_sha1)
511
meta_modified = (self.executable != old_entry.executable)
512
return text_modified, meta_modified
514
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
515
output_to, reverse=False):
516
"""See InventoryEntry._diff."""
517
from bzrlib.diff import DiffText
518
from_file_id = self.file_id
520
to_file_id = to_entry.file_id
524
to_file_id, from_file_id = from_file_id, to_file_id
525
tree, to_tree = to_tree, tree
526
from_label, to_label = to_label, from_label
527
differ = DiffText(tree, to_tree, output_to, 'utf-8', '', '',
529
return differ.diff_text(from_file_id, to_file_id, from_label, to_label)
532
"""See InventoryEntry.has_text."""
535
def __init__(self, file_id, name, parent_id):
536
super(InventoryFile, self).__init__(file_id, name, parent_id)
539
def kind_character(self):
540
"""See InventoryEntry.kind_character."""
543
def _put_in_tar(self, item, tree):
544
"""See InventoryEntry._put_in_tar."""
545
item.type = tarfile.REGTYPE
546
fileobj = tree.get_file(self.file_id)
547
item.size = self.text_size
548
if tree.is_executable(self.file_id):
554
def _put_on_disk(self, fullpath, tree):
555
"""See InventoryEntry._put_on_disk."""
556
osutils.pumpfile(tree.get_file(self.file_id), file(fullpath, 'wb'))
557
if tree.is_executable(self.file_id):
558
os.chmod(fullpath, 0755)
560
def _read_tree_state(self, path, work_tree):
561
"""See InventoryEntry._read_tree_state."""
562
self.text_sha1 = work_tree.get_file_sha1(self.file_id, path=path)
563
# FIXME: 20050930 probe for the text size when getting sha1
564
# in _read_tree_state
565
self.executable = work_tree.is_executable(self.file_id, path=path)
568
return ("%s(%r, %r, parent_id=%r, sha1=%r, len=%s, revision=%s)"
569
% (self.__class__.__name__,
577
def _forget_tree_state(self):
578
self.text_sha1 = None
580
def _unchanged(self, previous_ie):
581
"""See InventoryEntry._unchanged."""
582
compatible = super(InventoryFile, self)._unchanged(previous_ie)
583
if self.text_sha1 != previous_ie.text_sha1:
586
# FIXME: 20050930 probe for the text size when getting sha1
587
# in _read_tree_state
588
self.text_size = previous_ie.text_size
589
if self.executable != previous_ie.executable:
594
class InventoryLink(InventoryEntry):
595
"""A file in an inventory."""
597
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
598
'text_id', 'parent_id', 'children', 'executable',
599
'revision', 'symlink_target', 'reference_revision']
601
def _check(self, checker, rev_id, tree):
602
"""See InventoryEntry._check"""
603
if self.text_sha1 is not None or self.text_size is not None or self.text_id is not None:
604
raise BzrCheckError('symlink {%s} has text in revision {%s}'
605
% (self.file_id, rev_id))
606
if self.symlink_target is None:
607
raise BzrCheckError('symlink {%s} has no target in revision {%s}'
608
% (self.file_id, rev_id))
611
other = InventoryLink(self.file_id, self.name, self.parent_id)
612
other.symlink_target = self.symlink_target
613
other.revision = self.revision
616
def detect_changes(self, old_entry):
617
"""See InventoryEntry.detect_changes."""
618
# FIXME: which _modified field should we use ? RBC 20051003
619
text_modified = (self.symlink_target != old_entry.symlink_target)
621
mutter(" symlink target changed")
622
meta_modified = False
623
return text_modified, meta_modified
625
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
626
output_to, reverse=False):
627
"""See InventoryEntry._diff."""
628
from bzrlib.diff import DiffSymlink
629
old_target = self.symlink_target
630
if to_entry is not None:
631
new_target = to_entry.symlink_target
640
new_target, old_target = old_target, new_target
641
differ = DiffSymlink(old_tree, new_tree, output_to)
642
return differ.diff_symlink(old_target, new_target)
644
def __init__(self, file_id, name, parent_id):
645
super(InventoryLink, self).__init__(file_id, name, parent_id)
646
self.kind = 'symlink'
648
def kind_character(self):
649
"""See InventoryEntry.kind_character."""
652
def _put_in_tar(self, item, tree):
653
"""See InventoryEntry._put_in_tar."""
654
item.type = tarfile.SYMTYPE
658
item.linkname = self.symlink_target
661
def _put_on_disk(self, fullpath, tree):
662
"""See InventoryEntry._put_on_disk."""
664
os.symlink(self.symlink_target, fullpath)
666
raise BzrError("Failed to create symlink %r -> %r, error: %s" % (fullpath, self.symlink_target, e))
668
def _read_tree_state(self, path, work_tree):
669
"""See InventoryEntry._read_tree_state."""
670
self.symlink_target = work_tree.get_symlink_target(self.file_id)
672
def _forget_tree_state(self):
673
self.symlink_target = None
675
def _unchanged(self, previous_ie):
676
"""See InventoryEntry._unchanged."""
677
compatible = super(InventoryLink, self)._unchanged(previous_ie)
678
if self.symlink_target != previous_ie.symlink_target:
683
class TreeReference(InventoryEntry):
685
kind = 'tree-reference'
687
def __init__(self, file_id, name, parent_id, revision=None,
688
reference_revision=None):
689
InventoryEntry.__init__(self, file_id, name, parent_id)
690
self.revision = revision
691
self.reference_revision = reference_revision
694
return TreeReference(self.file_id, self.name, self.parent_id,
695
self.revision, self.reference_revision)
697
def _read_tree_state(self, path, work_tree):
698
"""Populate fields in the inventory entry from the given tree.
700
self.reference_revision = work_tree.get_reference_revision(
703
def _forget_tree_state(self):
704
self.reference_revision = None
706
def _unchanged(self, previous_ie):
707
"""See InventoryEntry._unchanged."""
708
compatible = super(TreeReference, self)._unchanged(previous_ie)
709
if self.reference_revision != previous_ie.reference_revision:
714
class CommonInventory(object):
715
"""Basic inventory logic, defined in terms of primitives like has_id."""
717
def __contains__(self, file_id):
718
"""True if this entry contains a file with given id.
720
>>> inv = Inventory()
721
>>> inv.add(InventoryFile('123', 'foo.c', ROOT_ID))
722
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
728
Note that this method along with __iter__ are not encouraged for use as
729
they are less clear than specific query methods - they may be rmeoved
732
return self.has_id(file_id)
734
def id2path(self, file_id):
735
"""Return as a string the path to file_id.
738
>>> e = i.add(InventoryDirectory('src-id', 'src', ROOT_ID))
739
>>> e = i.add(InventoryFile('foo-id', 'foo.c', parent_id='src-id'))
740
>>> print i.id2path('foo-id')
743
# get all names, skipping root
744
return '/'.join(reversed(
745
[parent.name for parent in
746
self._iter_file_id_parents(file_id)][:-1]))
748
def iter_entries(self, from_dir=None, recursive=True):
749
"""Return (path, entry) pairs, in order by name.
751
:param from_dir: if None, start from the root,
752
otherwise start from this directory (either file-id or entry)
753
:param recursive: recurse into directories or not
756
if self.root is None:
760
elif isinstance(from_dir, basestring):
761
from_dir = self[from_dir]
763
# unrolling the recursive called changed the time from
764
# 440ms/663ms (inline/total) to 116ms/116ms
765
children = from_dir.children.items()
768
for name, ie in children:
771
children = collections.deque(children)
772
stack = [(u'', children)]
774
from_dir_relpath, children = stack[-1]
777
name, ie = children.popleft()
779
# we know that from_dir_relpath never ends in a slash
780
# and 'f' doesn't begin with one, we can do a string op, rather
781
# than the checks of pathjoin(), though this means that all paths
783
path = from_dir_relpath + '/' + name
787
if ie.kind != 'directory':
790
# But do this child first
791
new_children = ie.children.items()
793
new_children = collections.deque(new_children)
794
stack.append((path, new_children))
795
# Break out of inner loop, so that we start outer loop with child
798
# if we finished all children, pop it off the stack
801
def iter_entries_by_dir(self, from_dir=None, specific_file_ids=None,
802
yield_parents=False):
803
"""Iterate over the entries in a directory first order.
805
This returns all entries for a directory before returning
806
the entries for children of a directory. This is not
807
lexicographically sorted order, and is a hybrid between
808
depth-first and breadth-first.
810
:param yield_parents: If True, yield the parents from the root leading
811
down to specific_file_ids that have been requested. This has no
812
impact if specific_file_ids is None.
813
:return: This yields (path, entry) pairs
815
if specific_file_ids and not isinstance(specific_file_ids, set):
816
specific_file_ids = set(specific_file_ids)
817
# TODO? Perhaps this should return the from_dir so that the root is
818
# yielded? or maybe an option?
820
if self.root is None:
822
# Optimize a common case
823
if (not yield_parents and specific_file_ids is not None and
824
len(specific_file_ids) == 1):
825
file_id = list(specific_file_ids)[0]
827
yield self.id2path(file_id), self[file_id]
830
if (specific_file_ids is None or yield_parents or
831
self.root.file_id in specific_file_ids):
833
elif isinstance(from_dir, basestring):
834
from_dir = self[from_dir]
836
if specific_file_ids is not None:
837
# TODO: jam 20070302 This could really be done as a loop rather
838
# than a bunch of recursive calls.
841
def add_ancestors(file_id):
842
if file_id not in byid:
844
parent_id = byid[file_id].parent_id
845
if parent_id is None:
847
if parent_id not in parents:
848
parents.add(parent_id)
849
add_ancestors(parent_id)
850
for file_id in specific_file_ids:
851
add_ancestors(file_id)
855
stack = [(u'', from_dir)]
857
cur_relpath, cur_dir = stack.pop()
860
for child_name, child_ie in sorted(cur_dir.children.iteritems()):
862
child_relpath = cur_relpath + child_name
864
if (specific_file_ids is None or
865
child_ie.file_id in specific_file_ids or
866
(yield_parents and child_ie.file_id in parents)):
867
yield child_relpath, child_ie
869
if child_ie.kind == 'directory':
870
if parents is None or child_ie.file_id in parents:
871
child_dirs.append((child_relpath+'/', child_ie))
872
stack.extend(reversed(child_dirs))
874
def _make_delta(self, old):
875
"""Make an inventory delta from two inventories."""
878
adds = new_ids - old_ids
879
deletes = old_ids - new_ids
880
common = old_ids.intersection(new_ids)
882
for file_id in deletes:
883
delta.append((old.id2path(file_id), None, file_id, None))
885
delta.append((None, self.id2path(file_id), file_id, self[file_id]))
886
for file_id in common:
887
if old[file_id] != self[file_id]:
888
delta.append((old.id2path(file_id), self.id2path(file_id),
889
file_id, self[file_id]))
892
def _get_mutable_inventory(self):
893
"""Returns a mutable copy of the object.
895
Some inventories are immutable, yet working trees, for example, needs
896
to mutate exisiting inventories instead of creating a new one.
898
raise NotImplementedError(self._get_mutable_inventory)
900
def make_entry(self, kind, name, parent_id, file_id=None):
901
"""Simple thunk to bzrlib.inventory.make_entry."""
902
return make_entry(kind, name, parent_id, file_id)
905
"""Return list of (path, ie) for all entries except the root.
907
This may be faster than iter_entries.
910
def descend(dir_ie, dir_path):
911
kids = dir_ie.children.items()
913
for name, ie in kids:
914
child_path = osutils.pathjoin(dir_path, name)
915
accum.append((child_path, ie))
916
if ie.kind == 'directory':
917
descend(ie, child_path)
919
descend(self.root, u'')
922
def directories(self):
923
"""Return (path, entry) pairs for all directories, including the root.
926
def descend(parent_ie, parent_path):
927
accum.append((parent_path, parent_ie))
929
kids = [(ie.name, ie) for ie in parent_ie.children.itervalues() if ie.kind == 'directory']
932
for name, child_ie in kids:
933
child_path = osutils.pathjoin(parent_path, name)
934
descend(child_ie, child_path)
935
descend(self.root, u'')
938
def path2id(self, name):
939
"""Walk down through directories to return entry of last component.
941
names may be either a list of path components, or a single
942
string, in which case it is automatically split.
944
This returns the entry of the last component in the path,
945
which may be either a file or a directory.
947
Returns None IFF the path is not found.
949
if isinstance(name, basestring):
950
name = osutils.splitpath(name)
952
# mutter("lookup path %r" % name)
956
except errors.NoSuchId:
957
# root doesn't exist yet so nothing else can
963
children = getattr(parent, 'children', None)
972
return parent.file_id
974
def filter(self, specific_fileids):
975
"""Get an inventory view filtered against a set of file-ids.
977
Children of directories and parents are included.
979
The result may or may not reference the underlying inventory
980
so it should be treated as immutable.
982
interesting_parents = set()
983
for fileid in specific_fileids:
985
interesting_parents.update(self.get_idpath(fileid))
986
except errors.NoSuchId:
987
# This fileid is not in the inventory - that's ok
989
entries = self.iter_entries()
990
if self.root is None:
991
return Inventory(root_id=None)
992
other = Inventory(entries.next()[1].file_id)
993
other.root.revision = self.root.revision
994
other.revision_id = self.revision_id
995
directories_to_expand = set()
996
for path, entry in entries:
997
file_id = entry.file_id
998
if (file_id in specific_fileids
999
or entry.parent_id in directories_to_expand):
1000
if entry.kind == 'directory':
1001
directories_to_expand.add(file_id)
1002
elif file_id not in interesting_parents:
1004
other.add(entry.copy())
1007
def get_idpath(self, file_id):
1008
"""Return a list of file_ids for the path to an entry.
1010
The list contains one element for each directory followed by
1011
the id of the file itself. So the length of the returned list
1012
is equal to the depth of the file in the tree, counting the
1013
root directory as depth 1.
1016
for parent in self._iter_file_id_parents(file_id):
1017
p.insert(0, parent.file_id)
1021
class Inventory(CommonInventory):
1022
"""Inventory of versioned files in a tree.
1024
This describes which file_id is present at each point in the tree,
1025
and possibly the SHA-1 or other information about the file.
1026
Entries can be looked up either by path or by file_id.
1028
The inventory represents a typical unix file tree, with
1029
directories containing files and subdirectories. We never store
1030
the full path to a file, because renaming a directory implicitly
1031
moves all of its contents. This class internally maintains a
1032
lookup tree that allows the children under a directory to be
1035
InventoryEntry objects must not be modified after they are
1036
inserted, other than through the Inventory API.
1038
>>> inv = Inventory()
1039
>>> inv.add(InventoryFile('123-123', 'hello.c', ROOT_ID))
1040
InventoryFile('123-123', 'hello.c', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
1041
>>> inv['123-123'].name
1044
May be treated as an iterator or set to look up file ids:
1046
>>> bool(inv.path2id('hello.c'))
1048
>>> '123-123' in inv
1051
May also look up by name:
1053
>>> [x[0] for x in inv.iter_entries()]
1055
>>> inv = Inventory('TREE_ROOT-12345678-12345678')
1056
>>> inv.add(InventoryFile('123-123', 'hello.c', ROOT_ID))
1057
Traceback (most recent call last):
1058
BzrError: parent_id {TREE_ROOT} not in inventory
1059
>>> inv.add(InventoryFile('123-123', 'hello.c', 'TREE_ROOT-12345678-12345678'))
1060
InventoryFile('123-123', 'hello.c', parent_id='TREE_ROOT-12345678-12345678', sha1=None, len=None, revision=None)
1062
def __init__(self, root_id=ROOT_ID, revision_id=None):
1063
"""Create or read an inventory.
1065
If a working directory is specified, the inventory is read
1066
from there. If the file is specified, read from that. If not,
1067
the inventory is created empty.
1069
The inventory is created with a default root directory, with
1072
if root_id is not None:
1073
self._set_root(InventoryDirectory(root_id, u'', None))
1077
self.revision_id = revision_id
1080
# More than one page of ouput is not useful anymore to debug
1083
contents = repr(self._byid)
1084
if len(contents) > max_len:
1085
contents = contents[:(max_len-len(closing))] + closing
1086
return "<Inventory object at %x, contents=%r>" % (id(self), contents)
1088
def apply_delta(self, delta):
1089
"""Apply a delta to this inventory.
1091
See the inventory developers documentation for the theory behind
1094
:param delta: A list of changes to apply. After all the changes are
1095
applied the final inventory must be internally consistent, but it
1096
is ok to supply changes which, if only half-applied would have an
1097
invalid result - such as supplying two changes which rename two
1098
files, 'A' and 'B' with each other : [('A', 'B', 'A-id', a_entry),
1099
('B', 'A', 'B-id', b_entry)].
1101
Each change is a tuple, of the form (old_path, new_path, file_id,
1104
When new_path is None, the change indicates the removal of an entry
1105
from the inventory and new_entry will be ignored (using None is
1106
appropriate). If new_path is not None, then new_entry must be an
1107
InventoryEntry instance, which will be incorporated into the
1108
inventory (and replace any existing entry with the same file id).
1110
When old_path is None, the change indicates the addition of
1111
a new entry to the inventory.
1113
When neither new_path nor old_path are None, the change is a
1114
modification to an entry, such as a rename, reparent, kind change
1117
The children attribute of new_entry is ignored. This is because
1118
this method preserves children automatically across alterations to
1119
the parent of the children, and cases where the parent id of a
1120
child is changing require the child to be passed in as a separate
1121
change regardless. E.g. in the recursive deletion of a directory -
1122
the directory's children must be included in the delta, or the
1123
final inventory will be invalid.
1125
Note that a file_id must only appear once within a given delta.
1126
An AssertionError is raised otherwise.
1128
# Check that the delta is legal. It would be nice if this could be
1129
# done within the loops below but it's safer to validate the delta
1130
# before starting to mutate the inventory, as there isn't a rollback
1132
list(_check_delta_unique_ids(_check_delta_unique_new_paths(
1133
_check_delta_unique_old_paths(_check_delta_ids_match_entry(
1137
# Remove all affected items which were in the original inventory,
1138
# starting with the longest paths, thus ensuring parents are examined
1139
# after their children, which means that everything we examine has no
1140
# modified children remaining by the time we examine it.
1141
for old_path, file_id in sorted(((op, f) for op, np, f, e in delta
1142
if op is not None), reverse=True):
1143
if file_id not in self:
1146
# Preserve unaltered children of file_id for later reinsertion.
1147
file_id_children = getattr(self[file_id], 'children', {})
1148
if len(file_id_children):
1149
children[file_id] = file_id_children
1150
# Remove file_id and the unaltered children. If file_id is not
1151
# being deleted it will be reinserted back later.
1152
self.remove_recursive_id(file_id)
1153
# Insert all affected which should be in the new inventory, reattaching
1154
# their children if they had any. This is done from shortest path to
1155
# longest, ensuring that items which were modified and whose parents in
1156
# the resulting inventory were also modified, are inserted after their
1158
for new_path, new_entry in sorted((np, e) for op, np, f, e in
1159
delta if np is not None):
1160
if new_entry.kind == 'directory':
1161
# Pop the child which to allow detection of children whose
1162
# parents were deleted and which were not reattached to a new
1164
replacement = InventoryDirectory(new_entry.file_id,
1165
new_entry.name, new_entry.parent_id)
1166
replacement.revision = new_entry.revision
1167
replacement.children = children.pop(replacement.file_id, {})
1168
new_entry = replacement
1171
except AttributeError:
1172
raise errors.InconsistentDelta(new_path, new_entry.file_id,
1173
"Parent is not a directory.")
1175
# Get the parent id that was deleted
1176
parent_id, children = children.popitem()
1177
raise errors.InconsistentDelta("<deleted>", parent_id,
1178
"The file id was deleted but its children were not deleted.")
1180
def _set_root(self, ie):
1182
self._byid = {self.root.file_id: self.root}
1185
# TODO: jam 20051218 Should copy also copy the revision_id?
1186
entries = self.iter_entries()
1187
if self.root is None:
1188
return Inventory(root_id=None)
1189
other = Inventory(entries.next()[1].file_id)
1190
other.root.revision = self.root.revision
1191
# copy recursively so we know directories will be added before
1192
# their children. There are more efficient ways than this...
1193
for path, entry in entries:
1194
other.add(entry.copy())
1197
def _get_mutable_inventory(self):
1198
"""See CommonInventory._get_mutable_inventory."""
1199
return copy.deepcopy(self)
1202
"""Iterate over all file-ids."""
1203
return iter(self._byid)
1205
def iter_just_entries(self):
1206
"""Iterate over all entries.
1208
Unlike iter_entries(), just the entries are returned (not (path, ie))
1209
and the order of entries is undefined.
1211
XXX: We may not want to merge this into bzr.dev.
1213
if self.root is None:
1215
for _, ie in self._byid.iteritems():
1219
"""Returns number of entries."""
1220
return len(self._byid)
1222
def __getitem__(self, file_id):
1223
"""Return the entry for given file_id.
1225
>>> inv = Inventory()
1226
>>> inv.add(InventoryFile('123123', 'hello.c', ROOT_ID))
1227
InventoryFile('123123', 'hello.c', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
1228
>>> inv['123123'].name
1232
return self._byid[file_id]
1234
# really we're passing an inventory, not a tree...
1235
raise errors.NoSuchId(self, file_id)
1237
def get_file_kind(self, file_id):
1238
return self._byid[file_id].kind
1240
def get_child(self, parent_id, filename):
1241
return self[parent_id].children.get(filename)
1243
def _add_child(self, entry):
1244
"""Add an entry to the inventory, without adding it to its parent"""
1245
if entry.file_id in self._byid:
1246
raise BzrError("inventory already contains entry with id {%s}" %
1248
self._byid[entry.file_id] = entry
1249
for child in getattr(entry, 'children', {}).itervalues():
1250
self._add_child(child)
1253
def add(self, entry):
1254
"""Add entry to inventory.
1256
To add a file to a branch ready to be committed, use Branch.add,
1259
Returns the new entry object.
1261
if entry.file_id in self._byid:
1262
raise errors.DuplicateFileId(entry.file_id,
1263
self._byid[entry.file_id])
1265
if entry.parent_id is None:
1269
parent = self._byid[entry.parent_id]
1271
raise errors.InconsistentDelta("<unknown>", entry.parent_id,
1272
"Parent not in inventory.")
1273
if entry.name in parent.children:
1274
raise errors.InconsistentDelta(
1275
self.id2path(parent.children[entry.name].file_id),
1277
"Path already versioned")
1278
parent.children[entry.name] = entry
1279
return self._add_child(entry)
1281
def add_path(self, relpath, kind, file_id=None, parent_id=None):
1282
"""Add entry from a path.
1284
The immediate parent must already be versioned.
1286
Returns the new entry object."""
1288
parts = osutils.splitpath(relpath)
1292
file_id = generate_ids.gen_root_id()
1293
self.root = InventoryDirectory(file_id, '', None)
1294
self._byid = {self.root.file_id: self.root}
1297
parent_path = parts[:-1]
1298
parent_id = self.path2id(parent_path)
1299
if parent_id is None:
1300
raise errors.NotVersionedError(path=parent_path)
1301
ie = make_entry(kind, parts[-1], parent_id, file_id)
1304
def __delitem__(self, file_id):
1305
"""Remove entry by id.
1307
>>> inv = Inventory()
1308
>>> inv.add(InventoryFile('123', 'foo.c', ROOT_ID))
1309
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
1317
del self._byid[file_id]
1318
if ie.parent_id is not None:
1319
del self[ie.parent_id].children[ie.name]
1321
def __eq__(self, other):
1322
"""Compare two sets by comparing their contents.
1324
>>> i1 = Inventory()
1325
>>> i2 = Inventory()
1328
>>> i1.add(InventoryFile('123', 'foo', ROOT_ID))
1329
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
1332
>>> i2.add(InventoryFile('123', 'foo', ROOT_ID))
1333
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None, revision=None)
1337
if not isinstance(other, Inventory):
1338
return NotImplemented
1340
return self._byid == other._byid
1342
def __ne__(self, other):
1343
return not self.__eq__(other)
1346
raise ValueError('not hashable')
1348
def _iter_file_id_parents(self, file_id):
1349
"""Yield the parents of file_id up to the root."""
1350
while file_id is not None:
1352
ie = self._byid[file_id]
1354
raise errors.NoSuchId(tree=None, file_id=file_id)
1356
file_id = ie.parent_id
1358
def has_filename(self, filename):
1359
return bool(self.path2id(filename))
1361
def has_id(self, file_id):
1362
return (file_id in self._byid)
1364
def _make_delta(self, old):
1365
"""Make an inventory delta from two inventories."""
1366
old_getter = getattr(old, '_byid', old)
1367
new_getter = self._byid
1368
old_ids = set(old_getter)
1369
new_ids = set(new_getter)
1370
adds = new_ids - old_ids
1371
deletes = old_ids - new_ids
1372
if not adds and not deletes:
1375
common = old_ids.intersection(new_ids)
1377
for file_id in deletes:
1378
delta.append((old.id2path(file_id), None, file_id, None))
1379
for file_id in adds:
1380
delta.append((None, self.id2path(file_id), file_id, self[file_id]))
1381
for file_id in common:
1382
new_ie = new_getter[file_id]
1383
old_ie = old_getter[file_id]
1384
# If xml_serializer returns the cached InventoryEntries (rather
1385
# than always doing .copy()), inlining the 'is' check saves 2.7M
1386
# calls to __eq__. Under lsprof this saves 20s => 6s.
1387
# It is a minor improvement without lsprof.
1388
if old_ie is new_ie or old_ie == new_ie:
1391
delta.append((old.id2path(file_id), self.id2path(file_id),
1395
def remove_recursive_id(self, file_id):
1396
"""Remove file_id, and children, from the inventory.
1398
:param file_id: A file_id to remove.
1400
to_find_delete = [self._byid[file_id]]
1402
while to_find_delete:
1403
ie = to_find_delete.pop()
1404
to_delete.append(ie.file_id)
1405
if ie.kind == 'directory':
1406
to_find_delete.extend(ie.children.values())
1407
for file_id in reversed(to_delete):
1409
del self._byid[file_id]
1410
if ie.parent_id is not None:
1411
del self[ie.parent_id].children[ie.name]
1415
def rename(self, file_id, new_parent_id, new_name):
1416
"""Move a file within the inventory.
1418
This can change either the name, or the parent, or both.
1420
This does not move the working file.
1422
new_name = ensure_normalized_name(new_name)
1423
if not is_valid_name(new_name):
1424
raise BzrError("not an acceptable filename: %r" % new_name)
1426
new_parent = self._byid[new_parent_id]
1427
if new_name in new_parent.children:
1428
raise BzrError("%r already exists in %r" % (new_name, self.id2path(new_parent_id)))
1430
new_parent_idpath = self.get_idpath(new_parent_id)
1431
if file_id in new_parent_idpath:
1432
raise BzrError("cannot move directory %r into a subdirectory of itself, %r"
1433
% (self.id2path(file_id), self.id2path(new_parent_id)))
1435
file_ie = self._byid[file_id]
1436
old_parent = self._byid[file_ie.parent_id]
1438
# TODO: Don't leave things messed up if this fails
1440
del old_parent.children[file_ie.name]
1441
new_parent.children[new_name] = file_ie
1443
file_ie.name = new_name
1444
file_ie.parent_id = new_parent_id
1446
def is_root(self, file_id):
1447
return self.root is not None and file_id == self.root.file_id
1450
class CHKInventory(CommonInventory):
1451
"""An inventory persisted in a CHK store.
1453
By design, a CHKInventory is immutable so many of the methods
1454
supported by Inventory - add, rename, apply_delta, etc - are *not*
1455
supported. To create a new CHKInventory, use create_by_apply_delta()
1456
or from_inventory(), say.
1458
Internally, a CHKInventory has one or two CHKMaps:
1460
* id_to_entry - a map from (file_id,) => InventoryEntry as bytes
1461
* parent_id_basename_to_file_id - a map from (parent_id, basename_utf8)
1464
The second map is optional and not present in early CHkRepository's.
1466
No caching is performed: every method call or item access will perform
1467
requests to the storage layer. As such, keep references to objects you
1471
def __init__(self, search_key_name):
1472
CommonInventory.__init__(self)
1473
self._fileid_to_entry_cache = {}
1474
self._path_to_fileid_cache = {}
1475
self._search_key_name = search_key_name
1477
def __eq__(self, other):
1478
"""Compare two sets by comparing their contents."""
1479
if not isinstance(other, CHKInventory):
1480
return NotImplemented
1482
this_key = self.id_to_entry.key()
1483
other_key = other.id_to_entry.key()
1484
this_pid_key = self.parent_id_basename_to_file_id.key()
1485
other_pid_key = other.parent_id_basename_to_file_id.key()
1486
if None in (this_key, this_pid_key, other_key, other_pid_key):
1488
return this_key == other_key and this_pid_key == other_pid_key
1490
def _entry_to_bytes(self, entry):
1491
"""Serialise entry as a single bytestring.
1493
:param Entry: An inventory entry.
1494
:return: A bytestring for the entry.
1497
ENTRY ::= FILE | DIR | SYMLINK | TREE
1498
FILE ::= "file: " COMMON SEP SHA SEP SIZE SEP EXECUTABLE
1499
DIR ::= "dir: " COMMON
1500
SYMLINK ::= "symlink: " COMMON SEP TARGET_UTF8
1501
TREE ::= "tree: " COMMON REFERENCE_REVISION
1502
COMMON ::= FILE_ID SEP PARENT_ID SEP NAME_UTF8 SEP REVISION
1505
if entry.parent_id is not None:
1506
parent_str = entry.parent_id
1509
name_str = entry.name.encode("utf8")
1510
if entry.kind == 'file':
1511
if entry.executable:
1515
return "file: %s\n%s\n%s\n%s\n%s\n%d\n%s" % (
1516
entry.file_id, parent_str, name_str, entry.revision,
1517
entry.text_sha1, entry.text_size, exec_str)
1518
elif entry.kind == 'directory':
1519
return "dir: %s\n%s\n%s\n%s" % (
1520
entry.file_id, parent_str, name_str, entry.revision)
1521
elif entry.kind == 'symlink':
1522
return "symlink: %s\n%s\n%s\n%s\n%s" % (
1523
entry.file_id, parent_str, name_str, entry.revision,
1524
entry.symlink_target.encode("utf8"))
1525
elif entry.kind == 'tree-reference':
1526
return "tree: %s\n%s\n%s\n%s\n%s" % (
1527
entry.file_id, parent_str, name_str, entry.revision,
1528
entry.reference_revision)
1530
raise ValueError("unknown kind %r" % entry.kind)
1533
def _bytes_to_utf8name_key(bytes):
1534
"""Get the file_id, revision_id key out of bytes."""
1535
# We don't normally care about name, except for times when we want
1536
# to filter out empty names because of non rich-root...
1537
sections = bytes.split('\n')
1538
kind, file_id = sections[0].split(': ')
1539
return (sections[2], file_id, sections[3])
1541
def _bytes_to_entry(self, bytes):
1542
"""Deserialise a serialised entry."""
1543
sections = bytes.split('\n')
1544
if sections[0].startswith("file: "):
1545
result = InventoryFile(sections[0][6:],
1546
sections[2].decode('utf8'),
1548
result.text_sha1 = sections[4]
1549
result.text_size = int(sections[5])
1550
result.executable = sections[6] == "Y"
1551
elif sections[0].startswith("dir: "):
1552
result = CHKInventoryDirectory(sections[0][5:],
1553
sections[2].decode('utf8'),
1555
elif sections[0].startswith("symlink: "):
1556
result = InventoryLink(sections[0][9:],
1557
sections[2].decode('utf8'),
1559
result.symlink_target = sections[4].decode('utf8')
1560
elif sections[0].startswith("tree: "):
1561
result = TreeReference(sections[0][6:],
1562
sections[2].decode('utf8'),
1564
result.reference_revision = sections[4]
1566
raise ValueError("Not a serialised entry %r" % bytes)
1567
result.revision = sections[3]
1568
if result.parent_id == '':
1569
result.parent_id = None
1570
self._fileid_to_entry_cache[result.file_id] = result
1573
def _get_mutable_inventory(self):
1574
"""See CommonInventory._get_mutable_inventory."""
1575
entries = self.iter_entries()
1576
inv = Inventory(None, self.revision_id)
1577
for path, inv_entry in entries:
1578
inv.add(inv_entry.copy())
1581
def create_by_apply_delta(self, inventory_delta, new_revision_id,
1582
propagate_caches=False):
1583
"""Create a new CHKInventory by applying inventory_delta to this one.
1585
See the inventory developers documentation for the theory behind
1588
:param inventory_delta: The inventory delta to apply. See
1589
Inventory.apply_delta for details.
1590
:param new_revision_id: The revision id of the resulting CHKInventory.
1591
:param propagate_caches: If True, the caches for this inventory are
1592
copied to and updated for the result.
1593
:return: The new CHKInventory.
1595
result = CHKInventory(self._search_key_name)
1596
if propagate_caches:
1597
# Just propagate the path-to-fileid cache for now
1598
result._path_to_fileid_cache = dict(self._path_to_fileid_cache.iteritems())
1599
search_key_func = chk_map.search_key_registry.get(self._search_key_name)
1600
self.id_to_entry._ensure_root()
1601
maximum_size = self.id_to_entry._root_node.maximum_size
1602
result.revision_id = new_revision_id
1603
result.id_to_entry = chk_map.CHKMap(
1604
self.id_to_entry._store,
1605
self.id_to_entry.key(),
1606
search_key_func=search_key_func)
1607
result.id_to_entry._ensure_root()
1608
result.id_to_entry._root_node.set_maximum_size(maximum_size)
1609
parent_id_basename_delta = []
1610
if self.parent_id_basename_to_file_id is not None:
1611
result.parent_id_basename_to_file_id = chk_map.CHKMap(
1612
self.parent_id_basename_to_file_id._store,
1613
self.parent_id_basename_to_file_id.key(),
1614
search_key_func=search_key_func)
1615
result.parent_id_basename_to_file_id._ensure_root()
1616
self.parent_id_basename_to_file_id._ensure_root()
1617
result_p_id_root = result.parent_id_basename_to_file_id._root_node
1618
p_id_root = self.parent_id_basename_to_file_id._root_node
1619
result_p_id_root.set_maximum_size(p_id_root.maximum_size)
1620
result_p_id_root._key_width = p_id_root._key_width
1622
result.parent_id_basename_to_file_id = None
1623
result.root_id = self.root_id
1624
id_to_entry_delta = []
1625
# inventory_delta is only traversed once, so we just update the
1627
# Check for repeated file ids
1628
inventory_delta = _check_delta_unique_ids(inventory_delta)
1629
# Repeated old paths
1630
inventory_delta = _check_delta_unique_old_paths(inventory_delta)
1631
# Check for repeated new paths
1632
inventory_delta = _check_delta_unique_new_paths(inventory_delta)
1633
# Check for entries that don't match the fileid
1634
inventory_delta = _check_delta_ids_match_entry(inventory_delta)
1635
# All changed entries need to have their parents be directories.
1637
for old_path, new_path, file_id, entry in inventory_delta:
1640
result.root_id = file_id
1641
if new_path is None:
1646
if propagate_caches:
1648
del result._path_to_fileid_cache[old_path]
1652
new_key = (file_id,)
1653
new_value = result._entry_to_bytes(entry)
1654
# Update caches. It's worth doing this whether
1655
# we're propagating the old caches or not.
1656
result._path_to_fileid_cache[new_path] = file_id
1657
parents.add(entry.parent_id)
1658
if old_path is None:
1661
old_key = (file_id,)
1662
id_to_entry_delta.append((old_key, new_key, new_value))
1663
if result.parent_id_basename_to_file_id is not None:
1664
# parent_id, basename changes
1665
if old_path is None:
1668
old_entry = self[file_id]
1669
old_key = self._parent_id_basename_key(old_entry)
1670
if new_path is None:
1674
new_key = self._parent_id_basename_key(entry)
1676
if old_key != new_key:
1677
# If the two keys are the same, the value will be unchanged
1678
# as its always the file id.
1679
parent_id_basename_delta.append((old_key, new_key, new_value))
1680
result.id_to_entry.apply_delta(id_to_entry_delta)
1681
if parent_id_basename_delta:
1682
result.parent_id_basename_to_file_id.apply_delta(parent_id_basename_delta)
1683
for parent in parents:
1685
if result[parent].kind != 'directory':
1686
raise errors.InconsistentDelta(result.id2path(parent), parent,
1687
'Not a directory, but given children')
1688
except errors.NoSuchId:
1689
raise errors.InconsistentDelta("<unknown>", parent,
1690
"Parent is not present in resulting inventory.")
1694
def deserialise(klass, chk_store, bytes, expected_revision_id):
1695
"""Deserialise a CHKInventory.
1697
:param chk_store: A CHK capable VersionedFiles instance.
1698
:param bytes: The serialised bytes.
1699
:param expected_revision_id: The revision ID we think this inventory is
1701
:return: A CHKInventory
1703
lines = bytes.split('\n')
1705
raise AssertionError('bytes to deserialize must end with an eol')
1707
if lines[0] != 'chkinventory:':
1708
raise ValueError("not a serialised CHKInventory: %r" % bytes)
1710
allowed_keys = frozenset(['root_id', 'revision_id', 'search_key_name',
1711
'parent_id_basename_to_file_id',
1713
for line in lines[1:]:
1714
key, value = line.split(': ', 1)
1715
if key not in allowed_keys:
1716
raise errors.BzrError('Unknown key in inventory: %r\n%r'
1719
raise errors.BzrError('Duplicate key in inventory: %r\n%r'
1722
revision_id = info['revision_id']
1723
root_id = info['root_id']
1724
search_key_name = info.get('search_key_name', 'plain')
1725
parent_id_basename_to_file_id = info.get(
1726
'parent_id_basename_to_file_id', None)
1727
id_to_entry = info['id_to_entry']
1729
result = CHKInventory(search_key_name)
1730
result.revision_id = revision_id
1731
result.root_id = root_id
1732
search_key_func = chk_map.search_key_registry.get(
1733
result._search_key_name)
1734
if parent_id_basename_to_file_id is not None:
1735
result.parent_id_basename_to_file_id = chk_map.CHKMap(
1736
chk_store, (parent_id_basename_to_file_id,),
1737
search_key_func=search_key_func)
1739
result.parent_id_basename_to_file_id = None
1741
result.id_to_entry = chk_map.CHKMap(chk_store, (id_to_entry,),
1742
search_key_func=search_key_func)
1743
if (result.revision_id,) != expected_revision_id:
1744
raise ValueError("Mismatched revision id and expected: %r, %r" %
1745
(result.revision_id, expected_revision_id))
1749
def from_inventory(klass, chk_store, inventory, maximum_size=0, search_key_name='plain'):
1750
"""Create a CHKInventory from an existing inventory.
1752
The content of inventory is copied into the chk_store, and a
1753
CHKInventory referencing that is returned.
1755
:param chk_store: A CHK capable VersionedFiles instance.
1756
:param inventory: The inventory to copy.
1757
:param maximum_size: The CHKMap node size limit.
1758
:param search_key_name: The identifier for the search key function
1760
result = klass(search_key_name)
1761
result.revision_id = inventory.revision_id
1762
result.root_id = inventory.root.file_id
1764
entry_to_bytes = result._entry_to_bytes
1765
parent_id_basename_key = result._parent_id_basename_key
1766
id_to_entry_dict = {}
1767
parent_id_basename_dict = {}
1768
for path, entry in inventory.iter_entries():
1769
id_to_entry_dict[(entry.file_id,)] = entry_to_bytes(entry)
1770
p_id_key = parent_id_basename_key(entry)
1771
parent_id_basename_dict[p_id_key] = entry.file_id
1773
result._populate_from_dicts(chk_store, id_to_entry_dict,
1774
parent_id_basename_dict, maximum_size=maximum_size)
1777
def _populate_from_dicts(self, chk_store, id_to_entry_dict,
1778
parent_id_basename_dict, maximum_size):
1779
search_key_func = chk_map.search_key_registry.get(self._search_key_name)
1780
root_key = chk_map.CHKMap.from_dict(chk_store, id_to_entry_dict,
1781
maximum_size=maximum_size, key_width=1,
1782
search_key_func=search_key_func)
1783
self.id_to_entry = chk_map.CHKMap(chk_store, root_key,
1785
root_key = chk_map.CHKMap.from_dict(chk_store,
1786
parent_id_basename_dict,
1787
maximum_size=maximum_size, key_width=2,
1788
search_key_func=search_key_func)
1789
self.parent_id_basename_to_file_id = chk_map.CHKMap(chk_store,
1790
root_key, search_key_func)
1792
def _parent_id_basename_key(self, entry):
1793
"""Create a key for a entry in a parent_id_basename_to_file_id index."""
1794
if entry.parent_id is not None:
1795
parent_id = entry.parent_id
1798
return parent_id, entry.name.encode('utf8')
1800
def __getitem__(self, file_id):
1801
"""map a single file_id -> InventoryEntry."""
1803
raise errors.NoSuchId(self, file_id)
1804
result = self._fileid_to_entry_cache.get(file_id, None)
1805
if result is not None:
1808
return self._bytes_to_entry(
1809
self.id_to_entry.iteritems([(file_id,)]).next()[1])
1810
except StopIteration:
1811
# really we're passing an inventory, not a tree...
1812
raise errors.NoSuchId(self, file_id)
1814
def has_id(self, file_id):
1815
# Perhaps have an explicit 'contains' method on CHKMap ?
1816
if self._fileid_to_entry_cache.get(file_id, None) is not None:
1818
return len(list(self.id_to_entry.iteritems([(file_id,)]))) == 1
1820
def is_root(self, file_id):
1821
return file_id == self.root_id
1823
def _iter_file_id_parents(self, file_id):
1824
"""Yield the parents of file_id up to the root."""
1825
while file_id is not None:
1829
raise errors.NoSuchId(tree=self, file_id=file_id)
1831
file_id = ie.parent_id
1834
"""Iterate over all file-ids."""
1835
for key, _ in self.id_to_entry.iteritems():
1838
def iter_just_entries(self):
1839
"""Iterate over all entries.
1841
Unlike iter_entries(), just the entries are returned (not (path, ie))
1842
and the order of entries is undefined.
1844
XXX: We may not want to merge this into bzr.dev.
1846
for key, entry in self.id_to_entry.iteritems():
1848
ie = self._fileid_to_entry_cache.get(file_id, None)
1850
ie = self._bytes_to_entry(entry)
1851
self._fileid_to_entry_cache[file_id] = ie
1854
def iter_changes(self, basis):
1855
"""Generate a Tree.iter_changes change list between this and basis.
1857
:param basis: Another CHKInventory.
1858
:return: An iterator over the changes between self and basis, as per
1859
tree.iter_changes().
1861
# We want: (file_id, (path_in_source, path_in_target),
1862
# changed_content, versioned, parent, name, kind,
1864
for key, basis_value, self_value in \
1865
self.id_to_entry.iter_changes(basis.id_to_entry):
1867
if basis_value is not None:
1868
basis_entry = basis._bytes_to_entry(basis_value)
1869
path_in_source = basis.id2path(file_id)
1870
basis_parent = basis_entry.parent_id
1871
basis_name = basis_entry.name
1872
basis_executable = basis_entry.executable
1874
path_in_source = None
1877
basis_executable = None
1878
if self_value is not None:
1879
self_entry = self._bytes_to_entry(self_value)
1880
path_in_target = self.id2path(file_id)
1881
self_parent = self_entry.parent_id
1882
self_name = self_entry.name
1883
self_executable = self_entry.executable
1885
path_in_target = None
1888
self_executable = None
1889
if basis_value is None:
1891
kind = (None, self_entry.kind)
1892
versioned = (False, True)
1893
elif self_value is None:
1895
kind = (basis_entry.kind, None)
1896
versioned = (True, False)
1898
kind = (basis_entry.kind, self_entry.kind)
1899
versioned = (True, True)
1900
changed_content = False
1901
if kind[0] != kind[1]:
1902
changed_content = True
1903
elif kind[0] == 'file':
1904
if (self_entry.text_size != basis_entry.text_size or
1905
self_entry.text_sha1 != basis_entry.text_sha1):
1906
changed_content = True
1907
elif kind[0] == 'symlink':
1908
if self_entry.symlink_target != basis_entry.symlink_target:
1909
changed_content = True
1910
elif kind[0] == 'tree-reference':
1911
if (self_entry.reference_revision !=
1912
basis_entry.reference_revision):
1913
changed_content = True
1914
parent = (basis_parent, self_parent)
1915
name = (basis_name, self_name)
1916
executable = (basis_executable, self_executable)
1917
if (not changed_content
1918
and parent[0] == parent[1]
1919
and name[0] == name[1]
1920
and executable[0] == executable[1]):
1921
# Could happen when only the revision changed for a directory
1924
yield (file_id, (path_in_source, path_in_target), changed_content,
1925
versioned, parent, name, kind, executable)
1928
"""Return the number of entries in the inventory."""
1929
return len(self.id_to_entry)
1931
def _make_delta(self, old):
1932
"""Make an inventory delta from two inventories."""
1933
if type(old) != CHKInventory:
1934
return CommonInventory._make_delta(self, old)
1936
for key, old_value, self_value in \
1937
self.id_to_entry.iter_changes(old.id_to_entry):
1939
if old_value is not None:
1940
old_path = old.id2path(file_id)
1943
if self_value is not None:
1944
entry = self._bytes_to_entry(self_value)
1945
self._fileid_to_entry_cache[file_id] = entry
1946
new_path = self.id2path(file_id)
1950
delta.append((old_path, new_path, file_id, entry))
1953
def path2id(self, name):
1954
"""See CommonInventory.path2id()."""
1955
result = self._path_to_fileid_cache.get(name, None)
1957
result = CommonInventory.path2id(self, name)
1958
self._path_to_fileid_cache[name] = result
1962
"""Serialise the inventory to lines."""
1963
lines = ["chkinventory:\n"]
1964
if self._search_key_name != 'plain':
1965
# custom ordering grouping things that don't change together
1966
lines.append('search_key_name: %s\n' % (self._search_key_name,))
1967
lines.append("root_id: %s\n" % self.root_id)
1968
lines.append('parent_id_basename_to_file_id: %s\n' %
1969
self.parent_id_basename_to_file_id.key())
1970
lines.append("revision_id: %s\n" % self.revision_id)
1971
lines.append("id_to_entry: %s\n" % self.id_to_entry.key())
1973
lines.append("revision_id: %s\n" % self.revision_id)
1974
lines.append("root_id: %s\n" % self.root_id)
1975
if self.parent_id_basename_to_file_id is not None:
1976
lines.append('parent_id_basename_to_file_id: %s\n' %
1977
self.parent_id_basename_to_file_id.key())
1978
lines.append("id_to_entry: %s\n" % self.id_to_entry.key())
1983
"""Get the root entry."""
1984
return self[self.root_id]
1987
class CHKInventoryDirectory(InventoryDirectory):
1988
"""A directory in an inventory."""
1990
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
1991
'text_id', 'parent_id', '_children', 'executable',
1992
'revision', 'symlink_target', 'reference_revision',
1995
def __init__(self, file_id, name, parent_id, chk_inventory):
1996
# Don't call InventoryDirectory.__init__ - it isn't right for this
1998
InventoryEntry.__init__(self, file_id, name, parent_id)
1999
self._children = None
2000
self.kind = 'directory'
2001
self._chk_inventory = chk_inventory
2005
"""Access the list of children of this directory.
2007
With a parent_id_basename_to_file_id index, loads all the children,
2008
without loads the entire index. Without is bad. A more sophisticated
2009
proxy object might be nice, to allow partial loading of children as
2010
well when specific names are accessed. (So path traversal can be
2011
written in the obvious way but not examine siblings.).
2013
if self._children is not None:
2014
return self._children
2015
# No longer supported
2016
if self._chk_inventory.parent_id_basename_to_file_id is None:
2017
raise AssertionError("Inventories without"
2018
" parent_id_basename_to_file_id are no longer supported")
2020
# XXX: Todo - use proxy objects for the children rather than loading
2021
# all when the attribute is referenced.
2022
parent_id_index = self._chk_inventory.parent_id_basename_to_file_id
2024
for (parent_id, name_utf8), file_id in parent_id_index.iteritems(
2025
key_filter=[(self.file_id,)]):
2026
child_keys.add((file_id,))
2028
for file_id_key in child_keys:
2029
entry = self._chk_inventory._fileid_to_entry_cache.get(
2030
file_id_key[0], None)
2031
if entry is not None:
2032
result[entry.name] = entry
2033
cached.add(file_id_key)
2034
child_keys.difference_update(cached)
2035
# populate; todo: do by name
2036
id_to_entry = self._chk_inventory.id_to_entry
2037
for file_id_key, bytes in id_to_entry.iteritems(child_keys):
2038
entry = self._chk_inventory._bytes_to_entry(bytes)
2039
result[entry.name] = entry
2040
self._chk_inventory._fileid_to_entry_cache[file_id_key[0]] = entry
2041
self._children = result
2045
'directory': InventoryDirectory,
2046
'file': InventoryFile,
2047
'symlink': InventoryLink,
2048
'tree-reference': TreeReference
2051
def make_entry(kind, name, parent_id, file_id=None):
2052
"""Create an inventory entry.
2054
:param kind: the type of inventory entry to create.
2055
:param name: the basename of the entry.
2056
:param parent_id: the parent_id of the entry.
2057
:param file_id: the file_id to use. if None, one will be created.
2060
file_id = generate_ids.gen_file_id(name)
2061
name = ensure_normalized_name(name)
2063
factory = entry_factory[kind]
2065
raise BzrError("unknown kind %r" % kind)
2066
return factory(file_id, name, parent_id)
2069
def ensure_normalized_name(name):
2072
:raises InvalidNormalization: When name is not normalized, and cannot be
2073
accessed on this platform by the normalized path.
2074
:return: The NFC normalised version of name.
2076
#------- This has been copied to bzrlib.dirstate.DirState.add, please
2077
# keep them synchronised.
2078
# we dont import normalized_filename directly because we want to be
2079
# able to change the implementation at runtime for tests.
2080
norm_name, can_access = osutils.normalized_filename(name)
2081
if norm_name != name:
2085
# TODO: jam 20060701 This would probably be more useful
2086
# if the error was raised with the full path
2087
raise errors.InvalidNormalization(name)
2093
def is_valid_name(name):
2095
if _NAME_RE is None:
2096
_NAME_RE = re.compile(r'^[^/\\]+$')
2098
return bool(_NAME_RE.match(name))
2101
def _check_delta_unique_ids(delta):
2102
"""Decorate a delta and check that the file ids in it are unique.
2104
:return: A generator over delta.
2108
length = len(ids) + 1
2110
if len(ids) != length:
2111
raise errors.InconsistentDelta(item[0] or item[1], item[2],
2116
def _check_delta_unique_new_paths(delta):
2117
"""Decorate a delta and check that the new paths in it are unique.
2119
:return: A generator over delta.
2123
length = len(paths) + 1
2125
if path is not None:
2127
if len(paths) != length:
2128
raise errors.InconsistentDelta(path, item[2], "repeated path")
2132
def _check_delta_unique_old_paths(delta):
2133
"""Decorate a delta and check that the old paths in it are unique.
2135
:return: A generator over delta.
2139
length = len(paths) + 1
2141
if path is not None:
2143
if len(paths) != length:
2144
raise errors.InconsistentDelta(path, item[2], "repeated path")
2148
def _check_delta_ids_match_entry(delta):
2149
"""Decorate a delta and check that the ids in it match the entry.file_id.
2151
:return: A generator over delta.
2155
if entry is not None:
2156
if entry.file_id != item[2]:
2157
raise errors.InconsistentDelta(item[0] or item[1], item[2],
2158
"mismatched id with %r" % entry)
added
removed
bzrlib/inventory.py
