/* SPMG/JPEG-LS IMPLEMENTATION V.2.1   =====================================   These programs are Copyright (c) University of British Columbia. All rights reserved.   They may be freely redistributed in their entirety provided that this copyright   notice is not removed. THEY MAY NOT BE SOLD FOR PROFIT OR INCORPORATED IN   COMMERCIAL PROGRAMS WITHOUT THE WRITTEN PERMISSION OF THE COPYRIGHT HOLDER.   Each program is provided as is, without any express or implied warranty,   without even the warranty of fitness for a particular purpose.   =========================================================   THIS SOFTWARE IS BASED ON HP's implementation of jpeg-ls:   =========================================================   LOCO-I/JPEG-LS IMPLEMENTATION V.0.90   -------------------------------------------------------------------------------   (c) COPYRIGHT HEWLETT-PACKARD COMPANY, 1995-1999.        HEWLETT-PACKARD COMPANY ("HP") DOES NOT WARRANT THE ACCURACY OR   COMPLETENESS OF THE INFORMATION GIVEN HERE.  ANY USE MADE OF, OR   RELIANCE ON, SUCH INFORMATION IS ENTIRELY AT USER'S OWN RISK.        BY DOWNLOADING THE LOCO-I/JPEG-LS COMPRESSORS/DECOMPRESSORS   ("THE SOFTWARE") YOU AGREE TO BE BOUND BY THE TERMS AND CONDITIONS   OF THIS LICENSING AGREEMENT.        YOU MAY DOWNLOAD AND USE THE SOFTWARE FOR NON-COMMERCIAL PURPOSES   FREE OF CHARGE OR FURTHER OBLIGATION.  YOU MAY NOT, DIRECTLY OR   INDIRECTLY, DISTRIBUTE THE SOFTWARE FOR A FEE, INCORPORATE THIS   SOFTWARE INTO ANY PRODUCT OFFERED FOR SALE, OR USE THE SOFTWARE   TO PROVIDE A SERVICE FOR WHICH A FEE IS CHARGED.        YOU MAY MAKE COPIES OF THE SOFTWARE AND DISTRIBUTE SUCH COPIES TO   OTHER PERSONS PROVIDED THAT SUCH COPIES ARE ACCOMPANIED BY   HEWLETT-PACKARD'S COPYRIGHT NOTICE AND THIS AGREEMENT AND THAT   SUCH OTHER PERSONS AGREE TO BE BOUND BY THE TERMS OF THIS AGREEMENT.        THE SOFTWARE IS NOT OF PRODUCT QUALITY AND MAY HAVE ERRORS OR DEFECTS.   THE JPEG-LS STANDARD IS STILL UNDER DEVELOPMENT. THE SOFTWARE IS NOT A   FINAL OR FULL IMPLEMENTATION OF THE STANDARD.  HP GIVES NO EXPRESS OR   IMPLIED WARRANTY OF ANY KIND AND ANY IMPLIED WARRANTIES OF   MERCHANTABILITY AND FITNESS FOR PURPOSE ARE DISCLAIMED.        HP SHALL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL, INCIDENTAL,   OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE.   -------------------------------------------------------------------------------*//* lossless_e.c --- the main pipeline which processes a scanline by doing *                prediction, context computation, context quantization, *                and statistics gathering. * * Initial code by Alex Jakulin,  Aug. 1995 * * Modified and optimized: Gadiel Seroussi, October 1995 * * Modified and added Restart marker and input tables by: * David Cheng-Hsiu Chu, and Ismail R. Ismail march 1999 */#include <stdio.h>#include <math.h>#include "global.h"#include "bitio.h"/*byte getk[65][3000];*//*byte clipPx[510];*/static int eor_limit;/* Do Golomb statistics and ENCODING for LOSS-LESS images */__inline void lossless_regular_mode(int Q, int SIGN, int Px, pixel *xp){	int At, Nt, Bt, absErrval, Errval, MErrval,	    Ix = *xp;	/* current pixel */	int	unary;	int temp;	byte k;	Nt = N[Q];    At = A[Q];			/* Prediction correction (A.4.2), compute prediction error (A.4.3)	   , and error quantization (A.4.4) */	Px = Px + (SIGN) * C[Q];/*Px = clipPx[Px+127];*/	clip(Px,alpha);	Errval = SIGN * (Ix - Px);	/* Modulo reduction of predication error (A.4.5) */	if (Errval < 0)		Errval += alpha;     /* Errval is now in [0.. alpha-1] */		/* Estimate k - Golomb coding variable computation (A.5.1) */	{	    register nst = Nt;		for(k=0; nst < At; nst<<=1, k++);	}/*k=getk[Nt][At];*/	/* Do Rice mapping and compute magnitude of Errval */	Bt = B[Q];	/* Error Mapping (A.5.2) */	temp = ( k==0 && ((Bt<<1) <= -Nt) );	if (Errval >= ceil_half_alpha) {		Errval -= alpha;		absErrval = -Errval;		MErrval = (absErrval<<1) - 1 - temp;	} else {		absErrval = Errval;		MErrval = (Errval<<1) + temp;	}				/* update bias stats (after correction of the difference) (A.6.1) */	B[Q] = (Bt += Errval);	/* update Golomb stats */	A[Q] += absErrval;	/* check for reset */	if (Nt == reset) {	/* reset for Golomb and bias cancelation at the same time */		N[Q] = (Nt >>= 1);		A[Q] >>= 1;		B[Q] = (Bt >>= 1);	}	N[Q] = (++Nt);	/* Do bias estimation for NEXT pixel */	/* Bias cancelation tries to put error in (-1,0] (A.6.2)*/		if  ( Bt <= -Nt ) {	    if (C[Q] > MIN_C)			--C[Q];	    if ( (B[Q] += Nt) <= -Nt ) 			B[Q] = -Nt+1;	} else if ( Bt > 0 ) {	    	    if (C[Q] < MAX_C)			++C[Q];				if ( (B[Q] -= Nt) > 0 )			B[Q] = 0;	}		/* Actually output the code: Mapped Error Encoding (Appendix G) */	unary = MErrval >> k;	if ( unary < limit ) {	    put_zeros(unary);		putbits((1 << k) + (MErrval & ((1 << k) - 1)), k + 1);	}	else {	    put_zeros(limit);	    putbits((1<<qbpp) + MErrval - 1, qbpp+1);	}}/* Do end of run encoding for LOSSLESS images */__inline void lossless_end_of_run(pixel Ra, pixel Rb, pixel Ix, int RItype){	int Errval,		MErrval,		Q,		absErrval,		oldmap,		k,		At,		unary;		register int Nt;	Q = EOR_0 + RItype;	Nt = N[Q];	At = A[Q];	Errval = Ix - Rb;	if (RItype)		At += Nt>>1;	else {		if ( Rb < Ra )			Errval = -Errval;	}	/* Estimate k */	for(k=0; Nt < At; Nt<<=1, k++);						if (Errval < 0)		Errval += alpha;	if( Errval >= ceil_half_alpha )		Errval -= alpha;					oldmap = ( k==0 && Errval && (B[Q]<<1)<Nt );	   	/*  Note: the Boolean variable 'oldmap' is not 		identical to the variable 'map' in the		JPEG-LS draft. We have		oldmap = (Errval<0) ? (1-map) : map;	*/	/* Error mapping for run-interrupted sample (Figure A.22) */				if( Errval < 0) {		MErrval = -(Errval<<1)-1-RItype+oldmap;		B[Q]++; 	}else		MErrval = (Errval<<1)-RItype-oldmap;		absErrval = (MErrval+1-RItype)>>1;	/* Update variables for run-interruped sample (Figure A.23) */	A[Q] += absErrval;	if (N[Q] == reset) {		N[Q] >>= 1;		A[Q] >>= 1;		B[Q] >>= 1;	}	N[Q]++; /* for next pixel */	/* Do the actual Golomb encoding: */	eor_limit = limit - limit_reduce;	unary = MErrval >> k;	if ( unary < eor_limit ) {		put_zeros(unary);		putbits((1 << k) + (MErrval & ((1 << k) - 1)), k + 1);	}	else {		put_zeros(eor_limit);		putbits((1<<qbpp) + MErrval-1, qbpp+1);	}}/* For line and plane interleaved mode in LOSS-LESS mode */void lossless_doscanline( pixel *psl,            /* previous scanline */			  pixel *sl,             /* current scanline */			  int no, int color)     /* number of values in it *//*** watch it! actual pixels in the scan line are numbered 1 to no .     pixels with indices < 1 or > no are dummy "border" pixels  */{	int i;	pixel Ra, Rb, Rc, Rd,   /* context pixels */	      Ix,	            /* current pixel */	      Px; 				/* predicted current pixel */	int SIGN;			    /* sign of current context */	int cont;				/* context */	i = 1;    /* pixel indices in a scan line go from 1 to no */	/**********************************************/	/* Do for all pixels in the row in 8-bit mode */	/**********************************************/	if (bpp16==FALSE) {				Rc = psl[0];		Rb = psl[1];		Ra = sl[0];		/*	For 8-bit Image */		do {			int RUNcnt;			Ix = sl[i];			Rd = psl[i + 1];			/* Context determination */			/* Quantize the gradient */			/* partial context number: if (b-e) is used then its 			   contribution is added after determination of the run state.			   Also, sign flipping, if any, occurs after run			   state determination */			cont =  vLUT[0][Rd - Rb + LUTMAX8] +					vLUT[1][Rb - Rc + LUTMAX8] +					vLUT[2][Rc - Ra + LUTMAX8];			if ( cont == 0 )			{		/*************** RUN STATE ***************************/				RUNcnt = 0;				if (Ix == Ra) {					while ( 1 ) {						++RUNcnt;						if (++i > no) {								/* Run-lenght coding when reach end of line (A.7.1.2) */							process_run(RUNcnt, EOLINE, color);							return;	 /* end of line */						}						Ix = sl[i];						if (Ix != Ra)	/* Run is broken */						{							Rd = psl[i + 1];							Rb = psl[i];							break;  /* out of while loop */						}						/* Run continues */					}				}				/* we only get here if the run is broken by				   a non-matching symbol */				/* Run-lenght coding when end of line not reached (A.7.1.2) */				process_run(RUNcnt,NOEOLINE, color);				/* This is the END_OF_RUN state */				lossless_end_of_run(Ra, Rb, Ix, (Ra==Rb));			}           			else {		/*************** REGULAR CONTEXT *******************/				predict(Rb, Ra, Rc);				/* do symmetric context merging */				cont = classmap[cont];					if (cont<0) {					SIGN=-1;					cont = -cont;				}				else					SIGN=+1;				/* output a rice code */				lossless_regular_mode(cont, SIGN, Px, &Ix);			}			/* context for next pixel: */			sl[i] = Ix;			Ra = Ix;			Rc = Rb;			Rb = Rd;		} while (++i <= no);		}	else	{		/***********************************************/		/* Do for all pixels in the row in 16-bit mode */		/***********************************************/		Rc = ENDIAN16(psl[0]);		Rb = ENDIAN16(psl[1]);		Ra = ENDIAN16(sl[0]);		/*	For 16-bit Image */		do {			int RUNcnt;			Ix = ENDIAN16(sl[i]);			Rd = ENDIAN16(psl[i + 1]);			/* Context determination */			/* Quantize the gradient */			/* partial context number: if (b-e) is used then its 			   contribution is added after determination of the run state.			   Also, sign flipping, if any, occurs after run			   state determination */					{				register int diff;				/* Following segment assumes that T3 <= LUTMAX16 */				/* This condition should have been checked when the					lookup tables were built */				diff = Rd - Rb;				if (diff < 0)					cont = (diff > -LUTMAX16) ? vLUT[0][diff + LUTMAX16] : 7*CREGIONS*CREGIONS;				else 					cont = (diff < LUTMAX16) ? vLUT[0][diff + LUTMAX16] : 8*CREGIONS*CREGIONS;				diff = Rb - Rc;				if (diff < 0)					cont += (diff > -LUTMAX16) ? vLUT[1][diff + LUTMAX16] : 7*CREGIONS;				else 					cont += (diff < LUTMAX16) ? vLUT[1][diff + LUTMAX16] : 8*CREGIONS;				diff = Rc - Ra;				if (diff < 0)					cont += (diff > -LUTMAX16) ? vLUT[2][diff + LUTMAX16] : 7;				else 					cont += (diff < LUTMAX16) ? vLUT[2][diff + LUTMAX16] : 8;			}			if ( cont == 0 ) {      /* Run state? */		/*************** RUN STATE ***************************/