[cvs] / xvidcore / src / prediction / mbprediction.c Repository:
ViewVC logotype

Diff of /xvidcore/src/prediction/mbprediction.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.7.2.2, Sun Feb 9 06:33:52 2003 UTC revision 1.11, Tue Nov 26 23:44:11 2002 UTC
# Line 1  Line 1 
1   /******************************************************************************  /*****************************************************************************
2    *                                                                            *   *
3    *  This file is part of XviD, a free MPEG-4 video encoder/decoder            *   *  XVID MPEG-4 VIDEO CODEC
4    *                                                                            *   *  - Prediction functions -
5    *  XviD is an implementation of a part of one or more MPEG-4 Video tools     *   *
6    *  as specified in ISO/IEC 14496-2 standard.  Those intending to use this    *   *  Copyright(C) 2001-2002 - Michael Militzer <isibaar@xvid.org>
7    *  software module in hardware or software products are advised that its     *   *  Copyright(C) 2001-2002 - Peter Ross <pross@xvid.org>
8    *  use may infringe existing patents or copyrights, and any such use         *   *
9    *  would be at such party's own risk.  The original developer of this        *   *  This file is part of XviD, a free MPEG-4 video encoder/decoder
10    *  software module and his/her company, and subsequent editors and their     *   *
11    *  companies, will have no liability for use of this software or             *   *  XviD is free software; you can redistribute it and/or modify it
12    *  modifications or derivatives thereof.                                     *   *  under the terms of the GNU General Public License as published by
13    *                                                                            *   *  the Free Software Foundation; either version 2 of the License, or
14    *  XviD is free software; you can redistribute it and/or modify it           *   *  (at your option) any later version.
15    *  under the terms of the GNU General Public License as published by         *   *
16    *  the Free Software Foundation; either version 2 of the License, or         *   *  This program is distributed in the hope that it will be useful,
17    *  (at your option) any later version.                                       *   *  but WITHOUT ANY WARRANTY; without even the implied warranty of
18    *                                                                            *   *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
19    *  XviD is distributed in the hope that it will be useful, but               *   *  GNU General Public License for more details.
20    *  WITHOUT ANY WARRANTY; without even the implied warranty of                *   *
21    *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the             *   *  You should have received a copy of the GNU General Public License
22    *  GNU General Public License for more details.                              *   *  along with this program; if not, write to the Free Software
23    *                                                                            *   *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
24    *  You should have received a copy of the GNU General Public License         *   *
25    *  along with this program; if not, write to the Free Software               *   *  Under section 8 of the GNU General Public License, the copyright
26    *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA  *   *  holders of XVID explicitly forbid distribution in the following
27    *                                                                            *   *  countries:
28    ******************************************************************************/   *
29     *    - Japan
30   /******************************************************************************   *    - United States of America
31    *                                                                            *   *
32    *  mbprediction.c                                                            *   *  Linking XviD statically or dynamically with other modules is making a
33    *                                                                            *   *  combined work based on XviD.  Thus, the terms and conditions of the
34    *  Copyright (C) 2001 - Michael Militzer <isibaar@xvid.org>                  *   *  GNU General Public License cover the whole combination.
35    *  Copyright (C) 2001 - Peter Ross <pross@cs.rmit.edu.au>                    *   *
36    *                                                                            *   *  As a special exception, the copyright holders of XviD give you
37    *  For more information visit the XviD homepage: http://www.xvid.org         *   *  permission to link XviD with independent modules that communicate with
38    *                                                                            *   *  XviD solely through the VFW1.1 and DShow interfaces, regardless of the
39    ******************************************************************************/   *  license terms of these independent modules, and to copy and distribute
40     *  the resulting combined work under terms of your choice, provided that
41   /******************************************************************************   *  every copy of the combined work is accompanied by a complete copy of
42    *                                                                            *   *  the source code of XviD (the version of XviD used to produce the
43    *  Revision history:                                                         *   *  combined work), being distributed under the terms of the GNU General
44    *                                                                            *   *  Public License plus this exception.  An independent module is a module
45    *  29.06.2002 predict_acdc() bounding                                        *   *  which is not derived from or based on XviD.
46    *  12.12.2001 improved calc_acdc_prediction; removed need for memcpy         *   *
47    *  15.12.2001 moved pmv displacement to motion estimation                    *   *  Note that people who make modified versions of XviD are not obligated
48    *  30.11.2001 mmx cbp support                                                *   *  to grant this special exception for their modified versions; it is
49    *  17.11.2001 initial version                                                *   *  their choice whether to do so.  The GNU General Public License gives
50    *                                                                            *   *  permission to release a modified version without this exception; this
51    ******************************************************************************/   *  exception also makes it possible to release a modified version which
52     *  carries forward this exception.
53     *
54     * $Id$
55     *
56     ****************************************************************************/
57    
 #include "../global.h"  
