1 /* SPMG/JPEG-LS IMPLEMENTATION V.2.1
2 =====================================
3 These programs are Copyright (c) University of British Columbia. All rights reserved.
4 They may be freely redistributed in their entirety provided that this copyright
5 notice is not removed. THEY MAY NOT BE SOLD FOR PROFIT OR INCORPORATED IN
6 COMMERCIAL PROGRAMS WITHOUT THE WRITTEN PERMISSION OF THE COPYRIGHT HOLDER.
7 Each program is provided as is, without any express or implied warranty,
8 without even the warranty of fitness for a particular purpose.
10 =========================================================
11 THIS SOFTWARE IS BASED ON HP's implementation of jpeg-ls:
12 =========================================================
14 LOCO-I/JPEG-LS IMPLEMENTATION V.0.90
15 -------------------------------------------------------------------------------
16 (c) COPYRIGHT HEWLETT-PACKARD COMPANY, 1995-1997.
17 HEWLETT-PACKARD COMPANY ("HP") DOES NOT WARRANT THE ACCURACY OR
18 COMPLETENESS OF THE INFORMATION GIVEN HERE. ANY USE MADE OF, OR
19 RELIANCE ON, SUCH INFORMATION IS ENTIRELY AT USER'S OWN RISK.
20 BY DOWNLOADING THE LOCO-I/JPEG-LS COMPRESSORS/DECOMPRESSORS
21 ("THE SOFTWARE") YOU AGREE TO BE BOUND BY THE TERMS AND CONDITIONS
22 OF THIS LICENSING AGREEMENT.
23 YOU MAY DOWNLOAD AND USE THE SOFTWARE FOR NON-COMMERCIAL PURPOSES
24 FREE OF CHARGE OR FURTHER OBLIGATION. YOU MAY NOT, DIRECTLY OR
25 INDIRECTLY, DISTRIBUTE THE SOFTWARE FOR A FEE, INCORPORATE THIS
26 SOFTWARE INTO ANY PRODUCT OFFERED FOR SALE, OR USE THE SOFTWARE
27 TO PROVIDE A SERVICE FOR WHICH A FEE IS CHARGED.
28 YOU MAY MAKE COPIES OF THE SOFTWARE AND DISTRIBUTE SUCH COPIES TO
29 OTHER PERSONS PROVIDED THAT SUCH COPIES ARE ACCOMPANIED BY
30 HEWLETT-PACKARD'S COPYRIGHT NOTICE AND THIS AGREEMENT AND THAT
31 SUCH OTHER PERSONS AGREE TO BE BOUND BY THE TERMS OF THIS AGREEMENT.
32 THE SOFTWARE IS NOT OF PRODUCT QUALITY AND MAY HAVE ERRORS OR DEFECTS.
33 THE JPEG-LS STANDARD IS STILL UNDER DEVELOPMENT. THE SOFTWARE IS NOT A
34 FINAL OR FULL IMPLEMENTATION OF THE STANDARD. HP GIVES NO EXPRESS OR
35 IMPLIED WARRANTY OF ANY KIND AND ANY IMPLIED WARRANTIES OF
36 MERCHANTABILITY AND FITNESS FOR PURPOSE ARE DISCLAIMED.
37 HP SHALL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL, INCIDENTAL,
38 OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE.
39 -------------------------------------------------------------------------------
42 /* melcode.c --- for processing in run mode
44 * Initial code by Alex Jakulin, Aug. 1995
46 * Modified and optimized: Gadiel Seroussi, October 1995
48 * Color Enhancement: Guillermo Sapiro, August 1996
50 * Modified and added Restart marker and input tables by:
51 * David Cheng-Hsiu Chu, and Ismail R. Ismail march 1999
59 #define MELCSTATES 32 /* number of melcode states */
61 static J[MELCSTATES] = {
62 0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,5,5,6,6,7,
63 7,8,9,10,11,12,13,14,15
66 static int melcstate[MAX_COMPONENTS], /* index to the state array */
67 melclen[MAX_COMPONENTS]; /* contents of the state array location
68 indexed by melcstate: the "expected"
69 run length is 2^melclen, shorter runs are
70 encoded by a 1 followed by the run length
71 in binary representation, wit a fixed length
74 static unsigned long melcorder[MAX_COMPONENTS]; /* 2^ melclen */
77 void init_process_run(int maxrun) /* maxrun is ignoreed when using MELCODE,
78 kept here for function compatibility */
82 for (n_c=0;n_c<components;n_c++) {
85 melcorder[n_c] = 1<<melclen[n_c];
91 process_run(int runlen, int eoline, int color)
96 while ( runlen >= melcorder[color] ) {
98 runlen -= melcorder[color];
99 if ( melcstate[color] < MELCSTATES ) {
100 melclen[color] = J[++melcstate[color]];
101 melcorder[color] = (1L<<melclen[color]);
105 /* send the required number of "hit" bits (one per occurrence
106 of a run of length melcorder). This number is never too big:
107 after 31 such "hit" bits, each "hit" would represent a run of 32K
112 if ( eoline==EOLINE ) {
113 /* when the run is broken by end-of-line, if there is
114 a non-null remainder, send it as if it were
121 /* now send the length of the remainder, encoded as a 0 followed
122 by the length in binary representation, to melclen bits */
123 limit_reduce = melclen[color]+1;
124 PUTBITS(runlen,limit_reduce);
126 /* adjust melcoder parameters */
127 if ( melcstate[color] ) {
128 melclen[color] = J[--melcstate[color]];
129 melcorder[color] = (1L<<melclen[color]);
140 /* retained for compatibility with ranked runs */