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.
175  * Provides no memory ordering, it is assumed the caller has guaranteed the
211  * Provides no memory ordering, it is assumed the caller has guaranteed the
237  * Provides no memory ordering, it is assumed the caller has guaranteed the
259  * Provides no memory ordering, it is assumed the caller already has a
297  * Provides release memory ordering, such that prior loads and stores are done
298  * before, and provides an acquire ordering on success such that free()
325  * Provides release memory ordering, such that prior loads and stores are done
326  * before, and provides an acquire ordering on success such that free()
354  * Provides release memory ordering, such that prior loads and stores are done