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

Re: [PATCH 07/10] rev-list: call new "filter_skip" function

From
Johannes Schindelin <johannes.schindelin@gmx.de>
Date
Mar 30, 2009, 07:54 UTC
Message-ID
<alpine.DEB.1.00.0903300951460.7534@intel-tinevez-2-302>
In-Reply-To
<200903300526.12978.chriscool@tuxfamily.org>
Hi,
On Mon, 30 Mar 2009, Christian Couder wrote:
Show 46 quoted lines
> Le jeudi 26 mars 2009, Junio C Hamano a écrit :
> > Christian Couder <chriscool@tuxfamily.org> writes:
> > > This patch implements a new "filter_skip" function in C in
> > > "bisect.c" that will later replace the existing implementation in
> > > shell in "git-bisect.sh".
> > >
> > > An array is used to store the skipped commits. But the array is
> > > not yet fed anything.
> > >
> > > Signed-off-by: Christian Couder <chriscool@tuxfamily.org>
> > > ---
> > >  bisect.c           |   65
> > > ++++++++++++++++++++++++++++++++++++++++++++++++++++ bisect.h          
> > > |    6 ++++-
> > >  builtin-rev-list.c |   30 ++++++++++++++++++++----
> > >  3 files changed, 95 insertions(+), 6 deletions(-)
> > >
> > > diff --git a/bisect.c b/bisect.c
> > > index 27def7d..39189f2 100644
> > > --- a/bisect.c
> > > +++ b/bisect.c
> > > @@ -4,6 +4,11 @@
> > >  #include "revision.h"
> > >  #include "bisect.h"
> > >
> > > +
> > > +static unsigned char (*skipped_sha1)[20];
> > > +static int skipped_sha1_nr;
> > > +static int skipped_sha1_alloc;
> > > +
> > >  /* bits #0-15 in revision.h */
> > >
> > >  #define COUNTED		(1u<<16)
> > > @@ -386,3 +391,63 @@ struct commit_list *find_bisection(struct
> > > commit_list *list, return best;
> > >  }
> > >
> > > +static int skipcmp(const void *a, const void *b)
> > > +{
> > > +	return hashcmp(a, b);
> > > +}
> >
> > I've learned to suspect without reading a qsort() callback that does not
> > derefence its arguments.  Is this doing the right thing?
> 
> I think so.

I suspect something much worse: you are trying to build a list of sha1s of commits that need to be skipped, later to look up every commit via binary search.

But it has been proven a lot of times that using a hash set is superior to that approach, and even better: we already have the framework in place in the form of struct decorate.

Ciao, Dscho "who is too busy to review patches ATM"

Previous: Christian CouderNext: Christian Couder
Message 4 of 9 in “rev-list: call new "filter_skip" function”
  1. 07/10 rev-list: call new "filter_skip" functionChristian Couder, Mar 26, 2009
  2. Junio C HamanoMar 26, 2009
  3. Christian CouderMar 30, 2009
  4. Johannes SchindelinMar 30, 2009
  5. Christian CouderMar 31, 2009
  6. Johannes SchindelinMar 31, 2009
  7. Christian CouderApr 1, 2009
  8. Johannes SchindelinApr 1, 2009
  9. Christian CouderApr 2, 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.