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,
70
from bzrlib.workingtree_4 import (
80
from bzrlib.transport import get_transport
82
from bzrlib.workingtree_4 import WorkingTreeFormat4, WorkingTreeFormat5
77
85
from bzrlib import symbol_versioning
78
86
from bzrlib.decorators import needs_read_lock, needs_write_lock
79
from bzrlib.lock import LogicalLockResult
87
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
80
88
from bzrlib.lockable_files import LockableFiles
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
449
429
def has_filename(self, filename):
450
430
return osutils.lexists(self.abspath(filename))
452
def get_file(self, file_id, path=None, filtered=True):
453
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
432
def get_file(self, file_id, path=None):
433
return self.get_file_with_stat(file_id, path)[0]
455
def get_file_with_stat(self, file_id, path=None, filtered=True,
457
"""See Tree.get_file_with_stat."""
435
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
436
"""See MutableTree.get_file_with_stat."""
459
438
path = self.id2path(file_id)
460
file_obj = self.get_file_byname(path, filtered=False)
461
stat_value = _fstat(file_obj.fileno())
462
if filtered and self.supports_content_filtering():
463
filters = self._content_filter_stack(path)
464
file_obj = filtered_input_file(file_obj, filters)
465
return (file_obj, stat_value)
467
def get_file_text(self, file_id, path=None, filtered=True):
468
my_file = self.get_file(file_id, path=path, filtered=filtered)
470
return my_file.read()
474
def get_file_byname(self, filename, filtered=True):
475
path = self.abspath(filename)
477
if filtered and self.supports_content_filtering():
478
filters = self._content_filter_stack(filename)
479
return filtered_input_file(f, filters)
483
def get_file_lines(self, file_id, path=None, filtered=True):
439
file_obj = self.get_file_byname(path)
440
return (file_obj, _fstat(file_obj.fileno()))
442
def get_file_byname(self, filename):
443
return file(self.abspath(filename), 'rb')
445
def get_file_lines(self, file_id, path=None):
484
446
"""See Tree.get_file_lines()"""
485
file = self.get_file(file_id, path, filtered=filtered)
447
file = self.get_file(file_id, path)
487
449
return file.readlines()
499
461
incorrectly attributed to CURRENT_REVISION (but after committing, the
500
462
attribution will be correct).
502
maybe_file_parent_keys = []
503
for parent_id in self.get_parent_ids():
505
parent_tree = self.revision_tree(parent_id)
506
except errors.NoSuchRevisionInTree:
507
parent_tree = self.branch.repository.revision_tree(parent_id)
508
parent_tree.lock_read()
510
if file_id not in parent_tree:
512
ie = parent_tree.inventory[file_id]
513
if ie.kind != 'file':
514
# Note: this is slightly unnecessary, because symlinks and
515
# directories have a "text" which is the empty text, and we
516
# know that won't mess up annotations. But it seems cleaner
518
parent_text_key = (file_id, ie.revision)
519
if parent_text_key not in maybe_file_parent_keys:
520
maybe_file_parent_keys.append(parent_text_key)
523
graph = _mod_graph.Graph(self.branch.repository.texts)
524
heads = graph.heads(maybe_file_parent_keys)
525
file_parent_keys = []
526
for key in maybe_file_parent_keys:
528
file_parent_keys.append(key)
530
# Now we have the parents of this content
531
annotator = self.branch.repository.texts.get_annotator()
532
text = self.get_file_text(file_id)
533
this_key =(file_id, default_revision)
534
annotator.add_special_text(this_key, file_parent_keys, text)
535
annotations = [(key[-1], line)
536
for key, line in annotator.annotate_flat(this_key)]
464
basis = self.basis_tree()
467
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
468
require_versioned=True).next()
469
changed_content, kind = changes[2], changes[6]
470
if not changed_content:
471
return basis.annotate_iter(file_id)
475
if kind[0] != 'file':
478
old_lines = list(basis.annotate_iter(file_id))
480
for tree in self.branch.repository.revision_trees(
481
self.get_parent_ids()[1:]):
482
if file_id not in tree:
484
old.append(list(tree.annotate_iter(file_id)))
485
return annotate.reannotate(old, self.get_file(file_id).readlines(),
539
490
def _get_ancestors(self, default_revision):
540
491
ancestors = set([default_revision])
774
723
kind = 'tree-reference'
775
724
return kind, None, None, None
776
725
elif kind == 'symlink':
777
target = osutils.readlink(abspath)
778
return ('symlink', None, None, target)
726
return ('symlink', None, None, os.readlink(abspath.encode(osutils._fs_enc)))
780
728
return (kind, None, None, None)
782
def _file_content_summary(self, path, stat_result):
783
size = stat_result.st_size
784
executable = self._is_executable_from_path_and_stat(path, stat_result)
785
# try for a stat cache lookup
786
return ('file', size, executable, self._sha_from_stat(
789
730
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
790
731
"""Common ghost checking functionality from set_parent_*.
921
862
branch.last_revision().
923
864
from bzrlib.merge import Merger, Merge3Merger
924
merger = Merger(self.branch, this_tree=self)
925
# check that there are no local alterations
926
if not force and self.has_changes():
927
raise errors.UncommittedChanges(self)
928
if to_revision is None:
929
to_revision = _mod_revision.ensure_null(branch.last_revision())
930
merger.other_rev_id = to_revision
931
if _mod_revision.is_null(merger.other_rev_id):
932
raise errors.NoCommits(branch)
933
self.branch.fetch(branch, last_revision=merger.other_rev_id)
934
merger.other_basis = merger.other_rev_id
935
merger.other_tree = self.branch.repository.revision_tree(
937
merger.other_branch = branch
938
if from_revision is None:
941
merger.set_base_revision(from_revision, branch)
942
if merger.base_rev_id == merger.other_rev_id:
943
raise errors.PointlessMerge
944
merger.backup_files = False
945
if merge_type is None:
946
merger.merge_type = Merge3Merger
948
merger.merge_type = merge_type
949
merger.set_interesting_files(None)
950
merger.show_base = False
951
merger.reprocess = False
952
conflicts = merger.do_merge()
865
pb = bzrlib.ui.ui_factory.nested_progress_bar()
867
merger = Merger(self.branch, this_tree=self, pb=pb)
868
merger.pp = ProgressPhase("Merge phase", 5, pb)
869
merger.pp.next_phase()
870
# check that there are no
872
merger.check_basis(check_clean=True, require_commits=False)
873
if to_revision is None:
874
to_revision = _mod_revision.ensure_null(branch.last_revision())
875
merger.other_rev_id = to_revision
876
if _mod_revision.is_null(merger.other_rev_id):
877
raise errors.NoCommits(branch)
878
self.branch.fetch(branch, last_revision=merger.other_rev_id)
879
merger.other_basis = merger.other_rev_id
880
merger.other_tree = self.branch.repository.revision_tree(
882
merger.other_branch = branch
883
merger.pp.next_phase()
884
if from_revision is None:
887
merger.set_base_revision(from_revision, branch)
888
if merger.base_rev_id == merger.other_rev_id:
889
raise errors.PointlessMerge
890
merger.backup_files = False
891
if merge_type is None:
892
merger.merge_type = Merge3Merger
894
merger.merge_type = merge_type
895
merger.set_interesting_files(None)
896
merger.show_base = False
897
merger.reprocess = False
898
conflicts = merger.do_merge()
957
905
def merge_modified(self):
958
906
"""Return a dictionary of files modified by a merge.
960
The list is initialized by WorkingTree.set_merge_modified, which is
908
The list is initialized by WorkingTree.set_merge_modified, which is
961
909
typically called after we make some automatic updates to the tree
962
910
because of a merge.
1103
1049
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1104
1050
if tree_transport.base != branch_transport.base:
1105
1051
tree_bzrdir = format.initialize_on_transport(tree_transport)
1106
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1107
target_branch=new_branch)
1052
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1109
1054
tree_bzrdir = branch_bzrdir
1110
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1055
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1111
1056
wt.set_parent_ids(self.get_parent_ids())
1112
1057
my_inv = self.inventory
1113
child_inv = inventory.Inventory(root_id=None)
1058
child_inv = Inventory(root_id=None)
1114
1059
new_root = my_inv[file_id]
1115
1060
my_inv.remove_recursive_id(file_id)
1116
1061
new_root.parent_id = None
1135
1080
self._serialize(self._inventory, sio)
1137
1082
self._transport.put_file('inventory', sio,
1138
mode=self.bzrdir._get_file_mode())
1083
mode=self._control_files._file_mode)
1139
1084
self._inventory_is_modified = False
1141
1086
def _kind(self, relpath):
1142
1087
return osutils.file_kind(self.abspath(relpath))
1144
def list_files(self, include_root=False, from_dir=None, recursive=True):
1145
"""List all files as (path, class, kind, id, entry).
1089
def list_files(self, include_root=False):
1090
"""Recursively list all files as (path, class, kind, id, entry).
1147
1092
Lists, but does not descend into unversioned directories.
1148
1094
This does not include files that have been deleted in this
1149
tree. Skips the control directory.
1151
:param include_root: if True, return an entry for the root
1152
:param from_dir: start from this directory or None for the root
1153
:param recursive: whether to recurse into subdirectories or not
1097
Skips the control directory.
1155
1099
# list_files is an iterator, so @needs_read_lock doesn't work properly
1156
1100
# with it. So callers should be careful to always read_lock the tree.
1171
1115
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1173
1117
# directory file_id, relative path, absolute path, reverse sorted children
1174
if from_dir is not None:
1175
from_dir_id = inv.path2id(from_dir)
1176
if from_dir_id is None:
1177
# Directory not versioned
1179
from_dir_abspath = pathjoin(self.basedir, from_dir)
1181
from_dir_id = inv.root.file_id
1182
from_dir_abspath = self.basedir
1183
children = os.listdir(from_dir_abspath)
1118
children = os.listdir(self.basedir)
1184
1119
children.sort()
1185
# jam 20060527 The kernel sized tree seems equivalent whether we
1120
# jam 20060527 The kernel sized tree seems equivalent whether we
1186
1121
# use a deque and popleft to keep them sorted, or if we use a plain
1187
1122
# list and just reverse() them.
1188
1123
children = collections.deque(children)
1189
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1124
stack = [(inv.root.file_id, u'', self.basedir, children)]
1191
1126
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1246
1181
except KeyError:
1247
1182
yield fp[1:], c, fk, None, TreeEntry()
1250
1185
if fk != 'directory':
1253
# But do this child first if recursing down
1255
new_children = os.listdir(fap)
1257
new_children = collections.deque(new_children)
1258
stack.append((f_ie.file_id, fp, fap, new_children))
1259
# Break out of inner loop,
1260
# so that we start outer loop with child
1188
# But do this child first
1189
new_children = os.listdir(fap)
1191
new_children = collections.deque(new_children)
1192
stack.append((f_ie.file_id, fp, fap, new_children))
1193
# Break out of inner loop,
1194
# so that we start outer loop with child
1263
1197
# if we finished all children, pop it off the stack
1500
1433
from_tail = splitpath(from_rel)[-1]
1501
1434
from_id = inv.path2id(from_rel)
1502
1435
if from_id is None:
1503
# if file is missing in the inventory maybe it's in the basis_tree
1504
basis_tree = self.branch.basis_tree()
1505
from_id = basis_tree.path2id(from_rel)
1507
raise errors.BzrRenameFailedError(from_rel,to_rel,
1508
errors.NotVersionedError(path=str(from_rel)))
1509
# put entry back in the inventory so we can rename it
1510
from_entry = basis_tree.inventory[from_id].copy()
1513
from_entry = inv[from_id]
1436
raise errors.BzrRenameFailedError(from_rel,to_rel,
1437
errors.NotVersionedError(path=str(from_rel)))
1438
from_entry = inv[from_id]
1514
1439
from_parent_id = from_entry.parent_id
1515
1440
to_dir, to_tail = os.path.split(to_rel)
1516
1441
to_dir_id = inv.path2id(to_dir)
1578
1503
:raises: NoSuchId if any fileid is not currently versioned.
1580
1505
for file_id in file_ids:
1581
if file_id not in self._inventory:
1582
raise errors.NoSuchId(self, file_id)
1583
for file_id in file_ids:
1584
1506
if self._inventory.has_id(file_id):
1585
1507
self._inventory.remove_recursive_id(file_id)
1509
raise errors.NoSuchId(self, file_id)
1586
1510
if len(file_ids):
1587
# in the future this should just set a dirty bit to wait for the
1511
# in the future this should just set a dirty bit to wait for the
1588
1512
# final unlock. However, until all methods of workingtree start
1589
# with the current in -memory inventory rather than triggering
1513
# with the current in -memory inventory rather than triggering
1590
1514
# a read, it is more complex - we need to teach read_inventory
1591
1515
# to know when to read, and when to not read first... and possibly
1592
1516
# to save first when the in memory one may be corrupted.
1593
1517
# so for now, we just only write it if it is indeed dirty.
1594
1518
# - RBC 20060907
1595
1519
self._write_inventory(self._inventory)
1597
1521
def _iter_conflicts(self):
1598
1522
conflicted = set()
1599
1523
for info in self.list_files():
1608
1532
@needs_write_lock
1609
1533
def pull(self, source, overwrite=False, stop_revision=None,
1610
change_reporter=None, possible_transports=None, local=False):
1534
change_reporter=None, possible_transports=None):
1535
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1611
1536
source.lock_read()
1538
pp = ProgressPhase("Pull phase", 2, top_pb)
1613
1540
old_revision_info = self.branch.last_revision_info()
1614
1541
basis_tree = self.basis_tree()
1615
1542
count = self.branch.pull(source, overwrite, stop_revision,
1616
possible_transports=possible_transports,
1543
possible_transports=possible_transports)
1618
1544
new_revision_info = self.branch.last_revision_info()
1619
1545
if new_revision_info != old_revision_info:
1620
1547
repository = self.branch.repository
1548
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1621
1549
basis_tree.lock_read()
1623
1551
new_basis_tree = self.branch.basis_tree()
1626
1554
new_basis_tree,
1628
1556
this_tree=self,
1630
1558
change_reporter=change_reporter)
1631
basis_root_id = basis_tree.get_root_id()
1632
new_root_id = new_basis_tree.get_root_id()
1633
if basis_root_id != new_root_id:
1634
self.set_root_id(new_root_id)
1559
if (basis_tree.inventory.root is None and
1560
new_basis_tree.inventory.root is not None):
1561
self.set_root_id(new_basis_tree.get_root_id())
1636
1564
basis_tree.unlock()
1637
1565
# TODO - dedup parents list with things merged by pull ?
1638
1566
# reuse the revisiontree we merged against to set the new
1640
1568
parent_trees = [(self.branch.last_revision(), new_basis_tree)]
1641
# we have to pull the merge trees out again, because
1642
# merge_inner has set the ids. - this corner is not yet
1569
# we have to pull the merge trees out again, because
1570
# merge_inner has set the ids. - this corner is not yet
1643
1571
# layered well enough to prevent double handling.
1644
1572
# XXX TODO: Fix the double handling: telling the tree about
1645
1573
# the already known parent data is wasteful.
1805
1732
raise errors.ObjectNotLocked(self)
1807
1734
def lock_read(self):
1808
"""Lock the tree for reading.
1810
This also locks the branch, and can be unlocked via self.unlock().
1812
:return: A bzrlib.lock.LogicalLockResult.
1735
"""See Branch.lock_read, and WorkingTree.unlock."""
1814
1736
if not self.is_locked():
1815
1737
self._reset_data()
1816
1738
self.branch.lock_read()
1818
self._control_files.lock_read()
1819
return LogicalLockResult(self.unlock)
1740
return self._control_files.lock_read()
1821
1742
self.branch.unlock()
1824
1745
def lock_tree_write(self):
1825
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1827
:return: A bzrlib.lock.LogicalLockResult.
1746
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1829
1747
if not self.is_locked():
1830
1748
self._reset_data()
1831
1749
self.branch.lock_read()
1833
self._control_files.lock_write()
1834
return LogicalLockResult(self.unlock)
1751
return self._control_files.lock_write()
1836
1753
self.branch.unlock()
1839
1756
def lock_write(self):
1840
"""See MutableTree.lock_write, and WorkingTree.unlock.
1842
:return: A bzrlib.lock.LogicalLockResult.
1757
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1844
1758
if not self.is_locked():
1845
1759
self._reset_data()
1846
1760
self.branch.lock_write()
1848
self._control_files.lock_write()
1849
return LogicalLockResult(self.unlock)
1762
return self._control_files.lock_write()
1851
1764
self.branch.unlock()
1907
1816
# as commit already has that ready-to-use [while the format is the
1908
1817
# same, that is].
1910
# this double handles the inventory - unpack and repack -
1819
# this double handles the inventory - unpack and repack -
1911
1820
# but is easier to understand. We can/should put a conditional
1912
1821
# in here based on whether the inventory is in the latest format
1913
1822
# - perhaps we should repack all inventories on a repository
1915
1824
# the fast path is to copy the raw xml from the repository. If the
1916
# xml contains 'revision_id="', then we assume the right
1825
# xml contains 'revision_id="', then we assume the right
1917
1826
# revision_id is set. We must check for this full string, because a
1918
1827
# root node id can legitimately look like 'revision_id' but cannot
1919
1828
# contain a '"'.
1920
xml = self.branch.repository._get_inventory_xml(new_revision)
1829
xml = self.branch.repository.get_inventory_xml(new_revision)
1921
1830
firstline = xml.split('\n', 1)[0]
1922
if (not 'revision_id="' in firstline or
1831
if (not 'revision_id="' in firstline or
1923
1832
'format="7"' not in firstline):
1924
inv = self.branch.repository._serializer.read_inventory_from_string(
1833
inv = self.branch.repository.deserialise_inventory(
1926
1835
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1927
1836
self._write_basis_inventory(xml)
1928
1837
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1932
1841
"""Read the cached basis inventory."""
1933
1842
path = self._basis_inventory_name()
1934
1843
return self._transport.get_bytes(path)
1936
1845
@needs_read_lock
1937
1846
def read_working_inventory(self):
1938
1847
"""Read the working inventory.
1940
1849
:raises errors.InventoryModified: read_working_inventory will fail
1941
1850
when the current in memory inventory has been modified.
1943
# conceptually this should be an implementation detail of the tree.
1852
# conceptually this should be an implementation detail of the tree.
1944
1853
# XXX: Deprecate this.
1945
1854
# ElementTree does its own conversion from UTF-8, so open in
1947
1856
if self._inventory_is_modified:
1948
1857
raise errors.InventoryModified(self)
1949
f = self._transport.get('inventory')
1951
result = self._deserialize(f)
1858
result = self._deserialize(self._transport.get('inventory'))
1954
1859
self._set_inventory(result, dirty=False)
2200
2102
def unlock(self):
2201
2103
"""See Branch.unlock.
2203
2105
WorkingTree locking just uses the Branch locking facilities.
2204
2106
This is current because all working trees have an embedded branch
2205
2107
within them. IF in the future, we were to make branch data shareable
2206
between multiple working trees, i.e. via shared storage, then we
2108
between multiple working trees, i.e. via shared storage, then we
2207
2109
would probably want to lock both the local tree, and the branch.
2209
2111
raise NotImplementedError(self.unlock)
2213
def update(self, change_reporter=None, possible_transports=None,
2214
revision=None, old_tip=_marker):
2113
def update(self, change_reporter=None, possible_transports=None):
2215
2114
"""Update a working tree along its branch.
2217
2116
This will update the branch if its bound too, which means we have
2271
2163
# cant set that until we update the working trees last revision to be
2272
2164
# one from the new branch, because it will just get absorbed by the
2273
2165
# parent de-duplication logic.
2275
2167
# We MUST save it even if an error occurs, because otherwise the users
2276
2168
# local work is unreferenced and will appear to have been lost.
2280
2172
last_rev = self.get_parent_ids()[0]
2281
2173
except IndexError:
2282
2174
last_rev = _mod_revision.NULL_REVISION
2283
if revision is None:
2284
revision = self.branch.last_revision()
2286
old_tip = old_tip or _mod_revision.NULL_REVISION
2288
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2289
# the branch we are bound to was updated
2290
# merge those changes in first
2291
base_tree = self.basis_tree()
2292
other_tree = self.branch.repository.revision_tree(old_tip)
2293
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2294
base_tree, this_tree=self,
2295
change_reporter=change_reporter)
2297
self.add_parent_tree((old_tip, other_tree))
2298
trace.note('Rerun update after fixing the conflicts.')
2301
if last_rev != _mod_revision.ensure_null(revision):
2302
# the working tree is up to date with the branch
2303
# we can merge the specified revision from master
2304
to_tree = self.branch.repository.revision_tree(revision)
2305
to_root_id = to_tree.get_root_id()
2175
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2176
# merge tree state up to new branch tip.
2307
2177
basis = self.basis_tree()
2308
2178
basis.lock_read()
2310
if (basis.inventory.root is None
2311
or basis.inventory.root.file_id != to_root_id):
2312
self.set_root_id(to_root_id)
2180
to_tree = self.branch.basis_tree()
2181
if basis.inventory.root is None:
2182
self.set_root_id(to_tree.get_root_id())
2184
result += merge.merge_inner(
2189
change_reporter=change_reporter)
2317
# determine the branch point
2318
graph = self.branch.repository.get_graph()
2319
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2321
base_tree = self.branch.repository.revision_tree(base_rev_id)
2323
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2325
change_reporter=change_reporter)
2326
self.set_last_revision(revision)
2327
2192
# TODO - dedup parents list with things merged by pull ?
2328
2193
# reuse the tree we've updated to to set the basis:
2329
parent_trees = [(revision, to_tree)]
2194
parent_trees = [(self.branch.last_revision(), to_tree)]
2330
2195
merges = self.get_parent_ids()[1:]
2331
2196
# Ideally we ask the tree for the trees here, that way the working
2332
# tree can decide whether to give us the entire tree or give us a
2197
# tree can decide whether to give us teh entire tree or give us a
2333
2198
# lazy initialised tree. dirstate for instance will have the trees
2334
2199
# in ram already, whereas a last-revision + basis-inventory tree
2335
2200
# will not, but also does not need them when setting parents.
2336
2201
for parent in merges:
2337
2202
parent_trees.append(
2338
2203
(parent, self.branch.repository.revision_tree(parent)))
2339
if not _mod_revision.is_null(old_tip):
2204
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2340
2205
parent_trees.append(
2341
2206
(old_tip, self.branch.repository.revision_tree(old_tip)))
2342
2207
self.set_parent_trees(parent_trees)
2343
2208
last_rev = parent_trees[0][0]
2210
# the working tree had the same last-revision as the master
2211
# branch did. We may still have pivot local work from the local
2212
# branch into old_tip:
2213
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2214
self.add_parent_tree_id(old_tip)
2215
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2216
and old_tip != last_rev):
2217
# our last revision was not the prior branch last revision
2218
# and we have converted that last revision to a pending merge.
2219
# base is somewhere between the branch tip now
2220
# and the now pending merge
2222
# Since we just modified the working tree and inventory, flush out
2223
# the current state, before we modify it again.
2224
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2225
# requires it only because TreeTransform directly munges the
2226
# inventory and calls tree._write_inventory(). Ultimately we
2227
# should be able to remove this extra flush.
2229
graph = self.branch.repository.get_graph()
2230
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2232
base_tree = self.branch.repository.revision_tree(base_rev_id)
2233
other_tree = self.branch.repository.revision_tree(old_tip)
2234
result += merge.merge_inner(
2239
change_reporter=change_reporter)
2346
2242
def _write_hashcache_if_dirty(self):
2347
2243
"""Write out the hashcache if it is dirty."""