gtc_packing.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  1. ///////////////////////////////////////////////////////////////////////////////////
  2. /// OpenGL Mathematics (glm.g-truc.net)
  3. ///
  4. /// Copyright (c) 2005 - 2015 G-Truc Creation (www.g-truc.net)
  5. /// Permission is hereby granted, free of charge, to any person obtaining a copy
  6. /// of this software and associated documentation files (the "Software"), to deal
  7. /// in the Software without restriction, including without limitation the rights
  8. /// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  9. /// copies of the Software, and to permit persons to whom the Software is
  10. /// furnished to do so, subject to the following conditions:
  11. ///
  12. /// The above copyright notice and this permission notice shall be included in
  13. /// all copies or substantial portions of the Software.
  14. ///
  15. /// Restrictions:
  16. /// By making use of the Software for military purposes, you choose to make
  17. /// a Bunny unhappy.
  18. ///
  19. /// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. /// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. /// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. /// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. /// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. /// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. /// THE SOFTWARE.
  26. ///
  27. /// @file test/gtc/gtc_packing.cpp
  28. /// @date 2013-08-09 / 2014-11-25
  29. /// @author Christophe Riccio
  30. ///////////////////////////////////////////////////////////////////////////////////
  31. #include <glm/gtc/packing.hpp>
  32. #include <glm/gtc/epsilon.hpp>
  33. #include <cstdio>
  34. #include <vector>
  35. void print_bits(float const & s)
  36. {
  37. union
  38. {
  39. float f;
  40. unsigned int i;
  41. } uif;
  42. uif.f = s;
  43. printf("f32: ");
  44. for(std::size_t j = sizeof(s) * 8; j > 0; --j)
  45. {
  46. if(j == 23 || j == 31)
  47. printf(" ");
  48. printf("%d", (uif.i & (1 << (j - 1))) ? 1 : 0);
  49. }
  50. }
  51. void print_10bits(glm::uint const & s)
  52. {
  53. printf("10b: ");
  54. for(std::size_t j = 10; j > 0; --j)
  55. {
  56. if(j == 5)
  57. printf(" ");
  58. printf("%d", (s & (1 << (j - 1))) ? 1 : 0);
  59. }
  60. }
  61. void print_11bits(glm::uint const & s)
  62. {
  63. printf("11b: ");
  64. for(std::size_t j = 11; j > 0; --j)
  65. {
  66. if(j == 6)
  67. printf(" ");
  68. printf("%d", (s & (1 << (j - 1))) ? 1 : 0);
  69. }
  70. }
  71. void print_value(float const & s)
  72. {
  73. printf("%2.5f, ", s);
  74. print_bits(s);
  75. printf(", ");
  76. // print_11bits(detail::floatTo11bit(s));
  77. // printf(", ");
  78. // print_10bits(detail::floatTo10bit(s));
  79. printf("\n");
  80. }
  81. int test_Half1x16()
  82. {
  83. int Error = 0;
  84. std::vector<float> Tests;
  85. Tests.push_back(0.0f);
  86. Tests.push_back(1.0f);
  87. Tests.push_back(-1.0f);
  88. Tests.push_back(2.0f);
  89. Tests.push_back(-2.0f);
  90. Tests.push_back(1.9f);
  91. for(std::size_t i = 0; i < Tests.size(); ++i)
  92. {
  93. glm::uint32 p0 = glm::packHalf1x16(Tests[i]);
  94. float v0 = glm::unpackHalf1x16(p0);
  95. glm::uint32 p1 = glm::packHalf1x16(v0);
  96. float v1 = glm::unpackHalf1x16(p1);
  97. Error += (v0 == v1) ? 0 : 1;
  98. }
  99. return Error;
  100. }
  101. int test_Half4x16()
  102. {
  103. int Error = 0;
  104. std::vector<glm::vec4> Tests;
  105. Tests.push_back(glm::vec4(1.0f));
  106. Tests.push_back(glm::vec4(0.0f));
  107. Tests.push_back(glm::vec4(2.0f));
  108. Tests.push_back(glm::vec4(0.1f));
  109. Tests.push_back(glm::vec4(0.5f));
  110. Tests.push_back(glm::vec4(-0.9f));
  111. for(std::size_t i = 0; i < Tests.size(); ++i)
  112. {
  113. glm::uint64 p0 = glm::packHalf4x16(Tests[i]);
  114. glm::vec4 v0 = glm::unpackHalf4x16(p0);
  115. glm::uint64 p1 = glm::packHalf4x16(v0);
  116. glm::vec4 v1 = glm::unpackHalf4x16(p1);
  117. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  118. }
  119. return Error;
  120. }
  121. int test_I3x10_1x2()
  122. {
  123. int Error = 0;
  124. std::vector<glm::ivec4> Tests;
  125. Tests.push_back(glm::ivec4(0));
  126. Tests.push_back(glm::ivec4(1));
  127. Tests.push_back(glm::ivec4(-1));
  128. Tests.push_back(glm::ivec4(2));
  129. Tests.push_back(glm::ivec4(-2));
  130. Tests.push_back(glm::ivec4(3));
  131. for(std::size_t i = 0; i < Tests.size(); ++i)
  132. {
  133. glm::uint32 p0 = glm::packI3x10_1x2(Tests[i]);
  134. glm::ivec4 v0 = glm::unpackI3x10_1x2(p0);
  135. glm::uint32 p1 = glm::packI3x10_1x2(v0);
  136. glm::ivec4 v1 = glm::unpackI3x10_1x2(p1);
  137. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  138. }
  139. return Error;
  140. }
  141. int test_U3x10_1x2()
  142. {
  143. int Error = 0;
  144. std::vector<glm::uvec4> Tests;
  145. Tests.push_back(glm::uvec4(0));
  146. Tests.push_back(glm::uvec4(1));
  147. Tests.push_back(glm::uvec4(2));
  148. Tests.push_back(glm::uvec4(3));
  149. Tests.push_back(glm::uvec4(4));
  150. Tests.push_back(glm::uvec4(5));
  151. for(std::size_t i = 0; i < Tests.size(); ++i)
  152. {
  153. glm::uint32 p0 = glm::packU3x10_1x2(Tests[i]);
  154. glm::uvec4 v0 = glm::unpackU3x10_1x2(p0);
  155. glm::uint32 p1 = glm::packU3x10_1x2(v0);
  156. glm::uvec4 v1 = glm::unpackU3x10_1x2(p1);
  157. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  158. }
  159. return Error;
  160. }
  161. int test_Snorm3x10_1x2()
  162. {
  163. int Error = 0;
  164. std::vector<glm::vec4> Tests;
  165. Tests.push_back(glm::vec4(1.0f));
  166. Tests.push_back(glm::vec4(0.0f));
  167. Tests.push_back(glm::vec4(2.0f));
  168. Tests.push_back(glm::vec4(0.1f));
  169. Tests.push_back(glm::vec4(0.5f));
  170. Tests.push_back(glm::vec4(0.9f));
  171. for(std::size_t i = 0; i < Tests.size(); ++i)
  172. {
  173. glm::uint32 p0 = glm::packSnorm3x10_1x2(Tests[i]);
  174. glm::vec4 v0 = glm::unpackSnorm3x10_1x2(p0);
  175. glm::uint32 p1 = glm::packSnorm3x10_1x2(v0);
  176. glm::vec4 v1 = glm::unpackSnorm3x10_1x2(p1);
  177. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  178. }
  179. return Error;
  180. }
  181. int test_Unorm3x10_1x2()
  182. {
  183. int Error = 0;
  184. std::vector<glm::vec4> Tests;
  185. Tests.push_back(glm::vec4(1.0f));
  186. Tests.push_back(glm::vec4(0.0f));
  187. Tests.push_back(glm::vec4(2.0f));
  188. Tests.push_back(glm::vec4(0.1f));
  189. Tests.push_back(glm::vec4(0.5f));
  190. Tests.push_back(glm::vec4(0.9f));
  191. for(std::size_t i = 0; i < Tests.size(); ++i)
  192. {
  193. glm::uint32 p0 = glm::packSnorm3x10_1x2(Tests[i]);
  194. glm::vec4 v0 = glm::unpackSnorm3x10_1x2(p0);
  195. glm::uint32 p1 = glm::packSnorm3x10_1x2(v0);
  196. glm::vec4 v1 = glm::unpackSnorm3x10_1x2(p1);
  197. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  198. }
  199. return Error;
  200. }
  201. int test_F2x11_1x10()
  202. {
  203. int Error = 0;
  204. std::vector<glm::vec3> Tests;
  205. Tests.push_back(glm::vec3(1.0f));
  206. Tests.push_back(glm::vec3(0.0f));
  207. Tests.push_back(glm::vec3(2.0f));
  208. Tests.push_back(glm::vec3(0.1f));
  209. Tests.push_back(glm::vec3(0.5f));
  210. Tests.push_back(glm::vec3(0.9f));
  211. for(std::size_t i = 0; i < Tests.size(); ++i)
  212. {
  213. glm::uint32 p0 = glm::packF2x11_1x10(Tests[i]);
  214. glm::vec3 v0 = glm::unpackF2x11_1x10(p0);
  215. glm::uint32 p1 = glm::packF2x11_1x10(v0);
  216. glm::vec3 v1 = glm::unpackF2x11_1x10(p1);
  217. Error += glm::all(glm::equal(v0, v1)) ? 0 : 1;
  218. }
  219. return Error;
  220. }
  221. int test_packUnorm1x16()
  222. {
  223. int Error = 0;
  224. std::vector<glm::vec1> A;
  225. A.push_back(glm::vec1(1.0f));
  226. A.push_back(glm::vec1(0.5f));
  227. A.push_back(glm::vec1(0.1f));
  228. A.push_back(glm::vec1(0.0f));
  229. for(std::size_t i = 0; i < A.size(); ++i)
  230. {
  231. glm::vec1 B(A[i]);
  232. glm::uint32 C = glm::packUnorm1x16(B.x);
  233. glm::vec1 D(glm::unpackUnorm1x16(C));
  234. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 65535.f)) ? 0 : 1;
  235. assert(!Error);
  236. }
  237. return Error;
  238. }
  239. int test_packSnorm1x16()
  240. {
  241. int Error = 0;
  242. std::vector<glm::vec1> A;
  243. A.push_back(glm::vec1( 1.0f));
  244. A.push_back(glm::vec1( 0.0f));
  245. A.push_back(glm::vec1(-0.5f));
  246. A.push_back(glm::vec1(-0.1f));
  247. for(std::size_t i = 0; i < A.size(); ++i)
  248. {
  249. glm::vec1 B(A[i]);
  250. glm::uint32 C = glm::packSnorm1x16(B.x);
  251. glm::vec1 D(glm::unpackSnorm1x16(C));
  252. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 32767.0f * 2.0f)) ? 0 : 1;
  253. }
  254. return Error;
  255. }
  256. int test_packUnorm2x16()
  257. {
  258. int Error = 0;
  259. std::vector<glm::vec2> A;
  260. A.push_back(glm::vec2(1.0f, 0.0f));
  261. A.push_back(glm::vec2(0.5f, 0.7f));
  262. A.push_back(glm::vec2(0.1f, 0.2f));
  263. for(std::size_t i = 0; i < A.size(); ++i)
  264. {
  265. glm::vec2 B(A[i]);
  266. glm::uint32 C = glm::packUnorm2x16(B);
  267. glm::vec2 D = glm::unpackUnorm2x16(C);
  268. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 65535.f)) ? 0 : 1;
  269. assert(!Error);
  270. }
  271. return Error;
  272. }
  273. int test_packSnorm2x16()
  274. {
  275. int Error = 0;
  276. std::vector<glm::vec2> A;
  277. A.push_back(glm::vec2( 1.0f, 0.0f));
  278. A.push_back(glm::vec2(-0.5f,-0.7f));
  279. A.push_back(glm::vec2(-0.1f, 0.1f));
  280. for(std::size_t i = 0; i < A.size(); ++i)
  281. {
  282. glm::vec2 B(A[i]);
  283. glm::uint32 C = glm::packSnorm2x16(B);
  284. glm::vec2 D = glm::unpackSnorm2x16(C);
  285. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 32767.0f * 2.0f)) ? 0 : 1;
  286. assert(!Error);
  287. }
  288. return Error;
  289. }
  290. int test_packUnorm4x16()
  291. {
  292. int Error = 0;
  293. std::vector<glm::vec4> A;
  294. A.push_back(glm::vec4(1.0f));
  295. A.push_back(glm::vec4(0.5f));
  296. A.push_back(glm::vec4(0.1f));
  297. A.push_back(glm::vec4(0.0f));
  298. for(std::size_t i = 0; i < A.size(); ++i)
  299. {
  300. glm::vec4 B(A[i]);
  301. glm::uint64 C = glm::packUnorm4x16(B);
  302. glm::vec4 D(glm::unpackUnorm4x16(C));
  303. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 65535.f)) ? 0 : 1;
  304. assert(!Error);
  305. }
  306. return Error;
  307. }
  308. int test_packSnorm4x16()
  309. {
  310. int Error = 0;
  311. std::vector<glm::vec4> A;
  312. A.push_back(glm::vec4( 1.0f, 0.0f, -0.5f, 0.5f));
  313. A.push_back(glm::vec4(-0.3f,-0.7f, 0.3f, 0.7f));
  314. A.push_back(glm::vec4(-0.1f, 0.1f, -0.2f, 0.2f));
  315. for(std::size_t i = 0; i < A.size(); ++i)
  316. {
  317. glm::vec4 B(A[i]);
  318. glm::uint64 C = glm::packSnorm4x16(B);
  319. glm::vec4 D(glm::unpackSnorm4x16(C));
  320. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 32767.0f * 2.0f)) ? 0 : 1;
  321. assert(!Error);
  322. }
  323. return Error;
  324. }
  325. int test_packUnorm1x8()
  326. {
  327. int Error = 0;
  328. std::vector<glm::vec1> A;
  329. A.push_back(glm::vec1(1.0f));
  330. A.push_back(glm::vec1(0.5f));
  331. A.push_back(glm::vec1(0.0f));
  332. for(std::size_t i = 0; i < A.size(); ++i)
  333. {
  334. glm::vec1 B(A[i]);
  335. glm::uint16 C = glm::packUnorm1x8(B.x);
  336. glm::vec1 D(glm::unpackUnorm1x8(C));
  337. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 255.f)) ? 0 : 1;
  338. assert(!Error);
  339. }
  340. return Error;
  341. }
  342. int test_packSnorm1x8()
  343. {
  344. int Error = 0;
  345. std::vector<glm::vec1> A;
  346. A.push_back(glm::vec1( 1.0f));
  347. A.push_back(glm::vec1(-0.7f));
  348. for(std::size_t i = 0; i < A.size(); ++i)
  349. {
  350. glm::vec1 B(A[i]);
  351. glm::uint16 C = glm::packSnorm1x8(B.x);
  352. glm::vec1 D(glm::unpackSnorm1x8(C));
  353. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 127.f)) ? 0 : 1;
  354. }
  355. return Error;
  356. }
  357. int test_packUnorm2x8()
  358. {
  359. int Error = 0;
  360. std::vector<glm::vec2> A;
  361. A.push_back(glm::vec2(1.0f, 0.7f));
  362. A.push_back(glm::vec2(0.5f, 0.1f));
  363. for(std::size_t i = 0; i < A.size(); ++i)
  364. {
  365. glm::vec2 B(A[i]);
  366. glm::uint16 C = glm::packUnorm2x8(B);
  367. glm::vec2 D = glm::unpackUnorm2x8(C);
  368. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 255.f)) ? 0 : 1;
  369. assert(!Error);
  370. }
  371. return Error;
  372. }
  373. int test_packSnorm2x8()
  374. {
  375. int Error = 0;
  376. std::vector<glm::vec2> A;
  377. A.push_back(glm::vec2( 1.0f, 0.0f));
  378. A.push_back(glm::vec2(-0.7f,-0.1f));
  379. for(std::size_t i = 0; i < A.size(); ++i)
  380. {
  381. glm::vec2 B(A[i]);
  382. glm::uint16 C = glm::packSnorm2x8(B);
  383. glm::vec2 D = glm::unpackSnorm2x8(C);
  384. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 127.f)) ? 0 : 1;
  385. }
  386. return Error;
  387. }
  388. int test_packUnorm4x8()
  389. {
  390. int Error = 0;
  391. std::vector<glm::vec4> A;
  392. A.push_back(glm::vec4(1.0f, 0.7f, 0.3f, 0.0f));
  393. A.push_back(glm::vec4(0.5f, 0.1f, 0.2f, 0.3f));
  394. for(std::size_t i = 0; i < A.size(); ++i)
  395. {
  396. glm::vec4 B(A[i]);
  397. glm::uint32 C = glm::packUnorm4x8(B);
  398. glm::vec4 D = glm::unpackUnorm4x8(C);
  399. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 255.f)) ? 0 : 1;
  400. assert(!Error);
  401. }
  402. return Error;
  403. }
  404. int test_packSnorm4x8()
  405. {
  406. int Error = 0;
  407. std::vector<glm::vec4> A;
  408. A.push_back(glm::vec4( 1.0f, 0.0f,-0.5f,-1.0f));
  409. A.push_back(glm::vec4(-0.7f,-0.1f, 0.1f, 0.7f));
  410. for(std::size_t i = 0; i < A.size(); ++i)
  411. {
  412. glm::vec4 B(A[i]);
  413. glm::uint32 C = glm::packSnorm4x8(B);
  414. glm::vec4 D = glm::unpackSnorm4x8(C);
  415. Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 127.f)) ? 0 : 1;
  416. assert(!Error);
  417. }
  418. return Error;
  419. }
  420. int main()
  421. {
  422. int Error(0);
  423. Error += test_packSnorm1x16();
  424. Error += test_packSnorm2x16();
  425. Error += test_packSnorm4x16();
  426. Error += test_packSnorm1x8();
  427. Error += test_packSnorm2x8();
  428. Error += test_packSnorm4x8();
  429. Error += test_packUnorm1x16();
  430. Error += test_packUnorm2x16();
  431. Error += test_packUnorm4x16();
  432. Error += test_packUnorm1x8();
  433. Error += test_packUnorm2x8();
  434. Error += test_packUnorm4x8();
  435. Error += test_F2x11_1x10();
  436. Error += test_Snorm3x10_1x2();
  437. Error += test_Unorm3x10_1x2();
  438. Error += test_I3x10_1x2();
  439. Error += test_U3x10_1x2();
  440. Error += test_Half1x16();
  441. Error += test_U3x10_1x2();
  442. return Error;
  443. }