postprocess.c 35 KB

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