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

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

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

revision 850, Sat Feb 15 08:39:17 2003 UTC revision 851, Sat Feb 15 15:22:19 2003 UTC
# Line 1  Line 1 
1  /*****************************************************************************   /******************************************************************************
2   *    *                                                                            *
3   *  XVID MPEG-4 VIDEO CODEC    *  This file is part of XviD, a free MPEG-4 video encoder/decoder            *
4   *  - Prediction functions -    *                                                                            *
5   *    *  XviD is an implementation of a part of one or more MPEG-4 Video tools     *
6   *  Copyright(C) 2001-2002 - Michael Militzer <isibaar@xvid.org>    *  as specified in ISO/IEC 14496-2 standard.  Those intending to use this    *
7   *  Copyright(C) 2001-2002 - Peter Ross <pross@xvid.org>    *  software module in hardware or software products are advised that its     *
8   *    *  use may infringe existing patents or copyrights, and any such use         *
9   *  This file is part of XviD, a free MPEG-4 video encoder/decoder    *  would be at such party's own risk.  The original developer of this        *
10   *    *  software module and his/her company, and subsequent editors and their     *
11   *  XviD is free software; you can redistribute it and/or modify it    *  companies, will have no liability for use of this software or             *
12   *  under the terms of the GNU General Public License as published by    *  modifications or derivatives thereof.                                     *
13   *  the Free Software Foundation; either version 2 of the License, or    *                                                                            *
14   *  (at your option) any later version.    *  XviD is free software; you can redistribute it and/or modify it           *
15   *    *  under the terms of the GNU General Public License as published by         *
16   *  This program is distributed in the hope that it will be useful,    *  the Free Software Foundation; either version 2 of the License, or         *
17   *  but WITHOUT ANY WARRANTY; without even the implied warranty of    *  (at your option) any later version.                                       *
18   *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the    *                                                                            *
19   *  GNU General Public License for more details.    *  XviD is distributed in the hope that it will be useful, but               *
20   *    *  WITHOUT ANY WARRANTY; without even the implied warranty of                *
21   *  You should have received a copy of the GNU General Public License    *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the             *
22   *  along with this program; if not, write to the Free Software    *  GNU General Public License for more details.                              *
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   *  Under section 8 of the GNU General Public License, the copyright    *  along with this program; if not, write to the Free Software               *
26   *  holders of XVID explicitly forbid distribution in the following    *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA  *
27   *  countries:    *                                                                            *
28   *    ******************************************************************************/
29   *    - Japan  
30   *    - United States of America   /******************************************************************************
31   *    *                                                                            *
32   *  Linking XviD statically or dynamically with other modules is making a    *  mbprediction.c                                                            *
33   *  combined work based on XviD.  Thus, the terms and conditions of the    *                                                                            *
34   *  GNU General Public License cover the whole combination.    *  Copyright (C) 2001 - Michael Militzer <isibaar@xvid.org>                  *
35   *    *  Copyright (C) 2001 - Peter Ross <pross@cs.rmit.edu.au>                    *
36   *  As a special exception, the copyright holders of XviD give you    *                                                                            *
37   *  permission to link XviD with independent modules that communicate with    *  For more information visit the XviD homepage: http://www.xvid.org         *
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   *  combined work), being distributed under the terms of the GNU General    *  Revision history:                                                         *
44   *  Public License plus this exception.  An independent module is a module    *                                                                            *
45   *  which is not derived from or based on XviD.    *  29.06.2002 predict_acdc() bounding                                        *
46   *    *  12.12.2001 improved calc_acdc_prediction; removed need for memcpy         *
47   *  Note that people who make modified versions of XviD are not obligated    *  15.12.2001 moved pmv displacement to motion estimation                    *
48   *  to grant this special exception for their modified versions; it is    *  30.11.2001 mmx cbp support                                                *
49   *  their choice whether to do so.  The GNU General Public License gives    *  17.11.2001 initial version                                                *
50   *  permission to release a modified version without this exception; this    *                                                                            *
51   *  exception also makes it possible to release a modified version which    ******************************************************************************/
  *  carries forward this exception.  
  *  
  * $Id: mbprediction.c,v 1.12 2002-12-15 01:21:12 edgomez Exp $  
  *  
  ****************************************************************************/  
52    
53    #include "../global.h"
54  #include "../encoder.h"  #include "../encoder.h"
55  #include "mbprediction.h"  #include "mbprediction.h"
56  #include "../utils/mbfunctions.h"  #include "../utils/mbfunctions.h"
57  #include "../bitstream/cbp.h"  #include "../bitstream/cbp.h"
58    #include "../bitstream/mbcoding.h"
59    #include "../bitstream/zigzag.h"
60    
61    
 #define ABS(X) (((X)>0)?(X):-(X))  
 #define DIV_DIV(A,B)    ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) )  
   
   
 /*****************************************************************************  
  * Local inlined function  
  ****************************************************************************/  
   
