postprocess.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095
  1. /*
  2. * Copyright (C) 2001-2003 Michael Niedermayer (michaelni@gmx.at)
  3. *
  4. * AltiVec optimizations (C) 2004 Romain Dolbeau <romain@dolbeau.org>
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg 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. * FFmpeg 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 FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. /**
  23. * @file libpostproc/postprocess.c
  24. * postprocessing.
  25. */
  26. /*
  27. C MMX MMX2 3DNow AltiVec
  28. isVertDC Ec Ec Ec
  29. isVertMinMaxOk Ec Ec Ec
  30. doVertLowPass E e e Ec
  31. doVertDefFilter Ec Ec e e Ec
  32. isHorizDC Ec Ec Ec
  33. isHorizMinMaxOk a E Ec
  34. doHorizLowPass E e e Ec
  35. doHorizDefFilter Ec Ec e e Ec
  36. do_a_deblock Ec E Ec E
  37. deRing E e e* Ecp
  38. Vertical RKAlgo1 E a a
  39. Horizontal RKAlgo1 a a
  40. Vertical X1# a E E
  41. Horizontal X1# a E E
  42. LinIpolDeinterlace e E E*
  43. CubicIpolDeinterlace a e e*
  44. LinBlendDeinterlace e E E*
  45. MedianDeinterlace# E Ec Ec
  46. TempDeNoiser# E e e Ec
  47. * I do not have a 3DNow! CPU -> it is untested, but no one said it does not work so it seems to work
  48. # more or less selfinvented filters so the exactness is not too meaningful
  49. E = Exact implementation
  50. e = almost exact implementation (slightly different rounding,...)
  51. a = alternative / approximate impl
  52. c = checked against the other implementations (-vo md5)
  53. p = partially optimized, still some work to do
  54. */
  55. /*
  56. TODO:
  57. reduce the time wasted on the mem transfer
  58. unroll stuff if instructions depend too much on the prior one
  59. move YScale thing to the end instead of fixing QP
  60. write a faster and higher quality deblocking filter :)
  61. make the mainloop more flexible (variable number of blocks at once
  62. (the if/else stuff per block is slowing things down)
  63. compare the quality & speed of all filters
  64. split this huge file
  65. optimize c versions
  66. try to unroll inner for(x=0 ... loop to avoid these damn if(x ... checks
  67. ...
  68. */
  69. //Changelog: use the Subversion log
  70. #include "config.h"
  71. #include "libavutil/avutil.h"
  72. #include <inttypes.h>
  73. #include <stdio.h>
  74. #include <stdlib.h>
  75. #include <string.h>
  76. //#undef HAVE_MMX2
  77. //#define HAVE_AMD3DNOW
  78. //#undef HAVE_MMX
  79. //#undef ARCH_X86
  80. //#define DEBUG_BRIGHTNESS
  81. #include "postprocess.h"
  82. #include "postprocess_internal.h"
  83. unsigned postproc_version(void)
  84. {
  85. return LIBPOSTPROC_VERSION_INT;
  86. }
  87. #if HAVE_ALTIVEC_H
  88. #include <altivec.h>
  89. #endif
  90. #define GET_MODE_BUFFER_SIZE 500
  91. #define OPTIONS_ARRAY_SIZE 10
  92. #define BLOCK_SIZE 8
  93. #define TEMP_STRIDE 8
  94. //#define NUM_BLOCKS_AT_ONCE 16 //not used yet
  95. #if ARCH_X86
  96. DECLARE_ASM_CONST(8, uint64_t, w05)= 0x0005000500050005LL;
  97. DECLARE_ASM_CONST(8, uint64_t, w04)= 0x0004000400040004LL;
  98. DECLARE_ASM_CONST(8, uint64_t, w20)= 0x0020002000200020LL;
  99. DECLARE_ASM_CONST(8, uint64_t, b00)= 0x0000000000000000LL;
  100. DECLARE_ASM_CONST(8, uint64_t, b01)= 0x0101010101010101LL;
  101. DECLARE_ASM_CONST(8, uint64_t, b02)= 0x0202020202020202LL;
  102. DECLARE_ASM_CONST(8, uint64_t, b08)= 0x0808080808080808LL;
  103. DECLARE_ASM_CONST(8, uint64_t, b80)= 0x8080808080808080LL;
  104. #endif
  105. DECLARE_ASM_CONST(8, int, deringThreshold)= 20;
  106. static struct PPFilter filters[]=
  107. {
  108. {"hb", "hdeblock", 1, 1, 3, H_DEBLOCK},
  109. {"vb", "vdeblock", 1, 2, 4, V_DEBLOCK},
  110. /* {"hr", "rkhdeblock", 1, 1, 3, H_RK1_FILTER},
  111. {"vr", "rkvdeblock", 1, 2, 4, V_RK1_FILTER},*/
  112. {"h1", "x1hdeblock", 1, 1, 3, H_X1_FILTER},
  113. {"v1", "x1vdeblock", 1, 2, 4, V_X1_FILTER},
  114. {"ha", "ahdeblock", 1, 1, 3, H_A_DEBLOCK},
  115. {"va", "avdeblock", 1, 2, 4, V_A_DEBLOCK},
  116. {"dr", "dering", 1, 5, 6, DERING},
  117. {"al", "autolevels", 0, 1, 2, LEVEL_FIX},
  118. {"lb", "linblenddeint", 1, 1, 4, LINEAR_BLEND_DEINT_FILTER},
  119. {"li", "linipoldeint", 1, 1, 4, LINEAR_IPOL_DEINT_FILTER},
  120. {"ci", "cubicipoldeint", 1, 1, 4, CUBIC_IPOL_DEINT_FILTER},
  121. {"md", "mediandeint", 1, 1, 4, MEDIAN_DEINT_FILTER},
  122. {"fd", "ffmpegdeint", 1, 1, 4, FFMPEG_DEINT_FILTER},
  123. {"l5", "lowpass5", 1, 1, 4, LOWPASS5_DEINT_FILTER},
  124. {"tn", "tmpnoise", 1, 7, 8, TEMP_NOISE_FILTER},
  125. {"fq", "forcequant", 1, 0, 0, FORCE_QUANT},
  126. {NULL, NULL,0,0,0,0} //End Marker
  127. };
  128. static const char *replaceTable[]=
  129. {
  130. "default", "hb:a,vb:a,dr:a",
  131. "de", "hb:a,vb:a,dr:a",
  132. "fast", "h1:a,v1:a,dr:a",
  133. "fa", "h1:a,v1:a,dr:a",
  134. "ac", "ha:a:128:7,va:a,dr:a",
  135. NULL //End Marker
  136. };
  137. #if ARCH_X86
  138. static inline void prefetchnta(void *p)
  139. {
  140. __asm__ volatile( "prefetchnta (%0)\n\t"
  141. : : "r" (p)
  142. );
  143. }
  144. static inline void prefetcht0(void *p)
  145. {
  146. __asm__ volatile( "prefetcht0 (%0)\n\t"
  147. : : "r" (p)
  148. );
  149. }
  150. static inline void prefetcht1(void *p)
  151. {
  152. __asm__ volatile( "prefetcht1 (%0)\n\t"
  153. : : "r" (p)
  154. );
  155. }
  156. static inline void prefetcht2(void *p)
  157. {
  158. __asm__ volatile( "prefetcht2 (%0)\n\t"
  159. : : "r" (p)
  160. );
  161. }
  162. #endif
  163. /* The horizontal functions exist only in C because the MMX
  164. * code is faster with vertical filters and transposing. */
  165. /**
  166. * Check if the given 8x8 Block is mostly "flat"
  167. */
  168. static inline int isHorizDC_C(uint8_t src[], int stride, PPContext *c)
  169. {
  170. int numEq= 0;
  171. int y;
  172. const int dcOffset= ((c->nonBQP*c->ppMode.baseDcDiff)>>8) + 1;
  173. const int dcThreshold= dcOffset*2 + 1;
  174. for(y=0; y<BLOCK_SIZE; y++){
  175. if(((unsigned)(src[0] - src[1] + dcOffset)) < dcThreshold) numEq++;
  176. if(((unsigned)(src[1] - src[2] + dcOffset)) < dcThreshold) numEq++;
  177. if(((unsigned)(src[2] - src[3] + dcOffset)) < dcThreshold) numEq++;
  178. if(((unsigned)(src[3] - src[4] + dcOffset)) < dcThreshold) numEq++;
  179. if(((unsigned)(src[4] - src[5] + dcOffset)) < dcThreshold) numEq++;
  180. if(((unsigned)(src[5] - src[6] + dcOffset)) < dcThreshold) numEq++;
  181. if(((unsigned)(src[6] - src[7] + dcOffset)) < dcThreshold) numEq++;
  182. src+= stride;
  183. }
  184. return numEq > c->ppMode.flatnessThreshold;
  185. }
  186. /**
  187. * Check if the middle 8x8 Block in the given 8x16 block is flat
  188. */
  189. static inline int isVertDC_C(uint8_t src[], int stride, PPContext *c)
  190. {
  191. int numEq= 0;
  192. int y;
  193. const int dcOffset= ((c->nonBQP*c->ppMode.baseDcDiff)>>8) + 1;
  194. const int dcThreshold= dcOffset*2 + 1;
  195. src+= stride*4; // src points to begin of the 8x8 Block
  196. for(y=0; y<BLOCK_SIZE-1; y++){
  197. if(((unsigned)(src[0] - src[0+stride] + dcOffset)) < dcThreshold) numEq++;
  198. if(((unsigned)(src[1] - src[1+stride] + dcOffset)) < dcThreshold) numEq++;
  199. if(((unsigned)(src[2] - src[2+stride] + dcOffset)) < dcThreshold) numEq++;
  200. if(((unsigned)(src[3] - src[3+stride] + dcOffset)) < dcThreshold) numEq++;
  201. if(((unsigned)(src[4] - src[4+stride] + dcOffset)) < dcThreshold) numEq++;
  202. if(((unsigned)(src[5] - src[5+stride] + dcOffset)) < dcThreshold) numEq++;
  203. if(((unsigned)(src[6] - src[6+stride] + dcOffset)) < dcThreshold) numEq++;
  204. if(((unsigned)(src[7] - src[7+stride] + dcOffset)) < dcThreshold) numEq++;
  205. src+= stride;
  206. }
  207. return numEq > c->ppMode.flatnessThreshold;
  208. }
  209. static inline int isHorizMinMaxOk_C(uint8_t src[], int stride, int QP)
  210. {
  211. int i;
  212. #if 1
  213. for(i=0; i<2; i++){
  214. if((unsigned)(src[0] - src[5] + 2*QP) > 4*QP) return 0;
  215. src += stride;
  216. if((unsigned)(src[2] - src[7] + 2*QP) > 4*QP) return 0;
  217. src += stride;
  218. if((unsigned)(src[4] - src[1] + 2*QP) > 4*QP) return 0;
  219. src += stride;
  220. if((unsigned)(src[6] - src[3] + 2*QP) > 4*QP) return 0;
  221. src += stride;
  222. }
  223. #else
  224. for(i=0; i<8; i++){
  225. if((unsigned)(src[0] - src[7] + 2*QP) > 4*QP) return 0;
  226. src += stride;
  227. }
  228. #endif
  229. return 1;
  230. }
  231. static inline int isVertMinMaxOk_C(uint8_t src[], int stride, int QP)
  232. {
  233. #if 1
  234. #if 1
  235. int x;
  236. src+= stride*4;
  237. for(x=0; x<BLOCK_SIZE; x+=4){
  238. if((unsigned)(src[ x + 0*stride] - src[ x + 5*stride] + 2*QP) > 4*QP) return 0;
  239. if((unsigned)(src[1+x + 2*stride] - src[1+x + 7*stride] + 2*QP) > 4*QP) return 0;
  240. if((unsigned)(src[2+x + 4*stride] - src[2+x + 1*stride] + 2*QP) > 4*QP) return 0;
  241. if((unsigned)(src[3+x + 6*stride] - src[3+x + 3*stride] + 2*QP) > 4*QP) return 0;
  242. }
  243. #else
  244. int x;
  245. src+= stride*3;
  246. for(x=0; x<BLOCK_SIZE; x++){
  247. if((unsigned)(src[x + stride] - src[x + (stride<<3)] + 2*QP) > 4*QP) return 0;
  248. }
  249. #endif
  250. return 1;
  251. #else
  252. int x;
  253. src+= stride*4;
  254. for(x=0; x<BLOCK_SIZE; x++){
  255. int min=255;
  256. int max=0;
  257. int y;
  258. for(y=0; y<8; y++){
  259. int v= src[x + y*stride];
  260. if(v>max) max=v;
  261. if(v<min) min=v;
  262. }
  263. if(max-min > 2*QP) return 0;
  264. }
  265. return 1;
  266. #endif
  267. }
  268. static inline int horizClassify_C(uint8_t src[], int stride, PPContext *c)
  269. {
  270. if( isHorizDC_C(src, stride, c) ){
  271. if( isHorizMinMaxOk_C(src, stride, c->QP) )
  272. return 1;
  273. else
  274. return 0;
  275. }else{
  276. return 2;
  277. }
  278. }
  279. static inline int vertClassify_C(uint8_t src[], int stride, PPContext *c)
  280. {
  281. if( isVertDC_C(src, stride, c) ){
  282. if( isVertMinMaxOk_C(src, stride, c->QP) )
  283. return 1;
  284. else
  285. return 0;
  286. }else{
  287. return 2;
  288. }
  289. }
  290. static inline void doHorizDefFilter_C(uint8_t dst[], int stride, PPContext *c)
  291. {
  292. int y;
  293. for(y=0; y<BLOCK_SIZE; y++){
  294. const int middleEnergy= 5*(dst[4] - dst[3]) + 2*(dst[2] - dst[5]);
  295. if(FFABS(middleEnergy) < 8*c->QP){
  296. const int q=(dst[3] - dst[4])/2;
  297. const int leftEnergy= 5*(dst[2] - dst[1]) + 2*(dst[0] - dst[3]);
  298. const int rightEnergy= 5*(dst[6] - dst[5]) + 2*(dst[4] - dst[7]);
  299. int d= FFABS(middleEnergy) - FFMIN( FFABS(leftEnergy), FFABS(rightEnergy) );
  300. d= FFMAX(d, 0);
  301. d= (5*d + 32) >> 6;
  302. d*= FFSIGN(-middleEnergy);
  303. if(q>0)
  304. {
  305. d= d<0 ? 0 : d;
  306. d= d>q ? q : d;
  307. }
  308. else
  309. {
  310. d= d>0 ? 0 : d;
  311. d= d<q ? q : d;
  312. }
  313. dst[3]-= d;
  314. dst[4]+= d;
  315. }
  316. dst+= stride;
  317. }
  318. }
  319. /**
  320. * Do a horizontal low pass filter on the 10x8 block (dst points to middle 8x8 Block)
  321. * using the 9-Tap Filter (1,1,2,2,4,2,2,1,1)/16 (C version)
  322. */
  323. static inline void doHorizLowPass_C(uint8_t dst[], int stride, PPContext *c)
  324. {
  325. int y;
  326. for(y=0; y<BLOCK_SIZE; y++){
  327. const int first= FFABS(dst[-1] - dst[0]) < c->QP ? dst[-1] : dst[0];
  328. const int last= FFABS(dst[8] - dst[7]) < c->QP ? dst[8] : dst[7];
  329. int sums[10];
  330. sums[0] = 4*first + dst[0] + dst[1] + dst[2] + 4;
  331. sums[1] = sums[0] - first + dst[3];
  332. sums[2] = sums[1] - first + dst[4];
  333. sums[3] = sums[2] - first + dst[5];
  334. sums[4] = sums[3] - first + dst[6];
  335. sums[5] = sums[4] - dst[0] + dst[7];
  336. sums[6] = sums[5] - dst[1] + last;
  337. sums[7] = sums[6] - dst[2] + last;
  338. sums[8] = sums[7] - dst[3] + last;
  339. sums[9] = sums[8] - dst[4] + last;
  340. dst[0]= (sums[0] + sums[2] + 2*dst[0])>>4;
  341. dst[1]= (sums[1] + sums[3] + 2*dst[1])>>4;
  342. dst[2]= (sums[2] + sums[4] + 2*dst[2])>>4;
  343. dst[3]= (sums[3] + sums[5] + 2*dst[3])>>4;
  344. dst[4]= (sums[4] + sums[6] + 2*dst[4])>>4;
  345. dst[5]= (sums[5] + sums[7] + 2*dst[5])>>4;
  346. dst[6]= (sums[6] + sums[8] + 2*dst[6])>>4;
  347. dst[7]= (sums[7] + sums[9] + 2*dst[7])>>4;
  348. dst+= stride;
  349. }
  350. }
  351. /**
  352. * Experimental Filter 1 (Horizontal)
  353. * will not damage linear gradients
  354. * Flat blocks should look like they were passed through the (1,1,2,2,4,2,2,1,1) 9-Tap filter
  355. * can only smooth blocks at the expected locations (it cannot smooth them if they did move)
  356. * MMX2 version does correct clipping C version does not
  357. * not identical with the vertical one
  358. */
  359. static inline void horizX1Filter(uint8_t *src, int stride, int QP)
  360. {
  361. int y;
  362. static uint64_t *lut= NULL;
  363. if(lut==NULL)
  364. {
  365. int i;
  366. lut = av_malloc(256*8);
  367. for(i=0; i<256; i++)
  368. {
  369. int v= i < 128 ? 2*i : 2*(i-256);
  370. /*
  371. //Simulate 112242211 9-Tap filter
  372. uint64_t a= (v/16) & 0xFF;
  373. uint64_t b= (v/8) & 0xFF;
  374. uint64_t c= (v/4) & 0xFF;
  375. uint64_t d= (3*v/8) & 0xFF;
  376. */
  377. //Simulate piecewise linear interpolation
  378. uint64_t a= (v/16) & 0xFF;
  379. uint64_t b= (v*3/16) & 0xFF;
  380. uint64_t c= (v*5/16) & 0xFF;
  381. uint64_t d= (7*v/16) & 0xFF;
  382. uint64_t A= (0x100 - a)&0xFF;
  383. uint64_t B= (0x100 - b)&0xFF;
  384. uint64_t C= (0x100 - c)&0xFF;
  385. uint64_t D= (0x100 - c)&0xFF;
  386. lut[i] = (a<<56) | (b<<48) | (c<<40) | (d<<32) |
  387. (D<<24) | (C<<16) | (B<<8) | (A);
  388. //lut[i] = (v<<32) | (v<<24);
  389. }
  390. }
  391. for(y=0; y<BLOCK_SIZE; y++){
  392. int a= src[1] - src[2];
  393. int b= src[3] - src[4];
  394. int c= src[5] - src[6];
  395. int d= FFMAX(FFABS(b) - (FFABS(a) + FFABS(c))/2, 0);
  396. if(d < QP){
  397. int v = d * FFSIGN(-b);
  398. src[1] +=v/8;
  399. src[2] +=v/4;
  400. src[3] +=3*v/8;
  401. src[4] -=3*v/8;
  402. src[5] -=v/4;
  403. src[6] -=v/8;
  404. }
  405. src+=stride;
  406. }
  407. }
  408. /**
  409. * accurate deblock filter
  410. */
  411. static av_always_inline void do_a_deblock_C(uint8_t *src, int step, int stride, PPContext *c){
  412. int y;
  413. const int QP= c->QP;
  414. const int dcOffset= ((c->nonBQP*c->ppMode.baseDcDiff)>>8) + 1;
  415. const int dcThreshold= dcOffset*2 + 1;
  416. //START_TIMER
  417. src+= step*4; // src points to begin of the 8x8 Block
  418. for(y=0; y<8; y++){
  419. int numEq= 0;
  420. if(((unsigned)(src[-1*step] - src[0*step] + dcOffset)) < dcThreshold) numEq++;
  421. if(((unsigned)(src[ 0*step] - src[1*step] + dcOffset)) < dcThreshold) numEq++;
  422. if(((unsigned)(src[ 1*step] - src[2*step] + dcOffset)) < dcThreshold) numEq++;
  423. if(((unsigned)(src[ 2*step] - src[3*step] + dcOffset)) < dcThreshold) numEq++;
  424. if(((unsigned)(src[ 3*step] - src[4*step] + dcOffset)) < dcThreshold) numEq++;
  425. if(((unsigned)(src[ 4*step] - src[5*step] + dcOffset)) < dcThreshold) numEq++;
  426. if(((unsigned)(src[ 5*step] - src[6*step] + dcOffset)) < dcThreshold) numEq++;
  427. if(((unsigned)(src[ 6*step] - src[7*step] + dcOffset)) < dcThreshold) numEq++;
  428. if(((unsigned)(src[ 7*step] - src[8*step] + dcOffset)) < dcThreshold) numEq++;
  429. if(numEq > c->ppMode.flatnessThreshold){
  430. int min, max, x;
  431. if(src[0] > src[step]){
  432. max= src[0];
  433. min= src[step];
  434. }else{
  435. max= src[step];
  436. min= src[0];
  437. }
  438. for(x=2; x<8; x+=2){
  439. if(src[x*step] > src[(x+1)*step]){
  440. if(src[x *step] > max) max= src[ x *step];
  441. if(src[(x+1)*step] < min) min= src[(x+1)*step];
  442. }else{
  443. if(src[(x+1)*step] > max) max= src[(x+1)*step];
  444. if(src[ x *step] < min) min= src[ x *step];
  445. }
  446. }
  447. if(max-min < 2*QP){
  448. const int first= FFABS(src[-1*step] - src[0]) < QP ? src[-1*step] : src[0];
  449. const int last= FFABS(src[8*step] - src[7*step]) < QP ? src[8*step] : src[7*step];
  450. int sums[10];
  451. sums[0] = 4*first + src[0*step] + src[1*step] + src[2*step] + 4;
  452. sums[1] = sums[0] - first + src[3*step];
  453. sums[2] = sums[1] - first + src[4*step];
  454. sums[3] = sums[2] - first + src[5*step];
  455. sums[4] = sums[3] - first + src[6*step];
  456. sums[5] = sums[4] - src[0*step] + src[7*step];
  457. sums[6] = sums[5] - src[1*step] + last;
  458. sums[7] = sums[6] - src[2*step] + last;
  459. sums[8] = sums[7] - src[3*step] + last;
  460. sums[9] = sums[8] - src[4*step] + last;
  461. src[0*step]= (sums[0] + sums[2] + 2*src[0*step])>>4;
  462. src[1*step]= (sums[1] + sums[3] + 2*src[1*step])>>4;
  463. src[2*step]= (sums[2] + sums[4] + 2*src[2*step])>>4;
  464. src[3*step]= (sums[3] + sums[5] + 2*src[3*step])>>4;
  465. src[4*step]= (sums[4] + sums[6] + 2*src[4*step])>>4;
  466. src[5*step]= (sums[5] + sums[7] + 2*src[5*step])>>4;
  467. src[6*step]= (sums[6] + sums[8] + 2*src[6*step])>>4;
  468. src[7*step]= (sums[7] + sums[9] + 2*src[7*step])>>4;
  469. }
  470. }else{
  471. const int middleEnergy= 5*(src[4*step] - src[3*step]) + 2*(src[2*step] - src[5*step]);
  472. if(FFABS(middleEnergy) < 8*QP){
  473. const int q=(src[3*step] - src[4*step])/2;
  474. const int leftEnergy= 5*(src[2*step] - src[1*step]) + 2*(src[0*step] - src[3*step]);
  475. const int rightEnergy= 5*(src[6*step] - src[5*step]) + 2*(src[4*step] - src[7*step]);
  476. int d= FFABS(middleEnergy) - FFMIN( FFABS(leftEnergy), FFABS(rightEnergy) );
  477. d= FFMAX(d, 0);
  478. d= (5*d + 32) >> 6;
  479. d*= FFSIGN(-middleEnergy);
  480. if(q>0){
  481. d= d<0 ? 0 : d;
  482. d= d>q ? q : d;
  483. }else{
  484. d= d>0 ? 0 : d;
  485. d= d<q ? q : d;
  486. }
  487. src[3*step]-= d;
  488. src[4*step]+= d;
  489. }
  490. }
  491. src += stride;
  492. }
  493. /*if(step==16){
  494. STOP_TIMER("step16")
  495. }else{
  496. STOP_TIMER("stepX")
  497. }*/
  498. }
  499. //Note: we have C, MMX, MMX2, 3DNOW version there is no 3DNOW+MMX2 one
  500. //Plain C versions
  501. #if !(HAVE_MMX || HAVE_ALTIVEC) || CONFIG_RUNTIME_CPUDETECT
  502. #define COMPILE_C
  503. #endif
  504. #if HAVE_ALTIVEC
  505. #define COMPILE_ALTIVEC
  506. #endif //HAVE_ALTIVEC
  507. #if ARCH_X86
  508. #if (HAVE_MMX && !HAVE_AMD3DNOW && !HAVE_MMX2) || CONFIG_RUNTIME_CPUDETECT
  509. #define COMPILE_MMX
  510. #endif
  511. #if HAVE_MMX2 || CONFIG_RUNTIME_CPUDETECT
  512. #define COMPILE_MMX2
  513. #endif
  514. #if (HAVE_AMD3DNOW && !HAVE_MMX2) || CONFIG_RUNTIME_CPUDETECT
  515. #define COMPILE_3DNOW
  516. #endif
  517. #endif /* ARCH_X86 */
  518. #undef HAVE_MMX
  519. #define HAVE_MMX 0
  520. #undef HAVE_MMX2
  521. #define HAVE_MMX2 0
  522. #undef HAVE_AMD3DNOW
  523. #define HAVE_AMD3DNOW 0
  524. #undef HAVE_ALTIVEC
  525. #define HAVE_ALTIVEC 0
  526. #ifdef COMPILE_C
  527. #define RENAME(a) a ## _C
  528. #include "postprocess_template.c"
  529. #endif
  530. #ifdef COMPILE_ALTIVEC
  531. #undef RENAME
  532. #undef HAVE_ALTIVEC
  533. #define HAVE_ALTIVEC 1
  534. #define RENAME(a) a ## _altivec
  535. #include "postprocess_altivec_template.c"
  536. #include "postprocess_template.c"
  537. #endif
  538. //MMX versions
  539. #ifdef COMPILE_MMX
  540. #undef RENAME
  541. #undef HAVE_MMX
  542. #define HAVE_MMX 1
  543. #define RENAME(a) a ## _MMX
  544. #include "postprocess_template.c"
  545. #endif
  546. //MMX2 versions
  547. #ifdef COMPILE_MMX2
  548. #undef RENAME
  549. #undef HAVE_MMX
  550. #undef HAVE_MMX2
  551. #define HAVE_MMX 1
  552. #define HAVE_MMX2 1
  553. #define RENAME(a) a ## _MMX2
  554. #include "postprocess_template.c"
  555. #endif
  556. //3DNOW versions
  557. #ifdef COMPILE_3DNOW
  558. #undef RENAME
  559. #undef HAVE_MMX
  560. #undef HAVE_MMX2
  561. #undef HAVE_AMD3DNOW
  562. #define HAVE_MMX 1
  563. #define HAVE_MMX2 0
  564. #define HAVE_AMD3DNOW 1
  565. #define RENAME(a) a ## _3DNow
  566. #include "postprocess_template.c"
  567. #endif
  568. // minor note: the HAVE_xyz is messed up after that line so do not use it.
  569. static inline void postProcess(const uint8_t src[], int srcStride, uint8_t dst[], int dstStride, int width, int height,
  570. const QP_STORE_T QPs[], int QPStride, int isColor, pp_mode *vm, pp_context *vc)
  571. {
  572. PPContext *c= (PPContext *)vc;
  573. PPMode *ppMode= (PPMode *)vm;
  574. c->ppMode= *ppMode; //FIXME
  575. // Using ifs here as they are faster than function pointers although the
  576. // difference would not be measurable here but it is much better because
  577. // someone might exchange the CPU whithout restarting MPlayer ;)
  578. #if CONFIG_RUNTIME_CPUDETECT
  579. #if ARCH_X86
  580. // ordered per speed fastest first
  581. if(c->cpuCaps & PP_CPU_CAPS_MMX2)
  582. postProcess_MMX2(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  583. else if(c->cpuCaps & PP_CPU_CAPS_3DNOW)
  584. postProcess_3DNow(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  585. else if(c->cpuCaps & PP_CPU_CAPS_MMX)
  586. postProcess_MMX(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  587. else
  588. postProcess_C(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  589. #else
  590. #if HAVE_ALTIVEC
  591. if(c->cpuCaps & PP_CPU_CAPS_ALTIVEC)
  592. postProcess_altivec(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  593. else
  594. #endif
  595. postProcess_C(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  596. #endif
  597. #else //CONFIG_RUNTIME_CPUDETECT
  598. #if HAVE_MMX2
  599. postProcess_MMX2(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  600. #elif HAVE_AMD3DNOW
  601. postProcess_3DNow(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  602. #elif HAVE_MMX
  603. postProcess_MMX(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  604. #elif HAVE_ALTIVEC
  605. postProcess_altivec(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  606. #else
  607. postProcess_C(src, srcStride, dst, dstStride, width, height, QPs, QPStride, isColor, c);
  608. #endif
  609. #endif //!CONFIG_RUNTIME_CPUDETECT
  610. }
  611. //static void postProcess(uint8_t src[], int srcStride, uint8_t dst[], int dstStride, int width, int height,
  612. // QP_STORE_T QPs[], int QPStride, int isColor, struct PPMode *ppMode);
  613. /* -pp Command line Help
  614. */
  615. #if LIBPOSTPROC_VERSION_INT < (52<<16)
  616. const char *const pp_help=
  617. #else
  618. const char pp_help[] =
  619. #endif
  620. "Available postprocessing filters:\n"
  621. "Filters Options\n"
  622. "short long name short long option Description\n"
  623. "* * a autoq CPU power dependent enabler\n"
  624. " c chrom chrominance filtering enabled\n"
  625. " y nochrom chrominance filtering disabled\n"
  626. " n noluma luma filtering disabled\n"
  627. "hb hdeblock (2 threshold) horizontal deblocking filter\n"
  628. " 1. difference factor: default=32, higher -> more deblocking\n"
  629. " 2. flatness threshold: default=39, lower -> more deblocking\n"
  630. " the h & v deblocking filters share these\n"
  631. " so you can't set different thresholds for h / v\n"
  632. "vb vdeblock (2 threshold) vertical deblocking filter\n"
  633. "ha hadeblock (2 threshold) horizontal deblocking filter\n"
  634. "va vadeblock (2 threshold) vertical deblocking filter\n"
  635. "h1 x1hdeblock experimental h deblock filter 1\n"
  636. "v1 x1vdeblock experimental v deblock filter 1\n"
  637. "dr dering deringing filter\n"
  638. "al autolevels automatic brightness / contrast\n"
  639. " f fullyrange stretch luminance to (0..255)\n"
  640. "lb linblenddeint linear blend deinterlacer\n"
  641. "li linipoldeint linear interpolating deinterlace\n"
  642. "ci cubicipoldeint cubic interpolating deinterlacer\n"
  643. "md mediandeint median deinterlacer\n"
  644. "fd ffmpegdeint ffmpeg deinterlacer\n"
  645. "l5 lowpass5 FIR lowpass deinterlacer\n"
  646. "de default hb:a,vb:a,dr:a\n"
  647. "fa fast h1:a,v1:a,dr:a\n"
  648. "ac ha:a:128:7,va:a,dr:a\n"
  649. "tn tmpnoise (3 threshold) temporal noise reducer\n"
  650. " 1. <= 2. <= 3. larger -> stronger filtering\n"
  651. "fq forceQuant <quantizer> force quantizer\n"
  652. "Usage:\n"
  653. "<filterName>[:<option>[:<option>...]][[,|/][-]<filterName>[:<option>...]]...\n"
  654. "long form example:\n"
  655. "vdeblock:autoq/hdeblock:autoq/linblenddeint default,-vdeblock\n"
  656. "short form example:\n"
  657. "vb:a/hb:a/lb de,-vb\n"
  658. "more examples:\n"
  659. "tn:64:128:256\n"
  660. "\n"
  661. ;
  662. pp_mode *pp_get_mode_by_name_and_quality(const char *name, int quality)
  663. {
  664. char temp[GET_MODE_BUFFER_SIZE];
  665. char *p= temp;
  666. static const char filterDelimiters[] = ",/";
  667. static const char optionDelimiters[] = ":";
  668. struct PPMode *ppMode;
  669. char *filterToken;
  670. ppMode= av_malloc(sizeof(PPMode));
  671. ppMode->lumMode= 0;
  672. ppMode->chromMode= 0;
  673. ppMode->maxTmpNoise[0]= 700;
  674. ppMode->maxTmpNoise[1]= 1500;
  675. ppMode->maxTmpNoise[2]= 3000;
  676. ppMode->maxAllowedY= 234;
  677. ppMode->minAllowedY= 16;
  678. ppMode->baseDcDiff= 256/8;
  679. ppMode->flatnessThreshold= 56-16-1;
  680. ppMode->maxClippedThreshold= 0.01;
  681. ppMode->error=0;
  682. strncpy(temp, name, GET_MODE_BUFFER_SIZE);
  683. av_log(NULL, AV_LOG_DEBUG, "pp: %s\n", name);
  684. for(;;){
  685. char *filterName;
  686. int q= 1000000; //PP_QUALITY_MAX;
  687. int chrom=-1;
  688. int luma=-1;
  689. char *option;
  690. char *options[OPTIONS_ARRAY_SIZE];
  691. int i;
  692. int filterNameOk=0;
  693. int numOfUnknownOptions=0;
  694. int enable=1; //does the user want us to enabled or disabled the filter
  695. filterToken= strtok(p, filterDelimiters);
  696. if(filterToken == NULL) break;
  697. p+= strlen(filterToken) + 1; // p points to next filterToken
  698. filterName= strtok(filterToken, optionDelimiters);
  699. av_log(NULL, AV_LOG_DEBUG, "pp: %s::%s\n", filterToken, filterName);
  700. if(*filterName == '-'){
  701. enable=0;
  702. filterName++;
  703. }
  704. for(;;){ //for all options
  705. option= strtok(NULL, optionDelimiters);
  706. if(option == NULL) break;
  707. av_log(NULL, AV_LOG_DEBUG, "pp: option: %s\n", option);
  708. if(!strcmp("autoq", option) || !strcmp("a", option)) q= quality;
  709. else if(!strcmp("nochrom", option) || !strcmp("y", option)) chrom=0;
  710. else if(!strcmp("chrom", option) || !strcmp("c", option)) chrom=1;
  711. else if(!strcmp("noluma", option) || !strcmp("n", option)) luma=0;
  712. else{
  713. options[numOfUnknownOptions] = option;
  714. numOfUnknownOptions++;
  715. }
  716. if(numOfUnknownOptions >= OPTIONS_ARRAY_SIZE-1) break;
  717. }
  718. options[numOfUnknownOptions] = NULL;
  719. /* replace stuff from the replace Table */
  720. for(i=0; replaceTable[2*i]!=NULL; i++){
  721. if(!strcmp(replaceTable[2*i], filterName)){
  722. int newlen= strlen(replaceTable[2*i + 1]);
  723. int plen;
  724. int spaceLeft;
  725. if(p==NULL) p= temp, *p=0; //last filter
  726. else p--, *p=','; //not last filter
  727. plen= strlen(p);
  728. spaceLeft= p - temp + plen;
  729. if(spaceLeft + newlen >= GET_MODE_BUFFER_SIZE){
  730. ppMode->error++;
  731. break;
  732. }
  733. memmove(p + newlen, p, plen+1);
  734. memcpy(p, replaceTable[2*i + 1], newlen);
  735. filterNameOk=1;
  736. }
  737. }
  738. for(i=0; filters[i].shortName!=NULL; i++){
  739. if( !strcmp(filters[i].longName, filterName)
  740. || !strcmp(filters[i].shortName, filterName)){
  741. ppMode->lumMode &= ~filters[i].mask;
  742. ppMode->chromMode &= ~filters[i].mask;
  743. filterNameOk=1;
  744. if(!enable) break; // user wants to disable it
  745. if(q >= filters[i].minLumQuality && luma)
  746. ppMode->lumMode|= filters[i].mask;
  747. if(chrom==1 || (chrom==-1 && filters[i].chromDefault))
  748. if(q >= filters[i].minChromQuality)
  749. ppMode->chromMode|= filters[i].mask;
  750. if(filters[i].mask == LEVEL_FIX){
  751. int o;
  752. ppMode->minAllowedY= 16;
  753. ppMode->maxAllowedY= 234;
  754. for(o=0; options[o]!=NULL; o++){
  755. if( !strcmp(options[o],"fullyrange")
  756. ||!strcmp(options[o],"f")){
  757. ppMode->minAllowedY= 0;
  758. ppMode->maxAllowedY= 255;
  759. numOfUnknownOptions--;
  760. }
  761. }
  762. }
  763. else if(filters[i].mask == TEMP_NOISE_FILTER)
  764. {
  765. int o;
  766. int numOfNoises=0;
  767. for(o=0; options[o]!=NULL; o++){
  768. char *tail;
  769. ppMode->maxTmpNoise[numOfNoises]=
  770. strtol(options[o], &tail, 0);
  771. if(tail!=options[o]){
  772. numOfNoises++;
  773. numOfUnknownOptions--;
  774. if(numOfNoises >= 3) break;
  775. }
  776. }
  777. }
  778. else if(filters[i].mask == V_DEBLOCK || filters[i].mask == H_DEBLOCK
  779. || filters[i].mask == V_A_DEBLOCK || filters[i].mask == H_A_DEBLOCK){
  780. int o;
  781. for(o=0; options[o]!=NULL && o<2; o++){
  782. char *tail;
  783. int val= strtol(options[o], &tail, 0);
  784. if(tail==options[o]) break;
  785. numOfUnknownOptions--;
  786. if(o==0) ppMode->baseDcDiff= val;
  787. else ppMode->flatnessThreshold= val;
  788. }
  789. }
  790. else if(filters[i].mask == FORCE_QUANT){
  791. int o;
  792. ppMode->forcedQuant= 15;
  793. for(o=0; options[o]!=NULL && o<1; o++){
  794. char *tail;
  795. int val= strtol(options[o], &tail, 0);
  796. if(tail==options[o]) break;
  797. numOfUnknownOptions--;
  798. ppMode->forcedQuant= val;
  799. }
  800. }
  801. }
  802. }
  803. if(!filterNameOk) ppMode->error++;
  804. ppMode->error += numOfUnknownOptions;
  805. }
  806. av_log(NULL, AV_LOG_DEBUG, "pp: lumMode=%X, chromMode=%X\n", ppMode->lumMode, ppMode->chromMode);
  807. if(ppMode->error){
  808. av_log(NULL, AV_LOG_ERROR, "%d errors in postprocess string \"%s\"\n", ppMode->error, name);
  809. av_free(ppMode);
  810. return NULL;
  811. }
  812. return ppMode;
  813. }
  814. void pp_free_mode(pp_mode *mode){
  815. av_free(mode);
  816. }
  817. static void reallocAlign(void **p, int alignment, int size){
  818. av_free(*p);
  819. *p= av_mallocz(size);
  820. }
  821. static void reallocBuffers(PPContext *c, int width, int height, int stride, int qpStride){
  822. int mbWidth = (width+15)>>4;
  823. int mbHeight= (height+15)>>4;
  824. int i;
  825. c->stride= stride;
  826. c->qpStride= qpStride;
  827. reallocAlign((void **)&c->tempDst, 8, stride*24);
  828. reallocAlign((void **)&c->tempSrc, 8, stride*24);
  829. reallocAlign((void **)&c->tempBlocks, 8, 2*16*8);
  830. reallocAlign((void **)&c->yHistogram, 8, 256*sizeof(uint64_t));
  831. for(i=0; i<256; i++)
  832. c->yHistogram[i]= width*height/64*15/256;
  833. for(i=0; i<3; i++){
  834. //Note: The +17*1024 is just there so i do not have to worry about r/w over the end.
  835. reallocAlign((void **)&c->tempBlurred[i], 8, stride*mbHeight*16 + 17*1024);
  836. reallocAlign((void **)&c->tempBlurredPast[i], 8, 256*((height+7)&(~7))/2 + 17*1024);//FIXME size
  837. }
  838. reallocAlign((void **)&c->deintTemp, 8, 2*width+32);
  839. reallocAlign((void **)&c->nonBQPTable, 8, qpStride*mbHeight*sizeof(QP_STORE_T));
  840. reallocAlign((void **)&c->stdQPTable, 8, qpStride*mbHeight*sizeof(QP_STORE_T));
  841. reallocAlign((void **)&c->forcedQPTable, 8, mbWidth*sizeof(QP_STORE_T));
  842. }
  843. static const char * context_to_name(void * ptr) {
  844. return "postproc";
  845. }
  846. static const AVClass av_codec_context_class = { "Postproc", context_to_name, NULL };
  847. pp_context *pp_get_context(int width, int height, int cpuCaps){
  848. PPContext *c= av_malloc(sizeof(PPContext));
  849. int stride= (width+15)&(~15); //assumed / will realloc if needed
  850. int qpStride= (width+15)/16 + 2; //assumed / will realloc if needed
  851. memset(c, 0, sizeof(PPContext));
  852. c->av_class = &av_codec_context_class;
  853. c->cpuCaps= cpuCaps;
  854. if(cpuCaps&PP_FORMAT){
  855. c->hChromaSubSample= cpuCaps&0x3;
  856. c->vChromaSubSample= (cpuCaps>>4)&0x3;
  857. }else{
  858. c->hChromaSubSample= 1;
  859. c->vChromaSubSample= 1;
  860. }
  861. reallocBuffers(c, width, height, stride, qpStride);
  862. c->frameNum=-1;
  863. return c;
  864. }
  865. void pp_free_context(void *vc){
  866. PPContext *c = (PPContext*)vc;
  867. int i;
  868. for(i=0; i<3; i++) av_free(c->tempBlurred[i]);
  869. for(i=0; i<3; i++) av_free(c->tempBlurredPast[i]);
  870. av_free(c->tempBlocks);
  871. av_free(c->yHistogram);
  872. av_free(c->tempDst);
  873. av_free(c->tempSrc);
  874. av_free(c->deintTemp);
  875. av_free(c->stdQPTable);
  876. av_free(c->nonBQPTable);
  877. av_free(c->forcedQPTable);
  878. memset(c, 0, sizeof(PPContext));
  879. av_free(c);
  880. }
  881. void pp_postprocess(const uint8_t * src[3], const int srcStride[3],
  882. uint8_t * dst[3], const int dstStride[3],
  883. int width, int height,
  884. const QP_STORE_T *QP_store, int QPStride,
  885. pp_mode *vm, void *vc, int pict_type)
  886. {
  887. int mbWidth = (width+15)>>4;
  888. int mbHeight= (height+15)>>4;
  889. PPMode *mode = (PPMode*)vm;
  890. PPContext *c = (PPContext*)vc;
  891. int minStride= FFMAX(FFABS(srcStride[0]), FFABS(dstStride[0]));
  892. int absQPStride = FFABS(QPStride);
  893. // c->stride and c->QPStride are always positive
  894. if(c->stride < minStride || c->qpStride < absQPStride)
  895. reallocBuffers(c, width, height,
  896. FFMAX(minStride, c->stride),
  897. FFMAX(c->qpStride, absQPStride));
  898. if(QP_store==NULL || (mode->lumMode & FORCE_QUANT)){
  899. int i;
  900. QP_store= c->forcedQPTable;
  901. absQPStride = QPStride = 0;
  902. if(mode->lumMode & FORCE_QUANT)
  903. for(i=0; i<mbWidth; i++) c->forcedQPTable[i]= mode->forcedQuant;
  904. else
  905. for(i=0; i<mbWidth; i++) c->forcedQPTable[i]= 1;
  906. }
  907. if(pict_type & PP_PICT_TYPE_QP2){
  908. int i;
  909. const int count= mbHeight * absQPStride;
  910. for(i=0; i<(count>>2); i++){
  911. ((uint32_t*)c->stdQPTable)[i] = (((const uint32_t*)QP_store)[i]>>1) & 0x7F7F7F7F;
  912. }
  913. for(i<<=2; i<count; i++){
  914. c->stdQPTable[i] = QP_store[i]>>1;
  915. }
  916. QP_store= c->stdQPTable;
  917. QPStride= absQPStride;
  918. }
  919. if(0){
  920. int x,y;
  921. for(y=0; y<mbHeight; y++){
  922. for(x=0; x<mbWidth; x++){
  923. av_log(c, AV_LOG_INFO, "%2d ", QP_store[x + y*QPStride]);
  924. }
  925. av_log(c, AV_LOG_INFO, "\n");
  926. }
  927. av_log(c, AV_LOG_INFO, "\n");
  928. }
  929. if((pict_type&7)!=3){
  930. if (QPStride >= 0){
  931. int i;
  932. const int count= mbHeight * QPStride;
  933. for(i=0; i<(count>>2); i++){
  934. ((uint32_t*)c->nonBQPTable)[i] = ((const uint32_t*)QP_store)[i] & 0x3F3F3F3F;
  935. }
  936. for(i<<=2; i<count; i++){
  937. c->nonBQPTable[i] = QP_store[i] & 0x3F;
  938. }
  939. } else {
  940. int i,j;
  941. for(i=0; i<mbHeight; i++) {
  942. for(j=0; j<absQPStride; j++) {
  943. c->nonBQPTable[i*absQPStride+j] = QP_store[i*QPStride+j] & 0x3F;
  944. }
  945. }
  946. }
  947. }
  948. av_log(c, AV_LOG_DEBUG, "using npp filters 0x%X/0x%X\n",
  949. mode->lumMode, mode->chromMode);
  950. postProcess(src[0], srcStride[0], dst[0], dstStride[0],
  951. width, height, QP_store, QPStride, 0, mode, c);
  952. width = (width )>>c->hChromaSubSample;
  953. height = (height)>>c->vChromaSubSample;
  954. if(mode->chromMode){
  955. postProcess(src[1], srcStride[1], dst[1], dstStride[1],
  956. width, height, QP_store, QPStride, 1, mode, c);
  957. postProcess(src[2], srcStride[2], dst[2], dstStride[2],
  958. width, height, QP_store, QPStride, 2, mode, c);
  959. }
  960. else if(srcStride[1] == dstStride[1] && srcStride[2] == dstStride[2]){
  961. linecpy(dst[1], src[1], height, srcStride[1]);
  962. linecpy(dst[2], src[2], height, srcStride[2]);
  963. }else{
  964. int y;
  965. for(y=0; y<height; y++){
  966. memcpy(&(dst[1][y*dstStride[1]]), &(src[1][y*srcStride[1]]), width);
  967. memcpy(&(dst[2][y*dstStride[2]]), &(src[2][y*srcStride[2]]), width);
  968. }
  969. }
  970. }