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
|
/*
* JPEGutil.c --
*
* Various utility routines used in the jpeg encoder/decoder. Large parts
* are stolen from the IJG code, so:
*
* Copyright (C) 1991, 1992, Thomas G. Lane.
* Part of the Independent JPEG Group's software.
* See the file Copyright for more details.
*
* Copyright (c) 1993 Brian C. Smith, The Regents of the University
* of California
* All rights reserved.
*
* Copyright (c) 1994 Kongji Huang and Brian C. Smith.
* Cornell University
* All rights reserved.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose, without fee, and without written agreement is
* hereby granted, provided that the above copyright notice and the following
* two paragraphs appear in all copies of this software.
*
* IN NO EVENT SHALL CORNELL UNIVERSITY BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF CORNELL
* UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* CORNELL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
* ON AN "AS IS" BASIS, AND CORNELL UNIVERSITY HAS NO OBLIGATION TO
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* #include <malloc.h> */
#include "JPEG.H"
#include "MCU.H"
#include "PROTO.H"
/* Papyrus 3 redefined basic types */
#ifndef FILENAME83 /* this is for the normal machines ... */
#include "PapyEalloc3.h"
#include "PapyFileSystem3.h"
#else /* FILENAME83 defined for the DOS machines */
#ifndef PapyEalloc3H
#include "Papaloc3.h"
#endif
#ifndef PapyFileSystem3H
#include "PapFSys3.h"
#endif
#endif
/*
* To fix memory leaks, memory is allocated once for the mcu buffers.
* Enough memory is reserved to accomodate up to 4096-wide images
* with up to 4 components.
*/
char mcuROW1Memory[4096 * sizeof(MCU)];
char mcuROW2Memory[4096 * sizeof(MCU)];
char buf1Memory[4096 * 4 * sizeof(ComponentType)];
char buf2Memory[4096 * 4 * sizeof(ComponentType)];
unsigned int bitMask[] = { 0xffffffff, 0x7fffffff, 0x3fffffff, 0x1fffffff,
0x0fffffff, 0x07ffffff, 0x03ffffff, 0x01ffffff,
0x00ffffff, 0x007fffff, 0x003fffff, 0x001fffff,
0x000fffff, 0x0007ffff, 0x0003ffff, 0x0001ffff,
0x0000ffff, 0x00007fff, 0x00003fff, 0x00001fff,
0x00000fff, 0x000007ff, 0x000003ff, 0x000001ff,
0x000000ff, 0x0000007f, 0x0000003f, 0x0000001f,
0x0000000f, 0x00000007, 0x00000003, 0x00000001};
/*
*--------------------------------------------------------------
*
* JroundUp --
*
* Compute a rounded up to next multiple of b; a >= 0, b > 0
*
* Results:
* Rounded up value.
*
* Side effects:
* None.
*
*--------------------------------------------------------------
*/
int JroundUp (int a, int b)
{
a += b - 1;
return a - (a % b);
}
/*
*--------------------------------------------------------------
*
* DecoderStructInit --
*
* Initalize the rest of the fields in the decompression
* structure.
*
* Results:
* None.
*
* Side effects:
* None.
*
*--------------------------------------------------------------
*/
void DecoderStructInit (DecompressInfo *dcPtr)
{
char *buf1,*buf2;
short ci,i;
JpegComponentInfo *compPtr;
int mcuSize;
/*
* Check sampling factor validity.
*/
for (ci = 0; ci < dcPtr->numComponents; ci++) {
compPtr = &dcPtr->compInfo[ci];
if ((compPtr->hSampFactor != 1) || (compPtr->vSampFactor != 1)) {
fprintf (stderr, "Error: Downsampling is not supported.\n");
return; /* MAL exit(-1); */
}
}
/*
* Prepare array describing MCU composition
*/
if (dcPtr->compsInScan == 1) {
dcPtr->MCUmembership[0] = 0;
} else {
short ci;
if (dcPtr->compsInScan > 4) {
fprintf (stderr, "Too many components for interleaved scan");
return; /* MAL exit(1); */
}
for (ci = 0; ci < dcPtr->compsInScan; ci++) {
dcPtr->MCUmembership[ci] = ci;
}
}
/*
* Initialize mucROW1 and mcuROW2 which buffer two rows of
* pixels for predictor calculation.
*/
mcuROW1 = (MCU *) mcuROW1Memory;
mcuROW2 = (MCU *) mcuROW2Memory;
mcuSize=dcPtr->compsInScan * sizeof(ComponentType);
buf1 = buf1Memory;
buf2 = buf2Memory;
for (i=0;i<dcPtr->imageWidth;i++) {
mcuROW1[i]=(MCU)(buf1+i*mcuSize);
mcuROW2[i]=(MCU)(buf2+i*mcuSize);
}
}/*endof DecoderStructInit*/
/*
*--------------------------------------------------------------
*
* FixHuffTbl --
*
* Compute derived values for a Huffman table one the DHT marker
* has been processed. This generates both the encoding and
* decoding tables.
*
* Results:
* None.
*
* Side effects:
* None.
*
*--------------------------------------------------------------
*/
void
FixHuffTbl (HuffmanTable *htbl)
{
int p, i, l, lastp, si;
char huffsize[257];
Ushort huffcode[257];
Ushort code;
int size;
int value, ll, ul;
/*
* Figure C.1: make table of Huffman code length for each symbol
* Note that this is in code-length order.
*/
p = 0;
for (l = 1; l <= 16; l++) {
for (i = 1; i <= (int)htbl->bits[l]; i++)
huffsize[p++] = (char)l;
}
huffsize[p] = 0;
lastp = p;
/*
* Figure C.2: generate the codes themselves
* Note that this is in code-length order.
*/
code = 0;
si = huffsize[0];
p = 0;
while (huffsize[p]) {
while (((int)huffsize[p]) == si) {
huffcode[p++] = code;
code++;
}
code <<= 1;
si++;
}
/*
* Figure C.3: generate encoding tables
* These are code and size indexed by symbol value
* Set any codeless symbols to have code length 0; this allows
* EmitBits to detect any attempt to emit such symbols.
*/
MEMSET(htbl->ehufsi, 0, sizeof(htbl->ehufsi));
for (p = 0; p < lastp; p++) {
htbl->ehufco[htbl->huffval[p]] = huffcode[p];
htbl->ehufsi[htbl->huffval[p]] = huffsize[p];
}
/*
* Figure F.15: generate decoding tables
*/
p = 0;
for (l = 1; l <= 16; l++) {
if (htbl->bits[l]) {
htbl->valptr[l] = p;
htbl->mincode[l] = huffcode[p];
p += htbl->bits[l];
htbl->maxcode[l] = huffcode[p - 1];
} else {
htbl->maxcode[l] = -1;
}
}
/*
* We put in this value to ensure HuffDecode terminates.
*/
htbl->maxcode[17] = 0xFFFFFL;
/*
* Build the numbits, value lookup tables.
* These table allow us to gather 8 bits from the bits stream,
* and immediately lookup the size and value of the huffman codes.
* If size is zero, it means that more than 8 bits are in the huffman
* code (this happens about 3-4% of the time).
*/
/*bzero (htbl->numbits, sizeof(htbl->numbits));*/
memset(htbl->numbits, 0, sizeof(htbl->numbits));
for (p=0; p<lastp; p++) {
size = huffsize[p];
if (size <= 8) {
value = htbl->huffval[p];
code = huffcode[p];
ll = code << (8-size);
if (size < 8) {
ul = ll | bitMask[24+size];
} else {
ul = ll;
}
for (i=ll; i<=ul; i++) {
htbl->numbits[i] = size;
htbl->value[i] = value;
}
}
}
}
/*
*--------------------------------------------------------------
*
* FreeArray2D --
*
* Free the memory of a 2-D array pointed by arrayPtr.
*
* Results:
* None.
*
* Side effects:
* The memory pointed by arrayPtr is freed.
*
*--------------------------------------------------------------
*/
void FreeArray2D(char **arrayPtr)
{
/*
efree3(arrayPtr[0]);
*/
efree3 ((void **) arrayPtr);
}
|