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 319 320 321 322 323 324 325 326 327
|
/*************************************************************************
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/>.
*************************************************************************/
/*
**
** This class pulls blocks from the frame and reconstructs from those
** quantized block lines or encodes from them.
**
** $Id: linebuffer.cpp,v 1.13 2015/06/03 15:37:24 thor Exp $
**
*/
/// Includes
#include "control/bitmapctrl.hpp"
#include "control/linebuffer.hpp"
#include "control/residualblockhelper.hpp"
#include "interface/imagebitmap.hpp"
#include "upsampling/upsamplerbase.hpp"
#include "upsampling/downsamplerbase.hpp"
#include "coding/quantizedrow.hpp"
#include "codestream/tables.hpp"
#include "codestream/rectanglerequest.hpp"
#include "marker/frame.hpp"
#include "marker/scan.hpp"
#include "marker/component.hpp"
#include "tools/line.hpp"
#include "dct/dct.hpp"
#include "colortrafo/colortrafo.hpp"
#include "std/string.hpp"
///
/// LineBuffer::LineBuffer
LineBuffer::LineBuffer(class Frame *frame)
: JKeeper(frame->EnvironOf()), m_pFrame(frame), m_pulY(NULL), m_pulCurrentY(NULL),
m_pulWidth(NULL), m_pulEnd(NULL),
m_ppTop(NULL), m_pppCurrent(NULL), m_ppPrev(NULL)
{
m_ucCount = m_pFrame->DepthOf();
m_ulPixelWidth = frame->WidthOf();
m_ulPixelHeight = frame->HeightOf();
}
///
/// LineBuffer::~LineBuffer
LineBuffer::~LineBuffer(void)
{
struct Line *row;
UBYTE i;
if (m_pulY)
m_pEnviron->FreeMem(m_pulY,m_ucCount * sizeof(ULONG));
if (m_pulCurrentY)
m_pEnviron->FreeMem(m_pulCurrentY,m_ucCount * sizeof(ULONG));
if (m_ppTop) {
for(i = 0;i < m_ucCount;i++) {
while((row = m_ppTop[i])) {
m_ppTop[i] = row->m_pNext;
if (row->m_pData)
m_pEnviron->FreeMem(row->m_pData,m_pulWidth[i] * sizeof(LONG));
delete row;
}
}
m_pEnviron->FreeMem(m_ppTop,m_ucCount * sizeof(struct Line *));
}
if (m_pppCurrent)
m_pEnviron->FreeMem(m_pppCurrent,m_ucCount * sizeof(struct Line **));
if (m_ppPrev)
m_pEnviron->FreeMem(m_ppPrev,m_ucCount * sizeof(struct Line *));
if (m_pulWidth)
m_pEnviron->FreeMem(m_pulWidth,m_ucCount * sizeof(ULONG));
if (m_pulEnd)
m_pEnviron->FreeMem(m_pulEnd,m_ucCount * sizeof(ULONG));
}
///
/// LineBuffer::BuildCommon
// Build common structures for encoding and decoding
void LineBuffer::BuildCommon(void)
{
UBYTE i;
if (m_pulY == NULL) {
m_pulY = (ULONG *)m_pEnviron->AllocMem(sizeof(ULONG) * m_ucCount);
memset(m_pulY,0,sizeof(ULONG) * m_ucCount);
}
if (m_pulCurrentY == NULL) {
m_pulCurrentY = (ULONG *)m_pEnviron->AllocMem(sizeof(ULONG) * m_ucCount);
memset(m_pulCurrentY,0,sizeof(ULONG) * m_ucCount);
}
if (m_pulWidth == NULL) {
UBYTE i;
assert(m_pulEnd == NULL);
m_pulWidth = (ULONG *)m_pEnviron->AllocMem(sizeof(ULONG) * m_ucCount);
m_pulEnd = (ULONG *)m_pEnviron->AllocMem(sizeof(ULONG) * m_ucCount);
for(i = 0;i < m_ucCount;i++) {
class Component *comp = m_pFrame->ComponentOf(i);
UBYTE subx = comp->SubXOf();
UBYTE mcuw = comp->MCUWidthOf();
m_pulWidth[i] = ((m_ulPixelWidth + subx - 1) / subx + 7 + mcuw) & (-8);
m_pulEnd[i] = ((m_ulPixelWidth + subx - 1) / subx);
// where the line ends, nominally.
}
} else {
assert(m_pulEnd);
}
if (m_ppTop == NULL) {
m_ppTop = (struct Line **)m_pEnviron->AllocMem(sizeof(struct Line *) * m_ucCount);
memset(m_ppTop,0,sizeof(struct Line *) * m_ucCount);
}
if (m_pppCurrent == NULL) {
m_pppCurrent = (struct Line ***)m_pEnviron->AllocMem(sizeof(struct Line **) * m_ucCount);
for(i = 0;i < m_ucCount;i++) {
m_pppCurrent[i] = m_ppTop + i;
}
}
if (m_ppPrev == NULL) {
m_ppPrev = (struct Line **) m_pEnviron->AllocMem(sizeof(struct Line *) * m_ucCount);
memset(m_ppPrev,0,m_ucCount * sizeof(struct Line *));
}
}
///
/// LineBuffer::ResetStreamToStartOfScan
// Make sure to reset the block control to the
// start of the scan for the indicated components in the scan,
// required after collecting the statistics for this scan.
void LineBuffer::ResetToStartOfScan(class Scan *scan)
{
UBYTE ccnt = scan->ComponentsInScan();
for(UBYTE i = 0;i < ccnt;i++) {
class Component *comp = scan->ComponentOf(i);
UBYTE idx = comp->IndexOf();
m_pulY[idx] = 0;
m_pulCurrentY[idx] = 0;
m_pppCurrent[idx] = &m_ppTop[idx];
m_ppPrev[idx] = NULL;
}
}
///
/// LineBuffer::StartMCUQuantizerRow
// Start a MCU scan by initializing the quantized rows for this row
// in this scan.
bool LineBuffer::StartMCUQuantizerRow(class Scan *scan)
{
bool more = true;
UBYTE ccnt = scan->ComponentsInScan();
for(UBYTE i = 0;i < ccnt;i++) {
ULONG y,ymin,ymax,height;
struct Line **last;
class Component *comp = scan->ComponentOf(i);
UBYTE idx = comp->IndexOf();
UBYTE mcuheight = (ccnt > 1)?(comp->MCUHeightOf() << 3):(8);
UBYTE suby = comp->SubYOf();
last = m_pppCurrent[idx];
height = (m_ulPixelHeight + suby - 1) / suby;
ymin = m_pulY[idx];
ymax = ymin + mcuheight; // Always allocated in groups of eight lines.
if (m_ulPixelHeight > 0 && ymax > height)
ymax = height;
if (ymin < ymax) {
//
// Advance to the end of the current block row.
while (*last && m_pulCurrentY[idx] < m_pulY[idx]) {
m_ppPrev[idx] = *last; // last line buffered is previous line of next block.
last = &((*last)->m_pNext);
m_pulCurrentY[idx]++;
}
for(y = ymin;y < ymax;y++) {
if (*last == NULL) {
*last = new(m_pEnviron) struct Line;
}
if ((*last)->m_pData == NULL)
(*last)->m_pData = (LONG *)m_pEnviron->AllocMem(m_pulWidth[idx] * sizeof(LONG));
if (y == ymin)
m_pppCurrent[idx] = last;
last = &((*last)->m_pNext);
}
} else {
more = false;
}
m_pulY[idx] = ymax;
}
return more;
}
///
/// LineBuffer::StartMCUResidualRow
// The same for a row of residuals.
bool LineBuffer::StartMCUResidualRow(void)
{
JPG_THROW(NOT_IMPLEMENTED,"LineBuffer::StartMCUResidualRow",
"residual coding not implemented (and not necessary) for line based processes");
return false; // code never goes here.
}
///
/// LineBuffer::BufferedLines
// Return the number of lines available for reconstruction from this scan.
ULONG LineBuffer::BufferedLines(const struct RectangleRequest *rr) const
{
int i;
ULONG maxlines = m_ulPixelHeight;
for(i = rr->rr_usFirstComponent;i <= rr->rr_usLastComponent;i++) {
class Component *comp = m_pFrame->ComponentOf(i);
ULONG curline = comp->SubYOf() * (m_pulCurrentY[i] + (comp->MCUHeightOf() << 3));
if (curline >= m_ulPixelHeight) { // end of image
curline = m_ulPixelHeight;
} else if (curline > 0 && comp->SubYOf() > 1) { // need one extra pixel at the end for subsampling expansion
curline = (curline - comp->SubYOf()) & (-8); // one additional subsampled line, actually,
// and as we reconstruct always multiples of eight, round down again.
}
if (curline < maxlines)
maxlines = curline;
}
return maxlines;
}
///
/// LineBuffer::DefineRegion
// Define a single 8x8 block starting at the x offset and the given
// line, taking the input 8x8 buffer.
void LineBuffer::DefineRegion(LONG x,struct Line *line,const LONG *buffer,UBYTE comp)
{
int cnt = 8;
assert(comp < m_ucCount);
x <<= 3;
if (ULONG(x) + 8 >= m_pulEnd[comp]) {
// End of line is affected, duplicate pixels there
do {
LONG *dst = line->m_pData + x;
LONG *end = line->m_pData + m_pulWidth[comp];
LONG *lst = line->m_pData + m_pulEnd[comp] - 1; // last valid pixel
memcpy(dst,buffer,8 * sizeof(LONG));
// Duplicate pixel over the edge.
dst = lst + 1;
while(dst < end) {
*dst++ = *lst;
}
buffer += 8;
line = line->m_pNext;
} while(line && --cnt);
} else {
do {
memcpy(line->m_pData + x,buffer,8 * sizeof(LONG));
buffer += 8;
line = line->m_pNext; // Duplicate at the end of the image.
} while(line && --cnt);
}
}
///
/// LineBuffer::FetchRegion
// Define a single 8x8 block starting at the x offset and the given
// line, taking the input 8x8 buffer.
void LineBuffer::FetchRegion(LONG x,const struct Line *line,LONG *buffer)
{
int cnt = 8;
do {
memcpy(buffer,line->m_pData + (x << 3),8 * sizeof(LONG));
buffer += 8;
line = line->m_pNext;
} while(line && --cnt);
}
///
|