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
80
from bzrlib.lock import LogicalLockResult
88
from bzrlib.inventory import InventoryEntry, Inventory, ROOT_ID, TreeReference
81
89
from bzrlib.lockable_files import LockableFiles
82
90
from bzrlib.lockdir import LockDir
83
91
import bzrlib.mutabletree
84
92
from bzrlib.mutabletree import needs_tree_write_lock
85
93
from bzrlib import osutils
86
94
from bzrlib.osutils import (
96
106
from bzrlib.filters import filtered_input_file
97
107
from bzrlib.trace import mutter, note
98
108
from bzrlib.transport.local import LocalTransport
99
from bzrlib.revision import CURRENT_REVISION
109
from bzrlib.progress import DummyProgress, ProgressPhase
110
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
100
111
from bzrlib.rio import RioReader, rio_file, Stanza
101
from bzrlib.symbol_versioning import (
103
DEPRECATED_PARAMETER,
112
from bzrlib.symbol_versioning import (deprecated_passed,
115
DEPRECATED_PARAMETER,
107
119
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.
111
120
CONFLICT_HEADER_1 = "BZR conflict list format 1"
113
122
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
493
483
incorrectly attributed to CURRENT_REVISION (but after committing, the
494
484
attribution will be correct).
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)]
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(),
533
512
def _get_ancestors(self, default_revision):
534
513
ancestors = set([default_revision])
768
745
kind = 'tree-reference'
769
746
return kind, None, None, None
770
747
elif kind == 'symlink':
771
target = osutils.readlink(abspath)
772
return ('symlink', None, None, target)
748
return ('symlink', None, None,
749
os.readlink(abspath.encode(osutils._fs_enc)
750
).decode(osutils._fs_enc))
774
752
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(
783
754
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
784
755
"""Common ghost checking functionality from set_parent_*.
915
886
branch.last_revision().
917
888
from bzrlib.merge import Merger, Merge3Merger
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()
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()
1097
1073
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1098
1074
if tree_transport.base != branch_transport.base:
1099
1075
tree_bzrdir = format.initialize_on_transport(tree_transport)
1100
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1101
target_branch=new_branch)
1076
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1103
1078
tree_bzrdir = branch_bzrdir
1104
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1079
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1105
1080
wt.set_parent_ids(self.get_parent_ids())
1106
1081
my_inv = self.inventory
1107
child_inv = inventory.Inventory(root_id=None)
1082
child_inv = Inventory(root_id=None)
1108
1083
new_root = my_inv[file_id]
1109
1084
my_inv.remove_recursive_id(file_id)
1110
1085
new_root.parent_id = None
1129
1104
self._serialize(self._inventory, sio)
1131
1106
self._transport.put_file('inventory', sio,
1132
mode=self.bzrdir._get_file_mode())
1107
mode=self._control_files._file_mode)
1133
1108
self._inventory_is_modified = False
1135
1110
def _kind(self, relpath):
1136
1111
return osutils.file_kind(self.abspath(relpath))
1138
def list_files(self, include_root=False, from_dir=None, recursive=True):
1139
"""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).
1141
1116
Lists, but does not descend into unversioned directories.
1142
1118
This does not include files that have been deleted in this
1143
tree. 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
1121
Skips the control directory.
1149
1123
# list_files is an iterator, so @needs_read_lock doesn't work properly
1150
1124
# with it. So callers should be careful to always read_lock the tree.
1165
1139
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1167
1141
# directory file_id, relative path, absolute path, reverse sorted children
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)
1142
children = os.listdir(self.basedir)
1178
1143
children.sort()
1179
1144
# jam 20060527 The kernel sized tree seems equivalent whether we
1180
1145
# use a deque and popleft to keep them sorted, or if we use a plain
1181
1146
# list and just reverse() them.
1182
1147
children = collections.deque(children)
1183
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1148
stack = [(inv.root.file_id, u'', self.basedir, children)]
1185
1150
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1244
1209
if fk != 'directory':
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
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
1257
1221
# if we finished all children, pop it off the stack
1494
1457
from_tail = splitpath(from_rel)[-1]
1495
1458
from_id = inv.path2id(from_rel)
1496
1459
if from_id is None:
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]
1460
raise errors.BzrRenameFailedError(from_rel,to_rel,
1461
errors.NotVersionedError(path=str(from_rel)))
1462
from_entry = inv[from_id]
1508
1463
from_parent_id = from_entry.parent_id
1509
1464
to_dir, to_tail = os.path.split(to_rel)
1510
1465
to_dir_id = inv.path2id(to_dir)
1602
1556
@needs_write_lock
1603
1557
def pull(self, source, overwrite=False, stop_revision=None,
1604
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()
1605
1560
source.lock_read()
1562
pp = ProgressPhase("Pull phase", 2, top_pb)
1607
1564
old_revision_info = self.branch.last_revision_info()
1608
1565
basis_tree = self.basis_tree()
1609
1566
count = self.branch.pull(source, overwrite, stop_revision,
1610
possible_transports=possible_transports,
1567
possible_transports=possible_transports)
1612
1568
new_revision_info = self.branch.last_revision_info()
1613
1569
if new_revision_info != old_revision_info:
1614
1571
repository = self.branch.repository
1572
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1615
1573
basis_tree.lock_read()
1617
1575
new_basis_tree = self.branch.basis_tree()
1799
1756
raise errors.ObjectNotLocked(self)
1801
1758
def lock_read(self):
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.
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()
1813
return LogicalLockResult(self.unlock)
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: A bzrlib.lock.LogicalLockResult.
1770
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1823
1771
if not self.is_locked():
1824
1772
self._reset_data()
1825
1773
self.branch.lock_read()
1827
self._control_files.lock_write()
1828
return LogicalLockResult(self.unlock)
1775
return self._control_files.lock_write()
1830
1777
self.branch.unlock()
1833
1780
def lock_write(self):
1834
"""See MutableTree.lock_write, and WorkingTree.unlock.
1836
:return: A bzrlib.lock.LogicalLockResult.
1781
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1838
1782
if not self.is_locked():
1839
1783
self._reset_data()
1840
1784
self.branch.lock_write()
1842
self._control_files.lock_write()
1843
return LogicalLockResult(self.unlock)
1786
return self._control_files.lock_write()
1845
1788
self.branch.unlock()
2268
2191
# We MUST save it even if an error occurs, because otherwise the users
2269
2192
# local work is unreferenced and will appear to have been lost.
2273
2196
last_rev = self.get_parent_ids()[0]
2274
2197
except IndexError:
2275
2198
last_rev = _mod_revision.NULL_REVISION
2276
if revision is None:
2277
revision = self.branch.last_revision()
2279
old_tip = old_tip or _mod_revision.NULL_REVISION
2281
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2282
# the branch we are bound to was updated
2283
# merge those changes in first
2284
base_tree = self.basis_tree()
2285
other_tree = self.branch.repository.revision_tree(old_tip)
2286
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2287
base_tree, this_tree=self,
2288
change_reporter=change_reporter)
2290
self.add_parent_tree((old_tip, other_tree))
2291
trace.note('Rerun update after fixing the conflicts.')
2294
if last_rev != _mod_revision.ensure_null(revision):
2295
# the working tree is up to date with the branch
2296
# we can merge the specified revision from master
2297
to_tree = self.branch.repository.revision_tree(revision)
2298
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.
2300
2201
basis = self.basis_tree()
2301
2202
basis.lock_read()
2303
if (basis.inventory.root is None
2304
or basis.inventory.root.file_id != to_root_id):
2305
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)
2310
# determine the branch point
2311
graph = self.branch.repository.get_graph()
2312
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2314
base_tree = self.branch.repository.revision_tree(base_rev_id)
2316
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2318
change_reporter=change_reporter)
2319
self.set_last_revision(revision)
2320
2216
# TODO - dedup parents list with things merged by pull ?
2321
2217
# reuse the tree we've updated to to set the basis:
2322
parent_trees = [(revision, to_tree)]
2218
parent_trees = [(self.branch.last_revision(), to_tree)]
2323
2219
merges = self.get_parent_ids()[1:]
2324
2220
# Ideally we ask the tree for the trees here, that way the working
2325
# 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
2326
2222
# lazy initialised tree. dirstate for instance will have the trees
2327
2223
# in ram already, whereas a last-revision + basis-inventory tree
2328
2224
# will not, but also does not need them when setting parents.
2329
2225
for parent in merges:
2330
2226
parent_trees.append(
2331
2227
(parent, self.branch.repository.revision_tree(parent)))
2332
if not _mod_revision.is_null(old_tip):
2228
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2333
2229
parent_trees.append(
2334
2230
(old_tip, self.branch.repository.revision_tree(old_tip)))
2335
2231
self.set_parent_trees(parent_trees)
2336
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)
2339
2266
def _write_hashcache_if_dirty(self):
2340
2267
"""Write out the hashcache if it is dirty."""