96
110
from bzrlib.filters import filtered_input_file
97
111
from bzrlib.trace import mutter, note
98
112
from bzrlib.transport.local import LocalTransport
99
from bzrlib.revision import CURRENT_REVISION
113
from bzrlib.progress import DummyProgress, ProgressPhase
114
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
100
115
from bzrlib.rio import RioReader, rio_file, Stanza
101
from bzrlib.symbol_versioning import (
103
DEPRECATED_PARAMETER,
116
from bzrlib.symbol_versioning import (deprecated_passed,
119
DEPRECATED_PARAMETER,
107
123
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
124
CONFLICT_HEADER_1 = "BZR conflict list format 1"
113
126
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
493
487
incorrectly attributed to CURRENT_REVISION (but after committing, the
494
488
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)]
490
basis = self.basis_tree()
493
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
494
require_versioned=True).next()
495
changed_content, kind = changes[2], changes[6]
496
if not changed_content:
497
return basis.annotate_iter(file_id)
501
if kind[0] != 'file':
504
old_lines = list(basis.annotate_iter(file_id))
506
for tree in self.branch.repository.revision_trees(
507
self.get_parent_ids()[1:]):
508
if file_id not in tree:
510
old.append(list(tree.annotate_iter(file_id)))
511
return annotate.reannotate(old, self.get_file(file_id).readlines(),
533
516
def _get_ancestors(self, default_revision):
534
517
ancestors = set([default_revision])
768
749
kind = 'tree-reference'
769
750
return kind, None, None, None
770
751
elif kind == 'symlink':
771
target = osutils.readlink(abspath)
772
return ('symlink', None, None, target)
752
return ('symlink', None, None,
753
os.readlink(abspath.encode(osutils._fs_enc)
754
).decode(osutils._fs_enc))
774
756
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
758
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
784
759
"""Common ghost checking functionality from set_parent_*.
915
890
branch.last_revision().
917
892
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()
893
pb = bzrlib.ui.ui_factory.nested_progress_bar()
895
merger = Merger(self.branch, this_tree=self, pb=pb)
896
merger.pp = ProgressPhase("Merge phase", 5, pb)
897
merger.pp.next_phase()
898
# check that there are no
900
merger.check_basis(check_clean=True, require_commits=False)
901
if to_revision is None:
902
to_revision = _mod_revision.ensure_null(branch.last_revision())
903
merger.other_rev_id = to_revision
904
if _mod_revision.is_null(merger.other_rev_id):
905
raise errors.NoCommits(branch)
906
self.branch.fetch(branch, last_revision=merger.other_rev_id)
907
merger.other_basis = merger.other_rev_id
908
merger.other_tree = self.branch.repository.revision_tree(
910
merger.other_branch = branch
911
merger.pp.next_phase()
912
if from_revision is None:
915
merger.set_base_revision(from_revision, branch)
916
if merger.base_rev_id == merger.other_rev_id:
917
raise errors.PointlessMerge
918
merger.backup_files = False
919
if merge_type is None:
920
merger.merge_type = Merge3Merger
922
merger.merge_type = merge_type
923
merger.set_interesting_files(None)
924
merger.show_base = False
925
merger.reprocess = False
926
conflicts = merger.do_merge()
1097
1078
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1098
1079
if tree_transport.base != branch_transport.base:
1099
1080
tree_bzrdir = format.initialize_on_transport(tree_transport)
1100
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1101
target_branch=new_branch)
1081
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1103
1083
tree_bzrdir = branch_bzrdir
1104
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1084
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1105
1085
wt.set_parent_ids(self.get_parent_ids())
1106
1086
my_inv = self.inventory
1107
child_inv = inventory.Inventory(root_id=None)
1087
child_inv = Inventory(root_id=None)
1108
1088
new_root = my_inv[file_id]
1109
1089
my_inv.remove_recursive_id(file_id)
1110
1090
new_root.parent_id = None
1135
1115
def _kind(self, relpath):
1136
1116
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).
1118
def list_files(self, include_root=False):
1119
"""Recursively list all files as (path, class, kind, id, entry).
1141
1121
Lists, but does not descend into unversioned directories.
1142
1123
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
1126
Skips the control directory.
1149
1128
# list_files is an iterator, so @needs_read_lock doesn't work properly
1150
1129
# with it. So callers should be careful to always read_lock the tree.
1165
1144
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1167
1146
# 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)
1147
children = os.listdir(self.basedir)
1178
1148
children.sort()
1179
1149
# jam 20060527 The kernel sized tree seems equivalent whether we
1180
1150
# use a deque and popleft to keep them sorted, or if we use a plain
1181
1151
# list and just reverse() them.
1182
1152
children = collections.deque(children)
1183
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1153
stack = [(inv.root.file_id, u'', self.basedir, children)]
1185
1155
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1244
1214
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
1217
# But do this child first
1218
new_children = os.listdir(fap)
1220
new_children = collections.deque(new_children)
1221
stack.append((f_ie.file_id, fp, fap, new_children))
1222
# Break out of inner loop,
1223
# so that we start outer loop with child
1257
1226
# if we finished all children, pop it off the stack
1494
1462
from_tail = splitpath(from_rel)[-1]
1495
1463
from_id = inv.path2id(from_rel)
1496
1464
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]
1465
raise errors.BzrRenameFailedError(from_rel,to_rel,
1466
errors.NotVersionedError(path=str(from_rel)))
1467
from_entry = inv[from_id]
1508
1468
from_parent_id = from_entry.parent_id
1509
1469
to_dir, to_tail = os.path.split(to_rel)
1510
1470
to_dir_id = inv.path2id(to_dir)
1602
1562
@needs_write_lock
1603
1563
def pull(self, source, overwrite=False, stop_revision=None,
1604
change_reporter=None, possible_transports=None, local=False):
1564
change_reporter=None, possible_transports=None):
1565
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1605
1566
source.lock_read()
1568
pp = ProgressPhase("Pull phase", 2, top_pb)
1607
1570
old_revision_info = self.branch.last_revision_info()
1608
1571
basis_tree = self.basis_tree()
1609
1572
count = self.branch.pull(source, overwrite, stop_revision,
1610
possible_transports=possible_transports,
1573
possible_transports=possible_transports)
1612
1574
new_revision_info = self.branch.last_revision_info()
1613
1575
if new_revision_info != old_revision_info:
1614
1577
repository = self.branch.repository
1578
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1615
1579
basis_tree.lock_read()
1617
1581
new_basis_tree = self.branch.basis_tree()
1799
1762
raise errors.ObjectNotLocked(self)
1801
1764
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.
1765
"""See Branch.lock_read, and WorkingTree.unlock."""
1808
1766
if not self.is_locked():
1809
1767
self._reset_data()
1810
1768
self.branch.lock_read()
1812
self._control_files.lock_read()
1813
return LogicalLockResult(self.unlock)
1770
return self._control_files.lock_read()
1815
1772
self.branch.unlock()
1818
1775
def lock_tree_write(self):
1819
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1821
:return: A bzrlib.lock.LogicalLockResult.
1776
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1823
1777
if not self.is_locked():
1824
1778
self._reset_data()
1825
1779
self.branch.lock_read()
1827
self._control_files.lock_write()
1828
return LogicalLockResult(self.unlock)
1781
return self._control_files.lock_write()
1830
1783
self.branch.unlock()
1833
1786
def lock_write(self):
1834
"""See MutableTree.lock_write, and WorkingTree.unlock.
1836
:return: A bzrlib.lock.LogicalLockResult.
1787
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1838
1788
if not self.is_locked():
1839
1789
self._reset_data()
1840
1790
self.branch.lock_write()
1842
self._control_files.lock_write()
1843
return LogicalLockResult(self.unlock)
1792
return self._control_files.lock_write()
1845
1794
self.branch.unlock()
2269
2197
# We MUST save it even if an error occurs, because otherwise the users
2270
2198
# local work is unreferenced and will appear to have been lost.
2274
2202
last_rev = self.get_parent_ids()[0]
2275
2203
except IndexError:
2276
2204
last_rev = _mod_revision.NULL_REVISION
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()
2205
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2206
# merge tree state up to new branch tip.
2301
2207
basis = self.basis_tree()
2302
2208
basis.lock_read()
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)
2210
to_tree = self.branch.basis_tree()
2211
if basis.inventory.root is None:
2212
self.set_root_id(to_tree.get_root_id())
2214
result += merge.merge_inner(
2219
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)
2321
2222
# TODO - dedup parents list with things merged by pull ?
2322
2223
# reuse the tree we've updated to to set the basis:
2323
parent_trees = [(revision, to_tree)]
2224
parent_trees = [(self.branch.last_revision(), to_tree)]
2324
2225
merges = self.get_parent_ids()[1:]
2325
2226
# Ideally we ask the tree for the trees here, that way the working
2326
# tree can decide whether to give us the entire tree or give us a
2227
# tree can decide whether to give us teh entire tree or give us a
2327
2228
# lazy initialised tree. dirstate for instance will have the trees
2328
2229
# in ram already, whereas a last-revision + basis-inventory tree
2329
2230
# will not, but also does not need them when setting parents.
2330
2231
for parent in merges:
2331
2232
parent_trees.append(
2332
2233
(parent, self.branch.repository.revision_tree(parent)))
2333
if not _mod_revision.is_null(old_tip):
2234
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2334
2235
parent_trees.append(
2335
2236
(old_tip, self.branch.repository.revision_tree(old_tip)))
2336
2237
self.set_parent_trees(parent_trees)
2337
2238
last_rev = parent_trees[0][0]
2240
# the working tree had the same last-revision as the master
2241
# branch did. We may still have pivot local work from the local
2242
# branch into old_tip:
2243
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2244
self.add_parent_tree_id(old_tip)
2245
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2246
and old_tip != last_rev):
2247
# our last revision was not the prior branch last revision
2248
# and we have converted that last revision to a pending merge.
2249
# base is somewhere between the branch tip now
2250
# and the now pending merge
2252
# Since we just modified the working tree and inventory, flush out
2253
# the current state, before we modify it again.
2254
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2255
# requires it only because TreeTransform directly munges the
2256
# inventory and calls tree._write_inventory(). Ultimately we
2257
# should be able to remove this extra flush.
2259
graph = self.branch.repository.get_graph()
2260
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2262
base_tree = self.branch.repository.revision_tree(base_rev_id)
2263
other_tree = self.branch.repository.revision_tree(old_tip)
2264
result += merge.merge_inner(
2269
change_reporter=change_reporter)
2340
2272
def _write_hashcache_if_dirty(self):
2341
2273
"""Write out the hashcache if it is dirty."""