core_force_pure.cpp 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423
  1. #ifndef GLM_FORCE_PURE
  2. # define GLM_FORCE_PURE
  3. #endif//GLM_FORCE_PURE
  4. #define GLM_FORCE_ALIGNED
  5. #define GLM_FORCE_SWIZZLE
  6. #include <glm/vector_relational.hpp>
  7. #include <glm/vec2.hpp>
  8. #include <glm/vec3.hpp>
  9. #include <glm/vec4.hpp>
  10. #include <cstdio>
  11. #include <ctime>
  12. #include <vector>
  13. int test_vec4_ctor()
  14. {
  15. int Error = 0;
  16. {
  17. glm::ivec4 A(1, 2, 3, 4);
  18. glm::ivec4 B(A);
  19. Error += glm::all(glm::equal(A, B)) ? 0 : 1;
  20. }
  21. # if GLM_HAS_TRIVIAL_QUERIES
  22. // Error += std::is_trivially_default_constructible<glm::vec4>::value ? 0 : 1;
  23. // Error += std::is_trivially_copy_assignable<glm::vec4>::value ? 0 : 1;
  24. Error += std::is_trivially_copyable<glm::vec4>::value ? 0 : 1;
  25. Error += std::is_trivially_copyable<glm::dvec4>::value ? 0 : 1;
  26. Error += std::is_trivially_copyable<glm::ivec4>::value ? 0 : 1;
  27. Error += std::is_trivially_copyable<glm::uvec4>::value ? 0 : 1;
  28. Error += std::is_copy_constructible<glm::vec4>::value ? 0 : 1;
  29. # endif
  30. #if GLM_HAS_INITIALIZER_LISTS
  31. {
  32. glm::vec4 a{ 0, 1, 2, 3 };
  33. std::vector<glm::vec4> v = {
  34. {0, 1, 2, 3},
  35. {4, 5, 6, 7},
  36. {8, 9, 0, 1}};
  37. }
  38. {
  39. glm::dvec4 a{ 0, 1, 2, 3 };
  40. std::vector<glm::dvec4> v = {
  41. {0, 1, 2, 3},
  42. {4, 5, 6, 7},
  43. {8, 9, 0, 1}};
  44. }
  45. #endif
  46. #if GLM_HAS_UNRESTRICTED_UNIONS && defined(GLM_FORCE_SWIZZLE)
  47. {
  48. glm::vec4 A = glm::vec4(1.0f, 2.0f, 3.0f, 4.0f);
  49. glm::vec4 B = A.xyzw;
  50. glm::vec4 C(A.xyzw);
  51. glm::vec4 D(A.xyzw());
  52. glm::vec4 E(A.x, A.yzw);
  53. glm::vec4 F(A.x, A.yzw());
  54. glm::vec4 G(A.xyz, A.w);
  55. glm::vec4 H(A.xyz(), A.w);
  56. glm::vec4 I(A.xy, A.zw);
  57. glm::vec4 J(A.xy(), A.zw());
  58. glm::vec4 K(A.x, A.y, A.zw);
  59. glm::vec4 L(A.x, A.yz, A.w);
  60. glm::vec4 M(A.xy, A.z, A.w);
  61. Error += glm::all(glm::equal(A, B)) ? 0 : 1;
  62. Error += glm::all(glm::equal(A, C)) ? 0 : 1;
  63. Error += glm::all(glm::equal(A, D)) ? 0 : 1;
  64. Error += glm::all(glm::equal(A, E)) ? 0 : 1;
  65. Error += glm::all(glm::equal(A, F)) ? 0 : 1;
  66. Error += glm::all(glm::equal(A, G)) ? 0 : 1;
  67. Error += glm::all(glm::equal(A, H)) ? 0 : 1;
  68. Error += glm::all(glm::equal(A, I)) ? 0 : 1;
  69. Error += glm::all(glm::equal(A, J)) ? 0 : 1;
  70. Error += glm::all(glm::equal(A, K)) ? 0 : 1;
  71. Error += glm::all(glm::equal(A, L)) ? 0 : 1;
  72. Error += glm::all(glm::equal(A, M)) ? 0 : 1;
  73. }
  74. #endif// GLM_HAS_UNRESTRICTED_UNIONS && defined(GLM_FORCE_SWIZZLE)
  75. {
  76. glm::vec4 A(1);
  77. glm::vec4 B(1, 1, 1, 1);
  78. Error += A == B ? 0 : 1;
  79. }
  80. {
  81. std::vector<glm::vec4> Tests;
  82. Tests.push_back(glm::vec4(glm::vec2(1, 2), 3, 4));
  83. Tests.push_back(glm::vec4(1, glm::vec2(2, 3), 4));
  84. Tests.push_back(glm::vec4(1, 2, glm::vec2(3, 4)));
  85. Tests.push_back(glm::vec4(glm::vec3(1, 2, 3), 4));
  86. Tests.push_back(glm::vec4(1, glm::vec3(2, 3, 4)));
  87. Tests.push_back(glm::vec4(glm::vec2(1, 2), glm::vec2(3, 4)));
  88. Tests.push_back(glm::vec4(1, 2, 3, 4));
  89. Tests.push_back(glm::vec4(glm::vec4(1, 2, 3, 4)));
  90. for(std::size_t i = 0; i < Tests.size(); ++i)
  91. Error += Tests[i] == glm::vec4(1, 2, 3, 4) ? 0 : 1;
  92. }
  93. return Error;
  94. }
  95. int test_bvec4_ctor()
  96. {
  97. int Error = 0;
  98. glm::bvec4 const A(true);
  99. glm::bvec4 const B(true);
  100. glm::bvec4 const C(false);
  101. glm::bvec4 const D = A && B;
  102. glm::bvec4 const E = A && C;
  103. glm::bvec4 const F = A || C;
  104. bool const G = A == C;
  105. bool const H = A != C;
  106. Error += D == glm::bvec4(true) ? 0 : 1;
  107. Error += E == glm::bvec4(false) ? 0 : 1;
  108. Error += F == glm::bvec4(true) ? 0 : 1;
  109. return Error;
  110. }
  111. int test_vec4_operators()
  112. {
  113. int Error = 0;
  114. {
  115. glm::vec4 A(1.0f);
  116. glm::vec4 B(1.0f);
  117. bool R = A != B;
  118. bool S = A == B;
  119. Error += (S && !R) ? 0 : 1;
  120. }
  121. {
  122. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  123. glm::vec4 B(4.0f, 5.0f, 6.0f, 7.0f);
  124. glm::vec4 C = A + B;
  125. Error += C == glm::vec4(5, 7, 9, 11) ? 0 : 1;
  126. glm::vec4 D = B - A;
  127. Error += D == glm::vec4(3, 3, 3, 3) ? 0 : 1;
  128. glm::vec4 E = A * B;
  129. Error += E == glm::vec4(4, 10, 18, 28) ? 0 : 1;
  130. glm::vec4 F = B / A;
  131. Error += F == glm::vec4(4, 2.5, 2, 7.0f / 4.0f) ? 0 : 1;
  132. glm::vec4 G = A + 1.0f;
  133. Error += G == glm::vec4(2, 3, 4, 5) ? 0 : 1;
  134. glm::vec4 H = B - 1.0f;
  135. Error += H == glm::vec4(3, 4, 5, 6) ? 0 : 1;
  136. glm::vec4 I = A * 2.0f;
  137. Error += I == glm::vec4(2, 4, 6, 8) ? 0 : 1;
  138. glm::vec4 J = B / 2.0f;
  139. Error += J == glm::vec4(2, 2.5, 3, 3.5) ? 0 : 1;
  140. glm::vec4 K = 1.0f + A;
  141. Error += K == glm::vec4(2, 3, 4, 5) ? 0 : 1;
  142. glm::vec4 L = 1.0f - B;
  143. Error += L == glm::vec4(-3, -4, -5, -6) ? 0 : 1;
  144. glm::vec4 M = 2.0f * A;
  145. Error += M == glm::vec4(2, 4, 6, 8) ? 0 : 1;
  146. glm::vec4 N = 2.0f / B;
  147. Error += N == glm::vec4(0.5, 2.0 / 5.0, 2.0 / 6.0, 2.0 / 7.0) ? 0 : 1;
  148. }
  149. {
  150. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  151. glm::vec4 B(4.0f, 5.0f, 6.0f, 7.0f);
  152. A += B;
  153. Error += A == glm::vec4(5, 7, 9, 11) ? 0 : 1;
  154. A += 1.0f;
  155. Error += A == glm::vec4(6, 8, 10, 12) ? 0 : 1;
  156. }
  157. {
  158. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  159. glm::vec4 B(4.0f, 5.0f, 6.0f, 7.0f);
  160. B -= A;
  161. Error += B == glm::vec4(3, 3, 3, 3) ? 0 : 1;
  162. B -= 1.0f;
  163. Error += B == glm::vec4(2, 2, 2, 2) ? 0 : 1;
  164. }
  165. {
  166. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  167. glm::vec4 B(4.0f, 5.0f, 6.0f, 7.0f);
  168. A *= B;
  169. Error += A == glm::vec4(4, 10, 18, 28) ? 0 : 1;
  170. A *= 2.0f;
  171. Error += A == glm::vec4(8, 20, 36, 56) ? 0 : 1;
  172. }
  173. {
  174. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  175. glm::vec4 B(4.0f, 5.0f, 6.0f, 7.0f);
  176. B /= A;
  177. Error += B == glm::vec4(4, 2.5, 2, 7.0f / 4.0f) ? 0 : 1;
  178. B /= 2.0f;
  179. Error += B == glm::vec4(2, 1.25, 1, 7.0f / 4.0f / 2.0f) ? 0 : 1;
  180. }
  181. {
  182. glm::vec4 B(2.0f);
  183. B /= B.y;
  184. Error += B == glm::vec4(1.0f) ? 0 : 1;
  185. }
  186. {
  187. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  188. glm::vec4 B = -A;
  189. Error += B == glm::vec4(-1.0f, -2.0f, -3.0f, -4.0f) ? 0 : 1;
  190. }
  191. {
  192. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  193. glm::vec4 B = --A;
  194. Error += B == glm::vec4(0.0f, 1.0f, 2.0f, 3.0f) ? 0 : 1;
  195. }
  196. {
  197. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  198. glm::vec4 B = A--;
  199. Error += B == glm::vec4(1.0f, 2.0f, 3.0f, 4.0f) ? 0 : 1;
  200. Error += A == glm::vec4(0.0f, 1.0f, 2.0f, 3.0f) ? 0 : 1;
  201. }
  202. {
  203. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  204. glm::vec4 B = ++A;
  205. Error += B == glm::vec4(2.0f, 3.0f, 4.0f, 5.0f) ? 0 : 1;
  206. }
  207. {
  208. glm::vec4 A(1.0f, 2.0f, 3.0f, 4.0f);
  209. glm::vec4 B = A++;
  210. Error += B == glm::vec4(1.0f, 2.0f, 3.0f, 4.0f) ? 0 : 1;
  211. Error += A == glm::vec4(2.0f, 3.0f, 4.0f, 5.0f) ? 0 : 1;
  212. }
  213. return Error;
  214. }
  215. int test_vec4_equal()
  216. {
  217. int Error = 0;
  218. {
  219. glm::vec4 const A(1, 2, 3, 4);
  220. glm::vec4 const B(1, 2, 3, 4);
  221. Error += A == B ? 0 : 1;
  222. Error += A != B ? 1 : 0;
  223. }
  224. {
  225. glm::ivec4 const A(1, 2, 3, 4);
  226. glm::ivec4 const B(1, 2, 3, 4);
  227. Error += A == B ? 0 : 1;
  228. Error += A != B ? 1 : 0;
  229. }
  230. return Error;
  231. }
  232. int test_vec4_size()
  233. {
  234. int Error = 0;
  235. Error += sizeof(glm::vec4) == sizeof(glm::lowp_vec4) ? 0 : 1;
  236. Error += sizeof(glm::vec4) == sizeof(glm::mediump_vec4) ? 0 : 1;
  237. Error += sizeof(glm::vec4) == sizeof(glm::highp_vec4) ? 0 : 1;
  238. Error += 16 == sizeof(glm::mediump_vec4) ? 0 : 1;
  239. Error += sizeof(glm::dvec4) == sizeof(glm::lowp_dvec4) ? 0 : 1;
  240. Error += sizeof(glm::dvec4) == sizeof(glm::mediump_dvec4) ? 0 : 1;
  241. Error += sizeof(glm::dvec4) == sizeof(glm::highp_dvec4) ? 0 : 1;
  242. Error += 32 == sizeof(glm::highp_dvec4) ? 0 : 1;
  243. Error += glm::vec4().length() == 4 ? 0 : 1;
  244. Error += glm::dvec4().length() == 4 ? 0 : 1;
  245. return Error;
  246. }
  247. int test_vec4_swizzle_partial()
  248. {
  249. int Error = 0;
  250. glm::vec4 A(1, 2, 3, 4);
  251. # if GLM_HAS_UNRESTRICTED_UNIONS && defined(GLM_SWIZZLE_RELAX)
  252. {
  253. glm::vec4 B(A.xy, A.zw);
  254. Error += A == B ? 0 : 1;
  255. }
  256. {
  257. glm::vec4 B(A.xy, 3.0f, 4.0f);
  258. Error += A == B ? 0 : 1;
  259. }
  260. {
  261. glm::vec4 B(1.0f, A.yz, 4.0f);
  262. Error += A == B ? 0 : 1;
  263. }
  264. {
  265. glm::vec4 B(1.0f, 2.0f, A.zw);
  266. Error += A == B ? 0 : 1;
  267. }
  268. {
  269. glm::vec4 B(A.xyz, 4.0f);
  270. Error += A == B ? 0 : 1;
  271. }
  272. {
  273. glm::vec4 B(1.0f, A.yzw);
  274. Error += A == B ? 0 : 1;
  275. }
  276. # endif
  277. return Error;
  278. }
  279. int test_operator_increment()
  280. {
  281. int Error(0);
  282. glm::ivec4 v0(1);
  283. glm::ivec4 v1(v0);
  284. glm::ivec4 v2(v0);
  285. glm::ivec4 v3 = ++v1;
  286. glm::ivec4 v4 = v2++;
  287. Error += glm::all(glm::equal(v0, v4)) ? 0 : 1;
  288. Error += glm::all(glm::equal(v1, v2)) ? 0 : 1;
  289. Error += glm::all(glm::equal(v1, v3)) ? 0 : 1;
  290. int i0(1);
  291. int i1(i0);
  292. int i2(i0);
  293. int i3 = ++i1;
  294. int i4 = i2++;
  295. Error += i0 == i4 ? 0 : 1;
  296. Error += i1 == i2 ? 0 : 1;
  297. Error += i1 == i3 ? 0 : 1;
  298. return Error;
  299. }
  300. namespace heap
  301. {
  302. class A
  303. {
  304. float f;
  305. };
  306. class B : public A
  307. {
  308. float g;
  309. glm::vec4 v;
  310. };
  311. int test()
  312. {
  313. int Error(0);
  314. A* p = new B;
  315. delete p;
  316. return Error;
  317. }
  318. }//namespace heap
  319. int test_vec4_simd()
  320. {
  321. int Error = 0;
  322. glm::vec4 const a(std::clock(), std::clock(), std::clock(), std::clock());
  323. glm::vec4 const b(std::clock(), std::clock(), std::clock(), std::clock());
  324. glm::vec4 const c(b * a);
  325. glm::vec4 const d(a + c);
  326. Error += glm::all(glm::greaterThanEqual(d, glm::vec4(0))) ? 0 : 1;
  327. return Error;
  328. }
  329. int main()
  330. {
  331. int Error(0);
  332. Error += test_vec4_ctor();
  333. Error += test_bvec4_ctor();
  334. Error += test_vec4_size();
  335. Error += test_vec4_operators();
  336. Error += test_vec4_equal();
  337. Error += test_vec4_swizzle_partial();
  338. Error += test_vec4_simd();
  339. Error += test_operator_increment();
  340. Error += heap::test();
  341. return Error;
  342. }