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