1
from merge_core import merge_flex, ApplyMerge3, BackupBeforeChange
2
from changeset import generate_changeset, ExceptionConflictHandler
3
from changeset import Inventory, Diff3Merge
4
from bzrlib import find_branch
6
from bzrlib.errors import BzrCommandError
7
from bzrlib.delta import compare_trees
8
from trace import mutter, warning
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
14
class UnrelatedBranches(BzrCommandError):
16
msg = "Branches have no common ancestor, and no base revision"\
18
BzrCommandError.__init__(self, msg)
22
from fetch import greedy_fetch
25
import bzrlib.revision
26
from bzrlib.merge_core import merge_flex, ApplyMerge3, BackupBeforeChange
27
from bzrlib.changeset import generate_changeset, ExceptionConflictHandler
28
from bzrlib.changeset import Inventory, Diff3Merge
29
from bzrlib.branch import Branch
30
from bzrlib.errors import BzrCommandError, UnrelatedBranches, NoCommonAncestor
31
from bzrlib.errors import NoCommits
32
from bzrlib.delta import compare_trees
33
from bzrlib.trace import mutter, warning
34
from bzrlib.fetch import greedy_fetch
35
from bzrlib.revision import is_ancestor
36
from bzrlib.osutils import rename
39
# comments from abentley on irc: merge happens in two stages, each
40
# of which generates a changeset object
42
# stage 1: generate OLD->OTHER,
43
# stage 2: use MINE and OLD->OTHER to generate MINE -> RESULT
21
45
class MergeConflictHandler(ExceptionConflictHandler):
22
"""Handle conflicts encountered while merging"""
23
def __init__(self, dir, ignore_zero=False):
24
ExceptionConflictHandler.__init__(self, dir)
46
"""Handle conflicts encountered while merging.
48
This subclasses ExceptionConflictHandler, so that any types of
49
conflict that are not explicitly handled cause an exception and
52
def __init__(self, ignore_zero=False):
53
ExceptionConflictHandler.__init__(self)
26
55
self.ignore_zero = ignore_zero
37
66
os.chmod(dest, 0777 & os.stat(source).st_mode)
68
def dump(self, lines, dest):
69
"""Copy the text and mode of a file
70
:param source: The path of the file to copy
71
:param dest: The distination file to create
73
d_file = file(dest, "wb")
39
77
def add_suffix(self, name, suffix, last_new_name=None):
40
78
"""Rename a file to append a suffix. If the new name exists, the
41
79
suffix is added repeatedly until a non-existant name is found
70
108
:param other_path: Path to the file text for the OTHER tree
72
110
self.add_suffix(this_path, ".THIS")
73
self.copy(base_path, this_path+".BASE")
74
self.copy(other_path, this_path+".OTHER")
75
os.rename(new_file, this_path)
111
self.dump(base_lines, this_path+".BASE")
112
self.dump(other_lines, this_path+".OTHER")
113
rename(new_file, this_path)
76
114
self.conflict("Diff3 conflict encountered in %s" % this_path)
116
def new_contents_conflict(self, filename, other_contents):
117
"""Conflicting contents for newly added file."""
118
self.copy(other_contents, filename + ".OTHER")
119
self.conflict("Conflict in newly added file %s" % filename)
78
122
def target_exists(self, entry, target, old_path):
79
123
"""Handle the case when the target file or dir exists"""
80
124
moved_path = self.add_suffix(target, ".moved")
90
134
if not self.ignore_zero:
91
135
print "%d conflicts encountered.\n" % self.conflicts
93
class SourceFile(object):
94
def __init__(self, path, id, present=None, isdir=None):
97
self.present = present
99
self.interesting = True
102
return "SourceFile(%s, %s)" % (self.path, self.id)
104
def get_tree(treespec, temp_root, label):
137
def get_tree(treespec, temp_root, label, local_branch=None):
105
138
location, revno = treespec
106
branch = find_branch(location)
139
branch = Branch.open_containing(location)
107
140
if revno is None:
143
revision = branch.last_patch()
145
revision = branch.get_rev_id(revno)
146
return branch, get_revid_tree(branch, revision, temp_root, label,
149
def get_revid_tree(branch, revision, temp_root, label, local_branch):
108
151
base_tree = branch.working_tree()
110
base_tree = branch.basis_tree()
112
base_tree = branch.revision_tree(branch.lookup_revision(revno))
153
if local_branch is not None:
154
greedy_fetch(local_branch, branch, revision)
155
base_tree = local_branch.revision_tree(revision)
157
base_tree = branch.revision_tree(revision)
113
158
temp_path = os.path.join(temp_root, label)
114
159
os.mkdir(temp_path)
115
return branch, MergeTree(base_tree, temp_path)
118
def abspath(tree, file_id):
119
path = tree.inventory.id2path(file_id)
160
return MergeTree(base_tree, temp_path)
124
163
def file_exists(tree, file_id):
125
164
return tree.has_filename(tree.id2path(file_id))
127
def inventory_map(tree):
129
for file_id in tree.inventory:
130
path = abspath(tree, file_id)
131
inventory[path] = SourceFile(path, file_id)
135
167
class MergeTree(object):
136
168
def __init__(self, tree, tempdir):
139
171
self.root = tree.basedir
142
self.inventory = inventory_map(tree)
144
175
self.tempdir = tempdir
145
176
os.mkdir(os.path.join(self.tempdir, "texts"))
180
return self.tree.__iter__()
182
def __contains__(self, file_id):
183
return file_id in self.tree
185
def get_file(self, file_id):
186
return self.tree.get_file(file_id)
188
def get_file_sha1(self, id):
189
return self.tree.get_file_sha1(id)
191
def id2path(self, file_id):
192
return self.tree.id2path(file_id)
194
def has_id(self, file_id):
195
return self.tree.has_id(file_id)
197
def has_or_had_id(self, file_id):
198
if file_id == self.tree.inventory.root.file_id:
200
return self.tree.inventory.has_id(file_id)
202
def has_or_had_id(self, file_id):
203
if file_id == self.tree.inventory.root.file_id:
205
return self.tree.inventory.has_id(file_id)
148
207
def readonly_path(self, id):
149
208
if id not in self.tree:
170
229
"""Merge changes into a tree.
173
Base for three-way merge.
232
tuple(path, revision) Base for three-way merge.
175
Other revision for three-way merge.
234
tuple(path, revision) Other revision for three-way merge.
177
236
Directory to merge changes into; '.' by default.
179
238
If true, this_dir must have no uncommitted changes before the
240
all available ancestors of other_revision and base_revision are
241
automatically pulled into the branch.
243
from bzrlib.revision import common_ancestor, MultipleRevisionSources
244
from bzrlib.errors import NoSuchRevision
182
245
tempdir = tempfile.mkdtemp(prefix="bzr-")
184
247
if this_dir is None:
186
this_branch = find_branch(this_dir)
249
this_branch = Branch.open_containing(this_dir)
250
this_rev_id = this_branch.last_patch()
251
if this_rev_id is None:
252
raise BzrCommandError("This branch has no commits")
188
254
changes = compare_trees(this_branch.working_tree(),
189
255
this_branch.basis_tree(), False)
190
256
if changes.has_changed():
191
257
raise BzrCommandError("Working tree has uncommitted changes.")
192
other_branch, other_tree = get_tree(other_revision, tempdir, "other")
258
other_branch, other_tree = get_tree(other_revision, tempdir, "other",
260
if other_revision[1] == -1:
261
other_rev_id = other_branch.last_patch()
262
if other_rev_id is None:
263
raise NoCommits(other_branch)
264
other_basis = other_rev_id
265
elif other_revision[1] is not None:
266
other_rev_id = other_branch.get_rev_id(other_revision[1])
267
other_basis = other_rev_id
270
other_basis = other_branch.last_patch()
271
if other_basis is None:
272
raise NoCommits(other_branch)
193
273
if base_revision == [None, None]:
194
if other_revision[1] == -1:
197
o_revno = other_revision[1]
198
base_revno = this_branch.common_ancestor(other_branch,
199
other_revno=o_revno)[0]
200
if base_revno is None:
275
base_rev_id = common_ancestor(this_rev_id, other_basis,
277
except NoCommonAncestor:
201
278
raise UnrelatedBranches()
202
base_revision = ['.', base_revno]
203
base_branch, base_tree = get_tree(base_revision, tempdir, "base")
279
base_tree = get_revid_tree(this_branch, base_rev_id, tempdir,
281
base_is_ancestor = True
283
base_branch, base_tree = get_tree(base_revision, tempdir, "base")
284
if base_revision[1] == -1:
285
base_rev_id = base_branch.last_patch()
286
elif base_revision[1] is None:
289
base_rev_id = base_branch.get_rev_id(base_revision[1])
290
multi_source = MultipleRevisionSources(this_branch, base_branch)
291
base_is_ancestor = is_ancestor(this_rev_id, base_rev_id,
204
293
if file_list is None:
205
294
interesting_ids = None
220
309
merge_inner(this_branch, other_tree, base_tree, tempdir,
221
310
ignore_zero=ignore_zero, backup_files=backup_files,
222
311
merge_type=merge_type, interesting_ids=interesting_ids)
312
if base_is_ancestor and other_rev_id is not None\
313
and other_rev_id not in this_branch.revision_history():
314
this_branch.add_pending_merge(other_rev_id)
224
316
shutil.rmtree(tempdir)
232
324
source_file.interesting = source_file.id in interesting_ids
235
def set_optimized(tree_a, tree_b, inventory_a, inventory_b):
236
"""Mark files that have changed texts as interesting
238
for file_id in tree_a.tree.inventory:
239
if file_id not in tree_b.tree.inventory:
241
entry_a = tree_a.tree.inventory[file_id]
242
entry_b = tree_b.tree.inventory[file_id]
243
if (entry_a.kind, entry_b.kind) != ("file", "file"):
245
if None in (entry_a.text_id, entry_b.text_id):
247
if entry_a.text_id != entry_b.text_id:
249
inventory_a[abspath(tree_a.tree, file_id)].interesting = False
250
inventory_b[abspath(tree_b.tree, file_id)].interesting = False
253
def generate_cset_optimized(tree_a, tree_b, inventory_a, inventory_b,
254
interesting_ids=None):
255
"""Generate a changeset, with preprocessing to select interesting files.
256
using the text_id to mark really-changed files.
257
This permits blazing comparisons when text_ids are present. It also
258
disables metadata comparison for files with identical texts.
327
def generate_cset_optimized(tree_a, tree_b, interesting_ids=None):
328
"""Generate a changeset. If interesting_ids is supplied, only changes
329
to those files will be shown. Metadata changes are stripped.
260
if interesting_ids is None:
261
set_optimized(tree_a, tree_b, inventory_a, inventory_b)
263
set_interesting(inventory_a, inventory_b, interesting_ids)
264
cset = generate_changeset(tree_a, tree_b, inventory_a, inventory_b)
331
cset = generate_changeset(tree_a, tree_b, interesting_ids)
265
332
for entry in cset.entries.itervalues():
266
333
entry.metadata_change = None
271
338
ignore_zero=False, merge_type=ApplyMerge3, backup_files=False,
272
339
interesting_ids=None):
274
def merge_factory(base_file, other_file):
275
contents_change = merge_type(base_file, other_file)
341
def merge_factory(file_id, base, other):
342
contents_change = merge_type(file_id, base, other)
277
344
contents_change = BackupBeforeChange(contents_change)
278
345
return contents_change
280
def generate_cset(tree_a, tree_b, inventory_a, inventory_b):
281
return generate_cset_optimized(tree_a, tree_b, inventory_a, inventory_b,
284
347
this_tree = get_tree((this_branch.base, None), tempdir, "this")[1]
286
349
def get_inventory(tree):
287
return tree.inventory
350
return tree.tree.inventory
289
352
inv_changes = merge_flex(this_tree, base_tree, other_tree,
290
generate_cset, get_inventory,
291
MergeConflictHandler(base_tree.root,
292
ignore_zero=ignore_zero),
293
merge_factory=merge_factory)
353
generate_cset_optimized, get_inventory,
354
MergeConflictHandler(ignore_zero=ignore_zero),
355
merge_factory=merge_factory,
356
interesting_ids=interesting_ids)
296
359
for id, path in inv_changes.iteritems():
301
assert path.startswith('./')
364
assert path.startswith('.' + os.sep), "path is %s" % path
303
366
adjust_ids.append((path, id))
304
this_branch.set_inventory(regen_inventory(this_branch, this_tree.root, adjust_ids))
367
if len(adjust_ids) > 0:
368
this_branch.set_inventory(regen_inventory(this_branch, this_tree.root,
307
372
def regen_inventory(this_branch, root, new_entries):
308
373
old_entries = this_branch.read_working_inventory()
309
374
new_inventory = {}
377
for path, file_id in new_entries:
380
new_entries_map[file_id] = path
382
def id2path(file_id):
383
path = new_entries_map.get(file_id)
386
entry = old_entries[file_id]
387
if entry.parent_id is None:
389
return os.path.join(id2path(entry.parent_id), entry.name)
311
391
for file_id in old_entries:
312
392
entry = old_entries[file_id]
313
path = old_entries.id2path(file_id)
393
path = id2path(file_id)
314
394
new_inventory[file_id] = (path, file_id, entry.parent_id, entry.kind)
315
395
by_path[path] = file_id
added
removed
bzrlib/merge.py
