Lines Matching full:ordering

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.
165  * Provides no memory ordering, it is assumed the caller has guaranteed the
202  * Provides no memory ordering, it is assumed the caller has guaranteed the
228  * Provides no memory ordering, it is assumed the caller has guaranteed the
250  * Provides no memory ordering, it is assumed the caller already has a
289  * Provides release memory ordering, such that prior loads and stores are done
290  * before, and provides an acquire ordering on success such that free()
317  * Provides release memory ordering, such that prior loads and stores are done
318  * before, and provides an acquire ordering on success such that free()
346  * Provides release memory ordering, such that prior loads and stores are done