23 releases

0.4.5 Aug 5, 2023
0.4.3 Jul 10, 2023
0.3.0 Oct 3, 2022
0.2.6 Jul 3, 2022
0.0.1 Jun 3, 2018

#36 in Database implementations

Download history 14/week @ 2023-11-20 18/week @ 2023-11-27 12/week @ 2023-12-04 33/week @ 2023-12-11 62/week @ 2023-12-18 37/week @ 2023-12-25 20/week @ 2024-01-08 19/week @ 2024-01-15 18/week @ 2024-01-22 9/week @ 2024-01-29 22/week @ 2024-02-05 37/week @ 2024-02-12 187/week @ 2024-02-19 112/week @ 2024-02-26 60/week @ 2024-03-04

398 downloads per month
Used in 11 crates (2 directly)

MIT/Apache

11KB
202 lines

pagetable

Wait-free 4-level page table that maps from a u64 key to an &AtomicU64 value. Page fan-out is 2^16. If a key doesn't exist, intermediate pages are atomically created while traversing down the levels, and the value is initialized to 0.

This is a somewhat specialized data structure, but it is useful for maintaining metadata in concurrent systems that need to track many items that have an associated logical ID that is allocated from a dense keyspace, like databases that would like to keep track of where a page lives based on its 64-bit ID, despite it being rewritten in random places during defragmentation.

API

#[derive(Default)]
pub struct PageTable { .. }

pub fn get(&self, key: u64) -> &AtomicU64 { .. }

Example

let pt = PageTable::default();

for i in 0..100_000_000 {
    pt.get(i).fetch_add(1, Ordering::SeqCst);
}

for i in 0..100_000_000 {
    let value = pt.get(i).load(Ordering::SeqCst);
    assert_eq!(value, 1);
}

No runtime deps