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
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
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]
426
def get_file(self, file_id, path=None):
427
return self.get_file_with_stat(file_id, path)[0]
452
def get_file_with_stat(self, file_id, path=None, filtered=True,
454
"""See Tree.get_file_with_stat."""
429
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
430
"""See MutableTree.get_file_with_stat."""
456
432
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):
433
file_obj = self.get_file_byname(path)
434
return (file_obj, _fstat(file_obj.fileno()))
436
def get_file_byname(self, filename):
437
return file(self.abspath(filename), 'rb')
439
def get_file_lines(self, file_id, path=None):
477
440
"""See Tree.get_file_lines()"""
478
file = self.get_file(file_id, path, filtered=filtered)
441
file = self.get_file(file_id, path)
480
443
return file.readlines()
492
455
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
456
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)]
458
basis = self.basis_tree()
461
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
462
require_versioned=True).next()
463
changed_content, kind = changes[2], changes[6]
464
if not changed_content:
465
return basis.annotate_iter(file_id)
469
if kind[0] != 'file':
472
old_lines = list(basis.annotate_iter(file_id))
474
for tree in self.branch.repository.revision_trees(
475
self.get_parent_ids()[1:]):
476
if file_id not in tree:
478
old.append(list(tree.annotate_iter(file_id)))
479
return annotate.reannotate(old, self.get_file(file_id).readlines(),
532
484
def _get_ancestors(self, default_revision):
533
485
ancestors = set([default_revision])
767
717
kind = 'tree-reference'
768
718
return kind, None, None, None
769
719
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
720
return ('symlink', None, None, os.readlink(abspath))
773
722
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
724
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
725
"""Common ghost checking functionality from set_parent_*.
914
856
branch.last_revision().
916
858
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()
859
pb = bzrlib.ui.ui_factory.nested_progress_bar()
861
merger = Merger(self.branch, this_tree=self, pb=pb)
862
merger.pp = ProgressPhase("Merge phase", 5, pb)
863
merger.pp.next_phase()
864
# check that there are no
866
merger.check_basis(check_clean=True, require_commits=False)
867
if to_revision is None:
868
to_revision = _mod_revision.ensure_null(branch.last_revision())
869
merger.other_rev_id = to_revision
870
if _mod_revision.is_null(merger.other_rev_id):
871
raise errors.NoCommits(branch)
872
self.branch.fetch(branch, last_revision=merger.other_rev_id)
873
merger.other_basis = merger.other_rev_id
874
merger.other_tree = self.branch.repository.revision_tree(
876
merger.other_branch = branch
877
merger.pp.next_phase()
878
if from_revision is None:
881
merger.set_base_revision(from_revision, branch)
882
if merger.base_rev_id == merger.other_rev_id:
883
raise errors.PointlessMerge
884
merger.backup_files = False
885
if merge_type is None:
886
merger.merge_type = Merge3Merger
888
merger.merge_type = merge_type
889
merger.set_interesting_files(None)
890
merger.show_base = False
891
merger.reprocess = False
892
conflicts = merger.do_merge()
950
899
def merge_modified(self):
951
900
"""Return a dictionary of files modified by a merge.
953
The list is initialized by WorkingTree.set_merge_modified, which is
902
The list is initialized by WorkingTree.set_merge_modified, which is
954
903
typically called after we make some automatic updates to the tree
955
904
because of a merge.
1096
1043
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1044
if tree_transport.base != branch_transport.base:
1098
1045
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1046
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1048
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1049
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1050
wt.set_parent_ids(self.get_parent_ids())
1105
1051
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1052
child_inv = Inventory(root_id=None)
1107
1053
new_root = my_inv[file_id]
1108
1054
my_inv.remove_recursive_id(file_id)
1109
1055
new_root.parent_id = None
1128
1074
self._serialize(self._inventory, sio)
1130
1076
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1077
mode=self._control_files._file_mode)
1132
1078
self._inventory_is_modified = False
1134
1080
def _kind(self, relpath):
1135
1081
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).
1083
def list_files(self, include_root=False):
1084
"""Recursively list all files as (path, class, kind, id, entry).
1140
1086
Lists, but does not descend into unversioned directories.
1141
1088
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
1091
Skips the control directory.
1148
1093
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1094
# with it. So callers should be careful to always read_lock the tree.
1164
1109
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1111
# 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)
1112
children = os.listdir(self.basedir)
1177
1113
children.sort()
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1114
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1115
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1116
# list and just reverse() them.
1181
1117
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1118
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1120
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1239
1175
except KeyError:
1240
1176
yield fp[1:], c, fk, None, TreeEntry()
1243
1179
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
1182
# But do this child first
1183
new_children = os.listdir(fap)
1185
new_children = collections.deque(new_children)
1186
stack.append((f_ie.file_id, fp, fap, new_children))
1187
# Break out of inner loop,
1188
# so that we start outer loop with child
1256
1191
# if we finished all children, pop it off the stack
1493
1427
from_tail = splitpath(from_rel)[-1]
1494
1428
from_id = inv.path2id(from_rel)
1495
1429
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]
1430
raise errors.BzrRenameFailedError(from_rel,to_rel,
1431
errors.NotVersionedError(path=str(from_rel)))
1432
from_entry = inv[from_id]
1507
1433
from_parent_id = from_entry.parent_id
1508
1434
to_dir, to_tail = os.path.split(to_rel)
1509
1435
to_dir_id = inv.path2id(to_dir)
1571
1497
:raises: NoSuchId if any fileid is not currently versioned.
1573
1499
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
1500
if self._inventory.has_id(file_id):
1578
1501
self._inventory.remove_recursive_id(file_id)
1503
raise errors.NoSuchId(self, file_id)
1579
1504
if len(file_ids):
1580
# in the future this should just set a dirty bit to wait for the
1505
# in the future this should just set a dirty bit to wait for the
1581
1506
# final unlock. However, until all methods of workingtree start
1582
# with the current in -memory inventory rather than triggering
1507
# with the current in -memory inventory rather than triggering
1583
1508
# a read, it is more complex - we need to teach read_inventory
1584
1509
# to know when to read, and when to not read first... and possibly
1585
1510
# to save first when the in memory one may be corrupted.
1586
1511
# so for now, we just only write it if it is indeed dirty.
1587
1512
# - RBC 20060907
1588
1513
self._write_inventory(self._inventory)
1590
1515
def _iter_conflicts(self):
1591
1516
conflicted = set()
1592
1517
for info in self.list_files():
1601
1526
@needs_write_lock
1602
1527
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1528
change_reporter=None, possible_transports=None):
1529
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1530
source.lock_read()
1532
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1534
old_revision_info = self.branch.last_revision_info()
1607
1535
basis_tree = self.basis_tree()
1608
1536
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1537
possible_transports=possible_transports)
1611
1538
new_revision_info = self.branch.last_revision_info()
1612
1539
if new_revision_info != old_revision_info:
1613
1541
repository = self.branch.repository
1542
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1543
basis_tree.lock_read()
1616
1545
new_basis_tree = self.branch.basis_tree()
1619
1548
new_basis_tree,
1621
1550
this_tree=self,
1623
1552
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)
1553
if (basis_tree.inventory.root is None and
1554
new_basis_tree.inventory.root is not None):
1555
self.set_root_id(new_basis_tree.get_root_id())
1629
1558
basis_tree.unlock()
1630
1559
# TODO - dedup parents list with things merged by pull ?
1631
1560
# reuse the revisiontree we merged against to set the new
1633
1562
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
1563
# we have to pull the merge trees out again, because
1564
# merge_inner has set the ids. - this corner is not yet
1636
1565
# layered well enough to prevent double handling.
1637
1566
# XXX TODO: Fix the double handling: telling the tree about
1638
1567
# the already known parent data is wasteful.
1886
1810
# as commit already has that ready-to-use [while the format is the
1887
1811
# same, that is].
1889
# this double handles the inventory - unpack and repack -
1813
# this double handles the inventory - unpack and repack -
1890
1814
# but is easier to understand. We can/should put a conditional
1891
1815
# in here based on whether the inventory is in the latest format
1892
1816
# - perhaps we should repack all inventories on a repository
1894
1818
# the fast path is to copy the raw xml from the repository. If the
1895
# xml contains 'revision_id="', then we assume the right
1819
# xml contains 'revision_id="', then we assume the right
1896
1820
# revision_id is set. We must check for this full string, because a
1897
1821
# root node id can legitimately look like 'revision_id' but cannot
1898
1822
# contain a '"'.
1899
xml = self.branch.repository._get_inventory_xml(new_revision)
1823
xml = self.branch.repository.get_inventory_xml(new_revision)
1900
1824
firstline = xml.split('\n', 1)[0]
1901
if (not 'revision_id="' in firstline or
1825
if (not 'revision_id="' in firstline or
1902
1826
'format="7"' not in firstline):
1903
inv = self.branch.repository._serializer.read_inventory_from_string(
1827
inv = self.branch.repository.deserialise_inventory(
1905
1829
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1906
1830
self._write_basis_inventory(xml)
1907
1831
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1911
1835
"""Read the cached basis inventory."""
1912
1836
path = self._basis_inventory_name()
1913
1837
return self._transport.get_bytes(path)
1915
1839
@needs_read_lock
1916
1840
def read_working_inventory(self):
1917
1841
"""Read the working inventory.
1919
1843
:raises errors.InventoryModified: read_working_inventory will fail
1920
1844
when the current in memory inventory has been modified.
1922
# conceptually this should be an implementation detail of the tree.
1846
# conceptually this should be an implementation detail of the tree.
1923
1847
# XXX: Deprecate this.
1924
1848
# ElementTree does its own conversion from UTF-8, so open in
1926
1850
if self._inventory_is_modified:
1927
1851
raise errors.InventoryModified(self)
1928
f = self._transport.get('inventory')
1930
result = self._deserialize(f)
1852
result = self._deserialize(self._transport.get('inventory'))
1933
1853
self._set_inventory(result, dirty=False)
2178
2096
def unlock(self):
2179
2097
"""See Branch.unlock.
2181
2099
WorkingTree locking just uses the Branch locking facilities.
2182
2100
This is current because all working trees have an embedded branch
2183
2101
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
2102
between multiple working trees, i.e. via shared storage, then we
2185
2103
would probably want to lock both the local tree, and the branch.
2187
2105
raise NotImplementedError(self.unlock)
2191
def update(self, change_reporter=None, possible_transports=None,
2192
revision=None, old_tip=_marker):
2107
def update(self, change_reporter=None, possible_transports=None):
2193
2108
"""Update a working tree along its branch.
2195
2110
This will update the branch if its bound too, which means we have
2249
2157
# cant set that until we update the working trees last revision to be
2250
2158
# one from the new branch, because it will just get absorbed by the
2251
2159
# parent de-duplication logic.
2253
2161
# We MUST save it even if an error occurs, because otherwise the users
2254
2162
# local work is unreferenced and will appear to have been lost.
2258
2166
last_rev = self.get_parent_ids()[0]
2259
2167
except IndexError:
2260
2168
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()
2169
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2170
# merge tree state up to new branch tip.
2285
2171
basis = self.basis_tree()
2286
2172
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)
2174
to_tree = self.branch.basis_tree()
2175
if basis.inventory.root is None:
2176
self.set_root_id(to_tree.get_root_id())
2178
result += merge.merge_inner(
2183
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
2186
# TODO - dedup parents list with things merged by pull ?
2306
2187
# reuse the tree we've updated to to set the basis:
2307
parent_trees = [(revision, to_tree)]
2188
parent_trees = [(self.branch.last_revision(), to_tree)]
2308
2189
merges = self.get_parent_ids()[1:]
2309
2190
# 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
2191
# tree can decide whether to give us teh entire tree or give us a
2311
2192
# lazy initialised tree. dirstate for instance will have the trees
2312
2193
# in ram already, whereas a last-revision + basis-inventory tree
2313
2194
# will not, but also does not need them when setting parents.
2314
2195
for parent in merges:
2315
2196
parent_trees.append(
2316
2197
(parent, self.branch.repository.revision_tree(parent)))
2317
if not _mod_revision.is_null(old_tip):
2198
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2318
2199
parent_trees.append(
2319
2200
(old_tip, self.branch.repository.revision_tree(old_tip)))
2320
2201
self.set_parent_trees(parent_trees)
2321
2202
last_rev = parent_trees[0][0]
2204
# the working tree had the same last-revision as the master
2205
# branch did. We may still have pivot local work from the local
2206
# branch into old_tip:
2207
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2208
self.add_parent_tree_id(old_tip)
2209
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2210
and old_tip != last_rev):
2211
# our last revision was not the prior branch last revision
2212
# and we have converted that last revision to a pending merge.
2213
# base is somewhere between the branch tip now
2214
# and the now pending merge
2216
# Since we just modified the working tree and inventory, flush out
2217
# the current state, before we modify it again.
2218
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2219
# requires it only because TreeTransform directly munges the
2220
# inventory and calls tree._write_inventory(). Ultimately we
2221
# should be able to remove this extra flush.
2223
graph = self.branch.repository.get_graph()
2224
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2226
base_tree = self.branch.repository.revision_tree(base_rev_id)
2227
other_tree = self.branch.repository.revision_tree(old_tip)
2228
result += merge.merge_inner(
2233
change_reporter=change_reporter)
2324
2236
def _write_hashcache_if_dirty(self):
2325
2237
"""Write out the hashcache if it is dirty."""