1*9712c20fSFrederick Mayle // Copyright 2022 Google LLC
2*9712c20fSFrederick Mayle //
3*9712c20fSFrederick Mayle // Redistribution and use in source and binary forms, with or without
4*9712c20fSFrederick Mayle // modification, are permitted provided that the following conditions are
5*9712c20fSFrederick Mayle // met:
6*9712c20fSFrederick Mayle //
7*9712c20fSFrederick Mayle // * Redistributions of source code must retain the above copyright
8*9712c20fSFrederick Mayle // notice, this list of conditions and the following disclaimer.
9*9712c20fSFrederick Mayle // * Redistributions in binary form must reproduce the above
10*9712c20fSFrederick Mayle // copyright notice, this list of conditions and the following disclaimer
11*9712c20fSFrederick Mayle // in the documentation and/or other materials provided with the
12*9712c20fSFrederick Mayle // distribution.
13*9712c20fSFrederick Mayle // * Neither the name of Google LLC nor the names of its
14*9712c20fSFrederick Mayle // contributors may be used to endorse or promote products derived from
15*9712c20fSFrederick Mayle // this software without specific prior written permission.
16*9712c20fSFrederick Mayle //
17*9712c20fSFrederick Mayle // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*9712c20fSFrederick Mayle // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*9712c20fSFrederick Mayle // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*9712c20fSFrederick Mayle // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*9712c20fSFrederick Mayle // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*9712c20fSFrederick Mayle // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*9712c20fSFrederick Mayle // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*9712c20fSFrederick Mayle // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*9712c20fSFrederick Mayle // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*9712c20fSFrederick Mayle // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*9712c20fSFrederick Mayle // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*9712c20fSFrederick Mayle
29*9712c20fSFrederick Mayle // safe_math.h: Helpful math functions.
30*9712c20fSFrederick Mayle #ifndef SAFE_MATH_H__
31*9712c20fSFrederick Mayle #define SAFE_MATH_H__
32*9712c20fSFrederick Mayle
33*9712c20fSFrederick Mayle #include <utility>
34*9712c20fSFrederick Mayle
35*9712c20fSFrederick Mayle namespace google_breakpad {
36*9712c20fSFrederick Mayle
37*9712c20fSFrederick Mayle // Adds `a` and `b`, returning a pair of:
38*9712c20fSFrederick Mayle // - The result after any truncation.
39*9712c20fSFrederick Mayle // - Whether an overflow/underflow occurred.
40*9712c20fSFrederick Mayle template <typename T>
AddWithOverflowCheck(T a,T b)41*9712c20fSFrederick Mayle std::pair<T, bool> AddWithOverflowCheck(T a, T b) {
42*9712c20fSFrederick Mayle #ifdef _WIN32
43*9712c20fSFrederick Mayle // Since C++11, unsigned overflow is well-defined; do everything unsigned,
44*9712c20fSFrederick Mayle // assuming 2's complement.
45*9712c20fSFrederick Mayle if (std::is_unsigned<T>::value) {
46*9712c20fSFrederick Mayle T result = a + b;
47*9712c20fSFrederick Mayle // Since we're adding two values >= 0, having a smaller value implies
48*9712c20fSFrederick Mayle // overflow.
49*9712c20fSFrederick Mayle bool overflow = result < a;
50*9712c20fSFrederick Mayle return {result, overflow};
51*9712c20fSFrederick Mayle }
52*9712c20fSFrederick Mayle
53*9712c20fSFrederick Mayle using TUnsigned = typename std::make_unsigned<T>::type;
54*9712c20fSFrederick Mayle T result = TUnsigned(a) + TUnsigned(b);
55*9712c20fSFrederick Mayle bool overflow;
56*9712c20fSFrederick Mayle if ((a >= 0) == (b >= 0)) {
57*9712c20fSFrederick Mayle if (a >= 0) {
58*9712c20fSFrederick Mayle overflow = result < a;
59*9712c20fSFrederick Mayle } else {
60*9712c20fSFrederick Mayle overflow = result > a;
61*9712c20fSFrederick Mayle }
62*9712c20fSFrederick Mayle } else {
63*9712c20fSFrederick Mayle // If signs are different, it's impossible for overflow to happen.
64*9712c20fSFrederick Mayle overflow = false;
65*9712c20fSFrederick Mayle }
66*9712c20fSFrederick Mayle return {result, overflow};
67*9712c20fSFrederick Mayle #else
68*9712c20fSFrederick Mayle T result;
69*9712c20fSFrederick Mayle bool overflow = __builtin_add_overflow(a, b, &result);
70*9712c20fSFrederick Mayle return {result, overflow};
71*9712c20fSFrederick Mayle #endif
72*9712c20fSFrederick Mayle }
73*9712c20fSFrederick Mayle
74*9712c20fSFrederick Mayle template <typename T>
AddIgnoringOverflow(T a,T b)75*9712c20fSFrederick Mayle T AddIgnoringOverflow(T a, T b) {
76*9712c20fSFrederick Mayle return AddWithOverflowCheck(a, b).first;
77*9712c20fSFrederick Mayle }
78*9712c20fSFrederick Mayle
79*9712c20fSFrederick Mayle } // namespace google_breakpad
80*9712c20fSFrederick Mayle
81*9712c20fSFrederick Mayle #endif // SAFE_MATH_H__
82