Ah, I see. Not likely to ever be the case with this. The lock will likely be with the main data structure (the list, or whatever) and the refcount will be in the individual item in the main data structure (list entry).Just doing an atomic operation is not faster than doing a lock, an atomic operation, then an unlock? Am I missing something?
if the lock and the atomic are on the same cacheline they're the same
cost on most modern cpus...