Re: [PATCH 3/3] commit-graph: lazy-load trees

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On 4/3/2018 2:00 PM, Stefan Beller wrote:
On Tue, Apr 3, 2018 at 5:00 AM, Derrick Stolee <dstolee@xxxxxxxxxxxxx> wrote:
The commit-graph file provides quick access to commit data, including
the OID of the root tree for each commit in the graph. When performing
a deep commit-graph walk, we may not need to load most of the trees
for these commits.

Delay loading the tree object for a commit loaded from the graph
until requested via get_commit_tree(). Do not lazy-load trees for
commits not in the graph, since that requires duplicate parsing
and the relative peformance improvement when trees are not needed
is small.

On the Linux repository, performance tests were run for the following
command:

         git log --graph --oneline -1000

Before: 0.83s
After:  0.65s
Rel %: -21.6%
This is an awesome speedup.

Adding '-- kernel/' to the command requires loading the root tree
for every commit that is walked.
and as the walk prunes those commits that do not touch kernel/
which from my quick glance is the real core thing. Linus' announcements
claim that > 50% is drivers, networking and documentation[1].
So the "-- kernel/" walk needs to walk twice as many commits to find
a thousand commits that actually touch kernel/ ?

[1] http://lkml.iu.edu/hypermail/linux/kernel/1801.3/02794.html
http://lkml.iu.edu/hypermail/linux/kernel/1803.3/00580.html

There was no measureable performance
change as a result of this patch.
... which means that the walking itself is really fast now and the
dominating effects are setup and checking the tree?

Yeah. I was concerned that since we take two accesses into the commit-graph file that we could measurably slow down cases where we need to load the trees. That is not an issue since we will likely parse the tree after loading, and parsing is much slower than these commit-graph accesses.


Is git smart enough to not load the root tree for "log -- ./" or
would we get the desired performance numbers from that?

I wonder, since it only really needs the OID of the root tree to determine TREESAME. If it cares about following TREESAME relationships on ./, then it should do that.


@@ -317,6 +315,27 @@ int parse_commit_in_graph(struct commit *item)
         return 0;
  }

+static struct tree *load_tree_for_commit(struct commit_graph *g, struct commit *c)
+{
+       struct object_id oid;
+       const unsigned char *commit_data = g->chunk_commit_data + (g->hash_len + 16) * (c->graph_pos);
What is 16? (I imagine it is the "length of the row" - g->hash_len ?)
Would it make sense to have a constant/define for an entire row instead?
(By any chance what is the meaning of GRAPH_DATA_WIDTH, which is 36?
That is defined but never used.)

Yeah, I should use GRAPH_DATA_WIDTH here instead.


+struct tree *get_commit_tree_in_graph(const struct commit *c)
+{
+       if (c->tree)
+               return c->tree;
This double checking is defensive programming, in case someone
doesn't check themselves (as get_commit_tree does below).

ok.

@@ -17,6 +17,13 @@ char *get_commit_graph_filename(const char *obj_dir);
   */
  int parse_commit_in_graph(struct commit *item);

+/*
+ * For performance reasons, a commit loaded from the graph does not
+ * have a tree loaded until trying to consume it for the first time.
That is the theme of this series/patch, but do we need to write it down
into the codebase? I'd be inclined to omit this part and only go with:

   Load the root tree of a commit and return the tree.

OK.


  struct tree *get_commit_tree(const struct commit *commit)
  {
-       return commit->tree;
+       if (commit->tree || !commit->object.parsed)
I understand to return the tree from the commit
when we have the tree in the commit object (the first
part).

But 'when we have not (yet) parsed the commit object',
we also just return its tree? Could you explain the
second part of the condition?
Is that for commits that are not part of the commit graph?
(But then why does it need to be negated?)

Some callers check the value of 'commit->tree' without a guarantee that the commit was parsed. In this case, the way to preserve the existing behavior is to continue returning NULL. If I remove the "|| !commit->object.parsed" then the BUG("commit has NULL tree, but was not loaded from commit-graph") is hit in these two tests:

t6012-rev-list-simplify.sh
t6110-rev-list-sparse.sh

I prefer to keep the BUG() statement and instead use this if statement. If someone has more clarity on why this is a good existing behavior, then please chime in.

Thanks,
-Stolee



[Index of Archives]     [Linux Kernel Development]     [Gcc Help]     [IETF Annouce]     [DCCP]     [Netdev]     [Networking]     [Security]     [V4L]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Linux SCSI]     [Fedora Users]

  Powered by Linux