math_test.cpp 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858
  1. /*
  2. * Copyright 2010-2024 Branimir Karadzic. All rights reserved.
  3. * License: https://github.com/bkaradzic/bx/blob/master/LICENSE
  4. */
  5. #include "test.h"
  6. #include <bx/math.h>
  7. #include <bx/file.h>
  8. #include <math.h>
  9. #include <stdint.h> // intXX_t
  10. #include <limits.h> // UCHAR_*
  11. TEST_CASE("isFinite, isInfinite, isNan", "[math]")
  12. {
  13. for (uint64_t ii = 0; ii < UINT32_MAX; ii += rand()%(1<<13)+1)
  14. {
  15. union { uint32_t ui; float f; } u = { uint32_t(ii) };
  16. #if BX_PLATFORM_OSX
  17. REQUIRE(::__isnanf(u.f) == bx::isNan(u.f) );
  18. REQUIRE(::__isfinitef(u.f) == bx::isFinite(u.f) );
  19. REQUIRE(::__isinff(u.f) == bx::isInfinite(u.f) );
  20. #elif BX_COMPILER_MSVC
  21. REQUIRE(!!::isnan(u.f) == bx::isNan(u.f) );
  22. REQUIRE(!!::isfinite(u.f) == bx::isFinite(u.f) );
  23. REQUIRE(!!::isinf(u.f) == bx::isInfinite(u.f) );
  24. #elif !BX_CRT_MINGW
  25. REQUIRE(::isnanf(u.f) == bx::isNan(u.f) );
  26. REQUIRE(::finitef(u.f) == bx::isFinite(u.f) );
  27. REQUIRE(::isinff(u.f) == bx::isInfinite(u.f) );
  28. #endif // BX_*
  29. }
  30. }
  31. static bool testLog2(float _a)
  32. {
  33. return bx::log2(_a) == bx::log(_a) * (1.0f / bx::log(2.0f) );
  34. }
  35. TEST_CASE("log2", "[math][libm]")
  36. {
  37. testLog2(0.0f);
  38. testLog2(256.0f);
  39. REQUIRE(0.0f == bx::log2(1.0f) );
  40. REQUIRE(1.0f == bx::log2(2.0f) );
  41. REQUIRE(2.0f == bx::log2(4.0f) );
  42. REQUIRE(3.0f == bx::log2(8.0f) );
  43. REQUIRE(4.0f == bx::log2(16.0f) );
  44. REQUIRE(5.0f == bx::log2(32.0f) );
  45. REQUIRE(6.0f == bx::log2(64.0f) );
  46. REQUIRE(7.0f == bx::log2(128.0f) );
  47. REQUIRE(8.0f == bx::log2(256.0f) );
  48. }
  49. TEST_CASE("ceilLog2", "[math]")
  50. {
  51. STATIC_REQUIRE(0 == bx::ceilLog2(-1) );
  52. STATIC_REQUIRE(0 == bx::ceilLog2(0) );
  53. STATIC_REQUIRE(0 == bx::ceilLog2(1) );
  54. STATIC_REQUIRE(1 == bx::ceilLog2(2) );
  55. STATIC_REQUIRE(2 == bx::ceilLog2(4) );
  56. STATIC_REQUIRE(3 == bx::ceilLog2(8) );
  57. STATIC_REQUIRE(4 == bx::ceilLog2(16) );
  58. STATIC_REQUIRE(5 == bx::ceilLog2(32) );
  59. STATIC_REQUIRE(6 == bx::ceilLog2(64) );
  60. STATIC_REQUIRE(7 == bx::ceilLog2(128) );
  61. STATIC_REQUIRE(8 == bx::ceilLog2(256) );
  62. {
  63. uint32_t ii = 0;
  64. for (; ii < 8; ++ii)
  65. {
  66. REQUIRE(ii == bx::ceilLog2(uint8_t(1<<ii) ) );
  67. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  68. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  69. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  70. }
  71. for (; ii < 16; ++ii)
  72. {
  73. REQUIRE(ii == bx::ceilLog2(uint16_t(1<<ii) ) );
  74. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  75. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  76. }
  77. for (; ii < 32; ++ii)
  78. {
  79. REQUIRE(ii == bx::ceilLog2(uint32_t(1<<ii) ) );
  80. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  81. }
  82. for (; ii < 64; ++ii)
  83. {
  84. REQUIRE(ii == bx::ceilLog2(uint64_t(1ull<<ii) ) );
  85. }
  86. }
  87. for (uint32_t ii = 1; ii < INT32_MAX; ii += rand()%(1<<13)+1)
  88. {
  89. REQUIRE(bx::nextPow2(ii) == bx::uint32_nextpow2(ii) );
  90. }
  91. }
  92. TEST_CASE("floorLog2", "[math]")
  93. {
  94. STATIC_REQUIRE(0 == bx::floorLog2(-1) );
  95. STATIC_REQUIRE(0 == bx::floorLog2(0) );
  96. STATIC_REQUIRE(0 == bx::floorLog2(1) );
  97. STATIC_REQUIRE(1 == bx::floorLog2(2) );
  98. STATIC_REQUIRE(2 == bx::floorLog2(4) );
  99. STATIC_REQUIRE(3 == bx::floorLog2(8) );
  100. STATIC_REQUIRE(4 == bx::floorLog2(16) );
  101. STATIC_REQUIRE(5 == bx::floorLog2(32) );
  102. STATIC_REQUIRE(6 == bx::floorLog2(64) );
  103. STATIC_REQUIRE(7 == bx::floorLog2(128) );
  104. STATIC_REQUIRE(8 == bx::floorLog2(256) );
  105. {
  106. uint32_t ii = 0;
  107. for (; ii < 8; ++ii)
  108. {
  109. REQUIRE(ii == bx::floorLog2(uint8_t(1<<ii) ) );
  110. REQUIRE(ii == bx::floorLog2(uint16_t(1<<ii) ) );
  111. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  112. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  113. }
  114. for (; ii < 16; ++ii)
  115. {
  116. REQUIRE(ii == bx::floorLog2(uint16_t(1<<ii) ) );
  117. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  118. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  119. }
  120. for (; ii < 32; ++ii)
  121. {
  122. REQUIRE(ii == bx::floorLog2(uint32_t(1<<ii) ) );
  123. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  124. }
  125. for (; ii < 64; ++ii)
  126. {
  127. REQUIRE(ii == bx::floorLog2(uint64_t(1ull<<ii) ) );
  128. }
  129. }
  130. }
  131. TEST_CASE("ceilLog2 & floorLog2", "[math]")
  132. {
  133. {
  134. uint32_t prev = 0;
  135. uint32_t next = 0;
  136. for (uint32_t ii = 0; ii < (1<<18); ++ii)
  137. {
  138. if (bx::isPowerOf2(ii) )
  139. {
  140. REQUIRE(bx::ceilLog2(ii) == bx::floorLog2(ii) );
  141. prev = next;
  142. ++next;
  143. }
  144. else
  145. {
  146. REQUIRE(prev == bx::floorLog2(ii) );
  147. REQUIRE(next == bx::ceilLog2(ii) );
  148. }
  149. }
  150. }
  151. }
  152. TEST_CASE("countTrailingZeros", "[math]")
  153. {
  154. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint8_t >(1) );
  155. STATIC_REQUIRE( 7 == bx::countTrailingZeros<uint8_t >(1<<7) );
  156. STATIC_REQUIRE( 8 == bx::countTrailingZeros<uint8_t >(0) );
  157. STATIC_REQUIRE( 1 == bx::countTrailingZeros<uint8_t >(0x3e) );
  158. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint16_t>(1) );
  159. STATIC_REQUIRE(15 == bx::countTrailingZeros<uint16_t>(1<<15) );
  160. STATIC_REQUIRE(16 == bx::countTrailingZeros<uint16_t>(0) );
  161. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint32_t>(1) );
  162. STATIC_REQUIRE(32 == bx::countTrailingZeros<uint32_t>(0) );
  163. STATIC_REQUIRE(31 == bx::countTrailingZeros<uint32_t>(1u<<31) );
  164. STATIC_REQUIRE( 0 == bx::countTrailingZeros<uint64_t>(1) );
  165. STATIC_REQUIRE(64 == bx::countTrailingZeros<uint64_t>(0) );
  166. }
  167. TEST_CASE("countLeadingZeros", "[math]")
  168. {
  169. STATIC_REQUIRE( 7 == bx::countLeadingZeros<uint8_t >(1) );
  170. STATIC_REQUIRE( 8 == bx::countLeadingZeros<uint8_t >(0) );
  171. STATIC_REQUIRE( 2 == bx::countLeadingZeros<uint8_t >(0x3e) );
  172. STATIC_REQUIRE(15 == bx::countLeadingZeros<uint16_t>(1) );
  173. STATIC_REQUIRE(16 == bx::countLeadingZeros<uint16_t>(0) );
  174. STATIC_REQUIRE(31 == bx::countLeadingZeros<uint32_t>(1) );
  175. STATIC_REQUIRE(32 == bx::countLeadingZeros<uint32_t>(0) );
  176. STATIC_REQUIRE(63 == bx::countLeadingZeros<uint64_t>(1) );
  177. STATIC_REQUIRE(64 == bx::countLeadingZeros<uint64_t>(0) );
  178. }
  179. TEST_CASE("countBits", "[math]")
  180. {
  181. STATIC_REQUIRE( 0 == bx::countBits(0) );
  182. STATIC_REQUIRE( 1 == bx::countBits(1) );
  183. STATIC_REQUIRE( 4 == bx::countBits<uint8_t>(0x55) );
  184. STATIC_REQUIRE( 8 == bx::countBits<uint16_t>(0x5555) );
  185. STATIC_REQUIRE(16 == bx::countBits<uint32_t>(0x55555555) );
  186. STATIC_REQUIRE(32 == bx::countBits<uint64_t>(0x5555555555555555ull) );
  187. STATIC_REQUIRE( 8 == bx::countBits(UINT8_MAX) );
  188. STATIC_REQUIRE(16 == bx::countBits(UINT16_MAX) );
  189. STATIC_REQUIRE(32 == bx::countBits(UINT32_MAX) );
  190. STATIC_REQUIRE(64 == bx::countBits(UINT64_MAX) );
  191. }
  192. template<typename Ty>
  193. static void testFindFirstSet()
  194. {
  195. for (uint8_t ii = 0, num = sizeof(Ty)*8; ii < num; ++ii)
  196. {
  197. {
  198. const Ty val = Ty(1) << ii;
  199. const uint8_t result = bx::findFirstSet<Ty>(val);
  200. REQUIRE(result == ii + 1);
  201. }
  202. {
  203. const Ty val = ( (Ty(1) << ii) ) | (Ty(1) << (num - 1) );
  204. const uint8_t result = bx::findFirstSet<Ty>(val);
  205. REQUIRE(result == ii + 1);
  206. }
  207. }
  208. }
  209. TEST_CASE("findFirstSet", "[math]")
  210. {
  211. STATIC_REQUIRE( 1 == bx::findFirstSet<uint8_t >(1) );
  212. STATIC_REQUIRE( 8 == bx::findFirstSet<uint8_t >(1<<7) );
  213. STATIC_REQUIRE( 0 == bx::findFirstSet<uint8_t >(0) );
  214. STATIC_REQUIRE( 2 == bx::findFirstSet<uint8_t >(0x3e) );
  215. STATIC_REQUIRE( 1 == bx::findFirstSet<uint16_t>(1) );
  216. STATIC_REQUIRE(16 == bx::findFirstSet<uint16_t>(1<<15) );
  217. STATIC_REQUIRE( 0 == bx::findFirstSet<uint16_t>(0) );
  218. STATIC_REQUIRE( 1 == bx::findFirstSet<uint32_t>(1) );
  219. STATIC_REQUIRE( 0 == bx::findFirstSet<uint32_t>(0) );
  220. STATIC_REQUIRE(32 == bx::findFirstSet<uint32_t>(1u<<31) );
  221. STATIC_REQUIRE( 1 == bx::findFirstSet<uint64_t>(1) );
  222. STATIC_REQUIRE( 0 == bx::findFirstSet<uint64_t>(0) );
  223. STATIC_REQUIRE(64 == bx::findFirstSet<uint64_t>(0x8000000000000000ull) );
  224. STATIC_REQUIRE( 1 == bx::findFirstSet<uint64_t>(0x8000000000000001ull) );
  225. testFindFirstSet<uint8_t>();
  226. testFindFirstSet<uint16_t>();
  227. testFindFirstSet<uint32_t>();
  228. testFindFirstSet<uint64_t>();
  229. }
  230. template<typename Ty>
  231. static void testFindLastSet()
  232. {
  233. for (uint8_t ii = 0, num = sizeof(Ty)*8; ii < num; ++ii)
  234. {
  235. {
  236. const Ty val = Ty(1) << ii;
  237. const uint8_t result = bx::findLastSet<Ty>(val);
  238. REQUIRE(result == ii + 1);
  239. }
  240. {
  241. const Ty val = (Ty(1) << ii) - 1;
  242. const uint8_t result = bx::findLastSet<Ty>(val);
  243. REQUIRE(result == ii);
  244. }
  245. }
  246. }
  247. TEST_CASE("findLastSet", "[math]")
  248. {
  249. STATIC_REQUIRE( 1 == bx::findLastSet<uint8_t >(1) );
  250. STATIC_REQUIRE( 8 == bx::findLastSet<uint8_t >(1<<7) );
  251. STATIC_REQUIRE( 0 == bx::findLastSet<uint8_t >(0) );
  252. STATIC_REQUIRE( 6 == bx::findLastSet<uint8_t >(0x3e) );
  253. STATIC_REQUIRE( 1 == bx::findLastSet<uint16_t>(1) );
  254. STATIC_REQUIRE(16 == bx::findLastSet<uint16_t>(1<<15) );
  255. STATIC_REQUIRE( 0 == bx::findLastSet<uint16_t>(0) );
  256. STATIC_REQUIRE( 1 == bx::findLastSet<uint32_t>(1) );
  257. STATIC_REQUIRE( 0 == bx::findLastSet<uint32_t>(0) );
  258. STATIC_REQUIRE(32 == bx::findLastSet<uint32_t>(1u<<31) );
  259. STATIC_REQUIRE( 1 == bx::findLastSet<uint64_t>(1) );
  260. STATIC_REQUIRE( 0 == bx::findLastSet<uint64_t>(0) );
  261. STATIC_REQUIRE( 1 == bx::findLastSet<uint64_t>(1ull) );
  262. STATIC_REQUIRE(64 == bx::findLastSet<uint64_t>(0x8000000000000000ull) );
  263. STATIC_REQUIRE(64 == bx::findLastSet<uint64_t>(0x8000000000000001ull) );
  264. testFindLastSet<uint8_t>();
  265. testFindLastSet<uint16_t>();
  266. testFindLastSet<uint32_t>();
  267. testFindLastSet<uint64_t>();
  268. }
  269. BX_PRAGMA_DIAGNOSTIC_PUSH();
  270. BX_PRAGMA_DIAGNOSTIC_IGNORED_MSVC(4723) // potential divide by 0
  271. TEST_CASE("rcp", "[math][libm]")
  272. {
  273. STATIC_REQUIRE(1.0f == bx::rcp(1.0f) );
  274. STATIC_REQUIRE(2.0f == bx::rcp(0.5f) );
  275. REQUIRE(bx::isInfinite(bx::rcp( 0.0f) ) );
  276. REQUIRE(bx::isInfinite(bx::rcp(-0.0f) ) );
  277. }
  278. TEST_CASE("rcpSafe", "[math][libm]")
  279. {
  280. STATIC_REQUIRE(1.0f == bx::rcpSafe(1.0f) );
  281. STATIC_REQUIRE(2.0f == bx::rcpSafe(0.5f) );
  282. STATIC_REQUIRE(bx::isFinite(bx::rcpSafe( 0.0f) ) );
  283. STATIC_REQUIRE(bx::isFinite(bx::rcpSafe(-0.0f) ) );
  284. }
  285. TEST_CASE("rsqrt", "[math][libm]")
  286. {
  287. bx::WriterI* writer = bx::getNullOut();
  288. bx::Error err;
  289. // rsqrtRef
  290. REQUIRE(bx::isInfinite(bx::rsqrtRef(0.0f) ) );
  291. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  292. {
  293. bx::write(writer, &err, "rsqrtRef(%f) == %f (expected: %f)\n", xx, bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx) );
  294. REQUIRE(err.isOk() );
  295. REQUIRE(bx::isEqual(bx::rsqrtRef(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  296. }
  297. // rsqrtSimd
  298. REQUIRE(bx::isInfinite(bx::rsqrtSimd(0.0f) ) );
  299. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  300. {
  301. bx::write(writer, &err, "rsqrtSimd(%f) == %f (expected: %f)\n", xx, bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx) );
  302. REQUIRE(err.isOk() );
  303. REQUIRE(bx::isEqual(bx::rsqrtSimd(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  304. }
  305. // rsqrt
  306. REQUIRE(bx::isInfinite(1.0f / ::sqrtf(0.0f) ) );
  307. REQUIRE(bx::isInfinite(bx::rsqrt(0.0f) ) );
  308. for (float xx = bx::kNearZero; xx < 100.0f; xx += 0.1f)
  309. {
  310. bx::write(writer, &err, "rsqrt(%f) == %f (expected: %f)\n", xx, bx::rsqrt(xx), 1.0f / ::sqrtf(xx) );
  311. REQUIRE(err.isOk() );
  312. REQUIRE(bx::isEqual(bx::rsqrt(xx), 1.0f / ::sqrtf(xx), 0.00001f) );
  313. }
  314. }
  315. TEST_CASE("sqrt", "[math][libm]")
  316. {
  317. bx::WriterI* writer = bx::getNullOut();
  318. bx::Error err;
  319. // sqrtRef
  320. REQUIRE(bx::isNan(bx::sqrtRef(-1.0f) ) );
  321. REQUIRE(bx::isEqual(bx::sqrtRef(0.0f), ::sqrtf(0.0f), 0.0f) );
  322. REQUIRE(bx::isEqual(bx::sqrtRef(1.0f), ::sqrtf(1.0f), 0.0f) );
  323. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  324. {
  325. bx::write(writer, &err, "sqrtRef(%f) == %f (expected: %f)\n", xx, bx::sqrtRef(xx), ::sqrtf(xx) );
  326. REQUIRE(err.isOk() );
  327. REQUIRE(bx::isEqual(bx::sqrtRef(xx), ::sqrtf(xx), 0.00001f) );
  328. }
  329. // sqrtSimd
  330. REQUIRE(bx::isNan(bx::sqrtSimd(-1.0f) ) );
  331. REQUIRE(bx::isEqual(bx::sqrtSimd(0.0f), ::sqrtf(0.0f), 0.00001f) );
  332. REQUIRE(bx::isEqual(bx::sqrtSimd(1.0f), ::sqrtf(1.0f), 0.00001f) );
  333. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  334. {
  335. bx::write(writer, &err, "sqrtSimd(%f) == %f (expected: %f)\n", xx, bx::sqrtSimd(xx), ::sqrtf(xx) );
  336. REQUIRE(err.isOk() );
  337. REQUIRE(bx::isEqual(bx::sqrtSimd(xx), ::sqrtf(xx), 0.00001f) );
  338. }
  339. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  340. {
  341. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  342. REQUIRE(err.isOk() );
  343. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  344. }
  345. // sqrt
  346. REQUIRE(bx::isNan(::sqrtf(-1.0f) ) );
  347. REQUIRE(bx::isNan(bx::sqrt(-1.0f) ) );
  348. REQUIRE(bx::isEqual(bx::sqrt(0.0f), ::sqrtf(0.0f), 0.00001f) );
  349. REQUIRE(bx::isEqual(bx::sqrt(1.0f), ::sqrtf(1.0f), 0.00001f) );
  350. for (float xx = 0.0f; xx < 1000000.0f; xx += 1000.f)
  351. {
  352. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  353. REQUIRE(err.isOk() );
  354. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  355. }
  356. for (float xx = 0.0f; xx < 100.0f; xx += 0.1f)
  357. {
  358. bx::write(writer, &err, "sqrt(%f) == %f (expected: %f)\n", xx, bx::sqrt(xx), ::sqrtf(xx) );
  359. REQUIRE(err.isOk() );
  360. REQUIRE(bx::isEqual(bx::sqrt(xx), ::sqrtf(xx), 0.00001f) );
  361. }
  362. }
  363. BX_PRAGMA_DIAGNOSTIC_POP();
  364. TEST_CASE("abs", "[math][libm]")
  365. {
  366. STATIC_REQUIRE(1389.0f == bx::abs(-1389.0f) );
  367. STATIC_REQUIRE(1389.0f == bx::abs( 1389.0f) );
  368. STATIC_REQUIRE( 0.0f == bx::abs(-0.0f) );
  369. STATIC_REQUIRE( 0.0f == bx::abs( 0.0f) );
  370. }
  371. TEST_CASE("mod", "[math][libm]")
  372. {
  373. STATIC_REQUIRE(389.0f == bx::mod(1389.0f, 1000.0f) );
  374. STATIC_REQUIRE( 89.0f == bx::mod(1389.0f, 100.0f) );
  375. STATIC_REQUIRE( 9.0f == bx::mod(1389.0f, 10.0f) );
  376. STATIC_REQUIRE( 4.0f == bx::mod(1389.0f, 5.0f) );
  377. STATIC_REQUIRE( 1.0f == bx::mod(1389.0f, 2.0f) );
  378. }
  379. TEST_CASE("floor", "[math][libm]")
  380. {
  381. STATIC_REQUIRE( 13.0f == bx::floor( 13.89f) );
  382. STATIC_REQUIRE(-14.0f == bx::floor(-13.89f) );
  383. }
  384. TEST_CASE("ceil", "[math][libm]")
  385. {
  386. STATIC_REQUIRE( 14.0f == bx::ceil( 13.89f) );
  387. STATIC_REQUIRE(-13.0f == bx::ceil( -13.89f) );
  388. }
  389. TEST_CASE("trunc", "[math][libm]")
  390. {
  391. STATIC_REQUIRE( 13.0f == bx::trunc( 13.89f) );
  392. STATIC_REQUIRE(-13.0f == bx::trunc(-13.89f) );
  393. }
  394. TEST_CASE("fract", "[math][libm]")
  395. {
  396. STATIC_REQUIRE(bx::isEqual( 0.89f, bx::fract( 13.89f), 0.000001f) );
  397. STATIC_REQUIRE(bx::isEqual(-0.89f, bx::fract(-13.89f), 0.000001f) );
  398. }
  399. TEST_CASE("ldexp", "[math][libm]")
  400. {
  401. STATIC_REQUIRE(1389.0f == bx::ldexp(86.8125, 4) );
  402. bx::WriterI* writer = bx::getNullOut();
  403. bx::Error err;
  404. for (int32_t yy = -10; yy < 10; ++yy)
  405. {
  406. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  407. {
  408. bx::write(writer, &err, "ldexp(%f, %d) == %f (expected: %f)\n", xx, yy, bx::ldexp(xx, yy), ::ldexpf(xx, yy) );
  409. REQUIRE(bx::isEqual(bx::ldexp(xx, yy), ::ldexpf(xx, yy), 0.00001f) );
  410. }
  411. }
  412. }
  413. TEST_CASE("exp", "[math][libm]")
  414. {
  415. bx::WriterI* writer = bx::getNullOut();
  416. bx::Error err;
  417. for (float xx = -80.0f; xx < 80.0f; xx += 0.1f)
  418. {
  419. bx::write(writer, &err, "exp(%f) == %f (expected: %f)\n", xx, bx::exp(xx), ::expf(xx) );
  420. REQUIRE(err.isOk() );
  421. REQUIRE(bx::isEqual(bx::exp(xx), ::expf(xx), 0.00001f) );
  422. }
  423. }
  424. TEST_CASE("pow", "[math][libm]")
  425. {
  426. bx::WriterI* writer = bx::getNullOut();
  427. bx::Error err;
  428. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  429. {
  430. bx::write(writer, &err, "pow(1.389f, %f) == %f (expected: %f)\n", xx, bx::pow(1.389f, xx), ::powf(1.389f, xx) );
  431. REQUIRE(err.isOk() );
  432. REQUIRE(bx::isEqual(bx::pow(1.389f, xx), ::powf(1.389f, xx), 0.00001f) );
  433. }
  434. }
  435. TEST_CASE("asin", "[math][libm]")
  436. {
  437. bx::WriterI* writer = bx::getNullOut();
  438. bx::Error err;
  439. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  440. {
  441. bx::write(writer, &err, "asin(%f) == %f (expected: %f)\n", xx, bx::asin(xx), ::asinf(xx) );
  442. REQUIRE(err.isOk() );
  443. REQUIRE(bx::isEqual(bx::asin(xx), ::asinf(xx), 0.0001f) );
  444. }
  445. }
  446. TEST_CASE("sin", "[math][libm]")
  447. {
  448. bx::WriterI* writer = bx::getNullOut();
  449. bx::Error err;
  450. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  451. {
  452. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  453. REQUIRE(err.isOk() );
  454. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  455. }
  456. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  457. {
  458. bx::write(writer, &err, "sin(%f) == %f (expected: %f)\n", xx, bx::sin(xx), ::sinf(xx) );
  459. REQUIRE(err.isOk() );
  460. REQUIRE(bx::isEqual(bx::sin(xx), ::sinf(xx), 0.00001f) );
  461. }
  462. }
  463. TEST_CASE("sinCos", "[math][libm]")
  464. {
  465. bx::WriterI* writer = bx::getNullOut();
  466. bx::Error err;
  467. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  468. {
  469. float ss, cc;
  470. bx::sinCosApprox(ss, cc, xx);
  471. bx::write(writer, &err, "sinCos(%f) == sin %f (expected: %f)\n", xx, ss, ::sinf(xx) );
  472. bx::write(writer, &err, "sinCos(%f) == cos %f (expected: %f)\n", xx, cc, ::cosf(xx) );
  473. REQUIRE(err.isOk() );
  474. REQUIRE(bx::isEqual(ss, ::sinf(xx), 0.001f) );
  475. REQUIRE(bx::isEqual(cc, ::cosf(xx), 0.00001f) );
  476. }
  477. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  478. {
  479. float ss, cc;
  480. bx::sinCosApprox(ss, cc, xx);
  481. bx::write(writer, &err, "sinCos(%f) == sin %f (expected: %f)\n", xx, ss, ::sinf(xx) );
  482. bx::write(writer, &err, "sinCos(%f) == cos %f (expected: %f)\n", xx, cc, ::cosf(xx) );
  483. REQUIRE(err.isOk() );
  484. REQUIRE(bx::isEqual(ss, ::sinf(xx), 0.001f) );
  485. REQUIRE(bx::isEqual(cc, ::cosf(xx), 0.00001f) );
  486. }
  487. }
  488. TEST_CASE("sinh", "[math][libm]")
  489. {
  490. bx::WriterI* writer = bx::getNullOut();
  491. bx::Error err;
  492. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  493. {
  494. bx::write(writer, &err, "sinh(%f) == %f (expected: %f)\n", xx, bx::sinh(xx), ::sinhf(xx) );
  495. REQUIRE(err.isOk() );
  496. REQUIRE(bx::isEqual(bx::sinh(xx), ::sinhf(xx), 0.00001f) );
  497. }
  498. }
  499. TEST_CASE("acos", "[math][libm]")
  500. {
  501. bx::WriterI* writer = bx::getNullOut();
  502. bx::Error err;
  503. for (float xx = -1.0f; xx < 1.0f; xx += 0.001f)
  504. {
  505. bx::write(writer, &err, "acos(%f) == %f (expected: %f\n)", xx, bx::acos(xx), ::acosf(xx) );
  506. REQUIRE(err.isOk() );
  507. REQUIRE(bx::isEqual(bx::acos(xx), ::acosf(xx), 0.0001f) );
  508. }
  509. }
  510. TEST_CASE("cos", "[math][libm]")
  511. {
  512. bx::WriterI* writer = bx::getNullOut();
  513. bx::Error err;
  514. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  515. {
  516. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  517. REQUIRE(err.isOk() );
  518. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  519. }
  520. for (float xx = -bx::kPi2; xx < bx::kPi2; xx += 0.0001f)
  521. {
  522. bx::write(writer, &err, "cos(%f) == %f (expected: %f)\n", xx, bx::cos(xx), ::cosf(xx) );
  523. REQUIRE(err.isOk() );
  524. REQUIRE(bx::isEqual(bx::cos(xx), ::cosf(xx), 0.00001f) );
  525. }
  526. }
  527. TEST_CASE("tan", "[math][libm]")
  528. {
  529. bx::WriterI* writer = bx::getNullOut();
  530. bx::Error err;
  531. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  532. {
  533. bx::write(writer, &err, "tan(%f) == %f (expected: %f)\n", xx, bx::tan(xx), ::tanf(xx) );
  534. REQUIRE(err.isOk() );
  535. REQUIRE(bx::isEqual(bx::tan(xx), ::tanf(xx), 0.001f) );
  536. }
  537. }
  538. TEST_CASE("tanh", "[math][libm]")
  539. {
  540. bx::WriterI* writer = bx::getNullOut();
  541. bx::Error err;
  542. for (float xx = -1.0f; xx < 1.0f; xx += 0.1f)
  543. {
  544. bx::write(writer, &err, "tanh(%f) == %f (expected: %f\n", xx, bx::tanh(xx), ::tanhf(xx) );
  545. REQUIRE(err.isOk() );
  546. REQUIRE(bx::isEqual(bx::tanh(xx), ::tanhf(xx), 0.00001f) );
  547. }
  548. }
  549. TEST_CASE("atan", "[math][libm]")
  550. {
  551. bx::WriterI* writer = bx::getNullOut();
  552. bx::Error err;
  553. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  554. {
  555. bx::write(writer, &err, "atan(%f) == %f (expected: %f)\n", xx, bx::atan(xx), ::atanf(xx) );
  556. REQUIRE(err.isOk() );
  557. REQUIRE(bx::isEqual(bx::atan(xx), ::atanf(xx), 0.00001f) );
  558. }
  559. }
  560. TEST_CASE("atan2", "[math][libm]")
  561. {
  562. bx::WriterI* writer = bx::getNullOut();
  563. bx::Error err;
  564. REQUIRE(bx::isEqual(bx::atan2(0.0f, 0.0f), ::atan2f(0.0f, 0.0f), 0.00001f) );
  565. REQUIRE(bx::isEqual(bx::atan2(0.0f, 1.0f), ::atan2f(0.0f, 1.0f), 0.00001f) );
  566. REQUIRE(bx::isEqual(bx::atan2(0.0f, -1.0f), ::atan2f(0.0f, -1.0f), 0.00001f) );
  567. for (float yy = -100.0f; yy < 100.0f; yy += 0.1f)
  568. {
  569. for (float xx = -100.0f; xx < 100.0f; xx += 0.1f)
  570. {
  571. bx::write(writer, &err, "atan2(%f, %f) == %f (expected: %f)\n", yy, xx, bx::atan2(yy, xx), ::atan2f(yy, xx) );
  572. REQUIRE(err.isOk() );
  573. REQUIRE(bx::isEqual(bx::atan2(yy, xx), ::atan2f(yy, xx), 0.00001f) );
  574. }
  575. }
  576. }
  577. TEST_CASE("sign", "[math][libm]")
  578. {
  579. STATIC_REQUIRE(-1 == bx::sign(-0.1389f) );
  580. STATIC_REQUIRE( 0 == bx::sign( 0.0000f) );
  581. STATIC_REQUIRE( 1 == bx::sign( 0.1389f) );
  582. STATIC_REQUIRE(-1 == bx::sign(-bx::kFloatInfinity) );
  583. STATIC_REQUIRE( 1 == bx::sign( bx::kFloatInfinity) );
  584. }
  585. TEST_CASE("signBit", "[math][libm]")
  586. {
  587. STATIC_REQUIRE( bx::signBit(-0.1389f) );
  588. STATIC_REQUIRE(!bx::signBit( 0.0000f) );
  589. STATIC_REQUIRE(!bx::signBit( 0.1389f) );
  590. STATIC_REQUIRE( bx::signBit(-bx::kFloatInfinity) );
  591. STATIC_REQUIRE(!bx::signBit( bx::kFloatInfinity) );
  592. }
  593. TEST_CASE("copySign", "[math][libm]")
  594. {
  595. STATIC_REQUIRE( 0.1389f == bx::copySign(-0.1389f, +1389) );
  596. STATIC_REQUIRE(-0.0000f == bx::copySign( 0.0000f, -1389) );
  597. STATIC_REQUIRE(-0.1389f == bx::copySign( 0.1389f, -1389) );
  598. STATIC_REQUIRE(-bx::kFloatInfinity == bx::copySign(bx::kFloatInfinity, -1389) );
  599. }
  600. TEST_CASE("bitsToFloat, floatToBits, bitsToDouble, doubleToBits", "[math]")
  601. {
  602. STATIC_REQUIRE(0x12345678u == bx::floatToBits( bx::bitsToFloat (0x12345678u) ) );
  603. STATIC_REQUIRE(0x123456789abcdef0ull == bx::doubleToBits(bx::bitsToDouble(0x123456789abcdef0ull) ) );
  604. }
  605. TEST_CASE("lerp", "[math]")
  606. {
  607. STATIC_REQUIRE(1389.0f == bx::lerp(1389.0f, 1453.0f, 0.0f) );
  608. STATIC_REQUIRE(1453.0f == bx::lerp(1389.0f, 1453.0f, 1.0f) );
  609. STATIC_REQUIRE( 0.5f == bx::lerp( 0.0f, 1.0f, 0.5f) );
  610. STATIC_REQUIRE( 0.0f == bx::lerp( 0.0f, 0.0f, 0.5f) );
  611. }
  612. void mtxCheck(const float* _a, const float* _b)
  613. {
  614. if (!bx::isEqual(_a, _b, 16, 0.01f) )
  615. {
  616. DBG("\n"
  617. "A:\n"
  618. "%10.4f %10.4f %10.4f %10.4f\n"
  619. "%10.4f %10.4f %10.4f %10.4f\n"
  620. "%10.4f %10.4f %10.4f %10.4f\n"
  621. "%10.4f %10.4f %10.4f %10.4f\n"
  622. "B:\n"
  623. "%10.4f %10.4f %10.4f %10.4f\n"
  624. "%10.4f %10.4f %10.4f %10.4f\n"
  625. "%10.4f %10.4f %10.4f %10.4f\n"
  626. "%10.4f %10.4f %10.4f %10.4f\n"
  627. , _a[ 0], _a[ 1], _a[ 2], _a[ 3]
  628. , _a[ 4], _a[ 5], _a[ 6], _a[ 7]
  629. , _a[ 8], _a[ 9], _a[10], _a[11]
  630. , _a[12], _a[13], _a[14], _a[15]
  631. , _b[ 0], _b[ 1], _b[ 2], _b[ 3]
  632. , _b[ 4], _b[ 5], _b[ 6], _b[ 7]
  633. , _b[ 8], _b[ 9], _b[10], _b[11]
  634. , _b[12], _b[13], _b[14], _b[15]
  635. );
  636. REQUIRE(false);
  637. }
  638. }
  639. TEST_CASE("vec3", "[math][vec3]")
  640. {
  641. REQUIRE(bx::isEqual({0.0f, 0.0f, 0.0f}, bx::normalize({0.0f, 0.0f, 0.0f}), 0.0f) );
  642. bx::Vec3 normalized = bx::normalize({0.0f, 1.0f, 0.0f});
  643. REQUIRE(bx::isEqual(normalized, {0.0f, 1.0f, 0.0f}, 0.00001f) );
  644. float length = bx::length(normalized);
  645. REQUIRE(bx::isEqual(length, 1.0f, 0.00001f) );
  646. }
  647. TEST_CASE("quaternion", "[math][quaternion]")
  648. {
  649. float mtxQ[16];
  650. float mtx[16];
  651. bx::Quaternion quat = bx::InitIdentity;
  652. bx::Quaternion q2 = bx::InitNone;
  653. bx::Vec3 axis = bx::InitNone;
  654. bx::Vec3 euler = bx::InitNone;
  655. float angle;
  656. bx::mtxFromQuaternion(mtxQ, quat);
  657. bx::mtxIdentity(mtx);
  658. mtxCheck(mtxQ, mtx);
  659. float ax = bx::kPi/27.0f;
  660. float ay = bx::kPi/13.0f;
  661. float az = bx::kPi/7.0f;
  662. { // x
  663. quat = bx::rotateX(ax);
  664. bx::mtxFromQuaternion(mtxQ, quat);
  665. bx::mtxRotateX(mtx, ax);
  666. mtxCheck(mtxQ, mtx);
  667. bx::toAxisAngle(axis, angle, quat);
  668. REQUIRE(bx::isEqual(axis, bx::Vec3{1.0f, 0.0f, 0.0f}, 0.01f) );
  669. REQUIRE(bx::isEqual(angle, ax, 0.01f) );
  670. euler = bx::toEuler(quat);
  671. REQUIRE(bx::isEqual(euler.x, ax, 0.001f) );
  672. q2 = bx::fromEuler(euler);
  673. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  674. }
  675. { // y
  676. quat = bx::rotateY(ay);
  677. bx::mtxFromQuaternion(mtxQ, quat);
  678. bx::mtxRotateY(mtx, ay);
  679. mtxCheck(mtxQ, mtx);
  680. bx::toAxisAngle(axis, angle, quat);
  681. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 1.0f, 0.0f}, 0.01f) );
  682. REQUIRE(bx::isEqual(angle, ay, 0.01f) );
  683. euler = bx::toEuler(quat);
  684. REQUIRE(bx::isEqual(euler.y, ay, 0.001f) );
  685. q2 = bx::fromEuler(euler);
  686. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  687. }
  688. { // z
  689. quat = bx::rotateZ(az);
  690. bx::mtxFromQuaternion(mtxQ, quat);
  691. bx::mtxRotateZ(mtx, az);
  692. mtxCheck(mtxQ, mtx);
  693. bx::toAxisAngle(axis, angle, quat);
  694. REQUIRE(bx::isEqual(axis, bx::Vec3{0.0f, 0.0f, 1.0f}, 0.01f) );
  695. REQUIRE(bx::isEqual(angle, az, 0.01f) );
  696. euler = bx::toEuler(quat);
  697. REQUIRE(bx::isEqual(euler.z, az, 0.001f) );
  698. q2 = bx::fromEuler(euler);
  699. REQUIRE(bx::isEqual(quat, q2, 0.001f) );
  700. }
  701. }
  702. TEST_CASE("limits", "[math]")
  703. {
  704. STATIC_REQUIRE(bx::LimitsT<int8_t>::min == INT8_MIN);
  705. STATIC_REQUIRE(bx::LimitsT<int8_t>::max == INT8_MAX);
  706. STATIC_REQUIRE(bx::LimitsT<signed char>::min == CHAR_MIN);
  707. STATIC_REQUIRE(bx::LimitsT<signed char>::max == CHAR_MAX);
  708. STATIC_REQUIRE(bx::LimitsT<unsigned char>::min == 0);
  709. STATIC_REQUIRE(bx::LimitsT<unsigned char>::max == UCHAR_MAX);
  710. STATIC_REQUIRE(bx::LimitsT<int16_t>::min == INT16_MIN);
  711. STATIC_REQUIRE(bx::LimitsT<int16_t>::max == INT16_MAX);
  712. STATIC_REQUIRE(bx::LimitsT<uint16_t>::min == 0);
  713. STATIC_REQUIRE(bx::LimitsT<uint16_t>::max == UINT16_MAX);
  714. STATIC_REQUIRE(bx::LimitsT<int32_t>::min == INT32_MIN);
  715. STATIC_REQUIRE(bx::LimitsT<int32_t>::max == INT32_MAX);
  716. STATIC_REQUIRE(bx::LimitsT<uint32_t>::min == 0);
  717. STATIC_REQUIRE(bx::LimitsT<uint32_t>::max == UINT32_MAX);
  718. STATIC_REQUIRE(bx::LimitsT<int64_t>::min == INT64_MIN);
  719. STATIC_REQUIRE(bx::LimitsT<int64_t>::max == INT64_MAX);
  720. STATIC_REQUIRE(bx::LimitsT<uint64_t>::min == 0);
  721. STATIC_REQUIRE(bx::LimitsT<uint64_t>::max == UINT64_MAX);
  722. STATIC_REQUIRE(bx::LimitsT<float>::min == std::numeric_limits<float>::lowest() );
  723. STATIC_REQUIRE(bx::LimitsT<float>::max == std::numeric_limits<float>::max() );
  724. STATIC_REQUIRE(bx::LimitsT<double>::min == std::numeric_limits<double>::lowest() );
  725. STATIC_REQUIRE(bx::LimitsT<double>::max == std::numeric_limits<double>::max() );
  726. STATIC_REQUIRE(bx::kFloatSmallest == std::numeric_limits<float>::min() );
  727. STATIC_REQUIRE(bx::kDoubleSmallest == std::numeric_limits<double>::min() );
  728. }