core_func_integer.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489
  1. ///////////////////////////////////////////////////////////////////////////////////////////////////
  2. // OpenGL Mathematics Copyright (c) 2005 - 2014 G-Truc Creation (www.g-truc.net)
  3. ///////////////////////////////////////////////////////////////////////////////////////////////////
  4. // Created : 2011-05-03
  5. // Updated : 2011-05-03
  6. // Licence : This source is under MIT licence
  7. // File : test/core/func_integer.cpp
  8. ///////////////////////////////////////////////////////////////////////////////////////////////////
  9. #include <glm/integer.hpp>
  10. #include <glm/gtc/vec1.hpp>
  11. #include <iostream>
  12. enum result
  13. {
  14. SUCCESS,
  15. FAIL,
  16. ASSERT,
  17. STATIC_ASSERT
  18. };
  19. namespace bitfieldExtract
  20. {
  21. template <typename genType, typename sizeType>
  22. struct type
  23. {
  24. genType Value;
  25. sizeType BitFirst;
  26. sizeType BitCount;
  27. genType Return;
  28. result Result;
  29. };
  30. typedef type<glm::uint, glm::uint> typeU32;
  31. typeU32 const Data32[] =
  32. {
  33. {0xffffffff, 8, 0, 0x00000000, SUCCESS},
  34. {0x00000000, 0,32, 0x00000000, SUCCESS},
  35. {0xffffffff, 0,32, 0xffffffff, SUCCESS},
  36. {0x0f0f0f0f, 0,32, 0x0f0f0f0f, SUCCESS},
  37. {0x00000000, 8, 0, 0x00000000, SUCCESS},
  38. {0x80000000,31, 1, 0x00000001, SUCCESS},
  39. {0x7fffffff,31, 1, 0x00000000, SUCCESS},
  40. {0x00000300, 8, 8, 0x00000003, SUCCESS},
  41. {0x0000ff00, 8, 8, 0x000000ff, SUCCESS},
  42. {0xfffffff0, 0, 5, 0x00000010, SUCCESS},
  43. {0x000000ff, 1, 3, 0x00000007, SUCCESS},
  44. {0x000000ff, 0, 3, 0x00000007, SUCCESS},
  45. {0x00000000, 0, 2, 0x00000000, SUCCESS},
  46. {0xffffffff, 0, 8, 0x000000ff, SUCCESS},
  47. {0xffff0000,16,16, 0x0000ffff, SUCCESS},
  48. {0xfffffff0, 0, 8, 0x00000000, FAIL},
  49. {0xffffffff,16,16, 0x00000000, FAIL},
  50. //{0xffffffff,32, 1, 0x00000000, ASSERT}, // Throw an assert
  51. //{0xffffffff, 0,33, 0x00000000, ASSERT}, // Throw an assert
  52. //{0xffffffff,16,16, 0x00000000, ASSERT}, // Throw an assert
  53. };
  54. int test()
  55. {
  56. glm::uint count = sizeof(Data32) / sizeof(typeU32);
  57. for(glm::uint i = 0; i < count; ++i)
  58. {
  59. glm::uint Return = glm::bitfieldExtract(
  60. Data32[i].Value,
  61. Data32[i].BitFirst,
  62. Data32[i].BitCount);
  63. bool Compare = Data32[i].Return == Return;
  64. if(Data32[i].Result == SUCCESS && Compare)
  65. continue;
  66. else if(Data32[i].Result == FAIL && !Compare)
  67. continue;
  68. std::cout << "glm::bitfieldExtract test fail on test " << i << std::endl;
  69. return 1;
  70. }
  71. return 0;
  72. }
  73. }//extractField
  74. namespace bitfieldReverse
  75. {
  76. template <typename genType>
  77. struct type
  78. {
  79. genType Value;
  80. genType Return;
  81. result Result;
  82. };
  83. typedef type<glm::uint> typeU32;
  84. typeU32 const Data32[] =
  85. {
  86. {0xffffffff, 0xffffffff, SUCCESS},
  87. {0x00000000, 0x00000000, SUCCESS},
  88. {0xf0000000, 0x0000000f, SUCCESS},
  89. };
  90. int test()
  91. {
  92. glm::uint count = sizeof(Data32) / sizeof(typeU32);
  93. for(glm::uint i = 0; i < count; ++i)
  94. {
  95. glm::uint Return = glm::bitfieldReverse(
  96. Data32[i].Value);
  97. bool Compare = Data32[i].Return == Return;
  98. if(Data32[i].Result == SUCCESS && Compare)
  99. continue;
  100. else if(Data32[i].Result == FAIL && !Compare)
  101. continue;
  102. std::cout << "glm::bitfieldReverse test fail on test " << i << std::endl;
  103. return 1;
  104. }
  105. return 0;
  106. }
  107. }//bitRevert
  108. namespace findMSB
  109. {
  110. template <typename genType>
  111. struct type
  112. {
  113. genType Value;
  114. genType Return;
  115. };
  116. type<int> const DataI32[] =
  117. {
  118. {0x00000000, -1},
  119. {0x00000001, 0},
  120. {0x00000002, 1},
  121. {0x00000003, 1},
  122. {0x00000004, 2},
  123. {0x00000005, 2},
  124. {0x00000007, 2},
  125. {0x00000008, 3},
  126. {0x00000010, 4},
  127. {0x00000020, 5},
  128. {0x00000040, 6},
  129. {0x00000080, 7},
  130. {0x00000100, 8},
  131. {0x00000200, 9},
  132. {0x00000400, 10},
  133. {0x00000800, 11},
  134. {0x00001000, 12},
  135. {0x00002000, 13},
  136. {0x00004000, 14},
  137. {0x00008000, 15},
  138. {0x00010000, 16},
  139. {0x00020000, 17},
  140. {0x00040000, 18},
  141. {0x00080000, 19},
  142. {0x00100000, 20},
  143. {0x00200000, 21},
  144. {0x00400000, 22},
  145. {0x00800000, 23},
  146. {0x01000000, 24},
  147. {0x02000000, 25},
  148. {0x04000000, 26},
  149. {0x08000000, 27},
  150. {0x10000000, 28},
  151. {0x20000000, 29},
  152. {0x40000000, 30}
  153. };
  154. int test()
  155. {
  156. int Error(0);
  157. for(std::size_t i = 0; i < sizeof(DataI32) / sizeof(type<int>); ++i)
  158. {
  159. int Result = glm::findMSB(DataI32[i].Value);
  160. Error += DataI32[i].Return == Result ? 0 : 1;
  161. assert(!Error);
  162. }
  163. return Error;
  164. }
  165. }//findMSB
  166. namespace findLSB
  167. {
  168. template <typename genType>
  169. struct type
  170. {
  171. genType Value;
  172. genType Return;
  173. };
  174. type<int> const DataI32[] =
  175. {
  176. {0x00000001, 0},
  177. {0x00000003, 0},
  178. {0x00000002, 1}
  179. };
  180. int test()
  181. {
  182. int Error(0);
  183. for(std::size_t i = 0; i < sizeof(DataI32) / sizeof(type<int>); ++i)
  184. {
  185. int Result = glm::findLSB(DataI32[i].Value);
  186. Error += DataI32[i].Return == Result ? 0 : 1;
  187. assert(!Error);
  188. }
  189. return Error;
  190. }
  191. }//findLSB
  192. namespace uaddCarry
  193. {
  194. int test()
  195. {
  196. int Error(0);
  197. {
  198. glm::uint x = 16;
  199. glm::uint y = 17;
  200. glm::uint Carry = 0;
  201. glm::uint Result = glm::uaddCarry(x, y, Carry);
  202. Error += Carry == 1 ? 0 : 1;
  203. Error += Result == 33 ? 0 : 1;
  204. }
  205. {
  206. glm::uvec1 x(16);
  207. glm::uvec1 y(17);
  208. glm::uvec1 Carry(0);
  209. glm::uvec1 Result(glm::uaddCarry(x, y, Carry));
  210. Error += glm::all(glm::equal(Carry, glm::uvec1(1))) ? 0 : 1;
  211. Error += glm::all(glm::equal(Result, glm::uvec1(33))) ? 0 : 1;
  212. }
  213. {
  214. glm::uvec2 x(16);
  215. glm::uvec2 y(17);
  216. glm::uvec2 Carry(0);
  217. glm::uvec2 Result(glm::uaddCarry(x, y, Carry));
  218. Error += glm::all(glm::equal(Carry, glm::uvec2(1))) ? 0 : 1;
  219. Error += glm::all(glm::equal(Result, glm::uvec2(33))) ? 0 : 1;
  220. }
  221. {
  222. glm::uvec3 x(16);
  223. glm::uvec3 y(17);
  224. glm::uvec3 Carry(0);
  225. glm::uvec3 Result(glm::uaddCarry(x, y, Carry));
  226. Error += glm::all(glm::equal(Carry, glm::uvec3(1))) ? 0 : 1;
  227. Error += glm::all(glm::equal(Result, glm::uvec3(33))) ? 0 : 1;
  228. }
  229. {
  230. glm::uvec4 x(16);
  231. glm::uvec4 y(17);
  232. glm::uvec4 Carry(0);
  233. glm::uvec4 Result(glm::uaddCarry(x, y, Carry));
  234. Error += glm::all(glm::equal(Carry, glm::uvec4(1))) ? 0 : 1;
  235. Error += glm::all(glm::equal(Result, glm::uvec4(33))) ? 0 : 1;
  236. }
  237. return Error;
  238. }
  239. }//namespace uaddCarry
  240. namespace usubBorrow
  241. {
  242. int test()
  243. {
  244. int Error(0);
  245. {
  246. glm::uint x = 16;
  247. glm::uint y = 17;
  248. glm::uint Borrow = 0;
  249. glm::uint Result = glm::usubBorrow(x, y, Borrow);
  250. Error += Borrow == 1 ? 0 : 1;
  251. Error += Result == 1 ? 0 : 1;
  252. }
  253. {
  254. glm::uvec1 x(16);
  255. glm::uvec1 y(17);
  256. glm::uvec1 Borrow(0);
  257. glm::uvec1 Result(glm::usubBorrow(x, y, Borrow));
  258. Error += glm::all(glm::equal(Borrow, glm::uvec1(1))) ? 0 : 1;
  259. Error += glm::all(glm::equal(Result, glm::uvec1(1))) ? 0 : 1;
  260. }
  261. {
  262. glm::uvec2 x(16);
  263. glm::uvec2 y(17);
  264. glm::uvec2 Borrow(0);
  265. glm::uvec2 Result(glm::usubBorrow(x, y, Borrow));
  266. Error += glm::all(glm::equal(Borrow, glm::uvec2(1))) ? 0 : 1;
  267. Error += glm::all(glm::equal(Result, glm::uvec2(1))) ? 0 : 1;
  268. }
  269. {
  270. glm::uvec3 x(16);
  271. glm::uvec3 y(17);
  272. glm::uvec3 Borrow(0);
  273. glm::uvec3 Result(glm::usubBorrow(x, y, Borrow));
  274. Error += glm::all(glm::equal(Borrow, glm::uvec3(1))) ? 0 : 1;
  275. Error += glm::all(glm::equal(Result, glm::uvec3(1))) ? 0 : 1;
  276. }
  277. {
  278. glm::uvec4 x(16);
  279. glm::uvec4 y(17);
  280. glm::uvec4 Borrow(0);
  281. glm::uvec4 Result(glm::usubBorrow(x, y, Borrow));
  282. Error += glm::all(glm::equal(Borrow, glm::uvec4(1))) ? 0 : 1;
  283. Error += glm::all(glm::equal(Result, glm::uvec4(1))) ? 0 : 1;
  284. }
  285. return Error;
  286. }
  287. }//namespace usubBorrow
  288. namespace umulExtended
  289. {
  290. int test()
  291. {
  292. int Error(0);
  293. {
  294. glm::uint x = 2;
  295. glm::uint y = 3;
  296. glm::uint msb = 0;
  297. glm::uint lsb = 0;
  298. glm::umulExtended(x, y, msb, lsb);
  299. Error += msb == 0 ? 0 : 1;
  300. Error += lsb == 6 ? 0 : 1;
  301. }
  302. {
  303. glm::uvec1 x(2);
  304. glm::uvec1 y(3);
  305. glm::uvec1 msb(0);
  306. glm::uvec1 lsb(0);
  307. glm::umulExtended(x, y, msb, lsb);
  308. Error += glm::all(glm::equal(msb, glm::uvec1(0))) ? 0 : 1;
  309. Error += glm::all(glm::equal(lsb, glm::uvec1(6))) ? 0 : 1;
  310. }
  311. {
  312. glm::uvec2 x(2);
  313. glm::uvec2 y(3);
  314. glm::uvec2 msb(0);
  315. glm::uvec2 lsb(0);
  316. glm::umulExtended(x, y, msb, lsb);
  317. Error += glm::all(glm::equal(msb, glm::uvec2(0))) ? 0 : 1;
  318. Error += glm::all(glm::equal(lsb, glm::uvec2(6))) ? 0 : 1;
  319. }
  320. {
  321. glm::uvec3 x(2);
  322. glm::uvec3 y(3);
  323. glm::uvec3 msb(0);
  324. glm::uvec3 lsb(0);
  325. glm::umulExtended(x, y, msb, lsb);
  326. Error += glm::all(glm::equal(msb, glm::uvec3(0))) ? 0 : 1;
  327. Error += glm::all(glm::equal(lsb, glm::uvec3(6))) ? 0 : 1;
  328. }
  329. {
  330. glm::uvec4 x(2);
  331. glm::uvec4 y(3);
  332. glm::uvec4 msb(0);
  333. glm::uvec4 lsb(0);
  334. glm::umulExtended(x, y, msb, lsb);
  335. Error += glm::all(glm::equal(msb, glm::uvec4(0))) ? 0 : 1;
  336. Error += glm::all(glm::equal(lsb, glm::uvec4(6))) ? 0 : 1;
  337. }
  338. return Error;
  339. }
  340. }//namespace umulExtended
  341. namespace imulExtended
  342. {
  343. int test()
  344. {
  345. int Error(0);
  346. {
  347. int x = 2;
  348. int y = 3;
  349. int msb = 0;
  350. int lsb = 0;
  351. glm::imulExtended(x, y, msb, lsb);
  352. Error += msb == 0 ? 0 : 1;
  353. Error += lsb == 6 ? 0 : 1;
  354. }
  355. {
  356. glm::ivec1 x(2);
  357. glm::ivec1 y(3);
  358. glm::ivec1 msb(0);
  359. glm::ivec1 lsb(0);
  360. glm::imulExtended(x, y, msb, lsb);
  361. Error += glm::all(glm::equal(msb, glm::ivec1(0))) ? 0 : 1;
  362. Error += glm::all(glm::equal(lsb, glm::ivec1(6))) ? 0 : 1;
  363. }
  364. {
  365. glm::ivec2 x(2);
  366. glm::ivec2 y(3);
  367. glm::ivec2 msb(0);
  368. glm::ivec2 lsb(0);
  369. glm::imulExtended(x, y, msb, lsb);
  370. Error += glm::all(glm::equal(msb, glm::ivec2(0))) ? 0 : 1;
  371. Error += glm::all(glm::equal(lsb, glm::ivec2(6))) ? 0 : 1;
  372. }
  373. {
  374. glm::ivec3 x(2);
  375. glm::ivec3 y(3);
  376. glm::ivec3 msb(0);
  377. glm::ivec3 lsb(0);
  378. glm::imulExtended(x, y, msb, lsb);
  379. Error += glm::all(glm::equal(msb, glm::ivec3(0))) ? 0 : 1;
  380. Error += glm::all(glm::equal(lsb, glm::ivec3(6))) ? 0 : 1;
  381. }
  382. {
  383. glm::ivec4 x(2);
  384. glm::ivec4 y(3);
  385. glm::ivec4 msb(0);
  386. glm::ivec4 lsb(0);
  387. glm::imulExtended(x, y, msb, lsb);
  388. Error += glm::all(glm::equal(msb, glm::ivec4(0))) ? 0 : 1;
  389. Error += glm::all(glm::equal(lsb, glm::ivec4(6))) ? 0 : 1;
  390. }
  391. return Error;
  392. }
  393. }//namespace imulExtended
  394. int main()
  395. {
  396. int Error = 0;
  397. std::cout << "sizeof(glm::uint64): " << sizeof(glm::detail::uint64) << std::endl;
  398. Error += ::umulExtended::test();
  399. Error += ::imulExtended::test();
  400. Error += ::uaddCarry::test();
  401. Error += ::usubBorrow::test();
  402. Error += ::bitfieldExtract::test();
  403. Error += ::bitfieldReverse::test();
  404. Error += ::findMSB::test();
  405. Error += ::findLSB::test();
  406. return Error;
  407. }