861
976
self.create_symlink(target, trans_id)
979
def _affected_ids(self):
980
"""Return the set of transform ids affected by the transform"""
981
trans_ids = set(self._removed_id)
982
trans_ids.update(self._new_id.keys())
983
trans_ids.update(self._removed_contents)
984
trans_ids.update(self._new_contents.keys())
985
trans_ids.update(self._new_executability.keys())
986
trans_ids.update(self._new_name.keys())
987
trans_ids.update(self._new_parent.keys())
990
def _get_file_id_maps(self):
991
"""Return mapping of file_ids to trans_ids in the to and from states"""
992
trans_ids = self._affected_ids()
995
# Build up two dicts: trans_ids associated with file ids in the
996
# FROM state, vs the TO state.
997
for trans_id in trans_ids:
998
from_file_id = self.tree_file_id(trans_id)
999
if from_file_id is not None:
1000
from_trans_ids[from_file_id] = trans_id
1001
to_file_id = self.final_file_id(trans_id)
1002
if to_file_id is not None:
1003
to_trans_ids[to_file_id] = trans_id
1004
return from_trans_ids, to_trans_ids
1006
def _from_file_data(self, from_trans_id, from_versioned, file_id):
1007
"""Get data about a file in the from (tree) state
1009
Return a (name, parent, kind, executable) tuple
1011
from_path = self._tree_id_paths.get(from_trans_id)
1013
# get data from working tree if versioned
1014
from_entry = self._tree.iter_entries_by_dir([file_id]).next()[1]
1015
from_name = from_entry.name
1016
from_parent = from_entry.parent_id
1019
if from_path is None:
1020
# File does not exist in FROM state
1024
# File exists, but is not versioned. Have to use path-
1026
from_name = os.path.basename(from_path)
1027
tree_parent = self.get_tree_parent(from_trans_id)
1028
from_parent = self.tree_file_id(tree_parent)
1029
if from_path is not None:
1030
from_kind, from_executable, from_stats = \
1031
self._tree._comparison_data(from_entry, from_path)
1034
from_executable = False
1035
return from_name, from_parent, from_kind, from_executable
1037
def _to_file_data(self, to_trans_id, from_trans_id, from_executable):
1038
"""Get data about a file in the to (target) state
1040
Return a (name, parent, kind, executable) tuple
1042
to_name = self.final_name(to_trans_id)
1044
to_kind = self.final_kind(to_trans_id)
1047
to_parent = self.final_file_id(self.final_parent(to_trans_id))
1048
if to_trans_id in self._new_executability:
1049
to_executable = self._new_executability[to_trans_id]
1050
elif to_trans_id == from_trans_id:
1051
to_executable = from_executable
1053
to_executable = False
1054
return to_name, to_parent, to_kind, to_executable
1056
def iter_changes(self):
1057
"""Produce output in the same format as Tree.iter_changes.
1059
Will produce nonsensical results if invoked while inventory/filesystem
1060
conflicts (as reported by TreeTransform.find_conflicts()) are present.
1062
This reads the Transform, but only reproduces changes involving a
1063
file_id. Files that are not versioned in either of the FROM or TO
1064
states are not reflected.
1066
final_paths = FinalPaths(self)
1067
from_trans_ids, to_trans_ids = self._get_file_id_maps()
1069
# Now iterate through all active file_ids
1070
for file_id in set(from_trans_ids.keys() + to_trans_ids.keys()):
1072
from_trans_id = from_trans_ids.get(file_id)
1073
# find file ids, and determine versioning state
1074
if from_trans_id is None:
1075
from_versioned = False
1076
from_trans_id = to_trans_ids[file_id]
1078
from_versioned = True
1079
to_trans_id = to_trans_ids.get(file_id)
1080
if to_trans_id is None:
1081
to_versioned = False
1082
to_trans_id = from_trans_id
1086
from_name, from_parent, from_kind, from_executable = \
1087
self._from_file_data(from_trans_id, from_versioned, file_id)
1089
to_name, to_parent, to_kind, to_executable = \
1090
self._to_file_data(to_trans_id, from_trans_id, from_executable)
1092
if not from_versioned:
1095
from_path = self._tree_id_paths.get(from_trans_id)
1096
if not to_versioned:
1099
to_path = final_paths.get_path(to_trans_id)
1100
if from_kind != to_kind:
1102
elif to_kind in ('file', 'symlink') and (
1103
to_trans_id != from_trans_id or
1104
to_trans_id in self._new_contents):
1106
if (not modified and from_versioned == to_versioned and
1107
from_parent==to_parent and from_name == to_name and
1108
from_executable == to_executable):
1110
results.append((file_id, (from_path, to_path), modified,
1111
(from_versioned, to_versioned),
1112
(from_parent, to_parent),
1113
(from_name, to_name),
1114
(from_kind, to_kind),
1115
(from_executable, to_executable)))
1116
return iter(sorted(results, key=lambda x:x[1]))
1118
def get_preview_tree(self):
1119
"""Return a tree representing the result of the transform.
1121
This tree only supports the subset of Tree functionality required
1122
by show_diff_trees. It must only be compared to tt._tree.
1124
return _PreviewTree(self)
1127
class TreeTransform(TreeTransformBase):
1128
"""Represent a tree transformation.
1130
This object is designed to support incremental generation of the transform,
1133
However, it gives optimum performance when parent directories are created
1134
before their contents. The transform is then able to put child files
1135
directly in their parent directory, avoiding later renames.
1137
It is easy to produce malformed transforms, but they are generally
1138
harmless. Attempting to apply a malformed transform will cause an
1139
exception to be raised before any modifications are made to the tree.
1141
Many kinds of malformed transforms can be corrected with the
1142
resolve_conflicts function. The remaining ones indicate programming error,
1143
such as trying to create a file with no path.
1145
Two sets of file creation methods are supplied. Convenience methods are:
1150
These are composed of the low-level methods:
1152
* create_file or create_directory or create_symlink
1156
Transform/Transaction ids
1157
-------------------------
1158
trans_ids are temporary ids assigned to all files involved in a transform.
1159
It's possible, even common, that not all files in the Tree have trans_ids.
1161
trans_ids are used because filenames and file_ids are not good enough
1162
identifiers; filenames change, and not all files have file_ids. File-ids
1163
are also associated with trans-ids, so that moving a file moves its
1166
trans_ids are only valid for the TreeTransform that generated them.
1170
Limbo is a temporary directory use to hold new versions of files.
1171
Files are added to limbo by create_file, create_directory, create_symlink,
1172
and their convenience variants (new_*). Files may be removed from limbo
1173
using cancel_creation. Files are renamed from limbo into their final
1174
location as part of TreeTransform.apply
1176
Limbo must be cleaned up, by either calling TreeTransform.apply or
1177
calling TreeTransform.finalize.
1179
Files are placed into limbo inside their parent directories, where
1180
possible. This reduces subsequent renames, and makes operations involving
1181
lots of files faster. This optimization is only possible if the parent
1182
directory is created *before* creating any of its children, so avoid
1183
creating children before parents, where possible.
1187
This temporary directory is used by _FileMover for storing files that are
1188
about to be deleted. In case of rollback, the files will be restored.
1189
FileMover does not delete files until it is sure that a rollback will not
1192
def __init__(self, tree, pb=DummyProgress()):
1193
"""Note: a tree_write lock is taken on the tree.
1195
Use TreeTransform.finalize() to release the lock (can be omitted if
1196
TreeTransform.apply() called).
1198
tree.lock_tree_write()
1201
limbodir = urlutils.local_path_from_url(
1202
tree._transport.abspath('limbo'))
1206
if e.errno == errno.EEXIST:
1207
raise ExistingLimbo(limbodir)
1208
deletiondir = urlutils.local_path_from_url(
1209
tree._transport.abspath('pending-deletion'))
1211
os.mkdir(deletiondir)
1213
if e.errno == errno.EEXIST:
1214
raise errors.ExistingPendingDeletion(deletiondir)
1219
TreeTransformBase.__init__(self, tree, limbodir, pb,
1220
tree.case_sensitive)
1221
self._deletiondir = deletiondir
1223
def apply(self, no_conflicts=False, precomputed_delta=None, _mover=None):
1224
"""Apply all changes to the inventory and filesystem.
1226
If filesystem or inventory conflicts are present, MalformedTransform
1229
If apply succeeds, finalize is not necessary.
1231
:param no_conflicts: if True, the caller guarantees there are no
1232
conflicts, so no check is made.
1233
:param precomputed_delta: An inventory delta to use instead of
1235
:param _mover: Supply an alternate FileMover, for testing
1237
if not no_conflicts:
1238
conflicts = self.find_conflicts()
1239
if len(conflicts) != 0:
1240
raise MalformedTransform(conflicts=conflicts)
1241
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1243
if precomputed_delta is None:
1244
child_pb.update('Apply phase', 0, 2)
1245
inventory_delta = self._generate_inventory_delta()
1248
inventory_delta = precomputed_delta
1251
mover = _FileMover()
1255
child_pb.update('Apply phase', 0 + offset, 2 + offset)
1256
self._apply_removals(mover)
1257
child_pb.update('Apply phase', 1 + offset, 2 + offset)
1258
modified_paths = self._apply_insertions(mover)
1263
mover.apply_deletions()
1266
self._tree.apply_inventory_delta(inventory_delta)
1269
return _TransformResults(modified_paths, self.rename_count)
1271
def _generate_inventory_delta(self):
1272
"""Generate an inventory delta for the current transform."""
1273
inventory_delta = []
1274
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1275
new_paths = self._inventory_altered()
1276
total_entries = len(new_paths) + len(self._removed_id)
1278
for num, trans_id in enumerate(self._removed_id):
1280
child_pb.update('removing file', num, total_entries)
1281
if trans_id == self._new_root:
1282
file_id = self._tree.get_root_id()
1284
file_id = self.tree_file_id(trans_id)
1285
# File-id isn't really being deleted, just moved
1286
if file_id in self._r_new_id:
1288
path = self._tree_id_paths[trans_id]
1289
inventory_delta.append((path, None, file_id, None))
1290
new_path_file_ids = dict((t, self.final_file_id(t)) for p, t in
1292
entries = self._tree.iter_entries_by_dir(
1293
new_path_file_ids.values())
1294
old_paths = dict((e.file_id, p) for p, e in entries)
1296
for num, (path, trans_id) in enumerate(new_paths):
1298
child_pb.update('adding file',
1299
num + len(self._removed_id), total_entries)
1300
file_id = new_path_file_ids[trans_id]
1305
kind = self.final_kind(trans_id)
1307
kind = self._tree.stored_kind(file_id)
1308
parent_trans_id = self.final_parent(trans_id)
1309
parent_file_id = new_path_file_ids.get(parent_trans_id)
1310
if parent_file_id is None:
1311
parent_file_id = self.final_file_id(parent_trans_id)
1312
if trans_id in self._new_reference_revision:
1313
new_entry = inventory.TreeReference(
1315
self._new_name[trans_id],
1316
self.final_file_id(self._new_parent[trans_id]),
1317
None, self._new_reference_revision[trans_id])
1319
new_entry = inventory.make_entry(kind,
1320
self.final_name(trans_id),
1321
parent_file_id, file_id)
1322
old_path = old_paths.get(new_entry.file_id)
1323
new_executability = self._new_executability.get(trans_id)
1324
if new_executability is not None:
1325
new_entry.executable = new_executability
1326
inventory_delta.append(
1327
(old_path, path, new_entry.file_id, new_entry))
1330
return inventory_delta
1332
def _apply_removals(self, mover):
1333
"""Perform tree operations that remove directory/inventory names.
1335
That is, delete files that are to be deleted, and put any files that
1336
need renaming into limbo. This must be done in strict child-to-parent
1339
If inventory_delta is None, no inventory delta generation is performed.
1341
tree_paths = list(self._tree_path_ids.iteritems())
1342
tree_paths.sort(reverse=True)
1343
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1345
for num, data in enumerate(tree_paths):
1346
path, trans_id = data
1347
child_pb.update('removing file', num, len(tree_paths))
1348
full_path = self._tree.abspath(path)
1349
if trans_id in self._removed_contents:
1350
mover.pre_delete(full_path, os.path.join(self._deletiondir,
1352
elif trans_id in self._new_name or trans_id in \
1355
mover.rename(full_path, self._limbo_name(trans_id))
1357
if e.errno != errno.ENOENT:
1360
self.rename_count += 1
1364
def _apply_insertions(self, mover):
1365
"""Perform tree operations that insert directory/inventory names.
1367
That is, create any files that need to be created, and restore from
1368
limbo any files that needed renaming. This must be done in strict
1369
parent-to-child order.
1371
If inventory_delta is None, no inventory delta is calculated, and
1372
no list of modified paths is returned.
1374
new_paths = self.new_paths(filesystem_only=True)
1376
new_path_file_ids = dict((t, self.final_file_id(t)) for p, t in
1378
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1380
for num, (path, trans_id) in enumerate(new_paths):
1382
child_pb.update('adding file', num, len(new_paths))
1383
full_path = self._tree.abspath(path)
1384
if trans_id in self._needs_rename:
1386
mover.rename(self._limbo_name(trans_id), full_path)
1388
# We may be renaming a dangling inventory id
1389
if e.errno != errno.ENOENT:
1392
self.rename_count += 1
1393
if (trans_id in self._new_contents or
1394
self.path_changed(trans_id)):
1395
if trans_id in self._new_contents:
1396
modified_paths.append(full_path)
1397
if trans_id in self._new_executability:
1398
self._set_executability(path, trans_id)
1401
self._new_contents.clear()
1402
return modified_paths
1405
class TransformPreview(TreeTransformBase):
1406
"""A TreeTransform for generating preview trees.
1408
Unlike TreeTransform, this version works when the input tree is a
1409
RevisionTree, rather than a WorkingTree. As a result, it tends to ignore
1410
unversioned files in the input tree.
1413
def __init__(self, tree, pb=DummyProgress(), case_sensitive=True):
1415
limbodir = osutils.mkdtemp(prefix='bzr-limbo-')
1416
TreeTransformBase.__init__(self, tree, limbodir, pb, case_sensitive)
1418
def canonical_path(self, path):
1421
def tree_kind(self, trans_id):
1422
path = self._tree_id_paths.get(trans_id)
1424
raise NoSuchFile(None)
1425
file_id = self._tree.path2id(path)
1426
return self._tree.kind(file_id)
1428
def _set_mode(self, trans_id, mode_id, typefunc):
1429
"""Set the mode of new file contents.
1430
The mode_id is the existing file to get the mode from (often the same
1431
as trans_id). The operation is only performed if there's a mode match
1432
according to typefunc.
1434
# is it ok to ignore this? probably
1437
def iter_tree_children(self, parent_id):
1438
"""Iterate through the entry's tree children, if any"""
1440
path = self._tree_id_paths[parent_id]
1443
file_id = self.tree_file_id(parent_id)
1446
entry = self._tree.iter_entries_by_dir([file_id]).next()[1]
1447
children = getattr(entry, 'children', {})
1448
for child in children:
1449
childpath = joinpath(path, child)
1450
yield self.trans_id_tree_path(childpath)
1453
class _PreviewTree(tree.Tree):
1454
"""Partial implementation of Tree to support show_diff_trees"""
1456
def __init__(self, transform):
1457
self._transform = transform
1458
self._final_paths = FinalPaths(transform)
1459
self.__by_parent = None
1460
self._parent_ids = []
1462
def _changes(self, file_id):
1463
for changes in self._transform.iter_changes():
1464
if changes[0] == file_id:
1467
def _content_change(self, file_id):
1468
"""Return True if the content of this file changed"""
1469
changes = self._changes(file_id)
1470
# changes[2] is true if the file content changed. See
1471
# InterTree.iter_changes.
1472
return (changes is not None and changes[2])
1474
def _get_repository(self):
1475
repo = getattr(self._transform._tree, '_repository', None)
1477
repo = self._transform._tree.branch.repository
1480
def _iter_parent_trees(self):
1481
for revision_id in self.get_parent_ids():
1483
yield self.revision_tree(revision_id)
1484
except errors.NoSuchRevisionInTree:
1485
yield self._get_repository().revision_tree(revision_id)
1487
def _get_file_revision(self, file_id, vf, tree_revision):
1488
parent_keys = [(file_id, self._file_revision(t, file_id)) for t in
1489
self._iter_parent_trees()]
1490
vf.add_lines((file_id, tree_revision), parent_keys,
1491
self.get_file(file_id).readlines())
1492
repo = self._get_repository()
1493
base_vf = repo.texts
1494
if base_vf not in vf.fallback_versionedfiles:
1495
vf.fallback_versionedfiles.append(base_vf)
1496
return tree_revision
1498
def _stat_limbo_file(self, file_id):
1499
trans_id = self._transform.trans_id_file_id(file_id)
1500
name = self._transform._limbo_name(trans_id)
1501
return os.lstat(name)
1504
def _by_parent(self):
1505
if self.__by_parent is None:
1506
self.__by_parent = self._transform.by_parent()
1507
return self.__by_parent
1509
def _comparison_data(self, entry, path):
1510
kind, size, executable, link_or_sha1 = self.path_content_summary(path)
1511
if kind == 'missing':
1515
file_id = self._transform.final_file_id(self._path2trans_id(path))
1516
executable = self.is_executable(file_id, path)
1517
return kind, executable, None
1519
def lock_read(self):
1520
# Perhaps in theory, this should lock the TreeTransform?
1527
def inventory(self):
1528
"""This Tree does not use inventory as its backing data."""
1529
raise NotImplementedError(_PreviewTree.inventory)
1531
def get_root_id(self):
1532
return self._transform.final_file_id(self._transform.root)
1534
def all_file_ids(self):
1535
tree_ids = set(self._transform._tree.all_file_ids())
1536
tree_ids.difference_update(self._transform.tree_file_id(t)
1537
for t in self._transform._removed_id)
1538
tree_ids.update(self._transform._new_id.values())
1542
return iter(self.all_file_ids())
1544
def has_id(self, file_id):
1545
if file_id in self._transform._r_new_id:
1547
elif file_id in self._transform._removed_id:
1550
return self._transform._tree.has_id(file_id)
1552
def _path2trans_id(self, path):
1553
segments = splitpath(path)
1554
cur_parent = self._transform.root
1555
for cur_segment in segments:
1556
for child in self._all_children(cur_parent):
1557
if self._transform.final_name(child) == cur_segment:
1564
def path2id(self, path):
1565
return self._transform.final_file_id(self._path2trans_id(path))
1567
def id2path(self, file_id):
1568
trans_id = self._transform.trans_id_file_id(file_id)
1570
return self._final_paths._determine_path(trans_id)
1572
raise errors.NoSuchId(self, file_id)
1574
def _all_children(self, trans_id):
1575
children = set(self._transform.iter_tree_children(trans_id))
1576
# children in the _new_parent set are provided by _by_parent.
1577
children.difference_update(self._transform._new_parent.keys())
1578
children.update(self._by_parent.get(trans_id, []))
1581
def iter_children(self, file_id):
1582
trans_id = self._transform.trans_id_file_id(file_id)
1583
for child_trans_id in self._all_children(trans_id):
1584
yield self._transform.final_file_id(child_trans_id)
1587
possible_extras = set(self._transform.trans_id_tree_path(p) for p
1588
in self._transform._tree.extras())
1589
possible_extras.update(self._transform._new_contents)
1590
possible_extras.update(self._transform._removed_id)
1591
for trans_id in possible_extras:
1592
if self._transform.final_file_id(trans_id) is None:
1593
yield self._final_paths._determine_path(trans_id)
1595
def _make_inv_entries(self, ordered_entries, specific_file_ids):
1596
for trans_id, parent_file_id in ordered_entries:
1597
file_id = self._transform.final_file_id(trans_id)
1600
if (specific_file_ids is not None
1601
and file_id not in specific_file_ids):
1604
kind = self._transform.final_kind(trans_id)
1606
kind = self._transform._tree.stored_kind(file_id)
1607
new_entry = inventory.make_entry(
1609
self._transform.final_name(trans_id),
1610
parent_file_id, file_id)
1611
yield new_entry, trans_id
1613
def _list_files_by_dir(self):
1614
todo = [ROOT_PARENT]
1616
while len(todo) > 0:
1618
parent_file_id = self._transform.final_file_id(parent)
1619
children = list(self._all_children(parent))
1620
paths = dict(zip(children, self._final_paths.get_paths(children)))
1621
children.sort(key=paths.get)
1622
todo.extend(reversed(children))
1623
for trans_id in children:
1624
ordered_ids.append((trans_id, parent_file_id))
1627
def iter_entries_by_dir(self, specific_file_ids=None):
1628
# This may not be a maximally efficient implementation, but it is
1629
# reasonably straightforward. An implementation that grafts the
1630
# TreeTransform changes onto the tree's iter_entries_by_dir results
1631
# might be more efficient, but requires tricky inferences about stack
1633
ordered_ids = self._list_files_by_dir()
1634
for entry, trans_id in self._make_inv_entries(ordered_ids,
1636
yield unicode(self._final_paths.get_path(trans_id)), entry
1638
def list_files(self, include_root=False):
1639
"""See Tree.list_files."""
1640
# XXX This should behave like WorkingTree.list_files, but is really
1641
# more like RevisionTree.list_files.
1642
for path, entry in self.iter_entries_by_dir():
1643
if entry.name == '' and not include_root:
1645
yield path, 'V', entry.kind, entry.file_id, entry
1647
def kind(self, file_id):
1648
trans_id = self._transform.trans_id_file_id(file_id)
1649
return self._transform.final_kind(trans_id)
1651
def stored_kind(self, file_id):
1652
trans_id = self._transform.trans_id_file_id(file_id)
1654
return self._transform._new_contents[trans_id]
1656
return self._transform._tree.stored_kind(file_id)
1658
def get_file_mtime(self, file_id, path=None):
1659
"""See Tree.get_file_mtime"""
1660
if not self._content_change(file_id):
1661
return self._transform._tree.get_file_mtime(file_id, path)
1662
return self._stat_limbo_file(file_id).st_mtime
1664
def _file_size(self, entry, stat_value):
1665
return self.get_file_size(entry.file_id)
1667
def get_file_size(self, file_id):
1668
"""See Tree.get_file_size"""
1669
if self.kind(file_id) == 'file':
1670
return self._transform._tree.get_file_size(file_id)
1674
def get_file_sha1(self, file_id, path=None, stat_value=None):
1675
trans_id = self._transform.trans_id_file_id(file_id)
1676
kind = self._transform._new_contents.get(trans_id)
1678
return self._transform._tree.get_file_sha1(file_id)
1680
fileobj = self.get_file(file_id)
1682
return sha_file(fileobj)
1686
def is_executable(self, file_id, path=None):
1689
trans_id = self._transform.trans_id_file_id(file_id)
1691
return self._transform._new_executability[trans_id]
1693
return self._transform._tree.is_executable(file_id, path)
1695
def path_content_summary(self, path):
1696
trans_id = self._path2trans_id(path)
1697
tt = self._transform
1698
tree_path = tt._tree_id_paths.get(trans_id)
1699
kind = tt._new_contents.get(trans_id)
1701
if tree_path is None or trans_id in tt._removed_contents:
1702
return 'missing', None, None, None
1703
summary = tt._tree.path_content_summary(tree_path)
1704
kind, size, executable, link_or_sha1 = summary
1707
limbo_name = tt._limbo_name(trans_id)
1708
if trans_id in tt._new_reference_revision:
1709
kind = 'tree-reference'
1711
statval = os.lstat(limbo_name)
1712
size = statval.st_size
1713
if not supports_executable():
1716
executable = statval.st_mode & S_IEXEC
1720
if kind == 'symlink':
1721
link_or_sha1 = os.readlink(limbo_name)
1722
if supports_executable():
1723
executable = tt._new_executability.get(trans_id, executable)
1724
return kind, size, executable, link_or_sha1
1726
def iter_changes(self, from_tree, include_unchanged=False,
1727
specific_files=None, pb=None, extra_trees=None,
1728
require_versioned=True, want_unversioned=False):
1729
"""See InterTree.iter_changes.
1731
This implementation does not support include_unchanged, specific_files,
1732
or want_unversioned. extra_trees, require_versioned, and pb are
1735
if from_tree is not self._transform._tree:
1736
return tree.InterTree(from_tree, self).iter_changes(
1737
include_unchanged=include_unchanged,
1738
specific_files=specific_files,
1740
extra_trees=extra_trees,
1741
require_versioned=require_versioned,
1742
want_unversioned=want_unversioned)
1743
if include_unchanged:
1744
raise ValueError('include_unchanged is not supported')
1745
if specific_files is not None:
1746
raise ValueError('specific_files is not supported')
1747
if want_unversioned:
1748
raise ValueError('want_unversioned is not supported')
1749
return self._transform.iter_changes()
1751
def get_file(self, file_id, path=None):
1752
"""See Tree.get_file"""
1753
if not self._content_change(file_id):
1754
return self._transform._tree.get_file(file_id, path)
1755
trans_id = self._transform.trans_id_file_id(file_id)
1756
name = self._transform._limbo_name(trans_id)
1757
return open(name, 'rb')
1759
def get_file_text(self, file_id):
1760
text_file = self.get_file(file_id)
1762
return text_file.read()
1766
def annotate_iter(self, file_id,
1767
default_revision=_mod_revision.CURRENT_REVISION):
1768
changes = self._changes(file_id)
1772
changed_content, versioned, kind = (changes[2], changes[3],
1776
get_old = (kind[0] == 'file' and versioned[0])
1778
old_annotation = self._transform._tree.annotate_iter(file_id,
1779
default_revision=default_revision)
1783
return old_annotation
1784
if not changed_content:
1785
return old_annotation
1786
return annotate.reannotate([old_annotation],
1787
self.get_file(file_id).readlines(),
1790
def get_symlink_target(self, file_id):
1791
"""See Tree.get_symlink_target"""
1792
if not self._content_change(file_id):
1793
return self._transform._tree.get_symlink_target(file_id)
1794
trans_id = self._transform.trans_id_file_id(file_id)
1795
name = self._transform._limbo_name(trans_id)
1796
return os.readlink(name)
1798
def walkdirs(self, prefix=''):
1799
pending = [self._transform.root]
1800
while len(pending) > 0:
1801
parent_id = pending.pop()
1804
prefix = prefix.rstrip('/')
1805
parent_path = self._final_paths.get_path(parent_id)
1806
parent_file_id = self._transform.final_file_id(parent_id)
1807
for child_id in self._all_children(parent_id):
1808
path_from_root = self._final_paths.get_path(child_id)
1809
basename = self._transform.final_name(child_id)
1810
file_id = self._transform.final_file_id(child_id)
1812
kind = self._transform.final_kind(child_id)
1813
versioned_kind = kind
1816
versioned_kind = self._transform._tree.stored_kind(file_id)
1817
if versioned_kind == 'directory':
1818
subdirs.append(child_id)
1819
children.append((path_from_root, basename, kind, None,
1820
file_id, versioned_kind))
1822
if parent_path.startswith(prefix):
1823
yield (parent_path, parent_file_id), children
1824
pending.extend(sorted(subdirs, key=self._final_paths.get_path,
1827
def get_parent_ids(self):
1828
return self._parent_ids
1830
def set_parent_ids(self, parent_ids):
1831
self._parent_ids = parent_ids
1833
def get_revision_tree(self, revision_id):
1834
return self._transform._tree.get_revision_tree(revision_id)
864
1837
def joinpath(parent, child):
865
1838
"""Join tree-relative paths, handling the tree root specially"""
866
1839
if parent is None or parent == "":
896
1869
self._known_paths[trans_id] = self._determine_path(trans_id)
897
1870
return self._known_paths[trans_id]
1872
def get_paths(self, trans_ids):
1873
return [(self.get_path(t), t) for t in trans_ids]
899
1877
def topology_sorted_ids(tree):
900
1878
"""Determine the topological order of the ids in a tree"""
901
1879
file_ids = list(tree)
902
1880
file_ids.sort(key=tree.id2path)
905
def build_tree(tree, wt):
906
"""Create working tree for a branch, using a Transaction."""
1884
def build_tree(tree, wt, accelerator_tree=None, hardlink=False,
1885
delta_from_tree=False):
1886
"""Create working tree for a branch, using a TreeTransform.
1888
This function should be used on empty trees, having a tree root at most.
1889
(see merge and revert functionality for working with existing trees)
1891
Existing files are handled like so:
1893
- Existing bzrdirs take precedence over creating new items. They are
1894
created as '%s.diverted' % name.
1895
- Otherwise, if the content on disk matches the content we are building,
1896
it is silently replaced.
1897
- Otherwise, conflict resolution will move the old file to 'oldname.moved'.
1899
:param tree: The tree to convert wt into a copy of
1900
:param wt: The working tree that files will be placed into
1901
:param accelerator_tree: A tree which can be used for retrieving file
1902
contents more quickly than tree itself, i.e. a workingtree. tree
1903
will be used for cases where accelerator_tree's content is different.
1904
:param hardlink: If true, hard-link files to accelerator_tree, where
1905
possible. accelerator_tree must implement abspath, i.e. be a
1907
:param delta_from_tree: If true, build_tree may use the input Tree to
1908
generate the inventory delta.
1910
wt.lock_tree_write()
1914
if accelerator_tree is not None:
1915
accelerator_tree.lock_read()
1917
return _build_tree(tree, wt, accelerator_tree, hardlink,
1920
if accelerator_tree is not None:
1921
accelerator_tree.unlock()
1928
def _build_tree(tree, wt, accelerator_tree, hardlink, delta_from_tree):
1929
"""See build_tree."""
1930
for num, _unused in enumerate(wt.all_file_ids()):
1931
if num > 0: # more than just a root
1932
raise errors.WorkingTreeAlreadyPopulated(base=wt.basedir)
1933
existing_files = set()
1934
for dir, files in wt.walkdirs():
1935
existing_files.update(f[0] for f in files)
907
1936
file_trans_id = {}
908
1937
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
909
1938
pp = ProgressPhase("Build phase", 2, top_pb)
1939
if tree.inventory.root is not None:
1940
# This is kind of a hack: we should be altering the root
1941
# as part of the regular tree shape diff logic.
1942
# The conditional test here is to avoid doing an
1943
# expensive operation (flush) every time the root id
1944
# is set within the tree, nor setting the root and thus
1945
# marking the tree as dirty, because we use two different
1946
# idioms here: tree interfaces and inventory interfaces.
1947
if wt.get_root_id() != tree.get_root_id():
1948
wt.set_root_id(tree.get_root_id())
910
1950
tt = TreeTransform(wt)
913
file_trans_id[wt.get_root_id()] = tt.trans_id_tree_file_id(wt.get_root_id())
914
file_ids = topology_sorted_ids(tree)
1954
file_trans_id[wt.get_root_id()] = \
1955
tt.trans_id_tree_file_id(wt.get_root_id())
915
1956
pb = bzrlib.ui.ui_factory.nested_progress_bar()
917
for num, file_id in enumerate(file_ids):
918
pb.update("Building tree", num, len(file_ids))
919
entry = tree.inventory[file_id]
1958
deferred_contents = []
1960
total = len(tree.inventory)
1962
precomputed_delta = []
1964
precomputed_delta = None
1965
for num, (tree_path, entry) in \
1966
enumerate(tree.inventory.iter_entries_by_dir()):
1967
pb.update("Building tree", num - len(deferred_contents), total)
920
1968
if entry.parent_id is None:
922
if entry.parent_id not in file_trans_id:
923
raise repr(entry.parent_id)
1971
file_id = entry.file_id
1973
precomputed_delta.append((None, tree_path, file_id, entry))
1974
if tree_path in existing_files:
1975
target_path = wt.abspath(tree_path)
1976
kind = file_kind(target_path)
1977
if kind == "directory":
1979
bzrdir.BzrDir.open(target_path)
1980
except errors.NotBranchError:
1984
if (file_id not in divert and
1985
_content_match(tree, entry, file_id, kind,
1987
tt.delete_contents(tt.trans_id_tree_path(tree_path))
1988
if kind == 'directory':
924
1990
parent_id = file_trans_id[entry.parent_id]
925
file_trans_id[file_id] = new_by_entry(tt, entry, parent_id,
1991
if entry.kind == 'file':
1992
# We *almost* replicate new_by_entry, so that we can defer
1993
# getting the file text, and get them all at once.
1994
trans_id = tt.create_path(entry.name, parent_id)
1995
file_trans_id[file_id] = trans_id
1996
tt.version_file(file_id, trans_id)
1997
executable = tree.is_executable(file_id, tree_path)
1999
tt.set_executability(executable, trans_id)
2000
deferred_contents.append((file_id, trans_id))
2002
file_trans_id[file_id] = new_by_entry(tt, entry, parent_id,
2005
new_trans_id = file_trans_id[file_id]
2006
old_parent = tt.trans_id_tree_path(tree_path)
2007
_reparent_children(tt, old_parent, new_trans_id)
2008
offset = num + 1 - len(deferred_contents)
2009
_create_files(tt, tree, deferred_contents, pb, offset,
2010
accelerator_tree, hardlink)
2014
divert_trans = set(file_trans_id[f] for f in divert)
2015
resolver = lambda t, c: resolve_checkout(t, c, divert_trans)
2016
raw_conflicts = resolve_conflicts(tt, pass_func=resolver)
2017
if len(raw_conflicts) > 0:
2018
precomputed_delta = None
2019
conflicts = cook_conflicts(raw_conflicts, tt)
2020
for conflict in conflicts:
2023
wt.add_conflicts(conflicts)
2024
except errors.UnsupportedOperation:
2026
result = tt.apply(no_conflicts=True,
2027
precomputed_delta=precomputed_delta)
933
2030
top_pb.finished()
2034
def _create_files(tt, tree, desired_files, pb, offset, accelerator_tree,
2036
total = len(desired_files) + offset
2037
if accelerator_tree is None:
2038
new_desired_files = desired_files
2040
iter = accelerator_tree.iter_changes(tree, include_unchanged=True)
2041
unchanged = dict((f, p[1]) for (f, p, c, v, d, n, k, e)
2042
in iter if not (c or e[0] != e[1]))
2043
new_desired_files = []
2045
for file_id, trans_id in desired_files:
2046
accelerator_path = unchanged.get(file_id)
2047
if accelerator_path is None:
2048
new_desired_files.append((file_id, trans_id))
2050
pb.update('Adding file contents', count + offset, total)
2052
tt.create_hardlink(accelerator_tree.abspath(accelerator_path),
2055
contents = accelerator_tree.get_file(file_id, accelerator_path)
2057
tt.create_file(contents, trans_id)
2062
for count, (trans_id, contents) in enumerate(tree.iter_files_bytes(
2063
new_desired_files)):
2064
tt.create_file(contents, trans_id)
2065
pb.update('Adding file contents', count + offset, total)
2068
def _reparent_children(tt, old_parent, new_parent):
2069
for child in tt.iter_tree_children(old_parent):
2070
tt.adjust_path(tt.final_name(child), new_parent, child)
2072
def _reparent_transform_children(tt, old_parent, new_parent):
2073
by_parent = tt.by_parent()
2074
for child in by_parent[old_parent]:
2075
tt.adjust_path(tt.final_name(child), new_parent, child)
2076
return by_parent[old_parent]
2078
def _content_match(tree, entry, file_id, kind, target_path):
2079
if entry.kind != kind:
2081
if entry.kind == "directory":
2083
if entry.kind == "file":
2084
if tree.get_file(file_id).read() == file(target_path, 'rb').read():
2086
elif entry.kind == "symlink":
2087
if tree.get_symlink_target(file_id) == os.readlink(target_path):
2092
def resolve_checkout(tt, conflicts, divert):
2093
new_conflicts = set()
2094
for c_type, conflict in ((c[0], c) for c in conflicts):
2095
# Anything but a 'duplicate' would indicate programmer error
2096
if c_type != 'duplicate':
2097
raise AssertionError(c_type)
2098
# Now figure out which is new and which is old
2099
if tt.new_contents(conflict[1]):
2100
new_file = conflict[1]
2101
old_file = conflict[2]
2103
new_file = conflict[2]
2104
old_file = conflict[1]
2106
# We should only get here if the conflict wasn't completely
2108
final_parent = tt.final_parent(old_file)
2109
if new_file in divert:
2110
new_name = tt.final_name(old_file)+'.diverted'
2111
tt.adjust_path(new_name, final_parent, new_file)
2112
new_conflicts.add((c_type, 'Diverted to',
2113
new_file, old_file))
2115
new_name = tt.final_name(old_file)+'.moved'
2116
tt.adjust_path(new_name, final_parent, old_file)
2117
new_conflicts.add((c_type, 'Moved existing file to',
2118
old_file, new_file))
2119
return new_conflicts
935
2122
def new_by_entry(tt, entry, parent_id, tree):
936
2123
"""Create a new file according to its inventory entry"""
1065
2201
return has_contents, contents_mod, meta_mod
1068
def revert(working_tree, target_tree, filenames, backups=False,
1069
pb=DummyProgress()):
2204
def revert(working_tree, target_tree, filenames, backups=False,
2205
pb=DummyProgress(), change_reporter=None):
1070
2206
"""Revert a working tree's contents to those of a target tree."""
1071
interesting_ids = find_interesting(working_tree, target_tree, filenames)
1072
def interesting(file_id):
1073
return interesting_ids is None or file_id in interesting_ids
2207
target_tree.lock_read()
1075
2208
tt = TreeTransform(working_tree, pb)
1077
merge_modified = working_tree.merge_modified()
1079
def trans_id_file_id(file_id):
1081
return trans_id[file_id]
1083
return tt.trans_id_tree_file_id(file_id)
1085
pp = ProgressPhase("Revert phase", 4, pb)
1087
sorted_interesting = [i for i in topology_sorted_ids(target_tree) if
1089
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1091
by_parent = tt.by_parent()
1092
for id_num, file_id in enumerate(sorted_interesting):
1093
child_pb.update("Reverting file", id_num+1,
1094
len(sorted_interesting))
1095
if file_id not in working_tree.inventory:
1096
entry = target_tree.inventory[file_id]
1097
parent_id = trans_id_file_id(entry.parent_id)
1098
e_trans_id = new_by_entry(tt, entry, parent_id, target_tree)
1099
trans_id[file_id] = e_trans_id
1101
backup_this = backups
1102
if file_id in merge_modified:
1104
del merge_modified[file_id]
1105
change_entry(tt, file_id, working_tree, target_tree,
1106
trans_id_file_id, backup_this, trans_id,
1111
wt_interesting = [i for i in working_tree.inventory if interesting(i)]
1112
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1114
for id_num, file_id in enumerate(wt_interesting):
1115
child_pb.update("New file check", id_num+1,
1116
len(sorted_interesting))
1117
if file_id not in target_tree:
1118
trans_id = tt.trans_id_tree_file_id(file_id)
1119
tt.unversion_file(trans_id)
1120
if file_id in merge_modified:
2210
pp = ProgressPhase("Revert phase", 3, pb)
2211
conflicts, merge_modified = _prepare_revert_transform(
2212
working_tree, target_tree, tt, filenames, backups, pp)
2214
change_reporter = delta._ChangeReporter(
2215
unversioned_filter=working_tree.is_ignored)
2216
delta.report_changes(tt.iter_changes(), change_reporter)
2217
for conflict in conflicts:
2221
working_tree.set_merge_modified(merge_modified)
2223
target_tree.unlock()
2229
def _prepare_revert_transform(working_tree, target_tree, tt, filenames,
2230
backups, pp, basis_tree=None,
2231
merge_modified=None):
2233
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
2235
if merge_modified is None:
2236
merge_modified = working_tree.merge_modified()
2237
merge_modified = _alter_files(working_tree, target_tree, tt,
2238
child_pb, filenames, backups,
2239
merge_modified, basis_tree)
2243
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
2245
raw_conflicts = resolve_conflicts(tt, child_pb,
2246
lambda t, c: conflict_pass(t, c, target_tree))
2249
conflicts = cook_conflicts(raw_conflicts, tt)
2250
return conflicts, merge_modified
2253
def _alter_files(working_tree, target_tree, tt, pb, specific_files,
2254
backups, merge_modified, basis_tree=None):
2255
if basis_tree is not None:
2256
basis_tree.lock_read()
2257
change_list = target_tree.iter_changes(working_tree,
2258
specific_files=specific_files, pb=pb)
2259
if target_tree.get_root_id() is None:
2265
for id_num, (file_id, path, changed_content, versioned, parent, name,
2266
kind, executable) in enumerate(change_list):
2267
if skip_root and file_id[0] is not None and parent[0] is None:
2269
trans_id = tt.trans_id_file_id(file_id)
2272
keep_content = False
2273
if kind[0] == 'file' and (backups or kind[1] is None):
2274
wt_sha1 = working_tree.get_file_sha1(file_id)
2275
if merge_modified.get(file_id) != wt_sha1:
2276
# acquire the basis tree lazily to prevent the
2277
# expense of accessing it when it's not needed ?
2278
# (Guessing, RBC, 200702)
2279
if basis_tree is None:
2280
basis_tree = working_tree.basis_tree()
2281
basis_tree.lock_read()
2282
if file_id in basis_tree:
2283
if wt_sha1 != basis_tree.get_file_sha1(file_id):
2285
elif kind[1] is None and not versioned[1]:
2287
if kind[0] is not None:
2288
if not keep_content:
1121
2289
tt.delete_contents(trans_id)
1122
del merge_modified[file_id]
1126
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1128
raw_conflicts = resolve_conflicts(tt, child_pb)
1131
conflicts = cook_conflicts(raw_conflicts, tt)
1132
for conflict in conflicts:
1136
working_tree.set_merge_modified({})
2290
elif kind[1] is not None:
2291
parent_trans_id = tt.trans_id_file_id(parent[0])
2292
by_parent = tt.by_parent()
2293
backup_name = _get_backup_name(name[0], by_parent,
2294
parent_trans_id, tt)
2295
tt.adjust_path(backup_name, parent_trans_id, trans_id)
2296
new_trans_id = tt.create_path(name[0], parent_trans_id)
2297
if versioned == (True, True):
2298
tt.unversion_file(trans_id)
2299
tt.version_file(file_id, new_trans_id)
2300
# New contents should have the same unix perms as old
2303
trans_id = new_trans_id
2304
if kind[1] in ('directory', 'tree-reference'):
2305
tt.create_directory(trans_id)
2306
if kind[1] == 'tree-reference':
2307
revision = target_tree.get_reference_revision(file_id,
2309
tt.set_tree_reference(revision, trans_id)
2310
elif kind[1] == 'symlink':
2311
tt.create_symlink(target_tree.get_symlink_target(file_id),
2313
elif kind[1] == 'file':
2314
deferred_files.append((file_id, (trans_id, mode_id)))
2315
if basis_tree is None:
2316
basis_tree = working_tree.basis_tree()
2317
basis_tree.lock_read()
2318
new_sha1 = target_tree.get_file_sha1(file_id)
2319
if (file_id in basis_tree and new_sha1 ==
2320
basis_tree.get_file_sha1(file_id)):
2321
if file_id in merge_modified:
2322
del merge_modified[file_id]
2324
merge_modified[file_id] = new_sha1
2326
# preserve the execute bit when backing up
2327
if keep_content and executable[0] == executable[1]:
2328
tt.set_executability(executable[1], trans_id)
2329
elif kind[1] is not None:
2330
raise AssertionError(kind[1])
2331
if versioned == (False, True):
2332
tt.version_file(file_id, trans_id)
2333
if versioned == (True, False):
2334
tt.unversion_file(trans_id)
2335
if (name[1] is not None and
2336
(name[0] != name[1] or parent[0] != parent[1])):
2337
if name[1] == '' and parent[1] is None:
2338
parent_trans = ROOT_PARENT
2340
parent_trans = tt.trans_id_file_id(parent[1])
2341
tt.adjust_path(name[1], parent_trans, trans_id)
2342
if executable[0] != executable[1] and kind[1] == "file":
2343
tt.set_executability(executable[1], trans_id)
2344
for (trans_id, mode_id), bytes in target_tree.iter_files_bytes(
2346
tt.create_file(bytes, trans_id, mode_id)
1143
def resolve_conflicts(tt, pb=DummyProgress()):
2348
if basis_tree is not None:
2350
return merge_modified
2353
def resolve_conflicts(tt, pb=DummyProgress(), pass_func=None):
1144
2354
"""Make many conflict-resolution attempts, but die if they fail"""
2355
if pass_func is None:
2356
pass_func = conflict_pass
1145
2357
new_conflicts = set()
1147
2359
for n in range(10):