36
39
# At the moment they may alias the inventory and have old copies of it in
37
40
# memory. (Now done? -- mbp 20060309)
42
from copy import deepcopy
39
43
from cStringIO import StringIO
43
from bzrlib.lazy_import import lazy_import
44
lazy_import(globals(), """
45
from bisect import bisect_left
47
from copy import deepcopy
60
conflicts as _mod_conflicts,
81
from bzrlib.transport import get_transport
83
from bzrlib.workingtree_4 import WorkingTreeFormat4
86
from bzrlib import symbol_versioning
51
from bzrlib.atomicfile import AtomicFile
52
from bzrlib.branch import (Branch,
54
from bzrlib.conflicts import Conflict, ConflictList, CONFLICT_SUFFIXES
55
import bzrlib.bzrdir as bzrdir
87
56
from bzrlib.decorators import needs_read_lock, needs_write_lock
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
57
import bzrlib.errors as errors
58
from bzrlib.errors import (BzrCheckError,
62
WeaveRevisionNotPresent,
66
MergeModifiedFormatError,
69
from bzrlib.inventory import InventoryEntry, Inventory
89
70
from bzrlib.lockable_files import LockableFiles, TransportLock
90
71
from bzrlib.lockdir import LockDir
91
import bzrlib.mutabletree
92
from bzrlib.mutabletree import needs_tree_write_lock
72
from bzrlib.merge import merge_inner, transform_tree
93
73
from bzrlib.osutils import (
91
from bzrlib.progress import DummyProgress, ProgressPhase
92
from bzrlib.revision import NULL_REVISION
93
from bzrlib.rio import RioReader, rio_file, Stanza
94
from bzrlib.symbol_versioning import *
95
from bzrlib.textui import show_status
97
from bzrlib.transform import build_tree
105
98
from bzrlib.trace import mutter, note
99
from bzrlib.transport import get_transport
106
100
from bzrlib.transport.local import LocalTransport
107
from bzrlib.progress import DummyProgress, ProgressPhase
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
109
from bzrlib.rio import RioReader, rio_file, Stanza
110
from bzrlib.symbol_versioning import (deprecated_passed,
113
DEPRECATED_PARAMETER,
120
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
121
CONFLICT_HEADER_1 = "BZR conflict list format 1"
123
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
126
@deprecated_function(zero_thirteen)
127
105
def gen_file_id(name):
128
"""Return new file id for the basename 'name'.
130
Use bzrlib.generate_ids.gen_file_id() instead
132
return generate_ids.gen_file_id(name)
135
@deprecated_function(zero_thirteen)
106
"""Return new file id.
108
This should probably generate proper UUIDs, but for the moment we
109
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))
136
133
def gen_root_id():
137
"""Return a new tree-root file id.
139
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
141
return generate_ids.gen_root_id()
134
"""Return a new tree-root file id."""
135
return gen_file_id('TREE_ROOT')
144
138
class TreeEntry(object):
145
"""An entry that implements the minimum interface used by commands.
139
"""An entry that implements the minium interface used by commands.
147
141
This needs further inspection, it may be better to have
148
142
InventoryEntries without ids - though that seems wrong. For now,
581
512
__contains__ = has_id
583
514
def get_file_size(self, file_id):
584
file_id = osutils.safe_file_id(file_id)
585
515
return os.path.getsize(self.id2abspath(file_id))
588
def get_file_sha1(self, file_id, path=None, stat_value=None):
589
file_id = osutils.safe_file_id(file_id)
518
def get_file_sha1(self, file_id):
519
path = self._inventory.id2path(file_id)
520
return self._hashcache.get_sha1(path)
522
def is_executable(self, file_id):
523
if not supports_executable():
524
return self._inventory[file_id].executable
591
526
path = self._inventory.id2path(file_id)
592
return self._hashcache.get_sha1(path, stat_value)
594
def get_file_mtime(self, file_id, path=None):
595
file_id = osutils.safe_file_id(file_id)
597
path = self.inventory.id2path(file_id)
598
return os.lstat(self.abspath(path)).st_mtime
600
if not supports_executable():
601
def is_executable(self, file_id, path=None):
602
file_id = osutils.safe_file_id(file_id)
603
return self._inventory[file_id].executable
605
def is_executable(self, file_id, path=None):
607
file_id = osutils.safe_file_id(file_id)
608
path = self.id2path(file_id)
609
527
mode = os.lstat(self.abspath(path)).st_mode
610
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
612
@needs_tree_write_lock
613
def _add(self, files, ids, kinds):
614
"""See MutableTree._add."""
528
return bool(stat.S_ISREG(mode) and stat.S_IEXEC&mode)
531
def add(self, files, ids=None):
532
"""Make files versioned.
534
Note that the command line normally calls smart_add instead,
535
which can automatically recurse.
537
This adds the files to the inventory, so that they will be
538
recorded by the next commit.
541
List of paths to add, relative to the base of the tree.
544
If set, use these instead of automatically generated ids.
545
Must be the same length as the list of files, but may
546
contain None for ids that are to be autogenerated.
548
TODO: Perhaps have an option to add the ids even if the files do
551
TODO: Perhaps callback with the ids and paths as they're added.
615
553
# TODO: Re-adding a file that is removed in the working copy
616
554
# should probably put it back with the previous ID.
617
# the read and write working inventory should not occur in this
618
# function - they should be part of lock_write and unlock.
555
if isinstance(files, basestring):
556
assert(ids is None or isinstance(ids, basestring))
562
ids = [None] * len(files)
564
assert(len(ids) == len(files))
619
566
inv = self.read_working_inventory()
620
for f, file_id, kind in zip(files, ids, kinds):
621
assert kind is not None
567
for f,file_id in zip(files, ids):
568
if self.is_control_filename(f):
569
raise BzrError("cannot add control file %s" % quotefn(f))
574
raise BzrError("cannot add top-level %r" % f)
576
fullpath = normpath(self.abspath(f))
579
kind = file_kind(fullpath)
581
if e.errno == errno.ENOENT:
582
raise NoSuchFile(fullpath)
583
# maybe something better?
584
raise BzrError('cannot add: not a regular file, symlink or directory: %s' % quotefn(f))
586
if not InventoryEntry.versionable_kind(kind):
587
raise BzrError('cannot add: not a versionable file ('
588
'i.e. regular file, symlink or directory): %s' % quotefn(f))
622
590
if file_id is None:
623
inv.add_path(f, kind=kind)
625
file_id = osutils.safe_file_id(file_id)
626
inv.add_path(f, kind=kind, file_id=file_id)
591
file_id = gen_file_id(f)
592
inv.add_path(f, kind=kind, file_id=file_id)
594
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
627
595
self._write_inventory(inv)
629
@needs_tree_write_lock
630
def _gather_kinds(self, files, kinds):
631
"""See MutableTree._gather_kinds."""
632
for pos, f in enumerate(files):
633
if kinds[pos] is None:
634
fullpath = normpath(self.abspath(f))
636
kinds[pos] = file_kind(fullpath)
638
if e.errno == errno.ENOENT:
639
raise errors.NoSuchFile(fullpath)
641
597
@needs_write_lock
642
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
643
"""Add revision_id as a parent.
645
This is equivalent to retrieving the current list of parent ids
646
and setting the list to its value plus revision_id.
648
:param revision_id: The revision id to add to the parent list. It may
649
be a ghost revision as long as its not the first parent to be added,
650
or the allow_leftmost_as_ghost parameter is set True.
651
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
653
parents = self.get_parent_ids() + [revision_id]
654
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
655
or allow_leftmost_as_ghost)
657
@needs_tree_write_lock
658
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
659
"""Add revision_id, tree tuple as a parent.
661
This is equivalent to retrieving the current list of parent trees
662
and setting the list to its value plus parent_tuple. See also
663
add_parent_tree_id - if you only have a parent id available it will be
664
simpler to use that api. If you have the parent already available, using
665
this api is preferred.
667
:param parent_tuple: The (revision id, tree) to add to the parent list.
668
If the revision_id is a ghost, pass None for the tree.
669
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
671
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
672
if len(parent_ids) > 1:
673
# the leftmost may have already been a ghost, preserve that if it
675
allow_leftmost_as_ghost = True
676
self.set_parent_ids(parent_ids,
677
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
679
@needs_tree_write_lock
680
598
def add_pending_merge(self, *revision_ids):
681
599
# TODO: Perhaps should check at this point that the
682
600
# history of the revision is actually present?
683
parents = self.get_parent_ids()
601
p = self.pending_merges()
685
603
for rev_id in revision_ids:
686
if rev_id in parents:
688
parents.append(rev_id)
691
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
609
self.set_pending_merges(p)
693
@deprecated_method(zero_eleven)
695
612
def pending_merges(self):
696
613
"""Return a list of pending merges.
698
615
These are revisions that have been merged into the working
699
616
directory but not yet committed.
701
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
702
instead - which is available on all tree objects.
704
return self.get_parent_ids()[1:]
706
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
707
"""Common ghost checking functionality from set_parent_*.
709
This checks that the left hand-parent exists if there are any
712
if len(revision_ids) > 0:
713
leftmost_id = revision_ids[0]
714
if (not allow_leftmost_as_ghost and not
715
self.branch.repository.has_revision(leftmost_id)):
716
raise errors.GhostRevisionUnusableHere(leftmost_id)
718
def _set_merges_from_parent_ids(self, parent_ids):
719
merges = parent_ids[1:]
720
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
722
@needs_tree_write_lock
723
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
724
"""Set the parent ids to revision_ids.
726
See also set_parent_trees. This api will try to retrieve the tree data
727
for each element of revision_ids from the trees repository. If you have
728
tree data already available, it is more efficient to use
729
set_parent_trees rather than set_parent_ids. set_parent_ids is however
730
an easier API to use.
732
:param revision_ids: The revision_ids to set as the parent ids of this
733
working tree. Any of these may be ghosts.
735
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
736
self._check_parents_for_ghosts(revision_ids,
737
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
739
if len(revision_ids) > 0:
740
self.set_last_revision(revision_ids[0])
742
self.set_last_revision(None)
744
self._set_merges_from_parent_ids(revision_ids)
746
@needs_tree_write_lock
747
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
748
"""See MutableTree.set_parent_trees."""
749
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
751
self._check_parents_for_ghosts(parent_ids,
752
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
754
if len(parent_ids) == 0:
755
leftmost_parent_id = None
756
leftmost_parent_tree = None
758
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
760
if self._change_last_revision(leftmost_parent_id):
761
if leftmost_parent_tree is None:
762
# If we don't have a tree, fall back to reading the
763
# parent tree from the repository.
764
self._cache_basis_inventory(leftmost_parent_id)
766
inv = leftmost_parent_tree.inventory
767
xml = self._create_basis_xml_from_inventory(
768
leftmost_parent_id, inv)
769
self._write_basis_inventory(xml)
770
self._set_merges_from_parent_ids(parent_ids)
772
@needs_tree_write_lock
619
merges_file = self._control_files.get_utf8('pending-merges')
621
if e.errno != errno.ENOENT:
625
for l in merges_file.readlines():
626
p.append(l.rstrip('\n'))
773
630
def set_pending_merges(self, rev_list):
774
parents = self.get_parent_ids()
775
leftmost = parents[:1]
776
new_parents = leftmost + rev_list
777
self.set_parent_ids(new_parents)
631
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
779
@needs_tree_write_lock
780
634
def set_merge_modified(self, modified_hashes):
781
635
def iter_stanzas():
782
636
for file_id, hash in modified_hashes.iteritems():
783
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
637
yield Stanza(file_id=file_id, hash=hash)
784
638
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
786
641
def _put_rio(self, filename, stanzas, header):
787
self._must_be_locked()
788
642
my_file = rio_file(stanzas, header)
789
643
self._control_files.put(filename, my_file)
791
@needs_write_lock # because merge pulls data into the branch.
792
def merge_from_branch(self, branch, to_revision=None):
793
"""Merge from a branch into this working tree.
795
:param branch: The branch to merge from.
796
:param to_revision: If non-None, the merge will merge to to_revision,
797
but not beyond it. to_revision does not need to be in the history
798
of the branch when it is supplied. If None, to_revision defaults to
799
branch.last_revision().
801
from bzrlib.merge import Merger, Merge3Merger
802
pb = bzrlib.ui.ui_factory.nested_progress_bar()
804
merger = Merger(self.branch, this_tree=self, pb=pb)
805
merger.pp = ProgressPhase("Merge phase", 5, pb)
806
merger.pp.next_phase()
807
# check that there are no
809
merger.check_basis(check_clean=True, require_commits=False)
810
if to_revision is None:
811
to_revision = branch.last_revision()
813
to_revision = osutils.safe_revision_id(to_revision)
814
merger.other_rev_id = to_revision
815
if merger.other_rev_id is None:
816
raise error.NoCommits(branch)
817
self.branch.fetch(branch, last_revision=merger.other_rev_id)
818
merger.other_basis = merger.other_rev_id
819
merger.other_tree = self.branch.repository.revision_tree(
821
merger.other_branch = branch
822
merger.pp.next_phase()
824
if merger.base_rev_id == merger.other_rev_id:
825
raise errors.PointlessMerge
826
merger.backup_files = False
827
merger.merge_type = Merge3Merger
828
merger.set_interesting_files(None)
829
merger.show_base = False
830
merger.reprocess = False
831
conflicts = merger.do_merge()
838
646
def merge_modified(self):
839
"""Return a dictionary of files modified by a merge.
841
The list is initialized by WorkingTree.set_merge_modified, which is
842
typically called after we make some automatic updates to the tree
845
This returns a map of file_id->sha1, containing only files which are
846
still in the working inventory and have that text hash.
849
648
hashfile = self._control_files.get('merge-hashes')
850
except errors.NoSuchFile:
852
651
merge_hashes = {}
854
653
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
855
raise errors.MergeModifiedFormatError()
654
raise MergeModifiedFormatError()
856
655
except StopIteration:
857
raise errors.MergeModifiedFormatError()
656
raise MergeModifiedFormatError()
858
657
for s in RioReader(hashfile):
859
# RioReader reads in Unicode, so convert file_ids back to utf8
860
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
658
file_id = s.get("file_id")
861
659
if file_id not in self.inventory:
863
text_hash = s.get("hash")
864
if text_hash == self.get_file_sha1(file_id):
865
merge_hashes[file_id] = text_hash
662
if hash == self.get_file_sha1(file_id):
663
merge_hashes[file_id] = hash
866
664
return merge_hashes
869
def mkdir(self, path, file_id=None):
870
"""See MutableTree.mkdir()."""
872
file_id = generate_ids.gen_file_id(os.path.basename(path))
873
os.mkdir(self.abspath(path))
874
self.add(path, file_id, 'directory')
877
666
def get_symlink_target(self, file_id):
878
file_id = osutils.safe_file_id(file_id)
879
667
return os.readlink(self.id2abspath(file_id))
882
def subsume(self, other_tree):
883
def add_children(inventory, entry):
884
for child_entry in entry.children.values():
885
inventory._byid[child_entry.file_id] = child_entry
886
if child_entry.kind == 'directory':
887
add_children(inventory, child_entry)
888
if other_tree.get_root_id() == self.get_root_id():
889
raise errors.BadSubsumeSource(self, other_tree,
890
'Trees have the same root')
892
other_tree_path = self.relpath(other_tree.basedir)
893
except errors.PathNotChild:
894
raise errors.BadSubsumeSource(self, other_tree,
895
'Tree is not contained by the other')
896
new_root_parent = self.path2id(osutils.dirname(other_tree_path))
897
if new_root_parent is None:
898
raise errors.BadSubsumeSource(self, other_tree,
899
'Parent directory is not versioned.')
900
# We need to ensure that the result of a fetch will have a
901
# versionedfile for the other_tree root, and only fetching into
902
# RepositoryKnit2 guarantees that.
903
if not self.branch.repository.supports_rich_root():
904
raise errors.SubsumeTargetNeedsUpgrade(other_tree)
905
other_tree.lock_tree_write()
907
new_parents = other_tree.get_parent_ids()
908
other_root = other_tree.inventory.root
909
other_root.parent_id = new_root_parent
910
other_root.name = osutils.basename(other_tree_path)
911
self.inventory.add(other_root)
912
add_children(self.inventory, other_root)
913
self._write_inventory(self.inventory)
914
# normally we don't want to fetch whole repositories, but i think
915
# here we really do want to consolidate the whole thing.
916
for parent_id in other_tree.get_parent_ids():
917
self.branch.fetch(other_tree.branch, parent_id)
918
self.add_parent_tree_id(parent_id)
921
other_tree.bzrdir.retire_bzrdir()
923
@needs_tree_write_lock
924
def extract(self, file_id, format=None):
925
"""Extract a subtree from this tree.
927
A new branch will be created, relative to the path for this tree.
931
segments = osutils.splitpath(path)
932
transport = self.branch.bzrdir.root_transport
933
for name in segments:
934
transport = transport.clone(name)
937
except errors.FileExists:
941
sub_path = self.id2path(file_id)
942
branch_transport = mkdirs(sub_path)
944
format = bzrdir.format_registry.make_bzrdir('dirstate-with-subtree')
946
branch_transport.mkdir('.')
947
except errors.FileExists:
949
branch_bzrdir = format.initialize_on_transport(branch_transport)
951
repo = branch_bzrdir.find_repository()
952
except errors.NoRepositoryPresent:
953
repo = branch_bzrdir.create_repository()
954
assert repo.supports_rich_root()
956
if not repo.supports_rich_root():
957
raise errors.RootNotRich()
958
new_branch = branch_bzrdir.create_branch()
959
new_branch.pull(self.branch)
960
for parent_id in self.get_parent_ids():
961
new_branch.fetch(self.branch, parent_id)
962
tree_transport = self.bzrdir.root_transport.clone(sub_path)
963
if tree_transport.base != branch_transport.base:
964
tree_bzrdir = format.initialize_on_transport(tree_transport)
965
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
967
tree_bzrdir = branch_bzrdir
968
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
969
wt.set_parent_ids(self.get_parent_ids())
970
my_inv = self.inventory
971
child_inv = Inventory(root_id=None)
972
new_root = my_inv[file_id]
973
my_inv.remove_recursive_id(file_id)
974
new_root.parent_id = None
975
child_inv.add(new_root)
976
self._write_inventory(my_inv)
977
wt._write_inventory(child_inv)
980
def _serialize(self, inventory, out_file):
981
xml5.serializer_v5.write_inventory(self._inventory, out_file)
983
def _deserialize(selt, in_file):
984
return xml5.serializer_v5.read_inventory(in_file)
987
"""Write the in memory inventory to disk."""
988
# TODO: Maybe this should only write on dirty ?
989
if self._control_files._lock_mode != 'w':
990
raise errors.NotWriteLocked(self)
992
self._serialize(self._inventory, sio)
994
self._control_files.put('inventory', sio)
995
self._inventory_is_modified = False
997
def _kind(self, relpath):
998
return osutils.file_kind(self.abspath(relpath))
1000
def list_files(self, include_root=False):
1001
"""Recursively list all files as (path, class, kind, id, entry).
669
def file_class(self, filename):
670
if self.path2id(filename):
672
elif self.is_ignored(filename):
677
def list_files(self):
678
"""Recursively list all files as (path, class, kind, id).
1003
680
Lists, but does not descend into unversioned directories.
1008
685
Skips the control directory.
1010
# list_files is an iterator, so @needs_read_lock doesn't work properly
1011
# with it. So callers should be careful to always read_lock the tree.
1012
if not self.is_locked():
1013
raise errors.ObjectNotLocked(self)
1015
inv = self.inventory
1016
if include_root is True:
1017
yield ('', 'V', 'directory', inv.root.file_id, inv.root)
1018
# Convert these into local objects to save lookup times
1019
pathjoin = osutils.pathjoin
1020
file_kind = self._kind
1022
# transport.base ends in a slash, we want the piece
1023
# between the last two slashes
1024
transport_base_dir = self.bzrdir.transport.base.rsplit('/', 2)[1]
1026
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1028
# directory file_id, relative path, absolute path, reverse sorted children
1029
children = os.listdir(self.basedir)
1031
# jam 20060527 The kernel sized tree seems equivalent whether we
1032
# use a deque and popleft to keep them sorted, or if we use a plain
1033
# list and just reverse() them.
1034
children = collections.deque(children)
1035
stack = [(inv.root.file_id, u'', self.basedir, children)]
1037
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1040
f = children.popleft()
687
inv = self._inventory
689
def descend(from_dir_relpath, from_dir_id, dp):
1041
693
## TODO: If we find a subdirectory with its own .bzr
1042
694
## directory, then that is a separate tree and we
1043
695
## should exclude it.
1045
697
# the bzrdir for this tree
1046
if transport_base_dir == f:
698
if self.bzrdir.transport.base.endswith(f + '/'):
1049
# we know that from_dir_relpath and from_dir_abspath never end in a slash
1050
# and 'f' doesn't begin with one, we can do a string op, rather
1051
# than the checks of pathjoin(), all relative paths will have an extra slash
1053
fp = from_dir_relpath + '/' + f
702
fp = appendpath(from_dir_relpath, f)
1056
fap = from_dir_abspath + '/' + f
705
fap = appendpath(dp, f)
1058
707
f_ie = inv.get_child(from_dir_id, f)
1061
elif self.is_ignored(fp[1:]):
710
elif self.is_ignored(fp):
1064
# we may not have found this file, because of a unicode issue
1065
f_norm, can_access = osutils.normalized_filename(f)
1066
if f == f_norm or not can_access:
1067
# No change, so treat this file normally
1070
# this file can be accessed by a normalized path
1071
# check again if it is versioned
1072
# these lines are repeated here for performance
1074
fp = from_dir_relpath + '/' + f
1075
fap = from_dir_abspath + '/' + f
1076
f_ie = inv.get_child(from_dir_id, f)
1079
elif self.is_ignored(fp[1:]):
1084
715
fk = file_kind(fap)
719
raise BzrCheckError("file %r entered as kind %r id %r, "
721
% (fap, f_ie.kind, f_ie.file_id, fk))
1086
723
# make a last minute entry
1088
yield fp[1:], c, fk, f_ie.file_id, f_ie
1091
yield fp[1:], c, fk, None, fk_entries[fk]()
1093
yield fp[1:], c, fk, None, TreeEntry()
727
if fk == 'directory':
728
entry = TreeDirectory()
731
elif fk == 'symlink':
736
yield fp, c, fk, (f_ie and f_ie.file_id), entry
1096
738
if fk != 'directory':
1099
# But do this child first
1100
new_children = os.listdir(fap)
1102
new_children = collections.deque(new_children)
1103
stack.append((f_ie.file_id, fp, fap, new_children))
1104
# Break out of inner loop,
1105
# so that we start outer loop with child
1108
# if we finished all children, pop it off the stack
1111
@needs_tree_write_lock
1112
def move(self, from_paths, to_dir=None, after=False, **kwargs):
742
# don't descend unversioned directories
745
for ff in descend(fp, f_ie.file_id, fap):
748
for f in descend(u'', inv.root.file_id, self.basedir):
752
def move(self, from_paths, to_name):
1113
753
"""Rename files.
1115
to_dir must exist in the inventory.
755
to_name must exist in the inventory.
1117
If to_dir exists and is a directory, the files are moved into
757
If to_name exists and is a directory, the files are moved into
1118
758
it, keeping their old names.
1120
Note that to_dir is only the last component of the new name;
760
Note that to_name is only the last component of the new name;
1121
761
this doesn't change the directory.
1123
For each entry in from_paths the move mode will be determined
1126
The first mode moves the file in the filesystem and updates the
1127
inventory. The second mode only updates the inventory without
1128
touching the file on the filesystem. This is the new mode introduced
1131
move uses the second mode if 'after == True' and the target is not
1132
versioned but present in the working tree.
1134
move uses the second mode if 'after == False' and the source is
1135
versioned but no longer in the working tree, and the target is not
1136
versioned but present in the working tree.
1138
move uses the first mode if 'after == False' and the source is
1139
versioned and present in the working tree, and the target is not
1140
versioned and not present in the working tree.
1142
Everything else results in an error.
1144
763
This returns a list of (from_path, to_path) pairs for each
1145
764
entry that is moved.
1150
# check for deprecated use of signature
1152
to_dir = kwargs.get('to_name', None)
1154
raise TypeError('You must supply a target directory')
1156
symbol_versioning.warn('The parameter to_name was deprecated'
1157
' in version 0.13. Use to_dir instead',
1160
# check destination directory
767
## TODO: Option to move IDs only
1161
768
assert not isinstance(from_paths, basestring)
1162
769
inv = self.inventory
1163
to_abs = self.abspath(to_dir)
770
to_abs = self.abspath(to_name)
1164
771
if not isdir(to_abs):
1165
raise errors.BzrMoveFailedError('',to_dir,
1166
errors.NotADirectory(to_abs))
1167
if not self.has_filename(to_dir):
1168
raise errors.BzrMoveFailedError('',to_dir,
1169
errors.NotInWorkingDirectory(to_dir))
1170
to_dir_id = inv.path2id(to_dir)
1171
if to_dir_id is None:
1172
raise errors.BzrMoveFailedError('',to_dir,
1173
errors.NotVersionedError(path=str(to_dir)))
772
raise BzrError("destination %r is not a directory" % to_abs)
773
if not self.has_filename(to_name):
774
raise BzrError("destination %r not in working directory" % to_abs)
775
to_dir_id = inv.path2id(to_name)
776
if to_dir_id == None and to_name != '':
777
raise BzrError("destination %r is not a versioned directory" % to_name)
1175
778
to_dir_ie = inv[to_dir_id]
1176
if to_dir_ie.kind != 'directory':
1177
raise errors.BzrMoveFailedError('',to_dir,
1178
errors.NotADirectory(to_abs))
1180
# create rename entries and tuples
1181
for from_rel in from_paths:
1182
from_tail = splitpath(from_rel)[-1]
1183
from_id = inv.path2id(from_rel)
1185
raise errors.BzrMoveFailedError(from_rel,to_dir,
1186
errors.NotVersionedError(path=str(from_rel)))
1188
from_entry = inv[from_id]
1189
from_parent_id = from_entry.parent_id
1190
to_rel = pathjoin(to_dir, from_tail)
1191
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1193
from_tail=from_tail,
1194
from_parent_id=from_parent_id,
1195
to_rel=to_rel, to_tail=from_tail,
1196
to_parent_id=to_dir_id)
1197
rename_entries.append(rename_entry)
1198
rename_tuples.append((from_rel, to_rel))
1200
# determine which move mode to use. checks also for movability
1201
rename_entries = self._determine_mv_mode(rename_entries, after)
1203
original_modified = self._inventory_is_modified
779
if to_dir_ie.kind not in ('directory', 'root_directory'):
780
raise BzrError("destination %r is not a directory" % to_abs)
782
to_idpath = inv.get_idpath(to_dir_id)
785
if not self.has_filename(f):
786
raise BzrError("%r does not exist in working tree" % f)
787
f_id = inv.path2id(f)
789
raise BzrError("%r is not versioned" % f)
790
name_tail = splitpath(f)[-1]
791
dest_path = appendpath(to_name, name_tail)
792
if self.has_filename(dest_path):
793
raise BzrError("destination %r already exists" % dest_path)
794
if f_id in to_idpath:
795
raise BzrError("can't move %r to a subdirectory of itself" % f)
797
# OK, so there's a race here, it's possible that someone will
798
# create a file in this interval and then the rename might be
799
# left half-done. But we should have caught most problems.
800
orig_inv = deepcopy(self.inventory)
1206
self._inventory_is_modified = True
1207
self._move(rename_entries)
803
name_tail = splitpath(f)[-1]
804
dest_path = appendpath(to_name, name_tail)
805
result.append((f, dest_path))
806
inv.rename(inv.path2id(f), to_dir_id, name_tail)
808
rename(self.abspath(f), self.abspath(dest_path))
810
raise BzrError("failed to rename %r to %r: %s" %
811
(f, dest_path, e[1]),
812
["rename rolled back"])
1209
814
# restore the inventory on error
1210
self._inventory_is_modified = original_modified
815
self._set_inventory(orig_inv)
1212
817
self._write_inventory(inv)
1213
return rename_tuples
1215
def _determine_mv_mode(self, rename_entries, after=False):
1216
"""Determines for each from-to pair if both inventory and working tree
1217
or only the inventory has to be changed.
1219
Also does basic plausability tests.
1221
inv = self.inventory
1223
for rename_entry in rename_entries:
1224
# store to local variables for easier reference
1225
from_rel = rename_entry.from_rel
1226
from_id = rename_entry.from_id
1227
to_rel = rename_entry.to_rel
1228
to_id = inv.path2id(to_rel)
1229
only_change_inv = False
1231
# check the inventory for source and destination
1233
raise errors.BzrMoveFailedError(from_rel,to_rel,
1234
errors.NotVersionedError(path=str(from_rel)))
1235
if to_id is not None:
1236
raise errors.BzrMoveFailedError(from_rel,to_rel,
1237
errors.AlreadyVersionedError(path=str(to_rel)))
1239
# try to determine the mode for rename (only change inv or change
1240
# inv and file system)
1242
if not self.has_filename(to_rel):
1243
raise errors.BzrMoveFailedError(from_id,to_rel,
1244
errors.NoSuchFile(path=str(to_rel),
1245
extra="New file has not been created yet"))
1246
only_change_inv = True
1247
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1248
only_change_inv = True
1249
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1250
only_change_inv = False
1252
# something is wrong, so lets determine what exactly
1253
if not self.has_filename(from_rel) and \
1254
not self.has_filename(to_rel):
1255
raise errors.BzrRenameFailedError(from_rel,to_rel,
1256
errors.PathsDoNotExist(paths=(str(from_rel),
1259
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1260
extra="(Use --after to update the Bazaar id)")
1261
rename_entry.only_change_inv = only_change_inv
1262
return rename_entries
1264
def _move(self, rename_entries):
1265
"""Moves a list of files.
1267
Depending on the value of the flag 'only_change_inv', the
1268
file will be moved on the file system or not.
1270
inv = self.inventory
1273
for entry in rename_entries:
1275
self._move_entry(entry)
1277
self._rollback_move(moved)
1281
def _rollback_move(self, moved):
1282
"""Try to rollback a previous move in case of an filesystem error."""
1283
inv = self.inventory
1286
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1287
entry.to_tail, entry.to_parent_id, entry.from_rel,
1288
entry.from_tail, entry.from_parent_id,
1289
entry.only_change_inv))
1290
except errors.BzrMoveFailedError, e:
1291
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1292
" The working tree is in an inconsistent state."
1293
" Please consider doing a 'bzr revert'."
1294
" Error message is: %s" % e)
1296
def _move_entry(self, entry):
1297
inv = self.inventory
1298
from_rel_abs = self.abspath(entry.from_rel)
1299
to_rel_abs = self.abspath(entry.to_rel)
1300
if from_rel_abs == to_rel_abs:
1301
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1302
"Source and target are identical.")
1304
if not entry.only_change_inv:
1306
osutils.rename(from_rel_abs, to_rel_abs)
1308
raise errors.BzrMoveFailedError(entry.from_rel,
1310
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1312
@needs_tree_write_lock
1313
def rename_one(self, from_rel, to_rel, after=False):
821
def rename_one(self, from_rel, to_rel):
1314
822
"""Rename one file.
1316
824
This can change the directory or the filename or both.
1318
rename_one has several 'modes' to work. First, it can rename a physical
1319
file and change the file_id. That is the normal mode. Second, it can
1320
only change the file_id without touching any physical file. This is
1321
the new mode introduced in version 0.15.
1323
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1324
versioned but present in the working tree.
1326
rename_one uses the second mode if 'after == False' and 'from_rel' is
1327
versioned but no longer in the working tree, and 'to_rel' is not
1328
versioned but present in the working tree.
1330
rename_one uses the first mode if 'after == False' and 'from_rel' is
1331
versioned and present in the working tree, and 'to_rel' is not
1332
versioned and not present in the working tree.
1334
Everything else results in an error.
1336
826
inv = self.inventory
1339
# create rename entries and tuples
1340
from_tail = splitpath(from_rel)[-1]
1341
from_id = inv.path2id(from_rel)
1343
raise errors.BzrRenameFailedError(from_rel,to_rel,
1344
errors.NotVersionedError(path=str(from_rel)))
1345
from_entry = inv[from_id]
1346
from_parent_id = from_entry.parent_id
827
if not self.has_filename(from_rel):
828
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
829
if self.has_filename(to_rel):
830
raise BzrError("can't rename: new working file %r already exists" % to_rel)
832
file_id = inv.path2id(from_rel)
834
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
837
from_parent = entry.parent_id
838
from_name = entry.name
840
if inv.path2id(to_rel):
841
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1347
843
to_dir, to_tail = os.path.split(to_rel)
1348
844
to_dir_id = inv.path2id(to_dir)
1349
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1351
from_tail=from_tail,
1352
from_parent_id=from_parent_id,
1353
to_rel=to_rel, to_tail=to_tail,
1354
to_parent_id=to_dir_id)
1355
rename_entries.append(rename_entry)
1357
# determine which move mode to use. checks also for movability
1358
rename_entries = self._determine_mv_mode(rename_entries, after)
1360
# check if the target changed directory and if the target directory is
1362
if to_dir_id is None:
1363
raise errors.BzrMoveFailedError(from_rel,to_rel,
1364
errors.NotVersionedError(path=str(to_dir)))
1366
# all checks done. now we can continue with our actual work
1367
mutter('rename_one:\n'
1372
' to_dir_id {%s}\n',
1373
from_id, from_rel, to_rel, to_dir, to_dir_id)
1375
self._move(rename_entries)
845
if to_dir_id == None and to_dir != '':
846
raise BzrError("can't determine destination directory id for %r" % to_dir)
848
mutter("rename_one:")
849
mutter(" file_id {%s}" % file_id)
850
mutter(" from_rel %r" % from_rel)
851
mutter(" to_rel %r" % to_rel)
852
mutter(" to_dir %r" % to_dir)
853
mutter(" to_dir_id {%s}" % to_dir_id)
855
inv.rename(file_id, to_dir_id, to_tail)
857
from_abs = self.abspath(from_rel)
858
to_abs = self.abspath(to_rel)
860
rename(from_abs, to_abs)
862
inv.rename(file_id, from_parent, from_name)
863
raise BzrError("failed to rename %r to %r: %s"
864
% (from_abs, to_abs, e[1]),
865
["rename rolled back"])
1376
866
self._write_inventory(inv)
1378
class _RenameEntry(object):
1379
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1380
to_rel, to_tail, to_parent_id, only_change_inv=False):
1381
self.from_rel = from_rel
1382
self.from_id = from_id
1383
self.from_tail = from_tail
1384
self.from_parent_id = from_parent_id
1385
self.to_rel = to_rel
1386
self.to_tail = to_tail
1387
self.to_parent_id = to_parent_id
1388
self.only_change_inv = only_change_inv
1390
868
@needs_read_lock
1391
869
def unknowns(self):
1392
870
"""Return all unknown files.
1394
872
These are files in the working directory that are not versioned or
1395
873
control files or ignored.
1397
# force the extras method to be fully executed before returning, to
1398
# prevent race conditions with the lock
1400
[subp for subp in self.extras() if not self.is_ignored(subp)])
1402
@needs_tree_write_lock
1403
def unversion(self, file_ids):
1404
"""Remove the file ids in file_ids from the current versioned set.
1406
When a file_id is unversioned, all of its children are automatically
1409
:param file_ids: The file ids to stop versioning.
1410
:raises: NoSuchId if any fileid is not currently versioned.
1412
for file_id in file_ids:
1413
file_id = osutils.safe_file_id(file_id)
1414
if self._inventory.has_id(file_id):
1415
self._inventory.remove_recursive_id(file_id)
1417
raise errors.NoSuchId(self, file_id)
1419
# in the future this should just set a dirty bit to wait for the
1420
# final unlock. However, until all methods of workingtree start
1421
# with the current in -memory inventory rather than triggering
1422
# a read, it is more complex - we need to teach read_inventory
1423
# to know when to read, and when to not read first... and possibly
1424
# to save first when the in memory one may be corrupted.
1425
# so for now, we just only write it if it is indeed dirty.
1427
self._write_inventory(self._inventory)
875
>>> from bzrlib.bzrdir import ScratchDir
876
>>> d = ScratchDir(files=['foo', 'foo~'])
877
>>> b = d.open_branch()
878
>>> tree = d.open_workingtree()
879
>>> map(str, tree.unknowns())
882
>>> list(b.unknowns())
884
>>> tree.remove('foo')
885
>>> list(b.unknowns())
888
for subp in self.extras():
889
if not self.is_ignored(subp):
1429
892
@deprecated_method(zero_eight)
1430
893
def iter_conflicts(self):
1431
894
"""List all files in the tree that have text or content conflicts.
1695
1149
if new_revision is None:
1696
1150
self.branch.set_revision_history([])
1152
# current format is locked in with the branch
1153
revision_history = self.branch.revision_history()
1699
self.branch.generate_revision_history(new_revision)
1700
except errors.NoSuchRevision:
1701
# not present in the repo - dont try to set it deeper than the tip
1702
self.branch.set_revision_history([new_revision])
1155
position = revision_history.index(new_revision)
1157
raise errors.NoSuchRevision(self.branch, new_revision)
1158
self.branch.set_revision_history(revision_history[:position + 1])
1705
def _write_basis_inventory(self, xml):
1706
"""Write the basis inventory XML to the basis-inventory file"""
1707
assert isinstance(xml, str), 'serialised xml must be bytestring.'
1708
path = self._basis_inventory_name()
1710
self._control_files.put(path, sio)
1712
def _create_basis_xml_from_inventory(self, revision_id, inventory):
1713
"""Create the text that will be saved in basis-inventory"""
1714
# TODO: jam 20070209 This should be redundant, as the revision_id
1715
# as all callers should have already converted the revision_id to
1717
inventory.revision_id = osutils.safe_revision_id(revision_id)
1718
return xml7.serializer_v7.write_inventory_to_string(inventory)
1720
1161
def _cache_basis_inventory(self, new_revision):
1721
1162
"""Cache new_revision as the basis inventory."""
1722
# TODO: this should allow the ready-to-use inventory to be passed in,
1723
# as commit already has that ready-to-use [while the format is the
1726
1164
# this double handles the inventory - unpack and repack -
1727
1165
# but is easier to understand. We can/should put a conditional
1728
1166
# in here based on whether the inventory is in the latest format
1729
1167
# - perhaps we should repack all inventories on a repository
1731
# the fast path is to copy the raw xml from the repository. If the
1732
# xml contains 'revision_id="', then we assume the right
1733
# revision_id is set. We must check for this full string, because a
1734
# root node id can legitimately look like 'revision_id' but cannot
1736
xml = self.branch.repository.get_inventory_xml(new_revision)
1737
firstline = xml.split('\n', 1)[0]
1738
if (not 'revision_id="' in firstline or
1739
'format="7"' not in firstline):
1740
inv = self.branch.repository.deserialise_inventory(
1742
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1743
self._write_basis_inventory(xml)
1744
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1169
inv = self.branch.repository.get_inventory(new_revision)
1170
inv.revision_id = new_revision
1171
xml = bzrlib.xml5.serializer_v5.write_inventory_to_string(inv)
1173
path = self._basis_inventory_name()
1174
self._control_files.put_utf8(path, xml)
1175
except WeaveRevisionNotPresent:
1747
1178
def read_basis_inventory(self):
1748
1179
"""Read the cached basis inventory."""
1749
1180
path = self._basis_inventory_name()
1750
return self._control_files.get(path).read()
1181
return self._control_files.get_utf8(path).read()
1752
1183
@needs_read_lock
1753
1184
def read_working_inventory(self):
1754
"""Read the working inventory.
1756
:raises errors.InventoryModified: read_working_inventory will fail
1757
when the current in memory inventory has been modified.
1759
# conceptually this should be an implementation detail of the tree.
1760
# XXX: Deprecate this.
1185
"""Read the working inventory."""
1761
1186
# ElementTree does its own conversion from UTF-8, so open in
1763
if self._inventory_is_modified:
1764
raise errors.InventoryModified(self)
1765
result = self._deserialize(self._control_files.get('inventory'))
1766
self._set_inventory(result, dirty=False)
1188
result = bzrlib.xml5.serializer_v5.read_inventory(
1189
self._control_files.get('inventory'))
1190
self._set_inventory(result)
1769
@needs_tree_write_lock
1770
def remove(self, files, verbose=False, to_file=None):
1194
def remove(self, files, verbose=False):
1771
1195
"""Remove nominated files from the working inventory..
1773
1197
This does not remove their text. This does not run on XXX on what? RBC
1919
1294
between multiple working trees, i.e. via shared storage, then we
1920
1295
would probably want to lock both the local tree, and the branch.
1922
raise NotImplementedError(self.unlock)
1297
# FIXME: We want to write out the hashcache only when the last lock on
1298
# this working copy is released. Peeking at the lock count is a bit
1299
# of a nasty hack; probably it's better to have a transaction object,
1300
# which can do some finalization when it's either successfully or
1301
# unsuccessfully completed. (Denys's original patch did that.)
1302
# RBC 20060206 hookinhg into transaction will couple lock and transaction
1303
# wrongly. Hookinh into unllock on the control files object is fine though.
1305
# TODO: split this per format so there is no ugly if block
1306
if self._hashcache.needs_write and (
1307
# dedicated lock files
1308
self._control_files._lock_count==1 or
1310
(self._control_files is self.branch.control_files and
1311
self._control_files._lock_count==3)):
1312
self._hashcache.write()
1313
# reverse order of locking.
1315
return self._control_files.unlock()
1317
self.branch.unlock()
1924
1320
def update(self):
1925
1321
"""Update a working tree along its branch.
1927
This will update the branch if its bound too, which means we have
1928
multiple trees involved:
1930
- The new basis tree of the master.
1931
- The old basis tree of the branch.
1932
- The old basis tree of the working tree.
1933
- The current working tree state.
1935
Pathologically, all three may be different, and non-ancestors of each
1936
other. Conceptually we want to:
1938
- Preserve the wt.basis->wt.state changes
1939
- Transform the wt.basis to the new master basis.
1940
- Apply a merge of the old branch basis to get any 'local' changes from
1942
- Restore the wt.basis->wt.state changes.
1323
This will update the branch if its bound too, which means we have multiple trees involved:
1324
The new basis tree of the master.
1325
The old basis tree of the branch.
1326
The old basis tree of the working tree.
1327
The current working tree state.
1328
pathologically all three may be different, and non ancestors of each other.
1329
Conceptually we want to:
1330
Preserve the wt.basis->wt.state changes
1331
Transform the wt.basis to the new master basis.
1332
Apply a merge of the old branch basis to get any 'local' changes from it into the tree.
1333
Restore the wt.basis->wt.state changes.
1944
1335
There isn't a single operation at the moment to do that, so we:
1945
- Merge current state -> basis tree of the master w.r.t. the old tree
1947
- Do a 'normal' merge of the old branch basis if it is relevant.
1949
if self.branch.get_master_branch() is not None:
1951
update_branch = True
1953
self.lock_tree_write()
1954
update_branch = False
1957
old_tip = self.branch.update()
1960
return self._update_tree(old_tip)
1964
@needs_tree_write_lock
1965
def _update_tree(self, old_tip=None):
1966
"""Update a tree to the master branch.
1968
:param old_tip: if supplied, the previous tip revision the branch,
1969
before it was changed to the master branch's tip.
1971
# here if old_tip is not None, it is the old tip of the branch before
1972
# it was updated from the master branch. This should become a pending
1973
# merge in the working tree to preserve the user existing work. we
1974
# cant set that until we update the working trees last revision to be
1975
# one from the new branch, because it will just get absorbed by the
1976
# parent de-duplication logic.
1978
# We MUST save it even if an error occurs, because otherwise the users
1979
# local work is unreferenced and will appear to have been lost.
1983
last_rev = self.get_parent_ids()[0]
1986
if last_rev != self.branch.last_revision():
1987
# merge tree state up to new branch tip.
1988
basis = self.basis_tree()
1336
Merge current state -> basis tree of the master w.r.t. the old tree basis.
1337
Do a 'normal' merge of the old branch basis if it is relevant.
1339
old_tip = self.branch.update()
1340
if old_tip is not None:
1341
self.add_pending_merge(old_tip)
1342
self.branch.lock_read()
1345
if self.last_revision() != self.branch.last_revision():
1346
# merge tree state up to new branch tip.
1347
basis = self.basis_tree()
1991
1348
to_tree = self.branch.basis_tree()
1992
if basis.inventory.root is None:
1993
self.set_root_id(to_tree.inventory.root.file_id)
1995
result += merge.merge_inner(
1349
result += merge_inner(self.branch,
1999
1352
this_tree=self)
2002
# TODO - dedup parents list with things merged by pull ?
2003
# reuse the tree we've updated to to set the basis:
2004
parent_trees = [(self.branch.last_revision(), to_tree)]
2005
merges = self.get_parent_ids()[1:]
2006
# Ideally we ask the tree for the trees here, that way the working
2007
# tree can decide whether to give us teh entire tree or give us a
2008
# lazy initialised tree. dirstate for instance will have the trees
2009
# in ram already, whereas a last-revision + basis-inventory tree
2010
# will not, but also does not need them when setting parents.
2011
for parent in merges:
2012
parent_trees.append(
2013
(parent, self.branch.repository.revision_tree(parent)))
2014
if old_tip is not None:
2015
parent_trees.append(
2016
(old_tip, self.branch.repository.revision_tree(old_tip)))
2017
self.set_parent_trees(parent_trees)
2018
last_rev = parent_trees[0][0]
2020
# the working tree had the same last-revision as the master
2021
# branch did. We may still have pivot local work from the local
2022
# branch into old_tip:
2023
if old_tip is not None:
2024
self.add_parent_tree_id(old_tip)
2025
if old_tip and old_tip != last_rev:
2026
# our last revision was not the prior branch last revision
2027
# and we have converted that last revision to a pending merge.
2028
# base is somewhere between the branch tip now
2029
# and the now pending merge
2031
# Since we just modified the working tree and inventory, flush out
2032
# the current state, before we modify it again.
2033
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2034
# requires it only because TreeTransform directly munges the
2035
# inventory and calls tree._write_inventory(). Ultimately we
2036
# should be able to remove this extra flush.
2038
from bzrlib.revision import common_ancestor
2040
base_rev_id = common_ancestor(self.branch.last_revision(),
2042
self.branch.repository)
2043
except errors.NoCommonAncestor:
2045
base_tree = self.branch.repository.revision_tree(base_rev_id)
2046
other_tree = self.branch.repository.revision_tree(old_tip)
2047
result += merge.merge_inner(
2054
def _write_hashcache_if_dirty(self):
2055
"""Write out the hashcache if it is dirty."""
2056
if self._hashcache.needs_write:
2058
self._hashcache.write()
2060
if e.errno not in (errno.EPERM, errno.EACCES):
2062
# TODO: jam 20061219 Should this be a warning? A single line
2063
# warning might be sufficient to let the user know what
2065
mutter('Could not write hashcache for %s\nError: %s',
2066
self._hashcache.cache_file_name(), e)
2068
@needs_tree_write_lock
1353
self.set_last_revision(self.branch.last_revision())
1354
if old_tip and old_tip != self.last_revision():
1355
# our last revision was not the prior branch last reivison
1356
# and we have converted that last revision to a pending merge.
1357
# base is somewhere between the branch tip now
1358
# and the now pending merge
1359
from bzrlib.revision import common_ancestor
1361
base_rev_id = common_ancestor(self.branch.last_revision(),
1363
self.branch.repository)
1364
except errors.NoCommonAncestor:
1366
base_tree = self.branch.repository.revision_tree(base_rev_id)
1367
other_tree = self.branch.repository.revision_tree(old_tip)
1368
result += merge_inner(self.branch,
1374
self.branch.unlock()
2069
1377
def _write_inventory(self, inv):
2070
1378
"""Write inventory as the current inventory."""
2071
self._set_inventory(inv, dirty=True)
1380
bzrlib.xml5.serializer_v5.write_inventory(inv, sio)
1382
self._control_files.put('inventory', sio)
1383
self._set_inventory(inv)
1384
mutter('wrote working inventory')
2074
1386
def set_conflicts(self, arg):
2075
raise errors.UnsupportedOperation(self.set_conflicts, self)
2077
def add_conflicts(self, arg):
2078
raise errors.UnsupportedOperation(self.add_conflicts, self)
1387
raise UnsupportedOperation(self.set_conflicts, self)
2080
1389
@needs_read_lock
2081
1390
def conflicts(self):
2082
conflicts = _mod_conflicts.ConflictList()
1391
conflicts = ConflictList()
2083
1392
for conflicted in self._iter_conflicts():
2086
1395
if file_kind(self.abspath(conflicted)) != "file":
2088
except errors.NoSuchFile:
1398
if e.errno == errno.ENOENT:
2090
1402
if text is True:
2091
1403
for suffix in ('.THIS', '.OTHER'):
2093
1405
kind = file_kind(self.abspath(conflicted+suffix))
1407
if e.errno == errno.ENOENT:
2096
except errors.NoSuchFile:
2100
1415
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
2101
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1416
conflicts.append(Conflict.factory(ctype, path=conflicted,
2103
1417
file_id=self.path2id(conflicted)))
2104
1418
return conflicts
2106
def walkdirs(self, prefix=""):
2107
"""Walk the directories of this tree.
2109
This API returns a generator, which is only valid during the current
2110
tree transaction - within a single lock_read or lock_write duration.
2112
If the tree is not locked, it may cause an error to be raised, depending
2113
on the tree implementation.
2115
disk_top = self.abspath(prefix)
2116
if disk_top.endswith('/'):
2117
disk_top = disk_top[:-1]
2118
top_strip_len = len(disk_top) + 1
2119
inventory_iterator = self._walkdirs(prefix)
2120
disk_iterator = osutils.walkdirs(disk_top, prefix)
2122
current_disk = disk_iterator.next()
2123
disk_finished = False
2125
if not (e.errno == errno.ENOENT or
2126
(sys.platform == 'win32' and e.errno == ERROR_PATH_NOT_FOUND)):
2129
disk_finished = True
2131
current_inv = inventory_iterator.next()
2132
inv_finished = False
2133
except StopIteration:
2136
while not inv_finished or not disk_finished:
2137
if not disk_finished:
2138
# strip out .bzr dirs
2139
if current_disk[0][1][top_strip_len:] == '':
2140
# osutils.walkdirs can be made nicer -
2141
# yield the path-from-prefix rather than the pathjoined
2143
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2144
if current_disk[1][bzrdir_loc][0] == '.bzr':
2145
# we dont yield the contents of, or, .bzr itself.
2146
del current_disk[1][bzrdir_loc]
2148
# everything is unknown
2151
# everything is missing
2154
direction = cmp(current_inv[0][0], current_disk[0][0])
2156
# disk is before inventory - unknown
2157
dirblock = [(relpath, basename, kind, stat, None, None) for
2158
relpath, basename, kind, stat, top_path in current_disk[1]]
2159
yield (current_disk[0][0], None), dirblock
2161
current_disk = disk_iterator.next()
2162
except StopIteration:
2163
disk_finished = True
2165
# inventory is before disk - missing.
2166
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2167
for relpath, basename, dkind, stat, fileid, kind in
2169
yield (current_inv[0][0], current_inv[0][1]), dirblock
2171
current_inv = inventory_iterator.next()
2172
except StopIteration:
2175
# versioned present directory
2176
# merge the inventory and disk data together
2178
for relpath, subiterator in itertools.groupby(sorted(
2179
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2180
path_elements = list(subiterator)
2181
if len(path_elements) == 2:
2182
inv_row, disk_row = path_elements
2183
# versioned, present file
2184
dirblock.append((inv_row[0],
2185
inv_row[1], disk_row[2],
2186
disk_row[3], inv_row[4],
2188
elif len(path_elements[0]) == 5:
2190
dirblock.append((path_elements[0][0],
2191
path_elements[0][1], path_elements[0][2],
2192
path_elements[0][3], None, None))
2193
elif len(path_elements[0]) == 6:
2194
# versioned, absent file.
2195
dirblock.append((path_elements[0][0],
2196
path_elements[0][1], 'unknown', None,
2197
path_elements[0][4], path_elements[0][5]))
2199
raise NotImplementedError('unreachable code')
2200
yield current_inv[0], dirblock
2202
current_inv = inventory_iterator.next()
2203
except StopIteration:
2206
current_disk = disk_iterator.next()
2207
except StopIteration:
2208
disk_finished = True
2210
def _walkdirs(self, prefix=""):
2211
_directory = 'directory'
2212
# get the root in the inventory
2213
inv = self.inventory
2214
top_id = inv.path2id(prefix)
2218
pending = [(prefix, '', _directory, None, top_id, None)]
2221
currentdir = pending.pop()
2222
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2223
top_id = currentdir[4]
2225
relroot = currentdir[0] + '/'
2228
# FIXME: stash the node in pending
2230
for name, child in entry.sorted_children():
2231
dirblock.append((relroot + name, name, child.kind, None,
2232
child.file_id, child.kind
2234
yield (currentdir[0], entry.file_id), dirblock
2235
# push the user specified dirs from dirblock
2236
for dir in reversed(dirblock):
2237
if dir[2] == _directory:
2240
@needs_tree_write_lock
2241
def auto_resolve(self):
2242
"""Automatically resolve text conflicts according to contents.
2244
Only text conflicts are auto_resolvable. Files with no conflict markers
2245
are considered 'resolved', because bzr always puts conflict markers
2246
into files that have text conflicts. The corresponding .THIS .BASE and
2247
.OTHER files are deleted, as per 'resolve'.
2248
:return: a tuple of ConflictLists: (un_resolved, resolved).
2250
un_resolved = _mod_conflicts.ConflictList()
2251
resolved = _mod_conflicts.ConflictList()
2252
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2253
for conflict in self.conflicts():
2254
if (conflict.typestring != 'text conflict' or
2255
self.kind(conflict.file_id) != 'file'):
2256
un_resolved.append(conflict)
2258
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2260
for line in my_file:
2261
if conflict_re.search(line):
2262
un_resolved.append(conflict)
2265
resolved.append(conflict)
2268
resolved.remove_files(self)
2269
self.set_conflicts(un_resolved)
2270
return un_resolved, resolved
2272
def _validate(self):
2273
"""Validate internal structures.
2275
This is meant mostly for the test suite. To give it a chance to detect
2276
corruption after actions have occurred. The default implementation is a
2279
:return: None. An exception should be raised if there is an error.
2284
class WorkingTree2(WorkingTree):
2285
"""This is the Format 2 working tree.
2287
This was the first weave based working tree.
2288
- uses os locks for locking.
2289
- uses the branch last-revision.
2292
def __init__(self, *args, **kwargs):
2293
super(WorkingTree2, self).__init__(*args, **kwargs)
2294
# WorkingTree2 has more of a constraint that self._inventory must
2295
# exist. Because this is an older format, we don't mind the overhead
2296
# caused by the extra computation here.
2298
# Newer WorkingTree's should only have self._inventory set when they
2300
if self._inventory is None:
2301
self.read_working_inventory()
2303
def lock_tree_write(self):
2304
"""See WorkingTree.lock_tree_write().
2306
In Format2 WorkingTrees we have a single lock for the branch and tree
2307
so lock_tree_write() degrades to lock_write().
2309
self.branch.lock_write()
2311
return self._control_files.lock_write()
2313
self.branch.unlock()
2317
# we share control files:
2318
if self._control_files._lock_count == 3:
2319
# _inventory_is_modified is always False during a read lock.
2320
if self._inventory_is_modified:
2322
self._write_hashcache_if_dirty()
2324
# reverse order of locking.
2326
return self._control_files.unlock()
2328
self.branch.unlock()
2331
1421
class WorkingTree3(WorkingTree):
2332
1422
"""This is the Format 3 working tree.