Re: [PATCH 12/17] Documentation: describe split commit-graphs

From: Junio C Hamano <gitster@pobox.com>
Date: May 9, 2019, 04:49 UTC
Message-ID: <xmqq8svgfczw.fsf@gitster-ct.c.googlers.com>
In-Reply-To: <87pnoshfkq.fsf@evledraar.gmail.com>

Ævar Arnfjörð Bjarmason <avarab@gmail.com> writes:

Show 5 quoted lines

> With commit-graph-<HASH> all these unlink() race conditions go away,
> partial reads due to concurrent graph writing becomes a non-issue (we'd
> just leave the old files, "gc" deals with them later..), no need to
> carefully fsync() files/dirs etc as we need to carefully juggle N and
> N+1 files.

The above would give a nice course correction to be in line with the rest of the system, like how split index knows about and chains to its base. Thanks for a dose of sanity.

$ 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.