From 54c77d2cb0f734615febdb3cb33548bf4cd6e953 Mon Sep 17 00:00:00 2001 From: Pixel Date: Sun, 23 Jun 2002 11:19:06 +0000 Subject: Pfiou, huge work... --- psxdev/idctfst.c | 56 ++++++++++++++++++++++++++++---------------------------- 1 file changed, 28 insertions(+), 28 deletions(-) (limited to 'psxdev/idctfst.c') diff --git a/psxdev/idctfst.c b/psxdev/idctfst.c index 22faae6..345cdb1 100644 --- a/psxdev/idctfst.c +++ b/psxdev/idctfst.c @@ -59,7 +59,7 @@ * machines, and may also reduce the cost of multiplication (since there * are fewer one-bits in the constants). */ - + #define BITS_IN_JSAMPLE 8 #if BITS_IN_JSAMPLE == 8 @@ -108,7 +108,7 @@ * multiplication will do. For 12-bit data, the multiplier table is * declared INT32, so a 32-bit multiply will be used. */ - + #if BITS_IN_JSAMPLE == 8 #define DEQUANTIZE(coef,quantval) (coef) #else @@ -121,24 +121,24 @@ * We assume that int right shift is unsigned if INT32 right shift is. */ -#define DESCALE(x,n) ((x)>>(n)) +#define DESCALE(x,n) ((x)>>(n)) #define RANGE(n) (n) -#define BLOCK int +#define BLOCK int /* * Perform dequantization and inverse DCT on one block of coefficients. */ -#define DCTSIZE 8 -#define DCTSIZE2 64 - -static void IDCT1(BLOCK *block) -{ +#define DCTSIZE 8 +#define DCTSIZE2 64 + +static void IDCT1(BLOCK *block) +{ int val = RANGE(DESCALE(block[0], PASS1_BITS+3)); - int i; - for(i=0;i