rlocate/crates/squozen/docs/patprep/bench_patprep.c

#include "patprep.h"

const int count = 5 * 1000 * 1000 * 100;

void main() {
  for (int i = 0; i <= count; i++) {
    patprep("/foo/bar/whatever[0-9]*");
  }
}
Moved everything around so it's more project-y Added the squozen patprep function, added unit tests to the patprep `c` code, and ensured that the rust version works the same way. The only remaining code slowdown is that re-allocating the Vec 50 million times turns out to be slower than re-using the same slice of RAM over and over and over. 2022-11-11 16:31:22 +00:00			`#include "patprep.h"`

The C and Rust versions are now comparable. The C and Rust versions are now comparable, with a memory-reuse and a memory-safe version for Rust. The memory-safe version is five times faster than the C version; the memory-reuse version (technically safe, but can panic under some very rare circumstances) is ten times faster. I suspect the reasons for he speedup are strictly in the `for()` loop in the C version for copying the string, where the Rust version probably uses memcpy() under the covers to transfer the short string into the destination. 2022-11-13 20:33:34 +00:00			`const int count = 5 * 1000 * 1000 * 100;`
Moved everything around so it's more project-y Added the squozen patprep function, added unit tests to the patprep `c` code, and ensured that the rust version works the same way. The only remaining code slowdown is that re-allocating the Vec 50 million times turns out to be slower than re-using the same slice of RAM over and over and over. 2022-11-11 16:31:22 +00:00
			`void main() {`
			`for (int i = 0; i <= count; i++) {`
			`patprep("/foo/bar/whatever[0-9]*");`
			`}`
			`}`