| commit | e2faf17bcc523557e44ef443b48a53f286886a53 | [log] [tgz] |
|---|---|---|
| author | reed@google.com <reed@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | Mon Aug 06 19:01:34 2012 +0000 |
| committer | reed@google.com <reed@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | Mon Aug 06 19:01:34 2012 +0000 |
| tree | 9b5397c46273789dbcca64423942e3142ccaac87 | |
| parent | d9ee348720f933d8a23547ee36693880296810c5 [diff] |
Even when the pts are restricted to 32K values, we can still overflow computing a fixed-point coefficient for quadratics. To avoid this, we bias these coefficients, storing 1/2 of their actual value, and then apply the 2x unbias in updateQuadratic(). Fixes http://code.google.com/p/chromium/issues/detail?id=140803 Review URL: https://codereview.appspot.com/6450099 git-svn-id: http://skia.googlecode.com/svn/trunk@4960 2bbb7eff-a529-9590-31e7-b0007b416f81