mirror of
https://github.com/git/git.git
synced 2024-11-14 13:13:01 +01:00
12da1d1f6f
This is a rewrite of much of Bo's work, mainly in an effort to split it into smaller, easier to understand routines. The algorithm is built around the struct range_set, which encodes a series of line ranges as intervals [a,b). This is used in two contexts: * A set of lines we are tracking (which will change as we dig through history). * To encode diffs, as pairs of ranges. The main routine is range_set_map_across_diff(). It processes the diff between a commit C and some parent P. It determines which diff hunks are relevant to the ranges tracked in C, and computes the new ranges for P. The algorithm is then simply to process history in topological order from newest to oldest, computing ranges and (partial) diffs. At branch points, we need to merge the ranges we are watching. We will find that many commits do not affect the chosen ranges, and mark them TREESAME (in addition to those already filtered by pathspec limiting). Another pass of history simplification then gets rid of such commits. This is wired as an extra filtering pass in the log machinery. This currently only reduces code duplication, but should allow for other simplifications and options to be used. Finally, we hook a diff printer into the output chain. Ideally we would wire directly into the diff logic, to optionally use features like word diff. However, that will require some major reworking of the diff chain, so we completely replace the output with our own diff for now. As this was a GSoC project, and has quite some history by now, many people have helped. In no particular order, thanks go to Jakub Narebski <jnareb@gmail.com> Jens Lehmann <Jens.Lehmann@web.de> Jonathan Nieder <jrnieder@gmail.com> Junio C Hamano <gitster@pobox.com> Ramsay Jones <ramsay@ramsay1.demon.co.uk> Will Palmer <wmpalmer@gmail.com> Apologies to everyone I forgot. Signed-off-by: Bo Yang <struggleyb.nku@gmail.com> Signed-off-by: Thomas Rast <trast@student.ethz.ch> Signed-off-by: Junio C Hamano <gitster@pobox.com>
34 lines
674 B
Bash
Executable file
34 lines
674 B
Bash
Executable file
#!/bin/sh
|
|
|
|
test_description='Tests log -L performance'
|
|
. ./perf-lib.sh
|
|
|
|
test_perf_default_repo
|
|
|
|
# Pick a file to log pseudo-randomly. The sort key is the blob hash,
|
|
# so it is stable.
|
|
test_expect_success 'select a file' '
|
|
git ls-tree HEAD | grep ^100644 |
|
|
sort -k 3 | head -1 | cut -f 2 >filelist
|
|
'
|
|
|
|
file=$(cat filelist)
|
|
export file
|
|
|
|
test_perf 'git rev-list --topo-order (baseline)' '
|
|
git rev-list --topo-order HEAD >/dev/null
|
|
'
|
|
|
|
test_perf 'git log --follow (baseline for -M)' '
|
|
git log --oneline --follow -- "$file" >/dev/null
|
|
'
|
|
|
|
test_perf 'git log -L' '
|
|
git log -L 1:"$file" >/dev/null
|
|
'
|
|
|
|
test_perf 'git log -M -L' '
|
|
git log -M -L 1:"$file" >/dev/null
|
|
'
|
|
|
|
test_done
|