ck_pr_fence_atomic_store (3) - Linux Man Pages

ck_pr_fence_atomic_store: enforce ordering of atomic read-modify-write operations to store operations

NAME

ck_pr_fence_atomic_store - enforce ordering of atomic read-modify-write operations to store operations

LIBRARY

Concurrency Kit (libck, -lck)

SYNOPSIS

In ck_pr.h Ft void Fn ck_pr_fence_atomic_store void Ft void Fn ck_pr_fence_strict_atomic_store void

DESCRIPTION

The Fn ck_pr_fence_atomic_store function enfores the ordering of any atomic read-modify-write operations relative to any load operations following the function invocation. This function always serve as an implicit compiler barrier. On architectures implementing CK_MD_TSO, this operation only serves as a compiler barrier and no fences are emitted. To force the unconditional emission of a fence, use Fn ck_pr_fence_strict_atomic_store .

EXAMPLE

#include <ck_pr.h>

static int a = 0;
static int b = 0;

void
function(void)
{
        int c;

        ck_pr_fas_int(&a, 1);

        /*
         * Guarantee that the update to a is completed
         * with respect to the store into the value pointed
         * to by b.
         */
        ck_pr_fence_atomic_store();
        c = ck_pr_store_int(&b, 2);

        return;
}

RETURN VALUES

This function has no return value.

SEE ALSO

ck_pr_stall3, ck_pr_fence_atomic3, ck_pr_fence_atomic_load3, ck_pr_fence_store3, ck_pr_fence_load3, ck_pr_fence_load_atomic3, ck_pr_fence_load_store3, ck_pr_fence_load_depends3, ck_pr_fence_memory3, ck_pr_barrier3, ck_pr_fas3, ck_pr_load3, ck_pr_store3, ck_pr_faa3, ck_pr_inc3, ck_pr_dec3, ck_pr_neg3, ck_pr_not3, ck_pr_add3, ck_pr_sub3, ck_pr_and3, ck_pr_or3, ck_pr_xor3, ck_pr_cas3, ck_pr_btc3, ck_pr_bts3, ck_pr_btr3

Additional information available at http://concurrencykit.org/