1
# Copyright (C) 2005 Canonical Ltd
1
# (C) 2005 Canonical Ltd
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
5
5
# the Free Software Foundation; either version 2 of the License, or
6
6
# (at your option) any later version.
8
8
# This program is distributed in the hope that it will be useful,
9
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
11
# GNU General Public License for more details.
13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
from bzrlib.selftest import TestCaseInTempDir
24
21
from bzrlib.branch import Branch
25
from bzrlib.errors import NoSuchRevision
26
from bzrlib.graph import Graph
22
from bzrlib.commit import commit
23
from bzrlib.fetch import fetch
27
24
from bzrlib.revision import (find_present_ancestors, combined_graph,
29
is_ancestor, MultipleRevisionSources,
31
from bzrlib.tests import TestCase, TestCaseWithTransport
25
is_ancestor, MultipleRevisionSources)
32
26
from bzrlib.trace import mutter
33
from bzrlib.workingtree import WorkingTree
35
# We're allowed to test deprecated interfaces
36
warnings.filterwarnings('ignore',
37
'.*get_intervening_revisions was deprecated',
39
r'bzrlib\.tests\.test_revision')
41
# XXX: Make this a method of a merge base case
42
def make_branches(self):
27
from bzrlib.errors import NoSuchRevision
43
30
"""Create two branches
45
32
branch 1 has 6 commits, branch 2 has 3 commits
46
commit 10 is a ghosted merge merge from branch 1
33
commit 10 was a psuedo merge from branch 1
34
but has been disabled until ghost support is
48
37
the object graph is
53
42
b..3 a..3 merges b..4
55
44
b..5 a..5 merges b..5
58
47
so A is missing b6 at the start
59
48
and B is missing a3, a4, a5
61
tree1 = self.make_branch_and_tree("branch1")
51
br1 = Branch.initialize("branch1")
64
tree1.commit("Commit one", rev_id="a@u-0-0")
65
tree1.commit("Commit two", rev_id="a@u-0-1")
66
tree1.commit("Commit three", rev_id="a@u-0-2")
53
commit(br1, "Commit one", rev_id="a@u-0-0")
54
commit(br1, "Commit two", rev_id="a@u-0-1")
55
commit(br1, "Commit three", rev_id="a@u-0-2")
68
tree2 = tree1.bzrdir.clone("branch2").open_workingtree()
70
tree2.commit("Commit four", rev_id="b@u-0-3")
71
tree2.commit("Commit five", rev_id="b@u-0-4")
58
br2 = Branch.initialize("branch2")
59
br2.update_revisions(br1)
60
commit(br2, "Commit four", rev_id="b@u-0-3")
61
commit(br2, "Commit five", rev_id="b@u-0-4")
72
62
revisions_2 = br2.revision_history()
73
self.assertEquals(revisions_2[-1], 'b@u-0-4')
75
tree1.merge_from_branch(br2)
76
tree1.commit("Commit six", rev_id="a@u-0-3")
77
tree1.commit("Commit seven", rev_id="a@u-0-4")
78
tree2.commit("Commit eight", rev_id="b@u-0-5")
79
self.assertEquals(br2.revision_history()[-1], 'b@u-0-5')
81
tree1.merge_from_branch(br2)
82
tree1.commit("Commit nine", rev_id="a@u-0-5")
83
# DO NOT MERGE HERE - we WANT a GHOST.
84
tree2.add_parent_tree_id(br1.revision_history()[4])
85
tree2.commit("Commit ten - ghost merge", rev_id="b@u-0-6")
64
fetch(from_branch=br2, to_branch=br1)
65
br1.add_pending_merge(revisions_2[4])
66
assert revisions_2[4] == 'b@u-0-4'
67
commit(br1, "Commit six", rev_id="a@u-0-3")
68
commit(br1, "Commit seven", rev_id="a@u-0-4")
69
commit(br2, "Commit eight", rev_id="b@u-0-5")
71
fetch(from_branch=br2, to_branch=br1)
72
br1.add_pending_merge(br2.revision_history()[5])
73
commit(br1, "Commit nine", rev_id="a@u-0-5")
74
# disabled - it makes testing fetch too hard,
75
# but can be easily reenabled (without the fetch
76
# when GHOSTS are supported. RBC 20050928
77
#fetch(from_branch=br1, to_branch=br2)
78
#br2.add_pending_merge(br1.revision_history()[4])
79
commit(br2, "Commit ten - no merge", rev_id="b@u-0-6")
81
#fetch(from_branch=br2, to_branch=br1)
90
class TestIsAncestor(TestCaseWithTransport):
86
class TestIsAncestor(TestCaseInTempDir):
92
87
def test_recorded_ancestry(self):
93
88
"""Test that commit records all ancestors"""
94
br1, br2 = make_branches(self)
89
br1, br2 = make_branches()
95
90
d = [('a@u-0-0', ['a@u-0-0']),
96
91
('a@u-0-1', ['a@u-0-0', 'a@u-0-1']),
97
92
('a@u-0-2', ['a@u-0-0', 'a@u-0-1', 'a@u-0-2']),
120
115
if rev_id in br2_only and not branch is br2:
122
117
mutter('ancestry of {%s}: %r',
123
rev_id, branch.repository.get_ancestry(rev_id))
124
result = sorted(branch.repository.get_ancestry(rev_id))
125
self.assertEquals(result, [None] + sorted(anc))
118
rev_id, branch.get_ancestry(rev_id))
119
self.assertEquals(sorted(branch.get_ancestry(rev_id)),
120
[None] + sorted(anc))
128
123
def test_is_ancestor(self):
129
124
"""Test checking whether a revision is an ancestor of another revision"""
130
br1, br2 = make_branches(self)
125
br1, br2 = make_branches()
131
126
revisions = br1.revision_history()
132
127
revisions_2 = br2.revision_history()
135
self.assert_(is_ancestor(revisions[0], revisions[0], br1))
136
self.assert_(is_ancestor(revisions[1], revisions[0], sources))
137
self.assert_(not is_ancestor(revisions[0], revisions[1], sources))
138
self.assert_(is_ancestor(revisions_2[3], revisions[0], sources))
130
assert is_ancestor(revisions[0], revisions[0], br1)
131
assert is_ancestor(revisions[1], revisions[0], sources)
132
assert not is_ancestor(revisions[0], revisions[1], sources)
133
assert is_ancestor(revisions_2[3], revisions[0], sources)
139
134
# disabled mbp 20050914, doesn't seem to happen anymore
140
135
## self.assertRaises(NoSuchRevision, is_ancestor, revisions_2[3],
141
136
## revisions[0], br1)
142
self.assert_(is_ancestor(revisions[3], revisions_2[4], sources))
143
self.assert_(is_ancestor(revisions[3], revisions_2[4], br1))
144
self.assert_(is_ancestor(revisions[3], revisions_2[3], sources))
145
## self.assert_(not is_ancestor(revisions[3], revisions_2[3], br1))
148
class TestIntermediateRevisions(TestCaseWithTransport):
137
assert is_ancestor(revisions[3], revisions_2[4], sources)
138
assert is_ancestor(revisions[3], revisions_2[4], br1)
139
assert is_ancestor(revisions[3], revisions_2[3], sources)
140
## assert not is_ancestor(revisions[3], revisions_2[3], br1)
144
class TestIntermediateRevisions(TestCaseInTempDir):
151
TestCaseWithTransport.setUp(self)
152
self.br1, self.br2 = make_branches(self)
153
wt1 = self.br1.bzrdir.open_workingtree()
154
wt2 = self.br2.bzrdir.open_workingtree()
155
wt2.commit("Commit eleven", rev_id="b@u-0-7")
156
wt2.commit("Commit twelve", rev_id="b@u-0-8")
157
wt2.commit("Commit thirtteen", rev_id="b@u-0-9")
159
wt1.merge_from_branch(self.br2)
160
wt1.commit("Commit fourtten", rev_id="a@u-0-6")
162
wt2.merge_from_branch(self.br1)
163
wt2.commit("Commit fifteen", rev_id="b@u-0-10")
147
from bzrlib.commit import commit
148
TestCaseInTempDir.setUp(self)
149
self.br1, self.br2 = make_branches()
151
self.br2.commit("Commit eleven", rev_id="b@u-0-7")
152
self.br2.commit("Commit twelve", rev_id="b@u-0-8")
153
self.br2.commit("Commit thirtteen", rev_id="b@u-0-9")
155
fetch(from_branch=self.br2, to_branch=self.br1)
156
self.br1.add_pending_merge(self.br2.revision_history()[6])
157
self.br1.commit("Commit fourtten", rev_id="a@u-0-6")
159
fetch(from_branch=self.br1, to_branch=self.br2)
160
self.br2.add_pending_merge(self.br1.revision_history()[6])
161
self.br2.commit("Commit fifteen", rev_id="b@u-0-10")
165
163
from bzrlib.revision import MultipleRevisionSources
166
self.sources = MultipleRevisionSources(self.br1.repository,
171
class MockRevisionSource(object):
172
"""A RevisionSource that takes a pregenerated graph.
174
This is useful for testing revision graph algorithms where
175
the actual branch existing is irrelevant.
178
def __init__(self, full_graph):
179
self._full_graph = full_graph
181
def get_revision_graph_with_ghosts(self, revision_ids):
182
# This is mocked out to just return a constant graph.
183
return self._full_graph
186
class TestCommonAncestor(TestCaseWithTransport):
164
self.sources = MultipleRevisionSources(self.br1, self.br2)
166
def intervene(self, ancestor, revision, revision_history=None):
167
from bzrlib.revision import get_intervening_revisions
168
return get_intervening_revisions(ancestor,revision, self.sources,
171
def test_intervene(self):
172
"""Find intermediate revisions, without requiring history"""
173
from bzrlib.errors import NotAncestor, NoSuchRevision
174
assert len(self.intervene('a@u-0-0', 'a@u-0-0')) == 0
175
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-1'), ['a@u-0-1'])
176
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-2'),
177
['a@u-0-1', 'a@u-0-2'])
178
self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-3'),
179
['a@u-0-1', 'a@u-0-2', 'b@u-0-3'])
180
self.assertEqual(self.intervene('b@u-0-3', 'a@u-0-3'),
181
['b@u-0-4', 'a@u-0-3'])
182
self.assertEqual(self.intervene('a@u-0-2', 'a@u-0-3',
183
self.br1.revision_history()),
185
self.assertEqual(self.intervene('a@u-0-0', 'a@u-0-5',
186
self.br1.revision_history()),
187
['a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
189
print ("testrevision.py 191 - intervene appears to return b..6 even"
190
"though it is not reachable!")
191
# self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-6',
192
# self.br1.revision_history()),
193
# ['a@u-0-1', 'a@u-0-2', 'a@u-0-3', 'a@u-0-4',
195
# self.assertEqual(self.intervene('a@u-0-0', 'b@u-0-5'),
196
# ['a@u-0-1', 'a@u-0-2', 'b@u-0-3', 'b@u-0-4',
198
self.assertEqual(self.intervene('b@u-0-3', 'b@u-0-6',
199
self.br2.revision_history()),
200
['b@u-0-4', 'b@u-0-5', 'b@u-0-6'])
201
self.assertEqual(self.intervene('b@u-0-6', 'b@u-0-10'),
202
['b@u-0-7', 'b@u-0-8', 'b@u-0-9', 'b@u-0-10'])
203
self.assertEqual(self.intervene('b@u-0-6', 'b@u-0-10',
204
self.br2.revision_history()),
205
['b@u-0-7', 'b@u-0-8', 'b@u-0-9', 'b@u-0-10'])
206
self.assertRaises(NotAncestor, self.intervene, 'b@u-0-10', 'b@u-0-6',
207
self.br2.revision_history())
208
self.assertRaises(NoSuchRevision, self.intervene, 'c@u-0-10',
209
'b@u-0-6', self.br2.revision_history())
210
self.assertRaises(NoSuchRevision, self.intervene, 'b@u-0-10',
211
'c@u-0-6', self.br2.revision_history())
214
class TestCommonAncestor(TestCaseInTempDir):
187
215
"""Test checking whether a revision is an ancestor of another revision"""
217
def test_old_common_ancestor(self):
218
"""Pick a resonable merge base using the old functionality"""
219
from bzrlib.revision import old_common_ancestor as common_ancestor
220
br1, br2 = make_branches()
221
revisions = br1.revision_history()
222
revisions_2 = br2.revision_history()
225
expected_ancestors_list = {revisions[3]:(0, 0),
227
revisions_2[4]:(2, 1),
229
revisions_2[3]:(4, 2),
230
revisions[0]:(5, 3) }
231
ancestors_list = find_present_ancestors(revisions[3], sources)
232
assert len(expected_ancestors_list) == len(ancestors_list)
233
for key, value in expected_ancestors_list.iteritems():
234
self.assertEqual(ancestors_list[key], value,
235
"key %r, %r != %r" % (key, ancestors_list[key],
238
self.assertEqual(common_ancestor(revisions[0], revisions[0], sources),
240
self.assertEqual(common_ancestor(revisions[1], revisions[2], sources),
242
self.assertEqual(common_ancestor(revisions[1], revisions[1], sources),
244
self.assertEqual(common_ancestor(revisions[2], revisions_2[4], sources),
246
self.assertEqual(common_ancestor(revisions[3], revisions_2[4], sources),
248
self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
250
fetch(from_branch=br2, to_branch=br1)
251
self.assertEqual(common_ancestor(revisions[5], revisions_2[6], sources),
253
self.assertEqual(common_ancestor(revisions_2[6], revisions[5], sources),
189
256
def test_common_ancestor(self):
190
257
"""Pick a reasonable merge base"""
191
br1, br2 = make_branches(self)
258
from bzrlib.revision import common_ancestor
259
br1, br2 = make_branches()
192
260
revisions = br1.revision_history()
193
261
revisions_2 = br2.revision_history()
194
sources = MultipleRevisionSources(br1.repository, br2.repository)
262
sources = MultipleRevisionSources(br1, br2)
195
264
expected_ancestors_list = {revisions[3]:(0, 0),
196
265
revisions[2]:(1, 1),
197
266
revisions_2[4]:(2, 1),
217
287
self.assertEqual(common_ancestor(revisions[4], revisions_2[5], sources),
219
self.assertTrue(common_ancestor(revisions[5], revisions_2[6], sources) in
220
(revisions[4], revisions_2[5]))
221
self.assertTrue(common_ancestor(revisions_2[6], revisions[5], sources),
222
(revisions[4], revisions_2[5]))
223
self.assertEqual(None, common_ancestor(None, revisions[5], sources))
224
self.assertEqual(NULL_REVISION,
225
common_ancestor(NULL_REVISION, NULL_REVISION, sources))
226
self.assertEqual(NULL_REVISION,
227
common_ancestor(revisions[0], NULL_REVISION, sources))
228
self.assertEqual(NULL_REVISION,
229
common_ancestor(NULL_REVISION, revisions[0], sources))
289
self.assertEqual(common_ancestor(revisions[5], revisions_2[6], sources),
291
self.assertEqual(common_ancestor(revisions_2[6], revisions[5], sources),
231
294
def test_combined(self):
232
295
"""combined_graph
233
296
Ensure it's not order-sensitive
235
br1, br2 = make_branches(self)
236
source = MultipleRevisionSources(br1.repository, br2.repository)
237
combined_1 = combined_graph(br1.last_revision(),
298
br1, br2 = make_branches()
299
source = MultipleRevisionSources(br1, br2)
300
combined_1 = combined_graph(br1.last_revision(),
238
301
br2.last_revision(), source)
239
302
combined_2 = combined_graph(br2.last_revision(),
240
303
br1.last_revision(), source)
241
self.assertEquals(combined_1[1], combined_2[1])
242
self.assertEquals(combined_1[2], combined_2[2])
243
self.assertEquals(combined_1[3], combined_2[3])
244
self.assertEquals(combined_1, combined_2)
246
def test_get_history(self):
247
# TODO: test ghosts on the left hand branch's impact
248
# TODO: test ghosts on all parents, we should get some
249
# indicator. i.e. NULL_REVISION
251
tree = self.make_branch_and_tree('.')
252
tree.commit('1', rev_id = '1', allow_pointless=True)
253
tree.commit('2', rev_id = '2', allow_pointless=True)
254
tree.commit('3', rev_id = '3', allow_pointless=True)
255
rev = tree.branch.repository.get_revision('1')
256
history = rev.get_history(tree.branch.repository)
257
self.assertEqual([None, '1'], history)
258
rev = tree.branch.repository.get_revision('2')
259
history = rev.get_history(tree.branch.repository)
260
self.assertEqual([None, '1', '2'], history)
261
rev = tree.branch.repository.get_revision('3')
262
history = rev.get_history(tree.branch.repository)
263
self.assertEqual([None, '1', '2' ,'3'], history)
265
def test_common_ancestor_rootless_graph(self):
266
# common_ancestor on a graph with no reachable roots - only
267
# ghosts - should still return a useful value.
269
# add a ghost node which would be a root if it wasn't a ghost.
270
graph.add_ghost('a_ghost')
271
# add a normal commit on top of that
272
graph.add_node('rev1', ['a_ghost'])
273
# add a left-branch revision
274
graph.add_node('left', ['rev1'])
275
# add a right-branch revision
276
graph.add_node('right', ['rev1'])
277
source = MockRevisionSource(graph)
278
self.assertEqual('rev1', common_ancestor('left', 'right', source))
281
class TestMultipleRevisionSources(TestCaseWithTransport):
282
"""Tests for the MultipleRevisionSources adapter."""
284
def test_get_revision_graph_merges_ghosts(self):
285
# when we ask for the revision graph for B, which
286
# is in repo 1 with a ghost of A, and which is not
287
# in repo 2, which has A, the revision_graph()
288
# should return A and B both.
289
tree_1 = self.make_branch_and_tree('1')
290
tree_1.set_parent_ids(['A'], allow_leftmost_as_ghost=True)
291
tree_1.commit('foo', rev_id='B', allow_pointless=True)
292
tree_2 = self.make_branch_and_tree('2')
293
tree_2.commit('bar', rev_id='A', allow_pointless=True)
294
source = MultipleRevisionSources(tree_1.branch.repository,
295
tree_2.branch.repository)
296
self.assertEqual({'B':['A'],
298
source.get_revision_graph('B'))
301
class TestReservedId(TestCase):
303
def test_is_reserved_id(self):
304
self.assertEqual(True, revision.is_reserved_id(NULL_REVISION))
305
self.assertEqual(True, revision.is_reserved_id(
306
revision.CURRENT_REVISION))
307
self.assertEqual(True, revision.is_reserved_id('arch:'))
308
self.assertEqual(False, revision.is_reserved_id('null'))
309
self.assertEqual(False, revision.is_reserved_id(
310
'arch:a@example.com/c--b--v--r'))
311
self.assertEqual(False, revision.is_reserved_id(None))
304
assert combined_1[1] == combined_2[1]
305
assert combined_1[2] == combined_2[2]
306
assert combined_1[3] == combined_2[3]
307
assert combined_1 == combined_2