What's soft lockup?

[Rafael David Tinoco]

>
> Yes, that is the idea behind bisection...

BTW, bisection process is not linear so it wont take as much as you
thought. Usually in between kernel versions 10 to 15 steps is all you
need. Determinism around bisection can be read here:
https://x-engineer.org/undergraduate-engineering/advanced-mathematics/numerical-methods/the-bisection-method-for-root-finding/

>
> You have the git tree of the kernel you're using.. find a commit that
> builds and does not have the issue.. then find a commit that builds
> and has the issue. Now you have the "good" commit and the "bad" commit
> and you will compile your kernel on each step and run your tests.
>
> If the kernel works through your test case.. you have a good step, if
> your kernel does not work.. you have the bad step... you continue this
> until you find the commit that introduced the issue (or solved it).
>
> You will find good tutorials online teaching how to do this.. only
> thing I have enough time to provide you right now is:
>
> https://github.com/rafaeldtinoco/work/tree/master/sources/kernel
>
> and
>
> https://github.com/rafaeldtinoco/work/blob/master/sources/kernel/.gitbuild.sh
>
> it may help you building the kernel in an ubuntu way (faster than
> usual) considering you have a configuration file in hand.. just read
> the scripts.
>
> Good luck!