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