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
278
self._control_files.break_lock()
286
279
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
281
def requires_rich_root(self):
299
282
return self._format.requires_rich_root
301
284
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
287
def _set_inventory(self, inv, dirty):
311
288
"""Set the internal cached inventory.
424
399
return self.branch.repository.revision_tree(revision_id)
425
400
except (errors.RevisionNotPresent, errors.NoSuchRevision):
426
401
# 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
402
# occured. If the revision is present, its a problem, if its not
429
404
if self.branch.repository.has_revision(revision_id):
431
406
# the basis tree is a ghost so return an empty tree.
432
return self.branch.repository.revision_tree(
433
_mod_revision.NULL_REVISION)
407
return self.branch.repository.revision_tree(None)
435
409
def _cleanup(self):
436
410
self._flush_ignore_list_cache()
438
412
def relpath(self, path):
439
413
"""Return the local path portion from a given path.
441
The path may be absolute or relative. If its a relative path it is
415
The path may be absolute or relative. If its a relative path it is
442
416
interpreted relative to the python current working directory.
444
418
return osutils.relpath(self.basedir, path)
446
420
def has_filename(self, filename):
447
421
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."""
423
def get_file(self, file_id, path=None):
456
425
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()
426
return self.get_file_byname(path)
428
def get_file_text(self, file_id):
429
return self.get_file(file_id).read()
431
def get_file_byname(self, filename):
432
return file(self.abspath(filename), 'rb')
485
435
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
492
442
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
443
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)]
445
basis = self.basis_tree()
448
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
449
require_versioned=True).next()
450
changed_content, kind = changes[2], changes[6]
451
if not changed_content:
452
return basis.annotate_iter(file_id)
456
if kind[0] != 'file':
459
old_lines = list(basis.annotate_iter(file_id))
461
for tree in self.branch.repository.revision_trees(
462
self.get_parent_ids()[1:]):
463
if file_id not in tree:
465
old.append(list(tree.annotate_iter(file_id)))
466
return annotate.reannotate(old, self.get_file(file_id).readlines(),
532
471
def _get_ancestors(self, default_revision):
533
472
ancestors = set([default_revision])
570
509
def clone(self, to_bzrdir, revision_id=None):
571
510
"""Duplicate this working tree into to_bzr, including all state.
573
512
Specifically modified files are kept as modified, but
574
513
ignored and unknown files are discarded.
576
515
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
518
If not None, the cloned tree will have its last revision set to
519
revision, and and difference between the source trees last revision
581
520
and this one merged in.
583
522
# assumes the target bzr dir format is compatible.
584
result = to_bzrdir.create_workingtree()
523
result = self._format.initialize(to_bzrdir)
585
524
self.copy_content_into(result, revision_id)
767
704
kind = 'tree-reference'
768
705
return kind, None, None, None
769
706
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
707
return ('symlink', None, None, os.readlink(abspath))
773
709
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
711
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
712
"""Common ghost checking functionality from set_parent_*.
914
843
branch.last_revision().
916
845
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()
846
pb = bzrlib.ui.ui_factory.nested_progress_bar()
848
merger = Merger(self.branch, this_tree=self, pb=pb)
849
merger.pp = ProgressPhase("Merge phase", 5, pb)
850
merger.pp.next_phase()
851
# check that there are no
853
merger.check_basis(check_clean=True, require_commits=False)
854
if to_revision is None:
855
to_revision = _mod_revision.ensure_null(branch.last_revision())
856
merger.other_rev_id = to_revision
857
if _mod_revision.is_null(merger.other_rev_id):
858
raise errors.NoCommits(branch)
859
self.branch.fetch(branch, last_revision=merger.other_rev_id)
860
merger.other_basis = merger.other_rev_id
861
merger.other_tree = self.branch.repository.revision_tree(
863
merger.other_branch = branch
864
merger.pp.next_phase()
865
if from_revision is None:
868
merger.set_base_revision(from_revision, branch)
869
if merger.base_rev_id == merger.other_rev_id:
870
raise errors.PointlessMerge
871
merger.backup_files = False
872
if merge_type is None:
873
merger.merge_type = Merge3Merger
875
merger.merge_type = merge_type
876
merger.set_interesting_files(None)
877
merger.show_base = False
878
merger.reprocess = False
879
conflicts = merger.do_merge()
950
886
def merge_modified(self):
951
887
"""Return a dictionary of files modified by a merge.
953
The list is initialized by WorkingTree.set_merge_modified, which is
889
The list is initialized by WorkingTree.set_merge_modified, which is
954
890
typically called after we make some automatic updates to the tree
955
891
because of a merge.
961
897
hashfile = self._transport.get('merge-hashes')
962
898
except errors.NoSuchFile:
967
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
968
raise errors.MergeModifiedFormatError()
969
except StopIteration:
902
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
970
903
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
904
except StopIteration:
905
raise errors.MergeModifiedFormatError()
906
for s in RioReader(hashfile):
907
# RioReader reads in Unicode, so convert file_ids back to utf8
908
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
909
if file_id not in self.inventory:
911
text_hash = s.get("hash")
912
if text_hash == self.get_file_sha1(file_id):
913
merge_hashes[file_id] = text_hash
983
916
@needs_write_lock
984
917
def mkdir(self, path, file_id=None):
1096
1027
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1028
if tree_transport.base != branch_transport.base:
1098
1029
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1030
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1032
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1033
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1034
wt.set_parent_ids(self.get_parent_ids())
1105
1035
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1036
child_inv = Inventory(root_id=None)
1107
1037
new_root = my_inv[file_id]
1108
1038
my_inv.remove_recursive_id(file_id)
1109
1039
new_root.parent_id = None
1128
1058
self._serialize(self._inventory, sio)
1130
1060
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1061
mode=self._control_files._file_mode)
1132
1062
self._inventory_is_modified = False
1134
1064
def _kind(self, relpath):
1135
1065
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).
1067
def list_files(self, include_root=False):
1068
"""Recursively list all files as (path, class, kind, id, entry).
1140
1070
Lists, but does not descend into unversioned directories.
1141
1072
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
1075
Skips the control directory.
1148
1077
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1078
# with it. So callers should be careful to always read_lock the tree.
1164
1093
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1095
# 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)
1096
children = os.listdir(self.basedir)
1177
1097
children.sort()
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1098
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1099
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1100
# list and just reverse() them.
1181
1101
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1102
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1104
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1239
1159
except KeyError:
1240
1160
yield fp[1:], c, fk, None, TreeEntry()
1243
1163
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
1166
# But do this child first
1167
new_children = os.listdir(fap)
1169
new_children = collections.deque(new_children)
1170
stack.append((f_ie.file_id, fp, fap, new_children))
1171
# Break out of inner loop,
1172
# so that we start outer loop with child
1256
1175
# if we finished all children, pop it off the stack
1493
1411
from_tail = splitpath(from_rel)[-1]
1494
1412
from_id = inv.path2id(from_rel)
1495
1413
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]
1414
raise errors.BzrRenameFailedError(from_rel,to_rel,
1415
errors.NotVersionedError(path=str(from_rel)))
1416
from_entry = inv[from_id]
1507
1417
from_parent_id = from_entry.parent_id
1508
1418
to_dir, to_tail = os.path.split(to_rel)
1509
1419
to_dir_id = inv.path2id(to_dir)
1571
1481
:raises: NoSuchId if any fileid is not currently versioned.
1573
1483
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
1484
if self._inventory.has_id(file_id):
1578
1485
self._inventory.remove_recursive_id(file_id)
1487
raise errors.NoSuchId(self, file_id)
1579
1488
if len(file_ids):
1580
# in the future this should just set a dirty bit to wait for the
1489
# in the future this should just set a dirty bit to wait for the
1581
1490
# final unlock. However, until all methods of workingtree start
1582
# with the current in -memory inventory rather than triggering
1491
# with the current in -memory inventory rather than triggering
1583
1492
# a read, it is more complex - we need to teach read_inventory
1584
1493
# to know when to read, and when to not read first... and possibly
1585
1494
# to save first when the in memory one may be corrupted.
1586
1495
# so for now, we just only write it if it is indeed dirty.
1587
1496
# - RBC 20060907
1588
1497
self._write_inventory(self._inventory)
1590
1499
def _iter_conflicts(self):
1591
1500
conflicted = set()
1592
1501
for info in self.list_files():
1601
1510
@needs_write_lock
1602
1511
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1512
change_reporter=None, possible_transports=None):
1513
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1514
source.lock_read()
1516
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1518
old_revision_info = self.branch.last_revision_info()
1607
1519
basis_tree = self.basis_tree()
1608
1520
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1521
possible_transports=possible_transports)
1611
1522
new_revision_info = self.branch.last_revision_info()
1612
1523
if new_revision_info != old_revision_info:
1613
1525
repository = self.branch.repository
1526
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1527
basis_tree.lock_read()
1616
1529
new_basis_tree = self.branch.basis_tree()
1619
1532
new_basis_tree,
1621
1534
this_tree=self,
1623
1536
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)
1537
if (basis_tree.inventory.root is None and
1538
new_basis_tree.inventory.root is not None):
1539
self.set_root_id(new_basis_tree.get_root_id())
1629
1542
basis_tree.unlock()
1630
1543
# TODO - dedup parents list with things merged by pull ?
1631
1544
# reuse the revisiontree we merged against to set the new
1633
1546
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
1547
# we have to pull the merge trees out again, because
1548
# merge_inner has set the ids. - this corner is not yet
1636
1549
# layered well enough to prevent double handling.
1637
1550
# XXX TODO: Fix the double handling: telling the tree about
1638
1551
# the already known parent data is wasteful.
1798
1710
raise errors.ObjectNotLocked(self)
1800
1712
def lock_read(self):
1801
"""Lock the tree for reading.
1803
This also locks the branch, and can be unlocked via self.unlock().
1805
:return: An object with an unlock method which will release the lock
1713
"""See Branch.lock_read, and WorkingTree.unlock."""
1808
1714
if not self.is_locked():
1809
1715
self._reset_data()
1810
1716
self.branch.lock_read()
1812
self._control_files.lock_read()
1718
return self._control_files.lock_read()
1815
1720
self.branch.unlock()
1818
1723
def lock_tree_write(self):
1819
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1821
:return: An object with an unlock method which will release the lock
1724
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1824
1725
if not self.is_locked():
1825
1726
self._reset_data()
1826
1727
self.branch.lock_read()
1828
self._control_files.lock_write()
1729
return self._control_files.lock_write()
1831
1731
self.branch.unlock()
1834
1734
def lock_write(self):
1835
"""See MutableTree.lock_write, and WorkingTree.unlock.
1837
:return: An object with an unlock method which will release the lock
1735
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1840
1736
if not self.is_locked():
1841
1737
self._reset_data()
1842
1738
self.branch.lock_write()
1844
self._control_files.lock_write()
1740
return self._control_files.lock_write()
1847
1742
self.branch.unlock()
1903
1794
# as commit already has that ready-to-use [while the format is the
1904
1795
# same, that is].
1906
# this double handles the inventory - unpack and repack -
1797
# this double handles the inventory - unpack and repack -
1907
1798
# but is easier to understand. We can/should put a conditional
1908
1799
# in here based on whether the inventory is in the latest format
1909
1800
# - perhaps we should repack all inventories on a repository
1911
1802
# the fast path is to copy the raw xml from the repository. If the
1912
# xml contains 'revision_id="', then we assume the right
1803
# xml contains 'revision_id="', then we assume the right
1913
1804
# revision_id is set. We must check for this full string, because a
1914
1805
# root node id can legitimately look like 'revision_id' but cannot
1915
1806
# contain a '"'.
1916
xml = self.branch.repository._get_inventory_xml(new_revision)
1807
xml = self.branch.repository.get_inventory_xml(new_revision)
1917
1808
firstline = xml.split('\n', 1)[0]
1918
if (not 'revision_id="' in firstline or
1809
if (not 'revision_id="' in firstline or
1919
1810
'format="7"' not in firstline):
1920
inv = self.branch.repository._serializer.read_inventory_from_string(
1811
inv = self.branch.repository.deserialise_inventory(
1922
1813
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1923
1814
self._write_basis_inventory(xml)
1924
1815
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1928
1819
"""Read the cached basis inventory."""
1929
1820
path = self._basis_inventory_name()
1930
1821
return self._transport.get_bytes(path)
1932
1823
@needs_read_lock
1933
1824
def read_working_inventory(self):
1934
1825
"""Read the working inventory.
1936
1827
:raises errors.InventoryModified: read_working_inventory will fail
1937
1828
when the current in memory inventory has been modified.
1939
# conceptually this should be an implementation detail of the tree.
1830
# conceptually this should be an implementation detail of the tree.
1940
1831
# XXX: Deprecate this.
1941
1832
# ElementTree does its own conversion from UTF-8, so open in
1943
1834
if self._inventory_is_modified:
1944
1835
raise errors.InventoryModified(self)
1945
f = self._transport.get('inventory')
1947
result = self._deserialize(f)
1836
result = self._deserialize(self._transport.get('inventory'))
1950
1837
self._set_inventory(result, dirty=False)
1968
1855
new_files=set()
1969
1856
unknown_nested_files=set()
1971
to_file = sys.stdout
1973
1858
def recurse_directory_to_add_files(directory):
1974
1859
# Recurse directory and add all files
1975
1860
# so we can check if they have changed.
1976
1861
for parent_info, file_infos in\
1977
self.walkdirs(directory):
1978
for relpath, basename, kind, lstat, fileid, kind in file_infos:
1862
osutils.walkdirs(self.abspath(directory),
1864
for relpath, basename, kind, lstat, abspath in file_infos:
1979
1865
# Is it versioned or ignored?
1980
1866
if self.path2id(relpath) or self.is_ignored(relpath):
1981
1867
# Add nested content for deletion.
2195
2082
def unlock(self):
2196
2083
"""See Branch.unlock.
2198
2085
WorkingTree locking just uses the Branch locking facilities.
2199
2086
This is current because all working trees have an embedded branch
2200
2087
within them. IF in the future, we were to make branch data shareable
2201
between multiple working trees, i.e. via shared storage, then we
2088
between multiple working trees, i.e. via shared storage, then we
2202
2089
would probably want to lock both the local tree, and the branch.
2204
2091
raise NotImplementedError(self.unlock)
2208
def update(self, change_reporter=None, possible_transports=None,
2209
revision=None, old_tip=_marker):
2093
def update(self, change_reporter=None, possible_transports=None):
2210
2094
"""Update a working tree along its branch.
2212
2096
This will update the branch if its bound too, which means we have
2266
2143
# cant set that until we update the working trees last revision to be
2267
2144
# one from the new branch, because it will just get absorbed by the
2268
2145
# parent de-duplication logic.
2270
2147
# We MUST save it even if an error occurs, because otherwise the users
2271
2148
# local work is unreferenced and will appear to have been lost.
2275
2152
last_rev = self.get_parent_ids()[0]
2276
2153
except IndexError:
2277
2154
last_rev = _mod_revision.NULL_REVISION
2278
if revision is None:
2279
revision = self.branch.last_revision()
2281
old_tip = old_tip or _mod_revision.NULL_REVISION
2283
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2284
# the branch we are bound to was updated
2285
# merge those changes in first
2286
base_tree = self.basis_tree()
2287
other_tree = self.branch.repository.revision_tree(old_tip)
2288
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2289
base_tree, this_tree=self,
2290
change_reporter=change_reporter)
2292
self.add_parent_tree((old_tip, other_tree))
2293
trace.note('Rerun update after fixing the conflicts.')
2296
if last_rev != _mod_revision.ensure_null(revision):
2297
# the working tree is up to date with the branch
2298
# we can merge the specified revision from master
2299
to_tree = self.branch.repository.revision_tree(revision)
2300
to_root_id = to_tree.get_root_id()
2155
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2156
# merge tree state up to new branch tip.
2302
2157
basis = self.basis_tree()
2303
2158
basis.lock_read()
2305
if (basis.inventory.root is None
2306
or basis.inventory.root.file_id != to_root_id):
2307
self.set_root_id(to_root_id)
2160
to_tree = self.branch.basis_tree()
2161
if basis.inventory.root is None:
2162
self.set_root_id(to_tree.get_root_id())
2164
result += merge.merge_inner(
2169
change_reporter=change_reporter)
2312
# determine the branch point
2313
graph = self.branch.repository.get_graph()
2314
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2316
base_tree = self.branch.repository.revision_tree(base_rev_id)
2318
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2320
change_reporter=change_reporter)
2321
self.set_last_revision(revision)
2322
2172
# TODO - dedup parents list with things merged by pull ?
2323
2173
# reuse the tree we've updated to to set the basis:
2324
parent_trees = [(revision, to_tree)]
2174
parent_trees = [(self.branch.last_revision(), to_tree)]
2325
2175
merges = self.get_parent_ids()[1:]
2326
2176
# Ideally we ask the tree for the trees here, that way the working
2327
# tree can decide whether to give us the entire tree or give us a
2177
# tree can decide whether to give us teh entire tree or give us a
2328
2178
# lazy initialised tree. dirstate for instance will have the trees
2329
2179
# in ram already, whereas a last-revision + basis-inventory tree
2330
2180
# will not, but also does not need them when setting parents.
2331
2181
for parent in merges:
2332
2182
parent_trees.append(
2333
2183
(parent, self.branch.repository.revision_tree(parent)))
2334
if not _mod_revision.is_null(old_tip):
2184
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2335
2185
parent_trees.append(
2336
2186
(old_tip, self.branch.repository.revision_tree(old_tip)))
2337
2187
self.set_parent_trees(parent_trees)
2338
2188
last_rev = parent_trees[0][0]
2190
# the working tree had the same last-revision as the master
2191
# branch did. We may still have pivot local work from the local
2192
# branch into old_tip:
2193
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2194
self.add_parent_tree_id(old_tip)
2195
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2196
and old_tip != last_rev):
2197
# our last revision was not the prior branch last revision
2198
# and we have converted that last revision to a pending merge.
2199
# base is somewhere between the branch tip now
2200
# and the now pending merge
2202
# Since we just modified the working tree and inventory, flush out
2203
# the current state, before we modify it again.
2204
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2205
# requires it only because TreeTransform directly munges the
2206
# inventory and calls tree._write_inventory(). Ultimately we
2207
# should be able to remove this extra flush.
2209
graph = self.branch.repository.get_graph()
2210
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2212
base_tree = self.branch.repository.revision_tree(base_rev_id)
2213
other_tree = self.branch.repository.revision_tree(old_tip)
2214
result += merge.merge_inner(
2219
change_reporter=change_reporter)
2341
2222
def _write_hashcache_if_dirty(self):
2342
2223
"""Write out the hashcache if it is dirty."""
2540
2419
# FIXME: stash the node in pending
2541
2420
entry = inv[top_id]
2542
if entry.kind == 'directory':
2543
for name, child in entry.sorted_children():
2544
dirblock.append((relroot + name, name, child.kind, None,
2545
child.file_id, child.kind
2421
for name, child in entry.sorted_children():
2422
dirblock.append((relroot + name, name, child.kind, None,
2423
child.file_id, child.kind
2547
2425
yield (currentdir[0], entry.file_id), dirblock
2548
2426
# push the user specified dirs from dirblock
2549
2427
for dir in reversed(dirblock):
2869
2715
"""See WorkingTreeFormat.get_format_description()."""
2870
2716
return "Working tree format 2"
2872
def _stub_initialize_on_transport(self, transport, file_mode):
2873
"""Workaround: create control files for a remote working tree.
2718
def _stub_initialize_remote(self, branch):
2719
"""As a special workaround create critical control files for a remote working tree.
2875
2721
This ensures that it can later be updated and dealt with locally,
2876
since BzrDirFormat6 and BzrDirFormat5 cannot represent dirs with
2722
since BzrDirFormat6 and BzrDirFormat5 cannot represent dirs with
2877
2723
no working tree. (See bug #43064).
2879
2725
sio = StringIO()
2880
inv = inventory.Inventory()
2881
2727
xml5.serializer_v5.write_inventory(inv, sio, working=True)
2883
transport.put_file('inventory', sio, file_mode)
2884
transport.put_bytes('pending-merges', '', file_mode)
2729
branch._transport.put_file('inventory', sio,
2730
mode=branch.control_files._file_mode)
2731
branch._transport.put_bytes('pending-merges', '',
2732
mode=branch.control_files._file_mode)
2886
2735
def initialize(self, a_bzrdir, revision_id=None, from_branch=None,
2887
2736
accelerator_tree=None, hardlink=False):