29
29
WorkingTree.open(dir).
33
# FIXME: I don't know if writing out the cache from the destructor is really a
34
# good idea, because destructors are considered poor taste in Python, and it's
35
# not predictable when it will be written out.
32
37
# TODO: Give the workingtree sole responsibility for the working inventory;
33
38
# remove the variable and references to it from the branch. This may require
34
39
# updating the commit code so as to update the inventory within the working
35
40
# copy, and making sure there's only one WorkingTree for any directory on disk.
36
# At the moment they may alias the inventory and have old copies of it in
37
# memory. (Now done? -- mbp 20060309)
41
# At the momenthey may alias the inventory and have old copies of it in memory.
43
from copy import deepcopy
39
44
from cStringIO import StringIO
42
from bzrlib.lazy_import import lazy_import
43
lazy_import(globals(), """
44
from bisect import bisect_left
46
from copy import deepcopy
57
conflicts as _mod_conflicts,
51
from bzrlib.atomicfile import AtomicFile
52
from bzrlib.branch import (Branch,
54
import bzrlib.bzrdir as bzrdir
55
from bzrlib.decorators import needs_read_lock, needs_write_lock
56
import bzrlib.errors as errors
57
from bzrlib.errors import (BzrCheckError,
60
WeaveRevisionNotPresent,
64
from bzrlib.inventory import InventoryEntry, Inventory
65
from bzrlib.lockable_files import LockableFiles
66
from bzrlib.merge import merge_inner, transform_tree
67
from bzrlib.osutils import (appendpath,
84
from bzrlib.progress import DummyProgress
85
from bzrlib.revision import NULL_REVISION
86
from bzrlib.symbol_versioning import *
87
from bzrlib.textui import show_status
89
from bzrlib.trace import mutter
90
from bzrlib.transform import build_tree
74
91
from bzrlib.transport import get_transport
92
from bzrlib.transport.local import LocalTransport
76
from bzrlib.workingtree_4 import WorkingTreeFormat4
79
from bzrlib import symbol_versioning
80
from bzrlib.decorators import needs_read_lock, needs_write_lock
81
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID
82
from bzrlib.lockable_files import LockableFiles, TransportLock
83
from bzrlib.lockdir import LockDir
84
import bzrlib.mutabletree
85
from bzrlib.mutabletree import needs_tree_write_lock
86
from bzrlib.osutils import (
98
from bzrlib.trace import mutter, note
99
from bzrlib.transport.local import LocalTransport
100
from bzrlib.progress import DummyProgress, ProgressPhase
101
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
102
from bzrlib.rio import RioReader, rio_file, Stanza
103
from bzrlib.symbol_versioning import (deprecated_passed,
106
DEPRECATED_PARAMETER,
113
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
114
CONFLICT_HEADER_1 = "BZR conflict list format 1"
117
@deprecated_function(zero_thirteen)
118
97
def gen_file_id(name):
119
"""Return new file id for the basename 'name'.
121
Use bzrlib.generate_ids.gen_file_id() instead
123
return generate_ids.gen_file_id(name)
126
@deprecated_function(zero_thirteen)
98
"""Return new file id.
100
This should probably generate proper UUIDs, but for the moment we
101
cope with just randomness because running uuidgen every time is
104
from binascii import hexlify
105
from time import time
108
idx = name.rfind('/')
110
name = name[idx+1 : ]
111
idx = name.rfind('\\')
113
name = name[idx+1 : ]
115
# make it not a hidden file
116
name = name.lstrip('.')
118
# remove any wierd characters; we don't escape them but rather
120
name = re.sub(r'[^\w.]', '', name)
122
s = hexlify(rand_bytes(8))
123
return '-'.join((name, compact_date(time()), s))
127
126
def gen_root_id():
128
"""Return a new tree-root file id.
130
This has been deprecated in favor of bzrlib.generate_ids.gen_root_id()
132
return generate_ids.gen_root_id()
127
"""Return a new tree-root file id."""
128
return gen_file_id('TREE_ROOT')
135
131
class TreeEntry(object):
136
"""An entry that implements the minimum interface used by commands.
132
"""An entry that implements the minium interface used by commands.
138
134
This needs further inspection, it may be better to have
139
135
InventoryEntries without ids - though that seems wrong. For now,
215
211
self.bzrdir = _bzrdir
216
212
if not _internal:
217
213
# not created via open etc.
218
warnings.warn("WorkingTree() is deprecated as of bzr version 0.8. "
214
warn("WorkingTree() is deprecated as of bzr version 0.8. "
219
215
"Please use bzrdir.open_workingtree or WorkingTree.open().",
220
216
DeprecationWarning,
222
218
wt = WorkingTree.open(basedir)
223
self._branch = wt.branch
219
self.branch = wt.branch
224
220
self.basedir = wt.basedir
225
221
self._control_files = wt._control_files
226
222
self._hashcache = wt._hashcache
227
self._set_inventory(wt._inventory, dirty=False)
223
self._set_inventory(wt._inventory)
228
224
self._format = wt._format
229
225
self.bzrdir = wt.bzrdir
226
from bzrlib.hashcache import HashCache
227
from bzrlib.trace import note, mutter
230
228
assert isinstance(basedir, basestring), \
231
229
"base directory %r is not a string" % basedir
232
230
basedir = safe_unicode(basedir)
233
231
mutter("opening working tree %r", basedir)
234
232
if deprecated_passed(branch):
235
233
if not _internal:
236
warnings.warn("WorkingTree(..., branch=XXX) is deprecated"
237
" as of bzr 0.8. Please use bzrdir.open_workingtree() or"
238
" WorkingTree.open().",
234
warn("WorkingTree(..., branch=XXX) is deprecated as of bzr 0.8."
235
" Please use bzrdir.open_workingtree() or WorkingTree.open().",
239
236
DeprecationWarning,
242
self._branch = branch
244
self._branch = self.bzrdir.open_branch()
241
self.branch = self.bzrdir.open_branch()
242
assert isinstance(self.branch, Branch), \
243
"branch %r is not a Branch" % self.branch
245
244
self.basedir = realpath(basedir)
246
245
# if branch is at our basedir and is a format 6 or less
247
246
if isinstance(self._format, WorkingTreeFormat2):
248
247
# share control object
249
248
self._control_files = self.branch.control_files
249
elif _control_files is not None:
250
assert False, "not done yet"
251
# self._control_files = _control_files
251
# assume all other formats have their own control files.
252
assert isinstance(_control_files, LockableFiles), \
253
"_control_files must be a LockableFiles, not %r" \
255
self._control_files = _control_files
253
# only ready for format 3
254
assert isinstance(self._format, WorkingTreeFormat3)
255
self._control_files = LockableFiles(
256
self.bzrdir.get_workingtree_transport(None),
256
259
# update the whole cache up front and write to disk if anything changed;
257
260
# in the future we might want to do this more selectively
258
261
# two possible ways offer themselves : in self._unlock, write the cache
259
262
# if needed, or, when the cache sees a change, append it to the hash
260
263
# cache file, and have the parser take the most recent entry for a
261
264
# given path only.
262
wt_trans = self.bzrdir.get_workingtree_transport(None)
263
cache_filename = wt_trans.local_abspath('stat-cache')
264
self._hashcache = hashcache.HashCache(basedir, cache_filename,
265
self._control_files._file_mode)
265
cache_filename = self.bzrdir.get_workingtree_transport(None).abspath('stat-cache')
266
hc = self._hashcache = HashCache(basedir, cache_filename, self._control_files._file_mode)
268
268
# is this scan needed ? it makes things kinda slow.
271
271
if hc.needs_write:
272
272
mutter("write hc")
275
275
if _inventory is None:
276
self._inventory_is_modified = False
277
self.read_working_inventory()
276
self._set_inventory(self.read_working_inventory())
279
# the caller of __init__ has provided an inventory,
280
# we assume they know what they are doing - as its only
281
# the Format factory and creation methods that are
282
# permitted to do this.
283
self._set_inventory(_inventory, dirty=False)
286
fget=lambda self: self._branch,
287
doc="""The branch this WorkingTree is connected to.
289
This cannot be set - it is reflective of the actual disk structure
290
the working tree has been constructed from.
293
def break_lock(self):
294
"""Break a lock if one is present from another instance.
296
Uses the ui factory to ask for confirmation if the lock may be from
299
This will probe the repository for its lock as well.
301
self._control_files.break_lock()
302
self.branch.break_lock()
304
def _set_inventory(self, inv, dirty):
305
"""Set the internal cached inventory.
307
:param inv: The inventory to set.
308
:param dirty: A boolean indicating whether the inventory is the same
309
logical inventory as whats on disk. If True the inventory is not
310
the same and should be written to disk or data will be lost, if
311
False then the inventory is the same as that on disk and any
312
serialisation would be unneeded overhead.
314
assert inv.root is not None
278
self._set_inventory(_inventory)
280
def _set_inventory(self, inv):
315
281
self._inventory = inv
316
self._inventory_is_modified = dirty
282
self.path2id = self._inventory.path2id
284
def is_control_filename(self, filename):
285
"""True if filename is the name of a control file in this tree.
287
This is true IF and ONLY IF the filename is part of the meta data
288
that bzr controls in this tree. I.E. a random .bzr directory placed
289
on disk will not be a control file for this tree.
292
self.bzrdir.transport.relpath(self.abspath(filename))
294
except errors.PathNotChild:
319
298
def open(path=None, _unsupported=False):
583
481
__contains__ = has_id
585
483
def get_file_size(self, file_id):
586
file_id = osutils.safe_file_id(file_id)
587
484
return os.path.getsize(self.id2abspath(file_id))
590
def get_file_sha1(self, file_id, path=None, stat_value=None):
591
file_id = osutils.safe_file_id(file_id)
487
def get_file_sha1(self, file_id):
488
path = self._inventory.id2path(file_id)
489
return self._hashcache.get_sha1(path)
491
def is_executable(self, file_id):
492
if not supports_executable():
493
return self._inventory[file_id].executable
593
495
path = self._inventory.id2path(file_id)
594
return self._hashcache.get_sha1(path, stat_value)
596
def get_file_mtime(self, file_id, path=None):
597
file_id = osutils.safe_file_id(file_id)
599
path = self.inventory.id2path(file_id)
600
return os.lstat(self.abspath(path)).st_mtime
602
if not supports_executable():
603
def is_executable(self, file_id, path=None):
604
file_id = osutils.safe_file_id(file_id)
605
return self._inventory[file_id].executable
607
def is_executable(self, file_id, path=None):
609
file_id = osutils.safe_file_id(file_id)
610
path = self.id2path(file_id)
611
496
mode = os.lstat(self.abspath(path)).st_mode
612
return bool(stat.S_ISREG(mode) and stat.S_IEXEC & mode)
497
return bool(stat.S_ISREG(mode) and stat.S_IEXEC&mode)
614
499
@needs_write_lock
615
def _add(self, files, ids, kinds):
616
"""See MutableTree._add."""
500
def add(self, files, ids=None):
501
"""Make files versioned.
503
Note that the command line normally calls smart_add instead,
504
which can automatically recurse.
506
This adds the files to the inventory, so that they will be
507
recorded by the next commit.
510
List of paths to add, relative to the base of the tree.
513
If set, use these instead of automatically generated ids.
514
Must be the same length as the list of files, but may
515
contain None for ids that are to be autogenerated.
517
TODO: Perhaps have an option to add the ids even if the files do
520
TODO: Perhaps callback with the ids and paths as they're added.
617
522
# TODO: Re-adding a file that is removed in the working copy
618
523
# should probably put it back with the previous ID.
619
# the read and write working inventory should not occur in this
620
# function - they should be part of lock_write and unlock.
524
if isinstance(files, basestring):
525
assert(ids is None or isinstance(ids, basestring))
531
ids = [None] * len(files)
533
assert(len(ids) == len(files))
621
535
inv = self.read_working_inventory()
622
for f, file_id, kind in zip(files, ids, kinds):
623
assert kind is not None
536
for f,file_id in zip(files, ids):
537
if self.is_control_filename(f):
538
raise BzrError("cannot add control file %s" % quotefn(f))
543
raise BzrError("cannot add top-level %r" % f)
545
fullpath = normpath(self.abspath(f))
548
kind = file_kind(fullpath)
550
if e.errno == errno.ENOENT:
551
raise NoSuchFile(fullpath)
552
# maybe something better?
553
raise BzrError('cannot add: not a regular file, symlink or directory: %s' % quotefn(f))
555
if not InventoryEntry.versionable_kind(kind):
556
raise BzrError('cannot add: not a versionable file ('
557
'i.e. regular file, symlink or directory): %s' % quotefn(f))
624
559
if file_id is None:
625
inv.add_path(f, kind=kind)
627
file_id = osutils.safe_file_id(file_id)
628
inv.add_path(f, kind=kind, file_id=file_id)
560
file_id = gen_file_id(f)
561
inv.add_path(f, kind=kind, file_id=file_id)
563
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
629
564
self._write_inventory(inv)
631
@needs_tree_write_lock
632
def _gather_kinds(self, files, kinds):
633
"""See MutableTree._gather_kinds."""
634
for pos, f in enumerate(files):
635
if kinds[pos] is None:
636
fullpath = normpath(self.abspath(f))
638
kinds[pos] = file_kind(fullpath)
640
if e.errno == errno.ENOENT:
641
raise errors.NoSuchFile(fullpath)
643
566
@needs_write_lock
644
def add_parent_tree_id(self, revision_id, allow_leftmost_as_ghost=False):
645
"""Add revision_id as a parent.
647
This is equivalent to retrieving the current list of parent ids
648
and setting the list to its value plus revision_id.
650
:param revision_id: The revision id to add to the parent list. It may
651
be a ghost revision as long as its not the first parent to be added,
652
or the allow_leftmost_as_ghost parameter is set True.
653
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
655
parents = self.get_parent_ids() + [revision_id]
656
self.set_parent_ids(parents, allow_leftmost_as_ghost=len(parents) > 1
657
or allow_leftmost_as_ghost)
659
@needs_tree_write_lock
660
def add_parent_tree(self, parent_tuple, allow_leftmost_as_ghost=False):
661
"""Add revision_id, tree tuple as a parent.
663
This is equivalent to retrieving the current list of parent trees
664
and setting the list to its value plus parent_tuple. See also
665
add_parent_tree_id - if you only have a parent id available it will be
666
simpler to use that api. If you have the parent already available, using
667
this api is preferred.
669
:param parent_tuple: The (revision id, tree) to add to the parent list.
670
If the revision_id is a ghost, pass None for the tree.
671
:param allow_leftmost_as_ghost: Allow the first parent to be a ghost.
673
parent_ids = self.get_parent_ids() + [parent_tuple[0]]
674
if len(parent_ids) > 1:
675
# the leftmost may have already been a ghost, preserve that if it
677
allow_leftmost_as_ghost = True
678
self.set_parent_ids(parent_ids,
679
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
681
@needs_tree_write_lock
682
567
def add_pending_merge(self, *revision_ids):
683
568
# TODO: Perhaps should check at this point that the
684
569
# history of the revision is actually present?
685
parents = self.get_parent_ids()
570
p = self.pending_merges()
687
572
for rev_id in revision_ids:
688
if rev_id in parents:
690
parents.append(rev_id)
693
self.set_parent_ids(parents, allow_leftmost_as_ghost=True)
578
self.set_pending_merges(p)
695
@deprecated_method(zero_eleven)
697
581
def pending_merges(self):
698
582
"""Return a list of pending merges.
700
584
These are revisions that have been merged into the working
701
585
directory but not yet committed.
703
As of 0.11 this is deprecated. Please see WorkingTree.get_parent_ids()
704
instead - which is available on all tree objects.
706
return self.get_parent_ids()[1:]
708
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
709
"""Common ghost checking functionality from set_parent_*.
711
This checks that the left hand-parent exists if there are any
714
if len(revision_ids) > 0:
715
leftmost_id = revision_ids[0]
716
if (not allow_leftmost_as_ghost and not
717
self.branch.repository.has_revision(leftmost_id)):
718
raise errors.GhostRevisionUnusableHere(leftmost_id)
720
def _set_merges_from_parent_ids(self, parent_ids):
721
merges = parent_ids[1:]
722
self._control_files.put_bytes('pending-merges', '\n'.join(merges))
724
@needs_tree_write_lock
725
def set_parent_ids(self, revision_ids, allow_leftmost_as_ghost=False):
726
"""Set the parent ids to revision_ids.
728
See also set_parent_trees. This api will try to retrieve the tree data
729
for each element of revision_ids from the trees repository. If you have
730
tree data already available, it is more efficient to use
731
set_parent_trees rather than set_parent_ids. set_parent_ids is however
732
an easier API to use.
734
:param revision_ids: The revision_ids to set as the parent ids of this
735
working tree. Any of these may be ghosts.
737
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
738
self._check_parents_for_ghosts(revision_ids,
739
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
741
if len(revision_ids) > 0:
742
self.set_last_revision(revision_ids[0])
744
self.set_last_revision(None)
746
self._set_merges_from_parent_ids(revision_ids)
748
@needs_tree_write_lock
749
def set_parent_trees(self, parents_list, allow_leftmost_as_ghost=False):
750
"""See MutableTree.set_parent_trees."""
751
parent_ids = [osutils.safe_revision_id(rev) for (rev, tree) in parents_list]
753
self._check_parents_for_ghosts(parent_ids,
754
allow_leftmost_as_ghost=allow_leftmost_as_ghost)
756
if len(parent_ids) == 0:
757
leftmost_parent_id = None
758
leftmost_parent_tree = None
760
leftmost_parent_id, leftmost_parent_tree = parents_list[0]
762
if self._change_last_revision(leftmost_parent_id):
763
if leftmost_parent_tree is None:
764
# If we don't have a tree, fall back to reading the
765
# parent tree from the repository.
766
self._cache_basis_inventory(leftmost_parent_id)
768
inv = leftmost_parent_tree.inventory
769
xml = self._create_basis_xml_from_inventory(
770
leftmost_parent_id, inv)
771
self._write_basis_inventory(xml)
772
self._set_merges_from_parent_ids(parent_ids)
774
@needs_tree_write_lock
588
merges_file = self._control_files.get_utf8('pending-merges')
590
if e.errno != errno.ENOENT:
594
for l in merges_file.readlines():
595
p.append(l.rstrip('\n'))
775
599
def set_pending_merges(self, rev_list):
776
parents = self.get_parent_ids()
777
leftmost = parents[:1]
778
new_parents = leftmost + rev_list
779
self.set_parent_ids(new_parents)
781
@needs_tree_write_lock
782
def set_merge_modified(self, modified_hashes):
784
for file_id, hash in modified_hashes.iteritems():
785
yield Stanza(file_id=file_id.decode('utf8'), hash=hash)
786
self._put_rio('merge-hashes', iter_stanzas(), MERGE_MODIFIED_HEADER_1)
788
@needs_tree_write_lock
789
def _put_rio(self, filename, stanzas, header):
790
my_file = rio_file(stanzas, header)
791
self._control_files.put(filename, my_file)
793
@needs_write_lock # because merge pulls data into the branch.
794
def merge_from_branch(self, branch, to_revision=None):
795
"""Merge from a branch into this working tree.
797
:param branch: The branch to merge from.
798
:param to_revision: If non-None, the merge will merge to to_revision,
799
but not beyond it. to_revision does not need to be in the history
800
of the branch when it is supplied. If None, to_revision defaults to
801
branch.last_revision().
803
from bzrlib.merge import Merger, Merge3Merger
804
pb = bzrlib.ui.ui_factory.nested_progress_bar()
806
merger = Merger(self.branch, this_tree=self, pb=pb)
807
merger.pp = ProgressPhase("Merge phase", 5, pb)
808
merger.pp.next_phase()
809
# check that there are no
811
merger.check_basis(check_clean=True, require_commits=False)
812
if to_revision is None:
813
to_revision = branch.last_revision()
815
to_revision = osutils.safe_revision_id(to_revision)
816
merger.other_rev_id = to_revision
817
if merger.other_rev_id is None:
818
raise error.NoCommits(branch)
819
self.branch.fetch(branch, last_revision=merger.other_rev_id)
820
merger.other_basis = merger.other_rev_id
821
merger.other_tree = self.branch.repository.revision_tree(
823
merger.pp.next_phase()
825
if merger.base_rev_id == merger.other_rev_id:
826
raise errors.PointlessMerge
827
merger.backup_files = False
828
merger.merge_type = Merge3Merger
829
merger.set_interesting_files(None)
830
merger.show_base = False
831
merger.reprocess = False
832
conflicts = merger.do_merge()
839
def merge_modified(self):
841
hashfile = self._control_files.get('merge-hashes')
842
except errors.NoSuchFile:
846
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
847
raise errors.MergeModifiedFormatError()
848
except StopIteration:
849
raise errors.MergeModifiedFormatError()
850
for s in RioReader(hashfile):
851
file_id = s.get("file_id")
852
if file_id not in self.inventory:
855
if hash == self.get_file_sha1(file_id):
856
merge_hashes[file_id] = hash
860
def mkdir(self, path, file_id=None):
861
"""See MutableTree.mkdir()."""
863
file_id = generate_ids.gen_file_id(os.path.basename(path))
864
os.mkdir(self.abspath(path))
865
self.add(path, file_id, 'directory')
600
self._control_files.put_utf8('pending-merges', '\n'.join(rev_list))
868
602
def get_symlink_target(self, file_id):
869
603
return os.readlink(self.id2abspath(file_id))
898
621
Skips the control directory.
900
# list_files is an iterator, so @needs_read_lock doesn't work properly
901
# with it. So callers should be careful to always read_lock the tree.
902
if not self.is_locked():
903
raise errors.ObjectNotLocked(self)
906
if include_root is True:
907
yield ('', 'V', 'directory', inv.root.file_id, inv.root)
908
# Convert these into local objects to save lookup times
909
pathjoin = osutils.pathjoin
910
file_kind = osutils.file_kind
912
# transport.base ends in a slash, we want the piece
913
# between the last two slashes
914
transport_base_dir = self.bzrdir.transport.base.rsplit('/', 2)[1]
916
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
918
# directory file_id, relative path, absolute path, reverse sorted children
919
children = os.listdir(self.basedir)
921
# jam 20060527 The kernel sized tree seems equivalent whether we
922
# use a deque and popleft to keep them sorted, or if we use a plain
923
# list and just reverse() them.
924
children = collections.deque(children)
925
stack = [(inv.root.file_id, u'', self.basedir, children)]
927
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
930
f = children.popleft()
623
inv = self._inventory
625
def descend(from_dir_relpath, from_dir_id, dp):
931
629
## TODO: If we find a subdirectory with its own .bzr
932
630
## directory, then that is a separate tree and we
933
631
## should exclude it.
935
633
# the bzrdir for this tree
936
if transport_base_dir == f:
634
if self.bzrdir.transport.base.endswith(f + '/'):
939
# we know that from_dir_relpath and from_dir_abspath never end in a slash
940
# and 'f' doesn't begin with one, we can do a string op, rather
941
# than the checks of pathjoin(), all relative paths will have an extra slash
943
fp = from_dir_relpath + '/' + f
638
fp = appendpath(from_dir_relpath, f)
946
fap = from_dir_abspath + '/' + f
641
fap = appendpath(dp, f)
948
643
f_ie = inv.get_child(from_dir_id, f)
951
elif self.is_ignored(fp[1:]):
646
elif self.is_ignored(fp):
954
# we may not have found this file, because of a unicode issue
955
f_norm, can_access = osutils.normalized_filename(f)
956
if f == f_norm or not can_access:
957
# No change, so treat this file normally
960
# this file can be accessed by a normalized path
961
# check again if it is versioned
962
# these lines are repeated here for performance
964
fp = from_dir_relpath + '/' + f
965
fap = from_dir_abspath + '/' + f
966
f_ie = inv.get_child(from_dir_id, f)
969
elif self.is_ignored(fp[1:]):
974
651
fk = file_kind(fap)
977
654
if f_ie.kind != fk:
978
raise errors.BzrCheckError(
979
"file %r entered as kind %r id %r, now of kind %r"
980
% (fap, f_ie.kind, f_ie.file_id, fk))
655
raise BzrCheckError("file %r entered as kind %r id %r, "
657
% (fap, f_ie.kind, f_ie.file_id, fk))
982
659
# make a last minute entry
984
yield fp[1:], c, fk, f_ie.file_id, f_ie
987
yield fp[1:], c, fk, None, fk_entries[fk]()
989
yield fp[1:], c, fk, None, TreeEntry()
663
if fk == 'directory':
664
entry = TreeDirectory()
667
elif fk == 'symlink':
672
yield fp, c, fk, (f_ie and f_ie.file_id), entry
992
674
if fk != 'directory':
995
# But do this child first
996
new_children = os.listdir(fap)
998
new_children = collections.deque(new_children)
999
stack.append((f_ie.file_id, fp, fap, new_children))
1000
# Break out of inner loop,
1001
# so that we start outer loop with child
1004
# if we finished all children, pop it off the stack
1007
@needs_tree_write_lock
1008
def move(self, from_paths, to_dir=None, after=False, **kwargs):
678
# don't descend unversioned directories
681
for ff in descend(fp, f_ie.file_id, fap):
684
for f in descend(u'', inv.root.file_id, self.basedir):
688
def move(self, from_paths, to_name):
1009
689
"""Rename files.
1011
to_dir must exist in the inventory.
691
to_name must exist in the inventory.
1013
If to_dir exists and is a directory, the files are moved into
693
If to_name exists and is a directory, the files are moved into
1014
694
it, keeping their old names.
1016
Note that to_dir is only the last component of the new name;
696
Note that to_name is only the last component of the new name;
1017
697
this doesn't change the directory.
1019
For each entry in from_paths the move mode will be determined
1022
The first mode moves the file in the filesystem and updates the
1023
inventory. The second mode only updates the inventory without
1024
touching the file on the filesystem. This is the new mode introduced
1027
move uses the second mode if 'after == True' and the target is not
1028
versioned but present in the working tree.
1030
move uses the second mode if 'after == False' and the source is
1031
versioned but no longer in the working tree, and the target is not
1032
versioned but present in the working tree.
1034
move uses the first mode if 'after == False' and the source is
1035
versioned and present in the working tree, and the target is not
1036
versioned and not present in the working tree.
1038
Everything else results in an error.
1040
699
This returns a list of (from_path, to_path) pairs for each
1041
700
entry that is moved.
1046
# check for deprecated use of signature
1048
to_dir = kwargs.get('to_name', None)
1050
raise TypeError('You must supply a target directory')
1052
symbol_versioning.warn('The parameter to_name was deprecated'
1053
' in version 0.13. Use to_dir instead',
1056
# check destination directory
703
## TODO: Option to move IDs only
1057
704
assert not isinstance(from_paths, basestring)
1058
705
inv = self.inventory
1059
to_abs = self.abspath(to_dir)
706
to_abs = self.abspath(to_name)
1060
707
if not isdir(to_abs):
1061
raise errors.BzrMoveFailedError('',to_dir,
1062
errors.NotADirectory(to_abs))
1063
if not self.has_filename(to_dir):
1064
raise errors.BzrMoveFailedError('',to_dir,
1065
errors.NotInWorkingDirectory(to_dir))
1066
to_dir_id = inv.path2id(to_dir)
1067
if to_dir_id is None:
1068
raise errors.BzrMoveFailedError('',to_dir,
1069
errors.NotVersionedError(path=str(to_dir)))
708
raise BzrError("destination %r is not a directory" % to_abs)
709
if not self.has_filename(to_name):
710
raise BzrError("destination %r not in working directory" % to_abs)
711
to_dir_id = inv.path2id(to_name)
712
if to_dir_id == None and to_name != '':
713
raise BzrError("destination %r is not a versioned directory" % to_name)
1071
714
to_dir_ie = inv[to_dir_id]
1072
if to_dir_ie.kind != 'directory':
1073
raise errors.BzrMoveFailedError('',to_dir,
1074
errors.NotADirectory(to_abs))
1076
# create rename entries and tuples
1077
for from_rel in from_paths:
1078
from_tail = splitpath(from_rel)[-1]
1079
from_id = inv.path2id(from_rel)
1081
raise errors.BzrMoveFailedError(from_rel,to_dir,
1082
errors.NotVersionedError(path=str(from_rel)))
1084
from_entry = inv[from_id]
1085
from_parent_id = from_entry.parent_id
1086
to_rel = pathjoin(to_dir, from_tail)
1087
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1089
from_tail=from_tail,
1090
from_parent_id=from_parent_id,
1091
to_rel=to_rel, to_tail=from_tail,
1092
to_parent_id=to_dir_id)
1093
rename_entries.append(rename_entry)
1094
rename_tuples.append((from_rel, to_rel))
1096
# determine which move mode to use. checks also for movability
1097
rename_entries = self._determine_mv_mode(rename_entries, after)
1099
original_modified = self._inventory_is_modified
715
if to_dir_ie.kind not in ('directory', 'root_directory'):
716
raise BzrError("destination %r is not a directory" % to_abs)
718
to_idpath = inv.get_idpath(to_dir_id)
721
if not self.has_filename(f):
722
raise BzrError("%r does not exist in working tree" % f)
723
f_id = inv.path2id(f)
725
raise BzrError("%r is not versioned" % f)
726
name_tail = splitpath(f)[-1]
727
dest_path = appendpath(to_name, name_tail)
728
if self.has_filename(dest_path):
729
raise BzrError("destination %r already exists" % dest_path)
730
if f_id in to_idpath:
731
raise BzrError("can't move %r to a subdirectory of itself" % f)
733
# OK, so there's a race here, it's possible that someone will
734
# create a file in this interval and then the rename might be
735
# left half-done. But we should have caught most problems.
736
orig_inv = deepcopy(self.inventory)
1102
self._inventory_is_modified = True
1103
self._move(rename_entries)
739
name_tail = splitpath(f)[-1]
740
dest_path = appendpath(to_name, name_tail)
741
result.append((f, dest_path))
742
inv.rename(inv.path2id(f), to_dir_id, name_tail)
744
rename(self.abspath(f), self.abspath(dest_path))
746
raise BzrError("failed to rename %r to %r: %s" %
747
(f, dest_path, e[1]),
748
["rename rolled back"])
1105
750
# restore the inventory on error
1106
self._inventory_is_modified = original_modified
751
self._set_inventory(orig_inv)
1108
753
self._write_inventory(inv)
1109
return rename_tuples
1111
def _determine_mv_mode(self, rename_entries, after=False):
1112
"""Determines for each from-to pair if both inventory and working tree
1113
or only the inventory has to be changed.
1115
Also does basic plausability tests.
1117
inv = self.inventory
1119
for rename_entry in rename_entries:
1120
# store to local variables for easier reference
1121
from_rel = rename_entry.from_rel
1122
from_id = rename_entry.from_id
1123
to_rel = rename_entry.to_rel
1124
to_id = inv.path2id(to_rel)
1125
only_change_inv = False
1127
# check the inventory for source and destination
1129
raise errors.BzrMoveFailedError(from_rel,to_rel,
1130
errors.NotVersionedError(path=str(from_rel)))
1131
if to_id is not None:
1132
raise errors.BzrMoveFailedError(from_rel,to_rel,
1133
errors.AlreadyVersionedError(path=str(to_rel)))
1135
# try to determine the mode for rename (only change inv or change
1136
# inv and file system)
1138
if not self.has_filename(to_rel):
1139
raise errors.BzrMoveFailedError(from_id,to_rel,
1140
errors.NoSuchFile(path=str(to_rel),
1141
extra="New file has not been created yet"))
1142
only_change_inv = True
1143
elif not self.has_filename(from_rel) and self.has_filename(to_rel):
1144
only_change_inv = True
1145
elif self.has_filename(from_rel) and not self.has_filename(to_rel):
1146
only_change_inv = False
1148
# something is wrong, so lets determine what exactly
1149
if not self.has_filename(from_rel) and \
1150
not self.has_filename(to_rel):
1151
raise errors.BzrRenameFailedError(from_rel,to_rel,
1152
errors.PathsDoNotExist(paths=(str(from_rel),
1155
raise errors.RenameFailedFilesExist(from_rel, to_rel,
1156
extra="(Use --after to update the Bazaar id)")
1157
rename_entry.only_change_inv = only_change_inv
1158
return rename_entries
1160
def _move(self, rename_entries):
1161
"""Moves a list of files.
1163
Depending on the value of the flag 'only_change_inv', the
1164
file will be moved on the file system or not.
1166
inv = self.inventory
1169
for entry in rename_entries:
1171
self._move_entry(entry)
1173
self._rollback_move(moved)
1177
def _rollback_move(self, moved):
1178
"""Try to rollback a previous move in case of an filesystem error."""
1179
inv = self.inventory
1182
self._move_entry(_RenameEntry(entry.to_rel, entry.from_id,
1183
entry.to_tail, entry.to_parent_id, entry.from_rel,
1184
entry.from_tail, entry.from_parent_id,
1185
entry.only_change_inv))
1186
except errors.BzrMoveFailedError, e:
1187
raise errors.BzrMoveFailedError( '', '', "Rollback failed."
1188
" The working tree is in an inconsistent state."
1189
" Please consider doing a 'bzr revert'."
1190
" Error message is: %s" % e)
1192
def _move_entry(self, entry):
1193
inv = self.inventory
1194
from_rel_abs = self.abspath(entry.from_rel)
1195
to_rel_abs = self.abspath(entry.to_rel)
1196
if from_rel_abs == to_rel_abs:
1197
raise errors.BzrMoveFailedError(entry.from_rel, entry.to_rel,
1198
"Source and target are identical.")
1200
if not entry.only_change_inv:
1202
osutils.rename(from_rel_abs, to_rel_abs)
1204
raise errors.BzrMoveFailedError(entry.from_rel,
1206
inv.rename(entry.from_id, entry.to_parent_id, entry.to_tail)
1208
@needs_tree_write_lock
1209
def rename_one(self, from_rel, to_rel, after=False):
757
def rename_one(self, from_rel, to_rel):
1210
758
"""Rename one file.
1212
760
This can change the directory or the filename or both.
1214
rename_one has several 'modes' to work. First, it can rename a physical
1215
file and change the file_id. That is the normal mode. Second, it can
1216
only change the file_id without touching any physical file. This is
1217
the new mode introduced in version 0.15.
1219
rename_one uses the second mode if 'after == True' and 'to_rel' is not
1220
versioned but present in the working tree.
1222
rename_one uses the second mode if 'after == False' and 'from_rel' is
1223
versioned but no longer in the working tree, and 'to_rel' is not
1224
versioned but present in the working tree.
1226
rename_one uses the first mode if 'after == False' and 'from_rel' is
1227
versioned and present in the working tree, and 'to_rel' is not
1228
versioned and not present in the working tree.
1230
Everything else results in an error.
1232
762
inv = self.inventory
1235
# create rename entries and tuples
1236
from_tail = splitpath(from_rel)[-1]
1237
from_id = inv.path2id(from_rel)
1239
raise errors.BzrRenameFailedError(from_rel,to_rel,
1240
errors.NotVersionedError(path=str(from_rel)))
1241
from_entry = inv[from_id]
1242
from_parent_id = from_entry.parent_id
763
if not self.has_filename(from_rel):
764
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
765
if self.has_filename(to_rel):
766
raise BzrError("can't rename: new working file %r already exists" % to_rel)
768
file_id = inv.path2id(from_rel)
770
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
773
from_parent = entry.parent_id
774
from_name = entry.name
776
if inv.path2id(to_rel):
777
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1243
779
to_dir, to_tail = os.path.split(to_rel)
1244
780
to_dir_id = inv.path2id(to_dir)
1245
rename_entry = WorkingTree._RenameEntry(from_rel=from_rel,
1247
from_tail=from_tail,
1248
from_parent_id=from_parent_id,
1249
to_rel=to_rel, to_tail=to_tail,
1250
to_parent_id=to_dir_id)
1251
rename_entries.append(rename_entry)
1253
# determine which move mode to use. checks also for movability
1254
rename_entries = self._determine_mv_mode(rename_entries, after)
1256
# check if the target changed directory and if the target directory is
1258
if to_dir_id is None:
1259
raise errors.BzrMoveFailedError(from_rel,to_rel,
1260
errors.NotVersionedError(path=str(to_dir)))
1262
# all checks done. now we can continue with our actual work
1263
mutter('rename_one:\n'
1268
' to_dir_id {%s}\n',
1269
from_id, from_rel, to_rel, to_dir, to_dir_id)
1271
self._move(rename_entries)
781
if to_dir_id == None and to_dir != '':
782
raise BzrError("can't determine destination directory id for %r" % to_dir)
784
mutter("rename_one:")
785
mutter(" file_id {%s}" % file_id)
786
mutter(" from_rel %r" % from_rel)
787
mutter(" to_rel %r" % to_rel)
788
mutter(" to_dir %r" % to_dir)
789
mutter(" to_dir_id {%s}" % to_dir_id)
791
inv.rename(file_id, to_dir_id, to_tail)
793
from_abs = self.abspath(from_rel)
794
to_abs = self.abspath(to_rel)
796
rename(from_abs, to_abs)
798
inv.rename(file_id, from_parent, from_name)
799
raise BzrError("failed to rename %r to %r: %s"
800
% (from_abs, to_abs, e[1]),
801
["rename rolled back"])
1272
802
self._write_inventory(inv)
1274
class _RenameEntry(object):
1275
def __init__(self, from_rel, from_id, from_tail, from_parent_id,
1276
to_rel, to_tail, to_parent_id, only_change_inv=False):
1277
self.from_rel = from_rel
1278
self.from_id = from_id
1279
self.from_tail = from_tail
1280
self.from_parent_id = from_parent_id
1281
self.to_rel = to_rel
1282
self.to_tail = to_tail
1283
self.to_parent_id = to_parent_id
1284
self.only_change_inv = only_change_inv
1286
804
@needs_read_lock
1287
805
def unknowns(self):
1288
806
"""Return all unknown files.
1290
808
These are files in the working directory that are not versioned or
1291
809
control files or ignored.
1293
# force the extras method to be fully executed before returning, to
1294
# prevent race conditions with the lock
1296
[subp for subp in self.extras() if not self.is_ignored(subp)])
1298
@needs_tree_write_lock
1299
def unversion(self, file_ids):
1300
"""Remove the file ids in file_ids from the current versioned set.
1302
When a file_id is unversioned, all of its children are automatically
1305
:param file_ids: The file ids to stop versioning.
1306
:raises: NoSuchId if any fileid is not currently versioned.
1308
for file_id in file_ids:
1309
file_id = osutils.safe_file_id(file_id)
1310
if self._inventory.has_id(file_id):
1311
self._inventory.remove_recursive_id(file_id)
1313
raise errors.NoSuchId(self, file_id)
1315
# in the future this should just set a dirty bit to wait for the
1316
# final unlock. However, until all methods of workingtree start
1317
# with the current in -memory inventory rather than triggering
1318
# a read, it is more complex - we need to teach read_inventory
1319
# to know when to read, and when to not read first... and possibly
1320
# to save first when the in memory one may be corrupted.
1321
# so for now, we just only write it if it is indeed dirty.
1323
self._write_inventory(self._inventory)
1325
@deprecated_method(zero_eight)
811
>>> from bzrlib.bzrdir import ScratchDir
812
>>> d = ScratchDir(files=['foo', 'foo~'])
813
>>> b = d.open_branch()
814
>>> tree = d.open_workingtree()
815
>>> map(str, tree.unknowns())
818
>>> list(b.unknowns())
820
>>> tree.remove('foo')
821
>>> list(b.unknowns())
824
for subp in self.extras():
825
if not self.is_ignored(subp):
1326
828
def iter_conflicts(self):
1327
"""List all files in the tree that have text or content conflicts.
1328
DEPRECATED. Use conflicts instead."""
1329
return self._iter_conflicts()
1331
def _iter_conflicts(self):
1332
829
conflicted = set()
1333
for info in self.list_files():
830
for path in (s[0] for s in self.list_files()):
1335
831
stem = get_conflicted_stem(path)
1336
832
if stem is None:
1552
981
self.branch.unlock()
1555
def get_physical_lock_status(self):
1556
return self._control_files.get_physical_lock_status()
1558
def _basis_inventory_name(self):
1559
return 'basis-inventory-cache'
1561
@needs_tree_write_lock
1562
def set_last_revision(self, new_revision):
984
def _basis_inventory_name(self, revision_id):
985
return 'basis-inventory.%s' % revision_id
988
def set_last_revision(self, new_revision, old_revision=None):
1563
989
"""Change the last revision in the working tree."""
1564
new_revision = osutils.safe_revision_id(new_revision)
990
self._remove_old_basis(old_revision)
1565
991
if self._change_last_revision(new_revision):
1566
992
self._cache_basis_inventory(new_revision)
1568
994
def _change_last_revision(self, new_revision):
1569
"""Template method part of set_last_revision to perform the change.
1571
This is used to allow WorkingTree3 instances to not affect branch
1572
when their last revision is set.
995
"""Template method part of set_last_revision to perform the change."""
1574
996
if new_revision is None:
1575
997
self.branch.set_revision_history([])
999
# current format is locked in with the branch
1000
revision_history = self.branch.revision_history()
1578
self.branch.generate_revision_history(new_revision)
1579
except errors.NoSuchRevision:
1580
# not present in the repo - dont try to set it deeper than the tip
1581
self.branch.set_revision_history([new_revision])
1002
position = revision_history.index(new_revision)
1004
raise errors.NoSuchRevision(self.branch, new_revision)
1005
self.branch.set_revision_history(revision_history[:position + 1])
1584
def _write_basis_inventory(self, xml):
1585
"""Write the basis inventory XML to the basis-inventory file"""
1586
assert isinstance(xml, str), 'serialised xml must be bytestring.'
1587
path = self._basis_inventory_name()
1589
self._control_files.put(path, sio)
1591
def _create_basis_xml_from_inventory(self, revision_id, inventory):
1592
"""Create the text that will be saved in basis-inventory"""
1593
# TODO: jam 20070209 This should be redundant, as the revision_id
1594
# as all callers should have already converted the revision_id to
1596
inventory.revision_id = osutils.safe_revision_id(revision_id)
1597
return xml6.serializer_v6.write_inventory_to_string(inventory)
1599
1008
def _cache_basis_inventory(self, new_revision):
1600
1009
"""Cache new_revision as the basis inventory."""
1601
# TODO: this should allow the ready-to-use inventory to be passed in,
1602
# as commit already has that ready-to-use [while the format is the
1605
# this double handles the inventory - unpack and repack -
1606
# but is easier to understand. We can/should put a conditional
1607
# in here based on whether the inventory is in the latest format
1608
# - perhaps we should repack all inventories on a repository
1610
# the fast path is to copy the raw xml from the repository. If the
1611
# xml contains 'revision_id="', then we assume the right
1612
# revision_id is set. We must check for this full string, because a
1613
# root node id can legitimately look like 'revision_id' but cannot
1615
1011
xml = self.branch.repository.get_inventory_xml(new_revision)
1616
firstline = xml.split('\n', 1)[0]
1617
if (not 'revision_id="' in firstline or
1618
'format="6"' not in firstline):
1619
inv = self.branch.repository.deserialise_inventory(
1621
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1622
self._write_basis_inventory(xml)
1623
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1012
path = self._basis_inventory_name(new_revision)
1013
self._control_files.put_utf8(path, xml)
1014
except WeaveRevisionNotPresent:
1626
def read_basis_inventory(self):
1017
def _remove_old_basis(self, old_revision):
1018
"""Remove the old basis inventory 'old_revision'."""
1019
if old_revision is not None:
1021
path = self._basis_inventory_name(old_revision)
1022
path = self._control_files._escape(path)
1023
self._control_files._transport.delete(path)
1027
def read_basis_inventory(self, revision_id):
1627
1028
"""Read the cached basis inventory."""
1628
path = self._basis_inventory_name()
1629
return self._control_files.get(path).read()
1029
path = self._basis_inventory_name(revision_id)
1030
return self._control_files.get_utf8(path).read()
1631
1032
@needs_read_lock
1632
1033
def read_working_inventory(self):
1633
"""Read the working inventory.
1635
:raises errors.InventoryModified: read_working_inventory will fail
1636
when the current in memory inventory has been modified.
1638
# conceptually this should be an implementation detail of the tree.
1639
# XXX: Deprecate this.
1034
"""Read the working inventory."""
1640
1035
# ElementTree does its own conversion from UTF-8, so open in
1642
if self._inventory_is_modified:
1643
raise errors.InventoryModified(self)
1644
result = xml5.serializer_v5.read_inventory(
1037
result = bzrlib.xml5.serializer_v5.read_inventory(
1645
1038
self._control_files.get('inventory'))
1646
self._set_inventory(result, dirty=False)
1039
self._set_inventory(result)
1649
@needs_tree_write_lock
1650
def remove(self, files, verbose=False, to_file=None):
1043
def remove(self, files, verbose=False):
1651
1044
"""Remove nominated files from the working inventory..
1653
1046
This does not remove their text. This does not run on XXX on what? RBC
1799
1136
between multiple working trees, i.e. via shared storage, then we
1800
1137
would probably want to lock both the local tree, and the branch.
1802
raise NotImplementedError(self.unlock)
1139
# FIXME: We want to write out the hashcache only when the last lock on
1140
# this working copy is released. Peeking at the lock count is a bit
1141
# of a nasty hack; probably it's better to have a transaction object,
1142
# which can do some finalization when it's either successfully or
1143
# unsuccessfully completed. (Denys's original patch did that.)
1144
# RBC 20060206 hookinhg into transaction will couple lock and transaction
1145
# wrongly. Hookinh into unllock on the control files object is fine though.
1147
# TODO: split this per format so there is no ugly if block
1148
if self._hashcache.needs_write and (
1149
# dedicated lock files
1150
self._control_files._lock_count==1 or
1152
(self._control_files is self.branch.control_files and
1153
self._control_files._lock_count==3)):
1154
self._hashcache.write()
1155
# reverse order of locking.
1156
result = self._control_files.unlock()
1158
self.branch.unlock()
1804
1163
def update(self):
1805
"""Update a working tree along its branch.
1807
This will update the branch if its bound too, which means we have
1808
multiple trees involved:
1810
- The new basis tree of the master.
1811
- The old basis tree of the branch.
1812
- The old basis tree of the working tree.
1813
- The current working tree state.
1815
Pathologically, all three may be different, and non-ancestors of each
1816
other. Conceptually we want to:
1818
- Preserve the wt.basis->wt.state changes
1819
- Transform the wt.basis to the new master basis.
1820
- Apply a merge of the old branch basis to get any 'local' changes from
1822
- Restore the wt.basis->wt.state changes.
1824
There isn't a single operation at the moment to do that, so we:
1825
- Merge current state -> basis tree of the master w.r.t. the old tree
1827
- Do a 'normal' merge of the old branch basis if it is relevant.
1829
if self.branch.get_master_branch() is not None:
1831
update_branch = True
1833
self.lock_tree_write()
1834
update_branch = False
1837
old_tip = self.branch.update()
1840
return self._update_tree(old_tip)
1844
@needs_tree_write_lock
1845
def _update_tree(self, old_tip=None):
1846
"""Update a tree to the master branch.
1848
:param old_tip: if supplied, the previous tip revision the branch,
1849
before it was changed to the master branch's tip.
1851
# here if old_tip is not None, it is the old tip of the branch before
1852
# it was updated from the master branch. This should become a pending
1853
# merge in the working tree to preserve the user existing work. we
1854
# cant set that until we update the working trees last revision to be
1855
# one from the new branch, because it will just get absorbed by the
1856
# parent de-duplication logic.
1858
# We MUST save it even if an error occurs, because otherwise the users
1859
# local work is unreferenced and will appear to have been lost.
1863
last_rev = self.get_parent_ids()[0]
1866
if last_rev != self.branch.last_revision():
1867
# merge tree state up to new branch tip.
1164
self.branch.lock_read()
1166
if self.last_revision() == self.branch.last_revision():
1868
1168
basis = self.basis_tree()
1871
to_tree = self.branch.basis_tree()
1872
if basis.inventory.root is None and self.inventory.root is None:
1873
self.set_root_id(to_tree.inventory.root.file_id)
1874
result += merge.merge_inner(
1881
# TODO - dedup parents list with things merged by pull ?
1882
# reuse the tree we've updated to to set the basis:
1883
parent_trees = [(self.branch.last_revision(), to_tree)]
1884
merges = self.get_parent_ids()[1:]
1885
# Ideally we ask the tree for the trees here, that way the working
1886
# tree can decide whether to give us teh entire tree or give us a
1887
# lazy initialised tree. dirstate for instance will have the trees
1888
# in ram already, whereas a last-revision + basis-inventory tree
1889
# will not, but also does not need them when setting parents.
1890
for parent in merges:
1891
parent_trees.append(
1892
(parent, self.branch.repository.revision_tree(parent)))
1893
if old_tip is not None:
1894
parent_trees.append(
1895
(old_tip, self.branch.repository.revision_tree(old_tip)))
1896
self.set_parent_trees(parent_trees)
1897
last_rev = parent_trees[0][0]
1899
# the working tree had the same last-revision as the master
1900
# branch did. We may still have pivot local work from the local
1901
# branch into old_tip:
1902
if old_tip is not None:
1903
self.add_parent_tree_id(old_tip)
1904
if old_tip and old_tip != last_rev:
1905
# our last revision was not the prior branch last revision
1906
# and we have converted that last revision to a pending merge.
1907
# base is somewhere between the branch tip now
1908
# and the now pending merge
1910
# Since we just modified the working tree and inventory, flush out
1911
# the current state, before we modify it again.
1912
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
1913
# requires it only because TreeTransform directly munges the
1914
# inventory and calls tree._write_inventory(). Ultimately we
1915
# should be able to remove this extra flush.
1917
from bzrlib.revision import common_ancestor
1919
base_rev_id = common_ancestor(self.branch.last_revision(),
1921
self.branch.repository)
1922
except errors.NoCommonAncestor:
1924
base_tree = self.branch.repository.revision_tree(base_rev_id)
1925
other_tree = self.branch.repository.revision_tree(old_tip)
1926
result += merge.merge_inner(
1933
def _write_hashcache_if_dirty(self):
1934
"""Write out the hashcache if it is dirty."""
1935
if self._hashcache.needs_write:
1937
self._hashcache.write()
1939
if e.errno not in (errno.EPERM, errno.EACCES):
1941
# TODO: jam 20061219 Should this be a warning? A single line
1942
# warning might be sufficient to let the user know what
1944
mutter('Could not write hashcache for %s\nError: %s',
1945
self._hashcache.cache_file_name(), e)
1947
@needs_tree_write_lock
1169
to_tree = self.branch.basis_tree()
1170
result = merge_inner(self.branch,
1174
self.set_last_revision(self.branch.last_revision())
1177
self.branch.unlock()
1948
1180
def _write_inventory(self, inv):
1949
1181
"""Write inventory as the current inventory."""
1950
self._set_inventory(inv, dirty=True)
1953
def set_conflicts(self, arg):
1954
raise errors.UnsupportedOperation(self.set_conflicts, self)
1956
def add_conflicts(self, arg):
1957
raise errors.UnsupportedOperation(self.add_conflicts, self)
1960
def conflicts(self):
1961
conflicts = _mod_conflicts.ConflictList()
1962
for conflicted in self._iter_conflicts():
1965
if file_kind(self.abspath(conflicted)) != "file":
1967
except errors.NoSuchFile:
1970
for suffix in ('.THIS', '.OTHER'):
1972
kind = file_kind(self.abspath(conflicted+suffix))
1975
except errors.NoSuchFile:
1979
ctype = {True: 'text conflict', False: 'contents conflict'}[text]
1980
conflicts.append(_mod_conflicts.Conflict.factory(ctype,
1982
file_id=self.path2id(conflicted)))
1985
def walkdirs(self, prefix=""):
1986
"""Walk the directories of this tree.
1988
This API returns a generator, which is only valid during the current
1989
tree transaction - within a single lock_read or lock_write duration.
1991
If the tree is not locked, it may cause an error to be raised, depending
1992
on the tree implementation.
1994
disk_top = self.abspath(prefix)
1995
if disk_top.endswith('/'):
1996
disk_top = disk_top[:-1]
1997
top_strip_len = len(disk_top) + 1
1998
inventory_iterator = self._walkdirs(prefix)
1999
disk_iterator = osutils.walkdirs(disk_top, prefix)
2001
current_disk = disk_iterator.next()
2002
disk_finished = False
2004
if e.errno != errno.ENOENT:
2007
disk_finished = True
2009
current_inv = inventory_iterator.next()
2010
inv_finished = False
2011
except StopIteration:
2014
while not inv_finished or not disk_finished:
2015
if not disk_finished:
2016
# strip out .bzr dirs
2017
if current_disk[0][1][top_strip_len:] == '':
2018
# osutils.walkdirs can be made nicer -
2019
# yield the path-from-prefix rather than the pathjoined
2021
bzrdir_loc = bisect_left(current_disk[1], ('.bzr', '.bzr'))
2022
if current_disk[1][bzrdir_loc][0] == '.bzr':
2023
# we dont yield the contents of, or, .bzr itself.
2024
del current_disk[1][bzrdir_loc]
2026
# everything is unknown
2029
# everything is missing
2032
direction = cmp(current_inv[0][0], current_disk[0][0])
2034
# disk is before inventory - unknown
2035
dirblock = [(relpath, basename, kind, stat, None, None) for
2036
relpath, basename, kind, stat, top_path in current_disk[1]]
2037
yield (current_disk[0][0], None), dirblock
2039
current_disk = disk_iterator.next()
2040
except StopIteration:
2041
disk_finished = True
2043
# inventory is before disk - missing.
2044
dirblock = [(relpath, basename, 'unknown', None, fileid, kind)
2045
for relpath, basename, dkind, stat, fileid, kind in
2047
yield (current_inv[0][0], current_inv[0][1]), dirblock
2049
current_inv = inventory_iterator.next()
2050
except StopIteration:
2053
# versioned present directory
2054
# merge the inventory and disk data together
2056
for relpath, subiterator in itertools.groupby(sorted(
2057
current_inv[1] + current_disk[1], key=operator.itemgetter(0)), operator.itemgetter(1)):
2058
path_elements = list(subiterator)
2059
if len(path_elements) == 2:
2060
inv_row, disk_row = path_elements
2061
# versioned, present file
2062
dirblock.append((inv_row[0],
2063
inv_row[1], disk_row[2],
2064
disk_row[3], inv_row[4],
2066
elif len(path_elements[0]) == 5:
2068
dirblock.append((path_elements[0][0],
2069
path_elements[0][1], path_elements[0][2],
2070
path_elements[0][3], None, None))
2071
elif len(path_elements[0]) == 6:
2072
# versioned, absent file.
2073
dirblock.append((path_elements[0][0],
2074
path_elements[0][1], 'unknown', None,
2075
path_elements[0][4], path_elements[0][5]))
2077
raise NotImplementedError('unreachable code')
2078
yield current_inv[0], dirblock
2080
current_inv = inventory_iterator.next()
2081
except StopIteration:
2084
current_disk = disk_iterator.next()
2085
except StopIteration:
2086
disk_finished = True
2088
def _walkdirs(self, prefix=""):
2089
_directory = 'directory'
2090
# get the root in the inventory
2091
inv = self.inventory
2092
top_id = inv.path2id(prefix)
2096
pending = [(prefix, '', _directory, None, top_id, None)]
2099
currentdir = pending.pop()
2100
# 0 - relpath, 1- basename, 2- kind, 3- stat, 4-id, 5-kind
2101
top_id = currentdir[4]
2103
relroot = currentdir[0] + '/'
2106
# FIXME: stash the node in pending
2108
for name, child in entry.sorted_children():
2109
dirblock.append((relroot + name, name, child.kind, None,
2110
child.file_id, child.kind
2112
yield (currentdir[0], entry.file_id), dirblock
2113
# push the user specified dirs from dirblock
2114
for dir in reversed(dirblock):
2115
if dir[2] == _directory:
2119
class WorkingTree2(WorkingTree):
2120
"""This is the Format 2 working tree.
2122
This was the first weave based working tree.
2123
- uses os locks for locking.
2124
- uses the branch last-revision.
2127
def lock_tree_write(self):
2128
"""See WorkingTree.lock_tree_write().
2130
In Format2 WorkingTrees we have a single lock for the branch and tree
2131
so lock_tree_write() degrades to lock_write().
2133
self.branch.lock_write()
2135
return self._control_files.lock_write()
2137
self.branch.unlock()
2141
# we share control files:
2142
if self._control_files._lock_count == 3:
2143
# _inventory_is_modified is always False during a read lock.
2144
if self._inventory_is_modified:
2146
self._write_hashcache_if_dirty()
2148
# reverse order of locking.
2150
return self._control_files.unlock()
2152
self.branch.unlock()
1183
bzrlib.xml5.serializer_v5.write_inventory(inv, sio)
1185
self._control_files.put('inventory', sio)
1186
self._set_inventory(inv)
1187
mutter('wrote working inventory')
2155
1190
class WorkingTree3(WorkingTree):