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