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 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
|
/*************************************************************************
This project implements a complete(!) JPEG (Recommendation ITU-T
T.81 | ISO/IEC 10918-1) codec, plus a library that can be used to
encode and decode JPEG streams.
It also implements ISO/IEC 18477 aka JPEG XT which is an extension
towards intermediate, high-dynamic-range lossy and lossless coding
of JPEG. In specific, it supports ISO/IEC 18477-3/-6/-7/-8 encoding.
Note that only Profiles C and D of ISO/IEC 18477-7 are supported
here. Check the JPEG XT reference software for a full implementation
of ISO/IEC 18477-7.
Copyright (C) 2012-2018 Thomas Richter, University of Stuttgart and
Accusoft. (C) 2019-2020 Thomas Richter, Fraunhofer IIS.
This program is available under two licenses, GPLv3 and the ITU
Software licence Annex A Option 2, RAND conditions.
For the full text of the GPU license option, see README.license.gpl.
For the full text of the ITU license option, see README.license.itu.
You may freely select between these two options.
For the GPL option, please note the following:
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*************************************************************************/
/*
* Base class for all IO support functions, the abstract ByteStream
* class.
*
* $Id: bytestream.cpp,v 1.8 2014/09/30 08:33:17 thor Exp $
*
*/
/// Includes
#include "bytestream.hpp"
#include "interface/parameters.hpp"
#include "interface/tagitem.hpp"
#include "tools/debug.hpp"
///
/// ByteStream::Read
LONG ByteStream::Read(UBYTE *buffer,ULONG size)
{
ULONG bytesread = 0;
ULONG avail = m_pucBufEnd - m_pucBufPtr; // number of available bytes
while (size >= avail) { // more bytes to read than in the buffer
assert(m_pucBufPtr <= m_pucBufEnd);
if (avail) {
memcpy(buffer,m_pucBufPtr,avail); // copy all data over
m_pucBufPtr += avail; // required for correct fill
bytesread += avail;
buffer += avail;
size -= avail;
}
// Now fill up the buffer again if we have to.
if (size == 0 || Fill() == 0) { // read zero bytes -> EOF. Don't loop forever
return bytesread;
}
//
// Update the number of available bytes in the buffer.
avail = m_pucBufEnd - m_pucBufPtr;
}
// only a partial read from the buffer
// now is size <= avail, guaranteed.
if (size) {
memcpy(buffer,m_pucBufPtr,size);
m_pucBufPtr += size;
// buffer += size; // not needed
// size -= size; // ditto
bytesread += size;
}
return bytesread;
}
///
/// ByteStream::Write
LONG ByteStream::Write(const UBYTE *buffer,ULONG size)
{
ULONG byteswritten = 0;
ULONG avail = m_pucBufEnd - m_pucBufPtr;
while(size > avail) { // write more bytes than fit into the buffer?
assert(m_pucBufPtr <= m_pucBufEnd);
// For JPIPs BinDefStream: Must not flush if the data fits, thus ">" and not ">=".
if (avail) {
memcpy(m_pucBufPtr,buffer,avail); // copy the data over
m_pucBufPtr += avail; // required for correct flush
byteswritten += avail;
buffer += avail;
size -= avail;
}
// Now write the buffer (or allocate one, at least)
Flush();
//
// Update the number of available bytes in the buffer.
avail = m_pucBufEnd - m_pucBufPtr;
}
// size is now smaller than m_ulBufBytes, guaranteed!
if (size) {
memcpy(m_pucBufPtr,buffer,size);
m_pucBufPtr += size;
// buffer += size; // not needed
// size -= size; // ditto
byteswritten += size;
}
return byteswritten;
}
///
/// ByteStream::SkipToMarker
// Seek forwards to one of the supplied marker segments, but
// do not pull the marker segment itself.
// This method is required for error-resilliance features, namely
// to resynchronize.
// Returns the detected marker, or EOF.
LONG ByteStream::SkipToMarker(UWORD marker1,UWORD marker2,
UWORD marker3,UWORD marker4,
UWORD marker5)
{
LONG byte;
for(;;) {
// Read bytes until we detect an 0xff which the marker has to start
// with. Or an EOF, obviously.
byte = Get();
if (byte == EOF)
return EOF; // We run out of data, *sigh*
if (byte == 0xff) {
// A possible marker segment? If so, put the 0xff back and
// check for the available marker now.
LastUnDo();
// And now seek for the marker.
byte = PeekWord();
if ((byte == marker1) || (byte == marker2) ||
(byte == marker3) || (byte == marker4) ||
(byte == marker5))
return byte;
//
// otherwise, not the marker we seek for. Skip, and don't forget
// to pull the 0xff we put back.
Get();
}
}
}
///
/// ByteStream::Push
LONG ByteStream::Push(class ByteStream *out,ULONG size)
{
ULONG bytesread = 0;
ULONG avail = m_pucBufEnd - m_pucBufPtr;
while (size >= avail) { // more bytes to read than in the buffer
assert(m_pucBufPtr <= m_pucBufEnd);
if (avail) {
out->Write(m_pucBufPtr,avail); // write all data out
m_pucBufPtr += avail; // required for correct fill
bytesread += avail;
size -= avail;
}
// Now fill up the buffer again.
if (Fill() == 0) { // read zero bytes -> EOF. Don't loop forever
return bytesread;
}
//
// Update the number of available bytes in the buffer.
avail = m_pucBufEnd - m_pucBufPtr;
}
// only a partial read from the buffer
// now is size <= m_ulBufBytes, guaranteed.
if (size) {
out->Write(m_pucBufPtr,size);
m_pucBufPtr += size;
// size -= size; // not needed
bytesread += size;
}
return bytesread;
}
///
/// ByteStream::Get
#if CHECK_LEVEL > 0
LONG ByteStream::Get(void) // read a single byte (not inlined)
{
if (m_pucBufPtr >= m_pucBufEnd) {
if (Fill() == 0) // Found EOF
return EOF;
}
assert(m_pucBufPtr < m_pucBufEnd);
return *m_pucBufPtr++;
}
#endif
///
/// ByteStream::SkipBytes
// Skip over bytes, ignore their contribution
void ByteStream::SkipBytes(ULONG offset)
{
ULONG avail = m_pucBufEnd - m_pucBufPtr;
//
// Cannot seek backwards here, a decoderstream disposes data
// as soon as it is read (maybe).
do {
ULONG bufbytes;
//
assert(m_pucBufPtr <= m_pucBufEnd);
//
// If we have no buffer or the buffer is empty, try to seek over
// or refill the buffer.
if (avail == 0) {
if (Fill() == 0 && offset) {
// If this happens, and there's still something to skip,
// then something's wrong because we should never seek
// over all data. If we do, the stream is most likely corrupt.
JPG_THROW(UNEXPECTED_EOF,"ByteStream::SkipBytes","unexpectedly hit the end of the stream while skipping bytes");
}
// Update the number of available bytes.
avail = m_pucBufEnd - m_pucBufPtr;
}
//
// Abort now. The above condition is still taken since it
// disposes unnecessary data early.
if (offset == 0)
return;
//
// Now some bytes should be available.
assert(m_pucBufPtr < m_pucBufEnd);
//
// Check how many bytes we can skip.
bufbytes = avail;
if (bufbytes > offset)
bufbytes = offset;
//
// Now skip the indicated number of bytes
offset -= bufbytes;
m_pucBufPtr += bufbytes;
avail -= bufbytes;
//
assert(m_pucBufPtr <= m_pucBufEnd);
} while(true);
}
///
|