summaryrefslogtreecommitdiff
path: root/indra/llmath/tests/llmodularmath_test.cpp
blob: a998a95618b0c644ded2e7fd8d5c4f2bc9acdafc (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
/**
 * @file modularmath_tut.cpp
 * @author babbage
 * @date 2008-09
 * @brief llmodularmath tests
 *
 * $LicenseInfo:firstyear=2007&license=viewergpl$
 * 
 * Copyright (c) 2007-2009, 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 "linden_common.h"

#include "../llmodularmath.h"

#include "../test/lltut.h"

namespace tut
{
	struct modularmath_data
	{
	};
	typedef test_group<modularmath_data> modularmath_test;
	typedef modularmath_test::object modularmath_object;
	tut::modularmath_test modularmath_testcase("modularmath");

	template<> template<>
	void modularmath_object::test<1>()
	{
		// lhs < rhs
		const U32 lhs = 0x000001;
		const U32 rhs = 0xFFFFFF;
		const U32 width = 24;
		U32 result = LLModularMath::subtract<width>(lhs, rhs); 
		ensure_equals("diff(0x000001, 0xFFFFFF, 24)", result, 2);
	}

	template<> template<>
	void modularmath_object::test<2>()
	{
		// lhs > rhs
		const U32 lhs = 0x000002;
		const U32 rhs = 0x000001;
		const U32 width = 24;
		U32 result = LLModularMath::subtract<width>(lhs, rhs); 
		ensure_equals("diff(0x000002, 0x000001, 24)", result, 1);
	}

	template<> template<>
	void modularmath_object::test<3>()
	{
		// lhs == rhs
		const U32 lhs = 0xABCDEF;
		const U32 rhs = 0xABCDEF;
		const U32 width = 24;
		U32 result = LLModularMath::subtract<width>(lhs, rhs); 
		ensure_equals("diff(0xABCDEF, 0xABCDEF, 24)", result, 0);
	}	
}