// Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved. // This source code is licensed under both the GPLv2 (found in the // COPYING file in the root directory) and Apache 2.0 License // (found in the LICENSE.Apache file in the root directory). #pragma once #include #ifdef _MSC_VER #include #endif #include #include namespace ROCKSDB_NAMESPACE { // Fast implementation of floor(log2(v)). Undefined for 0 or negative // numbers (in case of signed type). template inline int FloorLog2(T v) { static_assert(std::is_integral::value, "non-integral type"); assert(v > 0); #ifdef _MSC_VER static_assert(sizeof(T) <= sizeof(uint64_t), "type too big"); unsigned long lz = 0; if (sizeof(T) <= sizeof(uint32_t)) { _BitScanReverse(&lz, static_cast(v)); } else { _BitScanReverse64(&lz, static_cast(v)); } return 63 - static_cast(lz); #else static_assert(sizeof(T) <= sizeof(unsigned long long), "type too big"); if (sizeof(T) <= sizeof(unsigned int)) { int lz = __builtin_clz(static_cast(v)); return int{sizeof(unsigned int)} * 8 - 1 - lz; } else if (sizeof(T) <= sizeof(unsigned long)) { int lz = __builtin_clzl(static_cast(v)); return int{sizeof(unsigned long)} * 8 - 1 - lz; } else { int lz = __builtin_clzll(static_cast(v)); return int{sizeof(unsigned long long)} * 8 - 1 - lz; } #endif } // Number of low-order zero bits before the first 1 bit. Undefined for 0. template inline int CountTrailingZeroBits(T v) { static_assert(std::is_integral::value, "non-integral type"); assert(v != 0); #ifdef _MSC_VER static_assert(sizeof(T) <= sizeof(uint64_t), "type too big"); unsigned long tz = 0; if (sizeof(T) <= sizeof(uint32_t)) { _BitScanForward(&tz, static_cast(v)); } else { _BitScanForward64(&tz, static_cast(v)); } return static_cast(tz); #else static_assert(sizeof(T) <= sizeof(unsigned long long), "type too big"); if (sizeof(T) <= sizeof(unsigned int)) { return __builtin_ctz(static_cast(v)); } else if (sizeof(T) <= sizeof(unsigned long)) { return __builtin_ctzl(static_cast(v)); } else { return __builtin_ctzll(static_cast(v)); } #endif } // Number of bits set to 1. Also known as "population count". template inline int BitsSetToOne(T v) { static_assert(std::is_integral::value, "non-integral type"); #ifdef _MSC_VER static_assert(sizeof(T) <= sizeof(uint64_t), "type too big"); if (sizeof(T) < sizeof(uint32_t)) { // This bit mask is to avoid a compiler warning on unused path constexpr auto mm = 8 * sizeof(uint32_t) - 1; // The bit mask is to neutralize sign extension on small signed types constexpr uint32_t m = (uint32_t{1} << ((8 * sizeof(T)) & mm)) - 1; return static_cast(__popcnt(static_cast(v) & m)); } else if (sizeof(T) == sizeof(uint32_t)) { return static_cast(__popcnt(static_cast(v))); } else { return static_cast(__popcnt64(static_cast(v))); } #else static_assert(sizeof(T) <= sizeof(unsigned long long), "type too big"); if (sizeof(T) < sizeof(unsigned int)) { // This bit mask is to avoid a compiler warning on unused path constexpr auto mm = 8 * sizeof(unsigned int) - 1; // This bit mask is to neutralize sign extension on small signed types constexpr unsigned int m = (1U << ((8 * sizeof(T)) & mm)) - 1; return __builtin_popcount(static_cast(v) & m); } else if (sizeof(T) == sizeof(unsigned int)) { return __builtin_popcount(static_cast(v)); } else if (sizeof(T) <= sizeof(unsigned long)) { return __builtin_popcountl(static_cast(v)); } else { return __builtin_popcountll(static_cast(v)); } #endif } template inline int BitParity(T v) { static_assert(std::is_integral::value, "non-integral type"); #ifdef _MSC_VER // bit parity == oddness of popcount return BitsSetToOne(v) & 1; #else static_assert(sizeof(T) <= sizeof(unsigned long long), "type too big"); if (sizeof(T) <= sizeof(unsigned int)) { // On any sane systen, potential sign extension here won't change parity return __builtin_parity(static_cast(v)); } else if (sizeof(T) <= sizeof(unsigned long)) { return __builtin_parityl(static_cast(v)); } else { return __builtin_parityll(static_cast(v)); } #endif } } // namespace ROCKSDB_NAMESPACE