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

[PATCH 2/2] tree-walk: micro-optimization in tree_entry_interesting

From
Dan McGee <dpmcgee@gmail.com>
Date
Sep 9, 2011, 02:02 UTC
Message-ID
<1315533766-25901-2-git-send-email-dpmcgee@gmail.com>
In-Reply-To
<1315533766-25901-1-git-send-email-dpmcgee@gmail.com>

In the case of a wide breadth top-level tree (~2400 entries, all trees in this case), we can see a noticeable cost in the profiler calling strncmp() here. Most of the time we are at the base level of the repository, so base is "" and baselen == 0, which means we will always test true. Break out this one tiny case so we can short circuit the strncmp() call.

Test cases are as follows. packages.git is the Arch Linux git-svn clone of the packages repository which has the characteristics above.

Commands: [1] packages.git, /usr/bin/time git log >/dev/null [2] packages.git, /usr/bin/time git log -- autogen/trunk pacman/trunk wget/trunk >/dev/null [3] linux.git, /usr/bin/time git log >/dev/null [4] linux.git, /usr/bin/time git log -- drivers/ata drivers/uio tools >/dev/null

Results:
     before  after  %faster
[1]   2.56    2.55   0.4%
[2]  51.82   48.66   6.5%
[3]   5.58    5.61  -0.5%
[4]   1.55    1.51   0.2%

The takeaway here is this doesn't matter in many operations, but it does for a certain style of repository and operation where it nets a 6.5% measured improvement. The other changes are likely not significant by reasonable statistics methods.

Note: the measured improvement when originally submitted was ~11% (43 to
38 secs) for operation [2]. At the time, the repository had 117220
commits; it now has 137537 commits.
Signed-off-by: Dan McGee <dpmcgee@gmail.com>
---
 tree-walk.c |    4 ++--
 1 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/tree-walk.c b/tree-walk.c
index dbcd94a..e401f07 100644
--- a/tree-walk.c
+++ b/tree-walk.c
@@ -591,8 +591,8 @@ int tree_entry_interesting(const struct name_entry *entry,
 					      ps->max_depth);
 		}
 
-		/* Does the base match? */
-		if (!strncmp(base_str, match, baselen)) {
+		/* Either there must be no base, or the base must match. */
+		if (baselen == 0 || !strncmp(base_str, match, baselen)) {
 			if (match_entry(entry, pathlen,
 					match + baselen, matchlen - baselen,
 					&never_interesting))
-- 
1.7.6.1
Previous: Dan McGee
Message 30 of 30 in “diff_tree_sha1: skip diff_tree if old == new”
  1. 1/5 diff_tree_sha1: skip diff_tree if old == newDan McGee, Mar 31, 2011
  2. 2/5 tree-walk: drop unused parameter from match_dir_prefixDan McGee, Mar 31, 2011
  3. Dan McGeeAug 30, 2011
  4. 3/5 tree-walk: micro-optimization in tree_entry_interestingDan McGee, Mar 31, 2011
  5. Nguyen Thai Ngoc DuyApr 3, 2011
  6. Junio C HamanoApr 3, 2011
  7. Dan McGeeApr 5, 2011
  8. tree_entry_interesting: inline strncmp()Nguyễn Thái Ngọc Duy, Apr 4, 2011
  9. 4/5 tree-walk: unroll get_mode since loop boundaries are well-knownDan McGee, Mar 31, 2011
  10. Nguyen Thai Ngoc DuyApr 2, 2011
  11. Dan McGeeApr 2, 2011
  12. Nguyen Thai Ngoc DuyApr 3, 2011
  13. Erik Faye-LundApr 4, 2011
  14. Andreas EricssonApr 4, 2011
  15. Junio C HamanoApr 4, 2011
  16. Dan McGeeApr 5, 2011
  17. Antriksh PanyApr 5, 2011
  18. Dan McGeeApr 6, 2011
  19. 5/5 tree-walk: match_entry microoptimizationDan McGee, Mar 31, 2011
  20. Nguyen Thai Ngoc DuyApr 2, 2011
  21. Dan McGeeApr 2, 2011
  22. Nguyen Thai Ngoc DuyMar 31, 2011
  23. Dan McGeeMar 31, 2011
  24. Junio C HamanoApr 1, 2011
  25. Nguyen Thai Ngoc DuyMay 3, 2011
  26. Fwd: [PATCH 1/5] diff_tree_sha1: skip diff_tree if old == newDan McGee, Apr 2, 2011
  27. Dan McGeeAug 30, 2011
  28. Junio C HamanoAug 30, 2011
  29. 1/2 tree-walk: drop unused parameter from match_dir_prefixDan McGee, Sep 9, 2011
  30. 2/2 tree-walk: micro-optimization in tree_entry_interestingDan McGee, Sep 9, 2011

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.