File: decoderstream.cpp

package info (click to toggle)
libjpeg 0.0~git20220805.54ec643-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 3,888 kB
  • sloc: cpp: 36,370; makefile: 618; ansic: 275; sh: 54; python: 39; perl: 11
file content (318 lines) | stat: -rw-r--r-- 10,351 bytes parent folder | download | duplicates (3)
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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
/*************************************************************************

    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/>.

*************************************************************************/
/*
** DecoderStream: Another implementation of the ByteStream class,
** this time used mostly by the decoder. The idea behind this class
** is that it additionally keeps input data in several segments that
** can be sorted according to an index, as used by the enumerator of
** the boxes.
** 
** $Id: decoderstream.cpp,v 1.10 2015/03/30 09:39:09 thor Exp $
**
*/

/// Includes
#include "tools/environment.hpp"
#include "decoderstream.hpp"
#include "interface/parameters.hpp"
#include "interface/tagitem.hpp"
///

/// DecoderStream::~DecoderStream
// The destructor of the decoder stream
// gets rid of all the buffer nodes in here.
DecoderStream::~DecoderStream(void)
{
  struct BufferNode *next,*node;

  // Only if we own the lists
  if (m_pParent == NULL) {
    node = m_pBufferList;
    while(node) {
      next = node->NextOf();
      delete node;
      node = next;
    }
  }
}
///

/// DecoderStream::Fill
// Feed the stream with the next available buffer
// or increase the EOF counter if there is no next buffer.
LONG DecoderStream::Fill(void)
{  
  //
  // Do we have a EOF condition? If so, stop reading
  while (!m_bEOF) { 
    struct BufferNode *next;
    //
    // First check whether we do have a node for reading.
    if (m_pCurrent) {
      // Yes, we have had buffer list. We must now switch
      // to the next node and dispose this one, but only if
      // we are the master (parent) node. Otherwise, leave the
      // master alone.
      next = m_pCurrent->NextOf();
      //
      if (m_pParent == NULL) {
        m_pCurrent->Remove(m_pBufferList);
        delete m_pCurrent;
      }
      m_uqCounter += m_pucBufPtr - m_pucBuffer;
      m_pCurrent   = next;
    } else {
      // If not, start from the beginning.
      m_pCurrent = m_pBufferList;
    }
    // Ok, m_pBufferList now either points to the
    // next available BufferNode to read, or is NULL in case
    // there is no such thing. We then have an EOF.
    if (m_pCurrent) {
      m_ulBufSize = m_pCurrent->bn_ulBufSize;
      m_pucBuffer = m_pucBufPtr  = m_pCurrent->bn_pucBuffer;
      m_pucBufEnd = m_pucBuffer  + m_ulBufSize;
      //
      return m_ulBufSize;
    } else {
      // No follow-up node. Return EOF,
      // will also abort the loop.
      m_bEOF      = true;
      m_ulBufSize = 0;
      m_pucBuffer = NULL;
      m_pucBufPtr = NULL;
      m_pucBufEnd = NULL;
    }
  } // of loop on not EOF.
  //
  //
  return 0;
}
///

/// DecoderStream::Append
// Given a byte stream and a size,
// attach as many bytes in the byte stream to the decoder stream.
// The bytes are read from the byte stream and feed into here.
// Returns false on error.
bool DecoderStream::Append(class ByteStream *from,ULONG read_size,ULONG index)
{
  //
  // First, check whether we provide any bytes at all. If not, bail out.
  if (read_size) {
    ULONG size;
    struct BufferNode *bn;
    // Now allocate a new buffer node of the given priority and link it in.
    bn = BufferNode::AddBuffer(m_pEnviron,m_pBufferList,index,read_size);
    // And read the data into the buffer.
    size = from->Read(bn->bn_pucBuffer,read_size);
    if (size != read_size) {
      if (size < read_size) {
        // fill the remaining part with zeros.
        memset(bn->bn_pucBuffer + size,0,read_size - size);
      }
      // Support truncated streams, but warn!
      JPG_WARN(UNEXPECTED_EOF, "DecoderStream::Append",
               "unexpected EOF on pulling encoded data");
      return false;
    }
  }
  return true;
}
///

/// DecoderStream::Append
// The same again, but carring the data over from a second decoder stream.
// The "source" decoder stream is empty afterwards, and its data
// is appended *at the end* of the current decoder stream and not
// sorted it according to the recorded priority.
void DecoderStream::Append(class DecoderStream *from)
{  
  // That's a queue operation.
  BufferNode::AttachQueue(m_pBufferList,from->m_pBufferList);
}
///

