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, os.readlink(abspath.encode(osutils._fs_enc)))
773
750
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
752
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
783
753
"""Common ghost checking functionality from set_parent_*.
914
884
branch.last_revision().
916
886
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()
887
pb = bzrlib.ui.ui_factory.nested_progress_bar()
889
merger = Merger(self.branch, this_tree=self, pb=pb)
890
merger.pp = ProgressPhase("Merge phase", 5, pb)
891
merger.pp.next_phase()
892
# check that there are no
894
merger.check_basis(check_clean=True, require_commits=False)
895
if to_revision is None:
896
to_revision = _mod_revision.ensure_null(branch.last_revision())
897
merger.other_rev_id = to_revision
898
if _mod_revision.is_null(merger.other_rev_id):
899
raise errors.NoCommits(branch)
900
self.branch.fetch(branch, last_revision=merger.other_rev_id)
901
merger.other_basis = merger.other_rev_id
902
merger.other_tree = self.branch.repository.revision_tree(
904
merger.other_branch = branch
905
merger.pp.next_phase()
906
if from_revision is None:
909
merger.set_base_revision(from_revision, branch)
910
if merger.base_rev_id == merger.other_rev_id:
911
raise errors.PointlessMerge
912
merger.backup_files = False
913
if merge_type is None:
914
merger.merge_type = Merge3Merger
916
merger.merge_type = merge_type
917
merger.set_interesting_files(None)
918
merger.show_base = False
919
merger.reprocess = False
920
conflicts = merger.do_merge()
1096
1071
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1097
1072
if tree_transport.base != branch_transport.base:
1098
1073
tree_bzrdir = format.initialize_on_transport(tree_transport)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1074
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1102
1076
tree_bzrdir = branch_bzrdir
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1077
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1104
1078
wt.set_parent_ids(self.get_parent_ids())
1105
1079
my_inv = self.inventory
1106
child_inv = inventory.Inventory(root_id=None)
1080
child_inv = Inventory(root_id=None)
1107
1081
new_root = my_inv[file_id]
1108
1082
my_inv.remove_recursive_id(file_id)
1109
1083
new_root.parent_id = None
1128
1102
self._serialize(self._inventory, sio)
1130
1104
self._transport.put_file('inventory', sio,
1131
mode=self.bzrdir._get_file_mode())
1105
mode=self._control_files._file_mode)
1132
1106
self._inventory_is_modified = False
1134
1108
def _kind(self, relpath):
1135
1109
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).
1111
def list_files(self, include_root=False):
1112
"""Recursively list all files as (path, class, kind, id, entry).
1140
1114
Lists, but does not descend into unversioned directories.
1141
1116
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
1119
Skips the control directory.
1148
1121
# list_files is an iterator, so @needs_read_lock doesn't work properly
1149
1122
# with it. So callers should be careful to always read_lock the tree.
1164
1137
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1166
1139
# 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)
1140
children = os.listdir(self.basedir)
1177
1141
children.sort()
1178
1142
# jam 20060527 The kernel sized tree seems equivalent whether we
1179
1143
# use a deque and popleft to keep them sorted, or if we use a plain
1180
1144
# list and just reverse() them.
1181
1145
children = collections.deque(children)
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1146
stack = [(inv.root.file_id, u'', self.basedir, children)]
1184
1148
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1243
1207
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
1210
# But do this child first
1211
new_children = os.listdir(fap)
1213
new_children = collections.deque(new_children)
1214
stack.append((f_ie.file_id, fp, fap, new_children))
1215
# Break out of inner loop,
1216
# so that we start outer loop with child
1256
1219
# if we finished all children, pop it off the stack
1493
1455
from_tail = splitpath(from_rel)[-1]
1494
1456
from_id = inv.path2id(from_rel)
1495
1457
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]
1458
raise errors.BzrRenameFailedError(from_rel,to_rel,
1459
errors.NotVersionedError(path=str(from_rel)))
1460
from_entry = inv[from_id]
1507
1461
from_parent_id = from_entry.parent_id
1508
1462
to_dir, to_tail = os.path.split(to_rel)
1509
1463
to_dir_id = inv.path2id(to_dir)
1601
1554
@needs_write_lock
1602
1555
def pull(self, source, overwrite=False, stop_revision=None,
1603
change_reporter=None, possible_transports=None, local=False):
1556
change_reporter=None, possible_transports=None):
1557
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1604
1558
source.lock_read()
1560
pp = ProgressPhase("Pull phase", 2, top_pb)
1606
1562
old_revision_info = self.branch.last_revision_info()
1607
1563
basis_tree = self.basis_tree()
1608
1564
count = self.branch.pull(source, overwrite, stop_revision,
1609
possible_transports=possible_transports,
1565
possible_transports=possible_transports)
1611
1566
new_revision_info = self.branch.last_revision_info()
1612
1567
if new_revision_info != old_revision_info:
1613
1569
repository = self.branch.repository
1570
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1614
1571
basis_tree.lock_read()
1616
1573
new_basis_tree = self.branch.basis_tree()
2253
2189
# We MUST save it even if an error occurs, because otherwise the users
2254
2190
# local work is unreferenced and will appear to have been lost.
2258
2194
last_rev = self.get_parent_ids()[0]
2259
2195
except IndexError:
2260
2196
last_rev = _mod_revision.NULL_REVISION
2261
if revision is None:
2262
revision = self.branch.last_revision()
2264
old_tip = old_tip or _mod_revision.NULL_REVISION
2266
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2267
# the branch we are bound to was updated
2268
# merge those changes in first
2269
base_tree = self.basis_tree()
2270
other_tree = self.branch.repository.revision_tree(old_tip)
2271
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2272
base_tree, this_tree=self,
2273
change_reporter=change_reporter)
2275
self.add_parent_tree((old_tip, other_tree))
2276
trace.note('Rerun update after fixing the conflicts.')
2279
if last_rev != _mod_revision.ensure_null(revision):
2280
# the working tree is up to date with the branch
2281
# we can merge the specified revision from master
2282
to_tree = self.branch.repository.revision_tree(revision)
2283
to_root_id = to_tree.get_root_id()
2197
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2198
# merge tree state up to new branch tip.
2285
2199
basis = self.basis_tree()
2286
2200
basis.lock_read()
2288
if (basis.inventory.root is None
2289
or basis.inventory.root.file_id != to_root_id):
2290
self.set_root_id(to_root_id)
2202
to_tree = self.branch.basis_tree()
2203
if basis.inventory.root is None:
2204
self.set_root_id(to_tree.get_root_id())
2206
result += merge.merge_inner(
2211
change_reporter=change_reporter)
2295
# determine the branch point
2296
graph = self.branch.repository.get_graph()
2297
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2299
base_tree = self.branch.repository.revision_tree(base_rev_id)
2301
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2303
change_reporter=change_reporter)
2304
self.set_last_revision(revision)
2305
2214
# TODO - dedup parents list with things merged by pull ?
2306
2215
# reuse the tree we've updated to to set the basis:
2307
parent_trees = [(revision, to_tree)]
2216
parent_trees = [(self.branch.last_revision(), to_tree)]
2308
2217
merges = self.get_parent_ids()[1:]
2309
2218
# Ideally we ask the tree for the trees here, that way the working
2310
# tree can decide whether to give us the entire tree or give us a
2219
# tree can decide whether to give us teh entire tree or give us a
2311
2220
# lazy initialised tree. dirstate for instance will have the trees
2312
2221
# in ram already, whereas a last-revision + basis-inventory tree
2313
2222
# will not, but also does not need them when setting parents.
2314
2223
for parent in merges:
2315
2224
parent_trees.append(
2316
2225
(parent, self.branch.repository.revision_tree(parent)))
2317
if not _mod_revision.is_null(old_tip):
2226
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2318
2227
parent_trees.append(
2319
2228
(old_tip, self.branch.repository.revision_tree(old_tip)))
2320
2229
self.set_parent_trees(parent_trees)
2321
2230
last_rev = parent_trees[0][0]
2232
# the working tree had the same last-revision as the master
2233
# branch did. We may still have pivot local work from the local
2234
# branch into old_tip:
2235
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2236
self.add_parent_tree_id(old_tip)
2237
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2238
and old_tip != last_rev):
2239
# our last revision was not the prior branch last revision
2240
# and we have converted that last revision to a pending merge.
2241
# base is somewhere between the branch tip now
2242
# and the now pending merge
2244
# Since we just modified the working tree and inventory, flush out
2245
# the current state, before we modify it again.
2246
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2247
# requires it only because TreeTransform directly munges the
2248
# inventory and calls tree._write_inventory(). Ultimately we
2249
# should be able to remove this extra flush.
2251
graph = self.branch.repository.get_graph()
2252
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2254
base_tree = self.branch.repository.revision_tree(base_rev_id)
2255
other_tree = self.branch.repository.revision_tree(old_tip)
2256
result += merge.merge_inner(
2261
change_reporter=change_reporter)
2324
2264
def _write_hashcache_if_dirty(self):
2325
2265
"""Write out the hashcache if it is dirty."""