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