tree 300c265485ca20be818b0fff8fc5513c40307c5a
parent a707d02657760958f83f199d18baea9f394edb4e
author Willy Tarreau <w@1wt.eu> 1657375037 +0200
committer Willy Tarreau <w@1wt.eu> 1657908990 +0200
encoding latin1

MINOR: fd: make fd_clr_running() return the previous value instead

It's an AND so it destroys information and due to this there's a call
place where we have to perform two reads to know the previous value
then to change it. With a fetch-and-and instead, in a single operation
we can know if the bit was previously present, which is more efficient.