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.

307 lines
7.3KB

  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. // cos(i * M_PI / 16) * sqrt(2) * (1 << 14)
  29. // W4 is actually exactly 16384, but using 16383 works around
  30. // accumulating rounding errors for some encoders
  31. #define W1 ((int_fast32_t) 22725)
  32. #define W2 ((int_fast32_t) 21407)
  33. #define W3 ((int_fast32_t) 19266)
  34. #define W4 ((int_fast32_t) 16383)
  35. #define W5 ((int_fast32_t) 12873)
  36. #define W6 ((int_fast32_t) 8867)
  37. #define W7 ((int_fast32_t) 4520)
  38. #define ROW_SHIFT 11
  39. #define COL_SHIFT 20
  40. /* 0: all entries 0, 1: only first entry nonzero, 2: otherwise */
  41. static inline int idct_row(DCTELEM *row)
  42. {
  43. int_fast32_t a0, a1, a2, a3, b0, b1, b2, b3, t;
  44. uint64_t l, r;
  45. l = ldq(row);
  46. r = ldq(row + 4);
  47. if (l == 0 && r == 0)
  48. return 0;
  49. a0 = W4 * sextw(l) + (1 << (ROW_SHIFT - 1));
  50. if (((l & ~0xffffUL) | r) == 0) {
  51. a0 >>= ROW_SHIFT;
  52. a0 = (uint16_t) a0;
  53. a0 |= a0 << 16;
  54. a0 |= a0 << 32;
  55. stq(a0, row);
  56. stq(a0, row + 4);
  57. return 1;
  58. }
  59. a1 = a0;
  60. a2 = a0;
  61. a3 = a0;
  62. t = extwl(l, 4); /* row[2] */
  63. if (t != 0) {
  64. t = sextw(t);
  65. a0 += W2 * t;
  66. a1 += W6 * t;
  67. a2 -= W6 * t;
  68. a3 -= W2 * t;
  69. }
  70. t = extwl(r, 0); /* row[4] */
  71. if (t != 0) {
  72. t = sextw(t);
  73. a0 += W4 * t;
  74. a1 -= W4 * t;
  75. a2 -= W4 * t;
  76. a3 += W4 * t;
  77. }
  78. t = extwl(r, 4); /* row[6] */
  79. if (t != 0) {
  80. t = sextw(t);
  81. a0 += W6 * t;
  82. a1 -= W2 * t;
  83. a2 += W2 * t;
  84. a3 -= W6 * t;
  85. }
  86. t = extwl(l, 2); /* row[1] */
  87. if (t != 0) {
  88. t = sextw(t);
  89. b0 = W1 * t;
  90. b1 = W3 * t;
  91. b2 = W5 * t;
  92. b3 = W7 * t;
  93. } else {
  94. b0 = 0;
  95. b1 = 0;
  96. b2 = 0;
  97. b3 = 0;
  98. }
  99. t = extwl(l, 6); /* row[3] */
  100. if (t) {
  101. t = sextw(t);
  102. b0 += W3 * t;
  103. b1 -= W7 * t;
  104. b2 -= W1 * t;
  105. b3 -= W5 * t;
  106. }
  107. t = extwl(r, 2); /* row[5] */
  108. if (t) {
  109. t = sextw(t);
  110. b0 += W5 * t;
  111. b1 -= W1 * t;
  112. b2 += W7 * t;
  113. b3 += W3 * t;
  114. }
  115. t = extwl(r, 6); /* row[7] */
  116. if (t) {
  117. t = sextw(t);
  118. b0 += W7 * t;
  119. b1 -= W5 * t;
  120. b2 += W3 * t;
  121. b3 -= W1 * t;
  122. }
  123. row[0] = (a0 + b0) >> ROW_SHIFT;
  124. row[1] = (a1 + b1) >> ROW_SHIFT;
  125. row[2] = (a2 + b2) >> ROW_SHIFT;
  126. row[3] = (a3 + b3) >> ROW_SHIFT;
  127. row[4] = (a3 - b3) >> ROW_SHIFT;
  128. row[5] = (a2 - b2) >> ROW_SHIFT;
  129. row[6] = (a1 - b1) >> ROW_SHIFT;
  130. row[7] = (a0 - b0) >> ROW_SHIFT;
  131. return 2;
  132. }
  133. static inline void idct_col(DCTELEM *col)
  134. {
  135. int_fast32_t a0, a1, a2, a3, b0, b1, b2, b3;
  136. col[0] += (1 << (COL_SHIFT - 1)) / W4;
  137. a0 = W4 * col[8 * 0];
  138. a1 = W4 * col[8 * 0];
  139. a2 = W4 * col[8 * 0];
  140. a3 = W4 * col[8 * 0];
  141. if (col[8 * 2]) {
  142. a0 += W2 * col[8 * 2];
  143. a1 += W6 * col[8 * 2];
  144. a2 -= W6 * col[8 * 2];
  145. a3 -= W2 * col[8 * 2];
  146. }
  147. if (col[8 * 4]) {
  148. a0 += W4 * col[8 * 4];
  149. a1 -= W4 * col[8 * 4];
  150. a2 -= W4 * col[8 * 4];
  151. a3 += W4 * col[8 * 4];
  152. }
  153. if (col[8 * 6]) {
  154. a0 += W6 * col[8 * 6];
  155. a1 -= W2 * col[8 * 6];
  156. a2 += W2 * col[8 * 6];
  157. a3 -= W6 * col[8 * 6];
  158. }
  159. if (col[8 * 1]) {
  160. b0 = W1 * col[8 * 1];
  161. b1 = W3 * col[8 * 1];
  162. b2 = W5 * col[8 * 1];
  163. b3 = W7 * col[8 * 1];
  164. } else {
  165. b0 = 0;
  166. b1 = 0;
  167. b2 = 0;
  168. b3 = 0;
  169. }
  170. if (col[8 * 3]) {
  171. b0 += W3 * col[8 * 3];
  172. b1 -= W7 * col[8 * 3];
  173. b2 -= W1 * col[8 * 3];
  174. b3 -= W5 * col[8 * 3];
  175. }
  176. if (col[8 * 5]) {
  177. b0 += W5 * col[8 * 5];
  178. b1 -= W1 * col[8 * 5];
  179. b2 += W7 * col[8 * 5];
  180. b3 += W3 * col[8 * 5];
  181. }
  182. if (col[8 * 7]) {
  183. b0 += W7 * col[8 * 7];
  184. b1 -= W5 * col[8 * 7];
  185. b2 += W3 * col[8 * 7];
  186. b3 -= W1 * col[8 * 7];
  187. }
  188. col[8 * 0] = (a0 + b0) >> COL_SHIFT;
  189. col[8 * 7] = (a0 - b0) >> COL_SHIFT;
  190. col[8 * 1] = (a1 + b1) >> COL_SHIFT;
  191. col[8 * 6] = (a1 - b1) >> COL_SHIFT;
  192. col[8 * 2] = (a2 + b2) >> COL_SHIFT;
  193. col[8 * 5] = (a2 - b2) >> COL_SHIFT;
  194. col[8 * 3] = (a3 + b3) >> COL_SHIFT;
  195. col[8 * 4] = (a3 - b3) >> COL_SHIFT;
  196. }
  197. /* If all rows but the first one are zero after row transformation,
  198. all rows will be identical after column transformation. */
  199. static inline void idct_col2(DCTELEM *col)
  200. {
  201. int i;
  202. uint64_t l, r;
  203. uint64_t *lcol = (uint64_t *) col;
  204. for (i = 0; i < 8; ++i) {
  205. int_fast32_t a0 = col[0] + (1 << (COL_SHIFT - 1)) / W4;
  206. a0 *= W4;
  207. col[0] = a0 >> COL_SHIFT;
  208. ++col;
  209. }
  210. l = lcol[0];
  211. r = lcol[1];
  212. lcol[ 2] = l; lcol[ 3] = r;
  213. lcol[ 4] = l; lcol[ 5] = r;
  214. lcol[ 6] = l; lcol[ 7] = r;
  215. lcol[ 8] = l; lcol[ 9] = r;
  216. lcol[10] = l; lcol[11] = r;
  217. lcol[12] = l; lcol[13] = r;
  218. lcol[14] = l; lcol[15] = r;
  219. }
  220. void simple_idct_axp(DCTELEM *block)
  221. {
  222. int i;
  223. int rowsZero = 1; /* all rows except row 0 zero */
  224. int rowsConstant = 1; /* all rows consist of a constant value */
  225. for (i = 0; i < 8; i++) {
  226. int sparseness = idct_row(block + 8 * i);
  227. if (i > 0 && sparseness > 0)
  228. rowsZero = 0;
  229. if (sparseness == 2)
  230. rowsConstant = 0;
  231. }
  232. if (rowsZero) {
  233. idct_col2(block);
  234. } else if (rowsConstant) {
  235. uint64_t *lblock = (uint64_t *) block;
  236. idct_col(block);
  237. for (i = 0; i < 8; i += 2) {
  238. uint64_t v = (uint16_t) block[i * 8];
  239. uint64_t w = (uint16_t) block[i * 8 + 8];
  240. v |= v << 16;
  241. w |= w << 16;
  242. v |= v << 32;
  243. w |= w << 32;
  244. lblock[0] = v;
  245. lblock[1] = v;
  246. lblock[2] = w;
  247. lblock[3] = w;
  248. lblock += 4;
  249. }
  250. } else {
  251. for (i = 0; i < 8; i++)
  252. idct_col(block + i);
  253. }
  254. }
  255. void simple_idct_put_axp(uint8_t *dest, int line_size, DCTELEM *block)
  256. {
  257. simple_idct_axp(block);
  258. put_pixels_clamped(block, dest, line_size);
  259. }
  260. void simple_idct_add_axp(uint8_t *dest, int line_size, DCTELEM *block)
  261. {
  262. simple_idct_axp(block);
  263. add_pixels_clamped(block, dest, line_size);
  264. }