59
51
conflicts as _mod_conflicts,
67
60
revision as _mod_revision,
80
69
import bzrlib.branch
81
70
from bzrlib.transport import get_transport
83
from bzrlib.workingtree_4 import WorkingTreeFormat4, WorkingTreeFormat5
71
from bzrlib.workingtree_4 import (
86
78
from bzrlib import symbol_versioning
87
79
from bzrlib.decorators import needs_read_lock, needs_write_lock
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
80
from bzrlib.lock import LogicalLockResult
89
81
from bzrlib.lockable_files import LockableFiles
90
82
from bzrlib.lockdir import LockDir
91
83
import bzrlib.mutabletree
92
84
from bzrlib.mutabletree import needs_tree_write_lock
93
85
from bzrlib import osutils
94
86
from bzrlib.osutils import (
106
96
from bzrlib.filters import filtered_input_file
107
97
from bzrlib.trace import mutter, note
108
98
from bzrlib.transport.local import LocalTransport
109
from bzrlib.progress import DummyProgress, ProgressPhase
110
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
99
from bzrlib.revision import CURRENT_REVISION
111
100
from bzrlib.rio import RioReader, rio_file, Stanza
112
from bzrlib.symbol_versioning import (deprecated_passed,
115
DEPRECATED_PARAMETER,
101
from bzrlib.symbol_versioning import (
103
DEPRECATED_PARAMETER,
119
107
MERGE_MODIFIED_HEADER_1 = "BZR merge-modified list format 1"
108
# TODO: Modifying the conflict objects or their type is currently nearly
109
# impossible as there is no clear relationship between the working tree format
110
# and the conflict list file format.
120
111
CONFLICT_HEADER_1 = "BZR conflict list format 1"
122
113
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
483
493
incorrectly attributed to CURRENT_REVISION (but after committing, the
484
494
attribution will be correct).
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(),
496
maybe_file_parent_keys = []
497
for parent_id in self.get_parent_ids():
499
parent_tree = self.revision_tree(parent_id)
500
except errors.NoSuchRevisionInTree:
501
parent_tree = self.branch.repository.revision_tree(parent_id)
502
parent_tree.lock_read()
504
if file_id not in parent_tree:
506
ie = parent_tree.inventory[file_id]
507
if ie.kind != 'file':
508
# Note: this is slightly unnecessary, because symlinks and
509
# directories have a "text" which is the empty text, and we
510
# know that won't mess up annotations. But it seems cleaner
512
parent_text_key = (file_id, ie.revision)
513
if parent_text_key not in maybe_file_parent_keys:
514
maybe_file_parent_keys.append(parent_text_key)
517
graph = _mod_graph.Graph(self.branch.repository.texts)
518
heads = graph.heads(maybe_file_parent_keys)
519
file_parent_keys = []
520
for key in maybe_file_parent_keys:
522
file_parent_keys.append(key)
524
# Now we have the parents of this content
525
annotator = self.branch.repository.texts.get_annotator()
526
text = self.get_file(file_id).read()
527
this_key =(file_id, default_revision)
528
annotator.add_special_text(this_key, file_parent_keys, text)
529
annotations = [(key[-1], line)
530
for key, line in annotator.annotate_flat(this_key)]
512
533
def _get_ancestors(self, default_revision):
513
534
ancestors = set([default_revision])
745
768
kind = 'tree-reference'
746
769
return kind, None, None, None
747
770
elif kind == 'symlink':
748
return ('symlink', None, None,
749
os.readlink(abspath.encode(osutils._fs_enc)
750
).decode(osutils._fs_enc))
771
target = osutils.readlink(abspath)
772
return ('symlink', None, None, target)
752
774
return (kind, None, None, None)
776
def _file_content_summary(self, path, stat_result):
777
size = stat_result.st_size
778
executable = self._is_executable_from_path_and_stat(path, stat_result)
779
# try for a stat cache lookup
780
return ('file', size, executable, self._sha_from_stat(
754
783
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
755
784
"""Common ghost checking functionality from set_parent_*.
886
915
branch.last_revision().
888
917
from bzrlib.merge import Merger, Merge3Merger
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()
918
merger = Merger(self.branch, this_tree=self)
919
# check that there are no local alterations
920
if not force and self.has_changes():
921
raise errors.UncommittedChanges(self)
922
if to_revision is None:
923
to_revision = _mod_revision.ensure_null(branch.last_revision())
924
merger.other_rev_id = to_revision
925
if _mod_revision.is_null(merger.other_rev_id):
926
raise errors.NoCommits(branch)
927
self.branch.fetch(branch, last_revision=merger.other_rev_id)
928
merger.other_basis = merger.other_rev_id
929
merger.other_tree = self.branch.repository.revision_tree(
931
merger.other_branch = branch
932
if from_revision is None:
935
merger.set_base_revision(from_revision, branch)
936
if merger.base_rev_id == merger.other_rev_id:
937
raise errors.PointlessMerge
938
merger.backup_files = False
939
if merge_type is None:
940
merger.merge_type = Merge3Merger
942
merger.merge_type = merge_type
943
merger.set_interesting_files(None)
944
merger.show_base = False
945
merger.reprocess = False
946
conflicts = merger.do_merge()
1073
1097
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1074
1098
if tree_transport.base != branch_transport.base:
1075
1099
tree_bzrdir = format.initialize_on_transport(tree_transport)
1076
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1100
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1101
target_branch=new_branch)
1078
1103
tree_bzrdir = branch_bzrdir
1079
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1080
1105
wt.set_parent_ids(self.get_parent_ids())
1081
1106
my_inv = self.inventory
1082
child_inv = Inventory(root_id=None)
1107
child_inv = inventory.Inventory(root_id=None)
1083
1108
new_root = my_inv[file_id]
1084
1109
my_inv.remove_recursive_id(file_id)
1085
1110
new_root.parent_id = None
1110
1135
def _kind(self, relpath):
1111
1136
return osutils.file_kind(self.abspath(relpath))
1113
def list_files(self, include_root=False):
1114
"""Recursively list all files as (path, class, kind, id, entry).
1138
def list_files(self, include_root=False, from_dir=None, recursive=True):
1139
"""List all files as (path, class, kind, id, entry).
1116
1141
Lists, but does not descend into unversioned directories.
1118
1142
This does not include files that have been deleted in this
1143
tree. Skips the control directory.
1121
Skips the control directory.
1145
:param include_root: if True, return an entry for the root
1146
:param from_dir: start from this directory or None for the root
1147
:param recursive: whether to recurse into subdirectories or not
1123
1149
# list_files is an iterator, so @needs_read_lock doesn't work properly
1124
1150
# with it. So callers should be careful to always read_lock the tree.
1139
1165
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1141
1167
# directory file_id, relative path, absolute path, reverse sorted children
1142
children = os.listdir(self.basedir)
1168
if from_dir is not None:
1169
from_dir_id = inv.path2id(from_dir)
1170
if from_dir_id is None:
1171
# Directory not versioned
1173
from_dir_abspath = pathjoin(self.basedir, from_dir)
1175
from_dir_id = inv.root.file_id
1176
from_dir_abspath = self.basedir
1177
children = os.listdir(from_dir_abspath)
1143
1178
children.sort()
1144
1179
# jam 20060527 The kernel sized tree seems equivalent whether we
1145
1180
# use a deque and popleft to keep them sorted, or if we use a plain
1146
1181
# list and just reverse() them.
1147
1182
children = collections.deque(children)
1148
stack = [(inv.root.file_id, u'', self.basedir, children)]
1183
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1150
1185
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1209
1244
if fk != 'directory':
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
1247
# But do this child first if recursing down
1249
new_children = os.listdir(fap)
1251
new_children = collections.deque(new_children)
1252
stack.append((f_ie.file_id, fp, fap, new_children))
1253
# Break out of inner loop,
1254
# so that we start outer loop with child
1221
1257
# if we finished all children, pop it off the stack
1457
1494
from_tail = splitpath(from_rel)[-1]
1458
1495
from_id = inv.path2id(from_rel)
1459
1496
if from_id is None:
1460
raise errors.BzrRenameFailedError(from_rel,to_rel,
1461
errors.NotVersionedError(path=str(from_rel)))
1462
from_entry = inv[from_id]
1497
# if file is missing in the inventory maybe it's in the basis_tree
1498
basis_tree = self.branch.basis_tree()
1499
from_id = basis_tree.path2id(from_rel)
1501
raise errors.BzrRenameFailedError(from_rel,to_rel,
1502
errors.NotVersionedError(path=str(from_rel)))
1503
# put entry back in the inventory so we can rename it
1504
from_entry = basis_tree.inventory[from_id].copy()
1507
from_entry = inv[from_id]
1463
1508
from_parent_id = from_entry.parent_id
1464
1509
to_dir, to_tail = os.path.split(to_rel)
1465
1510
to_dir_id = inv.path2id(to_dir)
1556
1602
@needs_write_lock
1557
1603
def pull(self, source, overwrite=False, stop_revision=None,
1558
change_reporter=None, possible_transports=None):
1559
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
change_reporter=None, possible_transports=None, local=False):
1560
1605
source.lock_read()
1562
pp = ProgressPhase("Pull phase", 2, top_pb)
1564
1607
old_revision_info = self.branch.last_revision_info()
1565
1608
basis_tree = self.basis_tree()
1566
1609
count = self.branch.pull(source, overwrite, stop_revision,
1567
possible_transports=possible_transports)
1610
possible_transports=possible_transports,
1568
1612
new_revision_info = self.branch.last_revision_info()
1569
1613
if new_revision_info != old_revision_info:
1571
1614
repository = self.branch.repository
1572
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1573
1615
basis_tree.lock_read()
1575
1617
new_basis_tree = self.branch.basis_tree()
1756
1799
raise errors.ObjectNotLocked(self)
1758
1801
def lock_read(self):
1759
"""See Branch.lock_read, and WorkingTree.unlock."""
1802
"""Lock the tree for reading.
1804
This also locks the branch, and can be unlocked via self.unlock().
1806
:return: A bzrlib.lock.LogicalLockResult.
1760
1808
if not self.is_locked():
1761
1809
self._reset_data()
1762
1810
self.branch.lock_read()
1764
return self._control_files.lock_read()
1812
self._control_files.lock_read()
1813
return LogicalLockResult(self.unlock)
1766
1815
self.branch.unlock()
1769
1818
def lock_tree_write(self):
1770
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1819
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1821
:return: A bzrlib.lock.LogicalLockResult.
1771
1823
if not self.is_locked():
1772
1824
self._reset_data()
1773
1825
self.branch.lock_read()
1775
return self._control_files.lock_write()
1827
self._control_files.lock_write()
1828
return LogicalLockResult(self.unlock)
1777
1830
self.branch.unlock()
1780
1833
def lock_write(self):
1781
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1834
"""See MutableTree.lock_write, and WorkingTree.unlock.
1836
:return: A bzrlib.lock.LogicalLockResult.
1782
1838
if not self.is_locked():
1783
1839
self._reset_data()
1784
1840
self.branch.lock_write()
1786
return self._control_files.lock_write()
1842
self._control_files.lock_write()
1843
return LogicalLockResult(self.unlock)
1788
1845
self.branch.unlock()
2191
2269
# We MUST save it even if an error occurs, because otherwise the users
2192
2270
# local work is unreferenced and will appear to have been lost.
2196
2274
last_rev = self.get_parent_ids()[0]
2197
2275
except IndexError:
2198
2276
last_rev = _mod_revision.NULL_REVISION
2199
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2200
# merge tree state up to new branch tip.
2277
if revision is None:
2278
revision = self.branch.last_revision()
2280
old_tip = old_tip or _mod_revision.NULL_REVISION
2282
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2283
# the branch we are bound to was updated
2284
# merge those changes in first
2285
base_tree = self.basis_tree()
2286
other_tree = self.branch.repository.revision_tree(old_tip)
2287
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2288
base_tree, this_tree=self,
2289
change_reporter=change_reporter)
2291
self.add_parent_tree((old_tip, other_tree))
2292
trace.note('Rerun update after fixing the conflicts.')
2295
if last_rev != _mod_revision.ensure_null(revision):
2296
# the working tree is up to date with the branch
2297
# we can merge the specified revision from master
2298
to_tree = self.branch.repository.revision_tree(revision)
2299
to_root_id = to_tree.get_root_id()
2201
2301
basis = self.basis_tree()
2202
2302
basis.lock_read()
2204
to_tree = self.branch.basis_tree()
2205
if basis.inventory.root is None:
2206
self.set_root_id(to_tree.get_root_id())
2304
if (basis.inventory.root is None
2305
or basis.inventory.root.file_id != to_root_id):
2306
self.set_root_id(to_root_id)
2208
result += merge.merge_inner(
2213
change_reporter=change_reporter)
2311
# determine the branch point
2312
graph = self.branch.repository.get_graph()
2313
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2315
base_tree = self.branch.repository.revision_tree(base_rev_id)
2317
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2319
change_reporter=change_reporter)
2320
self.set_last_revision(revision)
2216
2321
# TODO - dedup parents list with things merged by pull ?
2217
2322
# reuse the tree we've updated to to set the basis:
2218
parent_trees = [(self.branch.last_revision(), to_tree)]
2323
parent_trees = [(revision, to_tree)]
2219
2324
merges = self.get_parent_ids()[1:]
2220
2325
# Ideally we ask the tree for the trees here, that way the working
2221
# tree can decide whether to give us teh entire tree or give us a
2326
# tree can decide whether to give us the entire tree or give us a
2222
2327
# lazy initialised tree. dirstate for instance will have the trees
2223
2328
# in ram already, whereas a last-revision + basis-inventory tree
2224
2329
# will not, but also does not need them when setting parents.
2225
2330
for parent in merges:
2226
2331
parent_trees.append(
2227
2332
(parent, self.branch.repository.revision_tree(parent)))
2228
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2333
if not _mod_revision.is_null(old_tip):
2229
2334
parent_trees.append(
2230
2335
(old_tip, self.branch.repository.revision_tree(old_tip)))
2231
2336
self.set_parent_trees(parent_trees)
2232
2337
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)
2266
2340
def _write_hashcache_if_dirty(self):
2267
2341
"""Write out the hashcache if it is dirty."""