2012-08-25 04:31:49 +08:00
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
|
//
|
|
|
|
|
// Copyright (c) 2002, Industrial Light & Magic, a division of Lucas
|
|
|
|
|
// Digital Ltd. LLC
|
2019-06-11 01:04:23 +08:00
|
|
|
|
//
|
2012-08-25 04:31:49 +08:00
|
|
|
|
// All rights reserved.
|
2019-06-11 01:04:23 +08:00
|
|
|
|
//
|
2012-08-25 04:31:49 +08:00
|
|
|
|
// 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
|
2019-06-11 01:04:23 +08:00
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
|
//
|
2012-08-25 04:31:49 +08:00
|
|
|
|
// 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.
|
|
|
|
|
//
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// class RleCompressor
|
|
|
|
|
//
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
#include "ImfRleCompressor.h"
|
|
|
|
|
#include "ImfCheckedArithmetic.h"
|
|
|
|
|
#include "ImfRle.h"
|
2012-08-25 04:31:49 +08:00
|
|
|
|
#include "Iex.h"
|
2019-06-11 01:04:23 +08:00
|
|
|
|
#include "ImfNamespace.h"
|
2012-08-25 04:31:49 +08:00
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
OPENEXR_IMF_INTERNAL_NAMESPACE_SOURCE_ENTER
|
2012-08-25 04:31:49 +08:00
|
|
|
|
|
|
|
|
|
RleCompressor::RleCompressor (const Header &hdr, size_t maxScanLineSize):
|
|
|
|
|
Compressor (hdr),
|
|
|
|
|
_maxScanLineSize (maxScanLineSize),
|
|
|
|
|
_tmpBuffer (0),
|
|
|
|
|
_outBuffer (0)
|
|
|
|
|
{
|
|
|
|
|
_tmpBuffer = new char [maxScanLineSize];
|
|
|
|
|
_outBuffer = new char [uiMult (maxScanLineSize, size_t (3)) / 2];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
RleCompressor::~RleCompressor ()
|
|
|
|
|
{
|
|
|
|
|
delete [] _tmpBuffer;
|
|
|
|
|
delete [] _outBuffer;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
RleCompressor::numScanLines () const
|
|
|
|
|
{
|
|
|
|
|
//
|
|
|
|
|
// This compressor compresses individual scan lines.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
RleCompressor::compress (const char *inPtr,
|
2019-06-11 01:04:23 +08:00
|
|
|
|
int inSize,
|
|
|
|
|
int minY,
|
|
|
|
|
const char *&outPtr)
|
2012-08-25 04:31:49 +08:00
|
|
|
|
{
|
|
|
|
|
//
|
2019-06-11 01:04:23 +08:00
|
|
|
|
// Special case <20>- empty input buffer
|
2012-08-25 04:31:49 +08:00
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
if (inSize == 0)
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
outPtr = _outBuffer;
|
|
|
|
|
return 0;
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Reorder the pixel data.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
char *t1 = _tmpBuffer;
|
|
|
|
|
char *t2 = _tmpBuffer + (inSize + 1) / 2;
|
|
|
|
|
const char *stop = inPtr + inSize;
|
2012-10-17 15:12:04 +08:00
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
while (true)
|
|
|
|
|
{
|
|
|
|
|
if (inPtr < stop)
|
|
|
|
|
*(t1++) = *(inPtr++);
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if (inPtr < stop)
|
|
|
|
|
*(t2++) = *(inPtr++);
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
}
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Predictor.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
unsigned char *t = (unsigned char *) _tmpBuffer + 1;
|
|
|
|
|
unsigned char *stop = (unsigned char *) _tmpBuffer + inSize;
|
|
|
|
|
int p = t[-1];
|
2012-10-17 15:12:04 +08:00
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
while (t < stop)
|
|
|
|
|
{
|
|
|
|
|
int d = int (t[0]) - p + (128 + 256);
|
|
|
|
|
p = t[0];
|
|
|
|
|
t[0] = d;
|
|
|
|
|
++t;
|
|
|
|
|
}
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Run-length encode the data.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
outPtr = _outBuffer;
|
|
|
|
|
return rleCompress (inSize, _tmpBuffer, (signed char *) _outBuffer);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
RleCompressor::uncompress (const char *inPtr,
|
2019-06-11 01:04:23 +08:00
|
|
|
|
int inSize,
|
|
|
|
|
int minY,
|
|
|
|
|
const char *&outPtr)
|
2012-08-25 04:31:49 +08:00
|
|
|
|
{
|
|
|
|
|
//
|
2019-06-11 01:04:23 +08:00
|
|
|
|
// Special case <20>- empty input buffer
|
2012-08-25 04:31:49 +08:00
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
if (inSize == 0)
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
outPtr = _outBuffer;
|
|
|
|
|
return 0;
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Decode the run-length encoded data
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
int outSize;
|
|
|
|
|
|
|
|
|
|
if (0 == (outSize = rleUncompress (inSize, _maxScanLineSize,
|
2019-06-11 01:04:23 +08:00
|
|
|
|
(const signed char *) inPtr,
|
|
|
|
|
_tmpBuffer)))
|
2012-08-25 04:31:49 +08:00
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
throw IEX_NAMESPACE::InputExc ("Data decoding (rle) failed.");
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Predictor.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
unsigned char *t = (unsigned char *) _tmpBuffer + 1;
|
|
|
|
|
unsigned char *stop = (unsigned char *) _tmpBuffer + outSize;
|
2012-10-17 15:12:04 +08:00
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
while (t < stop)
|
|
|
|
|
{
|
|
|
|
|
int d = int (t[-1]) + int (t[0]) - 128;
|
|
|
|
|
t[0] = d;
|
|
|
|
|
++t;
|
|
|
|
|
}
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Reorder the pixel data.
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
{
|
2019-06-11 01:04:23 +08:00
|
|
|
|
const char *t1 = _tmpBuffer;
|
|
|
|
|
const char *t2 = _tmpBuffer + (outSize + 1) / 2;
|
|
|
|
|
char *s = _outBuffer;
|
|
|
|
|
char *stop = s + outSize;
|
2012-10-17 15:12:04 +08:00
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
while (true)
|
|
|
|
|
{
|
|
|
|
|
if (s < stop)
|
|
|
|
|
*(s++) = *(t1++);
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
if (s < stop)
|
|
|
|
|
*(s++) = *(t2++);
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
}
|
2012-08-25 04:31:49 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
outPtr = _outBuffer;
|
|
|
|
|
return outSize;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2019-06-11 01:04:23 +08:00
|
|
|
|
OPENEXR_IMF_INTERNAL_NAMESPACE_SOURCE_EXIT
|