257
291
ignore_zero - If true, suppress the "zero conflicts" message when
258
292
there are no conflicts; should be set when doing something we expect
259
293
to complete perfectly.
294
file_list - If supplied, merge only changes to selected files.
261
296
All available ancestors of other_revision and base_revision are
262
297
automatically pulled into the branch.
299
The revno may be -1 to indicate the last revision on the branch, which is
302
This function is intended for use from the command line; programmatic
303
clients might prefer to call merge_inner(), which has less magic behavior.
264
305
if this_dir is None:
266
307
this_branch = Branch.open_containing(this_dir)[0]
267
this_rev_id = this_branch.last_revision()
268
if this_rev_id is None:
269
raise BzrCommandError("This branch has no commits")
271
changes = compare_trees(this_branch.working_tree(),
272
this_branch.basis_tree(), False)
273
if changes.has_changed():
274
raise BzrCommandError("Working tree has uncommitted changes.")
275
other_branch, other_tree = get_tree(other_revision, this_branch)
276
if other_revision[1] == -1:
277
other_rev_id = other_branch.last_revision()
278
if other_rev_id is None:
279
raise NoCommits(other_branch)
280
other_basis = other_rev_id
281
elif other_revision[1] is not None:
282
other_rev_id = other_branch.get_rev_id(other_revision[1])
283
other_basis = other_rev_id
286
other_basis = other_branch.last_revision()
287
if other_basis is None:
288
raise NoCommits(other_branch)
289
if base_revision == [None, None]:
291
base_rev_id = common_ancestor(this_rev_id, other_basis,
293
except NoCommonAncestor:
294
raise UnrelatedBranches()
295
base_tree = get_revid_tree(this_branch, base_rev_id, None)
296
base_is_ancestor = True
298
base_branch, base_tree = get_tree(base_revision)
299
if base_revision[1] == -1:
300
base_rev_id = base_branch.last_revision()
301
elif base_revision[1] is None:
308
if show_base and not merge_type is ApplyMerge3:
309
raise BzrCommandError("Show-base is not supported for this merge"
310
" type. %s" % merge_type)
311
merger = Merger(this_branch)
312
merger.check_basis(check_clean)
313
merger.set_other(other_revision)
314
merger.set_base(base_revision)
315
merger.backup_files = backup_files
316
merger.merge_type = merge_type
317
merger.set_interesting_files(file_list)
318
merger.show_base = show_base
319
merger.conflict_handler = MergeConflictHandler(merger.this_tree,
322
ignore_zero=ignore_zero)
323
conflicts = merger.do_merge()
327
def merge_inner(this_branch, other_tree, base_tree, ignore_zero=False,
328
backup_files=False, merge_type=ApplyMerge3,
329
interesting_ids=None, show_base=False):
330
"""Primary interface for merging.
332
typical use is probably
333
'merge_inner(branch, branch.get_revision_tree(other_revision),
334
branch.get_revision_tree(base_revision))'
336
merger = Merger(this_branch, other_tree, base_tree)
337
merger.backup_files = False
338
merger.merge_type = ApplyMerge3
339
merger.interesting_ids = interesting_ids
340
merger.show_base = show_base
341
merger.conflict_handler = MergeConflictHandler(merger.this_tree, base_tree,
343
ignore_zero=ignore_zero)
344
return merger.do_merge()
347
class Merger(object):
348
def __init__(self, this_branch, other_tree=None, base_tree=None):
349
object.__init__(self)
350
self.this_branch = this_branch
351
self.this_basis = this_branch.last_revision()
352
self.this_rev_id = None
353
self.this_tree = this_branch.working_tree()
354
self.this_revision_tree = None
355
self.other_tree = other_tree
356
self.base_tree = base_tree
357
self.ignore_zero = False
358
self.backup_files = False
359
self.interesting_ids = None
360
self.show_base = False
361
self.conflict_handler = MergeConflictHandler(self.this_tree, base_tree,
364
def revision_tree(self, revision_id):
365
return self.this_branch.revision_tree(revision_id)
367
def ensure_revision_trees(self):
368
if self.this_revision_tree is None:
369
if self.this_rev_id is None:
371
if self.this_rev_id is None:
372
raise WorkingTreeNotRevision(self.this_tree)
373
self.this_revision_tree = self.this_branch.revision_tree(
376
if self.other_rev_id is None:
377
other_basis_tree = self.revision_tree(self.other_basis)
378
changes = compare_trees(self.other_tree, other_basis_tree)
379
if changes.has_changed():
380
raise WorkingTreeNotRevision(self.this_tree)
381
other_rev_id = other_basis
382
self.other_tree = other_basis_tree
385
def file_revisions(self, file_id):
386
self.ensure_revision_trees()
387
def get_id(tree, file_id):
388
revision_id = tree.inventory[file_id].revision
389
assert revision_id is not None
391
trees = (self.this_revision_tree, self.other_tree)
392
return [get_id(tree, file_id) for tree in trees]
395
def merge_factory(self, file_id, base, other):
396
if self.merge_type.history_based:
397
t_revid, o_revid = self.file_revisions(file_id)
398
weave = self.this_revision_tree.get_weave(file_id)
399
contents_change = self.merge_type(weave, t_revid, o_revid)
304
base_rev_id = base_branch.get_rev_id(base_revision[1])
305
fetch(from_branch=base_branch, to_branch=this_branch)
306
base_is_ancestor = is_ancestor(this_rev_id, base_rev_id,
308
if file_list is None:
309
interesting_ids = None
401
if self.show_base is True:
402
contents_change = self.merge_type(file_id, base, other,
405
contents_change = self.merge_type(file_id, base, other)
406
if self.backup_files:
407
contents_change = BackupBeforeChange(contents_change)
408
return contents_change
410
def check_basis(self, check_clean):
411
if self.this_basis is None:
412
raise BzrCommandError("This branch has no commits")
415
if self.this_basis != self.this_rev_id:
416
raise BzrCommandError("Working tree has uncommitted changes.")
418
def compare_basis(self):
419
changes = compare_trees(self.this_branch.working_tree(),
420
self.this_branch.basis_tree(), False)
421
if not changes.has_changed():
422
self.this_rev_id = self.this_basis
424
def set_interesting_files(self, file_list):
425
if file_list is None:
426
self.interesting_ids = None
311
429
interesting_ids = set()
312
this_tree = this_branch.working_tree()
313
430
for fname in file_list:
314
path = this_tree.relpath(fname)
431
path = self.this_tree.relpath(fname)
316
for tree in (this_tree, base_tree, other_tree):
433
for tree in (self.this_tree, self.base_tree, self.other_tree):
317
434
file_id = tree.inventory.path2id(path)
318
435
if file_id is not None:
319
436
interesting_ids.add(file_id)
322
439
raise BzrCommandError("%s is not a source file in any"
323
440
" tree." % fname)
324
conflicts = merge_inner(this_branch, other_tree, base_tree, tempdir=None,
325
ignore_zero=ignore_zero,
326
backup_files=backup_files,
327
merge_type=merge_type,
328
interesting_ids=interesting_ids,
330
if base_is_ancestor and other_rev_id is not None\
331
and other_rev_id not in this_branch.revision_history():
332
this_branch.add_pending_merge(other_rev_id)
336
def set_interesting(inventory_a, inventory_b, interesting_ids):
337
"""Mark files whose ids are in interesting_ids as interesting
339
for inventory in (inventory_a, inventory_b):
340
for path, source_file in inventory.iteritems():
341
source_file.interesting = source_file.id in interesting_ids
344
def merge_inner(this_branch, other_tree, base_tree, tempdir=None,
345
ignore_zero=False, merge_type=ApplyMerge3, backup_files=False,
346
interesting_ids=None, show_base=False):
347
"""Primary interface for merging.
349
typical use is probably
350
'merge_inner(branch, branch.get_revision_tree(other_revision),
351
branch.get_revision_tree(base_revision))'
354
_tempdir = tempfile.mkdtemp(prefix="bzr-")
358
return _merge_inner(this_branch, other_tree, base_tree, _tempdir,
359
ignore_zero, merge_type, backup_files,
364
shutil.rmtree(_tempdir)
367
def _merge_inner(this_branch, other_tree, base_tree, user_tempdir,
368
ignore_zero=False, merge_type=ApplyMerge3, backup_files=False,
369
interesting_ids=None, show_base=False):
370
def merge_factory(file_id, base, other):
371
if show_base is True:
372
contents_change = merge_type(file_id, base, other, show_base=True)
374
contents_change = merge_type(file_id, base, other)
376
contents_change = BackupBeforeChange(contents_change)
377
return contents_change
379
this_tree = get_tree((this_branch.base, None))[1]
381
def get_inventory(tree):
382
return tree.inventory
384
conflict_handler = MergeConflictHandler(this_tree, base_tree, other_tree,
385
ignore_zero=ignore_zero)
386
inv_changes = merge_flex(this_tree, base_tree, other_tree,
387
generate_changeset, get_inventory,
389
merge_factory=merge_factory,
390
interesting_ids=interesting_ids)
393
for id, path in inv_changes.iteritems():
441
self.interesting_ids = interesting_ids
443
def set_pending(self):
444
if not self.base_is_ancestor:
446
if self.other_rev_id is None:
448
if self.other_rev_id in self.this_branch.get_ancestry(self.this_basis):
450
self.this_branch.add_pending_merge(self.other_rev_id)
452
def set_other(self, other_revision):
453
other_branch, self.other_tree = get_tree(other_revision,
455
if other_revision[1] == -1:
456
self.other_rev_id = other_branch.last_revision()
457
if self.other_rev_id is None:
458
raise NoCommits(other_branch)
459
self.other_basis = self.other_rev_id
460
elif other_revision[1] is not None:
461
self.other_rev_id = other_branch.get_rev_id(other_revision[1])
462
self.other_basis = self.other_rev_id
464
self.other_rev_id = None
465
self.other_basis = other_branch.last_revision()
466
if self.other_basis is None:
467
raise NoCommits(other_branch)
468
fetch(from_branch=other_branch, to_branch=self.this_branch,
469
last_revision=self.other_basis)
471
def set_base(self, base_revision):
472
mutter("doing merge() with no base_revision specified")
473
if base_revision == [None, None]:
475
self.base_rev_id = common_ancestor(self.this_basis,
478
except NoCommonAncestor:
479
raise UnrelatedBranches()
480
self.base_tree = get_revid_tree(self.this_branch, self.base_rev_id,
482
self.base_is_ancestor = True
484
base_branch, self.base_tree = get_tree(base_revision)
485
if base_revision[1] == -1:
486
self.base_rev_id = base_branch.last_revision()
487
elif base_revision[1] is None:
488
self.base_rev_id = None
398
assert path.startswith('.' + os.sep), "path is %s" % path
400
adjust_ids.append((path, id))
401
if len(adjust_ids) > 0:
402
this_branch.set_inventory(regen_inventory(this_branch,
405
conflicts = conflict_handler.conflicts
406
conflict_handler.finalize()
410
def regen_inventory(this_branch, root, new_entries):
411
old_entries = this_branch.read_working_inventory()
415
for path, file_id in new_entries:
418
new_entries_map[file_id] = path
420
def id2path(file_id):
421
path = new_entries_map.get(file_id)
424
entry = old_entries[file_id]
425
if entry.parent_id is None:
427
return os.path.join(id2path(entry.parent_id), entry.name)
490
self.base_rev_id = base_branch.get_rev_id(base_revision[1])
491
fetch(from_branch=base_branch, to_branch=self.this_branch)
492
self.base_is_ancestor = is_ancestor(self.this_basis,
497
def get_inventory(tree):
498
return tree.inventory
500
inv_changes = merge_flex(self.this_tree, self.base_tree,
502
generate_changeset, get_inventory,
503
self.conflict_handler,
504
merge_factory=self.merge_factory,
505
interesting_ids=self.interesting_ids)
508
for id, path in inv_changes.iteritems():
513
assert path.startswith('.' + os.sep), "path is %s" % path
515
adjust_ids.append((path, id))
516
if len(adjust_ids) > 0:
517
self.this_branch.set_inventory(self.regen_inventory(adjust_ids))
518
conflicts = self.conflict_handler.conflicts
519
self.conflict_handler.finalize()
522
def regen_inventory(self, new_entries):
523
old_entries = self.this_branch.read_working_inventory()
527
for path, file_id in new_entries:
530
new_entries_map[file_id] = path
532
def id2path(file_id):
533
path = new_entries_map.get(file_id)
536
entry = old_entries[file_id]
537
if entry.parent_id is None:
539
return os.path.join(id2path(entry.parent_id), entry.name)
541
for file_id in old_entries:
542
entry = old_entries[file_id]
543
path = id2path(file_id)
544
new_inventory[file_id] = (path, file_id, entry.parent_id,
546
by_path[path] = file_id
429
for file_id in old_entries:
430
entry = old_entries[file_id]
431
path = id2path(file_id)
432
new_inventory[file_id] = (path, file_id, entry.parent_id, entry.kind)
433
by_path[path] = file_id
438
for path, file_id in new_entries:
440
del new_inventory[file_id]
443
new_path_list.append((path, file_id))
444
if file_id not in old_entries:
446
# Ensure no file is added before its parent
448
for path, file_id in new_path_list:
452
parent = by_path[os.path.dirname(path)]
453
kind = bzrlib.osutils.file_kind(os.path.join(root, path))
454
new_inventory[file_id] = (path, file_id, parent, kind)
455
by_path[path] = file_id
551
for path, file_id in new_entries:
553
del new_inventory[file_id]
556
new_path_list.append((path, file_id))
557
if file_id not in old_entries:
559
# Ensure no file is added before its parent
561
for path, file_id in new_path_list:
565
parent = by_path[os.path.dirname(path)]
566
abspath = os.path.join(self.this_tree.basedir, path)
567
kind = bzrlib.osutils.file_kind(abspath)
568
new_inventory[file_id] = (path, file_id, parent, kind)
569
by_path[path] = file_id
457
# Get a list in insertion order
458
new_inventory_list = new_inventory.values()
459
mutter ("""Inventory regeneration:
460
old length: %i insertions: %i deletions: %i new_length: %i"""\
461
% (len(old_entries), insertions, deletions, len(new_inventory_list)))
462
assert len(new_inventory_list) == len(old_entries) + insertions - deletions
463
new_inventory_list.sort()
464
return new_inventory_list
571
# Get a list in insertion order
572
new_inventory_list = new_inventory.values()
573
mutter ("""Inventory regeneration:
574
old length: %i insertions: %i deletions: %i new_length: %i"""\
575
% (len(old_entries), insertions, deletions,
576
len(new_inventory_list)))
577
assert len(new_inventory_list) == len(old_entries) + insertions\
579
new_inventory_list.sort()
580
return new_inventory_list
466
582
merge_types = { "merge3": (ApplyMerge3, "Native diff3-style merge"),
467
"diff3": (Diff3Merge, "Merge using external diff3")
583
"diff3": (Diff3Merge, "Merge using external diff3"),
584
'weave': (WeaveMerge, "Weave-based merge")