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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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
59
57
conflicts as _mod_conflicts,
67
66
revision as _mod_revision,
79
75
import bzrlib.branch
80
76
from bzrlib.transport import get_transport
82
from bzrlib.workingtree_4 import WorkingTreeFormat4
77
from bzrlib.workingtree_4 import (
85
84
from bzrlib import symbol_versioning
86
85
from bzrlib.decorators import needs_read_lock, needs_write_lock
87
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
88
from bzrlib.lockable_files import LockableFiles, TransportLock
86
from bzrlib.lockable_files import LockableFiles
89
87
from bzrlib.lockdir import LockDir
90
88
import bzrlib.mutabletree
91
89
from bzrlib.mutabletree import needs_tree_write_lock
92
90
from bzrlib import osutils
93
91
from bzrlib.osutils import (
103
99
supports_executable,
101
from bzrlib.filters import filtered_input_file
105
102
from bzrlib.trace import mutter, note
106
103
from bzrlib.transport.local import LocalTransport
107
from bzrlib.progress import DummyProgress, ProgressPhase
108
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
104
from bzrlib.progress import ProgressPhase
105
from bzrlib.revision import CURRENT_REVISION
109
106
from bzrlib.rio import RioReader, rio_file, Stanza
110
from bzrlib.symbol_versioning import (deprecated_passed,
113
DEPRECATED_PARAMETER,
107
from bzrlib.symbol_versioning import (
109
DEPRECATED_PARAMETER,
117
113
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
114
# TODO: Modifying the conflict objects or their type is currently nearly
115
# impossible as there is no clear relationship between the working tree format
116
# and the conflict list file format.
118
117
CONFLICT_HEADER_1 = "BZR conflict list format 1"
120
119
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
278
283
self._control_files.break_lock()
279
284
self.branch.break_lock()
286
def _get_check_refs(self):
287
"""Return the references needed to perform a check of this tree.
289
The default implementation returns no refs, and is only suitable for
290
trees that have no local caching and can commit on ghosts at any time.
292
:seealso: bzrlib.check for details about check_refs.
281
296
def requires_rich_root(self):
282
297
return self._format.requires_rich_root
284
299
def supports_tree_reference(self):
302
def supports_content_filtering(self):
303
return self._format.supports_content_filtering()
305
def supports_views(self):
306
return self.views.supports_views()
287
308
def _set_inventory(self, inv, dirty):
288
309
"""Set the internal cached inventory.
423
444
def has_filename(self, filename):
424
445
return osutils.lexists(self.abspath(filename))
426
def get_file(self, file_id, path=None):
427
return self.get_file_with_stat(file_id, path)[0]
447
def get_file(self, file_id, path=None, filtered=True):
448
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
429
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
430
"""See MutableTree.get_file_with_stat."""
450
def get_file_with_stat(self, file_id, path=None, filtered=True,
452
"""See Tree.get_file_with_stat."""
432
454
path = self.id2path(file_id)
433
file_obj = self.get_file_byname(path)
434
return (file_obj, _fstat(file_obj.fileno()))
436
def get_file_text(self, file_id):
437
return self.get_file(file_id).read()
439
def get_file_byname(self, filename):
440
return file(self.abspath(filename), 'rb')
455
file_obj = self.get_file_byname(path, filtered=False)
456
stat_value = _fstat(file_obj.fileno())
457
if filtered and self.supports_content_filtering():
458
filters = self._content_filter_stack(path)
459
file_obj = filtered_input_file(file_obj, filters)
460
return (file_obj, stat_value)
462
def get_file_text(self, file_id, path=None, filtered=True):
463
return self.get_file(file_id, path=path, filtered=filtered).read()
465
def get_file_byname(self, filename, filtered=True):
466
path = self.abspath(filename)
468
if filtered and self.supports_content_filtering():
469
filters = self._content_filter_stack(filename)
470
return filtered_input_file(f, filters)
474
def get_file_lines(self, file_id, path=None, filtered=True):
475
"""See Tree.get_file_lines()"""
476
file = self.get_file(file_id, path, filtered=filtered)
478
return file.readlines()
443
483
def annotate_iter(self, file_id, default_revision=CURRENT_REVISION):
450
490
incorrectly attributed to CURRENT_REVISION (but after committing, the
451
491
attribution will be correct).
453
basis = self.basis_tree()
456
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
457
require_versioned=True).next()
458
changed_content, kind = changes[2], changes[6]
459
if not changed_content:
460
return basis.annotate_iter(file_id)
464
if kind[0] != 'file':
467
old_lines = list(basis.annotate_iter(file_id))
469
for tree in self.branch.repository.revision_trees(
470
self.get_parent_ids()[1:]):
471
if file_id not in tree:
473
old.append(list(tree.annotate_iter(file_id)))
474
return annotate.reannotate(old, self.get_file(file_id).readlines(),
493
maybe_file_parent_keys = []
494
for parent_id in self.get_parent_ids():
496
parent_tree = self.revision_tree(parent_id)
497
except errors.NoSuchRevisionInTree:
498
parent_tree = self.branch.repository.revision_tree(parent_id)
499
parent_tree.lock_read()
501
if file_id not in parent_tree:
503
ie = parent_tree.inventory[file_id]
504
if ie.kind != 'file':
505
# Note: this is slightly unnecessary, because symlinks and
506
# directories have a "text" which is the empty text, and we
507
# know that won't mess up annotations. But it seems cleaner
509
parent_text_key = (file_id, ie.revision)
510
if parent_text_key not in maybe_file_parent_keys:
511
maybe_file_parent_keys.append(parent_text_key)
514
graph = _mod_graph.Graph(self.branch.repository.texts)
515
heads = graph.heads(maybe_file_parent_keys)
516
file_parent_keys = []
517
for key in maybe_file_parent_keys:
519
file_parent_keys.append(key)
521
# Now we have the parents of this content
522
annotator = self.branch.repository.texts.get_annotator()
523
text = self.get_file(file_id).read()
524
this_key =(file_id, default_revision)
525
annotator.add_special_text(this_key, file_parent_keys, text)
526
annotations = [(key[-1], line)
527
for key, line in annotator.annotate_flat(this_key)]
479
530
def _get_ancestors(self, default_revision):
480
531
ancestors = set([default_revision])
712
765
kind = 'tree-reference'
713
766
return kind, None, None, None
714
767
elif kind == 'symlink':
715
return ('symlink', None, None, os.readlink(abspath))
768
target = osutils.readlink(abspath)
769
return ('symlink', None, None, target)
717
771
return (kind, None, None, None)
773
def _file_content_summary(self, path, stat_result):
774
size = stat_result.st_size
775
executable = self._is_executable_from_path_and_stat(path, stat_result)
776
# try for a stat cache lookup
777
return ('file', size, executable, self._sha_from_stat(
719
780
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
720
781
"""Common ghost checking functionality from set_parent_*.
851
912
branch.last_revision().
853
914
from bzrlib.merge import Merger, Merge3Merger
854
pb = bzrlib.ui.ui_factory.nested_progress_bar()
856
merger = Merger(self.branch, this_tree=self, pb=pb)
857
merger.pp = ProgressPhase("Merge phase", 5, pb)
858
merger.pp.next_phase()
859
# check that there are no
861
merger.check_basis(check_clean=True, require_commits=False)
862
if to_revision is None:
863
to_revision = _mod_revision.ensure_null(branch.last_revision())
864
merger.other_rev_id = to_revision
865
if _mod_revision.is_null(merger.other_rev_id):
866
raise errors.NoCommits(branch)
867
self.branch.fetch(branch, last_revision=merger.other_rev_id)
868
merger.other_basis = merger.other_rev_id
869
merger.other_tree = self.branch.repository.revision_tree(
871
merger.other_branch = branch
872
merger.pp.next_phase()
873
if from_revision is None:
876
merger.set_base_revision(from_revision, branch)
877
if merger.base_rev_id == merger.other_rev_id:
878
raise errors.PointlessMerge
879
merger.backup_files = False
880
if merge_type is None:
881
merger.merge_type = Merge3Merger
883
merger.merge_type = merge_type
884
merger.set_interesting_files(None)
885
merger.show_base = False
886
merger.reprocess = False
887
conflicts = merger.do_merge()
915
merger = Merger(self.branch, this_tree=self)
916
# check that there are no local alterations
917
if not force and self.has_changes():
918
raise errors.UncommittedChanges(self)
919
if to_revision is None:
920
to_revision = _mod_revision.ensure_null(branch.last_revision())
921
merger.other_rev_id = to_revision
922
if _mod_revision.is_null(merger.other_rev_id):
923
raise errors.NoCommits(branch)
924
self.branch.fetch(branch, last_revision=merger.other_rev_id)
925
merger.other_basis = merger.other_rev_id
926
merger.other_tree = self.branch.repository.revision_tree(
928
merger.other_branch = branch
929
if from_revision is None:
932
merger.set_base_revision(from_revision, branch)
933
if merger.base_rev_id == merger.other_rev_id:
934
raise errors.PointlessMerge
935
merger.backup_files = False
936
if merge_type is None:
937
merger.merge_type = Merge3Merger
939
merger.merge_type = merge_type
940
merger.set_interesting_files(None)
941
merger.show_base = False
942
merger.reprocess = False
943
conflicts = merger.do_merge()
894
948
def merge_modified(self):
895
949
"""Return a dictionary of files modified by a merge.
897
The list is initialized by WorkingTree.set_merge_modified, which is
951
The list is initialized by WorkingTree.set_merge_modified, which is
898
952
typically called after we make some automatic updates to the tree
899
953
because of a merge.
1038
1094
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1039
1095
if tree_transport.base != branch_transport.base:
1040
1096
tree_bzrdir = format.initialize_on_transport(tree_transport)
1041
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1097
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1098
target_branch=new_branch)
1043
1100
tree_bzrdir = branch_bzrdir
1044
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1101
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1045
1102
wt.set_parent_ids(self.get_parent_ids())
1046
1103
my_inv = self.inventory
1047
child_inv = Inventory(root_id=None)
1104
child_inv = inventory.Inventory(root_id=None)
1048
1105
new_root = my_inv[file_id]
1049
1106
my_inv.remove_recursive_id(file_id)
1050
1107
new_root.parent_id = None
1069
1126
self._serialize(self._inventory, sio)
1071
1128
self._transport.put_file('inventory', sio,
1072
mode=self._control_files._file_mode)
1129
mode=self.bzrdir._get_file_mode())
1073
1130
self._inventory_is_modified = False
1075
1132
def _kind(self, relpath):
1076
1133
return osutils.file_kind(self.abspath(relpath))
1078
def list_files(self, include_root=False):
1079
"""Recursively list all files as (path, class, kind, id, entry).
1135
def list_files(self, include_root=False, from_dir=None, recursive=True):
1136
"""List all files as (path, class, kind, id, entry).
1081
1138
Lists, but does not descend into unversioned directories.
1083
1139
This does not include files that have been deleted in this
1140
tree. Skips the control directory.
1086
Skips the control directory.
1142
:param include_root: if True, return an entry for the root
1143
:param from_dir: start from this directory or None for the root
1144
:param recursive: whether to recurse into subdirectories or not
1088
1146
# list_files is an iterator, so @needs_read_lock doesn't work properly
1089
1147
# with it. So callers should be careful to always read_lock the tree.
1104
1162
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1106
1164
# directory file_id, relative path, absolute path, reverse sorted children
1107
children = os.listdir(self.basedir)
1165
if from_dir is not None:
1166
from_dir_id = inv.path2id(from_dir)
1167
if from_dir_id is None:
1168
# Directory not versioned
1170
from_dir_abspath = pathjoin(self.basedir, from_dir)
1172
from_dir_id = inv.root.file_id
1173
from_dir_abspath = self.basedir
1174
children = os.listdir(from_dir_abspath)
1108
1175
children.sort()
1109
# jam 20060527 The kernel sized tree seems equivalent whether we
1176
# jam 20060527 The kernel sized tree seems equivalent whether we
1110
1177
# use a deque and popleft to keep them sorted, or if we use a plain
1111
1178
# list and just reverse() them.
1112
1179
children = collections.deque(children)
1113
stack = [(inv.root.file_id, u'', self.basedir, children)]
1180
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1115
1182
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1170
1237
except KeyError:
1171
1238
yield fp[1:], c, fk, None, TreeEntry()
1174
1241
if fk != 'directory':
1177
# But do this child first
1178
new_children = os.listdir(fap)
1180
new_children = collections.deque(new_children)
1181
stack.append((f_ie.file_id, fp, fap, new_children))
1182
# Break out of inner loop,
1183
# so that we start outer loop with child
1244
# But do this child first if recursing down
1246
new_children = os.listdir(fap)
1248
new_children = collections.deque(new_children)
1249
stack.append((f_ie.file_id, fp, fap, new_children))
1250
# Break out of inner loop,
1251
# so that we start outer loop with child
1186
1254
# if we finished all children, pop it off the stack
1422
1491
from_tail = splitpath(from_rel)[-1]
1423
1492
from_id = inv.path2id(from_rel)
1424
1493
if from_id is None:
1425
raise errors.BzrRenameFailedError(from_rel,to_rel,
1426
errors.NotVersionedError(path=str(from_rel)))
1427
from_entry = inv[from_id]
1494
# if file is missing in the inventory maybe it's in the basis_tree
1495
basis_tree = self.branch.basis_tree()
1496
from_id = basis_tree.path2id(from_rel)
1498
raise errors.BzrRenameFailedError(from_rel,to_rel,
1499
errors.NotVersionedError(path=str(from_rel)))
1500
# put entry back in the inventory so we can rename it
1501
from_entry = basis_tree.inventory[from_id].copy()
1504
from_entry = inv[from_id]
1428
1505
from_parent_id = from_entry.parent_id
1429
1506
to_dir, to_tail = os.path.split(to_rel)
1430
1507
to_dir_id = inv.path2id(to_dir)
1492
1569
:raises: NoSuchId if any fileid is not currently versioned.
1494
1571
for file_id in file_ids:
1572
if file_id not in self._inventory:
1573
raise errors.NoSuchId(self, file_id)
1574
for file_id in file_ids:
1495
1575
if self._inventory.has_id(file_id):
1496
1576
self._inventory.remove_recursive_id(file_id)
1498
raise errors.NoSuchId(self, file_id)
1499
1577
if len(file_ids):
1500
# in the future this should just set a dirty bit to wait for the
1578
# in the future this should just set a dirty bit to wait for the
1501
1579
# final unlock. However, until all methods of workingtree start
1502
# with the current in -memory inventory rather than triggering
1580
# with the current in -memory inventory rather than triggering
1503
1581
# a read, it is more complex - we need to teach read_inventory
1504
1582
# to know when to read, and when to not read first... and possibly
1505
1583
# to save first when the in memory one may be corrupted.
1506
1584
# so for now, we just only write it if it is indeed dirty.
1507
1585
# - RBC 20060907
1508
1586
self._write_inventory(self._inventory)
1510
1588
def _iter_conflicts(self):
1511
1589
conflicted = set()
1512
1590
for info in self.list_files():
1521
1599
@needs_write_lock
1522
1600
def pull(self, source, overwrite=False, stop_revision=None,
1523
change_reporter=None, possible_transports=None):
1524
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1601
change_reporter=None, possible_transports=None, local=False):
1525
1602
source.lock_read()
1527
pp = ProgressPhase("Pull phase", 2, top_pb)
1529
1604
old_revision_info = self.branch.last_revision_info()
1530
1605
basis_tree = self.basis_tree()
1531
1606
count = self.branch.pull(source, overwrite, stop_revision,
1532
possible_transports=possible_transports)
1607
possible_transports=possible_transports,
1533
1609
new_revision_info = self.branch.last_revision_info()
1534
1610
if new_revision_info != old_revision_info:
1536
1611
repository = self.branch.repository
1537
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1538
1612
basis_tree.lock_read()
1540
1614
new_basis_tree = self.branch.basis_tree()
1543
1617
new_basis_tree,
1545
1619
this_tree=self,
1547
1621
change_reporter=change_reporter)
1548
if (basis_tree.inventory.root is None and
1549
new_basis_tree.inventory.root is not None):
1550
self.set_root_id(new_basis_tree.get_root_id())
1622
basis_root_id = basis_tree.get_root_id()
1623
new_root_id = new_basis_tree.get_root_id()
1624
if basis_root_id != new_root_id:
1625
self.set_root_id(new_root_id)
1553
1627
basis_tree.unlock()
1554
1628
# TODO - dedup parents list with things merged by pull ?
1555
1629
# reuse the revisiontree we merged against to set the new
1557
1631
parent_trees = [(self.branch.last_revision(), new_basis_tree)]
1558
# we have to pull the merge trees out again, because
1559
# merge_inner has set the ids. - this corner is not yet
1632
# we have to pull the merge trees out again, because
1633
# merge_inner has set the ids. - this corner is not yet
1560
1634
# layered well enough to prevent double handling.
1561
1635
# XXX TODO: Fix the double handling: telling the tree about
1562
1636
# the already known parent data is wasteful.
1805
1884
# as commit already has that ready-to-use [while the format is the
1806
1885
# same, that is].
1808
# this double handles the inventory - unpack and repack -
1887
# this double handles the inventory - unpack and repack -
1809
1888
# but is easier to understand. We can/should put a conditional
1810
1889
# in here based on whether the inventory is in the latest format
1811
1890
# - perhaps we should repack all inventories on a repository
1813
1892
# the fast path is to copy the raw xml from the repository. If the
1814
# xml contains 'revision_id="', then we assume the right
1893
# xml contains 'revision_id="', then we assume the right
1815
1894
# revision_id is set. We must check for this full string, because a
1816
1895
# root node id can legitimately look like 'revision_id' but cannot
1817
1896
# contain a '"'.
1818
xml = self.branch.repository.get_inventory_xml(new_revision)
1897
xml = self.branch.repository._get_inventory_xml(new_revision)
1819
1898
firstline = xml.split('\n', 1)[0]
1820
if (not 'revision_id="' in firstline or
1899
if (not 'revision_id="' in firstline or
1821
1900
'format="7"' not in firstline):
1822
inv = self.branch.repository.deserialise_inventory(
1901
inv = self.branch.repository._serializer.read_inventory_from_string(
1824
1903
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1825
1904
self._write_basis_inventory(xml)
1826
1905
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1830
1909
"""Read the cached basis inventory."""
1831
1910
path = self._basis_inventory_name()
1832
1911
return self._transport.get_bytes(path)
1834
1913
@needs_read_lock
1835
1914
def read_working_inventory(self):
1836
1915
"""Read the working inventory.
1838
1917
:raises errors.InventoryModified: read_working_inventory will fail
1839
1918
when the current in memory inventory has been modified.
1841
# conceptually this should be an implementation detail of the tree.
1920
# conceptually this should be an implementation detail of the tree.
1842
1921
# XXX: Deprecate this.
1843
1922
# ElementTree does its own conversion from UTF-8, so open in
1845
1924
if self._inventory_is_modified:
1846
1925
raise errors.InventoryModified(self)
1847
result = self._deserialize(self._transport.get('inventory'))
1926
f = self._transport.get('inventory')
1928
result = self._deserialize(f)
1848
1931
self._set_inventory(result, dirty=False)
2091
2176
def unlock(self):
2092
2177
"""See Branch.unlock.
2094
2179
WorkingTree locking just uses the Branch locking facilities.
2095
2180
This is current because all working trees have an embedded branch
2096
2181
within them. IF in the future, we were to make branch data shareable
2097
between multiple working trees, i.e. via shared storage, then we
2182
between multiple working trees, i.e. via shared storage, then we
2098
2183
would probably want to lock both the local tree, and the branch.
2100
2185
raise NotImplementedError(self.unlock)
2102
def update(self, change_reporter=None, possible_transports=None):
2189
def update(self, change_reporter=None, possible_transports=None,
2190
revision=None, old_tip=_marker):
2103
2191
"""Update a working tree along its branch.
2105
2193
This will update the branch if its bound too, which means we have
2152
2247
# cant set that until we update the working trees last revision to be
2153
2248
# one from the new branch, because it will just get absorbed by the
2154
2249
# parent de-duplication logic.
2156
2251
# We MUST save it even if an error occurs, because otherwise the users
2157
2252
# local work is unreferenced and will appear to have been lost.
2161
2256
last_rev = self.get_parent_ids()[0]
2162
2257
except IndexError:
2163
2258
last_rev = _mod_revision.NULL_REVISION
2164
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2165
# merge tree state up to new branch tip.
2259
if revision is None:
2260
revision = self.branch.last_revision()
2262
old_tip = old_tip or _mod_revision.NULL_REVISION
2264
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2265
# the branch we are bound to was updated
2266
# merge those changes in first
2267
base_tree = self.basis_tree()
2268
other_tree = self.branch.repository.revision_tree(old_tip)
2269
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2270
base_tree, this_tree=self,
2271
change_reporter=change_reporter)
2273
self.add_parent_tree((old_tip, other_tree))
2274
trace.note('Rerun update after fixing the conflicts.')
2277
if last_rev != _mod_revision.ensure_null(revision):
2278
# the working tree is up to date with the branch
2279
# we can merge the specified revision from master
2280
to_tree = self.branch.repository.revision_tree(revision)
2281
to_root_id = to_tree.get_root_id()
2166
2283
basis = self.basis_tree()
2167
2284
basis.lock_read()
2169
to_tree = self.branch.basis_tree()
2170
if basis.inventory.root is None:
2171
self.set_root_id(to_tree.get_root_id())
2286
if (basis.inventory.root is None
2287
or basis.inventory.root.file_id != to_root_id):
2288
self.set_root_id(to_root_id)
2173
result += merge.merge_inner(
2178
change_reporter=change_reporter)
2293
# determine the branch point
2294
graph = self.branch.repository.get_graph()
2295
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2297
base_tree = self.branch.repository.revision_tree(base_rev_id)
2299
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2301
change_reporter=change_reporter)
2302
self.set_last_revision(revision)
2181
2303
# TODO - dedup parents list with things merged by pull ?
2182
2304
# reuse the tree we've updated to to set the basis:
2183
parent_trees = [(self.branch.last_revision(), to_tree)]
2305
parent_trees = [(revision, to_tree)]
2184
2306
merges = self.get_parent_ids()[1:]
2185
2307
# Ideally we ask the tree for the trees here, that way the working
2186
# tree can decide whether to give us teh entire tree or give us a
2308
# tree can decide whether to give us the entire tree or give us a
2187
2309
# lazy initialised tree. dirstate for instance will have the trees
2188
2310
# in ram already, whereas a last-revision + basis-inventory tree
2189
2311
# will not, but also does not need them when setting parents.
2190
2312
for parent in merges:
2191
2313
parent_trees.append(
2192
2314
(parent, self.branch.repository.revision_tree(parent)))
2193
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2315
if not _mod_revision.is_null(old_tip):
2194
2316
parent_trees.append(
2195
2317
(old_tip, self.branch.repository.revision_tree(old_tip)))
2196
2318
self.set_parent_trees(parent_trees)
2197
2319
last_rev = parent_trees[0][0]
2199
# the working tree had the same last-revision as the master
2200
# branch did. We may still have pivot local work from the local
2201
# branch into old_tip:
2202
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2203
self.add_parent_tree_id(old_tip)
2204
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2205
and old_tip != last_rev):
2206
# our last revision was not the prior branch last revision
2207
# and we have converted that last revision to a pending merge.
2208
# base is somewhere between the branch tip now
2209
# and the now pending merge
2211
# Since we just modified the working tree and inventory, flush out
2212
# the current state, before we modify it again.
2213
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2214
# requires it only because TreeTransform directly munges the
2215
# inventory and calls tree._write_inventory(). Ultimately we
2216
# should be able to remove this extra flush.
2218
graph = self.branch.repository.get_graph()
2219
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2221
base_tree = self.branch.repository.revision_tree(base_rev_id)
2222
other_tree = self.branch.repository.revision_tree(old_tip)
2223
result += merge.merge_inner(
2228
change_reporter=change_reporter)
2231
2322
def _write_hashcache_if_dirty(self):
2232
2323
"""Write out the hashcache if it is dirty."""