13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
17
"""WorkingTree object and friends.
19
19
A WorkingTree represents the editable working copy of a branch.
20
Operations which represent the WorkingTree are also done here,
21
such as renaming or adding files. The WorkingTree has an inventory
22
which is updated by these operations. A commit produces a
20
Operations which represent the WorkingTree are also done here,
21
such as renaming or adding files. The WorkingTree has an inventory
22
which is updated by these operations. A commit produces a
23
23
new revision based on the workingtree and its inventory.
25
25
At the moment every WorkingTree has its own branch. Remote
51
59
conflicts as _mod_conflicts,
60
67
revision as _mod_revision,
69
79
import bzrlib.branch
70
80
from bzrlib.transport import get_transport
71
from bzrlib.workingtree_4 import (
82
from bzrlib.workingtree_4 import WorkingTreeFormat4
78
85
from bzrlib import symbol_versioning
79
86
from bzrlib.decorators import needs_read_lock, needs_write_lock
80
from bzrlib.lockable_files import LockableFiles
87
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
88
from bzrlib.lockable_files import LockableFiles, TransportLock
81
89
from bzrlib.lockdir import LockDir
82
90
import bzrlib.mutabletree
83
91
from bzrlib.mutabletree import needs_tree_write_lock
84
92
from bzrlib import osutils
85
93
from bzrlib.osutils import (
93
103
supports_executable,
95
from bzrlib.filters import filtered_input_file
96
105
from bzrlib.trace import mutter, note
97
106
from bzrlib.transport.local import LocalTransport
98
from bzrlib.revision import CURRENT_REVISION
107
from bzrlib.progress import DummyProgress, ProgressPhase
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
99
109
from bzrlib.rio import RioReader, rio_file, Stanza
100
from bzrlib.symbol_versioning import (
102
DEPRECATED_PARAMETER,
110
from bzrlib.symbol_versioning import (deprecated_passed,
113
DEPRECATED_PARAMETER,
106
117
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
107
# TODO: Modifying the conflict objects or their type is currently nearly
108
# impossible as there is no clear relationship between the working tree format
109
# and the conflict list file format.
110
118
CONFLICT_HEADER_1 = "BZR conflict list format 1"
112
120
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
285
277
self._control_files.break_lock()
286
278
self.branch.break_lock()
288
def _get_check_refs(self):
289
"""Return the references needed to perform a check of this tree.
291
The default implementation returns no refs, and is only suitable for
292
trees that have no local caching and can commit on ghosts at any time.
294
:seealso: bzrlib.check for details about check_refs.
298
280
def requires_rich_root(self):
299
281
return self._format.requires_rich_root
301
283
def supports_tree_reference(self):
304
def supports_content_filtering(self):
305
return self._format.supports_content_filtering()
307
def supports_views(self):
308
return self.views.supports_views()
310
286
def _set_inventory(self, inv, dirty):
311
287
"""Set the internal cached inventory.
422
396
# at this point ?
424
398
return self.branch.repository.revision_tree(revision_id)
425
except (errors.RevisionNotPresent, errors.NoSuchRevision):
399
except errors.RevisionNotPresent:
426
400
# the basis tree *may* be a ghost or a low level error may have
427
# occurred. If the revision is present, its a problem, if its not
401
# occured. If the revision is present, its a problem, if its not
429
403
if self.branch.repository.has_revision(revision_id):
431
405
# the basis tree is a ghost so return an empty tree.
432
return self.branch.repository.revision_tree(
433
_mod_revision.NULL_REVISION)
406
return self.branch.repository.revision_tree(None)
435
408
def _cleanup(self):
436
409
self._flush_ignore_list_cache()
438
411
def relpath(self, path):
439
412
"""Return the local path portion from a given path.
441
The path may be absolute or relative. If its a relative path it is
414
The path may be absolute or relative. If its a relative path it is
442
415
interpreted relative to the python current working directory.
444
417
return osutils.relpath(self.basedir, path)
446
419
def has_filename(self, filename):
447
420
return osutils.lexists(self.abspath(filename))
449
def get_file(self, file_id, path=None, filtered=True):
450
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
452
def get_file_with_stat(self, file_id, path=None, filtered=True,
454
"""See Tree.get_file_with_stat."""
422
def get_file(self, file_id, path=None):
456
424
path = self.id2path(file_id)
457
file_obj = self.get_file_byname(path, filtered=False)
458
stat_value = _fstat(file_obj.fileno())
459
if filtered and self.supports_content_filtering():
460
filters = self._content_filter_stack(path)
461
file_obj = filtered_input_file(file_obj, filters)
462
return (file_obj, stat_value)
464
def get_file_text(self, file_id, path=None, filtered=True):
465
return self.get_file(file_id, path=path, filtered=filtered).read()
467
def get_file_byname(self, filename, filtered=True):
468
path = self.abspath(filename)
470
if filtered and self.supports_content_filtering():
471
filters = self._content_filter_stack(filename)
472
return filtered_input_file(f, filters)
476
def get_file_lines(self, file_id, path=None, filtered=True):
477
"""See Tree.get_file_lines()"""
478
file = self.get_file(file_id, path, filtered=filtered)
480
return file.readlines()
425
return self.get_file_byname(path)
427
def get_file_text(self, file_id):
428
return self.get_file(file_id).read()
430
def get_file_byname(self, filename):
431
return file(self.abspath(filename), 'rb')
485
434
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
492
441
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
442
attribution will be correct).
495
maybe_file_parent_keys = []
496
for parent_id in self.get_parent_ids():
498
parent_tree = self.revision_tree(parent_id)
499
except errors.NoSuchRevisionInTree:
500
parent_tree = self.branch.repository.revision_tree(parent_id)
501
parent_tree.lock_read()
503
if file_id not in parent_tree:
505
ie = parent_tree.inventory[file_id]
506
if ie.kind != 'file':
507
# Note: this is slightly unnecessary, because symlinks and
508
# directories have a "text" which is the empty text, and we
509
# know that won't mess up annotations. But it seems cleaner
511
parent_text_key = (file_id, ie.revision)
512
if parent_text_key not in maybe_file_parent_keys:
513
maybe_file_parent_keys.append(parent_text_key)
516
graph = _mod_graph.Graph(self.branch.repository.texts)
517
heads = graph.heads(maybe_file_parent_keys)
518
file_parent_keys = []
519
for key in maybe_file_parent_keys:
521
file_parent_keys.append(key)
523
# Now we have the parents of this content
524
annotator = self.branch.repository.texts.get_annotator()
525
text = self.get_file(file_id).read()
526
this_key =(file_id, default_revision)
527
annotator.add_special_text(this_key, file_parent_keys, text)
528
annotations = [(key[-1], line)
529
for key, line in annotator.annotate_flat(this_key)]
444
basis = self.basis_tree()
447
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
448
require_versioned=True).next()
449
changed_content, kind = changes[2], changes[6]
450
if not changed_content:
451
return basis.annotate_iter(file_id)
455
if kind[0] != 'file':
458
old_lines = list(basis.annotate_iter(file_id))
460
for tree in self.branch.repository.revision_trees(
461
self.get_parent_ids()[1:]):
462
if file_id not in tree:
464
old.append(list(tree.annotate_iter(file_id)))
465
return annotate.reannotate(old, self.get_file(file_id).readlines(),
532
470
def _get_ancestors(self, default_revision):
533
471
ancestors = set([default_revision])
570
508
def clone(self, to_bzrdir, revision_id=None):
571
509
"""Duplicate this working tree into to_bzr, including all state.
573
511
Specifically modified files are kept as modified, but
574
512
ignored and unknown files are discarded.
576
514
If you want to make a new line of development, see bzrdir.sprout()
579
If not None, the cloned tree will have its last revision set to
580
revision, and difference between the source trees last revision
517
If not None, the cloned tree will have its last revision set to
518
revision, and and difference between the source trees last revision
581
519
and this one merged in.
583
521
# assumes the target bzr dir format is compatible.
584
result = to_bzrdir.create_workingtree()
522
result = self._format.initialize(to_bzrdir)
585
523
self.copy_content_into(result, revision_id)
767
703
kind = 'tree-reference'
768
704
return kind, None, None, None
769
705
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
706
return ('symlink', None, None, os.readlink(abspath))
773
708
return (kind, None, None, None)
775
def _file_content_summary(self, path, stat_result):
776
size = stat_result.st_size
777
executable = self._is_executable_from_path_and_stat(path, stat_result)
778
# try for a stat cache lookup
779
return ('file', size, executable, self._sha_from_stat(
782
710
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
711
"""Common ghost checking functionality from set_parent_*.
914
842
branch.last_revision().
916
844
from bzrlib.merge import Merger, Merge3Merger
917
merger = Merger(self.branch, this_tree=self)
918
# check that there are no local alterations
919
if not force and self.has_changes():
920
raise errors.UncommittedChanges(self)
921
if to_revision is None:
922
to_revision = _mod_revision.ensure_null(branch.last_revision())
923
merger.other_rev_id = to_revision
924
if _mod_revision.is_null(merger.other_rev_id):
925
raise errors.NoCommits(branch)
926
self.branch.fetch(branch, last_revision=merger.other_rev_id)
927
merger.other_basis = merger.other_rev_id
928
merger.other_tree = self.branch.repository.revision_tree(
930
merger.other_branch = branch
931
if from_revision is None:
934
merger.set_base_revision(from_revision, branch)
935
if merger.base_rev_id == merger.other_rev_id:
936
raise errors.PointlessMerge
937
merger.backup_files = False
938
if merge_type is None:
939
merger.merge_type = Merge3Merger
941
merger.merge_type = merge_type
942
merger.set_interesting_files(None)
943
merger.show_base = False
944
merger.reprocess = False
945
conflicts = merger.do_merge()
845
pb = bzrlib.ui.ui_factory.nested_progress_bar()
847
merger = Merger(self.branch, this_tree=self, pb=pb)
848
merger.pp = ProgressPhase("Merge phase", 5, pb)
849
merger.pp.next_phase()
850
# check that there are no
852
merger.check_basis(check_clean=True, require_commits=False)
853
if to_revision is None:
854
to_revision = _mod_revision.ensure_null(branch.last_revision())
855
merger.other_rev_id = to_revision
856
if _mod_revision.is_null(merger.other_rev_id):
857
raise errors.NoCommits(branch)
858
self.branch.fetch(branch, last_revision=merger.other_rev_id)
859
merger.other_basis = merger.other_rev_id
860
merger.other_tree = self.branch.repository.revision_tree(
862
merger.other_branch = branch
863
merger.pp.next_phase()
864
if from_revision is None:
867
merger.set_base_revision(from_revision, branch)
868
if merger.base_rev_id == merger.other_rev_id:
869
raise errors.PointlessMerge
870
merger.backup_files = False
871
if merge_type is None:
872
merger.merge_type = Merge3Merger
874
merger.merge_type = merge_type
875
merger.set_interesting_files(None)
876
merger.show_base = False
877
merger.reprocess = False
878
conflicts = merger.do_merge()
950
885
def merge_modified(self):
951
886
"""Return a dictionary of files modified by a merge.
953
The list is initialized by WorkingTree.set_merge_modified, which is
888
The list is initialized by WorkingTree.set_merge_modified, which is
954
889
typically called after we make some automatic updates to the tree
955
890
because of a merge.
961
896
hashfile = self._transport.get('merge-hashes')
962
897
except errors.NoSuchFile:
967
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
968
raise errors.MergeModifiedFormatError()
969
except StopIteration:
901
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
970
902
raise errors.MergeModifiedFormatError()
971
for s in RioReader(hashfile):
972
# RioReader reads in Unicode, so convert file_ids back to utf8
973
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
974
if file_id not in self.inventory:
976
text_hash = s.get("hash")
977
if text_hash == self.get_file_sha1(file_id):
978
merge_hashes[file_id] = text_hash
903
except StopIteration:
904
raise errors.MergeModifiedFormatError()
905
for s in RioReader(hashfile):
906
# RioReader reads in Unicode, so convert file_ids back to utf8
907
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
908
if file_id not in self.inventory:
910
text_hash = s.get("hash")
911
if text_hash == self.get_file_sha1(file_id):
912
merge_hashes[file_id] = text_hash
983
915
@needs_write_lock
984
916
def mkdir(self, path, file_id=None):
1096
1026
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1027
if tree_transport.base != branch_transport.base:
1098
1028
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1029
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1031
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1032
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1033
wt.set_parent_ids(self.get_parent_ids())
1105
1034
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1035
child_inv = Inventory(root_id=None)
1107
1036
new_root = my_inv[file_id]
1108
1037
my_inv.remove_recursive_id(file_id)
1109
1038
new_root.parent_id = None
1128
1057
self._serialize(self._inventory, sio)
1130
1059
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1060
mode=self._control_files._file_mode)
1132
1061
self._inventory_is_modified = False
1134
1063
def _kind(self, relpath):
1135
1064
return osutils.file_kind(self.abspath(relpath))
1137
def list_files(self, include_root=False, from_dir=None, recursive=True):
1138
"""List all files as (path, class, kind, id, entry).
1066
def list_files(self, include_root=False):
1067
"""Recursively list all files as (path, class, kind, id, entry).
1140
1069
Lists, but does not descend into unversioned directories.
1141
1071
This does not include files that have been deleted in this
1142
tree. Skips the control directory.
1144
:param include_root: if True, return an entry for the root
1145
:param from_dir: start from this directory or None for the root
1146
:param recursive: whether to recurse into subdirectories or not
1074
Skips the control directory.
1148
1076
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1077
# with it. So callers should be careful to always read_lock the tree.
1164
1092
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1094
# directory file_id, relative path, absolute path, reverse sorted children
1167
if from_dir is not None:
1168
from_dir_id = inv.path2id(from_dir)
1169
if from_dir_id is None:
1170
# Directory not versioned
1172
from_dir_abspath = pathjoin(self.basedir, from_dir)
1174
from_dir_id = inv.root.file_id
1175
from_dir_abspath = self.basedir
1176
children = os.listdir(from_dir_abspath)
1095
children = os.listdir(self.basedir)
1177
1096
children.sort()
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1097
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1098
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1099
# list and just reverse() them.
1181
1100
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1101
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1103
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1239
1158
except KeyError:
1240
1159
yield fp[1:], c, fk, None, TreeEntry()
1243
1162
if fk != 'directory':
1246
# But do this child first if recursing down
1248
new_children = os.listdir(fap)
1250
new_children = collections.deque(new_children)
1251
stack.append((f_ie.file_id, fp, fap, new_children))
1252
# Break out of inner loop,
1253
# so that we start outer loop with child
1165
# But do this child first
1166
new_children = os.listdir(fap)
1168
new_children = collections.deque(new_children)
1169
stack.append((f_ie.file_id, fp, fap, new_children))
1170
# Break out of inner loop,
1171
# so that we start outer loop with child
1256
1174
# if we finished all children, pop it off the stack
1493
1410
from_tail = splitpath(from_rel)[-1]
1494
1411
from_id = inv.path2id(from_rel)
1495
1412
if from_id is None:
1496
# if file is missing in the inventory maybe it's in the basis_tree
1497
basis_tree = self.branch.basis_tree()
1498
from_id = basis_tree.path2id(from_rel)
1500
raise errors.BzrRenameFailedError(from_rel,to_rel,
1501
errors.NotVersionedError(path=str(from_rel)))
1502
# put entry back in the inventory so we can rename it
1503
from_entry = basis_tree.inventory[from_id].copy()
1506
from_entry = inv[from_id]
1413
raise errors.BzrRenameFailedError(from_rel,to_rel,
1414
errors.NotVersionedError(path=str(from_rel)))
1415
from_entry = inv[from_id]
1507
1416
from_parent_id = from_entry.parent_id
1508
1417
to_dir, to_tail = os.path.split(to_rel)
1509
1418
to_dir_id = inv.path2id(to_dir)
1571
1480
:raises: NoSuchId if any fileid is not currently versioned.
1573
1482
for file_id in file_ids:
1574
if file_id not in self._inventory:
1575
raise errors.NoSuchId(self, file_id)
1576
for file_id in file_ids:
1577
1483
if self._inventory.has_id(file_id):
1578
1484
self._inventory.remove_recursive_id(file_id)
1486
raise errors.NoSuchId(self, file_id)
1579
1487
if len(file_ids):
1580
# in the future this should just set a dirty bit to wait for the
1488
# in the future this should just set a dirty bit to wait for the
1581
1489
# final unlock. However, until all methods of workingtree start
1582
# with the current in -memory inventory rather than triggering
1490
# with the current in -memory inventory rather than triggering
1583
1491
# a read, it is more complex - we need to teach read_inventory
1584
1492
# to know when to read, and when to not read first... and possibly
1585
1493
# to save first when the in memory one may be corrupted.
1586
1494
# so for now, we just only write it if it is indeed dirty.
1587
1495
# - RBC 20060907
1588
1496
self._write_inventory(self._inventory)
1590
1498
def _iter_conflicts(self):
1591
1499
conflicted = set()
1592
1500
for info in self.list_files():
1601
1509
@needs_write_lock
1602
1510
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1511
change_reporter=None, possible_transports=None):
1512
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1513
source.lock_read()
1515
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1517
old_revision_info = self.branch.last_revision_info()
1607
1518
basis_tree = self.basis_tree()
1608
1519
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1520
possible_transports=possible_transports)
1611
1521
new_revision_info = self.branch.last_revision_info()
1612
1522
if new_revision_info != old_revision_info:
1613
1524
repository = self.branch.repository
1525
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1526
basis_tree.lock_read()
1616
1528
new_basis_tree = self.branch.basis_tree()
1619
1531
new_basis_tree,
1621
1533
this_tree=self,
1623
1535
change_reporter=change_reporter)
1624
basis_root_id = basis_tree.get_root_id()
1625
new_root_id = new_basis_tree.get_root_id()
1626
if basis_root_id != new_root_id:
1627
self.set_root_id(new_root_id)
1536
if (basis_tree.inventory.root is None and
1537
new_basis_tree.inventory.root is not None):
1538
self.set_root_id(new_basis_tree.get_root_id())
1629
1541
basis_tree.unlock()
1630
1542
# TODO - dedup parents list with things merged by pull ?
1631
1543
# reuse the revisiontree we merged against to set the new
1633
1545
parent_trees = [(self.branch.last_revision(), new_basis_tree)]
1634
# we have to pull the merge trees out again, because
1635
# merge_inner has set the ids. - this corner is not yet
1546
# we have to pull the merge trees out again, because
1547
# merge_inner has set the ids. - this corner is not yet
1636
1548
# layered well enough to prevent double handling.
1637
1549
# XXX TODO: Fix the double handling: telling the tree about
1638
1550
# the already known parent data is wasteful.
1886
1786
# as commit already has that ready-to-use [while the format is the
1887
1787
# same, that is].
1889
# this double handles the inventory - unpack and repack -
1789
# this double handles the inventory - unpack and repack -
1890
1790
# but is easier to understand. We can/should put a conditional
1891
1791
# in here based on whether the inventory is in the latest format
1892
1792
# - perhaps we should repack all inventories on a repository
1894
1794
# the fast path is to copy the raw xml from the repository. If the
1895
# xml contains 'revision_id="', then we assume the right
1795
# xml contains 'revision_id="', then we assume the right
1896
1796
# revision_id is set. We must check for this full string, because a
1897
1797
# root node id can legitimately look like 'revision_id' but cannot
1898
1798
# contain a '"'.
1899
xml = self.branch.repository._get_inventory_xml(new_revision)
1799
xml = self.branch.repository.get_inventory_xml(new_revision)
1900
1800
firstline = xml.split('\n', 1)[0]
1901
if (not 'revision_id="' in firstline or
1801
if (not 'revision_id="' in firstline or
1902
1802
'format="7"' not in firstline):
1903
inv = self.branch.repository._serializer.read_inventory_from_string(
1803
inv = self.branch.repository.deserialise_inventory(
1905
1805
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1906
1806
self._write_basis_inventory(xml)
1907
1807
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1911
1811
"""Read the cached basis inventory."""
1912
1812
path = self._basis_inventory_name()
1913
1813
return self._transport.get_bytes(path)
1915
1815
@needs_read_lock
1916
1816
def read_working_inventory(self):
1917
1817
"""Read the working inventory.
1919
1819
:raises errors.InventoryModified: read_working_inventory will fail
1920
1820
when the current in memory inventory has been modified.
1922
# conceptually this should be an implementation detail of the tree.
1822
# conceptually this should be an implementation detail of the tree.
1923
1823
# XXX: Deprecate this.
1924
1824
# ElementTree does its own conversion from UTF-8, so open in
1926
1826
if self._inventory_is_modified:
1927
1827
raise errors.InventoryModified(self)
1928
f = self._transport.get('inventory')
1930
result = self._deserialize(f)
1828
result = self._deserialize(self._transport.get('inventory'))
1933
1829
self._set_inventory(result, dirty=False)
1951
1847
new_files=set()
1952
1848
unknown_nested_files=set()
1954
to_file = sys.stdout
1956
1850
def recurse_directory_to_add_files(directory):
1957
1851
# Recurse directory and add all files
1958
1852
# so we can check if they have changed.
1959
1853
for parent_info, file_infos in\
1960
self.walkdirs(directory):
1961
for relpath, basename, kind, lstat, fileid, kind in file_infos:
1854
osutils.walkdirs(self.abspath(directory),
1856
for relpath, basename, kind, lstat, abspath in file_infos:
1962
1857
# Is it versioned or ignored?
1963
1858
if self.path2id(relpath) or self.is_ignored(relpath):
1964
1859
# Add nested content for deletion.
2178
2074
def unlock(self):
2179
2075
"""See Branch.unlock.
2181
2077
WorkingTree locking just uses the Branch locking facilities.
2182
2078
This is current because all working trees have an embedded branch
2183
2079
within them. IF in the future, we were to make branch data shareable
2184
between multiple working trees, i.e. via shared storage, then we
2080
between multiple working trees, i.e. via shared storage, then we
2185
2081
would probably want to lock both the local tree, and the branch.
2187
2083
raise NotImplementedError(self.unlock)
2191
def update(self, change_reporter=None, possible_transports=None,
2192
revision=None, old_tip=_marker):
2085
def update(self, change_reporter=None, possible_transports=None):
2193
2086
"""Update a working tree along its branch.
2195
2088
This will update the branch if its bound too, which means we have
2249
2135
# cant set that until we update the working trees last revision to be
2250
2136
# one from the new branch, because it will just get absorbed by the
2251
2137
# parent de-duplication logic.
2253
2139
# We MUST save it even if an error occurs, because otherwise the users
2254
2140
# local work is unreferenced and will appear to have been lost.
2258
2144
last_rev = self.get_parent_ids()[0]
2259
2145
except IndexError:
2260
2146
last_rev = _mod_revision.NULL_REVISION
2261
if revision is None:
2262
revision = self.branch.last_revision()
2264
old_tip = old_tip or _mod_revision.NULL_REVISION
2266
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2267
# the branch we are bound to was updated
2268
# merge those changes in first
2269
base_tree = self.basis_tree()
2270
other_tree = self.branch.repository.revision_tree(old_tip)
2271
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2272
base_tree, this_tree=self,
2273
change_reporter=change_reporter)
2275
self.add_parent_tree((old_tip, other_tree))
2276
trace.note('Rerun update after fixing the conflicts.')
2279
if last_rev != _mod_revision.ensure_null(revision):
2280
# the working tree is up to date with the branch
2281
# we can merge the specified revision from master
2282
to_tree = self.branch.repository.revision_tree(revision)
2283
to_root_id = to_tree.get_root_id()
2147
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2148
# merge tree state up to new branch tip.
2285
2149
basis = self.basis_tree()
2286
2150
basis.lock_read()
2288
if (basis.inventory.root is None
2289
or basis.inventory.root.file_id != to_root_id):
2290
self.set_root_id(to_root_id)
2152
to_tree = self.branch.basis_tree()
2153
if basis.inventory.root is None:
2154
self.set_root_id(to_tree.get_root_id())
2156
result += merge.merge_inner(
2161
change_reporter=change_reporter)
2295
# determine the branch point
2296
graph = self.branch.repository.get_graph()
2297
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2299
base_tree = self.branch.repository.revision_tree(base_rev_id)
2301
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2303
change_reporter=change_reporter)
2304
self.set_last_revision(revision)
2305
2164
# TODO - dedup parents list with things merged by pull ?
2306
2165
# reuse the tree we've updated to to set the basis:
2307
parent_trees = [(revision, to_tree)]
2166
parent_trees = [(self.branch.last_revision(), to_tree)]
2308
2167
merges = self.get_parent_ids()[1:]
2309
2168
# Ideally we ask the tree for the trees here, that way the working
2310
# tree can decide whether to give us the entire tree or give us a
2169
# tree can decide whether to give us teh entire tree or give us a
2311
2170
# lazy initialised tree. dirstate for instance will have the trees
2312
2171
# in ram already, whereas a last-revision + basis-inventory tree
2313
2172
# will not, but also does not need them when setting parents.
2314
2173
for parent in merges:
2315
2174
parent_trees.append(
2316
2175
(parent, self.branch.repository.revision_tree(parent)))
2317
if not _mod_revision.is_null(old_tip):
2176
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2318
2177
parent_trees.append(
2319
2178
(old_tip, self.branch.repository.revision_tree(old_tip)))
2320
2179
self.set_parent_trees(parent_trees)
2321
2180
last_rev = parent_trees[0][0]
2182
# the working tree had the same last-revision as the master
2183
# branch did. We may still have pivot local work from the local
2184
# branch into old_tip:
2185
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2186
self.add_parent_tree_id(old_tip)
2187
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2188
and old_tip != last_rev):
2189
# our last revision was not the prior branch last revision
2190
# and we have converted that last revision to a pending merge.
2191
# base is somewhere between the branch tip now
2192
# and the now pending merge
2194
# Since we just modified the working tree and inventory, flush out
2195
# the current state, before we modify it again.
2196
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2197
# requires it only because TreeTransform directly munges the
2198
# inventory and calls tree._write_inventory(). Ultimately we
2199
# should be able to remove this extra flush.
2201
graph = self.branch.repository.get_graph()
2202
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2204
base_tree = self.branch.repository.revision_tree(base_rev_id)
2205
other_tree = self.branch.repository.revision_tree(old_tip)
2206
result += merge.merge_inner(
2211
change_reporter=change_reporter)
2324
2214
def _write_hashcache_if_dirty(self):
2325
2215
"""Write out the hashcache if it is dirty."""
2523
2411
# FIXME: stash the node in pending
2524
2412
entry = inv[top_id]
2525
if entry.kind == 'directory':
2526
for name, child in entry.sorted_children():
2527
dirblock.append((relroot + name, name, child.kind, None,
2528
child.file_id, child.kind
2413
for name, child in entry.sorted_children():
2414
dirblock.append((relroot + name, name, child.kind, None,
2415
child.file_id, child.kind
2530
2417
yield (currentdir[0], entry.file_id), dirblock
2531
2418
# push the user specified dirs from dirblock
2532
2419
for dir in reversed(dirblock):
2598
def _get_rules_searcher(self, default_searcher):
2599
"""See Tree._get_rules_searcher."""
2600
if self._rules_searcher is None:
2601
self._rules_searcher = super(WorkingTree,
2602
self)._get_rules_searcher(default_searcher)
2603
return self._rules_searcher
2605
def get_shelf_manager(self):
2606
"""Return the ShelfManager for this WorkingTree."""
2607
from bzrlib.shelf import ShelfManager
2608
return ShelfManager(self, self._transport)
2611
2467
class WorkingTree2(WorkingTree):
2612
2468
"""This is the Format 2 working tree.
2614
This was the first weave based working tree.
2470
This was the first weave based working tree.
2615
2471
- uses os locks for locking.
2616
2472
- uses the branch last-revision.
2848
2685
"""See WorkingTreeFormat.get_format_description()."""
2849
2686
return "Working tree format 2"
2851
def _stub_initialize_on_transport(self, transport, file_mode):
2852
"""Workaround: create control files for a remote working tree.
2688
def _stub_initialize_remote(self, branch):
2689
"""As a special workaround create critical control files for a remote working tree.
2854
2691
This ensures that it can later be updated and dealt with locally,
2855
since BzrDirFormat6 and BzrDirFormat5 cannot represent dirs with
2692
since BzrDirFormat6 and BzrDirFormat5 cannot represent dirs with
2856
2693
no working tree. (See bug #43064).
2858
2695
sio = StringIO()
2859
inv = inventory.Inventory()
2860
2697
xml5.serializer_v5.write_inventory(inv, sio, working=True)
2862
transport.put_file('inventory', sio, file_mode)
2863
transport.put_bytes('pending-merges', '', file_mode)
2699
branch._transport.put_file('inventory', sio,
2700
mode=branch.control_files._file_mode)
2701
branch._transport.put_bytes('pending-merges', '',
2702
mode=branch.control_files._file_mode)
2865
2705
def initialize(self, a_bzrdir, revision_id=None, from_branch=None,
2866
2706
accelerator_tree=None, hardlink=False):