On 2020-08-14 at 21:11:19, jim.cromie@gmail.com wrote:
> please teach git bisect how to use 2 separate worktrees
> for the bisection, toggling between them as bisection progresses,
> so that the end result is 2 compiled kernels,
> one broken, one good.

I'm not sure how such a thing would be implemented.  Git doesn't know
until after it's checked out the tree whether a revision is good or bad,
since usually the user needs to tell it (or use git bisect run).  Even
if Git alternated between the two worktrees in order, that doesn't mean
that one of them will end up being good, since Git may find the last
good revision early on, then continue to bisect and find many bad
revisions until it determines the right one.

Can you tell us more about the algorithm you'd like to see here?
-- 
brian m. carlson: Houston, Texas, US