144
146
start_revision=None,
145
147
end_revision=None,
148
152
"""Write out human-readable log of commits to this branch.
151
LogFormatter object to show the output.
154
If true, list only the commits affecting the specified
155
file, rather than all commits.
158
If true show added/changed/deleted/renamed files.
161
'reverse' (default) is latest to earliest;
162
'forward' is earliest to latest.
165
If not None, only show revisions >= start_revision
168
If not None, only show revisions <= end_revision
171
If not None, only show revisions with matching commit messages
174
If not None or 0, only show limit revisions
178
if getattr(lf, 'begin_log', None):
181
_show_log(branch, lf, specific_fileid, verbose, direction,
182
start_revision, end_revision, search, limit)
184
if getattr(lf, 'end_log', None):
190
def _show_log(branch,
192
specific_fileid=None,
199
"""Worker function for show_log - see show_log."""
200
if not isinstance(lf, LogFormatter):
201
warn("not a LogFormatter instance: %r" % lf)
204
trace.mutter('get log for file_id %r', specific_fileid)
205
generate_merge_revisions = getattr(lf, 'supports_merge_revisions', False)
206
allow_single_merge_revision = getattr(lf,
207
'supports_single_merge_revision', False)
208
view_revisions = calculate_view_revisions(branch, start_revision,
209
end_revision, direction,
211
generate_merge_revisions,
212
allow_single_merge_revision)
214
generate_tags = getattr(lf, 'supports_tags', False)
216
if branch.supports_tags():
217
rev_tag_dict = branch.tags.get_reverse_tag_dict()
219
generate_delta = verbose and getattr(lf, 'supports_delta', False)
221
# now we just print all the revisions
223
revision_iterator = make_log_rev_iterator(branch, view_revisions,
224
generate_delta, search)
225
for revs in revision_iterator:
226
for (rev_id, revno, merge_depth), rev, delta in revs:
227
lr = LogRevision(rev, revno, merge_depth, delta,
228
rev_tag_dict.get(rev_id))
154
This function is being retained for backwards compatibility but
155
should not be extended with new parameters. Use the new Logger class
156
instead, eg. Logger(branch, rqst).show(lf), adding parameters to the
157
make_log_request_dict function.
159
:param lf: The LogFormatter object showing the output.
161
:param specific_fileid: If not None, list only the commits affecting the
162
specified file, rather than all commits.
164
:param verbose: If True show added/changed/deleted/renamed files.
166
:param direction: 'reverse' (default) is latest to earliest; 'forward' is
169
:param start_revision: If not None, only show revisions >= start_revision
171
:param end_revision: If not None, only show revisions <= end_revision
173
:param search: If not None, only show revisions with matching commit
176
:param limit: If set, shows only 'limit' revisions, all revisions are shown
179
:param show_diff: If True, output a diff after each revision.
181
:param match: Dictionary of search lists to use when matching revision
184
# Convert old-style parameters to new-style parameters
185
if specific_fileid is not None:
186
file_ids = [specific_fileid]
191
delta_type = 'partial'
198
diff_type = 'partial'
204
# Build the request and execute it
205
rqst = make_log_request_dict(direction=direction, specific_fileids=file_ids,
206
start_revision=start_revision, end_revision=end_revision,
207
limit=limit, message_search=search,
208
delta_type=delta_type, diff_type=diff_type)
209
Logger(branch, rqst).show(lf)
212
# Note: This needs to be kept in sync with the defaults in
213
# make_log_request_dict() below
214
_DEFAULT_REQUEST_PARAMS = {
215
'direction': 'reverse',
217
'generate_tags': True,
218
'exclude_common_ancestry': False,
219
'_match_using_deltas': True,
223
def make_log_request_dict(direction='reverse', specific_fileids=None,
224
start_revision=None, end_revision=None, limit=None,
225
message_search=None, levels=None, generate_tags=True,
227
diff_type=None, _match_using_deltas=True,
228
exclude_common_ancestry=False, match=None,
229
signature=False, omit_merges=False,
231
"""Convenience function for making a logging request dictionary.
233
Using this function may make code slightly safer by ensuring
234
parameters have the correct names. It also provides a reference
235
point for documenting the supported parameters.
237
:param direction: 'reverse' (default) is latest to earliest;
238
'forward' is earliest to latest.
240
:param specific_fileids: If not None, only include revisions
241
affecting the specified files, rather than all revisions.
243
:param start_revision: If not None, only generate
244
revisions >= start_revision
246
:param end_revision: If not None, only generate
247
revisions <= end_revision
249
:param limit: If set, generate only 'limit' revisions, all revisions
250
are shown if None or 0.
252
:param message_search: If not None, only include revisions with
253
matching commit messages
255
:param levels: the number of levels of revisions to
256
generate; 1 for just the mainline; 0 for all levels, or None for
259
:param generate_tags: If True, include tags for matched revisions.
261
:param delta_type: Either 'full', 'partial' or None.
262
'full' means generate the complete delta - adds/deletes/modifies/etc;
263
'partial' means filter the delta using specific_fileids;
264
None means do not generate any delta.
266
:param diff_type: Either 'full', 'partial' or None.
267
'full' means generate the complete diff - adds/deletes/modifies/etc;
268
'partial' means filter the diff using specific_fileids;
269
None means do not generate any diff.
271
:param _match_using_deltas: a private parameter controlling the
272
algorithm used for matching specific_fileids. This parameter
273
may be removed in the future so bzrlib client code should NOT
276
:param exclude_common_ancestry: Whether -rX..Y should be interpreted as a
277
range operator or as a graph difference.
279
:param signature: show digital signature information
281
:param match: Dictionary of list of search strings to use when filtering
282
revisions. Keys can be 'message', 'author', 'committer', 'bugs' or
283
the empty string to match any of the preceding properties.
285
:param omit_merges: If True, commits with more than one parent are
289
# Take care of old style message_search parameter
292
if 'message' in match:
293
match['message'].append(message_search)
295
match['message'] = [message_search]
297
match={ 'message': [message_search] }
299
'direction': direction,
300
'specific_fileids': specific_fileids,
301
'start_revision': start_revision,
302
'end_revision': end_revision,
305
'generate_tags': generate_tags,
306
'delta_type': delta_type,
307
'diff_type': diff_type,
308
'exclude_common_ancestry': exclude_common_ancestry,
309
'signature': signature,
311
'omit_merges': omit_merges,
312
# Add 'private' attributes for features that may be deprecated
313
'_match_using_deltas': _match_using_deltas,
317
def _apply_log_request_defaults(rqst):
318
"""Apply default values to a request dictionary."""
319
result = _DEFAULT_REQUEST_PARAMS.copy()
325
def format_signature_validity(rev_id, repo):
326
"""get the signature validity
328
:param rev_id: revision id to validate
329
:param repo: repository of revision
330
:return: human readable string to print to log
332
from bzrlib import gpg
334
gpg_strategy = gpg.GPGStrategy(None)
335
result = repo.verify_revision_signature(rev_id, gpg_strategy)
336
if result[0] == gpg.SIGNATURE_VALID:
337
return u"valid signature from {0}".format(result[1])
338
if result[0] == gpg.SIGNATURE_KEY_MISSING:
339
return "unknown key {0}".format(result[1])
340
if result[0] == gpg.SIGNATURE_NOT_VALID:
341
return "invalid signature!"
342
if result[0] == gpg.SIGNATURE_NOT_SIGNED:
343
return "no signature"
346
class LogGenerator(object):
347
"""A generator of log revisions."""
349
def iter_log_revisions(self):
350
"""Iterate over LogRevision objects.
352
:return: An iterator yielding LogRevision objects.
354
raise NotImplementedError(self.iter_log_revisions)
357
class Logger(object):
358
"""An object that generates, formats and displays a log."""
360
def __init__(self, branch, rqst):
363
:param branch: the branch to log
364
:param rqst: A dictionary specifying the query parameters.
365
See make_log_request_dict() for supported values.
368
self.rqst = _apply_log_request_defaults(rqst)
373
:param lf: The LogFormatter object to send the output to.
375
if not isinstance(lf, LogFormatter):
376
warn("not a LogFormatter instance: %r" % lf)
378
self.branch.lock_read()
380
if getattr(lf, 'begin_log', None):
383
if getattr(lf, 'end_log', None):
388
def _show_body(self, lf):
389
"""Show the main log output.
391
Subclasses may wish to override this.
393
# Tweak the LogRequest based on what the LogFormatter can handle.
394
# (There's no point generating stuff if the formatter can't display it.)
396
if rqst['levels'] is None or lf.get_levels() > rqst['levels']:
397
# user didn't specify levels, use whatever the LF can handle:
398
rqst['levels'] = lf.get_levels()
400
if not getattr(lf, 'supports_tags', False):
401
rqst['generate_tags'] = False
402
if not getattr(lf, 'supports_delta', False):
403
rqst['delta_type'] = None
404
if not getattr(lf, 'supports_diff', False):
405
rqst['diff_type'] = None
406
if not getattr(lf, 'supports_signatures', False):
407
rqst['signature'] = False
409
# Find and print the interesting revisions
410
generator = self._generator_factory(self.branch, rqst)
411
for lr in generator.iter_log_revisions():
229
412
lf.log_revision(lr)
232
if log_count >= limit:
236
def calculate_view_revisions(branch, start_revision, end_revision, direction,
237
specific_fileid, generate_merge_revisions,
238
allow_single_merge_revision):
239
if (not generate_merge_revisions and start_revision is end_revision is
240
None and direction == 'reverse' and specific_fileid is None):
241
return _linear_view_revisions(branch)
243
mainline_revs, rev_nos, start_rev_id, end_rev_id = \
244
_get_mainline_revs(branch, start_revision, end_revision)
245
if not mainline_revs:
415
def _generator_factory(self, branch, rqst):
416
"""Make the LogGenerator object to use.
418
Subclasses may wish to override this.
420
return _DefaultLogGenerator(branch, rqst)
423
class _StartNotLinearAncestor(Exception):
424
"""Raised when a start revision is not found walking left-hand history."""
427
class _DefaultLogGenerator(LogGenerator):
428
"""The default generator of log revisions."""
430
def __init__(self, branch, rqst):
433
if rqst.get('generate_tags') and branch.supports_tags():
434
self.rev_tag_dict = branch.tags.get_reverse_tag_dict()
436
self.rev_tag_dict = {}
438
def iter_log_revisions(self):
439
"""Iterate over LogRevision objects.
441
:return: An iterator yielding LogRevision objects.
444
levels = rqst.get('levels')
445
limit = rqst.get('limit')
446
diff_type = rqst.get('diff_type')
447
show_signature = rqst.get('signature')
448
omit_merges = rqst.get('omit_merges')
450
revision_iterator = self._create_log_revision_iterator()
451
for revs in revision_iterator:
452
for (rev_id, revno, merge_depth), rev, delta in revs:
453
# 0 levels means show everything; merge_depth counts from 0
454
if levels != 0 and merge_depth >= levels:
456
if omit_merges and len(rev.parent_ids) > 1:
458
if diff_type is None:
461
diff = self._format_diff(rev, rev_id, diff_type)
463
signature = format_signature_validity(rev_id,
464
self.branch.repository)
467
yield LogRevision(rev, revno, merge_depth, delta,
468
self.rev_tag_dict.get(rev_id), diff, signature)
471
if log_count >= limit:
474
def _format_diff(self, rev, rev_id, diff_type):
475
repo = self.branch.repository
476
if len(rev.parent_ids) == 0:
477
ancestor_id = _mod_revision.NULL_REVISION
479
ancestor_id = rev.parent_ids[0]
480
tree_1 = repo.revision_tree(ancestor_id)
481
tree_2 = repo.revision_tree(rev_id)
482
file_ids = self.rqst.get('specific_fileids')
483
if diff_type == 'partial' and file_ids is not None:
484
specific_files = [tree_2.id2path(id) for id in file_ids]
486
specific_files = None
488
path_encoding = get_diff_header_encoding()
489
diff.show_diff_trees(tree_1, tree_2, s, specific_files, old_label='',
490
new_label='', path_encoding=path_encoding)
493
def _create_log_revision_iterator(self):
494
"""Create a revision iterator for log.
496
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
499
self.start_rev_id, self.end_rev_id = _get_revision_limits(
500
self.branch, self.rqst.get('start_revision'),
501
self.rqst.get('end_revision'))
502
if self.rqst.get('_match_using_deltas'):
503
return self._log_revision_iterator_using_delta_matching()
505
# We're using the per-file-graph algorithm. This scales really
506
# well but only makes sense if there is a single file and it's
508
file_count = len(self.rqst.get('specific_fileids'))
510
raise BzrError("illegal LogRequest: must match-using-deltas "
511
"when logging %d files" % file_count)
512
return self._log_revision_iterator_using_per_file_graph()
514
def _log_revision_iterator_using_delta_matching(self):
515
# Get the base revisions, filtering by the revision range
517
generate_merge_revisions = rqst.get('levels') != 1
518
delayed_graph_generation = not rqst.get('specific_fileids') and (
519
rqst.get('limit') or self.start_rev_id or self.end_rev_id)
520
view_revisions = _calc_view_revisions(
521
self.branch, self.start_rev_id, self.end_rev_id,
522
rqst.get('direction'),
523
generate_merge_revisions=generate_merge_revisions,
524
delayed_graph_generation=delayed_graph_generation,
525
exclude_common_ancestry=rqst.get('exclude_common_ancestry'))
527
# Apply the other filters
528
return make_log_rev_iterator(self.branch, view_revisions,
529
rqst.get('delta_type'), rqst.get('match'),
530
file_ids=rqst.get('specific_fileids'),
531
direction=rqst.get('direction'))
533
def _log_revision_iterator_using_per_file_graph(self):
534
# Get the base revisions, filtering by the revision range.
535
# Note that we always generate the merge revisions because
536
# filter_revisions_touching_file_id() requires them ...
538
view_revisions = _calc_view_revisions(
539
self.branch, self.start_rev_id, self.end_rev_id,
540
rqst.get('direction'), generate_merge_revisions=True,
541
exclude_common_ancestry=rqst.get('exclude_common_ancestry'))
542
if not isinstance(view_revisions, list):
543
view_revisions = list(view_revisions)
544
view_revisions = _filter_revisions_touching_file_id(self.branch,
545
rqst.get('specific_fileids')[0], view_revisions,
546
include_merges=rqst.get('levels') != 1)
547
return make_log_rev_iterator(self.branch, view_revisions,
548
rqst.get('delta_type'), rqst.get('match'))
551
def _calc_view_revisions(branch, start_rev_id, end_rev_id, direction,
552
generate_merge_revisions,
553
delayed_graph_generation=False,
554
exclude_common_ancestry=False,
556
"""Calculate the revisions to view.
558
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples OR
559
a list of the same tuples.
561
if (exclude_common_ancestry and start_rev_id == end_rev_id):
562
raise errors.BzrCommandError(gettext(
563
'--exclude-common-ancestry requires two different revisions'))
564
if direction not in ('reverse', 'forward'):
565
raise ValueError(gettext('invalid direction %r') % direction)
566
br_revno, br_rev_id = branch.last_revision_info()
248
if direction == 'reverse':
249
start_rev_id, end_rev_id = end_rev_id, start_rev_id
251
generate_single_revision = False
252
if ((not generate_merge_revisions)
253
and ((start_rev_id and (start_rev_id not in rev_nos))
254
or (end_rev_id and (end_rev_id not in rev_nos)))):
255
generate_single_revision = ((start_rev_id == end_rev_id)
256
and allow_single_merge_revision)
257
if not generate_single_revision:
258
raise errors.BzrCommandError('Selected log formatter only supports'
259
' mainline revisions.')
260
generate_merge_revisions = generate_single_revision
261
view_revs_iter = get_view_revisions(mainline_revs, rev_nos, branch,
262
direction, include_merges=generate_merge_revisions)
263
view_revisions = _filter_revision_range(list(view_revs_iter),
266
if view_revisions and generate_single_revision:
267
view_revisions = view_revisions[0:1]
269
view_revisions = _filter_revisions_touching_file_id(branch,
274
# rebase merge_depth - unless there are no revisions or
275
# either the first or last revision have merge_depth = 0.
570
if (end_rev_id and start_rev_id == end_rev_id
571
and (not generate_merge_revisions
572
or not _has_merges(branch, end_rev_id))):
573
# If a single revision is requested, check we can handle it
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)))
603
def _generate_one_revision(branch, rev_id, br_rev_id, br_revno):
604
if rev_id == br_rev_id:
606
return [(br_rev_id, br_revno, 0)]
608
revno_str = _compute_revno_str(branch, rev_id)
609
return [(rev_id, revno_str, 0)]
612
def _generate_all_revisions(branch, start_rev_id, end_rev_id, direction,
613
delayed_graph_generation,
614
exclude_common_ancestry=False):
615
# On large trees, generating the merge graph can take 30-60 seconds
616
# so we delay doing it until a merge is detected, incrementally
617
# returning initial (non-merge) revisions while we can.
619
# The above is only true for old formats (<= 0.92), for newer formats, a
620
# couple of seconds only should be needed to load the whole graph and the
621
# other graph operations needed are even faster than that -- vila 100201
622
initial_revisions = []
623
if delayed_graph_generation:
625
for rev_id, revno, depth in _linear_view_revisions(
626
branch, start_rev_id, end_rev_id, exclude_common_ancestry):
627
if _has_merges(branch, rev_id):
628
# The end_rev_id can be nested down somewhere. We need an
629
# explicit ancestry check. There is an ambiguity here as we
630
# may not raise _StartNotLinearAncestor for a revision that
631
# is an ancestor but not a *linear* one. But since we have
632
# loaded the graph to do the check (or calculate a dotted
633
# revno), we may as well accept to show the log... We need
634
# the check only if start_rev_id is not None as all
635
# revisions have _mod_revision.NULL_REVISION as an ancestor
637
graph = branch.repository.get_graph()
638
if (start_rev_id is not None
639
and not graph.is_ancestor(start_rev_id, end_rev_id)):
640
raise _StartNotLinearAncestor()
641
# Since we collected the revisions so far, we need to
646
initial_revisions.append((rev_id, revno, depth))
648
# No merged revisions found
649
return initial_revisions
650
except _StartNotLinearAncestor:
651
# A merge was never detected so the lower revision limit can't
652
# be nested down somewhere
653
raise errors.BzrCommandError(gettext('Start revision not found in'
654
' history of end revision.'))
656
# We exit the loop above because we encounter a revision with merges, from
657
# this revision, we need to switch to _graph_view_revisions.
659
# A log including nested merges is required. If the direction is reverse,
660
# we rebase the initial merge depths so that the development line is
661
# shown naturally, i.e. just like it is for linear logging. We can easily
662
# make forward the exact opposite display, but showing the merge revisions
663
# indented at the end seems slightly nicer in that case.
664
view_revisions = chain(iter(initial_revisions),
665
_graph_view_revisions(branch, start_rev_id, end_rev_id,
666
rebase_initial_depths=(direction == 'reverse'),
667
exclude_common_ancestry=exclude_common_ancestry))
668
return view_revisions
671
def _has_merges(branch, rev_id):
672
"""Does a revision have multiple parents or not?"""
673
parents = branch.repository.get_parent_map([rev_id]).get(rev_id, [])
674
return len(parents) > 1
677
def _compute_revno_str(branch, rev_id):
678
"""Compute the revno string from a rev_id.
680
:return: The revno string, or None if the revision is not in the supplied
684
revno = branch.revision_id_to_dotted_revno(rev_id)
685
except errors.NoSuchRevision:
686
# The revision must be outside of this branch
689
return '.'.join(str(n) for n in revno)
692
def _is_obvious_ancestor(branch, start_rev_id, end_rev_id):
693
"""Is start_rev_id an obvious ancestor of end_rev_id?"""
694
if start_rev_id and end_rev_id:
696
start_dotted = branch.revision_id_to_dotted_revno(start_rev_id)
697
end_dotted = branch.revision_id_to_dotted_revno(end_rev_id)
698
except errors.NoSuchRevision:
699
# one or both is not in the branch; not obvious
701
if len(start_dotted) == 1 and len(end_dotted) == 1:
703
return start_dotted[0] <= end_dotted[0]
704
elif (len(start_dotted) == 3 and len(end_dotted) == 3 and
705
start_dotted[0:1] == end_dotted[0:1]):
706
# both on same development line
707
return start_dotted[2] <= end_dotted[2]
711
# if either start or end is not specified then we use either the first or
712
# the last revision and *they* are obvious ancestors.
716
def _linear_view_revisions(branch, start_rev_id, end_rev_id,
717
exclude_common_ancestry=False):
718
"""Calculate a sequence of revisions to view, newest to oldest.
720
:param start_rev_id: the lower revision-id
721
:param end_rev_id: the upper revision-id
722
:param exclude_common_ancestry: Whether the start_rev_id should be part of
723
the iterated revisions.
724
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples.
725
:raises _StartNotLinearAncestor: if a start_rev_id is specified but
726
is not found walking the left-hand history
728
br_revno, br_rev_id = branch.last_revision_info()
729
repo = branch.repository
730
graph = repo.get_graph()
731
if start_rev_id is None and end_rev_id is None:
733
for revision_id in graph.iter_lefthand_ancestry(br_rev_id,
734
(_mod_revision.NULL_REVISION,)):
735
yield revision_id, str(cur_revno), 0
738
if end_rev_id is None:
739
end_rev_id = br_rev_id
740
found_start = start_rev_id is None
741
for revision_id in graph.iter_lefthand_ancestry(end_rev_id,
742
(_mod_revision.NULL_REVISION,)):
743
revno_str = _compute_revno_str(branch, revision_id)
744
if not found_start and revision_id == start_rev_id:
745
if not exclude_common_ancestry:
746
yield revision_id, revno_str, 0
750
yield revision_id, revno_str, 0
753
raise _StartNotLinearAncestor()
756
def _graph_view_revisions(branch, start_rev_id, end_rev_id,
757
rebase_initial_depths=True,
758
exclude_common_ancestry=False):
759
"""Calculate revisions to view including merges, newest to oldest.
761
:param branch: the branch
762
:param start_rev_id: the lower revision-id
763
:param end_rev_id: the upper revision-id
764
:param rebase_initial_depth: should depths be rebased until a mainline
766
:return: An iterator of (revision_id, dotted_revno, merge_depth) tuples.
768
if exclude_common_ancestry:
769
stop_rule = 'with-merges-without-common-ancestry'
771
stop_rule = 'with-merges'
772
view_revisions = branch.iter_merge_sorted_revisions(
773
start_revision_id=end_rev_id, stop_revision_id=start_rev_id,
775
if not rebase_initial_depths:
776
for (rev_id, merge_depth, revno, end_of_merge
778
yield rev_id, '.'.join(map(str, revno)), merge_depth
780
# We're following a development line starting at a merged revision.
781
# We need to adjust depths down by the initial depth until we find
782
# a depth less than it. Then we use that depth as the adjustment.
783
# If and when we reach the mainline, depth adjustment ends.
784
depth_adjustment = None
785
for (rev_id, merge_depth, revno, end_of_merge
787
if depth_adjustment is None:
788
depth_adjustment = merge_depth
790
if merge_depth < depth_adjustment:
791
# From now on we reduce the depth adjustement, this can be
792
# surprising for users. The alternative requires two passes
793
# which breaks the fast display of the first revision
795
depth_adjustment = merge_depth
796
merge_depth -= depth_adjustment
797
yield rev_id, '.'.join(map(str, revno)), merge_depth
800
def _rebase_merge_depth(view_revisions):
801
"""Adjust depths upwards so the top level is 0."""
802
# If either the first or last revision have a merge_depth of 0, we're done
276
803
if view_revisions and view_revisions[0][2] and view_revisions[-1][2]:
277
804
min_depth = min([d for r,n,d in view_revisions])
278
805
if min_depth != 0:
311
835
yield (view, None, None)
312
836
log_rev_iterator = iter([_convert()])
313
837
for adapter in log_adapters:
314
log_rev_iterator = adapter(branch, generate_delta, search,
838
# It would be nicer if log adapters were first class objects
839
# with custom parameters. This will do for now. IGC 20090127
840
if adapter == _make_delta_filter:
841
log_rev_iterator = adapter(branch, generate_delta,
842
search, log_rev_iterator, file_ids, direction)
844
log_rev_iterator = adapter(branch, generate_delta,
845
search, log_rev_iterator)
316
846
return log_rev_iterator
319
def _make_search_filter(branch, generate_delta, search, log_rev_iterator):
849
def _make_search_filter(branch, generate_delta, match, log_rev_iterator):
320
850
"""Create a filtered iterator of log_rev_iterator matching on a regex.
322
852
:param branch: The branch being logged.
323
853
:param generate_delta: Whether to generate a delta for each revision.
854
:param match: A dictionary with properties as keys and lists of strings
855
as values. To match, a revision may match any of the supplied strings
856
within a single property but must match at least one string for each
858
:param log_rev_iterator: An input iterator containing all revisions that
859
could be displayed, in lists.
860
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
864
return log_rev_iterator
865
searchRE = [(k, [re.compile(x, re.IGNORECASE) for x in v])
866
for (k,v) in match.iteritems()]
867
return _filter_re(searchRE, log_rev_iterator)
870
def _filter_re(searchRE, log_rev_iterator):
871
for revs in log_rev_iterator:
872
new_revs = [rev for rev in revs if _match_filter(searchRE, rev[1])]
876
def _match_filter(searchRE, rev):
878
'message': (rev.message,),
879
'committer': (rev.committer,),
880
'author': (rev.get_apparent_authors()),
881
'bugs': list(rev.iter_bugs())
883
strings[''] = [item for inner_list in strings.itervalues()
884
for item in inner_list]
885
for (k,v) in searchRE:
886
if k in strings and not _match_any_filter(strings[k], v):
890
def _match_any_filter(strings, res):
891
return any([filter(None, map(re.search, strings)) for re in res])
893
def _make_delta_filter(branch, generate_delta, search, log_rev_iterator,
894
fileids=None, direction='reverse'):
895
"""Add revision deltas to a log iterator if needed.
897
:param branch: The branch being logged.
898
:param generate_delta: Whether to generate a delta for each revision.
899
Permitted values are None, 'full' and 'partial'.
324
900
:param search: A user text search string.
325
901
:param log_rev_iterator: An input iterator containing all revisions that
326
902
could be displayed, in lists.
903
:param fileids: If non empty, only revisions matching one or more of
904
the file-ids are to be kept.
905
:param direction: the direction in which view_revisions is sorted
327
906
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
909
if not generate_delta and not fileids:
331
910
return log_rev_iterator
332
# Compile the search now to get early errors.
333
searchRE = re.compile(search, re.IGNORECASE)
334
return _filter_message_re(searchRE, log_rev_iterator)
337
def _filter_message_re(searchRE, log_rev_iterator):
911
return _generate_deltas(branch.repository, log_rev_iterator,
912
generate_delta, fileids, direction)
915
def _generate_deltas(repository, log_rev_iterator, delta_type, fileids,
917
"""Create deltas for each batch of revisions in log_rev_iterator.
919
If we're only generating deltas for the sake of filtering against
920
file-ids, we stop generating deltas once all file-ids reach the
921
appropriate life-cycle point. If we're receiving data newest to
922
oldest, then that life-cycle point is 'add', otherwise it's 'remove'.
924
check_fileids = fileids is not None and len(fileids) > 0
926
fileid_set = set(fileids)
927
if direction == 'reverse':
338
933
for revs in log_rev_iterator:
934
# If we were matching against fileids and we've run out,
935
# there's nothing left to do
936
if check_fileids and not fileid_set:
938
revisions = [rev[1] for rev in revs]
340
for (rev_id, revno, merge_depth), rev, delta in revs:
341
if searchRE.search(rev.message):
342
new_revs.append(((rev_id, revno, merge_depth), rev, delta))
940
if delta_type == 'full' and not check_fileids:
941
deltas = repository.get_deltas_for_revisions(revisions)
942
for rev, delta in izip(revs, deltas):
943
new_revs.append((rev[0], rev[1], delta))
945
deltas = repository.get_deltas_for_revisions(revisions, fileid_set)
946
for rev, delta in izip(revs, deltas):
948
if delta is None or not delta.has_changed():
951
_update_fileids(delta, fileid_set, stop_on)
952
if delta_type is None:
954
elif delta_type == 'full':
955
# If the file matches all the time, rebuilding
956
# a full delta like this in addition to a partial
957
# one could be slow. However, it's likely that
958
# most revisions won't get this far, making it
959
# faster to filter on the partial deltas and
960
# build the occasional full delta than always
961
# building full deltas and filtering those.
963
delta = repository.get_revision_delta(rev_id)
964
new_revs.append((rev[0], rev[1], delta))
346
def _make_delta_filter(branch, generate_delta, search, log_rev_iterator):
347
"""Add revision deltas to a log iterator if needed.
968
def _update_fileids(delta, fileids, stop_on):
969
"""Update the set of file-ids to search based on file lifecycle events.
349
:param branch: The branch being logged.
350
:param generate_delta: Whether to generate a delta for each revision.
351
:param search: A user text search string.
352
:param log_rev_iterator: An input iterator containing all revisions that
353
could be displayed, in lists.
354
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
971
:param fileids: a set of fileids to update
972
:param stop_on: either 'add' or 'remove' - take file-ids out of the
973
fileids set once their add or remove entry is detected respectively
357
if not generate_delta:
358
return log_rev_iterator
359
return _generate_deltas(branch.repository, log_rev_iterator)
362
def _generate_deltas(repository, log_rev_iterator):
363
"""Create deltas for each batch of revisions in log_rev_iterator."""
364
for revs in log_rev_iterator:
365
revisions = [rev[1] for rev in revs]
366
deltas = repository.get_deltas_for_revisions(revisions)
367
revs = [(rev[0], rev[1], delta) for rev, delta in izip(revs, deltas)]
976
for item in delta.added:
977
if item[1] in fileids:
978
fileids.remove(item[1])
979
elif stop_on == 'delete':
980
for item in delta.removed:
981
if item[1] in fileids:
982
fileids.remove(item[1])
371
985
def _make_revision_objects(branch, generate_delta, search, log_rev_iterator):
754
1416
def short_author(self, rev):
755
name, address = config.parse_username(rev.get_apparent_author())
1417
return self.authors(rev, 'first', short=True, sep=', ')
1419
def authors(self, rev, who, short=False, sep=None):
1420
"""Generate list of authors, taking --authors option into account.
1422
The caller has to specify the name of a author list handler,
1423
as provided by the author list registry, using the ``who``
1424
argument. That name only sets a default, though: when the
1425
user selected a different author list generation using the
1426
``--authors`` command line switch, as represented by the
1427
``author_list_handler`` constructor argument, that value takes
1430
:param rev: The revision for which to generate the list of authors.
1431
:param who: Name of the default handler.
1432
:param short: Whether to shorten names to either name or address.
1433
:param sep: What separator to use for automatic concatenation.
1435
if self._author_list_handler is not None:
1436
# The user did specify --authors, which overrides the default
1437
author_list_handler = self._author_list_handler
1439
# The user didn't specify --authors, so we use the caller's default
1440
author_list_handler = author_list_registry.get(who)
1441
names = author_list_handler(rev)
1443
for i in range(len(names)):
1444
name, address = config.parse_username(names[i])
1450
names = sep.join(names)
1453
def merge_marker(self, revision):
1454
"""Get the merge marker to include in the output or '' if none."""
1455
if len(revision.rev.parent_ids) > 1:
1456
self._merge_count += 1
760
1461
def show_properties(self, revision, indent):
761
1462
"""Displays the custom properties returned by each registered handler.
763
If a registered handler raises an error it is propagated.
1464
If a registered handler raises an error it is propagated.
1466
for line in self.custom_properties(revision):
1467
self.to_file.write("%s%s\n" % (indent, line))
1469
def custom_properties(self, revision):
1470
"""Format the custom properties returned by each registered handler.
1472
If a registered handler raises an error it is propagated.
1474
:return: a list of formatted lines (excluding trailing newlines)
1476
lines = self._foreign_info_properties(revision)
765
1477
for key, handler in properties_handler_registry.iteritems():
766
for key, value in handler(revision).items():
767
self.to_file.write(indent + key + ': ' + value + '\n')
1478
lines.extend(self._format_properties(handler(revision)))
1481
def _foreign_info_properties(self, rev):
1482
"""Custom log displayer for foreign revision identifiers.
1484
:param rev: Revision object.
1486
# Revision comes directly from a foreign repository
1487
if isinstance(rev, foreign.ForeignRevision):
1488
return self._format_properties(
1489
rev.mapping.vcs.show_foreign_revid(rev.foreign_revid))
1491
# Imported foreign revision revision ids always contain :
1492
if not ":" in rev.revision_id:
1495
# Revision was once imported from a foreign repository
1497
foreign_revid, mapping = \
1498
foreign.foreign_vcs_registry.parse_revision_id(rev.revision_id)
1499
except errors.InvalidRevisionId:
1502
return self._format_properties(
1503
mapping.vcs.show_foreign_revid(foreign_revid))
1505
def _format_properties(self, properties):
1507
for key, value in properties.items():
1508
lines.append(key + ': ' + value)
1511
def show_diff(self, to_file, diff, indent):
1512
for l in diff.rstrip().split('\n'):
1513
to_file.write(indent + '%s\n' % (l,))
1516
# Separator between revisions in long format
1517
_LONG_SEP = '-' * 60
770
1520
class LongLogFormatter(LogFormatter):
772
1522
supports_merge_revisions = True
1523
preferred_levels = 1
773
1524
supports_delta = True
774
1525
supports_tags = True
1526
supports_diff = True
1527
supports_signatures = True
1529
def __init__(self, *args, **kwargs):
1530
super(LongLogFormatter, self).__init__(*args, **kwargs)
1531
if self.show_timezone == 'original':
1532
self.date_string = self._date_string_original_timezone
1534
self.date_string = self._date_string_with_timezone
1536
def _date_string_with_timezone(self, rev):
1537
return format_date(rev.timestamp, rev.timezone or 0,
1540
def _date_string_original_timezone(self, rev):
1541
return format_date_with_offset_in_original_timezone(rev.timestamp,
776
1544
def log_revision(self, revision):
777
1545
"""Log a revision, either merged or not."""
778
1546
indent = ' ' * revision.merge_depth
779
to_file = self.to_file
780
to_file.write(indent + '-' * 60 + '\n')
781
1548
if revision.revno is not None:
782
to_file.write(indent + 'revno: %s\n' % (revision.revno,))
1549
lines.append('revno: %s%s' % (revision.revno,
1550
self.merge_marker(revision)))
783
1551
if revision.tags:
784
to_file.write(indent + 'tags: %s\n' % (', '.join(revision.tags)))
1552
lines.append('tags: %s' % (', '.join(revision.tags)))
1553
if self.show_ids or revision.revno is None:
1554
lines.append('revision-id: %s' % (revision.rev.revision_id,))
785
1555
if self.show_ids:
786
to_file.write(indent + 'revision-id: ' + revision.rev.revision_id)
788
1556
for parent_id in revision.rev.parent_ids:
789
to_file.write(indent + 'parent: %s\n' % (parent_id,))
790
self.show_properties(revision.rev, indent)
1557
lines.append('parent: %s' % (parent_id,))
1558
lines.extend(self.custom_properties(revision.rev))
792
author = revision.rev.properties.get('author', None)
793
if author is not None:
794
to_file.write(indent + 'author: %s\n' % (author,))
795
to_file.write(indent + 'committer: %s\n' % (revision.rev.committer,))
1560
committer = revision.rev.committer
1561
authors = self.authors(revision.rev, 'all')
1562
if authors != [committer]:
1563
lines.append('author: %s' % (", ".join(authors),))
1564
lines.append('committer: %s' % (committer,))
797
1566
branch_nick = revision.rev.properties.get('branch-nick', None)
798
1567
if branch_nick is not None:
799
to_file.write(indent + 'branch nick: %s\n' % (branch_nick,))
801
date_str = format_date(revision.rev.timestamp,
802
revision.rev.timezone or 0,
804
to_file.write(indent + 'timestamp: %s\n' % (date_str,))
806
to_file.write(indent + 'message:\n')
1568
lines.append('branch nick: %s' % (branch_nick,))
1570
lines.append('timestamp: %s' % (self.date_string(revision.rev),))
1572
if revision.signature is not None:
1573
lines.append('signature: ' + revision.signature)
1575
lines.append('message:')
807
1576
if not revision.rev.message:
808
to_file.write(indent + ' (no message)\n')
1577
lines.append(' (no message)')
810
1579
message = revision.rev.message.rstrip('\r\n')
811
1580
for l in message.split('\n'):
812
to_file.write(indent + ' %s\n' % (l,))
1581
lines.append(' %s' % (l,))
1583
# Dump the output, appending the delta and diff if requested
1584
to_file = self.to_file
1585
to_file.write("%s%s\n" % (indent, ('\n' + indent).join(lines)))
813
1586
if revision.delta is not None:
814
revision.delta.show(to_file, self.show_ids, indent=indent)
1587
# Use the standard status output to display changes
1588
from bzrlib.delta import report_delta
1589
report_delta(to_file, revision.delta, short_status=False,
1590
show_ids=self.show_ids, indent=indent)
1591
if revision.diff is not None:
1592
to_file.write(indent + 'diff:\n')
1594
# Note: we explicitly don't indent the diff (relative to the
1595
# revision information) so that the output can be fed to patch -p0
1596
self.show_diff(self.to_exact_file, revision.diff, indent)
1597
self.to_exact_file.flush()
1599
def get_advice_separator(self):
1600
"""Get the text separating the log from the closing advice."""
1601
return '-' * 60 + '\n'
817
1604
class ShortLogFormatter(LogFormatter):
1606
supports_merge_revisions = True
1607
preferred_levels = 1
819
1608
supports_delta = True
820
supports_single_merge_revision = True
1609
supports_tags = True
1610
supports_diff = True
1612
def __init__(self, *args, **kwargs):
1613
super(ShortLogFormatter, self).__init__(*args, **kwargs)
1614
self.revno_width_by_depth = {}
822
1616
def log_revision(self, revision):
1617
# We need two indents: one per depth and one for the information
1618
# relative to that indent. Most mainline revnos are 5 chars or
1619
# less while dotted revnos are typically 11 chars or less. Once
1620
# calculated, we need to remember the offset for a given depth
1621
# as we might be starting from a dotted revno in the first column
1622
# and we want subsequent mainline revisions to line up.
1623
depth = revision.merge_depth
1624
indent = ' ' * depth
1625
revno_width = self.revno_width_by_depth.get(depth)
1626
if revno_width is None:
1627
if revision.revno is None or revision.revno.find('.') == -1:
1628
# mainline revno, e.g. 12345
1631
# dotted revno, e.g. 12345.10.55
1633
self.revno_width_by_depth[depth] = revno_width
1634
offset = ' ' * (revno_width + 1)
823
1636
to_file = self.to_file
825
if len(revision.rev.parent_ids) > 1:
826
is_merge = ' [merge]'
827
to_file.write("%5s %s\t%s%s\n" % (revision.revno,
828
self.short_author(revision.rev),
1639
tags = ' {%s}' % (', '.join(revision.tags))
1640
to_file.write(indent + "%*s %s\t%s%s%s\n" % (revno_width,
1641
revision.revno or "", self.short_author(revision.rev),
829
1642
format_date(revision.rev.timestamp,
830
1643
revision.rev.timezone or 0,
831
1644
self.show_timezone, date_fmt="%Y-%m-%d",
832
1645
show_offset=False),
835
to_file.write(' revision-id:%s\n' % (revision.rev.revision_id,))
1646
tags, self.merge_marker(revision)))
1647
self.show_properties(revision.rev, indent+offset)
1648
if self.show_ids or revision.revno is None:
1649
to_file.write(indent + offset + 'revision-id:%s\n'
1650
% (revision.rev.revision_id,))
836
1651
if not revision.rev.message:
837
to_file.write(' (no message)\n')
1652
to_file.write(indent + offset + '(no message)\n')
839
1654
message = revision.rev.message.rstrip('\r\n')
840
1655
for l in message.split('\n'):
841
to_file.write(' %s\n' % (l,))
1656
to_file.write(indent + offset + '%s\n' % (l,))
843
# TODO: Why not show the modified files in a shorter form as
844
# well? rewrap them single lines of appropriate length
845
1658
if revision.delta is not None:
846
revision.delta.show(to_file, self.show_ids)
1659
# Use the standard status output to display changes
1660
from bzrlib.delta import report_delta
1661
report_delta(to_file, revision.delta,
1662
short_status=self.delta_format==1,
1663
show_ids=self.show_ids, indent=indent + offset)
1664
if revision.diff is not None:
1665
self.show_diff(self.to_exact_file, revision.diff, ' ')
847
1666
to_file.write('\n')
850
1669
class LineLogFormatter(LogFormatter):
852
supports_single_merge_revision = True
1671
supports_merge_revisions = True
1672
preferred_levels = 1
1673
supports_tags = True
854
1675
def __init__(self, *args, **kwargs):
855
1676
super(LineLogFormatter, self).__init__(*args, **kwargs)
856
self._max_chars = terminal_width() - 1
1677
width = terminal_width()
1678
if width is not None:
1679
# we need one extra space for terminals that wrap on last char
1681
self._max_chars = width
858
1683
def truncate(self, str, max_len):
859
if len(str) <= max_len:
1684
if max_len is None or len(str) <= max_len:
861
return str[:max_len-3]+'...'
1686
return str[:max_len-3] + '...'
863
1688
def date_string(self, rev):
864
return format_date(rev.timestamp, rev.timezone or 0,
1689
return format_date(rev.timestamp, rev.timezone or 0,
865
1690
self.show_timezone, date_fmt="%Y-%m-%d",
866
1691
show_offset=False)
1904
def get_history_change(old_revision_id, new_revision_id, repository):
1905
"""Calculate the uncommon lefthand history between two revisions.
1907
:param old_revision_id: The original revision id.
1908
:param new_revision_id: The new revision id.
1909
:param repository: The repository to use for the calculation.
1911
return old_history, new_history
1914
old_revisions = set()
1916
new_revisions = set()
1917
graph = repository.get_graph()
1918
new_iter = graph.iter_lefthand_ancestry(new_revision_id)
1919
old_iter = graph.iter_lefthand_ancestry(old_revision_id)
1920
stop_revision = None
1923
while do_new or do_old:
1926
new_revision = new_iter.next()
1927
except StopIteration:
1930
new_history.append(new_revision)
1931
new_revisions.add(new_revision)
1932
if new_revision in old_revisions:
1933
stop_revision = new_revision
1937
old_revision = old_iter.next()
1938
except StopIteration:
1941
old_history.append(old_revision)
1942
old_revisions.add(old_revision)
1943
if old_revision in new_revisions:
1944
stop_revision = old_revision
1946
new_history.reverse()
1947
old_history.reverse()
1948
if stop_revision is not None:
1949
new_history = new_history[new_history.index(stop_revision) + 1:]
1950
old_history = old_history[old_history.index(stop_revision) + 1:]
1951
return old_history, new_history
1954
def show_branch_change(branch, output, old_revno, old_revision_id):
1955
"""Show the changes made to a branch.
1957
:param branch: The branch to show changes about.
1958
:param output: A file-like object to write changes to.
1959
:param old_revno: The revno of the old tip.
1960
:param old_revision_id: The revision_id of the old tip.
1962
new_revno, new_revision_id = branch.last_revision_info()
1963
old_history, new_history = get_history_change(old_revision_id,
1966
if old_history == [] and new_history == []:
1967
output.write('Nothing seems to have changed\n')
1970
log_format = log_formatter_registry.get_default(branch)
1971
lf = log_format(show_ids=False, to_file=output, show_timezone='original')
1972
if old_history != []:
1973
output.write('*'*60)
1974
output.write('\nRemoved Revisions:\n')
1975
show_flat_log(branch.repository, old_history, old_revno, lf)
1976
output.write('*'*60)
1977
output.write('\n\n')
1978
if new_history != []:
1979
output.write('Added Revisions:\n')
1980
start_revno = new_revno - len(new_history) + 1
1981
show_log(branch, lf, None, verbose=False, direction='forward',
1982
start_revision=start_revno,)
1985
def show_flat_log(repository, history, last_revno, lf):
1986
"""Show a simple log of the specified history.
1988
:param repository: The repository to retrieve revisions from.
1989
:param history: A list of revision_ids indicating the lefthand history.
1990
:param last_revno: The revno of the last revision_id in the history.
1991
:param lf: The log formatter to use.
1993
start_revno = last_revno - len(history) + 1
1994
revisions = repository.get_revisions(history)
1995
for i, rev in enumerate(revisions):
1996
lr = LogRevision(rev, i + last_revno, 0, None)
2000
def _get_info_for_log_files(revisionspec_list, file_list, add_cleanup):
2001
"""Find file-ids and kinds given a list of files and a revision range.
2003
We search for files at the end of the range. If not found there,
2004
we try the start of the range.
2006
:param revisionspec_list: revision range as parsed on the command line
2007
:param file_list: the list of paths given on the command line;
2008
the first of these can be a branch location or a file path,
2009
the remainder must be file paths
2010
:param add_cleanup: When the branch returned is read locked,
2011
an unlock call will be queued to the cleanup.
2012
:return: (branch, info_list, start_rev_info, end_rev_info) where
2013
info_list is a list of (relative_path, file_id, kind) tuples where
2014
kind is one of values 'directory', 'file', 'symlink', 'tree-reference'.
2015
branch will be read-locked.
2017
from bzrlib.builtins import _get_revision_range
2018
tree, b, path = controldir.ControlDir.open_containing_tree_or_branch(
2020
add_cleanup(b.lock_read().unlock)
2021
# XXX: It's damn messy converting a list of paths to relative paths when
2022
# those paths might be deleted ones, they might be on a case-insensitive
2023
# filesystem and/or they might be in silly locations (like another branch).
2024
# For example, what should "log bzr://branch/dir/file1 file2" do? (Is
2025
# file2 implicitly in the same dir as file1 or should its directory be
2026
# taken from the current tree somehow?) For now, this solves the common
2027
# case of running log in a nested directory, assuming paths beyond the
2028
# first one haven't been deleted ...
2030
relpaths = [path] + tree.safe_relpath_files(file_list[1:])
2032
relpaths = [path] + file_list[1:]
2034
start_rev_info, end_rev_info = _get_revision_range(revisionspec_list, b,
2036
if relpaths in ([], [u'']):
2037
return b, [], start_rev_info, end_rev_info
2038
if start_rev_info is None and end_rev_info is None:
2040
tree = b.basis_tree()
2043
file_id = tree.path2id(fp)
2044
kind = _get_kind_for_file_id(tree, file_id)
2046
# go back to when time began
2049
rev1 = b.get_rev_id(1)
2050
except errors.NoSuchRevision:
2055
tree1 = b.repository.revision_tree(rev1)
2057
file_id = tree1.path2id(fp)
2058
kind = _get_kind_for_file_id(tree1, file_id)
2059
info_list.append((fp, file_id, kind))
2061
elif start_rev_info == end_rev_info:
2062
# One revision given - file must exist in it
2063
tree = b.repository.revision_tree(end_rev_info.rev_id)
2065
file_id = tree.path2id(fp)
2066
kind = _get_kind_for_file_id(tree, file_id)
2067
info_list.append((fp, file_id, kind))
2070
# Revision range given. Get the file-id from the end tree.
2071
# If that fails, try the start tree.
2072
rev_id = end_rev_info.rev_id
2074
tree = b.basis_tree()
2076
tree = b.repository.revision_tree(rev_id)
2079
file_id = tree.path2id(fp)
2080
kind = _get_kind_for_file_id(tree, file_id)
2083
rev_id = start_rev_info.rev_id
2085
rev1 = b.get_rev_id(1)
2086
tree1 = b.repository.revision_tree(rev1)
2088
tree1 = b.repository.revision_tree(rev_id)
2089
file_id = tree1.path2id(fp)
2090
kind = _get_kind_for_file_id(tree1, file_id)
2091
info_list.append((fp, file_id, kind))
2092
return b, info_list, start_rev_info, end_rev_info
2095
def _get_kind_for_file_id(tree, file_id):
2096
"""Return the kind of a file-id or None if it doesn't exist."""
2097
if file_id is not None:
2098
return tree.kind(file_id)
1005
2103
properties_handler_registry = registry.Registry()
2105
# Use the properties handlers to print out bug information if available
2106
def _bugs_properties_handler(revision):
2107
if revision.properties.has_key('bugs'):
2108
bug_lines = revision.properties['bugs'].split('\n')
2109
bug_rows = [line.split(' ', 1) for line in bug_lines]
2110
fixed_bug_urls = [row[0] for row in bug_rows if
2111
len(row) > 1 and row[1] == 'fixed']
2114
return {ngettext('fixes bug', 'fixes bugs', len(fixed_bug_urls)):\
2115
' '.join(fixed_bug_urls)}
2118
properties_handler_registry.register('bugs_properties_handler',
2119
_bugs_properties_handler)
1007
2122
# adapters which revision ids to log are filtered. When log is called, the
1008
2123
# log_rev_iterator is adapted through each of these factory methods.
1009
2124
# Plugins are welcome to mutate this list in any way they like - as long
added
removed
bzrlib/log.py
