This is the mail archive of the
mailing list for the glibc project.
Re: [PATCH] Use uname not sysctl to get the kernel revision
Eric W. Biederman wrote:
It depends greatly; if a lock is likely to get released by the user after a few
memory accesses, spinning is likely to be a win.
But this requires that the lock be short lived, and highly contended.
Correct, and incorrect, in that order.
The contention level of the lock determines how likely you are to fail
to acquire it immediately, not how long it takes until it can be
acquired *after you know a failure has already happened.*
If the lock is not short lived then the release is like to be a long
ways off. If the lock is not highly contended then you are not likely
to hit the window when someone else as the contended lock.
The last sentence makes no sense either grammatically or technically.
How frequent are highly contended short lived locks in user space?
Short-lived locks (which may be significantly contended) are very common
to protect data structures.