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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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)
2
A plugin for displaying what revisions are in 'other' but not in local.
4
from bzrlib.ui import ui_factory
5
def iter_log_data(revisions, revision_source, verbose):
6
from bzrlib.diff import compare_trees
7
from bzrlib.tree import EmptyTree
31
# We need the following for backward compatibilty (hopefully
32
# this will be deprecated soon :-/) -- vila 080911
37
revno, rev_id, merge_depth = rev
10
for revno, rev_id in revisions:
38
11
rev = revision_source.get_revision(rev_id)
40
delta = revision_source.get_revision_delta(rev_id)
13
remote_tree = revision_source.revision_tree(rev_id)
14
parent_rev_id = rev.parent_ids[0]
15
if last_rev_id == parent_rev_id:
16
parent_tree = last_tree
18
parent_tree = revision_source.revision_tree(parent_rev_id)
19
revision_tree = revision_source.revision_tree(rev_id)
21
last_tree = revision_tree
22
delta = compare_trees(revision_tree, parent_tree)
43
yield log.LogRevision(rev, revno, merge_depth, delta=delta)
46
def find_unmerged(local_branch, remote_branch, restrict='all',
47
include_merges=False, backward=False,
48
local_revid_range=None, remote_revid_range=None):
49
"""Find revisions from each side that have not been merged.
51
:param local_branch: Compare the history of local_branch
52
:param remote_branch: versus the history of remote_branch, and determine
53
mainline revisions which have not been merged.
54
:param restrict: ('all', 'local', 'remote') If 'all', we will return the
55
unique revisions from both sides. If 'local', we will return None
56
for the remote revisions, similarly if 'remote' we will return None for
58
:param include_merges: Show mainline revisions only if False,
59
all revisions otherwise.
60
:param backward: Show oldest versions first when True, newest versions
62
:param local_revid_range: Revision-id range for filtering local_branch
63
revisions (lower bound, upper bound)
64
:param remote_revid_range: Revision-id range for filtering remote_branch
65
revisions (lower bound, upper bound)
67
:return: A list of [(revno, revision_id)] for the mainline revisions on
25
yield revno, rev, delta
28
def find_unmerged(local_branch, remote_branch):
29
progress = ui_factory.progress_bar()
70
30
local_branch.lock_read()
72
32
remote_branch.lock_read()
74
return _find_unmerged(
75
local_branch, remote_branch, restrict=restrict,
76
include_merges=include_merges, backward=backward,
77
local_revid_range=local_revid_range,
78
remote_revid_range=remote_revid_range)
34
local_rev_history, local_rev_history_map = \
35
_get_history(local_branch, progress, "local", 0)
36
remote_rev_history, remote_rev_history_map = \
37
_get_history(remote_branch, progress, "remote", 1)
38
result = _shortcut(local_rev_history, remote_rev_history)
39
if result is not None:
40
local_extra, remote_extra = result
41
local_extra = sorted_revisions(local_extra,
42
local_rev_history_map)
43
remote_extra = sorted_revisions(remote_extra,
44
remote_rev_history_map)
45
return local_extra, remote_extra
47
local_ancestry = _get_ancestry(local_branch.repository, progress,
48
"local", 2, local_rev_history)
49
remote_ancestry = _get_ancestry(remote_branch.repository, progress,
50
"remote", 3, remote_rev_history)
51
progress.update('pondering', 4, 5)
52
extras = local_ancestry.symmetric_difference(remote_ancestry)
53
local_extra = extras.intersection(set(local_rev_history))
54
remote_extra = extras.intersection(set(remote_rev_history))
55
local_extra = sorted_revisions(local_extra, local_rev_history_map)
56
remote_extra = sorted_revisions(remote_extra,
57
remote_rev_history_map)
80
60
remote_branch.unlock()
82
62
local_branch.unlock()
85
def _enumerate_mainline(ancestry, graph, tip_revno, tip, backward=True):
86
"""Enumerate the mainline revisions for these revisions.
88
:param ancestry: A set of revisions that we care about
89
:param graph: A Graph which lets us find the parents for a revision
90
:param tip_revno: The revision number for the tip revision
91
:param tip: The tip of mainline
92
:param backward: Show oldest versions first when True, newest versions
94
:return: [(revno, revision_id)] for all revisions in ancestry that
95
are left-hand parents from tip, or None if ancestry is None.
99
if not ancestry: #Empty ancestry, no need to do any work
102
# Optionally, we could make 1 call to graph.get_parent_map with all
103
# ancestors. However that will often check many more parents than we
104
# actually need, and the Graph is likely to already have the parents cached
108
cur_revno = tip_revno
109
while cur in ancestry:
110
parent_map = graph.get_parent_map([cur])
111
parents = parent_map.get(cur)
113
break # Ghost, we are done
114
mainline.append((str(cur_revno), cur))
122
def _enumerate_with_merges(branch, ancestry, graph, tip_revno, tip,
124
"""Enumerate the revisions for the ancestry.
126
:param branch: The branch we care about
127
:param ancestry: A set of revisions that we care about
128
:param graph: A Graph which lets us find the parents for a revision
129
:param tip_revno: The revision number for the tip revision
130
:param tip: The tip of the ancsetry
131
:param backward: Show oldest versions first when True, newest versions
133
:return: [(revno, revision_id)] for all revisions in ancestry that
134
are parents from tip, or None if ancestry is None.
138
if not ancestry: #Empty ancestry, no need to do any work
141
merge_sorted_revisions = branch.iter_merge_sorted_revisions()
142
# Now that we got the correct revnos, keep only the relevant
144
merge_sorted_revisions = [
145
# log.reverse_by_depth expects seq_num to be present, but it is
146
# stripped by iter_merge_sorted_revisions()
147
(0, revid, n, d, e) for revid, n, d, e in merge_sorted_revisions
148
if revid in ancestry]
150
merge_sorted_revisions = log.reverse_by_depth(merge_sorted_revisions)
152
for seq, rev_id, merge_depth, revno, end_of_merge in merge_sorted_revisions:
153
revline.append(('.'.join(map(str, revno)), rev_id, merge_depth))
157
def _filter_revs(graph, revs, revid_range):
158
if revid_range is None or revs is None:
160
return [rev for rev in revs
161
if graph.is_between(rev[1], revid_range[0], revid_range[1])]
164
def _find_unmerged(local_branch, remote_branch, restrict,
165
include_merges, backward,
166
local_revid_range=None, remote_revid_range=None):
167
"""See find_unmerged.
169
The branches should already be locked before entering.
171
local_revno, local_revision_id = local_branch.last_revision_info()
172
remote_revno, remote_revision_id = remote_branch.last_revision_info()
173
if local_revno == remote_revno and local_revision_id == remote_revision_id:
174
# A simple shortcut when the tips are at the same point
176
graph = local_branch.repository.get_graph(remote_branch.repository)
177
if restrict == 'remote':
179
remote_extra = graph.find_unique_ancestors(remote_revision_id,
181
elif restrict == 'local':
183
local_extra = graph.find_unique_ancestors(local_revision_id,
184
[remote_revision_id])
186
if restrict != 'all':
187
raise ValueError('param restrict not one of "all", "local",'
188
' "remote": %r' % (restrict,))
189
local_extra, remote_extra = graph.find_difference(local_revision_id,
192
locals = _enumerate_with_merges(local_branch, local_extra,
194
local_revision_id, backward)
195
remotes = _enumerate_with_merges(remote_branch, remote_extra,
197
remote_revision_id, backward)
199
# Now that we have unique ancestors, compute just the mainline, and
200
# generate revnos for them.
201
locals = _enumerate_mainline(local_extra, graph, local_revno,
202
local_revision_id, backward)
203
remotes = _enumerate_mainline(remote_extra, graph, remote_revno,
204
remote_revision_id, backward)
205
return _filter_revs(graph, locals, local_revid_range), _filter_revs(graph,
206
remotes, remote_revid_range)
64
return (local_extra, remote_extra)
66
def _shortcut(local_rev_history, remote_rev_history):
67
local_history = set(local_rev_history)
68
remote_history = set(remote_rev_history)
69
if len(local_rev_history) == 0:
70
return set(), remote_history
71
elif len(remote_rev_history) == 0:
72
return local_history, set()
73
elif local_rev_history[-1] in remote_history:
74
return set(), _after(remote_rev_history, local_rev_history)
75
elif remote_rev_history[-1] in local_history:
76
return _after(local_rev_history, remote_rev_history), set()
80
def _after(larger_history, smaller_history):
81
return set(larger_history[larger_history.index(smaller_history[-1])+1:])
83
def _get_history(branch, progress, label, step):
84
progress.update('%s history' % label, step, 5)
85
rev_history = branch.revision_history()
86
rev_history_map = dict(
87
[(rev, rev_history.index(rev) + 1)
88
for rev in rev_history])
89
return rev_history, rev_history_map
91
def _get_ancestry(repository, progress, label, step, rev_history):
92
progress.update('%s ancestry' % label, step, 5)
93
if len(rev_history) > 0:
94
ancestry = set(repository.get_ancestry(rev_history[-1]))
209
100
def sorted_revisions(revisions, history_map):
210
101
revisions = [(history_map[r],r) for r in revisions]
added
removed
bzrlib/missing.py
