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

[PATCH v3 1/3] bisect: add parameters to "filter_skipped"

From
Christian Couder <chriscool@tuxfamily.org>
Date
Jun 6, 2009, 04:41 UTC
Message-ID
<20090606044136.4031.97844.chriscool@tuxfamily.org>
In-Reply-To
<20090606043853.4031.78284.chriscool@tuxfamily.org>

because we will need to get more information from this function in some later patches.

The new "int *count" parameter gives the number of commits left after the skipped commit have been filtered out.

The new "int *skipped_first" parameter tells us if the first commit in the list has been skipped. Note that using this parameter also changes the behavior of the function if the first commit is indeed skipped. Because we assume that in this case we will want all the filtered commits, not just the first one, even if "show_all" is not set.

So using a not NULL "skipped_first" parameter really means that we plan to choose to test another commit than the first non skipped one if the first commit in the list is skipped. That in turn means that, in case the first commit is skipped, we have to return a fully filtered list.

Signed-off-by: Christian Couder <chriscool@tuxfamily.org>
---
 bisect.c           |   40 ++++++++++++++++++++++++++++++++++++----
 bisect.h           |    4 +++-
 builtin-rev-list.c |    4 +++-
 3 files changed, 42 insertions(+), 6 deletions(-)
diff --git a/bisect.c b/bisect.c
index 2c14f4d..115cf5f 100644
--- a/bisect.c
+++ b/bisect.c
@@ -521,14 +521,34 @@ static char *join_sha1_array_hex(struct sha1_array *array, char delim)
 	return strbuf_detach(&joined_hexs, NULL);
 }
 
+/*
+ * In this function, passing a not NULL skipped_first is very special.
+ * It means that we want to know if the first commit in the list is
+ * skipped because we will want to test a commit away from it if it is
+ * indeed skipped.
+ * So if the first commit is skipped, we cannot take the shortcut to
+ * just "return list" when we find the first non skipped commit, we
+ * have to return a fully filtered list.
+ *
+ * We use (*skipped_first == -1) to mean "it has been found that the
+ * first commit is not skipped". In this case *skipped_first is set back
+ * to 0 just before the function returns.
+ */
 struct commit_list *filter_skipped(struct commit_list *list,
 				   struct commit_list **tried,
-				   int show_all)
+				   int show_all,
+				   int *count,
+				   int *skipped_first)
 {
 	struct commit_list *filtered = NULL, **f = &filtered;
 
 	*tried = NULL;
 
+	if (skipped_first)
+		*skipped_first = 0;
+	if (count)
+		*count = 0;
+
 	if (!skipped_revs.sha1_nr)
 		return list;
 
@@ -537,19 +557,31 @@ struct commit_list *filter_skipped(struct commit_list *list,
 		list->next = NULL;
 		if (0 <= lookup_sha1_array(&skipped_revs,
 					   list->item->object.sha1)) {
+			if (skipped_first && !*skipped_first)
+				*skipped_first = 1;
 			/* Move current to tried list */
 			*tried = list;
 			tried = &list->next;
 		} else {
-			if (!show_all)
-				return list;
+			if (!show_all) {
+				if (!skipped_first || !*skipped_first)
+					return list;
+			} else if (skipped_first && !*skipped_first) {
+				/* This means we know it's not skipped */
+				*skipped_first = -1;
+			}
 			/* Move current to filtered list */
 			*f = list;
 			f = &list->next;
+			if (count)
+				(*count)++;
 		}
 		list = next;
 	}
 
+	if (skipped_first && *skipped_first == -1)
+		*skipped_first = 0;
+
 	return filtered;
 }
 
@@ -865,7 +897,7 @@ int bisect_next_all(const char *prefix)
 
 	revs.commits = find_bisection(revs.commits, &reaches, &all,
 				       !!skipped_revs.sha1_nr);
-	revs.commits = filter_skipped(revs.commits, &tried, 0);
+	revs.commits = filter_skipped(revs.commits, &tried, 0, NULL, NULL);
 
 	if (!revs.commits) {
 		/*
diff --git a/bisect.h b/bisect.h
index fb744fd..82f8fc1 100644
--- a/bisect.h
+++ b/bisect.h
@@ -7,7 +7,9 @@ extern struct commit_list *find_bisection(struct commit_list *list,
 
 extern struct commit_list *filter_skipped(struct commit_list *list,
 					  struct commit_list **tried,
-					  int show_all);
+					  int show_all,
+					  int *count,
+					  int *skipped_first);
 
 extern void print_commit_list(struct commit_list *list,
 			      const char *format_cur,
diff --git a/builtin-rev-list.c b/builtin-rev-list.c
index 73bff84..69753dc 100644
--- a/builtin-rev-list.c
+++ b/builtin-rev-list.c
@@ -262,7 +262,9 @@ int show_bisect_vars(struct rev_list_info *info, int reaches, int all)
 	if (!revs->commits && !(flags & BISECT_SHOW_TRIED))
 		return 1;
 
-	revs->commits = filter_skipped(revs->commits, &tried, flags & BISECT_SHOW_ALL);
+	revs->commits = filter_skipped(revs->commits, &tried,
+				       flags & BISECT_SHOW_ALL,
+				       NULL, NULL);
 
 	/*
 	 * revs->commits can reach "reaches" commits among
-- 
1.6.3.GIT
Previous: Christian CouderNext: Christian Couder
Message 2 of 37 in “automatically skip away from broken commits”
  1. 0/3 automatically skip away from broken commitsChristian Couder, Jun 6, 2009
  2. 1/3 bisect: add parameters to "filter_skipped"Christian Couder, Jun 6, 2009
  3. 2/3 bisect: when skipping, choose a commit away from a skipped commitChristian Couder, Jun 6, 2009
  4. 3/3 t6030: test skipping away from an already skipped commitChristian Couder, Jun 6, 2009
  5. Junio C HamanoJun 6, 2009
  6. Christian CouderJun 7, 2009
  7. H. Peter AnvinJun 8, 2009
  8. Junio C HamanoJun 8, 2009
  9. H. Peter AnvinJun 8, 2009
  10. Junio C HamanoJun 8, 2009
  11. H. Peter AnvinJun 8, 2009
  12. Christian CouderJun 9, 2009
  13. Jakub NarebskiJun 9, 2009
  14. H. Peter AnvinJun 9, 2009
  15. Jakub NarebskiJun 9, 2009
  16. H. Peter AnvinJun 9, 2009
  17. Christian CouderJun 9, 2009
  18. H. Peter AnvinJun 9, 2009
  19. Junio C HamanoJun 9, 2009
  20. H. Peter AnvinJun 9, 2009
  21. Christian CouderJun 9, 2009
  22. H. Peter AnvinJun 9, 2009
  23. Christian CouderJun 10, 2009
  24. Junio C HamanoJun 9, 2009
  25. Christian CouderJun 10, 2009
  26. Junio C HamanoJun 10, 2009
  27. H. Peter AnvinJun 10, 2009
  28. Christian CouderJun 11, 2009
  29. H. Peter AnvinJun 11, 2009
  30. H. Peter AnvinJun 11, 2009
  31. Christian CouderJun 12, 2009
  32. H. Peter AnvinJun 13, 2009
  33. Jakub NarebskiJun 13, 2009
  34. H. Peter AnvinJun 13, 2009
  35. Christian CouderJun 15, 2009
  36. H. Peter AnvinJun 15, 2009
  37. Christian CouderJun 13, 2009

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.