---
name: "ck_pr_fence_memory"
section: "3"
platform: "linux"
package: "libck-dev"
version: "0.7.2-6"
release: "Debian 13 (Trixie)"
platforms: ["linux"]
url: "https://new.carta.tech/ck_pr_fence_memory"
---

# ck\_pr\_fence\_memory(3)

enforce partial ordering of all memory operations

## NAME

**ck\_pr\_fence\_memory** – enforce partial ordering of all memory operations

## LIBRARY

Concurrency Kit (libck, -lck)

## SYNOPSIS

**#include \<ck\_pr.h\>**

*void*\

**ck\_pr\_fence\_memory**();

*void*\

**ck\_pr\_fence\_strict\_memory**();

## DESCRIPTION

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**().

## EXAMPLE

```
#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.

## SEE ALSO

[ck\_pr\_stall(3)](/ck_pr_stall/3.md), [ck\_pr\_fence\_atomic(3)](/ck_pr_fence_atomic/3.md), [ck\_pr\_fence\_atomic\_store(3)](/ck_pr_fence_atomic_store/3.md), [ck\_pr\_fence\_atomic\_load(3)](/ck_pr_fence_atomic_load/3.md), [ck\_pr\_fence\_load(3)](/ck_pr_fence_load/3.md), [ck\_pr\_fence\_load\_depends(3)](/ck_pr_fence_load_depends/3.md), [ck\_pr\_fence\_store(3)](/ck_pr_fence_store/3.md), [ck\_pr\_barrier(3)](/ck_pr_barrier/3.md), [ck\_pr\_fas(3)](/ck_pr_fas/3.md), [ck\_pr\_load(3)](/ck_pr_load/3.md), [ck\_pr\_store(3)](/ck_pr_store/3.md), [ck\_pr\_faa(3)](/ck_pr_faa/3.md), [ck\_pr\_inc(3)](/ck_pr_inc/3.md), [ck\_pr\_dec(3)](/ck_pr_dec/3.md), [ck\_pr\_neg(3)](/ck_pr_neg/3.md), [ck\_pr\_not(3)](/ck_pr_not/3.md), [ck\_pr\_add(3)](/ck_pr_add/3.md), [ck\_pr\_sub(3)](/ck_pr_sub/3.md), [ck\_pr\_and(3)](/ck_pr_and/3.md), [ck\_pr\_or(3)](/ck_pr_or/3.md), [ck\_pr\_xor(3)](/ck_pr_xor/3.md), [ck\_pr\_cas(3)](/ck_pr_cas/3.md), [ck\_pr\_btc(3)](/ck_pr_btc/3.md), [ck\_pr\_bts(3)](/ck_pr_bts/3.md), [ck\_pr\_btr(3)](/ck_pr_btr/3.md)

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