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 (
94
104
supports_executable,
96
from bzrlib.filters import filtered_input_file
97
106
from bzrlib.trace import mutter, note
98
107
from bzrlib.transport.local import LocalTransport
99
from bzrlib.revision import CURRENT_REVISION
108
from bzrlib.progress import DummyProgress, ProgressPhase
109
from bzrlib.revision import NULL_REVISION, CURRENT_REVISION
100
110
from bzrlib.rio import RioReader, rio_file, Stanza
101
from bzrlib.symbol_versioning import (
103
DEPRECATED_PARAMETER,
111
from bzrlib.symbol_versioning import (deprecated_passed,
114
DEPRECATED_PARAMETER,
107
118
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
119
CONFLICT_HEADER_1 = "BZR conflict list format 1"
113
121
ERROR_PATH_NOT_FOUND = 3 # WindowsError errno code, equivalent to ENOENT
447
435
def has_filename(self, filename):
448
436
return osutils.lexists(self.abspath(filename))
450
def get_file(self, file_id, path=None, filtered=True):
451
return self.get_file_with_stat(file_id, path, filtered=filtered)[0]
438
def get_file(self, file_id, path=None):
439
return self.get_file_with_stat(file_id, path)[0]
453
def get_file_with_stat(self, file_id, path=None, filtered=True,
455
"""See Tree.get_file_with_stat."""
441
def get_file_with_stat(self, file_id, path=None, _fstat=os.fstat):
442
"""See MutableTree.get_file_with_stat."""
457
444
path = self.id2path(file_id)
458
file_obj = self.get_file_byname(path, filtered=False)
459
stat_value = _fstat(file_obj.fileno())
460
if filtered and self.supports_content_filtering():
461
filters = self._content_filter_stack(path)
462
file_obj = filtered_input_file(file_obj, filters)
463
return (file_obj, stat_value)
465
def get_file_text(self, file_id, path=None, filtered=True):
466
my_file = self.get_file(file_id, path=path, filtered=filtered)
468
return my_file.read()
472
def get_file_byname(self, filename, filtered=True):
473
path = self.abspath(filename)
475
if filtered and self.supports_content_filtering():
476
filters = self._content_filter_stack(filename)
477
return filtered_input_file(f, filters)
481
def get_file_lines(self, file_id, path=None, filtered=True):
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):
482
452
"""See Tree.get_file_lines()"""
483
file = self.get_file(file_id, path, filtered=filtered)
453
file = self.get_file(file_id, path)
485
455
return file.readlines()
497
467
incorrectly attributed to CURRENT_REVISION (but after committing, the
498
468
attribution will be correct).
500
maybe_file_parent_keys = []
501
for parent_id in self.get_parent_ids():
503
parent_tree = self.revision_tree(parent_id)
504
except errors.NoSuchRevisionInTree:
505
parent_tree = self.branch.repository.revision_tree(parent_id)
506
parent_tree.lock_read()
508
if file_id not in parent_tree:
510
ie = parent_tree.inventory[file_id]
511
if ie.kind != 'file':
512
# Note: this is slightly unnecessary, because symlinks and
513
# directories have a "text" which is the empty text, and we
514
# know that won't mess up annotations. But it seems cleaner
516
parent_text_key = (file_id, ie.revision)
517
if parent_text_key not in maybe_file_parent_keys:
518
maybe_file_parent_keys.append(parent_text_key)
521
graph = _mod_graph.Graph(self.branch.repository.texts)
522
heads = graph.heads(maybe_file_parent_keys)
523
file_parent_keys = []
524
for key in maybe_file_parent_keys:
526
file_parent_keys.append(key)
528
# Now we have the parents of this content
529
annotator = self.branch.repository.texts.get_annotator()
530
text = self.get_file_text(file_id)
531
this_key =(file_id, default_revision)
532
annotator.add_special_text(this_key, file_parent_keys, text)
533
annotations = [(key[-1], line)
534
for key, line in annotator.annotate_flat(this_key)]
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(),
537
496
def _get_ancestors(self, default_revision):
538
497
ancestors = set([default_revision])
772
729
kind = 'tree-reference'
773
730
return kind, None, None, None
774
731
elif kind == 'symlink':
775
target = osutils.readlink(abspath)
776
return ('symlink', None, None, target)
732
return ('symlink', None, None,
733
os.readlink(abspath.encode(osutils._fs_enc)
734
).decode(osutils._fs_enc))
778
736
return (kind, None, None, None)
780
def _file_content_summary(self, path, stat_result):
781
size = stat_result.st_size
782
executable = self._is_executable_from_path_and_stat(path, stat_result)
783
# try for a stat cache lookup
784
return ('file', size, executable, self._sha_from_stat(
787
738
def _check_parents_for_ghosts(self, revision_ids, allow_leftmost_as_ghost):
788
739
"""Common ghost checking functionality from set_parent_*.
919
870
branch.last_revision().
921
872
from bzrlib.merge import Merger, Merge3Merger
922
merger = Merger(self.branch, this_tree=self)
923
# check that there are no local alterations
924
if not force and self.has_changes():
925
raise errors.UncommittedChanges(self)
926
if to_revision is None:
927
to_revision = _mod_revision.ensure_null(branch.last_revision())
928
merger.other_rev_id = to_revision
929
if _mod_revision.is_null(merger.other_rev_id):
930
raise errors.NoCommits(branch)
931
self.branch.fetch(branch, last_revision=merger.other_rev_id)
932
merger.other_basis = merger.other_rev_id
933
merger.other_tree = self.branch.repository.revision_tree(
935
merger.other_branch = branch
936
if from_revision is None:
939
merger.set_base_revision(from_revision, branch)
940
if merger.base_rev_id == merger.other_rev_id:
941
raise errors.PointlessMerge
942
merger.backup_files = False
943
if merge_type is None:
944
merger.merge_type = Merge3Merger
946
merger.merge_type = merge_type
947
merger.set_interesting_files(None)
948
merger.show_base = False
949
merger.reprocess = False
950
conflicts = merger.do_merge()
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()
1101
1057
tree_transport = self.bzrdir.root_transport.clone(sub_path)
1102
1058
if tree_transport.base != branch_transport.base:
1103
1059
tree_bzrdir = format.initialize_on_transport(tree_transport)
1104
branch.BranchReferenceFormat().initialize(tree_bzrdir,
1105
target_branch=new_branch)
1060
branch.BranchReferenceFormat().initialize(tree_bzrdir, new_branch)
1107
1062
tree_bzrdir = branch_bzrdir
1108
wt = tree_bzrdir.create_workingtree(_mod_revision.NULL_REVISION)
1063
wt = tree_bzrdir.create_workingtree(NULL_REVISION)
1109
1064
wt.set_parent_ids(self.get_parent_ids())
1110
1065
my_inv = self.inventory
1111
child_inv = inventory.Inventory(root_id=None)
1066
child_inv = Inventory(root_id=None)
1112
1067
new_root = my_inv[file_id]
1113
1068
my_inv.remove_recursive_id(file_id)
1114
1069
new_root.parent_id = None
1133
1088
self._serialize(self._inventory, sio)
1135
1090
self._transport.put_file('inventory', sio,
1136
mode=self.bzrdir._get_file_mode())
1091
mode=self._control_files._file_mode)
1137
1092
self._inventory_is_modified = False
1139
1094
def _kind(self, relpath):
1140
1095
return osutils.file_kind(self.abspath(relpath))
1142
def list_files(self, include_root=False, from_dir=None, recursive=True):
1143
"""List all files as (path, class, kind, id, entry).
1097
def list_files(self, include_root=False):
1098
"""Recursively list all files as (path, class, kind, id, entry).
1145
1100
Lists, but does not descend into unversioned directories.
1146
1102
This does not include files that have been deleted in this
1147
tree. Skips the control directory.
1149
:param include_root: if True, return an entry for the root
1150
:param from_dir: start from this directory or None for the root
1151
:param recursive: whether to recurse into subdirectories or not
1105
Skips the control directory.
1153
1107
# list_files is an iterator, so @needs_read_lock doesn't work properly
1154
1108
# with it. So callers should be careful to always read_lock the tree.
1169
1123
fk_entries = {'directory':TreeDirectory, 'file':TreeFile, 'symlink':TreeLink}
1171
1125
# directory file_id, relative path, absolute path, reverse sorted children
1172
if from_dir is not None:
1173
from_dir_id = inv.path2id(from_dir)
1174
if from_dir_id is None:
1175
# Directory not versioned
1177
from_dir_abspath = pathjoin(self.basedir, from_dir)
1179
from_dir_id = inv.root.file_id
1180
from_dir_abspath = self.basedir
1181
children = os.listdir(from_dir_abspath)
1126
children = os.listdir(self.basedir)
1182
1127
children.sort()
1183
1128
# jam 20060527 The kernel sized tree seems equivalent whether we
1184
1129
# use a deque and popleft to keep them sorted, or if we use a plain
1185
1130
# list and just reverse() them.
1186
1131
children = collections.deque(children)
1187
stack = [(from_dir_id, u'', from_dir_abspath, children)]
1132
stack = [(inv.root.file_id, u'', self.basedir, children)]
1189
1134
from_dir_id, from_dir_relpath, from_dir_abspath, children = stack[-1]
1248
1193
if fk != 'directory':
1251
# But do this child first if recursing down
1253
new_children = os.listdir(fap)
1255
new_children = collections.deque(new_children)
1256
stack.append((f_ie.file_id, fp, fap, new_children))
1257
# Break out of inner loop,
1258
# so that we start outer loop with child
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
1261
1205
# if we finished all children, pop it off the stack
1498
1441
from_tail = splitpath(from_rel)[-1]
1499
1442
from_id = inv.path2id(from_rel)
1500
1443
if from_id is None:
1501
# if file is missing in the inventory maybe it's in the basis_tree
1502
basis_tree = self.branch.basis_tree()
1503
from_id = basis_tree.path2id(from_rel)
1505
raise errors.BzrRenameFailedError(from_rel,to_rel,
1506
errors.NotVersionedError(path=str(from_rel)))
1507
# put entry back in the inventory so we can rename it
1508
from_entry = basis_tree.inventory[from_id].copy()
1511
from_entry = inv[from_id]
1444
raise errors.BzrRenameFailedError(from_rel,to_rel,
1445
errors.NotVersionedError(path=str(from_rel)))
1446
from_entry = inv[from_id]
1512
1447
from_parent_id = from_entry.parent_id
1513
1448
to_dir, to_tail = os.path.split(to_rel)
1514
1449
to_dir_id = inv.path2id(to_dir)
1606
1540
@needs_write_lock
1607
1541
def pull(self, source, overwrite=False, stop_revision=None,
1608
change_reporter=None, possible_transports=None, local=False):
1542
change_reporter=None, possible_transports=None):
1543
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1609
1544
source.lock_read()
1546
pp = ProgressPhase("Pull phase", 2, top_pb)
1611
1548
old_revision_info = self.branch.last_revision_info()
1612
1549
basis_tree = self.basis_tree()
1613
1550
count = self.branch.pull(source, overwrite, stop_revision,
1614
possible_transports=possible_transports,
1551
possible_transports=possible_transports)
1616
1552
new_revision_info = self.branch.last_revision_info()
1617
1553
if new_revision_info != old_revision_info:
1618
1555
repository = self.branch.repository
1556
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1619
1557
basis_tree.lock_read()
1621
1559
new_basis_tree = self.branch.basis_tree()
1803
1740
raise errors.ObjectNotLocked(self)
1805
1742
def lock_read(self):
1806
"""Lock the tree for reading.
1808
This also locks the branch, and can be unlocked via self.unlock().
1810
:return: A bzrlib.lock.LogicalLockResult.
1743
"""See Branch.lock_read, and WorkingTree.unlock."""
1812
1744
if not self.is_locked():
1813
1745
self._reset_data()
1814
1746
self.branch.lock_read()
1816
self._control_files.lock_read()
1817
return LogicalLockResult(self.unlock)
1748
return self._control_files.lock_read()
1819
1750
self.branch.unlock()
1822
1753
def lock_tree_write(self):
1823
"""See MutableTree.lock_tree_write, and WorkingTree.unlock.
1825
:return: A bzrlib.lock.LogicalLockResult.
1754
"""See MutableTree.lock_tree_write, and WorkingTree.unlock."""
1827
1755
if not self.is_locked():
1828
1756
self._reset_data()
1829
1757
self.branch.lock_read()
1831
self._control_files.lock_write()
1832
return LogicalLockResult(self.unlock)
1759
return self._control_files.lock_write()
1834
1761
self.branch.unlock()
1837
1764
def lock_write(self):
1838
"""See MutableTree.lock_write, and WorkingTree.unlock.
1840
:return: A bzrlib.lock.LogicalLockResult.
1765
"""See MutableTree.lock_write, and WorkingTree.unlock."""
1842
1766
if not self.is_locked():
1843
1767
self._reset_data()
1844
1768
self.branch.lock_write()
1846
self._control_files.lock_write()
1847
return LogicalLockResult(self.unlock)
1770
return self._control_files.lock_write()
1849
1772
self.branch.unlock()
2273
2175
# We MUST save it even if an error occurs, because otherwise the users
2274
2176
# local work is unreferenced and will appear to have been lost.
2278
2180
last_rev = self.get_parent_ids()[0]
2279
2181
except IndexError:
2280
2182
last_rev = _mod_revision.NULL_REVISION
2281
if revision is None:
2282
revision = self.branch.last_revision()
2284
old_tip = old_tip or _mod_revision.NULL_REVISION
2286
if not _mod_revision.is_null(old_tip) and old_tip != last_rev:
2287
# the branch we are bound to was updated
2288
# merge those changes in first
2289
base_tree = self.basis_tree()
2290
other_tree = self.branch.repository.revision_tree(old_tip)
2291
nb_conflicts = merge.merge_inner(self.branch, other_tree,
2292
base_tree, this_tree=self,
2293
change_reporter=change_reporter)
2295
self.add_parent_tree((old_tip, other_tree))
2296
trace.note('Rerun update after fixing the conflicts.')
2299
if last_rev != _mod_revision.ensure_null(revision):
2300
# the working tree is up to date with the branch
2301
# we can merge the specified revision from master
2302
to_tree = self.branch.repository.revision_tree(revision)
2303
to_root_id = to_tree.get_root_id()
2183
if last_rev != _mod_revision.ensure_null(self.branch.last_revision()):
2184
# merge tree state up to new branch tip.
2305
2185
basis = self.basis_tree()
2306
2186
basis.lock_read()
2308
if (basis.inventory.root is None
2309
or basis.inventory.root.file_id != to_root_id):
2310
self.set_root_id(to_root_id)
2188
to_tree = self.branch.basis_tree()
2189
if basis.inventory.root is None:
2190
self.set_root_id(to_tree.get_root_id())
2192
result += merge.merge_inner(
2197
change_reporter=change_reporter)
2315
# determine the branch point
2316
graph = self.branch.repository.get_graph()
2317
base_rev_id = graph.find_unique_lca(self.branch.last_revision(),
2319
base_tree = self.branch.repository.revision_tree(base_rev_id)
2321
nb_conflicts = merge.merge_inner(self.branch, to_tree, base_tree,
2323
change_reporter=change_reporter)
2324
self.set_last_revision(revision)
2325
2200
# TODO - dedup parents list with things merged by pull ?
2326
2201
# reuse the tree we've updated to to set the basis:
2327
parent_trees = [(revision, to_tree)]
2202
parent_trees = [(self.branch.last_revision(), to_tree)]
2328
2203
merges = self.get_parent_ids()[1:]
2329
2204
# Ideally we ask the tree for the trees here, that way the working
2330
# tree can decide whether to give us the entire tree or give us a
2205
# tree can decide whether to give us teh entire tree or give us a
2331
2206
# lazy initialised tree. dirstate for instance will have the trees
2332
2207
# in ram already, whereas a last-revision + basis-inventory tree
2333
2208
# will not, but also does not need them when setting parents.
2334
2209
for parent in merges:
2335
2210
parent_trees.append(
2336
2211
(parent, self.branch.repository.revision_tree(parent)))
2337
if not _mod_revision.is_null(old_tip):
2212
if (old_tip is not None and not _mod_revision.is_null(old_tip)):
2338
2213
parent_trees.append(
2339
2214
(old_tip, self.branch.repository.revision_tree(old_tip)))
2340
2215
self.set_parent_trees(parent_trees)
2341
2216
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)
2344
2250
def _write_hashcache_if_dirty(self):
2345
2251
"""Write out the hashcache if it is dirty."""