51
59
conflicts as _mod_conflicts,
60
67
revision as _mod_revision,
69
80
import bzrlib.branch
70
81
from bzrlib.transport import get_transport
71
from bzrlib.workingtree_4 import (
83
from bzrlib.workingtree_4 import WorkingTreeFormat4, WorkingTreeFormat5
78
86
from bzrlib import symbol_versioning
79
87
from bzrlib.decorators import needs_read_lock, needs_write_lock
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
80
89
from bzrlib.lockable_files import LockableFiles
81
90
from bzrlib.lockdir import LockDir
82
91
import bzrlib.mutabletree
83
92
from bzrlib.mutabletree import needs_tree_write_lock
84
93
from bzrlib import osutils
85
94
from bzrlib.osutils import (
95
106
from bzrlib.filters import filtered_input_file
96
107
from bzrlib.trace import mutter, note
97
108
from bzrlib.transport.local import LocalTransport
98
from bzrlib.revision import CURRENT_REVISION
109
from bzrlib.progress import DummyProgress, ProgressPhase
110
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
99
111
from bzrlib.rio import RioReader, rio_file, Stanza
100
from bzrlib.symbol_versioning import (
102
DEPRECATED_PARAMETER,
112
from bzrlib.symbol_versioning import (deprecated_passed,
115
DEPRECATED_PARAMETER,
106
119
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
120
CONFLICT_HEADER_1 = "BZR conflict list format 1"
112
122
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
492
483
incorrectly attributed to CURRENT_REVISION (but after committing, the
493
484
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)]
486
basis = self.basis_tree()
489
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
490
require_versioned=True).next()
491
changed_content, kind = changes[2], changes[6]
492
if not changed_content:
493
return basis.annotate_iter(file_id)
497
if kind[0] != 'file':
500
old_lines = list(basis.annotate_iter(file_id))
502
for tree in self.branch.repository.revision_trees(
503
self.get_parent_ids()[1:]):
504
if file_id not in tree:
506
old.append(list(tree.annotate_iter(file_id)))
507
return annotate.reannotate(old, self.get_file(file_id).readlines(),
532
512
def _get_ancestors(self, default_revision):
533
513
ancestors = set([default_revision])
767
745
kind = 'tree-reference'
768
746
return kind, None, None, None
769
747
elif kind == 'symlink':
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
748
return ('symlink', None, None,
749
os.readlink(abspath.encode(osutils._fs_enc)
750
).decode(osutils._fs_enc))
773
752
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
754
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
755
"""Common ghost checking functionality from set_parent_*.
914
886
branch.last_revision().
916
888
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()
889
pb = bzrlib.ui.ui_factory.nested_progress_bar()
891
merger = Merger(self.branch, this_tree=self, pb=pb)
892
merger.pp = ProgressPhase("Merge phase", 5, pb)
893
merger.pp.next_phase()
894
# check that there are no
896
merger.check_basis(check_clean=True, require_commits=False)
897
if to_revision is None:
898
to_revision = _mod_revision.ensure_null(branch.last_revision())
899
merger.other_rev_id = to_revision
900
if _mod_revision.is_null(merger.other_rev_id):
901
raise errors.NoCommits(branch)
902
self.branch.fetch(branch, last_revision=merger.other_rev_id)
903
merger.other_basis = merger.other_rev_id
904
merger.other_tree = self.branch.repository.revision_tree(
906
merger.other_branch = branch
907
merger.pp.next_phase()
908
if from_revision is None:
911
merger.set_base_revision(from_revision, branch)
912
if merger.base_rev_id == merger.other_rev_id:
913
raise errors.PointlessMerge
914
merger.backup_files = False
915
if merge_type is None:
916
merger.merge_type = Merge3Merger
918
merger.merge_type = merge_type
919
merger.set_interesting_files(None)
920
merger.show_base = False
921
merger.reprocess = False
922
conflicts = merger.do_merge()
1096
1073
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1074
if tree_transport.base != branch_transport.base:
1098
1075
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1076
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1078
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1079
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1080
wt.set_parent_ids(self.get_parent_ids())
1105
1081
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1082
child_inv = Inventory(root_id=None)
1107
1083
new_root = my_inv[file_id]
1108
1084
my_inv.remove_recursive_id(file_id)
1109
1085
new_root.parent_id = None
1134
1110
def _kind(self, relpath):
1135
1111
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).
1113
def list_files(self, include_root=False):
1114
"""Recursively list all files as (path, class, kind, id, entry).
1140
1116
Lists, but does not descend into unversioned directories.
1141
1118
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
1121
Skips the control directory.
1148
1123
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1124
# with it. So callers should be careful to always read_lock the tree.
1164
1139
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1141
# 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)
1142
children = os.listdir(self.basedir)
1177
1143
children.sort()
1178
1144
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1145
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1146
# list and just reverse() them.
1181
1147
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1148
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1150
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1243
1209
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
1212
# But do this child first
1213
new_children = os.listdir(fap)
1215
new_children = collections.deque(new_children)
1216
stack.append((f_ie.file_id, fp, fap, new_children))
1217
# Break out of inner loop,
1218
# so that we start outer loop with child
1256
1221
# if we finished all children, pop it off the stack
1493
1457
from_tail = splitpath(from_rel)[-1]
1494
1458
from_id = inv.path2id(from_rel)
1495
1459
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]
1460
raise errors.BzrRenameFailedError(from_rel,to_rel,
1461
errors.NotVersionedError(path=str(from_rel)))
1462
from_entry = inv[from_id]
1507
1463
from_parent_id = from_entry.parent_id
1508
1464
to_dir, to_tail = os.path.split(to_rel)
1509
1465
to_dir_id = inv.path2id(to_dir)
1601
1556
@needs_write_lock
1602
1557
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1558
change_reporter=None, possible_transports=None):
1559
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1560
source.lock_read()
1562
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1564
old_revision_info = self.branch.last_revision_info()
1607
1565
basis_tree = self.basis_tree()
1608
1566
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1567
possible_transports=possible_transports)
1611
1568
new_revision_info = self.branch.last_revision_info()
1612
1569
if new_revision_info != old_revision_info:
1613
1571
repository = self.branch.repository
1572
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1573
basis_tree.lock_read()
1616
1575
new_basis_tree = self.branch.basis_tree()
1798
1756
raise errors.ObjectNotLocked(self)
1800
1758
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
1759
"""See Branch.lock_read, and WorkingTree.unlock."""
1808
1760
if not self.is_locked():
1809
1761
self._reset_data()
1810
1762
self.branch.lock_read()
1812
self._control_files.lock_read()
1764
return self._control_files.lock_read()
1815
1766
self.branch.unlock()
1818
1769
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
1770
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1824
1771
if not self.is_locked():
1825
1772
self._reset_data()
1826
1773
self.branch.lock_read()
1828
self._control_files.lock_write()
1775
return self._control_files.lock_write()
1831
1777
self.branch.unlock()
1834
1780
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
1781
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1840
1782
if not self.is_locked():
1841
1783
self._reset_data()
1842
1784
self.branch.lock_write()
1844
self._control_files.lock_write()
1786
return self._control_files.lock_write()
1847
1788
self.branch.unlock()
2270
2191
# We MUST save it even if an error occurs, because otherwise the users
2271
2192
# local work is unreferenced and will appear to have been lost.
2275
2196
last_rev = self.get_parent_ids()[0]
2276
2197
except IndexError:
2277
2198
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()
2199
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2200
# merge tree state up to new branch tip.
2302
2201
basis = self.basis_tree()
2303
2202
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)
2204
to_tree = self.branch.basis_tree()
2205
if basis.inventory.root is None:
2206
self.set_root_id(to_tree.get_root_id())
2208
result += merge.merge_inner(
2213
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
2216
# TODO - dedup parents list with things merged by pull ?
2323
2217
# reuse the tree we've updated to to set the basis:
2324
parent_trees = [(revision, to_tree)]
2218
parent_trees = [(self.branch.last_revision(), to_tree)]
2325
2219
merges = self.get_parent_ids()[1:]
2326
2220
# 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
2221
# tree can decide whether to give us teh entire tree or give us a
2328
2222
# lazy initialised tree. dirstate for instance will have the trees
2329
2223
# in ram already, whereas a last-revision + basis-inventory tree
2330
2224
# will not, but also does not need them when setting parents.
2331
2225
for parent in merges:
2332
2226
parent_trees.append(
2333
2227
(parent, self.branch.repository.revision_tree(parent)))
2334
if not _mod_revision.is_null(old_tip):
2228
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2335
2229
parent_trees.append(
2336
2230
(old_tip, self.branch.repository.revision_tree(old_tip)))
2337
2231
self.set_parent_trees(parent_trees)
2338
2232
last_rev = parent_trees[0][0]
2234
# the working tree had the same last-revision as the master
2235
# branch did. We may still have pivot local work from the local
2236
# branch into old_tip:
2237
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2238
self.add_parent_tree_id(old_tip)
2239
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2240
and old_tip != last_rev):
2241
# our last revision was not the prior branch last revision
2242
# and we have converted that last revision to a pending merge.
2243
# base is somewhere between the branch tip now
2244
# and the now pending merge
2246
# Since we just modified the working tree and inventory, flush out
2247
# the current state, before we modify it again.
2248
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2249
# requires it only because TreeTransform directly munges the
2250
# inventory and calls tree._write_inventory(). Ultimately we
2251
# should be able to remove this extra flush.
2253
graph = self.branch.repository.get_graph()
2254
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2256
base_tree = self.branch.repository.revision_tree(base_rev_id)
2257
other_tree = self.branch.repository.revision_tree(old_tip)
2258
result += merge.merge_inner(
2263
change_reporter=change_reporter)
2341
2266
def _write_hashcache_if_dirty(self):
2342
2267
"""Write out the hashcache if it is dirty."""