| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2012, Google Inc. All rights reserved. | 2 * Copyright (c) 2012, 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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 57 | 57 |
| 58 // Can only overflow if the signed bit of the two values do not match. If th
e | 58 // Can only overflow if the signed bit of the two values do not match. If th
e |
| 59 // signed bit of the result and the first value differ it did overflow. | 59 // signed bit of the result and the first value differ it did overflow. |
| 60 if ((ua ^ ub) >> 31 & (result ^ ua) >> 31) | 60 if ((ua ^ ub) >> 31 & (result ^ ua) >> 31) |
| 61 result = std::numeric_limits<int>::max() + (ua >> 31); | 61 result = std::numeric_limits<int>::max() + (ua >> 31); |
| 62 | 62 |
| 63 return result; | 63 return result; |
| 64 } | 64 } |
| 65 | 65 |
| 66 #endif // SaturatedArithmetic_h | 66 #endif // SaturatedArithmetic_h |
| OLD | NEW |