BsBitwise.h 9.0 KB

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