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
43
from bzrlib.lazy_import import lazy_import
44
lazy_import(globals(), """
45
from bisect import bisect_left
42
47
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
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
55
87
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
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
69
89
from bzrlib.lockable_files import LockableFiles, TransportLock
70
90
from bzrlib.lockdir import LockDir
71
from bzrlib.merge import merge_inner, transform_tree
91
import bzrlib.mutabletree
92
from bzrlib.mutabletree import needs_tree_write_lock
72
93
from bzrlib.osutils import (
105
from bzrlib.trace import mutter, note
106
from bzrlib.transport.local import LocalTransport
90
107
from bzrlib.progress import DummyProgress, ProgressPhase
91
from bzrlib.revision import NULL_REVISION
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
92
109
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
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)
104
127
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))
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)
133
136
def gen_root_id():
134
"""Return a new tree-root file id."""
135
return gen_file_id('TREE_ROOT')
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()
138
144
class TreeEntry(object):
139
"""An entry that implements the minium interface used by commands.
145
"""An entry that implements the minimum interface used by commands.
141
147
This needs further inspection, it may be better to have
142
148
InventoryEntries without ids - though that seems wrong. For now,
493
581
__contains__ = has_id
495
583
def get_file_size(self, file_id):
584
file_id = osutils.safe_file_id(file_id)
496
585
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():
588
def get_file_sha1(self, file_id, path=None, stat_value=None):
589
file_id = osutils.safe_file_id(file_id)
591
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)
505
603
return self._inventory[file_id].executable
507
path = self._inventory.id2path(file_id)
605
def is_executable(self, file_id, path=None):
607
file_id = osutils.safe_file_id(file_id)
608
path = self.id2path(file_id)
508
609
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.
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."""
534
615
# TODO: Re-adding a file that is removed in the working copy
535
616
# 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))
617
# the read and write working inventory should not occur in this
618
# function - they should be part of lock_write and unlock.
547
619
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))
620
for f, file_id, kind in zip(files, ids, kinds):
621
assert kind is not None
571
622
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))
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)
576
627
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)
578
641
@needs_write_lock
642
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
643
"""Add revision_id as a parent.
645
This is equivalent to retrieving the current list of parent ids
646
and setting the list to its value plus revision_id.
648
:param revision_id: The revision id to add to the parent list. It may
649
be a ghost revision as long as its not the first parent to be added,
650
or the allow_leftmost_as_ghost parameter is set True.
651
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
653
parents = self.get_parent_ids() + [revision_id]
654
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
655
or allow_leftmost_as_ghost)
657
@needs_tree_write_lock
658
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
659
"""Add revision_id, tree tuple as a parent.
661
This is equivalent to retrieving the current list of parent trees
662
and setting the list to its value plus parent_tuple. See also
663
add_parent_tree_id - if you only have a parent id available it will be
664
simpler to use that api. If you have the parent already available, using
665
this api is preferred.
667
:param parent_tuple: The (revision id, tree) to add to the parent list.
668
If the revision_id is a ghost, pass None for the tree.
669
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
671
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
672
if len(parent_ids) > 1:
673
# the leftmost may have already been a ghost, preserve that if it
675
allow_leftmost_as_ghost = True
676
self.set_parent_ids(parent_ids,
677
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
679
@needs_tree_write_lock
579
680
def add_pending_merge(self, *revision_ids):
580
681
# TODO: Perhaps should check at this point that the
581
682
# history of the revision is actually present?
582
p = self.pending_merges()
683
parents = self.get_parent_ids()
584
685
for rev_id in revision_ids:
686
if rev_id in parents:
688
parents.append(rev_id)
590
self.set_pending_merges(p)
691
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
693
@deprecated_method(zero_eleven)
593
695
def pending_merges(self):
594
696
"""Return a list of pending merges.
596
698
These are revisions that have been merged into the working
597
699
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'))
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
611
773
def set_pending_merges(self, rev_list):
612
self._control_files.put_utf8('pending-merges', '\n'.join(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)
779
@needs_tree_write_lock
615
780
def set_merge_modified(self, modified_hashes):
616
781
def iter_stanzas():
617
782
for file_id, hash in modified_hashes.iteritems():
618
yield Stanza(file_id=file_id, hash=hash)
783
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
619
784
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
622
786
def _put_rio(self, filename, stanzas, header):
787
self._must_be_locked()
623
788
my_file = rio_file(stanzas, header)
624
789
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()
627
838
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.
629
849
hashfile = self._control_files.get('merge-hashes')
850
except errors.NoSuchFile:
632
852
merge_hashes = {}
634
854
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
635
raise MergeModifiedFormatError()
855
raise errors.MergeModifiedFormatError()
636
856
except StopIteration:
637
raise MergeModifiedFormatError()
857
raise errors.MergeModifiedFormatError()
638
858
for s in RioReader(hashfile):
639
file_id = s.get("file_id")
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)
640
861
if file_id not in self.inventory:
643
if hash == self.get_file_sha1(file_id):
644
merge_hashes[file_id] = hash
863
text_hash = s.get("hash")
864
if text_hash == self.get_file_sha1(file_id):
865
merge_hashes[file_id] = text_hash
645
866
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')
647
877
def get_symlink_target(self, file_id):
878
file_id = osutils.safe_file_id(file_id)
648
879
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).
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).
661
1003
Lists, but does not descend into unversioned directories.
666
1008
Skips the control directory.
668
inv = self._inventory
670
def descend(from_dir_relpath, from_dir_id, dp):
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()
674
1041
## TODO: If we find a subdirectory with its own .bzr
675
1042
## directory, then that is a separate tree and we
676
1043
## should exclude it.
678
1045
# the bzrdir for this tree
679
if self.bzrdir.transport.base.endswith(f + '/'):
1046
if transport_base_dir == f:
683
fp = appendpath(from_dir_relpath, 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
686
fap = appendpath(dp, f)
1056
fap = from_dir_abspath + '/' + f
688
1058
f_ie = inv.get_child(from_dir_id, f)
691
elif self.is_ignored(fp):
1061
elif self.is_ignored(fp[1:]):
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:]):
696
1084
fk = file_kind(fap)
700
raise BzrCheckError("file %r entered as kind %r id %r, "
702
% (fap, f_ie.kind, f_ie.file_id, fk))
704
1086
# make a last minute entry
1088
yield fp[1:], c, fk, f_ie.file_id, f_ie
708
if fk == 'directory':
709
entry = TreeDirectory()
712
elif fk == 'symlink':
1091
yield fp[1:], c, fk, None, fk_entries[fk]()
1093
yield fp[1:], c, fk, None, TreeEntry()
717
yield fp, c, fk, (f_ie and f_ie.file_id), entry
719
1096
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):
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):
734
1113
"""Rename files.
736
to_name must exist in the inventory.
1115
to_dir must exist in the inventory.
738
If to_name exists and is a directory, the files are moved into
1117
If to_dir exists and is a directory, the files are moved into
739
1118
it, keeping their old names.
741
Note that to_name is only the last component of the new name;
1120
Note that to_dir is only the last component of the new name;
742
1121
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.
744
1144
This returns a list of (from_path, to_path) pairs for each
745
1145
entry that is moved.
748
## TODO: Option to move IDs only
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
749
1161
assert not isinstance(from_paths, basestring)
750
1162
inv = self.inventory
751
to_abs = self.abspath(to_name)
1163
to_abs = self.abspath(to_dir)
752
1164
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)
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)))
759
1175
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)
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
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"])
1206
self._inventory_is_modified = True
1207
self._move(rename_entries)
795
1209
# restore the inventory on error
796
self._set_inventory(orig_inv)
1210
self._inventory_is_modified = original_modified
798
1212
self._write_inventory(inv)
802
def rename_one(self, from_rel, to_rel):
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):
803
1314
"""Rename one file.
805
1316
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.
807
1336
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)
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
824
1347
to_dir, to_tail = os.path.split(to_rel)
825
1348
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"])
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)
847
1376
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
849
1390
@needs_read_lock
850
1391
def unknowns(self):
851
1392
"""Return all unknown files.
853
1394
These are files in the working directory that are not versioned or
854
1395
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):
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)
873
1429
@deprecated_method(zero_eight)
874
1430
def iter_conflicts(self):
875
1431
"""List all files in the tree that have text or content conflicts.
1059
1695
if new_revision is None:
1060
1696
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])
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])
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)
1071
1720
def _cache_basis_inventory(self, new_revision):
1072
1721
"""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
1074
1726
# this double handles the inventory - unpack and repack -
1075
1727
# but is easier to understand. We can/should put a conditional
1076
1728
# in here based on whether the inventory is in the latest format
1077
1729
# - 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:
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):
1088
1747
def read_basis_inventory(self):
1089
1748
"""Read the cached basis inventory."""
1090
1749
path = self._basis_inventory_name()
1091
return self._control_files.get_utf8(path).read()
1750
return self._control_files.get(path).read()
1093
1752
@needs_read_lock
1094
1753
def read_working_inventory(self):
1095
"""Read the working inventory."""
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.
1096
1761
# 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)
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)
1104
def remove(self, files, verbose=False):
1105
"""Remove nominated files from the working inventory..
1107
This does not remove their text. This does not run on XXX on what? RBC
1109
TODO: Refuse to remove modified files unless --force is given?
1111
TODO: Do something useful with directories.
1113
TODO: Should this remove the text or not? Tough call; not
1114
removing may be useful and the user can just use use rm, and
1115
is the opposite of add. Removing it is consistent with most
1116
other tools. Maybe an option.
1769
@needs_tree_write_lock
1770
def remove(self, files, verbose=False, to_file=None, keep_files=True,
1772
"""Remove nominated files from the working inventor.
1774
:files: File paths relative to the basedir.
1775
:keep_files: If true, the files will also be kept.
1776
:force: Delete files and directories, even if they are changed and
1777
even if the directories are not empty.
1118
1779
## TODO: Normalize names
1119
## TODO: Remove nested loops; better scalability
1120
1781
if isinstance(files, basestring):
1121
1782
files = [files]
1123
1784
inv = self.inventory
1787
unknown_files_in_directory=set()
1789
def recurse_directory_to_add_files(directory):
1790
# recurse directory and add all files
1791
# so we can check if they have changed.
1792
for contained_dir_info in self.walkdirs(directory):
1793
for file_info in contained_dir_info[1]:
1794
if file_info[2] == 'file':
1795
relpath = self.relpath(file_info[0])
1796
if file_info[4]: #is it versioned?
1797
new_files.add(relpath)
1799
unknown_files_in_directory.add(
1800
(relpath, None, file_info[2]))
1802
for filename in files:
1803
# Get file name into canonical form.
1804
filename = self.relpath(self.abspath(filename))
1805
if len(filename) > 0:
1806
new_files.add(filename)
1807
if osutils.isdir(filename) and len(os.listdir(filename)) > 0:
1808
recurse_directory_to_add_files(filename)
1809
files = [f for f in new_files]
1811
# Sort needed to first handle directory content before the directory
1812
files.sort(reverse=True)
1813
if not keep_files and not force:
1814
tree_delta = self.changes_from(self.basis_tree(),
1815
specific_files=files)
1816
for unknown_file in unknown_files_in_directory:
1817
tree_delta.unversioned.extend((unknown_file,))
1818
if bool(tree_delta.modified
1820
or tree_delta.renamed
1821
or tree_delta.kind_changed
1822
or tree_delta.unversioned):
1823
raise errors.BzrRemoveChangedFilesError(tree_delta)
1125
1825
# do this before any modifications
1126
1826
for f in files:
1127
1827
fid = inv.path2id(f)
1129
# TODO: Perhaps make this just a warning, and continue?
1130
# This tends to happen when
1131
raise NotVersionedError(path=f)
1132
mutter("remove inventory entry %s {%s}", quotefn(f), fid)
1134
# having remove it, it must be either ignored or unknown
1135
if self.is_ignored(f):
1139
show_status(new_status, inv[fid].kind, quotefn(f))
1830
message="%s is not versioned." % (f,)
1833
# having removed it, it must be either ignored or unknown
1834
if self.is_ignored(f):
1838
textui.show_status(new_status, inv[fid].kind, f,
1842
message="removed %s" % (f,)
1845
abs_path = self.abspath(f)
1846
if osutils.lexists(abs_path):
1847
if (osutils.isdir(abs_path) and
1848
len(os.listdir(abs_path)) > 0):
1849
message="%s is not empty directory "\
1850
"and won't be deleted." % (f,)
1852
osutils.delete_any(abs_path)
1853
message="deleted %s" % (f,)
1854
elif message is not None:
1855
# only care if we haven't done anything yet.
1856
message="%s does not exist." % (f,)
1858
# print only one message (if any) per file.
1859
if message is not None:
1142
1861
self._write_inventory(inv)
1863
@needs_tree_write_lock
1145
1864
def revert(self, filenames, old_tree=None, backups=True,
1146
pb=DummyProgress()):
1147
from transform import revert
1148
from conflicts import resolve
1865
pb=DummyProgress(), report_changes=False):
1866
from bzrlib.conflicts import resolve
1149
1867
if old_tree is None:
1150
1868
old_tree = self.basis_tree()
1151
conflicts = revert(self, old_tree, filenames, backups, pb)
1869
conflicts = transform.revert(self, old_tree, filenames, backups, pb,
1152
1871
if not len(filenames):
1153
self.set_pending_merges([])
1872
self.set_parent_ids(self.get_parent_ids()[:1])
1156
1875
resolve(self, filenames, ignore_misses=True)
1157
1876
return conflicts
1878
def revision_tree(self, revision_id):
1879
"""See Tree.revision_tree.
1881
WorkingTree can supply revision_trees for the basis revision only
1882
because there is only one cached inventory in the bzr directory.
1884
if revision_id == self.last_revision():
1886
xml = self.read_basis_inventory()
1887
except errors.NoSuchFile:
1891
inv = xml7.serializer_v7.read_inventory_from_string(xml)
1892
# dont use the repository revision_tree api because we want
1893
# to supply the inventory.
1894
if inv.revision_id == revision_id:
1895
return revisiontree.RevisionTree(self.branch.repository,
1897
except errors.BadInventoryFormat:
1899
# raise if there was no inventory, or if we read the wrong inventory.
1900
raise errors.NoSuchRevisionInTree(self, revision_id)
1159
1902
# XXX: This method should be deprecated in favour of taking in a proper
1160
1903
# new Inventory object.
1904
@needs_tree_write_lock
1162
1905
def set_inventory(self, new_inventory_list):
1163
1906
from bzrlib.inventory import (Inventory,
1164
1907
InventoryDirectory,
1204
1973
between multiple working trees, i.e. via shared storage, then we
1205
1974
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()
1976
raise NotImplementedError(self.unlock)
1231
1978
def update(self):
1232
1979
"""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.
1981
This will update the branch if its bound too, which means we have
1982
multiple trees involved:
1984
- The new basis tree of the master.
1985
- The old basis tree of the branch.
1986
- The old basis tree of the working tree.
1987
- The current working tree state.
1989
Pathologically, all three may be different, and non-ancestors of each
1990
other. Conceptually we want to:
1992
- Preserve the wt.basis->wt.state changes
1993
- Transform the wt.basis to the new master basis.
1994
- Apply a merge of the old branch basis to get any 'local' changes from
1996
- Restore the wt.basis->wt.state changes.
1246
1998
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()
1999
- Merge current state -> basis tree of the master w.r.t. the old tree
2001
- Do a 'normal' merge of the old branch basis if it is relevant.
2003
if self.branch.get_master_branch() is not None:
2005
update_branch = True
2007
self.lock_tree_write()
2008
update_branch = False
2011
old_tip = self.branch.update()
2014
return self._update_tree(old_tip)
2018
@needs_tree_write_lock
2019
def _update_tree(self, old_tip=None):
2020
"""Update a tree to the master branch.
2022
:param old_tip: if supplied, the previous tip revision the branch,
2023
before it was changed to the master branch's tip.
2025
# here if old_tip is not None, it is the old tip of the branch before
2026
# it was updated from the master branch. This should become a pending
2027
# merge in the working tree to preserve the user existing work. we
2028
# cant set that until we update the working trees last revision to be
2029
# one from the new branch, because it will just get absorbed by the
2030
# parent de-duplication logic.
2032
# We MUST save it even if an error occurs, because otherwise the users
2033
# local work is unreferenced and will appear to have been lost.
2037
last_rev = self.get_parent_ids()[0]
2040
if last_rev != self.branch.last_revision():
2041
# merge tree state up to new branch tip.
2042
basis = self.basis_tree()
1259
2045
to_tree = self.branch.basis_tree()
1260
result += merge_inner(self.branch,
2046
if basis.inventory.root is None:
2047
self.set_root_id(to_tree.inventory.root.file_id)
2049
result += merge.merge_inner(
1263
2053
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()
2056
# TODO - dedup parents list with things merged by pull ?
2057
# reuse the tree we've updated to to set the basis:
2058
parent_trees = [(self.branch.last_revision(), to_tree)]
2059
merges = self.get_parent_ids()[1:]
2060
# Ideally we ask the tree for the trees here, that way the working
2061
# tree can decide whether to give us teh entire tree or give us a
2062
# lazy initialised tree. dirstate for instance will have the trees
2063
# in ram already, whereas a last-revision + basis-inventory tree
2064
# will not, but also does not need them when setting parents.
2065
for parent in merges:
2066
parent_trees.append(
2067
(parent, self.branch.repository.revision_tree(parent)))
2068
if old_tip is not None:
2069
parent_trees.append(
2070
(old_tip, self.branch.repository.revision_tree(old_tip)))
2071
self.set_parent_trees(parent_trees)
2072
last_rev = parent_trees[0][0]
2074
# the working tree had the same last-revision as the master
2075
# branch did. We may still have pivot local work from the local
2076
# branch into old_tip:
2077
if old_tip is not None:
2078
self.add_parent_tree_id(old_tip)
2079
if old_tip and old_tip != last_rev:
2080
# our last revision was not the prior branch last revision
2081
# and we have converted that last revision to a pending merge.
2082
# base is somewhere between the branch tip now
2083
# and the now pending merge
2085
# Since we just modified the working tree and inventory, flush out
2086
# the current state, before we modify it again.
2087
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2088
# requires it only because TreeTransform directly munges the
2089
# inventory and calls tree._write_inventory(). Ultimately we
2090
# should be able to remove this extra flush.
2092
from bzrlib.revision import common_ancestor
2094
base_rev_id = common_ancestor(self.branch.last_revision(),
2096
self.branch.repository)
2097
except errors.NoCommonAncestor:
2099
base_tree = self.branch.repository.revision_tree(base_rev_id)
2100
other_tree = self.branch.repository.revision_tree(old_tip)
2101
result += merge.merge_inner(
2108
def _write_hashcache_if_dirty(self):
2109
"""Write out the hashcache if it is dirty."""
2110
if self._hashcache.needs_write:
2112
self._hashcache.write()
2114
if e.errno not in (errno.EPERM, errno.EACCES):
2116
# TODO: jam 20061219 Should this be a warning? A single line
2117
# warning might be sufficient to let the user know what
2119
mutter('Could not write hashcache for %s\nError: %s',
2120
self._hashcache.cache_file_name(), e)
2122
@needs_tree_write_lock
1288
2123
def _write_inventory(self, inv):
1289
2124
"""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')
2125
self._set_inventory(inv, dirty=True)
1297
2128
def set_conflicts(self, arg):
1298
raise UnsupportedOperation(self.set_conflicts, self)
2129
raise errors.UnsupportedOperation(self.set_conflicts, self)
2131
def add_conflicts(self, arg):
2132
raise errors.UnsupportedOperation(self.add_conflicts, self)
1300
2134
@needs_read_lock
1301
2135
def conflicts(self):
1302
conflicts = ConflictList()
2136
conflicts = _mod_conflicts.ConflictList()
1303
2137
for conflicted in self._iter_conflicts():
1306
2140
if file_kind(self.abspath(conflicted)) != "file":
1309
if e.errno == errno.ENOENT:
2142
except errors.NoSuchFile:
1313
2144
if text is True:
1314
2145
for suffix in ('.THIS', '.OTHER'):
1316
2147
kind = file_kind(self.abspath(conflicted+suffix))
1318
if e.errno == errno.ENOENT:
2150
except errors.NoSuchFile:
1326
2154
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1327
conflicts.append(Conflict.factory(ctype, path=conflicted,
2155
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1328
2157
file_id=self.path2id(conflicted)))
1329
2158
return conflicts
2160
def walkdirs(self, prefix=""):
2161
"""Walk the directories of this tree.
2163
returns a generator which yields items in the form:
2164
((curren_directory_path, fileid),
2165
[(file1_path, file1_name, file1_kind, (lstat), file1_id,
2168
This API returns a generator, which is only valid during the current
2169
tree transaction - within a single lock_read or lock_write duration.
2171
If the tree is not locked, it may cause an error to be raised,
2172
depending on the tree implementation.
2174
disk_top = self.abspath(prefix)
2175
if disk_top.endswith('/'):
2176
disk_top = disk_top[:-1]
2177
top_strip_len = len(disk_top) + 1
2178
inventory_iterator = self._walkdirs(prefix)
2179
disk_iterator = osutils.walkdirs(disk_top, prefix)
2181
current_disk = disk_iterator.next()
2182
disk_finished = False
2184
if not (e.errno == errno.ENOENT or
2185
(sys.platform == 'win32' and e.errno == ERROR_PATH_NOT_FOUND)):
2188
disk_finished = True
2190
current_inv = inventory_iterator.next()
2191
inv_finished = False
2192
except StopIteration:
2195
while not inv_finished or not disk_finished:
2196
if not disk_finished:
2197
# strip out .bzr dirs
2198
if current_disk[0][1][top_strip_len:] == '':
2199
# osutils.walkdirs can be made nicer -
2200
# yield the path-from-prefix rather than the pathjoined
2202
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2203
if current_disk[1][bzrdir_loc][0] == '.bzr':
2204
# we dont yield the contents of, or, .bzr itself.
2205
del current_disk[1][bzrdir_loc]
2207
# everything is unknown
2210
# everything is missing
2213
direction = cmp(current_inv[0][0], current_disk[0][0])
2215
# disk is before inventory - unknown
2216
dirblock = [(relpath, basename, kind, stat, None, None) for
2217
relpath, basename, kind, stat, top_path in current_disk[1]]
2218
yield (current_disk[0][0], None), dirblock
2220
current_disk = disk_iterator.next()
2221
except StopIteration:
2222
disk_finished = True
2224
# inventory is before disk - missing.
2225
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2226
for relpath, basename, dkind, stat, fileid, kind in
2228
yield (current_inv[0][0], current_inv[0][1]), dirblock
2230
current_inv = inventory_iterator.next()
2231
except StopIteration:
2234
# versioned present directory
2235
# merge the inventory and disk data together
2237
for relpath, subiterator in itertools.groupby(sorted(
2238
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2239
path_elements = list(subiterator)
2240
if len(path_elements) == 2:
2241
inv_row, disk_row = path_elements
2242
# versioned, present file
2243
dirblock.append((inv_row[0],
2244
inv_row[1], disk_row[2],
2245
disk_row[3], inv_row[4],
2247
elif len(path_elements[0]) == 5:
2249
dirblock.append((path_elements[0][0],
2250
path_elements[0][1], path_elements[0][2],
2251
path_elements[0][3], None, None))
2252
elif len(path_elements[0]) == 6:
2253
# versioned, absent file.
2254
dirblock.append((path_elements[0][0],
2255
path_elements[0][1], 'unknown', None,
2256
path_elements[0][4], path_elements[0][5]))
2258
raise NotImplementedError('unreachable code')
2259
yield current_inv[0], dirblock
2261
current_inv = inventory_iterator.next()
2262
except StopIteration:
2265
current_disk = disk_iterator.next()
2266
except StopIteration:
2267
disk_finished = True
2269
def _walkdirs(self, prefix=""):
2270
"""Walk the directories of this tree.
2272
:prefix: is used as the directrory to start with.
2273
returns a generator which yields items in the form:
2274
((curren_directory_path, fileid),
2275
[(file1_path, file1_name, file1_kind, None, file1_id,
2278
_directory = 'directory'
2279
# get the root in the inventory
2280
inv = self.inventory
2281
top_id = inv.path2id(prefix)
2285
pending = [(prefix, '', _directory, None, top_id, None)]
2288
currentdir = pending.pop()
2289
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2290
top_id = currentdir[4]
2292
relroot = currentdir[0] + '/'
2295
# FIXME: stash the node in pending
2297
for name, child in entry.sorted_children():
2298
dirblock.append((relroot + name, name, child.kind, None,
2299
child.file_id, child.kind
2301
yield (currentdir[0], entry.file_id), dirblock
2302
# push the user specified dirs from dirblock
2303
for dir in reversed(dirblock):
2304
if dir[2] == _directory:
2307
@needs_tree_write_lock
2308
def auto_resolve(self):
2309
"""Automatically resolve text conflicts according to contents.
2311
Only text conflicts are auto_resolvable. Files with no conflict markers
2312
are considered 'resolved', because bzr always puts conflict markers
2313
into files that have text conflicts. The corresponding .THIS .BASE and
2314
.OTHER files are deleted, as per 'resolve'.
2315
:return: a tuple of ConflictLists: (un_resolved, resolved).
2317
un_resolved = _mod_conflicts.ConflictList()
2318
resolved = _mod_conflicts.ConflictList()
2319
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2320
for conflict in self.conflicts():
2321
if (conflict.typestring != 'text conflict' or
2322
self.kind(conflict.file_id) != 'file'):
2323
un_resolved.append(conflict)
2325
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2327
for line in my_file:
2328
if conflict_re.search(line):
2329
un_resolved.append(conflict)
2332
resolved.append(conflict)
2335
resolved.remove_files(self)
2336
self.set_conflicts(un_resolved)
2337
return un_resolved, resolved
2339
def _validate(self):
2340
"""Validate internal structures.
2342
This is meant mostly for the test suite. To give it a chance to detect
2343
corruption after actions have occurred. The default implementation is a
2346
:return: None. An exception should be raised if there is an error.
2351
class WorkingTree2(WorkingTree):
2352
"""This is the Format 2 working tree.
2354
This was the first weave based working tree.
2355
- uses os locks for locking.
2356
- uses the branch last-revision.
2359
def __init__(self, *args, **kwargs):
2360
super(WorkingTree2, self).__init__(*args, **kwargs)
2361
# WorkingTree2 has more of a constraint that self._inventory must
2362
# exist. Because this is an older format, we don't mind the overhead
2363
# caused by the extra computation here.
2365
# Newer WorkingTree's should only have self._inventory set when they
2367
if self._inventory is None:
2368
self.read_working_inventory()
2370
def lock_tree_write(self):
2371
"""See WorkingTree.lock_tree_write().
2373
In Format2 WorkingTrees we have a single lock for the branch and tree
2374
so lock_tree_write() degrades to lock_write().
2376
self.branch.lock_write()
2378
return self._control_files.lock_write()
2380
self.branch.unlock()
2384
# we share control files:
2385
if self._control_files._lock_count == 3:
2386
# _inventory_is_modified is always False during a read lock.
2387
if self._inventory_is_modified:
2389
self._write_hashcache_if_dirty()
2391
# reverse order of locking.
2393
return self._control_files.unlock()
2395
self.branch.unlock()
1332
2398
class WorkingTree3(WorkingTree):
1333
2399
"""This is the Format 3 working tree.