ck_pr_fence_memory(3)

ck_pr_fence_memory3

Enforce partial ordering of all memory operations

Usage

#include <ck_pr.h>

void

ck_pr_fence_memory();

void

ck_pr_fence_strict_memory();

Library

Concurrency Kit (libck, -lck)

Overview

The ck_pr_fence_memory(3) function enforces the ordering of any memory operations with respect to the invocation of the function. This function always serves as an implicit compiler barrier. Achitectures implementing CK_MD_TSO do not emit a barrier, but compiler barrier semantics remain. Architectures implementing CK_MD_PSO and CK_MD_RMO always emit an instructions which provides the specified ordering guarantees. To force the unconditional emission of a memory fence, use ck_pr_fence_strict_memory().

Examples

#include <ck_pr.h>
static int a = 0;
static int b;
static int c;
static int d;
void
function(void)
{
	int snapshot_a;
	ck_pr_store_int(&b, 1);
	snapshot_a = ck_pr_load_int(&a);
	/*
	 * Make sure previous memory operations are
	 * ordered with respect to memory operations
	 * following the ck_pr_fence_memory.
	 */
	ck_pr_fence_memory();
	ck_pr_store_int(&d, 3);
	ck_pr_store_int(&c, 2);
	return;
}

Return values

This function has no return value.

Releases

5 releases since Debian 8 (Jessie); the text changed 1 time.

  1. 8
  2. 9–13

From libck-dev 0.7.2-6 in Debian 13 (Trixie). Parsed by carta from the page's mdoc source.