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."""
23
import bzrlib.revision as _mod_revision
26
def iter_log_revisions(revisions, revision_source, verbose):
27
last_tree = revision_source.revision_tree(_mod_revision.NULL_REVISION)
30
# We need the following for backward compatibilty (hopefully
31
# this will be deprecated soon :-/) -- vila 080911
36
revno, rev_id, merge_depth = rev
37
rev = revision_source.get_revision(rev_id)
3
A plugin for displaying what revisions are in 'other' but not in local.
11
from sets import Set as set
14
def show_missing(br_local, br_remote, verbose=False, quiet=False):
15
"""Show the revisions which exist in br_remote, that
16
do not exist in br_local.
18
from bzrlib.log import show_one_log
20
local_history = br_local.revision_history()
21
remote_history = br_remote.revision_history()
22
if local_history == remote_history:
24
print 'Trees are identical.'
26
if local_history[:len(remote_history)] == remote_history:
27
# Local is not missing anything from remote, so consider it
30
print 'Local tree has all of remote revisions (remote is missing local)'
35
# Check for divergence
36
common_idx = min(len(local_history), len(remote_history)) - 1
37
if common_idx >= 0 and local_history[common_idx] != remote_history[common_idx]:
38
print 'Trees have diverged'
40
local_rev_set = set(local_history)
42
# Find the last common revision between the two trees
44
for revno, (local_rev, remote_rev) in enumerate(zip(local_history, remote_history)):
45
if local_rev != remote_rev:
49
for rno, rev_id in enumerate(remote_history[revno:]):
50
# This assumes that you can have a revision in the
51
# local history, which does not have the same ancestry
52
# as the remote ancestry.
53
# This may or may not be possible.
54
# In the future this should also checked for merged revisions.
55
if rev_id not in local_rev_set:
56
missing_remote.append((rno+revno+1, rev_id))
58
print 'Missing %d revisions' % len(missing_remote)
62
from bzrlib.diff import compare_trees
63
from bzrlib.tree import EmptyTree
69
for revno, rev_id in missing_remote:
70
rev = br_remote.get_revision(rev_id)
39
delta = revision_source.get_revision_delta(rev_id)
72
parent_rev_id = rev.parents[0].revision_id
73
if last_rev_id == parent_rev_id:
74
parent_tree = last_tree
76
parent_tree = br_remote.revision_tree(parent_rev_id)
77
revision_tree = br_remote.revision_tree(rev_id)
79
last_tree = revision_tree
80
delta = compare_trees(revision_tree, parent_tree)
42
yield log.LogRevision(rev, revno, merge_depth, delta=delta)
45
def find_unmerged(local_branch, remote_branch, restrict='all',
46
include_merged=None, backward=False,
47
local_revid_range=None, remote_revid_range=None,
48
include_merges=symbol_versioning.DEPRECATED_PARAMETER):
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_merged: 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)
66
:param include_merges: Deprecated historical alias for include_merged
68
:return: A list of [(revno, revision_id)] for the mainline revisions on
71
if symbol_versioning.deprecated_passed(include_merges):
72
symbol_versioning.warn(
73
'include_merges was deprecated in 2.5.'
74
' Use include_merged instead.',
75
DeprecationWarning, stacklevel=2)
76
if include_merged is None:
77
include_merged = include_merges
78
if include_merged is None:
79
include_merged = False
80
local_branch.lock_read()
82
remote_branch.lock_read()
84
return _find_unmerged(
85
local_branch, remote_branch, restrict=restrict,
86
include_merged=include_merged, backward=backward,
87
local_revid_range=local_revid_range,
88
remote_revid_range=remote_revid_range)
90
remote_branch.unlock()
95
def _enumerate_mainline(ancestry, graph, tip_revno, tip, backward=True):
96
"""Enumerate the mainline revisions for these revisions.
98
:param ancestry: A set of revisions that we care about
99
:param graph: A Graph which lets us find the parents for a revision
100
:param tip_revno: The revision number for the tip revision
101
:param tip: The tip of mainline
102
:param backward: Show oldest versions first when True, newest versions
104
:return: [(revno, revision_id)] for all revisions in ancestry that
105
are left-hand parents from tip, or None if ancestry is None.
109
if not ancestry: #Empty ancestry, no need to do any work
112
# Optionally, we could make 1 call to graph.get_parent_map with all
113
# ancestors. However that will often check many more parents than we
114
# actually need, and the Graph is likely to already have the parents cached
118
cur_revno = tip_revno
119
while cur in ancestry:
120
parent_map = graph.get_parent_map([cur])
121
parents = parent_map.get(cur)
123
break # Ghost, we are done
124
mainline.append((str(cur_revno), cur))
132
def _enumerate_with_merges(branch, ancestry, graph, tip_revno, tip,
134
"""Enumerate the revisions for the ancestry.
136
:param branch: The branch we care about
137
:param ancestry: A set of revisions that we care about
138
:param graph: A Graph which lets us find the parents for a revision
139
:param tip_revno: The revision number for the tip revision
140
:param tip: The tip of the ancsetry
141
:param backward: Show oldest versions first when True, newest versions
143
:return: [(revno, revision_id)] for all revisions in ancestry that
144
are parents from tip, or None if ancestry is None.
148
if not ancestry: #Empty ancestry, no need to do any work
151
merge_sorted_revisions = branch.iter_merge_sorted_revisions()
152
# Now that we got the correct revnos, keep only the relevant
154
merge_sorted_revisions = [
155
# log.reverse_by_depth expects seq_num to be present, but it is
156
# stripped by iter_merge_sorted_revisions()
157
(0, revid, n, d, e) for revid, n, d, e in merge_sorted_revisions
158
if revid in ancestry]
160
merge_sorted_revisions = log.reverse_by_depth(merge_sorted_revisions)
162
for seq, rev_id, merge_depth, revno, end_of_merge in merge_sorted_revisions:
163
revline.append(('.'.join(map(str, revno)), rev_id, merge_depth))
167
def _filter_revs(graph, revs, revid_range):
168
if revid_range is None or revs is None:
170
return [rev for rev in revs
171
if graph.is_between(rev[1], revid_range[0], revid_range[1])]
174
def _find_unmerged(local_branch, remote_branch, restrict,
175
include_merged, backward,
176
local_revid_range=None, remote_revid_range=None):
177
"""See find_unmerged.
179
The branches should already be locked before entering.
181
local_revno, local_revision_id = local_branch.last_revision_info()
182
remote_revno, remote_revision_id = remote_branch.last_revision_info()
183
if local_revno == remote_revno and local_revision_id == remote_revision_id:
184
# A simple shortcut when the tips are at the same point
186
graph = local_branch.repository.get_graph(remote_branch.repository)
187
if restrict == 'remote':
189
remote_extra = graph.find_unique_ancestors(remote_revision_id,
191
elif restrict == 'local':
193
local_extra = graph.find_unique_ancestors(local_revision_id,
194
[remote_revision_id])
196
if restrict != 'all':
197
raise ValueError('param restrict not one of "all", "local",'
198
' "remote": %r' % (restrict,))
199
local_extra, remote_extra = graph.find_difference(local_revision_id,
202
locals = _enumerate_with_merges(local_branch, local_extra,
204
local_revision_id, backward)
205
remotes = _enumerate_with_merges(remote_branch, remote_extra,
207
remote_revision_id, backward)
209
# Now that we have unique ancestors, compute just the mainline, and
210
# generate revnos for them.
211
locals = _enumerate_mainline(local_extra, graph, local_revno,
212
local_revision_id, backward)
213
remotes = _enumerate_mainline(remote_extra, graph, remote_revno,
214
remote_revision_id, backward)
215
return _filter_revs(graph, locals, local_revid_range), _filter_revs(graph,
216
remotes, remote_revid_range)
219
def sorted_revisions(revisions, history_map):
220
revisions = [(history_map[r],r) for r in revisions]
84
show_one_log(revno, rev, delta, verbose, sys.stdout, 'original')
added
removed
bzrlib/missing.py
