deblock.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  1. /*****************************************************************************
  2. * deblock.c: ppc deblocking
  3. *****************************************************************************
  4. * Copyright (C) 2007-2018 x264 project
  5. *
  6. * Authors: Guillaume Poirier <gpoirier@mplayerhq.hu>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program 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
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
  21. *
  22. * This program is also available under a commercial proprietary license.
  23. * For more information, contact us at licensing@x264.com.
  24. *****************************************************************************/
  25. #include "common/common.h"
  26. #include "ppccommon.h"
  27. #include "deblock.h"
  28. #if !HIGH_BIT_DEPTH
  29. #define transpose4x16(r0, r1, r2, r3) \
  30. { \
  31. register vec_u8_t r4; \
  32. register vec_u8_t r5; \
  33. register vec_u8_t r6; \
  34. register vec_u8_t r7; \
  35. \
  36. r4 = vec_mergeh(r0, r2); /*0, 2 set 0*/ \
  37. r5 = vec_mergel(r0, r2); /*0, 2 set 1*/ \
  38. r6 = vec_mergeh(r1, r3); /*1, 3 set 0*/ \
  39. r7 = vec_mergel(r1, r3); /*1, 3 set 1*/ \
  40. \
  41. r0 = vec_mergeh(r4, r6); /*all set 0*/ \
  42. r1 = vec_mergel(r4, r6); /*all set 1*/ \
  43. r2 = vec_mergeh(r5, r7); /*all set 2*/ \
  44. r3 = vec_mergel(r5, r7); /*all set 3*/ \
  45. }
  46. static inline void write16x4( uint8_t *dst, int dst_stride,
  47. register vec_u8_t r0, register vec_u8_t r1,
  48. register vec_u8_t r2, register vec_u8_t r3 )
  49. {
  50. ALIGNED_16(unsigned char result[64]);
  51. uint32_t *src_int = (uint32_t *)result, *dst_int = (uint32_t *)dst;
  52. int int_dst_stride = dst_stride >> 2;
  53. vec_st(r0, 0, result);
  54. vec_st(r1, 16, result);
  55. vec_st(r2, 32, result);
  56. vec_st(r3, 48, result);
  57. /* FIXME: there has to be a better way!!!! */
  58. *dst_int = *src_int;
  59. *(dst_int+ int_dst_stride) = *(src_int + 1);
  60. *(dst_int+ 2*int_dst_stride) = *(src_int + 2);
  61. *(dst_int+ 3*int_dst_stride) = *(src_int + 3);
  62. *(dst_int+ 4*int_dst_stride) = *(src_int + 4);
  63. *(dst_int+ 5*int_dst_stride) = *(src_int + 5);
  64. *(dst_int+ 6*int_dst_stride) = *(src_int + 6);
  65. *(dst_int+ 7*int_dst_stride) = *(src_int + 7);
  66. *(dst_int+ 8*int_dst_stride) = *(src_int + 8);
  67. *(dst_int+ 9*int_dst_stride) = *(src_int + 9);
  68. *(dst_int+10*int_dst_stride) = *(src_int + 10);
  69. *(dst_int+11*int_dst_stride) = *(src_int + 11);
  70. *(dst_int+12*int_dst_stride) = *(src_int + 12);
  71. *(dst_int+13*int_dst_stride) = *(src_int + 13);
  72. *(dst_int+14*int_dst_stride) = *(src_int + 14);
  73. *(dst_int+15*int_dst_stride) = *(src_int + 15);
  74. }
  75. /** \brief performs a 6x16 transpose of data in src, and stores it to dst */
  76. #define read_and_transpose16x6(src, src_stride, r8, r9, r10, r11, r12, r13)\
  77. {\
  78. register vec_u8_t r0, r1, r2, r3, r4, r5, r6, r7, r14, r15;\
  79. r0 = vec_vsx_ld(0, src); \
  80. r1 = vec_vsx_ld(src_stride, src); \
  81. r2 = vec_vsx_ld(2*src_stride, src); \
  82. r3 = vec_vsx_ld(3*src_stride, src); \
  83. r4 = vec_vsx_ld(4*src_stride, src); \
  84. r5 = vec_vsx_ld(5*src_stride, src); \
  85. r6 = vec_vsx_ld(6*src_stride, src); \
  86. r7 = vec_vsx_ld(7*src_stride, src); \
  87. r8 = vec_vsx_ld(8*src_stride, src); \
  88. r9 = vec_vsx_ld(9*src_stride, src); \
  89. r10 = vec_vsx_ld(10*src_stride, src); \
  90. r11 = vec_vsx_ld(11*src_stride, src); \
  91. r12 = vec_vsx_ld(12*src_stride, src); \
  92. r13 = vec_vsx_ld(13*src_stride, src); \
  93. r14 = vec_vsx_ld(14*src_stride, src); \
  94. r15 = vec_vsx_ld(15*src_stride, src); \
  95. \
  96. /*Merge first pairs*/ \
  97. r0 = vec_mergeh(r0, r8); /*0, 8*/ \
  98. r1 = vec_mergeh(r1, r9); /*1, 9*/ \
  99. r2 = vec_mergeh(r2, r10); /*2,10*/ \
  100. r3 = vec_mergeh(r3, r11); /*3,11*/ \
  101. r4 = vec_mergeh(r4, r12); /*4,12*/ \
  102. r5 = vec_mergeh(r5, r13); /*5,13*/ \
  103. r6 = vec_mergeh(r6, r14); /*6,14*/ \
  104. r7 = vec_mergeh(r7, r15); /*7,15*/ \
  105. \
  106. /*Merge second pairs*/ \
  107. r8 = vec_mergeh(r0, r4); /*0,4, 8,12 set 0*/ \
  108. r9 = vec_mergel(r0, r4); /*0,4, 8,12 set 1*/ \
  109. r10 = vec_mergeh(r1, r5); /*1,5, 9,13 set 0*/ \
  110. r11 = vec_mergel(r1, r5); /*1,5, 9,13 set 1*/ \
  111. r12 = vec_mergeh(r2, r6); /*2,6,10,14 set 0*/ \
  112. r13 = vec_mergel(r2, r6); /*2,6,10,14 set 1*/ \
  113. r14 = vec_mergeh(r3, r7); /*3,7,11,15 set 0*/ \
  114. r15 = vec_mergel(r3, r7); /*3,7,11,15 set 1*/ \
  115. \
  116. /*Third merge*/ \
  117. r0 = vec_mergeh(r8, r12); /*0,2,4,6,8,10,12,14 set 0*/ \
  118. r1 = vec_mergel(r8, r12); /*0,2,4,6,8,10,12,14 set 1*/ \
  119. r2 = vec_mergeh(r9, r13); /*0,2,4,6,8,10,12,14 set 2*/ \
  120. r4 = vec_mergeh(r10, r14); /*1,3,5,7,9,11,13,15 set 0*/ \
  121. r5 = vec_mergel(r10, r14); /*1,3,5,7,9,11,13,15 set 1*/ \
  122. r6 = vec_mergeh(r11, r15); /*1,3,5,7,9,11,13,15 set 2*/ \
  123. /* Don't need to compute 3 and 7*/ \
  124. \
  125. /*Final merge*/ \
  126. r8 = vec_mergeh(r0, r4); /*all set 0*/ \
  127. r9 = vec_mergel(r0, r4); /*all set 1*/ \
  128. r10 = vec_mergeh(r1, r5); /*all set 2*/ \
  129. r11 = vec_mergel(r1, r5); /*all set 3*/ \
  130. r12 = vec_mergeh(r2, r6); /*all set 4*/ \
  131. r13 = vec_mergel(r2, r6); /*all set 5*/ \
  132. /* Don't need to compute 14 and 15*/ \
  133. \
  134. }
  135. // out: o = |x-y| < a
  136. static inline vec_u8_t diff_lt_altivec( register vec_u8_t x, register vec_u8_t y, register vec_u8_t a )
  137. {
  138. return (vec_u8_t)vec_cmplt(vec_absd(x, y), a);
  139. }
  140. static inline vec_u8_t h264_deblock_mask( register vec_u8_t p0, register vec_u8_t p1, register vec_u8_t q0,
  141. register vec_u8_t q1, register vec_u8_t alpha, register vec_u8_t beta )
  142. {
  143. register vec_u8_t mask;
  144. register vec_u8_t tempmask;
  145. mask = diff_lt_altivec(p0, q0, alpha);
  146. tempmask = diff_lt_altivec(p1, p0, beta);
  147. mask = vec_and(mask, tempmask);
  148. tempmask = diff_lt_altivec(q1, q0, beta);
  149. mask = vec_and(mask, tempmask);
  150. return mask;
  151. }
  152. // out: newp1 = clip((p2 + ((p0 + q0 + 1) >> 1)) >> 1, p1-tc0, p1+tc0)
  153. static inline vec_u8_t h264_deblock_q1( register vec_u8_t p0, register vec_u8_t p1, register vec_u8_t p2,
  154. register vec_u8_t q0, register vec_u8_t tc0 )
  155. {
  156. register vec_u8_t average = vec_avg(p0, q0);
  157. register vec_u8_t temp;
  158. register vec_u8_t uncliped;
  159. register vec_u8_t ones;
  160. register vec_u8_t max;
  161. register vec_u8_t min;
  162. register vec_u8_t newp1;
  163. temp = vec_xor(average, p2);
  164. average = vec_avg(average, p2); /*avg(p2, avg(p0, q0)) */
  165. ones = vec_splat_u8(1);
  166. temp = vec_and(temp, ones); /*(p2^avg(p0, q0)) & 1 */
  167. uncliped = vec_subs(average, temp); /*(p2+((p0+q0+1)>>1))>>1 */
  168. max = vec_adds(p1, tc0);
  169. min = vec_subs(p1, tc0);
  170. newp1 = vec_max(min, uncliped);
  171. newp1 = vec_min(max, newp1);
  172. return newp1;
  173. }
  174. #define h264_deblock_p0_q0(p0, p1, q0, q1, tc0masked) \
  175. { \
  176. const vec_u8_t A0v = vec_sl(vec_splat_u8(10), vec_splat_u8(4)); \
  177. \
  178. register vec_u8_t pq0bit = vec_xor(p0,q0); \
  179. register vec_u8_t q1minus; \
  180. register vec_u8_t p0minus; \
  181. register vec_u8_t stage1; \
  182. register vec_u8_t stage2; \
  183. register vec_u8_t vec160; \
  184. register vec_u8_t delta; \
  185. register vec_u8_t deltaneg; \
  186. \
  187. q1minus = vec_nor(q1, q1); /* 255 - q1 */ \
  188. stage1 = vec_avg(p1, q1minus); /* (p1 - q1 + 256)>>1 */ \
  189. stage2 = vec_sr(stage1, vec_splat_u8(1)); /* (p1 - q1 + 256)>>2 = 64 + (p1 - q1) >> 2 */ \
  190. p0minus = vec_nor(p0, p0); /* 255 - p0 */ \
  191. stage1 = vec_avg(q0, p0minus); /* (q0 - p0 + 256)>>1 */ \
  192. pq0bit = vec_and(pq0bit, vec_splat_u8(1)); \
  193. stage2 = vec_avg(stage2, pq0bit); /* 32 + ((q0 - p0)&1 + (p1 - q1) >> 2 + 1) >> 1 */\
  194. stage2 = vec_adds(stage2, stage1); /* 160 + ((p0 - q0) + (p1 - q1) >> 2 + 1) >> 1 */ \
  195. vec160 = vec_ld(0, &A0v); \
  196. deltaneg = vec_subs(vec160, stage2); /* -d */ \
  197. delta = vec_subs(stage2, vec160); /* d */ \
  198. deltaneg = vec_min(tc0masked, deltaneg); \
  199. delta = vec_min(tc0masked, delta); \
  200. p0 = vec_subs(p0, deltaneg); \
  201. q0 = vec_subs(q0, delta); \
  202. p0 = vec_adds(p0, delta); \
  203. q0 = vec_adds(q0, deltaneg); \
  204. }
  205. #define h264_loop_filter_luma_altivec(p2, p1, p0, q0, q1, q2, alpha, beta, tc0) \
  206. { \
  207. ALIGNED_16(unsigned char temp[16]); \
  208. register vec_u8_t alphavec; \
  209. register vec_u8_t betavec; \
  210. register vec_u8_t mask; \
  211. register vec_u8_t p1mask; \
  212. register vec_u8_t q1mask; \
  213. register vec_s8_t tc0vec; \
  214. register vec_u8_t finaltc0; \
  215. register vec_u8_t tc0masked; \
  216. register vec_u8_t newp1; \
  217. register vec_u8_t newq1; \
  218. \
  219. temp[0] = alpha; \
  220. temp[1] = beta; \
  221. alphavec = vec_ld(0, temp); \
  222. betavec = vec_splat(alphavec, 0x1); \
  223. alphavec = vec_splat(alphavec, 0x0); \
  224. mask = h264_deblock_mask(p0, p1, q0, q1, alphavec, betavec); /*if in block */ \
  225. \
  226. M32( temp ) = M32( tc0 ); \
  227. tc0vec = vec_ld(0, (signed char*)temp); \
  228. tc0vec = vec_mergeh(tc0vec, tc0vec); \
  229. tc0vec = vec_mergeh(tc0vec, tc0vec); \
  230. mask = vec_and(mask, vec_cmpgt(tc0vec, vec_splat_s8(-1))); /* if tc0[i] >= 0 */ \
  231. finaltc0 = vec_and((vec_u8_t)tc0vec, mask); /* tc = tc0 */ \
  232. \
  233. p1mask = diff_lt_altivec(p2, p0, betavec); \
  234. p1mask = vec_and(p1mask, mask); /* if( |p2 - p0| < beta ) */ \
  235. tc0masked = vec_and(p1mask, (vec_u8_t)tc0vec); \
  236. finaltc0 = vec_sub(finaltc0, p1mask); /* tc++ */ \
  237. newp1 = h264_deblock_q1(p0, p1, p2, q0, tc0masked); \
  238. /*end if*/ \
  239. \
  240. q1mask = diff_lt_altivec(q2, q0, betavec); \
  241. q1mask = vec_and(q1mask, mask); /* if( |q2 - q0| < beta ) */ \
  242. tc0masked = vec_and(q1mask, (vec_u8_t)tc0vec); \
  243. finaltc0 = vec_sub(finaltc0, q1mask); /* tc++ */ \
  244. newq1 = h264_deblock_q1(p0, q1, q2, q0, tc0masked); \
  245. /*end if*/ \
  246. \
  247. h264_deblock_p0_q0(p0, p1, q0, q1, finaltc0); \
  248. p1 = newp1; \
  249. q1 = newq1; \
  250. }
  251. void x264_deblock_v_luma_altivec( uint8_t *pix, intptr_t stride, int alpha, int beta, int8_t *tc0 )
  252. {
  253. if( (tc0[0] & tc0[1] & tc0[2] & tc0[3]) >= 0 )
  254. {
  255. register vec_u8_t p2 = vec_ld(-3*stride, pix);
  256. register vec_u8_t p1 = vec_ld(-2*stride, pix);
  257. register vec_u8_t p0 = vec_ld(-1*stride, pix);
  258. register vec_u8_t q0 = vec_ld(0, pix);
  259. register vec_u8_t q1 = vec_ld(stride, pix);
  260. register vec_u8_t q2 = vec_ld(2*stride, pix);
  261. h264_loop_filter_luma_altivec(p2, p1, p0, q0, q1, q2, alpha, beta, tc0);
  262. vec_st(p1, -2*stride, pix);
  263. vec_st(p0, -1*stride, pix);
  264. vec_st(q0, 0, pix);
  265. vec_st(q1, stride, pix);
  266. }
  267. }
  268. void x264_deblock_h_luma_altivec( uint8_t *pix, intptr_t stride, int alpha, int beta, int8_t *tc0 )
  269. {
  270. register vec_u8_t line0, line1, line2, line3, line4, line5;
  271. if( (tc0[0] & tc0[1] & tc0[2] & tc0[3]) < 0 )
  272. return;
  273. read_and_transpose16x6(pix-3, stride, line0, line1, line2, line3, line4, line5);
  274. h264_loop_filter_luma_altivec(line0, line1, line2, line3, line4, line5, alpha, beta, tc0);
  275. transpose4x16(line1, line2, line3, line4);
  276. write16x4(pix-2, stride, line1, line2, line3, line4);
  277. }
  278. #endif // !HIGH_BIT_DEPTH