path: root/bench
AgeCommit message (Collapse)Author
2018-03-17Add benchmark for bigint multiplication.Ori Bernstein
2018-03-17Implement karatsuba multiplication.Ori Bernstein
This is a nice optimization. In the most optimal case, it makes this stupid benchmark about 10 times faster: a = std.mkbigint(17193) b = std.mkbigint(1091327) for var i = 0; i < 12; i++ mul(a, b) mul(b, a) ;; It also makes a decent change (about 10%) on `mbld bench` for bigfactorial, in spite of us mostly not falling into the karatsuba case.
2018-02-04Free up regexes/strings after benchmark.Ori Bernstein
It's not important to do, but we want to be a good example for newbies.
2017-12-29Benchmark matching at end of string.Ori Bernstein
2017-12-28Use the right (hello) pattern in the benchmarks.Ori Bernstein
2017-11-14Use new traits to implement hash tablesLucas Gabriel Vuotto
Signed-off-by: Lucas Gabriel Vuotto <>
2017-09-10Put a bunch of things into a hash table.Ori Bernstein
2017-09-10Add a hash table put benchmark.Ori Bernstein
2017-09-10Add hash table htget benchmark.Ori Bernstein
2017-09-09Add hash benchmarks.Ori Bernstein
2017-09-05testdep sare busted with bench targets.Ori Bernstein
List deps explicitly.
2017-09-04Do 1000 allocs at once.Ori Bernstein
Let's not benchmark call overhead.
2017-09-04Modernize benchmarks.Ori Bernstein
2017-07-17Convert from `in` to `:`.Ori Bernstein
The winds of change are a-blowin.
2017-01-04Remove dead makefiles and shuffle around docs.Ori Bernstein
2016-12-09Fix benchmark code.Ori Bernstein
2016-10-26Fix benchmark programs.Ori Bernstein
2016-08-27Rename `std.Fail to `std.Err.Ori Bernstein
2016-06-27Fix case insensitive hash, and add tests.Ori Bernstein
2016-05-17New syntax for casts.Ori Bernstein
2015-12-04Add benchmark build tag to benchmarks.Ori Bernstein
We don't need them built by default.
2015-11-17MEGAPATCH: Tabification.Ori Bernstein
Tabs > spaces. By 4 spaces, to be precise. Let's use them.
2015-11-07Use shorter relative paths.Ori Bernstein
No reason, it just looks prettier in 'mbld' output.
2015-10-08Don't install the benchmark programsOri Bernstein
2015-10-06Fix up error handling for syswrap+posixy.myrOri Bernstein
2015-10-03Fix misnamed bld.subOri Bernstein
2015-10-02Implement some asm optimized memcpy/memmove checks.Ori Bernstein
TODO: memcmp
2015-09-23Include necessary library deps in benchmarks.Ori Bernstein
2015-09-22Don't try to benchmark the benchmark program.Ori Bernstein
2015-09-22Start moving benchmark runner code to Myrddin.Ori Bernstein
2015-07-31Fix benchmarks.Ori Bernstein
2015-05-06More work towards getting undefined variables to be defined.Ori Bernstein
2014-11-05Fix up pattern tree generation.Ori Bernstein
We're no longer clobbering things with wildcards.
2014-10-13Add regex benchmark.Ori Bernstein
2014-09-18Add mandelbrot benchmark.Ori Bernstein
2014-09-12Fix the factorial calculation.Ori Bernstein
2014-09-12Add a big factorial benchmark.Ori Bernstein
2014-09-11Add sha1 benchmark.Ori Bernstein
2014-09-07More iterations on intsort.Ori Bernstein
It's fast enough to need them now.
2014-09-02Build benchmarks with local compiler/muse/libs.Ori Bernstein
2014-09-02Switch to much faster register based blitting.Ori Bernstein
Most values are small. Don't use rep movs. It's fast on many uarches, but has high fixed cost. 5x speedup in intsort. Fuck yeah.
2014-08-15Add shuffled alloc/free to the alloc test.Ori Bernstein
2014-08-15Add copious allocs to benchmarks.Ori Bernstein
2014-08-15Add benchmarking runner and makefile.Ori Bernstein
Now you can do 'make bench', and see how fast Myrddin runs. Or at least the integer sorting bit. TODO: expand this so that you can see how it compares to previous results, and add benchmarks.
2014-06-28Fix indentation on benchmark code.Ori Bernstein
2014-06-10Add first benchmark: integer sorting.Ori Bernstein
TODO: Figure out how to acutally run it automatically.