jcgryext-altivec.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228
  1. /*
  2. * AltiVec optimizations for libjpeg-turbo
  3. *
  4. * Copyright (C) 2014-2015, D. R. Commander. All Rights Reserved.
  5. * Copyright (C) 2014, Jay Foad. All Rights Reserved.
  6. *
  7. * This software is provided 'as-is', without any express or implied
  8. * warranty. In no event will the authors be held liable for any damages
  9. * arising from the use of this software.
  10. *
  11. * Permission is granted to anyone to use this software for any purpose,
  12. * including commercial applications, and to alter it and redistribute it
  13. * freely, subject to the following restrictions:
  14. *
  15. * 1. The origin of this software must not be misrepresented; you must not
  16. * claim that you wrote the original software. If you use this software
  17. * in a product, an acknowledgment in the product documentation would be
  18. * appreciated but is not required.
  19. * 2. Altered source versions must be plainly marked as such, and must not be
  20. * misrepresented as being the original software.
  21. * 3. This notice may not be removed or altered from any source distribution.
  22. */
  23. /* This file is included by jcgray-altivec.c */
  24. void jsimd_rgb_gray_convert_altivec (JDIMENSION img_width,
  25. JSAMPARRAY input_buf,
  26. JSAMPIMAGE output_buf,
  27. JDIMENSION output_row, int num_rows)
  28. {
  29. JSAMPROW inptr, outptr;
  30. int pitch = img_width * RGB_PIXELSIZE, num_cols;
  31. #if __BIG_ENDIAN__
  32. int offset;
  33. unsigned char __attribute__((aligned(16))) tmpbuf[RGB_PIXELSIZE * 16];
  34. #endif
  35. __vector unsigned char rgb0, rgb1 = {0}, rgb2 = {0},
  36. rgbg0, rgbg1, rgbg2, rgbg3, y;
  37. #if __BIG_ENDIAN__ || RGB_PIXELSIZE == 4
  38. __vector unsigned char rgb3 = {0};
  39. #endif
  40. #if __BIG_ENDIAN__ && RGB_PIXELSIZE == 4
  41. __vector unsigned char rgb4 = {0};
  42. #endif
  43. __vector short rg0, rg1, rg2, rg3, bg0, bg1, bg2, bg3;
  44. __vector unsigned short yl, yh;
  45. __vector int y0, y1, y2, y3;
  46. /* Constants */
  47. __vector short pw_f0299_f0337 = { __4X2(F_0_299, F_0_337) },
  48. pw_f0114_f0250 = { __4X2(F_0_114, F_0_250) };
  49. __vector int pd_onehalf = { __4X(ONE_HALF) };
  50. __vector unsigned char pb_zero = { __16X(0) },
  51. #if __BIG_ENDIAN__
  52. shift_pack_index = {0,1,4,5,8,9,12,13,16,17,20,21,24,25,28,29};
  53. #else
  54. shift_pack_index = {2,3,6,7,10,11,14,15,18,19,22,23,26,27,30,31};
  55. #endif
  56. while (--num_rows >= 0) {
  57. inptr = *input_buf++;
  58. outptr = output_buf[0][output_row];
  59. output_row++;
  60. for (num_cols = pitch; num_cols > 0;
  61. num_cols -= RGB_PIXELSIZE * 16, inptr += RGB_PIXELSIZE * 16,
  62. outptr += 16) {
  63. #if __BIG_ENDIAN__
  64. /* Load 16 pixels == 48 or 64 bytes */
  65. offset = (size_t)inptr & 15;
  66. if (offset) {
  67. __vector unsigned char unaligned_shift_index;
  68. int bytes = num_cols + offset;
  69. if (bytes < (RGB_PIXELSIZE + 1) * 16 && (bytes & 15)) {
  70. /* Slow path to prevent buffer overread. Since there is no way to
  71. * read a partial AltiVec register, overread would occur on the last
  72. * chunk of the last image row if the right edge is not on a 16-byte
  73. * boundary. It could also occur on other rows if the bytes per row
  74. * is low enough. Since we can't determine whether we're on the last
  75. * image row, we have to assume every row is the last.
  76. */
  77. memcpy(tmpbuf, inptr, min(num_cols, RGB_PIXELSIZE * 16));
  78. rgb0 = vec_ld(0, tmpbuf);
  79. rgb1 = vec_ld(16, tmpbuf);
  80. rgb2 = vec_ld(32, tmpbuf);
  81. #if RGB_PIXELSIZE == 4
  82. rgb3 = vec_ld(48, tmpbuf);
  83. #endif
  84. } else {
  85. /* Fast path */
  86. rgb0 = vec_ld(0, inptr);
  87. if (bytes > 16)
  88. rgb1 = vec_ld(16, inptr);
  89. if (bytes > 32)
  90. rgb2 = vec_ld(32, inptr);
  91. if (bytes > 48)
  92. rgb3 = vec_ld(48, inptr);
  93. #if RGB_PIXELSIZE == 4
  94. if (bytes > 64)
  95. rgb4 = vec_ld(64, inptr);
  96. #endif
  97. unaligned_shift_index = vec_lvsl(0, inptr);
  98. rgb0 = vec_perm(rgb0, rgb1, unaligned_shift_index);
  99. rgb1 = vec_perm(rgb1, rgb2, unaligned_shift_index);
  100. rgb2 = vec_perm(rgb2, rgb3, unaligned_shift_index);
  101. #if RGB_PIXELSIZE == 4
  102. rgb3 = vec_perm(rgb3, rgb4, unaligned_shift_index);
  103. #endif
  104. }
  105. } else {
  106. if (num_cols < RGB_PIXELSIZE * 16 && (num_cols & 15)) {
  107. /* Slow path */
  108. memcpy(tmpbuf, inptr, min(num_cols, RGB_PIXELSIZE * 16));
  109. rgb0 = vec_ld(0, tmpbuf);
  110. rgb1 = vec_ld(16, tmpbuf);
  111. rgb2 = vec_ld(32, tmpbuf);
  112. #if RGB_PIXELSIZE == 4
  113. rgb3 = vec_ld(48, tmpbuf);
  114. #endif
  115. } else {
  116. /* Fast path */
  117. rgb0 = vec_ld(0, inptr);
  118. if (num_cols > 16)
  119. rgb1 = vec_ld(16, inptr);
  120. if (num_cols > 32)
  121. rgb2 = vec_ld(32, inptr);
  122. #if RGB_PIXELSIZE == 4
  123. if (num_cols > 48)
  124. rgb3 = vec_ld(48, inptr);
  125. #endif
  126. }
  127. }
  128. #else
  129. /* Little endian */
  130. rgb0 = vec_vsx_ld(0, inptr);
  131. if (num_cols > 16)
  132. rgb1 = vec_vsx_ld(16, inptr);
  133. if (num_cols > 32)
  134. rgb2 = vec_vsx_ld(32, inptr);
  135. #if RGB_PIXELSIZE == 4
  136. if (num_cols > 48)
  137. rgb3 = vec_vsx_ld(48, inptr);
  138. #endif
  139. #endif
  140. #if RGB_PIXELSIZE == 3
  141. /* rgb0 = R0 G0 B0 R1 G1 B1 R2 G2 B2 R3 G3 B3 R4 G4 B4 R5
  142. * rgb1 = G5 B5 R6 G6 B6 R7 G7 B7 R8 G8 B8 R9 G9 B9 Ra Ga
  143. * rgb2 = Ba Rb Gb Bb Rc Gc Bc Rd Gd Bd Re Ge Be Rf Gf Bf
  144. *
  145. * rgbg0 = R0 G0 R1 G1 R2 G2 R3 G3 B0 G0 B1 G1 B2 G2 B3 G3
  146. * rgbg1 = R4 G4 R5 G5 R6 G6 R7 G7 B4 G4 B5 G5 B6 G6 B7 G7
  147. * rgbg2 = R8 G8 R9 G9 Ra Ga Rb Gb B8 G8 B9 G9 Ba Ga Bb Gb
  148. * rgbg3 = Rc Gc Rd Gd Re Ge Rf Gf Bc Gc Bd Gd Be Ge Bf Gf
  149. */
  150. rgbg0 = vec_perm(rgb0, rgb0, (__vector unsigned char)RGBG_INDEX0);
  151. rgbg1 = vec_perm(rgb0, rgb1, (__vector unsigned char)RGBG_INDEX1);
  152. rgbg2 = vec_perm(rgb1, rgb2, (__vector unsigned char)RGBG_INDEX2);
  153. rgbg3 = vec_perm(rgb2, rgb2, (__vector unsigned char)RGBG_INDEX3);
  154. #else
  155. /* rgb0 = R0 G0 B0 X0 R1 G1 B1 X1 R2 G2 B2 X2 R3 G3 B3 X3
  156. * rgb1 = R4 G4 B4 X4 R5 G5 B5 X5 R6 G6 B6 X6 R7 G7 B7 X7
  157. * rgb2 = R8 G8 B8 X8 R9 G9 B9 X9 Ra Ga Ba Xa Rb Gb Bb Xb
  158. * rgb3 = Rc Gc Bc Xc Rd Gd Bd Xd Re Ge Be Xe Rf Gf Bf Xf
  159. *
  160. * rgbg0 = R0 G0 R1 G1 R2 G2 R3 G3 B0 G0 B1 G1 B2 G2 B3 G3
  161. * rgbg1 = R4 G4 R5 G5 R6 G6 R7 G7 B4 G4 B5 G5 B6 G6 B7 G7
  162. * rgbg2 = R8 G8 R9 G9 Ra Ga Rb Gb B8 G8 B9 G9 Ba Ga Bb Gb
  163. * rgbg3 = Rc Gc Rd Gd Re Ge Rf Gf Bc Gc Bd Gd Be Ge Bf Gf
  164. */
  165. rgbg0 = vec_perm(rgb0, rgb0, (__vector unsigned char)RGBG_INDEX);
  166. rgbg1 = vec_perm(rgb1, rgb1, (__vector unsigned char)RGBG_INDEX);
  167. rgbg2 = vec_perm(rgb2, rgb2, (__vector unsigned char)RGBG_INDEX);
  168. rgbg3 = vec_perm(rgb3, rgb3, (__vector unsigned char)RGBG_INDEX);
  169. #endif
  170. /* rg0 = R0 G0 R1 G1 R2 G2 R3 G3
  171. * bg0 = B0 G0 B1 G1 B2 G2 B3 G3
  172. * ...
  173. *
  174. * NOTE: We have to use vec_merge*() here because vec_unpack*() doesn't
  175. * support unsigned vectors.
  176. */
  177. rg0 = (__vector signed short)VEC_UNPACKHU(rgbg0);
  178. bg0 = (__vector signed short)VEC_UNPACKLU(rgbg0);
  179. rg1 = (__vector signed short)VEC_UNPACKHU(rgbg1);
  180. bg1 = (__vector signed short)VEC_UNPACKLU(rgbg1);
  181. rg2 = (__vector signed short)VEC_UNPACKHU(rgbg2);
  182. bg2 = (__vector signed short)VEC_UNPACKLU(rgbg2);
  183. rg3 = (__vector signed short)VEC_UNPACKHU(rgbg3);
  184. bg3 = (__vector signed short)VEC_UNPACKLU(rgbg3);
  185. /* (Original)
  186. * Y = 0.29900 * R + 0.58700 * G + 0.11400 * B
  187. *
  188. * (This implementation)
  189. * Y = 0.29900 * R + 0.33700 * G + 0.11400 * B + 0.25000 * G
  190. */
  191. /* Calculate Y values */
  192. y0 = vec_msums(rg0, pw_f0299_f0337, pd_onehalf);
  193. y1 = vec_msums(rg1, pw_f0299_f0337, pd_onehalf);
  194. y2 = vec_msums(rg2, pw_f0299_f0337, pd_onehalf);
  195. y3 = vec_msums(rg3, pw_f0299_f0337, pd_onehalf);
  196. y0 = vec_msums(bg0, pw_f0114_f0250, y0);
  197. y1 = vec_msums(bg1, pw_f0114_f0250, y1);
  198. y2 = vec_msums(bg2, pw_f0114_f0250, y2);
  199. y3 = vec_msums(bg3, pw_f0114_f0250, y3);
  200. /* Clever way to avoid 4 shifts + 2 packs. This packs the high word from
  201. * each dword into a new 16-bit vector, which is the equivalent of
  202. * descaling the 32-bit results (right-shifting by 16 bits) and then
  203. * packing them.
  204. */
  205. yl = vec_perm((__vector unsigned short)y0, (__vector unsigned short)y1,
  206. shift_pack_index);
  207. yh = vec_perm((__vector unsigned short)y2, (__vector unsigned short)y3,
  208. shift_pack_index);
  209. y = vec_pack(yl, yh);
  210. vec_st(y, 0, outptr);
  211. }
  212. }
  213. }