/*************************************************************************************************** * Copyright (c) 2017-2018, NVIDIA CORPORATION. All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted * provided that the following conditions are met: * * Redistributions of source code must retain the above copyright notice, this list of * conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright notice, this list of * conditions and the following disclaimer in the documentation and/or other materials * provided with the distribution. * * Neither the name of the NVIDIA CORPORATION nor the names of its contributors may be used * to endorse or promote products derived from this software without specific prior written * permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TOR (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * **************************************************************************************************/ #pragma once /** * \file * \brief Math utilities */ #include namespace cutlass { /****************************************************************************** * Static math utilities ******************************************************************************/ /** * Statically determine if N is a power-of-two */ template struct is_pow2 : platform::integral_constant {}; /** * Statically determine log2(N), rounded down */ template struct log2_down { /// Static logarithm value enum { value = log2_down> 1), Count + 1>::value }; }; // Base case template struct log2_down { enum { value = Count }; }; /** * Statically determine log2(N), rounded up */ template struct log2_up { /// Static logarithm value enum { value = log2_up> 1), Count + 1>::value }; }; // Base case template struct log2_up { enum { value = ((1 << Count) < N) ? Count + 1 : Count }; }; /** * Statically estimate sqrt(N) to the nearest power-of-two */ template struct sqrt_est { enum { value = 1 << (log2_up::value / 2) }; }; /** * For performing a constant-division with a compile-time assertion that the * Divisor evenly-divides the Dividend. */ template struct divide_assert { enum { value = Dividend / Divisor }; static_assert((Dividend % Divisor == 0), "Not an even multiple"); }; /****************************************************************************** * Rounding ******************************************************************************/ /** * Round dividend up to the nearest multiple of divisor */ template CUTLASS_HOST_DEVICE dividend_t round_nearest(dividend_t dividend, divisor_t divisor) { return ((dividend + divisor - 1) / divisor) * divisor; } /** * Greatest common divisor */ template CUTLASS_HOST_DEVICE value_t gcd(value_t a, value_t b) { for (;;) { if (a == 0) return b; b %= a; if (b == 0) return a; a %= b; } } /** * Least common multiple */ template CUTLASS_HOST_DEVICE value_t lcm(value_t a, value_t b) { value_t temp = gcd(a, b); return temp ? (a / temp * b) : 0; } } // namespace cutlass