62  static int __inline  static int __inline
63  rescale(int predict_quant,  rescale(int predict_quant,
64                  int current_quant,                  int current_quant,
# Line 79  Line 69 
69  }  }
70    
71    
 /*****************************************************************************  
  * Local data  
  ****************************************************************************/  
   
72  static const int16_t default_acdc_values[15] = {  static const int16_t default_acdc_values[15] = {
73          1024,          1024,
74          0, 0, 0, 0, 0, 0, 0,          0, 0, 0, 0, 0, 0, 0,
# Line 90  Line 76 
76  };  };
77    
78    
 /*****************************************************************************  
  * Functions  
  ****************************************************************************/  
   
   
79  /*      get dc/ac prediction direction for a single block and place  /*      get dc/ac prediction direction for a single block and place
80          predictor values into MB->pred_values[j][..]          predictor values into MB->pred_values[j][..]
81  */  */
# Line 123  Line 104 
104          const int16_t *pTop = default_acdc_values;          const int16_t *pTop = default_acdc_values;
105          const int16_t *pDiag = default_acdc_values;          const int16_t *pDiag = default_acdc_values;
106    
107          uint32_t index = x + y * mb_width;      /* current macroblock */          uint32_t index = x + y * mb_width;      // current macroblock
108          int *acpred_direction = &pMBs[index].acpred_directions[block];          int *acpred_direction = &pMBs[index].acpred_directions[block];
109          uint32_t i;          uint32_t i;
110    
111          left = top = diag = current = 0;          left = top = diag = current = 0;
112    
113          /* grab left,top and diag macroblocks */          // grab left,top and diag macroblocks
114    
115          /* left macroblock  */          // left macroblock
116    
117          if (x && mbpos >= bound + 1  &&          if (x && mbpos >= bound + 1  &&
118                  (pMBs[index - 1].mode == MODE_INTRA ||                  (pMBs[index - 1].mode == MODE_INTRA ||
# Line 139  Line 120 
120    
121                  left = pMBs[index - 1].pred_values[0];                  left = pMBs[index - 1].pred_values[0];
122                  left_quant = pMBs[index - 1].quant;                  left_quant = pMBs[index - 1].quant;
123                  /*DEBUGI("LEFT", *(left+MBPRED_SIZE)); */                  //DEBUGI("LEFT", *(left+MBPRED_SIZE));
124          }          }
125          /* top macroblock */          // top macroblock
126    
127          if (mbpos >= bound + (int)mb_width &&          if (mbpos >= bound + (int)mb_width &&
128                  (pMBs[index - mb_width].mode == MODE_INTRA ||                  (pMBs[index - mb_width].mode == MODE_INTRA ||
# Line 150  Line 131 
131                  top = pMBs[index - mb_width].pred_values[0];                  top = pMBs[index - mb_width].pred_values[0];
132                  top_quant = pMBs[index - mb_width].quant;                  top_quant = pMBs[index - mb_width].quant;
133          }          }
134          /* diag macroblock  */          // diag macroblock
135    
136          if (x && mbpos >= bound + (int)mb_width + 1 &&          if (x && mbpos >= bound + (int)mb_width + 1 &&
137                  (pMBs[index - 1 - mb_width].mode == MODE_INTRA ||                  (pMBs[index - 1 - mb_width].mode == MODE_INTRA ||
# Line 161  Line 142 
142    
143          current = pMBs[index].pred_values[0];          current = pMBs[index].pred_values[0];
144    
145          /* now grab pLeft, pTop, pDiag _blocks_  */          // now grab pLeft, pTop, pDiag _blocks_
146    
147          switch (block) {          switch (block) {
148    
# Line 228  Line 209 
209                  break;                  break;
210          }          }
211    
212          /*  determine ac prediction direction & ac/dc predictor */          //  determine ac prediction direction & ac/dc predictor
213          /*  place rescaled ac/dc predictions into predictors[] for later use */          //  place rescaled ac/dc predictions into predictors[] for later use
214    
215          if (ABS(pLeft[0] - pDiag[0]) < ABS(pDiag[0] - pTop[0])) {          if (ABS(pLeft[0] - pDiag[0]) < ABS(pDiag[0] - pTop[0])) {
216                  *acpred_direction = 1;  /* vertical */                  *acpred_direction = 1;  // vertical
217                  predictors[0] = (int16_t)(DIV_DIV(pTop[0], iDcScaler));                  predictors[0] = DIV_DIV(pTop[0], iDcScaler);
218                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
219                          predictors[i] = rescale(top_quant, current_quant, pTop[i]);                          predictors[i] = rescale(top_quant, current_quant, pTop[i]);
220                  }                  }
221          } else {          } else {
222                  *acpred_direction = 2;  /* horizontal */                  *acpred_direction = 2;  // horizontal
223                  predictors[0] = (int16_t)(DIV_DIV(pLeft[0], iDcScaler));                  predictors[0] = DIV_DIV(pLeft[0], iDcScaler);
224                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
225                          predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]);                          predictors[i] = rescale(left_quant, current_quant, pLeft[i + 7]);
226                  }                  }
# Line 265  Line 246 
246    
247          DPRINTF(DPRINTF_COEFF,"predictor[0] %i", predictors[0]);          DPRINTF(DPRINTF_COEFF,"predictor[0] %i", predictors[0]);
248    
249          dct_codes[0] += predictors[0];  /* dc prediction */          dct_codes[0] += predictors[0];  // dc prediction
250          pCurrent[0] = (int16_t)(dct_codes[0] * iDcScaler);          pCurrent[0] = dct_codes[0] * iDcScaler;
251    
252          if (acpred_direction == 1) {          if (acpred_direction == 1) {
253                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
# Line 297  Line 278 
278    
279    
280    
281  /* ****************************************************************** */  // ******************************************************************
282  /* ****************************************************************** */  // ******************************************************************
283    
284  /* encoder: subtract predictors from qcoeff[] and calculate S1/S2  /* encoder: subtract predictors from qcoeff[] and calculate S1/S2
285    
286  todo: perform [-127,127] clamping after prediction  returns sum of coeefficients *saved* if prediction is enabled
 clamping must adjust the coeffs, so dequant is done correctly  
287    
 S1/S2 are used  to determine if its worth predicting for AC  
288  S1 = sum of all (qcoeff - prediction)  S1 = sum of all (qcoeff - prediction)
289  S2 = sum of all qcoeff  S2 = sum of all qcoeff
290  */  */
291    
292  uint32_t  int
293  calc_acdc(MACROBLOCK * pMB,  calc_acdc_coeff(MACROBLOCK * pMB,
294                    uint32_t block,                    uint32_t block,
295                    int16_t qcoeff[64],                    int16_t qcoeff[64],
296                    uint32_t iDcScaler,                    uint32_t iDcScaler,
# Line 319  Line 298 
298  {  {
299          int16_t *pCurrent = pMB->pred_values[block];          int16_t *pCurrent = pMB->pred_values[block];
300          uint32_t i;          uint32_t i;
301          uint32_t S1 = 0, S2 = 0;          int S1 = 0, S2 = 0;
302    
303    
304          /* store current coeffs to pred_values[] for future prediction */          /* store current coeffs to pred_values[] for future prediction */
305    
306          pCurrent[0] = (int16_t)(qcoeff[0] * iDcScaler);          pCurrent[0] = qcoeff[0] * iDcScaler;
307          for (i = 1; i < 8; i++) {          for (i = 1; i < 8; i++) {
308                  pCurrent[i] = qcoeff[i];                  pCurrent[i] = qcoeff[i];
309                  pCurrent[i + 7] = qcoeff[i * 8];                  pCurrent[i + 7] = qcoeff[i * 8];
# Line 344  Line 323 
323                          S1 += ABS(level);                          S1 += ABS(level);
324                          predictors[i] = level;                          predictors[i] = level;
325                  }                  }
326          } else                                          /* acpred_direction == 2 */          } else                                          // acpred_direction == 2
327          {          {
328                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++) {
329                          int16_t level;                          int16_t level;
# Line 363  Line 342 
342  }  }
343    
344    
345    
346    /* returns the bits *saved* if prediction is enabled */
347    
348    int
349    calc_acdc_bits(MACROBLOCK * pMB,
350                      uint32_t block,
351                      int16_t qcoeff[64],
352                      uint32_t iDcScaler,
353                      int16_t predictors[8])
354    {
355            const int direction = pMB->acpred_directions[block];
356            int16_t *pCurrent = pMB->pred_values[block];
357            int16_t tmp[8];
358            unsigned int i;
359            int Z1, Z2;
360    
361            /* store current coeffs to pred_values[] for future prediction */
362            pCurrent[0] = qcoeff[0] * iDcScaler;
363            for (i = 1; i < 8; i++) {
364                    pCurrent[i] = qcoeff[i];
365                    pCurrent[i + 7] = qcoeff[i * 8];
366            }
367    
368    
369            /* dc prediction */
370            qcoeff[0] = qcoeff[0] - predictors[0];
371    
372            /* calc cost before ac prediction */
373    #ifdef BIGLUT
374            Z2 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[0], 1);
375    #else
376            Z2 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]);
377    #endif
378    
379            /* apply ac prediction & calc cost*/
380            if (direction == 1) {
381                    for (i = 1; i < 8; i++) {
382                            tmp[i] = qcoeff[i];
383                            qcoeff[i] -= predictors[i];
384                            predictors[i] = qcoeff[i];
385                    }
386            }else{                                          // acpred_direction == 2
387                    for (i = 1; i < 8; i++) {
388                            tmp[i] = qcoeff[i*8];
389                            qcoeff[i*8] -= predictors[i];
390                            predictors[i] = qcoeff[i*8];
391                    }
392            }
393    
394    #ifdef BIGLUT
395            Z1 = CodeCoeff_CalcBits(qcoeff, intra_table, scan_tables[direction], 1);
396    #else
397            Z1 = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]);
398    #endif
399    
400            /* undo prediction */
401            if (direction == 1) {
402                    for (i = 1; i < 8; i++)
403                            qcoeff[i] = tmp[i];
404            }else{                                          // acpred_direction == 2
405                    for (i = 1; i < 8; i++)
406                            qcoeff[i*8] = tmp[i];
407            }
408    
409            return Z2-Z1;
410    }
411    
412  /* apply predictors[] to qcoeff */  /* apply predictors[] to qcoeff */
413    
414  void  void
# Line 371  Line 417 
417                     int16_t qcoeff[64],                     int16_t qcoeff[64],
418                     int16_t predictors[8])                     int16_t predictors[8])
419  {  {
420          uint32_t i;          unsigned int i;
421    
422          if (pMB->acpred_directions[block] == 1) {          if (pMB->acpred_directions[block] == 1) {
423                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++)
424                          qcoeff[i] = predictors[i];                          qcoeff[i] = predictors[i];
                 }  
425          } else {          } else {
426                  for (i = 1; i < 8; i++) {                  for (i = 1; i < 8; i++)
427                          qcoeff[i * 8] = predictors[i];                          qcoeff[i * 8] = predictors[i];
428                  }                  }
429          }          }
 }  
