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 (
95
105
from bzrlib.filters import filtered_input_file
96
106
from bzrlib.trace import mutter, note
97
107
from bzrlib.transport.local import LocalTransport
98
from bzrlib.revision import CURRENT_REVISION
108
from bzrlib.progress import DummyProgress, ProgressPhase
109
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
99
110
from bzrlib.rio import RioReader, rio_file, Stanza
100
from bzrlib.symbol_versioning import (
102
DEPRECATED_PARAMETER,
111
from bzrlib.symbol_versioning import (deprecated_passed,
114
DEPRECATED_PARAMETER,
106
118
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
119
CONFLICT_HEADER_1 = "BZR conflict list format 1"
112
121
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
285
280
self._control_files.break_lock()
286
281
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
283
def requires_rich_root(self):
299
284
return self._format.requires_rich_root
301
286
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
289
def _set_inventory(self, inv, dirty):
311
290
"""Set the internal cached inventory.
447
426
return osutils.lexists(self.abspath(filename))
449
428
def get_file(self, file_id, path=None, filtered=True):
450
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
430
path = self.id2path(file_id)
431
return self.get_file_byname(path, filtered=filtered)
452
def get_file_with_stat(self, file_id, path=None, filtered=True,
454
"""See Tree.get_file_with_stat."""
433
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
434
"""See MutableTree.get_file_with_stat."""
456
436
path = self.id2path(file_id)
457
437
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)
438
return (file_obj, _fstat(file_obj.fileno()))
464
440
def get_file_text(self, file_id, path=None, filtered=True):
465
441
return self.get_file(file_id, path=path, filtered=filtered).read()
467
443
def get_file_byname(self, filename, filtered=True):
468
444
path = self.abspath(filename)
469
445
f = file(path, 'rb')
470
if filtered and self.supports_content_filtering():
471
447
filters = self._content_filter_stack(filename)
472
448
return filtered_input_file(f, filters)
476
def get_file_lines(self, file_id, path=None, filtered=True):
452
def get_special_file(self, type):
453
"""Get a file special to Bazaar.
455
:type: a type of XXX maps to a file path .bzrXXX
456
:return: a file-like object or None if the file does not exist
458
path = self.abspath(".bzr" + type)
460
return open(path, 'rb')
464
def get_file_lines(self, file_id, path=None):
477
465
"""See Tree.get_file_lines()"""
478
file = self.get_file(file_id, path, filtered=filtered)
466
file = self.get_file(file_id, path)
480
468
return file.readlines()
492
480
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
481
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)]
483
basis = self.basis_tree()
486
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
487
require_versioned=True).next()
488
changed_content, kind = changes[2], changes[6]
489
if not changed_content:
490
return basis.annotate_iter(file_id)
494
if kind[0] != 'file':
497
old_lines = list(basis.annotate_iter(file_id))
499
for tree in self.branch.repository.revision_trees(
500
self.get_parent_ids()[1:]):
501
if file_id not in tree:
503
old.append(list(tree.annotate_iter(file_id)))
504
return annotate.reannotate(old, self.get_file(file_id).readlines(),
532
509
def _get_ancestors(self, default_revision):
533
510
ancestors = set([default_revision])
767
742
kind = 'tree-reference'
768
743
return kind, None, None, None
769
744
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
745
return ('symlink', None, None, os.readlink(abspath))
773
747
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
749
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
750
"""Common ghost checking functionality from set_parent_*.
914
881
branch.last_revision().
916
883
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()
884
pb = bzrlib.ui.ui_factory.nested_progress_bar()
886
merger = Merger(self.branch, this_tree=self, pb=pb)
887
merger.pp = ProgressPhase("Merge phase", 5, pb)
888
merger.pp.next_phase()
889
# check that there are no
891
merger.check_basis(check_clean=True, require_commits=False)
892
if to_revision is None:
893
to_revision = _mod_revision.ensure_null(branch.last_revision())
894
merger.other_rev_id = to_revision
895
if _mod_revision.is_null(merger.other_rev_id):
896
raise errors.NoCommits(branch)
897
self.branch.fetch(branch, last_revision=merger.other_rev_id)
898
merger.other_basis = merger.other_rev_id
899
merger.other_tree = self.branch.repository.revision_tree(
901
merger.other_branch = branch
902
merger.pp.next_phase()
903
if from_revision is None:
906
merger.set_base_revision(from_revision, branch)
907
if merger.base_rev_id == merger.other_rev_id:
908
raise errors.PointlessMerge
909
merger.backup_files = False
910
if merge_type is None:
911
merger.merge_type = Merge3Merger
913
merger.merge_type = merge_type
914
merger.set_interesting_files(None)
915
merger.show_base = False
916
merger.reprocess = False
917
conflicts = merger.do_merge()
950
924
def merge_modified(self):
951
925
"""Return a dictionary of files modified by a merge.
953
The list is initialized by WorkingTree.set_merge_modified, which is
927
The list is initialized by WorkingTree.set_merge_modified, which is
954
928
typically called after we make some automatic updates to the tree
955
929
because of a merge.
1096
1068
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1069
if tree_transport.base != branch_transport.base:
1098
1070
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1071
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1073
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1074
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1075
wt.set_parent_ids(self.get_parent_ids())
1105
1076
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1077
child_inv = Inventory(root_id=None)
1107
1078
new_root = my_inv[file_id]
1108
1079
my_inv.remove_recursive_id(file_id)
1109
1080
new_root.parent_id = None
1128
1099
self._serialize(self._inventory, sio)
1130
1101
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1102
mode=self._control_files._file_mode)
1132
1103
self._inventory_is_modified = False
1134
1105
def _kind(self, relpath):
1135
1106
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).
1108
def list_files(self, include_root=False):
1109
"""Recursively list all files as (path, class, kind, id, entry).
1140
1111
Lists, but does not descend into unversioned directories.
1141
1113
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
1116
Skips the control directory.
1148
1118
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1119
# with it. So callers should be careful to always read_lock the tree.
1164
1134
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1136
# 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)
1137
children = os.listdir(self.basedir)
1177
1138
children.sort()
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1139
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1140
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1141
# list and just reverse() them.
1181
1142
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1143
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1145
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1239
1200
except KeyError:
1240
1201
yield fp[1:], c, fk, None, TreeEntry()
1243
1204
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
1207
# But do this child first
1208
new_children = os.listdir(fap)
1210
new_children = collections.deque(new_children)
1211
stack.append((f_ie.file_id, fp, fap, new_children))
1212
# Break out of inner loop,
1213
# so that we start outer loop with child
1256
1216
# if we finished all children, pop it off the stack
1493
1452
from_tail = splitpath(from_rel)[-1]
1494
1453
from_id = inv.path2id(from_rel)
1495
1454
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]
1455
raise errors.BzrRenameFailedError(from_rel,to_rel,
1456
errors.NotVersionedError(path=str(from_rel)))
1457
from_entry = inv[from_id]
1507
1458
from_parent_id = from_entry.parent_id
1508
1459
to_dir, to_tail = os.path.split(to_rel)
1509
1460
to_dir_id = inv.path2id(to_dir)
1571
1522
:raises: NoSuchId if any fileid is not currently versioned.
1573
1524
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
1525
if self._inventory.has_id(file_id):
1578
1526
self._inventory.remove_recursive_id(file_id)
1528
raise errors.NoSuchId(self, file_id)
1579
1529
if len(file_ids):
1580
# in the future this should just set a dirty bit to wait for the
1530
# in the future this should just set a dirty bit to wait for the
1581
1531
# final unlock. However, until all methods of workingtree start
1582
# with the current in -memory inventory rather than triggering
1532
# with the current in -memory inventory rather than triggering
1583
1533
# a read, it is more complex - we need to teach read_inventory
1584
1534
# to know when to read, and when to not read first... and possibly
1585
1535
# to save first when the in memory one may be corrupted.
1586
1536
# so for now, we just only write it if it is indeed dirty.
1587
1537
# - RBC 20060907
1588
1538
self._write_inventory(self._inventory)
1590
1540
def _iter_conflicts(self):
1591
1541
conflicted = set()
1592
1542
for info in self.list_files():
1601
1551
@needs_write_lock
1602
1552
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1553
change_reporter=None, possible_transports=None):
1554
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1555
source.lock_read()
1557
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1559
old_revision_info = self.branch.last_revision_info()
1607
1560
basis_tree = self.basis_tree()
1608
1561
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1562
possible_transports=possible_transports)
1611
1563
new_revision_info = self.branch.last_revision_info()
1612
1564
if new_revision_info != old_revision_info:
1613
1566
repository = self.branch.repository
1567
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1568
basis_tree.lock_read()
1616
1570
new_basis_tree = self.branch.basis_tree()
1619
1573
new_basis_tree,
1621
1575
this_tree=self,
1623
1577
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)
1578
if (basis_tree.inventory.root is None and
1579
new_basis_tree.inventory.root is not None):
1580
self.set_root_id(new_basis_tree.get_root_id())
1629
1583
basis_tree.unlock()
1630
1584
# TODO - dedup parents list with things merged by pull ?
1631
1585
# reuse the revisiontree we merged against to set the new
1633
1587
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
1588
# we have to pull the merge trees out again, because
1589
# merge_inner has set the ids. - this corner is not yet
1636
1590
# layered well enough to prevent double handling.
1637
1591
# XXX TODO: Fix the double handling: telling the tree about
1638
1592
# the already known parent data is wasteful.
1798
1751
raise errors.ObjectNotLocked(self)
1800
1753
def lock_read(self):
1801
"""Lock the tree for reading.
1803
This also locks the branch, and can be unlocked via self.unlock().
1805
:return: An object with an unlock method which will release the lock
1754
"""See Branch.lock_read, and WorkingTree.unlock."""
1808
1755
if not self.is_locked():
1809
1756
self._reset_data()
1810
1757
self.branch.lock_read()
1812
self._control_files.lock_read()
1759
return self._control_files.lock_read()
1815
1761
self.branch.unlock()
1818
1764
def lock_tree_write(self):
1819
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1821
:return: An object with an unlock method which will release the lock
1765
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1824
1766
if not self.is_locked():
1825
1767
self._reset_data()
1826
1768
self.branch.lock_read()
1828
self._control_files.lock_write()
1770
return self._control_files.lock_write()
1831
1772
self.branch.unlock()
1834
1775
def lock_write(self):
1835
"""See MutableTree.lock_write, and WorkingTree.unlock.
1837
:return: An object with an unlock method which will release the lock
1776
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1840
1777
if not self.is_locked():
1841
1778
self._reset_data()
1842
1779
self.branch.lock_write()
1844
self._control_files.lock_write()
1781
return self._control_files.lock_write()
1847
1783
self.branch.unlock()
1903
1835
# as commit already has that ready-to-use [while the format is the
1904
1836
# same, that is].
1906
# this double handles the inventory - unpack and repack -
1838
# this double handles the inventory - unpack and repack -
1907
1839
# but is easier to understand. We can/should put a conditional
1908
1840
# in here based on whether the inventory is in the latest format
1909
1841
# - perhaps we should repack all inventories on a repository
1911
1843
# the fast path is to copy the raw xml from the repository. If the
1912
# xml contains 'revision_id="', then we assume the right
1844
# xml contains 'revision_id="', then we assume the right
1913
1845
# revision_id is set. We must check for this full string, because a
1914
1846
# root node id can legitimately look like 'revision_id' but cannot
1915
1847
# contain a '"'.
1916
xml = self.branch.repository._get_inventory_xml(new_revision)
1848
xml = self.branch.repository.get_inventory_xml(new_revision)
1917
1849
firstline = xml.split('\n', 1)[0]
1918
if (not 'revision_id="' in firstline or
1850
if (not 'revision_id="' in firstline or
1919
1851
'format="7"' not in firstline):
1920
inv = self.branch.repository._serializer.read_inventory_from_string(
1852
inv = self.branch.repository.deserialise_inventory(
1922
1854
xml = self._create_basis_xml_from_inventory(new_revision, inv)
1923
1855
self._write_basis_inventory(xml)
1924
1856
except (errors.NoSuchRevision, errors.RevisionNotPresent):
1928
1860
"""Read the cached basis inventory."""
1929
1861
path = self._basis_inventory_name()
1930
1862
return self._transport.get_bytes(path)
1932
1864
@needs_read_lock
1933
1865
def read_working_inventory(self):
1934
1866
"""Read the working inventory.
1936
1868
:raises errors.InventoryModified: read_working_inventory will fail
1937
1869
when the current in memory inventory has been modified.
1939
# conceptually this should be an implementation detail of the tree.
1871
# conceptually this should be an implementation detail of the tree.
1940
1872
# XXX: Deprecate this.
1941
1873
# ElementTree does its own conversion from UTF-8, so open in
1943
1875
if self._inventory_is_modified:
1944
1876
raise errors.InventoryModified(self)
1945
f = self._transport.get('inventory')
1947
result = self._deserialize(f)
1877
result = self._deserialize(self._transport.get('inventory'))
1950
1878
self._set_inventory(result, dirty=False)
2195
2121
def unlock(self):
2196
2122
"""See Branch.unlock.
2198
2124
WorkingTree locking just uses the Branch locking facilities.
2199
2125
This is current because all working trees have an embedded branch
2200
2126
within them. IF in the future, we were to make branch data shareable
2201
between multiple working trees, i.e. via shared storage, then we
2127
between multiple working trees, i.e. via shared storage, then we
2202
2128
would probably want to lock both the local tree, and the branch.
2204
2130
raise NotImplementedError(self.unlock)
2208
def update(self, change_reporter=None, possible_transports=None,
2209
revision=None, old_tip=_marker):
2132
def update(self, change_reporter=None, possible_transports=None):
2210
2133
"""Update a working tree along its branch.
2212
2135
This will update the branch if its bound too, which means we have
2266
2182
# cant set that until we update the working trees last revision to be
2267
2183
# one from the new branch, because it will just get absorbed by the
2268
2184
# parent de-duplication logic.
2270
2186
# We MUST save it even if an error occurs, because otherwise the users
2271
2187
# local work is unreferenced and will appear to have been lost.
2275
2191
last_rev = self.get_parent_ids()[0]
2276
2192
except IndexError:
2277
2193
last_rev = _mod_revision.NULL_REVISION
2278
if revision is None:
2279
revision = self.branch.last_revision()
2281
old_tip = old_tip or _mod_revision.NULL_REVISION
2283
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2284
# the branch we are bound to was updated
2285
# merge those changes in first
2286
base_tree = self.basis_tree()
2287
other_tree = self.branch.repository.revision_tree(old_tip)
2288
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2289
base_tree, this_tree=self,
2290
change_reporter=change_reporter)
2292
self.add_parent_tree((old_tip, other_tree))
2293
trace.note('Rerun update after fixing the conflicts.')
2296
if last_rev != _mod_revision.ensure_null(revision):
2297
# the working tree is up to date with the branch
2298
# we can merge the specified revision from master
2299
to_tree = self.branch.repository.revision_tree(revision)
2300
to_root_id = to_tree.get_root_id()
2194
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2195
# merge tree state up to new branch tip.
2302
2196
basis = self.basis_tree()
2303
2197
basis.lock_read()
2305
if (basis.inventory.root is None
2306
or basis.inventory.root.file_id != to_root_id):
2307
self.set_root_id(to_root_id)
2199
to_tree = self.branch.basis_tree()
2200
if basis.inventory.root is None:
2201
self.set_root_id(to_tree.get_root_id())
2203
result += merge.merge_inner(
2208
change_reporter=change_reporter)
2312
# determine the branch point
2313
graph = self.branch.repository.get_graph()
2314
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2316
base_tree = self.branch.repository.revision_tree(base_rev_id)
2318
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2320
change_reporter=change_reporter)
2321
self.set_last_revision(revision)
2322
2211
# TODO - dedup parents list with things merged by pull ?
2323
2212
# reuse the tree we've updated to to set the basis:
2324
parent_trees = [(revision, to_tree)]
2213
parent_trees = [(self.branch.last_revision(), to_tree)]
2325
2214
merges = self.get_parent_ids()[1:]
2326
2215
# Ideally we ask the tree for the trees here, that way the working
2327
# tree can decide whether to give us the entire tree or give us a
2216
# tree can decide whether to give us teh entire tree or give us a
2328
2217
# lazy initialised tree. dirstate for instance will have the trees
2329
2218
# in ram already, whereas a last-revision + basis-inventory tree
2330
2219
# will not, but also does not need them when setting parents.
2331
2220
for parent in merges:
2332
2221
parent_trees.append(
2333
2222
(parent, self.branch.repository.revision_tree(parent)))
2334
if not _mod_revision.is_null(old_tip):
2223
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2335
2224
parent_trees.append(
2336
2225
(old_tip, self.branch.repository.revision_tree(old_tip)))
2337
2226
self.set_parent_trees(parent_trees)
2338
2227
last_rev = parent_trees[0][0]
2229
# the working tree had the same last-revision as the master
2230
# branch did. We may still have pivot local work from the local
2231
# branch into old_tip:
2232
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2233
self.add_parent_tree_id(old_tip)
2234
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2235
and old_tip != last_rev):
2236
# our last revision was not the prior branch last revision
2237
# and we have converted that last revision to a pending merge.
2238
# base is somewhere between the branch tip now
2239
# and the now pending merge
2241
# Since we just modified the working tree and inventory, flush out
2242
# the current state, before we modify it again.
2243
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2244
# requires it only because TreeTransform directly munges the
2245
# inventory and calls tree._write_inventory(). Ultimately we
2246
# should be able to remove this extra flush.
2248
graph = self.branch.repository.get_graph()
2249
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2251
base_tree = self.branch.repository.revision_tree(base_rev_id)
2252
other_tree = self.branch.repository.revision_tree(old_tip)
2253
result += merge.merge_inner(
2258
change_reporter=change_reporter)
2341
2261
def _write_hashcache_if_dirty(self):
2342
2262
"""Write out the hashcache if it is dirty."""