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