]> git.ipfire.org Git - thirdparty/git.git/blame - Documentation/git-range-diff.txt
Merge branch 'es/add-doc-list-short-form-of-all-in-synopsis'
[thirdparty/git.git] / Documentation / git-range-diff.txt
CommitLineData
348ae56c
JS
1git-range-diff(1)
2=================
3
4NAME
5----
6git-range-diff - Compare two commit ranges (e.g. two versions of a branch)
7
ba931edd
JS
8SYNOPSIS
9--------
10[verse]
11'git range-diff' [--color=[<when>]] [--no-color] [<diff-options>]
27526793 12 [--no-dual-color] [--creation-factor=<factor>]
1e79f973 13 [--left-only | --right-only]
ba931edd 14 ( <range1> <range2> | <rev1>...<rev2> | <base> <rev1> <rev2> )
b7574782 15 [[--] <path>...]
ba931edd
JS
16
17DESCRIPTION
18-----------
19
20This command shows the differences between two versions of a patch
21series, or more generally, two commit ranges (ignoring merge commits).
22
b7574782
JS
23In the presence of `<path>` arguments, these commit ranges are limited
24accordingly.
25
ba931edd
JS
26To that end, it first finds pairs of commits from both commit ranges
27that correspond with each other. Two commits are said to correspond when
28the diff between their patches (i.e. the author information, the commit
29message and the commit diff) is reasonably small compared to the
30patches' size. See ``Algorithm`` below for details.
31
32Finally, the list of matching commits is shown in the order of the
33second commit range, with unmatched commits being inserted just after
34all of their ancestors have been shown.
35
2cc543de
JS
36There are three ways to specify the commit ranges:
37
38- `<range1> <range2>`: Either commit range can be of the form
39 `<base>..<rev>`, `<rev>^!` or `<rev>^-<n>`. See `SPECIFYING RANGES`
40 in linkgit:gitrevisions[7] for more details.
41
42- `<rev1>...<rev2>`. This is equivalent to
43 `<rev2>..<rev1> <rev1>..<rev2>`.
44
45- `<base> <rev1> <rev2>`: This is equivalent to `<base>..<rev1>
46 <base>..<rev2>`.
ba931edd
JS
47
48OPTIONS
49-------
27526793
JS
50--no-dual-color::
51 When the commit diffs differ, `git range-diff` recreates the
52 original diffs' coloring, and adds outer -/+ diff markers with
53 the *background* being red/green to make it easier to see e.g.
a7be92ac
JS
54 when there was a change in what exact lines were added.
55+
56Additionally, the commit diff lines that are only present in the first commit
57range are shown "dimmed" (this can be overridden using the `color.diff.<slot>`
58config setting where `<slot>` is one of `contextDimmed`, `oldDimmed` and
59`newDimmed`), and the commit diff lines that are only present in the second
60commit range are shown in bold (which can be overridden using the config
61settings `color.diff.<slot>` with `<slot>` being one of `contextBold`,
62`oldBold` or `newBold`).
63+
64This is known to `range-diff` as "dual coloring". Use `--no-dual-color`
65to revert to color all lines according to the outer diff markers
66(and completely ignore the inner diff when it comes to color).
ba931edd
JS
67
68--creation-factor=<percent>::
69 Set the creation/deletion cost fudge factor to `<percent>`.
70 Defaults to 60. Try a larger value if `git range-diff` erroneously
71 considers a large change a total rewrite (deletion of one commit
72 and addition of another), and a smaller one in the reverse case.
cf6cac20 73 See the ``Algorithm`` section below for an explanation of why this is
ba931edd
JS
74 needed.
75
1e79f973
JS
76--left-only::
77 Suppress commits that are missing from the first specified range
78 (or the "left range" when using the `<rev1>...<rev2>` format).
79
80--right-only::
81 Suppress commits that are missing from the second specified range
82 (or the "right range" when using the `<rev1>...<rev2>` format).
83
bd361918
DL
84--[no-]notes[=<ref>]::
85 This flag is passed to the `git log` program
86 (see linkgit:git-log[1]) that generates the patches.
87
ba931edd
JS
88<range1> <range2>::
89 Compare the commits specified by the two ranges, where
90 `<range1>` is considered an older version of `<range2>`.
91
92<rev1>...<rev2>::
93 Equivalent to passing `<rev2>..<rev1>` and `<rev1>..<rev2>`.
94
95<base> <rev1> <rev2>::
96 Equivalent to passing `<base>..<rev1>` and `<base>..<rev2>`.
97 Note that `<base>` does not need to be the exact branch point
98 of the branches. Example: after rebasing a branch `my-topic`,
99 `git range-diff my-topic@{u} my-topic@{1} my-topic` would
100 show the differences introduced by the rebase.
101
102`git range-diff` also accepts the regular diff options (see
103linkgit:git-diff[1]), most notably the `--color=[<when>]` and
104`--no-color` options. These options are used when generating the "diff
105between patches", i.e. to compare the author, commit message and diff of
bd361918 106corresponding old/new commits. There is currently no means to tweak most of the
ba931edd
JS
107diff options passed to `git log` when generating those patches.
108
df569c3f
ÆAB
109OUTPUT STABILITY
110----------------
111
112The output of the `range-diff` command is subject to change. It is
113intended to be human-readable porcelain output, not something that can
114be used across versions of Git to get a textually stable `range-diff`
115(as opposed to something like the `--stable` option to
116linkgit:git-patch-id[1]). There's also no equivalent of
117linkgit:git-apply[1] for `range-diff`, the output is not intended to
118be machine-readable.
119
120This is particularly true when passing in diff options. Currently some
121options like `--stat` can, as an emergent effect, produce output
122that's quite useless in the context of `range-diff`. Future versions
123of `range-diff` may learn to interpret such options in a manner
124specific to `range-diff` (e.g. for `--stat` producing human-readable
125output which summarizes how the diffstat changed).
ba931edd
JS
126
127CONFIGURATION
128-------------
129This command uses the `diff.color.*` and `pager.range-diff` settings
130(the latter is on by default).
131See linkgit:git-config[1].
132
133
134EXAMPLES
135--------
136
137When a rebase required merge conflicts to be resolved, compare the changes
138introduced by the rebase directly afterwards using:
139
140------------
141$ git range-diff @{u} @{1} @
142------------
143
144
145A typical output of `git range-diff` would look like this:
146
147------------
148-: ------- > 1: 0ddba11 Prepare for the inevitable!
1491: c0debee = 2: cab005e Add a helpful message at the start
1502: f00dbal ! 3: decafe1 Describe a bug
151 @@ -1,3 +1,3 @@
152 Author: A U Thor <author@example.com>
153
154 -TODO: Describe a bug
155 +Describe a bug
156 @@ -324,5 +324,6
157 This is expected.
158
159 -+What is unexpected is that it will also crash.
160 ++Unexpectedly, it also crashes. This is a bug, and the jury is
161 ++still out there how to fix it best. See ticket #314 for details.
162
163 Contact
1643: bedead < -: ------- TO-UNDO
165------------
166
167In this example, there are 3 old and 3 new commits, where the developer
168removed the 3rd, added a new one before the first two, and modified the
97509a34 169commit message of the 2nd commit as well as its diff.
ba931edd
JS
170
171When the output goes to a terminal, it is color-coded by default, just
172like regular `git diff`'s output. In addition, the first line (adding a
173commit) is green, the last line (deleting a commit) is red, the second
174line (with a perfect match) is yellow like the commit header of `git
175show`'s output, and the third line colors the old commit red, the new
176one green and the rest like `git show`'s commit header.
177
27526793
JS
178A naive color-coded diff of diffs is actually a bit hard to read,
179though, as it colors the entire lines red or green. The line that added
180"What is unexpected" in the old commit, for example, is completely red,
181even if the intent of the old commit was to add something.
ba931edd 182
27526793
JS
183To help with that, `range` uses the `--dual-color` mode by default. In
184this mode, the diff of diffs will retain the original diff colors, and
185prefix the lines with -/+ markers that have their *background* red or
186green, to make it more obvious that they describe how the diff itself
187changed.
ba931edd
JS
188
189
190Algorithm
191---------
192
193The general idea is this: we generate a cost matrix between the commits
194in both commit ranges, then solve the least-cost assignment.
195
196The cost matrix is populated thusly: for each pair of commits, both
197diffs are generated and the "diff of diffs" is generated, with 3 context
198lines, then the number of lines in that diff is used as cost.
199
200To avoid false positives (e.g. when a patch has been removed, and an
201unrelated patch has been added between two iterations of the same patch
202series), the cost matrix is extended to allow for that, by adding
203fixed-cost entries for wholesale deletes/adds.
204
205Example: Let commits `1--2` be the first iteration of a patch series and
206`A--C` the second iteration. Let's assume that `A` is a cherry-pick of
207`2,` and `C` is a cherry-pick of `1` but with a small modification (say,
208a fixed typo). Visualize the commits as a bipartite graph:
209
210------------
211 1 A
212
213 2 B
214
215 C
216------------
217
218We are looking for a "best" explanation of the new series in terms of
219the old one. We can represent an "explanation" as an edge in the graph:
220
221
222------------
223 1 A
224 /
225 2 --------' B
226
227 C
228------------
229
230This explanation comes for "free" because there was no change. Similarly
231`C` could be explained using `1`, but that comes at some cost c>0
232because of the modification:
233
234------------
235 1 ----. A
236 | /
237 2 ----+---' B
238 |
239 `----- C
240 c>0
241------------
242
243In mathematical terms, what we are looking for is some sort of a minimum
244cost bipartite matching; `1` is matched to `C` at some cost, etc. The
245underlying graph is in fact a complete bipartite graph; the cost we
246associate with every edge is the size of the diff between the two
247commits' patches. To explain also new commits, we introduce dummy nodes
248on both sides:
249
250------------
251 1 ----. A
252 | /
253 2 ----+---' B
254 |
255 o `----- C
256 c>0
257 o o
258
259 o o
260------------
261
262The cost of an edge `o--C` is the size of `C`'s diff, modified by a
263fudge factor that should be smaller than 100%. The cost of an edge
264`o--o` is free. The fudge factor is necessary because even if `1` and
265`C` have nothing in common, they may still share a few empty lines and
266such, possibly making the assignment `1--C`, `o--o` slightly cheaper
267than `1--o`, `o--C` even if `1` and `C` have nothing in common. With the
268fudge factor we require a much larger common part to consider patches as
269corresponding.
270
271The overall time needed to compute this algorithm is the time needed to
272compute n+m commit diffs and then n*m diffs of patches, plus the time
031fd4b9 273needed to compute the least-cost assignment between n and m diffs. Git
ba931edd
JS
274uses an implementation of the Jonker-Volgenant algorithm to solve the
275assignment problem, which has cubic runtime complexity. The matching
276found in this case will look like this:
277
278------------
279 1 ----. A
280 | /
281 2 ----+---' B
282 .--+-----'
283 o -' `----- C
284 c>0
285 o ---------- o
286
287 o ---------- o
288------------
289
290
291SEE ALSO
292--------
293linkgit:git-log[1]
294
348ae56c
JS
295GIT
296---
297Part of the linkgit:git[1] suite