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.

309 lines
7.7KB

  1. /*
  2. * Simple IDCT (Alpha optimized)
  3. *
  4. * Copyright (c) 2001 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * FFmpeg is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. *
  22. * based upon some outcommented c code from mpeg2dec (idct_mmx.c
  23. * written by Aaron Holtzman <aholtzma@ess.engr.uvic.ca>)
  24. *
  25. * Alpha optimiziations by Måns Rullgård <mru@users.sourceforge.net>
  26. * and Falk Hueffner <falk@debian.org>
  27. */
  28. #include "asm.h"
  29. #include "../dsputil.h"
  30. extern void (*put_pixels_clamped_axp_p)(const DCTELEM *block, uint8_t *pixels,
  31. int line_size);
  32. extern void (*add_pixels_clamped_axp_p)(const DCTELEM *block, uint8_t *pixels,
  33. int line_size);
  34. // cos(i * M_PI / 16) * sqrt(2) * (1 << 14)
  35. // W4 is actually exactly 16384, but using 16383 works around
  36. // accumulating rounding errors for some encoders
  37. #define W1 ((int_fast32_t) 22725)
  38. #define W2 ((int_fast32_t) 21407)
  39. #define W3 ((int_fast32_t) 19266)
  40. #define W4 ((int_fast32_t) 16383)
  41. #define W5 ((int_fast32_t) 12873)
  42. #define W6 ((int_fast32_t) 8867)
  43. #define W7 ((int_fast32_t) 4520)
  44. #define ROW_SHIFT 11
  45. #define COL_SHIFT 20
  46. /* 0: all entries 0, 1: only first entry nonzero, 2: otherwise */
  47. static inline int idct_row(DCTELEM *row)
  48. {
  49. int_fast32_t a0, a1, a2, a3, b0, b1, b2, b3, t;
  50. uint64_t l, r, t2;
  51. l = ldq(row);
  52. r = ldq(row + 4);
  53. if (l == 0 && r == 0)
  54. return 0;
  55. a0 = W4 * sextw(l) + (1 << (ROW_SHIFT - 1));
  56. if (((l & ~0xffffUL) | r) == 0) {
  57. a0 >>= ROW_SHIFT;
  58. t2 = (uint16_t) a0;
  59. t2 |= t2 << 16;
  60. t2 |= t2 << 32;
  61. stq(t2, row);
  62. stq(t2, row + 4);
  63. return 1;
  64. }
  65. a1 = a0;
  66. a2 = a0;
  67. a3 = a0;
  68. t = extwl(l, 4); /* row[2] */
  69. if (t != 0) {
  70. t = sextw(t);
  71. a0 += W2 * t;
  72. a1 += W6 * t;
  73. a2 -= W6 * t;
  74. a3 -= W2 * t;
  75. }
  76. t = extwl(r, 0); /* row[4] */
  77. if (t != 0) {
  78. t = sextw(t);
  79. a0 += W4 * t;
  80. a1 -= W4 * t;
  81. a2 -= W4 * t;
  82. a3 += W4 * t;
  83. }
  84. t = extwl(r, 4); /* row[6] */
  85. if (t != 0) {
  86. t = sextw(t);
  87. a0 += W6 * t;
  88. a1 -= W2 * t;
  89. a2 += W2 * t;
  90. a3 -= W6 * t;
  91. }
  92. t = extwl(l, 2); /* row[1] */
  93. if (t != 0) {
  94. t = sextw(t);
  95. b0 = W1 * t;
  96. b1 = W3 * t;
  97. b2 = W5 * t;
  98. b3 = W7 * t;
  99. } else {
  100. b0 = 0;
  101. b1 = 0;
  102. b2 = 0;
  103. b3 = 0;
  104. }
  105. t = extwl(l, 6); /* row[3] */
  106. if (t) {
  107. t = sextw(t);
  108. b0 += W3 * t;
  109. b1 -= W7 * t;
  110. b2 -= W1 * t;
  111. b3 -= W5 * t;
  112. }
  113. t = extwl(r, 2); /* row[5] */
  114. if (t) {
  115. t = sextw(t);
  116. b0 += W5 * t;
  117. b1 -= W1 * t;
  118. b2 += W7 * t;
  119. b3 += W3 * t;
  120. }
  121. t = extwl(r, 6); /* row[7] */
  122. if (t) {
  123. t = sextw(t);
  124. b0 += W7 * t;
  125. b1 -= W5 * t;
  126. b2 += W3 * t;
  127. b3 -= W1 * t;
  128. }
  129. row[0] = (a0 + b0) >> ROW_SHIFT;
  130. row[1] = (a1 + b1) >> ROW_SHIFT;
  131. row[2] = (a2 + b2) >> ROW_SHIFT;
  132. row[3] = (a3 + b3) >> ROW_SHIFT;
  133. row[4] = (a3 - b3) >> ROW_SHIFT;
  134. row[5] = (a2 - b2) >> ROW_SHIFT;
  135. row[6] = (a1 - b1) >> ROW_SHIFT;
  136. row[7] = (a0 - b0) >> ROW_SHIFT;
  137. return 2;
  138. }
  139. static inline void idct_col(DCTELEM *col)
  140. {
  141. int_fast32_t a0, a1, a2, a3, b0, b1, b2, b3;
  142. col[0] += (1 << (COL_SHIFT - 1)) / W4;
  143. a0 = W4 * col[8 * 0];
  144. a1 = W4 * col[8 * 0];
  145. a2 = W4 * col[8 * 0];
  146. a3 = W4 * col[8 * 0];
  147. if (col[8 * 2]) {
  148. a0 += W2 * col[8 * 2];
  149. a1 += W6 * col[8 * 2];
  150. a2 -= W6 * col[8 * 2];
  151. a3 -= W2 * col[8 * 2];
  152. }
  153. if (col[8 * 4]) {
  154. a0 += W4 * col[8 * 4];
  155. a1 -= W4 * col[8 * 4];
  156. a2 -= W4 * col[8 * 4];
  157. a3 += W4 * col[8 * 4];
  158. }
  159. if (col[8 * 6]) {
  160. a0 += W6 * col[8 * 6];
  161. a1 -= W2 * col[8 * 6];
  162. a2 += W2 * col[8 * 6];
  163. a3 -= W6 * col[8 * 6];
  164. }
  165. if (col[8 * 1]) {
  166. b0 = W1 * col[8 * 1];
  167. b1 = W3 * col[8 * 1];
  168. b2 = W5 * col[8 * 1];
  169. b3 = W7 * col[8 * 1];
  170. } else {
  171. b0 = 0;
  172. b1 = 0;
  173. b2 = 0;
  174. b3 = 0;
  175. }
  176. if (col[8 * 3]) {
  177. b0 += W3 * col[8 * 3];
  178. b1 -= W7 * col[8 * 3];
  179. b2 -= W1 * col[8 * 3];
  180. b3 -= W5 * col[8 * 3];
  181. }
  182. if (col[8 * 5]) {
  183. b0 += W5 * col[8 * 5];
  184. b1 -= W1 * col[8 * 5];
  185. b2 += W7 * col[8 * 5];
  186. b3 += W3 * col[8 * 5];
  187. }
  188. if (col[8 * 7]) {
  189. b0 += W7 * col[8 * 7];
  190. b1 -= W5 * col[8 * 7];
  191. b2 += W3 * col[8 * 7];
  192. b3 -= W1 * col[8 * 7];
  193. }
  194. col[8 * 0] = (a0 + b0) >> COL_SHIFT;
  195. col[8 * 7] = (a0 - b0) >> COL_SHIFT;
  196. col[8 * 1] = (a1 + b1) >> COL_SHIFT;
  197. col[8 * 6] = (a1 - b1) >> COL_SHIFT;
  198. col[8 * 2] = (a2 + b2) >> COL_SHIFT;
  199. col[8 * 5] = (a2 - b2) >> COL_SHIFT;
  200. col[8 * 3] = (a3 + b3) >> COL_SHIFT;
  201. col[8 * 4] = (a3 - b3) >> COL_SHIFT;
  202. }
  203. /* If all rows but the first one are zero after row transformation,
  204. all rows will be identical after column transformation. */
  205. static inline void idct_col2(DCTELEM *col)
  206. {
  207. int i;
  208. uint64_t l, r;
  209. for (i = 0; i < 8; ++i) {
  210. int_fast32_t a0 = col[i] + (1 << (COL_SHIFT - 1)) / W4;
  211. a0 *= W4;
  212. col[i] = a0 >> COL_SHIFT;
  213. }
  214. l = ldq(col + 0 * 4); r = ldq(col + 1 * 4);
  215. stq(l, col + 2 * 4); stq(r, col + 3 * 4);
  216. stq(l, col + 4 * 4); stq(r, col + 5 * 4);
  217. stq(l, col + 6 * 4); stq(r, col + 7 * 4);
  218. stq(l, col + 8 * 4); stq(r, col + 9 * 4);
  219. stq(l, col + 10 * 4); stq(r, col + 11 * 4);
  220. stq(l, col + 12 * 4); stq(r, col + 13 * 4);
  221. stq(l, col + 14 * 4); stq(r, col + 15 * 4);
  222. }
  223. void simple_idct_axp(DCTELEM *block)
  224. {
  225. int i;
  226. int rowsZero = 1; /* all rows except row 0 zero */
  227. int rowsConstant = 1; /* all rows consist of a constant value */
  228. for (i = 0; i < 8; i++) {
  229. int sparseness = idct_row(block + 8 * i);
  230. if (i > 0 && sparseness > 0)
  231. rowsZero = 0;
  232. if (sparseness == 2)
  233. rowsConstant = 0;
  234. }
  235. if (rowsZero) {
  236. idct_col2(block);
  237. } else if (rowsConstant) {
  238. idct_col(block);
  239. for (i = 0; i < 8; i += 2) {
  240. uint64_t v = (uint16_t) block[0];
  241. uint64_t w = (uint16_t) block[8];
  242. v |= v << 16;
  243. w |= w << 16;
  244. v |= v << 32;
  245. w |= w << 32;
  246. stq(v, block + 0 * 4);
  247. stq(v, block + 1 * 4);
  248. stq(w, block + 2 * 4);
  249. stq(w, block + 3 * 4);
  250. block += 4 * 4;
  251. }
  252. } else {
  253. for (i = 0; i < 8; i++)
  254. idct_col(block + i);
  255. }
  256. }
  257. void simple_idct_put_axp(uint8_t *dest, int line_size, DCTELEM *block)
  258. {
  259. simple_idct_axp(block);
  260. put_pixels_clamped_axp_p(block, dest, line_size);
  261. }
  262. void simple_idct_add_axp(uint8_t *dest, int line_size, DCTELEM *block)
  263. {
  264. simple_idct_axp(block);
  265. add_pixels_clamped_axp_p(block, dest, line_size);
  266. }