math_test.cpp 22 KB

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