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.

579 lines
24KB

  1. /*
  2. * DSP utils
  3. * Copyright (c) 2000, 2001 Gerard Lantau.
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program 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
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  18. */
  19. #include <stdlib.h>
  20. #include <stdio.h>
  21. #include "avcodec.h"
  22. #include "dsputil.h"
  23. #include "simple_idct.h"
  24. void (*ff_idct)(DCTELEM *block);
  25. void (*get_pixels)(DCTELEM *block, const UINT8 *pixels, int line_size);
  26. void (*put_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size);
  27. void (*add_pixels_clamped)(const DCTELEM *block, UINT8 *pixels, int line_size);
  28. op_pixels_abs_func pix_abs16x16;
  29. op_pixels_abs_func pix_abs16x16_x2;
  30. op_pixels_abs_func pix_abs16x16_y2;
  31. op_pixels_abs_func pix_abs16x16_xy2;
  32. UINT8 cropTbl[256 + 2 * MAX_NEG_CROP];
  33. UINT32 squareTbl[512];
  34. extern UINT16 default_intra_matrix[64];
  35. extern UINT16 default_non_intra_matrix[64];
  36. UINT8 zigzag_direct[64] = {
  37. 0, 1, 8, 16, 9, 2, 3, 10,
  38. 17, 24, 32, 25, 18, 11, 4, 5,
  39. 12, 19, 26, 33, 40, 48, 41, 34,
  40. 27, 20, 13, 6, 7, 14, 21, 28,
  41. 35, 42, 49, 56, 57, 50, 43, 36,
  42. 29, 22, 15, 23, 30, 37, 44, 51,
  43. 58, 59, 52, 45, 38, 31, 39, 46,
  44. 53, 60, 61, 54, 47, 55, 62, 63
  45. };
  46. /* not permutated inverse zigzag_direct + 1 for MMX quantizer */
  47. UINT16 __align8 inv_zigzag_direct16[64];
  48. /* not permutated zigzag_direct for MMX quantizer */
  49. UINT8 zigzag_direct_noperm[64];
  50. UINT8 ff_alternate_horizontal_scan[64] = {
  51. 0, 1, 2, 3, 8, 9, 16, 17,
  52. 10, 11, 4, 5, 6, 7, 15, 14,
  53. 13, 12, 19, 18, 24, 25, 32, 33,
  54. 26, 27, 20, 21, 22, 23, 28, 29,
  55. 30, 31, 34, 35, 40, 41, 48, 49,
  56. 42, 43, 36, 37, 38, 39, 44, 45,
  57. 46, 47, 50, 51, 56, 57, 58, 59,
  58. 52, 53, 54, 55, 60, 61, 62, 63,
  59. };
  60. UINT8 ff_alternate_vertical_scan[64] = {
  61. 0, 8, 16, 24, 1, 9, 2, 10,
  62. 17, 25, 32, 40, 48, 56, 57, 49,
  63. 41, 33, 26, 18, 3, 11, 4, 12,
  64. 19, 27, 34, 42, 50, 58, 35, 43,
  65. 51, 59, 20, 28, 5, 13, 6, 14,
  66. 21, 29, 36, 44, 52, 60, 37, 45,
  67. 53, 61, 22, 30, 7, 15, 23, 31,
  68. 38, 46, 54, 62, 39, 47, 55, 63,
  69. };
  70. /* Input permutation for the simple_idct_mmx */
  71. static UINT8 simple_mmx_permutation[64]={
  72. 0x00, 0x08, 0x04, 0x09, 0x01, 0x0C, 0x05, 0x0D,
  73. 0x10, 0x18, 0x14, 0x19, 0x11, 0x1C, 0x15, 0x1D,
  74. 0x20, 0x28, 0x24, 0x29, 0x21, 0x2C, 0x25, 0x2D,
  75. 0x12, 0x1A, 0x16, 0x1B, 0x13, 0x1E, 0x17, 0x1F,
  76. 0x02, 0x0A, 0x06, 0x0B, 0x03, 0x0E, 0x07, 0x0F,
  77. 0x30, 0x38, 0x34, 0x39, 0x31, 0x3C, 0x35, 0x3D,
  78. 0x22, 0x2A, 0x26, 0x2B, 0x23, 0x2E, 0x27, 0x2F,
  79. 0x32, 0x3A, 0x36, 0x3B, 0x33, 0x3E, 0x37, 0x3F,
  80. };
  81. /* a*inverse[b]>>32 == a/b for all 0<=a<=65536 && 2<=b<=255 */
  82. UINT32 inverse[256]={
  83. 0, 4294967295U,2147483648U,1431655766, 1073741824, 858993460, 715827883, 613566757,
  84. 536870912, 477218589, 429496730, 390451573, 357913942, 330382100, 306783379, 286331154,
  85. 268435456, 252645136, 238609295, 226050911, 214748365, 204522253, 195225787, 186737709,
  86. 178956971, 171798692, 165191050, 159072863, 153391690, 148102321, 143165577, 138547333,
  87. 134217728, 130150525, 126322568, 122713352, 119304648, 116080198, 113025456, 110127367,
  88. 107374183, 104755300, 102261127, 99882961, 97612894, 95443718, 93368855, 91382283,
  89. 89478486, 87652394, 85899346, 84215046, 82595525, 81037119, 79536432, 78090315,
  90. 76695845, 75350304, 74051161, 72796056, 71582789, 70409300, 69273667, 68174085,
  91. 67108864, 66076420, 65075263, 64103990, 63161284, 62245903, 61356676, 60492498,
  92. 59652324, 58835169, 58040099, 57266231, 56512728, 55778797, 55063684, 54366675,
  93. 53687092, 53024288, 52377650, 51746594, 51130564, 50529028, 49941481, 49367441,
  94. 48806447, 48258060, 47721859, 47197443, 46684428, 46182445, 45691142, 45210183,
  95. 44739243, 44278014, 43826197, 43383509, 42949673, 42524429, 42107523, 41698712,
  96. 41297763, 40904451, 40518560, 40139882, 39768216, 39403370, 39045158, 38693400,
  97. 38347923, 38008561, 37675152, 37347542, 37025581, 36709123, 36398028, 36092163,
  98. 35791395, 35495598, 35204650, 34918434, 34636834, 34359739, 34087043, 33818641,
  99. 33554432, 33294321, 33038210, 32786010, 32537632, 32292988, 32051995, 31814573,
  100. 31580642, 31350127, 31122952, 30899046, 30678338, 30460761, 30246249, 30034737,
  101. 29826162, 29620465, 29417585, 29217465, 29020050, 28825284, 28633116, 28443493,
  102. 28256364, 28071682, 27889399, 27709467, 27531842, 27356480, 27183338, 27012373,
  103. 26843546, 26676816, 26512144, 26349493, 26188825, 26030105, 25873297, 25718368,
  104. 25565282, 25414008, 25264514, 25116768, 24970741, 24826401, 24683721, 24542671,
  105. 24403224, 24265352, 24129030, 23994231, 23860930, 23729102, 23598722, 23469767,
  106. 23342214, 23216040, 23091223, 22967740, 22845571, 22724695, 22605092, 22486740,
  107. 22369622, 22253717, 22139007, 22025474, 21913099, 21801865, 21691755, 21582751,
  108. 21474837, 21367997, 21262215, 21157475, 21053762, 20951060, 20849356, 20748635,
  109. 20648882, 20550083, 20452226, 20355296, 20259280, 20164166, 20069941, 19976593,
  110. 19884108, 19792477, 19701685, 19611723, 19522579, 19434242, 19346700, 19259944,
  111. 19173962, 19088744, 19004281, 18920561, 18837576, 18755316, 18673771, 18592933,
  112. 18512791, 18433337, 18354562, 18276457, 18199014, 18122225, 18046082, 17970575,
  113. 17895698, 17821442, 17747799, 17674763, 17602325, 17530479, 17459217, 17388532,
  114. 17318417, 17248865, 17179870, 17111424, 17043522, 16976156, 16909321, 16843010,
  115. };
  116. /* used to skip zeros at the end */
  117. UINT8 zigzag_end[64];
  118. UINT8 permutation[64];
  119. //UINT8 invPermutation[64];
  120. static void build_zigzag_end()
  121. {
  122. int lastIndex;
  123. int lastIndexAfterPerm=0;
  124. for(lastIndex=0; lastIndex<64; lastIndex++)
  125. {
  126. if(zigzag_direct[lastIndex] > lastIndexAfterPerm)
  127. lastIndexAfterPerm= zigzag_direct[lastIndex];
  128. zigzag_end[lastIndex]= lastIndexAfterPerm + 1;
  129. }
  130. }
  131. void get_pixels_c(DCTELEM *block, const UINT8 *pixels, int line_size)
  132. {
  133. DCTELEM *p;
  134. const UINT8 *pix;
  135. int i;
  136. /* read the pixels */
  137. p = block;
  138. pix = pixels;
  139. for(i=0;i<8;i++) {
  140. p[0] = pix[0];
  141. p[1] = pix[1];
  142. p[2] = pix[2];
  143. p[3] = pix[3];
  144. p[4] = pix[4];
  145. p[5] = pix[5];
  146. p[6] = pix[6];
  147. p[7] = pix[7];
  148. pix += line_size;
  149. p += 8;
  150. }
  151. }
  152. void put_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  153. {
  154. const DCTELEM *p;
  155. UINT8 *pix;
  156. int i;
  157. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  158. /* read the pixels */
  159. p = block;
  160. pix = pixels;
  161. for(i=0;i<8;i++) {
  162. pix[0] = cm[p[0]];
  163. pix[1] = cm[p[1]];
  164. pix[2] = cm[p[2]];
  165. pix[3] = cm[p[3]];
  166. pix[4] = cm[p[4]];
  167. pix[5] = cm[p[5]];
  168. pix[6] = cm[p[6]];
  169. pix[7] = cm[p[7]];
  170. pix += line_size;
  171. p += 8;
  172. }
  173. }
  174. void add_pixels_clamped_c(const DCTELEM *block, UINT8 *pixels, int line_size)
  175. {
  176. const DCTELEM *p;
  177. UINT8 *pix;
  178. int i;
  179. UINT8 *cm = cropTbl + MAX_NEG_CROP;
  180. /* read the pixels */
  181. p = block;
  182. pix = pixels;
  183. for(i=0;i<8;i++) {
  184. pix[0] = cm[pix[0] + p[0]];
  185. pix[1] = cm[pix[1] + p[1]];
  186. pix[2] = cm[pix[2] + p[2]];
  187. pix[3] = cm[pix[3] + p[3]];
  188. pix[4] = cm[pix[4] + p[4]];
  189. pix[5] = cm[pix[5] + p[5]];
  190. pix[6] = cm[pix[6] + p[6]];
  191. pix[7] = cm[pix[7] + p[7]];
  192. pix += line_size;
  193. p += 8;
  194. }
  195. }
  196. #define PIXOP(BTYPE, OPNAME, OP, INCR) \
  197. \
  198. static void OPNAME ## _pixels(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  199. { \
  200. BTYPE *p; \
  201. const UINT8 *pix; \
  202. \
  203. p = block; \
  204. pix = pixels; \
  205. do { \
  206. OP(p[0], pix[0]); \
  207. OP(p[1], pix[1]); \
  208. OP(p[2], pix[2]); \
  209. OP(p[3], pix[3]); \
  210. OP(p[4], pix[4]); \
  211. OP(p[5], pix[5]); \
  212. OP(p[6], pix[6]); \
  213. OP(p[7], pix[7]); \
  214. pix += line_size; \
  215. p += INCR; \
  216. } while (--h);; \
  217. } \
  218. \
  219. static void OPNAME ## _pixels_x2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  220. { \
  221. BTYPE *p; \
  222. const UINT8 *pix; \
  223. \
  224. p = block; \
  225. pix = pixels; \
  226. do { \
  227. OP(p[0], avg2(pix[0], pix[1])); \
  228. OP(p[1], avg2(pix[1], pix[2])); \
  229. OP(p[2], avg2(pix[2], pix[3])); \
  230. OP(p[3], avg2(pix[3], pix[4])); \
  231. OP(p[4], avg2(pix[4], pix[5])); \
  232. OP(p[5], avg2(pix[5], pix[6])); \
  233. OP(p[6], avg2(pix[6], pix[7])); \
  234. OP(p[7], avg2(pix[7], pix[8])); \
  235. pix += line_size; \
  236. p += INCR; \
  237. } while (--h); \
  238. } \
  239. \
  240. static void OPNAME ## _pixels_y2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  241. { \
  242. BTYPE *p; \
  243. const UINT8 *pix; \
  244. const UINT8 *pix1; \
  245. \
  246. p = block; \
  247. pix = pixels; \
  248. pix1 = pixels + line_size; \
  249. do { \
  250. OP(p[0], avg2(pix[0], pix1[0])); \
  251. OP(p[1], avg2(pix[1], pix1[1])); \
  252. OP(p[2], avg2(pix[2], pix1[2])); \
  253. OP(p[3], avg2(pix[3], pix1[3])); \
  254. OP(p[4], avg2(pix[4], pix1[4])); \
  255. OP(p[5], avg2(pix[5], pix1[5])); \
  256. OP(p[6], avg2(pix[6], pix1[6])); \
  257. OP(p[7], avg2(pix[7], pix1[7])); \
  258. pix += line_size; \
  259. pix1 += line_size; \
  260. p += INCR; \
  261. } while(--h); \
  262. } \
  263. \
  264. static void OPNAME ## _pixels_xy2(BTYPE *block, const UINT8 *pixels, int line_size, int h) \
  265. { \
  266. BTYPE *p; \
  267. const UINT8 *pix; \
  268. const UINT8 *pix1; \
  269. \
  270. p = block; \
  271. pix = pixels; \
  272. pix1 = pixels + line_size; \
  273. do { \
  274. OP(p[0], avg4(pix[0], pix[1], pix1[0], pix1[1])); \
  275. OP(p[1], avg4(pix[1], pix[2], pix1[1], pix1[2])); \
  276. OP(p[2], avg4(pix[2], pix[3], pix1[2], pix1[3])); \
  277. OP(p[3], avg4(pix[3], pix[4], pix1[3], pix1[4])); \
  278. OP(p[4], avg4(pix[4], pix[5], pix1[4], pix1[5])); \
  279. OP(p[5], avg4(pix[5], pix[6], pix1[5], pix1[6])); \
  280. OP(p[6], avg4(pix[6], pix[7], pix1[6], pix1[7])); \
  281. OP(p[7], avg4(pix[7], pix[8], pix1[7], pix1[8])); \
  282. pix += line_size; \
  283. pix1 += line_size; \
  284. p += INCR; \
  285. } while(--h); \
  286. } \
  287. \
  288. void (*OPNAME ## _pixels_tab[4])(BTYPE *block, const UINT8 *pixels, int line_size, int h) = { \
  289. OPNAME ## _pixels, \
  290. OPNAME ## _pixels_x2, \
  291. OPNAME ## _pixels_y2, \
  292. OPNAME ## _pixels_xy2, \
  293. };
  294. /* rounding primitives */
  295. #define avg2(a,b) ((a+b+1)>>1)
  296. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  297. #define op_put(a, b) a = b
  298. #define op_avg(a, b) a = avg2(a, b)
  299. #define op_sub(a, b) a -= b
  300. PIXOP(UINT8, put, op_put, line_size)
  301. PIXOP(UINT8, avg, op_avg, line_size)
  302. PIXOP(DCTELEM, sub, op_sub, 8)
  303. /* not rounding primitives */
  304. #undef avg2
  305. #undef avg4
  306. #define avg2(a,b) ((a+b)>>1)
  307. #define avg4(a,b,c,d) ((a+b+c+d+1)>>2)
  308. PIXOP(UINT8, put_no_rnd, op_put, line_size)
  309. PIXOP(UINT8, avg_no_rnd, op_avg, line_size)
  310. /* motion estimation */
  311. #undef avg2
  312. #undef avg4
  313. #define avg2(a,b) ((a+b+1)>>1)
  314. #define avg4(a,b,c,d) ((a+b+c+d+2)>>2)
  315. int pix_abs16x16_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  316. {
  317. int s, i;
  318. s = 0;
  319. for(i=0;i<h;i++) {
  320. s += abs(pix1[0] - pix2[0]);
  321. s += abs(pix1[1] - pix2[1]);
  322. s += abs(pix1[2] - pix2[2]);
  323. s += abs(pix1[3] - pix2[3]);
  324. s += abs(pix1[4] - pix2[4]);
  325. s += abs(pix1[5] - pix2[5]);
  326. s += abs(pix1[6] - pix2[6]);
  327. s += abs(pix1[7] - pix2[7]);
  328. s += abs(pix1[8] - pix2[8]);
  329. s += abs(pix1[9] - pix2[9]);
  330. s += abs(pix1[10] - pix2[10]);
  331. s += abs(pix1[11] - pix2[11]);
  332. s += abs(pix1[12] - pix2[12]);
  333. s += abs(pix1[13] - pix2[13]);
  334. s += abs(pix1[14] - pix2[14]);
  335. s += abs(pix1[15] - pix2[15]);
  336. pix1 += line_size;
  337. pix2 += line_size;
  338. }
  339. return s;
  340. }
  341. int pix_abs16x16_x2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  342. {
  343. int s, i;
  344. s = 0;
  345. for(i=0;i<h;i++) {
  346. s += abs(pix1[0] - avg2(pix2[0], pix2[1]));
  347. s += abs(pix1[1] - avg2(pix2[1], pix2[2]));
  348. s += abs(pix1[2] - avg2(pix2[2], pix2[3]));
  349. s += abs(pix1[3] - avg2(pix2[3], pix2[4]));
  350. s += abs(pix1[4] - avg2(pix2[4], pix2[5]));
  351. s += abs(pix1[5] - avg2(pix2[5], pix2[6]));
  352. s += abs(pix1[6] - avg2(pix2[6], pix2[7]));
  353. s += abs(pix1[7] - avg2(pix2[7], pix2[8]));
  354. s += abs(pix1[8] - avg2(pix2[8], pix2[9]));
  355. s += abs(pix1[9] - avg2(pix2[9], pix2[10]));
  356. s += abs(pix1[10] - avg2(pix2[10], pix2[11]));
  357. s += abs(pix1[11] - avg2(pix2[11], pix2[12]));
  358. s += abs(pix1[12] - avg2(pix2[12], pix2[13]));
  359. s += abs(pix1[13] - avg2(pix2[13], pix2[14]));
  360. s += abs(pix1[14] - avg2(pix2[14], pix2[15]));
  361. s += abs(pix1[15] - avg2(pix2[15], pix2[16]));
  362. pix1 += line_size;
  363. pix2 += line_size;
  364. }
  365. return s;
  366. }
  367. int pix_abs16x16_y2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  368. {
  369. int s, i;
  370. UINT8 *pix3 = pix2 + line_size;
  371. s = 0;
  372. for(i=0;i<h;i++) {
  373. s += abs(pix1[0] - avg2(pix2[0], pix3[0]));
  374. s += abs(pix1[1] - avg2(pix2[1], pix3[1]));
  375. s += abs(pix1[2] - avg2(pix2[2], pix3[2]));
  376. s += abs(pix1[3] - avg2(pix2[3], pix3[3]));
  377. s += abs(pix1[4] - avg2(pix2[4], pix3[4]));
  378. s += abs(pix1[5] - avg2(pix2[5], pix3[5]));
  379. s += abs(pix1[6] - avg2(pix2[6], pix3[6]));
  380. s += abs(pix1[7] - avg2(pix2[7], pix3[7]));
  381. s += abs(pix1[8] - avg2(pix2[8], pix3[8]));
  382. s += abs(pix1[9] - avg2(pix2[9], pix3[9]));
  383. s += abs(pix1[10] - avg2(pix2[10], pix3[10]));
  384. s += abs(pix1[11] - avg2(pix2[11], pix3[11]));
  385. s += abs(pix1[12] - avg2(pix2[12], pix3[12]));
  386. s += abs(pix1[13] - avg2(pix2[13], pix3[13]));
  387. s += abs(pix1[14] - avg2(pix2[14], pix3[14]));
  388. s += abs(pix1[15] - avg2(pix2[15], pix3[15]));
  389. pix1 += line_size;
  390. pix2 += line_size;
  391. pix3 += line_size;
  392. }
  393. return s;
  394. }
  395. int pix_abs16x16_xy2_c(UINT8 *pix1, UINT8 *pix2, int line_size, int h)
  396. {
  397. int s, i;
  398. UINT8 *pix3 = pix2 + line_size;
  399. s = 0;
  400. for(i=0;i<h;i++) {
  401. s += abs(pix1[0] - avg4(pix2[0], pix2[1], pix3[0], pix3[1]));
  402. s += abs(pix1[1] - avg4(pix2[1], pix2[2], pix3[1], pix3[2]));
  403. s += abs(pix1[2] - avg4(pix2[2], pix2[3], pix3[2], pix3[3]));
  404. s += abs(pix1[3] - avg4(pix2[3], pix2[4], pix3[3], pix3[4]));
  405. s += abs(pix1[4] - avg4(pix2[4], pix2[5], pix3[4], pix3[5]));
  406. s += abs(pix1[5] - avg4(pix2[5], pix2[6], pix3[5], pix3[6]));
  407. s += abs(pix1[6] - avg4(pix2[6], pix2[7], pix3[6], pix3[7]));
  408. s += abs(pix1[7] - avg4(pix2[7], pix2[8], pix3[7], pix3[8]));
  409. s += abs(pix1[8] - avg4(pix2[8], pix2[9], pix3[8], pix3[9]));
  410. s += abs(pix1[9] - avg4(pix2[9], pix2[10], pix3[9], pix3[10]));
  411. s += abs(pix1[10] - avg4(pix2[10], pix2[11], pix3[10], pix3[11]));
  412. s += abs(pix1[11] - avg4(pix2[11], pix2[12], pix3[11], pix3[12]));
  413. s += abs(pix1[12] - avg4(pix2[12], pix2[13], pix3[12], pix3[13]));
  414. s += abs(pix1[13] - avg4(pix2[13], pix2[14], pix3[13], pix3[14]));
  415. s += abs(pix1[14] - avg4(pix2[14], pix2[15], pix3[14], pix3[15]));
  416. s += abs(pix1[15] - avg4(pix2[15], pix2[16], pix3[15], pix3[16]));
  417. pix1 += line_size;
  418. pix2 += line_size;
  419. pix3 += line_size;
  420. }
  421. return s;
  422. }
  423. /* permute block according so that it corresponds to the MMX idct
  424. order */
  425. #ifdef SIMPLE_IDCT
  426. /* general permutation, but perhaps slightly slower */
  427. void block_permute(INT16 *block)
  428. {
  429. int i;
  430. INT16 temp[64];
  431. for(i=0; i<64; i++) temp[ block_permute_op(i) ] = block[i];
  432. for(i=0; i<64; i++) block[i] = temp[i];
  433. }
  434. #else
  435. void block_permute(INT16 *block)
  436. {
  437. int tmp1, tmp2, tmp3, tmp4, tmp5, tmp6;
  438. int i;
  439. for(i=0;i<8;i++) {
  440. tmp1 = block[1];
  441. tmp2 = block[2];
  442. tmp3 = block[3];
  443. tmp4 = block[4];
  444. tmp5 = block[5];
  445. tmp6 = block[6];
  446. block[1] = tmp2;
  447. block[2] = tmp4;
  448. block[3] = tmp6;
  449. block[4] = tmp1;
  450. block[5] = tmp3;
  451. block[6] = tmp5;
  452. block += 8;
  453. }
  454. }
  455. #endif
  456. void dsputil_init(void)
  457. {
  458. int i, j;
  459. int use_permuted_idct;
  460. for(i=0;i<256;i++) cropTbl[i + MAX_NEG_CROP] = i;
  461. for(i=0;i<MAX_NEG_CROP;i++) {
  462. cropTbl[i] = 0;
  463. cropTbl[i + MAX_NEG_CROP + 256] = 255;
  464. }
  465. for(i=0;i<512;i++) {
  466. squareTbl[i] = (i - 256) * (i - 256);
  467. }
  468. #ifdef SIMPLE_IDCT
  469. ff_idct = simple_idct;
  470. #else
  471. ff_idct = j_rev_dct;
  472. #endif
  473. get_pixels = get_pixels_c;
  474. put_pixels_clamped = put_pixels_clamped_c;
  475. add_pixels_clamped = add_pixels_clamped_c;
  476. pix_abs16x16 = pix_abs16x16_c;
  477. pix_abs16x16_x2 = pix_abs16x16_x2_c;
  478. pix_abs16x16_y2 = pix_abs16x16_y2_c;
  479. pix_abs16x16_xy2 = pix_abs16x16_xy2_c;
  480. av_fdct = jpeg_fdct_ifast;
  481. use_permuted_idct = 1;
  482. #ifdef HAVE_MMX
  483. dsputil_init_mmx();
  484. #endif
  485. #ifdef ARCH_ARMV4L
  486. dsputil_init_armv4l();
  487. #endif
  488. #ifdef HAVE_MLIB
  489. dsputil_init_mlib();
  490. use_permuted_idct = 0;
  491. #endif
  492. #ifdef ARCH_ALPHA
  493. dsputil_init_alpha();
  494. use_permuted_idct = 0;
  495. #endif
  496. #ifdef SIMPLE_IDCT
  497. if(ff_idct == simple_idct) use_permuted_idct=0;
  498. #endif
  499. if(use_permuted_idct)
  500. #ifdef SIMPLE_IDCT
  501. for(i=0; i<64; i++) permutation[i]= simple_mmx_permutation[i];
  502. #else
  503. for(i=0; i<64; i++) permutation[i]= (i & 0x38) | ((i & 6) >> 1) | ((i & 1) << 2);
  504. #endif
  505. else
  506. for(i=0; i<64; i++) permutation[i]=i;
  507. for(i=0; i<64; i++) inv_zigzag_direct16[zigzag_direct[i]]= i+1;
  508. for(i=0; i<64; i++) zigzag_direct_noperm[i]= zigzag_direct[i];
  509. if (use_permuted_idct) {
  510. /* permute for IDCT */
  511. for(i=0;i<64;i++) {
  512. j = zigzag_direct[i];
  513. zigzag_direct[i] = block_permute_op(j);
  514. j = ff_alternate_horizontal_scan[i];
  515. ff_alternate_horizontal_scan[i] = block_permute_op(j);
  516. j = ff_alternate_vertical_scan[i];
  517. ff_alternate_vertical_scan[i] = block_permute_op(j);
  518. }
  519. block_permute(default_intra_matrix);
  520. block_permute(default_non_intra_matrix);
  521. }
  522. build_zigzag_end();
  523. }