| commit | 195fe08421f3a6c52ed621be96dbcc5393b41e69 | [log] [tgz] |
|---|---|---|
| author | mtklein <mtklein@chromium.org> | Tue Nov 17 08:39:01 2015 -0800 |
| committer | Commit bot <commit-bot@chromium.org> | Tue Nov 17 08:39:01 2015 -0800 |
| tree | ecf1161ef6d0781ff63b02d0589c37ea6d10ba6e | |
| parent | f3182ebc72db2bf2e24119d5cea05f270473a491 [diff] |
simplify BlendTest.cpp
- streamline the testing down to just byte multiplies
(that's always where the blend algorithms vary)
- add another approximate multiply (x*y+255)>>8
- add another variant of the perfect multiply, ((x*y+128)*257)>>16
I've realized ((x*y+128)*257)>>16 might be just as fast in SSE/NEON
as our current (x*y+x)>>8 approximation. Good to be testing it here.
BUG=skia:
Review URL: https://codereview.chromium.org/1453043005