You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and dots ('.'), can be up to 35 characters long. Letters must be lowercase.
187 lines
4.9 KiB
187 lines
4.9 KiB
/////////////////////////////////////////////////////////////////////////////////// |
|
/// OpenGL Mathematics (glm.g-truc.net) |
|
/// |
|
/// Copyright (c) 2005 - 2015 G-Truc Creation (www.g-truc.net) |
|
/// Permission is hereby granted, free of charge, to any person obtaining a copy |
|
/// of this software and associated documentation files (the "Software"), to deal |
|
/// in the Software without restriction, including without limitation the rights |
|
/// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
/// copies of the Software, and to permit persons to whom the Software is |
|
/// furnished to do so, subject to the following conditions: |
|
/// |
|
/// The above copyright notice and this permission notice shall be included in |
|
/// all copies or substantial portions of the Software. |
|
/// |
|
/// Restrictions: |
|
/// By making use of the Software for military purposes, you choose to make |
|
/// a Bunny unhappy. |
|
/// |
|
/// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
/// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
/// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
/// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|
/// THE SOFTWARE. |
|
/// |
|
/// @file test/core/func_packing.cpp |
|
/// @date 2011-01-15 / 2011-09-13 |
|
/// @author Christophe Riccio |
|
/////////////////////////////////////////////////////////////////////////////////// |
|
|
|
#include <glm/gtc/type_precision.hpp> |
|
#include <glm/gtc/epsilon.hpp> |
|
#include <glm/vector_relational.hpp> |
|
#include <glm/packing.hpp> |
|
#include <vector> |
|
|
|
int test_packUnorm2x16() |
|
{ |
|
int Error = 0; |
|
|
|
std::vector<glm::vec2> A; |
|
A.push_back(glm::vec2(1.0f, 0.0f)); |
|
A.push_back(glm::vec2(0.5f, 0.7f)); |
|
A.push_back(glm::vec2(0.1f, 0.2f)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::vec2 B(A[i]); |
|
glm::uint32 C = glm::packUnorm2x16(B); |
|
glm::vec2 D = glm::unpackUnorm2x16(C); |
|
Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 65535.f)) ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int test_packSnorm2x16() |
|
{ |
|
int Error = 0; |
|
|
|
std::vector<glm::vec2> A; |
|
A.push_back(glm::vec2( 1.0f, 0.0f)); |
|
A.push_back(glm::vec2(-0.5f,-0.7f)); |
|
A.push_back(glm::vec2(-0.1f, 0.1f)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::vec2 B(A[i]); |
|
glm::uint32 C = glm::packSnorm2x16(B); |
|
glm::vec2 D = glm::unpackSnorm2x16(C); |
|
Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 32767.0f * 2.0f)) ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int test_packUnorm4x8() |
|
{ |
|
int Error = 0; |
|
|
|
glm::uint32 Packed = glm::packUnorm4x8(glm::vec4(1.0f, 0.5f, 0.0f, 1.0f)); |
|
glm::u8vec4 Vec(255, 128, 0, 255); |
|
glm::uint32 & Ref = *reinterpret_cast<glm::uint32*>(&Vec[0]); |
|
|
|
Error += Packed == Ref ? 0 : 1; |
|
|
|
std::vector<glm::vec4> A; |
|
A.push_back(glm::vec4(1.0f, 0.7f, 0.3f, 0.0f)); |
|
A.push_back(glm::vec4(0.5f, 0.1f, 0.2f, 0.3f)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::vec4 B(A[i]); |
|
glm::uint32 C = glm::packUnorm4x8(B); |
|
glm::vec4 D = glm::unpackUnorm4x8(C); |
|
Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 255.f)) ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int test_packSnorm4x8() |
|
{ |
|
int Error = 0; |
|
|
|
std::vector<glm::vec4> A; |
|
A.push_back(glm::vec4( 1.0f, 0.0f,-0.5f,-1.0f)); |
|
A.push_back(glm::vec4(-0.7f,-0.1f, 0.1f, 0.7f)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::vec4 B(A[i]); |
|
glm::uint32 C = glm::packSnorm4x8(B); |
|
glm::vec4 D = glm::unpackSnorm4x8(C); |
|
Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 127.f)) ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int test_packHalf2x16() |
|
{ |
|
int Error = 0; |
|
/* |
|
std::vector<glm::hvec2> A; |
|
A.push_back(glm::hvec2(glm::half( 1.0f), glm::half( 2.0f))); |
|
A.push_back(glm::hvec2(glm::half(-1.0f), glm::half(-2.0f))); |
|
A.push_back(glm::hvec2(glm::half(-1.1f), glm::half( 1.1f))); |
|
*/ |
|
std::vector<glm::vec2> A; |
|
A.push_back(glm::vec2( 1.0f, 2.0f)); |
|
A.push_back(glm::vec2(-1.0f,-2.0f)); |
|
A.push_back(glm::vec2(-1.1f, 1.1f)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::vec2 B(A[i]); |
|
glm::uint C = glm::packHalf2x16(B); |
|
glm::vec2 D = glm::unpackHalf2x16(C); |
|
//Error += B == D ? 0 : 1; |
|
Error += glm::all(glm::epsilonEqual(B, D, 1.0f / 127.f)) ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int test_packDouble2x32() |
|
{ |
|
int Error = 0; |
|
|
|
std::vector<glm::uvec2> A; |
|
A.push_back(glm::uvec2( 1, 2)); |
|
A.push_back(glm::uvec2(-1,-2)); |
|
A.push_back(glm::uvec2(-1000, 1100)); |
|
|
|
for(std::size_t i = 0; i < A.size(); ++i) |
|
{ |
|
glm::uvec2 B(A[i]); |
|
double C = glm::packDouble2x32(B); |
|
glm::uvec2 D = glm::unpackDouble2x32(C); |
|
Error += B == D ? 0 : 1; |
|
assert(!Error); |
|
} |
|
|
|
return Error; |
|
} |
|
|
|
int main() |
|
{ |
|
int Error = 0; |
|
|
|
Error += test_packSnorm4x8(); |
|
Error += test_packUnorm4x8(); |
|
Error += test_packSnorm2x16(); |
|
Error += test_packUnorm2x16(); |
|
Error += test_packHalf2x16(); |
|
Error += test_packDouble2x32(); |
|
|
|
return Error; |
|
} |
|
|
|
|