36
39
# At the moment they may alias the inventory and have old copies of it in
37
40
# memory. (Now done? -- mbp 20060309)
42
from binascii import hexlify
44
from copy import deepcopy
39
45
from cStringIO import StringIO
43
from bzrlib.lazy_import import lazy_import
44
lazy_import(globals(), """
45
from bisect import bisect_left
51
51
from time import time
59
conflicts as _mod_conflicts,
68
revision as _mod_revision,
55
from bzrlib import bzrdir, errors, ignores, osutils, urlutils
56
from bzrlib.atomicfile import AtomicFile
80
57
import bzrlib.branch
81
from bzrlib.transport import get_transport
83
from bzrlib.workingtree_4 import WorkingTreeFormat4
86
from bzrlib import symbol_versioning
58
from bzrlib.conflicts import Conflict, ConflictList, CONFLICT_SUFFIXES
87
59
from bzrlib.decorators import needs_read_lock, needs_write_lock
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
60
from bzrlib.errors import (BzrCheckError,
63
WeaveRevisionNotPresent,
67
MergeModifiedFormatError,
70
from bzrlib.inventory import InventoryEntry, Inventory
89
71
from bzrlib.lockable_files import LockableFiles, TransportLock
90
72
from bzrlib.lockdir import LockDir
91
import bzrlib.mutabletree
92
from bzrlib.mutabletree import needs_tree_write_lock
73
from bzrlib.merge import merge_inner, transform_tree
93
74
from bzrlib.osutils import (
105
from bzrlib.trace import mutter, note
106
from bzrlib.transport.local import LocalTransport
107
91
from bzrlib.progress import DummyProgress, ProgressPhase
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
92
from bzrlib.revision import NULL_REVISION
109
93
from bzrlib.rio import RioReader, rio_file, Stanza
110
94
from bzrlib.symbol_versioning import (deprecated_passed,
111
95
deprecated_method,
112
96
deprecated_function,
113
97
DEPRECATED_PARAMETER,
120
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
121
CONFLICT_HEADER_1 = "BZR conflict list format 1"
123
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
126
@deprecated_function(zero_thirteen)
100
from bzrlib.trace import mutter, note
101
from bzrlib.transform import build_tree
102
from bzrlib.transport import get_transport
103
from bzrlib.transport.local import LocalTransport
104
from bzrlib.textui import show_status
110
# the regex removes any weird characters; we don't escape them
111
# but rather just pull them out
112
_gen_file_id_re = re.compile(r'[^\w.]')
113
_gen_id_suffix = None
117
def _next_id_suffix():
118
"""Create a new file id suffix that is reasonably unique.
120
On the first call we combine the current time with 64 bits of randomness
121
to give a highly probably globally unique number. Then each call in the same
122
process adds 1 to a serial number we append to that unique value.
124
# XXX TODO: change bzrlib.add.smart_add to call workingtree.add() rather
125
# than having to move the id randomness out of the inner loop like this.
126
# XXX TODO: for the global randomness this uses we should add the thread-id
127
# before the serial #.
128
global _gen_id_suffix, _gen_id_serial
129
if _gen_id_suffix is None:
130
_gen_id_suffix = "-%s-%s-" % (compact_date(time()), rand_chars(16))
132
return _gen_id_suffix + str(_gen_id_serial)
127
135
def gen_file_id(name):
128
136
"""Return new file id for the basename 'name'.
130
Use bzrlib.generate_ids.gen_file_id() instead
138
The uniqueness is supplied from _next_id_suffix.
132
return generate_ids.gen_file_id(name)
135
@deprecated_function(zero_thirteen)
140
# The real randomness is in the _next_id_suffix, the
141
# rest of the identifier is just to be nice.
143
# 1) Remove non-ascii word characters to keep the ids portable
144
# 2) squash to lowercase, so the file id doesn't have to
145
# be escaped (case insensitive filesystems would bork for ids
146
# that only differred in case without escaping).
147
# 3) truncate the filename to 20 chars. Long filenames also bork on some
149
# 4) Removing starting '.' characters to prevent the file ids from
150
# being considered hidden.
151
ascii_word_only = _gen_file_id_re.sub('', name.lower())
152
short_no_dots = ascii_word_only.lstrip('.')[:20]
153
return short_no_dots + _next_id_suffix()
136
156
def gen_root_id():
137
"""Return a new tree-root file id.
139
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
141
return generate_ids.gen_root_id()
157
"""Return a new tree-root file id."""
158
return gen_file_id('TREE_ROOT')
144
161
class TreeEntry(object):
581
554
__contains__ = has_id
583
556
def get_file_size(self, file_id):
584
file_id = osutils.safe_file_id(file_id)
585
557
return os.path.getsize(self.id2abspath(file_id))
588
def get_file_sha1(self, file_id, path=None, stat_value=None):
589
file_id = osutils.safe_file_id(file_id)
560
def get_file_sha1(self, file_id, path=None):
591
562
path = self._inventory.id2path(file_id)
592
return self._hashcache.get_sha1(path, stat_value)
563
return self._hashcache.get_sha1(path)
594
565
def get_file_mtime(self, file_id, path=None):
595
file_id = osutils.safe_file_id(file_id)
597
path = self.inventory.id2path(file_id)
567
path = self._inventory.id2path(file_id)
598
568
return os.lstat(self.abspath(path)).st_mtime
600
570
if not supports_executable():
601
571
def is_executable(self, file_id, path=None):
602
file_id = osutils.safe_file_id(file_id)
603
572
return self._inventory[file_id].executable
605
574
def is_executable(self, file_id, path=None):
607
file_id = osutils.safe_file_id(file_id)
608
path = self.id2path(file_id)
576
path = self._inventory.id2path(file_id)
609
577
mode = os.lstat(self.abspath(path)).st_mode
610
578
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
612
@needs_tree_write_lock
613
def _add(self, files, ids, kinds):
614
"""See MutableTree._add."""
581
def add(self, files, ids=None):
582
"""Make files versioned.
584
Note that the command line normally calls smart_add instead,
585
which can automatically recurse.
587
This adds the files to the inventory, so that they will be
588
recorded by the next commit.
591
List of paths to add, relative to the base of the tree.
594
If set, use these instead of automatically generated ids.
595
Must be the same length as the list of files, but may
596
contain None for ids that are to be autogenerated.
598
TODO: Perhaps have an option to add the ids even if the files do
601
TODO: Perhaps callback with the ids and paths as they're added.
615
603
# TODO: Re-adding a file that is removed in the working copy
616
604
# should probably put it back with the previous ID.
617
# the read and write working inventory should not occur in this
618
# function - they should be part of lock_write and unlock.
620
for f, file_id, kind in zip(files, ids, kinds):
621
assert kind is not None
605
if isinstance(files, basestring):
606
assert(ids is None or isinstance(ids, basestring))
612
ids = [None] * len(files)
614
assert(len(ids) == len(files))
616
inv = self.read_working_inventory()
617
for f,file_id in zip(files, ids):
618
if self.is_control_filename(f):
619
raise errors.ForbiddenControlFileError(filename=f)
624
raise BzrError("cannot add top-level %r" % f)
626
fullpath = normpath(self.abspath(f))
628
kind = file_kind(fullpath)
630
if e.errno == errno.ENOENT:
631
raise NoSuchFile(fullpath)
632
if not InventoryEntry.versionable_kind(kind):
633
raise errors.BadFileKindError(filename=f, kind=kind)
622
634
if file_id is None:
623
635
inv.add_path(f, kind=kind)
625
file_id = osutils.safe_file_id(file_id)
626
637
inv.add_path(f, kind=kind, file_id=file_id)
627
self._inventory_is_modified = True
629
@needs_tree_write_lock
630
def _gather_kinds(self, files, kinds):
631
"""See MutableTree._gather_kinds."""
632
for pos, f in enumerate(files):
633
if kinds[pos] is None:
634
fullpath = normpath(self.abspath(f))
636
kinds[pos] = file_kind(fullpath)
638
if e.errno == errno.ENOENT:
639
raise errors.NoSuchFile(fullpath)
639
self._write_inventory(inv)
641
641
@needs_write_lock
642
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
643
"""Add revision_id as a parent.
645
This is equivalent to retrieving the current list of parent ids
646
and setting the list to its value plus revision_id.
648
:param revision_id: The revision id to add to the parent list. It may
649
be a ghost revision as long as its not the first parent to be added,
650
or the allow_leftmost_as_ghost parameter is set True.
651
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
653
parents = self.get_parent_ids() + [revision_id]
654
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
655
or allow_leftmost_as_ghost)
657
@needs_tree_write_lock
658
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
659
"""Add revision_id, tree tuple as a parent.
661
This is equivalent to retrieving the current list of parent trees
662
and setting the list to its value plus parent_tuple. See also
663
add_parent_tree_id - if you only have a parent id available it will be
664
simpler to use that api. If you have the parent already available, using
665
this api is preferred.
667
:param parent_tuple: The (revision id, tree) to add to the parent list.
668
If the revision_id is a ghost, pass None for the tree.
669
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
671
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
672
if len(parent_ids) > 1:
673
# the leftmost may have already been a ghost, preserve that if it
675
allow_leftmost_as_ghost = True
676
self.set_parent_ids(parent_ids,
677
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
679
@needs_tree_write_lock
680
642
def add_pending_merge(self, *revision_ids):
681
643
# TODO: Perhaps should check at this point that the
682
644
# history of the revision is actually present?
683
parents = self.get_parent_ids()
645
p = self.pending_merges()
685
647
for rev_id in revision_ids:
686
if rev_id in parents:
688
parents.append(rev_id)
691
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
653
self.set_pending_merges(p)
693
@deprecated_method(zero_eleven)
695
656
def pending_merges(self):
696
657
"""Return a list of pending merges.
698
659
These are revisions that have been merged into the working
699
660
directory but not yet committed.
701
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
702
instead - which is available on all tree objects.
704
return self.get_parent_ids()[1:]
706
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
707
"""Common ghost checking functionality from set_parent_*.
709
This checks that the left hand-parent exists if there are any
712
if len(revision_ids) > 0:
713
leftmost_id = revision_ids[0]
714
if (not allow_leftmost_as_ghost and not
715
self.branch.repository.has_revision(leftmost_id)):
716
raise errors.GhostRevisionUnusableHere(leftmost_id)
718
def _set_merges_from_parent_ids(self, parent_ids):
719
merges = parent_ids[1:]
720
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
722
@needs_tree_write_lock
723
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
724
"""Set the parent ids to revision_ids.
726
See also set_parent_trees. This api will try to retrieve the tree data
727
for each element of revision_ids from the trees repository. If you have
728
tree data already available, it is more efficient to use
729
set_parent_trees rather than set_parent_ids. set_parent_ids is however
730
an easier API to use.
732
:param revision_ids: The revision_ids to set as the parent ids of this
733
working tree. Any of these may be ghosts.
735
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
736
self._check_parents_for_ghosts(revision_ids,
737
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
738
for revision_id in revision_ids:
739
_mod_revision.check_not_reserved_id(revision_id)
741
if len(revision_ids) > 0:
742
self.set_last_revision(revision_ids[0])
744
self.set_last_revision(_mod_revision.NULL_REVISION)
746
self._set_merges_from_parent_ids(revision_ids)
748
@needs_tree_write_lock
749
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
750
"""See MutableTree.set_parent_trees."""
751
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
752
for revision_id in parent_ids:
753
_mod_revision.check_not_reserved_id(revision_id)
755
self._check_parents_for_ghosts(parent_ids,
756
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
758
if len(parent_ids) == 0:
759
leftmost_parent_id = _mod_revision.NULL_REVISION
760
leftmost_parent_tree = None
762
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
764
if self._change_last_revision(leftmost_parent_id):
765
if leftmost_parent_tree is None:
766
# If we don't have a tree, fall back to reading the
767
# parent tree from the repository.
768
self._cache_basis_inventory(leftmost_parent_id)
770
inv = leftmost_parent_tree.inventory
771
xml = self._create_basis_xml_from_inventory(
772
leftmost_parent_id, inv)
773
self._write_basis_inventory(xml)
774
self._set_merges_from_parent_ids(parent_ids)
776
@needs_tree_write_lock
663
merges_file = self._control_files.get_utf8('pending-merges')
667
for l in merges_file.readlines():
668
p.append(l.rstrip('\n'))
777
672
def set_pending_merges(self, rev_list):
778
parents = self.get_parent_ids()
779
leftmost = parents[:1]
780
new_parents = leftmost + rev_list
781
self.set_parent_ids(new_parents)
673
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
783
@needs_tree_write_lock
784
676
def set_merge_modified(self, modified_hashes):
785
677
def iter_stanzas():
786
678
for file_id, hash in modified_hashes.iteritems():
787
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
679
yield Stanza(file_id=file_id, hash=hash)
788
680
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
790
683
def _put_rio(self, filename, stanzas, header):
791
self._must_be_locked()
792
684
my_file = rio_file(stanzas, header)
793
685
self._control_files.put(filename, my_file)
795
@needs_write_lock # because merge pulls data into the branch.
796
def merge_from_branch(self, branch, to_revision=None):
797
"""Merge from a branch into this working tree.
799
:param branch: The branch to merge from.
800
:param to_revision: If non-None, the merge will merge to to_revision,
801
but not beyond it. to_revision does not need to be in the history
802
of the branch when it is supplied. If None, to_revision defaults to
803
branch.last_revision().
805
from bzrlib.merge import Merger, Merge3Merger
806
pb = bzrlib.ui.ui_factory.nested_progress_bar()
808
merger = Merger(self.branch, this_tree=self, pb=pb)
809
merger.pp = ProgressPhase("Merge phase", 5, pb)
810
merger.pp.next_phase()
811
# check that there are no
813
merger.check_basis(check_clean=True, require_commits=False)
814
if to_revision is None:
815
to_revision = _mod_revision.ensure_null(branch.last_revision())
817
to_revision = osutils.safe_revision_id(to_revision)
818
merger.other_rev_id = to_revision
819
if _mod_revision.is_null(merger.other_rev_id):
820
raise errors.NoCommits(branch)
821
self.branch.fetch(branch, last_revision=merger.other_rev_id)
822
merger.other_basis = merger.other_rev_id
823
merger.other_tree = self.branch.repository.revision_tree(
825
merger.other_branch = branch
826
merger.pp.next_phase()
828
if merger.base_rev_id == merger.other_rev_id:
829
raise errors.PointlessMerge
830
merger.backup_files = False
831
merger.merge_type = Merge3Merger
832
merger.set_interesting_files(None)
833
merger.show_base = False
834
merger.reprocess = False
835
conflicts = merger.do_merge()
842
688
def merge_modified(self):
843
"""Return a dictionary of files modified by a merge.
845
The list is initialized by WorkingTree.set_merge_modified, which is
846
typically called after we make some automatic updates to the tree
849
This returns a map of file_id->sha1, containing only files which are
850
still in the working inventory and have that text hash.
853
690
hashfile = self._control_files.get('merge-hashes')
854
except errors.NoSuchFile:
856
693
merge_hashes = {}
858
695
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
859
raise errors.MergeModifiedFormatError()
696
raise MergeModifiedFormatError()
860
697
except StopIteration:
861
raise errors.MergeModifiedFormatError()
698
raise MergeModifiedFormatError()
862
699
for s in RioReader(hashfile):
863
# RioReader reads in Unicode, so convert file_ids back to utf8
864
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
700
file_id = s.get("file_id")
865
701
if file_id not in self.inventory:
867
text_hash = s.get("hash")
868
if text_hash == self.get_file_sha1(file_id):
869
merge_hashes[file_id] = text_hash
704
if hash == self.get_file_sha1(file_id):
705
merge_hashes[file_id] = hash
870
706
return merge_hashes
873
def mkdir(self, path, file_id=None):
874
"""See MutableTree.mkdir()."""
876
file_id = generate_ids.gen_file_id(os.path.basename(path))
877
os.mkdir(self.abspath(path))
878
self.add(path, file_id, 'directory')
881
708
def get_symlink_target(self, file_id):
882
file_id = osutils.safe_file_id(file_id)
883
709
return os.readlink(self.id2abspath(file_id))
886
def subsume(self, other_tree):
887
def add_children(inventory, entry):
888
for child_entry in entry.children.values():
889
inventory._byid[child_entry.file_id] = child_entry
890
if child_entry.kind == 'directory':
891
add_children(inventory, child_entry)
892
if other_tree.get_root_id() == self.get_root_id():
893
raise errors.BadSubsumeSource(self, other_tree,
894
'Trees have the same root')
896
other_tree_path = self.relpath(other_tree.basedir)
897
except errors.PathNotChild:
898
raise errors.BadSubsumeSource(self, other_tree,
899
'Tree is not contained by the other')
900
new_root_parent = self.path2id(osutils.dirname(other_tree_path))
901
if new_root_parent is None:
902
raise errors.BadSubsumeSource(self, other_tree,
903
'Parent directory is not versioned.')
904
# We need to ensure that the result of a fetch will have a
905
# versionedfile for the other_tree root, and only fetching into
906
# RepositoryKnit2 guarantees that.
907
if not self.branch.repository.supports_rich_root():
908
raise errors.SubsumeTargetNeedsUpgrade(other_tree)
909
other_tree.lock_tree_write()
911
new_parents = other_tree.get_parent_ids()
912
other_root = other_tree.inventory.root
913
other_root.parent_id = new_root_parent
914
other_root.name = osutils.basename(other_tree_path)
915
self.inventory.add(other_root)
916
add_children(self.inventory, other_root)
917
self._write_inventory(self.inventory)
918
# normally we don't want to fetch whole repositories, but i think
919
# here we really do want to consolidate the whole thing.
920
for parent_id in other_tree.get_parent_ids():
921
self.branch.fetch(other_tree.branch, parent_id)
922
self.add_parent_tree_id(parent_id)
925
other_tree.bzrdir.retire_bzrdir()
927
@needs_tree_write_lock
928
def extract(self, file_id, format=None):
929
"""Extract a subtree from this tree.
931
A new branch will be created, relative to the path for this tree.
935
segments = osutils.splitpath(path)
936
transport = self.branch.bzrdir.root_transport
937
for name in segments:
938
transport = transport.clone(name)
939
transport.ensure_base()
942
sub_path = self.id2path(file_id)
943
branch_transport = mkdirs(sub_path)
945
format = bzrdir.format_registry.make_bzrdir('dirstate-with-subtree')
946
branch_transport.ensure_base()
947
branch_bzrdir = format.initialize_on_transport(branch_transport)
949
repo = branch_bzrdir.find_repository()
950
except errors.NoRepositoryPresent:
951
repo = branch_bzrdir.create_repository()
952
assert repo.supports_rich_root()
954
if not repo.supports_rich_root():
955
raise errors.RootNotRich()
956
new_branch = branch_bzrdir.create_branch()
957
new_branch.pull(self.branch)
958
for parent_id in self.get_parent_ids():
959
new_branch.fetch(self.branch, parent_id)
960
tree_transport = self.bzrdir.root_transport.clone(sub_path)
961
if tree_transport.base != branch_transport.base:
962
tree_bzrdir = format.initialize_on_transport(tree_transport)
963
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
965
tree_bzrdir = branch_bzrdir
966
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
967
wt.set_parent_ids(self.get_parent_ids())
968
my_inv = self.inventory
969
child_inv = Inventory(root_id=None)
970
new_root = my_inv[file_id]
971
my_inv.remove_recursive_id(file_id)
972
new_root.parent_id = None
973
child_inv.add(new_root)
974
self._write_inventory(my_inv)
975
wt._write_inventory(child_inv)
978
def _serialize(self, inventory, out_file):
979
xml5.serializer_v5.write_inventory(self._inventory, out_file)
981
def _deserialize(selt, in_file):
982
return xml5.serializer_v5.read_inventory(in_file)
985
"""Write the in memory inventory to disk."""
986
# TODO: Maybe this should only write on dirty ?
987
if self._control_files._lock_mode != 'w':
988
raise errors.NotWriteLocked(self)
990
self._serialize(self._inventory, sio)
992
self._control_files.put('inventory', sio)
993
self._inventory_is_modified = False
995
def _kind(self, relpath):
996
return osutils.file_kind(self.abspath(relpath))
998
def list_files(self, include_root=False):
711
def file_class(self, filename):
712
if self.path2id(filename):
714
elif self.is_ignored(filename):
719
def list_files(self):
999
720
"""Recursively list all files as (path, class, kind, id, entry).
1001
722
Lists, but does not descend into unversioned directories.
1099
819
new_children.sort()
1100
820
new_children = collections.deque(new_children)
1101
821
stack.append((f_ie.file_id, fp, fap, new_children))
1102
# Break out of inner loop,
1103
# so that we start outer loop with child
822
# Break out of inner loop, so that we start outer loop with child
1106
825
# if we finished all children, pop it off the stack
1109
@needs_tree_write_lock
1110
def move(self, from_paths, to_dir=None, after=False, **kwargs):
830
def move(self, from_paths, to_name):
1111
831
"""Rename files.
1113
to_dir must exist in the inventory.
833
to_name must exist in the inventory.
1115
If to_dir exists and is a directory, the files are moved into
835
If to_name exists and is a directory, the files are moved into
1116
836
it, keeping their old names.
1118
Note that to_dir is only the last component of the new name;
838
Note that to_name is only the last component of the new name;
1119
839
this doesn't change the directory.
1121
For each entry in from_paths the move mode will be determined
1124
The first mode moves the file in the filesystem and updates the
1125
inventory. The second mode only updates the inventory without
1126
touching the file on the filesystem. This is the new mode introduced
1129
move uses the second mode if 'after == True' and the target is not
1130
versioned but present in the working tree.
1132
move uses the second mode if 'after == False' and the source is
1133
versioned but no longer in the working tree, and the target is not
1134
versioned but present in the working tree.
1136
move uses the first mode if 'after == False' and the source is
1137
versioned and present in the working tree, and the target is not
1138
versioned and not present in the working tree.
1140
Everything else results in an error.
1142
841
This returns a list of (from_path, to_path) pairs for each
1143
842
entry that is moved.
1148
# check for deprecated use of signature
1150
to_dir = kwargs.get('to_name', None)
1152
raise TypeError('You must supply a target directory')
1154
symbol_versioning.warn('The parameter to_name was deprecated'
1155
' in version 0.13. Use to_dir instead',
1158
# check destination directory
845
## TODO: Option to move IDs only
1159
846
assert not isinstance(from_paths, basestring)
1160
847
inv = self.inventory
1161
to_abs = self.abspath(to_dir)
848
to_abs = self.abspath(to_name)
1162
849
if not isdir(to_abs):
1163
raise errors.BzrMoveFailedError('',to_dir,
1164
errors.NotADirectory(to_abs))
1165
if not self.has_filename(to_dir):
1166
raise errors.BzrMoveFailedError('',to_dir,
1167
errors.NotInWorkingDirectory(to_dir))
1168
to_dir_id = inv.path2id(to_dir)
1169
if to_dir_id is None:
1170
raise errors.BzrMoveFailedError('',to_dir,
1171
errors.NotVersionedError(path=str(to_dir)))
850
raise BzrError("destination %r is not a directory" % to_abs)
851
if not self.has_filename(to_name):
852
raise BzrError("destination %r not in working directory" % to_abs)
853
to_dir_id = inv.path2id(to_name)
854
if to_dir_id == None and to_name != '':
855
raise BzrError("destination %r is not a versioned directory" % to_name)
1173
856
to_dir_ie = inv[to_dir_id]
1174
if to_dir_ie.kind != 'directory':
1175
raise errors.BzrMoveFailedError('',to_dir,
1176
errors.NotADirectory(to_abs))
1178
# create rename entries and tuples
1179
for from_rel in from_paths:
1180
from_tail = splitpath(from_rel)[-1]
1181
from_id = inv.path2id(from_rel)
1183
raise errors.BzrMoveFailedError(from_rel,to_dir,
1184
errors.NotVersionedError(path=str(from_rel)))
1186
from_entry = inv[from_id]
1187
from_parent_id = from_entry.parent_id
1188
to_rel = pathjoin(to_dir, from_tail)
1189
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1191
from_tail=from_tail,
1192
from_parent_id=from_parent_id,
1193
to_rel=to_rel, to_tail=from_tail,
1194
to_parent_id=to_dir_id)
1195
rename_entries.append(rename_entry)
1196
rename_tuples.append((from_rel, to_rel))
1198
# determine which move mode to use. checks also for movability
1199
rename_entries = self._determine_mv_mode(rename_entries, after)
1201
original_modified = self._inventory_is_modified
857
if to_dir_ie.kind not in ('directory', 'root_directory'):
858
raise BzrError("destination %r is not a directory" % to_abs)
860
to_idpath = inv.get_idpath(to_dir_id)
863
if not self.has_filename(f):
864
raise BzrError("%r does not exist in working tree" % f)
865
f_id = inv.path2id(f)
867
raise BzrError("%r is not versioned" % f)
868
name_tail = splitpath(f)[-1]
869
dest_path = pathjoin(to_name, name_tail)
870
if self.has_filename(dest_path):
871
raise BzrError("destination %r already exists" % dest_path)
872
if f_id in to_idpath:
873
raise BzrError("can't move %r to a subdirectory of itself" % f)
875
# OK, so there's a race here, it's possible that someone will
876
# create a file in this interval and then the rename might be
877
# left half-done. But we should have caught most problems.
878
orig_inv = deepcopy(self.inventory)
1204
self._inventory_is_modified = True
1205
self._move(rename_entries)
881
name_tail = splitpath(f)[-1]
882
dest_path = pathjoin(to_name, name_tail)
883
result.append((f, dest_path))
884
inv.rename(inv.path2id(f), to_dir_id, name_tail)
886
rename(self.abspath(f), self.abspath(dest_path))
888
raise BzrError("failed to rename %r to %r: %s" %
889
(f, dest_path, e[1]),
890
["rename rolled back"])
1207
892
# restore the inventory on error
1208
self._inventory_is_modified = original_modified
893
self._set_inventory(orig_inv)
1210
895
self._write_inventory(inv)
1211
return rename_tuples
1213
def _determine_mv_mode(self, rename_entries, after=False):
1214
"""Determines for each from-to pair if both inventory and working tree
1215
or only the inventory has to be changed.
1217
Also does basic plausability tests.
1219
inv = self.inventory
1221
for rename_entry in rename_entries:
1222
# store to local variables for easier reference
1223
from_rel = rename_entry.from_rel
1224
from_id = rename_entry.from_id
1225
to_rel = rename_entry.to_rel
1226
to_id = inv.path2id(to_rel)
1227
only_change_inv = False
1229
# check the inventory for source and destination
1231
raise errors.BzrMoveFailedError(from_rel,to_rel,
1232
errors.NotVersionedError(path=str(from_rel)))
1233
if to_id is not None:
1234
raise errors.BzrMoveFailedError(from_rel,to_rel,
1235
errors.AlreadyVersionedError(path=str(to_rel)))
1237
# try to determine the mode for rename (only change inv or change
1238
# inv and file system)
1240
if not self.has_filename(to_rel):
1241
raise errors.BzrMoveFailedError(from_id,to_rel,
1242
errors.NoSuchFile(path=str(to_rel),
1243
extra="New file has not been created yet"))
1244
only_change_inv = True
1245
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1246
only_change_inv = True
1247
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1248
only_change_inv = False
1250
# something is wrong, so lets determine what exactly
1251
if not self.has_filename(from_rel) and \
1252
not self.has_filename(to_rel):
1253
raise errors.BzrRenameFailedError(from_rel,to_rel,
1254
errors.PathsDoNotExist(paths=(str(from_rel),
1257
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1258
extra="(Use --after to update the Bazaar id)")
1259
rename_entry.only_change_inv = only_change_inv
1260
return rename_entries
1262
def _move(self, rename_entries):
1263
"""Moves a list of files.
1265
Depending on the value of the flag 'only_change_inv', the
1266
file will be moved on the file system or not.
1268
inv = self.inventory
1271
for entry in rename_entries:
1273
self._move_entry(entry)
1275
self._rollback_move(moved)
1279
def _rollback_move(self, moved):
1280
"""Try to rollback a previous move in case of an filesystem error."""
1281
inv = self.inventory
1284
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1285
entry.to_tail, entry.to_parent_id, entry.from_rel,
1286
entry.from_tail, entry.from_parent_id,
1287
entry.only_change_inv))
1288
except errors.BzrMoveFailedError, e:
1289
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1290
" The working tree is in an inconsistent state."
1291
" Please consider doing a 'bzr revert'."
1292
" Error message is: %s" % e)
1294
def _move_entry(self, entry):
1295
inv = self.inventory
1296
from_rel_abs = self.abspath(entry.from_rel)
1297
to_rel_abs = self.abspath(entry.to_rel)
1298
if from_rel_abs == to_rel_abs:
1299
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1300
"Source and target are identical.")
1302
if not entry.only_change_inv:
1304
osutils.rename(from_rel_abs, to_rel_abs)
1306
raise errors.BzrMoveFailedError(entry.from_rel,
1308
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1310
@needs_tree_write_lock
1311
def rename_one(self, from_rel, to_rel, after=False):
899
def rename_one(self, from_rel, to_rel):
1312
900
"""Rename one file.
1314
902
This can change the directory or the filename or both.
1316
rename_one has several 'modes' to work. First, it can rename a physical
1317
file and change the file_id. That is the normal mode. Second, it can
1318
only change the file_id without touching any physical file. This is
1319
the new mode introduced in version 0.15.
1321
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1322
versioned but present in the working tree.
1324
rename_one uses the second mode if 'after == False' and 'from_rel' is
1325
versioned but no longer in the working tree, and 'to_rel' is not
1326
versioned but present in the working tree.
1328
rename_one uses the first mode if 'after == False' and 'from_rel' is
1329
versioned and present in the working tree, and 'to_rel' is not
1330
versioned and not present in the working tree.
1332
Everything else results in an error.
1334
904
inv = self.inventory
1337
# create rename entries and tuples
1338
from_tail = splitpath(from_rel)[-1]
1339
from_id = inv.path2id(from_rel)
1341
raise errors.BzrRenameFailedError(from_rel,to_rel,
1342
errors.NotVersionedError(path=str(from_rel)))
1343
from_entry = inv[from_id]
1344
from_parent_id = from_entry.parent_id
905
if not self.has_filename(from_rel):
906
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
907
if self.has_filename(to_rel):
908
raise BzrError("can't rename: new working file %r already exists" % to_rel)
910
file_id = inv.path2id(from_rel)
912
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
915
from_parent = entry.parent_id
916
from_name = entry.name
918
if inv.path2id(to_rel):
919
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1345
921
to_dir, to_tail = os.path.split(to_rel)
1346
922
to_dir_id = inv.path2id(to_dir)
1347
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1349
from_tail=from_tail,
1350
from_parent_id=from_parent_id,
1351
to_rel=to_rel, to_tail=to_tail,
1352
to_parent_id=to_dir_id)
1353
rename_entries.append(rename_entry)
1355
# determine which move mode to use. checks also for movability
1356
rename_entries = self._determine_mv_mode(rename_entries, after)
1358
# check if the target changed directory and if the target directory is
1360
if to_dir_id is None:
1361
raise errors.BzrMoveFailedError(from_rel,to_rel,
1362
errors.NotVersionedError(path=str(to_dir)))
1364
# all checks done. now we can continue with our actual work
1365
mutter('rename_one:\n'
1370
' to_dir_id {%s}\n',
1371
from_id, from_rel, to_rel, to_dir, to_dir_id)
1373
self._move(rename_entries)
923
if to_dir_id == None and to_dir != '':
924
raise BzrError("can't determine destination directory id for %r" % to_dir)
926
mutter("rename_one:")
927
mutter(" file_id {%s}" % file_id)
928
mutter(" from_rel %r" % from_rel)
929
mutter(" to_rel %r" % to_rel)
930
mutter(" to_dir %r" % to_dir)
931
mutter(" to_dir_id {%s}" % to_dir_id)
933
inv.rename(file_id, to_dir_id, to_tail)
935
from_abs = self.abspath(from_rel)
936
to_abs = self.abspath(to_rel)
938
rename(from_abs, to_abs)
940
inv.rename(file_id, from_parent, from_name)
941
raise BzrError("failed to rename %r to %r: %s"
942
% (from_abs, to_abs, e[1]),
943
["rename rolled back"])
1374
944
self._write_inventory(inv)
1376
class _RenameEntry(object):
1377
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1378
to_rel, to_tail, to_parent_id, only_change_inv=False):
1379
self.from_rel = from_rel
1380
self.from_id = from_id
1381
self.from_tail = from_tail
1382
self.from_parent_id = from_parent_id
1383
self.to_rel = to_rel
1384
self.to_tail = to_tail
1385
self.to_parent_id = to_parent_id
1386
self.only_change_inv = only_change_inv
1388
946
@needs_read_lock
1389
947
def unknowns(self):
1390
948
"""Return all unknown files.
1750
1267
@needs_read_lock
1751
1268
def read_working_inventory(self):
1752
"""Read the working inventory.
1754
:raises errors.InventoryModified: read_working_inventory will fail
1755
when the current in memory inventory has been modified.
1757
# conceptually this should be an implementation detail of the tree.
1758
# XXX: Deprecate this.
1269
"""Read the working inventory."""
1759
1270
# ElementTree does its own conversion from UTF-8, so open in
1761
if self._inventory_is_modified:
1762
raise errors.InventoryModified(self)
1763
result = self._deserialize(self._control_files.get('inventory'))
1764
self._set_inventory(result, dirty=False)
1272
result = bzrlib.xml5.serializer_v5.read_inventory(
1273
self._control_files.get('inventory'))
1274
self._set_inventory(result)
1767
@needs_tree_write_lock
1768
def remove(self, files, verbose=False, to_file=None, keep_files=True,
1770
"""Remove nominated files from the working inventory.
1772
:files: File paths relative to the basedir.
1773
:keep_files: If true, the files will also be kept.
1774
:force: Delete files and directories, even if they are changed and
1775
even if the directories are not empty.
1278
def remove(self, files, verbose=False, to_file=None):
1279
"""Remove nominated files from the working inventory..
1281
This does not remove their text. This does not run on XXX on what? RBC
1283
TODO: Refuse to remove modified files unless --force is given?
1285
TODO: Do something useful with directories.
1287
TODO: Should this remove the text or not? Tough call; not
1288
removing may be useful and the user can just use use rm, and
1289
is the opposite of add. Removing it is consistent with most
1290
other tools. Maybe an option.
1777
1292
## TODO: Normalize names
1293
## TODO: Remove nested loops; better scalability
1779
1294
if isinstance(files, basestring):
1780
1295
files = [files]
1785
unknown_files_in_directory=set()
1787
def recurse_directory_to_add_files(directory):
1788
# recurse directory and add all files
1789
# so we can check if they have changed.
1790
for parent_info, file_infos in\
1791
osutils.walkdirs(self.abspath(directory),
1793
for relpath, basename, kind, lstat, abspath in file_infos:
1795
if self.path2id(relpath): #is it versioned?
1796
new_files.add(relpath)
1798
unknown_files_in_directory.add(
1799
(relpath, None, kind))
1801
for filename in files:
1802
# Get file name into canonical form.
1803
abspath = self.abspath(filename)
1804
filename = self.relpath(abspath)
1805
if len(filename) > 0:
1806
new_files.add(filename)
1807
if osutils.isdir(abspath):
1808
recurse_directory_to_add_files(filename)
1809
files = [f for f in new_files]
1812
return # nothing to do
1814
# Sort needed to first handle directory content before the directory
1815
files.sort(reverse=True)
1816
if not keep_files and not force:
1817
has_changed_files = len(unknown_files_in_directory) > 0
1818
if not has_changed_files:
1819
for (file_id, path, content_change, versioned, parent_id, name,
1820
kind, executable) in self._iter_changes(self.basis_tree(),
1821
include_unchanged=True, require_versioned=False,
1822
want_unversioned=True, specific_files=files):
1823
# check if it's unknown OR changed but not deleted:
1824
if (versioned == (False, False)
1825
or (content_change and kind[1] != None)):
1826
has_changed_files = True
1829
if has_changed_files:
1830
# make delta to show ALL applicable changes in error message.
1831
tree_delta = self.changes_from(self.basis_tree(),
1832
specific_files=files)
1833
for unknown_file in unknown_files_in_directory:
1834
tree_delta.unversioned.extend((unknown_file,))
1835
raise errors.BzrRemoveChangedFilesError(tree_delta)
1297
inv = self.inventory
1837
1299
# do this before any modifications
1838
1300
for f in files:
1839
fid = self.path2id(f)
1301
fid = inv.path2id(f)
1842
message="%s is not versioned." % (f,)
1845
# having removed it, it must be either ignored or unknown
1846
if self.is_ignored(f):
1850
textui.show_status(new_status, self.kind(fid), f,
1853
inv_delta.append((f, None, fid, None))
1854
message="removed %s" % (f,)
1857
abs_path = self.abspath(f)
1858
if osutils.lexists(abs_path):
1859
if (osutils.isdir(abs_path) and
1860
len(os.listdir(abs_path)) > 0):
1861
message="%s is not empty directory "\
1862
"and won't be deleted." % (f,)
1864
osutils.delete_any(abs_path)
1865
message="deleted %s" % (f,)
1866
elif message is not None:
1867
# only care if we haven't done anything yet.
1868
message="%s does not exist." % (f,)
1870
# print only one message (if any) per file.
1871
if message is not None:
1873
self.apply_inventory_delta(inv_delta)
1875
@needs_tree_write_lock
1303
# TODO: Perhaps make this just a warning, and continue?
1304
# This tends to happen when
1305
raise NotVersionedError(path=f)
1307
# having remove it, it must be either ignored or unknown
1308
if self.is_ignored(f):
1312
show_status(new_status, inv[fid].kind, f, to_file=to_file)
1315
self._write_inventory(inv)
1876
1318
def revert(self, filenames, old_tree=None, backups=True,
1877
pb=DummyProgress(), report_changes=False):
1878
from bzrlib.conflicts import resolve
1319
pb=DummyProgress()):
1320
from transform import revert
1321
from conflicts import resolve
1879
1322
if old_tree is None:
1880
1323
old_tree = self.basis_tree()
1881
conflicts = transform.revert(self, old_tree, filenames, backups, pb,
1324
conflicts = revert(self, old_tree, filenames, backups, pb)
1883
1325
if not len(filenames):
1884
self.set_parent_ids(self.get_parent_ids()[:1])
1326
self.set_pending_merges([])
1887
1329
resolve(self, filenames, ignore_misses=True)
1888
1330
return conflicts
1890
def revision_tree(self, revision_id):
1891
"""See Tree.revision_tree.
1893
WorkingTree can supply revision_trees for the basis revision only
1894
because there is only one cached inventory in the bzr directory.
1896
if revision_id == self.last_revision():
1898
xml = self.read_basis_inventory()
1899
except errors.NoSuchFile:
1903
inv = xml7.serializer_v7.read_inventory_from_string(xml)
1904
# dont use the repository revision_tree api because we want
1905
# to supply the inventory.
1906
if inv.revision_id == revision_id:
1907
return revisiontree.RevisionTree(self.branch.repository,
1909
except errors.BadInventoryFormat:
1911
# raise if there was no inventory, or if we read the wrong inventory.
1912
raise errors.NoSuchRevisionInTree(self, revision_id)
1914
1332
# XXX: This method should be deprecated in favour of taking in a proper
1915
1333
# new Inventory object.
1916
@needs_tree_write_lock
1917
1335
def set_inventory(self, new_inventory_list):
1918
1336
from bzrlib.inventory import (Inventory,
1919
1337
InventoryDirectory,
1988
1380
raise NotImplementedError(self.unlock)
1990
def update(self, change_reporter=None):
1991
1384
"""Update a working tree along its branch.
1993
This will update the branch if its bound too, which means we have
1994
multiple trees involved:
1996
- The new basis tree of the master.
1997
- The old basis tree of the branch.
1998
- The old basis tree of the working tree.
1999
- The current working tree state.
2001
Pathologically, all three may be different, and non-ancestors of each
2002
other. Conceptually we want to:
2004
- Preserve the wt.basis->wt.state changes
2005
- Transform the wt.basis to the new master basis.
2006
- Apply a merge of the old branch basis to get any 'local' changes from
2008
- Restore the wt.basis->wt.state changes.
1386
This will update the branch if its bound too, which means we have multiple trees involved:
1387
The new basis tree of the master.
1388
The old basis tree of the branch.
1389
The old basis tree of the working tree.
1390
The current working tree state.
1391
pathologically all three may be different, and non ancestors of each other.
1392
Conceptually we want to:
1393
Preserve the wt.basis->wt.state changes
1394
Transform the wt.basis to the new master basis.
1395
Apply a merge of the old branch basis to get any 'local' changes from it into the tree.
1396
Restore the wt.basis->wt.state changes.
2010
1398
There isn't a single operation at the moment to do that, so we:
2011
- Merge current state -> basis tree of the master w.r.t. the old tree
2013
- Do a 'normal' merge of the old branch basis if it is relevant.
2015
if self.branch.get_master_branch() is not None:
2017
update_branch = True
2019
self.lock_tree_write()
2020
update_branch = False
2023
old_tip = self.branch.update()
2026
return self._update_tree(old_tip, change_reporter)
2030
@needs_tree_write_lock
2031
def _update_tree(self, old_tip=None, change_reporter=None):
2032
"""Update a tree to the master branch.
2034
:param old_tip: if supplied, the previous tip revision the branch,
2035
before it was changed to the master branch's tip.
2037
# here if old_tip is not None, it is the old tip of the branch before
2038
# it was updated from the master branch. This should become a pending
2039
# merge in the working tree to preserve the user existing work. we
2040
# cant set that until we update the working trees last revision to be
2041
# one from the new branch, because it will just get absorbed by the
2042
# parent de-duplication logic.
2044
# We MUST save it even if an error occurs, because otherwise the users
2045
# local work is unreferenced and will appear to have been lost.
2049
last_rev = self.get_parent_ids()[0]
2051
last_rev = _mod_revision.NULL_REVISION
2052
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2053
# merge tree state up to new branch tip.
2054
basis = self.basis_tree()
1399
Merge current state -> basis tree of the master w.r.t. the old tree basis.
1400
Do a 'normal' merge of the old branch basis if it is relevant.
1402
old_tip = self.branch.update()
1403
if old_tip is not None:
1404
self.add_pending_merge(old_tip)
1405
self.branch.lock_read()
1408
if self.last_revision() != self.branch.last_revision():
1409
# merge tree state up to new branch tip.
1410
basis = self.basis_tree()
2057
1411
to_tree = self.branch.basis_tree()
2058
if basis.inventory.root is None:
2059
self.set_root_id(to_tree.inventory.root.file_id)
2061
result += merge.merge_inner(
1412
result += merge_inner(self.branch,
2066
change_reporter=change_reporter)
2069
# TODO - dedup parents list with things merged by pull ?
2070
# reuse the tree we've updated to to set the basis:
2071
parent_trees = [(self.branch.last_revision(), to_tree)]
2072
merges = self.get_parent_ids()[1:]
2073
# Ideally we ask the tree for the trees here, that way the working
2074
# tree can decide whether to give us teh entire tree or give us a
2075
# lazy initialised tree. dirstate for instance will have the trees
2076
# in ram already, whereas a last-revision + basis-inventory tree
2077
# will not, but also does not need them when setting parents.
2078
for parent in merges:
2079
parent_trees.append(
2080
(parent, self.branch.repository.revision_tree(parent)))
2081
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2082
parent_trees.append(
2083
(old_tip, self.branch.repository.revision_tree(old_tip)))
2084
self.set_parent_trees(parent_trees)
2085
last_rev = parent_trees[0][0]
2087
# the working tree had the same last-revision as the master
2088
# branch did. We may still have pivot local work from the local
2089
# branch into old_tip:
2090
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2091
self.add_parent_tree_id(old_tip)
2092
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2093
and old_tip != last_rev):
2094
# our last revision was not the prior branch last revision
2095
# and we have converted that last revision to a pending merge.
2096
# base is somewhere between the branch tip now
2097
# and the now pending merge
2099
# Since we just modified the working tree and inventory, flush out
2100
# the current state, before we modify it again.
2101
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2102
# requires it only because TreeTransform directly munges the
2103
# inventory and calls tree._write_inventory(). Ultimately we
2104
# should be able to remove this extra flush.
2106
graph = self.branch.repository.get_graph()
2107
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2109
base_tree = self.branch.repository.revision_tree(base_rev_id)
2110
other_tree = self.branch.repository.revision_tree(old_tip)
2111
result += merge.merge_inner(
2116
change_reporter=change_reporter)
2119
def _write_hashcache_if_dirty(self):
2120
"""Write out the hashcache if it is dirty."""
2121
if self._hashcache.needs_write:
2123
self._hashcache.write()
2125
if e.errno not in (errno.EPERM, errno.EACCES):
2127
# TODO: jam 20061219 Should this be a warning? A single line
2128
# warning might be sufficient to let the user know what
2130
mutter('Could not write hashcache for %s\nError: %s',
2131
self._hashcache.cache_file_name(), e)
2133
@needs_tree_write_lock
1416
self.set_last_revision(self.branch.last_revision())
1417
if old_tip and old_tip != self.last_revision():
1418
# our last revision was not the prior branch last revision
1419
# and we have converted that last revision to a pending merge.
1420
# base is somewhere between the branch tip now
1421
# and the now pending merge
1422
from bzrlib.revision import common_ancestor
1424
base_rev_id = common_ancestor(self.branch.last_revision(),
1426
self.branch.repository)
1427
except errors.NoCommonAncestor:
1429
base_tree = self.branch.repository.revision_tree(base_rev_id)
1430
other_tree = self.branch.repository.revision_tree(old_tip)
1431
result += merge_inner(self.branch,
1437
self.branch.unlock()
2134
1440
def _write_inventory(self, inv):
2135
1441
"""Write inventory as the current inventory."""
2136
self._set_inventory(inv, dirty=True)
1443
bzrlib.xml5.serializer_v5.write_inventory(inv, sio)
1445
self._control_files.put('inventory', sio)
1446
self._set_inventory(inv)
1447
mutter('wrote working inventory')
2139
1449
def set_conflicts(self, arg):
2140
raise errors.UnsupportedOperation(self.set_conflicts, self)
1450
raise UnsupportedOperation(self.set_conflicts, self)
2142
1452
def add_conflicts(self, arg):
2143
raise errors.UnsupportedOperation(self.add_conflicts, self)
1453
raise UnsupportedOperation(self.add_conflicts, self)
2145
1455
@needs_read_lock
2146
1456
def conflicts(self):
2147
conflicts = _mod_conflicts.ConflictList()
1457
conflicts = ConflictList()
2148
1458
for conflicted in self._iter_conflicts():
2163
1473
if text == False:
2165
1475
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
2166
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1476
conflicts.append(Conflict.factory(ctype, path=conflicted,
2168
1477
file_id=self.path2id(conflicted)))
2169
1478
return conflicts
2171
def walkdirs(self, prefix=""):
2172
"""Walk the directories of this tree.
2174
returns a generator which yields items in the form:
2175
((curren_directory_path, fileid),
2176
[(file1_path, file1_name, file1_kind, (lstat), file1_id,
2179
This API returns a generator, which is only valid during the current
2180
tree transaction - within a single lock_read or lock_write duration.
2182
If the tree is not locked, it may cause an error to be raised,
2183
depending on the tree implementation.
2185
disk_top = self.abspath(prefix)
2186
if disk_top.endswith('/'):
2187
disk_top = disk_top[:-1]
2188
top_strip_len = len(disk_top) + 1
2189
inventory_iterator = self._walkdirs(prefix)
2190
disk_iterator = osutils.walkdirs(disk_top, prefix)
2192
current_disk = disk_iterator.next()
2193
disk_finished = False
2195
if not (e.errno == errno.ENOENT or
2196
(sys.platform == 'win32' and e.errno == ERROR_PATH_NOT_FOUND)):
2199
disk_finished = True
2201
current_inv = inventory_iterator.next()
2202
inv_finished = False
2203
except StopIteration:
2206
while not inv_finished or not disk_finished:
2207
if not disk_finished:
2208
# strip out .bzr dirs
2209
if current_disk[0][1][top_strip_len:] == '':
2210
# osutils.walkdirs can be made nicer -
2211
# yield the path-from-prefix rather than the pathjoined
2213
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2214
if current_disk[1][bzrdir_loc][0] == '.bzr':
2215
# we dont yield the contents of, or, .bzr itself.
2216
del current_disk[1][bzrdir_loc]
2218
# everything is unknown
2221
# everything is missing
2224
direction = cmp(current_inv[0][0], current_disk[0][0])
2226
# disk is before inventory - unknown
2227
dirblock = [(relpath, basename, kind, stat, None, None) for
2228
relpath, basename, kind, stat, top_path in current_disk[1]]
2229
yield (current_disk[0][0], None), dirblock
2231
current_disk = disk_iterator.next()
2232
except StopIteration:
2233
disk_finished = True
2235
# inventory is before disk - missing.
2236
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2237
for relpath, basename, dkind, stat, fileid, kind in
2239
yield (current_inv[0][0], current_inv[0][1]), dirblock
2241
current_inv = inventory_iterator.next()
2242
except StopIteration:
2245
# versioned present directory
2246
# merge the inventory and disk data together
2248
for relpath, subiterator in itertools.groupby(sorted(
2249
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2250
path_elements = list(subiterator)
2251
if len(path_elements) == 2:
2252
inv_row, disk_row = path_elements
2253
# versioned, present file
2254
dirblock.append((inv_row[0],
2255
inv_row[1], disk_row[2],
2256
disk_row[3], inv_row[4],
2258
elif len(path_elements[0]) == 5:
2260
dirblock.append((path_elements[0][0],
2261
path_elements[0][1], path_elements[0][2],
2262
path_elements[0][3], None, None))
2263
elif len(path_elements[0]) == 6:
2264
# versioned, absent file.
2265
dirblock.append((path_elements[0][0],
2266
path_elements[0][1], 'unknown', None,
2267
path_elements[0][4], path_elements[0][5]))
2269
raise NotImplementedError('unreachable code')
2270
yield current_inv[0], dirblock
2272
current_inv = inventory_iterator.next()
2273
except StopIteration:
2276
current_disk = disk_iterator.next()
2277
except StopIteration:
2278
disk_finished = True
2280
def _walkdirs(self, prefix=""):
2281
"""Walk the directories of this tree.
2283
:prefix: is used as the directrory to start with.
2284
returns a generator which yields items in the form:
2285
((curren_directory_path, fileid),
2286
[(file1_path, file1_name, file1_kind, None, file1_id,
2289
_directory = 'directory'
2290
# get the root in the inventory
2291
inv = self.inventory
2292
top_id = inv.path2id(prefix)
2296
pending = [(prefix, '', _directory, None, top_id, None)]
2299
currentdir = pending.pop()
2300
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2301
top_id = currentdir[4]
2303
relroot = currentdir[0] + '/'
2306
# FIXME: stash the node in pending
2308
for name, child in entry.sorted_children():
2309
dirblock.append((relroot + name, name, child.kind, None,
2310
child.file_id, child.kind
2312
yield (currentdir[0], entry.file_id), dirblock
2313
# push the user specified dirs from dirblock
2314
for dir in reversed(dirblock):
2315
if dir[2] == _directory:
2318
@needs_tree_write_lock
2319
def auto_resolve(self):
2320
"""Automatically resolve text conflicts according to contents.
2322
Only text conflicts are auto_resolvable. Files with no conflict markers
2323
are considered 'resolved', because bzr always puts conflict markers
2324
into files that have text conflicts. The corresponding .THIS .BASE and
2325
.OTHER files are deleted, as per 'resolve'.
2326
:return: a tuple of ConflictLists: (un_resolved, resolved).
2328
un_resolved = _mod_conflicts.ConflictList()
2329
resolved = _mod_conflicts.ConflictList()
2330
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2331
for conflict in self.conflicts():
2332
if (conflict.typestring != 'text conflict' or
2333
self.kind(conflict.file_id) != 'file'):
2334
un_resolved.append(conflict)
2336
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2338
for line in my_file:
2339
if conflict_re.search(line):
2340
un_resolved.append(conflict)
2343
resolved.append(conflict)
2346
resolved.remove_files(self)
2347
self.set_conflicts(un_resolved)
2348
return un_resolved, resolved
2350
def _validate(self):
2351
"""Validate internal structures.
2353
This is meant mostly for the test suite. To give it a chance to detect
2354
corruption after actions have occurred. The default implementation is a
2357
:return: None. An exception should be raised if there is an error.
2362
1481
class WorkingTree2(WorkingTree):
2363
1482
"""This is the Format 2 working tree.