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
126
127
128
129
130
131
132
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2009-2014 DreamWorks Animation LLC.
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of DreamWorks Animation nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
///////////////////////////////////////////////////////////////////////////
#ifdef NDEBUG
# undef NDEBUG
#endif
#include <string>
#include <iostream>
#include <assert.h>
#include <ImfRle.h>
#include <ImathRandom.h>
using namespace OPENEXR_IMF_NAMESPACE;
using namespace IMATH_NAMESPACE;
using namespace std;
namespace {
// Generate a random sequence of runs and single values
void
generateData(char *buffer, int bufferLen)
{
char value = 0;
int i = 0;
Rand48 rand48(0);
while (i < bufferLen) {
if (rand48.nextf() < .5) {
// Insert a single value
buffer[i++] = value;
} else {
// Insert a run
int runLen = (int)rand48.nextf(2.0, 1024.0);
for (int j=0; j<runLen; ++j) {
buffer[i++] = value;
if (i >= bufferLen) break;
}
}
value = (int)(value+1) & 0xff;
}
}
// Compress, decompress, and compare with the original
void
testRoundTrip(int bufferLen)
{
char *src = new char[bufferLen];
signed char *compressed = new signed char[2*bufferLen];
char *test = new char[bufferLen];
generateData(src, bufferLen);
int compressedLen = rleCompress(bufferLen, src, compressed);
assert(rleUncompress(compressedLen, bufferLen, compressed, test) > 0);
for (int i=0; i<bufferLen; ++i) {
assert( src[i] == test[i] );
}
delete[] src;
delete[] compressed;
delete[] test;
}
} // namespace
void
testRle(const string&)
{
cout << "RLE compression:" << endl;
try {
cout << " Round tripping buffers " << endl;
const int numIter = 1000;
Rand48 rand48(0);
for (int iter=0; iter<numIter; ++iter) {
testRoundTrip( (int)rand48.nextf(100.0, 1000000.0));
}
} catch (const exception &e) {
cout << "unexpected exception: " << e.what() << endl;
assert (false);
} catch (...) {
cout << "unexpected exception" << endl;
assert (false);
}
cout << "ok\n" << endl;
}
|
