// SPDX-License-Identifier: MIT // Copyright (c) 2018-2023, Advanced Micro Devices, Inc. All rights reserved. #pragma once #include "ck/ck.hpp" #include "integral_constant.hpp" #include "number.hpp" #include "type.hpp" #include "enable_if.hpp" namespace ck { namespace math { template struct scales { __host__ __device__ constexpr T operator()(T a) const { return s * a; } }; template struct plus { __host__ __device__ constexpr T operator()(T a, T b) const { return a + b; } }; template struct minus { __host__ __device__ constexpr T operator()(T a, T b) const { return a - b; } }; struct multiplies { template __host__ __device__ constexpr auto operator()(const A& a, const B& b) const { return a * b; } }; template struct maximize { __host__ __device__ constexpr T operator()(T a, T b) const { return a >= b ? a : b; } }; template struct minimize { __host__ __device__ constexpr T operator()(T a, T b) const { return a <= b ? a : b; } }; template struct integer_divide_ceiler { __host__ __device__ constexpr T operator()(T a, T b) const { static_assert(is_same{} || is_same{}, "wrong type"); return (a + b - Number<1>{}) / b; } }; template __host__ __device__ constexpr auto integer_divide_floor(X x, Y y) { return x / y; } template __host__ __device__ constexpr auto integer_divide_ceil(X x, Y y) { return (x + y - Number<1>{}) / y; } template __host__ __device__ constexpr auto integer_least_multiple(X x, Y y) { return y * integer_divide_ceil(x, y); } template __host__ __device__ constexpr T max(T x) { return x; } template __host__ __device__ constexpr T max(T x, T y) { return x > y ? x : y; } template __host__ __device__ constexpr index_t max(Number, index_t y) { return X > y ? X : y; } template __host__ __device__ constexpr index_t max(index_t x, Number) { return x > Y ? x : Y; } template __host__ __device__ constexpr auto max(X x, Ys... ys) { static_assert(sizeof...(Ys) > 0, "not enough argument"); return max(x, max(ys...)); } template __host__ __device__ constexpr T min(T x) { return x; } template __host__ __device__ constexpr T min(T x, T y) { return x < y ? x : y; } template __host__ __device__ constexpr index_t min(Number, index_t y) { return X < y ? X : y; } template __host__ __device__ constexpr index_t min(index_t x, Number) { return x < Y ? x : Y; } template __host__ __device__ constexpr auto min(X x, Ys... ys) { static_assert(sizeof...(Ys) > 0, "not enough argument"); return min(x, min(ys...)); } template __host__ __device__ constexpr T clamp(const T& x, const T& lowerbound, const T& upperbound) { return min(max(x, lowerbound), upperbound); } // greatest common divisor, aka highest common factor __host__ __device__ constexpr index_t gcd(index_t x, index_t y) { if(x < 0) { return gcd(-x, y); } else if(y < 0) { return gcd(x, -y); } else if(x == y || x == 0) { return y; } else if(y == 0) { return x; } else if(x > y) { return gcd(x % y, y); } else { return gcd(x, y % x); } } template __host__ __device__ constexpr auto gcd(Number, Number) { constexpr auto r = gcd(X, Y); return Number{}; } template = 2, bool>::type = false> __host__ __device__ constexpr auto gcd(X x, Ys... ys) { return gcd(x, gcd(ys...)); } // least common multiple template __host__ __device__ constexpr auto lcm(X x, Y y) { return (x * y) / gcd(x, y); } template = 2, bool>::type = false> __host__ __device__ constexpr auto lcm(X x, Ys... ys) { return lcm(x, lcm(ys...)); } template struct equal { __host__ __device__ constexpr bool operator()(T x, T y) const { return x == y; } }; template struct less { __host__ __device__ constexpr bool operator()(T x, T y) const { return x < y; } }; template __host__ __device__ constexpr auto next_power_of_two() { // TODO: X need to be 2 ~ 0x7fffffff. 0, 1, or larger than 0x7fffffff will compile fail constexpr index_t Y = 1 << (32 - __builtin_clz(X - 1)); return Y; } template __host__ __device__ constexpr auto next_power_of_two(Number x) { // TODO: X need to be 2 ~ 0x7fffffff. 0, 1, or larger than 0x7fffffff will compile fail constexpr index_t Y = 1 << (32 - __builtin_clz(x.value - 1)); return Number{}; } } // namespace math } // namespace ck