baby-mimalloc 0.2.1

Mimalloc implemented in Rust (not a binding to the C library) with only basic features.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116

use core::ptr::{null_mut, NonNull};

pub struct LinkedList<T> {
    first: *mut T,
    last: *mut T,
}

pub trait LinkedListItem {
    fn prev(&self) -> *mut Self;

    fn next(&self) -> *mut Self;

    fn set_prev(&mut self, prev: *mut Self);

    fn set_next(&mut self, next: *mut Self);
}

impl<T> LinkedList<T> {
    pub const fn new() -> Self {
        Self {
            first: null_mut(),
            last: null_mut(),
        }
    }

    pub const fn first(&self) -> *mut T {
        self.first
    }
}

impl<T: LinkedListItem> LinkedList<T> {
    /// Push a new element at the beginning of the list.
    pub unsafe fn push_front(&mut self, mut el: NonNull<T>) {
        el.as_mut().set_next(self.first);
        el.as_mut().set_prev(null_mut());

        if let Some(first) = self.first.as_mut() {
            first.set_prev(el.as_ptr());
        } else {
            self.last = el.as_ptr();
        }

        self.first = el.as_ptr();
    }

    /// Push a new element at the end of the list.
    ///
    /// Returns whether the first element of the list is updated.
    pub unsafe fn push_back(&mut self, mut el: NonNull<T>) -> bool {
        el.as_mut().set_prev(self.last);
        el.as_mut().set_next(null_mut());

        let result = if let Some(last) = self.last.as_mut() {
            last.set_next(el.as_ptr());
            false
        } else {
            self.first = el.as_ptr();
            true
        };

        self.last = el.as_ptr();

        result
    }

    /// Remove an element from the list. The element must be in the list.
    ///
    /// Returns whether the first element of the list is updated.
    pub unsafe fn remove(&mut self, mut el: NonNull<T>) -> bool {
        if let Some(prev) = el.as_ref().prev().as_mut() {
            prev.set_next(el.as_ref().next());
        }
        if let Some(next) = el.as_ref().next().as_mut() {
            next.set_prev(el.as_ref().prev());
        }
        let first_updated = el.as_ptr() == self.first;
        if first_updated {
            self.first = el.as_ref().next();
        }
        if el.as_ptr() == self.last {
            self.last = el.as_ref().prev();
        }
        el.as_mut().set_prev(null_mut());
        el.as_mut().set_next(null_mut());
        first_updated
    }

    /// Check if an element is in the list. The element must not be in another list.
    pub fn contains(&self, el: &T) -> bool {
        !el.next().is_null() || !el.prev().is_null() || el as *const _ == self.first
    }
}

macro_rules! impl_list_item {
    ($name: ident) => {
        impl crate::list::LinkedListItem for $name {
            fn prev(&self) -> *mut Self {
                self.prev
            }

            fn next(&self) -> *mut Self {
                self.next
            }

            fn set_prev(&mut self, prev: *mut Self) {
                self.prev = prev
            }

            fn set_next(&mut self, next: *mut Self) {
                self.next = next
            }
        }
    };
}

pub(crate) use impl_list_item;