Optimize testing of interesting commits

It's now taking 1 hour (!) to check all entries in
interesting-commits/linux.  This time is spent in --is-ancestor
checks.  With the list of interesting commits growing over time
we either need to trim it from time to time, so optimize processing.

This patch does 2 optimizations:
- the obvious optimization to break from loop on first match
- the optimization to quickly check whether commit is inside
  the bisict range.

Change-Id: I712e08970a65e26a517571240e2a513878c907bb

0 files changed, 0 insertions, 0 deletions