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.

312 lines
7.6KB

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