78
81
raise ValueError("invalid property value %r for %r" %
84
def get_history(self, repository):
85
"""Return the canonical line-of-history for this revision.
87
If ghosts are present this may differ in result from a ghost-free
90
current_revision = self
92
while current_revision is not None:
93
reversed_result.append(current_revision.revision_id)
94
if not len (current_revision.parent_ids):
95
reversed_result.append(None)
96
current_revision = None
98
next_revision_id = current_revision.parent_ids[0]
99
current_revision = repository.get_revision(next_revision_id)
100
reversed_result.reverse()
101
return reversed_result
82
104
def is_ancestor(revision_id, candidate_id, branch):
83
105
"""Return true if candidate_id is an ancestor of revision_id.
141
def old_common_ancestor(revision_a, revision_b, revision_source):
142
"""Find the ancestor common to both revisions that is closest to both.
144
from bzrlib.trace import mutter
145
a_ancestors = find_present_ancestors(revision_a, revision_source)
146
b_ancestors = find_present_ancestors(revision_b, revision_source)
149
# a_order is used as a tie-breaker when two equally-good bases are found
150
for revision, (a_order, a_distance) in a_ancestors.iteritems():
151
if b_ancestors.has_key(revision):
152
a_intersection.append((a_distance, a_order, revision))
153
b_intersection.append((b_ancestors[revision][1], a_order, revision))
154
mutter("a intersection: %r", a_intersection)
155
mutter("b intersection: %r", b_intersection)
157
a_closest = __get_closest(a_intersection)
158
if len(a_closest) == 0:
160
b_closest = __get_closest(b_intersection)
161
assert len(b_closest) != 0
162
mutter ("a_closest %r", a_closest)
163
mutter ("b_closest %r", b_closest)
164
if a_closest[0] in b_closest:
166
elif b_closest[0] in a_closest:
169
raise bzrlib.errors.AmbiguousBase((a_closest[0], b_closest[0]))
172
163
def revision_graph(revision, revision_source):
173
164
"""Produce a graph of the ancestry of the specified revision.
174
Return root, ancestors map, descendants map
176
TODO: Produce graphs with the NULL revision as root, so that we can find
177
a common even when trees are not branches don't represent a single line
179
RBC: 20051024: note that when we have two partial histories, this may not
180
be possible. But if we are willing to pretend :)... sure.
166
:return: root, ancestors map, descendants map
168
revision_source.lock_read()
170
return _revision_graph(revision, revision_source)
172
revision_source.unlock()
175
def _revision_graph(revision, revision_source):
176
"""See revision_graph."""
177
from bzrlib.tsort import topo_sort
178
graph = revision_source.get_revision_graph(revision)
179
# mark all no-parent revisions as being NULL_REVISION parentage.
180
for node, parents in graph.items():
181
if len(parents) == 0:
182
graph[node] = [NULL_REVISION]
183
# add NULL_REVISION to the graph
184
graph[NULL_REVISION] = []
186
# pick a root. If there are multiple roots
187
# this could pick a random one.
188
topo_order = topo_sort(graph.items())
186
descendants[revision] = {}
187
while len(lines) > 0:
190
if line == NULL_REVISION:
195
rev = revision_source.get_revision(line)
196
parents = list(rev.parent_ids)
197
if len(parents) == 0:
198
parents = [NULL_REVISION]
199
except bzrlib.errors.NoSuchRevision:
203
if parents is not None:
204
for parent in parents:
205
if parent not in ancestors:
206
new_lines.add(parent)
207
if parent not in descendants:
208
descendants[parent] = {}
209
descendants[parent][line] = 1
210
if parents is not None:
211
ancestors[line] = set(parents)
214
# The history for revision becomes inaccessible without
215
# actually hitting a no-parents revision. This then
216
# makes these asserts below trigger. So, if root is None
217
# determine the actual root by walking the accessible tree
218
# and then stash NULL_REVISION at the end.
220
descendants[root] = {}
221
# for every revision, check we can access at least
222
# one parent, if we cant, add NULL_REVISION and
224
for rev in ancestors:
225
if len(ancestors[rev]) == 0:
226
raise RuntimeError('unreachable code ?!')
228
for parent in ancestors[rev]:
229
if parent in ancestors:
233
descendants[root][rev] = 1
234
ancestors[rev].add(root)
235
ancestors[root] = set()
194
# map the descendants of the graph.
195
# and setup our set based return graph.
196
for node in graph.keys():
197
descendants[node] = {}
198
for node, parents in graph.items():
199
for parent in parents:
200
descendants[parent][node] = 1
201
ancestors[node] = set(parents)
236
203
assert root not in descendants[root]
237
204
assert root not in ancestors[root]
238
205
return root, ancestors, descendants
241
208
def combined_graph(revision_a, revision_b, revision_source):
242
209
"""Produce a combined ancestry graph.
243
210
Return graph root, ancestors map, descendants map, set of common nodes"""
244
root, ancestors, descendants = revision_graph(revision_a, revision_source)
245
root_b, ancestors_b, descendants_b = revision_graph(revision_b,
211
root, ancestors, descendants = revision_graph(
212
revision_a, revision_source)
213
root_b, ancestors_b, descendants_b = revision_graph(
214
revision_b, revision_source)
247
215
if root != root_b:
248
216
raise bzrlib.errors.NoCommonRoot(revision_a, revision_b)
260
228
return root, ancestors, descendants, common
263
def common_ancestor(revision_a, revision_b, revision_source):
231
def common_ancestor(revision_a, revision_b, revision_source,
233
if None in (revision_a, revision_b):
235
# trivial optimisation
236
if revision_a == revision_b:
265
root, ancestors, descendants, common = \
266
combined_graph(revision_a, revision_b, revision_source)
267
except bzrlib.errors.NoCommonRoot:
268
raise bzrlib.errors.NoCommonAncestor(revision_a, revision_b)
270
distances = node_distances (descendants, ancestors, root)
271
farthest = select_farthest(distances, common)
272
if farthest is None or farthest == NULL_REVISION:
273
raise bzrlib.errors.NoCommonAncestor(revision_a, revision_b)
240
pb.update('Picking ancestor', 1, 3)
241
graph = revision_source.get_revision_graph_with_ghosts(
242
[revision_a, revision_b])
243
# convert to a NULL_REVISION based graph.
244
ancestors = graph.get_ancestors()
245
descendants = graph.get_descendants()
246
common = set(graph.get_ancestry(revision_a)).intersection(
247
set(graph.get_ancestry(revision_b)))
248
descendants[NULL_REVISION] = {}
249
ancestors[NULL_REVISION] = []
250
for root in graph.roots:
251
descendants[NULL_REVISION][root] = 1
252
ancestors[root].append(NULL_REVISION)
253
for ghost in graph.ghosts:
254
# ghosts act as roots for the purpose of finding
255
# the longest paths from the root: any ghost *might*
256
# be directly attached to the root, so we treat them
258
# ghost now descends from NULL
259
descendants[NULL_REVISION][ghost] = 1
260
# that is it has an ancestor of NULL
261
ancestors[ghost] = [NULL_REVISION]
262
# ghost is common if any of ghosts descendants are common:
263
for ghost_descendant in descendants[ghost]:
264
if ghost_descendant in common:
268
common.add(NULL_REVISION)
269
except bzrlib.errors.NoCommonRoot:
270
raise bzrlib.errors.NoCommonAncestor(revision_a, revision_b)
272
pb.update('Picking ancestor', 2, 3)
273
distances = node_distances (descendants, ancestors, root)
274
pb.update('Picking ancestor', 3, 2)
275
farthest = select_farthest(distances, common)
276
if farthest is None or farthest == NULL_REVISION:
277
raise bzrlib.errors.NoCommonAncestor(revision_a, revision_b)
306
def get_revision_graph(self, revision_id):
307
# we could probe incrementally until the pending
308
# ghosts list stop growing, but its cheaper for now
309
# to just ask for the complete graph for each repository.
311
for source in self._revision_sources:
312
ghost_graph = source.get_revision_graph_with_ghosts()
313
graphs.append(ghost_graph)
316
if not revision_id in graph.get_ancestors():
318
if absent == len(graphs):
319
raise errors.NoSuchRevision(self._revision_sources[0], revision_id)
323
pending = set([revision_id])
324
def find_parents(node_id):
325
"""find the parents for node_id."""
327
ancestors = graph.get_ancestors()
329
return ancestors[node_id]
332
raise errors.NoSuchRevision(self._revision_sources[0], node_id)
334
# all the graphs should have identical parent lists
335
node_id = pending.pop()
337
result[node_id] = find_parents(node_id)
338
for parent_node in result[node_id]:
339
if not parent_node in result:
340
pending.add(parent_node)
341
except errors.NoSuchRevision:
346
def get_revision_graph_with_ghosts(self, revision_ids):
347
# query all the sources for their entire graphs
348
# and then build a combined graph for just
351
for source in self._revision_sources:
352
ghost_graph = source.get_revision_graph_with_ghosts()
353
graphs.append(ghost_graph.get_ancestors())
354
for revision_id in revision_ids:
357
if not revision_id in graph:
359
if absent == len(graphs):
360
raise errors.NoSuchRevision(self._revision_sources[0],
365
pending = set(revision_ids)
367
def find_parents(node_id):
368
"""find the parents for node_id."""
371
return graph[node_id]
374
raise errors.NoSuchRevision(self._revision_sources[0], node_id)
376
# all the graphs should have identical parent lists
377
node_id = pending.pop()
379
parents = find_parents(node_id)
380
for parent_node in parents:
382
if (parent_node not in pending and
383
parent_node not in done):
385
pending.add(parent_node)
386
result.add_node(node_id, parents)
388
except errors.NoSuchRevision:
390
result.add_ghost(node_id)
395
for source in self._revision_sources:
399
for source in self._revision_sources:
292
403
def get_intervening_revisions(ancestor_id, rev_id, rev_source,
293
404
revision_history=None):
294
405
"""Find the longest line of descent from maybe_ancestor to revision.
added
removed
bzrlib/revision.py
