otp.git - Mirror of Erlang/OTP repository.

Age	Commit message (Collapse)	Author
2018-08-07	Optimize binary match	José Valim
	The idea is to use memchr on the first lookup for binary:match/2 and also after every match on binary:matches/2. We only use memchr in case of matches because benchmarks showed that using memchr even when we had false positives could negatively affect performance. This speeds up binary matching and binary splitting by 4x in some cases and by 70x in other scenarios (when the last character in the needle does not occur in the subject). The reason to use memchr is that it is highly specialized in most modern operating systems, often defaulting to SIMD operations. The implementation uses the reduction count to figure out how many bytes should be read with memchr. We could increase those numbers but they do not seem to make a large difference.
2018-03-21	stdlib: Make benchmarks more robust	Hans Bolinder
	statistics(runtime) does not seem to work on some virtual machines.
2018-01-19	Dodge divide by zero	Raimo Niskanen

2018-01-16	Introduce gen_statem vs gen_fsm benchmark	Raimo Niskanen
	Conflicts: lib/stdlib/test/stdlib_bench_SUITE.erl
2018-01-15	stdlib: Spend less time in gen_server benchmarks	Hans Bolinder
	Limit the time used for the benchmarks introduced in b8f16f0.
2017-12-20	stdlib: Introduce gen_server benchmark	Hans Bolinder

2017-11-30	stdlib: Add base64 benchmarks	Hans Bolinder

2017-09-26	stdlib: Add unicode string benchmarks	Dan Gudmundsson