isbn 2.0.4 → 2.0.5
Sign up to get free protection for your applications and to get access to all the features.
- data/{README → README.md} +5 -11
- data/Rakefile +20 -14
- data/isbn.gemspec +23 -0
- data/lib/isbn.rb +2 -0
- data/test/isbn_spec.rb +1 -1
- metadata +29 -316
- data/VERSION +0 -1
- data/src/gocr-0.48/.cvsignore +0 -6
- data/src/gocr-0.48/AUTHORS +0 -7
- data/src/gocr-0.48/BUGS +0 -55
- data/src/gocr-0.48/CREDITS +0 -17
- data/src/gocr-0.48/HISTORY +0 -243
- data/src/gocr-0.48/INSTALL +0 -83
- data/src/gocr-0.48/Makefile +0 -193
- data/src/gocr-0.48/Makefile.in +0 -193
- data/src/gocr-0.48/README +0 -165
- data/src/gocr-0.48/READMEde.txt +0 -80
- data/src/gocr-0.48/REMARK.txt +0 -18
- data/src/gocr-0.48/REVIEW +0 -538
- data/src/gocr-0.48/TODO +0 -65
- data/src/gocr-0.48/bin/.cvsignore +0 -2
- data/src/gocr-0.48/bin/create_db +0 -38
- data/src/gocr-0.48/bin/gocr.tcl +0 -527
- data/src/gocr-0.48/bin/gocr_chk.sh +0 -44
- data/src/gocr-0.48/configure +0 -4689
- data/src/gocr-0.48/configure.in +0 -71
- data/src/gocr-0.48/doc/.#Makefile.1.6 +0 -39
- data/src/gocr-0.48/doc/.cvsignore +0 -2
- data/src/gocr-0.48/doc/Makefile +0 -39
- data/src/gocr-0.48/doc/Makefile.in +0 -39
- data/src/gocr-0.48/doc/example.dtd +0 -53
- data/src/gocr-0.48/doc/example.xml +0 -21
- data/src/gocr-0.48/doc/examples.txt +0 -67
- data/src/gocr-0.48/doc/gocr.html +0 -578
- data/src/gocr-0.48/doc/unicode.txt +0 -57
- data/src/gocr-0.48/examples/.#Makefile.1.22 +0 -166
- data/src/gocr-0.48/examples/4x6.png +0 -0
- data/src/gocr-0.48/examples/4x6.txt +0 -2
- data/src/gocr-0.48/examples/5x7.png +0 -0
- data/src/gocr-0.48/examples/5x7.png.txt +0 -2
- data/src/gocr-0.48/examples/5x8.png +0 -0
- data/src/gocr-0.48/examples/5x8.png.txt +0 -2
- data/src/gocr-0.48/examples/Makefile +0 -166
- data/src/gocr-0.48/examples/color.fig +0 -20
- data/src/gocr-0.48/examples/ex.fig +0 -16
- data/src/gocr-0.48/examples/font.tex +0 -22
- data/src/gocr-0.48/examples/font1.tex +0 -46
- data/src/gocr-0.48/examples/font2.fig +0 -27
- data/src/gocr-0.48/examples/font_nw.tex +0 -24
- data/src/gocr-0.48/examples/handwrt1.jpg +0 -0
- data/src/gocr-0.48/examples/handwrt1.txt +0 -10
- data/src/gocr-0.48/examples/inverse.fig +0 -20
- data/src/gocr-0.48/examples/matrix.jpg +0 -0
- data/src/gocr-0.48/examples/ocr-a-subset.png +0 -0
- data/src/gocr-0.48/examples/ocr-a-subset.png.txt +0 -4
- data/src/gocr-0.48/examples/ocr-a.png +0 -0
- data/src/gocr-0.48/examples/ocr-a.txt +0 -6
- data/src/gocr-0.48/examples/ocr-b.png +0 -0
- data/src/gocr-0.48/examples/ocr-b.png.txt +0 -4
- data/src/gocr-0.48/examples/polish.tex +0 -28
- data/src/gocr-0.48/examples/rotate45.fig +0 -14
- data/src/gocr-0.48/examples/score +0 -36
- data/src/gocr-0.48/examples/text.tex +0 -28
- data/src/gocr-0.48/gpl.html +0 -537
- data/src/gocr-0.48/include/.cvsignore +0 -2
- data/src/gocr-0.48/include/config.h +0 -36
- data/src/gocr-0.48/include/config.h.in +0 -36
- data/src/gocr-0.48/include/version.h +0 -2
- data/src/gocr-0.48/install-sh +0 -3
- data/src/gocr-0.48/make.bat +0 -57
- data/src/gocr-0.48/man/.cvsignore +0 -2
- data/src/gocr-0.48/man/Makefile +0 -29
- data/src/gocr-0.48/man/Makefile.in +0 -29
- data/src/gocr-0.48/man/man1/gocr.1 +0 -166
- data/src/gocr-0.48/src/.cvsignore +0 -4
- data/src/gocr-0.48/src/Makefile +0 -132
- data/src/gocr-0.48/src/Makefile.in +0 -132
- data/src/gocr-0.48/src/amiga.h +0 -31
- data/src/gocr-0.48/src/barcode.c +0 -846
- data/src/gocr-0.48/src/barcode.c.orig +0 -593
- data/src/gocr-0.48/src/barcode.h +0 -11
- data/src/gocr-0.48/src/box.c +0 -372
- data/src/gocr-0.48/src/database.c +0 -462
- data/src/gocr-0.48/src/detect.c +0 -943
- data/src/gocr-0.48/src/gocr.c +0 -373
- data/src/gocr-0.48/src/gocr.h +0 -288
- data/src/gocr-0.48/src/jconv.c +0 -168
- data/src/gocr-0.48/src/job.c +0 -84
- data/src/gocr-0.48/src/lines.c +0 -350
- data/src/gocr-0.48/src/list.c +0 -334
- data/src/gocr-0.48/src/list.h +0 -90
- data/src/gocr-0.48/src/ocr0.c +0 -6756
- data/src/gocr-0.48/src/ocr0.h +0 -63
- data/src/gocr-0.48/src/ocr0n.c +0 -1475
- data/src/gocr-0.48/src/ocr1.c +0 -85
- data/src/gocr-0.48/src/ocr1.h +0 -3
- data/src/gocr-0.48/src/otsu.c +0 -289
- data/src/gocr-0.48/src/otsu.h +0 -23
- data/src/gocr-0.48/src/output.c +0 -289
- data/src/gocr-0.48/src/output.h +0 -37
- data/src/gocr-0.48/src/pcx.c +0 -153
- data/src/gocr-0.48/src/pcx.h +0 -9
- data/src/gocr-0.48/src/pgm2asc.c +0 -2893
- data/src/gocr-0.48/src/pgm2asc.h +0 -105
- data/src/gocr-0.48/src/pixel.c +0 -537
- data/src/gocr-0.48/src/pnm.c +0 -533
- data/src/gocr-0.48/src/pnm.h +0 -35
- data/src/gocr-0.48/src/progress.c +0 -87
- data/src/gocr-0.48/src/progress.h +0 -42
- data/src/gocr-0.48/src/remove.c +0 -703
- data/src/gocr-0.48/src/tga.c +0 -87
- data/src/gocr-0.48/src/tga.h +0 -6
- data/src/gocr-0.48/src/unicode.c +0 -1314
- data/src/gocr-0.48/src/unicode.h +0 -1257
- data/src/jpeg-7/Makefile.am +0 -133
- data/src/jpeg-7/Makefile.in +0 -1089
- data/src/jpeg-7/README +0 -322
- data/src/jpeg-7/aclocal.m4 +0 -8990
- data/src/jpeg-7/ansi2knr.1 +0 -36
- data/src/jpeg-7/ansi2knr.c +0 -739
- data/src/jpeg-7/cderror.h +0 -132
- data/src/jpeg-7/cdjpeg.c +0 -181
- data/src/jpeg-7/cdjpeg.h +0 -187
- data/src/jpeg-7/change.log +0 -270
- data/src/jpeg-7/cjpeg.1 +0 -325
- data/src/jpeg-7/cjpeg.c +0 -616
- data/src/jpeg-7/ckconfig.c +0 -402
- data/src/jpeg-7/coderules.txt +0 -118
- data/src/jpeg-7/config.guess +0 -1561
- data/src/jpeg-7/config.sub +0 -1686
- data/src/jpeg-7/configure +0 -17139
- data/src/jpeg-7/configure.ac +0 -317
- data/src/jpeg-7/depcomp +0 -630
- data/src/jpeg-7/djpeg.1 +0 -251
- data/src/jpeg-7/djpeg.c +0 -617
- data/src/jpeg-7/example.c +0 -433
- data/src/jpeg-7/filelist.txt +0 -215
- data/src/jpeg-7/install-sh +0 -520
- data/src/jpeg-7/install.txt +0 -1097
- data/src/jpeg-7/jaricom.c +0 -148
- data/src/jpeg-7/jcapimin.c +0 -282
- data/src/jpeg-7/jcapistd.c +0 -161
- data/src/jpeg-7/jcarith.c +0 -921
- data/src/jpeg-7/jccoefct.c +0 -453
- data/src/jpeg-7/jccolor.c +0 -459
- data/src/jpeg-7/jcdctmgr.c +0 -482
- data/src/jpeg-7/jchuff.c +0 -1612
- data/src/jpeg-7/jcinit.c +0 -65
- data/src/jpeg-7/jcmainct.c +0 -293
- data/src/jpeg-7/jcmarker.c +0 -667
- data/src/jpeg-7/jcmaster.c +0 -770
- data/src/jpeg-7/jcomapi.c +0 -106
- data/src/jpeg-7/jconfig.bcc +0 -48
- data/src/jpeg-7/jconfig.cfg +0 -45
- data/src/jpeg-7/jconfig.dj +0 -38
- data/src/jpeg-7/jconfig.mac +0 -43
- data/src/jpeg-7/jconfig.manx +0 -43
- data/src/jpeg-7/jconfig.mc6 +0 -52
- data/src/jpeg-7/jconfig.sas +0 -43
- data/src/jpeg-7/jconfig.st +0 -42
- data/src/jpeg-7/jconfig.txt +0 -155
- data/src/jpeg-7/jconfig.vc +0 -45
- data/src/jpeg-7/jconfig.vms +0 -37
- data/src/jpeg-7/jconfig.wat +0 -38
- data/src/jpeg-7/jcparam.c +0 -632
- data/src/jpeg-7/jcprepct.c +0 -358
- data/src/jpeg-7/jcsample.c +0 -545
- data/src/jpeg-7/jctrans.c +0 -381
- data/src/jpeg-7/jdapimin.c +0 -396
- data/src/jpeg-7/jdapistd.c +0 -275
- data/src/jpeg-7/jdarith.c +0 -762
- data/src/jpeg-7/jdatadst.c +0 -151
- data/src/jpeg-7/jdatasrc.c +0 -212
- data/src/jpeg-7/jdcoefct.c +0 -736
- data/src/jpeg-7/jdcolor.c +0 -396
- data/src/jpeg-7/jdct.h +0 -393
- data/src/jpeg-7/jddctmgr.c +0 -382
- data/src/jpeg-7/jdhuff.c +0 -1309
- data/src/jpeg-7/jdinput.c +0 -384
- data/src/jpeg-7/jdmainct.c +0 -512
- data/src/jpeg-7/jdmarker.c +0 -1360
- data/src/jpeg-7/jdmaster.c +0 -663
- data/src/jpeg-7/jdmerge.c +0 -400
- data/src/jpeg-7/jdpostct.c +0 -290
- data/src/jpeg-7/jdsample.c +0 -361
- data/src/jpeg-7/jdtrans.c +0 -136
- data/src/jpeg-7/jerror.c +0 -252
- data/src/jpeg-7/jerror.h +0 -304
- data/src/jpeg-7/jfdctflt.c +0 -174
- data/src/jpeg-7/jfdctfst.c +0 -230
- data/src/jpeg-7/jfdctint.c +0 -4348
- data/src/jpeg-7/jidctflt.c +0 -242
- data/src/jpeg-7/jidctfst.c +0 -368
- data/src/jpeg-7/jidctint.c +0 -5137
- data/src/jpeg-7/jinclude.h +0 -91
- data/src/jpeg-7/jmemansi.c +0 -167
- data/src/jpeg-7/jmemdos.c +0 -638
- data/src/jpeg-7/jmemdosa.asm +0 -379
- data/src/jpeg-7/jmemmac.c +0 -289
- data/src/jpeg-7/jmemmgr.c +0 -1118
- data/src/jpeg-7/jmemname.c +0 -276
- data/src/jpeg-7/jmemnobs.c +0 -109
- data/src/jpeg-7/jmemsys.h +0 -198
- data/src/jpeg-7/jmorecfg.h +0 -369
- data/src/jpeg-7/jpegint.h +0 -395
- data/src/jpeg-7/jpeglib.h +0 -1135
- data/src/jpeg-7/jpegtran.1 +0 -272
- data/src/jpeg-7/jpegtran.c +0 -546
- data/src/jpeg-7/jquant1.c +0 -856
- data/src/jpeg-7/jquant2.c +0 -1310
- data/src/jpeg-7/jutils.c +0 -179
- data/src/jpeg-7/jversion.h +0 -14
- data/src/jpeg-7/libjpeg.map +0 -4
- data/src/jpeg-7/libjpeg.txt +0 -3067
- data/src/jpeg-7/ltmain.sh +0 -8406
- data/src/jpeg-7/makcjpeg.st +0 -36
- data/src/jpeg-7/makdjpeg.st +0 -36
- data/src/jpeg-7/makeadsw.vc6 +0 -77
- data/src/jpeg-7/makeasln.vc9 +0 -33
- data/src/jpeg-7/makecdep.vc6 +0 -82
- data/src/jpeg-7/makecdsp.vc6 +0 -130
- data/src/jpeg-7/makecmak.vc6 +0 -159
- data/src/jpeg-7/makecvcp.vc9 +0 -186
- data/src/jpeg-7/makeddep.vc6 +0 -82
- data/src/jpeg-7/makeddsp.vc6 +0 -130
- data/src/jpeg-7/makedmak.vc6 +0 -159
- data/src/jpeg-7/makedvcp.vc9 +0 -186
- data/src/jpeg-7/makefile.ansi +0 -220
- data/src/jpeg-7/makefile.bcc +0 -291
- data/src/jpeg-7/makefile.dj +0 -226
- data/src/jpeg-7/makefile.manx +0 -220
- data/src/jpeg-7/makefile.mc6 +0 -255
- data/src/jpeg-7/makefile.mms +0 -224
- data/src/jpeg-7/makefile.sas +0 -258
- data/src/jpeg-7/makefile.unix +0 -234
- data/src/jpeg-7/makefile.vc +0 -217
- data/src/jpeg-7/makefile.vms +0 -142
- data/src/jpeg-7/makefile.wat +0 -239
- data/src/jpeg-7/makejdep.vc6 +0 -423
- data/src/jpeg-7/makejdsp.vc6 +0 -285
- data/src/jpeg-7/makejdsw.vc6 +0 -29
- data/src/jpeg-7/makejmak.vc6 +0 -425
- data/src/jpeg-7/makejsln.vc9 +0 -17
- data/src/jpeg-7/makejvcp.vc9 +0 -328
- data/src/jpeg-7/makeproj.mac +0 -213
- data/src/jpeg-7/makerdep.vc6 +0 -6
- data/src/jpeg-7/makerdsp.vc6 +0 -78
- data/src/jpeg-7/makermak.vc6 +0 -110
- data/src/jpeg-7/makervcp.vc9 +0 -133
- data/src/jpeg-7/maketdep.vc6 +0 -43
- data/src/jpeg-7/maketdsp.vc6 +0 -122
- data/src/jpeg-7/maketmak.vc6 +0 -131
- data/src/jpeg-7/maketvcp.vc9 +0 -178
- data/src/jpeg-7/makewdep.vc6 +0 -6
- data/src/jpeg-7/makewdsp.vc6 +0 -78
- data/src/jpeg-7/makewmak.vc6 +0 -110
- data/src/jpeg-7/makewvcp.vc9 +0 -133
- data/src/jpeg-7/makljpeg.st +0 -68
- data/src/jpeg-7/maktjpeg.st +0 -30
- data/src/jpeg-7/makvms.opt +0 -4
- data/src/jpeg-7/missing +0 -376
- data/src/jpeg-7/rdbmp.c +0 -439
- data/src/jpeg-7/rdcolmap.c +0 -253
- data/src/jpeg-7/rdgif.c +0 -38
- data/src/jpeg-7/rdjpgcom.1 +0 -63
- data/src/jpeg-7/rdjpgcom.c +0 -515
- data/src/jpeg-7/rdppm.c +0 -459
- data/src/jpeg-7/rdrle.c +0 -387
- data/src/jpeg-7/rdswitch.c +0 -365
- data/src/jpeg-7/rdtarga.c +0 -500
- data/src/jpeg-7/structure.txt +0 -945
- data/src/jpeg-7/testimg.bmp +0 -0
- data/src/jpeg-7/testimg.jpg +0 -0
- data/src/jpeg-7/testimg.ppm +0 -4
- data/src/jpeg-7/testimgp.jpg +0 -0
- data/src/jpeg-7/testorig.jpg +0 -0
- data/src/jpeg-7/testprog.jpg +0 -0
- data/src/jpeg-7/transupp.c +0 -1533
- data/src/jpeg-7/transupp.h +0 -205
- data/src/jpeg-7/usage.txt +0 -605
- data/src/jpeg-7/wizard.txt +0 -211
- data/src/jpeg-7/wrbmp.c +0 -442
- data/src/jpeg-7/wrgif.c +0 -399
- data/src/jpeg-7/wrjpgcom.1 +0 -103
- data/src/jpeg-7/wrjpgcom.c +0 -583
- data/src/jpeg-7/wrppm.c +0 -269
- data/src/jpeg-7/wrrle.c +0 -305
- data/src/jpeg-7/wrtarga.c +0 -253
data/src/jpeg-7/jidctflt.c
DELETED
@@ -1,242 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* jidctflt.c
|
3
|
-
*
|
4
|
-
* Copyright (C) 1994-1998, Thomas G. Lane.
|
5
|
-
* This file is part of the Independent JPEG Group's software.
|
6
|
-
* For conditions of distribution and use, see the accompanying README file.
|
7
|
-
*
|
8
|
-
* This file contains a floating-point implementation of the
|
9
|
-
* inverse DCT (Discrete Cosine Transform). In the IJG code, this routine
|
10
|
-
* must also perform dequantization of the input coefficients.
|
11
|
-
*
|
12
|
-
* This implementation should be more accurate than either of the integer
|
13
|
-
* IDCT implementations. However, it may not give the same results on all
|
14
|
-
* machines because of differences in roundoff behavior. Speed will depend
|
15
|
-
* on the hardware's floating point capacity.
|
16
|
-
*
|
17
|
-
* A 2-D IDCT can be done by 1-D IDCT on each column followed by 1-D IDCT
|
18
|
-
* on each row (or vice versa, but it's more convenient to emit a row at
|
19
|
-
* a time). Direct algorithms are also available, but they are much more
|
20
|
-
* complex and seem not to be any faster when reduced to code.
|
21
|
-
*
|
22
|
-
* This implementation is based on Arai, Agui, and Nakajima's algorithm for
|
23
|
-
* scaled DCT. Their original paper (Trans. IEICE E-71(11):1095) is in
|
24
|
-
* Japanese, but the algorithm is described in the Pennebaker & Mitchell
|
25
|
-
* JPEG textbook (see REFERENCES section in file README). The following code
|
26
|
-
* is based directly on figure 4-8 in P&M.
|
27
|
-
* While an 8-point DCT cannot be done in less than 11 multiplies, it is
|
28
|
-
* possible to arrange the computation so that many of the multiplies are
|
29
|
-
* simple scalings of the final outputs. These multiplies can then be
|
30
|
-
* folded into the multiplications or divisions by the JPEG quantization
|
31
|
-
* table entries. The AA&N method leaves only 5 multiplies and 29 adds
|
32
|
-
* to be done in the DCT itself.
|
33
|
-
* The primary disadvantage of this method is that with a fixed-point
|
34
|
-
* implementation, accuracy is lost due to imprecise representation of the
|
35
|
-
* scaled quantization values. However, that problem does not arise if
|
36
|
-
* we use floating point arithmetic.
|
37
|
-
*/
|
38
|
-
|
39
|
-
#define JPEG_INTERNALS
|
40
|
-
#include "jinclude.h"
|
41
|
-
#include "jpeglib.h"
|
42
|
-
#include "jdct.h" /* Private declarations for DCT subsystem */
|
43
|
-
|
44
|
-
#ifdef DCT_FLOAT_SUPPORTED
|
45
|
-
|
46
|
-
|
47
|
-
/*
|
48
|
-
* This module is specialized to the case DCTSIZE = 8.
|
49
|
-
*/
|
50
|
-
|
51
|
-
#if DCTSIZE != 8
|
52
|
-
Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
|
53
|
-
#endif
|
54
|
-
|
55
|
-
|
56
|
-
/* Dequantize a coefficient by multiplying it by the multiplier-table
|
57
|
-
* entry; produce a float result.
|
58
|
-
*/
|
59
|
-
|
60
|
-
#define DEQUANTIZE(coef,quantval) (((FAST_FLOAT) (coef)) * (quantval))
|
61
|
-
|
62
|
-
|
63
|
-
/*
|
64
|
-
* Perform dequantization and inverse DCT on one block of coefficients.
|
65
|
-
*/
|
66
|
-
|
67
|
-
GLOBAL(void)
|
68
|
-
jpeg_idct_float (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
69
|
-
JCOEFPTR coef_block,
|
70
|
-
JSAMPARRAY output_buf, JDIMENSION output_col)
|
71
|
-
{
|
72
|
-
FAST_FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
|
73
|
-
FAST_FLOAT tmp10, tmp11, tmp12, tmp13;
|
74
|
-
FAST_FLOAT z5, z10, z11, z12, z13;
|
75
|
-
JCOEFPTR inptr;
|
76
|
-
FLOAT_MULT_TYPE * quantptr;
|
77
|
-
FAST_FLOAT * wsptr;
|
78
|
-
JSAMPROW outptr;
|
79
|
-
JSAMPLE *range_limit = IDCT_range_limit(cinfo);
|
80
|
-
int ctr;
|
81
|
-
FAST_FLOAT workspace[DCTSIZE2]; /* buffers data between passes */
|
82
|
-
SHIFT_TEMPS
|
83
|
-
|
84
|
-
/* Pass 1: process columns from input, store into work array. */
|
85
|
-
|
86
|
-
inptr = coef_block;
|
87
|
-
quantptr = (FLOAT_MULT_TYPE *) compptr->dct_table;
|
88
|
-
wsptr = workspace;
|
89
|
-
for (ctr = DCTSIZE; ctr > 0; ctr--) {
|
90
|
-
/* Due to quantization, we will usually find that many of the input
|
91
|
-
* coefficients are zero, especially the AC terms. We can exploit this
|
92
|
-
* by short-circuiting the IDCT calculation for any column in which all
|
93
|
-
* the AC terms are zero. In that case each output is equal to the
|
94
|
-
* DC coefficient (with scale factor as needed).
|
95
|
-
* With typical images and quantization tables, half or more of the
|
96
|
-
* column DCT calculations can be simplified this way.
|
97
|
-
*/
|
98
|
-
|
99
|
-
if (inptr[DCTSIZE*1] == 0 && inptr[DCTSIZE*2] == 0 &&
|
100
|
-
inptr[DCTSIZE*3] == 0 && inptr[DCTSIZE*4] == 0 &&
|
101
|
-
inptr[DCTSIZE*5] == 0 && inptr[DCTSIZE*6] == 0 &&
|
102
|
-
inptr[DCTSIZE*7] == 0) {
|
103
|
-
/* AC terms all zero */
|
104
|
-
FAST_FLOAT dcval = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
|
105
|
-
|
106
|
-
wsptr[DCTSIZE*0] = dcval;
|
107
|
-
wsptr[DCTSIZE*1] = dcval;
|
108
|
-
wsptr[DCTSIZE*2] = dcval;
|
109
|
-
wsptr[DCTSIZE*3] = dcval;
|
110
|
-
wsptr[DCTSIZE*4] = dcval;
|
111
|
-
wsptr[DCTSIZE*5] = dcval;
|
112
|
-
wsptr[DCTSIZE*6] = dcval;
|
113
|
-
wsptr[DCTSIZE*7] = dcval;
|
114
|
-
|
115
|
-
inptr++; /* advance pointers to next column */
|
116
|
-
quantptr++;
|
117
|
-
wsptr++;
|
118
|
-
continue;
|
119
|
-
}
|
120
|
-
|
121
|
-
/* Even part */
|
122
|
-
|
123
|
-
tmp0 = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
|
124
|
-
tmp1 = DEQUANTIZE(inptr[DCTSIZE*2], quantptr[DCTSIZE*2]);
|
125
|
-
tmp2 = DEQUANTIZE(inptr[DCTSIZE*4], quantptr[DCTSIZE*4]);
|
126
|
-
tmp3 = DEQUANTIZE(inptr[DCTSIZE*6], quantptr[DCTSIZE*6]);
|
127
|
-
|
128
|
-
tmp10 = tmp0 + tmp2; /* phase 3 */
|
129
|
-
tmp11 = tmp0 - tmp2;
|
130
|
-
|
131
|
-
tmp13 = tmp1 + tmp3; /* phases 5-3 */
|
132
|
-
tmp12 = (tmp1 - tmp3) * ((FAST_FLOAT) 1.414213562) - tmp13; /* 2*c4 */
|
133
|
-
|
134
|
-
tmp0 = tmp10 + tmp13; /* phase 2 */
|
135
|
-
tmp3 = tmp10 - tmp13;
|
136
|
-
tmp1 = tmp11 + tmp12;
|
137
|
-
tmp2 = tmp11 - tmp12;
|
138
|
-
|
139
|
-
/* Odd part */
|
140
|
-
|
141
|
-
tmp4 = DEQUANTIZE(inptr[DCTSIZE*1], quantptr[DCTSIZE*1]);
|
142
|
-
tmp5 = DEQUANTIZE(inptr[DCTSIZE*3], quantptr[DCTSIZE*3]);
|
143
|
-
tmp6 = DEQUANTIZE(inptr[DCTSIZE*5], quantptr[DCTSIZE*5]);
|
144
|
-
tmp7 = DEQUANTIZE(inptr[DCTSIZE*7], quantptr[DCTSIZE*7]);
|
145
|
-
|
146
|
-
z13 = tmp6 + tmp5; /* phase 6 */
|
147
|
-
z10 = tmp6 - tmp5;
|
148
|
-
z11 = tmp4 + tmp7;
|
149
|
-
z12 = tmp4 - tmp7;
|
150
|
-
|
151
|
-
tmp7 = z11 + z13; /* phase 5 */
|
152
|
-
tmp11 = (z11 - z13) * ((FAST_FLOAT) 1.414213562); /* 2*c4 */
|
153
|
-
|
154
|
-
z5 = (z10 + z12) * ((FAST_FLOAT) 1.847759065); /* 2*c2 */
|
155
|
-
tmp10 = ((FAST_FLOAT) 1.082392200) * z12 - z5; /* 2*(c2-c6) */
|
156
|
-
tmp12 = ((FAST_FLOAT) -2.613125930) * z10 + z5; /* -2*(c2+c6) */
|
157
|
-
|
158
|
-
tmp6 = tmp12 - tmp7; /* phase 2 */
|
159
|
-
tmp5 = tmp11 - tmp6;
|
160
|
-
tmp4 = tmp10 + tmp5;
|
161
|
-
|
162
|
-
wsptr[DCTSIZE*0] = tmp0 + tmp7;
|
163
|
-
wsptr[DCTSIZE*7] = tmp0 - tmp7;
|
164
|
-
wsptr[DCTSIZE*1] = tmp1 + tmp6;
|
165
|
-
wsptr[DCTSIZE*6] = tmp1 - tmp6;
|
166
|
-
wsptr[DCTSIZE*2] = tmp2 + tmp5;
|
167
|
-
wsptr[DCTSIZE*5] = tmp2 - tmp5;
|
168
|
-
wsptr[DCTSIZE*4] = tmp3 + tmp4;
|
169
|
-
wsptr[DCTSIZE*3] = tmp3 - tmp4;
|
170
|
-
|
171
|
-
inptr++; /* advance pointers to next column */
|
172
|
-
quantptr++;
|
173
|
-
wsptr++;
|
174
|
-
}
|
175
|
-
|
176
|
-
/* Pass 2: process rows from work array, store into output array. */
|
177
|
-
/* Note that we must descale the results by a factor of 8 == 2**3. */
|
178
|
-
|
179
|
-
wsptr = workspace;
|
180
|
-
for (ctr = 0; ctr < DCTSIZE; ctr++) {
|
181
|
-
outptr = output_buf[ctr] + output_col;
|
182
|
-
/* Rows of zeroes can be exploited in the same way as we did with columns.
|
183
|
-
* However, the column calculation has created many nonzero AC terms, so
|
184
|
-
* the simplification applies less often (typically 5% to 10% of the time).
|
185
|
-
* And testing floats for zero is relatively expensive, so we don't bother.
|
186
|
-
*/
|
187
|
-
|
188
|
-
/* Even part */
|
189
|
-
|
190
|
-
tmp10 = wsptr[0] + wsptr[4];
|
191
|
-
tmp11 = wsptr[0] - wsptr[4];
|
192
|
-
|
193
|
-
tmp13 = wsptr[2] + wsptr[6];
|
194
|
-
tmp12 = (wsptr[2] - wsptr[6]) * ((FAST_FLOAT) 1.414213562) - tmp13;
|
195
|
-
|
196
|
-
tmp0 = tmp10 + tmp13;
|
197
|
-
tmp3 = tmp10 - tmp13;
|
198
|
-
tmp1 = tmp11 + tmp12;
|
199
|
-
tmp2 = tmp11 - tmp12;
|
200
|
-
|
201
|
-
/* Odd part */
|
202
|
-
|
203
|
-
z13 = wsptr[5] + wsptr[3];
|
204
|
-
z10 = wsptr[5] - wsptr[3];
|
205
|
-
z11 = wsptr[1] + wsptr[7];
|
206
|
-
z12 = wsptr[1] - wsptr[7];
|
207
|
-
|
208
|
-
tmp7 = z11 + z13;
|
209
|
-
tmp11 = (z11 - z13) * ((FAST_FLOAT) 1.414213562);
|
210
|
-
|
211
|
-
z5 = (z10 + z12) * ((FAST_FLOAT) 1.847759065); /* 2*c2 */
|
212
|
-
tmp10 = ((FAST_FLOAT) 1.082392200) * z12 - z5; /* 2*(c2-c6) */
|
213
|
-
tmp12 = ((FAST_FLOAT) -2.613125930) * z10 + z5; /* -2*(c2+c6) */
|
214
|
-
|
215
|
-
tmp6 = tmp12 - tmp7;
|
216
|
-
tmp5 = tmp11 - tmp6;
|
217
|
-
tmp4 = tmp10 + tmp5;
|
218
|
-
|
219
|
-
/* Final output stage: scale down by a factor of 8 and range-limit */
|
220
|
-
|
221
|
-
outptr[0] = range_limit[(int) DESCALE((INT32) (tmp0 + tmp7), 3)
|
222
|
-
& RANGE_MASK];
|
223
|
-
outptr[7] = range_limit[(int) DESCALE((INT32) (tmp0 - tmp7), 3)
|
224
|
-
& RANGE_MASK];
|
225
|
-
outptr[1] = range_limit[(int) DESCALE((INT32) (tmp1 + tmp6), 3)
|
226
|
-
& RANGE_MASK];
|
227
|
-
outptr[6] = range_limit[(int) DESCALE((INT32) (tmp1 - tmp6), 3)
|
228
|
-
& RANGE_MASK];
|
229
|
-
outptr[2] = range_limit[(int) DESCALE((INT32) (tmp2 + tmp5), 3)
|
230
|
-
& RANGE_MASK];
|
231
|
-
outptr[5] = range_limit[(int) DESCALE((INT32) (tmp2 - tmp5), 3)
|
232
|
-
& RANGE_MASK];
|
233
|
-
outptr[4] = range_limit[(int) DESCALE((INT32) (tmp3 + tmp4), 3)
|
234
|
-
& RANGE_MASK];
|
235
|
-
outptr[3] = range_limit[(int) DESCALE((INT32) (tmp3 - tmp4), 3)
|
236
|
-
& RANGE_MASK];
|
237
|
-
|
238
|
-
wsptr += DCTSIZE; /* advance pointer to next row */
|
239
|
-
}
|
240
|
-
}
|
241
|
-
|
242
|
-
#endif /* DCT_FLOAT_SUPPORTED */
|
data/src/jpeg-7/jidctfst.c
DELETED
@@ -1,368 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* jidctfst.c
|
3
|
-
*
|
4
|
-
* Copyright (C) 1994-1998, Thomas G. Lane.
|
5
|
-
* This file is part of the Independent JPEG Group's software.
|
6
|
-
* For conditions of distribution and use, see the accompanying README file.
|
7
|
-
*
|
8
|
-
* This file contains a fast, not so accurate integer implementation of the
|
9
|
-
* inverse DCT (Discrete Cosine Transform). In the IJG code, this routine
|
10
|
-
* must also perform dequantization of the input coefficients.
|
11
|
-
*
|
12
|
-
* A 2-D IDCT can be done by 1-D IDCT on each column followed by 1-D IDCT
|
13
|
-
* on each row (or vice versa, but it's more convenient to emit a row at
|
14
|
-
* a time). Direct algorithms are also available, but they are much more
|
15
|
-
* complex and seem not to be any faster when reduced to code.
|
16
|
-
*
|
17
|
-
* This implementation is based on Arai, Agui, and Nakajima's algorithm for
|
18
|
-
* scaled DCT. Their original paper (Trans. IEICE E-71(11):1095) is in
|
19
|
-
* Japanese, but the algorithm is described in the Pennebaker & Mitchell
|
20
|
-
* JPEG textbook (see REFERENCES section in file README). The following code
|
21
|
-
* is based directly on figure 4-8 in P&M.
|
22
|
-
* While an 8-point DCT cannot be done in less than 11 multiplies, it is
|
23
|
-
* possible to arrange the computation so that many of the multiplies are
|
24
|
-
* simple scalings of the final outputs. These multiplies can then be
|
25
|
-
* folded into the multiplications or divisions by the JPEG quantization
|
26
|
-
* table entries. The AA&N method leaves only 5 multiplies and 29 adds
|
27
|
-
* to be done in the DCT itself.
|
28
|
-
* The primary disadvantage of this method is that with fixed-point math,
|
29
|
-
* accuracy is lost due to imprecise representation of the scaled
|
30
|
-
* quantization values. The smaller the quantization table entry, the less
|
31
|
-
* precise the scaled value, so this implementation does worse with high-
|
32
|
-
* quality-setting files than with low-quality ones.
|
33
|
-
*/
|
34
|
-
|
35
|
-
#define JPEG_INTERNALS
|
36
|
-
#include "jinclude.h"
|
37
|
-
#include "jpeglib.h"
|
38
|
-
#include "jdct.h" /* Private declarations for DCT subsystem */
|
39
|
-
|
40
|
-
#ifdef DCT_IFAST_SUPPORTED
|
41
|
-
|
42
|
-
|
43
|
-
/*
|
44
|
-
* This module is specialized to the case DCTSIZE = 8.
|
45
|
-
*/
|
46
|
-
|
47
|
-
#if DCTSIZE != 8
|
48
|
-
Sorry, this code only copes with 8x8 DCTs. /* deliberate syntax err */
|
49
|
-
#endif
|
50
|
-
|
51
|
-
|
52
|
-
/* Scaling decisions are generally the same as in the LL&M algorithm;
|
53
|
-
* see jidctint.c for more details. However, we choose to descale
|
54
|
-
* (right shift) multiplication products as soon as they are formed,
|
55
|
-
* rather than carrying additional fractional bits into subsequent additions.
|
56
|
-
* This compromises accuracy slightly, but it lets us save a few shifts.
|
57
|
-
* More importantly, 16-bit arithmetic is then adequate (for 8-bit samples)
|
58
|
-
* everywhere except in the multiplications proper; this saves a good deal
|
59
|
-
* of work on 16-bit-int machines.
|
60
|
-
*
|
61
|
-
* The dequantized coefficients are not integers because the AA&N scaling
|
62
|
-
* factors have been incorporated. We represent them scaled up by PASS1_BITS,
|
63
|
-
* so that the first and second IDCT rounds have the same input scaling.
|
64
|
-
* For 8-bit JSAMPLEs, we choose IFAST_SCALE_BITS = PASS1_BITS so as to
|
65
|
-
* avoid a descaling shift; this compromises accuracy rather drastically
|
66
|
-
* for small quantization table entries, but it saves a lot of shifts.
|
67
|
-
* For 12-bit JSAMPLEs, there's no hope of using 16x16 multiplies anyway,
|
68
|
-
* so we use a much larger scaling factor to preserve accuracy.
|
69
|
-
*
|
70
|
-
* A final compromise is to represent the multiplicative constants to only
|
71
|
-
* 8 fractional bits, rather than 13. This saves some shifting work on some
|
72
|
-
* machines, and may also reduce the cost of multiplication (since there
|
73
|
-
* are fewer one-bits in the constants).
|
74
|
-
*/
|
75
|
-
|
76
|
-
#if BITS_IN_JSAMPLE == 8
|
77
|
-
#define CONST_BITS 8
|
78
|
-
#define PASS1_BITS 2
|
79
|
-
#else
|
80
|
-
#define CONST_BITS 8
|
81
|
-
#define PASS1_BITS 1 /* lose a little precision to avoid overflow */
|
82
|
-
#endif
|
83
|
-
|
84
|
-
/* Some C compilers fail to reduce "FIX(constant)" at compile time, thus
|
85
|
-
* causing a lot of useless floating-point operations at run time.
|
86
|
-
* To get around this we use the following pre-calculated constants.
|
87
|
-
* If you change CONST_BITS you may want to add appropriate values.
|
88
|
-
* (With a reasonable C compiler, you can just rely on the FIX() macro...)
|
89
|
-
*/
|
90
|
-
|
91
|
-
#if CONST_BITS == 8
|
92
|
-
#define FIX_1_082392200 ((INT32) 277) /* FIX(1.082392200) */
|
93
|
-
#define FIX_1_414213562 ((INT32) 362) /* FIX(1.414213562) */
|
94
|
-
#define FIX_1_847759065 ((INT32) 473) /* FIX(1.847759065) */
|
95
|
-
#define FIX_2_613125930 ((INT32) 669) /* FIX(2.613125930) */
|
96
|
-
#else
|
97
|
-
#define FIX_1_082392200 FIX(1.082392200)
|
98
|
-
#define FIX_1_414213562 FIX(1.414213562)
|
99
|
-
#define FIX_1_847759065 FIX(1.847759065)
|
100
|
-
#define FIX_2_613125930 FIX(2.613125930)
|
101
|
-
#endif
|
102
|
-
|
103
|
-
|
104
|
-
/* We can gain a little more speed, with a further compromise in accuracy,
|
105
|
-
* by omitting the addition in a descaling shift. This yields an incorrectly
|
106
|
-
* rounded result half the time...
|
107
|
-
*/
|
108
|
-
|
109
|
-
#ifndef USE_ACCURATE_ROUNDING
|
110
|
-
#undef DESCALE
|
111
|
-
#define DESCALE(x,n) RIGHT_SHIFT(x, n)
|
112
|
-
#endif
|
113
|
-
|
114
|
-
|
115
|
-
/* Multiply a DCTELEM variable by an INT32 constant, and immediately
|
116
|
-
* descale to yield a DCTELEM result.
|
117
|
-
*/
|
118
|
-
|
119
|
-
#define MULTIPLY(var,const) ((DCTELEM) DESCALE((var) * (const), CONST_BITS))
|
120
|
-
|
121
|
-
|
122
|
-
/* Dequantize a coefficient by multiplying it by the multiplier-table
|
123
|
-
* entry; produce a DCTELEM result. For 8-bit data a 16x16->16
|
124
|
-
* multiplication will do. For 12-bit data, the multiplier table is
|
125
|
-
* declared INT32, so a 32-bit multiply will be used.
|
126
|
-
*/
|
127
|
-
|
128
|
-
#if BITS_IN_JSAMPLE == 8
|
129
|
-
#define DEQUANTIZE(coef,quantval) (((IFAST_MULT_TYPE) (coef)) * (quantval))
|
130
|
-
#else
|
131
|
-
#define DEQUANTIZE(coef,quantval) \
|
132
|
-
DESCALE((coef)*(quantval), IFAST_SCALE_BITS-PASS1_BITS)
|
133
|
-
#endif
|
134
|
-
|
135
|
-
|
136
|
-
/* Like DESCALE, but applies to a DCTELEM and produces an int.
|
137
|
-
* We assume that int right shift is unsigned if INT32 right shift is.
|
138
|
-
*/
|
139
|
-
|
140
|
-
#ifdef RIGHT_SHIFT_IS_UNSIGNED
|
141
|
-
#define ISHIFT_TEMPS DCTELEM ishift_temp;
|
142
|
-
#if BITS_IN_JSAMPLE == 8
|
143
|
-
#define DCTELEMBITS 16 /* DCTELEM may be 16 or 32 bits */
|
144
|
-
#else
|
145
|
-
#define DCTELEMBITS 32 /* DCTELEM must be 32 bits */
|
146
|
-
#endif
|
147
|
-
#define IRIGHT_SHIFT(x,shft) \
|
148
|
-
((ishift_temp = (x)) < 0 ? \
|
149
|
-
(ishift_temp >> (shft)) | ((~((DCTELEM) 0)) << (DCTELEMBITS-(shft))) : \
|
150
|
-
(ishift_temp >> (shft)))
|
151
|
-
#else
|
152
|
-
#define ISHIFT_TEMPS
|
153
|
-
#define IRIGHT_SHIFT(x,shft) ((x) >> (shft))
|
154
|
-
#endif
|
155
|
-
|
156
|
-
#ifdef USE_ACCURATE_ROUNDING
|
157
|
-
#define IDESCALE(x,n) ((int) IRIGHT_SHIFT((x) + (1 << ((n)-1)), n))
|
158
|
-
#else
|
159
|
-
#define IDESCALE(x,n) ((int) IRIGHT_SHIFT(x, n))
|
160
|
-
#endif
|
161
|
-
|
162
|
-
|
163
|
-
/*
|
164
|
-
* Perform dequantization and inverse DCT on one block of coefficients.
|
165
|
-
*/
|
166
|
-
|
167
|
-
GLOBAL(void)
|
168
|
-
jpeg_idct_ifast (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
169
|
-
JCOEFPTR coef_block,
|
170
|
-
JSAMPARRAY output_buf, JDIMENSION output_col)
|
171
|
-
{
|
172
|
-
DCTELEM tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
|
173
|
-
DCTELEM tmp10, tmp11, tmp12, tmp13;
|
174
|
-
DCTELEM z5, z10, z11, z12, z13;
|
175
|
-
JCOEFPTR inptr;
|
176
|
-
IFAST_MULT_TYPE * quantptr;
|
177
|
-
int * wsptr;
|
178
|
-
JSAMPROW outptr;
|
179
|
-
JSAMPLE *range_limit = IDCT_range_limit(cinfo);
|
180
|
-
int ctr;
|
181
|
-
int workspace[DCTSIZE2]; /* buffers data between passes */
|
182
|
-
SHIFT_TEMPS /* for DESCALE */
|
183
|
-
ISHIFT_TEMPS /* for IDESCALE */
|
184
|
-
|
185
|
-
/* Pass 1: process columns from input, store into work array. */
|
186
|
-
|
187
|
-
inptr = coef_block;
|
188
|
-
quantptr = (IFAST_MULT_TYPE *) compptr->dct_table;
|
189
|
-
wsptr = workspace;
|
190
|
-
for (ctr = DCTSIZE; ctr > 0; ctr--) {
|
191
|
-
/* Due to quantization, we will usually find that many of the input
|
192
|
-
* coefficients are zero, especially the AC terms. We can exploit this
|
193
|
-
* by short-circuiting the IDCT calculation for any column in which all
|
194
|
-
* the AC terms are zero. In that case each output is equal to the
|
195
|
-
* DC coefficient (with scale factor as needed).
|
196
|
-
* With typical images and quantization tables, half or more of the
|
197
|
-
* column DCT calculations can be simplified this way.
|
198
|
-
*/
|
199
|
-
|
200
|
-
if (inptr[DCTSIZE*1] == 0 && inptr[DCTSIZE*2] == 0 &&
|
201
|
-
inptr[DCTSIZE*3] == 0 && inptr[DCTSIZE*4] == 0 &&
|
202
|
-
inptr[DCTSIZE*5] == 0 && inptr[DCTSIZE*6] == 0 &&
|
203
|
-
inptr[DCTSIZE*7] == 0) {
|
204
|
-
/* AC terms all zero */
|
205
|
-
int dcval = (int) DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
|
206
|
-
|
207
|
-
wsptr[DCTSIZE*0] = dcval;
|
208
|
-
wsptr[DCTSIZE*1] = dcval;
|
209
|
-
wsptr[DCTSIZE*2] = dcval;
|
210
|
-
wsptr[DCTSIZE*3] = dcval;
|
211
|
-
wsptr[DCTSIZE*4] = dcval;
|
212
|
-
wsptr[DCTSIZE*5] = dcval;
|
213
|
-
wsptr[DCTSIZE*6] = dcval;
|
214
|
-
wsptr[DCTSIZE*7] = dcval;
|
215
|
-
|
216
|
-
inptr++; /* advance pointers to next column */
|
217
|
-
quantptr++;
|
218
|
-
wsptr++;
|
219
|
-
continue;
|
220
|
-
}
|
221
|
-
|
222
|
-
/* Even part */
|
223
|
-
|
224
|
-
tmp0 = DEQUANTIZE(inptr[DCTSIZE*0], quantptr[DCTSIZE*0]);
|
225
|
-
tmp1 = DEQUANTIZE(inptr[DCTSIZE*2], quantptr[DCTSIZE*2]);
|
226
|
-
tmp2 = DEQUANTIZE(inptr[DCTSIZE*4], quantptr[DCTSIZE*4]);
|
227
|
-
tmp3 = DEQUANTIZE(inptr[DCTSIZE*6], quantptr[DCTSIZE*6]);
|
228
|
-
|
229
|
-
tmp10 = tmp0 + tmp2; /* phase 3 */
|
230
|
-
tmp11 = tmp0 - tmp2;
|
231
|
-
|
232
|
-
tmp13 = tmp1 + tmp3; /* phases 5-3 */
|
233
|
-
tmp12 = MULTIPLY(tmp1 - tmp3, FIX_1_414213562) - tmp13; /* 2*c4 */
|
234
|
-
|
235
|
-
tmp0 = tmp10 + tmp13; /* phase 2 */
|
236
|
-
tmp3 = tmp10 - tmp13;
|
237
|
-
tmp1 = tmp11 + tmp12;
|
238
|
-
tmp2 = tmp11 - tmp12;
|
239
|
-
|
240
|
-
/* Odd part */
|
241
|
-
|
242
|
-
tmp4 = DEQUANTIZE(inptr[DCTSIZE*1], quantptr[DCTSIZE*1]);
|
243
|
-
tmp5 = DEQUANTIZE(inptr[DCTSIZE*3], quantptr[DCTSIZE*3]);
|
244
|
-
tmp6 = DEQUANTIZE(inptr[DCTSIZE*5], quantptr[DCTSIZE*5]);
|
245
|
-
tmp7 = DEQUANTIZE(inptr[DCTSIZE*7], quantptr[DCTSIZE*7]);
|
246
|
-
|
247
|
-
z13 = tmp6 + tmp5; /* phase 6 */
|
248
|
-
z10 = tmp6 - tmp5;
|
249
|
-
z11 = tmp4 + tmp7;
|
250
|
-
z12 = tmp4 - tmp7;
|
251
|
-
|
252
|
-
tmp7 = z11 + z13; /* phase 5 */
|
253
|
-
tmp11 = MULTIPLY(z11 - z13, FIX_1_414213562); /* 2*c4 */
|
254
|
-
|
255
|
-
z5 = MULTIPLY(z10 + z12, FIX_1_847759065); /* 2*c2 */
|
256
|
-
tmp10 = MULTIPLY(z12, FIX_1_082392200) - z5; /* 2*(c2-c6) */
|
257
|
-
tmp12 = MULTIPLY(z10, - FIX_2_613125930) + z5; /* -2*(c2+c6) */
|
258
|
-
|
259
|
-
tmp6 = tmp12 - tmp7; /* phase 2 */
|
260
|
-
tmp5 = tmp11 - tmp6;
|
261
|
-
tmp4 = tmp10 + tmp5;
|
262
|
-
|
263
|
-
wsptr[DCTSIZE*0] = (int) (tmp0 + tmp7);
|
264
|
-
wsptr[DCTSIZE*7] = (int) (tmp0 - tmp7);
|
265
|
-
wsptr[DCTSIZE*1] = (int) (tmp1 + tmp6);
|
266
|
-
wsptr[DCTSIZE*6] = (int) (tmp1 - tmp6);
|
267
|
-
wsptr[DCTSIZE*2] = (int) (tmp2 + tmp5);
|
268
|
-
wsptr[DCTSIZE*5] = (int) (tmp2 - tmp5);
|
269
|
-
wsptr[DCTSIZE*4] = (int) (tmp3 + tmp4);
|
270
|
-
wsptr[DCTSIZE*3] = (int) (tmp3 - tmp4);
|
271
|
-
|
272
|
-
inptr++; /* advance pointers to next column */
|
273
|
-
quantptr++;
|
274
|
-
wsptr++;
|
275
|
-
}
|
276
|
-
|
277
|
-
/* Pass 2: process rows from work array, store into output array. */
|
278
|
-
/* Note that we must descale the results by a factor of 8 == 2**3, */
|
279
|
-
/* and also undo the PASS1_BITS scaling. */
|
280
|
-
|
281
|
-
wsptr = workspace;
|
282
|
-
for (ctr = 0; ctr < DCTSIZE; ctr++) {
|
283
|
-
outptr = output_buf[ctr] + output_col;
|
284
|
-
/* Rows of zeroes can be exploited in the same way as we did with columns.
|
285
|
-
* However, the column calculation has created many nonzero AC terms, so
|
286
|
-
* the simplification applies less often (typically 5% to 10% of the time).
|
287
|
-
* On machines with very fast multiplication, it's possible that the
|
288
|
-
* test takes more time than it's worth. In that case this section
|
289
|
-
* may be commented out.
|
290
|
-
*/
|
291
|
-
|
292
|
-
#ifndef NO_ZERO_ROW_TEST
|
293
|
-
if (wsptr[1] == 0 && wsptr[2] == 0 && wsptr[3] == 0 && wsptr[4] == 0 &&
|
294
|
-
wsptr[5] == 0 && wsptr[6] == 0 && wsptr[7] == 0) {
|
295
|
-
/* AC terms all zero */
|
296
|
-
JSAMPLE dcval = range_limit[IDESCALE(wsptr[0], PASS1_BITS+3)
|
297
|
-
& RANGE_MASK];
|
298
|
-
|
299
|
-
outptr[0] = dcval;
|
300
|
-
outptr[1] = dcval;
|
301
|
-
outptr[2] = dcval;
|
302
|
-
outptr[3] = dcval;
|
303
|
-
outptr[4] = dcval;
|
304
|
-
outptr[5] = dcval;
|
305
|
-
outptr[6] = dcval;
|
306
|
-
outptr[7] = dcval;
|
307
|
-
|
308
|
-
wsptr += DCTSIZE; /* advance pointer to next row */
|
309
|
-
continue;
|
310
|
-
}
|
311
|
-
#endif
|
312
|
-
|
313
|
-
/* Even part */
|
314
|
-
|
315
|
-
tmp10 = ((DCTELEM) wsptr[0] + (DCTELEM) wsptr[4]);
|
316
|
-
tmp11 = ((DCTELEM) wsptr[0] - (DCTELEM) wsptr[4]);
|
317
|
-
|
318
|
-
tmp13 = ((DCTELEM) wsptr[2] + (DCTELEM) wsptr[6]);
|
319
|
-
tmp12 = MULTIPLY((DCTELEM) wsptr[2] - (DCTELEM) wsptr[6], FIX_1_414213562)
|
320
|
-
- tmp13;
|
321
|
-
|
322
|
-
tmp0 = tmp10 + tmp13;
|
323
|
-
tmp3 = tmp10 - tmp13;
|
324
|
-
tmp1 = tmp11 + tmp12;
|
325
|
-
tmp2 = tmp11 - tmp12;
|
326
|
-
|
327
|
-
/* Odd part */
|
328
|
-
|
329
|
-
z13 = (DCTELEM) wsptr[5] + (DCTELEM) wsptr[3];
|
330
|
-
z10 = (DCTELEM) wsptr[5] - (DCTELEM) wsptr[3];
|
331
|
-
z11 = (DCTELEM) wsptr[1] + (DCTELEM) wsptr[7];
|
332
|
-
z12 = (DCTELEM) wsptr[1] - (DCTELEM) wsptr[7];
|
333
|
-
|
334
|
-
tmp7 = z11 + z13; /* phase 5 */
|
335
|
-
tmp11 = MULTIPLY(z11 - z13, FIX_1_414213562); /* 2*c4 */
|
336
|
-
|
337
|
-
z5 = MULTIPLY(z10 + z12, FIX_1_847759065); /* 2*c2 */
|
338
|
-
tmp10 = MULTIPLY(z12, FIX_1_082392200) - z5; /* 2*(c2-c6) */
|
339
|
-
tmp12 = MULTIPLY(z10, - FIX_2_613125930) + z5; /* -2*(c2+c6) */
|
340
|
-
|
341
|
-
tmp6 = tmp12 - tmp7; /* phase 2 */
|
342
|
-
tmp5 = tmp11 - tmp6;
|
343
|
-
tmp4 = tmp10 + tmp5;
|
344
|
-
|
345
|
-
/* Final output stage: scale down by a factor of 8 and range-limit */
|
346
|
-
|
347
|
-
outptr[0] = range_limit[IDESCALE(tmp0 + tmp7, PASS1_BITS+3)
|
348
|
-
& RANGE_MASK];
|
349
|
-
outptr[7] = range_limit[IDESCALE(tmp0 - tmp7, PASS1_BITS+3)
|
350
|
-
& RANGE_MASK];
|
351
|
-
outptr[1] = range_limit[IDESCALE(tmp1 + tmp6, PASS1_BITS+3)
|
352
|
-
& RANGE_MASK];
|
353
|
-
outptr[6] = range_limit[IDESCALE(tmp1 - tmp6, PASS1_BITS+3)
|
354
|
-
& RANGE_MASK];
|
355
|
-
outptr[2] = range_limit[IDESCALE(tmp2 + tmp5, PASS1_BITS+3)
|
356
|
-
& RANGE_MASK];
|
357
|
-
outptr[5] = range_limit[IDESCALE(tmp2 - tmp5, PASS1_BITS+3)
|
358
|
-
& RANGE_MASK];
|
359
|
-
outptr[4] = range_limit[IDESCALE(tmp3 + tmp4, PASS1_BITS+3)
|
360
|
-
& RANGE_MASK];
|
361
|
-
outptr[3] = range_limit[IDESCALE(tmp3 - tmp4, PASS1_BITS+3)
|
362
|
-
& RANGE_MASK];
|
363
|
-
|
364
|
-
wsptr += DCTSIZE; /* advance pointer to next row */
|
365
|
-
}
|
366
|
-
}
|
367
|
-
|
368
|
-
#endif /* DCT_IFAST_SUPPORTED */
|