39
36
# At the moment they may alias the inventory and have old copies of it in
40
37
# memory. (Now done? -- mbp 20060309)
42
from binascii import hexlify
39
from cStringIO import StringIO
42
from bzrlib.lazy_import import lazy_import
43
lazy_import(globals(), """
44
from bisect import bisect_left
44
46
from copy import deepcopy
45
from cStringIO import StringIO
51
51
from time import time
53
from bzrlib.atomicfile import AtomicFile
54
from bzrlib.branch import (Branch,
56
from bzrlib.conflicts import Conflict, ConflictList, CONFLICT_SUFFIXES
57
import bzrlib.bzrdir as bzrdir
59
conflicts as _mod_conflicts,
80
from bzrlib.transport import get_transport
82
from bzrlib.workingtree_4 import WorkingTreeFormat4
85
from bzrlib import symbol_versioning
58
86
from bzrlib.decorators import needs_read_lock, needs_write_lock
59
import bzrlib.errors as errors
60
from bzrlib.errors import (BzrCheckError,
64
WeaveRevisionNotPresent,
68
MergeModifiedFormatError,
71
from bzrlib.inventory import InventoryEntry, Inventory
87
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
72
88
from bzrlib.lockable_files import LockableFiles, TransportLock
73
89
from bzrlib.lockdir import LockDir
74
from bzrlib.merge import merge_inner, transform_tree
90
import bzrlib.mutabletree
91
from bzrlib.mutabletree import needs_tree_write_lock
75
92
from bzrlib.osutils import (
104
from bzrlib.trace import mutter, note
105
from bzrlib.transport.local import LocalTransport
92
106
from bzrlib.progress import DummyProgress, ProgressPhase
93
from bzrlib.revision import NULL_REVISION
107
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
94
108
from bzrlib.rio import RioReader, rio_file, Stanza
95
from bzrlib.symbol_versioning import *
96
from bzrlib.textui import show_status
98
from bzrlib.transform import build_tree
99
from bzrlib.trace import mutter, note
100
from bzrlib.transport import get_transport
101
from bzrlib.transport.local import LocalTransport
102
import bzrlib.urlutils as urlutils
107
# the regex here does the following:
108
# 1) remove any weird characters; we don't escape them but rather
110
# 2) match leading '.'s to make it not hidden
111
_gen_file_id_re = re.compile(r'[^\w.]|(^\.*)')
112
_gen_id_suffix = None
116
def _next_id_suffix():
117
"""Create a new file id suffix that is reasonably unique.
119
On the first call we combine the current time with 64 bits of randomness
120
to give a highly probably globally unique number. Then each call in the same
121
process adds 1 to a serial number we append to that unique value.
123
# XXX TODO: change bzrlib.add.smart_add to call workingtree.add() rather
124
# than having to move the id randomness out of the inner loop like this.
125
# XXX TODO: for the global randomness this uses we should add the thread-id
126
# before the serial #.
127
global _gen_id_suffix, _gen_id_serial
128
if _gen_id_suffix is None:
129
_gen_id_suffix = "-%s-%s-" % (compact_date(time()), rand_chars(16))
131
return _gen_id_suffix + str(_gen_id_serial)
109
from bzrlib.symbol_versioning import (deprecated_passed,
112
DEPRECATED_PARAMETER,
119
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
120
CONFLICT_HEADER_1 = "BZR conflict list format 1"
123
@deprecated_function(zero_thirteen)
134
124
def gen_file_id(name):
135
125
"""Return new file id for the basename 'name'.
137
The uniqueness is supplied from _next_id_suffix.
127
Use bzrlib.generate_ids.gen_file_id() instead
139
# XXX TODO: squash the filename to lowercase.
140
# XXX TODO: truncate the filename to something like 20 or 30 chars.
141
# XXX TODO: consider what to do with ids that look like illegal filepaths
142
# on platforms we support.
143
return _gen_file_id_re.sub('', name) + _next_id_suffix()
129
return generate_ids.gen_file_id(name)
132
@deprecated_function(zero_thirteen)
146
133
def gen_root_id():
147
"""Return a new tree-root file id."""
148
return gen_file_id('TREE_ROOT')
134
"""Return a new tree-root file id.
136
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
138
return generate_ids.gen_root_id()
151
141
class TreeEntry(object):
533
578
__contains__ = has_id
535
580
def get_file_size(self, file_id):
581
file_id = osutils.safe_file_id(file_id)
536
582
return os.path.getsize(self.id2abspath(file_id))
539
def get_file_sha1(self, file_id, path=None):
585
def get_file_sha1(self, file_id, path=None, stat_value=None):
586
file_id = osutils.safe_file_id(file_id)
541
588
path = self._inventory.id2path(file_id)
542
return self._hashcache.get_sha1(path)
589
return self._hashcache.get_sha1(path, stat_value)
544
591
def get_file_mtime(self, file_id, path=None):
592
file_id = osutils.safe_file_id(file_id)
546
path = self._inventory.id2path(file_id)
594
path = self.inventory.id2path(file_id)
547
595
return os.lstat(self.abspath(path)).st_mtime
549
597
if not supports_executable():
550
598
def is_executable(self, file_id, path=None):
599
file_id = osutils.safe_file_id(file_id)
551
600
return self._inventory[file_id].executable
553
602
def is_executable(self, file_id, path=None):
555
path = self._inventory.id2path(file_id)
604
file_id = osutils.safe_file_id(file_id)
605
path = self.id2path(file_id)
556
606
mode = os.lstat(self.abspath(path)).st_mode
557
607
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
560
def add(self, files, ids=None):
561
"""Make files versioned.
563
Note that the command line normally calls smart_add instead,
564
which can automatically recurse.
566
This adds the files to the inventory, so that they will be
567
recorded by the next commit.
570
List of paths to add, relative to the base of the tree.
573
If set, use these instead of automatically generated ids.
574
Must be the same length as the list of files, but may
575
contain None for ids that are to be autogenerated.
577
TODO: Perhaps have an option to add the ids even if the files do
580
TODO: Perhaps callback with the ids and paths as they're added.
609
@needs_tree_write_lock
610
def _add(self, files, ids, kinds):
611
"""See MutableTree._add."""
582
612
# TODO: Re-adding a file that is removed in the working copy
583
613
# should probably put it back with the previous ID.
584
if isinstance(files, basestring):
585
assert(ids is None or isinstance(ids, basestring))
591
ids = [None] * len(files)
593
assert(len(ids) == len(files))
614
# the read and write working inventory should not occur in this
615
# function - they should be part of lock_write and unlock.
595
616
inv = self.read_working_inventory()
596
for f,file_id in zip(files, ids):
597
if self.is_control_filename(f):
598
raise BzrError("cannot add control file %s" % quotefn(f))
603
raise BzrError("cannot add top-level %r" % f)
605
fullpath = normpath(self.abspath(f))
608
kind = file_kind(fullpath)
610
if e.errno == errno.ENOENT:
611
raise NoSuchFile(fullpath)
612
# maybe something better?
613
raise BzrError('cannot add: not a regular file, symlink or directory: %s' % quotefn(f))
615
if not InventoryEntry.versionable_kind(kind):
616
raise BzrError('cannot add: not a versionable file ('
617
'i.e. regular file, symlink or directory): %s' % quotefn(f))
617
for f, file_id, kind in zip(files, ids, kinds):
618
assert kind is not None
619
619
if file_id is None:
620
620
inv.add_path(f, kind=kind)
622
file_id = osutils.safe_file_id(file_id)
622
623
inv.add_path(f, kind=kind, file_id=file_id)
624
624
self._write_inventory(inv)
626
@needs_tree_write_lock
627
def _gather_kinds(self, files, kinds):
628
"""See MutableTree._gather_kinds."""
629
for pos, f in enumerate(files):
630
if kinds[pos] is None:
631
fullpath = normpath(self.abspath(f))
633
kinds[pos] = file_kind(fullpath)
635
if e.errno == errno.ENOENT:
636
raise errors.NoSuchFile(fullpath)
626
638
@needs_write_lock
639
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
640
"""Add revision_id as a parent.
642
This is equivalent to retrieving the current list of parent ids
643
and setting the list to its value plus revision_id.
645
:param revision_id: The revision id to add to the parent list. It may
646
be a ghost revision as long as its not the first parent to be added,
647
or the allow_leftmost_as_ghost parameter is set True.
648
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
650
parents = self.get_parent_ids() + [revision_id]
651
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
652
or allow_leftmost_as_ghost)
654
@needs_tree_write_lock
655
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
656
"""Add revision_id, tree tuple as a parent.
658
This is equivalent to retrieving the current list of parent trees
659
and setting the list to its value plus parent_tuple. See also
660
add_parent_tree_id - if you only have a parent id available it will be
661
simpler to use that api. If you have the parent already available, using
662
this api is preferred.
664
:param parent_tuple: The (revision id, tree) to add to the parent list.
665
If the revision_id is a ghost, pass None for the tree.
666
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
668
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
669
if len(parent_ids) > 1:
670
# the leftmost may have already been a ghost, preserve that if it
672
allow_leftmost_as_ghost = True
673
self.set_parent_ids(parent_ids,
674
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
676
@needs_tree_write_lock
627
677
def add_pending_merge(self, *revision_ids):
628
678
# TODO: Perhaps should check at this point that the
629
679
# history of the revision is actually present?
630
p = self.pending_merges()
680
parents = self.get_parent_ids()
632
682
for rev_id in revision_ids:
683
if rev_id in parents:
685
parents.append(rev_id)
638
self.set_pending_merges(p)
688
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
690
@deprecated_method(zero_eleven)
641
692
def pending_merges(self):
642
693
"""Return a list of pending merges.
644
695
These are revisions that have been merged into the working
645
696
directory but not yet committed.
648
merges_file = self._control_files.get_utf8('pending-merges')
650
if e.errno != errno.ENOENT:
654
for l in merges_file.readlines():
655
p.append(l.rstrip('\n'))
698
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
699
instead - which is available on all tree objects.
701
return self.get_parent_ids()[1:]
703
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
704
"""Common ghost checking functionality from set_parent_*.
706
This checks that the left hand-parent exists if there are any
709
if len(revision_ids) > 0:
710
leftmost_id = revision_ids[0]
711
if (not allow_leftmost_as_ghost and not
712
self.branch.repository.has_revision(leftmost_id)):
713
raise errors.GhostRevisionUnusableHere(leftmost_id)
715
def _set_merges_from_parent_ids(self, parent_ids):
716
merges = parent_ids[1:]
717
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
719
@needs_tree_write_lock
720
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
721
"""Set the parent ids to revision_ids.
723
See also set_parent_trees. This api will try to retrieve the tree data
724
for each element of revision_ids from the trees repository. If you have
725
tree data already available, it is more efficient to use
726
set_parent_trees rather than set_parent_ids. set_parent_ids is however
727
an easier API to use.
729
:param revision_ids: The revision_ids to set as the parent ids of this
730
working tree. Any of these may be ghosts.
732
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
733
self._check_parents_for_ghosts(revision_ids,
734
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
736
if len(revision_ids) > 0:
737
self.set_last_revision(revision_ids[0])
739
self.set_last_revision(None)
741
self._set_merges_from_parent_ids(revision_ids)
743
@needs_tree_write_lock
744
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
745
"""See MutableTree.set_parent_trees."""
746
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
748
self._check_parents_for_ghosts(parent_ids,
749
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
751
if len(parent_ids) == 0:
752
leftmost_parent_id = None
753
leftmost_parent_tree = None
755
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
757
if self._change_last_revision(leftmost_parent_id):
758
if leftmost_parent_tree is None:
759
# If we don't have a tree, fall back to reading the
760
# parent tree from the repository.
761
self._cache_basis_inventory(leftmost_parent_id)
763
inv = leftmost_parent_tree.inventory
764
xml = self._create_basis_xml_from_inventory(
765
leftmost_parent_id, inv)
766
self._write_basis_inventory(xml)
767
self._set_merges_from_parent_ids(parent_ids)
769
@needs_tree_write_lock
659
770
def set_pending_merges(self, rev_list):
660
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
771
parents = self.get_parent_ids()
772
leftmost = parents[:1]
773
new_parents = leftmost + rev_list
774
self.set_parent_ids(new_parents)
776
@needs_tree_write_lock
663
777
def set_merge_modified(self, modified_hashes):
664
778
def iter_stanzas():
665
779
for file_id, hash in modified_hashes.iteritems():
666
yield Stanza(file_id=file_id, hash=hash)
780
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
667
781
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
670
783
def _put_rio(self, filename, stanzas, header):
784
self._must_be_locked()
671
785
my_file = rio_file(stanzas, header)
672
786
self._control_files.put(filename, my_file)
788
@needs_write_lock # because merge pulls data into the branch.
789
def merge_from_branch(self, branch, to_revision=None):
790
"""Merge from a branch into this working tree.
792
:param branch: The branch to merge from.
793
:param to_revision: If non-None, the merge will merge to to_revision,
794
but not beyond it. to_revision does not need to be in the history
795
of the branch when it is supplied. If None, to_revision defaults to
796
branch.last_revision().
798
from bzrlib.merge import Merger, Merge3Merger
799
pb = bzrlib.ui.ui_factory.nested_progress_bar()
801
merger = Merger(self.branch, this_tree=self, pb=pb)
802
merger.pp = ProgressPhase("Merge phase", 5, pb)
803
merger.pp.next_phase()
804
# check that there are no
806
merger.check_basis(check_clean=True, require_commits=False)
807
if to_revision is None:
808
to_revision = branch.last_revision()
810
to_revision = osutils.safe_revision_id(to_revision)
811
merger.other_rev_id = to_revision
812
if merger.other_rev_id is None:
813
raise error.NoCommits(branch)
814
self.branch.fetch(branch, last_revision=merger.other_rev_id)
815
merger.other_basis = merger.other_rev_id
816
merger.other_tree = self.branch.repository.revision_tree(
818
merger.other_branch = branch
819
merger.pp.next_phase()
821
if merger.base_rev_id == merger.other_rev_id:
822
raise errors.PointlessMerge
823
merger.backup_files = False
824
merger.merge_type = Merge3Merger
825
merger.set_interesting_files(None)
826
merger.show_base = False
827
merger.reprocess = False
828
conflicts = merger.do_merge()
675
835
def merge_modified(self):
836
"""Return a dictionary of files modified by a merge.
838
The list is initialized by WorkingTree.set_merge_modified, which is
839
typically called after we make some automatic updates to the tree
842
This returns a map of file_id->sha1, containing only files which are
843
still in the working inventory and have that text hash.
677
846
hashfile = self._control_files.get('merge-hashes')
847
except errors.NoSuchFile:
680
849
merge_hashes = {}
682
851
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
683
raise MergeModifiedFormatError()
852
raise errors.MergeModifiedFormatError()
684
853
except StopIteration:
685
raise MergeModifiedFormatError()
854
raise errors.MergeModifiedFormatError()
686
855
for s in RioReader(hashfile):
687
file_id = s.get("file_id")
856
# RioReader reads in Unicode, so convert file_ids back to utf8
857
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
688
858
if file_id not in self.inventory:
691
if hash == self.get_file_sha1(file_id):
692
merge_hashes[file_id] = hash
860
text_hash = s.get("hash")
861
if text_hash == self.get_file_sha1(file_id):
862
merge_hashes[file_id] = text_hash
693
863
return merge_hashes
866
def mkdir(self, path, file_id=None):
867
"""See MutableTree.mkdir()."""
869
file_id = generate_ids.gen_file_id(os.path.basename(path))
870
os.mkdir(self.abspath(path))
871
self.add(path, file_id, 'directory')
695
874
def get_symlink_target(self, file_id):
875
file_id = osutils.safe_file_id(file_id)
696
876
return os.readlink(self.id2abspath(file_id))
698
def file_class(self, filename):
699
if self.path2id(filename):
701
elif self.is_ignored(filename):
706
def list_files(self):
879
def subsume(self, other_tree):
880
def add_children(inventory, entry):
881
for child_entry in entry.children.values():
882
inventory._byid[child_entry.file_id] = child_entry
883
if child_entry.kind == 'directory':
884
add_children(inventory, child_entry)
885
if other_tree.get_root_id() == self.get_root_id():
886
raise errors.BadSubsumeSource(self, other_tree,
887
'Trees have the same root')
889
other_tree_path = self.relpath(other_tree.basedir)
890
except errors.PathNotChild:
891
raise errors.BadSubsumeSource(self, other_tree,
892
'Tree is not contained by the other')
893
new_root_parent = self.path2id(osutils.dirname(other_tree_path))
894
if new_root_parent is None:
895
raise errors.BadSubsumeSource(self, other_tree,
896
'Parent directory is not versioned.')
897
# We need to ensure that the result of a fetch will have a
898
# versionedfile for the other_tree root, and only fetching into
899
# RepositoryKnit2 guarantees that.
900
if not self.branch.repository.supports_rich_root():
901
raise errors.SubsumeTargetNeedsUpgrade(other_tree)
902
other_tree.lock_tree_write()
904
new_parents = other_tree.get_parent_ids()
905
other_root = other_tree.inventory.root
906
other_root.parent_id = new_root_parent
907
other_root.name = osutils.basename(other_tree_path)
908
self.inventory.add(other_root)
909
add_children(self.inventory, other_root)
910
self._write_inventory(self.inventory)
911
# normally we don't want to fetch whole repositories, but i think
912
# here we really do want to consolidate the whole thing.
913
for parent_id in other_tree.get_parent_ids():
914
self.branch.fetch(other_tree.branch, parent_id)
915
self.add_parent_tree_id(parent_id)
918
other_tree.bzrdir.retire_bzrdir()
920
@needs_tree_write_lock
921
def extract(self, file_id, format=None):
922
"""Extract a subtree from this tree.
924
A new branch will be created, relative to the path for this tree.
928
segments = osutils.splitpath(path)
929
transport = self.branch.bzrdir.root_transport
930
for name in segments:
931
transport = transport.clone(name)
934
except errors.FileExists:
938
sub_path = self.id2path(file_id)
939
branch_transport = mkdirs(sub_path)
941
format = bzrdir.format_registry.make_bzrdir('dirstate-with-subtree')
943
branch_transport.mkdir('.')
944
except errors.FileExists:
946
branch_bzrdir = format.initialize_on_transport(branch_transport)
948
repo = branch_bzrdir.find_repository()
949
except errors.NoRepositoryPresent:
950
repo = branch_bzrdir.create_repository()
951
assert repo.supports_rich_root()
953
if not repo.supports_rich_root():
954
raise errors.RootNotRich()
955
new_branch = branch_bzrdir.create_branch()
956
new_branch.pull(self.branch)
957
for parent_id in self.get_parent_ids():
958
new_branch.fetch(self.branch, parent_id)
959
tree_transport = self.bzrdir.root_transport.clone(sub_path)
960
if tree_transport.base != branch_transport.base:
961
tree_bzrdir = format.initialize_on_transport(tree_transport)
962
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
964
tree_bzrdir = branch_bzrdir
965
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
966
wt.set_parent_ids(self.get_parent_ids())
967
my_inv = self.inventory
968
child_inv = Inventory(root_id=None)
969
new_root = my_inv[file_id]
970
my_inv.remove_recursive_id(file_id)
971
new_root.parent_id = None
972
child_inv.add(new_root)
973
self._write_inventory(my_inv)
974
wt._write_inventory(child_inv)
977
def _serialize(self, inventory, out_file):
978
xml5.serializer_v5.write_inventory(self._inventory, out_file)
980
def _deserialize(selt, in_file):
981
return xml5.serializer_v5.read_inventory(in_file)
984
"""Write the in memory inventory to disk."""
985
# TODO: Maybe this should only write on dirty ?
986
if self._control_files._lock_mode != 'w':
987
raise errors.NotWriteLocked(self)
989
self._serialize(self._inventory, sio)
991
self._control_files.put('inventory', sio)
992
self._inventory_is_modified = False
994
def _kind(self, relpath):
995
return osutils.file_kind(self.abspath(relpath))
997
def list_files(self, include_root=False):
707
998
"""Recursively list all files as (path, class, kind, id, entry).
709
1000
Lists, but does not descend into unversioned directories.
788
1098
new_children.sort()
789
1099
new_children = collections.deque(new_children)
790
1100
stack.append((f_ie.file_id, fp, fap, new_children))
791
# Break out of inner loop, so that we start outer loop with child
1101
# Break out of inner loop,
1102
# so that we start outer loop with child
794
1105
# if we finished all children, pop it off the stack
799
def move(self, from_paths, to_name):
1108
@needs_tree_write_lock
1109
def move(self, from_paths, to_dir=None, after=False, **kwargs):
800
1110
"""Rename files.
802
to_name must exist in the inventory.
1112
to_dir must exist in the inventory.
804
If to_name exists and is a directory, the files are moved into
1114
If to_dir exists and is a directory, the files are moved into
805
1115
it, keeping their old names.
807
Note that to_name is only the last component of the new name;
1117
Note that to_dir is only the last component of the new name;
808
1118
this doesn't change the directory.
1120
For each entry in from_paths the move mode will be determined
1123
The first mode moves the file in the filesystem and updates the
1124
inventory. The second mode only updates the inventory without
1125
touching the file on the filesystem. This is the new mode introduced
1128
move uses the second mode if 'after == True' and the target is not
1129
versioned but present in the working tree.
1131
move uses the second mode if 'after == False' and the source is
1132
versioned but no longer in the working tree, and the target is not
1133
versioned but present in the working tree.
1135
move uses the first mode if 'after == False' and the source is
1136
versioned and present in the working tree, and the target is not
1137
versioned and not present in the working tree.
1139
Everything else results in an error.
810
1141
This returns a list of (from_path, to_path) pairs for each
811
1142
entry that is moved.
814
## TODO: Option to move IDs only
1147
# check for deprecated use of signature
1149
to_dir = kwargs.get('to_name', None)
1151
raise TypeError('You must supply a target directory')
1153
symbol_versioning.warn('The parameter to_name was deprecated'
1154
' in version 0.13. Use to_dir instead',
1157
# check destination directory
815
1158
assert not isinstance(from_paths, basestring)
816
1159
inv = self.inventory
817
to_abs = self.abspath(to_name)
1160
to_abs = self.abspath(to_dir)
818
1161
if not isdir(to_abs):
819
raise BzrError("destination %r is not a directory" % to_abs)
820
if not self.has_filename(to_name):
821
raise BzrError("destination %r not in working directory" % to_abs)
822
to_dir_id = inv.path2id(to_name)
823
if to_dir_id == None and to_name != '':
824
raise BzrError("destination %r is not a versioned directory" % to_name)
1162
raise errors.BzrMoveFailedError('',to_dir,
1163
errors.NotADirectory(to_abs))
1164
if not self.has_filename(to_dir):
1165
raise errors.BzrMoveFailedError('',to_dir,
1166
errors.NotInWorkingDirectory(to_dir))
1167
to_dir_id = inv.path2id(to_dir)
1168
if to_dir_id is None:
1169
raise errors.BzrMoveFailedError('',to_dir,
1170
errors.NotVersionedError(path=str(to_dir)))
825
1172
to_dir_ie = inv[to_dir_id]
826
if to_dir_ie.kind not in ('directory', 'root_directory'):
827
raise BzrError("destination %r is not a directory" % to_abs)
829
to_idpath = inv.get_idpath(to_dir_id)
832
if not self.has_filename(f):
833
raise BzrError("%r does not exist in working tree" % f)
834
f_id = inv.path2id(f)
836
raise BzrError("%r is not versioned" % f)
837
name_tail = splitpath(f)[-1]
838
dest_path = pathjoin(to_name, name_tail)
839
if self.has_filename(dest_path):
840
raise BzrError("destination %r already exists" % dest_path)
841
if f_id in to_idpath:
842
raise BzrError("can't move %r to a subdirectory of itself" % f)
844
# OK, so there's a race here, it's possible that someone will
845
# create a file in this interval and then the rename might be
846
# left half-done. But we should have caught most problems.
847
orig_inv = deepcopy(self.inventory)
1173
if to_dir_ie.kind != 'directory':
1174
raise errors.BzrMoveFailedError('',to_dir,
1175
errors.NotADirectory(to_abs))
1177
# create rename entries and tuples
1178
for from_rel in from_paths:
1179
from_tail = splitpath(from_rel)[-1]
1180
from_id = inv.path2id(from_rel)
1182
raise errors.BzrMoveFailedError(from_rel,to_dir,
1183
errors.NotVersionedError(path=str(from_rel)))
1185
from_entry = inv[from_id]
1186
from_parent_id = from_entry.parent_id
1187
to_rel = pathjoin(to_dir, from_tail)
1188
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1190
from_tail=from_tail,
1191
from_parent_id=from_parent_id,
1192
to_rel=to_rel, to_tail=from_tail,
1193
to_parent_id=to_dir_id)
1194
rename_entries.append(rename_entry)
1195
rename_tuples.append((from_rel, to_rel))
1197
# determine which move mode to use. checks also for movability
1198
rename_entries = self._determine_mv_mode(rename_entries, after)
1200
original_modified = self._inventory_is_modified
850
name_tail = splitpath(f)[-1]
851
dest_path = pathjoin(to_name, name_tail)
852
result.append((f, dest_path))
853
inv.rename(inv.path2id(f), to_dir_id, name_tail)
855
rename(self.abspath(f), self.abspath(dest_path))
857
raise BzrError("failed to rename %r to %r: %s" %
858
(f, dest_path, e[1]),
859
["rename rolled back"])
1203
self._inventory_is_modified = True
1204
self._move(rename_entries)
861
1206
# restore the inventory on error
862
self._set_inventory(orig_inv)
1207
self._inventory_is_modified = original_modified
864
1209
self._write_inventory(inv)
868
def rename_one(self, from_rel, to_rel):
1210
return rename_tuples
1212
def _determine_mv_mode(self, rename_entries, after=False):
1213
"""Determines for each from-to pair if both inventory and working tree
1214
or only the inventory has to be changed.
1216
Also does basic plausability tests.
1218
inv = self.inventory
1220
for rename_entry in rename_entries:
1221
# store to local variables for easier reference
1222
from_rel = rename_entry.from_rel
1223
from_id = rename_entry.from_id
1224
to_rel = rename_entry.to_rel
1225
to_id = inv.path2id(to_rel)
1226
only_change_inv = False
1228
# check the inventory for source and destination
1230
raise errors.BzrMoveFailedError(from_rel,to_rel,
1231
errors.NotVersionedError(path=str(from_rel)))
1232
if to_id is not None:
1233
raise errors.BzrMoveFailedError(from_rel,to_rel,
1234
errors.AlreadyVersionedError(path=str(to_rel)))
1236
# try to determine the mode for rename (only change inv or change
1237
# inv and file system)
1239
if not self.has_filename(to_rel):
1240
raise errors.BzrMoveFailedError(from_id,to_rel,
1241
errors.NoSuchFile(path=str(to_rel),
1242
extra="New file has not been created yet"))
1243
only_change_inv = True
1244
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1245
only_change_inv = True
1246
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1247
only_change_inv = False
1249
# something is wrong, so lets determine what exactly
1250
if not self.has_filename(from_rel) and \
1251
not self.has_filename(to_rel):
1252
raise errors.BzrRenameFailedError(from_rel,to_rel,
1253
errors.PathsDoNotExist(paths=(str(from_rel),
1256
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1257
extra="(Use --after to update the Bazaar id)")
1258
rename_entry.only_change_inv = only_change_inv
1259
return rename_entries
1261
def _move(self, rename_entries):
1262
"""Moves a list of files.
1264
Depending on the value of the flag 'only_change_inv', the
1265
file will be moved on the file system or not.
1267
inv = self.inventory
1270
for entry in rename_entries:
1272
self._move_entry(entry)
1274
self._rollback_move(moved)
1278
def _rollback_move(self, moved):
1279
"""Try to rollback a previous move in case of an filesystem error."""
1280
inv = self.inventory
1283
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1284
entry.to_tail, entry.to_parent_id, entry.from_rel,
1285
entry.from_tail, entry.from_parent_id,
1286
entry.only_change_inv))
1287
except errors.BzrMoveFailedError, e:
1288
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1289
" The working tree is in an inconsistent state."
1290
" Please consider doing a 'bzr revert'."
1291
" Error message is: %s" % e)
1293
def _move_entry(self, entry):
1294
inv = self.inventory
1295
from_rel_abs = self.abspath(entry.from_rel)
1296
to_rel_abs = self.abspath(entry.to_rel)
1297
if from_rel_abs == to_rel_abs:
1298
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1299
"Source and target are identical.")
1301
if not entry.only_change_inv:
1303
osutils.rename(from_rel_abs, to_rel_abs)
1305
raise errors.BzrMoveFailedError(entry.from_rel,
1307
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1309
@needs_tree_write_lock
1310
def rename_one(self, from_rel, to_rel, after=False):
869
1311
"""Rename one file.
871
1313
This can change the directory or the filename or both.
1315
rename_one has several 'modes' to work. First, it can rename a physical
1316
file and change the file_id. That is the normal mode. Second, it can
1317
only change the file_id without touching any physical file. This is
1318
the new mode introduced in version 0.15.
1320
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1321
versioned but present in the working tree.
1323
rename_one uses the second mode if 'after == False' and 'from_rel' is
1324
versioned but no longer in the working tree, and 'to_rel' is not
1325
versioned but present in the working tree.
1327
rename_one uses the first mode if 'after == False' and 'from_rel' is
1328
versioned and present in the working tree, and 'to_rel' is not
1329
versioned and not present in the working tree.
1331
Everything else results in an error.
873
1333
inv = self.inventory
874
if not self.has_filename(from_rel):
875
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
876
if self.has_filename(to_rel):
877
raise BzrError("can't rename: new working file %r already exists" % to_rel)
879
file_id = inv.path2id(from_rel)
881
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
884
from_parent = entry.parent_id
885
from_name = entry.name
887
if inv.path2id(to_rel):
888
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1336
# create rename entries and tuples
1337
from_tail = splitpath(from_rel)[-1]
1338
from_id = inv.path2id(from_rel)
1340
raise errors.BzrRenameFailedError(from_rel,to_rel,
1341
errors.NotVersionedError(path=str(from_rel)))
1342
from_entry = inv[from_id]
1343
from_parent_id = from_entry.parent_id
890
1344
to_dir, to_tail = os.path.split(to_rel)
891
1345
to_dir_id = inv.path2id(to_dir)
892
if to_dir_id == None and to_dir != '':
893
raise BzrError("can't determine destination directory id for %r" % to_dir)
895
mutter("rename_one:")
896
mutter(" file_id {%s}" % file_id)
897
mutter(" from_rel %r" % from_rel)
898
mutter(" to_rel %r" % to_rel)
899
mutter(" to_dir %r" % to_dir)
900
mutter(" to_dir_id {%s}" % to_dir_id)
902
inv.rename(file_id, to_dir_id, to_tail)
904
from_abs = self.abspath(from_rel)
905
to_abs = self.abspath(to_rel)
907
rename(from_abs, to_abs)
909
inv.rename(file_id, from_parent, from_name)
910
raise BzrError("failed to rename %r to %r: %s"
911
% (from_abs, to_abs, e[1]),
912
["rename rolled back"])
1346
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1348
from_tail=from_tail,
1349
from_parent_id=from_parent_id,
1350
to_rel=to_rel, to_tail=to_tail,
1351
to_parent_id=to_dir_id)
1352
rename_entries.append(rename_entry)
1354
# determine which move mode to use. checks also for movability
1355
rename_entries = self._determine_mv_mode(rename_entries, after)
1357
# check if the target changed directory and if the target directory is
1359
if to_dir_id is None:
1360
raise errors.BzrMoveFailedError(from_rel,to_rel,
1361
errors.NotVersionedError(path=str(to_dir)))
1363
# all checks done. now we can continue with our actual work
1364
mutter('rename_one:\n'
1369
' to_dir_id {%s}\n',
1370
from_id, from_rel, to_rel, to_dir, to_dir_id)
1372
self._move(rename_entries)
913
1373
self._write_inventory(inv)
1375
class _RenameEntry(object):
1376
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1377
to_rel, to_tail, to_parent_id, only_change_inv=False):
1378
self.from_rel = from_rel
1379
self.from_id = from_id
1380
self.from_tail = from_tail
1381
self.from_parent_id = from_parent_id
1382
self.to_rel = to_rel
1383
self.to_tail = to_tail
1384
self.to_parent_id = to_parent_id
1385
self.only_change_inv = only_change_inv
915
1387
@needs_read_lock
916
1388
def unknowns(self):
917
1389
"""Return all unknown files.
919
1391
These are files in the working directory that are not versioned or
920
1392
control files or ignored.
922
>>> from bzrlib.bzrdir import ScratchDir
923
>>> d = ScratchDir(files=['foo', 'foo~'])
924
>>> b = d.open_branch()
925
>>> tree = d.open_workingtree()
926
>>> map(str, tree.unknowns())
929
>>> list(b.unknowns())
931
>>> tree.remove('foo')
932
>>> list(b.unknowns())
935
for subp in self.extras():
936
if not self.is_ignored(subp):
1394
# force the extras method to be fully executed before returning, to
1395
# prevent race conditions with the lock
1397
[subp for subp in self.extras() if not self.is_ignored(subp)])
1399
@needs_tree_write_lock
1400
def unversion(self, file_ids):
1401
"""Remove the file ids in file_ids from the current versioned set.
1403
When a file_id is unversioned, all of its children are automatically
1406
:param file_ids: The file ids to stop versioning.
1407
:raises: NoSuchId if any fileid is not currently versioned.
1409
for file_id in file_ids:
1410
file_id = osutils.safe_file_id(file_id)
1411
if self._inventory.has_id(file_id):
1412
self._inventory.remove_recursive_id(file_id)
1414
raise errors.NoSuchId(self, file_id)
1416
# in the future this should just set a dirty bit to wait for the
1417
# final unlock. However, until all methods of workingtree start
1418
# with the current in -memory inventory rather than triggering
1419
# a read, it is more complex - we need to teach read_inventory
1420
# to know when to read, and when to not read first... and possibly
1421
# to save first when the in memory one may be corrupted.
1422
# so for now, we just only write it if it is indeed dirty.
1424
self._write_inventory(self._inventory)
939
1426
@deprecated_method(zero_eight)
940
1427
def iter_conflicts(self):
941
1428
"""List all files in the tree that have text or content conflicts.
1346
1916
between multiple working trees, i.e. via shared storage, then we
1347
1917
would probably want to lock both the local tree, and the branch.
1349
# FIXME: We want to write out the hashcache only when the last lock on
1350
# this working copy is released. Peeking at the lock count is a bit
1351
# of a nasty hack; probably it's better to have a transaction object,
1352
# which can do some finalization when it's either successfully or
1353
# unsuccessfully completed. (Denys's original patch did that.)
1354
# RBC 20060206 hooking into transaction will couple lock and transaction
1355
# wrongly. Hooking into unlock on the control files object is fine though.
1357
# TODO: split this per format so there is no ugly if block
1358
if self._hashcache.needs_write and (
1359
# dedicated lock files
1360
self._control_files._lock_count==1 or
1362
(self._control_files is self.branch.control_files and
1363
self._control_files._lock_count==3)):
1364
self._hashcache.write()
1365
# reverse order of locking.
1367
return self._control_files.unlock()
1369
self.branch.unlock()
1919
raise NotImplementedError(self.unlock)
1372
1921
def update(self):
1373
1922
"""Update a working tree along its branch.
1375
This will update the branch if its bound too, which means we have multiple trees involved:
1376
The new basis tree of the master.
1377
The old basis tree of the branch.
1378
The old basis tree of the working tree.
1379
The current working tree state.
1380
pathologically all three may be different, and non ancestors of each other.
1381
Conceptually we want to:
1382
Preserve the wt.basis->wt.state changes
1383
Transform the wt.basis to the new master basis.
1384
Apply a merge of the old branch basis to get any 'local' changes from it into the tree.
1385
Restore the wt.basis->wt.state changes.
1924
This will update the branch if its bound too, which means we have
1925
multiple trees involved:
1927
- The new basis tree of the master.
1928
- The old basis tree of the branch.
1929
- The old basis tree of the working tree.
1930
- The current working tree state.
1932
Pathologically, all three may be different, and non-ancestors of each
1933
other. Conceptually we want to:
1935
- Preserve the wt.basis->wt.state changes
1936
- Transform the wt.basis to the new master basis.
1937
- Apply a merge of the old branch basis to get any 'local' changes from
1939
- Restore the wt.basis->wt.state changes.
1387
1941
There isn't a single operation at the moment to do that, so we:
1388
Merge current state -> basis tree of the master w.r.t. the old tree basis.
1389
Do a 'normal' merge of the old branch basis if it is relevant.
1391
old_tip = self.branch.update()
1392
if old_tip is not None:
1393
self.add_pending_merge(old_tip)
1394
self.branch.lock_read()
1397
if self.last_revision() != self.branch.last_revision():
1398
# merge tree state up to new branch tip.
1399
basis = self.basis_tree()
1942
- Merge current state -> basis tree of the master w.r.t. the old tree
1944
- Do a 'normal' merge of the old branch basis if it is relevant.
1946
if self.branch.get_master_branch() is not None:
1948
update_branch = True
1950
self.lock_tree_write()
1951
update_branch = False
1954
old_tip = self.branch.update()
1957
return self._update_tree(old_tip)
1961
@needs_tree_write_lock
1962
def _update_tree(self, old_tip=None):
1963
"""Update a tree to the master branch.
1965
:param old_tip: if supplied, the previous tip revision the branch,
1966
before it was changed to the master branch's tip.
1968
# here if old_tip is not None, it is the old tip of the branch before
1969
# it was updated from the master branch. This should become a pending
1970
# merge in the working tree to preserve the user existing work. we
1971
# cant set that until we update the working trees last revision to be
1972
# one from the new branch, because it will just get absorbed by the
1973
# parent de-duplication logic.
1975
# We MUST save it even if an error occurs, because otherwise the users
1976
# local work is unreferenced and will appear to have been lost.
1980
last_rev = self.get_parent_ids()[0]
1983
if last_rev != self.branch.last_revision():
1984
# merge tree state up to new branch tip.
1985
basis = self.basis_tree()
1400
1988
to_tree = self.branch.basis_tree()
1401
result += merge_inner(self.branch,
1989
if basis.inventory.root is None:
1990
self.set_root_id(to_tree.inventory.root.file_id)
1992
result += merge.merge_inner(
1404
1996
this_tree=self)
1405
self.set_last_revision(self.branch.last_revision())
1406
if old_tip and old_tip != self.last_revision():
1407
# our last revision was not the prior branch last revision
1408
# and we have converted that last revision to a pending merge.
1409
# base is somewhere between the branch tip now
1410
# and the now pending merge
1411
from bzrlib.revision import common_ancestor
1413
base_rev_id = common_ancestor(self.branch.last_revision(),
1415
self.branch.repository)
1416
except errors.NoCommonAncestor:
1418
base_tree = self.branch.repository.revision_tree(base_rev_id)
1419
other_tree = self.branch.repository.revision_tree(old_tip)
1420
result += merge_inner(self.branch,
1426
self.branch.unlock()
1999
# TODO - dedup parents list with things merged by pull ?
2000
# reuse the tree we've updated to to set the basis:
2001
parent_trees = [(self.branch.last_revision(), to_tree)]
2002
merges = self.get_parent_ids()[1:]
2003
# Ideally we ask the tree for the trees here, that way the working
2004
# tree can decide whether to give us teh entire tree or give us a
2005
# lazy initialised tree. dirstate for instance will have the trees
2006
# in ram already, whereas a last-revision + basis-inventory tree
2007
# will not, but also does not need them when setting parents.
2008
for parent in merges:
2009
parent_trees.append(
2010
(parent, self.branch.repository.revision_tree(parent)))
2011
if old_tip is not None:
2012
parent_trees.append(
2013
(old_tip, self.branch.repository.revision_tree(old_tip)))
2014
self.set_parent_trees(parent_trees)
2015
last_rev = parent_trees[0][0]
2017
# the working tree had the same last-revision as the master
2018
# branch did. We may still have pivot local work from the local
2019
# branch into old_tip:
2020
if old_tip is not None:
2021
self.add_parent_tree_id(old_tip)
2022
if old_tip and old_tip != last_rev:
2023
# our last revision was not the prior branch last revision
2024
# and we have converted that last revision to a pending merge.
2025
# base is somewhere between the branch tip now
2026
# and the now pending merge
2028
# Since we just modified the working tree and inventory, flush out
2029
# the current state, before we modify it again.
2030
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2031
# requires it only because TreeTransform directly munges the
2032
# inventory and calls tree._write_inventory(). Ultimately we
2033
# should be able to remove this extra flush.
2035
from bzrlib.revision import common_ancestor
2037
base_rev_id = common_ancestor(self.branch.last_revision(),
2039
self.branch.repository)
2040
except errors.NoCommonAncestor:
2042
base_tree = self.branch.repository.revision_tree(base_rev_id)
2043
other_tree = self.branch.repository.revision_tree(old_tip)
2044
result += merge.merge_inner(
2051
def _write_hashcache_if_dirty(self):
2052
"""Write out the hashcache if it is dirty."""
2053
if self._hashcache.needs_write:
2055
self._hashcache.write()
2057
if e.errno not in (errno.EPERM, errno.EACCES):
2059
# TODO: jam 20061219 Should this be a warning? A single line
2060
# warning might be sufficient to let the user know what
2062
mutter('Could not write hashcache for %s\nError: %s',
2063
self._hashcache.cache_file_name(), e)
2065
@needs_tree_write_lock
1429
2066
def _write_inventory(self, inv):
1430
2067
"""Write inventory as the current inventory."""
1432
bzrlib.xml5.serializer_v5.write_inventory(inv, sio)
1434
self._control_files.put('inventory', sio)
1435
self._set_inventory(inv)
1436
mutter('wrote working inventory')
2068
self._set_inventory(inv, dirty=True)
1438
2071
def set_conflicts(self, arg):
1439
raise UnsupportedOperation(self.set_conflicts, self)
2072
raise errors.UnsupportedOperation(self.set_conflicts, self)
2074
def add_conflicts(self, arg):
2075
raise errors.UnsupportedOperation(self.add_conflicts, self)
1441
2077
@needs_read_lock
1442
2078
def conflicts(self):
1443
conflicts = ConflictList()
2079
conflicts = _mod_conflicts.ConflictList()
1444
2080
for conflicted in self._iter_conflicts():
1459
2095
if text == False:
1461
2097
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1462
conflicts.append(Conflict.factory(ctype, path=conflicted,
2098
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1463
2100
file_id=self.path2id(conflicted)))
1464
2101
return conflicts
2103
def walkdirs(self, prefix=""):
2104
"""Walk the directories of this tree.
2106
This API returns a generator, which is only valid during the current
2107
tree transaction - within a single lock_read or lock_write duration.
2109
If the tree is not locked, it may cause an error to be raised, depending
2110
on the tree implementation.
2112
disk_top = self.abspath(prefix)
2113
if disk_top.endswith('/'):
2114
disk_top = disk_top[:-1]
2115
top_strip_len = len(disk_top) + 1
2116
inventory_iterator = self._walkdirs(prefix)
2117
disk_iterator = osutils.walkdirs(disk_top, prefix)
2119
current_disk = disk_iterator.next()
2120
disk_finished = False
2122
if e.errno != errno.ENOENT:
2125
disk_finished = True
2127
current_inv = inventory_iterator.next()
2128
inv_finished = False
2129
except StopIteration:
2132
while not inv_finished or not disk_finished:
2133
if not disk_finished:
2134
# strip out .bzr dirs
2135
if current_disk[0][1][top_strip_len:] == '':
2136
# osutils.walkdirs can be made nicer -
2137
# yield the path-from-prefix rather than the pathjoined
2139
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2140
if current_disk[1][bzrdir_loc][0] == '.bzr':
2141
# we dont yield the contents of, or, .bzr itself.
2142
del current_disk[1][bzrdir_loc]
2144
# everything is unknown
2147
# everything is missing
2150
direction = cmp(current_inv[0][0], current_disk[0][0])
2152
# disk is before inventory - unknown
2153
dirblock = [(relpath, basename, kind, stat, None, None) for
2154
relpath, basename, kind, stat, top_path in current_disk[1]]
2155
yield (current_disk[0][0], None), dirblock
2157
current_disk = disk_iterator.next()
2158
except StopIteration:
2159
disk_finished = True
2161
# inventory is before disk - missing.
2162
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2163
for relpath, basename, dkind, stat, fileid, kind in
2165
yield (current_inv[0][0], current_inv[0][1]), dirblock
2167
current_inv = inventory_iterator.next()
2168
except StopIteration:
2171
# versioned present directory
2172
# merge the inventory and disk data together
2174
for relpath, subiterator in itertools.groupby(sorted(
2175
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2176
path_elements = list(subiterator)
2177
if len(path_elements) == 2:
2178
inv_row, disk_row = path_elements
2179
# versioned, present file
2180
dirblock.append((inv_row[0],
2181
inv_row[1], disk_row[2],
2182
disk_row[3], inv_row[4],
2184
elif len(path_elements[0]) == 5:
2186
dirblock.append((path_elements[0][0],
2187
path_elements[0][1], path_elements[0][2],
2188
path_elements[0][3], None, None))
2189
elif len(path_elements[0]) == 6:
2190
# versioned, absent file.
2191
dirblock.append((path_elements[0][0],
2192
path_elements[0][1], 'unknown', None,
2193
path_elements[0][4], path_elements[0][5]))
2195
raise NotImplementedError('unreachable code')
2196
yield current_inv[0], dirblock
2198
current_inv = inventory_iterator.next()
2199
except StopIteration:
2202
current_disk = disk_iterator.next()
2203
except StopIteration:
2204
disk_finished = True
2206
def _walkdirs(self, prefix=""):
2207
_directory = 'directory'
2208
# get the root in the inventory
2209
inv = self.inventory
2210
top_id = inv.path2id(prefix)
2214
pending = [(prefix, '', _directory, None, top_id, None)]
2217
currentdir = pending.pop()
2218
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2219
top_id = currentdir[4]
2221
relroot = currentdir[0] + '/'
2224
# FIXME: stash the node in pending
2226
for name, child in entry.sorted_children():
2227
dirblock.append((relroot + name, name, child.kind, None,
2228
child.file_id, child.kind
2230
yield (currentdir[0], entry.file_id), dirblock
2231
# push the user specified dirs from dirblock
2232
for dir in reversed(dirblock):
2233
if dir[2] == _directory:
2236
@needs_tree_write_lock
2237
def auto_resolve(self):
2238
"""Automatically resolve text conflicts according to contents.
2240
Only text conflicts are auto_resolvable. Files with no conflict markers
2241
are considered 'resolved', because bzr always puts conflict markers
2242
into files that have text conflicts. The corresponding .THIS .BASE and
2243
.OTHER files are deleted, as per 'resolve'.
2244
:return: a tuple of ConflictLists: (un_resolved, resolved).
2246
un_resolved = _mod_conflicts.ConflictList()
2247
resolved = _mod_conflicts.ConflictList()
2248
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2249
for conflict in self.conflicts():
2250
if (conflict.typestring != 'text conflict' or
2251
self.kind(conflict.file_id) != 'file'):
2252
un_resolved.append(conflict)
2254
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2256
for line in my_file:
2257
if conflict_re.search(line):
2258
un_resolved.append(conflict)
2261
resolved.append(conflict)
2264
resolved.remove_files(self)
2265
self.set_conflicts(un_resolved)
2266
return un_resolved, resolved
2268
def _validate(self):
2269
"""Validate internal structures.
2271
This is meant mostly for the test suite. To give it a chance to detect
2272
corruption after actions have occurred. The default implementation is a
2275
:return: None. An exception should be raised if there is an error.
2280
class WorkingTree2(WorkingTree):
2281
"""This is the Format 2 working tree.
2283
This was the first weave based working tree.
2284
- uses os locks for locking.
2285
- uses the branch last-revision.
2288
def __init__(self, *args, **kwargs):
2289
super(WorkingTree2, self).__init__(*args, **kwargs)
2290
# WorkingTree2 has more of a constraint that self._inventory must
2291
# exist. Because this is an older format, we don't mind the overhead
2292
# caused by the extra computation here.
2294
# Newer WorkingTree's should only have self._inventory set when they
2296
if self._inventory is None:
2297
self.read_working_inventory()
2299
def lock_tree_write(self):
2300
"""See WorkingTree.lock_tree_write().
2302
In Format2 WorkingTrees we have a single lock for the branch and tree
2303
so lock_tree_write() degrades to lock_write().
2305
self.branch.lock_write()
2307
return self._control_files.lock_write()
2309
self.branch.unlock()
2313
# we share control files:
2314
if self._control_files._lock_count == 3:
2315
# _inventory_is_modified is always False during a read lock.
2316
if self._inventory_is_modified:
2318
self._write_hashcache_if_dirty()
2320
# reverse order of locking.
2322
return self._control_files.unlock()
2324
self.branch.unlock()
1467
2327
class WorkingTree3(WorkingTree):
1468
2328
"""This is the Format 3 working tree.