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

Re: [StGit PATCH 0/2] push optimizations

From
Karl Hasselström <kha@treskal.com>
Date
Jul 8, 2008, 04:36 UTC
Message-ID
<20080708043622.GC2247@diana.vm.bytemark.co.uk>
In-Reply-To
<b0943d9e0807071412j71780300p87d00cccea6cd8f4@mail.gmail.com>
On 2008-07-07 22:12:26 +0100, Catalin Marinas wrote:
Show 6 quoted lines
> 2008/7/2 Karl Hasselström <kha@treskal.com>:
>
> > Here's the git-apply call you asked for. You were right: it was a
> > huge speed-up.
>
> I know, I've been through this couple of years ago :-)
:-P
Show 9 quoted lines
> > I set up a benchmark to test it:
> >
> >  * 32 directories, each containing 32 subdirectories, each
> >    containing 32 small (and different) files.
>
> Can you try with a Linux kernel like the -mm tree? You get normally
> sized patches which might show a difference with the patch log. You
> can clone the for-akpm branch on git://linux-arm.org/linux-2.6 and
> just uncommit ~300 patches.

Sure, I'll do that. (But one of the reasons I chose a fully synthetic benchmark is that I wanted to start a performance suite similar to our test suite, and we want such a thing to be repeatable but not too large. (That said, operating on points of the kernel history that are fixed should do the trick as well. I'll try to find such points -- a long string of -mm patches somewhere in the history maybe?))

> >  * I set all this up with a python script feeding fast-import. A
> >    huge time-saver!
>
> What is fast-import?
man git-fast-import
I'll try to clean up and publish the script I used.
Show 12 quoted lines
> >  * Pop patches, git-reset to upstream, then goto top patch. This
> >    makes sure that we use the new infrastructure to push, and that
> >    we get one file-level conflict in each patch.
> >
> > Before the first patch, the "goto" command took 4:27 minutes,
> > wall-clock time. After the first patch, it took 1:31. After the
> > second, 0:48; one second or so slower than the stable branch
> > (which does not have a patch stack log).
>
> One second is just noise and depends on how warm the caches are. You
> could run a few times consecutively and discard the first result but
> we don't need to be that accurate.

I did run a few times, and it did indeed fluctuate some -- but I'm pretty sure there was a measurable slowdown. Though I agree that it's close enough that it doesn't really make a difference.

-- 
Karl Hasselström, kha@treskal.com
      www.treskal.com/kalle
Previous: Catalin Marinas
Message 9 of 9 in “push optimizations”
  1. 0/2 push optimizationsKarl Hasselström, Jul 2, 2008
  2. 1/2 Do simple in-index merge with diff+apply instead of read-treeKarl Hasselström, Jul 2, 2008
  3. Catalin MarinasJul 12, 2008
  4. 2/2 Reuse the same temp index in a transactionKarl Hasselström, Jul 2, 2008
  5. Reuse the same temp index in a transactionKarl Hasselström, Jul 3, 2008
  6. Catalin MarinasJul 12, 2008
  7. Karl HasselströmJul 14, 2008
  8. Catalin MarinasJul 7, 2008
  9. Karl HasselströmJul 8, 2008

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.