1Commit Limiting 2~~~~~~~~~~~~~~~ 3 4Besides specifying a range of commits that should be listed using the 5special notations explained in the description, additional commit 6limiting may be applied. 7 8Using more options generally further limits the output (e.g. 9`--since=<date1>` limits to commits newer than `<date1>`, and using it 10with `--grep=<pattern>` further limits to commits whose log message 11has a line that matches `<pattern>`), unless otherwise noted. 12 13Note that these are applied before commit 14ordering and formatting options, such as `--reverse`. 15 16-- 17 18-<number>:: 19-n <number>:: 20--max-count=<number>:: 21 Limit the number of commits to output. 22 23--skip=<number>:: 24 Skip 'number' commits before starting to show the commit output. 25 26--since=<date>:: 27--after=<date>:: 28 Show commits more recent than a specific date. 29 30--until=<date>:: 31--before=<date>:: 32 Show commits older than a specific date. 33 34ifdef::git-rev-list[] 35--max-age=<timestamp>:: 36--min-age=<timestamp>:: 37 Limit the commits output to specified time range. 38endif::git-rev-list[] 39 40--author=<pattern>:: 41--committer=<pattern>:: 42 Limit the commits output to ones with author/committer 43 header lines that match the specified pattern (regular 44 expression). With more than one `--author=<pattern>`, 45 commits whose author matches any of the given patterns are 46 chosen (similarly for multiple `--committer=<pattern>`). 47 48--grep-reflog=<pattern>:: 49 Limit the commits output to ones with reflog entries that 50 match the specified pattern (regular expression). With 51 more than one `--grep-reflog`, commits whose reflog message 52 matches any of the given patterns are chosen. It is an 53 error to use this option unless `--walk-reflogs` is in use. 54 55--grep=<pattern>:: 56 Limit the commits output to ones with log message that 57 matches the specified pattern (regular expression). With 58 more than one `--grep=<pattern>`, commits whose message 59 matches any of the given patterns are chosen (but see 60 `--all-match`). 61+ 62When `--show-notes` is in effect, the message from the notes as 63if it is part of the log message. 64 65--all-match:: 66 Limit the commits output to ones that match all given `--grep`, 67 instead of ones that match at least one. 68 69-i:: 70--regexp-ignore-case:: 71 Match the regular expression limiting patterns without regard to letter 72 case. 73 74--basic-regexp:: 75 Consider the limiting patterns to be basic regular expressions; 76 this is the default. 77 78-E:: 79--extended-regexp:: 80 Consider the limiting patterns to be extended regular expressions 81 instead of the default basic regular expressions. 82 83-F:: 84--fixed-strings:: 85 Consider the limiting patterns to be fixed strings (don't interpret 86 pattern as a regular expression). 87 88--perl-regexp:: 89 Consider the limiting patterns to be Perl-compatible regular expressions. 90 Requires libpcre to be compiled in. 91 92--remove-empty:: 93 Stop when a given path disappears from the tree. 94 95--merges:: 96 Print only merge commits. This is exactly the same as `--min-parents=2`. 97 98--no-merges:: 99 Do not print commits with more than one parent. This is 100 exactly the same as `--max-parents=1`. 101 102--min-parents=<number>:: 103--max-parents=<number>:: 104--no-min-parents:: 105--no-max-parents:: 106 Show only commits which have at least (or at most) that many parent 107 commits. In particular, `--max-parents=1` is the same as `--no-merges`, 108 `--min-parents=2` is the same as `--merges`. `--max-parents=0` 109 gives all root commits and `--min-parents=3` all octopus merges. 110+ 111`--no-min-parents` and `--no-max-parents` reset these limits (to no limit) 112again. Equivalent forms are `--min-parents=0` (any commit has 0 or more 113parents) and `--max-parents=-1` (negative numbers denote no upper limit). 114 115--first-parent:: 116 Follow only the first parent commit upon seeing a merge 117 commit. This option can give a better overview when 118 viewing the evolution of a particular topic branch, 119 because merges into a topic branch tend to be only about 120 adjusting to updated upstream from time to time, and 121 this option allows you to ignore the individual commits 122 brought in to your history by such a merge. 123 124--not:: 125 Reverses the meaning of the '{caret}' prefix (or lack thereof) 126 for all following revision specifiers, up to the next `--not`. 127 128--all:: 129 Pretend as if all the refs in `refs/` are listed on the 130 command line as '<commit>'. 131 132--branches[=<pattern>]:: 133 Pretend as if all the refs in `refs/heads` are listed 134 on the command line as '<commit>'. If '<pattern>' is given, limit 135 branches to ones matching given shell glob. If pattern lacks '?', 136 '{asterisk}', or '[', '/{asterisk}' at the end is implied. 137 138--tags[=<pattern>]:: 139 Pretend as if all the refs in `refs/tags` are listed 140 on the command line as '<commit>'. If '<pattern>' is given, limit 141 tags to ones matching given shell glob. If pattern lacks '?', '{asterisk}', 142 or '[', '/{asterisk}' at the end is implied. 143 144--remotes[=<pattern>]:: 145 Pretend as if all the refs in `refs/remotes` are listed 146 on the command line as '<commit>'. If '<pattern>' is given, limit 147 remote-tracking branches to ones matching given shell glob. 148 If pattern lacks '?', '{asterisk}', or '[', '/{asterisk}' at the end is implied. 149 150--glob=<glob-pattern>:: 151 Pretend as if all the refs matching shell glob '<glob-pattern>' 152 are listed on the command line as '<commit>'. Leading 'refs/', 153 is automatically prepended if missing. If pattern lacks '?', '{asterisk}', 154 or '[', '/{asterisk}' at the end is implied. 155 156--exclude=<glob-pattern>:: 157 158 Do not include refs matching '<glob-pattern>' that the next `--all`, 159 `--branches`, `--tags`, `--remotes`, or `--glob` would otherwise 160 consider. Repetitions of this option accumulate exclusion patterns 161 up to the next `--all`, `--branches`, `--tags`, `--remotes`, or 162 `--glob` option (other options or arguments do not clear 163 accumulated patterns). 164+ 165The patterns given should not begin with `refs/heads`, `refs/tags`, or 166`refs/remotes` when applied to `--branches`, `--tags`, or `--remotes`, 167respectively, and they must begin with `refs/` when applied to `--glob` 168or `--all`. If a trailing '/{asterisk}' is intended, it must be given 169explicitly. 170 171--reflog:: 172 Pretend as if all objects mentioned by reflogs are listed on the 173 command line as `<commit>`. 174 175--ignore-missing:: 176 Upon seeing an invalid object name in the input, pretend as if 177 the bad input was not given. 178 179ifndef::git-rev-list[] 180--bisect:: 181 Pretend as if the bad bisection ref `refs/bisect/bad` 182 was listed and as if it was followed by `--not` and the good 183 bisection refs `refs/bisect/good-*` on the command 184 line. 185endif::git-rev-list[] 186 187--stdin:: 188 In addition to the '<commit>' listed on the command 189 line, read them from the standard input. If a '--' separator is 190 seen, stop reading commits and start reading paths to limit the 191 result. 192 193ifdef::git-rev-list[] 194--quiet:: 195 Don't print anything to standard output. This form 196 is primarily meant to allow the caller to 197 test the exit status to see if a range of objects is fully 198 connected (or not). It is faster than redirecting stdout 199 to `/dev/null` as the output does not have to be formatted. 200endif::git-rev-list[] 201 202--cherry-mark:: 203 Like `--cherry-pick` (see below) but mark equivalent commits 204 with `=` rather than omitting them, and inequivalent ones with `+`. 205 206--cherry-pick:: 207 Omit any commit that introduces the same change as 208 another commit on the ``other side'' when the set of 209 commits are limited with symmetric difference. 210+ 211For example, if you have two branches, `A` and `B`, a usual way 212to list all commits on only one side of them is with 213`--left-right` (see the example below in the description of 214the `--left-right` option). However, it shows the commits that were 215cherry-picked from the other branch (for example, ``3rd on b'' may be 216cherry-picked from branch A). With this option, such pairs of commits are 217excluded from the output. 218 219--left-only:: 220--right-only:: 221 List only commits on the respective side of a symmetric range, 222 i.e. only those which would be marked `<` resp. `>` by 223 `--left-right`. 224+ 225For example, `--cherry-pick --right-only A...B` omits those 226commits from `B` which are in `A` or are patch-equivalent to a commit in 227`A`. In other words, this lists the `+` commits from `git cherry A B`. 228More precisely, `--cherry-pick --right-only --no-merges` gives the exact 229list. 230 231--cherry:: 232 A synonym for `--right-only --cherry-mark --no-merges`; useful to 233 limit the output to the commits on our side and mark those that 234 have been applied to the other side of a forked history with 235 `git log --cherry upstream...mybranch`, similar to 236 `git cherry upstream mybranch`. 237 238-g:: 239--walk-reflogs:: 240 Instead of walking the commit ancestry chain, walk 241 reflog entries from the most recent one to older ones. 242 When this option is used you cannot specify commits to 243 exclude (that is, '{caret}commit', 'commit1..commit2', 244 and 'commit1\...commit2' notations cannot be used). 245+ 246With `--pretty` format other than `oneline` (for obvious reasons), 247this causes the output to have two extra lines of information 248taken from the reflog. By default, 'commit@\{Nth}' notation is 249used in the output. When the starting commit is specified as 250'commit@\{now}', output also uses 'commit@\{timestamp}' notation 251instead. Under `--pretty=oneline`, the commit message is 252prefixed with this information on the same line. 253This option cannot be combined with `--reverse`. 254See also linkgit:git-reflog[1]. 255 256--merge:: 257 After a failed merge, show refs that touch files having a 258 conflict and don't exist on all heads to merge. 259 260--boundary:: 261 Output excluded boundary commits. Boundary commits are 262 prefixed with `-`. 263 264ifdef::git-rev-list[] 265--use-bitmap-index:: 266 267 Try to speed up the traversal using the pack bitmap index (if 268 one is available). Note that when traversing with `--objects`, 269 trees and blobs will not have their associated path printed. 270endif::git-rev-list[] 271 272-- 273 274History Simplification 275~~~~~~~~~~~~~~~~~~~~~~ 276 277Sometimes you are only interested in parts of the history, for example the 278commits modifying a particular <path>. But there are two parts of 279'History Simplification', one part is selecting the commits and the other 280is how to do it, as there are various strategies to simplify the history. 281 282The following options select the commits to be shown: 283 284<paths>:: 285 Commits modifying the given <paths> are selected. 286 287--simplify-by-decoration:: 288 Commits that are referred by some branch or tag are selected. 289 290Note that extra commits can be shown to give a meaningful history. 291 292The following options affect the way the simplification is performed: 293 294Default mode:: 295 Simplifies the history to the simplest history explaining the 296 final state of the tree. Simplest because it prunes some side 297 branches if the end result is the same (i.e. merging branches 298 with the same content) 299 300--full-history:: 301 Same as the default mode, but does not prune some history. 302 303--dense:: 304 Only the selected commits are shown, plus some to have a 305 meaningful history. 306 307--sparse:: 308 All commits in the simplified history are shown. 309 310--simplify-merges:: 311 Additional option to `--full-history` to remove some needless 312 merges from the resulting history, as there are no selected 313 commits contributing to this merge. 314 315--ancestry-path:: 316 When given a range of commits to display (e.g. 'commit1..commit2' 317 or 'commit2 {caret}commit1'), only display commits that exist 318 directly on the ancestry chain between the 'commit1' and 319 'commit2', i.e. commits that are both descendants of 'commit1', 320 and ancestors of 'commit2'. 321 322A more detailed explanation follows. 323 324Suppose you specified `foo` as the <paths>. We shall call commits 325that modify `foo` !TREESAME, and the rest TREESAME. (In a diff 326filtered for `foo`, they look different and equal, respectively.) 327 328In the following, we will always refer to the same example history to 329illustrate the differences between simplification settings. We assume 330that you are filtering for a file `foo` in this commit graph: 331----------------------------------------------------------------------- 332 .-A---M---N---O---P---Q 333 / / / / / / 334 I B C D E Y 335 \ / / / / / 336 `-------------' X 337----------------------------------------------------------------------- 338The horizontal line of history A---Q is taken to be the first parent of 339each merge. The commits are: 340 341* `I` is the initial commit, in which `foo` exists with contents 342 ``asdf'', and a file `quux` exists with contents ``quux''. Initial 343 commits are compared to an empty tree, so `I` is !TREESAME. 344 345* In `A`, `foo` contains just ``foo''. 346 347* `B` contains the same change as `A`. Its merge `M` is trivial and 348 hence TREESAME to all parents. 349 350* `C` does not change `foo`, but its merge `N` changes it to ``foobar'', 351 so it is not TREESAME to any parent. 352 353* `D` sets `foo` to ``baz''. Its merge `O` combines the strings from 354 `N` and `D` to ``foobarbaz''; i.e., it is not TREESAME to any parent. 355 356* `E` changes `quux` to ``xyzzy'', and its merge `P` combines the 357 strings to ``quux xyzzy''. `P` is TREESAME to `O`, but not to `E`. 358 359* `X` is an independent root commit that added a new file `side`, and `Y` 360 modified it. `Y` is TREESAME to `X`. Its merge `Q` added `side` to `P`, and 361 `Q` is TREESAME to `P`, but not to `Y`. 362 363`rev-list` walks backwards through history, including or excluding 364commits based on whether `--full-history` and/or parent rewriting 365(via `--parents` or `--children`) are used. The following settings 366are available. 367 368Default mode:: 369 Commits are included if they are not TREESAME to any parent 370 (though this can be changed, see `--sparse` below). If the 371 commit was a merge, and it was TREESAME to one parent, follow 372 only that parent. (Even if there are several TREESAME 373 parents, follow only one of them.) Otherwise, follow all 374 parents. 375+ 376This results in: 377+ 378----------------------------------------------------------------------- 379 .-A---N---O 380 / / / 381 I---------D 382----------------------------------------------------------------------- 383+ 384Note how the rule to only follow the TREESAME parent, if one is 385available, removed `B` from consideration entirely. `C` was 386considered via `N`, but is TREESAME. Root commits are compared to an 387empty tree, so `I` is !TREESAME. 388+ 389Parent/child relations are only visible with `--parents`, but that does 390not affect the commits selected in default mode, so we have shown the 391parent lines. 392 393--full-history without parent rewriting:: 394 This mode differs from the default in one point: always follow 395 all parents of a merge, even if it is TREESAME to one of them. 396 Even if more than one side of the merge has commits that are 397 included, this does not imply that the merge itself is! In 398 the example, we get 399+ 400----------------------------------------------------------------------- 401 I A B N D O P Q 402----------------------------------------------------------------------- 403+ 404`M` was excluded because it is TREESAME to both parents. `E`, 405`C` and `B` were all walked, but only `B` was !TREESAME, so the others 406do not appear. 407+ 408Note that without parent rewriting, it is not really possible to talk 409about the parent/child relationships between the commits, so we show 410them disconnected. 411 412--full-history with parent rewriting:: 413 Ordinary commits are only included if they are !TREESAME 414 (though this can be changed, see `--sparse` below). 415+ 416Merges are always included. However, their parent list is rewritten: 417Along each parent, prune away commits that are not included 418themselves. This results in 419+ 420----------------------------------------------------------------------- 421 .-A---M---N---O---P---Q 422 / / / / / 423 I B / D / 424 \ / / / / 425 `-------------' 426----------------------------------------------------------------------- 427+ 428Compare to `--full-history` without rewriting above. Note that `E` 429was pruned away because it is TREESAME, but the parent list of P was 430rewritten to contain `E`'s parent `I`. The same happened for `C` and 431`N`, and `X`, `Y` and `Q`. 432 433In addition to the above settings, you can change whether TREESAME 434affects inclusion: 435 436--dense:: 437 Commits that are walked are included if they are not TREESAME 438 to any parent. 439 440--sparse:: 441 All commits that are walked are included. 442+ 443Note that without `--full-history`, this still simplifies merges: if 444one of the parents is TREESAME, we follow only that one, so the other 445sides of the merge are never walked. 446 447--simplify-merges:: 448 First, build a history graph in the same way that 449 `--full-history` with parent rewriting does (see above). 450+ 451Then simplify each commit `C` to its replacement `C'` in the final 452history according to the following rules: 453+ 454-- 455* Set `C'` to `C`. 456+ 457* Replace each parent `P` of `C'` with its simplification `P'`. In 458 the process, drop parents that are ancestors of other parents or that are 459 root commits TREESAME to an empty tree, and remove duplicates, but take care 460 to never drop all parents that we are TREESAME to. 461+ 462* If after this parent rewriting, `C'` is a root or merge commit (has 463 zero or >1 parents), a boundary commit, or !TREESAME, it remains. 464 Otherwise, it is replaced with its only parent. 465-- 466+ 467The effect of this is best shown by way of comparing to 468`--full-history` with parent rewriting. The example turns into: 469+ 470----------------------------------------------------------------------- 471 .-A---M---N---O 472 / / / 473 I B D 474 \ / / 475 `---------' 476----------------------------------------------------------------------- 477+ 478Note the major differences in `N`, `P`, and `Q` over `--full-history`: 479+ 480-- 481* `N`'s parent list had `I` removed, because it is an ancestor of the 482 other parent `M`. Still, `N` remained because it is !TREESAME. 483+ 484* `P`'s parent list similarly had `I` removed. `P` was then 485 removed completely, because it had one parent and is TREESAME. 486+ 487* `Q`'s parent list had `Y` simplified to `X`. `X` was then removed, because it 488 was a TREESAME root. `Q` was then removed completely, because it had one 489 parent and is TREESAME. 490-- 491 492Finally, there is a fifth simplification mode available: 493 494--ancestry-path:: 495 Limit the displayed commits to those directly on the ancestry 496 chain between the ``from'' and ``to'' commits in the given commit 497 range. I.e. only display commits that are ancestor of the ``to'' 498 commit and descendants of the ``from'' commit. 499+ 500As an example use case, consider the following commit history: 501+ 502----------------------------------------------------------------------- 503 D---E-------F 504 / \ \ 505 B---C---G---H---I---J 506 / \ 507 A-------K---------------L--M 508----------------------------------------------------------------------- 509+ 510A regular 'D..M' computes the set of commits that are ancestors of `M`, 511but excludes the ones that are ancestors of `D`. This is useful to see 512what happened to the history leading to `M` since `D`, in the sense 513that ``what does `M` have that did not exist in `D`''. The result in this 514example would be all the commits, except `A` and `B` (and `D` itself, 515of course). 516+ 517When we want to find out what commits in `M` are contaminated with the 518bug introduced by `D` and need fixing, however, we might want to view 519only the subset of 'D..M' that are actually descendants of `D`, i.e. 520excluding `C` and `K`. This is exactly what the `--ancestry-path` 521option does. Applied to the 'D..M' range, it results in: 522+ 523----------------------------------------------------------------------- 524 E-------F 525 \ \ 526 G---H---I---J 527 \ 528 L--M 529----------------------------------------------------------------------- 530 531The `--simplify-by-decoration` option allows you to view only the 532big picture of the topology of the history, by omitting commits 533that are not referenced by tags. Commits are marked as !TREESAME 534(in other words, kept after history simplification rules described 535above) if (1) they are referenced by tags, or (2) they change the 536contents of the paths given on the command line. All other 537commits are marked as TREESAME (subject to be simplified away). 538 539ifdef::git-rev-list[] 540Bisection Helpers 541~~~~~~~~~~~~~~~~~ 542 543--bisect:: 544 Limit output to the one commit object which is roughly halfway between 545 included and excluded commits. Note that the bad bisection ref 546 `refs/bisect/bad` is added to the included commits (if it 547 exists) and the good bisection refs `refs/bisect/good-*` are 548 added to the excluded commits (if they exist). Thus, supposing there 549 are no refs in `refs/bisect/`, if 550+ 551----------------------------------------------------------------------- 552 $ git rev-list --bisect foo ^bar ^baz 553----------------------------------------------------------------------- 554+ 555outputs 'midpoint', the output of the two commands 556+ 557----------------------------------------------------------------------- 558 $ git rev-list foo ^midpoint 559 $ git rev-list midpoint ^bar ^baz 560----------------------------------------------------------------------- 561+ 562would be of roughly the same length. Finding the change which 563introduces a regression is thus reduced to a binary search: repeatedly 564generate and test new 'midpoint's until the commit chain is of length 565one. 566 567--bisect-vars:: 568 This calculates the same as `--bisect`, except that refs in 569 `refs/bisect/` are not used, and except that this outputs 570 text ready to be eval'ed by the shell. These lines will assign the 571 name of the midpoint revision to the variable `bisect_rev`, and the 572 expected number of commits to be tested after `bisect_rev` is tested 573 to `bisect_nr`, the expected number of commits to be tested if 574 `bisect_rev` turns out to be good to `bisect_good`, the expected 575 number of commits to be tested if `bisect_rev` turns out to be bad to 576 `bisect_bad`, and the number of commits we are bisecting right now to 577 `bisect_all`. 578 579--bisect-all:: 580 This outputs all the commit objects between the included and excluded 581 commits, ordered by their distance to the included and excluded 582 commits. Refs in `refs/bisect/` are not used. The farthest 583 from them is displayed first. (This is the only one displayed by 584 `--bisect`.) 585+ 586This is useful because it makes it easy to choose a good commit to 587test when you want to avoid to test some of them for some reason (they 588may not compile for example). 589+ 590This option can be used along with `--bisect-vars`, in this case, 591after all the sorted commit objects, there will be the same text as if 592`--bisect-vars` had been used alone. 593endif::git-rev-list[] 594 595 596Commit Ordering 597~~~~~~~~~~~~~~~ 598 599By default, the commits are shown in reverse chronological order. 600 601--date-order:: 602 Show no parents before all of its children are shown, but 603 otherwise show commits in the commit timestamp order. 604 605--author-date-order:: 606 Show no parents before all of its children are shown, but 607 otherwise show commits in the author timestamp order. 608 609--topo-order:: 610 Show no parents before all of its children are shown, and 611 avoid showing commits on multiple lines of history 612 intermixed. 613+ 614For example, in a commit history like this: 615+ 616---------------------------------------------------------------- 617 618 ---1----2----4----7 619 \ \ 620 3----5----6----8--- 621 622---------------------------------------------------------------- 623+ 624where the numbers denote the order of commit timestamps, `git 625rev-list` and friends with `--date-order` show the commits in the 626timestamp order: 8 7 6 5 4 3 2 1. 627+ 628With `--topo-order`, they would show 8 6 5 3 7 4 2 1 (or 8 7 4 2 6 5 6293 1); some older commits are shown before newer ones in order to 630avoid showing the commits from two parallel development track mixed 631together. 632 633--reverse:: 634 Output the commits in reverse order. 635 Cannot be combined with `--walk-reflogs`. 636 637Object Traversal 638~~~~~~~~~~~~~~~~ 639 640These options are mostly targeted for packing of Git repositories. 641 642ifdef::git-rev-list[] 643--objects:: 644 Print the object IDs of any object referenced by the listed 645 commits. `--objects foo ^bar` thus means ``send me 646 all object IDs which I need to download if I have the commit 647 object _bar_ but not _foo_''. 648 649--objects-edge:: 650 Similar to `--objects`, but also print the IDs of excluded 651 commits prefixed with a ``-'' character. This is used by 652 linkgit:git-pack-objects[1] to build a ``thin'' pack, which records 653 objects in deltified form based on objects contained in these 654 excluded commits to reduce network traffic. 655 656--objects-edge-aggressive:: 657 Similar to `--objects-edge`, but it tries harder to find excluded 658 commits at the cost of increased time. This is used instead of 659 `--objects-edge` to build ``thin'' packs for shallow repositories. 660 661--indexed-objects:: 662 Pretend as if all trees and blobs used by the index are listed 663 on the command line. Note that you probably want to use 664 `--objects`, too. 665 666--unpacked:: 667 Only useful with `--objects`; print the object IDs that are not 668 in packs. 669endif::git-rev-list[] 670 671--no-walk[=(sorted|unsorted)]:: 672 Only show the given commits, but do not traverse their ancestors. 673 This has no effect if a range is specified. If the argument 674 `unsorted` is given, the commits are shown in the order they were 675 given on the command line. Otherwise (if `sorted` or no argument 676 was given), the commits are shown in reverse chronological order 677 by commit time. 678 679--do-walk:: 680 Overrides a previous `--no-walk`. 681 682Commit Formatting 683~~~~~~~~~~~~~~~~~ 684 685ifdef::git-rev-list[] 686Using these options, linkgit:git-rev-list[1] will act similar to the 687more specialized family of commit log tools: linkgit:git-log[1], 688linkgit:git-show[1], and linkgit:git-whatchanged[1] 689endif::git-rev-list[] 690 691include::pretty-options.txt[] 692 693--relative-date:: 694 Synonym for `--date=relative`. 695 696--date=(relative|local|default|iso|iso-strict|rfc|short|raw):: 697 Only takes effect for dates shown in human-readable format, such 698 as when using `--pretty`. `log.date` config variable sets a default 699 value for the log command's `--date` option. 700+ 701`--date=relative` shows dates relative to the current time, 702e.g. ``2 hours ago''. 703+ 704`--date=local` shows timestamps in user's local time zone. 705+ 706`--date=iso` (or `--date=iso8601`) shows timestamps in a ISO 8601-like format. 707The differences to the strict ISO 8601 format are: 708 709 - a space instead of the `T` date/time delimiter 710 - a space between time and time zone 711 - no colon between hours and minutes of the time zone 712 713+ 714`--date=iso-strict` (or `--date=iso8601-strict`) shows timestamps in strict 715ISO 8601 format. 716+ 717`--date=rfc` (or `--date=rfc2822`) shows timestamps in RFC 2822 718format, often found in email messages. 719+ 720`--date=short` shows only the date, but not the time, in `YYYY-MM-DD` format. 721+ 722`--date=raw` shows the date in the internal raw Git format `%s %z` format. 723+ 724`--date=default` shows timestamps in the original time zone 725(either committer's or author's). 726 727ifdef::git-rev-list[] 728--header:: 729 Print the contents of the commit in raw-format; each record is 730 separated with a NUL character. 731endif::git-rev-list[] 732 733--parents:: 734 Print also the parents of the commit (in the form "commit parent..."). 735 Also enables parent rewriting, see 'History Simplification' below. 736 737--children:: 738 Print also the children of the commit (in the form "commit child..."). 739 Also enables parent rewriting, see 'History Simplification' below. 740 741ifdef::git-rev-list[] 742--timestamp:: 743 Print the raw commit timestamp. 744endif::git-rev-list[] 745 746--left-right:: 747 Mark which side of a symmetric diff a commit is reachable from. 748 Commits from the left side are prefixed with `<` and those from 749 the right with `>`. If combined with `--boundary`, those 750 commits are prefixed with `-`. 751+ 752For example, if you have this topology: 753+ 754----------------------------------------------------------------------- 755 y---b---b branch B 756 / \ / 757 / . 758 / / \ 759 o---x---a---a branch A 760----------------------------------------------------------------------- 761+ 762you would get an output like this: 763+ 764----------------------------------------------------------------------- 765 $ git rev-list --left-right --boundary --pretty=oneline A...B 766 767 >bbbbbbb... 3rd on b 768 >bbbbbbb... 2nd on b 769 <aaaaaaa... 3rd on a 770 <aaaaaaa... 2nd on a 771 -yyyyyyy... 1st on b 772 -xxxxxxx... 1st on a 773----------------------------------------------------------------------- 774 775--graph:: 776 Draw a text-based graphical representation of the commit history 777 on the left hand side of the output. This may cause extra lines 778 to be printed in between commits, in order for the graph history 779 to be drawn properly. 780+ 781This enables parent rewriting, see 'History Simplification' below. 782+ 783This implies the `--topo-order` option by default, but the 784`--date-order` option may also be specified. 785 786--show-linear-break[=<barrier>]:: 787 When --graph is not used, all history branches are flattened 788 which can make it hard to see that the two consecutive commits 789 do not belong to a linear branch. This option puts a barrier 790 in between them in that case. If `<barrier>` is specified, it 791 is the string that will be shown instead of the default one. 792 793ifdef::git-rev-list[] 794--count:: 795 Print a number stating how many commits would have been 796 listed, and suppress all other output. When used together 797 with `--left-right`, instead print the counts for left and 798 right commits, separated by a tab. When used together with 799 `--cherry-mark`, omit patch equivalent commits from these 800 counts and print the count for equivalent commits separated 801 by a tab. 802endif::git-rev-list[] 803 804ifndef::git-rev-list[] 805Diff Formatting 806~~~~~~~~~~~~~~~ 807 808Listed below are options that control the formatting of diff output. 809Some of them are specific to linkgit:git-rev-list[1], however other diff 810options may be given. See linkgit:git-diff-files[1] for more options. 811 812-c:: 813 With this option, diff output for a merge commit 814 shows the differences from each of the parents to the merge result 815 simultaneously instead of showing pairwise diff between a parent 816 and the result one at a time. Furthermore, it lists only files 817 which were modified from all parents. 818 819--cc:: 820 This flag implies the `-c` option and further compresses the 821 patch output by omitting uninteresting hunks whose contents in 822 the parents have only two variants and the merge result picks 823 one of them without modification. 824 825-m:: 826 This flag makes the merge commits show the full diff like 827 regular commits; for each merge parent, a separate log entry 828 and diff is generated. An exception is that only diff against 829 the first parent is shown when `--first-parent` option is given; 830 in that case, the output represents the changes the merge 831 brought _into_ the then-current branch. 832 833-r:: 834 Show recursive diffs. 835 836-t:: 837 Show the tree objects in the diff output. This implies `-r`. 838endif::git-rev-list[]