39
class PatchApply(object):
40
"""Patch application as a kind of content change"""
41
def __init__(self, contents):
44
:param contents: The text of the patch to apply
45
:type contents: str"""
46
self.contents = contents
48
def __eq__(self, other):
49
if not isinstance(other, PatchApply):
51
elif self.contents != other.contents:
56
def __ne__(self, other):
57
return not (self == other)
59
def apply(self, filename, conflict_handler, reverse=False):
60
"""Applies the patch to the specified file.
62
:param filename: the file to apply the patch to
64
:param reverse: If true, apply the patch in reverse
67
input_name = filename+".orig"
69
os.rename(filename, input_name)
71
if e.errno != errno.ENOENT:
73
if conflict_handler.patch_target_missing(filename, self.contents)\
76
os.rename(filename, input_name)
79
status = patch.patch(self.contents, input_name, filename,
81
os.chmod(filename, os.stat(input_name).st_mode)
85
conflict_handler.failed_hunks(filename)
88
47
class ChangeUnixPermissions(object):
89
48
"""This is two-way change, suitable for file modification, creation,
369
328
class Diff3Merge(object):
370
def __init__(self, base_file, other_file):
371
self.base_file = base_file
372
self.other_file = other_file
329
def __init__(self, file_id, base, other):
330
self.file_id = file_id
374
334
def __eq__(self, other):
375
335
if not isinstance(other, Diff3Merge):
377
return (self.base_file == other.base_file and
378
self.other_file == other.other_file)
337
return (self.base == other.base and
338
self.other == other.other and self.file_id == other.file_id)
380
340
def __ne__(self, other):
381
341
return not (self == other)
383
343
def apply(self, filename, conflict_handler, reverse=False):
384
new_file = filename+".new"
344
new_file = filename+".new"
345
base_file = self.base.readonly_path(self.file_id)
346
other_file = self.other.readonly_path(self.file_id)
386
base = self.base_file
387
other = self.other_file
389
base = self.other_file
390
other = self.base_file
391
353
status = patch.diff3(new_file, filename, base, other)
393
355
os.chmod(new_file, os.stat(filename).st_mode)
1047
1019
def rename_conflict(self, id, this_name, base_name, other_name):
1048
1020
raise RenameConflict(id, this_name, base_name, other_name)
1050
def move_conflict(self, id, inventory):
1051
this_dir = inventory.this.get_dir(id)
1052
base_dir = inventory.base.get_dir(id)
1053
other_dir = inventory.other.get_dir(id)
1022
def move_conflict(self, id, this_dir, base_dir, other_dir):
1054
1023
raise MoveConflict(id, this_dir, base_dir, other_dir)
1056
def merge_conflict(self, new_file, this_path, base_path, other_path):
1025
def merge_conflict(self, new_file, this_path, base_lines, other_lines):
1057
1026
os.unlink(new_file)
1058
1027
raise MergeConflict(this_path)
1087
1056
def missing_for_rename(self, filename):
1088
1057
raise MissingForRename(filename)
1090
def missing_for_merge(self, file_id, inventory):
1091
raise MissingForMerge(inventory.other.get_path(file_id))
1059
def missing_for_merge(self, file_id, other_path):
1060
raise MissingForMerge(other_path)
1093
1062
def new_contents_conflict(self, filename, other_contents):
1094
1063
raise NewContentsConflict(filename)
1099
1068
def apply_changeset(changeset, inventory, dir, conflict_handler=None,
1315
1284
self.full_path = full_path
1316
1285
self.stat_result = stat_result
1318
def generate_changeset(tree_a, tree_b, inventory_a=None, inventory_b=None):
1319
return ChangesetGenerator(tree_a, tree_b, inventory_a, inventory_b)()
1287
def generate_changeset(tree_a, tree_b, interesting_ids=None):
1288
return ChangesetGenerator(tree_a, tree_b, interesting_ids)()
1321
1290
class ChangesetGenerator(object):
1322
def __init__(self, tree_a, tree_b, inventory_a=None, inventory_b=None):
1291
def __init__(self, tree_a, tree_b, interesting_ids=None):
1323
1292
object.__init__(self)
1324
1293
self.tree_a = tree_a
1325
1294
self.tree_b = tree_b
1326
if inventory_a is not None:
1327
self.inventory_a = inventory_a
1329
self.inventory_a = tree_a.inventory()
1330
if inventory_b is not None:
1331
self.inventory_b = inventory_b
1333
self.inventory_b = tree_b.inventory()
1334
self.r_inventory_a = self.reverse_inventory(self.inventory_a)
1335
self.r_inventory_b = self.reverse_inventory(self.inventory_b)
1295
self._interesting_ids = interesting_ids
1337
def reverse_inventory(self, inventory):
1339
for entry in inventory.itervalues():
1340
if entry.id is None:
1342
r_inventory[entry.id] = entry
1297
def iter_both_tree_ids(self):
1298
for file_id in self.tree_a:
1300
for file_id in self.tree_b:
1301
if file_id not in self.tree_a:
1345
1304
def __call__(self):
1346
1305
cset = Changeset()
1347
for entry in self.inventory_a.itervalues():
1348
if entry.id is None:
1350
cs_entry = self.make_entry(entry.id)
1306
for file_id in self.iter_both_tree_ids():
1307
cs_entry = self.make_entry(file_id)
1351
1308
if cs_entry is not None and not cs_entry.is_boring():
1352
1309
cset.add_entry(cs_entry)
1354
for entry in self.inventory_b.itervalues():
1355
if entry.id is None:
1357
if not self.r_inventory_a.has_key(entry.id):
1358
cs_entry = self.make_entry(entry.id)
1359
if cs_entry is not None and not cs_entry.is_boring():
1360
cset.add_entry(cs_entry)
1361
1311
for entry in list(cset.entries.itervalues()):
1362
1312
if entry.parent != entry.new_parent:
1363
1313
if not cset.entries.has_key(entry.parent) and\
1371
1321
cset.add_entry(parent_entry)
1374
def get_entry_parent(self, entry, inventory):
1377
if entry.path == "./.":
1379
dirname = os.path.dirname(entry.path)
1382
parent = inventory[dirname]
1385
def get_paths(self, entry, tree):
1388
full_path = tree.readonly_path(entry.id)
1389
if entry.path == ".":
1390
return ("", full_path)
1391
return (entry.path, full_path)
1393
def make_basic_entry(self, id, only_interesting):
1394
entry_a = self.r_inventory_a.get(id)
1395
entry_b = self.r_inventory_b.get(id)
1324
def iter_inventory(self, tree):
1325
for file_id in tree:
1326
yield self.get_entry(file_id, tree)
1328
def get_entry(self, file_id, tree):
1329
if not tree.has_or_had_id(file_id):
1331
return tree.tree.inventory[file_id]
1333
def get_entry_parent(self, entry):
1336
return entry.parent_id
1338
def get_path(self, file_id, tree):
1339
if not tree.has_or_had_id(file_id):
1341
path = tree.id2path(file_id)
1347
def make_basic_entry(self, file_id, only_interesting):
1348
entry_a = self.get_entry(file_id, self.tree_a)
1349
entry_b = self.get_entry(file_id, self.tree_b)
1396
1350
if only_interesting and not self.is_interesting(entry_a, entry_b):
1397
return (None, None, None)
1398
parent = self.get_entry_parent(entry_a, self.inventory_a)
1399
(path, full_path_a) = self.get_paths(entry_a, self.tree_a)
1400
cs_entry = ChangesetEntry(id, parent, path)
1401
new_parent = self.get_entry_parent(entry_b, self.inventory_b)
1404
(new_path, full_path_b) = self.get_paths(entry_b, self.tree_b)
1352
parent = self.get_entry_parent(entry_a)
1353
path = self.get_path(file_id, self.tree_a)
1354
cs_entry = ChangesetEntry(file_id, parent, path)
1355
new_parent = self.get_entry_parent(entry_b)
1357
new_path = self.get_path(file_id, self.tree_b)
1406
1359
cs_entry.new_path = new_path
1407
1360
cs_entry.new_parent = new_parent
1408
return (cs_entry, full_path_a, full_path_b)
1410
1363
def is_interesting(self, entry_a, entry_b):
1364
if self._interesting_ids is None:
1411
1366
if entry_a is not None:
1412
if entry_a.interesting:
1414
if entry_b is not None:
1415
if entry_b.interesting:
1367
file_id = entry_a.file_id
1368
elif entry_b is not None:
1369
file_id = entry_b.file_id
1372
return file_id in self._interesting_ids
1419
1374
def make_boring_entry(self, id):
1420
(cs_entry, full_path_a, full_path_b) = \
1421
self.make_basic_entry(id, only_interesting=False)
1375
cs_entry = self.make_basic_entry(id, only_interesting=False)
1422
1376
if cs_entry.is_creation_or_deletion():
1423
1377
return self.make_entry(id, only_interesting=False)
1428
1382
def make_entry(self, id, only_interesting=True):
1429
(cs_entry, full_path_a, full_path_b) = \
1430
self.make_basic_entry(id, only_interesting)
1383
cs_entry = self.make_basic_entry(id, only_interesting)
1432
1385
if cs_entry is None:
1387
if id in self.tree_a and id in self.tree_b:
1388
a_sha1 = self.tree_a.get_file_sha1(id)
1389
b_sha1 = self.tree_b.get_file_sha1(id)
1390
if None not in (a_sha1, b_sha1) and a_sha1 == b_sha1:
1393
full_path_a = self.tree_a.readonly_path(id)
1394
full_path_b = self.tree_b.readonly_path(id)
1435
1395
stat_a = self.lstat(full_path_a)
1436
1396
stat_b = self.lstat(full_path_b)
1438
cs_entry.new_parent = None
1439
cs_entry.new_path = None
1441
1398
cs_entry.metadata_change = self.make_mode_change(stat_a, stat_b)
1442
1399
cs_entry.contents_change = self.make_contents_change(full_path_a,
1467
1424
if stat_a.st_ino == stat_b.st_ino and \
1468
1425
stat_a.st_dev == stat_b.st_dev:
1470
if file(full_path_a, "rb").read() == \
1471
file(full_path_b, "rb").read():
1474
patch_contents = patch.diff(full_path_a,
1475
file(full_path_b, "rb").read())
1476
if patch_contents is None:
1478
return PatchApply(patch_contents)
1480
1428
a_contents = self.get_contents(stat_a, full_path_a)
1481
1429
b_contents = self.get_contents(stat_b, full_path_b)