39
36
# At the moment they may alias the inventory and have old copies of it in
40
37
# memory. (Now done? -- mbp 20060309)
42
from copy import deepcopy
43
39
from cStringIO import StringIO
43
from bzrlib.lazy_import import lazy_import
44
lazy_import(globals(), """
45
from bisect import bisect_left
50
from bzrlib.atomicfile import AtomicFile
51
from bzrlib.branch import (Branch,
53
from bzrlib.conflicts import Conflict, ConflictList, CONFLICT_SUFFIXES
54
import bzrlib.bzrdir as bzrdir
59
conflicts as _mod_conflicts,
68
revision as _mod_revision,
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,
405
441
return bzrdir.BzrDir.create_standalone_workingtree(directory)
407
def relpath(self, abs):
408
"""Return the local path portion from a given absolute path."""
409
return relpath(self.basedir, abs)
443
def relpath(self, path):
444
"""Return the local path portion from a given path.
446
The path may be absolute or relative. If its a relative path it is
447
interpreted relative to the python current working directory.
449
return osutils.relpath(self.basedir, path)
411
451
def has_filename(self, filename):
412
return bzrlib.osutils.lexists(self.abspath(filename))
414
def get_file(self, file_id):
415
return self.get_file_byname(self.id2path(file_id))
452
return osutils.lexists(self.abspath(filename))
454
def get_file(self, file_id, path=None):
456
file_id = osutils.safe_file_id(file_id)
457
path = self.id2path(file_id)
458
return self.get_file_byname(path)
460
def get_file_text(self, file_id):
461
file_id = osutils.safe_file_id(file_id)
462
return self.get_file(file_id).read()
417
464
def get_file_byname(self, filename):
418
465
return file(self.abspath(filename), 'rb')
468
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
469
"""See Tree.annotate_iter
471
This implementation will use the basis tree implementation if possible.
472
Lines not in the basis are attributed to CURRENT_REVISION
474
If there are pending merges, lines added by those merges will be
475
incorrectly attributed to CURRENT_REVISION (but after committing, the
476
attribution will be correct).
478
file_id = osutils.safe_file_id(file_id)
479
basis = self.basis_tree()
482
changes = self._iter_changes(basis, True, [self.id2path(file_id)],
483
require_versioned=True).next()
484
changed_content, kind = changes[2], changes[6]
485
if not changed_content:
486
return basis.annotate_iter(file_id)
490
if kind[0] != 'file':
493
old_lines = list(basis.annotate_iter(file_id))
495
for tree in self.branch.repository.revision_trees(
496
self.get_parent_ids()[1:]):
497
if file_id not in tree:
499
old.append(list(tree.annotate_iter(file_id)))
500
return annotate.reannotate(old, self.get_file(file_id).readlines(),
505
def _get_ancestors(self, default_revision):
506
ancestors = set([default_revision])
507
for parent_id in self.get_parent_ids():
508
ancestors.update(self.branch.repository.get_ancestry(
509
parent_id, topo_sorted=False))
512
def get_parent_ids(self):
513
"""See Tree.get_parent_ids.
515
This implementation reads the pending merges list and last_revision
516
value and uses that to decide what the parents list should be.
518
last_rev = _mod_revision.ensure_null(self._last_revision())
519
if _mod_revision.NULL_REVISION == last_rev:
524
merges_file = self._control_files.get('pending-merges')
525
except errors.NoSuchFile:
528
for l in merges_file.readlines():
529
revision_id = osutils.safe_revision_id(l.rstrip('\n'))
530
parents.append(revision_id)
420
534
def get_root_id(self):
421
535
"""Return the id of this trees root"""
422
inv = self.read_working_inventory()
423
return inv.root.file_id
536
return self._inventory.root.file_id
425
538
def _get_store_filename(self, file_id):
426
539
## XXX: badly named; this is not in the store at all
540
file_id = osutils.safe_file_id(file_id)
427
541
return self.abspath(self.id2path(file_id))
430
def clone(self, to_bzrdir, revision_id=None, basis=None):
544
def clone(self, to_bzrdir, revision_id=None):
431
545
"""Duplicate this working tree into to_bzr, including all state.
433
547
Specifically modified files are kept as modified, but
493
593
__contains__ = has_id
495
595
def get_file_size(self, file_id):
596
file_id = osutils.safe_file_id(file_id)
496
597
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():
600
def get_file_sha1(self, file_id, path=None, stat_value=None):
601
file_id = osutils.safe_file_id(file_id)
603
path = self._inventory.id2path(file_id)
604
return self._hashcache.get_sha1(path, stat_value)
606
def get_file_mtime(self, file_id, path=None):
607
file_id = osutils.safe_file_id(file_id)
609
path = self.inventory.id2path(file_id)
610
return os.lstat(self.abspath(path)).st_mtime
612
if not supports_executable():
613
def is_executable(self, file_id, path=None):
614
file_id = osutils.safe_file_id(file_id)
505
615
return self._inventory[file_id].executable
507
path = self._inventory.id2path(file_id)
617
def is_executable(self, file_id, path=None):
619
file_id = osutils.safe_file_id(file_id)
620
path = self.id2path(file_id)
508
621
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.
622
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
624
@needs_tree_write_lock
625
def _add(self, files, ids, kinds):
626
"""See MutableTree._add."""
534
627
# TODO: Re-adding a file that is removed in the working copy
535
628
# 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))
547
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))
629
# the read and write working inventory should not occur in this
630
# function - they should be part of lock_write and unlock.
632
for f, file_id, kind in zip(files, ids, kinds):
633
assert kind is not None
571
634
if file_id is None:
572
file_id = gen_file_id(f)
573
inv.add_path(f, kind=kind, file_id=file_id)
635
inv.add_path(f, kind=kind)
637
file_id = osutils.safe_file_id(file_id)
638
inv.add_path(f, kind=kind, file_id=file_id)
639
self._inventory_is_modified = True
575
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
576
self._write_inventory(inv)
641
@needs_tree_write_lock
642
def _gather_kinds(self, files, kinds):
643
"""See MutableTree._gather_kinds."""
644
for pos, f in enumerate(files):
645
if kinds[pos] is None:
646
fullpath = normpath(self.abspath(f))
648
kinds[pos] = file_kind(fullpath)
650
if e.errno == errno.ENOENT:
651
raise errors.NoSuchFile(fullpath)
578
653
@needs_write_lock
654
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
655
"""Add revision_id as a parent.
657
This is equivalent to retrieving the current list of parent ids
658
and setting the list to its value plus revision_id.
660
:param revision_id: The revision id to add to the parent list. It may
661
be a ghost revision as long as its not the first parent to be added,
662
or the allow_leftmost_as_ghost parameter is set True.
663
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
665
parents = self.get_parent_ids() + [revision_id]
666
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
667
or allow_leftmost_as_ghost)
669
@needs_tree_write_lock
670
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
671
"""Add revision_id, tree tuple as a parent.
673
This is equivalent to retrieving the current list of parent trees
674
and setting the list to its value plus parent_tuple. See also
675
add_parent_tree_id - if you only have a parent id available it will be
676
simpler to use that api. If you have the parent already available, using
677
this api is preferred.
679
:param parent_tuple: The (revision id, tree) to add to the parent list.
680
If the revision_id is a ghost, pass None for the tree.
681
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
683
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
684
if len(parent_ids) > 1:
685
# the leftmost may have already been a ghost, preserve that if it
687
allow_leftmost_as_ghost = True
688
self.set_parent_ids(parent_ids,
689
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
691
@needs_tree_write_lock
579
692
def add_pending_merge(self, *revision_ids):
580
693
# TODO: Perhaps should check at this point that the
581
694
# history of the revision is actually present?
582
p = self.pending_merges()
695
parents = self.get_parent_ids()
584
697
for rev_id in revision_ids:
698
if rev_id in parents:
700
parents.append(rev_id)
590
self.set_pending_merges(p)
703
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
705
@deprecated_method(zero_eleven)
593
707
def pending_merges(self):
594
708
"""Return a list of pending merges.
596
710
These are revisions that have been merged into the working
597
711
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'))
713
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
714
instead - which is available on all tree objects.
716
return self.get_parent_ids()[1:]
718
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
719
"""Common ghost checking functionality from set_parent_*.
721
This checks that the left hand-parent exists if there are any
724
if len(revision_ids) > 0:
725
leftmost_id = revision_ids[0]
726
if (not allow_leftmost_as_ghost and not
727
self.branch.repository.has_revision(leftmost_id)):
728
raise errors.GhostRevisionUnusableHere(leftmost_id)
730
def _set_merges_from_parent_ids(self, parent_ids):
731
merges = parent_ids[1:]
732
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
734
@needs_tree_write_lock
735
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
736
"""Set the parent ids to revision_ids.
738
See also set_parent_trees. This api will try to retrieve the tree data
739
for each element of revision_ids from the trees repository. If you have
740
tree data already available, it is more efficient to use
741
set_parent_trees rather than set_parent_ids. set_parent_ids is however
742
an easier API to use.
744
:param revision_ids: The revision_ids to set as the parent ids of this
745
working tree. Any of these may be ghosts.
747
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
748
self._check_parents_for_ghosts(revision_ids,
749
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
750
for revision_id in revision_ids:
751
_mod_revision.check_not_reserved_id(revision_id)
753
if len(revision_ids) > 0:
754
self.set_last_revision(revision_ids[0])
756
self.set_last_revision(_mod_revision.NULL_REVISION)
758
self._set_merges_from_parent_ids(revision_ids)
760
@needs_tree_write_lock
761
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
762
"""See MutableTree.set_parent_trees."""
763
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
764
for revision_id in parent_ids:
765
_mod_revision.check_not_reserved_id(revision_id)
767
self._check_parents_for_ghosts(parent_ids,
768
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
770
if len(parent_ids) == 0:
771
leftmost_parent_id = _mod_revision.NULL_REVISION
772
leftmost_parent_tree = None
774
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
776
if self._change_last_revision(leftmost_parent_id):
777
if leftmost_parent_tree is None:
778
# If we don't have a tree, fall back to reading the
779
# parent tree from the repository.
780
self._cache_basis_inventory(leftmost_parent_id)
782
inv = leftmost_parent_tree.inventory
783
xml = self._create_basis_xml_from_inventory(
784
leftmost_parent_id, inv)
785
self._write_basis_inventory(xml)
786
self._set_merges_from_parent_ids(parent_ids)
788
@needs_tree_write_lock
611
789
def set_pending_merges(self, rev_list):
612
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
790
parents = self.get_parent_ids()
791
leftmost = parents[:1]
792
new_parents = leftmost + rev_list
793
self.set_parent_ids(new_parents)
795
@needs_tree_write_lock
615
796
def set_merge_modified(self, modified_hashes):
616
797
def iter_stanzas():
617
798
for file_id, hash in modified_hashes.iteritems():
618
yield Stanza(file_id=file_id, hash=hash)
799
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
619
800
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
622
802
def _put_rio(self, filename, stanzas, header):
803
self._must_be_locked()
623
804
my_file = rio_file(stanzas, header)
624
805
self._control_files.put(filename, my_file)
807
@needs_write_lock # because merge pulls data into the branch.
808
def merge_from_branch(self, branch, to_revision=None, from_revision=None,
810
"""Merge from a branch into this working tree.
812
:param branch: The branch to merge from.
813
:param to_revision: If non-None, the merge will merge to to_revision,
814
but not beyond it. to_revision does not need to be in the history
815
of the branch when it is supplied. If None, to_revision defaults to
816
branch.last_revision().
818
from bzrlib.merge import Merger, Merge3Merger
819
pb = bzrlib.ui.ui_factory.nested_progress_bar()
821
merger = Merger(self.branch, this_tree=self, pb=pb)
822
merger.pp = ProgressPhase("Merge phase", 5, pb)
823
merger.pp.next_phase()
824
# check that there are no
826
merger.check_basis(check_clean=True, require_commits=False)
827
if to_revision is None:
828
to_revision = _mod_revision.ensure_null(branch.last_revision())
830
to_revision = osutils.safe_revision_id(to_revision)
831
merger.other_rev_id = to_revision
832
if _mod_revision.is_null(merger.other_rev_id):
833
raise errors.NoCommits(branch)
834
self.branch.fetch(branch, last_revision=merger.other_rev_id)
835
merger.other_basis = merger.other_rev_id
836
merger.other_tree = self.branch.repository.revision_tree(
838
merger.other_branch = branch
839
merger.pp.next_phase()
840
if from_revision is None:
843
merger.set_base_revision(from_revision, branch)
844
if merger.base_rev_id == merger.other_rev_id:
845
raise errors.PointlessMerge
846
merger.backup_files = False
847
if merge_type is None:
848
merger.merge_type = Merge3Merger
850
merger.merge_type = merge_type
851
merger.set_interesting_files(None)
852
merger.show_base = False
853
merger.reprocess = False
854
conflicts = merger.do_merge()
627
861
def merge_modified(self):
862
"""Return a dictionary of files modified by a merge.
864
The list is initialized by WorkingTree.set_merge_modified, which is
865
typically called after we make some automatic updates to the tree
868
This returns a map of file_id->sha1, containing only files which are
869
still in the working inventory and have that text hash.
629
872
hashfile = self._control_files.get('merge-hashes')
873
except errors.NoSuchFile:
632
875
merge_hashes = {}
634
877
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
635
raise MergeModifiedFormatError()
878
raise errors.MergeModifiedFormatError()
636
879
except StopIteration:
637
raise MergeModifiedFormatError()
880
raise errors.MergeModifiedFormatError()
638
881
for s in RioReader(hashfile):
639
file_id = s.get("file_id")
882
# RioReader reads in Unicode, so convert file_ids back to utf8
883
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
640
884
if file_id not in self.inventory:
643
if hash == self.get_file_sha1(file_id):
644
merge_hashes[file_id] = hash
886
text_hash = s.get("hash")
887
if text_hash == self.get_file_sha1(file_id):
888
merge_hashes[file_id] = text_hash
645
889
return merge_hashes
892
def mkdir(self, path, file_id=None):
893
"""See MutableTree.mkdir()."""
895
file_id = generate_ids.gen_file_id(os.path.basename(path))
896
os.mkdir(self.abspath(path))
897
self.add(path, file_id, 'directory')
647
900
def get_symlink_target(self, file_id):
901
file_id = osutils.safe_file_id(file_id)
648
902
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).
905
def subsume(self, other_tree):
906
def add_children(inventory, entry):
907
for child_entry in entry.children.values():
908
inventory._byid[child_entry.file_id] = child_entry
909
if child_entry.kind == 'directory':
910
add_children(inventory, child_entry)
911
if other_tree.get_root_id() == self.get_root_id():
912
raise errors.BadSubsumeSource(self, other_tree,
913
'Trees have the same root')
915
other_tree_path = self.relpath(other_tree.basedir)
916
except errors.PathNotChild:
917
raise errors.BadSubsumeSource(self, other_tree,
918
'Tree is not contained by the other')
919
new_root_parent = self.path2id(osutils.dirname(other_tree_path))
920
if new_root_parent is None:
921
raise errors.BadSubsumeSource(self, other_tree,
922
'Parent directory is not versioned.')
923
# We need to ensure that the result of a fetch will have a
924
# versionedfile for the other_tree root, and only fetching into
925
# RepositoryKnit2 guarantees that.
926
if not self.branch.repository.supports_rich_root():
927
raise errors.SubsumeTargetNeedsUpgrade(other_tree)
928
other_tree.lock_tree_write()
930
new_parents = other_tree.get_parent_ids()
931
other_root = other_tree.inventory.root
932
other_root.parent_id = new_root_parent
933
other_root.name = osutils.basename(other_tree_path)
934
self.inventory.add(other_root)
935
add_children(self.inventory, other_root)
936
self._write_inventory(self.inventory)
937
# normally we don't want to fetch whole repositories, but i think
938
# here we really do want to consolidate the whole thing.
939
for parent_id in other_tree.get_parent_ids():
940
self.branch.fetch(other_tree.branch, parent_id)
941
self.add_parent_tree_id(parent_id)
944
other_tree.bzrdir.retire_bzrdir()
946
@needs_tree_write_lock
947
def extract(self, file_id, format=None):
948
"""Extract a subtree from this tree.
950
A new branch will be created, relative to the path for this tree.
954
segments = osutils.splitpath(path)
955
transport = self.branch.bzrdir.root_transport
956
for name in segments:
957
transport = transport.clone(name)
958
transport.ensure_base()
961
sub_path = self.id2path(file_id)
962
branch_transport = mkdirs(sub_path)
964
format = bzrdir.format_registry.make_bzrdir('dirstate-with-subtree')
965
branch_transport.ensure_base()
966
branch_bzrdir = format.initialize_on_transport(branch_transport)
968
repo = branch_bzrdir.find_repository()
969
except errors.NoRepositoryPresent:
970
repo = branch_bzrdir.create_repository()
971
assert repo.supports_rich_root()
973
if not repo.supports_rich_root():
974
raise errors.RootNotRich()
975
new_branch = branch_bzrdir.create_branch()
976
new_branch.pull(self.branch)
977
for parent_id in self.get_parent_ids():
978
new_branch.fetch(self.branch, parent_id)
979
tree_transport = self.bzrdir.root_transport.clone(sub_path)
980
if tree_transport.base != branch_transport.base:
981
tree_bzrdir = format.initialize_on_transport(tree_transport)
982
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
984
tree_bzrdir = branch_bzrdir
985
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
986
wt.set_parent_ids(self.get_parent_ids())
987
my_inv = self.inventory
988
child_inv = Inventory(root_id=None)
989
new_root = my_inv[file_id]
990
my_inv.remove_recursive_id(file_id)
991
new_root.parent_id = None
992
child_inv.add(new_root)
993
self._write_inventory(my_inv)
994
wt._write_inventory(child_inv)
997
def _serialize(self, inventory, out_file):
998
xml5.serializer_v5.write_inventory(self._inventory, out_file)
1000
def _deserialize(selt, in_file):
1001
return xml5.serializer_v5.read_inventory(in_file)
1004
"""Write the in memory inventory to disk."""
1005
# TODO: Maybe this should only write on dirty ?
1006
if self._control_files._lock_mode != 'w':
1007
raise errors.NotWriteLocked(self)
1009
self._serialize(self._inventory, sio)
1011
self._control_files.put('inventory', sio)
1012
self._inventory_is_modified = False
1014
def _kind(self, relpath):
1015
return osutils.file_kind(self.abspath(relpath))
1017
def list_files(self, include_root=False):
1018
"""Recursively list all files as (path, class, kind, id, entry).
661
1020
Lists, but does not descend into unversioned directories.
666
1025
Skips the control directory.
668
inv = self._inventory
670
def descend(from_dir_relpath, from_dir_id, dp):
1027
# list_files is an iterator, so @needs_read_lock doesn't work properly
1028
# with it. So callers should be careful to always read_lock the tree.
1029
if not self.is_locked():
1030
raise errors.ObjectNotLocked(self)
1032
inv = self.inventory
1033
if include_root is True:
1034
yield ('', 'V', 'directory', inv.root.file_id, inv.root)
1035
# Convert these into local objects to save lookup times
1036
pathjoin = osutils.pathjoin
1037
file_kind = self._kind
1039
# transport.base ends in a slash, we want the piece
1040
# between the last two slashes
1041
transport_base_dir = self.bzrdir.transport.base.rsplit('/', 2)[1]
1043
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1045
# directory file_id, relative path, absolute path, reverse sorted children
1046
children = os.listdir(self.basedir)
1048
# jam 20060527 The kernel sized tree seems equivalent whether we
1049
# use a deque and popleft to keep them sorted, or if we use a plain
1050
# list and just reverse() them.
1051
children = collections.deque(children)
1052
stack = [(inv.root.file_id, u'', self.basedir, children)]
1054
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1057
f = children.popleft()
674
1058
## TODO: If we find a subdirectory with its own .bzr
675
1059
## directory, then that is a separate tree and we
676
1060
## should exclude it.
678
1062
# the bzrdir for this tree
679
if self.bzrdir.transport.base.endswith(f + '/'):
1063
if transport_base_dir == f:
683
fp = appendpath(from_dir_relpath, f)
1066
# we know that from_dir_relpath and from_dir_abspath never end in a slash
1067
# and 'f' doesn't begin with one, we can do a string op, rather
1068
# than the checks of pathjoin(), all relative paths will have an extra slash
1070
fp = from_dir_relpath + '/' + f
686
fap = appendpath(dp, f)
1073
fap = from_dir_abspath + '/' + f
688
1075
f_ie = inv.get_child(from_dir_id, f)
691
elif self.is_ignored(fp):
1078
elif self.is_ignored(fp[1:]):
1081
# we may not have found this file, because of a unicode issue
1082
f_norm, can_access = osutils.normalized_filename(f)
1083
if f == f_norm or not can_access:
1084
# No change, so treat this file normally
1087
# this file can be accessed by a normalized path
1088
# check again if it is versioned
1089
# these lines are repeated here for performance
1091
fp = from_dir_relpath + '/' + f
1092
fap = from_dir_abspath + '/' + f
1093
f_ie = inv.get_child(from_dir_id, f)
1096
elif self.is_ignored(fp[1:]):
696
1101
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
1103
# make a last minute entry
1105
yield fp[1:], c, fk, f_ie.file_id, f_ie
708
if fk == 'directory':
709
entry = TreeDirectory()
712
elif fk == 'symlink':
1108
yield fp[1:], c, fk, None, fk_entries[fk]()
1110
yield fp[1:], c, fk, None, TreeEntry()
717
yield fp, c, fk, (f_ie and f_ie.file_id), entry
719
1113
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):
1116
# But do this child first
1117
new_children = os.listdir(fap)
1119
new_children = collections.deque(new_children)
1120
stack.append((f_ie.file_id, fp, fap, new_children))
1121
# Break out of inner loop,
1122
# so that we start outer loop with child
1125
# if we finished all children, pop it off the stack
1128
@needs_tree_write_lock
1129
def move(self, from_paths, to_dir=None, after=False, **kwargs):
734
1130
"""Rename files.
736
to_name must exist in the inventory.
1132
to_dir must exist in the inventory.
738
If to_name exists and is a directory, the files are moved into
1134
If to_dir exists and is a directory, the files are moved into
739
1135
it, keeping their old names.
741
Note that to_name is only the last component of the new name;
1137
Note that to_dir is only the last component of the new name;
742
1138
this doesn't change the directory.
1140
For each entry in from_paths the move mode will be determined
1143
The first mode moves the file in the filesystem and updates the
1144
inventory. The second mode only updates the inventory without
1145
touching the file on the filesystem. This is the new mode introduced
1148
move uses the second mode if 'after == True' and the target is not
1149
versioned but present in the working tree.
1151
move uses the second mode if 'after == False' and the source is
1152
versioned but no longer in the working tree, and the target is not
1153
versioned but present in the working tree.
1155
move uses the first mode if 'after == False' and the source is
1156
versioned and present in the working tree, and the target is not
1157
versioned and not present in the working tree.
1159
Everything else results in an error.
744
1161
This returns a list of (from_path, to_path) pairs for each
745
1162
entry that is moved.
748
## TODO: Option to move IDs only
1167
# check for deprecated use of signature
1169
to_dir = kwargs.get('to_name', None)
1171
raise TypeError('You must supply a target directory')
1173
symbol_versioning.warn('The parameter to_name was deprecated'
1174
' in version 0.13. Use to_dir instead',
1177
# check destination directory
749
1178
assert not isinstance(from_paths, basestring)
750
1179
inv = self.inventory
751
to_abs = self.abspath(to_name)
1180
to_abs = self.abspath(to_dir)
752
1181
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)
1182
raise errors.BzrMoveFailedError('',to_dir,
1183
errors.NotADirectory(to_abs))
1184
if not self.has_filename(to_dir):
1185
raise errors.BzrMoveFailedError('',to_dir,
1186
errors.NotInWorkingDirectory(to_dir))
1187
to_dir_id = inv.path2id(to_dir)
1188
if to_dir_id is None:
1189
raise errors.BzrMoveFailedError('',to_dir,
1190
errors.NotVersionedError(path=str(to_dir)))
759
1192
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)
1193
if to_dir_ie.kind != 'directory':
1194
raise errors.BzrMoveFailedError('',to_dir,
1195
errors.NotADirectory(to_abs))
1197
# create rename entries and tuples
1198
for from_rel in from_paths:
1199
from_tail = splitpath(from_rel)[-1]
1200
from_id = inv.path2id(from_rel)
1202
raise errors.BzrMoveFailedError(from_rel,to_dir,
1203
errors.NotVersionedError(path=str(from_rel)))
1205
from_entry = inv[from_id]
1206
from_parent_id = from_entry.parent_id
1207
to_rel = pathjoin(to_dir, from_tail)
1208
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1210
from_tail=from_tail,
1211
from_parent_id=from_parent_id,
1212
to_rel=to_rel, to_tail=from_tail,
1213
to_parent_id=to_dir_id)
1214
rename_entries.append(rename_entry)
1215
rename_tuples.append((from_rel, to_rel))
1217
# determine which move mode to use. checks also for movability
1218
rename_entries = self._determine_mv_mode(rename_entries, after)
1220
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"])
1223
self._inventory_is_modified = True
1224
self._move(rename_entries)
795
1226
# restore the inventory on error
796
self._set_inventory(orig_inv)
1227
self._inventory_is_modified = original_modified
798
1229
self._write_inventory(inv)
802
def rename_one(self, from_rel, to_rel):
1230
return rename_tuples
1232
def _determine_mv_mode(self, rename_entries, after=False):
1233
"""Determines for each from-to pair if both inventory and working tree
1234
or only the inventory has to be changed.
1236
Also does basic plausability tests.
1238
inv = self.inventory
1240
for rename_entry in rename_entries:
1241
# store to local variables for easier reference
1242
from_rel = rename_entry.from_rel
1243
from_id = rename_entry.from_id
1244
to_rel = rename_entry.to_rel
1245
to_id = inv.path2id(to_rel)
1246
only_change_inv = False
1248
# check the inventory for source and destination
1250
raise errors.BzrMoveFailedError(from_rel,to_rel,
1251
errors.NotVersionedError(path=str(from_rel)))
1252
if to_id is not None:
1253
raise errors.BzrMoveFailedError(from_rel,to_rel,
1254
errors.AlreadyVersionedError(path=str(to_rel)))
1256
# try to determine the mode for rename (only change inv or change
1257
# inv and file system)
1259
if not self.has_filename(to_rel):
1260
raise errors.BzrMoveFailedError(from_id,to_rel,
1261
errors.NoSuchFile(path=str(to_rel),
1262
extra="New file has not been created yet"))
1263
only_change_inv = True
1264
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1265
only_change_inv = True
1266
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1267
only_change_inv = False
1269
# something is wrong, so lets determine what exactly
1270
if not self.has_filename(from_rel) and \
1271
not self.has_filename(to_rel):
1272
raise errors.BzrRenameFailedError(from_rel,to_rel,
1273
errors.PathsDoNotExist(paths=(str(from_rel),
1276
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1277
extra="(Use --after to update the Bazaar id)")
1278
rename_entry.only_change_inv = only_change_inv
1279
return rename_entries
1281
def _move(self, rename_entries):
1282
"""Moves a list of files.
1284
Depending on the value of the flag 'only_change_inv', the
1285
file will be moved on the file system or not.
1287
inv = self.inventory
1290
for entry in rename_entries:
1292
self._move_entry(entry)
1294
self._rollback_move(moved)
1298
def _rollback_move(self, moved):
1299
"""Try to rollback a previous move in case of an filesystem error."""
1300
inv = self.inventory
1303
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1304
entry.to_tail, entry.to_parent_id, entry.from_rel,
1305
entry.from_tail, entry.from_parent_id,
1306
entry.only_change_inv))
1307
except errors.BzrMoveFailedError, e:
1308
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1309
" The working tree is in an inconsistent state."
1310
" Please consider doing a 'bzr revert'."
1311
" Error message is: %s" % e)
1313
def _move_entry(self, entry):
1314
inv = self.inventory
1315
from_rel_abs = self.abspath(entry.from_rel)
1316
to_rel_abs = self.abspath(entry.to_rel)
1317
if from_rel_abs == to_rel_abs:
1318
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1319
"Source and target are identical.")
1321
if not entry.only_change_inv:
1323
osutils.rename(from_rel_abs, to_rel_abs)
1325
raise errors.BzrMoveFailedError(entry.from_rel,
1327
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1329
@needs_tree_write_lock
1330
def rename_one(self, from_rel, to_rel, after=False):
803
1331
"""Rename one file.
805
1333
This can change the directory or the filename or both.
1335
rename_one has several 'modes' to work. First, it can rename a physical
1336
file and change the file_id. That is the normal mode. Second, it can
1337
only change the file_id without touching any physical file. This is
1338
the new mode introduced in version 0.15.
1340
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1341
versioned but present in the working tree.
1343
rename_one uses the second mode if 'after == False' and 'from_rel' is
1344
versioned but no longer in the working tree, and 'to_rel' is not
1345
versioned but present in the working tree.
1347
rename_one uses the first mode if 'after == False' and 'from_rel' is
1348
versioned and present in the working tree, and 'to_rel' is not
1349
versioned and not present in the working tree.
1351
Everything else results in an error.
807
1353
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)
1356
# create rename entries and tuples
1357
from_tail = splitpath(from_rel)[-1]
1358
from_id = inv.path2id(from_rel)
1360
raise errors.BzrRenameFailedError(from_rel,to_rel,
1361
errors.NotVersionedError(path=str(from_rel)))
1362
from_entry = inv[from_id]
1363
from_parent_id = from_entry.parent_id
824
1364
to_dir, to_tail = os.path.split(to_rel)
825
1365
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"])
1366
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1368
from_tail=from_tail,
1369
from_parent_id=from_parent_id,
1370
to_rel=to_rel, to_tail=to_tail,
1371
to_parent_id=to_dir_id)
1372
rename_entries.append(rename_entry)
1374
# determine which move mode to use. checks also for movability
1375
rename_entries = self._determine_mv_mode(rename_entries, after)
1377
# check if the target changed directory and if the target directory is
1379
if to_dir_id is None:
1380
raise errors.BzrMoveFailedError(from_rel,to_rel,
1381
errors.NotVersionedError(path=str(to_dir)))
1383
# all checks done. now we can continue with our actual work
1384
mutter('rename_one:\n'
1389
' to_dir_id {%s}\n',
1390
from_id, from_rel, to_rel, to_dir, to_dir_id)
1392
self._move(rename_entries)
847
1393
self._write_inventory(inv)
1395
class _RenameEntry(object):
1396
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1397
to_rel, to_tail, to_parent_id, only_change_inv=False):
1398
self.from_rel = from_rel
1399
self.from_id = from_id
1400
self.from_tail = from_tail
1401
self.from_parent_id = from_parent_id
1402
self.to_rel = to_rel
1403
self.to_tail = to_tail
1404
self.to_parent_id = to_parent_id
1405
self.only_change_inv = only_change_inv
849
1407
@needs_read_lock
850
1408
def unknowns(self):
851
1409
"""Return all unknown files.
853
1411
These are files in the working directory that are not versioned or
854
1412
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):
1414
# force the extras method to be fully executed before returning, to
1415
# prevent race conditions with the lock
1417
[subp for subp in self.extras() if not self.is_ignored(subp)])
1419
@needs_tree_write_lock
1420
def unversion(self, file_ids):
1421
"""Remove the file ids in file_ids from the current versioned set.
1423
When a file_id is unversioned, all of its children are automatically
1426
:param file_ids: The file ids to stop versioning.
1427
:raises: NoSuchId if any fileid is not currently versioned.
1429
for file_id in file_ids:
1430
file_id = osutils.safe_file_id(file_id)
1431
if self._inventory.has_id(file_id):
1432
self._inventory.remove_recursive_id(file_id)
1434
raise errors.NoSuchId(self, file_id)
1436
# in the future this should just set a dirty bit to wait for the
1437
# final unlock. However, until all methods of workingtree start
1438
# with the current in -memory inventory rather than triggering
1439
# a read, it is more complex - we need to teach read_inventory
1440
# to know when to read, and when to not read first... and possibly
1441
# to save first when the in memory one may be corrupted.
1442
# so for now, we just only write it if it is indeed dirty.
1444
self._write_inventory(self._inventory)
873
1446
@deprecated_method(zero_eight)
874
1447
def iter_conflicts(self):
875
1448
"""List all files in the tree that have text or content conflicts.
1056
1709
This is used to allow WorkingTree3 instances to not affect branch
1057
1710
when their last revision is set.
1059
if new_revision is None:
1712
if _mod_revision.is_null(new_revision):
1060
1713
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])
1716
self.branch.generate_revision_history(new_revision)
1717
except errors.NoSuchRevision:
1718
# not present in the repo - dont try to set it deeper than the tip
1719
self.branch.set_revision_history([new_revision])
1722
def _write_basis_inventory(self, xml):
1723
"""Write the basis inventory XML to the basis-inventory file"""
1724
assert isinstance(xml, str), 'serialised xml must be bytestring.'
1725
path = self._basis_inventory_name()
1727
self._control_files.put(path, sio)
1729
def _create_basis_xml_from_inventory(self, revision_id, inventory):
1730
"""Create the text that will be saved in basis-inventory"""
1731
# TODO: jam 20070209 This should be redundant, as the revision_id
1732
# as all callers should have already converted the revision_id to
1734
inventory.revision_id = osutils.safe_revision_id(revision_id)
1735
return xml7.serializer_v7.write_inventory_to_string(inventory)
1071
1737
def _cache_basis_inventory(self, new_revision):
1072
1738
"""Cache new_revision as the basis inventory."""
1739
# TODO: this should allow the ready-to-use inventory to be passed in,
1740
# as commit already has that ready-to-use [while the format is the
1074
1743
# this double handles the inventory - unpack and repack -
1075
1744
# but is easier to understand. We can/should put a conditional
1076
1745
# in here based on whether the inventory is in the latest format
1077
1746
# - 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:
1748
# the fast path is to copy the raw xml from the repository. If the
1749
# xml contains 'revision_id="', then we assume the right
1750
# revision_id is set. We must check for this full string, because a
1751
# root node id can legitimately look like 'revision_id' but cannot
1753
xml = self.branch.repository.get_inventory_xml(new_revision)
1754
firstline = xml.split('\n', 1)[0]
1755
if (not 'revision_id="' in firstline or
1756
'format="7"' not in firstline):
1757
inv = self.branch.repository.deserialise_inventory(
1759
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1760
self._write_basis_inventory(xml)
1761
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1088
1764
def read_basis_inventory(self):
1089
1765
"""Read the cached basis inventory."""
1090
1766
path = self._basis_inventory_name()
1091
return self._control_files.get_utf8(path).read()
1767
return self._control_files.get(path).read()
1093
1769
@needs_read_lock
1094
1770
def read_working_inventory(self):
1095
"""Read the working inventory."""
1771
"""Read the working inventory.
1773
:raises errors.InventoryModified: read_working_inventory will fail
1774
when the current in memory inventory has been modified.
1776
# conceptually this should be an implementation detail of the tree.
1777
# XXX: Deprecate this.
1096
1778
# 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)
1780
if self._inventory_is_modified:
1781
raise errors.InventoryModified(self)
1782
result = self._deserialize(self._control_files.get('inventory'))
1783
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.
1786
@needs_tree_write_lock
1787
def remove(self, files, verbose=False, to_file=None, keep_files=True,
1789
"""Remove nominated files from the working inventory.
1791
:files: File paths relative to the basedir.
1792
:keep_files: If true, the files will also be kept.
1793
:force: Delete files and directories, even if they are changed and
1794
even if the directories are not empty.
1118
## TODO: Normalize names
1119
## TODO: Remove nested loops; better scalability
1120
1796
if isinstance(files, basestring):
1121
1797
files = [files]
1123
inv = self.inventory
1125
# do this before any modifications
1802
unknown_nested_files=set()
1804
def recurse_directory_to_add_files(directory):
1805
# Recurse directory and add all files
1806
# so we can check if they have changed.
1807
for parent_info, file_infos in\
1808
osutils.walkdirs(self.abspath(directory),
1810
for relpath, basename, kind, lstat, abspath in file_infos:
1811
# Is it versioned or ignored?
1812
if self.path2id(relpath) or self.is_ignored(relpath):
1813
# Add nested content for deletion.
1814
new_files.add(relpath)
1816
# Files which are not versioned and not ignored
1817
# should be treated as unknown.
1818
unknown_nested_files.add((relpath, None, kind))
1820
for filename in files:
1821
# Get file name into canonical form.
1822
abspath = self.abspath(filename)
1823
filename = self.relpath(abspath)
1824
if len(filename) > 0:
1825
new_files.add(filename)
1826
if osutils.isdir(abspath):
1827
recurse_directory_to_add_files(filename)
1829
files = list(new_files)
1832
return # nothing to do
1834
# Sort needed to first handle directory content before the directory
1835
files.sort(reverse=True)
1837
# Bail out if we are going to delete files we shouldn't
1838
if not keep_files and not force:
1839
has_changed_files = len(unknown_nested_files) > 0
1840
if not has_changed_files:
1841
for (file_id, path, content_change, versioned, parent_id, name,
1842
kind, executable) in self._iter_changes(self.basis_tree(),
1843
include_unchanged=True, require_versioned=False,
1844
want_unversioned=True, specific_files=files):
1845
# Check if it's an unknown (but not ignored) OR
1846
# changed (but not deleted) :
1847
if not self.is_ignored(path[1]) and (
1848
versioned == (False, False) or
1849
content_change and kind[1] != None):
1850
has_changed_files = True
1853
if has_changed_files:
1854
# Make delta show ALL applicable changes in error message.
1855
tree_delta = self.changes_from(self.basis_tree(),
1856
require_versioned=False, want_unversioned=True,
1857
specific_files=files)
1858
for unknown_file in unknown_nested_files:
1859
if unknown_file not in tree_delta.unversioned:
1860
tree_delta.unversioned.extend((unknown_file,))
1861
raise errors.BzrRemoveChangedFilesError(tree_delta)
1863
# Build inv_delta and delete files where applicaple,
1864
# do this before any modifications to inventory.
1126
1865
for f in files:
1127
fid = inv.path2id(f)
1866
fid = self.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))
1142
self._write_inventory(inv)
1145
def revert(self, filenames, old_tree=None, backups=True,
1146
pb=DummyProgress()):
1147
from transform import revert
1148
from conflicts import resolve
1869
message = "%s is not versioned." % (f,)
1872
# having removed it, it must be either ignored or unknown
1873
if self.is_ignored(f):
1877
textui.show_status(new_status, self.kind(fid), f,
1880
inv_delta.append((f, None, fid, None))
1881
message = "removed %s" % (f,)
1884
abs_path = self.abspath(f)
1885
if osutils.lexists(abs_path):
1886
if (osutils.isdir(abs_path) and
1887
len(os.listdir(abs_path)) > 0):
1889
osutils.rmtree(abs_path)
1891
message = "%s is not an empty directory "\
1892
"and won't be deleted." % (f,)
1894
osutils.delete_any(abs_path)
1895
message = "deleted %s" % (f,)
1896
elif message is not None:
1897
# Only care if we haven't done anything yet.
1898
message = "%s does not exist." % (f,)
1900
# Print only one message (if any) per file.
1901
if message is not None:
1903
self.apply_inventory_delta(inv_delta)
1905
@needs_tree_write_lock
1906
def revert(self, filenames=None, old_tree=None, backups=True,
1907
pb=DummyProgress(), report_changes=False):
1908
from bzrlib.conflicts import resolve
1911
symbol_versioning.warn('Using [] to revert all files is deprecated'
1912
' as of bzr 0.91. Please use None (the default) instead.',
1913
DeprecationWarning, stacklevel=2)
1149
1914
if old_tree is None:
1150
1915
old_tree = self.basis_tree()
1151
conflicts = revert(self, old_tree, filenames, backups, pb)
1152
if not len(filenames):
1153
self.set_pending_merges([])
1916
conflicts = transform.revert(self, old_tree, filenames, backups, pb,
1918
if filenames is None:
1919
self.set_parent_ids(self.get_parent_ids()[:1])
1156
1922
resolve(self, filenames, ignore_misses=True)
1157
1923
return conflicts
1925
def revision_tree(self, revision_id):
1926
"""See Tree.revision_tree.
1928
WorkingTree can supply revision_trees for the basis revision only
1929
because there is only one cached inventory in the bzr directory.
1931
if revision_id == self.last_revision():
1933
xml = self.read_basis_inventory()
1934
except errors.NoSuchFile:
1938
inv = xml7.serializer_v7.read_inventory_from_string(xml)
1939
# dont use the repository revision_tree api because we want
1940
# to supply the inventory.
1941
if inv.revision_id == revision_id:
1942
return revisiontree.RevisionTree(self.branch.repository,
1944
except errors.BadInventoryFormat:
1946
# raise if there was no inventory, or if we read the wrong inventory.
1947
raise errors.NoSuchRevisionInTree(self, revision_id)
1159
1949
# XXX: This method should be deprecated in favour of taking in a proper
1160
1950
# new Inventory object.
1951
@needs_tree_write_lock
1162
1952
def set_inventory(self, new_inventory_list):
1163
1953
from bzrlib.inventory import (Inventory,
1164
1954
InventoryDirectory,
1204
2020
between multiple working trees, i.e. via shared storage, then we
1205
2021
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()
2023
raise NotImplementedError(self.unlock)
2025
def update(self, change_reporter=None):
1232
2026
"""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.
2028
This will update the branch if its bound too, which means we have
2029
multiple trees involved:
2031
- The new basis tree of the master.
2032
- The old basis tree of the branch.
2033
- The old basis tree of the working tree.
2034
- The current working tree state.
2036
Pathologically, all three may be different, and non-ancestors of each
2037
other. Conceptually we want to:
2039
- Preserve the wt.basis->wt.state changes
2040
- Transform the wt.basis to the new master basis.
2041
- Apply a merge of the old branch basis to get any 'local' changes from
2043
- Restore the wt.basis->wt.state changes.
1246
2045
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()
2046
- Merge current state -> basis tree of the master w.r.t. the old tree
2048
- Do a 'normal' merge of the old branch basis if it is relevant.
2050
if self.branch.get_master_branch() is not None:
2052
update_branch = True
2054
self.lock_tree_write()
2055
update_branch = False
2058
old_tip = self.branch.update()
2061
return self._update_tree(old_tip, change_reporter)
2065
@needs_tree_write_lock
2066
def _update_tree(self, old_tip=None, change_reporter=None):
2067
"""Update a tree to the master branch.
2069
:param old_tip: if supplied, the previous tip revision the branch,
2070
before it was changed to the master branch's tip.
2072
# here if old_tip is not None, it is the old tip of the branch before
2073
# it was updated from the master branch. This should become a pending
2074
# merge in the working tree to preserve the user existing work. we
2075
# cant set that until we update the working trees last revision to be
2076
# one from the new branch, because it will just get absorbed by the
2077
# parent de-duplication logic.
2079
# We MUST save it even if an error occurs, because otherwise the users
2080
# local work is unreferenced and will appear to have been lost.
2084
last_rev = self.get_parent_ids()[0]
2086
last_rev = _mod_revision.NULL_REVISION
2087
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2088
# merge tree state up to new branch tip.
2089
basis = self.basis_tree()
1259
2092
to_tree = self.branch.basis_tree()
1260
result += merge_inner(self.branch,
2093
if basis.inventory.root is None:
2094
self.set_root_id(to_tree.inventory.root.file_id)
2096
result += merge.merge_inner(
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()
2101
change_reporter=change_reporter)
2104
# TODO - dedup parents list with things merged by pull ?
2105
# reuse the tree we've updated to to set the basis:
2106
parent_trees = [(self.branch.last_revision(), to_tree)]
2107
merges = self.get_parent_ids()[1:]
2108
# Ideally we ask the tree for the trees here, that way the working
2109
# tree can decide whether to give us teh entire tree or give us a
2110
# lazy initialised tree. dirstate for instance will have the trees
2111
# in ram already, whereas a last-revision + basis-inventory tree
2112
# will not, but also does not need them when setting parents.
2113
for parent in merges:
2114
parent_trees.append(
2115
(parent, self.branch.repository.revision_tree(parent)))
2116
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2117
parent_trees.append(
2118
(old_tip, self.branch.repository.revision_tree(old_tip)))
2119
self.set_parent_trees(parent_trees)
2120
last_rev = parent_trees[0][0]
2122
# the working tree had the same last-revision as the master
2123
# branch did. We may still have pivot local work from the local
2124
# branch into old_tip:
2125
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2126
self.add_parent_tree_id(old_tip)
2127
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2128
and old_tip != last_rev):
2129
# our last revision was not the prior branch last revision
2130
# and we have converted that last revision to a pending merge.
2131
# base is somewhere between the branch tip now
2132
# and the now pending merge
2134
# Since we just modified the working tree and inventory, flush out
2135
# the current state, before we modify it again.
2136
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2137
# requires it only because TreeTransform directly munges the
2138
# inventory and calls tree._write_inventory(). Ultimately we
2139
# should be able to remove this extra flush.
2141
graph = self.branch.repository.get_graph()
2142
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2144
base_tree = self.branch.repository.revision_tree(base_rev_id)
2145
other_tree = self.branch.repository.revision_tree(old_tip)
2146
result += merge.merge_inner(
2151
change_reporter=change_reporter)
2154
def _write_hashcache_if_dirty(self):
2155
"""Write out the hashcache if it is dirty."""
2156
if self._hashcache.needs_write:
2158
self._hashcache.write()
2160
if e.errno not in (errno.EPERM, errno.EACCES):
2162
# TODO: jam 20061219 Should this be a warning? A single line
2163
# warning might be sufficient to let the user know what
2165
mutter('Could not write hashcache for %s\nError: %s',
2166
self._hashcache.cache_file_name(), e)
2168
@needs_tree_write_lock
1288
2169
def _write_inventory(self, inv):
1289
2170
"""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')
2171
self._set_inventory(inv, dirty=True)
1297
2174
def set_conflicts(self, arg):
1298
raise UnsupportedOperation(self.set_conflicts, self)
2175
raise errors.UnsupportedOperation(self.set_conflicts, self)
2177
def add_conflicts(self, arg):
2178
raise errors.UnsupportedOperation(self.add_conflicts, self)
1300
2180
@needs_read_lock
1301
2181
def conflicts(self):
1302
conflicts = ConflictList()
2182
conflicts = _mod_conflicts.ConflictList()
1303
2183
for conflicted in self._iter_conflicts():
1306
2186
if file_kind(self.abspath(conflicted)) != "file":
1309
if e.errno == errno.ENOENT:
2188
except errors.NoSuchFile:
1313
2190
if text is True:
1314
2191
for suffix in ('.THIS', '.OTHER'):
1316
2193
kind = file_kind(self.abspath(conflicted+suffix))
1318
if e.errno == errno.ENOENT:
2196
except errors.NoSuchFile:
1326
2200
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1327
conflicts.append(Conflict.factory(ctype, path=conflicted,
2201
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1328
2203
file_id=self.path2id(conflicted)))
1329
2204
return conflicts
2206
def walkdirs(self, prefix=""):
2207
"""Walk the directories of this tree.
2209
returns a generator which yields items in the form:
2210
((curren_directory_path, fileid),
2211
[(file1_path, file1_name, file1_kind, (lstat), file1_id,
2214
This API returns a generator, which is only valid during the current
2215
tree transaction - within a single lock_read or lock_write duration.
2217
If the tree is not locked, it may cause an error to be raised,
2218
depending on the tree implementation.
2220
disk_top = self.abspath(prefix)
2221
if disk_top.endswith('/'):
2222
disk_top = disk_top[:-1]
2223
top_strip_len = len(disk_top) + 1
2224
inventory_iterator = self._walkdirs(prefix)
2225
disk_iterator = osutils.walkdirs(disk_top, prefix)
2227
current_disk = disk_iterator.next()
2228
disk_finished = False
2230
if not (e.errno == errno.ENOENT or
2231
(sys.platform == 'win32' and e.errno == ERROR_PATH_NOT_FOUND)):
2234
disk_finished = True
2236
current_inv = inventory_iterator.next()
2237
inv_finished = False
2238
except StopIteration:
2241
while not inv_finished or not disk_finished:
2242
if not disk_finished:
2243
# strip out .bzr dirs
2244
if current_disk[0][1][top_strip_len:] == '':
2245
# osutils.walkdirs can be made nicer -
2246
# yield the path-from-prefix rather than the pathjoined
2248
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2249
if current_disk[1][bzrdir_loc][0] == '.bzr':
2250
# we dont yield the contents of, or, .bzr itself.
2251
del current_disk[1][bzrdir_loc]
2253
# everything is unknown
2256
# everything is missing
2259
direction = cmp(current_inv[0][0], current_disk[0][0])
2261
# disk is before inventory - unknown
2262
dirblock = [(relpath, basename, kind, stat, None, None) for
2263
relpath, basename, kind, stat, top_path in current_disk[1]]
2264
yield (current_disk[0][0], None), dirblock
2266
current_disk = disk_iterator.next()
2267
except StopIteration:
2268
disk_finished = True
2270
# inventory is before disk - missing.
2271
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2272
for relpath, basename, dkind, stat, fileid, kind in
2274
yield (current_inv[0][0], current_inv[0][1]), dirblock
2276
current_inv = inventory_iterator.next()
2277
except StopIteration:
2280
# versioned present directory
2281
# merge the inventory and disk data together
2283
for relpath, subiterator in itertools.groupby(sorted(
2284
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2285
path_elements = list(subiterator)
2286
if len(path_elements) == 2:
2287
inv_row, disk_row = path_elements
2288
# versioned, present file
2289
dirblock.append((inv_row[0],
2290
inv_row[1], disk_row[2],
2291
disk_row[3], inv_row[4],
2293
elif len(path_elements[0]) == 5:
2295
dirblock.append((path_elements[0][0],
2296
path_elements[0][1], path_elements[0][2],
2297
path_elements[0][3], None, None))
2298
elif len(path_elements[0]) == 6:
2299
# versioned, absent file.
2300
dirblock.append((path_elements[0][0],
2301
path_elements[0][1], 'unknown', None,
2302
path_elements[0][4], path_elements[0][5]))
2304
raise NotImplementedError('unreachable code')
2305
yield current_inv[0], dirblock
2307
current_inv = inventory_iterator.next()
2308
except StopIteration:
2311
current_disk = disk_iterator.next()
2312
except StopIteration:
2313
disk_finished = True
2315
def _walkdirs(self, prefix=""):
2316
"""Walk the directories of this tree.
2318
:prefix: is used as the directrory to start with.
2319
returns a generator which yields items in the form:
2320
((curren_directory_path, fileid),
2321
[(file1_path, file1_name, file1_kind, None, file1_id,
2324
_directory = 'directory'
2325
# get the root in the inventory
2326
inv = self.inventory
2327
top_id = inv.path2id(prefix)
2331
pending = [(prefix, '', _directory, None, top_id, None)]
2334
currentdir = pending.pop()
2335
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2336
top_id = currentdir[4]
2338
relroot = currentdir[0] + '/'
2341
# FIXME: stash the node in pending
2343
for name, child in entry.sorted_children():
2344
dirblock.append((relroot + name, name, child.kind, None,
2345
child.file_id, child.kind
2347
yield (currentdir[0], entry.file_id), dirblock
2348
# push the user specified dirs from dirblock
2349
for dir in reversed(dirblock):
2350
if dir[2] == _directory:
2353
@needs_tree_write_lock
2354
def auto_resolve(self):
2355
"""Automatically resolve text conflicts according to contents.
2357
Only text conflicts are auto_resolvable. Files with no conflict markers
2358
are considered 'resolved', because bzr always puts conflict markers
2359
into files that have text conflicts. The corresponding .THIS .BASE and
2360
.OTHER files are deleted, as per 'resolve'.
2361
:return: a tuple of ConflictLists: (un_resolved, resolved).
2363
un_resolved = _mod_conflicts.ConflictList()
2364
resolved = _mod_conflicts.ConflictList()
2365
conflict_re = re.compile('^(<{7}|={7}|>{7})')
2366
for conflict in self.conflicts():
2367
if (conflict.typestring != 'text conflict' or
2368
self.kind(conflict.file_id) != 'file'):
2369
un_resolved.append(conflict)
2371
my_file = open(self.id2abspath(conflict.file_id), 'rb')
2373
for line in my_file:
2374
if conflict_re.search(line):
2375
un_resolved.append(conflict)
2378
resolved.append(conflict)
2381
resolved.remove_files(self)
2382
self.set_conflicts(un_resolved)
2383
return un_resolved, resolved
2385
def _validate(self):
2386
"""Validate internal structures.
2388
This is meant mostly for the test suite. To give it a chance to detect
2389
corruption after actions have occurred. The default implementation is a
2392
:return: None. An exception should be raised if there is an error.
2397
class WorkingTree2(WorkingTree):
2398
"""This is the Format 2 working tree.
2400
This was the first weave based working tree.
2401
- uses os locks for locking.
2402
- uses the branch last-revision.
2405
def __init__(self, *args, **kwargs):
2406
super(WorkingTree2, self).__init__(*args, **kwargs)
2407
# WorkingTree2 has more of a constraint that self._inventory must
2408
# exist. Because this is an older format, we don't mind the overhead
2409
# caused by the extra computation here.
2411
# Newer WorkingTree's should only have self._inventory set when they
2413
if self._inventory is None:
2414
self.read_working_inventory()
2416
def lock_tree_write(self):
2417
"""See WorkingTree.lock_tree_write().
2419
In Format2 WorkingTrees we have a single lock for the branch and tree
2420
so lock_tree_write() degrades to lock_write().
2422
self.branch.lock_write()
2424
return self._control_files.lock_write()
2426
self.branch.unlock()
2430
# do non-implementation specific cleanup
2433
# we share control files:
2434
if self._control_files._lock_count == 3:
2435
# _inventory_is_modified is always False during a read lock.
2436
if self._inventory_is_modified:
2438
self._write_hashcache_if_dirty()
2440
# reverse order of locking.
2442
return self._control_files.unlock()
2444
self.branch.unlock()
1332
2447
class WorkingTree3(WorkingTree):
1333
2448
"""This is the Format 3 working tree.