rlalloc 0.1.3

blazingly slow malloc replacement
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

mod chunk;
pub mod ralloc;

/// Custom global allocator implemented using a free list.
/// # Usage
/// ```rust
/// use rlalloc::RAllocator;
///
/// #[global_allocator]
/// static GLOBAL: RAllocator = RAllocator::new();
/// // This will make you program use the RAllocatorInternal allocator for all heap allocations
/// ```
pub type RAllocator = ralloc::RAllocatorInternal;

#[cfg(test)]
mod tests {
    use super::*;

    #[global_allocator]
    static GLOBAL: RAllocator = RAllocator::new();

    use std::thread;

    #[test]
    fn large_number_of_allocations() {
        let mut v = Vec::new();
        for _ in 0..1_000_000 {
            v.push(Box::new(10));
        }
        assert_eq!(*v[0], 10);
    }

    #[test]
    fn large_allocation() {
        let v = vec![0u8; 1_000_000];
        assert_eq!(v.len(), 1_000_000);
    }

    #[test]
    fn concurrent_allocations() {
        let mut handles = Vec::new();
        for _ in 0..10 {
            let handle = thread::spawn(|| {
                let mut v = Vec::new();
                for _ in 0..100_000 {
                    v.push(Box::new(10));
                }
                assert_eq!(*v[0], 10);
            });
            handles.push(handle);
        }

        for handle in handles {
            handle.join().unwrap();
        }
    }

    #[test]
    fn concurrent_large_allocations() {
        let mut handles = Vec::new();
        for _ in 0..10 {
            let handle = thread::spawn(|| {
                let v = vec![0u8; 1_000_000];
                assert_eq!(v.len(), 1_000_000);
            });
            handles.push(handle);
        }

        for handle in handles {
            handle.join().unwrap();
        }
    }
}