tree 118a35b87e4951ad399eee09946800e8e8a47a90
parent 5b3927531145384bad8d2b46ca21f017afde81c7
author Willy Tarreau <w@1wt.eu> 1624041170 +0200
committer Willy Tarreau <w@1wt.eu> 1624381038 +0200
encoding latin1

MINOR: queue: make pendconn_first() take the lock by itself

Dealing with the queue lock in the caller remains complicated. Let's
change pendconn_first() to take the queue instead of the tree head,
and handle the lock itself. It now returns an element with a locked
queue or no element with an unlocked queue. It can avoid locking if
the queue is already empty.