861
979
self.create_symlink(target, trans_id)
982
def _affected_ids(self):
983
"""Return the set of transform ids affected by the transform"""
984
trans_ids = set(self._removed_id)
985
trans_ids.update(self._new_id.keys())
986
trans_ids.update(self._removed_contents)
987
trans_ids.update(self._new_contents.keys())
988
trans_ids.update(self._new_executability.keys())
989
trans_ids.update(self._new_name.keys())
990
trans_ids.update(self._new_parent.keys())
993
def _get_file_id_maps(self):
994
"""Return mapping of file_ids to trans_ids in the to and from states"""
995
trans_ids = self._affected_ids()
998
# Build up two dicts: trans_ids associated with file ids in the
999
# FROM state, vs the TO state.
1000
for trans_id in trans_ids:
1001
from_file_id = self.tree_file_id(trans_id)
1002
if from_file_id is not None:
1003
from_trans_ids[from_file_id] = trans_id
1004
to_file_id = self.final_file_id(trans_id)
1005
if to_file_id is not None:
1006
to_trans_ids[to_file_id] = trans_id
1007
return from_trans_ids, to_trans_ids
1009
def _from_file_data(self, from_trans_id, from_versioned, file_id):
1010
"""Get data about a file in the from (tree) state
1012
Return a (name, parent, kind, executable) tuple
1014
from_path = self._tree_id_paths.get(from_trans_id)
1016
# get data from working tree if versioned
1017
from_entry = self._tree.iter_entries_by_dir([file_id]).next()[1]
1018
from_name = from_entry.name
1019
from_parent = from_entry.parent_id
1022
if from_path is None:
1023
# File does not exist in FROM state
1027
# File exists, but is not versioned. Have to use path-
1029
from_name = os.path.basename(from_path)
1030
tree_parent = self.get_tree_parent(from_trans_id)
1031
from_parent = self.tree_file_id(tree_parent)
1032
if from_path is not None:
1033
from_kind, from_executable, from_stats = \
1034
self._tree._comparison_data(from_entry, from_path)
1037
from_executable = False
1038
return from_name, from_parent, from_kind, from_executable
1040
def _to_file_data(self, to_trans_id, from_trans_id, from_executable):
1041
"""Get data about a file in the to (target) state
1043
Return a (name, parent, kind, executable) tuple
1045
to_name = self.final_name(to_trans_id)
1047
to_kind = self.final_kind(to_trans_id)
1050
to_parent = self.final_file_id(self.final_parent(to_trans_id))
1051
if to_trans_id in self._new_executability:
1052
to_executable = self._new_executability[to_trans_id]
1053
elif to_trans_id == from_trans_id:
1054
to_executable = from_executable
1056
to_executable = False
1057
return to_name, to_parent, to_kind, to_executable
1059
def iter_changes(self):
1060
"""Produce output in the same format as Tree.iter_changes.
1062
Will produce nonsensical results if invoked while inventory/filesystem
1063
conflicts (as reported by TreeTransform.find_conflicts()) are present.
1065
This reads the Transform, but only reproduces changes involving a
1066
file_id. Files that are not versioned in either of the FROM or TO
1067
states are not reflected.
1069
final_paths = FinalPaths(self)
1070
from_trans_ids, to_trans_ids = self._get_file_id_maps()
1072
# Now iterate through all active file_ids
1073
for file_id in set(from_trans_ids.keys() + to_trans_ids.keys()):
1075
from_trans_id = from_trans_ids.get(file_id)
1076
# find file ids, and determine versioning state
1077
if from_trans_id is None:
1078
from_versioned = False
1079
from_trans_id = to_trans_ids[file_id]
1081
from_versioned = True
1082
to_trans_id = to_trans_ids.get(file_id)
1083
if to_trans_id is None:
1084
to_versioned = False
1085
to_trans_id = from_trans_id
1089
from_name, from_parent, from_kind, from_executable = \
1090
self._from_file_data(from_trans_id, from_versioned, file_id)
1092
to_name, to_parent, to_kind, to_executable = \
1093
self._to_file_data(to_trans_id, from_trans_id, from_executable)
1095
if not from_versioned:
1098
from_path = self._tree_id_paths.get(from_trans_id)
1099
if not to_versioned:
1102
to_path = final_paths.get_path(to_trans_id)
1103
if from_kind != to_kind:
1105
elif to_kind in ('file', 'symlink') and (
1106
to_trans_id != from_trans_id or
1107
to_trans_id in self._new_contents):
1109
if (not modified and from_versioned == to_versioned and
1110
from_parent==to_parent and from_name == to_name and
1111
from_executable == to_executable):
1113
results.append((file_id, (from_path, to_path), modified,
1114
(from_versioned, to_versioned),
1115
(from_parent, to_parent),
1116
(from_name, to_name),
1117
(from_kind, to_kind),
1118
(from_executable, to_executable)))
1119
return iter(sorted(results, key=lambda x:x[1]))
1121
def get_preview_tree(self):
1122
"""Return a tree representing the result of the transform.
1124
This tree only supports the subset of Tree functionality required
1125
by show_diff_trees. It must only be compared to tt._tree.
1127
return _PreviewTree(self)
1129
def _text_parent(self, trans_id):
1130
file_id = self.tree_file_id(trans_id)
1132
if file_id is None or self._tree.kind(file_id) != 'file':
1134
except errors.NoSuchFile:
1138
def _get_parents_texts(self, trans_id):
1139
"""Get texts for compression parents of this file."""
1140
file_id = self._text_parent(trans_id)
1143
return (self._tree.get_file_text(file_id),)
1145
def _get_parents_lines(self, trans_id):
1146
"""Get lines for compression parents of this file."""
1147
file_id = self._text_parent(trans_id)
1150
return (self._tree.get_file_lines(file_id),)
1152
def serialize(self, serializer):
1153
"""Serialize this TreeTransform.
1155
:param serializer: A Serialiser like pack.ContainerSerializer.
1157
new_name = dict((k, v.encode('utf-8')) for k, v in
1158
self._new_name.items())
1159
new_executability = dict((k, int(v)) for k, v in
1160
self._new_executability.items())
1161
tree_path_ids = dict((k.encode('utf-8'), v)
1162
for k, v in self._tree_path_ids.items())
1164
'_id_number': self._id_number,
1165
'_new_name': new_name,
1166
'_new_parent': self._new_parent,
1167
'_new_executability': new_executability,
1168
'_new_id': self._new_id,
1169
'_tree_path_ids': tree_path_ids,
1170
'_removed_id': list(self._removed_id),
1171
'_removed_contents': list(self._removed_contents),
1172
'_non_present_ids': self._non_present_ids,
1174
yield serializer.bytes_record(bencode.bencode(attribs),
1176
for trans_id, kind in self._new_contents.items():
1178
cur_file = open(self._limbo_name(trans_id), 'rb')
1180
lines = osutils.chunks_to_lines(cur_file.readlines())
1183
parents = self._get_parents_lines(trans_id)
1184
mpdiff = multiparent.MultiParent.from_lines(lines, parents)
1185
content = ''.join(mpdiff.to_patch())
1186
if kind == 'directory':
1188
if kind == 'symlink':
1189
content = os.readlink(self._limbo_name(trans_id))
1190
yield serializer.bytes_record(content, ((trans_id, kind),))
1193
def deserialize(self, records):
1194
"""Deserialize a stored TreeTransform.
1196
:param records: An iterable of (names, content) tuples, as per
1197
pack.ContainerPushParser.
1199
names, content = records.next()
1200
attribs = bencode.bdecode(content)
1201
self._id_number = attribs['_id_number']
1202
self._new_name = dict((k, v.decode('utf-8'))
1203
for k, v in attribs['_new_name'].items())
1204
self._new_parent = attribs['_new_parent']
1205
self._new_executability = dict((k, bool(v)) for k, v in
1206
attribs['_new_executability'].items())
1207
self._new_id = attribs['_new_id']
1208
self._r_new_id = dict((v, k) for k, v in self._new_id.items())
1209
self._tree_path_ids = {}
1210
self._tree_id_paths = {}
1211
for bytepath, trans_id in attribs['_tree_path_ids'].items():
1212
path = bytepath.decode('utf-8')
1213
self._tree_path_ids[path] = trans_id
1214
self._tree_id_paths[trans_id] = path
1215
self._removed_id = set(attribs['_removed_id'])
1216
self._removed_contents = set(attribs['_removed_contents'])
1217
self._non_present_ids = attribs['_non_present_ids']
1218
for ((trans_id, kind),), content in records:
1220
mpdiff = multiparent.MultiParent.from_patch(content)
1221
lines = mpdiff.to_lines(self._get_parents_texts(trans_id))
1222
self.create_file(lines, trans_id)
1223
if kind == 'directory':
1224
self.create_directory(trans_id)
1225
if kind == 'symlink':
1226
self.create_symlink(content.decode('utf-8'), trans_id)
1229
class TreeTransform(TreeTransformBase):
1230
"""Represent a tree transformation.
1232
This object is designed to support incremental generation of the transform,
1235
However, it gives optimum performance when parent directories are created
1236
before their contents. The transform is then able to put child files
1237
directly in their parent directory, avoiding later renames.
1239
It is easy to produce malformed transforms, but they are generally
1240
harmless. Attempting to apply a malformed transform will cause an
1241
exception to be raised before any modifications are made to the tree.
1243
Many kinds of malformed transforms can be corrected with the
1244
resolve_conflicts function. The remaining ones indicate programming error,
1245
such as trying to create a file with no path.
1247
Two sets of file creation methods are supplied. Convenience methods are:
1252
These are composed of the low-level methods:
1254
* create_file or create_directory or create_symlink
1258
Transform/Transaction ids
1259
-------------------------
1260
trans_ids are temporary ids assigned to all files involved in a transform.
1261
It's possible, even common, that not all files in the Tree have trans_ids.
1263
trans_ids are used because filenames and file_ids are not good enough
1264
identifiers; filenames change, and not all files have file_ids. File-ids
1265
are also associated with trans-ids, so that moving a file moves its
1268
trans_ids are only valid for the TreeTransform that generated them.
1272
Limbo is a temporary directory use to hold new versions of files.
1273
Files are added to limbo by create_file, create_directory, create_symlink,
1274
and their convenience variants (new_*). Files may be removed from limbo
1275
using cancel_creation. Files are renamed from limbo into their final
1276
location as part of TreeTransform.apply
1278
Limbo must be cleaned up, by either calling TreeTransform.apply or
1279
calling TreeTransform.finalize.
1281
Files are placed into limbo inside their parent directories, where
1282
possible. This reduces subsequent renames, and makes operations involving
1283
lots of files faster. This optimization is only possible if the parent
1284
directory is created *before* creating any of its children, so avoid
1285
creating children before parents, where possible.
1289
This temporary directory is used by _FileMover for storing files that are
1290
about to be deleted. In case of rollback, the files will be restored.
1291
FileMover does not delete files until it is sure that a rollback will not
1294
def __init__(self, tree, pb=DummyProgress()):
1295
"""Note: a tree_write lock is taken on the tree.
1297
Use TreeTransform.finalize() to release the lock (can be omitted if
1298
TreeTransform.apply() called).
1300
tree.lock_tree_write()
1303
limbodir = urlutils.local_path_from_url(
1304
tree._transport.abspath('limbo'))
1308
if e.errno == errno.EEXIST:
1309
raise ExistingLimbo(limbodir)
1310
deletiondir = urlutils.local_path_from_url(
1311
tree._transport.abspath('pending-deletion'))
1313
os.mkdir(deletiondir)
1315
if e.errno == errno.EEXIST:
1316
raise errors.ExistingPendingDeletion(deletiondir)
1321
TreeTransformBase.__init__(self, tree, limbodir, pb,
1322
tree.case_sensitive)
1323
self._deletiondir = deletiondir
1325
def apply(self, no_conflicts=False, precomputed_delta=None, _mover=None):
1326
"""Apply all changes to the inventory and filesystem.
1328
If filesystem or inventory conflicts are present, MalformedTransform
1331
If apply succeeds, finalize is not necessary.
1333
:param no_conflicts: if True, the caller guarantees there are no
1334
conflicts, so no check is made.
1335
:param precomputed_delta: An inventory delta to use instead of
1337
:param _mover: Supply an alternate FileMover, for testing
1339
if not no_conflicts:
1340
conflicts = self.find_conflicts()
1341
if len(conflicts) != 0:
1342
raise MalformedTransform(conflicts=conflicts)
1343
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1345
if precomputed_delta is None:
1346
child_pb.update('Apply phase', 0, 2)
1347
inventory_delta = self._generate_inventory_delta()
1350
inventory_delta = precomputed_delta
1353
mover = _FileMover()
1357
child_pb.update('Apply phase', 0 + offset, 2 + offset)
1358
self._apply_removals(mover)
1359
child_pb.update('Apply phase', 1 + offset, 2 + offset)
1360
modified_paths = self._apply_insertions(mover)
1365
mover.apply_deletions()
1368
self._tree.apply_inventory_delta(inventory_delta)
1371
return _TransformResults(modified_paths, self.rename_count)
1373
def _generate_inventory_delta(self):
1374
"""Generate an inventory delta for the current transform."""
1375
inventory_delta = []
1376
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1377
new_paths = self._inventory_altered()
1378
total_entries = len(new_paths) + len(self._removed_id)
1380
for num, trans_id in enumerate(self._removed_id):
1382
child_pb.update('removing file', num, total_entries)
1383
if trans_id == self._new_root:
1384
file_id = self._tree.get_root_id()
1386
file_id = self.tree_file_id(trans_id)
1387
# File-id isn't really being deleted, just moved
1388
if file_id in self._r_new_id:
1390
path = self._tree_id_paths[trans_id]
1391
inventory_delta.append((path, None, file_id, None))
1392
new_path_file_ids = dict((t, self.final_file_id(t)) for p, t in
1394
entries = self._tree.iter_entries_by_dir(
1395
new_path_file_ids.values())
1396
old_paths = dict((e.file_id, p) for p, e in entries)
1398
for num, (path, trans_id) in enumerate(new_paths):
1400
child_pb.update('adding file',
1401
num + len(self._removed_id), total_entries)
1402
file_id = new_path_file_ids[trans_id]
1407
kind = self.final_kind(trans_id)
1409
kind = self._tree.stored_kind(file_id)
1410
parent_trans_id = self.final_parent(trans_id)
1411
parent_file_id = new_path_file_ids.get(parent_trans_id)
1412
if parent_file_id is None:
1413
parent_file_id = self.final_file_id(parent_trans_id)
1414
if trans_id in self._new_reference_revision:
1415
new_entry = inventory.TreeReference(
1417
self._new_name[trans_id],
1418
self.final_file_id(self._new_parent[trans_id]),
1419
None, self._new_reference_revision[trans_id])
1421
new_entry = inventory.make_entry(kind,
1422
self.final_name(trans_id),
1423
parent_file_id, file_id)
1424
old_path = old_paths.get(new_entry.file_id)
1425
new_executability = self._new_executability.get(trans_id)
1426
if new_executability is not None:
1427
new_entry.executable = new_executability
1428
inventory_delta.append(
1429
(old_path, path, new_entry.file_id, new_entry))
1432
return inventory_delta
1434
def _apply_removals(self, mover):
1435
"""Perform tree operations that remove directory/inventory names.
1437
That is, delete files that are to be deleted, and put any files that
1438
need renaming into limbo. This must be done in strict child-to-parent
1441
If inventory_delta is None, no inventory delta generation is performed.
1443
tree_paths = list(self._tree_path_ids.iteritems())
1444
tree_paths.sort(reverse=True)
1445
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1447
for num, data in enumerate(tree_paths):
1448
path, trans_id = data
1449
child_pb.update('removing file', num, len(tree_paths))
1450
full_path = self._tree.abspath(path)
1451
if trans_id in self._removed_contents:
1452
mover.pre_delete(full_path, os.path.join(self._deletiondir,
1454
elif trans_id in self._new_name or trans_id in \
1457
mover.rename(full_path, self._limbo_name(trans_id))
1459
if e.errno != errno.ENOENT:
1462
self.rename_count += 1
1466
def _apply_insertions(self, mover):
1467
"""Perform tree operations that insert directory/inventory names.
1469
That is, create any files that need to be created, and restore from
1470
limbo any files that needed renaming. This must be done in strict
1471
parent-to-child order.
1473
If inventory_delta is None, no inventory delta is calculated, and
1474
no list of modified paths is returned.
1476
new_paths = self.new_paths(filesystem_only=True)
1478
new_path_file_ids = dict((t, self.final_file_id(t)) for p, t in
1480
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
1482
for num, (path, trans_id) in enumerate(new_paths):
1484
child_pb.update('adding file', num, len(new_paths))
1485
full_path = self._tree.abspath(path)
1486
if trans_id in self._needs_rename:
1488
mover.rename(self._limbo_name(trans_id), full_path)
1490
# We may be renaming a dangling inventory id
1491
if e.errno != errno.ENOENT:
1494
self.rename_count += 1
1495
if (trans_id in self._new_contents or
1496
self.path_changed(trans_id)):
1497
if trans_id in self._new_contents:
1498
modified_paths.append(full_path)
1499
if trans_id in self._new_executability:
1500
self._set_executability(path, trans_id)
1503
self._new_contents.clear()
1504
return modified_paths
1507
class TransformPreview(TreeTransformBase):
1508
"""A TreeTransform for generating preview trees.
1510
Unlike TreeTransform, this version works when the input tree is a
1511
RevisionTree, rather than a WorkingTree. As a result, it tends to ignore
1512
unversioned files in the input tree.
1515
def __init__(self, tree, pb=DummyProgress(), case_sensitive=True):
1517
limbodir = osutils.mkdtemp(prefix='bzr-limbo-')
1518
TreeTransformBase.__init__(self, tree, limbodir, pb, case_sensitive)
1520
def canonical_path(self, path):
1523
def tree_kind(self, trans_id):
1524
path = self._tree_id_paths.get(trans_id)
1526
raise NoSuchFile(None)
1527
file_id = self._tree.path2id(path)
1528
return self._tree.kind(file_id)
1530
def _set_mode(self, trans_id, mode_id, typefunc):
1531
"""Set the mode of new file contents.
1532
The mode_id is the existing file to get the mode from (often the same
1533
as trans_id). The operation is only performed if there's a mode match
1534
according to typefunc.
1536
# is it ok to ignore this? probably
1539
def iter_tree_children(self, parent_id):
1540
"""Iterate through the entry's tree children, if any"""
1542
path = self._tree_id_paths[parent_id]
1545
file_id = self.tree_file_id(parent_id)
1548
entry = self._tree.iter_entries_by_dir([file_id]).next()[1]
1549
children = getattr(entry, 'children', {})
1550
for child in children:
1551
childpath = joinpath(path, child)
1552
yield self.trans_id_tree_path(childpath)
1555
class _PreviewTree(tree.Tree):
1556
"""Partial implementation of Tree to support show_diff_trees"""
1558
def __init__(self, transform):
1559
self._transform = transform
1560
self._final_paths = FinalPaths(transform)
1561
self.__by_parent = None
1562
self._parent_ids = []
1563
self._all_children_cache = {}
1564
self._path2trans_id_cache = {}
1565
self._final_name_cache = {}
1567
def _changes(self, file_id):
1568
for changes in self._transform.iter_changes():
1569
if changes[0] == file_id:
1572
def _content_change(self, file_id):
1573
"""Return True if the content of this file changed"""
1574
changes = self._changes(file_id)
1575
# changes[2] is true if the file content changed. See
1576
# InterTree.iter_changes.
1577
return (changes is not None and changes[2])
1579
def _get_repository(self):
1580
repo = getattr(self._transform._tree, '_repository', None)
1582
repo = self._transform._tree.branch.repository
1585
def _iter_parent_trees(self):
1586
for revision_id in self.get_parent_ids():
1588
yield self.revision_tree(revision_id)
1589
except errors.NoSuchRevisionInTree:
1590
yield self._get_repository().revision_tree(revision_id)
1592
def _get_file_revision(self, file_id, vf, tree_revision):
1593
parent_keys = [(file_id, self._file_revision(t, file_id)) for t in
1594
self._iter_parent_trees()]
1595
vf.add_lines((file_id, tree_revision), parent_keys,
1596
self.get_file(file_id).readlines())
1597
repo = self._get_repository()
1598
base_vf = repo.texts
1599
if base_vf not in vf.fallback_versionedfiles:
1600
vf.fallback_versionedfiles.append(base_vf)
1601
return tree_revision
1603
def _stat_limbo_file(self, file_id):
1604
trans_id = self._transform.trans_id_file_id(file_id)
1605
name = self._transform._limbo_name(trans_id)
1606
return os.lstat(name)
1609
def _by_parent(self):
1610
if self.__by_parent is None:
1611
self.__by_parent = self._transform.by_parent()
1612
return self.__by_parent
1614
def _comparison_data(self, entry, path):
1615
kind, size, executable, link_or_sha1 = self.path_content_summary(path)
1616
if kind == 'missing':
1620
file_id = self._transform.final_file_id(self._path2trans_id(path))
1621
executable = self.is_executable(file_id, path)
1622
return kind, executable, None
1624
def lock_read(self):
1625
# Perhaps in theory, this should lock the TreeTransform?
1632
def inventory(self):
1633
"""This Tree does not use inventory as its backing data."""
1634
raise NotImplementedError(_PreviewTree.inventory)
1636
def get_root_id(self):
1637
return self._transform.final_file_id(self._transform.root)
1639
def all_file_ids(self):
1640
tree_ids = set(self._transform._tree.all_file_ids())
1641
tree_ids.difference_update(self._transform.tree_file_id(t)
1642
for t in self._transform._removed_id)
1643
tree_ids.update(self._transform._new_id.values())
1647
return iter(self.all_file_ids())
1649
def has_id(self, file_id):
1650
if file_id in self._transform._r_new_id:
1652
elif file_id in set([self._transform.tree_file_id(trans_id) for
1653
trans_id in self._transform._removed_id]):
1656
return self._transform._tree.has_id(file_id)
1658
def _path2trans_id(self, path):
1659
# We must not use None here, because that is a valid value to store.
1660
trans_id = self._path2trans_id_cache.get(path, object)
1661
if trans_id is not object:
1663
segments = splitpath(path)
1664
cur_parent = self._transform.root
1665
for cur_segment in segments:
1666
for child in self._all_children(cur_parent):
1667
final_name = self._final_name_cache.get(child)
1668
if final_name is None:
1669
final_name = self._transform.final_name(child)
1670
self._final_name_cache[child] = final_name
1671
if final_name == cur_segment:
1675
self._path2trans_id_cache[path] = None
1677
self._path2trans_id_cache[path] = cur_parent
1680
def path2id(self, path):
1681
return self._transform.final_file_id(self._path2trans_id(path))
1683
def id2path(self, file_id):
1684
trans_id = self._transform.trans_id_file_id(file_id)
1686
return self._final_paths._determine_path(trans_id)
1688
raise errors.NoSuchId(self, file_id)
1690
def _all_children(self, trans_id):
1691
children = self._all_children_cache.get(trans_id)
1692
if children is not None:
1694
children = set(self._transform.iter_tree_children(trans_id))
1695
# children in the _new_parent set are provided by _by_parent.
1696
children.difference_update(self._transform._new_parent.keys())
1697
children.update(self._by_parent.get(trans_id, []))
1698
self._all_children_cache[trans_id] = children
1701
def iter_children(self, file_id):
1702
trans_id = self._transform.trans_id_file_id(file_id)
1703
for child_trans_id in self._all_children(trans_id):
1704
yield self._transform.final_file_id(child_trans_id)
1707
possible_extras = set(self._transform.trans_id_tree_path(p) for p
1708
in self._transform._tree.extras())
1709
possible_extras.update(self._transform._new_contents)
1710
possible_extras.update(self._transform._removed_id)
1711
for trans_id in possible_extras:
1712
if self._transform.final_file_id(trans_id) is None:
1713
yield self._final_paths._determine_path(trans_id)
1715
def _make_inv_entries(self, ordered_entries, specific_file_ids):
1716
for trans_id, parent_file_id in ordered_entries:
1717
file_id = self._transform.final_file_id(trans_id)
1720
if (specific_file_ids is not None
1721
and file_id not in specific_file_ids):
1724
kind = self._transform.final_kind(trans_id)
1726
kind = self._transform._tree.stored_kind(file_id)
1727
new_entry = inventory.make_entry(
1729
self._transform.final_name(trans_id),
1730
parent_file_id, file_id)
1731
yield new_entry, trans_id
1733
def _list_files_by_dir(self):
1734
todo = [ROOT_PARENT]
1736
while len(todo) > 0:
1738
parent_file_id = self._transform.final_file_id(parent)
1739
children = list(self._all_children(parent))
1740
paths = dict(zip(children, self._final_paths.get_paths(children)))
1741
children.sort(key=paths.get)
1742
todo.extend(reversed(children))
1743
for trans_id in children:
1744
ordered_ids.append((trans_id, parent_file_id))
1747
def iter_entries_by_dir(self, specific_file_ids=None):
1748
# This may not be a maximally efficient implementation, but it is
1749
# reasonably straightforward. An implementation that grafts the
1750
# TreeTransform changes onto the tree's iter_entries_by_dir results
1751
# might be more efficient, but requires tricky inferences about stack
1753
ordered_ids = self._list_files_by_dir()
1754
for entry, trans_id in self._make_inv_entries(ordered_ids,
1756
yield unicode(self._final_paths.get_path(trans_id)), entry
1758
def list_files(self, include_root=False):
1759
"""See Tree.list_files."""
1760
# XXX This should behave like WorkingTree.list_files, but is really
1761
# more like RevisionTree.list_files.
1762
for path, entry in self.iter_entries_by_dir():
1763
if entry.name == '' and not include_root:
1765
yield path, 'V', entry.kind, entry.file_id, entry
1767
def kind(self, file_id):
1768
trans_id = self._transform.trans_id_file_id(file_id)
1769
return self._transform.final_kind(trans_id)
1771
def stored_kind(self, file_id):
1772
trans_id = self._transform.trans_id_file_id(file_id)
1774
return self._transform._new_contents[trans_id]
1776
return self._transform._tree.stored_kind(file_id)
1778
def get_file_mtime(self, file_id, path=None):
1779
"""See Tree.get_file_mtime"""
1780
if not self._content_change(file_id):
1781
return self._transform._tree.get_file_mtime(file_id, path)
1782
return self._stat_limbo_file(file_id).st_mtime
1784
def _file_size(self, entry, stat_value):
1785
return self.get_file_size(entry.file_id)
1787
def get_file_size(self, file_id):
1788
"""See Tree.get_file_size"""
1789
if self.kind(file_id) == 'file':
1790
return self._transform._tree.get_file_size(file_id)
1794
def get_file_sha1(self, file_id, path=None, stat_value=None):
1795
trans_id = self._transform.trans_id_file_id(file_id)
1796
kind = self._transform._new_contents.get(trans_id)
1798
return self._transform._tree.get_file_sha1(file_id)
1800
fileobj = self.get_file(file_id)
1802
return sha_file(fileobj)
1806
def is_executable(self, file_id, path=None):
1809
trans_id = self._transform.trans_id_file_id(file_id)
1811
return self._transform._new_executability[trans_id]
1814
return self._transform._tree.is_executable(file_id, path)
1816
if e.errno == errno.ENOENT:
1819
except errors.NoSuchId:
1822
def path_content_summary(self, path):
1823
trans_id = self._path2trans_id(path)
1824
tt = self._transform
1825
tree_path = tt._tree_id_paths.get(trans_id)
1826
kind = tt._new_contents.get(trans_id)
1828
if tree_path is None or trans_id in tt._removed_contents:
1829
return 'missing', None, None, None
1830
summary = tt._tree.path_content_summary(tree_path)
1831
kind, size, executable, link_or_sha1 = summary
1834
limbo_name = tt._limbo_name(trans_id)
1835
if trans_id in tt._new_reference_revision:
1836
kind = 'tree-reference'
1838
statval = os.lstat(limbo_name)
1839
size = statval.st_size
1840
if not supports_executable():
1843
executable = statval.st_mode & S_IEXEC
1847
if kind == 'symlink':
1848
link_or_sha1 = os.readlink(limbo_name)
1849
if supports_executable():
1850
executable = tt._new_executability.get(trans_id, executable)
1851
return kind, size, executable, link_or_sha1
1853
def iter_changes(self, from_tree, include_unchanged=False,
1854
specific_files=None, pb=None, extra_trees=None,
1855
require_versioned=True, want_unversioned=False):
1856
"""See InterTree.iter_changes.
1858
This has a fast path that is only used when the from_tree matches
1859
the transform tree, and no fancy options are supplied.
1861
if (from_tree is not self._transform._tree or include_unchanged or
1862
specific_files or want_unversioned):
1863
return tree.InterTree(from_tree, self).iter_changes(
1864
include_unchanged=include_unchanged,
1865
specific_files=specific_files,
1867
extra_trees=extra_trees,
1868
require_versioned=require_versioned,
1869
want_unversioned=want_unversioned)
1870
if want_unversioned:
1871
raise ValueError('want_unversioned is not supported')
1872
return self._transform.iter_changes()
1874
def get_file(self, file_id, path=None):
1875
"""See Tree.get_file"""
1876
if not self._content_change(file_id):
1877
return self._transform._tree.get_file(file_id, path)
1878
trans_id = self._transform.trans_id_file_id(file_id)
1879
name = self._transform._limbo_name(trans_id)
1880
return open(name, 'rb')
1882
def annotate_iter(self, file_id,
1883
default_revision=_mod_revision.CURRENT_REVISION):
1884
changes = self._changes(file_id)
1888
changed_content, versioned, kind = (changes[2], changes[3],
1892
get_old = (kind[0] == 'file' and versioned[0])
1894
old_annotation = self._transform._tree.annotate_iter(file_id,
1895
default_revision=default_revision)
1899
return old_annotation
1900
if not changed_content:
1901
return old_annotation
1902
return annotate.reannotate([old_annotation],
1903
self.get_file(file_id).readlines(),
1906
def get_symlink_target(self, file_id):
1907
"""See Tree.get_symlink_target"""
1908
if not self._content_change(file_id):
1909
return self._transform._tree.get_symlink_target(file_id)
1910
trans_id = self._transform.trans_id_file_id(file_id)
1911
name = self._transform._limbo_name(trans_id)
1912
return os.readlink(name)
1914
def walkdirs(self, prefix=''):
1915
pending = [self._transform.root]
1916
while len(pending) > 0:
1917
parent_id = pending.pop()
1920
prefix = prefix.rstrip('/')
1921
parent_path = self._final_paths.get_path(parent_id)
1922
parent_file_id = self._transform.final_file_id(parent_id)
1923
for child_id in self._all_children(parent_id):
1924
path_from_root = self._final_paths.get_path(child_id)
1925
basename = self._transform.final_name(child_id)
1926
file_id = self._transform.final_file_id(child_id)
1928
kind = self._transform.final_kind(child_id)
1929
versioned_kind = kind
1932
versioned_kind = self._transform._tree.stored_kind(file_id)
1933
if versioned_kind == 'directory':
1934
subdirs.append(child_id)
1935
children.append((path_from_root, basename, kind, None,
1936
file_id, versioned_kind))
1938
if parent_path.startswith(prefix):
1939
yield (parent_path, parent_file_id), children
1940
pending.extend(sorted(subdirs, key=self._final_paths.get_path,
1943
def get_parent_ids(self):
1944
return self._parent_ids
1946
def set_parent_ids(self, parent_ids):
1947
self._parent_ids = parent_ids
1949
def get_revision_tree(self, revision_id):
1950
return self._transform._tree.get_revision_tree(revision_id)
864
1953
def joinpath(parent, child):
865
1954
"""Join tree-relative paths, handling the tree root specially"""
866
1955
if parent is None or parent == "":
896
1985
self._known_paths[trans_id] = self._determine_path(trans_id)
897
1986
return self._known_paths[trans_id]
1988
def get_paths(self, trans_ids):
1989
return [(self.get_path(t), t) for t in trans_ids]
899
1993
def topology_sorted_ids(tree):
900
1994
"""Determine the topological order of the ids in a tree"""
901
1995
file_ids = list(tree)
902
1996
file_ids.sort(key=tree.id2path)
905
def build_tree(tree, wt):
906
"""Create working tree for a branch, using a Transaction."""
2000
def build_tree(tree, wt, accelerator_tree=None, hardlink=False,
2001
delta_from_tree=False):
2002
"""Create working tree for a branch, using a TreeTransform.
2004
This function should be used on empty trees, having a tree root at most.
2005
(see merge and revert functionality for working with existing trees)
2007
Existing files are handled like so:
2009
- Existing bzrdirs take precedence over creating new items. They are
2010
created as '%s.diverted' % name.
2011
- Otherwise, if the content on disk matches the content we are building,
2012
it is silently replaced.
2013
- Otherwise, conflict resolution will move the old file to 'oldname.moved'.
2015
:param tree: The tree to convert wt into a copy of
2016
:param wt: The working tree that files will be placed into
2017
:param accelerator_tree: A tree which can be used for retrieving file
2018
contents more quickly than tree itself, i.e. a workingtree. tree
2019
will be used for cases where accelerator_tree's content is different.
2020
:param hardlink: If true, hard-link files to accelerator_tree, where
2021
possible. accelerator_tree must implement abspath, i.e. be a
2023
:param delta_from_tree: If true, build_tree may use the input Tree to
2024
generate the inventory delta.
2026
wt.lock_tree_write()
2030
if accelerator_tree is not None:
2031
accelerator_tree.lock_read()
2033
return _build_tree(tree, wt, accelerator_tree, hardlink,
2036
if accelerator_tree is not None:
2037
accelerator_tree.unlock()
2044
def _build_tree(tree, wt, accelerator_tree, hardlink, delta_from_tree):
2045
"""See build_tree."""
2046
for num, _unused in enumerate(wt.all_file_ids()):
2047
if num > 0: # more than just a root
2048
raise errors.WorkingTreeAlreadyPopulated(base=wt.basedir)
2049
existing_files = set()
2050
for dir, files in wt.walkdirs():
2051
existing_files.update(f[0] for f in files)
907
2052
file_trans_id = {}
908
2053
top_pb = bzrlib.ui.ui_factory.nested_progress_bar()
909
2054
pp = ProgressPhase("Build phase", 2, top_pb)
2055
if tree.inventory.root is not None:
2056
# This is kind of a hack: we should be altering the root
2057
# as part of the regular tree shape diff logic.
2058
# The conditional test here is to avoid doing an
2059
# expensive operation (flush) every time the root id
2060
# is set within the tree, nor setting the root and thus
2061
# marking the tree as dirty, because we use two different
2062
# idioms here: tree interfaces and inventory interfaces.
2063
if wt.get_root_id() != tree.get_root_id():
2064
wt.set_root_id(tree.get_root_id())
910
2066
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)
2070
file_trans_id[wt.get_root_id()] = \
2071
tt.trans_id_tree_file_id(wt.get_root_id())
915
2072
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]
2074
deferred_contents = []
2076
total = len(tree.inventory)
2078
precomputed_delta = []
2080
precomputed_delta = None
2081
for num, (tree_path, entry) in \
2082
enumerate(tree.inventory.iter_entries_by_dir()):
2083
pb.update("Building tree", num - len(deferred_contents), total)
920
2084
if entry.parent_id is None:
922
if entry.parent_id not in file_trans_id:
923
raise repr(entry.parent_id)
2087
file_id = entry.file_id
2089
precomputed_delta.append((None, tree_path, file_id, entry))
2090
if tree_path in existing_files:
2091
target_path = wt.abspath(tree_path)
2092
kind = file_kind(target_path)
2093
if kind == "directory":
2095
bzrdir.BzrDir.open(target_path)
2096
except errors.NotBranchError:
2100
if (file_id not in divert and
2101
_content_match(tree, entry, file_id, kind,
2103
tt.delete_contents(tt.trans_id_tree_path(tree_path))
2104
if kind == 'directory':
924
2106
parent_id = file_trans_id[entry.parent_id]
925
file_trans_id[file_id] = new_by_entry(tt, entry, parent_id,
2107
if entry.kind == 'file':
2108
# We *almost* replicate new_by_entry, so that we can defer
2109
# getting the file text, and get them all at once.
2110
trans_id = tt.create_path(entry.name, parent_id)
2111
file_trans_id[file_id] = trans_id
2112
tt.version_file(file_id, trans_id)
2113
executable = tree.is_executable(file_id, tree_path)
2115
tt.set_executability(executable, trans_id)
2116
deferred_contents.append((file_id, trans_id))
2118
file_trans_id[file_id] = new_by_entry(tt, entry, parent_id,
2121
new_trans_id = file_trans_id[file_id]
2122
old_parent = tt.trans_id_tree_path(tree_path)
2123
_reparent_children(tt, old_parent, new_trans_id)
2124
offset = num + 1 - len(deferred_contents)
2125
_create_files(tt, tree, deferred_contents, pb, offset,
2126
accelerator_tree, hardlink)
2130
divert_trans = set(file_trans_id[f] for f in divert)
2131
resolver = lambda t, c: resolve_checkout(t, c, divert_trans)
2132
raw_conflicts = resolve_conflicts(tt, pass_func=resolver)
2133
if len(raw_conflicts) > 0:
2134
precomputed_delta = None
2135
conflicts = cook_conflicts(raw_conflicts, tt)
2136
for conflict in conflicts:
2139
wt.add_conflicts(conflicts)
2140
except errors.UnsupportedOperation:
2142
result = tt.apply(no_conflicts=True,
2143
precomputed_delta=precomputed_delta)
933
2146
top_pb.finished()
2150
def _create_files(tt, tree, desired_files, pb, offset, accelerator_tree,
2152
total = len(desired_files) + offset
2153
if accelerator_tree is None:
2154
new_desired_files = desired_files
2156
iter = accelerator_tree.iter_changes(tree, include_unchanged=True)
2157
unchanged = dict((f, p[1]) for (f, p, c, v, d, n, k, e)
2158
in iter if not (c or e[0] != e[1]))
2159
new_desired_files = []
2161
for file_id, trans_id in desired_files:
2162
accelerator_path = unchanged.get(file_id)
2163
if accelerator_path is None:
2164
new_desired_files.append((file_id, trans_id))
2166
pb.update('Adding file contents', count + offset, total)
2168
tt.create_hardlink(accelerator_tree.abspath(accelerator_path),
2171
contents = accelerator_tree.get_file(file_id, accelerator_path)
2173
tt.create_file(contents, trans_id)
2178
for count, (trans_id, contents) in enumerate(tree.iter_files_bytes(
2179
new_desired_files)):
2180
tt.create_file(contents, trans_id)
2181
pb.update('Adding file contents', count + offset, total)
2184
def _reparent_children(tt, old_parent, new_parent):
2185
for child in tt.iter_tree_children(old_parent):
2186
tt.adjust_path(tt.final_name(child), new_parent, child)
2188
def _reparent_transform_children(tt, old_parent, new_parent):
2189
by_parent = tt.by_parent()
2190
for child in by_parent[old_parent]:
2191
tt.adjust_path(tt.final_name(child), new_parent, child)
2192
return by_parent[old_parent]
2194
def _content_match(tree, entry, file_id, kind, target_path):
2195
if entry.kind != kind:
2197
if entry.kind == "directory":
2199
if entry.kind == "file":
2200
if tree.get_file(file_id).read() == file(target_path, 'rb').read():
2202
elif entry.kind == "symlink":
2203
if tree.get_symlink_target(file_id) == os.readlink(target_path):
2208
def resolve_checkout(tt, conflicts, divert):
2209
new_conflicts = set()
2210
for c_type, conflict in ((c[0], c) for c in conflicts):
2211
# Anything but a 'duplicate' would indicate programmer error
2212
if c_type != 'duplicate':
2213
raise AssertionError(c_type)
2214
# Now figure out which is new and which is old
2215
if tt.new_contents(conflict[1]):
2216
new_file = conflict[1]
2217
old_file = conflict[2]
2219
new_file = conflict[2]
2220
old_file = conflict[1]
2222
# We should only get here if the conflict wasn't completely
2224
final_parent = tt.final_parent(old_file)
2225
if new_file in divert:
2226
new_name = tt.final_name(old_file)+'.diverted'
2227
tt.adjust_path(new_name, final_parent, new_file)
2228
new_conflicts.add((c_type, 'Diverted to',
2229
new_file, old_file))
2231
new_name = tt.final_name(old_file)+'.moved'
2232
tt.adjust_path(new_name, final_parent, old_file)
2233
new_conflicts.add((c_type, 'Moved existing file to',
2234
old_file, new_file))
2235
return new_conflicts
935
2238
def new_by_entry(tt, entry, parent_id, tree):
936
2239
"""Create a new file according to its inventory entry"""
1046
2326
working_kind = working_tree.kind(file_id)
1047
2327
has_contents = True
1049
if e.errno != errno.ENOENT:
1051
2329
has_contents = False
1052
2330
contents_mod = True
1053
2331
meta_mod = False
1054
2332
if has_contents is True:
1055
real_e_kind = entry.kind
1056
if real_e_kind == 'root_directory':
1057
real_e_kind = 'directory'
1058
if real_e_kind != working_kind:
2333
if entry.kind != working_kind:
1059
2334
contents_mod, meta_mod = True, False
1061
cur_entry._read_tree_state(working_tree.id2path(file_id),
2336
cur_entry._read_tree_state(working_tree.id2path(file_id),
1063
2338
contents_mod, meta_mod = entry.detect_changes(cur_entry)
1064
2339
cur_entry._forget_tree_state()
1065
2340
return has_contents, contents_mod, meta_mod
1068
def revert(working_tree, target_tree, filenames, backups=False,
1069
pb=DummyProgress()):
2343
def revert(working_tree, target_tree, filenames, backups=False,
2344
pb=DummyProgress(), change_reporter=None):
1070
2345
"""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
2346
target_tree.lock_read()
1075
2347
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:
2349
pp = ProgressPhase("Revert phase", 3, pb)
2350
conflicts, merge_modified = _prepare_revert_transform(
2351
working_tree, target_tree, tt, filenames, backups, pp)
2353
change_reporter = delta._ChangeReporter(
2354
unversioned_filter=working_tree.is_ignored)
2355
delta.report_changes(tt.iter_changes(), change_reporter)
2356
for conflict in conflicts:
2360
working_tree.set_merge_modified(merge_modified)
2362
target_tree.unlock()
2368
def _prepare_revert_transform(working_tree, target_tree, tt, filenames,
2369
backups, pp, basis_tree=None,
2370
merge_modified=None):
2372
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
2374
if merge_modified is None:
2375
merge_modified = working_tree.merge_modified()
2376
merge_modified = _alter_files(working_tree, target_tree, tt,
2377
child_pb, filenames, backups,
2378
merge_modified, basis_tree)
2382
child_pb = bzrlib.ui.ui_factory.nested_progress_bar()
2384
raw_conflicts = resolve_conflicts(tt, child_pb,
2385
lambda t, c: conflict_pass(t, c, target_tree))
2388
conflicts = cook_conflicts(raw_conflicts, tt)
2389
return conflicts, merge_modified
2392
def _alter_files(working_tree, target_tree, tt, pb, specific_files,
2393
backups, merge_modified, basis_tree=None):
2394
if basis_tree is not None:
2395
basis_tree.lock_read()
2396
change_list = target_tree.iter_changes(working_tree,
2397
specific_files=specific_files, pb=pb)
2398
if target_tree.get_root_id() is None:
2404
for id_num, (file_id, path, changed_content, versioned, parent, name,
2405
kind, executable) in enumerate(change_list):
2406
if skip_root and file_id[0] is not None and parent[0] is None:
2408
trans_id = tt.trans_id_file_id(file_id)
2411
keep_content = False
2412
if kind[0] == 'file' and (backups or kind[1] is None):
2413
wt_sha1 = working_tree.get_file_sha1(file_id)
2414
if merge_modified.get(file_id) != wt_sha1:
2415
# acquire the basis tree lazily to prevent the
2416
# expense of accessing it when it's not needed ?
2417
# (Guessing, RBC, 200702)
2418
if basis_tree is None:
2419
basis_tree = working_tree.basis_tree()
2420
basis_tree.lock_read()
2421
if file_id in basis_tree:
2422
if wt_sha1 != basis_tree.get_file_sha1(file_id):
2424
elif kind[1] is None and not versioned[1]:
2426
if kind[0] is not None:
2427
if not keep_content:
1121
2428
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({})
2429
elif kind[1] is not None:
2430
parent_trans_id = tt.trans_id_file_id(parent[0])
2431
by_parent = tt.by_parent()
2432
backup_name = _get_backup_name(name[0], by_parent,
2433
parent_trans_id, tt)
2434
tt.adjust_path(backup_name, parent_trans_id, trans_id)
2435
new_trans_id = tt.create_path(name[0], parent_trans_id)
2436
if versioned == (True, True):
2437
tt.unversion_file(trans_id)
2438
tt.version_file(file_id, new_trans_id)
2439
# New contents should have the same unix perms as old
2442
trans_id = new_trans_id
2443
if kind[1] in ('directory', 'tree-reference'):
2444
tt.create_directory(trans_id)
2445
if kind[1] == 'tree-reference':
2446
revision = target_tree.get_reference_revision(file_id,
2448
tt.set_tree_reference(revision, trans_id)
2449
elif kind[1] == 'symlink':
2450
tt.create_symlink(target_tree.get_symlink_target(file_id),
2452
elif kind[1] == 'file':
2453
deferred_files.append((file_id, (trans_id, mode_id)))
2454
if basis_tree is None:
2455
basis_tree = working_tree.basis_tree()
2456
basis_tree.lock_read()
2457
new_sha1 = target_tree.get_file_sha1(file_id)
2458
if (file_id in basis_tree and new_sha1 ==
2459
basis_tree.get_file_sha1(file_id)):
2460
if file_id in merge_modified:
2461
del merge_modified[file_id]
2463
merge_modified[file_id] = new_sha1
2465
# preserve the execute bit when backing up
2466
if keep_content and executable[0] == executable[1]:
2467
tt.set_executability(executable[1], trans_id)
2468
elif kind[1] is not None:
2469
raise AssertionError(kind[1])
2470
if versioned == (False, True):
2471
tt.version_file(file_id, trans_id)
2472
if versioned == (True, False):
2473
tt.unversion_file(trans_id)
2474
if (name[1] is not None and
2475
(name[0] != name[1] or parent[0] != parent[1])):
2476
if name[1] == '' and parent[1] is None:
2477
parent_trans = ROOT_PARENT
2479
parent_trans = tt.trans_id_file_id(parent[1])
2480
tt.adjust_path(name[1], parent_trans, trans_id)
2481
if executable[0] != executable[1] and kind[1] == "file":
2482
tt.set_executability(executable[1], trans_id)
2483
for (trans_id, mode_id), bytes in target_tree.iter_files_bytes(
2485
tt.create_file(bytes, trans_id, mode_id)
1143
def resolve_conflicts(tt, pb=DummyProgress()):
2487
if basis_tree is not None:
2489
return merge_modified
2492
def resolve_conflicts(tt, pb=DummyProgress(), pass_func=None):
1144
2493
"""Make many conflict-resolution attempts, but die if they fail"""
2494
if pass_func is None:
2495
pass_func = conflict_pass
1145
2496
new_conflicts = set()
1147
2498
for n in range(10):