gitweb: speed up project listing on large work trees by limiting find depth

diff --git a/builtin-rev-list.c b/builtin-rev-list.c
index 43b88fae298bc21a55d3dd83d2b31019fd431d02..33726b8d8426b4878ed63184dc280957ba4434e0 100644 (file)
--- a/builtin-rev-list.c
+++ b/builtin-rev-list.c
@@ -84,7 +84,8 @@ static void show_commit(struct commit *commit)
                strbuf_init(&buf, 0);
                pretty_print_commit(revs.commit_format, commit,
                                        &buf, revs.abbrev, NULL, NULL, revs.date_mode);
-               printf("%s%c", buf.buf, hdr_termination);
+               if (buf.len)
+                       printf("%s%c", buf.buf, hdr_termination);
                strbuf_release(&buf);
        }
        maybe_flush_or_die(stdout, "stdout");
@@ -435,10 +436,10 @@ static struct commit_list *find_bisection(struct commit_list *list,
        /* Do the real work of finding bisection commit. */
        best = do_find_bisection(list, nr, weights);
 
-       if (best)
+       if (best) {
                best->next = NULL;
-
-       *reaches = weight(best);
+               *reaches = weight(best);
+       }
        free(weights);
 
        return best;