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 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2002, Industrial Light & Magic, a division of Lucas
// Digital Ltd. 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 Industrial Light & Magic 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.
//
///////////////////////////////////////////////////////////////////////////
#include <tmpDir.h>
#include <ImfOutputFile.h>
#include <ImfInputFile.h>
#include <ImfChannelList.h>
#include <ImfArray.h>
#include <ImfThreading.h>
#include "IlmThread.h"
#include "half.h"
#include <stdio.h>
#include <assert.h>
using namespace std;
using namespace Imath;
using namespace Imf;
namespace {
void
fillPixels (Array2D<half> &ph, int width, int height)
{
for (int y = 0; y < height; ++y)
for (int x = 0; x < width; ++x)
ph[y][x] = x % 10 + 10 * (y % 17);
}
void
writeRead (const Array2D<half> &ph1,
const char fileName[],
int width,
int height,
LineOrder lorder)
{
//
// Write the pixel data in ph1 to an image file using
// the specified line order. Read the pixel data back
// from the file in pseudo-random order and verify that
// the data did not change.
//
cout << "line order " << lorder <<
":" << flush;
Header hdr (width, height);
hdr.lineOrder() = lorder;
hdr.channels().insert ("H", // name
Channel (HALF, // type
1, // xSampling
1) // ySampling
);
{
FrameBuffer fb;
fb.insert ("H", // name
Slice (HALF, // type
(char *) &ph1[0][0], // base
sizeof (ph1[0][0]), // xStride
sizeof (ph1[0][0]) * width, // yStride
1, // xSampling
1) // ySampling
);
cout << " writing" << flush;
remove (fileName);
OutputFile out (fileName, hdr);
out.setFrameBuffer (fb);
out.writePixels (height);
}
{
cout << " reading" << flush;
InputFile in (fileName);
const Box2i &dw = in.header().dataWindow();
int w = dw.max.x - dw.min.x + 1;
int h = dw.max.y - dw.min.y + 1;
int dx = dw.min.x;
int dy = dw.min.y;
Array2D<half> ph2 (h, w);
FrameBuffer fb;
fb.insert ("H", // name
Slice (HALF, // type
(char *) &ph2[-dy][-dx], // base
sizeof (ph2[0][0]), // xStride
sizeof (ph2[0][0]) * w, // yStride
1, // xSampling
1) // ySampling
);
in.setFrameBuffer (fb);
//
// Read the scan lines in this order:
// 0, N, 2N, 3N, ... 1, N+1, 2N+1, ... 2, N+2, 2N+2, ...
//
const int N = 7;
for (int i = 0; i < N; ++i)
for (int y = dw.min.y + i; y <= dw.max.y; y += N)
in.readPixels (y);
cout << " comparing" << flush;
assert (in.header().displayWindow() == hdr.displayWindow());
assert (in.header().dataWindow() == hdr.dataWindow());
assert (in.header().pixelAspectRatio() == hdr.pixelAspectRatio());
assert (in.header().screenWindowCenter() == hdr.screenWindowCenter());
assert (in.header().screenWindowWidth() == hdr.screenWindowWidth());
assert (in.header().lineOrder() == hdr.lineOrder());
assert (in.header().compression() == hdr.compression());
ChannelList::ConstIterator hi = hdr.channels().begin();
ChannelList::ConstIterator ii = in.header().channels().begin();
while (hi != hdr.channels().end())
{
assert (!strcmp (hi.name(), ii.name()));
assert (hi.channel().type == ii.channel().type);
assert (hi.channel().xSampling == ii.channel().xSampling);
assert (hi.channel().ySampling == ii.channel().ySampling);
++hi;
++ii;
}
assert (ii == in.header().channels().end());
for (int y = 0; y < h; ++y)
for (int x = 0; x < w; ++x)
assert (ph1[y][x] == ph2[y][x]);
}
remove (fileName);
cout << endl;
}
} // namespace
void
testLineOrder ()
{
try
{
cout << "Testing line order and random access to scan lines" << endl;
const int W = 117;
const int H = 97;
Array2D<half> ph (H, W);
fillPixels (ph, W, H);
int maxThreads = IlmThread::supportsThreads()? 3: 0;
for (int n = 0; n <= maxThreads; ++n)
{
if (IlmThread::supportsThreads())
{
setGlobalThreadCount (n);
cout << "\nnumber of threads: " << globalThreadCount() << endl;
}
const char *filename = IMF_TMP_DIR "imf_test_lorder.exr";
for (int lorder = 0; lorder < RANDOM_Y; ++lorder)
{
writeRead (ph,
filename,
W, H,
LineOrder (lorder));
}
}
cout << "ok\n" << endl;
}
catch (const std::exception &e)
{
cerr << "ERROR -- caught exception: " << e.what() << endl;
assert (false);
}
}
|