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
22
from fetch import greedy_fetch
25
import bzrlib.revision
26
1
from bzrlib.merge_core import merge_flex, ApplyMerge3, BackupBeforeChange
27
2
from bzrlib.changeset import generate_changeset, ExceptionConflictHandler
28
3
from bzrlib.changeset import Inventory, Diff3Merge
29
from bzrlib.branch import find_branch
30
from bzrlib.errors import BzrCommandError, UnrelatedBranches, NoCommonAncestor
31
from bzrlib.errors import NoCommits
4
from bzrlib import find_branch
6
from bzrlib.errors import BzrCommandError
32
7
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
8
from trace import mutter, warning
37
15
# comments from abentley on irc: merge happens in two stages, each
38
16
# of which generates a changeset object
132
117
if not self.ignore_zero:
133
118
print "%d conflicts encountered.\n" % self.conflicts
135
def get_tree(treespec, temp_root, label, local_branch=None):
120
def get_tree(treespec, temp_root, label):
136
121
location, revno = treespec
137
122
branch = find_branch(location)
138
123
if revno is None:
124
base_tree = branch.working_tree()
140
125
elif revno == -1:
141
revision = branch.last_patch()
143
revision = branch.lookup_revision(revno)
144
return branch, get_revid_tree(branch, revision, temp_root, label,
147
def get_revid_tree(branch, revision, temp_root, label, local_branch):
149
base_tree = branch.working_tree()
151
if local_branch is not None:
152
greedy_fetch(local_branch, branch, revision)
153
base_tree = local_branch.revision_tree(revision)
155
base_tree = branch.revision_tree(revision)
126
base_tree = branch.basis_tree()
128
base_tree = branch.revision_tree(branch.lookup_revision(revno))
156
129
temp_path = os.path.join(temp_root, label)
157
130
os.mkdir(temp_path)
158
return MergeTree(base_tree, temp_path)
131
return branch, MergeTree(base_tree, temp_path)
161
134
def file_exists(tree, file_id):
227
195
"""Merge changes into a tree.
230
tuple(path, revision) Base for three-way merge.
198
Base for three-way merge.
232
tuple(path, revision) Other revision for three-way merge.
200
Other revision for three-way merge.
234
202
Directory to merge changes into; '.' by default.
236
204
If true, this_dir must have no uncommitted changes before the
238
all available ancestors of other_revision and base_revision are
239
automatically pulled into the branch.
241
from bzrlib.revision import common_ancestor, MultipleRevisionSources
242
from bzrlib.errors import NoSuchRevision
243
207
tempdir = tempfile.mkdtemp(prefix="bzr-")
245
209
if this_dir is None:
247
211
this_branch = find_branch(this_dir)
248
this_rev_id = this_branch.last_patch()
249
if this_rev_id is None:
250
raise BzrCommandError("This branch has no commits")
252
213
changes = compare_trees(this_branch.working_tree(),
253
214
this_branch.basis_tree(), False)
254
215
if changes.has_changed():
255
216
raise BzrCommandError("Working tree has uncommitted changes.")
256
other_branch, other_tree = get_tree(other_revision, tempdir, "other",
258
if other_revision[1] == -1:
259
other_rev_id = other_branch.last_patch()
260
if other_rev_id is None:
261
raise NoCommits(other_branch)
262
other_basis = other_rev_id
263
elif other_revision[1] is not None:
264
other_rev_id = other_branch.lookup_revision(other_revision[1])
265
other_basis = other_rev_id
268
other_basis = other_branch.last_patch()
269
if other_basis is None:
270
raise NoCommits(other_branch)
217
other_branch, other_tree = get_tree(other_revision, tempdir, "other")
271
218
if base_revision == [None, None]:
273
base_rev_id = common_ancestor(this_rev_id, other_basis,
275
except NoCommonAncestor:
219
if other_revision[1] == -1:
222
o_revno = other_revision[1]
223
base_revno = this_branch.common_ancestor(other_branch,
224
other_revno=o_revno)[0]
225
if base_revno is None:
276
226
raise UnrelatedBranches()
277
base_tree = get_revid_tree(this_branch, base_rev_id, tempdir,
279
base_is_ancestor = True
281
base_branch, base_tree = get_tree(base_revision, tempdir, "base")
282
if base_revision[1] == -1:
283
base_rev_id = base_branch.last_patch()
284
elif base_revision[1] is None:
287
base_rev_id = base_branch.lookup_revision(base_revision[1])
288
if base_rev_id is not None:
289
base_is_ancestor = is_ancestor(this_rev_id, base_rev_id,
290
MultipleRevisionSources(this_branch,
293
base_is_ancestor = False
227
base_revision = ['.', base_revno]
228
base_branch, base_tree = get_tree(base_revision, tempdir, "base")
294
229
if file_list is None:
295
230
interesting_ids = None
310
245
merge_inner(this_branch, other_tree, base_tree, tempdir,
311
246
ignore_zero=ignore_zero, backup_files=backup_files,
312
247
merge_type=merge_type, interesting_ids=interesting_ids)
313
if base_is_ancestor and other_rev_id is not None\
314
and other_rev_id not in this_branch.revision_history():
315
this_branch.add_pending_merge(other_rev_id)
317
249
shutil.rmtree(tempdir)