OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 11 matching lines...) Expand all Loading... |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 #include "CalculationValue.h" | 32 #include "core/platform/CalculationValue.h" |
33 | 33 |
34 #include <limits> | 34 #include <limits> |
35 | 35 |
36 namespace WebCore { | 36 namespace WebCore { |
37 | 37 |
38 float CalcExpressionBinaryOperation::evaluate(float maxValue) const | 38 float CalcExpressionBinaryOperation::evaluate(float maxValue) const |
39 { | 39 { |
40 float left = m_leftSide->evaluate(maxValue); | 40 float left = m_leftSide->evaluate(maxValue); |
41 float right = m_rightSide->evaluate(maxValue); | 41 float right = m_rightSide->evaluate(maxValue); |
42 switch (m_operator) { | 42 switch (m_operator) { |
(...skipping 21 matching lines...) Expand all Loading... |
64 { | 64 { |
65 float result = m_value->evaluate(maxValue); | 65 float result = m_value->evaluate(maxValue); |
66 // FIXME calc https://webkit.org/b/80411 : result is NaN when there is a div
ision | 66 // FIXME calc https://webkit.org/b/80411 : result is NaN when there is a div
ision |
67 // by zero which isn't found at parse time. | 67 // by zero which isn't found at parse time. |
68 if (std::isnan(result)) | 68 if (std::isnan(result)) |
69 return 0; | 69 return 0; |
70 return m_isNonNegative && result < 0 ? 0 : result; | 70 return m_isNonNegative && result < 0 ? 0 : result; |
71 } | 71 } |
72 | 72 |
73 } // namespace WebCore | 73 } // namespace WebCore |
OLD | NEW |