You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

142 lines
5.3KB

  1. /*
  2. * H.264 IDCT
  3. * Copyright (c) 2004 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. *
  19. */
  20. /**
  21. * @file h264-idct.c
  22. * H.264 IDCT.
  23. * @author Michael Niedermayer <michaelni@gmx.at>
  24. */
  25. #include "dsputil.h"
  26. static always_inline void idct_internal(uint8_t *dst, DCTELEM *block, int stride, int block_stride, int shift, int add){
  27. int i;
  28. uint8_t *cm = cropTbl + MAX_NEG_CROP;
  29. block[0] += 1<<(shift-1);
  30. for(i=0; i<4; i++){
  31. const int z0= block[0 + block_stride*i] + block[2 + block_stride*i];
  32. const int z1= block[0 + block_stride*i] - block[2 + block_stride*i];
  33. const int z2= (block[1 + block_stride*i]>>1) - block[3 + block_stride*i];
  34. const int z3= block[1 + block_stride*i] + (block[3 + block_stride*i]>>1);
  35. block[0 + block_stride*i]= z0 + z3;
  36. block[1 + block_stride*i]= z1 + z2;
  37. block[2 + block_stride*i]= z1 - z2;
  38. block[3 + block_stride*i]= z0 - z3;
  39. }
  40. for(i=0; i<4; i++){
  41. const int z0= block[i + block_stride*0] + block[i + block_stride*2];
  42. const int z1= block[i + block_stride*0] - block[i + block_stride*2];
  43. const int z2= (block[i + block_stride*1]>>1) - block[i + block_stride*3];
  44. const int z3= block[i + block_stride*1] + (block[i + block_stride*3]>>1);
  45. dst[i + 0*stride]= cm[ add*dst[i + 0*stride] + ((z0 + z3) >> shift) ];
  46. dst[i + 1*stride]= cm[ add*dst[i + 1*stride] + ((z1 + z2) >> shift) ];
  47. dst[i + 2*stride]= cm[ add*dst[i + 2*stride] + ((z1 - z2) >> shift) ];
  48. dst[i + 3*stride]= cm[ add*dst[i + 3*stride] + ((z0 - z3) >> shift) ];
  49. }
  50. }
  51. void ff_h264_idct_add_c(uint8_t *dst, DCTELEM *block, int stride){
  52. idct_internal(dst, block, stride, 4, 6, 1);
  53. }
  54. void ff_h264_lowres_idct_add_c(uint8_t *dst, int stride, DCTELEM *block){
  55. idct_internal(dst, block, stride, 8, 3, 1);
  56. }
  57. void ff_h264_lowres_idct_put_c(uint8_t *dst, int stride, DCTELEM *block){
  58. idct_internal(dst, block, stride, 8, 3, 0);
  59. }
  60. void ff_h264_idct8_add_c(uint8_t *dst, DCTELEM *block, int stride){
  61. int i;
  62. DCTELEM (*src)[8] = (DCTELEM(*)[8])block;
  63. uint8_t *cm = cropTbl + MAX_NEG_CROP;
  64. block[0] += 32;
  65. for( i = 0; i < 8; i++ )
  66. {
  67. const int a0 = src[i][0] + src[i][4];
  68. const int a2 = src[i][0] - src[i][4];
  69. const int a4 = (src[i][2]>>1) - src[i][6];
  70. const int a6 = (src[i][6]>>1) + src[i][2];
  71. const int b0 = a0 + a6;
  72. const int b2 = a2 + a4;
  73. const int b4 = a2 - a4;
  74. const int b6 = a0 - a6;
  75. const int a1 = -src[i][3] + src[i][5] - src[i][7] - (src[i][7]>>1);
  76. const int a3 = src[i][1] + src[i][7] - src[i][3] - (src[i][3]>>1);
  77. const int a5 = -src[i][1] + src[i][7] + src[i][5] + (src[i][5]>>1);
  78. const int a7 = src[i][3] + src[i][5] + src[i][1] + (src[i][1]>>1);
  79. const int b1 = (a7>>2) + a1;
  80. const int b3 = a3 + (a5>>2);
  81. const int b5 = (a3>>2) - a5;
  82. const int b7 = a7 - (a1>>2);
  83. src[i][0] = b0 + b7;
  84. src[i][7] = b0 - b7;
  85. src[i][1] = b2 + b5;
  86. src[i][6] = b2 - b5;
  87. src[i][2] = b4 + b3;
  88. src[i][5] = b4 - b3;
  89. src[i][3] = b6 + b1;
  90. src[i][4] = b6 - b1;
  91. }
  92. for( i = 0; i < 8; i++ )
  93. {
  94. const int a0 = src[0][i] + src[4][i];
  95. const int a2 = src[0][i] - src[4][i];
  96. const int a4 = (src[2][i]>>1) - src[6][i];
  97. const int a6 = (src[6][i]>>1) + src[2][i];
  98. const int b0 = a0 + a6;
  99. const int b2 = a2 + a4;
  100. const int b4 = a2 - a4;
  101. const int b6 = a0 - a6;
  102. const int a1 = -src[3][i] + src[5][i] - src[7][i] - (src[7][i]>>1);
  103. const int a3 = src[1][i] + src[7][i] - src[3][i] - (src[3][i]>>1);
  104. const int a5 = -src[1][i] + src[7][i] + src[5][i] + (src[5][i]>>1);
  105. const int a7 = src[3][i] + src[5][i] + src[1][i] + (src[1][i]>>1);
  106. const int b1 = (a7>>2) + a1;
  107. const int b3 = a3 + (a5>>2);
  108. const int b5 = (a3>>2) - a5;
  109. const int b7 = a7 - (a1>>2);
  110. dst[i + 0*stride] = cm[ dst[i + 0*stride] + ((b0 + b7) >> 6) ];
  111. dst[i + 1*stride] = cm[ dst[i + 1*stride] + ((b2 + b5) >> 6) ];
  112. dst[i + 2*stride] = cm[ dst[i + 2*stride] + ((b4 + b3) >> 6) ];
  113. dst[i + 3*stride] = cm[ dst[i + 3*stride] + ((b6 + b1) >> 6) ];
  114. dst[i + 4*stride] = cm[ dst[i + 4*stride] + ((b6 - b1) >> 6) ];
  115. dst[i + 5*stride] = cm[ dst[i + 5*stride] + ((b4 - b3) >> 6) ];
  116. dst[i + 6*stride] = cm[ dst[i + 6*stride] + ((b2 - b5) >> 6) ];
  117. dst[i + 7*stride] = cm[ dst[i + 7*stride] + ((b0 - b7) >> 6) ];
  118. }
  119. }