git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: [PATCH v4 1/2] revision.c: implement --reverse=before for walks

From
Chris Torek <chris.torek@gmail.com>
Date
Apr 27, 2026, 13:58 UTC
Message-ID
<CAPx1GvcU8b7CfGrXxzZa10Ys2YScGq_2B4M9jkhs2SwywRP3AQ@mail.gmail.com>
In-Reply-To
<xmqq1pg04mbt.fsf@gitster.g>

This topic has been rattling around in my head for a while, and I need to get it out now. :-)

First, a few notes:
 * I'm going to delete most of the context because I want to go back
to first principles here. Instead, I'll list what I think are the real
issues.
 * I have always had a suspicion that `--max-count` / `-n` was "done
wrong" in the first place, it's just that it's generally invisibly
wrong.
 * While all the revision-walking machinery normally shows commits
"newest first", there are several fundamental issues with defining
"newest" anyway. A lot of Git newcomers find this terribly confusing
-- usually a few weeks or months into use of Git, really.

It's important to note that the rev-walk machinery uses a priority queue, and that this is necessary because commits are in a directed graph, which cannot be presented linearly unless you're willing to: (a) add additional information (graph drawing, parent list, whatever), or (b) discard information. The `git log` and `git rev-list` documentation skimp a bit on this.

There is of course nothing wrong with discarding information when it's irrelevant. In fact, that's the whole point of abstraction, to toss out irrelevancies so that one can concentrate only on the relevant. And that's what all the limiting options for revision walking are for!

Sorting options affect the order in which items go into the priority queue. Limiting options affect which items go in, and sometimes, how many items come out. Display options affect what we see when the items come out, and this includes the sorting options since they come out in the order they're in there.

Thus, `--reverse` is a *display* option (part of sorting), while `--max-count` is a *limiting* option. It's just that, well, there's a special case when they're combined.

Junio noted:
> That makes two of us to suspect that this is more about --max-count than --reverse.

And that's really the case here. Because `--max-count` was "done wrong" initially, we have a slight problem. Had it been done as a "window of items in the priority queue", we would always have gotten the limited-to-N items remaining in the queue after the selection process, displayed according to the display process. But when the display is going to be "in the order of items in the queue" and the limiting count is N items *and* the display doesn't reverse the queue, it suffices to display the first N items and then quit entirely. This is of course a nice space-and-time optimization.

As it turns out, the only display option that causes this optimization to be invalid is (or might be) `--reverse`.

Unfortunately, fixing the problem by simply defeating the "keep N items in the queue and only stop early (and maybe display as we go as well) if we're allowed" optimization -- the one that was applied prematurely, as it were -- will change the existing behavior of `git log -n 10 --reverse` in any repository with more than 10 commits in it. Had the over-optimization not been done, and someone wanted to add a "gather only N into the queue and then stop traversing, and then display" option, we could perhaps use `--stop-walk-(after|at)=n` as a new option.

As far as I can tell, the gripe that this exposes the priority queue mechanism is valid, but at best trivial, because knowing about the priority queue is crucial anyway. Beginners can skip it for a little while, but as soon as they find out that commits have two separate date stamps, and learn about `--date-order`, `--author-date-order`, and `--topo-order`, they need to learn about the queue.

If it's deemed acceptable to change the historic behavior of `--max-count` combined with `--reverse`, I'd suggest simply adding `--stop-walk-after` (perhaps with a slightly different name) to take over the historic behavior of `--max-count`, and make `--max-count` not over-optimize. If not, I'd suggest a new option, with a note in the documentation that `--max-count` has this odd behavior when combined with `--reverse`. Perhaps the new option could be called `--prio-queue-size=n`. The implementation can still optimize this (using the same code as before) when `--reverse` isn't in effect, since the effect is only visible with `--reverse`.

Chris
Previous: Junio C HamanoNext: Mirko Faina
Message 33 of 63 in “revision.c: implement --reverse=before for walks”
  1. revision.c: implement --reverse=before for walksMirko Faina, Apr 18, 2026
  2. Tian YuchenApr 18, 2026
  3. Mirko FainaApr 18, 2026
  4. Mirko FainaApr 18, 2026
  5. Junio C HamanoApr 20, 2026
  6. Tian YuchenApr 20, 2026
  7. Mirko FainaApr 20, 2026
  8. Ben KnobleApr 19, 2026
  9. Mirko FainaApr 19, 2026
  10. D. Ben KnobleApr 19, 2026
  11. Mirko FainaApr 19, 2026
  12. Jeff KingApr 20, 2026
  13. Mirko FainaApr 20, 2026
  14. Mirko FainaApr 20, 2026
  15. Jeff KingApr 21, 2026
  16. D. Ben KnobleApr 22, 2026
  17. Mirko FainaApr 22, 2026
  18. Jeff KingApr 20, 2026
  19. Mirko FainaApr 20, 2026
  20. 0/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 22, 2026
  21. Mirko FainaApr 22, 2026
  22. 0/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 23, 2026
  23. 2/2 revision.c: reduce memory usage on reverse beforeMirko Faina, Apr 23, 2026
  24. 1/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 23, 2026
  25. Junio C HamanoApr 28, 2026
  26. 0/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 27, 2026
  27. 2/2 revision.c: reduce memory usage on reverse beforeMirko Faina, Apr 27, 2026
  28. Junio C HamanoApr 28, 2026
  29. 1/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 27, 2026
  30. Junio C HamanoApr 27, 2026
  31. Johannes SixtApr 27, 2026
  32. Junio C HamanoApr 27, 2026
  33. Chris TorekApr 27, 2026
  34. Mirko FainaApr 27, 2026
  35. Junio C HamanoApr 28, 2026
  36. Junio C HamanoApr 28, 2026
  37. revision.c: implement --max-count-oldestMirko Faina, Apr 30, 2026
  38. Junio C HamanoMay 4, 2026
  39. Mirko FainaMay 4, 2026
  40. revision.c: implement --max-count-oldestMirko Faina, May 5, 2026
  41. Johannes SixtMay 6, 2026
  42. Mirko FainaMay 6, 2026
  43. Junio C HamanoMay 7, 2026
  44. Mirko FainaMay 8, 2026
  45. Jean-Noël AVILAMay 9, 2026
  46. Mirko FainaMay 10, 2026
  47. Junio C HamanoMay 9, 2026
  48. Mirko FainaMay 10, 2026
  49. revision.c: implement --max-count-oldestMirko Faina, May 15, 2026
  50. revision.c: implement --max-count-oldestMirko Faina, May 19, 2026
  51. Mirko FainaMay 19, 2026
  52. Junio C HamanoMay 20, 2026
  53. Mirko FainaMay 20, 2026
  54. revision.c: implement --max-count-oldestJunio C Hamano, Jun 1, 2026
  55. Mirko FainaJun 2, 2026
  56. Junio C HamanoMay 19, 2026
  57. Mirko FainaMay 19, 2026
  58. Junio C HamanoMay 9, 2026
  59. Mirko FainaMay 10, 2026
  60. 2/2 revision.c: reduce memory usage on reverse beforeMirko Faina, Apr 22, 2026
  61. 1/2 revision.c: implement --reverse=before for walksMirko Faina, Apr 22, 2026
  62. Jeff KingApr 22, 2026
  63. Mirko FainaApr 22, 2026

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.