1
from merge_core import merge_flex, ApplyMerge3, BackupBeforeChange
1
from merge_core import merge_flex
2
2
from changeset import generate_changeset, ExceptionConflictHandler
3
from changeset import Inventory, Diff3Merge
3
from changeset import Inventory
4
4
from bzrlib import find_branch
5
5
import bzrlib.osutils
6
6
from bzrlib.errors import BzrCommandError
7
from bzrlib.delta import compare_trees
7
from bzrlib.diff import compare_trees
8
8
from trace import mutter, warning
80
80
moved_path = self.add_suffix(target, ".moved")
81
81
self.conflict("Moved existing %s to %s" % (target, moved_path))
83
def rmdir_non_empty(self, filename):
84
"""Handle the case where the dir to be removed still has contents"""
85
self.conflict("Directory %s not removed because it is not empty"\
89
83
def finalize(self):
90
84
if not self.ignore_zero:
91
85
print "%d conflicts encountered.\n" % self.conflicts
127
121
def inventory_map(tree):
129
123
for file_id in tree.inventory:
124
if not file_exists(tree, file_id):
130
126
path = abspath(tree, file_id)
131
127
inventory[path] = SourceFile(path, file_id)
166
160
def merge(other_revision, base_revision,
167
161
check_clean=True, ignore_zero=False,
168
this_dir=None, backup_files=False, merge_type=ApplyMerge3,
170
163
"""Merge changes into a tree.
201
194
raise UnrelatedBranches()
202
195
base_revision = ['.', base_revno]
203
196
base_branch, base_tree = get_tree(base_revision, tempdir, "base")
204
if file_list is None:
205
interesting_ids = None
207
interesting_ids = set()
208
this_tree = this_branch.working_tree()
209
for fname in file_list:
210
path = this_branch.relpath(fname)
212
for tree in (this_tree, base_tree.tree, other_tree.tree):
213
file_id = tree.inventory.path2id(path)
214
if file_id is not None:
215
interesting_ids.add(file_id)
218
raise BzrCommandError("%s is not a source file in any"
220
197
merge_inner(this_branch, other_tree, base_tree, tempdir,
221
ignore_zero=ignore_zero, backup_files=backup_files,
222
merge_type=merge_type, interesting_ids=interesting_ids)
198
ignore_zero=ignore_zero)
224
200
shutil.rmtree(tempdir)
227
def set_interesting(inventory_a, inventory_b, interesting_ids):
228
"""Mark files whose ids are in interesting_ids as interesting
230
for inventory in (inventory_a, inventory_b):
231
for path, source_file in inventory.iteritems():
232
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
203
def generate_cset_optimized(tree_a, tree_b, inventory_a, inventory_b):
204
"""Generate a changeset, using the text_id to mark really-changed files.
205
This permits blazing comparisons when text_ids are present. It also
206
disables metadata comparison for files with identical texts.
238
208
for file_id in tree_a.tree.inventory:
239
209
if file_id not in tree_b.tree.inventory:
249
219
inventory_a[abspath(tree_a.tree, file_id)].interesting = False
250
220
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.
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
221
cset = generate_changeset(tree_a, tree_b, inventory_a, inventory_b)
265
222
for entry in cset.entries.itervalues():
266
223
entry.metadata_change = None
270
227
def merge_inner(this_branch, other_tree, base_tree, tempdir,
271
ignore_zero=False, merge_type=ApplyMerge3, backup_files=False,
272
interesting_ids=None):
274
def merge_factory(base_file, other_file):
275
contents_change = merge_type(base_file, other_file)
277
contents_change = BackupBeforeChange(contents_change)
278
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
229
this_tree = get_tree((this_branch.base, None), tempdir, "this")[1]
286
231
def get_inventory(tree):
287
232
return tree.inventory
289
234
inv_changes = merge_flex(this_tree, base_tree, other_tree,
290
generate_cset, get_inventory,
235
generate_cset_optimized, get_inventory,
291
236
MergeConflictHandler(base_tree.root,
292
ignore_zero=ignore_zero),
293
merge_factory=merge_factory)
237
ignore_zero=ignore_zero))
296
240
for id, path in inv_changes.iteritems():
344
288
assert len(new_inventory_list) == len(old_entries) + insertions - deletions
345
289
new_inventory_list.sort()
346
290
return new_inventory_list
348
merge_types = { "merge3": (ApplyMerge3, "Native diff3-style merge"),
349
"diff3": (Diff3Merge, "Merge using external diff3")