mirror of
https://github.com/haproxy/haproxy.git
synced 2026-03-02 13:20:24 -05:00
e6f5ab5afa
There has always been a race when checking the length of an accept queue to determine which one is more loaded that another, because the head and tail are read at two different moments. This is not required, we can merge them as two 16 bit numbers inside a single 32-bit index that is always accessed atomically. This way we read both values at once and always have a consistent measurement. |
||
|---|---|---|
| .. | ||
| haproxy | ||
| import | ||
| make | ||