I have never run any benchmarking tests before, let alone in a #![no_std] implementation. I'm implementing some security features and I want to run a prime based algorithm with security features on and with them off. That way I can determine the performance hit of using security measures. I found a primes crate, but I was a little concerned with the following line
let mut pset = Sieve::new();
which makes me think this uses heap. My project does not have an allocator so I can't use heap. Does anyone have any suggestions and/or experience?