14
14
# along with this program; if not, write to the Free Software
15
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19
17
"""Code to show logs of changes.
21
19
Various flavors of log can be produced:
343
334
gpg_strategy = gpg.GPGStrategy(None)
344
335
result = repo.verify_revision_signature(rev_id, gpg_strategy)
345
336
if result[0] == gpg.SIGNATURE_VALID:
346
return "valid signature from {0}".format(result[1])
337
return u"valid signature from {0}".format(result[1])
347
338
if result[0] == gpg.SIGNATURE_KEY_MISSING:
348
339
return "unknown key {0}".format(result[1])
349
340
if result[0] == gpg.SIGNATURE_NOT_VALID:
580
571
and (not generate_merge_revisions
581
572
or not _has_merges(branch, end_rev_id))):
582
573
# If a single revision is requested, check we can handle it
583
iter_revs = _generate_one_revision(branch, end_rev_id, br_rev_id,
585
elif not generate_merge_revisions:
586
# If we only want to see linear revisions, we can iterate ...
587
iter_revs = _generate_flat_revisions(branch, start_rev_id, end_rev_id,
588
direction, exclude_common_ancestry)
589
if direction == 'forward':
590
iter_revs = reversed(iter_revs)
592
iter_revs = _generate_all_revisions(branch, start_rev_id, end_rev_id,
593
direction, delayed_graph_generation,
594
exclude_common_ancestry)
595
if direction == 'forward':
596
iter_revs = _rebase_merge_depth(reverse_by_depth(list(iter_revs)))
574
return _generate_one_revision(branch, end_rev_id, br_rev_id,
576
if not generate_merge_revisions:
578
# If we only want to see linear revisions, we can iterate ...
579
iter_revs = _linear_view_revisions(
580
branch, start_rev_id, end_rev_id,
581
exclude_common_ancestry=exclude_common_ancestry)
582
# If a start limit was given and it's not obviously an
583
# ancestor of the end limit, check it before outputting anything
584
if (direction == 'forward'
585
or (start_rev_id and not _is_obvious_ancestor(
586
branch, start_rev_id, end_rev_id))):
587
iter_revs = list(iter_revs)
588
if direction == 'forward':
589
iter_revs = reversed(iter_revs)
591
except _StartNotLinearAncestor:
592
# Switch to the slower implementation that may be able to find a
593
# non-obvious ancestor out of the left-hand history.
595
iter_revs = _generate_all_revisions(branch, start_rev_id, end_rev_id,
596
direction, delayed_graph_generation,
597
exclude_common_ancestry)
598
if direction == 'forward':
599
iter_revs = _rebase_merge_depth(reverse_by_depth(list(iter_revs)))
606
609
return [(rev_id, revno_str, 0)]
609
def _generate_flat_revisions(branch, start_rev_id, end_rev_id, direction,
610
exclude_common_ancestry=False):
611
result = _linear_view_revisions(
612
branch, start_rev_id, end_rev_id,
613
exclude_common_ancestry=exclude_common_ancestry)
614
# If a start limit was given and it's not obviously an
615
# ancestor of the end limit, check it before outputting anything
616
if direction == 'forward' or (start_rev_id
617
and not _is_obvious_ancestor(branch, start_rev_id, end_rev_id)):
619
result = list(result)
620
except _StartNotLinearAncestor:
621
raise errors.BzrCommandError(gettext('Start revision not found in'
622
' left-hand history of end revision.'))
626
612
def _generate_all_revisions(branch, start_rev_id, end_rev_id, direction,
627
613
delayed_graph_generation,
628
614
exclude_common_ancestry=False):
2028
2014
kind is one of values 'directory', 'file', 'symlink', 'tree-reference'.
2029
2015
branch will be read-locked.
2031
from builtins import _get_revision_range
2017
from bzrlib.builtins import _get_revision_range
2032
2018
tree, b, path = controldir.ControlDir.open_containing_tree_or_branch(
2034
2020
add_cleanup(b.lock_read().unlock)