/// DecoderStream::PeekWord
// read the next marker segment from the decoder stream without
// advancing the file pointer. Deliver J2K_EOF in case we hit an EOF.
LONG DecoderStream::PeekWord(void)
{    
  LONG byte1,byte2;
  //
  if (!m_bEOF) {
    class DecoderStream temp(this, JPGFLAG_OFFSET_CURRENT); 
    // make a backup of this guy
    // NOTE: This decoder stream does not allocate bytes
    // in any way so we may silently take it from the stack...
    byte1 = temp.Get();
    if (byte1 != EOF) {
      byte2 = temp.Get();
      if (byte2 != EOF) {
        // Ok, pack the marker into a word and deliver.
        return ((byte1<<8) | byte2);
      }
    }
  }
  //
  // Otherwise, it's an EOF.
  return EOF;
}
///

/// DecoderStream::Cleanup
// Prefetch the next buffer. The main reason for this call is to
// release a eaten up buffer, hence to run into the "fill()" 
// the next Get() would have run into anyhow.
void DecoderStream::CleanUp(void)
{
  // If this hit already the EOF and the last buffer
  // node is done, then nothing to do here.
  if (m_pCurrent) {
    UBYTE *realend = m_pucBufEnd;
    // Is all data in this buffer used up? Note that BufEnd of the
    // current node has been modified and shifted to the back by
    // m_ulMovedBytes.
    if (m_pucBufPtr >= realend) {
      // Modify the buffer end such that the next call to this
      // function returns the same value.
      m_pucBufEnd    = m_pucBufPtr;
      //
      // Can we potentially discard this buffer?
      if (m_pParent == NULL && m_pCurrent == m_pBufferList) {
        // Proceed further only if we are the first and only buffer in the list.
        // If we are the only node, then new nodes become the first one,
        // this is identically to the behaivour if we would keep this
        // node since the next fill would discard us.
        m_pBufferList = m_pCurrent->NextOf();
        delete m_pCurrent;
        m_pCurrent    = NULL;
      }
    }
  } 
}
///

/// DecoderStream::BufferedBytes
// Return the amount of buffered data in here.
ULONG DecoderStream::BufferedBytes(void) const
{
  ULONG cnt             = 0;
  struct BufferNode *bn;
  // 
  // Do we have a EOF condition? If so, then that's it.
  if (m_bEOF)
    return 0;
  //
  if ((bn = m_pCurrent)) {
    // This buffer is dirty. Just count the remaining bytes
    // in the output buffer.
    cnt += m_pucBufEnd - m_pucBufPtr;
    bn   = bn->NextOf();
  } else {
    bn   = m_pBufferList;
  }
  //
  // Now add up the size of the data still in the buffer.
  while(bn) {
    cnt += bn->bn_ulBufSize;
    bn   = bn->NextOf();
  }
  //
  return cnt;
}
///

/// DecoderStream::SetFilePointer
// Set the file pointer to the indicated position (read only). This may
// seek within the stream. Note that this implements an absolute 
// seek relative to the start of the file, and in this case to the
// start of the buffer. Works only in case we are a copy of a decoder
// stream and thus the buffer didn't get removed while reading.
void DecoderStream::SetFilePointer(UQUAD newpos)
{
  UQUAD mypos = 0;
  struct BufferNode *bn;
  //
  // This only works if we share the buffer from a parent such
  // that the buffer stays intact.
  assert(m_pParent);
  //
  // Get the initial buffer node.
  bn = m_pBufferList;
  while(bn) {
    // Here mypos is always the absolute file offset of the start
    // of the buffer.
    // Check whether the target position is within this buffer.
    if (newpos >= mypos && newpos < mypos + bn->bn_ulBufSize) {
      ULONG offset = newpos - mypos; // offset within the buffer
      // Is within this buffer. Ok, make this the current buffer
      // and set the buffer pointer accordingly.
      m_pCurrent   = bn;
      m_pucBuffer  = m_pCurrent->bn_pucBuffer;
      m_ulBufSize  = m_pCurrent->bn_ulBufSize;
      m_pucBufPtr  = m_pucBuffer + offset;
      m_pucBufEnd  = m_pucBuffer + m_ulBufSize;
      // Not at EOF, set the file pointer.
      m_uqCounter  = mypos;
      m_bEOF       = false;
      return;
    }
    // Otherwise, advance the file pointer by the buffer size.
    mypos += bn->bn_ulBufSize;
    bn     = bn->NextOf();
  }
  //
  // If we are seeking to the EOF, allow that as well.
  if (mypos == newpos) {
    m_pCurrent   = NULL;
    m_pucBuffer  = NULL;
    m_pucBufPtr  = NULL;
    m_pucBufEnd  = NULL;
    m_uqCounter  = newpos;
    m_bEOF       = true;
    return;
  }
  //
  // Otherwise, generate an error.
  JPG_THROW(OVERFLOW_PARAMETER,"DecoderStream::SetFilePointer","tried to seek beyond EOF");
}
///