* Re: detecting cycles in Git's commit graph
2009-04-30 19:18 detecting cycles in Git's commit graph Michael Hendricks
2009-04-30 19:27 ` Shawn O. Pearce
@ 2009-05-03 11:36 ` Stephen R. van den Berg
1 sibling, 0 replies; 3+ messages in thread
From: Stephen R. van den Berg @ 2009-05-03 11:36 UTC (permalink / raw)
To: Michael Hendricks; +Cc: git
Michael Hendricks wrote:
>Are there any tools for detecting cycles in the commit graph which
>have been caused by grafts? I thought 'git fsck' might do it, but it
>doesn't seem to.
I submitted this patch some time ago, it didn't make it in. It doesn't really
cost any performance (the extra overhead is lost in the cache-misses from
main memory). I use it myself to quickly check for cyclic references.
It doesn't tell you where you went wrong, it just checks the specified
parts of the repository for circular references.
commit 0ab90c05f2255a66c1f71f35e2532dca6947fa7e
Author: Stephen R. van den Berg <srb@cuci.nl>
Date: Thu Apr 3 06:48:38 2008 +0200
Check for circular references causing 'lost' nodes
The most likely cause for circular references are bad entries in the
grafts file; since basically noone tells you where you went wrong, it
can be a bit puzzling to find out that part of your tree goes dark
sometimes, depending on which tool/options you pick to walk the
commit-tree (most notably, things go wrong when using --topo-order even
though things *seem* allright without that option).
Signed-off-by: Stephen R. van den Berg <srb@cuci.nl>
diff --git a/commit.c b/commit.c
index aa3b35b..523bb01 100644
--- a/commit.c
+++ b/commit.c
@@ -428,6 +428,7 @@ void sort_in_topological_order(struct commit_list ** list, int lifo)
struct commit_list *next, *orig = *list;
struct commit_list *work, **insert;
struct commit_list **pptr;
+ int nelements = 0;
if (!orig)
return;
@@ -437,6 +438,7 @@ void sort_in_topological_order(struct commit_list ** list, int lifo)
for (next = orig; next; next = next->next) {
struct commit *commit = next->item;
commit->indegree = 1;
+ nelements++;
}
/* update the indegree */
@@ -507,7 +509,12 @@ void sort_in_topological_order(struct commit_list ** list, int lifo)
commit->indegree = 0;
*pptr = work_item;
pptr = &work_item->next;
+ nelements--;
}
+ if (nelements)
+ fprintf(stderr,
+ "Circular references resulting in %d suppressed nodes\n",
+ nelements);
}
/* merge-base stuff */
--
Sincerely,
Stephen R. van den Berg.
"Hence we are back to stenography..."
"Is that shorthand for steganography?"
^ permalink raw reply related [flat|nested] 3+ messages in thread