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.lock import LogicalLockResult
81
from bzrlib.lockable_files import LockableFiles
87
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
88
from bzrlib.lockable_files import LockableFiles, TransportLock
82
89
from bzrlib.lockdir import LockDir
83
90
import bzrlib.mutabletree
84
91
from bzrlib.mutabletree import needs_tree_write_lock
85
92
from bzrlib import osutils
86
93
from bzrlib.osutils import (
94
103
supports_executable,
96
from bzrlib.filters import filtered_input_file
97
105
from bzrlib.trace import mutter, note
98
106
from bzrlib.transport.local import LocalTransport
99
from bzrlib.revision import CURRENT_REVISION
107
from bzrlib.progress import DummyProgress, ProgressPhase
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
100
109
from bzrlib.rio import RioReader, rio_file, Stanza
101
from bzrlib.symbol_versioning import (
103
DEPRECATED_PARAMETER,
110
from bzrlib.symbol_versioning import (deprecated_passed,
113
DEPRECATED_PARAMETER,
107
117
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
108
# TODO: Modifying the conflict objects or their type is currently nearly
109
# impossible as there is no clear relationship between the working tree format
110
# and the conflict list file format.
111
118
CONFLICT_HEADER_1 = "BZR conflict list format 1"
113
120
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
286
278
self._control_files.break_lock()
287
279
self.branch.break_lock()
289
def _get_check_refs(self):
290
"""Return the references needed to perform a check of this tree.
292
The default implementation returns no refs, and is only suitable for
293
trees that have no local caching and can commit on ghosts at any time.
295
:seealso: bzrlib.check for details about check_refs.
299
281
def requires_rich_root(self):
300
282
return self._format.requires_rich_root
302
284
def supports_tree_reference(self):
305
def supports_content_filtering(self):
306
return self._format.supports_content_filtering()
308
def supports_views(self):
309
return self.views.supports_views()
311
287
def _set_inventory(self, inv, dirty):
312
288
"""Set the internal cached inventory.
447
423
def has_filename(self, filename):
448
424
return osutils.lexists(self.abspath(filename))
450
def get_file(self, file_id, path=None, filtered=True):
451
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
453
def get_file_with_stat(self, file_id, path=None, filtered=True,
455
"""See Tree.get_file_with_stat."""
426
def get_file(self, file_id, path=None):
457
428
path = self.id2path(file_id)
458
file_obj = self.get_file_byname(path, filtered=False)
459
stat_value = _fstat(file_obj.fileno())
460
if filtered and self.supports_content_filtering():
461
filters = self._content_filter_stack(path)
462
file_obj = filtered_input_file(file_obj, filters)
463
return (file_obj, stat_value)
465
def get_file_text(self, file_id, path=None, filtered=True):
466
return self.get_file(file_id, path=path, filtered=filtered).read()
468
def get_file_byname(self, filename, filtered=True):
469
path = self.abspath(filename)
471
if filtered and self.supports_content_filtering():
472
filters = self._content_filter_stack(filename)
473
return filtered_input_file(f, filters)
477
def get_file_lines(self, file_id, path=None, filtered=True):
478
"""See Tree.get_file_lines()"""
479
file = self.get_file(file_id, path, filtered=filtered)
481
return file.readlines()
429
return self.get_file_byname(path)
431
def get_file_text(self, file_id):
432
return self.get_file(file_id).read()
434
def get_file_byname(self, filename):
435
return file(self.abspath(filename), 'rb')
486
438
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
493
445
incorrectly attributed to CURRENT_REVISION (but after committing, the
494
446
attribution will be correct).
496
maybe_file_parent_keys = []
497
for parent_id in self.get_parent_ids():
499
parent_tree = self.revision_tree(parent_id)
500
except errors.NoSuchRevisionInTree:
501
parent_tree = self.branch.repository.revision_tree(parent_id)
502
parent_tree.lock_read()
504
if file_id not in parent_tree:
506
ie = parent_tree.inventory[file_id]
507
if ie.kind != 'file':
508
# Note: this is slightly unnecessary, because symlinks and
509
# directories have a "text" which is the empty text, and we
510
# know that won't mess up annotations. But it seems cleaner
512
parent_text_key = (file_id, ie.revision)
513
if parent_text_key not in maybe_file_parent_keys:
514
maybe_file_parent_keys.append(parent_text_key)
517
graph = _mod_graph.Graph(self.branch.repository.texts)
518
heads = graph.heads(maybe_file_parent_keys)
519
file_parent_keys = []
520
for key in maybe_file_parent_keys:
522
file_parent_keys.append(key)
524
# Now we have the parents of this content
525
annotator = self.branch.repository.texts.get_annotator()
526
text = self.get_file(file_id).read()
527
this_key =(file_id, default_revision)
528
annotator.add_special_text(this_key, file_parent_keys, text)
529
annotations = [(key[-1], line)
530
for key, line in annotator.annotate_flat(this_key)]
448
basis = self.basis_tree()
451
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
452
require_versioned=True).next()
453
changed_content, kind = changes[2], changes[6]
454
if not changed_content:
455
return basis.annotate_iter(file_id)
459
if kind[0] != 'file':
462
old_lines = list(basis.annotate_iter(file_id))
464
for tree in self.branch.repository.revision_trees(
465
self.get_parent_ids()[1:]):
466
if file_id not in tree:
468
old.append(list(tree.annotate_iter(file_id)))
469
return annotate.reannotate(old, self.get_file(file_id).readlines(),
533
474
def _get_ancestors(self, default_revision):
534
475
ancestors = set([default_revision])
768
707
kind = 'tree-reference'
769
708
return kind, None, None, None
770
709
elif kind == 'symlink':
771
target = osutils.readlink(abspath)
772
return ('symlink', None, None, target)
710
return ('symlink', None, None, os.readlink(abspath))
774
712
return (kind, None, None, None)
776
def _file_content_summary(self, path, stat_result):
777
size = stat_result.st_size
778
executable = self._is_executable_from_path_and_stat(path, stat_result)
779
# try for a stat cache lookup
780
return ('file', size, executable, self._sha_from_stat(
783
714
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
784
715
"""Common ghost checking functionality from set_parent_*.
915
846
branch.last_revision().
917
848
from bzrlib.merge import Merger, Merge3Merger
918
merger = Merger(self.branch, this_tree=self)
919
# check that there are no local alterations
920
if not force and self.has_changes():
921
raise errors.UncommittedChanges(self)
922
if to_revision is None:
923
to_revision = _mod_revision.ensure_null(branch.last_revision())
924
merger.other_rev_id = to_revision
925
if _mod_revision.is_null(merger.other_rev_id):
926
raise errors.NoCommits(branch)
927
self.branch.fetch(branch, last_revision=merger.other_rev_id)
928
merger.other_basis = merger.other_rev_id
929
merger.other_tree = self.branch.repository.revision_tree(
931
merger.other_branch = branch
932
if from_revision is None:
935
merger.set_base_revision(from_revision, branch)
936
if merger.base_rev_id == merger.other_rev_id:
937
raise errors.PointlessMerge
938
merger.backup_files = False
939
if merge_type is None:
940
merger.merge_type = Merge3Merger
942
merger.merge_type = merge_type
943
merger.set_interesting_files(None)
944
merger.show_base = False
945
merger.reprocess = False
946
conflicts = merger.do_merge()
849
pb = bzrlib.ui.ui_factory.nested_progress_bar()
851
merger = Merger(self.branch, this_tree=self, pb=pb)
852
merger.pp = ProgressPhase("Merge phase", 5, pb)
853
merger.pp.next_phase()
854
# check that there are no
856
merger.check_basis(check_clean=True, require_commits=False)
857
if to_revision is None:
858
to_revision = _mod_revision.ensure_null(branch.last_revision())
859
merger.other_rev_id = to_revision
860
if _mod_revision.is_null(merger.other_rev_id):
861
raise errors.NoCommits(branch)
862
self.branch.fetch(branch, last_revision=merger.other_rev_id)
863
merger.other_basis = merger.other_rev_id
864
merger.other_tree = self.branch.repository.revision_tree(
866
merger.other_branch = branch
867
merger.pp.next_phase()
868
if from_revision is None:
871
merger.set_base_revision(from_revision, branch)
872
if merger.base_rev_id == merger.other_rev_id:
873
raise errors.PointlessMerge
874
merger.backup_files = False
875
if merge_type is None:
876
merger.merge_type = Merge3Merger
878
merger.merge_type = merge_type
879
merger.set_interesting_files(None)
880
merger.show_base = False
881
merger.reprocess = False
882
conflicts = merger.do_merge()
951
889
def merge_modified(self):
952
890
"""Return a dictionary of files modified by a merge.
954
The list is initialized by WorkingTree.set_merge_modified, which is
892
The list is initialized by WorkingTree.set_merge_modified, which is
955
893
typically called after we make some automatic updates to the tree
956
894
because of a merge.
1097
1033
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1098
1034
if tree_transport.base != branch_transport.base:
1099
1035
tree_bzrdir = format.initialize_on_transport(tree_transport)
1100
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1101
target_branch=new_branch)
1036
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1103
1038
tree_bzrdir = branch_bzrdir
1104
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1039
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1105
1040
wt.set_parent_ids(self.get_parent_ids())
1106
1041
my_inv = self.inventory
1107
child_inv = inventory.Inventory(root_id=None)
1042
child_inv = Inventory(root_id=None)
1108
1043
new_root = my_inv[file_id]
1109
1044
my_inv.remove_recursive_id(file_id)
1110
1045
new_root.parent_id = None
1129
1064
self._serialize(self._inventory, sio)
1131
1066
self._transport.put_file('inventory', sio,
1132
mode=self.bzrdir._get_file_mode())
1067
mode=self._control_files._file_mode)
1133
1068
self._inventory_is_modified = False
1135
1070
def _kind(self, relpath):
1136
1071
return osutils.file_kind(self.abspath(relpath))
1138
def list_files(self, include_root=False, from_dir=None, recursive=True):
1139
"""List all files as (path, class, kind, id, entry).
1073
def list_files(self, include_root=False):
1074
"""Recursively list all files as (path, class, kind, id, entry).
1141
1076
Lists, but does not descend into unversioned directories.
1142
1078
This does not include files that have been deleted in this
1143
tree. Skips the control directory.
1145
:param include_root: if True, return an entry for the root
1146
:param from_dir: start from this directory or None for the root
1147
:param recursive: whether to recurse into subdirectories or not
1081
Skips the control directory.
1149
1083
# list_files is an iterator, so @needs_read_lock doesn't work properly
1150
1084
# with it. So callers should be careful to always read_lock the tree.
1165
1099
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1167
1101
# directory file_id, relative path, absolute path, reverse sorted children
1168
if from_dir is not None:
1169
from_dir_id = inv.path2id(from_dir)
1170
if from_dir_id is None:
1171
# Directory not versioned
1173
from_dir_abspath = pathjoin(self.basedir, from_dir)
1175
from_dir_id = inv.root.file_id
1176
from_dir_abspath = self.basedir
1177
children = os.listdir(from_dir_abspath)
1102
children = os.listdir(self.basedir)
1178
1103
children.sort()
1179
# jam 20060527 The kernel sized tree seems equivalent whether we
1104
# jam 20060527 The kernel sized tree seems equivalent whether we
1180
1105
# use a deque and popleft to keep them sorted, or if we use a plain
1181
1106
# list and just reverse() them.
1182
1107
children = collections.deque(children)
1183
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1108
stack = [(inv.root.file_id, u'', self.basedir, children)]
1185
1110
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1240
1165
except KeyError:
1241
1166
yield fp[1:], c, fk, None, TreeEntry()
1244
1169
if fk != 'directory':
1247
# But do this child first if recursing down
1249
new_children = os.listdir(fap)
1251
new_children = collections.deque(new_children)
1252
stack.append((f_ie.file_id, fp, fap, new_children))
1253
# Break out of inner loop,
1254
# so that we start outer loop with child
1172
# But do this child first
1173
new_children = os.listdir(fap)
1175
new_children = collections.deque(new_children)
1176
stack.append((f_ie.file_id, fp, fap, new_children))
1177
# Break out of inner loop,
1178
# so that we start outer loop with child
1257
1181
# if we finished all children, pop it off the stack
1494
1417
from_tail = splitpath(from_rel)[-1]
1495
1418
from_id = inv.path2id(from_rel)
1496
1419
if from_id is None:
1497
# if file is missing in the inventory maybe it's in the basis_tree
1498
basis_tree = self.branch.basis_tree()
1499
from_id = basis_tree.path2id(from_rel)
1501
raise errors.BzrRenameFailedError(from_rel,to_rel,
1502
errors.NotVersionedError(path=str(from_rel)))
1503
# put entry back in the inventory so we can rename it
1504
from_entry = basis_tree.inventory[from_id].copy()
1507
from_entry = inv[from_id]
1420
raise errors.BzrRenameFailedError(from_rel,to_rel,
1421
errors.NotVersionedError(path=str(from_rel)))
1422
from_entry = inv[from_id]
1508
1423
from_parent_id = from_entry.parent_id
1509
1424
to_dir, to_tail = os.path.split(to_rel)
1510
1425
to_dir_id = inv.path2id(to_dir)
1572
1487
:raises: NoSuchId if any fileid is not currently versioned.
1574
1489
for file_id in file_ids:
1575
if file_id not in self._inventory:
1576
raise errors.NoSuchId(self, file_id)
1577
for file_id in file_ids:
1578
1490
if self._inventory.has_id(file_id):
1579
1491
self._inventory.remove_recursive_id(file_id)
1493
raise errors.NoSuchId(self, file_id)
1580
1494
if len(file_ids):
1581
# in the future this should just set a dirty bit to wait for the
1495
# in the future this should just set a dirty bit to wait for the
1582
1496
# final unlock. However, until all methods of workingtree start
1583
# with the current in -memory inventory rather than triggering
1497
# with the current in -memory inventory rather than triggering
1584
1498
# a read, it is more complex - we need to teach read_inventory
1585
1499
# to know when to read, and when to not read first... and possibly
1586
1500
# to save first when the in memory one may be corrupted.
1587
1501
# so for now, we just only write it if it is indeed dirty.
1588
1502
# - RBC 20060907
1589
1503
self._write_inventory(self._inventory)
1591
1505
def _iter_conflicts(self):
1592
1506
conflicted = set()
1593
1507
for info in self.list_files():
1602
1516
@needs_write_lock
1603
1517
def pull(self, source, overwrite=False, stop_revision=None,
1604
change_reporter=None, possible_transports=None, local=False):
1518
change_reporter=None, possible_transports=None):
1519
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1605
1520
source.lock_read()
1522
pp = ProgressPhase("Pull phase", 2, top_pb)
1607
1524
old_revision_info = self.branch.last_revision_info()
1608
1525
basis_tree = self.basis_tree()
1609
1526
count = self.branch.pull(source, overwrite, stop_revision,
1610
possible_transports=possible_transports,
1527
possible_transports=possible_transports)
1612
1528
new_revision_info = self.branch.last_revision_info()
1613
1529
if new_revision_info != old_revision_info:
1614
1531
repository = self.branch.repository
1532
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1615
1533
basis_tree.lock_read()
1617
1535
new_basis_tree = self.branch.basis_tree()
1620
1538
new_basis_tree,
1622
1540
this_tree=self,
1624
1542
change_reporter=change_reporter)
1625
basis_root_id = basis_tree.get_root_id()
1626
new_root_id = new_basis_tree.get_root_id()
1627
if basis_root_id != new_root_id:
1628
self.set_root_id(new_root_id)
1543
if (basis_tree.inventory.root is None and
1544
new_basis_tree.inventory.root is not None):
1545
self.set_root_id(new_basis_tree.get_root_id())
1630
1548
basis_tree.unlock()
1631
1549
# TODO - dedup parents list with things merged by pull ?
1632
1550
# reuse the revisiontree we merged against to set the new
1634
1552
parent_trees = [(self.branch.last_revision(), new_basis_tree)]
1635
# we have to pull the merge trees out again, because
1636
# merge_inner has set the ids. - this corner is not yet
1553
# we have to pull the merge trees out again, because
1554
# merge_inner has set the ids. - this corner is not yet
1637
1555
# layered well enough to prevent double handling.
1638
1556
# XXX TODO: Fix the double handling: telling the tree about
1639
1557
# the already known parent data is wasteful.
1799
1716
raise errors.ObjectNotLocked(self)
1801
1718
def lock_read(self):
1802
"""Lock the tree for reading.
1804
This also locks the branch, and can be unlocked via self.unlock().
1806
:return: A bzrlib.lock.LogicalLockResult.
1719
"""See Branch.lock_read, and WorkingTree.unlock."""
1808
1720
if not self.is_locked():
1809
1721
self._reset_data()
1810
1722
self.branch.lock_read()
1812
self._control_files.lock_read()
1813
return LogicalLockResult(self.unlock)
1724
return self._control_files.lock_read()
1815
1726
self.branch.unlock()
1818
1729
def lock_tree_write(self):
1819
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1821
:return: A bzrlib.lock.LogicalLockResult.
1730
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1823
1731
if not self.is_locked():
1824
1732
self._reset_data()
1825
1733
self.branch.lock_read()
1827
self._control_files.lock_write()
1828
return LogicalLockResult(self.unlock)
1735
return self._control_files.lock_write()
1830
1737
self.branch.unlock()
1833
1740
def lock_write(self):
1834
"""See MutableTree.lock_write, and WorkingTree.unlock.
1836
:return: A bzrlib.lock.LogicalLockResult.
1741
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1838
1742
if not self.is_locked():
1839
1743
self._reset_data()
1840
1744
self.branch.lock_write()
1842
self._control_files.lock_write()
1843
return LogicalLockResult(self.unlock)
1746
return self._control_files.lock_write()
1845
1748
self.branch.unlock()
1901
1800
# as commit already has that ready-to-use [while the format is the
1902
1801
# same, that is].
1904
# this double handles the inventory - unpack and repack -
1803
# this double handles the inventory - unpack and repack -
1905
1804
# but is easier to understand. We can/should put a conditional
1906
1805
# in here based on whether the inventory is in the latest format
1907
1806
# - perhaps we should repack all inventories on a repository
1909
1808
# the fast path is to copy the raw xml from the repository. If the
1910
# xml contains 'revision_id="', then we assume the right
1809
# xml contains 'revision_id="', then we assume the right
1911
1810
# revision_id is set. We must check for this full string, because a
1912
1811
# root node id can legitimately look like 'revision_id' but cannot
1913
1812
# contain a '"'.
1914
xml = self.branch.repository._get_inventory_xml(new_revision)
1813
xml = self.branch.repository.get_inventory_xml(new_revision)
1915
1814
firstline = xml.split('\n', 1)[0]
1916
if (not 'revision_id="' in firstline or
1815
if (not 'revision_id="' in firstline or
1917
1816
'format="7"' not in firstline):
1918
inv = self.branch.repository._serializer.read_inventory_from_string(
1817
inv = self.branch.repository.deserialise_inventory(
1920
1819
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1921
1820
self._write_basis_inventory(xml)
1922
1821
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1926
1825
"""Read the cached basis inventory."""
1927
1826
path = self._basis_inventory_name()
1928
1827
return self._transport.get_bytes(path)
1930
1829
@needs_read_lock
1931
1830
def read_working_inventory(self):
1932
1831
"""Read the working inventory.
1934
1833
:raises errors.InventoryModified: read_working_inventory will fail
1935
1834
when the current in memory inventory has been modified.
1937
# conceptually this should be an implementation detail of the tree.
1836
# conceptually this should be an implementation detail of the tree.
1938
1837
# XXX: Deprecate this.
1939
1838
# ElementTree does its own conversion from UTF-8, so open in
1941
1840
if self._inventory_is_modified:
1942
1841
raise errors.InventoryModified(self)
1943
f = self._transport.get('inventory')
1945
result = self._deserialize(f)
1842
result = self._deserialize(self._transport.get('inventory'))
1948
1843
self._set_inventory(result, dirty=False)
2194
2086
def unlock(self):
2195
2087
"""See Branch.unlock.
2197
2089
WorkingTree locking just uses the Branch locking facilities.
2198
2090
This is current because all working trees have an embedded branch
2199
2091
within them. IF in the future, we were to make branch data shareable
2200
between multiple working trees, i.e. via shared storage, then we
2092
between multiple working trees, i.e. via shared storage, then we
2201
2093
would probably want to lock both the local tree, and the branch.
2203
2095
raise NotImplementedError(self.unlock)
2207
def update(self, change_reporter=None, possible_transports=None,
2208
revision=None, old_tip=_marker):
2097
def update(self, change_reporter=None, possible_transports=None):
2209
2098
"""Update a working tree along its branch.
2211
2100
This will update the branch if its bound too, which means we have
2265
2147
# cant set that until we update the working trees last revision to be
2266
2148
# one from the new branch, because it will just get absorbed by the
2267
2149
# parent de-duplication logic.
2269
2151
# We MUST save it even if an error occurs, because otherwise the users
2270
2152
# local work is unreferenced and will appear to have been lost.
2274
2156
last_rev = self.get_parent_ids()[0]
2275
2157
except IndexError:
2276
2158
last_rev = _mod_revision.NULL_REVISION
2277
if revision is None:
2278
revision = self.branch.last_revision()
2280
old_tip = old_tip or _mod_revision.NULL_REVISION
2282
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2283
# the branch we are bound to was updated
2284
# merge those changes in first
2285
base_tree = self.basis_tree()
2286
other_tree = self.branch.repository.revision_tree(old_tip)
2287
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2288
base_tree, this_tree=self,
2289
change_reporter=change_reporter)
2291
self.add_parent_tree((old_tip, other_tree))
2292
trace.note('Rerun update after fixing the conflicts.')
2295
if last_rev != _mod_revision.ensure_null(revision):
2296
# the working tree is up to date with the branch
2297
# we can merge the specified revision from master
2298
to_tree = self.branch.repository.revision_tree(revision)
2299
to_root_id = to_tree.get_root_id()
2159
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2160
# merge tree state up to new branch tip.
2301
2161
basis = self.basis_tree()
2302
2162
basis.lock_read()
2304
if (basis.inventory.root is None
2305
or basis.inventory.root.file_id != to_root_id):
2306
self.set_root_id(to_root_id)
2164
to_tree = self.branch.basis_tree()
2165
if basis.inventory.root is None:
2166
self.set_root_id(to_tree.get_root_id())
2168
result += merge.merge_inner(
2173
change_reporter=change_reporter)
2311
# determine the branch point
2312
graph = self.branch.repository.get_graph()
2313
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2315
base_tree = self.branch.repository.revision_tree(base_rev_id)
2317
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2319
change_reporter=change_reporter)
2320
self.set_last_revision(revision)
2321
2176
# TODO - dedup parents list with things merged by pull ?
2322
2177
# reuse the tree we've updated to to set the basis:
2323
parent_trees = [(revision, to_tree)]
2178
parent_trees = [(self.branch.last_revision(), to_tree)]
2324
2179
merges = self.get_parent_ids()[1:]
2325
2180
# Ideally we ask the tree for the trees here, that way the working
2326
# tree can decide whether to give us the entire tree or give us a
2181
# tree can decide whether to give us teh entire tree or give us a
2327
2182
# lazy initialised tree. dirstate for instance will have the trees
2328
2183
# in ram already, whereas a last-revision + basis-inventory tree
2329
2184
# will not, but also does not need them when setting parents.
2330
2185
for parent in merges:
2331
2186
parent_trees.append(
2332
2187
(parent, self.branch.repository.revision_tree(parent)))
2333
if not _mod_revision.is_null(old_tip):
2188
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2334
2189
parent_trees.append(
2335
2190
(old_tip, self.branch.repository.revision_tree(old_tip)))
2336
2191
self.set_parent_trees(parent_trees)
2337
2192
last_rev = parent_trees[0][0]
2194
# the working tree had the same last-revision as the master
2195
# branch did. We may still have pivot local work from the local
2196
# branch into old_tip:
2197
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2198
self.add_parent_tree_id(old_tip)
2199
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2200
and old_tip != last_rev):
2201
# our last revision was not the prior branch last revision
2202
# and we have converted that last revision to a pending merge.
2203
# base is somewhere between the branch tip now
2204
# and the now pending merge
2206
# Since we just modified the working tree and inventory, flush out
2207
# the current state, before we modify it again.
2208
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2209
# requires it only because TreeTransform directly munges the
2210
# inventory and calls tree._write_inventory(). Ultimately we
2211
# should be able to remove this extra flush.
2213
graph = self.branch.repository.get_graph()
2214
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2216
base_tree = self.branch.repository.revision_tree(base_rev_id)
2217
other_tree = self.branch.repository.revision_tree(old_tip)
2218
result += merge.merge_inner(
2223
change_reporter=change_reporter)
2340
2226
def _write_hashcache_if_dirty(self):
2341
2227
"""Write out the hashcache if it is dirty."""