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
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
17
"""Display what revisions are missing in 'other' from 'this' and vice versa."""
19
from bzrlib.log import (
21
repository as _mod_repository,
22
24
import bzrlib.revision as _mod_revision
25
27
def iter_log_revisions(revisions, revision_source, verbose):
26
28
last_tree = revision_source.revision_tree(_mod_revision.NULL_REVISION)
28
for revno, rev_id in revisions:
31
# We need the following for backward compatibilty (hopefully
32
# this will be deprecated soon :-/) -- vila 080911
37
revno, rev_id, merge_depth = rev
29
38
rev = revision_source.get_revision(rev_id)
31
remote_tree = revision_source.revision_tree(rev_id)
32
parent_rev_id = rev.parent_ids[0]
33
if last_rev_id == parent_rev_id:
34
parent_tree = last_tree
36
parent_tree = revision_source.revision_tree(parent_rev_id)
37
revision_tree = revision_source.revision_tree(rev_id)
39
last_tree = revision_tree
40
delta = revision_tree.changes_from(parent_tree)
40
delta = revision_source.get_revision_delta(rev_id)
43
yield LogRevision(rev, revno, delta=delta)
46
def find_unmerged(local_branch, remote_branch, restrict='all'):
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):
47
49
"""Find revisions from each side that have not been merged.
49
51
:param local_branch: Compare the history of local_branch
53
55
unique revisions from both sides. If 'local', we will return None
54
56
for the remote revisions, similarly if 'remote' we will return None for
55
57
the local revisions.
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)
57
67
:return: A list of [(revno, revision_id)] for the mainline revisions on
62
72
remote_branch.lock_read()
64
return _find_unmerged(local_branch,
65
remote_branch, restrict=restrict)
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)
67
80
remote_branch.unlock()
69
82
local_branch.unlock()
72
def _enumerate_mainline(ancestry, graph, tip_revno, tip):
85
def _enumerate_mainline(ancestry, graph, tip_revno, tip, backward=True):
73
86
"""Enumerate the mainline revisions for these revisions.
75
88
:param ancestry: A set of revisions that we care about
76
89
:param graph: A Graph which lets us find the parents for a revision
77
90
:param tip_revno: The revision number for the tip revision
78
91
:param tip: The tip of mainline
92
:param backward: Show oldest versions first when True, newest versions
79
94
:return: [(revno, revision_id)] for all revisions in ancestry that
80
95
are left-hand parents from tip, or None if ancestry is None.
96
111
parents = parent_map.get(cur)
98
113
break # Ghost, we are done
99
mainline.append((cur_revno, cur))
114
mainline.append((str(cur_revno), cur))
106
def _find_unmerged(local_branch, remote_branch, restrict):
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):
107
167
"""See find_unmerged.
109
169
The branches should already be locked before entering.
113
173
if local_revno == remote_revno and local_revision_id == remote_revision_id:
114
174
# A simple shortcut when the tips are at the same point
116
graph = local_branch.repository.get_graph(
117
remote_branch.repository)
176
graph = local_branch.repository.get_graph(remote_branch.repository)
118
177
if restrict == 'remote':
119
178
local_extra = None
120
remote_extra = graph.find_unique_ancestors(
121
remote_revision_id, [local_revision_id])
179
remote_extra = graph.find_unique_ancestors(remote_revision_id,
122
181
elif restrict == 'local':
123
182
remote_extra = None
124
local_extra = graph.find_unique_ancestors(
125
local_revision_id, [remote_revision_id])
183
local_extra = graph.find_unique_ancestors(local_revision_id,
184
[remote_revision_id])
127
186
if restrict != 'all':
128
187
raise ValueError('param restrict not one of "all", "local",'
129
188
' "remote": %r' % (restrict,))
130
local_extra, remote_extra = graph.find_difference(
131
local_revision_id, remote_revision_id)
132
# Now that we have unique ancestors, compute just the mainline, and
133
# generate revnos for them.
134
local_mainline = _enumerate_mainline(local_extra, graph, local_revno,
136
remote_mainline = _enumerate_mainline(remote_extra, graph, remote_revno,
138
return local_mainline, remote_mainline
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)
141
209
def sorted_revisions(revisions, history_map):
added
removed
bzrlib/missing.py
