[go: up one dir, main page]

stacker 0.1.3

A stack growth library useful when implementing deeply recursive algorithms that may accidentally blow the stack.
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

extern crate stacker;

use std::sync::mpsc;
use std::thread;

extern {
    fn __stacker_black_box(t: *const u8);
}

#[test]
fn deep() {
    fn foo(n: usize, s: &mut [u8]) {
        unsafe { __stacker_black_box(s.as_ptr()); }
        if n > 0 {
            stacker::maybe_grow(64 * 1024, 1024 * 1024, || {
                let mut s = [0u8; 1024];
                foo(n - 1, &mut s);
                unsafe { __stacker_black_box(s.as_ptr()); }
            })
        } else {
            println!("bottom");
        }
    }

    foo(256 * 1024, &mut []);
}

#[test]
#[ignore]
fn panic() {
    fn foo(n: usize, s: &mut [u8]) {
        unsafe { __stacker_black_box(s.as_ptr()); }
        if n > 0 {
            stacker::maybe_grow(64 * 1024, 1024 * 1024, || {
                let mut s = [0u8; 1024];
                foo(n - 1, &mut s);
                unsafe { __stacker_black_box(s.as_ptr()); }
            })
        } else {
            panic!("bottom");
        }
    }

    let (tx, rx) = mpsc::channel::<()>();
    thread::spawn(move || {
        foo(64 * 1024, &mut []);
        drop(tx);
    }).join().unwrap_err();

    assert!(rx.recv().is_err());
}