1
# Copyright (C) 2005, 2006 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
17
"""Display what revisions are missing in 'other' from 'this' and vice versa."""
21
repository as _mod_repository,
24
import bzrlib.revision as _mod_revision
27
def iter_log_revisions(revisions, revision_source, verbose):
28
last_tree = revision_source.revision_tree(_mod_revision.NULL_REVISION)
31
# We need the following for backward compatibilty (hopefully
32
# this will be deprecated soon :-/) -- vila 080911
37
revno, rev_id, merge_depth = rev
38
rev = revision_source.get_revision(rev_id)
40
remote_tree = revision_source.revision_tree(rev_id)
41
parent_rev_id = rev.parent_ids[0]
42
if last_rev_id == parent_rev_id:
43
parent_tree = last_tree
45
parent_tree = revision_source.revision_tree(parent_rev_id)
46
revision_tree = revision_source.revision_tree(rev_id)
48
last_tree = revision_tree
49
delta = revision_tree.changes_from(parent_tree)
52
yield log.LogRevision(rev, revno, merge_depth, delta=delta)
55
def find_unmerged(local_branch, remote_branch, restrict='all',
56
include_merges=False, backward=False):
57
"""Find revisions from each side that have not been merged.
59
:param local_branch: Compare the history of local_branch
60
:param remote_branch: versus the history of remote_branch, and determine
61
mainline revisions which have not been merged.
62
:param restrict: ('all', 'local', 'remote') If 'all', we will return the
63
unique revisions from both sides. If 'local', we will return None
64
for the remote revisions, similarly if 'remote' we will return None for
66
:param include_merges: Show mainline revisions only if False,
67
all revisions otherwise.
68
:param backward: Show oldest versions first when True, newest versions
71
:return: A list of [(revno, revision_id)] for the mainline revisions on
74
local_branch.lock_read()
76
remote_branch.lock_read()
78
return _find_unmerged(
79
local_branch, remote_branch, restrict=restrict,
80
include_merges=include_merges, backward=backward)
82
remote_branch.unlock()
87
def _enumerate_mainline(ancestry, graph, tip_revno, tip, backward=True):
88
"""Enumerate the mainline revisions for these revisions.
90
:param ancestry: A set of revisions that we care about
91
:param graph: A Graph which lets us find the parents for a revision
92
:param tip_revno: The revision number for the tip revision
93
:param tip: The tip of mainline
94
:param backward: Show oldest versions first when True, newest versions
96
:return: [(revno, revision_id)] for all revisions in ancestry that
97
are left-hand parents from tip, or None if ancestry is None.
101
if not ancestry: #Empty ancestry, no need to do any work
104
# Optionally, we could make 1 call to graph.get_parent_map with all
105
# ancestors. However that will often check many more parents than we
106
# actually need, and the Graph is likely to already have the parents cached
110
cur_revno = tip_revno
111
while cur in ancestry:
112
parent_map = graph.get_parent_map([cur])
113
parents = parent_map.get(cur)
115
break # Ghost, we are done
116
mainline.append((str(cur_revno), cur))
124
def _enumerate_with_merges(branch, ancestry, graph, tip_revno, tip,
126
"""Enumerate the revisions for the ancestry.
128
:param branch: The branch we care about
129
:param ancestry: A set of revisions that we care about
130
:param graph: A Graph which lets us find the parents for a revision
131
:param tip_revno: The revision number for the tip revision
132
:param tip: The tip of the ancsetry
133
:param backward: Show oldest versions first when True, newest versions
135
:return: [(revno, revision_id)] for all revisions in ancestry that
136
are parents from tip, or None if ancestry is None.
140
if not ancestry: #Empty ancestry, no need to do any work
143
mainline_revs, rev_nos, start_rev_id, end_rev_id = log._get_mainline_revs(
144
branch, None, tip_revno)
145
if not mainline_revs:
148
# This asks for all mainline revisions, which is size-of-history and
149
# should be addressed (but currently the only way to get correct
152
# mainline_revisions always includes an extra revision at the
153
# beginning, so don't request it.
154
parent_map = dict(((key, value) for key, value
155
in graph.iter_ancestry(mainline_revs[1:])
156
if value is not None))
157
# filter out ghosts; merge_sort errors on ghosts.
158
# XXX: is this needed here ? -- vila080910
159
rev_graph = _mod_repository._strip_NULL_ghosts(parent_map)
160
# XXX: what if rev_graph is empty now ? -- vila080910
161
merge_sorted_revisions = tsort.merge_sort(rev_graph, tip,
164
# Now that we got the correct revnos, keep only the relevant
166
merge_sorted_revisions = [
167
(s, revid, n, d, e) for s, revid, n, d, e in merge_sorted_revisions
168
if revid in ancestry]
170
merge_sorted_revisions = log.reverse_by_depth(merge_sorted_revisions)
172
for seq, rev_id, merge_depth, revno, end_of_merge in merge_sorted_revisions:
173
revline.append(('.'.join(map(str, revno)), rev_id, merge_depth))
177
def _find_unmerged(local_branch, remote_branch, restrict,
178
include_merges, backward):
179
"""See find_unmerged.
181
The branches should already be locked before entering.
183
local_revno, local_revision_id = local_branch.last_revision_info()
184
remote_revno, remote_revision_id = remote_branch.last_revision_info()
185
if local_revno == remote_revno and local_revision_id == remote_revision_id:
186
# A simple shortcut when the tips are at the same point
188
graph = local_branch.repository.get_graph(remote_branch.repository)
189
if restrict == 'remote':
191
remote_extra = graph.find_unique_ancestors(remote_revision_id,
193
elif restrict == 'local':
195
local_extra = graph.find_unique_ancestors(local_revision_id,
196
[remote_revision_id])
198
if restrict != 'all':
199
raise ValueError('param restrict not one of "all", "local",'
200
' "remote": %r' % (restrict,))
201
local_extra, remote_extra = graph.find_difference(local_revision_id,
204
locals = _enumerate_with_merges(local_branch, local_extra,
206
local_revision_id, backward)
207
remotes = _enumerate_with_merges(remote_branch, remote_extra,
209
remote_revision_id, backward)
211
# Now that we have unique ancestors, compute just the mainline, and
212
# generate revnos for them.
213
locals = _enumerate_mainline(local_extra, graph, local_revno,
214
local_revision_id, backward)
215
remotes = _enumerate_mainline(remote_extra, graph, remote_revno,
216
remote_revision_id, backward)
217
return locals, remotes
220
def sorted_revisions(revisions, history_map):
221
revisions = [(history_map[r],r) for r in revisions]
added
removed
bzrlib/missing.py
