include/linux/refcount.h

60  * Memory ordering
63  * Memory ordering rules are slightly relaxed wrt regular atomic_t functions
66  * The increments are fully relaxed; these will not provide ordering. The
68  * reference count on will provide the ordering. For locked data structures,
84  * Note that the allocator is responsible for ordering things between free()
88  * ordering on success.
91  * acquire and release ordering for cases when the memory occupied by the
138  * refcount_set_release - set a refcount's value with release ordering
145  * Provides release memory ordering which will order previous memory operations
199  * Provides no memory ordering, it is assumed the caller has guaranteed the
254  * refcount_add_not_zero_acquire - add a value to a refcount with acquire ordering unless it is 0
264  * Provides acquire memory ordering on success, it is assumed the caller has
301  * Provides no memory ordering, it is assumed the caller has guaranteed the
327  * Provides no memory ordering, it is assumed the caller has guaranteed the
344  * refcount_inc_not_zero_acquire - increment a refcount with acquire ordering unless it is 0
347  * Similar to refcount_inc_not_zero(), but provides acquire memory ordering on
353  * Provides acquire memory ordering on success, it is assumed the caller has
375  * Provides no memory ordering, it is assumed the caller already has a
414  * Provides release memory ordering, such that prior loads and stores are done
415  * before, and provides an acquire ordering on success such that free()
442  * Provides release memory ordering, such that prior loads and stores are done
443  * before, and provides an acquire ordering on success such that free()
471  * Provides release memory ordering, such that prior loads and stores are done