430    
431    
432  void  void
# Line 395  Line 439 
439    
440          int32_t j;          int32_t j;
441          int32_t iDcScaler, iQuant = frame->quant;          int32_t iDcScaler, iQuant = frame->quant;
442          int32_t S = 0;          int S = 0;
443          int16_t predictors[6][8];          int16_t predictors[6][8];
444    
445          MACROBLOCK *pMB = &frame->mbs[x + y * mb_width];          MACROBLOCK *pMB = &frame->mbs[x + y * mb_width];
# Line 403  Line 447 
447          if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) {          if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_INTRA_Q)) {
448    
449                  for (j = 0; j < 6; j++) {                  for (j = 0; j < 6; j++) {
450                          iDcScaler = get_dc_scaler(iQuant, (j < 4) ? 1 : 0);                          iDcScaler = get_dc_scaler(iQuant, j<4);
451    
452                          predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64],                          predict_acdc(frame->mbs, x, y, mb_width, j, &qcoeff[j * 64],
453                                                   iQuant, iDcScaler, predictors[j], 0);                                                   iQuant, iDcScaler, predictors[j], 0);
454    
455                          S += calc_acdc(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);                          if ((frame->global_flags & XVID_HQACPRED))
456                                    S += calc_acdc_bits(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);
457                            else
458                                    S += calc_acdc_coeff(pMB, j, &qcoeff[j * 64], iDcScaler, predictors[j]);
459    
460                  }                  }
461    
462                  if (S < 0)                              /* dont predict */                  if (S<=0) {                             // dont predict
463                  {                          for (j = 0; j < 6; j++)
                         for (j = 0; j < 6; j++) {  
464                                  pMB->acpred_directions[j] = 0;                                  pMB->acpred_directions[j] = 0;
                         }  
465                  } else {                  } else {
466                          for (j = 0; j < 6; j++) {                          for (j = 0; j < 6; j++)
467                                  apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]);                                  apply_acdc(pMB, j, &qcoeff[j * 64], predictors[j]);
468                          }                          }
469                  }  
470                  pMB->cbp = calc_cbp(qcoeff);                  pMB->cbp = calc_cbp(qcoeff);
471          }          }
472    

Legend:
Removed from v.850  
changed lines
  Added in v.851

No admin address has been configured
ViewVC Help
Powered by ViewVC 1.0.4