| // Licensed to the Apache Software Foundation (ASF) under one | |
| // or more contributor license agreements. See the NOTICE file | |
| // distributed with this work for additional information | |
| // regarding copyright ownership. The ASF licenses this file | |
| // to you under the Apache License, Version 2.0 (the | |
| // "License"); you may not use this file except in compliance | |
| // with the License. You may obtain a copy of the License at | |
| // | |
| // http://www.apache.org/licenses/LICENSE-2.0 | |
| // | |
| // Unless required by applicable law or agreed to in writing, | |
| // software distributed under the License is distributed on an | |
| // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | |
| // KIND, either express or implied. See the License for the | |
| // specific language governing permissions and limitations | |
| // under the License. | |
| // This file is copied from | |
| // https://github.com/ClickHouse/ClickHouse/blob/master/base/base/arithmeticOverflow.h | |
| // and modified by Doris | |
| #pragma once | |
| #include "core/extended_types.h" | |
| namespace common { | |
| template <typename T> | |
| inline bool add_overflow(T x, T y, T& res) { | |
| return __builtin_add_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool add_overflow(int x, int y, int& res) { | |
| return __builtin_sadd_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool add_overflow(long x, long y, long& res) { | |
| return __builtin_saddl_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool add_overflow(long long x, long long y, long long& res) { | |
| return __builtin_saddll_overflow(x, y, &res); | |
| } | |
| template <> | |
| NO_SANITIZE_UNDEFINED inline bool add_overflow(__int128 x, __int128 y, __int128& res) { | |
| static constexpr __int128 min_int128 = __int128(0x8000000000000000ll) << 64; | |
| static constexpr __int128 max_int128 = | |
| (__int128(0x7fffffffffffffffll) << 64) + 0xffffffffffffffffll; | |
| res = x + y; | |
| return (y > 0 && x > max_int128 - y) || (y < 0 && x < min_int128 - y); | |
| } | |
| template <> | |
| NO_SANITIZE_UNDEFINED inline bool add_overflow(wide::Int256 x, wide::Int256 y, wide::Int256& res) { | |
| static constexpr wide::Int256 min_int256 = std::numeric_limits<wide::Int256>::min(); | |
| static constexpr wide::Int256 max_int256 = std::numeric_limits<wide::Int256>::max(); | |
| res = x + y; | |
| return (y > 0 && x > max_int256 - y) || (y < 0 && x < min_int256 - y); | |
| } | |
| template <typename T> | |
| inline bool sub_overflow(T x, T y, T& res) { | |
| return __builtin_sub_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool sub_overflow(int x, int y, int& res) { | |
| return __builtin_ssub_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool sub_overflow(long x, long y, long& res) { | |
| return __builtin_ssubl_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool sub_overflow(long long x, long long y, long long& res) { | |
| return __builtin_ssubll_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool sub_overflow(__int128 x, __int128 y, __int128& res) { | |
| static constexpr __int128 min_int128 = __int128(0x8000000000000000ll) << 64; | |
| static constexpr __int128 max_int128 = | |
| (__int128(0x7fffffffffffffffll) << 64) + 0xffffffffffffffffll; | |
| res = x - y; | |
| return (y < 0 && x > max_int128 + y) || (y > 0 && x < min_int128 + y); | |
| } | |
| template <> | |
| inline bool sub_overflow(wide::Int256 x, wide::Int256 y, wide::Int256& res) { | |
| static constexpr wide::Int256 min_int256 = std::numeric_limits<wide::Int256>::min(); | |
| static constexpr wide::Int256 max_int256 = std::numeric_limits<wide::Int256>::max(); | |
| res = x - y; | |
| return (y < 0 && x > max_int256 + y) || (y > 0 && x < min_int256 + y); | |
| } | |
| template <typename T> | |
| inline bool mul_overflow(T x, T y, T& res) { | |
| return __builtin_mul_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool mul_overflow(int x, int y, int& res) { | |
| return __builtin_smul_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool mul_overflow(long x, long y, long& res) { | |
| return __builtin_smull_overflow(x, y, &res); | |
| } | |
| template <> | |
| inline bool mul_overflow(long long x, long long y, long long& res) { | |
| return __builtin_smulll_overflow(x, y, &res); | |
| } | |
| // from __muloXi4 in llvm's compiler-rt | |
| static inline __int128 int128_overflow_mul(__int128 a, __int128 b, int* overflow) { | |
| const int N = (int)(sizeof(__int128) * CHAR_BIT); | |
| const auto MIN = (__int128)((__uint128_t)1 << (N - 1)); | |
| const __int128 MAX = ~MIN; | |
| *overflow = 0; | |
| __int128 result = (__uint128_t)a * b; | |
| if (a == MIN) { | |
| if (b != 0 && b != 1) { | |
| *overflow = 1; | |
| } | |
| return result; | |
| } | |
| if (b == MIN) { | |
| if (a != 0 && a != 1) { | |
| *overflow = 1; | |
| } | |
| return result; | |
| } | |
| __int128 sa = a >> (N - 1); | |
| __int128 abs_a = (a ^ sa) - sa; | |
| __int128 sb = b >> (N - 1); | |
| __int128 abs_b = (b ^ sb) - sb; | |
| if (abs_a < 2 || abs_b < 2) { | |
| return result; | |
| } | |
| if (sa == sb) { | |
| if (abs_a > MAX / abs_b) { | |
| *overflow = 1; | |
| } | |
| } else { | |
| if (abs_a > MIN / -abs_b) { | |
| *overflow = 1; | |
| } | |
| } | |
| return result; | |
| } | |
| template <> | |
| inline bool mul_overflow(__int128 x, __int128 y, __int128& res) { | |
| int overflow = 0; | |
| res = int128_overflow_mul(x, y, &overflow); | |
| return overflow != 0; | |
| } | |
| static inline wide::Int256 int256_overflow_mul(const wide::Int256& a, const wide::Int256& b, | |
| int* overflow) { | |
| const int N = (int)(sizeof(wide::Int256) * CHAR_BIT); | |
| const auto MIN = (wide::Int256)((wide::UInt256)1 << (N - 1)); | |
| const wide::Int256 MAX = ~MIN; | |
| *overflow = 0; | |
| wide::Int256 result = a * b; | |
| if (a == MIN) { | |
| if (b != 0 && b != 1) { | |
| *overflow = 1; | |
| } | |
| return result; | |
| } | |
| if (b == MIN) { | |
| if (a != 0 && a != 1) { | |
| *overflow = 1; | |
| } | |
| return result; | |
| } | |
| wide::Int256 sa = a >> (N - 1); | |
| wide::Int256 abs_a = (a ^ sa) - sa; | |
| wide::Int256 sb = b >> (N - 1); | |
| wide::Int256 abs_b = (b ^ sb) - sb; | |
| if (abs_a < 2 || abs_b < 2) { | |
| return result; | |
| } | |
| if (sa == sb) { | |
| if (abs_a > MAX / abs_b) { | |
| *overflow = 1; | |
| } | |
| } else { | |
| if (abs_a > MIN / -abs_b) { | |
| *overflow = 1; | |
| } | |
| } | |
| return result; | |
| } | |
| template <> | |
| inline bool mul_overflow(wide::Int256 x, wide::Int256 y, wide::Int256& res) { | |
| int overflow = 0; | |
| res = int256_overflow_mul(x, y, &overflow); | |
| return overflow != 0; | |
| } | |
| } // namespace common |