| commit | 8878b6c4cb8bfcc84a1a7d007065c65bc9cc99a5 | [log] [tgz] |
|---|---|---|
| author | Willy Tarreau <w@1wt.eu> | Sun Nov 05 21:23:21 2017 +0100 |
| committer | Willy Tarreau <w@1wt.eu> | Mon Nov 06 11:20:11 2017 +0100 |
| tree | 618e8753ecec87d1e89c9f79816e0225f3dac607 | |
| parent | d1d55ac6196cd64f7408c0a9467139e45b59b732 [diff] |
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.