rsmemchk 0.1.2

Rust Memory Leak check library for global_allocator
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141



use rsmemchk::{StackCallAllocEx,MemoryInfo};
use std::rc::Rc;
use std::cell::{RefCell,UnsafeCell};
#[allow(unused_imports)]
use extargsparse_worker::{extargs_error_class,extargs_new_error};
use std::error::Error;
use std::collections::HashMap;
use std::sync::Arc;

extargs_error_class!{ArcError}

#[global_allocator]
static ALLOCATOR: StackCallAllocEx = StackCallAllocEx{memsize : 23,stacksize :16};

#[derive(Clone)]
enum CFunc {
	LoadFunc(Rc<dyn Fn(&str) -> Result<(),Box<dyn Error>>>),
}



#[derive(Clone)]
struct CInner {
	val :i32,
	callfuncs :Rc<RefCell<HashMap<String,Rc<RefCell<CFunc>>>>>,
}

impl Drop for CInner {
	fn drop(&mut self) {
		println!("CInner drop");
		loop {
			let mut idx :usize = 0;
			//let mut ov :Option<Rc<RefCell<CFunc>>> = None;
			let mut ks :String = "".to_string();
			for (k,_v) in self.callfuncs.borrow().iter() {
				println!("k {}", k);
				ks = format!("{}",k);
				idx += 1;
				break;
			}

			if idx == 0 {
				break;
			}
			let ov = self.callfuncs.borrow_mut().remove(&ks);
			let c = ov.unwrap();
			println!("rc count {}",Rc::strong_count(&c));
			drop(c);
		}
	}
}

impl CInner {
	fn _add_funcs(&mut self) -> Result<(),Box<dyn Error>> {
		let b = Arc::new(UnsafeCell::new(self.clone()));
		let mut bmut =  self.callfuncs.borrow_mut();
		let s1 = b.clone();
		bmut.insert(format!("hello",),Rc::new(RefCell::new(CFunc::LoadFunc(Rc::new(move |n| {let  c :&mut CInner = unsafe {&mut *s1.get()};
			c.hello_func(n)
		} )))));
		Ok(())
	}

	fn hello_func(&mut self, n :&str ) -> Result<(),Box<dyn Error>> {
		println!("val[{}]hello {}",self.val, n);
		Ok(())
	}

	fn new(val :i32) -> Result<Self,Box<dyn Error>> {
		let mut retv :Self = Self {
			val :val,
			callfuncs :Rc::new(RefCell::new(HashMap::new())),
		};
		let _ = retv._add_funcs()?;
		Ok(retv)
	}

	fn _get_load_func(&self, v :&str) -> Option<CFunc> {
		let mut retv : Option<CFunc> = None;
		match self.callfuncs.borrow().get(v) {
			Some(f1) => {
				let f2 :&CFunc = &f1.borrow();
				retv = Some(f2.clone());
			},
			None => {}
		}
		retv		
	}

	fn call_load(&mut self, v :&str,vn :&str) -> Result<(),Box<dyn Error>> {
		let fnptr :Option<CFunc>;
		fnptr = self._get_load_func(v);
		if fnptr.is_some() {
			let f2 = fnptr.unwrap();
			match f2 {
				CFunc::LoadFunc(f) => {
					return f(vn);
				},
			}
		} else {
			extargs_new_error!{ArcError,"can not found [{}] load command map function", v}
		}
	}
}

#[derive(Clone)]
struct  C {
	inner :Rc<RefCell<CInner>>,
}

impl Drop for C {
	fn drop(&mut self) {
		println!("C cnt {}",  Rc::strong_count(&self.inner));		
	}
}

impl C {
	fn new(val :i32) -> Result<Self,Box<dyn Error>> {
		Ok(Self {
			inner : Rc::new(RefCell::new(CInner::new(val)?)),
		})
	}

	fn call_load(&self, v :&str,vn :&str) -> Result<(),Box<dyn Error>> {
		return self.inner.borrow_mut().call_load(v,vn);
	}
}

fn main() -> Result<(),Box<dyn Error>> {
	let c :C = C::new(32)?;
	let b = c.clone();
	c.call_load("hello","new")?;
	drop(c);
	b.call_load("hello","world")?;
	drop(b);
	ALLOCATOR.scan();
	let _maps :MemoryInfo = ALLOCATOR.get_memory_info()?;
	Ok(())
}