39
36
# At the moment they may alias the inventory and have old copies of it in
40
37
# memory. (Now done? -- mbp 20060309)
39
from cStringIO import StringIO
42
from bzrlib.lazy_import import lazy_import
43
lazy_import(globals(), """
42
45
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
54
conflicts as _mod_conflicts,
70
from bzrlib.transport import get_transport
74
from bzrlib import symbol_versioning
55
75
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
76
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID
69
77
from bzrlib.lockable_files import LockableFiles, TransportLock
70
78
from bzrlib.lockdir import LockDir
71
from bzrlib.merge import merge_inner, transform_tree
79
import bzrlib.mutabletree
80
from bzrlib.mutabletree import needs_tree_write_lock
72
81
from bzrlib.osutils import (
93
from bzrlib.trace import mutter, note
94
from bzrlib.transport.local import LocalTransport
90
95
from bzrlib.progress import DummyProgress, ProgressPhase
91
from bzrlib.revision import NULL_REVISION
96
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
92
97
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
98
from bzrlib.symbol_versioning import (deprecated_passed,
101
DEPRECATED_PARAMETER,
108
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
109
CONFLICT_HEADER_1 = "BZR conflict list format 1"
112
@deprecated_function(zero_thirteen)
104
113
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))
114
"""Return new file id for the basename 'name'.
116
Use bzrlib.generate_ids.gen_file_id() instead
118
return generate_ids.gen_file_id(name)
121
@deprecated_function(zero_thirteen)
133
122
def gen_root_id():
134
"""Return a new tree-root file id."""
135
return gen_file_id('TREE_ROOT')
123
"""Return a new tree-root file id.
125
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
127
return generate_ids.gen_root_id()
138
130
class TreeEntry(object):
139
"""An entry that implements the minium interface used by commands.
131
"""An entry that implements the minimum interface used by commands.
141
133
This needs further inspection, it may be better to have
142
134
InventoryEntries without ids - though that seems wrong. For now,
496
571
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():
574
def get_file_sha1(self, file_id, path=None, stat_value=None):
576
path = self._inventory.id2path(file_id)
577
return self._hashcache.get_sha1(path, stat_value)
579
def get_file_mtime(self, file_id, path=None):
581
path = self._inventory.id2path(file_id)
582
return os.lstat(self.abspath(path)).st_mtime
584
if not supports_executable():
585
def is_executable(self, file_id, path=None):
505
586
return self._inventory[file_id].executable
507
path = self._inventory.id2path(file_id)
588
def is_executable(self, file_id, path=None):
590
path = self._inventory.id2path(file_id)
508
591
mode = os.lstat(self.abspath(path)).st_mode
509
return bool(stat.S_ISREG(mode) and stat.S_IEXEC&mode)
592
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
511
594
@needs_write_lock
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.
595
def _add(self, files, ids, kinds):
596
"""See MutableTree._add."""
534
597
# TODO: Re-adding a file that is removed in the working copy
535
598
# 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))
599
# the read and write working inventory should not occur in this
600
# function - they should be part of lock_write and unlock.
547
601
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))
602
for f, file_id, kind in zip(files, ids, kinds):
603
assert kind is not None
571
604
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))
605
inv.add_path(f, kind=kind)
607
inv.add_path(f, kind=kind, file_id=file_id)
576
608
self._write_inventory(inv)
610
@needs_tree_write_lock
611
def _gather_kinds(self, files, kinds):
612
"""See MutableTree._gather_kinds."""
613
for pos, f in enumerate(files):
614
if kinds[pos] is None:
615
fullpath = normpath(self.abspath(f))
617
kinds[pos] = file_kind(fullpath)
619
if e.errno == errno.ENOENT:
620
raise errors.NoSuchFile(fullpath)
578
622
@needs_write_lock
623
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
624
"""Add revision_id as a parent.
626
This is equivalent to retrieving the current list of parent ids
627
and setting the list to its value plus revision_id.
629
:param revision_id: The revision id to add to the parent list. It may
630
be a ghost revision as long as its not the first parent to be added,
631
or the allow_leftmost_as_ghost parameter is set True.
632
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
634
parents = self.get_parent_ids() + [revision_id]
635
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
636
or allow_leftmost_as_ghost)
638
@needs_tree_write_lock
639
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
640
"""Add revision_id, tree tuple as a parent.
642
This is equivalent to retrieving the current list of parent trees
643
and setting the list to its value plus parent_tuple. See also
644
add_parent_tree_id - if you only have a parent id available it will be
645
simpler to use that api. If you have the parent already available, using
646
this api is preferred.
648
:param parent_tuple: The (revision id, tree) to add to the parent list.
649
If the revision_id is a ghost, pass None for the tree.
650
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
652
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
653
if len(parent_ids) > 1:
654
# the leftmost may have already been a ghost, preserve that if it
656
allow_leftmost_as_ghost = True
657
self.set_parent_ids(parent_ids,
658
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
660
@needs_tree_write_lock
579
661
def add_pending_merge(self, *revision_ids):
580
662
# TODO: Perhaps should check at this point that the
581
663
# history of the revision is actually present?
582
p = self.pending_merges()
664
parents = self.get_parent_ids()
584
666
for rev_id in revision_ids:
667
if rev_id in parents:
669
parents.append(rev_id)
590
self.set_pending_merges(p)
672
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
674
@deprecated_method(zero_eleven)
593
676
def pending_merges(self):
594
677
"""Return a list of pending merges.
596
679
These are revisions that have been merged into the working
597
680
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'))
682
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
683
instead - which is available on all tree objects.
685
return self.get_parent_ids()[1:]
687
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
688
"""Common ghost checking functionality from set_parent_*.
690
This checks that the left hand-parent exists if there are any
693
if len(revision_ids) > 0:
694
leftmost_id = revision_ids[0]
695
if (not allow_leftmost_as_ghost and not
696
self.branch.repository.has_revision(leftmost_id)):
697
raise errors.GhostRevisionUnusableHere(leftmost_id)
699
def _set_merges_from_parent_ids(self, parent_ids):
700
merges = parent_ids[1:]
701
self._control_files.put_utf8('pending-merges', '\n'.join(merges))
703
@needs_tree_write_lock
704
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
705
"""Set the parent ids to revision_ids.
707
See also set_parent_trees. This api will try to retrieve the tree data
708
for each element of revision_ids from the trees repository. If you have
709
tree data already available, it is more efficient to use
710
set_parent_trees rather than set_parent_ids. set_parent_ids is however
711
an easier API to use.
713
:param revision_ids: The revision_ids to set as the parent ids of this
714
working tree. Any of these may be ghosts.
716
self._check_parents_for_ghosts(revision_ids,
717
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
719
if len(revision_ids) > 0:
720
self.set_last_revision(revision_ids[0])
722
self.set_last_revision(None)
724
self._set_merges_from_parent_ids(revision_ids)
726
@needs_tree_write_lock
727
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
728
"""See MutableTree.set_parent_trees."""
729
parent_ids = [rev for (rev, tree) in parents_list]
731
self._check_parents_for_ghosts(parent_ids,
732
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
734
if len(parent_ids) == 0:
735
leftmost_parent_id = None
736
leftmost_parent_tree = None
738
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
740
if self._change_last_revision(leftmost_parent_id):
741
if leftmost_parent_tree is None:
742
# If we don't have a tree, fall back to reading the
743
# parent tree from the repository.
744
self._cache_basis_inventory(leftmost_parent_id)
746
inv = leftmost_parent_tree.inventory
747
xml = self._create_basis_xml_from_inventory(
748
leftmost_parent_id, inv)
749
self._write_basis_inventory(xml)
750
self._set_merges_from_parent_ids(parent_ids)
752
@needs_tree_write_lock
611
753
def set_pending_merges(self, rev_list):
612
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
754
parents = self.get_parent_ids()
755
leftmost = parents[:1]
756
new_parents = leftmost + rev_list
757
self.set_parent_ids(new_parents)
759
@needs_tree_write_lock
615
760
def set_merge_modified(self, modified_hashes):
616
761
def iter_stanzas():
617
762
for file_id, hash in modified_hashes.iteritems():
618
763
yield Stanza(file_id=file_id, hash=hash)
619
764
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
766
@needs_tree_write_lock
622
767
def _put_rio(self, filename, stanzas, header):
623
768
my_file = rio_file(stanzas, header)
624
769
self._control_files.put(filename, my_file)
771
@needs_write_lock # because merge pulls data into the branch.
772
def merge_from_branch(self, branch, to_revision=None):
773
"""Merge from a branch into this working tree.
775
:param branch: The branch to merge from.
776
:param to_revision: If non-None, the merge will merge to to_revision,
777
but not beyond it. to_revision does not need to be in the history
778
of the branch when it is supplied. If None, to_revision defaults to
779
branch.last_revision().
781
from bzrlib.merge import Merger, Merge3Merger
782
pb = bzrlib.ui.ui_factory.nested_progress_bar()
784
merger = Merger(self.branch, this_tree=self, pb=pb)
785
merger.pp = ProgressPhase("Merge phase", 5, pb)
786
merger.pp.next_phase()
787
# check that there are no
789
merger.check_basis(check_clean=True, require_commits=False)
790
if to_revision is None:
791
to_revision = branch.last_revision()
792
merger.other_rev_id = to_revision
793
if merger.other_rev_id is None:
794
raise error.NoCommits(branch)
795
self.branch.fetch(branch, last_revision=merger.other_rev_id)
796
merger.other_basis = merger.other_rev_id
797
merger.other_tree = self.branch.repository.revision_tree(
799
merger.pp.next_phase()
801
if merger.base_rev_id == merger.other_rev_id:
802
raise errors.PointlessMerge
803
merger.backup_files = False
804
merger.merge_type = Merge3Merger
805
merger.set_interesting_files(None)
806
merger.show_base = False
807
merger.reprocess = False
808
conflicts = merger.do_merge()
627
815
def merge_modified(self):
629
817
hashfile = self._control_files.get('merge-hashes')
818
except errors.NoSuchFile:
632
820
merge_hashes = {}
634
822
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
635
raise MergeModifiedFormatError()
823
raise errors.MergeModifiedFormatError()
636
824
except StopIteration:
637
raise MergeModifiedFormatError()
825
raise errors.MergeModifiedFormatError()
638
826
for s in RioReader(hashfile):
639
827
file_id = s.get("file_id")
640
828
if file_id not in self.inventory:
666
874
Skips the control directory.
668
876
inv = self._inventory
670
def descend(from_dir_relpath, from_dir_id, dp):
877
if include_root is True:
878
yield ('', 'V', 'directory', inv.root.file_id, inv.root)
879
# Convert these into local objects to save lookup times
880
pathjoin = osutils.pathjoin
881
file_kind = osutils.file_kind
883
# transport.base ends in a slash, we want the piece
884
# between the last two slashes
885
transport_base_dir = self.bzrdir.transport.base.rsplit('/', 2)[1]
887
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
889
# directory file_id, relative path, absolute path, reverse sorted children
890
children = os.listdir(self.basedir)
892
# jam 20060527 The kernel sized tree seems equivalent whether we
893
# use a deque and popleft to keep them sorted, or if we use a plain
894
# list and just reverse() them.
895
children = collections.deque(children)
896
stack = [(inv.root.file_id, u'', self.basedir, children)]
898
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
901
f = children.popleft()
674
902
## TODO: If we find a subdirectory with its own .bzr
675
903
## directory, then that is a separate tree and we
676
904
## should exclude it.
678
906
# the bzrdir for this tree
679
if self.bzrdir.transport.base.endswith(f + '/'):
907
if transport_base_dir == f:
683
fp = appendpath(from_dir_relpath, f)
910
# we know that from_dir_relpath and from_dir_abspath never end in a slash
911
# and 'f' doesn't begin with one, we can do a string op, rather
912
# than the checks of pathjoin(), all relative paths will have an extra slash
914
fp = from_dir_relpath + '/' + f
686
fap = appendpath(dp, f)
917
fap = from_dir_abspath + '/' + f
688
919
f_ie = inv.get_child(from_dir_id, f)
691
elif self.is_ignored(fp):
922
elif self.is_ignored(fp[1:]):
925
# we may not have found this file, because of a unicode issue
926
f_norm, can_access = osutils.normalized_filename(f)
927
if f == f_norm or not can_access:
928
# No change, so treat this file normally
931
# this file can be accessed by a normalized path
932
# check again if it is versioned
933
# these lines are repeated here for performance
935
fp = from_dir_relpath + '/' + f
936
fap = from_dir_abspath + '/' + f
937
f_ie = inv.get_child(from_dir_id, f)
940
elif self.is_ignored(fp[1:]):
696
945
fk = file_kind(fap)
699
948
if f_ie.kind != fk:
700
raise BzrCheckError("file %r entered as kind %r id %r, "
702
% (fap, f_ie.kind, f_ie.file_id, fk))
949
raise errors.BzrCheckError(
950
"file %r entered as kind %r id %r, now of kind %r"
951
% (fap, f_ie.kind, f_ie.file_id, fk))
704
953
# make a last minute entry
955
yield fp[1:], c, fk, f_ie.file_id, f_ie
708
if fk == 'directory':
709
entry = TreeDirectory()
712
elif fk == 'symlink':
958
yield fp[1:], c, fk, None, fk_entries[fk]()
960
yield fp[1:], c, fk, None, TreeEntry()
717
yield fp, c, fk, (f_ie and f_ie.file_id), entry
719
963
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):
966
# But do this child first
967
new_children = os.listdir(fap)
969
new_children = collections.deque(new_children)
970
stack.append((f_ie.file_id, fp, fap, new_children))
971
# Break out of inner loop,
972
# so that we start outer loop with child
975
# if we finished all children, pop it off the stack
978
@needs_tree_write_lock
979
def move(self, from_paths, to_dir=None, after=False, **kwargs):
736
to_name must exist in the inventory.
982
to_dir must exist in the inventory.
738
If to_name exists and is a directory, the files are moved into
984
If to_dir exists and is a directory, the files are moved into
739
985
it, keeping their old names.
741
Note that to_name is only the last component of the new name;
987
Note that to_dir is only the last component of the new name;
742
988
this doesn't change the directory.
990
For each entry in from_paths the move mode will be determined
993
The first mode moves the file in the filesystem and updates the
994
inventory. The second mode only updates the inventory without
995
touching the file on the filesystem. This is the new mode introduced
998
move uses the second mode if 'after == True' and the target is not
999
versioned but present in the working tree.
1001
move uses the second mode if 'after == False' and the source is
1002
versioned but no longer in the working tree, and the target is not
1003
versioned but present in the working tree.
1005
move uses the first mode if 'after == False' and the source is
1006
versioned and present in the working tree, and the target is not
1007
versioned and not present in the working tree.
1009
Everything else results in an error.
744
1011
This returns a list of (from_path, to_path) pairs for each
745
1012
entry that is moved.
748
## TODO: Option to move IDs only
1017
# check for deprecated use of signature
1019
to_dir = kwargs.get('to_name', None)
1021
raise TypeError('You must supply a target directory')
1023
symbol_versioning.warn('The parameter to_name was deprecated'
1024
' in version 0.13. Use to_dir instead',
1027
# check destination directory
749
1028
assert not isinstance(from_paths, basestring)
750
1029
inv = self.inventory
751
to_abs = self.abspath(to_name)
1030
to_abs = self.abspath(to_dir)
752
1031
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)
1032
raise errors.BzrMoveFailedError('',to_dir,
1033
errors.NotADirectory(to_abs))
1034
if not self.has_filename(to_dir):
1035
raise errors.BzrMoveFailedError('',to_dir,
1036
errors.NotInWorkingDirectory(to_dir))
1037
to_dir_id = inv.path2id(to_dir)
1038
if to_dir_id is None:
1039
raise errors.BzrMoveFailedError('',to_dir,
1040
errors.NotVersionedError(path=str(to_dir)))
759
1042
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)
1043
if to_dir_ie.kind != 'directory':
1044
raise errors.BzrMoveFailedError('',to_dir,
1045
errors.NotADirectory(to_abs))
1047
# create rename entries and tuples
1048
for from_rel in from_paths:
1049
from_tail = splitpath(from_rel)[-1]
1050
from_id = inv.path2id(from_rel)
1052
raise errors.BzrMoveFailedError(from_rel,to_dir,
1053
errors.NotVersionedError(path=str(from_rel)))
1055
from_entry = inv[from_id]
1056
from_parent_id = from_entry.parent_id
1057
to_rel = pathjoin(to_dir, from_tail)
1058
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1060
from_tail=from_tail,
1061
from_parent_id=from_parent_id,
1062
to_rel=to_rel, to_tail=from_tail,
1063
to_parent_id=to_dir_id)
1064
rename_entries.append(rename_entry)
1065
rename_tuples.append((from_rel, to_rel))
1067
# determine which move mode to use. checks also for movability
1068
rename_entries = self._determine_mv_mode(rename_entries, after)
1070
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"])
1073
self._inventory_is_modified = True
1074
self._move(rename_entries)
795
1076
# restore the inventory on error
796
self._set_inventory(orig_inv)
1077
self._inventory_is_modified = original_modified
798
1079
self._write_inventory(inv)
802
def rename_one(self, from_rel, to_rel):
1080
return rename_tuples
1082
def _determine_mv_mode(self, rename_entries, after=False):
1083
"""Determines for each from-to pair if both inventory and working tree
1084
or only the inventory has to be changed.
1086
Also does basic plausability tests.
1088
inv = self.inventory
1090
for rename_entry in rename_entries:
1091
# store to local variables for easier reference
1092
from_rel = rename_entry.from_rel
1093
from_id = rename_entry.from_id
1094
to_rel = rename_entry.to_rel
1095
to_id = inv.path2id(to_rel)
1096
only_change_inv = False
1098
# check the inventory for source and destination
1100
raise errors.BzrMoveFailedError(from_rel,to_rel,
1101
errors.NotVersionedError(path=str(from_rel)))
1102
if to_id is not None:
1103
raise errors.BzrMoveFailedError(from_rel,to_rel,
1104
errors.AlreadyVersionedError(path=str(to_rel)))
1106
# try to determine the mode for rename (only change inv or change
1107
# inv and file system)
1109
if not self.has_filename(to_rel):
1110
raise errors.BzrMoveFailedError(from_id,to_rel,
1111
errors.NoSuchFile(path=str(to_rel),
1112
extra="New file has not been created yet"))
1113
only_change_inv = True
1114
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1115
only_change_inv = True
1116
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1117
only_change_inv = False
1119
# something is wrong, so lets determine what exactly
1120
if not self.has_filename(from_rel) and \
1121
not self.has_filename(to_rel):
1122
raise errors.BzrRenameFailedError(from_rel,to_rel,
1123
errors.PathsDoNotExist(paths=(str(from_rel),
1126
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1127
extra="(Use --after to update the Bazaar id)")
1128
rename_entry.only_change_inv = only_change_inv
1129
return rename_entries
1131
def _move(self, rename_entries):
1132
"""Moves a list of files.
1134
Depending on the value of the flag 'only_change_inv', the
1135
file will be moved on the file system or not.
1137
inv = self.inventory
1140
for entry in rename_entries:
1142
self._move_entry(entry)
1144
self._rollback_move(moved)
1148
def _rollback_move(self, moved):
1149
"""Try to rollback a previous move in case of an filesystem error."""
1150
inv = self.inventory
1153
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1154
entry.to_tail, entry.to_parent_id, entry.from_rel,
1155
entry.from_tail, entry.from_parent_id,
1156
entry.only_change_inv))
1157
except errors.BzrMoveFailedError, e:
1158
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1159
" The working tree is in an inconsistent state."
1160
" Please consider doing a 'bzr revert'."
1161
" Error message is: %s" % e)
1163
def _move_entry(self, entry):
1164
inv = self.inventory
1165
from_rel_abs = self.abspath(entry.from_rel)
1166
to_rel_abs = self.abspath(entry.to_rel)
1167
if from_rel_abs == to_rel_abs:
1168
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1169
"Source and target are identical.")
1171
if not entry.only_change_inv:
1173
osutils.rename(from_rel_abs, to_rel_abs)
1175
raise errors.BzrMoveFailedError(entry.from_rel,
1177
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1179
@needs_tree_write_lock
1180
def rename_one(self, from_rel, to_rel, after=False):
803
1181
"""Rename one file.
805
1183
This can change the directory or the filename or both.
1185
rename_one has several 'modes' to work. First, it can rename a physical
1186
file and change the file_id. That is the normal mode. Second, it can
1187
only change the file_id without touching any physical file. This is
1188
the new mode introduced in version 0.15.
1190
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1191
versioned but present in the working tree.
1193
rename_one uses the second mode if 'after == False' and 'from_rel' is
1194
versioned but no longer in the working tree, and 'to_rel' is not
1195
versioned but present in the working tree.
1197
rename_one uses the first mode if 'after == False' and 'from_rel' is
1198
versioned and present in the working tree, and 'to_rel' is not
1199
versioned and not present in the working tree.
1201
Everything else results in an error.
807
1203
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)
1206
# create rename entries and tuples
1207
from_tail = splitpath(from_rel)[-1]
1208
from_id = inv.path2id(from_rel)
1210
raise errors.BzrRenameFailedError(from_rel,to_rel,
1211
errors.NotVersionedError(path=str(from_rel)))
1212
from_entry = inv[from_id]
1213
from_parent_id = from_entry.parent_id
824
1214
to_dir, to_tail = os.path.split(to_rel)
825
1215
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"])
1216
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1218
from_tail=from_tail,
1219
from_parent_id=from_parent_id,
1220
to_rel=to_rel, to_tail=to_tail,
1221
to_parent_id=to_dir_id)
1222
rename_entries.append(rename_entry)
1224
# determine which move mode to use. checks also for movability
1225
rename_entries = self._determine_mv_mode(rename_entries, after)
1227
# check if the target changed directory and if the target directory is
1229
if to_dir_id is None:
1230
raise errors.BzrMoveFailedError(from_rel,to_rel,
1231
errors.NotVersionedError(path=str(to_dir)))
1233
# all checks done. now we can continue with our actual work
1234
mutter('rename_one:\n'
1239
' to_dir_id {%s}\n',
1240
from_id, from_rel, to_rel, to_dir, to_dir_id)
1242
self._move(rename_entries)
847
1243
self._write_inventory(inv)
1245
class _RenameEntry(object):
1246
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1247
to_rel, to_tail, to_parent_id, only_change_inv=False):
1248
self.from_rel = from_rel
1249
self.from_id = from_id
1250
self.from_tail = from_tail
1251
self.from_parent_id = from_parent_id
1252
self.to_rel = to_rel
1253
self.to_tail = to_tail
1254
self.to_parent_id = to_parent_id
1255
self.only_change_inv = only_change_inv
849
1257
@needs_read_lock
850
1258
def unknowns(self):
851
1259
"""Return all unknown files.
853
1261
These are files in the working directory that are not versioned or
854
1262
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
1264
for subp in self.extras():
870
1265
if not self.is_ignored(subp):
1268
@needs_tree_write_lock
1269
def unversion(self, file_ids):
1270
"""Remove the file ids in file_ids from the current versioned set.
1272
When a file_id is unversioned, all of its children are automatically
1275
:param file_ids: The file ids to stop versioning.
1276
:raises: NoSuchId if any fileid is not currently versioned.
1278
for file_id in file_ids:
1279
if self._inventory.has_id(file_id):
1280
self._inventory.remove_recursive_id(file_id)
1282
raise errors.NoSuchId(self, file_id)
1284
# in the future this should just set a dirty bit to wait for the
1285
# final unlock. However, until all methods of workingtree start
1286
# with the current in -memory inventory rather than triggering
1287
# a read, it is more complex - we need to teach read_inventory
1288
# to know when to read, and when to not read first... and possibly
1289
# to save first when the in memory one may be corrupted.
1290
# so for now, we just only write it if it is indeed dirty.
1292
self._write_inventory(self._inventory)
873
1294
@deprecated_method(zero_eight)
874
1295
def iter_conflicts(self):
875
1296
"""List all files in the tree that have text or content conflicts.
1059
1540
if new_revision is None:
1060
1541
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])
1544
self.branch.generate_revision_history(new_revision)
1545
except errors.NoSuchRevision:
1546
# not present in the repo - dont try to set it deeper than the tip
1547
self.branch.set_revision_history([new_revision])
1550
def _write_basis_inventory(self, xml):
1551
"""Write the basis inventory XML to the basis-inventory file"""
1552
assert isinstance(xml, str), 'serialised xml must be bytestring.'
1553
path = self._basis_inventory_name()
1555
self._control_files.put(path, sio)
1557
def _create_basis_xml_from_inventory(self, revision_id, inventory):
1558
"""Create the text that will be saved in basis-inventory"""
1559
inventory.revision_id = revision_id
1560
return xml6.serializer_v6.write_inventory_to_string(inventory)
1071
1562
def _cache_basis_inventory(self, new_revision):
1072
1563
"""Cache new_revision as the basis inventory."""
1564
# TODO: this should allow the ready-to-use inventory to be passed in,
1565
# as commit already has that ready-to-use [while the format is the
1074
1568
# this double handles the inventory - unpack and repack -
1075
1569
# but is easier to understand. We can/should put a conditional
1076
1570
# in here based on whether the inventory is in the latest format
1077
1571
# - 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:
1573
# the fast path is to copy the raw xml from the repository. If the
1574
# xml contains 'revision_id="', then we assume the right
1575
# revision_id is set. We must check for this full string, because a
1576
# root node id can legitimately look like 'revision_id' but cannot
1578
xml = self.branch.repository.get_inventory_xml(new_revision)
1579
firstline = xml.split('\n', 1)[0]
1580
if (not 'revision_id="' in firstline or
1581
'format="6"' not in firstline):
1582
inv = self.branch.repository.deserialise_inventory(
1584
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1585
self._write_basis_inventory(xml)
1586
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1088
1589
def read_basis_inventory(self):
1089
1590
"""Read the cached basis inventory."""
1090
1591
path = self._basis_inventory_name()
1091
return self._control_files.get_utf8(path).read()
1592
return self._control_files.get(path).read()
1093
1594
@needs_read_lock
1094
1595
def read_working_inventory(self):
1095
"""Read the working inventory."""
1596
"""Read the working inventory.
1598
:raises errors.InventoryModified: read_working_inventory will fail
1599
when the current in memory inventory has been modified.
1601
# conceptually this should be an implementation detail of the tree.
1602
# XXX: Deprecate this.
1096
1603
# ElementTree does its own conversion from UTF-8, so open in
1098
result = bzrlib.xml5.serializer_v5.read_inventory(
1605
if self._inventory_is_modified:
1606
raise errors.InventoryModified(self)
1607
result = xml5.serializer_v5.read_inventory(
1099
1608
self._control_files.get('inventory'))
1100
self._set_inventory(result)
1609
self._set_inventory(result, dirty=False)
1104
def remove(self, files, verbose=False):
1612
@needs_tree_write_lock
1613
def remove(self, files, verbose=False, to_file=None):
1105
1614
"""Remove nominated files from the working inventory..
1107
1616
This does not remove their text. This does not run on XXX on what? RBC
1204
1752
between multiple working trees, i.e. via shared storage, then we
1205
1753
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()
1755
raise NotImplementedError(self.unlock)
1231
1757
def update(self):
1232
1758
"""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.
1760
This will update the branch if its bound too, which means we have
1761
multiple trees involved:
1763
- The new basis tree of the master.
1764
- The old basis tree of the branch.
1765
- The old basis tree of the working tree.
1766
- The current working tree state.
1768
Pathologically, all three may be different, and non-ancestors of each
1769
other. Conceptually we want to:
1771
- Preserve the wt.basis->wt.state changes
1772
- Transform the wt.basis to the new master basis.
1773
- Apply a merge of the old branch basis to get any 'local' changes from
1775
- Restore the wt.basis->wt.state changes.
1246
1777
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.
1778
- Merge current state -> basis tree of the master w.r.t. the old tree
1780
- 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()
1782
if self.branch.get_master_branch() is not None:
1784
update_branch = True
1786
self.lock_tree_write()
1787
update_branch = False
1256
if self.last_revision() != self.branch.last_revision():
1257
# merge tree state up to new branch tip.
1258
basis = self.basis_tree()
1259
to_tree = self.branch.basis_tree()
1260
result += merge_inner(self.branch,
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,
1790
old_tip = self.branch.update()
1793
return self._update_tree(old_tip)
1285
self.branch.unlock()
1797
@needs_tree_write_lock
1798
def _update_tree(self, old_tip=None):
1799
"""Update a tree to the master branch.
1801
:param old_tip: if supplied, the previous tip revision the branch,
1802
before it was changed to the master branch's tip.
1804
# here if old_tip is not None, it is the old tip of the branch before
1805
# it was updated from the master branch. This should become a pending
1806
# merge in the working tree to preserve the user existing work. we
1807
# cant set that until we update the working trees last revision to be
1808
# one from the new branch, because it will just get absorbed by the
1809
# parent de-duplication logic.
1811
# We MUST save it even if an error occurs, because otherwise the users
1812
# local work is unreferenced and will appear to have been lost.
1816
last_rev = self.get_parent_ids()[0]
1819
if last_rev != self.branch.last_revision():
1820
# merge tree state up to new branch tip.
1821
basis = self.basis_tree()
1822
to_tree = self.branch.basis_tree()
1823
if basis.inventory.root is None:
1824
self.set_root_id(to_tree.inventory.root.file_id)
1825
result += merge.merge_inner(
1830
# TODO - dedup parents list with things merged by pull ?
1831
# reuse the tree we've updated to to set the basis:
1832
parent_trees = [(self.branch.last_revision(), to_tree)]
1833
merges = self.get_parent_ids()[1:]
1834
# Ideally we ask the tree for the trees here, that way the working
1835
# tree can decide whether to give us teh entire tree or give us a
1836
# lazy initialised tree. dirstate for instance will have the trees
1837
# in ram already, whereas a last-revision + basis-inventory tree
1838
# will not, but also does not need them when setting parents.
1839
for parent in merges:
1840
parent_trees.append(
1841
(parent, self.branch.repository.revision_tree(parent)))
1842
if old_tip is not None:
1843
parent_trees.append(
1844
(old_tip, self.branch.repository.revision_tree(old_tip)))
1845
self.set_parent_trees(parent_trees)
1846
last_rev = parent_trees[0][0]
1848
# the working tree had the same last-revision as the master
1849
# branch did. We may still have pivot local work from the local
1850
# branch into old_tip:
1851
if old_tip is not None:
1852
self.add_parent_tree_id(old_tip)
1853
if old_tip and old_tip != last_rev:
1854
# our last revision was not the prior branch last revision
1855
# and we have converted that last revision to a pending merge.
1856
# base is somewhere between the branch tip now
1857
# and the now pending merge
1858
from bzrlib.revision import common_ancestor
1860
base_rev_id = common_ancestor(self.branch.last_revision(),
1862
self.branch.repository)
1863
except errors.NoCommonAncestor:
1865
base_tree = self.branch.repository.revision_tree(base_rev_id)
1866
other_tree = self.branch.repository.revision_tree(old_tip)
1867
result += merge.merge_inner(
1874
def _write_hashcache_if_dirty(self):
1875
"""Write out the hashcache if it is dirty."""
1876
if self._hashcache.needs_write:
1878
self._hashcache.write()
1880
if e.errno not in (errno.EPERM, errno.EACCES):
1882
# TODO: jam 20061219 Should this be a warning? A single line
1883
# warning might be sufficient to let the user know what
1885
mutter('Could not write hashcache for %s\nError: %s',
1886
self._hashcache.cache_file_name(), e)
1888
@needs_tree_write_lock
1288
1889
def _write_inventory(self, inv):
1289
1890
"""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')
1891
self._set_inventory(inv, dirty=True)
1297
1894
def set_conflicts(self, arg):
1298
raise UnsupportedOperation(self.set_conflicts, self)
1895
raise errors.UnsupportedOperation(self.set_conflicts, self)
1897
def add_conflicts(self, arg):
1898
raise errors.UnsupportedOperation(self.add_conflicts, self)
1300
1900
@needs_read_lock
1301
1901
def conflicts(self):
1302
conflicts = ConflictList()
1902
conflicts = _mod_conflicts.ConflictList()
1303
1903
for conflicted in self._iter_conflicts():
1306
1906
if file_kind(self.abspath(conflicted)) != "file":
1309
if e.errno == errno.ENOENT:
1908
except errors.NoSuchFile:
1313
1910
if text is True:
1314
1911
for suffix in ('.THIS', '.OTHER'):
1316
1913
kind = file_kind(self.abspath(conflicted+suffix))
1318
if e.errno == errno.ENOENT:
1916
except errors.NoSuchFile:
1326
1920
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1327
conflicts.append(Conflict.factory(ctype, path=conflicted,
1921
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1328
1923
file_id=self.path2id(conflicted)))
1329
1924
return conflicts
1927
class WorkingTree2(WorkingTree):
1928
"""This is the Format 2 working tree.
1930
This was the first weave based working tree.
1931
- uses os locks for locking.
1932
- uses the branch last-revision.
1935
def lock_tree_write(self):
1936
"""See WorkingTree.lock_tree_write().
1938
In Format2 WorkingTrees we have a single lock for the branch and tree
1939
so lock_tree_write() degrades to lock_write().
1941
self.branch.lock_write()
1943
return self._control_files.lock_write()
1945
self.branch.unlock()
1949
# we share control files:
1950
if self._control_files._lock_count == 3:
1951
# _inventory_is_modified is always False during a read lock.
1952
if self._inventory_is_modified:
1954
self._write_hashcache_if_dirty()
1956
# reverse order of locking.
1958
return self._control_files.unlock()
1960
self.branch.unlock()
1332
1963
class WorkingTree3(WorkingTree):
1333
1964
"""This is the Format 3 working tree.