58  #include "../encoder.h"  #include "../encoder.h"
59  #include "mbprediction.h"  #include "mbprediction.h"
60  #include "../utils/mbfunctions.h"  #include "../utils/mbfunctions.h"
61  #include "../bitstream/cbp.h"  #include "../bitstream/cbp.h"
 #include "../bitstream/mbcoding.h"  
 #include "../bitstream/zigzag.h"  
62    
63    
64    #define ABS(X) (((X)>0)?(X):-(X))
65    #define DIV_DIV(A,B)    ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) )
66    
67    
68    /*****************************************************************************
69     * Local inlined function
70     ****************************************************************************/
71    
72  static int __inline  static int __inline
73  rescale(int predict_quant,  rescale(int predict_quant,
74                  int current_quant,                  int current_quant,
# Line 69  Line 79 
79  }  }
80    
81    
82    /*****************************************************************************
83     * Local data
84     ****************************************************************************/
85    
86  static const int16_t default_acdc_values[15] = {  static const int16_t default_acdc_values[15] = {
87          1024,          1024,
88          0, 0, 0, 0, 0, 0, 0,          0, 0, 0, 0, 0, 0, 0,
# Line 76  Line 90 
90  };  };
91    
92    
93    /*****************************************************************************
94     * Functions
95     ****************************************************************************/
96    
97    
98  /*      get dc/ac prediction direction for a single block and place  /*      get dc/ac prediction direction for a single block and place
99          predictor values into MB->pred_values[j][..]          predictor values into MB->pred_values[j][..]
100  */  */
# Line 104  Line 123 
123          const int16_t *pTop = default_acdc_values;          const int16_t *pTop = default_acdc_values;
124          const int16_t *pDiag = default_acdc_values;          const int16_t *pDiag = default_acdc_values;
125    
126          uint32_t index = x + y * mb_width;      // current macroblock          uint32_t index = x + y * mb_width;      /* current macroblock */
127          int *acpred_direction = &pMBs[index].acpred_directions[block];          int *acpred_direction = &pMBs[index].acpred_directions[block];
128          uint32_t i;          uint32_t i;
129    
130          left = top = diag = current = 0;          left = top = diag = current = 0;
131    
132          // grab left,top and diag macroblocks          /* grab left,top and diag macroblocks */
133    
134          // left macroblock          /* left macroblock  */
135    
136          if (x && mbpos >= bound + 1  &&          if (x && mbpos >= bound + 1  &&
137                  (pMBs[index - 1].mode == MODE_INTRA ||                  (pMBs[index - 1].mode == MODE_INTRA ||
# Line 120  Line 139 
139    
140                  left = pMBs[index - 1].pred_values[0];                  left = pMBs[index - 1].pred_values[0];
141                  left_quant = pMBs[index - 1].quant;                  left_quant = pMBs[index - 1].quant;
142                  //DEBUGI("LEFT", *(left+MBPRED_SIZE));                  /*DEBUGI("LEFT", *(left+MBPRED_SIZE)); */
143          }          }
144          // top macroblock          /* top macroblock */
145    
146          if (mbpos >= bound + (int)mb_width &&          if (mbpos >= bound + (int)mb_width &&
147                  (pMBs[index - mb_width].mode == MODE_INTRA ||                  (pMBs[index - mb_width].mode == MODE_INTRA ||
# Line 131  Line 150 
150                  top = pMBs[index - mb_width].pred_values[0];                  top = pMBs[index - mb_width].pred_values[0];
151                  top_quant = pMBs[index - mb_width].quant;                  top_quant = pMBs[index - mb_width].quant;
152          }          }
153          // diag macroblock          /* diag macroblock  */
154    
155          if (x && mbpos >= bound + (int)mb_width + 1 &&          if (x && mbpos >= bound + (int)mb_width + 1 &&
156                  (pMBs[index - 1 - mb_width].mode == MODE_INTRA ||                  (pMBs[index - 1 - mb_width].mode == MODE_INTRA ||
# Line 142  Line 161 
161    
162          current = pMBs[index].pred_values[0];          current = pMBs[index].pred_values[0];
163    
164          // now grab pLeft, pTop, pDiag _blocks_          /* now grab pLeft, pTop, pDiag _blocks_  */
165    
166          switch (block) {          switch (block) {
167    
# Line 209  Line 228 
228                  break;                  break;
229          }          }
230    
231          //  determine ac prediction direction & ac/dc predictor          /*  determine ac prediction direction & ac/dc predictor */
232          //  place rescaled ac/dc predictions into predictors[] for later use          /*  place rescaled ac/dc predictions into predictors[] for later use */
233    
234          if (ABS(pLeft[0] - pDiag[0]) < ABS(pDiag[0] - pTop[0])) {          if (ABS(pLeft[0] - pDiag[0]) < ABS(pDiag[0] - pTop[0])) {
235                  *acpred_direction = 1;  // vertical                  *acpred_direction = 1;  /* vertical */
236                  predictors[0] = DIV_DIV(pTop[0], iDcScaler);                  predictors[0] = DIV_DIV(pTop[0], iDcScaler);
237                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
238                          predictors[i] = rescale(top_quant, current_quant, pTop[i]);                          predictors[i] = rescale(top_quant, current_quant, pTop[i]);
239                  }                  }
240          } else {          } else {
241                  *acpred_direction = 2;  // horizontal                  *acpred_direction = 2;  /* horizontal */
242                  predictors[0] = DIV_DIV(pLeft[0], iDcScaler);                  predictors[0] = DIV_DIV(pLeft[0], iDcScaler);
243                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
244                          predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]);                          predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]);
# Line 246  Line 265 
265    
266          DPRINTF(DPRINTF_COEFF,"predictor[0] %i", predictors[0]);          DPRINTF(DPRINTF_COEFF,"predictor[0] %i", predictors[0]);
267    
268          dct_codes[0] += predictors[0];  // dc prediction          dct_codes[0] += predictors[0];  /* dc prediction */
269          pCurrent[0] = dct_codes[0] * iDcScaler;          pCurrent[0] = dct_codes[0] * iDcScaler;
270    
271          if (acpred_direction == 1) {          if (acpred_direction == 1) {
# Line 278  Line 297 
297    
298    
299    
300  // ******************************************************************  /* ****************************************************************** */
301  // ******************************************************************  /* ****************************************************************** */
302    
303  /* encoder: subtract predictors from qcoeff[] and calculate S1/S2  /* encoder: subtract predictors from qcoeff[] and calculate S1/S2
304    
305  returns sum of coeefficients *saved* if prediction is enabled  todo: perform [-127,127] clamping after prediction
306    clamping must adjust the coeffs, so dequant is done correctly
307    
308    S1/S2 are used  to determine if its worth predicting for AC
309  S1 = sum of all (qcoeff - prediction)  S1 = sum of all (qcoeff - prediction)
310  S2 = sum of all qcoeff  S2 = sum of all qcoeff
311  */  */
312    
313  int  uint32_t
314  calc_acdc_coeff(MACROBLOCK * pMB,  calc_acdc(MACROBLOCK * pMB,
315                    uint32_t block,                    uint32_t block,
316                    int16_t qcoeff[64],                    int16_t qcoeff[64],
317                    uint32_t iDcScaler,                    uint32_t iDcScaler,
# Line 298  Line 319 
319  {  {
320          int16_t *pCurrent = pMB->pred_values[block];          int16_t *pCurrent = pMB->pred_values[block];
321          uint32_t i;          uint32_t i;
322          int S1 = 0, S2 = 0;          uint32_t S1 = 0, S2 = 0;
323    
324    
325          /* store current coeffs to pred_values[] for future prediction */          /* store current coeffs to pred_values[] for future prediction */
# Line 323  Line 344 
344                          S1 += ABS(level);                          S1 += ABS(level);
345                          predictors[i] = level;                          predictors[i] = level;
346                  }                  }
347          } else                                          // acpred_direction == 2          } else                                          /* acpred_direction == 2 */
348          {          {
349                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
350                          int16_t level;                          int16_t level;
# Line 342  Line 363 
363  }  }
364    
365    
   
 /* returns the bits *saved* if prediction is enabled */  
   
 int  
 calc_acdc_bits(MACROBLOCK * pMB,  
                   uint32_t block,  
                   int16_t qcoeff[64],  
                   uint32_t iDcScaler,  
                   int16_t predictors[8])  
 {  
         const int direction = pMB->acpred_directions[block];  
         int16_t *pCurrent = pMB->pred_values[block];  
         int16_t tmp[8];  
         unsigned int i;  
         int Z1, Z2;  
   
         /* store current coeffs to pred_values[] for future prediction */  
         pCurrent[0] = qcoeff[0] * iDcScaler;  
         for (i = 1; i < 8; i++) {  
                 pCurrent[i] = qcoeff[i];  
                 pCurrent[i + 7] = qcoeff[i * 8];  
         }  
   
   
         /* dc prediction */  
         qcoeff[0] = qcoeff[0] - predictors[0];  
   
         /* calc cost before ac prediction */  
 #ifdef BIGLUT  
         Z2 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[0], 1);  
 #else  
         Z2 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]);  
 #endif  
   
         /* apply ac prediction & calc cost*/  
         if (direction == 1) {  
                 for (i = 1; i < 8; i++) {  
                         tmp[i] = qcoeff[i];  
                         qcoeff[i] -= predictors[i];  
                         predictors[i] = qcoeff[i];  
                 }  
         }else{                                          // acpred_direction == 2  
                 for (i = 1; i < 8; i++) {  
                         tmp[i] = qcoeff[i*8];  
                         qcoeff[i*8] -= predictors[i];  
                         predictors[i] = qcoeff[i*8];  
                 }  
         }  
   
 #ifdef BIGLUT  
         Z1 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[direction], 1);  
 #else  
         Z1 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]);  
 #endif  
   
         /* undo prediction */  
         if (direction == 1) {  
                 for (i = 1; i < 8; i++)  
                         qcoeff[i] = tmp[i];  
         }else{                                          // acpred_direction == 2  
                 for (i = 1; i < 8; i++)  
                         qcoeff[i*8] = tmp[i];  
         }  
   
         return Z2-Z1;  
 }  
   
366  /* apply predictors[] to qcoeff */  /* apply predictors[] to qcoeff */
367    
368  void  void
# Line 417  Line 371 
371                     int16_t qcoeff[64],                     int16_t qcoeff[64],
372                     int16_t predictors[8])                     int16_t predictors[8])
373  {  {
374          unsigned int i;          uint32_t i;
375    
376          if (pMB->acpred_directions[block] == 1) {          if (pMB->acpred_directions[block] == 1) {
377                  for (i = 1; i < 8; i++)                  for (i = 1; i < 8; i++) {
378                          qcoeff[i] = predictors[i];                          qcoeff[i] = predictors[i];
379                    }
380          } else {          } else {
381                  for (i = 1; i < 8; i++)                  for (i = 1; i < 8; i++) {
382                          qcoeff[i * 8] = predictors[i];                          qcoeff[i * 8] = predictors[i];
383          }          }
384  }  }
385    }
386    
387    
388  void  void
# Line 439  Line 395 
395    
396          int32_t j;          int32_t j;
397          int32_t iDcScaler, iQuant = frame->quant;          int32_t iDcScaler, iQuant = frame->quant;
398          int S = 0;          int32_t S = 0;
399          int16_t predictors[6][8];          int16_t predictors[6][8];
400    
401          MACROBLOCK *pMB = &frame->mbs[x + y * mb_width];          MACROBLOCK *pMB = &frame->mbs[x + y * mb_width];
# Line 447  Line 403 
403          if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) {          if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) {
404    
405                  for (j = 0; j < 6; j++) {                  for (j = 0; j < 6; j++) {
406                          iDcScaler = get_dc_scaler(iQuant, j<4);                          iDcScaler = get_dc_scaler(iQuant, (j < 4) ? 1 : 0);
407    
408                          predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64],                          predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64],
409                                                   iQuant, iDcScaler, predictors[j], 0);                                                   iQuant, iDcScaler, predictors[j], 0);
410    
411                          if ((frame->global_flags & XVID_HQACPRED))                          S += calc_acdc(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);
                                 S += calc_acdc_bits(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);  
                         else  
                                 S += calc_acdc_coeff(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);  
412    
413                  }                  }
414    
415                  if (S<=0) {                             // dont predict                  if (S < 0)                              /* dont predict */
416                          for (j = 0; j < 6; j++)                  {
417                            for (j = 0; j < 6; j++) {
418                                  pMB->acpred_directions[j] = 0;                                  pMB->acpred_directions[j] = 0;
419                            }
420                  }else{                  }else{
421                          for (j = 0; j < 6; j++)                          for (j = 0; j < 6; j++) {
422                                  apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]);                                  apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]);
423                  }                  }
424                    }
425                  pMB->cbp = calc_cbp(qcoeff);                  pMB->cbp = calc_cbp(qcoeff);
426          }          }
427    
Legend:
Removed from v.1.7.2.2  
changed lines
  Added in v.1.11
No admin address has been configured
 ViewVC Help
Powered by ViewVC 1.0.4