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
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and 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
|
|
|
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/DataTypes.h"
|
2001-11-27 00:03:19 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// NOTE: The following support functions use the _32/_64 extensions instead of
|
|
|
|
// type overloading so that signed and unsigned integers can be used without
|
|
|
|
// ambiguity.
|
2005-08-02 19:15:30 +00:00
|
|
|
|
|
|
|
|
|
|
|
// Hi_32 - This function returns the high 32 bits of a 64 bit value.
|
|
|
|
inline unsigned Hi_32(uint64_t Value) {
|
|
|
|
return (unsigned)(Value >> 32);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Lo_32 - This function returns the low 32 bits of a 64 bit value.
|
|
|
|
inline unsigned Lo_32(uint64_t Value) {
|
|
|
|
return (unsigned)Value;
|
|
|
|
}
|
|
|
|
|
|
|
|
// is?Type - these functions produce optimal testing for integer data types.
|
|
|
|
inline bool isInt8 (int Value) { return ( signed char )Value == Value; }
|
|
|
|
inline bool isUInt8 (int Value) { return (unsigned char )Value == Value; }
|
|
|
|
inline bool isInt16 (int Value) { return ( signed short)Value == Value; }
|
|
|
|
inline bool isUInt16(int Value) { return (unsigned short)Value == Value; }
|
|
|
|
inline bool isInt32 (int64_t Value) { return ( signed int )Value == Value; }
|
|
|
|
inline bool isUInt32(int64_t Value) { return (unsigned int )Value == Value; }
|
|
|
|
|
2005-08-03 16:53:58 +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.)
|
2005-08-02 19:15:30 +00:00
|
|
|
// Ex. isMask_32(0x0000FFFFU) == true.
|
|
|
|
inline const bool isMask_32(unsigned Value) {
|
|
|
|
return Value && ((Value + 1) & Value) == 0;
|
|
|
|
}
|
|
|
|
|
2005-08-03 16:53:58 +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.)
|
2005-08-02 19:15:30 +00:00
|
|
|
inline const bool isMask_64(uint64_t Value) {
|
|
|
|
return Value && ((Value + 1) & Value) == 0;
|
|
|
|
}
|
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// isShiftedMask_32 - This function returns true if the argument contains a
|
|
|
|
// sequence of ones with the remainder zero (32 bit version.)
|
2005-08-02 19:15:30 +00:00
|
|
|
// Ex. isShiftedMask_32(0x0000FF00U) == true.
|
|
|
|
inline const bool isShiftedMask_32(unsigned Value) {
|
|
|
|
return isMask_32((Value - 1) | Value);
|
|
|
|
}
|
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// isShiftedMask_64 - This function returns true if the argument contains a
|
|
|
|
// sequence of ones with the remainder zero (64 bit version.)
|
2005-08-02 19:15:30 +00:00
|
|
|
inline const bool isShiftedMask_64(uint64_t Value) {
|
|
|
|
return isMask_64((Value - 1) | Value);
|
|
|
|
}
|
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// isPowerOf2_32 - This function returns true if the argument is a power of
|
|
|
|
// two > 0. Ex. isPowerOf2_32(0x00100000U) == true (32 bit edition.)
|
2005-08-02 19:15:30 +00:00
|
|
|
inline bool isPowerOf2_32(unsigned Value) {
|
|
|
|
return Value && !(Value & (Value - 1));
|
|
|
|
}
|
|
|
|
|
2005-08-02 20:21:33 +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) {
|
|
|
|
return Value && !(Value & (Value - 1LL));
|
|
|
|
}
|
|
|
|
|
2005-08-02 20:21:33 +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.
|
2005-08-02 19:15:30 +00:00
|
|
|
inline unsigned CountLeadingZeros_32(unsigned Value) {
|
|
|
|
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;
|
|
|
|
// bisecton method for count leading zeros
|
|
|
|
for (unsigned Shift = 32 >> 1; Shift; Shift >>= 1) {
|
|
|
|
unsigned Tmp = Value >> Shift;
|
|
|
|
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
|
|
|
|
2005-08-02 19:15:30 +00:00
|
|
|
// CountLeadingZeros_64 - This function performs the platform optimal form
|
2005-08-03 16:53:58 +00:00
|
|
|
// of counting the number of zeros from the most significant bit to the first
|
|
|
|
// one bit (64 bit edition.)
|
2005-08-02 19:15:30 +00:00
|
|
|
// Returns 64 if the word is zero.
|
|
|
|
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;
|
|
|
|
// bisecton method for count leading zeros
|
|
|
|
for (uint64_t Shift = 64 >> 1; Shift; Shift >>= 1) {
|
|
|
|
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
|
|
|
|
unsigned 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
|
|
|
|
unsigned Lo = Lo_32(Value);
|
|
|
|
// 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
|
|
|
}
|
|
|
|
|
2005-08-31 00:25:01 +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.
|
|
|
|
inline unsigned CountTrailingZeros_32(unsigned Value) {
|
|
|
|
return 32 - CountLeadingZeros_32(~Value & (Value - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
// CountTrailingZeros_64 - This function performs the platform optimal form
|
|
|
|
// of counting the number of zeros from the least significant bit to the first
|
|
|
|
// one bit (64 bit edition.)
|
|
|
|
// Returns 64 if the word is zero.
|
|
|
|
inline unsigned CountTrailingZeros_64(uint64_t Value) {
|
|
|
|
return 64 - CountLeadingZeros_64(~Value & (Value - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
// CountPopulation_32 - this function counts the number of set bits in a value.
|
|
|
|
// Ex. CountPopulation(0xF000F000) = 8
|
|
|
|
// Returns 0 if the word is zero.
|
|
|
|
inline unsigned CountPopulation_32(unsigned Value) {
|
|
|
|
unsigned x, t;
|
|
|
|
x = Value - ((Value >> 1) & 0x55555555);
|
|
|
|
t = ((x >> 2) & 0x33333333);
|
|
|
|
x = (x & 0x33333333) + t;
|
|
|
|
x = (x + (x >> 4)) & 0x0F0F0F0F;
|
|
|
|
x = x + (x << 8);
|
|
|
|
x = x + (x << 16);
|
|
|
|
return x >> 24;
|
|
|
|
}
|
|
|
|
|
|
|
|
// CountPopulation_64 - this function counts the number of set bits in a value,
|
|
|
|
// (64 bit edition.)
|
|
|
|
inline unsigned CountPopulation_64(uint64_t Value) {
|
2005-10-07 05:29:25 +00:00
|
|
|
return CountPopulation_32(unsigned(Value >> 32)) +
|
|
|
|
CountPopulation_32(unsigned(Value));
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// Log2_32 - This function returns the floor log base 2 of the specified value,
|
|
|
|
// -1 if the value is zero. (32 bit edition.)
|
2005-08-02 19:15:30 +00:00
|
|
|
// Ex. Log2_32(32) == 5, Log2_32(1) == 0, Log2_32(0) == -1
|
|
|
|
inline unsigned Log2_32(unsigned Value) {
|
|
|
|
return 31 - CountLeadingZeros_32(Value);
|
2005-08-31 00:25:01 +00:00
|
|
|
}
|
2002-05-19 21:19:55 +00:00
|
|
|
|
2005-08-03 16:53:58 +00:00
|
|
|
// Log2_64 - This function returns the floor log base 2 of the specified value,
|
|
|
|
// -1 if the value is zero. (64 bit edition.)
|
2005-08-03 20:53:19 +00:00
|
|
|
inline unsigned Log2_64(uint64_t Value) {
|
2005-08-02 19:15:30 +00:00
|
|
|
return 63 - CountLeadingZeros_64(Value);
|
2001-11-27 00:03:19 +00:00
|
|
|
}
|
|
|
|
|
2005-08-17 17:27:47 +00:00
|
|
|
// BitsToDouble - This function takes a 64-bit integer and returns the bit
|
|
|
|
// equivalent double.
|
|
|
|
inline double BitsToDouble(uint64_t Bits) {
|
|
|
|
union {
|
|
|
|
uint64_t L;
|
|
|
|
double D;
|
|
|
|
} T;
|
|
|
|
T.L = Bits;
|
|
|
|
return T.D;
|
|
|
|
}
|
|
|
|
|
|
|
|
// 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
// DoubleToBits - This function takes a double and returns the bit
|
|
|
|
// equivalent 64-bit integer.
|
|
|
|
inline uint64_t DoubleToBits(double Double) {
|
|
|
|
union {
|
|
|
|
uint64_t L;
|
|
|
|
double D;
|
|
|
|
} T;
|
|
|
|
T.D = Double;
|
|
|
|
return T.L;
|
|
|
|
}
|
|
|
|
|
|
|
|
// FloatToBits - This function takes a float and returns the bit
|
|
|
|
// equivalent 32-bit integer.
|
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;
|
|
|
|
}
|
|
|
|
|
2004-06-23 00:25:24 +00:00
|
|
|
// Platform-independent wrappers for the C99 isnan() function.
|
|
|
|
int IsNAN (float f);
|
|
|
|
int IsNAN (double d);
|
|
|
|
|
2004-07-21 03:15:14 +00:00
|
|
|
// Platform-independent wrappers for the C99 isinf() function.
|
|
|
|
int IsInf (float f);
|
|
|
|
int IsInf (double d);
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-05-19 21:19:55 +00:00
|
|
|
#endif
|