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