tree 58449b7535fe158fcb682073f0ae4ace7152979c
parent 7d3f322e64ea1d51a465d2cac1ba2905977bdc49
author Elliott Hughes <enh@google.com> 1637088672 -0800
committer Elliott Hughes <enh@google.com> 1637088672 -0800

New multi-byte character benchmarks.

I don't think the old benchmarks made any sense; going through all the
characters might have made sense as a unit test, but I'm not sure how
actionable they were for realistic cases. In particular, "all ASCII" is
a common special case that's worth measuring separately. I'm still not
hugely convinced, but at least separating the "ASCII" and "wide" paths
is an improvement. I can't think of a case where we did optimization
work on this kind of code without considering those two paths
separately.

I've added to the single-character benchmarks by splitting out the
separate cases instead --- one benchmark each for single-byte up to
4-byte characters.

Bug: http://b/206523398
Test: treehugger
Change-Id: I58cbfedb4b497a55580857eff307a024938cf006