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
89
80
from bzrlib.lockable_files import LockableFiles
90
81
from bzrlib.lockdir import LockDir
91
82
import bzrlib.mutabletree
92
83
from bzrlib.mutabletree import needs_tree_write_lock
93
84
from bzrlib import osutils
94
85
from bzrlib.osutils import (
104
93
supports_executable,
95
from bzrlib.filters import filtered_input_file
106
96
from bzrlib.trace import mutter, note
107
97
from bzrlib.transport.local import LocalTransport
108
from bzrlib.progress import DummyProgress, ProgressPhase
109
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
98
from bzrlib.revision import CURRENT_REVISION
110
99
from bzrlib.rio import RioReader, rio_file, Stanza
111
from bzrlib.symbol_versioning import (deprecated_passed,
114
DEPRECATED_PARAMETER,
100
from bzrlib.symbol_versioning import (
102
DEPRECATED_PARAMETER,
118
106
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.
119
110
CONFLICT_HEADER_1 = "BZR conflict list format 1"
121
112
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
435
446
def has_filename(self, filename):
436
447
return osutils.lexists(self.abspath(filename))
438
def get_file(self, file_id, path=None):
439
return self.get_file_with_stat(file_id, path)[0]
449
def get_file(self, file_id, path=None, filtered=True):
450
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
441
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
442
"""See MutableTree.get_file_with_stat."""
452
def get_file_with_stat(self, file_id, path=None, filtered=True,
454
"""See Tree.get_file_with_stat."""
444
456
path = self.id2path(file_id)
445
file_obj = self.get_file_byname(path)
446
return (file_obj, _fstat(file_obj.fileno()))
448
def get_file_byname(self, filename):
449
return file(self.abspath(filename), 'rb')
451
def get_file_lines(self, file_id, path=None):
457
file_obj = self.get_file_byname(path, filtered=False)
458
stat_value = _fstat(file_obj.fileno())
459
if filtered and self.supports_content_filtering():
460
filters = self._content_filter_stack(path)
461
file_obj = filtered_input_file(file_obj, filters)
462
return (file_obj, stat_value)
464
def get_file_text(self, file_id, path=None, filtered=True):
465
return self.get_file(file_id, path=path, filtered=filtered).read()
467
def get_file_byname(self, filename, filtered=True):
468
path = self.abspath(filename)
470
if filtered and self.supports_content_filtering():
471
filters = self._content_filter_stack(filename)
472
return filtered_input_file(f, filters)
476
def get_file_lines(self, file_id, path=None, filtered=True):
452
477
"""See Tree.get_file_lines()"""
453
file = self.get_file(file_id, path)
478
file = self.get_file(file_id, path, filtered=filtered)
455
480
return file.readlines()
467
492
incorrectly attributed to CURRENT_REVISION (but after committing, the
468
493
attribution will be correct).
470
basis = self.basis_tree()
473
changes = self.iter_changes(basis, True, [self.id2path(file_id)],
474
require_versioned=True).next()
475
changed_content, kind = changes[2], changes[6]
476
if not changed_content:
477
return basis.annotate_iter(file_id)
481
if kind[0] != 'file':
484
old_lines = list(basis.annotate_iter(file_id))
486
for tree in self.branch.repository.revision_trees(
487
self.get_parent_ids()[1:]):
488
if file_id not in tree:
490
old.append(list(tree.annotate_iter(file_id)))
491
return annotate.reannotate(old, self.get_file(file_id).readlines(),
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)]
496
532
def _get_ancestors(self, default_revision):
497
533
ancestors = set([default_revision])
729
767
kind = 'tree-reference'
730
768
return kind, None, None, None
731
769
elif kind == 'symlink':
732
return ('symlink', None, None,
733
os.readlink(abspath.encode(osutils._fs_enc)
734
).decode(osutils._fs_enc))
770
target = osutils.readlink(abspath)
771
return ('symlink', None, None, target)
736
773
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(
738
782
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
739
783
"""Common ghost checking functionality from set_parent_*.
870
914
branch.last_revision().
872
916
from bzrlib.merge import Merger, Merge3Merger
873
pb = bzrlib.ui.ui_factory.nested_progress_bar()
875
merger = Merger(self.branch, this_tree=self, pb=pb)
876
merger.pp = ProgressPhase("Merge phase", 5, pb)
877
merger.pp.next_phase()
878
# check that there are no
880
merger.check_basis(check_clean=True, require_commits=False)
881
if to_revision is None:
882
to_revision = _mod_revision.ensure_null(branch.last_revision())
883
merger.other_rev_id = to_revision
884
if _mod_revision.is_null(merger.other_rev_id):
885
raise errors.NoCommits(branch)
886
self.branch.fetch(branch, last_revision=merger.other_rev_id)
887
merger.other_basis = merger.other_rev_id
888
merger.other_tree = self.branch.repository.revision_tree(
890
merger.other_branch = branch
891
merger.pp.next_phase()
892
if from_revision is None:
895
merger.set_base_revision(from_revision, branch)
896
if merger.base_rev_id == merger.other_rev_id:
897
raise errors.PointlessMerge
898
merger.backup_files = False
899
if merge_type is None:
900
merger.merge_type = Merge3Merger
902
merger.merge_type = merge_type
903
merger.set_interesting_files(None)
904
merger.show_base = False
905
merger.reprocess = False
906
conflicts = merger.do_merge()
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()
1057
1096
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1058
1097
if tree_transport.base != branch_transport.base:
1059
1098
tree_bzrdir = format.initialize_on_transport(tree_transport)
1060
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1099
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1100
target_branch=new_branch)
1062
1102
tree_bzrdir = branch_bzrdir
1063
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1103
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1064
1104
wt.set_parent_ids(self.get_parent_ids())
1065
1105
my_inv = self.inventory
1066
child_inv = Inventory(root_id=None)
1106
child_inv = inventory.Inventory(root_id=None)
1067
1107
new_root = my_inv[file_id]
1068
1108
my_inv.remove_recursive_id(file_id)
1069
1109
new_root.parent_id = None
1088
1128
self._serialize(self._inventory, sio)
1090
1130
self._transport.put_file('inventory', sio,
1091
mode=self._control_files._file_mode)
1131
mode=self.bzrdir._get_file_mode())
1092
1132
self._inventory_is_modified = False
1094
1134
def _kind(self, relpath):
1095
1135
return osutils.file_kind(self.abspath(relpath))
1097
def list_files(self, include_root=False):
1098
"""Recursively list all files as (path, class, kind, id, entry).
1137
def list_files(self, include_root=False, from_dir=None, recursive=True):
1138
"""List all files as (path, class, kind, id, entry).
1100
1140
Lists, but does not descend into unversioned directories.
1102
1141
This does not include files that have been deleted in this
1142
tree. Skips the control directory.
1105
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
1107
1148
# list_files is an iterator, so @needs_read_lock doesn't work properly
1108
1149
# with it. So callers should be careful to always read_lock the tree.
1123
1164
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1125
1166
# directory file_id, relative path, absolute path, reverse sorted children
1126
children = os.listdir(self.basedir)
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)
1127
1177
children.sort()
1128
1178
# jam 20060527 The kernel sized tree seems equivalent whether we
1129
1179
# use a deque and popleft to keep them sorted, or if we use a plain
1130
1180
# list and just reverse() them.
1131
1181
children = collections.deque(children)
1132
stack = [(inv.root.file_id, u'', self.basedir, children)]
1182
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1134
1184
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1193
1243
if fk != 'directory':
1196
# But do this child first
1197
new_children = os.listdir(fap)
1199
new_children = collections.deque(new_children)
1200
stack.append((f_ie.file_id, fp, fap, new_children))
1201
# Break out of inner loop,
1202
# so that we start outer loop with child
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
1205
1256
# if we finished all children, pop it off the stack
1441
1493
from_tail = splitpath(from_rel)[-1]
1442
1494
from_id = inv.path2id(from_rel)
1443
1495
if from_id is None:
1444
raise errors.BzrRenameFailedError(from_rel,to_rel,
1445
errors.NotVersionedError(path=str(from_rel)))
1446
from_entry = inv[from_id]
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]
1447
1507
from_parent_id = from_entry.parent_id
1448
1508
to_dir, to_tail = os.path.split(to_rel)
1449
1509
to_dir_id = inv.path2id(to_dir)
1540
1601
@needs_write_lock
1541
1602
def pull(self, source, overwrite=False, stop_revision=None,
1542
change_reporter=None, possible_transports=None):
1543
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1603
change_reporter=None, possible_transports=None, local=False):
1544
1604
source.lock_read()
1546
pp = ProgressPhase("Pull phase", 2, top_pb)
1548
1606
old_revision_info = self.branch.last_revision_info()
1549
1607
basis_tree = self.basis_tree()
1550
1608
count = self.branch.pull(source, overwrite, stop_revision,
1551
possible_transports=possible_transports)
1609
possible_transports=possible_transports,
1552
1611
new_revision_info = self.branch.last_revision_info()
1553
1612
if new_revision_info != old_revision_info:
1555
1613
repository = self.branch.repository
1556
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1557
1614
basis_tree.lock_read()
1559
1616
new_basis_tree = self.branch.basis_tree()
2175
2253
# We MUST save it even if an error occurs, because otherwise the users
2176
2254
# local work is unreferenced and will appear to have been lost.
2180
2258
last_rev = self.get_parent_ids()[0]
2181
2259
except IndexError:
2182
2260
last_rev = _mod_revision.NULL_REVISION
2183
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2184
# merge tree state up to new branch tip.
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()
2185
2285
basis = self.basis_tree()
2186
2286
basis.lock_read()
2188
to_tree = self.branch.basis_tree()
2189
if basis.inventory.root is None:
2190
self.set_root_id(to_tree.get_root_id())
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)
2192
result += merge.merge_inner(
2197
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)
2200
2305
# TODO - dedup parents list with things merged by pull ?
2201
2306
# reuse the tree we've updated to to set the basis:
2202
parent_trees = [(self.branch.last_revision(), to_tree)]
2307
parent_trees = [(revision, to_tree)]
2203
2308
merges = self.get_parent_ids()[1:]
2204
2309
# Ideally we ask the tree for the trees here, that way the working
2205
# tree can decide whether to give us teh entire tree or give us a
2310
# tree can decide whether to give us the entire tree or give us a
2206
2311
# lazy initialised tree. dirstate for instance will have the trees
2207
2312
# in ram already, whereas a last-revision + basis-inventory tree
2208
2313
# will not, but also does not need them when setting parents.
2209
2314
for parent in merges:
2210
2315
parent_trees.append(
2211
2316
(parent, self.branch.repository.revision_tree(parent)))
2212
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2317
if not _mod_revision.is_null(old_tip):
2213
2318
parent_trees.append(
2214
2319
(old_tip, self.branch.repository.revision_tree(old_tip)))
2215
2320
self.set_parent_trees(parent_trees)
2216
2321
last_rev = parent_trees[0][0]
2218
# the working tree had the same last-revision as the master
2219
# branch did. We may still have pivot local work from the local
2220
# branch into old_tip:
2221
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2222
self.add_parent_tree_id(old_tip)
2223
if (old_tip is not None and not _mod_revision.is_null(old_tip)
2224
and old_tip != last_rev):
2225
# our last revision was not the prior branch last revision
2226
# and we have converted that last revision to a pending merge.
2227
# base is somewhere between the branch tip now
2228
# and the now pending merge
2230
# Since we just modified the working tree and inventory, flush out
2231
# the current state, before we modify it again.
2232
# TODO: jam 20070214 WorkingTree3 doesn't require this, dirstate
2233
# requires it only because TreeTransform directly munges the
2234
# inventory and calls tree._write_inventory(). Ultimately we
2235
# should be able to remove this extra flush.
2237
graph = self.branch.repository.get_graph()
2238
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2240
base_tree = self.branch.repository.revision_tree(base_rev_id)
2241
other_tree = self.branch.repository.revision_tree(old_tip)
2242
result += merge.merge_inner(
2247
change_reporter=change_reporter)
2250
2324
def _write_hashcache_if_dirty(self):
2251
2325
"""Write out the hashcache if it is dirty."""