diff options
| author | Junio C Hamano <gitster@pobox.com> | 2019-02-06 22:05:24 -0800 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2019-02-06 22:05:25 -0800 |
| commit | 5fda343321f36384892061b21dcbe1d477145d2c (patch) | |
| tree | 3bc2ed0d898f0c4768529f5ecc9f5ec58dee9e49 /bisect.c | |
| parent | d8d62e61353c7e34006cc5714f07f507256612df (diff) | |
| parent | 99dbbfa8ddbba2b620965d026d4ec199b8837a6f (diff) | |
| download | git-5fda343321f36384892061b21dcbe1d477145d2c.tar.gz | |
Merge branch 'ds/push-sparse-tree-walk'
"git pack-objects" learned another algorithm to compute the set of
objects to send, that trades the resulting packfile off to save
traversal cost to favor small pushes.
* ds/push-sparse-tree-walk:
pack-objects: create GIT_TEST_PACK_SPARSE
pack-objects: create pack.useSparse setting
revision: implement sparse algorithm
list-objects: consume sparse tree walk
revision: add mark_tree_uninteresting_sparse
Diffstat (limited to 'bisect.c')
| -rw-r--r-- | bisect.c | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -658,7 +658,7 @@ static void bisect_common(struct rev_info *revs) if (prepare_revision_walk(revs)) die("revision walk setup failed"); if (revs->tree_objects) - mark_edges_uninteresting(revs, NULL); + mark_edges_uninteresting(revs, NULL, 0); } static void exit_if_skipped_commits(struct commit_list *tried, |