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.

348 lines
9.5KB

  1. /*
  2. * Alpha optimized DSP utils
  3. * Copyright (c) 2002 Falk Hueffner <falk@debian.org>
  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. #include "asm.h"
  20. #include "../dsputil.h"
  21. void get_pixels_mvi(DCTELEM *restrict block,
  22. const uint8_t *restrict pixels, int line_size)
  23. {
  24. int h = 8;
  25. do {
  26. uint64_t p;
  27. p = ldq(pixels);
  28. stq(unpkbw(p), block);
  29. stq(unpkbw(p >> 32), block + 4);
  30. pixels += line_size;
  31. block += 8;
  32. } while (--h);
  33. }
  34. void diff_pixels_mvi(DCTELEM *block, const uint8_t *s1, const uint8_t *s2,
  35. int stride) {
  36. int h = 8;
  37. uint64_t mask = 0x4040;
  38. mask |= mask << 16;
  39. mask |= mask << 32;
  40. do {
  41. uint64_t x, y, c, d, a;
  42. uint64_t signs;
  43. x = ldq(s1);
  44. y = ldq(s2);
  45. c = cmpbge(x, y);
  46. d = x - y;
  47. a = zap(mask, c); /* We use 0x4040404040404040 here... */
  48. d += 4 * a; /* ...so we can use s4addq here. */
  49. signs = zap(-1, c);
  50. stq(unpkbw(d) | (unpkbw(signs) << 8), block);
  51. stq(unpkbw(d >> 32) | (unpkbw(signs >> 32) << 8), block + 4);
  52. s1 += stride;
  53. s2 += stride;
  54. block += 8;
  55. } while (--h);
  56. }
  57. static inline uint64_t avg2(uint64_t a, uint64_t b)
  58. {
  59. return (a | b) - (((a ^ b) & BYTE_VEC(0xfe)) >> 1);
  60. }
  61. static inline uint64_t avg4(uint64_t l1, uint64_t l2, uint64_t l3, uint64_t l4)
  62. {
  63. uint64_t r1 = ((l1 & ~BYTE_VEC(0x03)) >> 2)
  64. + ((l2 & ~BYTE_VEC(0x03)) >> 2)
  65. + ((l3 & ~BYTE_VEC(0x03)) >> 2)
  66. + ((l4 & ~BYTE_VEC(0x03)) >> 2);
  67. uint64_t r2 = (( (l1 & BYTE_VEC(0x03))
  68. + (l2 & BYTE_VEC(0x03))
  69. + (l3 & BYTE_VEC(0x03))
  70. + (l4 & BYTE_VEC(0x03))
  71. + BYTE_VEC(0x02)) >> 2) & BYTE_VEC(0x03);
  72. return r1 + r2;
  73. }
  74. int pix_abs8x8_mvi(uint8_t *pix1, uint8_t *pix2, int line_size)
  75. {
  76. int result = 0;
  77. int h = 8;
  78. if ((size_t) pix2 & 0x7) {
  79. /* works only when pix2 is actually unaligned */
  80. do { /* do 8 pixel a time */
  81. uint64_t p1, p2;
  82. p1 = ldq(pix1);
  83. p2 = uldq(pix2);
  84. result += perr(p1, p2);
  85. pix1 += line_size;
  86. pix2 += line_size;
  87. } while (--h);
  88. } else {
  89. do {
  90. uint64_t p1, p2;
  91. p1 = ldq(pix1);
  92. p2 = ldq(pix2);
  93. result += perr(p1, p2);
  94. pix1 += line_size;
  95. pix2 += line_size;
  96. } while (--h);
  97. }
  98. return result;
  99. }
  100. #if 0 /* now done in assembly */
  101. int pix_abs16x16_mvi(uint8_t *pix1, uint8_t *pix2, int line_size)
  102. {
  103. int result = 0;
  104. int h = 16;
  105. if ((size_t) pix2 & 0x7) {
  106. /* works only when pix2 is actually unaligned */
  107. do { /* do 16 pixel a time */
  108. uint64_t p1_l, p1_r, p2_l, p2_r;
  109. uint64_t t;
  110. p1_l = ldq(pix1);
  111. p1_r = ldq(pix1 + 8);
  112. t = ldq_u(pix2 + 8);
  113. p2_l = extql(ldq_u(pix2), pix2) | extqh(t, pix2);
  114. p2_r = extql(t, pix2) | extqh(ldq_u(pix2 + 16), pix2);
  115. pix1 += line_size;
  116. pix2 += line_size;
  117. result += perr(p1_l, p2_l)
  118. + perr(p1_r, p2_r);
  119. } while (--h);
  120. } else {
  121. do {
  122. uint64_t p1_l, p1_r, p2_l, p2_r;
  123. p1_l = ldq(pix1);
  124. p1_r = ldq(pix1 + 8);
  125. p2_l = ldq(pix2);
  126. p2_r = ldq(pix2 + 8);
  127. pix1 += line_size;
  128. pix2 += line_size;
  129. result += perr(p1_l, p2_l)
  130. + perr(p1_r, p2_r);
  131. } while (--h);
  132. }
  133. return result;
  134. }
  135. #endif
  136. int pix_abs16x16_x2_mvi(uint8_t *pix1, uint8_t *pix2, int line_size)
  137. {
  138. int result = 0;
  139. int h = 16;
  140. uint64_t disalign = (size_t) pix2 & 0x7;
  141. switch (disalign) {
  142. case 0:
  143. do {
  144. uint64_t p1_l, p1_r, p2_l, p2_r;
  145. uint64_t l, r;
  146. p1_l = ldq(pix1);
  147. p1_r = ldq(pix1 + 8);
  148. l = ldq(pix2);
  149. r = ldq(pix2 + 8);
  150. p2_l = avg2(l, (l >> 8) | ((uint64_t) r << 56));
  151. p2_r = avg2(r, (r >> 8) | ((uint64_t) pix2[16] << 56));
  152. pix1 += line_size;
  153. pix2 += line_size;
  154. result += perr(p1_l, p2_l)
  155. + perr(p1_r, p2_r);
  156. } while (--h);
  157. break;
  158. case 7:
  159. /* |.......l|lllllllr|rrrrrrr*|
  160. This case is special because disalign1 would be 8, which
  161. gets treated as 0 by extqh. At least it is a bit faster
  162. that way :) */
  163. do {
  164. uint64_t p1_l, p1_r, p2_l, p2_r;
  165. uint64_t l, m, r;
  166. p1_l = ldq(pix1);
  167. p1_r = ldq(pix1 + 8);
  168. l = ldq_u(pix2);
  169. m = ldq_u(pix2 + 8);
  170. r = ldq_u(pix2 + 16);
  171. p2_l = avg2(extql(l, disalign) | extqh(m, disalign), m);
  172. p2_r = avg2(extql(m, disalign) | extqh(r, disalign), r);
  173. pix1 += line_size;
  174. pix2 += line_size;
  175. result += perr(p1_l, p2_l)
  176. + perr(p1_r, p2_r);
  177. } while (--h);
  178. break;
  179. default:
  180. do {
  181. uint64_t disalign1 = disalign + 1;
  182. uint64_t p1_l, p1_r, p2_l, p2_r;
  183. uint64_t l, m, r;
  184. p1_l = ldq(pix1);
  185. p1_r = ldq(pix1 + 8);
  186. l = ldq_u(pix2);
  187. m = ldq_u(pix2 + 8);
  188. r = ldq_u(pix2 + 16);
  189. p2_l = avg2(extql(l, disalign) | extqh(m, disalign),
  190. extql(l, disalign1) | extqh(m, disalign1));
  191. p2_r = avg2(extql(m, disalign) | extqh(r, disalign),
  192. extql(m, disalign1) | extqh(r, disalign1));
  193. pix1 += line_size;
  194. pix2 += line_size;
  195. result += perr(p1_l, p2_l)
  196. + perr(p1_r, p2_r);
  197. } while (--h);
  198. break;
  199. }
  200. return result;
  201. }
  202. int pix_abs16x16_y2_mvi(uint8_t *pix1, uint8_t *pix2, int line_size)
  203. {
  204. int result = 0;
  205. int h = 16;
  206. if ((size_t) pix2 & 0x7) {
  207. uint64_t t, p2_l, p2_r;
  208. t = ldq_u(pix2 + 8);
  209. p2_l = extql(ldq_u(pix2), pix2) | extqh(t, pix2);
  210. p2_r = extql(t, pix2) | extqh(ldq_u(pix2 + 16), pix2);
  211. do {
  212. uint64_t p1_l, p1_r, np2_l, np2_r;
  213. uint64_t t;
  214. p1_l = ldq(pix1);
  215. p1_r = ldq(pix1 + 8);
  216. pix2 += line_size;
  217. t = ldq_u(pix2 + 8);
  218. np2_l = extql(ldq_u(pix2), pix2) | extqh(t, pix2);
  219. np2_r = extql(t, pix2) | extqh(ldq_u(pix2 + 16), pix2);
  220. result += perr(p1_l, avg2(p2_l, np2_l))
  221. + perr(p1_r, avg2(p2_r, np2_r));
  222. pix1 += line_size;
  223. p2_l = np2_l;
  224. p2_r = np2_r;
  225. } while (--h);
  226. } else {
  227. uint64_t p2_l, p2_r;
  228. p2_l = ldq(pix2);
  229. p2_r = ldq(pix2 + 8);
  230. do {
  231. uint64_t p1_l, p1_r, np2_l, np2_r;
  232. p1_l = ldq(pix1);
  233. p1_r = ldq(pix1 + 8);
  234. pix2 += line_size;
  235. np2_l = ldq(pix2);
  236. np2_r = ldq(pix2 + 8);
  237. result += perr(p1_l, avg2(p2_l, np2_l))
  238. + perr(p1_r, avg2(p2_r, np2_r));
  239. pix1 += line_size;
  240. p2_l = np2_l;
  241. p2_r = np2_r;
  242. } while (--h);
  243. }
  244. return result;
  245. }
  246. int pix_abs16x16_xy2_mvi(uint8_t *pix1, uint8_t *pix2, int line_size)
  247. {
  248. int result = 0;
  249. int h = 16;
  250. uint64_t p1_l, p1_r;
  251. uint64_t p2_l, p2_r, p2_x;
  252. p1_l = ldq(pix1);
  253. p1_r = ldq(pix1 + 8);
  254. if ((size_t) pix2 & 0x7) { /* could be optimized a lot */
  255. p2_l = uldq(pix2);
  256. p2_r = uldq(pix2 + 8);
  257. p2_x = (uint64_t) pix2[16] << 56;
  258. } else {
  259. p2_l = ldq(pix2);
  260. p2_r = ldq(pix2 + 8);
  261. p2_x = ldq(pix2 + 16) << 56;
  262. }
  263. do {
  264. uint64_t np1_l, np1_r;
  265. uint64_t np2_l, np2_r, np2_x;
  266. pix1 += line_size;
  267. pix2 += line_size;
  268. np1_l = ldq(pix1);
  269. np1_r = ldq(pix1 + 8);
  270. if ((size_t) pix2 & 0x7) { /* could be optimized a lot */
  271. np2_l = uldq(pix2);
  272. np2_r = uldq(pix2 + 8);
  273. np2_x = (uint64_t) pix2[16] << 56;
  274. } else {
  275. np2_l = ldq(pix2);
  276. np2_r = ldq(pix2 + 8);
  277. np2_x = ldq(pix2 + 16) << 56;
  278. }
  279. result += perr(p1_l,
  280. avg4( p2_l, ( p2_l >> 8) | ((uint64_t) p2_r << 56),
  281. np2_l, (np2_l >> 8) | ((uint64_t) np2_r << 56)))
  282. + perr(p1_r,
  283. avg4( p2_r, ( p2_r >> 8) | ((uint64_t) p2_x),
  284. np2_r, (np2_r >> 8) | ((uint64_t) np2_x)));
  285. p1_l = np1_l;
  286. p1_r = np1_r;
  287. p2_l = np2_l;
  288. p2_r = np2_r;
  289. p2_x = np2_x;
  290. } while (--h);
  291. return result;
  292. }