BsBitwise.h 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290
  1. //********************************** Banshee Engine (www.banshee3d.com) **************************************************//
  2. //**************** Copyright (c) 2016 Marko Pintera ([email protected]). All rights reserved. **********************//
  3. #pragma once
  4. #include "BsPrerequisitesUtil.h"
  5. namespace bs
  6. {
  7. /** @addtogroup General
  8. * @{
  9. */
  10. /** Class for manipulating bit patterns. */
  11. class Bitwise
  12. {
  13. public:
  14. /** Returns the most significant bit set in a value. */
  15. static UINT32 mostSignificantBitSet(unsigned int value)
  16. {
  17. UINT32 result = 0;
  18. while (value != 0) {
  19. ++result;
  20. value >>= 1;
  21. }
  22. return result-1;
  23. }
  24. /** Returns the power-of-two number greater or equal to the provided value. */
  25. static UINT32 nextPow2(UINT32 n)
  26. {
  27. --n;
  28. n |= n >> 16;
  29. n |= n >> 8;
  30. n |= n >> 4;
  31. n |= n >> 2;
  32. n |= n >> 1;
  33. ++n;
  34. return n;
  35. }
  36. /** Returns the power-of-two number closest to the provided value. */
  37. static UINT32 closestPow2(UINT32 n)
  38. {
  39. UINT32 next = nextPow2(n);
  40. UINT32 prev = next >> 1;
  41. if (n - prev < next - n)
  42. return prev;
  43. return next;
  44. }
  45. /** Determines whether the number is power-of-two or not. */
  46. template<typename T>
  47. static bool isPow2(T n)
  48. {
  49. return (n & (n-1)) == 0;
  50. }
  51. /** Returns the number of bits a pattern must be shifted right by to remove right-hand zeros. */
  52. template<typename T>
  53. static unsigned int getBitShift(T mask)
  54. {
  55. if (mask == 0)
  56. return 0;
  57. unsigned int result = 0;
  58. while ((mask & 1) == 0) {
  59. ++result;
  60. mask >>= 1;
  61. }
  62. return result;
  63. }
  64. /** Takes a value with a given src bit mask, and produces another value with a desired bit mask. */
  65. template<typename SrcT, typename DestT>
  66. static DestT convertBitPattern(SrcT srcValue, SrcT srcBitMask, DestT destBitMask)
  67. {
  68. // Mask off irrelevant source value bits (if any)
  69. srcValue = srcValue & srcBitMask;
  70. // Shift source down to bottom of DWORD
  71. const unsigned int srcBitShift = getBitShift(srcBitMask);
  72. srcValue >>= srcBitShift;
  73. // Get max value possible in source from srcMask
  74. const SrcT srcMax = srcBitMask >> srcBitShift;
  75. // Get max available in dest
  76. const unsigned int destBitShift = getBitShift(destBitMask);
  77. const DestT destMax = destBitMask >> destBitShift;
  78. // Scale source value into destination, and shift back
  79. DestT destValue = (srcValue * destMax) / srcMax;
  80. return (destValue << destBitShift);
  81. }
  82. /**
  83. * Convert N bit colour channel value to P bits. It fills P bits with the bit pattern repeated.
  84. * (this is /((1<<n)-1) in fixed point).
  85. */
  86. static unsigned int fixedToFixed(UINT32 value, unsigned int n, unsigned int p)
  87. {
  88. if(n > p)
  89. {
  90. // Less bits required than available; this is easy
  91. value >>= n-p;
  92. }
  93. else if(n < p)
  94. {
  95. // More bits required than are there, do the fill
  96. // Use old fashioned division, probably better than a loop
  97. if(value == 0)
  98. value = 0;
  99. else if(value == (static_cast<unsigned int>(1)<<n)-1)
  100. value = (1<<p)-1;
  101. else value = value*(1<<p)/((1<<n)-1);
  102. }
  103. return value;
  104. }
  105. /**
  106. * Convert floating point color channel value between 0.0 and 1.0 (otherwise clamped) to integer of a certain
  107. * number of bits. Works for any value of bits between 0 and 31.
  108. */
  109. static unsigned int floatToFixed(const float value, const unsigned int bits)
  110. {
  111. if(value <= 0.0f) return 0;
  112. else if (value >= 1.0f) return (1<<bits)-1;
  113. else return (unsigned int)(value * (1<<bits));
  114. }
  115. /** Fixed point to float. */
  116. static float fixedToFloat(unsigned value, unsigned int bits)
  117. {
  118. return (float)value/(float)((1<<bits)-1);
  119. }
  120. /** Write a n*8 bits integer value to memory in native endian. */
  121. static void intWrite(void *dest, const int n, const unsigned int value)
  122. {
  123. switch(n) {
  124. case 1:
  125. ((UINT8*)dest)[0] = (UINT8)value;
  126. break;
  127. case 2:
  128. ((UINT16*)dest)[0] = (UINT16)value;
  129. break;
  130. case 3:
  131. #if BS_ENDIAN == BS_ENDIAN_BIG
  132. ((UINT8*)dest)[0] = (UINT8)((value >> 16) & 0xFF);
  133. ((UINT8*)dest)[1] = (UINT8)((value >> 8) & 0xFF);
  134. ((UINT8*)dest)[2] = (UINT8)(value & 0xFF);
  135. #else
  136. ((UINT8*)dest)[2] = (UINT8)((value >> 16) & 0xFF);
  137. ((UINT8*)dest)[1] = (UINT8)((value >> 8) & 0xFF);
  138. ((UINT8*)dest)[0] = (UINT8)(value & 0xFF);
  139. #endif
  140. break;
  141. case 4:
  142. ((UINT32*)dest)[0] = (UINT32)value;
  143. break;
  144. }
  145. }
  146. /** Read a n*8 bits integer value to memory in native endian. */
  147. static unsigned int intRead(const void *src, int n) {
  148. switch(n) {
  149. case 1:
  150. return ((UINT8*)src)[0];
  151. case 2:
  152. return ((UINT16*)src)[0];
  153. case 3:
  154. #if BS_ENDIAN == BS_ENDIAN_BIG
  155. return ((UINT32)((UINT8*)src)[0]<<16)|
  156. ((UINT32)((UINT8*)src)[1]<<8)|
  157. ((UINT32)((UINT8*)src)[2]);
  158. #else
  159. return ((UINT32)((UINT8*)src)[0])|
  160. ((UINT32)((UINT8*)src)[1]<<8)|
  161. ((UINT32)((UINT8*)src)[2]<<16);
  162. #endif
  163. case 4:
  164. return ((UINT32*)src)[0];
  165. }
  166. return 0; // ?
  167. }
  168. /** Convert a float32 to a float16 (NV_half_float). */
  169. static UINT16 floatToHalf(float i)
  170. {
  171. union { float f; UINT32 i; } v;
  172. v.f = i;
  173. return floatToHalfI(v.i);
  174. }
  175. /** Converts float in UINT32 format to a a half in UINT16 format. */
  176. static UINT16 floatToHalfI(UINT32 i)
  177. {
  178. int s = (i >> 16) & 0x00008000;
  179. int e = ((i >> 23) & 0x000000ff) - (127 - 15);
  180. int m = i & 0x007fffff;
  181. if (e <= 0)
  182. {
  183. if (e < -10)
  184. {
  185. return 0;
  186. }
  187. m = (m | 0x00800000) >> (1 - e);
  188. return static_cast<UINT16>(s | (m >> 13));
  189. }
  190. else if (e == 0xff - (127 - 15))
  191. {
  192. if (m == 0) // Inf
  193. {
  194. return static_cast<UINT16>(s | 0x7c00);
  195. }
  196. else // NAN
  197. {
  198. m >>= 13;
  199. return static_cast<UINT16>(s | 0x7c00 | m | (m == 0));
  200. }
  201. }
  202. else
  203. {
  204. if (e > 30) // Overflow
  205. {
  206. return static_cast<UINT16>(s | 0x7c00);
  207. }
  208. return static_cast<UINT16>(s | (e << 10) | (m >> 13));
  209. }
  210. }
  211. /** Convert a float16 (NV_half_float) to a float32. */
  212. static float halfToFloat(UINT16 y)
  213. {
  214. union { float f; UINT32 i; } v;
  215. v.i = halfToFloatI(y);
  216. return v.f;
  217. }
  218. /** Converts a half in UINT16 format to a float in UINT32 format. */
  219. static UINT32 halfToFloatI(UINT16 y)
  220. {
  221. int s = (y >> 15) & 0x00000001;
  222. int e = (y >> 10) & 0x0000001f;
  223. int m = y & 0x000003ff;
  224. if (e == 0)
  225. {
  226. if (m == 0) // Plus or minus zero
  227. {
  228. return s << 31;
  229. }
  230. else // Denormalized number -- renormalize it
  231. {
  232. while (!(m & 0x00000400))
  233. {
  234. m <<= 1;
  235. e -= 1;
  236. }
  237. e += 1;
  238. m &= ~0x00000400;
  239. }
  240. }
  241. else if (e == 31)
  242. {
  243. if (m == 0) // Inf
  244. {
  245. return (s << 31) | 0x7f800000;
  246. }
  247. else // NaN
  248. {
  249. return (s << 31) | 0x7f800000 | (m << 13);
  250. }
  251. }
  252. e = e + (127 - 15);
  253. m = m << 13;
  254. return (s << 31) | (e << 23) | m;
  255. }
  256. };
  257. /** @} */
  258. }