2004-09-01 22:55:40 +00:00
|
|
|
//===-- llvm/Support/MathExtras.h - Useful math functions -------*- C++ -*-===//
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 19:46:57 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 19:46:57 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-05-19 21:19:55 +00:00
|
|
|
//
|
|
|
|
// This file contains some functions that are useful for math stuff.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2001-11-27 00:03:19 +00:00
|
|
|
|
2004-09-01 22:55:40 +00:00
|
|
|
#ifndef LLVM_SUPPORT_MATHEXTRAS_H
|
|
|
|
#define LLVM_SUPPORT_MATHEXTRAS_H
|
2001-11-27 00:03:19 +00:00
|
|
|
|
2009-10-26 01:35:46 +00:00
|
|
|
#include "llvm/System/DataTypes.h"
|
2001-11-27 00:03:19 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
// NOTE: The following support functions use the _32/_64 extensions instead of
|
2005-08-03 16:53:58 +00:00
|
|
|
// type overloading so that signed and unsigned integers can be used without
|
|
|
|
// ambiguity.
|
2005-08-02 19:15:30 +00:00
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// Hi_32 - This function returns the high 32 bits of a 64 bit value.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline uint32_t Hi_32(uint64_t Value) {
|
|
|
|
return static_cast<uint32_t>(Value >> 32);
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// Lo_32 - This function returns the low 32 bits of a 64 bit value.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline uint32_t Lo_32(uint64_t Value) {
|
|
|
|
return static_cast<uint32_t>(Value);
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
|
|
|
|
2010-03-29 21:13:41 +00:00
|
|
|
/// isInt - Checks if an integer fits into the given bit width.
|
2009-08-12 06:22:07 +00:00
|
|
|
template<unsigned N>
|
|
|
|
inline bool isInt(int64_t x) {
|
2009-08-13 06:24:02 +00:00
|
|
|
return N >= 64 || (-(INT64_C(1)<<(N-1)) <= x && x < (INT64_C(1)<<(N-1)));
|
2009-08-12 06:22:07 +00:00
|
|
|
}
|
2010-03-29 21:13:41 +00:00
|
|
|
// Template specializations to get better code for common cases.
|
|
|
|
template<>
|
|
|
|
inline bool isInt<8>(int64_t x) {
|
|
|
|
return static_cast<int8_t>(x) == x;
|
|
|
|
}
|
|
|
|
template<>
|
|
|
|
inline bool isInt<16>(int64_t x) {
|
|
|
|
return static_cast<int16_t>(x) == x;
|
|
|
|
}
|
|
|
|
template<>
|
|
|
|
inline bool isInt<32>(int64_t x) {
|
|
|
|
return static_cast<int32_t>(x) == x;
|
|
|
|
}
|
2009-08-12 06:22:07 +00:00
|
|
|
|
2010-03-29 21:13:41 +00:00
|
|
|
/// isUInt - Checks if an unsigned integer fits into the given bit width.
|
2009-08-12 06:22:07 +00:00
|
|
|
template<unsigned N>
|
2010-03-29 21:13:41 +00:00
|
|
|
inline bool isUInt(uint64_t x) {
|
2009-08-13 06:24:02 +00:00
|
|
|
return N >= 64 || x < (UINT64_C(1)<<N);
|
2009-08-12 06:22:07 +00:00
|
|
|
}
|
2010-03-29 21:13:41 +00:00
|
|
|
// Template specializations to get better code for common cases.
|
|
|
|
template<>
|
|
|
|
inline bool isUInt<8>(uint64_t x) {
|
|
|
|
return static_cast<uint8_t>(x) == x;
|
|
|
|
}
|
|
|
|
template<>
|
|
|
|
inline bool isUInt<16>(uint64_t x) {
|
|
|
|
return static_cast<uint16_t>(x) == x;
|
|
|
|
}
|
|
|
|
template<>
|
|
|
|
inline bool isUInt<32>(uint64_t x) {
|
|
|
|
return static_cast<uint32_t>(x) == x;
|
|
|
|
}
|
2009-08-12 06:22:07 +00:00
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// isMask_32 - This function returns true if the argument is a sequence of ones
|
|
|
|
/// starting at the least significant bit with the remainder zero (32 bit
|
|
|
|
/// version). Ex. isMask_32(0x0000FFFFU) == true.
|
2007-05-03 18:14:56 +00:00
|
|
|
inline bool isMask_32(uint32_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return Value && ((Value + 1) & Value) == 0;
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// isMask_64 - This function returns true if the argument is a sequence of ones
|
|
|
|
/// starting at the least significant bit with the remainder zero (64 bit
|
|
|
|
/// version).
|
2007-05-03 18:14:56 +00:00
|
|
|
inline bool isMask_64(uint64_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return Value && ((Value + 1) & Value) == 0;
|
|
|
|
}
|
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
/// isShiftedMask_32 - This function returns true if the argument contains a
|
2006-12-19 01:11:32 +00:00
|
|
|
/// sequence of ones with the remainder zero (32 bit version.)
|
|
|
|
/// Ex. isShiftedMask_32(0x0000FF00U) == true.
|
2007-05-03 18:14:56 +00:00
|
|
|
inline bool isShiftedMask_32(uint32_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return isMask_32((Value - 1) | Value);
|
|
|
|
}
|
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
/// isShiftedMask_64 - This function returns true if the argument contains a
|
2006-12-19 01:11:32 +00:00
|
|
|
/// sequence of ones with the remainder zero (64 bit version.)
|
2007-05-03 18:14:56 +00:00
|
|
|
inline bool isShiftedMask_64(uint64_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return isMask_64((Value - 1) | Value);
|
|
|
|
}
|
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
/// isPowerOf2_32 - This function returns true if the argument is a power of
|
2006-12-19 01:11:32 +00:00
|
|
|
/// two > 0. Ex. isPowerOf2_32(0x00100000U) == true (32 bit edition.)
|
2007-03-22 19:11:57 +00:00
|
|
|
inline bool isPowerOf2_32(uint32_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return Value && !(Value & (Value - 1));
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// isPowerOf2_64 - This function returns true if the argument is a power of two
|
|
|
|
/// > 0 (64 bit edition.)
|
2005-08-02 19:15:30 +00:00
|
|
|
inline bool isPowerOf2_64(uint64_t Value) {
|
2006-05-24 19:21:13 +00:00
|
|
|
return Value && !(Value & (Value - int64_t(1L)));
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// ByteSwap_16 - This function returns a byte-swapped representation of the
|
|
|
|
/// 16-bit argument, Value.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline uint16_t ByteSwap_16(uint16_t Value) {
|
|
|
|
#if defined(_MSC_VER) && !defined(_DEBUG)
|
|
|
|
// The DLL version of the runtime lacks these functions (bug!?), but in a
|
|
|
|
// release build they're replaced with BSWAP instructions anyway.
|
|
|
|
return _byteswap_ushort(Value);
|
|
|
|
#else
|
|
|
|
uint16_t Hi = Value << 8;
|
|
|
|
uint16_t Lo = Value >> 8;
|
2006-01-14 01:25:24 +00:00
|
|
|
return Hi | Lo;
|
2007-03-22 19:11:57 +00:00
|
|
|
#endif
|
2006-01-14 01:25:24 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// ByteSwap_32 - This function returns a byte-swapped representation of the
|
|
|
|
/// 32-bit argument, Value.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline uint32_t ByteSwap_32(uint32_t Value) {
|
2009-07-23 19:08:27 +00:00
|
|
|
#if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)) && !defined(__ICC)
|
2007-04-16 18:10:23 +00:00
|
|
|
return __builtin_bswap32(Value);
|
2007-03-22 19:11:57 +00:00
|
|
|
#elif defined(_MSC_VER) && !defined(_DEBUG)
|
|
|
|
return _byteswap_ulong(Value);
|
2007-03-01 21:16:30 +00:00
|
|
|
#else
|
2007-03-22 19:11:57 +00:00
|
|
|
uint32_t Byte0 = Value & 0x000000FF;
|
|
|
|
uint32_t Byte1 = Value & 0x0000FF00;
|
|
|
|
uint32_t Byte2 = Value & 0x00FF0000;
|
|
|
|
uint32_t Byte3 = Value & 0xFF000000;
|
2006-01-14 01:25:24 +00:00
|
|
|
return (Byte0 << 24) | (Byte1 << 8) | (Byte2 >> 8) | (Byte3 >> 24);
|
2007-03-01 21:16:30 +00:00
|
|
|
#endif
|
2006-01-14 01:25:24 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// ByteSwap_64 - This function returns a byte-swapped representation of the
|
|
|
|
/// 64-bit argument, Value.
|
2006-01-14 01:25:24 +00:00
|
|
|
inline uint64_t ByteSwap_64(uint64_t Value) {
|
2009-07-23 19:08:27 +00:00
|
|
|
#if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)) && !defined(__ICC)
|
2007-04-16 18:10:23 +00:00
|
|
|
return __builtin_bswap64(Value);
|
2007-03-22 19:11:57 +00:00
|
|
|
#elif defined(_MSC_VER) && !defined(_DEBUG)
|
|
|
|
return _byteswap_uint64(Value);
|
2007-03-01 21:16:30 +00:00
|
|
|
#else
|
2007-03-22 19:11:57 +00:00
|
|
|
uint64_t Hi = ByteSwap_32(uint32_t(Value));
|
|
|
|
uint32_t Lo = ByteSwap_32(uint32_t(Value >> 32));
|
2006-01-14 01:25:24 +00:00
|
|
|
return (Hi << 32) | Lo;
|
2007-03-01 21:16:30 +00:00
|
|
|
#endif
|
2006-01-14 01:25:24 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountLeadingZeros_32 - this function performs the platform optimal form of
|
|
|
|
/// counting the number of zeros from the most significant bit to the first one
|
|
|
|
/// bit. Ex. CountLeadingZeros_32(0x00F000FF) == 8.
|
|
|
|
/// Returns 32 if the word is zero.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline unsigned CountLeadingZeros_32(uint32_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
unsigned Count; // result
|
2005-08-02 20:21:33 +00:00
|
|
|
#if __GNUC__ >= 4
|
|
|
|
// PowerPC is defined for __builtin_clz(0)
|
|
|
|
#if !defined(__ppc__) && !defined(__ppc64__)
|
|
|
|
if (!Value) return 32;
|
|
|
|
#endif
|
|
|
|
Count = __builtin_clz(Value);
|
|
|
|
#else
|
|
|
|
if (!Value) return 32;
|
|
|
|
Count = 0;
|
2010-01-07 09:05:26 +00:00
|
|
|
// bisection method for count leading zeros
|
2005-08-02 20:21:33 +00:00
|
|
|
for (unsigned Shift = 32 >> 1; Shift; Shift >>= 1) {
|
2007-03-22 19:11:57 +00:00
|
|
|
uint32_t Tmp = Value >> Shift;
|
2005-08-02 20:21:33 +00:00
|
|
|
if (Tmp) {
|
|
|
|
Value = Tmp;
|
|
|
|
} else {
|
|
|
|
Count |= Shift;
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
2005-08-02 20:21:33 +00:00
|
|
|
}
|
|
|
|
#endif
|
2005-08-02 19:15:30 +00:00
|
|
|
return Count;
|
|
|
|
}
|
2004-02-25 01:53:45 +00:00
|
|
|
|
2008-02-13 20:54:54 +00:00
|
|
|
/// CountLeadingOnes_32 - this function performs the operation of
|
|
|
|
/// counting the number of ones from the most significant bit to the first zero
|
|
|
|
/// bit. Ex. CountLeadingOnes_32(0xFF0FFF00) == 8.
|
|
|
|
/// Returns 32 if the word is all ones.
|
|
|
|
inline unsigned CountLeadingOnes_32(uint32_t Value) {
|
|
|
|
return CountLeadingZeros_32(~Value);
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountLeadingZeros_64 - This function performs the platform optimal form
|
2009-02-20 22:51:36 +00:00
|
|
|
/// of counting the number of zeros from the most significant bit to the first
|
2006-12-19 01:11:32 +00:00
|
|
|
/// one bit (64 bit edition.)
|
|
|
|
/// Returns 64 if the word is zero.
|
2005-08-02 19:15:30 +00:00
|
|
|
inline unsigned CountLeadingZeros_64(uint64_t Value) {
|
|
|
|
unsigned Count; // result
|
2005-08-02 20:21:33 +00:00
|
|
|
#if __GNUC__ >= 4
|
|
|
|
// PowerPC is defined for __builtin_clzll(0)
|
2005-08-03 16:53:58 +00:00
|
|
|
#if !defined(__ppc__) && !defined(__ppc64__)
|
2005-08-02 20:21:33 +00:00
|
|
|
if (!Value) return 64;
|
|
|
|
#endif
|
|
|
|
Count = __builtin_clzll(Value);
|
|
|
|
#else
|
2005-08-02 19:21:51 +00:00
|
|
|
if (sizeof(long) == sizeof(int64_t)) {
|
2005-08-02 19:15:30 +00:00
|
|
|
if (!Value) return 64;
|
|
|
|
Count = 0;
|
2010-01-07 09:05:26 +00:00
|
|
|
// bisection method for count leading zeros
|
2007-03-22 19:11:57 +00:00
|
|
|
for (unsigned Shift = 64 >> 1; Shift; Shift >>= 1) {
|
2005-08-02 19:15:30 +00:00
|
|
|
uint64_t Tmp = Value >> Shift;
|
|
|
|
if (Tmp) {
|
|
|
|
Value = Tmp;
|
2005-08-02 20:21:33 +00:00
|
|
|
} else {
|
|
|
|
Count |= Shift;
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
2005-08-02 19:21:51 +00:00
|
|
|
}
|
|
|
|
} else {
|
2005-08-02 19:15:30 +00:00
|
|
|
// get hi portion
|
2007-03-22 19:11:57 +00:00
|
|
|
uint32_t Hi = Hi_32(Value);
|
2001-11-27 00:03:19 +00:00
|
|
|
|
2005-08-02 19:15:30 +00:00
|
|
|
// if some bits in hi portion
|
|
|
|
if (Hi) {
|
|
|
|
// leading zeros in hi portion plus all bits in lo portion
|
2005-08-03 01:04:40 +00:00
|
|
|
Count = CountLeadingZeros_32(Hi);
|
2005-08-02 19:15:30 +00:00
|
|
|
} else {
|
|
|
|
// get lo portion
|
2007-03-22 19:11:57 +00:00
|
|
|
uint32_t Lo = Lo_32(Value);
|
2005-08-02 19:15:30 +00:00
|
|
|
// same as 32 bit value
|
2005-08-03 01:04:40 +00:00
|
|
|
Count = CountLeadingZeros_32(Lo)+32;
|
2005-08-02 19:15:30 +00:00
|
|
|
}
|
2005-08-02 19:21:51 +00:00
|
|
|
}
|
|
|
|
#endif
|
2005-08-02 19:15:30 +00:00
|
|
|
return Count;
|
2004-08-17 19:17:10 +00:00
|
|
|
}
|
|
|
|
|
2008-02-13 20:54:54 +00:00
|
|
|
/// CountLeadingOnes_64 - This function performs the operation
|
2009-02-20 22:51:36 +00:00
|
|
|
/// of counting the number of ones from the most significant bit to the first
|
2008-02-13 20:54:54 +00:00
|
|
|
/// zero bit (64 bit edition.)
|
|
|
|
/// Returns 64 if the word is all ones.
|
|
|
|
inline unsigned CountLeadingOnes_64(uint64_t Value) {
|
|
|
|
return CountLeadingZeros_64(~Value);
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountTrailingZeros_32 - this function performs the platform optimal form of
|
|
|
|
/// counting the number of zeros from the least significant bit to the first one
|
|
|
|
/// bit. Ex. CountTrailingZeros_32(0xFF00FF00) == 8.
|
|
|
|
/// Returns 32 if the word is zero.
|
2007-03-22 19:11:57 +00:00
|
|
|
inline unsigned CountTrailingZeros_32(uint32_t Value) {
|
2007-03-01 21:16:30 +00:00
|
|
|
#if __GNUC__ >= 4
|
|
|
|
return Value ? __builtin_ctz(Value) : 32;
|
|
|
|
#else
|
2007-03-04 23:33:03 +00:00
|
|
|
static const unsigned Mod37BitPosition[] = {
|
|
|
|
32, 0, 1, 26, 2, 23, 27, 0, 3, 16, 24, 30, 28, 11, 0, 13,
|
|
|
|
4, 7, 17, 0, 25, 22, 31, 15, 29, 10, 12, 6, 0, 21, 14, 9,
|
|
|
|
5, 20, 8, 19, 18
|
|
|
|
};
|
2007-03-02 22:19:41 +00:00
|
|
|
return Mod37BitPosition[(-Value & Value) % 37];
|
2007-03-01 21:16:30 +00:00
|
|
|
#endif
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
|
|
|
|
2008-02-13 20:54:54 +00:00
|
|
|
/// CountTrailingOnes_32 - this function performs the operation of
|
|
|
|
/// counting the number of ones from the least significant bit to the first zero
|
|
|
|
/// bit. Ex. CountTrailingOnes_32(0x00FF00FF) == 8.
|
|
|
|
/// Returns 32 if the word is all ones.
|
|
|
|
inline unsigned CountTrailingOnes_32(uint32_t Value) {
|
|
|
|
return CountTrailingZeros_32(~Value);
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountTrailingZeros_64 - This function performs the platform optimal form
|
2009-02-20 22:51:36 +00:00
|
|
|
/// of counting the number of zeros from the least significant bit to the first
|
2006-12-19 01:11:32 +00:00
|
|
|
/// one bit (64 bit edition.)
|
|
|
|
/// Returns 64 if the word is zero.
|
2005-08-31 00:25:01 +00:00
|
|
|
inline unsigned CountTrailingZeros_64(uint64_t Value) {
|
2007-03-01 21:16:30 +00:00
|
|
|
#if __GNUC__ >= 4
|
|
|
|
return Value ? __builtin_ctzll(Value) : 64;
|
|
|
|
#else
|
2007-03-04 23:33:03 +00:00
|
|
|
static const unsigned Mod67Position[] = {
|
|
|
|
64, 0, 1, 39, 2, 15, 40, 23, 3, 12, 16, 59, 41, 19, 24, 54,
|
|
|
|
4, 64, 13, 10, 17, 62, 60, 28, 42, 30, 20, 51, 25, 44, 55,
|
|
|
|
47, 5, 32, 65, 38, 14, 22, 11, 58, 18, 53, 63, 9, 61, 27,
|
|
|
|
29, 50, 43, 46, 31, 37, 21, 57, 52, 8, 26, 49, 45, 36, 56,
|
|
|
|
7, 48, 35, 6, 34, 33, 0
|
|
|
|
};
|
2007-03-02 22:19:41 +00:00
|
|
|
return Mod67Position[(-Value & Value) % 67];
|
2007-03-01 21:16:30 +00:00
|
|
|
#endif
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
|
|
|
|
2008-02-13 20:54:54 +00:00
|
|
|
/// CountTrailingOnes_64 - This function performs the operation
|
2009-02-20 22:51:36 +00:00
|
|
|
/// of counting the number of ones from the least significant bit to the first
|
2008-02-13 20:54:54 +00:00
|
|
|
/// zero bit (64 bit edition.)
|
|
|
|
/// Returns 64 if the word is all ones.
|
|
|
|
inline unsigned CountTrailingOnes_64(uint64_t Value) {
|
|
|
|
return CountTrailingZeros_64(~Value);
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountPopulation_32 - this function counts the number of set bits in a value.
|
|
|
|
/// Ex. CountPopulation(0xF000F000) = 8
|
|
|
|
/// Returns 0 if the word is zero.
|
2007-03-01 05:41:28 +00:00
|
|
|
inline unsigned CountPopulation_32(uint32_t Value) {
|
|
|
|
#if __GNUC__ >= 4
|
|
|
|
return __builtin_popcount(Value);
|
|
|
|
#else
|
2007-03-02 22:19:41 +00:00
|
|
|
uint32_t v = Value - ((Value >> 1) & 0x55555555);
|
|
|
|
v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
|
|
|
|
return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
|
2007-03-01 05:41:28 +00:00
|
|
|
#endif
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// CountPopulation_64 - this function counts the number of set bits in a value,
|
|
|
|
/// (64 bit edition.)
|
2005-08-31 00:25:01 +00:00
|
|
|
inline unsigned CountPopulation_64(uint64_t Value) {
|
2007-03-01 05:41:28 +00:00
|
|
|
#if __GNUC__ >= 4
|
|
|
|
return __builtin_popcountll(Value);
|
|
|
|
#else
|
2007-03-02 22:19:41 +00:00
|
|
|
uint64_t v = Value - ((Value >> 1) & 0x5555555555555555ULL);
|
|
|
|
v = (v & 0x3333333333333333ULL) + ((v >> 2) & 0x3333333333333333ULL);
|
|
|
|
v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
|
2007-03-05 00:00:42 +00:00
|
|
|
return unsigned((uint64_t)(v * 0x0101010101010101ULL) >> 56);
|
2007-03-01 05:41:28 +00:00
|
|
|
#endif
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
/// Log2_32 - This function returns the floor log base 2 of the specified value,
|
2006-12-19 01:11:32 +00:00
|
|
|
/// -1 if the value is zero. (32 bit edition.)
|
|
|
|
/// Ex. Log2_32(32) == 5, Log2_32(1) == 0, Log2_32(0) == -1, Log2_32(6) == 2
|
2007-03-22 19:11:57 +00:00
|
|
|
inline unsigned Log2_32(uint32_t Value) {
|
2007-03-02 22:19:41 +00:00
|
|
|
return 31 - CountLeadingZeros_32(Value);
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
2002-05-19 21:19:55 +00:00
|
|
|
|
2009-02-20 22:51:36 +00:00
|
|
|
/// Log2_64 - This function returns the floor log base 2 of the specified value,
|
2006-12-19 01:11:32 +00:00
|
|
|
/// -1 if the value is zero. (64 bit edition.)
|
2005-08-03 20:53:19 +00:00
|
|
|
inline unsigned Log2_64(uint64_t Value) {
|
2007-03-02 22:19:41 +00:00
|
|
|
return 63 - CountLeadingZeros_64(Value);
|
2001-11-27 00:03:19 +00:00
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// Log2_32_Ceil - This function returns the ceil log base 2 of the specified
|
|
|
|
/// value, 32 if the value is zero. (32 bit edition).
|
|
|
|
/// Ex. Log2_32_Ceil(32) == 5, Log2_32_Ceil(1) == 0, Log2_32_Ceil(6) == 3
|
2007-03-22 19:11:57 +00:00
|
|
|
inline unsigned Log2_32_Ceil(uint32_t Value) {
|
2006-07-18 00:47:10 +00:00
|
|
|
return 32-CountLeadingZeros_32(Value-1);
|
|
|
|
}
|
|
|
|
|
2009-05-31 16:18:03 +00:00
|
|
|
/// Log2_64_Ceil - This function returns the ceil log base 2 of the specified
|
|
|
|
/// value, 64 if the value is zero. (64 bit edition.)
|
2006-07-18 00:47:10 +00:00
|
|
|
inline unsigned Log2_64_Ceil(uint64_t Value) {
|
|
|
|
return 64-CountLeadingZeros_64(Value-1);
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// GreatestCommonDivisor64 - Return the greatest common divisor of the two
|
|
|
|
/// values using Euclid's algorithm.
|
|
|
|
inline uint64_t GreatestCommonDivisor64(uint64_t A, uint64_t B) {
|
|
|
|
while (B) {
|
|
|
|
uint64_t T = B;
|
|
|
|
B = A % B;
|
|
|
|
A = T;
|
|
|
|
}
|
|
|
|
return A;
|
|
|
|
}
|
2009-02-20 22:51:36 +00:00
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// BitsToDouble - This function takes a 64-bit integer and returns the bit
|
|
|
|
/// equivalent double.
|
2005-08-17 17:27:47 +00:00
|
|
|
inline double BitsToDouble(uint64_t Bits) {
|
|
|
|
union {
|
|
|
|
uint64_t L;
|
|
|
|
double D;
|
|
|
|
} T;
|
|
|
|
T.L = Bits;
|
|
|
|
return T.D;
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// BitsToFloat - This function takes a 32-bit integer and returns the bit
|
|
|
|
/// equivalent float.
|
2005-08-17 23:54:12 +00:00
|
|
|
inline float BitsToFloat(uint32_t Bits) {
|
2005-08-17 17:27:47 +00:00
|
|
|
union {
|
2005-08-17 23:54:12 +00:00
|
|
|
uint32_t I;
|
2005-08-17 17:27:47 +00:00
|
|
|
float F;
|
|
|
|
} T;
|
|
|
|
T.I = Bits;
|
|
|
|
return T.F;
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// DoubleToBits - This function takes a double and returns the bit
|
2009-01-21 20:32:55 +00:00
|
|
|
/// equivalent 64-bit integer. Note that copying doubles around
|
|
|
|
/// changes the bits of NaNs on some hosts, notably x86, so this
|
|
|
|
/// routine cannot be used if these bits are needed.
|
2005-08-17 17:27:47 +00:00
|
|
|
inline uint64_t DoubleToBits(double Double) {
|
|
|
|
union {
|
|
|
|
uint64_t L;
|
|
|
|
double D;
|
|
|
|
} T;
|
|
|
|
T.D = Double;
|
|
|
|
return T.L;
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// FloatToBits - This function takes a float and returns the bit
|
2009-01-21 20:32:55 +00:00
|
|
|
/// equivalent 32-bit integer. Note that copying floats around
|
|
|
|
/// changes the bits of NaNs on some hosts, notably x86, so this
|
|
|
|
/// routine cannot be used if these bits are needed.
|
2005-08-17 23:54:12 +00:00
|
|
|
inline uint32_t FloatToBits(float Float) {
|
2005-08-17 17:27:47 +00:00
|
|
|
union {
|
2005-08-17 23:54:12 +00:00
|
|
|
uint32_t I;
|
2005-08-17 17:27:47 +00:00
|
|
|
float F;
|
|
|
|
} T;
|
|
|
|
T.F = Float;
|
|
|
|
return T.I;
|
|
|
|
}
|
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// Platform-independent wrappers for the C99 isnan() function.
|
|
|
|
int IsNAN(float f);
|
|
|
|
int IsNAN(double d);
|
2004-06-23 00:25:24 +00:00
|
|
|
|
2006-12-19 01:11:32 +00:00
|
|
|
/// Platform-independent wrappers for the C99 isinf() function.
|
|
|
|
int IsInf(float f);
|
|
|
|
int IsInf(double d);
|
2004-07-21 03:15:14 +00:00
|
|
|
|
2007-11-09 13:41:39 +00:00
|
|
|
/// MinAlign - A and B are either alignments or offsets. Return the minimum
|
|
|
|
/// alignment that may be assumed after adding the two together.
|
2008-01-26 19:50:30 +00:00
|
|
|
static inline uint64_t MinAlign(uint64_t A, uint64_t B) {
|
2007-11-09 13:41:39 +00:00
|
|
|
// The largest power of 2 that divides both A and B.
|
|
|
|
return (A | B) & -(A | B);
|
|
|
|
}
|
2008-06-27 21:48:21 +00:00
|
|
|
|
|
|
|
/// NextPowerOf2 - Returns the next power of two (in 64-bits)
|
|
|
|
/// that is strictly greater than A. Returns zero on overflow.
|
|
|
|
static inline uint64_t NextPowerOf2(uint64_t A) {
|
|
|
|
A |= (A >> 1);
|
|
|
|
A |= (A >> 2);
|
|
|
|
A |= (A >> 4);
|
|
|
|
A |= (A >> 8);
|
|
|
|
A |= (A >> 16);
|
|
|
|
A |= (A >> 32);
|
|
|
|
return A + 1;
|
|
|
|
}
|
2009-02-16 22:57:04 +00:00
|
|
|
|
|
|
|
/// RoundUpToAlignment - Returns the next integer (mod 2**64) that is
|
|
|
|
/// greater than or equal to \arg Value and is a multiple of \arg
|
|
|
|
/// Align. Align must be non-zero.
|
|
|
|
///
|
|
|
|
/// Examples:
|
|
|
|
/// RoundUpToAlignment(5, 8) = 8
|
|
|
|
/// RoundUpToAlignment(17, 8) = 24
|
|
|
|
/// RoundUpToAlignment(~0LL, 8) = 0
|
|
|
|
inline uint64_t RoundUpToAlignment(uint64_t Value, uint64_t Align) {
|
|
|
|
return ((Value + Align - 1) / Align) * Align;
|
|
|
|
}
|
2009-02-20 22:51:36 +00:00
|
|
|
|
2009-08-28 05:48:04 +00:00
|
|
|
/// OffsetToAlignment - Return the offset to the next integer (mod 2**64) that
|
|
|
|
/// is greater than or equal to \arg Value and is a multiple of \arg
|
|
|
|
/// Align. Align must be non-zero.
|
|
|
|
inline uint64_t OffsetToAlignment(uint64_t Value, uint64_t Align) {
|
|
|
|
return RoundUpToAlignment(Value, Align) - Value;
|
|
|
|
}
|
|
|
|
|
2009-05-13 00:24:22 +00:00
|
|
|
/// abs64 - absolute value of a 64-bit int. Not all environments support
|
|
|
|
/// "abs" on whatever their name for the 64-bit int type is. The absolute
|
|
|
|
/// value of the largest negative number is undefined, as with "abs".
|
|
|
|
inline int64_t abs64(int64_t x) {
|
|
|
|
return (x < 0) ? -x : x;
|
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-05-19 21:19:55 +00:00
|
|
|
#endif
|