/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ #pragma once #include #include #include #include #include #if defined(_MSC_VER) #include #else #ifndef __has_builtin # define __has_builtin(x) 0 #endif #endif namespace o3tl { template inline constexpr T saturating_add(T a, T b) { if (b >= 0) { if (a <= std::numeric_limits::max() - b) { return a + b; } else { return std::numeric_limits::max(); } } else { if (a >= std::numeric_limits::min() - b) { return a + b; } else { return std::numeric_limits::min(); } } } template inline constexpr T saturating_sub(T a, T b) { if (b >= 0) { if (a >= std::numeric_limits::min() + b) { return a - b; } else { return std::numeric_limits::min(); } } else { if (a <= std::numeric_limits::max() + b) { return a - b; } else { return std::numeric_limits::max(); } } } template inline typename std::enable_if::value, T>::type saturating_toggle_sign( T a) { if (a == std::numeric_limits::min()) return std::numeric_limits::max(); return a * -1; } // TODO: reimplement using ckd_add/ckd_sub/ckd_mul from , when C23 is part of C++ #if defined(_MSC_VER) template inline bool checked_multiply(T a, T b, T& result) { return !msl::utilities::SafeMultiply(a, b, result); } template inline bool checked_add(T a, T b, T& result) { return !msl::utilities::SafeAdd(a, b, result); } template inline bool checked_sub(T a, T b, T& result) { return !msl::utilities::SafeSubtract(a, b, result); } #elif (defined __GNUC__ && !defined __clang__) || (__has_builtin(__builtin_mul_overflow) && !(defined ANDROID && defined __clang__) && !(defined(__clang__) && (defined(__arm__) || defined(__i386__)))) // 32-bit clang fails with undefined reference to `__mulodi4' template inline bool checked_multiply(T a, T b, T& result) { return __builtin_mul_overflow(a, b, &result); } template inline bool checked_add(T a, T b, T& result) { return __builtin_add_overflow(a, b, &result); } template inline bool checked_sub(T a, T b, T& result) { return __builtin_sub_overflow(a, b, &result); } #else //https://www.securecoding.cert.org/confluence/display/c/INT32-C.+Ensure+that+operations+on+signed+integers+do+not+result+in+overflow template inline typename std::enable_if::value, bool>::type checked_multiply(T a, T b, T& result) { if (a > 0) { /* a is positive */ if (b > 0) { /* a and b are positive */ if (a > (std::numeric_limits::max() / b)) { return true; /* Handle error */ } } else { /* a positive, b nonpositive */ if (b < (std::numeric_limits::min() / a)) { return true; /* Handle error */ } } /* a positive, b nonpositive */ } else { /* a is nonpositive */ if (b > 0) { /* a is nonpositive, b is positive */ if (a < (std::numeric_limits::min() / b)) { return true; /* Handle error */ } } else { /* a and b are nonpositive */ if ( (a != 0) && (b < (std::numeric_limits::max() / a))) { return true; /* Handle error */ } } /* End if a and b are nonpositive */ } /* End if a is nonpositive */ result = a * b; return false; } //https://www.securecoding.cert.org/confluence/display/c/INT30-C.+Ensure+that+unsigned+integer+operations+do+not+wrap template inline typename std::enable_if::value, bool>::type checked_multiply(T a, T b, T& result) { if (b && a > std::numeric_limits::max() / b) { return true;/* Handle error */ } result = a * b; return false; } //https://www.securecoding.cert.org/confluence/display/c/INT32-C.+Ensure+that+operations+on+signed+integers+do+not+result+in+overflow template inline typename std::enable_if::value, bool>::type checked_add(T a, T b, T& result) { if (((b > 0) && (a > (std::numeric_limits::max() - b))) || ((b < 0) && (a < (std::numeric_limits::min() - b)))) { return true; } result = a + b; return false; } //https://www.securecoding.cert.org/confluence/display/c/INT30-C.+Ensure+that+unsigned+integer+operations+do+not+wrap template inline typename std::enable_if::value, bool>::type checked_add(T a, T b, T& result) { if (std::numeric_limits::max() - a < b) { return true;/* Handle error */ } result = a + b; return false; } //https://www.securecoding.cert.org/confluence/display/c/INT32-C.+Ensure+that+operations+on+signed+integers+do+not+result+in+overflow template inline typename std::enable_if::value, bool>::type checked_sub(T a, T b, T& result) { if ((b > 0 && a < std::numeric_limits::min() + b) || (b < 0 && a > std::numeric_limits::max() + b)) { return true; } result = a - b; return false; } //https://www.securecoding.cert.org/confluence/display/c/INT30-C.+Ensure+that+unsigned+integer+operations+do+not+wrap template inline typename std::enable_if::value, bool>::type checked_sub(T a, T b, T& result) { if (a < b) { return true; } result = a - b; return false; } #endif template constexpr std::enable_if_t, std::make_unsigned_t> make_unsigned(T value) { assert(value >= 0); return value; } template constexpr std::enable_if_t, T1> clamp_to_unsigned(T2 value) { if constexpr (std::is_unsigned_v) { // coverity[result_independent_of_operands] - suppress warning for template return value <= std::numeric_limits::max() ? value : std::numeric_limits::max(); } else { static_assert(std::is_signed_v); return value < 0 ? 0 : clamp_to_unsigned(make_unsigned(value)); } } // An implicit conversion from T2 to T1, useful in places where an explicit conversion from T2 to // T1 is needed (e.g., in list initialization, if the implicit conversion would be narrowing) but // tools like -fsanitize=implicit-conversion should still be able to detect truncation: template constexpr T1 narrowing(T2 value) { return value; } // std::min wrapped to inform coverity that the result is now deemed sanitized // coverity[ -taint_source ] template [[nodiscard]] inline T sanitizing_min(T a, T b) { return std::min(a, b); } // To sanitize in/de-crementing value where the result is known by the caller to be guaranteed to fit in // the source type range without over/under-flow [[nodiscard]] inline unsigned short sanitizing_inc(unsigned short value) { int res = value + 1; assert(res <= std::numeric_limits::max() && "nValue was supposed to be incrementable without overflow"); return static_cast(res); } [[nodiscard]] inline unsigned short sanitizing_dec(unsigned short value) { int res = value - 1; assert(res >= 0 && "nValue was supposed to be decrementable without underflow"); return static_cast(res); } [[nodiscard]] inline short sanitizing_inc(short value) { int res = value + 1; assert(res >= std::numeric_limits::min() && res <= std::numeric_limits::max() && "nValue was supposed to be incrementable without overflow"); return static_cast(res); } [[nodiscard]] inline short sanitizing_dec(short value) { int res = value - 1; assert(res >= std::numeric_limits::min() && res <= std::numeric_limits::max() && "nValue was supposed to be decrementable without underflow"); return static_cast(res); } // A helper for taking care of signed/unsigned comparisons in constant bounds case // Should avoid Coverity warnings like "cid#1618764 Operands don't affect result" template ::min(), I Max = std::template numeric_limits::max(), std::enable_if_t && (Min <= 0) && (Max > 0), int> = 0> struct ValidRange { using SI = std::make_signed_t; using UI = std::make_unsigned_t; template , int> = 0> static constexpr bool isAbove(I2 n) { using UI2 = std::make_unsigned_t; if constexpr (static_cast(std::numeric_limits::max()) <= static_cast(Max)) return false; else if constexpr (std::is_signed_v == std::is_signed_v) return n > Max; else if constexpr (std::is_signed_v) // I2 is unsigned return n > static_cast(Max); else // I is unsigned, I2 is signed return n > 0 && static_cast(n) > Max; } template , int> = 0> static constexpr bool isBelow(I2 n) { using SI2 = std::make_signed_t; if constexpr (static_cast(std::numeric_limits::min()) >= static_cast(Min)) return false; // Covers all I2 unsigned else if constexpr (std::is_signed_v == std::is_signed_v) return n < Min; else // I is unsigned, I2 is signed return n < 0; } template , int> = 0> static constexpr bool isOutside(I2 n) { return isAbove(n) || isBelow(n); } template , int> = 0> static constexpr bool isInside(I2 n) { return !isOutside(n); } }; } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */