39
36
# At the moment they may alias the inventory and have old copies of it in
40
37
# memory. (Now done? -- mbp 20060309)
39
from cStringIO import StringIO
42
from bzrlib.lazy_import import lazy_import
43
lazy_import(globals(), """
44
from bisect import bisect_left
42
46
from copy import deepcopy
43
from cStringIO import StringIO
50
from bzrlib.atomicfile import AtomicFile
51
from bzrlib.branch import (Branch,
53
from bzrlib.conflicts import Conflict, ConflictList, CONFLICT_SUFFIXES
54
import bzrlib.bzrdir as bzrdir
59
conflicts as _mod_conflicts,
78
from bzrlib.transport import get_transport
80
from bzrlib.workingtree_4 import WorkingTreeFormat4
83
from bzrlib import symbol_versioning
55
84
from bzrlib.decorators import needs_read_lock, needs_write_lock
56
import bzrlib.errors as errors
57
from bzrlib.errors import (BzrCheckError,
61
WeaveRevisionNotPresent,
65
MergeModifiedFormatError,
68
from bzrlib.inventory import InventoryEntry, Inventory
85
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
69
86
from bzrlib.lockable_files import LockableFiles, TransportLock
70
87
from bzrlib.lockdir import LockDir
71
from bzrlib.merge import merge_inner, transform_tree
88
import bzrlib.mutabletree
89
from bzrlib.mutabletree import needs_tree_write_lock
72
90
from bzrlib.osutils import (
102
from bzrlib.trace import mutter, note
103
from bzrlib.transport.local import LocalTransport
90
104
from bzrlib.progress import DummyProgress, ProgressPhase
91
from bzrlib.revision import NULL_REVISION
105
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
92
106
from bzrlib.rio import RioReader, rio_file, Stanza
93
from bzrlib.symbol_versioning import *
94
from bzrlib.textui import show_status
96
from bzrlib.transform import build_tree
97
from bzrlib.trace import mutter, note
98
from bzrlib.transport import get_transport
99
from bzrlib.transport.local import LocalTransport
107
from bzrlib.symbol_versioning import (deprecated_passed,
110
DEPRECATED_PARAMETER,
117
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
118
CONFLICT_HEADER_1 = "BZR conflict list format 1"
121
@deprecated_function(zero_thirteen)
104
122
def gen_file_id(name):
105
"""Return new file id.
107
This should probably generate proper UUIDs, but for the moment we
108
cope with just randomness because running uuidgen every time is
111
from binascii import hexlify
112
from time import time
115
idx = name.rfind('/')
117
name = name[idx+1 : ]
118
idx = name.rfind('\\')
120
name = name[idx+1 : ]
122
# make it not a hidden file
123
name = name.lstrip('.')
125
# remove any wierd characters; we don't escape them but rather
127
name = re.sub(r'[^\w.]', '', name)
129
s = hexlify(rand_bytes(8))
130
return '-'.join((name, compact_date(time()), s))
123
"""Return new file id for the basename 'name'.
125
Use bzrlib.generate_ids.gen_file_id() instead
127
return generate_ids.gen_file_id(name)
130
@deprecated_function(zero_thirteen)
133
131
def gen_root_id():
134
"""Return a new tree-root file id."""
135
return gen_file_id('TREE_ROOT')
132
"""Return a new tree-root file id.
134
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
136
return generate_ids.gen_root_id()
138
139
class TreeEntry(object):
139
"""An entry that implements the minium interface used by commands.
140
"""An entry that implements the minimum interface used by commands.
141
142
This needs further inspection, it may be better to have
142
143
InventoryEntries without ids - though that seems wrong. For now,
493
600
__contains__ = has_id
495
602
def get_file_size(self, file_id):
603
file_id = osutils.safe_file_id(file_id)
496
604
return os.path.getsize(self.id2abspath(file_id))
499
def get_file_sha1(self, file_id):
500
path = self._inventory.id2path(file_id)
501
return self._hashcache.get_sha1(path)
503
def is_executable(self, file_id):
504
if not supports_executable():
607
def get_file_sha1(self, file_id, path=None, stat_value=None):
608
file_id = osutils.safe_file_id(file_id)
610
path = self._inventory.id2path(file_id)
611
return self._hashcache.get_sha1(path, stat_value)
613
def get_file_mtime(self, file_id, path=None):
614
file_id = osutils.safe_file_id(file_id)
616
path = self.inventory.id2path(file_id)
617
return os.lstat(self.abspath(path)).st_mtime
619
if not supports_executable():
620
def is_executable(self, file_id, path=None):
621
file_id = osutils.safe_file_id(file_id)
505
622
return self._inventory[file_id].executable
507
path = self._inventory.id2path(file_id)
624
def is_executable(self, file_id, path=None):
626
file_id = osutils.safe_file_id(file_id)
627
path = self.id2path(file_id)
508
628
mode = os.lstat(self.abspath(path)).st_mode
509
return bool(stat.S_ISREG(mode) and stat.S_IEXEC&mode)
512
def add(self, files, ids=None):
513
"""Make files versioned.
515
Note that the command line normally calls smart_add instead,
516
which can automatically recurse.
518
This adds the files to the inventory, so that they will be
519
recorded by the next commit.
522
List of paths to add, relative to the base of the tree.
525
If set, use these instead of automatically generated ids.
526
Must be the same length as the list of files, but may
527
contain None for ids that are to be autogenerated.
529
TODO: Perhaps have an option to add the ids even if the files do
532
TODO: Perhaps callback with the ids and paths as they're added.
629
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
631
@needs_tree_write_lock
632
def _add(self, files, ids, kinds):
633
"""See MutableTree._add."""
534
634
# TODO: Re-adding a file that is removed in the working copy
535
635
# should probably put it back with the previous ID.
536
if isinstance(files, basestring):
537
assert(ids is None or isinstance(ids, basestring))
543
ids = [None] * len(files)
545
assert(len(ids) == len(files))
636
# the read and write working inventory should not occur in this
637
# function - they should be part of lock_write and unlock.
547
638
inv = self.read_working_inventory()
548
for f,file_id in zip(files, ids):
549
if self.is_control_filename(f):
550
raise BzrError("cannot add control file %s" % quotefn(f))
555
raise BzrError("cannot add top-level %r" % f)
557
fullpath = normpath(self.abspath(f))
560
kind = file_kind(fullpath)
562
if e.errno == errno.ENOENT:
563
raise NoSuchFile(fullpath)
564
# maybe something better?
565
raise BzrError('cannot add: not a regular file, symlink or directory: %s' % quotefn(f))
567
if not InventoryEntry.versionable_kind(kind):
568
raise BzrError('cannot add: not a versionable file ('
569
'i.e. regular file, symlink or directory): %s' % quotefn(f))
639
for f, file_id, kind in zip(files, ids, kinds):
640
assert kind is not None
571
641
if file_id is None:
572
file_id = gen_file_id(f)
573
inv.add_path(f, kind=kind, file_id=file_id)
575
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
642
inv.add_path(f, kind=kind)
644
file_id = osutils.safe_file_id(file_id)
645
inv.add_path(f, kind=kind, file_id=file_id)
576
646
self._write_inventory(inv)
648
@needs_tree_write_lock
649
def _gather_kinds(self, files, kinds):
650
"""See MutableTree._gather_kinds."""
651
for pos, f in enumerate(files):
652
if kinds[pos] is None:
653
fullpath = normpath(self.abspath(f))
655
kinds[pos] = file_kind(fullpath)
657
if e.errno == errno.ENOENT:
658
raise errors.NoSuchFile(fullpath)
578
660
@needs_write_lock
661
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
662
"""Add revision_id as a parent.
664
This is equivalent to retrieving the current list of parent ids
665
and setting the list to its value plus revision_id.
667
:param revision_id: The revision id to add to the parent list. It may
668
be a ghost revision as long as its not the first parent to be added,
669
or the allow_leftmost_as_ghost parameter is set True.
670
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
672
parents = self.get_parent_ids() + [revision_id]
673
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
674
or allow_leftmost_as_ghost)
676
@needs_tree_write_lock
677
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
678
"""Add revision_id, tree tuple as a parent.
680
This is equivalent to retrieving the current list of parent trees
681
and setting the list to its value plus parent_tuple. See also
682
add_parent_tree_id - if you only have a parent id available it will be
683
simpler to use that api. If you have the parent already available, using
684
this api is preferred.
686
:param parent_tuple: The (revision id, tree) to add to the parent list.
687
If the revision_id is a ghost, pass None for the tree.
688
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
690
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
691
if len(parent_ids) > 1:
692
# the leftmost may have already been a ghost, preserve that if it
694
allow_leftmost_as_ghost = True
695
self.set_parent_ids(parent_ids,
696
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
698
@needs_tree_write_lock
579
699
def add_pending_merge(self, *revision_ids):
580
700
# TODO: Perhaps should check at this point that the
581
701
# history of the revision is actually present?
582
p = self.pending_merges()
702
parents = self.get_parent_ids()
584
704
for rev_id in revision_ids:
705
if rev_id in parents:
707
parents.append(rev_id)
590
self.set_pending_merges(p)
710
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
712
@deprecated_method(zero_eleven)
593
714
def pending_merges(self):
594
715
"""Return a list of pending merges.
596
717
These are revisions that have been merged into the working
597
718
directory but not yet committed.
600
merges_file = self._control_files.get_utf8('pending-merges')
602
if e.errno != errno.ENOENT:
606
for l in merges_file.readlines():
607
p.append(l.rstrip('\n'))
720
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
721
instead - which is available on all tree objects.
723
return self.get_parent_ids()[1:]
725
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
726
"""Common ghost checking functionality from set_parent_*.
728
This checks that the left hand-parent exists if there are any
731
if len(revision_ids) > 0:
732
leftmost_id = revision_ids[0]
733
if (not allow_leftmost_as_ghost and not
734
self.branch.repository.has_revision(leftmost_id)):
735
raise errors.GhostRevisionUnusableHere(leftmost_id)
737
def _set_merges_from_parent_ids(self, parent_ids):
738
merges = parent_ids[1:]
739
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
741
@needs_tree_write_lock
742
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
743
"""Set the parent ids to revision_ids.
745
See also set_parent_trees. This api will try to retrieve the tree data
746
for each element of revision_ids from the trees repository. If you have
747
tree data already available, it is more efficient to use
748
set_parent_trees rather than set_parent_ids. set_parent_ids is however
749
an easier API to use.
751
:param revision_ids: The revision_ids to set as the parent ids of this
752
working tree. Any of these may be ghosts.
754
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
755
self._check_parents_for_ghosts(revision_ids,
756
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
758
if len(revision_ids) > 0:
759
self.set_last_revision(revision_ids[0])
761
self.set_last_revision(None)
763
self._set_merges_from_parent_ids(revision_ids)
765
@needs_tree_write_lock
766
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
767
"""See MutableTree.set_parent_trees."""
768
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
770
self._check_parents_for_ghosts(parent_ids,
771
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
773
if len(parent_ids) == 0:
774
leftmost_parent_id = None
775
leftmost_parent_tree = None
777
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
779
if self._change_last_revision(leftmost_parent_id):
780
if leftmost_parent_tree is None:
781
# If we don't have a tree, fall back to reading the
782
# parent tree from the repository.
783
self._cache_basis_inventory(leftmost_parent_id)
785
inv = leftmost_parent_tree.inventory
786
xml = self._create_basis_xml_from_inventory(
787
leftmost_parent_id, inv)
788
self._write_basis_inventory(xml)
789
self._set_merges_from_parent_ids(parent_ids)
791
@needs_tree_write_lock
611
792
def set_pending_merges(self, rev_list):
612
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
793
parents = self.get_parent_ids()
794
leftmost = parents[:1]
795
new_parents = leftmost + rev_list
796
self.set_parent_ids(new_parents)
798
@needs_tree_write_lock
615
799
def set_merge_modified(self, modified_hashes):
616
800
def iter_stanzas():
617
801
for file_id, hash in modified_hashes.iteritems():
618
yield Stanza(file_id=file_id, hash=hash)
802
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
619
803
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
622
805
def _put_rio(self, filename, stanzas, header):
806
self._must_be_locked()
623
807
my_file = rio_file(stanzas, header)
624
808
self._control_files.put(filename, my_file)
810
@needs_write_lock # because merge pulls data into the branch.
811
def merge_from_branch(self, branch, to_revision=None):
812
"""Merge from a branch into this working tree.
814
:param branch: The branch to merge from.
815
:param to_revision: If non-None, the merge will merge to to_revision,
816
but not beyond it. to_revision does not need to be in the history
817
of the branch when it is supplied. If None, to_revision defaults to
818
branch.last_revision().
820
from bzrlib.merge import Merger, Merge3Merger
821
pb = bzrlib.ui.ui_factory.nested_progress_bar()
823
merger = Merger(self.branch, this_tree=self, pb=pb)
824
merger.pp = ProgressPhase("Merge phase", 5, pb)
825
merger.pp.next_phase()
826
# check that there are no
828
merger.check_basis(check_clean=True, require_commits=False)
829
if to_revision is None:
830
to_revision = branch.last_revision()
832
to_revision = osutils.safe_revision_id(to_revision)
833
merger.other_rev_id = to_revision
834
if merger.other_rev_id is None:
835
raise error.NoCommits(branch)
836
self.branch.fetch(branch, last_revision=merger.other_rev_id)
837
merger.other_basis = merger.other_rev_id
838
merger.other_tree = self.branch.repository.revision_tree(
840
merger.other_branch = branch
841
merger.pp.next_phase()
843
if merger.base_rev_id == merger.other_rev_id:
844
raise errors.PointlessMerge
845
merger.backup_files = False
846
merger.merge_type = Merge3Merger
847
merger.set_interesting_files(None)
848
merger.show_base = False
849
merger.reprocess = False
850
conflicts = merger.do_merge()
627
857
def merge_modified(self):
858
"""Return a dictionary of files modified by a merge.
860
The list is initialized by WorkingTree.set_merge_modified, which is
861
typically called after we make some automatic updates to the tree
864
This returns a map of file_id->sha1, containing only files which are
865
still in the working inventory and have that text hash.
629
868
hashfile = self._control_files.get('merge-hashes')
869
except errors.NoSuchFile:
632
871
merge_hashes = {}
634
873
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
635
raise MergeModifiedFormatError()
874
raise errors.MergeModifiedFormatError()
636
875
except StopIteration:
637
raise MergeModifiedFormatError()
876
raise errors.MergeModifiedFormatError()
638
877
for s in RioReader(hashfile):
639
file_id = s.get("file_id")
878
# RioReader reads in Unicode, so convert file_ids back to utf8
879
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
640
880
if file_id not in self.inventory:
643
if hash == self.get_file_sha1(file_id):
644
merge_hashes[file_id] = hash
882
text_hash = s.get("hash")
883
if text_hash == self.get_file_sha1(file_id):
884
merge_hashes[file_id] = text_hash
645
885
return merge_hashes
888
def mkdir(self, path, file_id=None):
889
"""See MutableTree.mkdir()."""
891
file_id = generate_ids.gen_file_id(os.path.basename(path))
892
os.mkdir(self.abspath(path))
893
self.add(path, file_id, 'directory')
647
896
def get_symlink_target(self, file_id):
897
file_id = osutils.safe_file_id(file_id)
648
898
return os.readlink(self.id2abspath(file_id))
650
def file_class(self, filename):
651
if self.path2id(filename):
653
elif self.is_ignored(filename):
658
def list_files(self):
659
"""Recursively list all files as (path, class, kind, id).
901
def subsume(self, other_tree):
902
def add_children(inventory, entry):
903
for child_entry in entry.children.values():
904
inventory._byid[child_entry.file_id] = child_entry
905
if child_entry.kind == 'directory':
906
add_children(inventory, child_entry)
907
if other_tree.get_root_id() == self.get_root_id():
908
raise errors.BadSubsumeSource(self, other_tree,
909
'Trees have the same root')
911
other_tree_path = self.relpath(other_tree.basedir)
912
except errors.PathNotChild:
913
raise errors.BadSubsumeSource(self, other_tree,
914
'Tree is not contained by the other')
915
new_root_parent = self.path2id(osutils.dirname(other_tree_path))
916
if new_root_parent is None:
917
raise errors.BadSubsumeSource(self, other_tree,
918
'Parent directory is not versioned.')
919
# We need to ensure that the result of a fetch will have a
920
# versionedfile for the other_tree root, and only fetching into
921
# RepositoryKnit2 guarantees that.
922
if not self.branch.repository.supports_rich_root():
923
raise errors.SubsumeTargetNeedsUpgrade(other_tree)
924
other_tree.lock_tree_write()
926
new_parents = other_tree.get_parent_ids()
927
other_root = other_tree.inventory.root
928
other_root.parent_id = new_root_parent
929
other_root.name = osutils.basename(other_tree_path)
930
self.inventory.add(other_root)
931
add_children(self.inventory, other_root)
932
self._write_inventory(self.inventory)
933
# normally we don't want to fetch whole repositories, but i think
934
# here we really do want to consolidate the whole thing.
935
for parent_id in other_tree.get_parent_ids():
936
self.branch.fetch(other_tree.branch, parent_id)
937
self.add_parent_tree_id(parent_id)
940
other_tree.bzrdir.retire_bzrdir()
942
@needs_tree_write_lock
943
def extract(self, file_id, format=None):
944
"""Extract a subtree from this tree.
946
A new branch will be created, relative to the path for this tree.
950
segments = osutils.splitpath(path)
951
transport = self.branch.bzrdir.root_transport
952
for name in segments:
953
transport = transport.clone(name)
956
except errors.FileExists:
960
sub_path = self.id2path(file_id)
961
branch_transport = mkdirs(sub_path)
963
format = bzrdir.format_registry.make_bzrdir('dirstate-with-subtree')
965
branch_transport.mkdir('.')
966
except errors.FileExists:
968
branch_bzrdir = format.initialize_on_transport(branch_transport)
970
repo = branch_bzrdir.find_repository()
971
except errors.NoRepositoryPresent:
972
repo = branch_bzrdir.create_repository()
973
assert repo.supports_rich_root()
975
if not repo.supports_rich_root():
976
raise errors.RootNotRich()
977
new_branch = branch_bzrdir.create_branch()
978
new_branch.pull(self.branch)
979
for parent_id in self.get_parent_ids():
980
new_branch.fetch(self.branch, parent_id)
981
tree_transport = self.bzrdir.root_transport.clone(sub_path)
982
if tree_transport.base != branch_transport.base:
983
tree_bzrdir = format.initialize_on_transport(tree_transport)
984
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
986
tree_bzrdir = branch_bzrdir
987
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
988
wt.set_parent_ids(self.get_parent_ids())
989
my_inv = self.inventory
990
child_inv = Inventory(root_id=None)
991
new_root = my_inv[file_id]
992
my_inv.remove_recursive_id(file_id)
993
new_root.parent_id = None
994
child_inv.add(new_root)
995
self._write_inventory(my_inv)
996
wt._write_inventory(child_inv)
999
def _serialize(self, inventory, out_file):
1000
xml5.serializer_v5.write_inventory(self._inventory, out_file)
1002
def _deserialize(selt, in_file):
1003
return xml5.serializer_v5.read_inventory(in_file)
1006
"""Write the in memory inventory to disk."""
1007
# TODO: Maybe this should only write on dirty ?
1008
if self._control_files._lock_mode != 'w':
1009
raise errors.NotWriteLocked(self)
1011
self._serialize(self._inventory, sio)
1013
self._control_files.put('inventory', sio)
1014
self._inventory_is_modified = False
1016
def list_files(self, include_root=False):
1017
"""Recursively list all files as (path, class, kind, id, entry).
661
1019
Lists, but does not descend into unversioned directories.
666
1024
Skips the control directory.
668
inv = self._inventory
670
def descend(from_dir_relpath, from_dir_id, dp):
1026
# list_files is an iterator, so @needs_read_lock doesn't work properly
1027
# with it. So callers should be careful to always read_lock the tree.
1028
if not self.is_locked():
1029
raise errors.ObjectNotLocked(self)
1031
inv = self.inventory
1032
if include_root is True:
1033
yield ('', 'V', 'directory', inv.root.file_id, inv.root)
1034
# Convert these into local objects to save lookup times
1035
pathjoin = osutils.pathjoin
1036
file_kind = osutils.file_kind
1038
# transport.base ends in a slash, we want the piece
1039
# between the last two slashes
1040
transport_base_dir = self.bzrdir.transport.base.rsplit('/', 2)[1]
1042
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1044
# directory file_id, relative path, absolute path, reverse sorted children
1045
children = os.listdir(self.basedir)
1047
# jam 20060527 The kernel sized tree seems equivalent whether we
1048
# use a deque and popleft to keep them sorted, or if we use a plain
1049
# list and just reverse() them.
1050
children = collections.deque(children)
1051
stack = [(inv.root.file_id, u'', self.basedir, children)]
1053
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1056
f = children.popleft()
674
1057
## TODO: If we find a subdirectory with its own .bzr
675
1058
## directory, then that is a separate tree and we
676
1059
## should exclude it.
678
1061
# the bzrdir for this tree
679
if self.bzrdir.transport.base.endswith(f + '/'):
1062
if transport_base_dir == f:
683
fp = appendpath(from_dir_relpath, f)
1065
# we know that from_dir_relpath and from_dir_abspath never end in a slash
1066
# and 'f' doesn't begin with one, we can do a string op, rather
1067
# than the checks of pathjoin(), all relative paths will have an extra slash
1069
fp = from_dir_relpath + '/' + f
686
fap = appendpath(dp, f)
1072
fap = from_dir_abspath + '/' + f
688
1074
f_ie = inv.get_child(from_dir_id, f)
691
elif self.is_ignored(fp):
1077
elif self.is_ignored(fp[1:]):
1080
# we may not have found this file, because of a unicode issue
1081
f_norm, can_access = osutils.normalized_filename(f)
1082
if f == f_norm or not can_access:
1083
# No change, so treat this file normally
1086
# this file can be accessed by a normalized path
1087
# check again if it is versioned
1088
# these lines are repeated here for performance
1090
fp = from_dir_relpath + '/' + f
1091
fap = from_dir_abspath + '/' + f
1092
f_ie = inv.get_child(from_dir_id, f)
1095
elif self.is_ignored(fp[1:]):
696
1100
fk = file_kind(fap)
699
1103
if f_ie.kind != fk:
700
raise BzrCheckError("file %r entered as kind %r id %r, "
702
% (fap, f_ie.kind, f_ie.file_id, fk))
1104
raise errors.BzrCheckError(
1105
"file %r entered as kind %r id %r, now of kind %r"
1106
% (fap, f_ie.kind, f_ie.file_id, fk))
704
1108
# make a last minute entry
1110
yield fp[1:], c, fk, f_ie.file_id, f_ie
708
if fk == 'directory':
709
entry = TreeDirectory()
712
elif fk == 'symlink':
1113
yield fp[1:], c, fk, None, fk_entries[fk]()
1115
yield fp[1:], c, fk, None, TreeEntry()
717
yield fp, c, fk, (f_ie and f_ie.file_id), entry
719
1118
if fk != 'directory':
723
# don't descend unversioned directories
726
for ff in descend(fp, f_ie.file_id, fap):
729
for f in descend(u'', inv.root.file_id, self.basedir):
733
def move(self, from_paths, to_name):
1121
# But do this child first
1122
new_children = os.listdir(fap)
1124
new_children = collections.deque(new_children)
1125
stack.append((f_ie.file_id, fp, fap, new_children))
1126
# Break out of inner loop,
1127
# so that we start outer loop with child
1130
# if we finished all children, pop it off the stack
1133
@needs_tree_write_lock
1134
def move(self, from_paths, to_dir=None, after=False, **kwargs):
734
1135
"""Rename files.
736
to_name must exist in the inventory.
1137
to_dir must exist in the inventory.
738
If to_name exists and is a directory, the files are moved into
1139
If to_dir exists and is a directory, the files are moved into
739
1140
it, keeping their old names.
741
Note that to_name is only the last component of the new name;
1142
Note that to_dir is only the last component of the new name;
742
1143
this doesn't change the directory.
1145
For each entry in from_paths the move mode will be determined
1148
The first mode moves the file in the filesystem and updates the
1149
inventory. The second mode only updates the inventory without
1150
touching the file on the filesystem. This is the new mode introduced
1153
move uses the second mode if 'after == True' and the target is not
1154
versioned but present in the working tree.
1156
move uses the second mode if 'after == False' and the source is
1157
versioned but no longer in the working tree, and the target is not
1158
versioned but present in the working tree.
1160
move uses the first mode if 'after == False' and the source is
1161
versioned and present in the working tree, and the target is not
1162
versioned and not present in the working tree.
1164
Everything else results in an error.
744
1166
This returns a list of (from_path, to_path) pairs for each
745
1167
entry that is moved.
748
## TODO: Option to move IDs only
1172
# check for deprecated use of signature
1174
to_dir = kwargs.get('to_name', None)
1176
raise TypeError('You must supply a target directory')
1178
symbol_versioning.warn('The parameter to_name was deprecated'
1179
' in version 0.13. Use to_dir instead',
1182
# check destination directory
749
1183
assert not isinstance(from_paths, basestring)
750
1184
inv = self.inventory
751
to_abs = self.abspath(to_name)
1185
to_abs = self.abspath(to_dir)
752
1186
if not isdir(to_abs):
753
raise BzrError("destination %r is not a directory" % to_abs)
754
if not self.has_filename(to_name):
755
raise BzrError("destination %r not in working directory" % to_abs)
756
to_dir_id = inv.path2id(to_name)
757
if to_dir_id == None and to_name != '':
758
raise BzrError("destination %r is not a versioned directory" % to_name)
1187
raise errors.BzrMoveFailedError('',to_dir,
1188
errors.NotADirectory(to_abs))
1189
if not self.has_filename(to_dir):
1190
raise errors.BzrMoveFailedError('',to_dir,
1191
errors.NotInWorkingDirectory(to_dir))
1192
to_dir_id = inv.path2id(to_dir)
1193
if to_dir_id is None:
1194
raise errors.BzrMoveFailedError('',to_dir,
1195
errors.NotVersionedError(path=str(to_dir)))
759
1197
to_dir_ie = inv[to_dir_id]
760
if to_dir_ie.kind not in ('directory', 'root_directory'):
761
raise BzrError("destination %r is not a directory" % to_abs)
763
to_idpath = inv.get_idpath(to_dir_id)
766
if not self.has_filename(f):
767
raise BzrError("%r does not exist in working tree" % f)
768
f_id = inv.path2id(f)
770
raise BzrError("%r is not versioned" % f)
771
name_tail = splitpath(f)[-1]
772
dest_path = appendpath(to_name, name_tail)
773
if self.has_filename(dest_path):
774
raise BzrError("destination %r already exists" % dest_path)
775
if f_id in to_idpath:
776
raise BzrError("can't move %r to a subdirectory of itself" % f)
778
# OK, so there's a race here, it's possible that someone will
779
# create a file in this interval and then the rename might be
780
# left half-done. But we should have caught most problems.
781
orig_inv = deepcopy(self.inventory)
1198
if to_dir_ie.kind != 'directory':
1199
raise errors.BzrMoveFailedError('',to_dir,
1200
errors.NotADirectory(to_abs))
1202
# create rename entries and tuples
1203
for from_rel in from_paths:
1204
from_tail = splitpath(from_rel)[-1]
1205
from_id = inv.path2id(from_rel)
1207
raise errors.BzrMoveFailedError(from_rel,to_dir,
1208
errors.NotVersionedError(path=str(from_rel)))
1210
from_entry = inv[from_id]
1211
from_parent_id = from_entry.parent_id
1212
to_rel = pathjoin(to_dir, from_tail)
1213
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1215
from_tail=from_tail,
1216
from_parent_id=from_parent_id,
1217
to_rel=to_rel, to_tail=from_tail,
1218
to_parent_id=to_dir_id)
1219
rename_entries.append(rename_entry)
1220
rename_tuples.append((from_rel, to_rel))
1222
# determine which move mode to use. checks also for movability
1223
rename_entries = self._determine_mv_mode(rename_entries, after)
1225
original_modified = self._inventory_is_modified
784
name_tail = splitpath(f)[-1]
785
dest_path = appendpath(to_name, name_tail)
786
result.append((f, dest_path))
787
inv.rename(inv.path2id(f), to_dir_id, name_tail)
789
rename(self.abspath(f), self.abspath(dest_path))
791
raise BzrError("failed to rename %r to %r: %s" %
792
(f, dest_path, e[1]),
793
["rename rolled back"])
1228
self._inventory_is_modified = True
1229
self._move(rename_entries)
795
1231
# restore the inventory on error
796
self._set_inventory(orig_inv)
1232
self._inventory_is_modified = original_modified
798
1234
self._write_inventory(inv)
802
def rename_one(self, from_rel, to_rel):
1235
return rename_tuples
1237
def _determine_mv_mode(self, rename_entries, after=False):
1238
"""Determines for each from-to pair if both inventory and working tree
1239
or only the inventory has to be changed.
1241
Also does basic plausability tests.
1243
inv = self.inventory
1245
for rename_entry in rename_entries:
1246
# store to local variables for easier reference
1247
from_rel = rename_entry.from_rel
1248
from_id = rename_entry.from_id
1249
to_rel = rename_entry.to_rel
1250
to_id = inv.path2id(to_rel)
1251
only_change_inv = False
1253
# check the inventory for source and destination
1255
raise errors.BzrMoveFailedError(from_rel,to_rel,
1256
errors.NotVersionedError(path=str(from_rel)))
1257
if to_id is not None:
1258
raise errors.BzrMoveFailedError(from_rel,to_rel,
1259
errors.AlreadyVersionedError(path=str(to_rel)))
1261
# try to determine the mode for rename (only change inv or change
1262
# inv and file system)
1264
if not self.has_filename(to_rel):
1265
raise errors.BzrMoveFailedError(from_id,to_rel,
1266
errors.NoSuchFile(path=str(to_rel),
1267
extra="New file has not been created yet"))
1268
only_change_inv = True
1269
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1270
only_change_inv = True
1271
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1272
only_change_inv = False
1274
# something is wrong, so lets determine what exactly
1275
if not self.has_filename(from_rel) and \
1276
not self.has_filename(to_rel):
1277
raise errors.BzrRenameFailedError(from_rel,to_rel,
1278
errors.PathsDoNotExist(paths=(str(from_rel),
1281
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1282
extra="(Use --after to update the Bazaar id)")
1283
rename_entry.only_change_inv = only_change_inv
1284
return rename_entries
1286
def _move(self, rename_entries):
1287
"""Moves a list of files.
1289
Depending on the value of the flag 'only_change_inv', the
1290
file will be moved on the file system or not.
1292
inv = self.inventory
1295
for entry in rename_entries:
1297
self._move_entry(entry)
1299
self._rollback_move(moved)
1303
def _rollback_move(self, moved):
1304
"""Try to rollback a previous move in case of an filesystem error."""
1305
inv = self.inventory
1308
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1309
entry.to_tail, entry.to_parent_id, entry.from_rel,
1310
entry.from_tail, entry.from_parent_id,
1311
entry.only_change_inv))
1312
except errors.BzrMoveFailedError, e:
1313
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1314
" The working tree is in an inconsistent state."
1315
" Please consider doing a 'bzr revert'."
1316
" Error message is: %s" % e)
1318
def _move_entry(self, entry):
1319
inv = self.inventory
1320
from_rel_abs = self.abspath(entry.from_rel)
1321
to_rel_abs = self.abspath(entry.to_rel)
1322
if from_rel_abs == to_rel_abs:
1323
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1324
"Source and target are identical.")
1326
if not entry.only_change_inv:
1328
osutils.rename(from_rel_abs, to_rel_abs)
1330
raise errors.BzrMoveFailedError(entry.from_rel,
1332
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1334
@needs_tree_write_lock
1335
def rename_one(self, from_rel, to_rel, after=False):
803
1336
"""Rename one file.
805
1338
This can change the directory or the filename or both.
1340
rename_one has several 'modes' to work. First, it can rename a physical
1341
file and change the file_id. That is the normal mode. Second, it can
1342
only change the file_id without touching any physical file. This is
1343
the new mode introduced in version 0.15.
1345
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1346
versioned but present in the working tree.
1348
rename_one uses the second mode if 'after == False' and 'from_rel' is
1349
versioned but no longer in the working tree, and 'to_rel' is not
1350
versioned but present in the working tree.
1352
rename_one uses the first mode if 'after == False' and 'from_rel' is
1353
versioned and present in the working tree, and 'to_rel' is not
1354
versioned and not present in the working tree.
1356
Everything else results in an error.
807
1358
inv = self.inventory
808
if not self.has_filename(from_rel):
809
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
810
if self.has_filename(to_rel):
811
raise BzrError("can't rename: new working file %r already exists" % to_rel)
813
file_id = inv.path2id(from_rel)
815
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
818
from_parent = entry.parent_id
819
from_name = entry.name
821
if inv.path2id(to_rel):
822
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1361
# create rename entries and tuples
1362
from_tail = splitpath(from_rel)[-1]
1363
from_id = inv.path2id(from_rel)
1365
raise errors.BzrRenameFailedError(from_rel,to_rel,
1366
errors.NotVersionedError(path=str(from_rel)))
1367
from_entry = inv[from_id]
1368
from_parent_id = from_entry.parent_id
824
1369
to_dir, to_tail = os.path.split(to_rel)
825
1370
to_dir_id = inv.path2id(to_dir)
826
if to_dir_id == None and to_dir != '':
827
raise BzrError("can't determine destination directory id for %r" % to_dir)
829
mutter("rename_one:")
830
mutter(" file_id {%s}" % file_id)
831
mutter(" from_rel %r" % from_rel)
832
mutter(" to_rel %r" % to_rel)
833
mutter(" to_dir %r" % to_dir)
834
mutter(" to_dir_id {%s}" % to_dir_id)
836
inv.rename(file_id, to_dir_id, to_tail)
838
from_abs = self.abspath(from_rel)
839
to_abs = self.abspath(to_rel)
841
rename(from_abs, to_abs)
843
inv.rename(file_id, from_parent, from_name)
844
raise BzrError("failed to rename %r to %r: %s"
845
% (from_abs, to_abs, e[1]),
846
["rename rolled back"])
1371
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1373
from_tail=from_tail,
1374
from_parent_id=from_parent_id,
1375
to_rel=to_rel, to_tail=to_tail,
1376
to_parent_id=to_dir_id)
1377
rename_entries.append(rename_entry)
1379
# determine which move mode to use. checks also for movability
1380
rename_entries = self._determine_mv_mode(rename_entries, after)
1382
# check if the target changed directory and if the target directory is
1384
if to_dir_id is None:
1385
raise errors.BzrMoveFailedError(from_rel,to_rel,
1386
errors.NotVersionedError(path=str(to_dir)))
1388
# all checks done. now we can continue with our actual work
1389
mutter('rename_one:\n'
1394
' to_dir_id {%s}\n',
1395
from_id, from_rel, to_rel, to_dir, to_dir_id)
1397
self._move(rename_entries)
847
1398
self._write_inventory(inv)
1400
class _RenameEntry(object):
1401
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1402
to_rel, to_tail, to_parent_id, only_change_inv=False):
1403
self.from_rel = from_rel
1404
self.from_id = from_id
1405
self.from_tail = from_tail
1406
self.from_parent_id = from_parent_id
1407
self.to_rel = to_rel
1408
self.to_tail = to_tail
1409
self.to_parent_id = to_parent_id
1410
self.only_change_inv = only_change_inv
849
1412
@needs_read_lock
850
1413
def unknowns(self):
851
1414
"""Return all unknown files.
853
1416
These are files in the working directory that are not versioned or
854
1417
control files or ignored.
856
>>> from bzrlib.bzrdir import ScratchDir
857
>>> d = ScratchDir(files=['foo', 'foo~'])
858
>>> b = d.open_branch()
859
>>> tree = d.open_workingtree()
860
>>> map(str, tree.unknowns())
863
>>> list(b.unknowns())
865
>>> tree.remove('foo')
866
>>> list(b.unknowns())
869
for subp in self.extras():
870
if not self.is_ignored(subp):
1419
# force the extras method to be fully executed before returning, to
1420
# prevent race conditions with the lock
1422
[subp for subp in self.extras() if not self.is_ignored(subp)])
1424
@needs_tree_write_lock
1425
def unversion(self, file_ids):
1426
"""Remove the file ids in file_ids from the current versioned set.
1428
When a file_id is unversioned, all of its children are automatically
1431
:param file_ids: The file ids to stop versioning.
1432
:raises: NoSuchId if any fileid is not currently versioned.
1434
for file_id in file_ids:
1435
file_id = osutils.safe_file_id(file_id)
1436
if self._inventory.has_id(file_id):
1437
self._inventory.remove_recursive_id(file_id)
1439
raise errors.NoSuchId(self, file_id)
1441
# in the future this should just set a dirty bit to wait for the
1442
# final unlock. However, until all methods of workingtree start
1443
# with the current in -memory inventory rather than triggering
1444
# a read, it is more complex - we need to teach read_inventory
1445
# to know when to read, and when to not read first... and possibly
1446
# to save first when the in memory one may be corrupted.
1447
# so for now, we just only write it if it is indeed dirty.
1449
self._write_inventory(self._inventory)
873
1451
@deprecated_method(zero_eight)
874
1452
def iter_conflicts(self):
875
1453
"""List all files in the tree that have text or content conflicts.
1059
1717
if new_revision is None:
1060
1718
self.branch.set_revision_history([])
1062
# current format is locked in with the branch
1063
revision_history = self.branch.revision_history()
1065
position = revision_history.index(new_revision)
1067
raise errors.NoSuchRevision(self.branch, new_revision)
1068
self.branch.set_revision_history(revision_history[:position + 1])
1721
self.branch.generate_revision_history(new_revision)
1722
except errors.NoSuchRevision:
1723
# not present in the repo - dont try to set it deeper than the tip
1724
self.branch.set_revision_history([new_revision])
1727
def _write_basis_inventory(self, xml):
1728
"""Write the basis inventory XML to the basis-inventory file"""
1729
assert isinstance(xml, str), 'serialised xml must be bytestring.'
1730
path = self._basis_inventory_name()
1732
self._control_files.put(path, sio)
1734
def _create_basis_xml_from_inventory(self, revision_id, inventory):
1735
"""Create the text that will be saved in basis-inventory"""
1736
# TODO: jam 20070209 This should be redundant, as the revision_id
1737
# as all callers should have already converted the revision_id to
1739
inventory.revision_id = osutils.safe_revision_id(revision_id)
1740
return xml7.serializer_v7.write_inventory_to_string(inventory)
1071
1742
def _cache_basis_inventory(self, new_revision):
1072
1743
"""Cache new_revision as the basis inventory."""
1744
# TODO: this should allow the ready-to-use inventory to be passed in,
1745
# as commit already has that ready-to-use [while the format is the
1074
1748
# this double handles the inventory - unpack and repack -
1075
1749
# but is easier to understand. We can/should put a conditional
1076
1750
# in here based on whether the inventory is in the latest format
1077
1751
# - perhaps we should repack all inventories on a repository
1079
inv = self.branch.repository.get_inventory(new_revision)
1080
inv.revision_id = new_revision
1081
xml = bzrlib.xml5.serializer_v5.write_inventory_to_string(inv)
1083
path = self._basis_inventory_name()
1084
self._control_files.put_utf8(path, xml)
1085
except WeaveRevisionNotPresent:
1753
# the fast path is to copy the raw xml from the repository. If the
1754
# xml contains 'revision_id="', then we assume the right
1755
# revision_id is set. We must check for this full string, because a
1756
# root node id can legitimately look like 'revision_id' but cannot
1758
xml = self.branch.repository.get_inventory_xml(new_revision)
1759
firstline = xml.split('\n', 1)[0]
1760
if (not 'revision_id="' in firstline or
1761
'format="7"' not in firstline):
1762
inv = self.branch.repository.deserialise_inventory(
1764
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1765
self._write_basis_inventory(xml)
1766
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1088
1769
def read_basis_inventory(self):
1089
1770
"""Read the cached basis inventory."""
1090
1771
path = self._basis_inventory_name()
1091
return self._control_files.get_utf8(path).read()
1772
return self._control_files.get(path).read()
1093
1774
@needs_read_lock
1094
1775
def read_working_inventory(self):
1095
"""Read the working inventory."""
1776
"""Read the working inventory.
1778
:raises errors.InventoryModified: read_working_inventory will fail
1779
when the current in memory inventory has been modified.
1781
# conceptually this should be an implementation detail of the tree.
1782
# XXX: Deprecate this.
1096
1783
# ElementTree does its own conversion from UTF-8, so open in
1098
result = bzrlib.xml5.serializer_v5.read_inventory(
1099
self._control_files.get('inventory'))
1100
self._set_inventory(result)
1785
if self._inventory_is_modified:
1786
raise errors.InventoryModified(self)
1787
result = self._deserialize(self._control_files.get('inventory'))
1788
self._set_inventory(result, dirty=False)
1104
def remove(self, files, verbose=False):
1791
@needs_tree_write_lock
1792
def remove(self, files, verbose=False, to_file=None):
1105
1793
"""Remove nominated files from the working inventory..
1107
1795
This does not remove their text. This does not run on XXX on what? RBC
1204
1941
between multiple working trees, i.e. via shared storage, then we
1205
1942
would probably want to lock both the local tree, and the branch.
1207
# FIXME: We want to write out the hashcache only when the last lock on
1208
# this working copy is released. Peeking at the lock count is a bit
1209
# of a nasty hack; probably it's better to have a transaction object,
1210
# which can do some finalization when it's either successfully or
1211
# unsuccessfully completed. (Denys's original patch did that.)
1212
# RBC 20060206 hookinhg into transaction will couple lock and transaction
1213
# wrongly. Hookinh into unllock on the control files object is fine though.
1215
# TODO: split this per format so there is no ugly if block
1216
if self._hashcache.needs_write and (
1217
# dedicated lock files
1218
self._control_files._lock_count==1 or
1220
(self._control_files is self.branch.control_files and
1221
self._control_files._lock_count==3)):
1222
self._hashcache.write()
1223
# reverse order of locking.
1224
result = self._control_files.unlock()
1226
self.branch.unlock()
1944
raise NotImplementedError(self.unlock)
1231
1946
def update(self):
1232
1947
"""Update a working tree along its branch.
1234
This will update the branch if its bound too, which means we have multiple trees involved:
1235
The new basis tree of the master.
1236
The old basis tree of the branch.
1237
The old basis tree of the working tree.
1238
The current working tree state.
1239
pathologically all three may be different, and non ancestors of each other.
1240
Conceptually we want to:
1241
Preserve the wt.basis->wt.state changes
1242
Transform the wt.basis to the new master basis.
1243
Apply a merge of the old branch basis to get any 'local' changes from it into the tree.
1244
Restore the wt.basis->wt.state changes.
1949
This will update the branch if its bound too, which means we have
1950
multiple trees involved:
1952
- The new basis tree of the master.
1953
- The old basis tree of the branch.
1954
- The old basis tree of the working tree.
1955
- The current working tree state.
1957
Pathologically, all three may be different, and non-ancestors of each
1958
other. Conceptually we want to:
1960
- Preserve the wt.basis->wt.state changes
1961
- Transform the wt.basis to the new master basis.
1962
- Apply a merge of the old branch basis to get any 'local' changes from
1964
- Restore the wt.basis->wt.state changes.
1246
1966
There isn't a single operation at the moment to do that, so we:
1247
Merge current state -> basis tree of the master w.r.t. the old tree basis.
1248
Do a 'normal' merge of the old branch basis if it is relevant.
1250
old_tip = self.branch.update()
1251
if old_tip is not None:
1252
self.add_pending_merge(old_tip)
1253
self.branch.lock_read()
1256
if self.last_revision() != self.branch.last_revision():
1257
# merge tree state up to new branch tip.
1258
basis = self.basis_tree()
1967
- Merge current state -> basis tree of the master w.r.t. the old tree
1969
- Do a 'normal' merge of the old branch basis if it is relevant.
1971
if self.branch.get_master_branch() is not None:
1973
update_branch = True
1975
self.lock_tree_write()
1976
update_branch = False
1979
old_tip = self.branch.update()
1982
return self._update_tree(old_tip)
1986
@needs_tree_write_lock
1987
def _update_tree(self, old_tip=None):
1988
"""Update a tree to the master branch.
1990
:param old_tip: if supplied, the previous tip revision the branch,
1991
before it was changed to the master branch's tip.
1993
# here if old_tip is not None, it is the old tip of the branch before
1994
# it was updated from the master branch. This should become a pending
1995
# merge in the working tree to preserve the user existing work. we
1996
# cant set that until we update the working trees last revision to be
1997
# one from the new branch, because it will just get absorbed by the
1998
# parent de-duplication logic.
2000
# We MUST save it even if an error occurs, because otherwise the users
2001
# local work is unreferenced and will appear to have been lost.
2005
last_rev = self.get_parent_ids()[0]
2008
if last_rev != self.branch.last_revision():
2009
# merge tree state up to new branch tip.
2010
basis = self.basis_tree()
1259
2013
to_tree = self.branch.basis_tree()
1260
result += merge_inner(self.branch,
2014
if basis.inventory.root is None:
2015
self.set_root_id(to_tree.inventory.root.file_id)
2017
result += merge.merge_inner(
1263
2021
this_tree=self)
1264
self.set_last_revision(self.branch.last_revision())
1265
if old_tip and old_tip != self.last_revision():
1266
# our last revision was not the prior branch last reivison
1267
# and we have converted that last revision to a pending merge.
1268
# base is somewhere between the branch tip now
1269
# and the now pending merge
1270
from bzrlib.revision import common_ancestor
1272
base_rev_id = common_ancestor(self.branch.last_revision(),
1274
self.branch.repository)
1275
except errors.NoCommonAncestor:
1277
base_tree = self.branch.repository.revision_tree(base_rev_id)
1278
other_tree = self.branch.repository.revision_tree(old_tip)
1279
result += merge_inner(self.branch,
1285
self.branch.unlock()
2024
# TODO - dedup parents list with things merged by pull ?
2025
# reuse the tree we've updated to to set the basis:
2026
parent_trees = [(self.branch.last_revision(), to_tree)]
2027
merges = self.get_parent_ids()[1:]
2028
# Ideally we ask the tree for the trees here, that way the working
2029
# tree can decide whether to give us teh entire tree or give us a
2030
# lazy initialised tree. dirstate for instance will have the trees
2031
# in ram already, whereas a last-revision + basis-inventory tree
2032
# will not, but also does not need them when setting parents.
2033
for parent in merges:
2034
parent_trees.append(
2035
(parent, self.branch.repository.revision_tree(parent)))
2036
if old_tip is not None:
2037
parent_trees.append(
2038
(old_tip, self.branch.repository.revision_tree(old_tip)))
2039
self.set_parent_trees(parent_trees)
2040
last_rev = parent_trees[0][0]
2042
# the working tree had the same last-revision as the master
2043
# branch did. We may still have pivot local work from the local
2044
# branch into old_tip:
2045
if old_tip is not None:
2046
self.add_parent_tree_id(old_tip)
2047
if old_tip and old_tip != last_rev:
2048
# our last revision was not the prior branch last revision
2049
# and we have converted that last revision to a pending merge.
2050
# base is somewhere between the branch tip now
2051
# and the now pending merge
2053
# Since we just modified the working tree and inventory, flush out
2054
# the current state, before we modify it again.
2055
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2056
# requires it only because TreeTransform directly munges the
2057
# inventory and calls tree._write_inventory(). Ultimately we
2058
# should be able to remove this extra flush.
2060
from bzrlib.revision import common_ancestor
2062
base_rev_id = common_ancestor(self.branch.last_revision(),
2064
self.branch.repository)
2065
except errors.NoCommonAncestor:
2067
base_tree = self.branch.repository.revision_tree(base_rev_id)
2068
other_tree = self.branch.repository.revision_tree(old_tip)
2069
result += merge.merge_inner(
2076
def _write_hashcache_if_dirty(self):
2077
"""Write out the hashcache if it is dirty."""
2078
if self._hashcache.needs_write:
2080
self._hashcache.write()
2082
if e.errno not in (errno.EPERM, errno.EACCES):
2084
# TODO: jam 20061219 Should this be a warning? A single line
2085
# warning might be sufficient to let the user know what
2087
mutter('Could not write hashcache for %s\nError: %s',
2088
self._hashcache.cache_file_name(), e)
2090
@needs_tree_write_lock
1288
2091
def _write_inventory(self, inv):
1289
2092
"""Write inventory as the current inventory."""
1291
bzrlib.xml5.serializer_v5.write_inventory(inv, sio)
1293
self._control_files.put('inventory', sio)
1294
self._set_inventory(inv)
1295
mutter('wrote working inventory')
2093
self._set_inventory(inv, dirty=True)
1297
2096
def set_conflicts(self, arg):
1298
raise UnsupportedOperation(self.set_conflicts, self)
2097
raise errors.UnsupportedOperation(self.set_conflicts, self)
2099
def add_conflicts(self, arg):
2100
raise errors.UnsupportedOperation(self.add_conflicts, self)
1300
2102
@needs_read_lock
1301
2103
def conflicts(self):
1302
conflicts = ConflictList()
2104
conflicts = _mod_conflicts.ConflictList()
1303
2105
for conflicted in self._iter_conflicts():
1306
2108
if file_kind(self.abspath(conflicted)) != "file":
1309
if e.errno == errno.ENOENT:
2110
except errors.NoSuchFile:
1313
2112
if text is True:
1314
2113
for suffix in ('.THIS', '.OTHER'):
1316
2115
kind = file_kind(self.abspath(conflicted+suffix))
1318
if e.errno == errno.ENOENT:
2118
except errors.NoSuchFile:
1326
2122
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1327
conflicts.append(Conflict.factory(ctype, path=conflicted,
2123
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1328
2125
file_id=self.path2id(conflicted)))
1329
2126
return conflicts
2128
def walkdirs(self, prefix=""):
2129
"""Walk the directories of this tree.
2131
This API returns a generator, which is only valid during the current
2132
tree transaction - within a single lock_read or lock_write duration.
2134
If the tree is not locked, it may cause an error to be raised, depending
2135
on the tree implementation.
2137
disk_top = self.abspath(prefix)
2138
if disk_top.endswith('/'):
2139
disk_top = disk_top[:-1]
2140
top_strip_len = len(disk_top) + 1
2141
inventory_iterator = self._walkdirs(prefix)
2142
disk_iterator = osutils.walkdirs(disk_top, prefix)
2144
current_disk = disk_iterator.next()
2145
disk_finished = False
2147
if e.errno != errno.ENOENT:
2150
disk_finished = True
2152
current_inv = inventory_iterator.next()
2153
inv_finished = False
2154
except StopIteration:
2157
while not inv_finished or not disk_finished:
2158
if not disk_finished:
2159
# strip out .bzr dirs
2160
if current_disk[0][1][top_strip_len:] == '':
2161
# osutils.walkdirs can be made nicer -
2162
# yield the path-from-prefix rather than the pathjoined
2164
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2165
if current_disk[1][bzrdir_loc][0] == '.bzr':
2166
# we dont yield the contents of, or, .bzr itself.
2167
del current_disk[1][bzrdir_loc]
2169
# everything is unknown
2172
# everything is missing
2175
direction = cmp(current_inv[0][0], current_disk[0][0])
2177
# disk is before inventory - unknown
2178
dirblock = [(relpath, basename, kind, stat, None, None) for
2179
relpath, basename, kind, stat, top_path in current_disk[1]]
2180
yield (current_disk[0][0], None), dirblock
2182
current_disk = disk_iterator.next()
2183
except StopIteration:
2184
disk_finished = True
2186
# inventory is before disk - missing.
2187
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2188
for relpath, basename, dkind, stat, fileid, kind in
2190
yield (current_inv[0][0], current_inv[0][1]), dirblock
2192
current_inv = inventory_iterator.next()
2193
except StopIteration:
2196
# versioned present directory
2197
# merge the inventory and disk data together
2199
for relpath, subiterator in itertools.groupby(sorted(
2200
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2201
path_elements = list(subiterator)
2202
if len(path_elements) == 2:
2203
inv_row, disk_row = path_elements
2204
# versioned, present file
2205
dirblock.append((inv_row[0],
2206
inv_row[1], disk_row[2],
2207
disk_row[3], inv_row[4],
2209
elif len(path_elements[0]) == 5:
2211
dirblock.append((path_elements[0][0],
2212
path_elements[0][1], path_elements[0][2],
2213
path_elements[0][3], None, None))
2214
elif len(path_elements[0]) == 6:
2215
# versioned, absent file.
2216
dirblock.append((path_elements[0][0],
2217
path_elements[0][1], 'unknown', None,
2218
path_elements[0][4], path_elements[0][5]))
2220
raise NotImplementedError('unreachable code')
2221
yield current_inv[0], dirblock
2223
current_inv = inventory_iterator.next()
2224
except StopIteration:
2227
current_disk = disk_iterator.next()
2228
except StopIteration:
2229
disk_finished = True
2231
def _walkdirs(self, prefix=""):
2232
_directory = 'directory'
2233
# get the root in the inventory
2234
inv = self.inventory
2235
top_id = inv.path2id(prefix)
2239
pending = [(prefix, '', _directory, None, top_id, None)]
2242
currentdir = pending.pop()
2243
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2244
top_id = currentdir[4]
2246
relroot = currentdir[0] + '/'
2249
# FIXME: stash the node in pending
2251
for name, child in entry.sorted_children():
2252
dirblock.append((relroot + name, name, child.kind, None,
2253
child.file_id, child.kind
2255
yield (currentdir[0], entry.file_id), dirblock
2256
# push the user specified dirs from dirblock
2257
for dir in reversed(dirblock):
2258
if dir[2] == _directory:
2261
@needs_tree_write_lock
2262
def auto_resolve(self):
2263
"""Automatically resolve text conflicts according to contents.
2265
Only text conflicts are auto_resolvable. Files with no conflict markers
2266
are considered 'resolved', because bzr always puts conflict markers
2267
into files that have text conflicts. The corresponding .THIS .BASE and
2268
.OTHER files are deleted, as per 'resolve'.
2269
:return: a tuple of ConflictLists: (un_resolved, resolved).
2271
un_resolved = _mod_conflicts.ConflictList()
2272
resolved = _mod_conflicts.ConflictList()
2273
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2274
for conflict in self.conflicts():
2275
if (conflict.typestring != 'text conflict' or
2276
self.kind(conflict.file_id) != 'file'):
2277
un_resolved.append(conflict)
2279
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2281
for line in my_file:
2282
if conflict_re.search(line):
2283
un_resolved.append(conflict)
2286
resolved.append(conflict)
2289
resolved.remove_files(self)
2290
self.set_conflicts(un_resolved)
2291
return un_resolved, resolved
2294
class WorkingTree2(WorkingTree):
2295
"""This is the Format 2 working tree.
2297
This was the first weave based working tree.
2298
- uses os locks for locking.
2299
- uses the branch last-revision.
2302
def lock_tree_write(self):
2303
"""See WorkingTree.lock_tree_write().
2305
In Format2 WorkingTrees we have a single lock for the branch and tree
2306
so lock_tree_write() degrades to lock_write().
2308
self.branch.lock_write()
2310
return self._control_files.lock_write()
2312
self.branch.unlock()
2316
# we share control files:
2317
if self._control_files._lock_count == 3:
2318
# _inventory_is_modified is always False during a read lock.
2319
if self._inventory_is_modified:
2321
self._write_hashcache_if_dirty()
2323
# reverse order of locking.
2325
return self._control_files.unlock()
2327
self.branch.unlock()
1332
2330
class WorkingTree3(WorkingTree):
1333
2331
"""This is the Format 3 working tree.