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.

90 lines
3.0KB

  1. /*
  2. * Electronic Arts TGQ/TQI/MAD IDCT algorithm
  3. * Copyright (c) 2007-2008 Peter Ross <pross@xvid.org>
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * Electronic Arts TGQ/TQI/MAD IDCT algorithm
  24. * @author Peter Ross <pross@xvid.org>
  25. */
  26. #include "eaidct.h"
  27. #include "libavutil/common.h"
  28. #define ASQRT 181 /* (1/sqrt(2))<<8 */
  29. #define A4 669 /* cos(pi/8)*sqrt(2)<<9 */
  30. #define A2 277 /* sin(pi/8)*sqrt(2)<<9 */
  31. #define A5 196 /* sin(pi/8)<<9 */
  32. #define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
  33. const int a1 = (src)[s1] + (src)[s7]; \
  34. const int a7 = (src)[s1] - (src)[s7]; \
  35. const int a5 = (src)[s5] + (src)[s3]; \
  36. const int a3 = (src)[s5] - (src)[s3]; \
  37. const int a2 = (src)[s2] + (src)[s6]; \
  38. const int a6 = (ASQRT*((src)[s2] - (src)[s6]))>>8; \
  39. const int a0 = (src)[s0] + (src)[s4]; \
  40. const int a4 = (src)[s0] - (src)[s4]; \
  41. const int b0 = (((A4-A5)*a7 - A5*a3)>>9) + a1+a5; \
  42. const int b1 = (((A4-A5)*a7 - A5*a3)>>9) + ((ASQRT*(a1-a5))>>8); \
  43. const int b2 = (((A2+A5)*a3 + A5*a7)>>9) + ((ASQRT*(a1-a5))>>8); \
  44. const int b3 = ((A2+A5)*a3 + A5*a7)>>9; \
  45. (dest)[d0] = munge(a0+a2+a6+b0); \
  46. (dest)[d1] = munge(a4+a6 +b1); \
  47. (dest)[d2] = munge(a4-a6 +b2); \
  48. (dest)[d3] = munge(a0-a2-a6+b3); \
  49. (dest)[d4] = munge(a0-a2-a6-b3); \
  50. (dest)[d5] = munge(a4-a6 -b2); \
  51. (dest)[d6] = munge(a4+a6 -b1); \
  52. (dest)[d7] = munge(a0+a2+a6-b0); \
  53. }
  54. /* end IDCT_TRANSFORM macro */
  55. #define MUNGE_NONE(x) (x)
  56. #define IDCT_COL(dest,src) IDCT_TRANSFORM(dest,0,8,16,24,32,40,48,56,0,8,16,24,32,40,48,56,MUNGE_NONE,src)
  57. #define MUNGE_8BIT(x) av_clip_uint8((x)>>4)
  58. #define IDCT_ROW(dest,src) IDCT_TRANSFORM(dest,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,MUNGE_8BIT,src)
  59. static inline void ea_idct_col(int16_t *dest, const int16_t *src) {
  60. if ((src[8]|src[16]|src[24]|src[32]|src[40]|src[48]|src[56])==0) {
  61. dest[0] =
  62. dest[8] =
  63. dest[16] =
  64. dest[24] =
  65. dest[32] =
  66. dest[40] =
  67. dest[48] =
  68. dest[56] = src[0];
  69. }else
  70. IDCT_COL(dest, src);
  71. }
  72. void ff_ea_idct_put_c(uint8_t *dest, ptrdiff_t linesize, int16_t *block)
  73. {
  74. int i;
  75. int16_t temp[64];
  76. block[0] += 4;
  77. for (i=0; i<8; i++)
  78. ea_idct_col(&temp[i], &block[i]);
  79. for (i=0; i<8; i++)
  80. IDCT_ROW( (&dest[i*linesize]), (&temp[8*i]) );
  81. }