+20
−20
Loading
Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more
Rather than open coding a binary search use the standard bsearch() using the comparison function we're already using for sort() on insert. This fixes a lockup I was observing due to iterating on min <= max rather than min < max when we fail to look up. Signed-off-by:Mark Brown <broonie@opensource.wolfsonmicro.com> Acked-by:
Dimitris Papastamos <dp@opensource.wolfsonmicro.com>