tree 618e8753ecec87d1e89c9f79816e0225f3dac607
parent d1d55ac6196cd64f7408c0a9467139e45b59b732
author Willy Tarreau <w@1wt.eu> 1509913401 +0100
committer Willy Tarreau <w@1wt.eu> 1509963611 +0100
encoding latin1

MINOR: ebtree: implement eb32sc_lookup_ge_or_first()

In the scheduler we always have to loop back to the beginning after
we don't find the last entry, so let's implement this in a new lookup
function instead. The resulting code is slightly faster, mostly due
to the fact that there's much less inlined code in the fast path.