168
178
:param match: Dictionary of search lists to use when matching revision
181
# Convert old-style parameters to new-style parameters
182
if specific_fileid is not None:
183
file_ids = [specific_fileid]
188
delta_type = 'partial'
174
192
delta_type = None
195
diff_type = 'partial'
180
201
if isinstance(start_revision, int):
182
203
start_revision = revisionspec.RevisionInfo(branch, start_revision)
183
except (errors.NoSuchRevision, errors.RevnoOutOfBounds):
204
except errors.NoSuchRevision:
184
205
raise errors.InvalidRevisionNumber(start_revision)
186
207
if isinstance(end_revision, int):
188
209
end_revision = revisionspec.RevisionInfo(branch, end_revision)
189
except (errors.NoSuchRevision, errors.RevnoOutOfBounds):
210
except errors.NoSuchRevision:
190
211
raise errors.InvalidRevisionNumber(end_revision)
192
213
if end_revision is not None and end_revision.revno == 0:
193
214
raise errors.InvalidRevisionNumber(end_revision.revno)
195
216
# Build the request and execute it
196
rqst = make_log_request_dict(
217
rqst = make_log_request_dict(direction=direction, specific_fileids=file_ids,
198
218
start_revision=start_revision, end_revision=end_revision,
199
limit=limit, delta_type=delta_type, diff_type=diff_type)
219
limit=limit, message_search=search,
220
delta_type=delta_type, diff_type=diff_type)
200
221
Logger(branch, rqst).show(lf)
410
431
Subclasses may wish to override this.
412
return _DefaultLogGenerator(branch, **rqst)
415
def _log_revision_iterator_using_per_file_graph(
416
branch, delta_type, match, levels, path, start_rev_id, end_rev_id,
417
direction, exclude_common_ancestry):
418
# Get the base revisions, filtering by the revision range.
419
# Note that we always generate the merge revisions because
420
# filter_revisions_touching_path() requires them ...
421
view_revisions = _calc_view_revisions(
422
branch, start_rev_id, end_rev_id,
423
direction, generate_merge_revisions=True,
424
exclude_common_ancestry=exclude_common_ancestry)
425
if not isinstance(view_revisions, list):
426
view_revisions = list(view_revisions)
427
view_revisions = _filter_revisions_touching_path(
428
branch, path, view_revisions,
429
include_merges=levels != 1)
430
return make_log_rev_iterator(
431
branch, view_revisions, delta_type, match)
434
def _log_revision_iterator_using_delta_matching(
435
branch, delta_type, match, levels, specific_files, start_rev_id, end_rev_id,
436
direction, exclude_common_ancestry, limit):
437
# Get the base revisions, filtering by the revision range
438
generate_merge_revisions = levels != 1
439
delayed_graph_generation = not specific_files and (
440
limit or start_rev_id or end_rev_id)
441
view_revisions = _calc_view_revisions(
442
branch, start_rev_id, end_rev_id,
444
generate_merge_revisions=generate_merge_revisions,
445
delayed_graph_generation=delayed_graph_generation,
446
exclude_common_ancestry=exclude_common_ancestry)
448
# Apply the other filters
449
return make_log_rev_iterator(branch, view_revisions,
451
files=specific_files,
455
def _format_diff(branch, rev, diff_type, files=None):
458
:param branch: Branch object
459
:param rev: Revision object
460
:param diff_type: Type of diff to generate
461
:param files: List of files to generate diff for (or None for all)
463
repo = branch.repository
464
if len(rev.parent_ids) == 0:
465
ancestor_id = _mod_revision.NULL_REVISION
467
ancestor_id = rev.parent_ids[0]
468
tree_1 = repo.revision_tree(ancestor_id)
469
tree_2 = repo.revision_tree(rev.revision_id)
470
if diff_type == 'partial' and files is not None:
471
specific_files = files
473
specific_files = None
475
path_encoding = get_diff_header_encoding()
476
diff.show_diff_trees(tree_1, tree_2, s, specific_files, old_label='',
477
new_label='', path_encoding=path_encoding)
433
return _DefaultLogGenerator(branch, rqst)
481
436
class _StartNotLinearAncestor(Exception):
485
440
class _DefaultLogGenerator(LogGenerator):
486
441
"""The default generator of log revisions."""
489
self, branch, levels=None, limit=None, diff_type=None,
490
delta_type=None, show_signature=None, omit_merges=None,
491
generate_tags=None, specific_files=None, match=None,
492
start_revision=None, end_revision=None, direction=None,
493
exclude_common_ancestry=None, _match_using_deltas=None,
443
def __init__(self, branch, rqst):
495
444
self.branch = branch
498
self.diff_type = diff_type
499
self.delta_type = delta_type
500
self.show_signature = signature
501
self.omit_merges = omit_merges
502
self.specific_files = specific_files
504
self.start_revision = start_revision
505
self.end_revision = end_revision
506
self.direction = direction
507
self.exclude_common_ancestry = exclude_common_ancestry
508
self._match_using_deltas = _match_using_deltas
509
if generate_tags and branch.supports_tags():
446
if rqst.get('generate_tags') and branch.supports_tags():
510
447
self.rev_tag_dict = branch.tags.get_reverse_tag_dict()
512
449
self.rev_tag_dict = {}
517
454
:return: An iterator yielding LogRevision objects.
457
levels = rqst.get('levels')
458
limit = rqst.get('limit')
459
diff_type = rqst.get('diff_type')
460
show_signature = rqst.get('signature')
461
omit_merges = rqst.get('omit_merges')
520
463
revision_iterator = self._create_log_revision_iterator()
521
464
for revs in revision_iterator:
522
465
for (rev_id, revno, merge_depth), rev, delta in revs:
523
466
# 0 levels means show everything; merge_depth counts from 0
524
if (self.levels != 0 and merge_depth is not None and
525
merge_depth >= self.levels):
467
if levels != 0 and merge_depth >= levels:
527
if self.omit_merges and len(rev.parent_ids) > 1:
469
if omit_merges and len(rev.parent_ids) > 1:
530
472
raise errors.GhostRevisionUnusableHere(rev_id)
531
if self.diff_type is None:
473
if diff_type is None:
535
self.branch, rev, self.diff_type,
537
if self.show_signature:
476
diff = self._format_diff(rev, rev_id, diff_type)
538
478
signature = format_signature_validity(rev_id, self.branch)
542
rev, revno, merge_depth, delta,
481
yield LogRevision(rev, revno, merge_depth, delta,
543
482
self.rev_tag_dict.get(rev_id), diff, signature)
546
if log_count >= self.limit:
485
if log_count >= limit:
488
def _format_diff(self, rev, rev_id, diff_type):
489
repo = self.branch.repository
490
if len(rev.parent_ids) == 0:
491
ancestor_id = _mod_revision.NULL_REVISION
493
ancestor_id = rev.parent_ids[0]
494
tree_1 = repo.revision_tree(ancestor_id)
495
tree_2 = repo.revision_tree(rev_id)
496
file_ids = self.rqst.get('specific_fileids')
497
if diff_type == 'partial' and file_ids is not None:
498
specific_files = [tree_2.id2path(id) for id in file_ids]
500
specific_files = None
502
path_encoding = get_diff_header_encoding()
503
diff.show_diff_trees(tree_1, tree_2, s, specific_files, old_label='',
504
new_label='', path_encoding=path_encoding)
549
507
def _create_log_revision_iterator(self):
550
508
"""Create a revision iterator for log.
552
510
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
555
start_rev_id, end_rev_id = _get_revision_limits(
556
self.branch, self.start_revision, self.end_revision)
557
if self._match_using_deltas:
558
return _log_revision_iterator_using_delta_matching(
560
delta_type=self.delta_type,
563
specific_files=self.specific_files,
564
start_rev_id=start_rev_id, end_rev_id=end_rev_id,
565
direction=self.direction,
566
exclude_common_ancestry=self.exclude_common_ancestry,
513
self.start_rev_id, self.end_rev_id = _get_revision_limits(
514
self.branch, self.rqst.get('start_revision'),
515
self.rqst.get('end_revision'))
516
if self.rqst.get('_match_using_deltas'):
517
return self._log_revision_iterator_using_delta_matching()
569
519
# We're using the per-file-graph algorithm. This scales really
570
520
# well but only makes sense if there is a single file and it's
571
521
# not a directory
572
file_count = len(self.specific_files)
522
file_count = len(self.rqst.get('specific_fileids'))
573
523
if file_count != 1:
574
raise errors.BzrError(
575
"illegal LogRequest: must match-using-deltas "
524
raise BzrError("illegal LogRequest: must match-using-deltas "
576
525
"when logging %d files" % file_count)
577
return _log_revision_iterator_using_per_file_graph(
579
delta_type=self.delta_type,
582
path=self.specific_files[0],
583
start_rev_id=start_rev_id, end_rev_id=end_rev_id,
584
direction=self.direction,
585
exclude_common_ancestry=self.exclude_common_ancestry
526
return self._log_revision_iterator_using_per_file_graph()
528
def _log_revision_iterator_using_delta_matching(self):
529
# Get the base revisions, filtering by the revision range
531
generate_merge_revisions = rqst.get('levels') != 1
532
delayed_graph_generation = not rqst.get('specific_fileids') and (
533
rqst.get('limit') or self.start_rev_id or self.end_rev_id)
534
view_revisions = _calc_view_revisions(
535
self.branch, self.start_rev_id, self.end_rev_id,
536
rqst.get('direction'),
537
generate_merge_revisions=generate_merge_revisions,
538
delayed_graph_generation=delayed_graph_generation,
539
exclude_common_ancestry=rqst.get('exclude_common_ancestry'))
541
# Apply the other filters
542
return make_log_rev_iterator(self.branch, view_revisions,
543
rqst.get('delta_type'), rqst.get('match'),
544
file_ids=rqst.get('specific_fileids'),
545
direction=rqst.get('direction'))
547
def _log_revision_iterator_using_per_file_graph(self):
548
# Get the base revisions, filtering by the revision range.
549
# Note that we always generate the merge revisions because
550
# filter_revisions_touching_file_id() requires them ...
552
view_revisions = _calc_view_revisions(
553
self.branch, self.start_rev_id, self.end_rev_id,
554
rqst.get('direction'), generate_merge_revisions=True,
555
exclude_common_ancestry=rqst.get('exclude_common_ancestry'))
556
if not isinstance(view_revisions, list):
557
view_revisions = list(view_revisions)
558
view_revisions = _filter_revisions_touching_file_id(self.branch,
559
rqst.get('specific_fileids')[0], view_revisions,
560
include_merges=rqst.get('levels') != 1)
561
return make_log_rev_iterator(self.branch, view_revisions,
562
rqst.get('delta_type'), rqst.get('match'))
589
565
def _calc_view_revisions(branch, start_rev_id, end_rev_id, direction,
952
915
def _match_filter(searchRE, rev):
954
'message': (rev.message,),
955
'committer': (rev.committer,),
956
'author': (rev.get_apparent_authors()),
957
'bugs': list(rev.iter_bugs())
917
'message': (rev.message,),
918
'committer': (rev.committer,),
919
'author': (rev.get_apparent_authors()),
920
'bugs': list(rev.iter_bugs())
959
922
strings[''] = [item for inner_list in strings.values()
960
923
for item in inner_list]
961
for k, v in searchRE:
924
for (k, v) in searchRE:
962
925
if k in strings and not _match_any_filter(strings[k], v):
967
929
def _match_any_filter(strings, res):
968
return any(r.search(s) for r in res for s in strings)
930
return any(re.search(s) for re in res for s in strings)
971
932
def _make_delta_filter(branch, generate_delta, search, log_rev_iterator,
972
files=None, direction='reverse'):
933
fileids=None, direction='reverse'):
973
934
"""Add revision deltas to a log iterator if needed.
975
936
:param branch: The branch being logged.
978
939
:param search: A user text search string.
979
940
:param log_rev_iterator: An input iterator containing all revisions that
980
941
could be displayed, in lists.
981
:param files: If non empty, only revisions matching one or more of
982
the files are to be kept.
942
:param fileids: If non empty, only revisions matching one or more of
943
the file-ids are to be kept.
983
944
:param direction: the direction in which view_revisions is sorted
984
945
:return: An iterator over lists of ((rev_id, revno, merge_depth), rev,
987
if not generate_delta and not files:
948
if not generate_delta and not fileids:
988
949
return log_rev_iterator
989
950
return _generate_deltas(branch.repository, log_rev_iterator,
990
generate_delta, files, direction)
993
def _generate_deltas(repository, log_rev_iterator, delta_type, files,
951
generate_delta, fileids, direction)
954
def _generate_deltas(repository, log_rev_iterator, delta_type, fileids,
995
956
"""Create deltas for each batch of revisions in log_rev_iterator.
997
958
If we're only generating deltas for the sake of filtering against
998
files, we stop generating deltas once all files reach the
959
file-ids, we stop generating deltas once all file-ids reach the
999
960
appropriate life-cycle point. If we're receiving data newest to
1000
961
oldest, then that life-cycle point is 'add', otherwise it's 'remove'.
1002
check_files = files is not None and len(files) > 0
1004
file_set = set(files)
963
check_fileids = fileids is not None and len(fileids) > 0
965
fileid_set = set(fileids)
1005
966
if direction == 'reverse':
1008
969
stop_on = 'remove'
1011
972
for revs in log_rev_iterator:
1012
# If we were matching against files and we've run out,
973
# If we were matching against fileids and we've run out,
1013
974
# there's nothing left to do
1014
if check_files and not file_set:
975
if check_fileids and not fileid_set:
1016
977
revisions = [rev[1] for rev in revs]
1018
if delta_type == 'full' and not check_files:
1019
deltas = repository.get_revision_deltas(revisions)
979
if delta_type == 'full' and not check_fileids:
980
deltas = repository.get_deltas_for_revisions(revisions)
1020
981
for rev, delta in zip(revs, deltas):
1021
982
new_revs.append((rev[0], rev[1], delta))
1023
deltas = repository.get_revision_deltas(
1024
revisions, specific_files=file_set)
984
deltas = repository.get_deltas_for_revisions(revisions, fileid_set)
1025
985
for rev, delta in zip(revs, deltas):
1027
987
if delta is None or not delta.has_changed():
1030
_update_files(delta, file_set, stop_on)
990
_update_fileids(delta, fileid_set, stop_on)
1031
991
if delta_type is None:
1033
993
elif delta_type == 'full':
1047
def _update_files(delta, files, stop_on):
1048
"""Update the set of files to search based on file lifecycle events.
1007
def _update_fileids(delta, fileids, stop_on):
1008
"""Update the set of file-ids to search based on file lifecycle events.
1050
:param files: a set of files to update
1051
:param stop_on: either 'add' or 'remove' - take files out of the
1052
files set once their add or remove entry is detected respectively
1010
:param fileids: a set of fileids to update
1011
:param stop_on: either 'add' or 'remove' - take file-ids out of the
1012
fileids set once their add or remove entry is detected respectively
1054
1014
if stop_on == 'add':
1055
1015
for item in delta.added:
1056
if item.path[1] in files:
1057
files.remove(item.path[1])
1058
for item in delta.copied + delta.renamed:
1059
if item.path[1] in files:
1060
files.remove(item.path[1])
1061
files.add(item.path[0])
1062
if item.kind[1] == 'directory':
1063
for path in list(files):
1064
if is_inside(item.path[1], path):
1066
files.add(item.path[0] + path[len(item.path[1]):])
1016
if item[1] in fileids:
1017
fileids.remove(item[1])
1067
1018
elif stop_on == 'delete':
1068
1019
for item in delta.removed:
1069
if item.path[0] in files:
1070
files.remove(item.path[0])
1071
for item in delta.copied + delta.renamed:
1072
if item.path[0] in files:
1073
files.remove(item.path[0])
1074
files.add(item.path[1])
1075
if item.kind[0] == 'directory':
1076
for path in list(files):
1077
if is_inside(item.path[0], path):
1079
files.add(item.path[1] + path[len(item.path[0]):])
1020
if item[1] in fileids:
1021
fileids.remove(item[1])
1082
1024
def _make_revision_objects(branch, generate_delta, search, log_rev_iterator):
1730
1670
to_file = self.to_file
1732
1672
if revision.tags:
1733
tags = ' {%s}' % (', '.join(sorted(revision.tags)))
1673
tags = ' {%s}' % (', '.join(revision.tags))
1734
1674
to_file.write(indent + "%*s %s\t%s%s%s\n" % (revno_width,
1735
revision.revno or "", self.short_author(
1737
format_date(revision.rev.timestamp,
1738
revision.rev.timezone or 0,
1739
self.show_timezone, date_fmt="%Y-%m-%d",
1741
tags, self.merge_marker(revision)))
1742
self.show_properties(revision.rev, indent + offset)
1675
revision.revno or "", self.short_author(revision.rev),
1676
format_date(revision.rev.timestamp,
1677
revision.rev.timezone or 0,
1678
self.show_timezone, date_fmt="%Y-%m-%d",
1680
tags, self.merge_marker(revision)))
1681
self.show_properties(revision.rev, indent+offset)
1743
1682
if self.show_ids or revision.revno is None:
1744
1683
to_file.write(indent + offset + 'revision-id:%s\n'
1745
% (revision.rev.revision_id.decode('utf-8'),))
1684
% (revision.rev.revision_id,))
1746
1685
if not revision.rev.message:
1747
1686
to_file.write(indent + offset + '(no message)\n')
1968
1903
for i in range(max(len(new_rh), len(old_rh))):
1969
1904
if (len(new_rh) <= i
1970
1905
or len(old_rh) <= i
1971
or new_rh[i] != old_rh[i]):
1906
or new_rh[i] != old_rh[i]):
1975
1910
if base_idx is None:
1976
1911
to_file.write('Nothing seems to have changed\n')
1978
# TODO: It might be nice to do something like show_log
1979
# and show the merged entries. But since this is the
1980
# removed revisions, it shouldn't be as important
1913
## TODO: It might be nice to do something like show_log
1914
## and show the merged entries. But since this is the
1915
## removed revisions, it shouldn't be as important
1981
1916
if base_idx < len(old_rh):
1982
to_file.write('*' * 60)
1917
to_file.write('*'*60)
1983
1918
to_file.write('\nRemoved Revisions:\n')
1984
1919
for i in range(base_idx, len(old_rh)):
1985
1920
rev = branch.repository.get_revision(old_rh[i])
1986
lr = LogRevision(rev, i + 1, 0, None)
1921
lr = LogRevision(rev, i+1, 0, None)
1987
1922
lf.log_revision(lr)
1988
to_file.write('*' * 60)
1923
to_file.write('*'*60)
1989
1924
to_file.write('\n\n')
1990
1925
if base_idx < len(new_rh):
1991
1926
to_file.write('Added Revisions:\n')
1992
1927
show_log(branch,
1995
1931
direction='forward',
1996
start_revision=base_idx + 1,
1997
end_revision=len(new_rh))
1932
start_revision=base_idx+1,
1933
end_revision=len(new_rh),
2000
1937
def get_history_change(old_revision_id, new_revision_id, repository):
2102
2040
:param file_list: the list of paths given on the command line;
2103
2041
the first of these can be a branch location or a file path,
2104
2042
the remainder must be file paths
2105
:param exit_stack: When the branch returned is read locked,
2106
an unlock call will be queued to the exit stack.
2043
:param add_cleanup: When the branch returned is read locked,
2044
an unlock call will be queued to the cleanup.
2107
2045
:return: (branch, info_list, start_rev_info, end_rev_info) where
2108
info_list is a list of (relative_path, found, kind) tuples where
2046
info_list is a list of (relative_path, file_id, kind) tuples where
2109
2047
kind is one of values 'directory', 'file', 'symlink', 'tree-reference'.
2110
2048
branch will be read-locked.
2112
2050
from breezy.builtins import _get_revision_range
2113
2051
tree, b, path = controldir.ControlDir.open_containing_tree_or_branch(
2115
exit_stack.enter_context(b.lock_read())
2053
add_cleanup(b.lock_read().unlock)
2116
2054
# XXX: It's damn messy converting a list of paths to relative paths when
2117
2055
# those paths might be deleted ones, they might be on a case-insensitive
2118
2056
# filesystem and/or they might be in silly locations (like another branch).
2135
2073
tree = b.basis_tree()
2137
2075
for fp in relpaths:
2138
kind = _get_kind_for_file(tree, fp)
2076
file_id = tree.path2id(fp)
2077
kind = _get_kind_for_file_id(tree, fp, file_id)
2140
2079
# go back to when time began
2141
2080
if tree1 is None:
2143
2082
rev1 = b.get_rev_id(1)
2144
2083
except errors.NoSuchRevision:
2145
2084
# No history at all
2148
2088
tree1 = b.repository.revision_tree(rev1)
2150
kind = _get_kind_for_file(tree1, fp)
2151
info_list.append((fp, kind))
2090
file_id = tree1.path2id(fp)
2091
kind = _get_kind_for_file_id(tree1, fp, file_id)
2092
info_list.append((fp, file_id, kind))
2153
2094
elif start_rev_info == end_rev_info:
2154
2095
# One revision given - file must exist in it
2155
2096
tree = b.repository.revision_tree(end_rev_info.rev_id)
2156
2097
for fp in relpaths:
2157
kind = _get_kind_for_file(tree, fp)
2158
info_list.append((fp, kind))
2098
file_id = tree.path2id(fp)
2099
kind = _get_kind_for_file_id(tree, fp, file_id)
2100
info_list.append((fp, file_id, kind))
2161
2103
# Revision range given. Get the file-id from the end tree.
2176
2119
tree1 = b.repository.revision_tree(rev1)
2178
2121
tree1 = b.repository.revision_tree(rev_id)
2179
kind = _get_kind_for_file(tree1, fp)
2180
info_list.append((fp, kind))
2122
file_id = tree1.path2id(fp)
2123
kind = _get_kind_for_file_id(tree1, fp, file_id)
2124
info_list.append((fp, file_id, kind))
2181
2125
return b, info_list, start_rev_info, end_rev_info
2184
def _get_kind_for_file(tree, path):
2185
"""Return the kind of a path or None if it doesn't exist."""
2186
with tree.lock_read():
2188
return tree.stored_kind(path)
2189
except errors.NoSuchFile:
2128
def _get_kind_for_file_id(tree, path, file_id):
2129
"""Return the kind of a file-id or None if it doesn't exist."""
2130
if file_id is not None:
2131
return tree.kind(path, file_id)
2193
2136
properties_handler_registry = registry.Registry()
2195
2138
# Use the properties handlers to print out bug information if available
2198
2139
def _bugs_properties_handler(revision):
2200
related_bug_urls = []
2201
for bug_url, status in revision.iter_bugs():
2202
if status == 'fixed':
2203
fixed_bug_urls.append(bug_url)
2204
elif status == 'related':
2205
related_bug_urls.append(bug_url)
2208
text = ngettext('fixes bug', 'fixes bugs', len(fixed_bug_urls))
2209
ret[text] = ' '.join(fixed_bug_urls)
2210
if related_bug_urls:
2211
text = ngettext('related bug', 'related bugs',
2212
len(related_bug_urls))
2213
ret[text] = ' '.join(related_bug_urls)
2140
if 'bugs' in revision.properties:
2141
bug_lines = revision.properties['bugs'].split('\n')
2142
bug_rows = [line.split(' ', 1) for line in bug_lines]
2143
fixed_bug_urls = [row[0] for row in bug_rows if
2144
len(row) > 1 and row[1] == 'fixed']
2147
return {ngettext('fixes bug', 'fixes bugs', len(fixed_bug_urls)):\
2148
' '.join(fixed_bug_urls)}
2217
2151
properties_handler_registry.register('bugs_properties_handler',
2218
2152
_bugs_properties_handler)