191
203
# list indexes are 0-based; revisions are 1-based
192
204
cut_revs = which_revs[(start_revision-1):(end_revision)]
196
# convert the revision history to a dictionary:
197
rev_nos = dict((k, v) for v, k in cut_revs)
199
# override the mainline to look like the revision history.
200
mainline_revs = [revision_id for index, revision_id in cut_revs]
201
if cut_revs[0][0] == 1:
202
mainline_revs.insert(0, None)
204
mainline_revs.insert(0, which_revs[start_revision-2][1])
205
if getattr(lf, 'show_merge', None) is not None:
206
include_merges = True
208
include_merges = False
209
view_revisions = list(get_view_revisions(mainline_revs, rev_nos, branch,
210
direction, include_merges=include_merges))
212
def iter_revisions():
213
# r = revision, n = revno, d = merge depth
214
revision_ids = [r for r, n, d in view_revisions]
215
zeros = set(r for r, n, d in view_revisions if d == 0)
217
repository = branch.repository
220
revisions = repository.get_revisions(revision_ids[:num])
221
if verbose or specific_fileid:
222
delta_revisions = [r for r in revisions if
223
r.revision_id in zeros]
224
deltas = repository.get_deltas_for_revisions(delta_revisions)
225
cur_deltas = dict(izip((r.revision_id for r in
226
delta_revisions), deltas))
227
for revision in revisions:
228
# The delta value will be None unless
229
# 1. verbose or specific_fileid is specified, and
230
# 2. the revision is a mainline revision
231
yield revision, cur_deltas.get(revision.revision_id)
232
revision_ids = revision_ids[num:]
206
if direction == 'reverse':
208
elif direction == 'forward':
211
raise ValueError('invalid direction %r' % direction)
213
revision_history = branch.revision_history()
214
for revno, rev_id in cut_revs:
215
if verbose or specific_fileid:
216
delta = _get_revision_delta(branch, revno)
235
# now we just print all the revisions
236
for ((rev_id, revno, merge_depth), (rev, delta)) in \
237
izip(view_revisions, iter_revisions()):
219
if not delta.touches_file_id(specific_fileid):
223
# although we calculated it, throw it away without display
226
rev = branch.repository.get_revision(rev_id)
240
229
if not searchRE.search(rev.message):
244
# a mainline revision.
247
if not delta.touches_file_id(specific_fileid):
232
lf.show(revno, rev, delta)
233
if hasattr(lf, 'show_merge'):
237
# revno is 1 based, so -2 to get back 1 less.
238
repository = branch.repository
239
excludes = repository.get_ancestry(revision_history[revno - 2])
240
excludes = set(excludes)
241
pending = list(rev.parent_ids)
243
rev_id = pending.pop()
244
if rev_id in excludes:
246
# prevent showing merged revs twice if they multi-path.
249
rev = branch.repository.get_revision(rev_id)
250
except errors.NoSuchRevision:
252
pending.extend(rev.parent_ids)
256
def deltas_for_log_dummy(branch, which_revs):
257
"""Return all the revisions without intermediate deltas.
259
Useful for log commands that won't need the delta information.
251
# although we calculated it, throw it away without display
254
lf.show(revno, rev, delta)
256
lf.show_merge(rev, merge_depth)
259
def get_view_revisions(mainline_revs, rev_nos, branch, direction,
260
include_merges=True):
261
"""Produce an iterator of revisions to show
262
:return: an iterator of (revision_id, revno, merge_depth)
263
(if there is no revno for a revision, None is supplied)
265
if include_merges is False:
266
revision_ids = mainline_revs[1:]
267
if direction == 'reverse':
268
revision_ids.reverse()
269
for revision_id in revision_ids:
270
yield revision_id, rev_nos[revision_id], 0
272
merge_sorted_revisions = merge_sort(
273
branch.repository.get_revision_graph(mainline_revs[-1]),
277
if direction == 'forward':
278
# forward means oldest first.
279
merge_sorted_revisions = reverse_by_depth(merge_sorted_revisions)
280
elif direction != 'reverse':
281
raise ValueError('invalid direction %r' % direction)
283
revision_history = branch.revision_history()
285
for sequence, rev_id, merge_depth, end_of_merge in merge_sorted_revisions:
286
yield rev_id, rev_nos.get(rev_id), merge_depth
289
def reverse_by_depth(merge_sorted_revisions, _depth=0):
290
"""Reverse revisions by depth.
292
Revisions with a different depth are sorted as a group with the previous
293
revision of that depth. There may be no topological justification for this,
294
but it looks much nicer.
297
for val in merge_sorted_revisions:
299
zd_revisions.append([val])
301
assert val[2] > _depth
302
zd_revisions[-1].append(val)
303
for revisions in zd_revisions:
304
if len(revisions) > 1:
305
revisions[1:] = reverse_by_depth(revisions[1:], _depth + 1)
306
zd_revisions.reverse()
308
for chunk in zd_revisions:
262
for revno, revision_id in which_revs:
263
yield revno, branch.get_revision(revision_id), None
266
def deltas_for_log_reverse(branch, which_revs):
267
"""Compute deltas for display in latest-to-earliest order.
273
Sequence of (revno, revision_id) for the subset of history to examine
276
Sequence of (revno, rev, delta)
278
The delta is from the given revision to the next one in the
279
sequence, which makes sense if the log is being displayed from
282
last_revno = last_revision_id = last_tree = None
283
for revno, revision_id in which_revs:
284
this_tree = branch.revision_tree(revision_id)
285
this_revision = branch.get_revision(revision_id)
288
yield last_revno, last_revision, compare_trees(this_tree, last_tree, False)
290
this_tree = EmptyTree(branch.get_root_id())
293
last_revision = this_revision
294
last_tree = this_tree
298
this_tree = EmptyTree(branch.get_root_id())
300
this_revno = last_revno - 1
301
this_revision_id = branch.revision_history()[this_revno]
302
this_tree = branch.revision_tree(this_revision_id)
303
yield last_revno, last_revision, compare_trees(this_tree, last_tree, False)
306
def deltas_for_log_forward(branch, which_revs):
307
"""Compute deltas for display in forward log.
309
Given a sequence of (revno, revision_id) pairs, return
312
The delta is from the given revision to the next one in the
313
sequence, which makes sense if the log is being displayed from
316
last_revno = last_revision_id = last_tree = None
317
prev_tree = EmptyTree(branch.get_root_id())
319
for revno, revision_id in which_revs:
320
this_tree = branch.revision_tree(revision_id)
321
this_revision = branch.get_revision(revision_id)
325
last_tree = EmptyTree(branch.get_root_id())
327
last_revno = revno - 1
328
last_revision_id = branch.revision_history()[last_revno]
329
last_tree = branch.revision_tree(last_revision_id)
331
yield revno, this_revision, compare_trees(last_tree, this_tree, False)
334
last_revision = this_revision
335
last_tree = this_tree
313
338
class LogFormatter(object):
314
339
"""Abstract class to display log messages."""
316
340
def __init__(self, to_file, show_ids=False, show_timezone='original'):
317
341
self.to_file = to_file
318
342
self.show_ids = show_ids
319
343
self.show_timezone = show_timezone
321
346
def show(self, revno, rev, delta):
322
347
raise NotImplementedError('not implemented in abstract base')
414
438
return rev.message
416
440
def show(self, revno, rev, delta):
417
from bzrlib.osutils import terminal_width
418
print >> self.to_file, self.log_string(revno, rev, terminal_width()-1)
441
print >> self.to_file, self.log_string(rev, 79)
420
def log_string(self, revno, rev, max_chars):
421
"""Format log info into one string. Truncate tail of string
422
:param revno: revision number (int) or None.
423
Revision numbers counts from 1.
424
:param rev: revision info object
425
:param max_chars: maximum length of resulting string
426
:return: formatted truncated string
430
# show revno only when is not None
431
out.append("%d:" % revno)
432
out.append(self.truncate(self.short_committer(rev), 20))
443
def log_string(self, rev, max_chars):
444
out = [self.truncate(self.short_committer(rev), 20)]
433
445
out.append(self.date_string(rev))
434
out.append(rev.get_summary())
446
out.append(self.message(rev).replace('\n', ' '))
435
447
return self.truncate(" ".join(out).rstrip('\n'), max_chars)
438
449
def line_log(rev, max_chars):
439
450
lf = LineLogFormatter(None)
440
return lf.log_string(None, rev, max_chars)
451
return lf.log_string(rev, max_chars)
443
454
'long': LongLogFormatter,