1
# Copyright (C) 2005 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24
import bzrlib.revision
25
from bzrlib.merge_core import merge_flex, ApplyMerge3, BackupBeforeChange
26
from bzrlib.merge_core import WeaveMerge
27
from bzrlib.changeset import generate_changeset, ExceptionConflictHandler
28
from bzrlib.changeset import Inventory, Diff3Merge, ReplaceContents
29
from bzrlib.branch import Branch
30
from bzrlib.errors import (BzrCommandError,
34
WorkingTreeNotRevision,
37
from bzrlib.delta import compare_trees
38
from bzrlib.trace import mutter, warning, note
39
from bzrlib.fetch import greedy_fetch, fetch
40
from bzrlib.revision import is_ancestor, NULL_REVISION
41
from bzrlib.osutils import rename
42
from bzrlib.revision import common_ancestor, MultipleRevisionSources
43
from bzrlib.errors import NoSuchRevision
45
# TODO: Report back as changes are merged in
47
# TODO: build_working_dir can be built on something simpler than merge()
49
# FIXME: merge() parameters seem oriented towards the command line
50
# NOTABUG: merge is a helper for commandline functions. merge_inner is the
51
# the core functionality.
53
# comments from abentley on irc: merge happens in two stages, each
54
# of which generates a changeset object
56
# stage 1: generate OLD->OTHER,
57
# stage 2: use MINE and OLD->OTHER to generate MINE -> RESULT
59
class MergeConflictHandler(ExceptionConflictHandler):
60
"""Handle conflicts encountered while merging.
62
This subclasses ExceptionConflictHandler, so that any types of
63
conflict that are not explicitly handled cause an exception and
66
def __init__(self, this_tree, base_tree, other_tree, ignore_zero=False):
67
ExceptionConflictHandler.__init__(self)
69
self.ignore_zero = ignore_zero
70
self.this_tree = this_tree
71
self.base_tree = base_tree
72
self.other_tree = other_tree
74
def copy(self, source, dest):
75
"""Copy the text and mode of a file
76
:param source: The path of the file to copy
77
:param dest: The distination file to create
79
s_file = file(source, "rb")
80
d_file = file(dest, "wb")
83
os.chmod(dest, 0777 & os.stat(source).st_mode)
85
def dump(self, lines, dest):
86
"""Copy the text and mode of a file
87
:param source: The path of the file to copy
88
:param dest: The distination file to create
90
d_file = file(dest, "wb")
94
def add_suffix(self, name, suffix, last_new_name=None, fix_inventory=True):
95
"""Rename a file to append a suffix. If the new name exists, the
96
suffix is added repeatedly until a non-existant name is found
98
:param name: The path of the file
99
:param suffix: The suffix to append
100
:param last_new_name: (used for recursive calls) the last name tried
102
if last_new_name is None:
104
new_name = last_new_name+suffix
106
rename(name, new_name)
107
if fix_inventory is True:
109
relpath = self.this_tree.relpath(name)
110
except NotBranchError:
112
if relpath is not None:
113
file_id = self.this_tree.path2id(relpath)
114
if file_id is not None:
115
new_path = self.this_tree.relpath(new_name)
116
rename(new_name, name)
117
self.this_tree.rename_one(relpath, new_path)
118
assert self.this_tree.id2path(file_id) == new_path
120
if e.errno != errno.EEXIST and e.errno != errno.ENOTEMPTY:
122
return self.add_suffix(name, suffix, last_new_name=new_name,
123
fix_inventory=fix_inventory)
126
def conflict(self, text):
131
def merge_conflict(self, new_file, this_path, base_lines, other_lines):
133
Handle diff3 conflicts by producing a .THIS, .BASE and .OTHER. The
134
main file will be a version with diff3 conflicts.
135
:param new_file: Path to the output file with diff3 markers
136
:param this_path: Path to the file text for the THIS tree
137
:param base_path: Path to the file text for the BASE tree
138
:param other_path: Path to the file text for the OTHER tree
140
self.add_suffix(this_path, ".THIS", fix_inventory=False)
141
self.dump(base_lines, this_path+".BASE")
142
self.dump(other_lines, this_path+".OTHER")
143
rename(new_file, this_path)
144
self.conflict("Diff3 conflict encountered in %s" % this_path)
146
def weave_merge_conflict(self, filename, weave, other_i, out_file):
148
Handle weave conflicts by producing a .THIS, and .OTHER. The
149
main file will be a version with diff3-style conflicts.
151
self.add_suffix(filename, ".THIS")
153
self.dump(weave.get_iter(other_i), filename+".OTHER")
154
self.conflict("Text conflict encountered in %s" % filename)
156
def new_contents_conflict(self, filename, other_contents):
157
"""Conflicting contents for newly added file."""
158
other_contents(filename + ".OTHER", self, False)
159
self.conflict("Conflict in newly added file %s" % filename)
162
def target_exists(self, entry, target, old_path):
163
"""Handle the case when the target file or dir exists"""
164
moved_path = self.add_suffix(target, ".moved")
165
self.conflict("Moved existing %s to %s" % (target, moved_path))
167
def rmdir_non_empty(self, filename):
168
"""Handle the case where the dir to be removed still has contents"""
169
self.conflict("Directory %s not removed because it is not empty"\
173
def rem_contents_conflict(self, filename, this_contents, base_contents):
174
base_contents(filename+".BASE", self, False)
175
this_contents(filename+".THIS", self, False)
176
return ReplaceContents(this_contents, None)
178
def rem_contents_conflict(self, filename, this_contents, base_contents):
179
base_contents(filename+".BASE", self, False)
180
this_contents(filename+".THIS", self, False)
181
self.conflict("Other branch deleted locally modified file %s" %
183
return ReplaceContents(this_contents, None)
185
def abs_this_path(self, file_id):
186
"""Return the absolute path for a file_id in the this tree."""
187
return self.this_tree.id2abspath(file_id)
189
def add_missing_parents(self, file_id, tree):
190
"""If some of the parents for file_id are missing, add them."""
191
entry = tree.inventory[file_id]
192
if entry.parent_id not in self.this_tree:
193
return self.create_all_missing(entry.parent_id, tree)
195
return self.abs_this_path(entry.parent_id)
197
def create_all_missing(self, file_id, tree):
198
"""Add contents for a file_id and all its parents to a tree."""
199
entry = tree.inventory[file_id]
200
if entry.parent_id is not None and entry.parent_id not in self.this_tree:
201
abspath = self.create_all_missing(entry.parent_id, tree)
203
abspath = self.abs_this_path(entry.parent_id)
204
entry_path = os.path.join(abspath, entry.name)
205
if not os.path.isdir(entry_path):
206
self.create(file_id, entry_path, tree)
209
def create(self, file_id, path, tree, reverse=False):
210
"""Uses tree data to create a filesystem object for the file_id"""
211
from changeset import get_contents
212
get_contents(tree, file_id)(path, self, reverse)
214
def missing_for_merge(self, file_id, other_path):
215
"""The file_id doesn't exist in THIS, but does in OTHER and BASE"""
216
self.conflict("Other branch modified locally deleted file %s" %
218
parent_dir = self.add_missing_parents(file_id, self.other_tree)
219
stem = os.path.join(parent_dir, os.path.basename(other_path))
220
self.create(file_id, stem+".OTHER", self.other_tree)
221
self.create(file_id, stem+".BASE", self.base_tree)
223
def threeway_contents_conflict(filename, this_contents, base_contents,
225
self.conflict("Three-way conflict merging %s" % filename)
228
if not self.ignore_zero:
229
note("%d conflicts encountered.\n", self.conflicts)
231
def get_tree(treespec, local_branch=None):
232
location, revno = treespec
233
branch = Branch.open_containing(location)[0]
237
revision = branch.last_revision()
239
revision = branch.get_rev_id(revno)
241
revision = NULL_REVISION
242
return branch, get_revid_tree(branch, revision, local_branch)
244
def get_revid_tree(branch, revision, local_branch):
246
base_tree = branch.working_tree()
248
if local_branch is not None:
249
greedy_fetch(local_branch, branch, revision)
250
base_tree = local_branch.revision_tree(revision)
252
base_tree = branch.revision_tree(revision)
256
def file_exists(tree, file_id):
257
return tree.has_filename(tree.id2path(file_id))
260
def build_working_dir(to_dir):
261
"""Build a working directory in an empty directory.
263
to_dir is a directory containing branch metadata but no working files,
264
typically constructed by cloning an existing branch.
266
This is split out as a special idiomatic case of merge. It could
267
eventually be done by just building the tree directly calling into
268
lower-level code (e.g. constructing a changeset).
270
# RBC 20051019 is this not just 'export' ?
271
# AB Well, export doesn't take care of inventory...
272
this_branch = Branch.open_containing(to_dir)[0]
273
transform_tree(this_branch.working_tree(), this_branch.basis_tree())
276
def transform_tree(from_tree, to_tree):
277
merge_inner(from_tree.branch, to_tree, from_tree, ignore_zero=True)
280
def merge(other_revision, base_revision,
281
check_clean=True, ignore_zero=False,
282
this_dir=None, backup_files=False, merge_type=ApplyMerge3,
283
file_list=None, show_base=False, reprocess=False):
284
"""Merge changes into a tree.
287
list(path, revno) Base for three-way merge.
288
If [None, None] then a base will be automatically determined.
290
list(path, revno) Other revision for three-way merge.
292
Directory to merge changes into; '.' by default.
294
If true, this_dir must have no uncommitted changes before the
296
ignore_zero - If true, suppress the "zero conflicts" message when
297
there are no conflicts; should be set when doing something we expect
298
to complete perfectly.
299
file_list - If supplied, merge only changes to selected files.
301
All available ancestors of other_revision and base_revision are
302
automatically pulled into the branch.
304
The revno may be -1 to indicate the last revision on the branch, which is
307
This function is intended for use from the command line; programmatic
308
clients might prefer to call merge_inner(), which has less magic behavior.
312
this_branch = Branch.open_containing(this_dir)[0]
313
if show_base and not merge_type is ApplyMerge3:
314
raise BzrCommandError("Show-base is not supported for this merge"
315
" type. %s" % merge_type)
316
if reprocess and not merge_type is ApplyMerge3:
317
raise BzrCommandError("Reprocess is not supported for this merge"
318
" type. %s" % merge_type)
319
if reprocess and show_base:
320
raise BzrCommandError("Cannot reprocess and show base.")
321
merger = Merger(this_branch)
322
merger.check_basis(check_clean)
323
merger.set_other(other_revision)
324
merger.set_base(base_revision)
325
merger.backup_files = backup_files
326
merger.merge_type = merge_type
327
merger.set_interesting_files(file_list)
328
merger.show_base = show_base
329
merger.reprocess = reprocess
330
merger.conflict_handler = MergeConflictHandler(merger.this_tree,
333
ignore_zero=ignore_zero)
334
conflicts = merger.do_merge()
338
def merge_inner(this_branch, other_tree, base_tree, ignore_zero=False,
339
backup_files=False, merge_type=ApplyMerge3,
340
interesting_ids=None, show_base=False, reprocess=False,
341
interesting_files=None):
342
"""Primary interface for merging.
344
typical use is probably
345
'merge_inner(branch, branch.get_revision_tree(other_revision),
346
branch.get_revision_tree(base_revision))'
348
merger = Merger(this_branch, other_tree, base_tree)
349
merger.backup_files = backup_files
350
merger.merge_type = merge_type
351
merger.interesting_ids = interesting_ids
352
if interesting_files:
353
assert not interesting_ids, ('Only supply interesting_ids'
354
' or interesting_files')
355
merger._set_interesting_files(interesting_files)
356
merger.show_base = show_base
357
merger.reprocess = reprocess
358
merger.conflict_handler = MergeConflictHandler(merger.this_tree, base_tree,
360
ignore_zero=ignore_zero)
361
return merger.do_merge()
364
class Merger(object):
365
def __init__(self, this_branch, other_tree=None, base_tree=None):
366
object.__init__(self)
367
self.this_branch = this_branch
368
self.this_basis = this_branch.last_revision()
369
self.this_rev_id = None
370
self.this_tree = this_branch.working_tree()
371
self.this_revision_tree = None
372
self.other_tree = other_tree
373
self.base_tree = base_tree
374
self.ignore_zero = False
375
self.backup_files = False
376
self.interesting_ids = None
377
self.show_base = False
378
self.reprocess = False
379
self.conflict_handler = MergeConflictHandler(self.this_tree, base_tree,
382
def revision_tree(self, revision_id):
383
return self.this_branch.revision_tree(revision_id)
385
def ensure_revision_trees(self):
386
if self.this_revision_tree is None:
387
if self.this_rev_id is None:
389
if self.this_rev_id is None:
390
raise WorkingTreeNotRevision(self.this_tree)
391
self.this_revision_tree = self.this_branch.revision_tree(
394
if self.other_rev_id is None:
395
other_basis_tree = self.revision_tree(self.other_basis)
396
changes = compare_trees(self.other_tree, other_basis_tree)
397
if changes.has_changed():
398
raise WorkingTreeNotRevision(self.this_tree)
399
other_rev_id = other_basis
400
self.other_tree = other_basis_tree
403
def file_revisions(self, file_id):
404
self.ensure_revision_trees()
405
def get_id(tree, file_id):
406
revision_id = tree.inventory[file_id].revision
407
assert revision_id is not None
409
trees = (self.this_revision_tree, self.other_tree)
410
return [get_id(tree, file_id) for tree in trees]
413
def merge_factory(self, file_id, base, other):
414
if self.merge_type.history_based:
415
t_revid, o_revid = self.file_revisions(file_id)
416
weave = self.this_revision_tree.get_weave(file_id)
417
contents_change = self.merge_type(weave, t_revid, o_revid)
419
if self.show_base is True or self.reprocess is True:
420
contents_change = self.merge_type(file_id, base, other,
421
show_base=self.show_base,
422
reprocess=self.reprocess)
424
contents_change = self.merge_type(file_id, base, other)
425
if self.backup_files:
426
contents_change = BackupBeforeChange(contents_change)
427
return contents_change
429
def check_basis(self, check_clean):
430
if self.this_basis is None:
431
raise BzrCommandError("This branch has no commits")
434
if self.this_basis != self.this_rev_id:
435
raise BzrCommandError("Working tree has uncommitted changes.")
437
def compare_basis(self):
438
changes = compare_trees(self.this_branch.working_tree(),
439
self.this_branch.basis_tree(), False)
440
if not changes.has_changed():
441
self.this_rev_id = self.this_basis
443
def set_interesting_files(self, file_list):
445
self._set_interesting_files(file_list)
446
except NotVersionedError, e:
447
raise BzrCommandError("%s is not a source file in any"
450
def _set_interesting_files(self, file_list):
451
"""Set the list of interesting ids from a list of files."""
452
if file_list is None:
453
self.interesting_ids = None
456
interesting_ids = set()
457
for fname in file_list:
458
path = self.this_tree.relpath(fname)
460
for tree in (self.this_tree, self.base_tree, self.other_tree):
461
file_id = tree.inventory.path2id(path)
462
if file_id is not None:
463
interesting_ids.add(file_id)
466
raise NotVersionedError(path=fname)
467
self.interesting_ids = interesting_ids
469
def set_pending(self):
470
if not self.base_is_ancestor:
472
if self.other_rev_id is None:
474
if self.other_rev_id in self.this_branch.get_ancestry(self.this_basis):
476
self.this_branch.working_tree().add_pending_merge(self.other_rev_id)
478
def set_other(self, other_revision):
479
other_branch, self.other_tree = get_tree(other_revision,
481
if other_revision[1] == -1:
482
self.other_rev_id = other_branch.last_revision()
483
if self.other_rev_id is None:
484
raise NoCommits(other_branch)
485
self.other_basis = self.other_rev_id
486
elif other_revision[1] is not None:
487
self.other_rev_id = other_branch.get_rev_id(other_revision[1])
488
self.other_basis = self.other_rev_id
490
self.other_rev_id = None
491
self.other_basis = other_branch.last_revision()
492
if self.other_basis is None:
493
raise NoCommits(other_branch)
494
fetch(from_branch=other_branch, to_branch=self.this_branch,
495
last_revision=self.other_basis)
497
def set_base(self, base_revision):
498
mutter("doing merge() with no base_revision specified")
499
if base_revision == [None, None]:
501
self.base_rev_id = common_ancestor(self.this_basis,
504
except NoCommonAncestor:
505
raise UnrelatedBranches()
506
self.base_tree = get_revid_tree(self.this_branch, self.base_rev_id,
508
self.base_is_ancestor = True
510
base_branch, self.base_tree = get_tree(base_revision)
511
if base_revision[1] == -1:
512
self.base_rev_id = base_branch.last_revision()
513
elif base_revision[1] is None:
514
self.base_rev_id = None
516
self.base_rev_id = base_branch.get_rev_id(base_revision[1])
517
fetch(from_branch=base_branch, to_branch=self.this_branch)
518
self.base_is_ancestor = is_ancestor(self.this_basis,
523
def get_inventory(tree):
524
return tree.inventory
526
inv_changes = merge_flex(self.this_tree, self.base_tree,
528
generate_changeset, get_inventory,
529
self.conflict_handler,
530
merge_factory=self.merge_factory,
531
interesting_ids=self.interesting_ids)
534
for id, path in inv_changes.iteritems():
539
assert path.startswith('.' + os.sep), "path is %s" % path
541
adjust_ids.append((path, id))
542
if len(adjust_ids) > 0:
543
self.this_branch.working_tree().set_inventory(self.regen_inventory(adjust_ids))
544
conflicts = self.conflict_handler.conflicts
545
self.conflict_handler.finalize()
548
def regen_inventory(self, new_entries):
549
old_entries = self.this_branch.working_tree().read_working_inventory()
553
for path, file_id in new_entries:
556
new_entries_map[file_id] = path
558
def id2path(file_id):
559
path = new_entries_map.get(file_id)
562
entry = old_entries[file_id]
563
if entry.parent_id is None:
565
return os.path.join(id2path(entry.parent_id), entry.name)
567
for file_id in old_entries:
568
entry = old_entries[file_id]
569
path = id2path(file_id)
570
new_inventory[file_id] = (path, file_id, entry.parent_id,
572
by_path[path] = file_id
577
for path, file_id in new_entries:
579
del new_inventory[file_id]
582
new_path_list.append((path, file_id))
583
if file_id not in old_entries:
585
# Ensure no file is added before its parent
587
for path, file_id in new_path_list:
591
parent = by_path[os.path.dirname(path)]
592
abspath = os.path.join(self.this_tree.basedir, path)
593
kind = bzrlib.osutils.file_kind(abspath)
594
new_inventory[file_id] = (path, file_id, parent, kind)
595
by_path[path] = file_id
597
# Get a list in insertion order
598
new_inventory_list = new_inventory.values()
599
mutter ("""Inventory regeneration:
600
old length: %i insertions: %i deletions: %i new_length: %i"""\
601
% (len(old_entries), insertions, deletions,
602
len(new_inventory_list)))
603
assert len(new_inventory_list) == len(old_entries) + insertions\
605
new_inventory_list.sort()
606
return new_inventory_list
608
merge_types = { "merge3": (ApplyMerge3, "Native diff3-style merge"),
609
"diff3": (Diff3Merge, "Merge using external diff3"),
610
'weave': (WeaveMerge, "Weave-based merge")