summaryrefslogtreecommitdiff
path: root/indra/llmath/llmatrix3a.inl
blob: 65fd949f78cfd76bad00d03ade440e82754a9169 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/** 
 * @file llmatrix3a.inl
 * @brief LLMatrix3a inline definitions
 *
 * $LicenseInfo:firstyear=2010&license=viewergpl$
 * 
 * Copyright (c) 2010, Linden Research, Inc.
 * 
 * Second Life Viewer Source Code
 * The source code in this file ("Source Code") is provided by Linden Lab
 * to you under the terms of the GNU General Public License, version 2.0
 * ("GPL"), unless you have obtained a separate licensing agreement
 * ("Other License"), formally executed by you and Linden Lab.  Terms of
 * the GPL can be found in doc/GPL-license.txt in this distribution, or
 * online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
 * 
 * There are special exceptions to the terms and conditions of the GPL as
 * it is applied to this Source Code. View the full text of the exception
 * in the file doc/FLOSS-exception.txt in this software distribution, or
 * online at
 * http://secondlifegrid.net/programs/open_source/licensing/flossexception
 * 
 * By copying, modifying or distributing this software, you acknowledge
 * that you have read and understood your obligations described above,
 * and agree to abide by those obligations.
 * 
 * ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
 * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
 * COMPLETENESS OR PERFORMANCE.
 * $/LicenseInfo$
 */

#include "llmatrix3a.h"
#include "m3math.h"

inline LLMatrix3a::LLMatrix3a( const LLVector4a& c0, const LLVector4a& c1, const LLVector4a& c2 )
{
	setColumns( c0, c1, c2 );
}

inline void LLMatrix3a::loadu(const LLMatrix3& src)
{
	mColumns[0].load3(src.mMatrix[0]);
	mColumns[1].load3(src.mMatrix[1]);
	mColumns[2].load3(src.mMatrix[2]);
}

inline void LLMatrix3a::setRows(const LLVector4a& r0, const LLVector4a& r1, const LLVector4a& r2)
{
	mColumns[0] = r0;
	mColumns[1] = r1;
	mColumns[2] = r2;
	setTranspose( *this );
}

inline void LLMatrix3a::setColumns(const LLVector4a& c0, const LLVector4a& c1, const LLVector4a& c2)
{
	mColumns[0] = c0;
	mColumns[1] = c1;
	mColumns[2] = c2;
}

inline void LLMatrix3a::setTranspose(const LLMatrix3a& src)
{
	const LLQuad srcCol0 = src.mColumns[0];
	const LLQuad srcCol1 = src.mColumns[1];
	const LLQuad unpacklo = _mm_unpacklo_ps( srcCol0, srcCol1 );
	mColumns[0] = _mm_movelh_ps( unpacklo, src.mColumns[2] );
	mColumns[1] = _mm_shuffle_ps( _mm_movehl_ps( srcCol0, unpacklo ), src.mColumns[2], _MM_SHUFFLE(0, 1, 1, 0) );
	mColumns[2] = _mm_shuffle_ps( _mm_unpackhi_ps( srcCol0, srcCol1 ), src.mColumns[2], _MM_SHUFFLE(0, 2, 1, 0) );
}

inline const LLVector4a& LLMatrix3a::getColumn(const U32 column) const
{
	llassert( column < 3 );
	return mColumns[column];
}

inline void LLMatrix3a::setLerp(const LLMatrix3a& a, const LLMatrix3a& b, F32 w)
{
	mColumns[0].setLerp( a.mColumns[0], b.mColumns[0], w );
	mColumns[1].setLerp( a.mColumns[1], b.mColumns[1], w );
	mColumns[2].setLerp( a.mColumns[2], b.mColumns[2], w );
}

inline LLBool32 LLMatrix3a::isFinite() const
{
	return mColumns[0].isFinite3() && mColumns[1].isFinite3() && mColumns[2].isFinite3();
}

inline void LLMatrix3a::getDeterminant( LLVector4a& dest ) const
{
	LLVector4a col1xcol2; col1xcol2.setCross3( mColumns[1], mColumns[2] );
	dest.setAllDot3( col1xcol2, mColumns[0] );
}

inline LLSimdScalar LLMatrix3a::getDeterminant() const
{
	LLVector4a col1xcol2; col1xcol2.setCross3( mColumns[1], mColumns[2] );
	return col1xcol2.dot3( mColumns[0] );
}

inline bool LLMatrix3a::isApproximatelyEqual( const LLMatrix3a& rhs, F32 tolerance /*= F_APPROXIMATELY_ZERO*/ ) const
{
	return rhs.getColumn(0).equals3(mColumns[0], tolerance) 
		&& rhs.getColumn(1).equals3(mColumns[1], tolerance) 
		&& rhs.getColumn(2).equals3(mColumns[2], tolerance); 
}

inline const LLMatrix3a& LLMatrix3a::getIdentity()
{
	extern const LLMatrix3a LL_M3A_IDENTITY;
	return LL_M3A_IDENTITY;
}

inline bool LLRotation::isOkRotation() const
{
	LLMatrix3a transpose; transpose.setTranspose( *this );
	LLMatrix3a product; product.setMul( *this, transpose );

	LLSimdScalar detMinusOne = getDeterminant() - 1.f;

	return product.isApproximatelyEqual( LLMatrix3a::getIdentity() ) && (detMinusOne.getAbs() < F_APPROXIMATELY_ZERO);
}