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.
446
423
def has_filename(self, filename):
447
424
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."""
426
def get_file(self, file_id, path=None):
456
428
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()
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')
485
438
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
492
445
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
446
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)]
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(),
532
474
def _get_ancestors(self, default_revision):
533
475
ancestors = set([default_revision])
767
707
kind = 'tree-reference'
768
708
return kind, None, None, None
769
709
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
710
return ('symlink', None, None, os.readlink(abspath))
773
712
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
714
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
715
"""Common ghost checking functionality from set_parent_*.
914
846
branch.last_revision().
916
848
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()
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()
950
889
def merge_modified(self):
951
890
"""Return a dictionary of files modified by a merge.
953
The list is initialized by WorkingTree.set_merge_modified, which is
892
The list is initialized by WorkingTree.set_merge_modified, which is
954
893
typically called after we make some automatic updates to the tree
955
894
because of a merge.
961
900
hashfile = self._transport.get('merge-hashes')
962
901
except errors.NoSuchFile:
967
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
968
raise errors.MergeModifiedFormatError()
969
except StopIteration:
905
if hashfile.next() != MERGE_MODIFIED_HEADER_1 + '\n':
970
906
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
907
except StopIteration:
908
raise errors.MergeModifiedFormatError()
909
for s in RioReader(hashfile):
910
# RioReader reads in Unicode, so convert file_ids back to utf8
911
file_id = osutils.safe_file_id(s.get("file_id"), warn=False)
912
if file_id not in self.inventory:
914
text_hash = s.get("hash")
915
if text_hash == self.get_file_sha1(file_id):
916
merge_hashes[file_id] = text_hash
983
919
@needs_write_lock
984
920
def mkdir(self, path, file_id=None):
1096
1030
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1031
if tree_transport.base != branch_transport.base:
1098
1032
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1033
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1035
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1036
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1037
wt.set_parent_ids(self.get_parent_ids())
1105
1038
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1039
child_inv = Inventory(root_id=None)
1107
1040
new_root = my_inv[file_id]
1108
1041
my_inv.remove_recursive_id(file_id)
1109
1042
new_root.parent_id = None
1128
1061
self._serialize(self._inventory, sio)
1130
1063
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1064
mode=self._control_files._file_mode)
1132
1065
self._inventory_is_modified = False
1134
1067
def _kind(self, relpath):
1135
1068
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).
1070
def list_files(self, include_root=False):
1071
"""Recursively list all files as (path, class, kind, id, entry).
1140
1073
Lists, but does not descend into unversioned directories.
1141
1075
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
1078
Skips the control directory.
1148
1080
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1081
# with it. So callers should be careful to always read_lock the tree.
1164
1096
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1098
# 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)
1099
children = os.listdir(self.basedir)
1177
1100
children.sort()
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1101
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1102
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1103
# list and just reverse() them.
1181
1104
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1105
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1107
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1239
1162
except KeyError:
1240
1163
yield fp[1:], c, fk, None, TreeEntry()
1243
1166
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
1169
# But do this child first
1170
new_children = os.listdir(fap)
1172
new_children = collections.deque(new_children)
1173
stack.append((f_ie.file_id, fp, fap, new_children))
1174
# Break out of inner loop,
1175
# so that we start outer loop with child
1256
1178
# if we finished all children, pop it off the stack
1493
1414
from_tail = splitpath(from_rel)[-1]
1494
1415
from_id = inv.path2id(from_rel)
1495
1416
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]
1417
raise errors.BzrRenameFailedError(from_rel,to_rel,
1418
errors.NotVersionedError(path=str(from_rel)))
1419
from_entry = inv[from_id]
1507
1420
from_parent_id = from_entry.parent_id
1508
1421
to_dir, to_tail = os.path.split(to_rel)
1509
1422
to_dir_id = inv.path2id(to_dir)
1571
1484
:raises: NoSuchId if any fileid is not currently versioned.
1573
1486
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
1487
if self._inventory.has_id(file_id):
1578
1488
self._inventory.remove_recursive_id(file_id)
1490
raise errors.NoSuchId(self, file_id)
1579
1491
if len(file_ids):
1580
# in the future this should just set a dirty bit to wait for the
1492
# in the future this should just set a dirty bit to wait for the
1581
1493
# final unlock. However, until all methods of workingtree start
1582
# with the current in -memory inventory rather than triggering
1494
# with the current in -memory inventory rather than triggering
1583
1495
# a read, it is more complex - we need to teach read_inventory
1584
1496
# to know when to read, and when to not read first... and possibly
1585
1497
# to save first when the in memory one may be corrupted.
1586
1498
# so for now, we just only write it if it is indeed dirty.
1587
1499
# - RBC 20060907
1588
1500
self._write_inventory(self._inventory)
1590
1502
def _iter_conflicts(self):
1591
1503
conflicted = set()
1592
1504
for info in self.list_files():
1601
1513
@needs_write_lock
1602
1514
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1515
change_reporter=None, possible_transports=None):
1516
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1517
source.lock_read()
1519
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1521
old_revision_info = self.branch.last_revision_info()
1607
1522
basis_tree = self.basis_tree()
1608
1523
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1524
possible_transports=possible_transports)
1611
1525
new_revision_info = self.branch.last_revision_info()
1612
1526
if new_revision_info != old_revision_info:
1613
1528
repository = self.branch.repository
1529
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1530
basis_tree.lock_read()
1616
1532
new_basis_tree = self.branch.basis_tree()
1619
1535
new_basis_tree,
1621
1537
this_tree=self,
1623
1539
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)
1540
if (basis_tree.inventory.root is None and
1541
new_basis_tree.inventory.root is not None):
1542
self.set_root_id(new_basis_tree.get_root_id())
1629
1545
basis_tree.unlock()
1630
1546
# TODO - dedup parents list with things merged by pull ?
1631
1547
# reuse the revisiontree we merged against to set the new
1633
1549
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
1550
# we have to pull the merge trees out again, because
1551
# merge_inner has set the ids. - this corner is not yet
1636
1552
# layered well enough to prevent double handling.
1637
1553
# XXX TODO: Fix the double handling: telling the tree about
1638
1554
# the already known parent data is wasteful.
1886
1797
# as commit already has that ready-to-use [while the format is the
1887
1798
# same, that is].
1889
# this double handles the inventory - unpack and repack -
1800
# this double handles the inventory - unpack and repack -
1890
1801
# but is easier to understand. We can/should put a conditional
1891
1802
# in here based on whether the inventory is in the latest format
1892
1803
# - perhaps we should repack all inventories on a repository
1894
1805
# the fast path is to copy the raw xml from the repository. If the
1895
# xml contains 'revision_id="', then we assume the right
1806
# xml contains 'revision_id="', then we assume the right
1896
1807
# revision_id is set. We must check for this full string, because a
1897
1808
# root node id can legitimately look like 'revision_id' but cannot
1898
1809
# contain a '"'.
1899
xml = self.branch.repository._get_inventory_xml(new_revision)
1810
xml = self.branch.repository.get_inventory_xml(new_revision)
1900
1811
firstline = xml.split('\n', 1)[0]
1901
if (not 'revision_id="' in firstline or
1812
if (not 'revision_id="' in firstline or
1902
1813
'format="7"' not in firstline):
1903
inv = self.branch.repository._serializer.read_inventory_from_string(
1814
inv = self.branch.repository.deserialise_inventory(
1905
1816
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1906
1817
self._write_basis_inventory(xml)
1907
1818
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1911
1822
"""Read the cached basis inventory."""
1912
1823
path = self._basis_inventory_name()
1913
1824
return self._transport.get_bytes(path)
1915
1826
@needs_read_lock
1916
1827
def read_working_inventory(self):
1917
1828
"""Read the working inventory.
1919
1830
:raises errors.InventoryModified: read_working_inventory will fail
1920
1831
when the current in memory inventory has been modified.
1922
# conceptually this should be an implementation detail of the tree.
1833
# conceptually this should be an implementation detail of the tree.
1923
1834
# XXX: Deprecate this.
1924
1835
# ElementTree does its own conversion from UTF-8, so open in
1926
1837
if self._inventory_is_modified:
1927
1838
raise errors.InventoryModified(self)
1928
f = self._transport.get('inventory')
1930
result = self._deserialize(f)
1839
result = self._deserialize(self._transport.get('inventory'))
1933
1840
self._set_inventory(result, dirty=False)
2178
2083
def unlock(self):
2179
2084
"""See Branch.unlock.
2181
2086
WorkingTree locking just uses the Branch locking facilities.
2182
2087
This is current because all working trees have an embedded branch
2183
2088
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
2089
between multiple working trees, i.e. via shared storage, then we
2185
2090
would probably want to lock both the local tree, and the branch.
2187
2092
raise NotImplementedError(self.unlock)
2191
def update(self, change_reporter=None, possible_transports=None,
2192
revision=None, old_tip=_marker):
2094
def update(self, change_reporter=None, possible_transports=None):
2193
2095
"""Update a working tree along its branch.
2195
2097
This will update the branch if its bound too, which means we have
2249
2144
# cant set that until we update the working trees last revision to be
2250
2145
# one from the new branch, because it will just get absorbed by the
2251
2146
# parent de-duplication logic.
2253
2148
# We MUST save it even if an error occurs, because otherwise the users
2254
2149
# local work is unreferenced and will appear to have been lost.
2258
2153
last_rev = self.get_parent_ids()[0]
2259
2154
except IndexError:
2260
2155
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()
2156
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2157
# merge tree state up to new branch tip.
2285
2158
basis = self.basis_tree()
2286
2159
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)
2161
to_tree = self.branch.basis_tree()
2162
if basis.inventory.root is None:
2163
self.set_root_id(to_tree.get_root_id())
2165
result += merge.merge_inner(
2170
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
2173
# TODO - dedup parents list with things merged by pull ?
2306
2174
# reuse the tree we've updated to to set the basis:
2307
parent_trees = [(revision, to_tree)]
2175
parent_trees = [(self.branch.last_revision(), to_tree)]
2308
2176
merges = self.get_parent_ids()[1:]
2309
2177
# 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
2178
# tree can decide whether to give us teh entire tree or give us a
2311
2179
# lazy initialised tree. dirstate for instance will have the trees
2312
2180
# in ram already, whereas a last-revision + basis-inventory tree
2313
2181
# will not, but also does not need them when setting parents.
2314
2182
for parent in merges:
2315
2183
parent_trees.append(
2316
2184
(parent, self.branch.repository.revision_tree(parent)))
2317
if not _mod_revision.is_null(old_tip):
2185
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2318
2186
parent_trees.append(
2319
2187
(old_tip, self.branch.repository.revision_tree(old_tip)))
2320
2188
self.set_parent_trees(parent_trees)
2321
2189
last_rev = parent_trees[0][0]
2191
# the working tree had the same last-revision as the master
2192
# branch did. We may still have pivot local work from the local
2193
# branch into old_tip:
2194
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2195
self.add_parent_tree_id(old_tip)
2196
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2197
and old_tip != last_rev):
2198
# our last revision was not the prior branch last revision
2199
# and we have converted that last revision to a pending merge.
2200
# base is somewhere between the branch tip now
2201
# and the now pending merge
2203
# Since we just modified the working tree and inventory, flush out
2204
# the current state, before we modify it again.
2205
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2206
# requires it only because TreeTransform directly munges the
2207
# inventory and calls tree._write_inventory(). Ultimately we
2208
# should be able to remove this extra flush.
2210
graph = self.branch.repository.get_graph()
2211
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2213
base_tree = self.branch.repository.revision_tree(base_rev_id)
2214
other_tree = self.branch.repository.revision_tree(old_tip)
2215
result += merge.merge_inner(
2220
change_reporter=change_reporter)
2324
2223
def _write_hashcache_if_dirty(self):
2325
2224
"""Write out the hashcache if it is dirty."""