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? Is git smart enough to not load the root tree for "log -- ./" or would we get the desired performance numbers from 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.) > +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. > 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?) Thanks, Stefan
