1
# Copyright (C) 2005, 2006, 2007, 2009 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
19
"""Code to show logs of changes.
21
Various flavors of log can be produced:
23
* for one file, or the whole tree, and (not done yet) for
24
files in a given directory
26
* in "verbose" mode with a description of what changed from one
29
* with file-ids and revision-ids shown
31
Logs are actually written out through an abstract LogFormatter
32
interface, which allows for different preferred formats. Plugins can
35
Logs can be produced in either forward (oldest->newest) or reverse
36
(newest->oldest) order.
38
Logs can be filtered to show only revisions matching a particular
39
search string, or within a particular range of revisions. The range
40
can be given as date/times, which are reduced to revisions before
43
In verbose mode we show a summary of what changed in each particular
44
revision. Note that this is the delta for changes in that revision
45
relative to its left-most parent, not the delta relative to the last
46
logged revision. So for example if you ask for a verbose log of
47
changes touching hello.c you will get a list of those revisions also
48
listing other things that were changed in the same revision, but not
49
all the changes since the previous revision that touched hello.c.
53
from cStringIO import StringIO
54
from itertools import (
60
from warnings import (
64
from bzrlib.lazy_import import lazy_import
65
lazy_import(globals(), """
71
repository as _mod_repository,
72
revision as _mod_revision,
82
from bzrlib.osutils import (
84
get_terminal_encoding,
90
def find_touching_revisions(branch, file_id):
91
"""Yield a description of revisions which affect the file_id.
93
Each returned element is (revno, revision_id, description)
95
This is the list of revisions where the file is either added,
96
modified, renamed or deleted.
98
TODO: Perhaps some way to limit this to only particular revisions,
99
or to traverse a non-mainline set of revisions?
104
for revision_id in branch.revision_history():
105
this_inv = branch.repository.get_revision_inventory(revision_id)
106
if file_id in this_inv:
107
this_ie = this_inv[file_id]
108
this_path = this_inv.id2path(file_id)
110
this_ie = this_path = None
112
# now we know how it was last time, and how it is in this revision.
113
# are those two states effectively the same or not?
115
if not this_ie and not last_ie:
116
# not present in either
118
elif this_ie and not last_ie:
119
yield revno, revision_id, "added " + this_path
120
elif not this_ie and last_ie:
122
yield revno, revision_id, "deleted " + last_path
123
elif this_path != last_path:
124
yield revno, revision_id, ("renamed %s => %s" % (last_path, this_path))
125
elif (this_ie.text_size != last_ie.text_size
126
or this_ie.text_sha1 != last_ie.text_sha1):
127
yield revno, revision_id, "modified " + this_path
130
last_path = this_path
134
def _enumerate_history(branch):
137
for rev_id in branch.revision_history():
138
rh.append((revno, rev_id))
145
specific_fileid=None,
153
"""Write out human-readable log of commits to this branch.
155
:param lf: The LogFormatter object showing the output.
157
:param specific_fileid: If not None, list only the commits affecting the
158
specified file, rather than all commits.
160
:param verbose: If True show added/changed/deleted/renamed files.
162
:param direction: 'reverse' (default) is latest to earliest; 'forward' is
165
:param start_revision: If not None, only show revisions >= start_revision
167
:param end_revision: If not None, only show revisions <= end_revision
169
:param search: If not None, only show revisions with matching commit
172
:param limit: If set, shows only 'limit' revisions, all revisions are shown
175
:param show_diff: If True, output a diff after each revision.
179
if getattr(lf, 'begin_log', None):
182
_show_log(branch, lf, specific_fileid, verbose, direction,
183
start_revision, end_revision, search, limit, show_diff)
185
if getattr(lf, 'end_log', None):
191
def _show_log(branch,
193
specific_fileid=None,
201
"""Worker function for show_log - see show_log."""
202
if not isinstance(lf, LogFormatter):
203
warn("not a LogFormatter instance: %r" % lf)
205
trace.mutter('get log for file_id %r', specific_fileid)
207
# Consult the LogFormatter about what it needs and can handle
208
levels_to_display = lf.get_levels()
209
generate_merge_revisions = levels_to_display != 1
210
allow_single_merge_revision = True
211
if not getattr(lf, 'supports_merge_revisions', False):
212
allow_single_merge_revision = getattr(lf,
213
'supports_single_merge_revision', False)
214
generate_tags = getattr(lf, 'supports_tags', False)
215
if generate_tags and branch.supports_tags():
216
rev_tag_dict = branch.tags.get_reverse_tag_dict()
219
generate_delta = verbose and getattr(lf, 'supports_delta', False)
220
generate_diff = show_diff and getattr(lf, 'supports_diff', False)
222
# Find and print the interesting revisions
223
repo = branch.repository
225
revision_iterator = _create_log_revision_iterator(branch,
226
start_revision, end_revision, direction, specific_fileid, search,
227
generate_merge_revisions, allow_single_merge_revision,
228
generate_delta, limited_output=limit > 0)
229
for revs in revision_iterator:
230
for (rev_id, revno, merge_depth), rev, delta in revs:
231
# Note: 0 levels means show everything; merge_depth counts from 0
232
if levels_to_display != 0 and merge_depth >= levels_to_display:
235
diff = _format_diff(repo, rev, rev_id, specific_fileid)
238
lr = LogRevision(rev, revno, merge_depth, delta,
239
rev_tag_dict.get(rev_id), diff)
243
if log_count >= limit:
247
def _format_diff(repo, rev, rev_id, specific_fileid):
248
if len(rev.parent_ids) == 0:
249
ancestor_id = _mod_revision.NULL_REVISION
251
ancestor_id = rev.parent_ids[0]
252
tree_1 = repo.revision_tree(ancestor_id)
253
tree_2 = repo.revision_tree(rev_id)
255
specific_files = [tree_2.id2path(specific_fileid)]
257
specific_files = None
259
diff.show_diff_trees(tree_1, tree_2, s, specific_files, old_label='',
264
class _StartNotLinearAncestor(Exception):
265
"""Raised when a start revision is not found walking left-hand history."""
268
def _create_log_revision_iterator(branch, start_revision, end_revision,
269
direction, specific_fileid, search, generate_merge_revisions,
270
allow_single_merge_revision, generate_delta, limited_output=False):
271
"""Create a revision iterator for log.
273
:param branch: The branch being logged.
274
:param start_revision: If not None, only show revisions >= start_revision
275
:param end_revision: If not None, only show revisions <= end_revision
276
:param direction: 'reverse' (default) is latest to earliest; 'forward' is
278
:param specific_fileid: If not None, list only the commits affecting the
280
:param search: If not None, only show revisions with matching commit
282
:param generate_merge_revisions: If False, show only mainline revisions.
283
:param allow_single_merge_revision: If True, logging of a single
284
revision off the mainline is to be allowed
285
:param generate_delta: Whether to generate a delta for each revision.
286
:param limited_output: if True, the user only wants a limited result
288
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
291
start_rev_id, end_rev_id = _get_revision_limits(branch, start_revision,
294
# Decide how file-ids are matched: delta-filtering vs per-file graph.
295
# Delta filtering allows revisions to be displayed incrementally
296
# though the total time is much slower for huge repositories: log -v
297
# is the *lower* performance bound. At least until the split
298
# inventory format arrives, per-file-graph needs to remain the
299
# default except in verbose mode. Delta filtering should give more
300
# accurate results (e.g. inclusion of FILE deletions) so arguably
301
# it should always be used in the future.
302
use_deltas_for_matching = specific_fileid and generate_delta
303
delayed_graph_generation = not specific_fileid and (
304
start_rev_id or end_rev_id or limited_output)
305
generate_merges = generate_merge_revisions or (specific_fileid and
306
not use_deltas_for_matching)
307
view_revisions = _calc_view_revisions(branch, start_rev_id, end_rev_id,
308
direction, generate_merges, allow_single_merge_revision,
309
delayed_graph_generation=delayed_graph_generation)
310
search_deltas_for_fileids = None
311
if use_deltas_for_matching:
312
search_deltas_for_fileids = set([specific_fileid])
313
elif specific_fileid:
314
if not isinstance(view_revisions, list):
315
view_revisions = list(view_revisions)
316
view_revisions = _filter_revisions_touching_file_id(branch,
317
specific_fileid, view_revisions,
318
include_merges=generate_merge_revisions)
319
return make_log_rev_iterator(branch, view_revisions, generate_delta,
320
search, file_ids=search_deltas_for_fileids, direction=direction)
323
def _calc_view_revisions(branch, start_rev_id, end_rev_id, direction,
324
generate_merge_revisions, allow_single_merge_revision,
325
delayed_graph_generation=False):
326
"""Calculate the revisions to view.
328
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples OR
329
a list of the same tuples.
331
br_revno, br_rev_id = branch.last_revision_info()
335
# If a single revision is requested, check we can handle it
336
generate_single_revision = (end_rev_id and start_rev_id == end_rev_id and
337
(not generate_merge_revisions or not _has_merges(branch, end_rev_id)))
338
if generate_single_revision:
339
if end_rev_id == br_rev_id:
341
return [(br_rev_id, br_revno, 0)]
343
revno = branch.revision_id_to_dotted_revno(end_rev_id)
344
if len(revno) > 1 and not allow_single_merge_revision:
345
# It's a merge revision and the log formatter is
346
# completely brain dead. This "feature" of allowing
347
# log formatters incapable of displaying dotted revnos
348
# ought to be deprecated IMNSHO. IGC 20091022
349
raise errors.BzrCommandError('Selected log formatter only'
350
' supports mainline revisions.')
351
revno_str = '.'.join(str(n) for n in revno)
352
return [(end_rev_id, revno_str, 0)]
354
# If we only want to see linear revisions, we can iterate ...
355
if not generate_merge_revisions:
356
result = _linear_view_revisions(branch, start_rev_id, end_rev_id)
357
# If a start limit was given and it's not obviously an
358
# ancestor of the end limit, check it before outputting anything
359
if direction == 'forward' or (start_rev_id
360
and not _is_obvious_ancestor(branch, start_rev_id, end_rev_id)):
362
result = list(result)
363
except _StartNotLinearAncestor:
364
raise errors.BzrCommandError('Start revision not found in'
365
' left-hand history of end revision.')
366
if direction == 'forward':
367
result = reversed(list(result))
370
# On large trees, generating the merge graph can take 30-60 seconds
371
# so we delay doing it until a merge is detected, incrementally
372
# returning initial (non-merge) revisions while we can.
373
initial_revisions = []
374
if delayed_graph_generation:
376
for rev_id, revno, depth in \
377
_linear_view_revisions(branch, start_rev_id, end_rev_id):
378
if _has_merges(branch, rev_id):
382
initial_revisions.append((rev_id, revno, depth))
384
# No merged revisions found
385
if direction == 'reverse':
386
return initial_revisions
387
elif direction == 'forward':
388
return reversed(initial_revisions)
390
raise ValueError('invalid direction %r' % direction)
391
except _StartNotLinearAncestor:
392
# A merge was never detected so the lower revision limit can't
393
# be nested down somewhere
394
raise errors.BzrCommandError('Start revision not found in'
395
' history of end revision.')
397
# A log including nested merges is required. If the direction is reverse,
398
# we rebase the initial merge depths so that the development line is
399
# shown naturally, i.e. just like it is for linear logging. We can easily
400
# make forward the exact opposite display, but showing the merge revisions
401
# indented at the end seems slightly nicer in that case.
402
view_revisions = chain(iter(initial_revisions),
403
_graph_view_revisions(branch, start_rev_id, end_rev_id,
404
rebase_initial_depths=direction == 'reverse'))
405
if direction == 'reverse':
406
return view_revisions
407
elif direction == 'forward':
408
# Forward means oldest first, adjusting for depth.
409
view_revisions = reverse_by_depth(list(view_revisions))
410
return _rebase_merge_depth(view_revisions)
412
raise ValueError('invalid direction %r' % direction)
415
def _has_merges(branch, rev_id):
416
"""Does a revision have multiple parents or not?"""
417
parents = branch.repository.get_parent_map([rev_id]).get(rev_id, [])
418
return len(parents) > 1
421
def _is_obvious_ancestor(branch, start_rev_id, end_rev_id):
422
"""Is start_rev_id an obvious ancestor of end_rev_id?"""
423
if start_rev_id and end_rev_id:
424
start_dotted = branch.revision_id_to_dotted_revno(start_rev_id)
425
end_dotted = branch.revision_id_to_dotted_revno(end_rev_id)
426
if len(start_dotted) == 1 and len(end_dotted) == 1:
428
return start_dotted[0] <= end_dotted[0]
429
elif (len(start_dotted) == 3 and len(end_dotted) == 3 and
430
start_dotted[0:1] == end_dotted[0:1]):
431
# both on same development line
432
return start_dotted[2] <= end_dotted[2]
439
def _linear_view_revisions(branch, start_rev_id, end_rev_id):
440
"""Calculate a sequence of revisions to view, newest to oldest.
442
:param start_rev_id: the lower revision-id
443
:param end_rev_id: the upper revision-id
444
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples.
445
:raises _StartNotLinearAncestor: if a start_rev_id is specified but
446
is not found walking the left-hand history
448
br_revno, br_rev_id = branch.last_revision_info()
449
repo = branch.repository
450
if start_rev_id is None and end_rev_id is None:
452
for revision_id in repo.iter_reverse_revision_history(br_rev_id):
453
yield revision_id, str(cur_revno), 0
456
if end_rev_id is None:
457
end_rev_id = br_rev_id
458
found_start = start_rev_id is None
459
for revision_id in repo.iter_reverse_revision_history(end_rev_id):
460
revno = branch.revision_id_to_dotted_revno(revision_id)
461
revno_str = '.'.join(str(n) for n in revno)
462
if not found_start and revision_id == start_rev_id:
463
yield revision_id, revno_str, 0
467
yield revision_id, revno_str, 0
470
raise _StartNotLinearAncestor()
473
def _graph_view_revisions(branch, start_rev_id, end_rev_id,
474
rebase_initial_depths=True):
475
"""Calculate revisions to view including merges, newest to oldest.
477
:param branch: the branch
478
:param start_rev_id: the lower revision-id
479
:param end_rev_id: the upper revision-id
480
:param rebase_initial_depth: should depths be rebased until a mainline
482
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples.
484
view_revisions = branch.iter_merge_sorted_revisions(
485
start_revision_id=end_rev_id, stop_revision_id=start_rev_id,
486
stop_rule="with-merges")
487
if not rebase_initial_depths:
488
for (rev_id, merge_depth, revno, end_of_merge
490
yield rev_id, '.'.join(map(str, revno)), merge_depth
492
# We're following a development line starting at a merged revision.
493
# We need to adjust depths down by the initial depth until we find
494
# a depth less than it. Then we use that depth as the adjustment.
495
# If and when we reach the mainline, depth adjustment ends.
496
depth_adjustment = None
497
for (rev_id, merge_depth, revno, end_of_merge
499
if depth_adjustment is None:
500
depth_adjustment = merge_depth
502
if merge_depth < depth_adjustment:
503
depth_adjustment = merge_depth
504
merge_depth -= depth_adjustment
505
yield rev_id, '.'.join(map(str, revno)), merge_depth
508
def calculate_view_revisions(branch, start_revision, end_revision, direction,
509
specific_fileid, generate_merge_revisions, allow_single_merge_revision):
510
"""Calculate the revisions to view.
512
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples OR
513
a list of the same tuples.
515
# This method is no longer called by the main code path.
516
# It is retained for API compatibility and may be deprecated
518
start_rev_id, end_rev_id = _get_revision_limits(branch, start_revision,
520
view_revisions = list(_calc_view_revisions(branch, start_rev_id, end_rev_id,
521
direction, generate_merge_revisions or specific_fileid,
522
allow_single_merge_revision))
524
view_revisions = _filter_revisions_touching_file_id(branch,
525
specific_fileid, view_revisions,
526
include_merges=generate_merge_revisions)
527
return _rebase_merge_depth(view_revisions)
530
def _rebase_merge_depth(view_revisions):
531
"""Adjust depths upwards so the top level is 0."""
532
# If either the first or last revision have a merge_depth of 0, we're done
533
if view_revisions and view_revisions[0][2] and view_revisions[-1][2]:
534
min_depth = min([d for r,n,d in view_revisions])
536
view_revisions = [(r,n,d-min_depth) for r,n,d in view_revisions]
537
return view_revisions
540
def make_log_rev_iterator(branch, view_revisions, generate_delta, search,
541
file_ids=None, direction='reverse'):
542
"""Create a revision iterator for log.
544
:param branch: The branch being logged.
545
:param view_revisions: The revisions being viewed.
546
:param generate_delta: Whether to generate a delta for each revision.
547
:param search: A user text search string.
548
:param file_ids: If non empty, only revisions matching one or more of
549
the file-ids are to be kept.
550
:param direction: the direction in which view_revisions is sorted
551
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
554
# Convert view_revisions into (view, None, None) groups to fit with
555
# the standard interface here.
556
if type(view_revisions) == list:
557
# A single batch conversion is faster than many incremental ones.
558
# As we have all the data, do a batch conversion.
559
nones = [None] * len(view_revisions)
560
log_rev_iterator = iter([zip(view_revisions, nones, nones)])
563
for view in view_revisions:
564
yield (view, None, None)
565
log_rev_iterator = iter([_convert()])
566
for adapter in log_adapters:
567
# It would be nicer if log adapters were first class objects
568
# with custom parameters. This will do for now. IGC 20090127
569
if adapter == _make_delta_filter:
570
log_rev_iterator = adapter(branch, generate_delta,
571
search, log_rev_iterator, file_ids, direction)
573
log_rev_iterator = adapter(branch, generate_delta,
574
search, log_rev_iterator)
575
return log_rev_iterator
578
def _make_search_filter(branch, generate_delta, search, log_rev_iterator):
579
"""Create a filtered iterator of log_rev_iterator matching on a regex.
581
:param branch: The branch being logged.
582
:param generate_delta: Whether to generate a delta for each revision.
583
:param search: A user text search string.
584
:param log_rev_iterator: An input iterator containing all revisions that
585
could be displayed, in lists.
586
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
590
return log_rev_iterator
591
searchRE = re_compile_checked(search, re.IGNORECASE,
592
'log message filter')
593
return _filter_message_re(searchRE, log_rev_iterator)
596
def _filter_message_re(searchRE, log_rev_iterator):
597
for revs in log_rev_iterator:
599
for (rev_id, revno, merge_depth), rev, delta in revs:
600
if searchRE.search(rev.message):
601
new_revs.append(((rev_id, revno, merge_depth), rev, delta))
605
def _make_delta_filter(branch, generate_delta, search, log_rev_iterator,
606
fileids=None, direction='reverse'):
607
"""Add revision deltas to a log iterator if needed.
609
:param branch: The branch being logged.
610
:param generate_delta: Whether to generate a delta for each revision.
611
:param search: A user text search string.
612
:param log_rev_iterator: An input iterator containing all revisions that
613
could be displayed, in lists.
614
:param fileids: If non empty, only revisions matching one or more of
615
the file-ids are to be kept.
616
:param direction: the direction in which view_revisions is sorted
617
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
620
if not generate_delta and not fileids:
621
return log_rev_iterator
622
return _generate_deltas(branch.repository, log_rev_iterator,
623
generate_delta, fileids, direction)
626
def _generate_deltas(repository, log_rev_iterator, always_delta, fileids,
628
"""Create deltas for each batch of revisions in log_rev_iterator.
630
If we're only generating deltas for the sake of filtering against
631
file-ids, we stop generating deltas once all file-ids reach the
632
appropriate life-cycle point. If we're receiving data newest to
633
oldest, then that life-cycle point is 'add', otherwise it's 'remove'.
635
check_fileids = fileids is not None and len(fileids) > 0
637
fileid_set = set(fileids)
638
if direction == 'reverse':
644
for revs in log_rev_iterator:
645
# If we were matching against fileids and we've run out,
646
# there's nothing left to do
647
if check_fileids and not fileid_set:
649
revisions = [rev[1] for rev in revs]
650
deltas = repository.get_deltas_for_revisions(revisions)
652
for rev, delta in izip(revs, deltas):
654
if not _delta_matches_fileids(delta, fileid_set, stop_on):
656
elif not always_delta:
657
# Delta was created just for matching - ditch it
658
# Note: It would probably be a better UI to return
659
# a delta filtered by the file-ids, rather than
660
# None at all. That functional enhancement can
663
new_revs.append((rev[0], rev[1], delta))
667
def _delta_matches_fileids(delta, fileids, stop_on='add'):
668
"""Check is a delta matches one of more file-ids.
670
:param fileids: a set of fileids to match against.
671
:param stop_on: either 'add' or 'remove' - take file-ids out of the
672
fileids set once their add or remove entry is detected respectively
677
for item in delta.added:
678
if item[1] in fileids:
680
fileids.remove(item[1])
682
for item in delta.removed:
683
if item[1] in fileids:
684
if stop_on == 'delete':
685
fileids.remove(item[1])
689
for l in (delta.modified, delta.renamed, delta.kind_changed):
691
if item[1] in fileids:
696
def _make_revision_objects(branch, generate_delta, search, log_rev_iterator):
697
"""Extract revision objects from the repository
699
:param branch: The branch being logged.
700
:param generate_delta: Whether to generate a delta for each revision.
701
:param search: A user text search string.
702
:param log_rev_iterator: An input iterator containing all revisions that
703
could be displayed, in lists.
704
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
707
repository = branch.repository
708
for revs in log_rev_iterator:
709
# r = revision_id, n = revno, d = merge depth
710
revision_ids = [view[0] for view, _, _ in revs]
711
revisions = repository.get_revisions(revision_ids)
712
revs = [(rev[0], revision, rev[2]) for rev, revision in
713
izip(revs, revisions)]
717
def _make_batch_filter(branch, generate_delta, search, log_rev_iterator):
718
"""Group up a single large batch into smaller ones.
720
:param branch: The branch being logged.
721
:param generate_delta: Whether to generate a delta for each revision.
722
:param search: A user text search string.
723
:param log_rev_iterator: An input iterator containing all revisions that
724
could be displayed, in lists.
725
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
728
repository = branch.repository
730
for batch in log_rev_iterator:
733
step = [detail for _, detail in zip(range(num), batch)]
737
num = min(int(num * 1.5), 200)
740
def _get_revision_limits(branch, start_revision, end_revision):
741
"""Get and check revision limits.
743
:param branch: The branch containing the revisions.
745
:param start_revision: The first revision to be logged.
746
For backwards compatibility this may be a mainline integer revno,
747
but for merge revision support a RevisionInfo is expected.
749
:param end_revision: The last revision to be logged.
750
For backwards compatibility this may be a mainline integer revno,
751
but for merge revision support a RevisionInfo is expected.
753
:return: (start_rev_id, end_rev_id) tuple.
755
branch_revno, branch_rev_id = branch.last_revision_info()
757
if start_revision is None:
760
if isinstance(start_revision, revisionspec.RevisionInfo):
761
start_rev_id = start_revision.rev_id
762
start_revno = start_revision.revno or 1
764
branch.check_real_revno(start_revision)
765
start_revno = start_revision
766
start_rev_id = branch.get_rev_id(start_revno)
769
if end_revision is None:
770
end_revno = branch_revno
772
if isinstance(end_revision, revisionspec.RevisionInfo):
773
end_rev_id = end_revision.rev_id
774
end_revno = end_revision.revno or branch_revno
776
branch.check_real_revno(end_revision)
777
end_revno = end_revision
778
end_rev_id = branch.get_rev_id(end_revno)
780
if branch_revno != 0:
781
if (start_rev_id == _mod_revision.NULL_REVISION
782
or end_rev_id == _mod_revision.NULL_REVISION):
783
raise errors.BzrCommandError('Logging revision 0 is invalid.')
784
if start_revno > end_revno:
785
raise errors.BzrCommandError("Start revision must be older than "
787
return (start_rev_id, end_rev_id)
790
def _get_mainline_revs(branch, start_revision, end_revision):
791
"""Get the mainline revisions from the branch.
793
Generates the list of mainline revisions for the branch.
795
:param branch: The branch containing the revisions.
797
:param start_revision: The first revision to be logged.
798
For backwards compatibility this may be a mainline integer revno,
799
but for merge revision support a RevisionInfo is expected.
801
:param end_revision: The last revision to be logged.
802
For backwards compatibility this may be a mainline integer revno,
803
but for merge revision support a RevisionInfo is expected.
805
:return: A (mainline_revs, rev_nos, start_rev_id, end_rev_id) tuple.
807
branch_revno, branch_last_revision = branch.last_revision_info()
808
if branch_revno == 0:
809
return None, None, None, None
811
# For mainline generation, map start_revision and end_revision to
812
# mainline revnos. If the revision is not on the mainline choose the
813
# appropriate extreme of the mainline instead - the extra will be
815
# Also map the revisions to rev_ids, to be used in the later filtering
818
if start_revision is None:
821
if isinstance(start_revision, revisionspec.RevisionInfo):
822
start_rev_id = start_revision.rev_id
823
start_revno = start_revision.revno or 1
825
branch.check_real_revno(start_revision)
826
start_revno = start_revision
829
if end_revision is None:
830
end_revno = branch_revno
832
if isinstance(end_revision, revisionspec.RevisionInfo):
833
end_rev_id = end_revision.rev_id
834
end_revno = end_revision.revno or branch_revno
836
branch.check_real_revno(end_revision)
837
end_revno = end_revision
839
if ((start_rev_id == _mod_revision.NULL_REVISION)
840
or (end_rev_id == _mod_revision.NULL_REVISION)):
841
raise errors.BzrCommandError('Logging revision 0 is invalid.')
842
if start_revno > end_revno:
843
raise errors.BzrCommandError("Start revision must be older than "
846
if end_revno < start_revno:
847
return None, None, None, None
848
cur_revno = branch_revno
851
for revision_id in branch.repository.iter_reverse_revision_history(
852
branch_last_revision):
853
if cur_revno < start_revno:
854
# We have gone far enough, but we always add 1 more revision
855
rev_nos[revision_id] = cur_revno
856
mainline_revs.append(revision_id)
858
if cur_revno <= end_revno:
859
rev_nos[revision_id] = cur_revno
860
mainline_revs.append(revision_id)
863
# We walked off the edge of all revisions, so we add a 'None' marker
864
mainline_revs.append(None)
866
mainline_revs.reverse()
868
# override the mainline to look like the revision history.
869
return mainline_revs, rev_nos, start_rev_id, end_rev_id
872
def _filter_revision_range(view_revisions, start_rev_id, end_rev_id):
873
"""Filter view_revisions based on revision ranges.
875
:param view_revisions: A list of (revision_id, dotted_revno, merge_depth)
876
tuples to be filtered.
878
:param start_rev_id: If not NONE specifies the first revision to be logged.
879
If NONE then all revisions up to the end_rev_id are logged.
881
:param end_rev_id: If not NONE specifies the last revision to be logged.
882
If NONE then all revisions up to the end of the log are logged.
884
:return: The filtered view_revisions.
886
# This method is no longer called by the main code path.
887
# It may be removed soon. IGC 20090127
888
if start_rev_id or end_rev_id:
889
revision_ids = [r for r, n, d in view_revisions]
891
start_index = revision_ids.index(start_rev_id)
894
if start_rev_id == end_rev_id:
895
end_index = start_index
898
end_index = revision_ids.index(end_rev_id)
900
end_index = len(view_revisions) - 1
901
# To include the revisions merged into the last revision,
902
# extend end_rev_id down to, but not including, the next rev
903
# with the same or lesser merge_depth
904
end_merge_depth = view_revisions[end_index][2]
906
for index in xrange(end_index+1, len(view_revisions)+1):
907
if view_revisions[index][2] <= end_merge_depth:
908
end_index = index - 1
911
# if the search falls off the end then log to the end as well
912
end_index = len(view_revisions) - 1
913
view_revisions = view_revisions[start_index:end_index+1]
914
return view_revisions
917
def _filter_revisions_touching_file_id(branch, file_id, view_revisions,
918
include_merges=True):
919
r"""Return the list of revision ids which touch a given file id.
921
The function filters view_revisions and returns a subset.
922
This includes the revisions which directly change the file id,
923
and the revisions which merge these changes. So if the
935
And 'C' changes a file, then both C and D will be returned. F will not be
936
returned even though it brings the changes to C into the branch starting
937
with E. (Note that if we were using F as the tip instead of G, then we
940
This will also be restricted based on a subset of the mainline.
942
:param branch: The branch where we can get text revision information.
944
:param file_id: Filter out revisions that do not touch file_id.
946
:param view_revisions: A list of (revision_id, dotted_revno, merge_depth)
947
tuples. This is the list of revisions which will be filtered. It is
948
assumed that view_revisions is in merge_sort order (i.e. newest
951
:param include_merges: include merge revisions in the result or not
953
:return: A list of (revision_id, dotted_revno, merge_depth) tuples.
955
# Lookup all possible text keys to determine which ones actually modified
957
text_keys = [(file_id, rev_id) for rev_id, revno, depth in view_revisions]
958
# Looking up keys in batches of 1000 can cut the time in half, as well as
959
# memory consumption. GraphIndex *does* like to look for a few keys in
960
# parallel, it just doesn't like looking for *lots* of keys in parallel.
961
# TODO: This code needs to be re-evaluated periodically as we tune the
962
# indexing layer. We might consider passing in hints as to the known
963
# access pattern (sparse/clustered, high success rate/low success
964
# rate). This particular access is clustered with a low success rate.
965
get_parent_map = branch.repository.texts.get_parent_map
966
modified_text_revisions = set()
968
for start in xrange(0, len(text_keys), chunk_size):
969
next_keys = text_keys[start:start + chunk_size]
970
# Only keep the revision_id portion of the key
971
modified_text_revisions.update(
972
[k[1] for k in get_parent_map(next_keys)])
973
del text_keys, next_keys
976
# Track what revisions will merge the current revision, replace entries
977
# with 'None' when they have been added to result
978
current_merge_stack = [None]
979
for info in view_revisions:
980
rev_id, revno, depth = info
981
if depth == len(current_merge_stack):
982
current_merge_stack.append(info)
984
del current_merge_stack[depth + 1:]
985
current_merge_stack[-1] = info
987
if rev_id in modified_text_revisions:
988
# This needs to be logged, along with the extra revisions
989
for idx in xrange(len(current_merge_stack)):
990
node = current_merge_stack[idx]
992
if include_merges or node[2] == 0:
994
current_merge_stack[idx] = None
998
def get_view_revisions(mainline_revs, rev_nos, branch, direction,
999
include_merges=True):
1000
"""Produce an iterator of revisions to show
1001
:return: an iterator of (revision_id, revno, merge_depth)
1002
(if there is no revno for a revision, None is supplied)
1004
# This method is no longer called by the main code path.
1005
# It is retained for API compatibility and may be deprecated
1006
# soon. IGC 20090127
1007
if not include_merges:
1008
revision_ids = mainline_revs[1:]
1009
if direction == 'reverse':
1010
revision_ids.reverse()
1011
for revision_id in revision_ids:
1012
yield revision_id, str(rev_nos[revision_id]), 0
1014
graph = branch.repository.get_graph()
1015
# This asks for all mainline revisions, which means we only have to spider
1016
# sideways, rather than depth history. That said, its still size-of-history
1017
# and should be addressed.
1018
# mainline_revisions always includes an extra revision at the beginning, so
1020
parent_map = dict(((key, value) for key, value in
1021
graph.iter_ancestry(mainline_revs[1:]) if value is not None))
1022
# filter out ghosts; merge_sort errors on ghosts.
1023
rev_graph = _mod_repository._strip_NULL_ghosts(parent_map)
1024
merge_sorted_revisions = tsort.merge_sort(
1028
generate_revno=True)
1030
if direction == 'forward':
1031
# forward means oldest first.
1032
merge_sorted_revisions = reverse_by_depth(merge_sorted_revisions)
1033
elif direction != 'reverse':
1034
raise ValueError('invalid direction %r' % direction)
1036
for (sequence, rev_id, merge_depth, revno, end_of_merge
1037
) in merge_sorted_revisions:
1038
yield rev_id, '.'.join(map(str, revno)), merge_depth
1041
def reverse_by_depth(merge_sorted_revisions, _depth=0):
1042
"""Reverse revisions by depth.
1044
Revisions with a different depth are sorted as a group with the previous
1045
revision of that depth. There may be no topological justification for this,
1046
but it looks much nicer.
1048
# Add a fake revision at start so that we can always attach sub revisions
1049
merge_sorted_revisions = [(None, None, _depth)] + merge_sorted_revisions
1051
for val in merge_sorted_revisions:
1052
if val[2] == _depth:
1053
# Each revision at the current depth becomes a chunk grouping all
1054
# higher depth revisions.
1055
zd_revisions.append([val])
1057
zd_revisions[-1].append(val)
1058
for revisions in zd_revisions:
1059
if len(revisions) > 1:
1060
# We have higher depth revisions, let reverse them locally
1061
revisions[1:] = reverse_by_depth(revisions[1:], _depth + 1)
1062
zd_revisions.reverse()
1064
for chunk in zd_revisions:
1065
result.extend(chunk)
1067
# Top level call, get rid of the fake revisions that have been added
1068
result = [r for r in result if r[0] is not None and r[1] is not None]
1072
class LogRevision(object):
1073
"""A revision to be logged (by LogFormatter.log_revision).
1075
A simple wrapper for the attributes of a revision to be logged.
1076
The attributes may or may not be populated, as determined by the
1077
logging options and the log formatter capabilities.
1080
def __init__(self, rev=None, revno=None, merge_depth=0, delta=None,
1081
tags=None, diff=None):
1083
self.revno = str(revno)
1084
self.merge_depth = merge_depth
1090
class LogFormatter(object):
1091
"""Abstract class to display log messages.
1093
At a minimum, a derived class must implement the log_revision method.
1095
If the LogFormatter needs to be informed of the beginning or end of
1096
a log it should implement the begin_log and/or end_log hook methods.
1098
A LogFormatter should define the following supports_XXX flags
1099
to indicate which LogRevision attributes it supports:
1101
- supports_delta must be True if this log formatter supports delta.
1102
Otherwise the delta attribute may not be populated. The 'delta_format'
1103
attribute describes whether the 'short_status' format (1) or the long
1104
one (2) should be used.
1106
- supports_merge_revisions must be True if this log formatter supports
1107
merge revisions. If not, and if supports_single_merge_revision is
1108
also not True, then only mainline revisions will be passed to the
1111
- preferred_levels is the number of levels this formatter defaults to.
1112
The default value is zero meaning display all levels.
1113
This value is only relevant if supports_merge_revisions is True.
1115
- supports_single_merge_revision must be True if this log formatter
1116
supports logging only a single merge revision. This flag is
1117
only relevant if supports_merge_revisions is not True.
1119
- supports_tags must be True if this log formatter supports tags.
1120
Otherwise the tags attribute may not be populated.
1122
- supports_diff must be True if this log formatter supports diffs.
1123
Otherwise the diff attribute may not be populated.
1125
Plugins can register functions to show custom revision properties using
1126
the properties_handler_registry. The registered function
1127
must respect the following interface description:
1128
def my_show_properties(properties_dict):
1129
# code that returns a dict {'name':'value'} of the properties
1132
preferred_levels = 0
1134
def __init__(self, to_file, show_ids=False, show_timezone='original',
1135
delta_format=None, levels=None):
1136
"""Create a LogFormatter.
1138
:param to_file: the file to output to
1139
:param show_ids: if True, revision-ids are to be displayed
1140
:param show_timezone: the timezone to use
1141
:param delta_format: the level of delta information to display
1142
or None to leave it u to the formatter to decide
1143
:param levels: the number of levels to display; None or -1 to
1144
let the log formatter decide.
1146
self.to_file = to_file
1147
# 'exact' stream used to show diff, it should print content 'as is'
1148
# and should not try to decode/encode it to unicode to avoid bug #328007
1149
self.to_exact_file = getattr(to_file, 'stream', to_file)
1150
self.show_ids = show_ids
1151
self.show_timezone = show_timezone
1152
if delta_format is None:
1153
# Ensures backward compatibility
1154
delta_format = 2 # long format
1155
self.delta_format = delta_format
1156
self.levels = levels
1158
def get_levels(self):
1159
"""Get the number of levels to display or 0 for all."""
1160
if getattr(self, 'supports_merge_revisions', False):
1161
if self.levels is None or self.levels == -1:
1162
return self.preferred_levels
1167
def log_revision(self, revision):
1170
:param revision: The LogRevision to be logged.
1172
raise NotImplementedError('not implemented in abstract base')
1174
def short_committer(self, rev):
1175
name, address = config.parse_username(rev.committer)
1180
def short_author(self, rev):
1181
name, address = config.parse_username(rev.get_apparent_authors()[0])
1186
def show_properties(self, revision, indent):
1187
"""Displays the custom properties returned by each registered handler.
1189
If a registered handler raises an error it is propagated.
1191
for key, handler in properties_handler_registry.iteritems():
1192
for key, value in handler(revision).items():
1193
self.to_file.write(indent + key + ': ' + value + '\n')
1195
def show_diff(self, to_file, diff, indent):
1196
for l in diff.rstrip().split('\n'):
1197
to_file.write(indent + '%s\n' % (l,))
1200
class LongLogFormatter(LogFormatter):
1202
supports_merge_revisions = True
1203
supports_delta = True
1204
supports_tags = True
1205
supports_diff = True
1207
def log_revision(self, revision):
1208
"""Log a revision, either merged or not."""
1209
indent = ' ' * revision.merge_depth
1210
to_file = self.to_file
1211
to_file.write(indent + '-' * 60 + '\n')
1212
if revision.revno is not None:
1213
to_file.write(indent + 'revno: %s\n' % (revision.revno,))
1215
to_file.write(indent + 'tags: %s\n' % (', '.join(revision.tags)))
1217
to_file.write(indent + 'revision-id: ' + revision.rev.revision_id)
1219
for parent_id in revision.rev.parent_ids:
1220
to_file.write(indent + 'parent: %s\n' % (parent_id,))
1221
self.show_properties(revision.rev, indent)
1223
committer = revision.rev.committer
1224
authors = revision.rev.get_apparent_authors()
1225
if authors != [committer]:
1226
to_file.write(indent + 'author: %s\n' % (", ".join(authors),))
1227
to_file.write(indent + 'committer: %s\n' % (committer,))
1229
branch_nick = revision.rev.properties.get('branch-nick', None)
1230
if branch_nick is not None:
1231
to_file.write(indent + 'branch nick: %s\n' % (branch_nick,))
1233
date_str = format_date(revision.rev.timestamp,
1234
revision.rev.timezone or 0,
1236
to_file.write(indent + 'timestamp: %s\n' % (date_str,))
1238
to_file.write(indent + 'message:\n')
1239
if not revision.rev.message:
1240
to_file.write(indent + ' (no message)\n')
1242
message = revision.rev.message.rstrip('\r\n')
1243
for l in message.split('\n'):
1244
to_file.write(indent + ' %s\n' % (l,))
1245
if revision.delta is not None:
1246
# We don't respect delta_format for compatibility
1247
revision.delta.show(to_file, self.show_ids, indent=indent,
1249
if revision.diff is not None:
1250
to_file.write(indent + 'diff:\n')
1251
# Note: we explicitly don't indent the diff (relative to the
1252
# revision information) so that the output can be fed to patch -p0
1253
self.show_diff(self.to_exact_file, revision.diff, indent)
1256
class ShortLogFormatter(LogFormatter):
1258
supports_merge_revisions = True
1259
preferred_levels = 1
1260
supports_delta = True
1261
supports_tags = True
1262
supports_diff = True
1264
def __init__(self, *args, **kwargs):
1265
super(ShortLogFormatter, self).__init__(*args, **kwargs)
1266
self.revno_width_by_depth = {}
1268
def log_revision(self, revision):
1269
# We need two indents: one per depth and one for the information
1270
# relative to that indent. Most mainline revnos are 5 chars or
1271
# less while dotted revnos are typically 11 chars or less. Once
1272
# calculated, we need to remember the offset for a given depth
1273
# as we might be starting from a dotted revno in the first column
1274
# and we want subsequent mainline revisions to line up.
1275
depth = revision.merge_depth
1276
indent = ' ' * depth
1277
revno_width = self.revno_width_by_depth.get(depth)
1278
if revno_width is None:
1279
if revision.revno.find('.') == -1:
1280
# mainline revno, e.g. 12345
1283
# dotted revno, e.g. 12345.10.55
1285
self.revno_width_by_depth[depth] = revno_width
1286
offset = ' ' * (revno_width + 1)
1288
to_file = self.to_file
1290
if len(revision.rev.parent_ids) > 1:
1291
is_merge = ' [merge]'
1294
tags = ' {%s}' % (', '.join(revision.tags))
1295
to_file.write(indent + "%*s %s\t%s%s%s\n" % (revno_width,
1296
revision.revno, self.short_author(revision.rev),
1297
format_date(revision.rev.timestamp,
1298
revision.rev.timezone or 0,
1299
self.show_timezone, date_fmt="%Y-%m-%d",
1302
self.show_properties(revision.rev, indent+offset)
1304
to_file.write(indent + offset + 'revision-id:%s\n'
1305
% (revision.rev.revision_id,))
1306
if not revision.rev.message:
1307
to_file.write(indent + offset + '(no message)\n')
1309
message = revision.rev.message.rstrip('\r\n')
1310
for l in message.split('\n'):
1311
to_file.write(indent + offset + '%s\n' % (l,))
1313
if revision.delta is not None:
1314
revision.delta.show(to_file, self.show_ids, indent=indent + offset,
1315
short_status=self.delta_format==1)
1316
if revision.diff is not None:
1317
self.show_diff(self.to_exact_file, revision.diff, ' ')
1321
class LineLogFormatter(LogFormatter):
1323
supports_merge_revisions = True
1324
preferred_levels = 1
1325
supports_tags = True
1327
def __init__(self, *args, **kwargs):
1328
super(LineLogFormatter, self).__init__(*args, **kwargs)
1329
self._max_chars = terminal_width() - 1
1331
def truncate(self, str, max_len):
1332
if len(str) <= max_len:
1334
return str[:max_len-3]+'...'
1336
def date_string(self, rev):
1337
return format_date(rev.timestamp, rev.timezone or 0,
1338
self.show_timezone, date_fmt="%Y-%m-%d",
1341
def message(self, rev):
1343
return '(no message)'
1347
def log_revision(self, revision):
1348
indent = ' ' * revision.merge_depth
1349
self.to_file.write(self.log_string(revision.revno, revision.rev,
1350
self._max_chars, revision.tags, indent))
1351
self.to_file.write('\n')
1353
def log_string(self, revno, rev, max_chars, tags=None, prefix=''):
1354
"""Format log info into one string. Truncate tail of string
1355
:param revno: revision number or None.
1356
Revision numbers counts from 1.
1357
:param rev: revision object
1358
:param max_chars: maximum length of resulting string
1359
:param tags: list of tags or None
1360
:param prefix: string to prefix each line
1361
:return: formatted truncated string
1365
# show revno only when is not None
1366
out.append("%s:" % revno)
1367
out.append(self.truncate(self.short_author(rev), 20))
1368
out.append(self.date_string(rev))
1369
if len(rev.parent_ids) > 1:
1370
out.append('[merge]')
1372
tag_str = '{%s}' % (', '.join(tags))
1374
out.append(rev.get_summary())
1375
return self.truncate(prefix + " ".join(out).rstrip('\n'), max_chars)
1378
class GnuChangelogLogFormatter(LogFormatter):
1380
supports_merge_revisions = True
1381
supports_delta = True
1383
def log_revision(self, revision):
1384
"""Log a revision, either merged or not."""
1385
to_file = self.to_file
1387
date_str = format_date(revision.rev.timestamp,
1388
revision.rev.timezone or 0,
1390
date_fmt='%Y-%m-%d',
1392
committer_str = revision.rev.committer.replace (' <', ' <')
1393
to_file.write('%s %s\n\n' % (date_str,committer_str))
1395
if revision.delta is not None and revision.delta.has_changed():
1396
for c in revision.delta.added + revision.delta.removed + revision.delta.modified:
1398
to_file.write('\t* %s:\n' % (path,))
1399
for c in revision.delta.renamed:
1400
oldpath,newpath = c[:2]
1401
# For renamed files, show both the old and the new path
1402
to_file.write('\t* %s:\n\t* %s:\n' % (oldpath,newpath))
1405
if not revision.rev.message:
1406
to_file.write('\tNo commit message\n')
1408
message = revision.rev.message.rstrip('\r\n')
1409
for l in message.split('\n'):
1410
to_file.write('\t%s\n' % (l.lstrip(),))
1414
def line_log(rev, max_chars):
1415
lf = LineLogFormatter(None)
1416
return lf.log_string(None, rev, max_chars)
1419
class LogFormatterRegistry(registry.Registry):
1420
"""Registry for log formatters"""
1422
def make_formatter(self, name, *args, **kwargs):
1423
"""Construct a formatter from arguments.
1425
:param name: Name of the formatter to construct. 'short', 'long' and
1426
'line' are built-in.
1428
return self.get(name)(*args, **kwargs)
1430
def get_default(self, branch):
1431
return self.get(branch.get_config().log_format())
1434
log_formatter_registry = LogFormatterRegistry()
1437
log_formatter_registry.register('short', ShortLogFormatter,
1438
'Moderately short log format')
1439
log_formatter_registry.register('long', LongLogFormatter,
1440
'Detailed log format')
1441
log_formatter_registry.register('line', LineLogFormatter,
1442
'Log format with one line per revision')
1443
log_formatter_registry.register('gnu-changelog', GnuChangelogLogFormatter,
1444
'Format used by GNU ChangeLog files')
1447
def register_formatter(name, formatter):
1448
log_formatter_registry.register(name, formatter)
1451
def log_formatter(name, *args, **kwargs):
1452
"""Construct a formatter from arguments.
1454
name -- Name of the formatter to construct; currently 'long', 'short' and
1455
'line' are supported.
1458
return log_formatter_registry.make_formatter(name, *args, **kwargs)
1460
raise errors.BzrCommandError("unknown log formatter: %r" % name)
1463
def show_one_log(revno, rev, delta, verbose, to_file, show_timezone):
1464
# deprecated; for compatibility
1465
lf = LongLogFormatter(to_file=to_file, show_timezone=show_timezone)
1466
lf.show(revno, rev, delta)
1469
def show_changed_revisions(branch, old_rh, new_rh, to_file=None,
1471
"""Show the change in revision history comparing the old revision history to the new one.
1473
:param branch: The branch where the revisions exist
1474
:param old_rh: The old revision history
1475
:param new_rh: The new revision history
1476
:param to_file: A file to write the results to. If None, stdout will be used
1479
to_file = codecs.getwriter(get_terminal_encoding())(sys.stdout,
1481
lf = log_formatter(log_format,
1484
show_timezone='original')
1486
# This is the first index which is different between
1489
for i in xrange(max(len(new_rh),
1491
if (len(new_rh) <= i
1493
or new_rh[i] != old_rh[i]):
1497
if base_idx is None:
1498
to_file.write('Nothing seems to have changed\n')
1500
## TODO: It might be nice to do something like show_log
1501
## and show the merged entries. But since this is the
1502
## removed revisions, it shouldn't be as important
1503
if base_idx < len(old_rh):
1504
to_file.write('*'*60)
1505
to_file.write('\nRemoved Revisions:\n')
1506
for i in range(base_idx, len(old_rh)):
1507
rev = branch.repository.get_revision(old_rh[i])
1508
lr = LogRevision(rev, i+1, 0, None)
1510
to_file.write('*'*60)
1511
to_file.write('\n\n')
1512
if base_idx < len(new_rh):
1513
to_file.write('Added Revisions:\n')
1518
direction='forward',
1519
start_revision=base_idx+1,
1520
end_revision=len(new_rh),
1524
def get_history_change(old_revision_id, new_revision_id, repository):
1525
"""Calculate the uncommon lefthand history between two revisions.
1527
:param old_revision_id: The original revision id.
1528
:param new_revision_id: The new revision id.
1529
:param repository: The repository to use for the calculation.
1531
return old_history, new_history
1534
old_revisions = set()
1536
new_revisions = set()
1537
new_iter = repository.iter_reverse_revision_history(new_revision_id)
1538
old_iter = repository.iter_reverse_revision_history(old_revision_id)
1539
stop_revision = None
1542
while do_new or do_old:
1545
new_revision = new_iter.next()
1546
except StopIteration:
1549
new_history.append(new_revision)
1550
new_revisions.add(new_revision)
1551
if new_revision in old_revisions:
1552
stop_revision = new_revision
1556
old_revision = old_iter.next()
1557
except StopIteration:
1560
old_history.append(old_revision)
1561
old_revisions.add(old_revision)
1562
if old_revision in new_revisions:
1563
stop_revision = old_revision
1565
new_history.reverse()
1566
old_history.reverse()
1567
if stop_revision is not None:
1568
new_history = new_history[new_history.index(stop_revision) + 1:]
1569
old_history = old_history[old_history.index(stop_revision) + 1:]
1570
return old_history, new_history
1573
def show_branch_change(branch, output, old_revno, old_revision_id):
1574
"""Show the changes made to a branch.
1576
:param branch: The branch to show changes about.
1577
:param output: A file-like object to write changes to.
1578
:param old_revno: The revno of the old tip.
1579
:param old_revision_id: The revision_id of the old tip.
1581
new_revno, new_revision_id = branch.last_revision_info()
1582
old_history, new_history = get_history_change(old_revision_id,
1585
if old_history == [] and new_history == []:
1586
output.write('Nothing seems to have changed\n')
1589
log_format = log_formatter_registry.get_default(branch)
1590
lf = log_format(show_ids=False, to_file=output, show_timezone='original')
1591
if old_history != []:
1592
output.write('*'*60)
1593
output.write('\nRemoved Revisions:\n')
1594
show_flat_log(branch.repository, old_history, old_revno, lf)
1595
output.write('*'*60)
1596
output.write('\n\n')
1597
if new_history != []:
1598
output.write('Added Revisions:\n')
1599
start_revno = new_revno - len(new_history) + 1
1600
show_log(branch, lf, None, verbose=False, direction='forward',
1601
start_revision=start_revno,)
1604
def show_flat_log(repository, history, last_revno, lf):
1605
"""Show a simple log of the specified history.
1607
:param repository: The repository to retrieve revisions from.
1608
:param history: A list of revision_ids indicating the lefthand history.
1609
:param last_revno: The revno of the last revision_id in the history.
1610
:param lf: The log formatter to use.
1612
start_revno = last_revno - len(history) + 1
1613
revisions = repository.get_revisions(history)
1614
for i, rev in enumerate(revisions):
1615
lr = LogRevision(rev, i + last_revno, 0, None)
1619
def _get_fileid_to_log(revision, tree, b, fp):
1620
"""Find the file-id to log for a file path in a revision range.
1622
:param revision: the revision range as parsed on the command line
1623
:param tree: the working tree, if any
1624
:param b: the branch
1625
:param fp: file path
1627
if revision is None:
1629
tree = b.basis_tree()
1630
file_id = tree.path2id(fp)
1632
# go back to when time began
1634
rev1 = b.get_rev_id(1)
1635
except errors.NoSuchRevision:
1639
tree = b.repository.revision_tree(rev1)
1640
file_id = tree.path2id(fp)
1642
elif len(revision) == 1:
1643
# One revision given - file must exist in it
1644
tree = revision[0].as_tree(b)
1645
file_id = tree.path2id(fp)
1647
elif len(revision) == 2:
1648
# Revision range given. Get the file-id from the end tree.
1649
# If that fails, try the start tree.
1650
rev_id = revision[1].as_revision_id(b)
1652
tree = b.basis_tree()
1654
tree = revision[1].as_tree(b)
1655
file_id = tree.path2id(fp)
1657
rev_id = revision[0].as_revision_id(b)
1659
rev1 = b.get_rev_id(1)
1660
tree = b.repository.revision_tree(rev1)
1662
tree = revision[0].as_tree(b)
1663
file_id = tree.path2id(fp)
1665
raise errors.BzrCommandError(
1666
'bzr log --revision takes one or two values.')
1670
properties_handler_registry = registry.Registry()
1671
properties_handler_registry.register_lazy("foreign",
1673
"show_foreign_properties")
1676
# adapters which revision ids to log are filtered. When log is called, the
1677
# log_rev_iterator is adapted through each of these factory methods.
1678
# Plugins are welcome to mutate this list in any way they like - as long
1679
# as the overall behaviour is preserved. At this point there is no extensible
1680
# mechanism for getting parameters to each factory method, and until there is
1681
# this won't be considered a stable api.
1685
# read revision objects
1686
_make_revision_objects,
1687
# filter on log messages
1688
_make_search_filter,
1689
# generate deltas for things we will show
added
removed
bzrlib/log.py
