vf_spp.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  1. /*
  2. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  3. * Copyright (c) 2013 Clément Bœsch <u pkh me>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License along
  18. * with FFmpeg; if not, write to the Free Software Foundation, Inc.,
  19. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20. */
  21. /**
  22. * @file
  23. * Simple post processing filter
  24. *
  25. * This implementation is based on an algorithm described in
  26. * "Aria Nosratinia Embedded Post-Processing for
  27. * Enhancement of Compressed Images (1999)"
  28. *
  29. * Originally written by Michael Niedermayer for the MPlayer project, and
  30. * ported by Clément Bœsch for FFmpeg.
  31. */
  32. #include "libavutil/avassert.h"
  33. #include "libavutil/imgutils.h"
  34. #include "libavutil/opt.h"
  35. #include "libavutil/pixdesc.h"
  36. #include "internal.h"
  37. #include "vf_spp.h"
  38. enum mode {
  39. MODE_HARD,
  40. MODE_SOFT,
  41. NB_MODES
  42. };
  43. static const AVClass *child_class_next(const AVClass *prev)
  44. {
  45. return prev ? NULL : avcodec_dct_get_class();
  46. }
  47. static void *child_next(void *obj, void *prev)
  48. {
  49. SPPContext *s = obj;
  50. return prev ? NULL : s->dct;
  51. }
  52. #define OFFSET(x) offsetof(SPPContext, x)
  53. #define FLAGS AV_OPT_FLAG_FILTERING_PARAM|AV_OPT_FLAG_VIDEO_PARAM
  54. static const AVOption spp_options[] = {
  55. { "quality", "set quality", OFFSET(log2_count), AV_OPT_TYPE_INT, {.i64 = 3}, 0, MAX_LEVEL, FLAGS },
  56. { "qp", "force a constant quantizer parameter", OFFSET(qp), AV_OPT_TYPE_INT, {.i64 = 0}, 0, 63, FLAGS },
  57. { "mode", "set thresholding mode", OFFSET(mode), AV_OPT_TYPE_INT, {.i64 = MODE_HARD}, 0, NB_MODES - 1, FLAGS, "mode" },
  58. { "hard", "hard thresholding", 0, AV_OPT_TYPE_CONST, {.i64 = MODE_HARD}, INT_MIN, INT_MAX, FLAGS, "mode" },
  59. { "soft", "soft thresholding", 0, AV_OPT_TYPE_CONST, {.i64 = MODE_SOFT}, INT_MIN, INT_MAX, FLAGS, "mode" },
  60. { "use_bframe_qp", "use B-frames' QP", OFFSET(use_bframe_qp), AV_OPT_TYPE_INT, {.i64 = 0}, 0, 1, FLAGS },
  61. { NULL }
  62. };
  63. static const AVClass spp_class = {
  64. .class_name = "spp",
  65. .item_name = av_default_item_name,
  66. .option = spp_options,
  67. .version = LIBAVUTIL_VERSION_INT,
  68. .category = AV_CLASS_CATEGORY_FILTER,
  69. .child_class_next = child_class_next,
  70. .child_next = child_next,
  71. };
  72. // XXX: share between filters?
  73. DECLARE_ALIGNED(8, static const uint8_t, ldither)[8][8] = {
  74. { 0, 48, 12, 60, 3, 51, 15, 63 },
  75. { 32, 16, 44, 28, 35, 19, 47, 31 },
  76. { 8, 56, 4, 52, 11, 59, 7, 55 },
  77. { 40, 24, 36, 20, 43, 27, 39, 23 },
  78. { 2, 50, 14, 62, 1, 49, 13, 61 },
  79. { 34, 18, 46, 30, 33, 17, 45, 29 },
  80. { 10, 58, 6, 54, 9, 57, 5, 53 },
  81. { 42, 26, 38, 22, 41, 25, 37, 21 },
  82. };
  83. static const uint8_t offset[127][2] = {
  84. {0,0},
  85. {0,0}, {4,4}, // quality = 1
  86. {0,0}, {2,2}, {6,4}, {4,6}, // quality = 2
  87. {0,0}, {5,1}, {2,2}, {7,3}, {4,4}, {1,5}, {6,6}, {3,7}, // quality = 3
  88. {0,0}, {4,0}, {1,1}, {5,1}, {3,2}, {7,2}, {2,3}, {6,3}, // quality = 4
  89. {0,4}, {4,4}, {1,5}, {5,5}, {3,6}, {7,6}, {2,7}, {6,7},
  90. {0,0}, {0,2}, {0,4}, {0,6}, {1,1}, {1,3}, {1,5}, {1,7}, // quality = 5
  91. {2,0}, {2,2}, {2,4}, {2,6}, {3,1}, {3,3}, {3,5}, {3,7},
  92. {4,0}, {4,2}, {4,4}, {4,6}, {5,1}, {5,3}, {5,5}, {5,7},
  93. {6,0}, {6,2}, {6,4}, {6,6}, {7,1}, {7,3}, {7,5}, {7,7},
  94. {0,0}, {4,4}, {0,4}, {4,0}, {2,2}, {6,6}, {2,6}, {6,2}, // quality = 6
  95. {0,2}, {4,6}, {0,6}, {4,2}, {2,0}, {6,4}, {2,4}, {6,0},
  96. {1,1}, {5,5}, {1,5}, {5,1}, {3,3}, {7,7}, {3,7}, {7,3},
  97. {1,3}, {5,7}, {1,7}, {5,3}, {3,1}, {7,5}, {3,5}, {7,1},
  98. {0,1}, {4,5}, {0,5}, {4,1}, {2,3}, {6,7}, {2,7}, {6,3},
  99. {0,3}, {4,7}, {0,7}, {4,3}, {2,1}, {6,5}, {2,5}, {6,1},
  100. {1,0}, {5,4}, {1,4}, {5,0}, {3,2}, {7,6}, {3,6}, {7,2},
  101. {1,2}, {5,6}, {1,6}, {5,2}, {3,0}, {7,4}, {3,4}, {7,0},
  102. };
  103. static void hardthresh_c(int16_t dst[64], const int16_t src[64],
  104. int qp, const uint8_t *permutation)
  105. {
  106. int i;
  107. int bias = 0; // FIXME
  108. unsigned threshold1 = qp * ((1<<4) - bias) - 1;
  109. unsigned threshold2 = threshold1 << 1;
  110. memset(dst, 0, 64 * sizeof(dst[0]));
  111. dst[0] = (src[0] + 4) >> 3;
  112. for (i = 1; i < 64; i++) {
  113. int level = src[i];
  114. if (((unsigned)(level + threshold1)) > threshold2) {
  115. const int j = permutation[i];
  116. dst[j] = (level + 4) >> 3;
  117. }
  118. }
  119. }
  120. static void softthresh_c(int16_t dst[64], const int16_t src[64],
  121. int qp, const uint8_t *permutation)
  122. {
  123. int i;
  124. int bias = 0; //FIXME
  125. unsigned threshold1 = qp * ((1<<4) - bias) - 1;
  126. unsigned threshold2 = threshold1 << 1;
  127. memset(dst, 0, 64 * sizeof(dst[0]));
  128. dst[0] = (src[0] + 4) >> 3;
  129. for (i = 1; i < 64; i++) {
  130. int level = src[i];
  131. if (((unsigned)(level + threshold1)) > threshold2) {
  132. const int j = permutation[i];
  133. if (level > 0) dst[j] = (level - threshold1 + 4) >> 3;
  134. else dst[j] = (level + threshold1 + 4) >> 3;
  135. }
  136. }
  137. }
  138. static void store_slice_c(uint8_t *dst, const int16_t *src,
  139. int dst_linesize, int src_linesize,
  140. int width, int height, int log2_scale,
  141. const uint8_t dither[8][8])
  142. {
  143. int y, x;
  144. #define STORE(pos) do { \
  145. temp = ((src[x + y*src_linesize + pos] << log2_scale) + d[pos]) >> 6; \
  146. if (temp & 0x100) \
  147. temp = ~(temp >> 31); \
  148. dst[x + y*dst_linesize + pos] = temp; \
  149. } while (0)
  150. for (y = 0; y < height; y++) {
  151. const uint8_t *d = dither[y];
  152. for (x = 0; x < width; x += 8) {
  153. int temp;
  154. STORE(0);
  155. STORE(1);
  156. STORE(2);
  157. STORE(3);
  158. STORE(4);
  159. STORE(5);
  160. STORE(6);
  161. STORE(7);
  162. }
  163. }
  164. }
  165. static inline void add_block(int16_t *dst, int linesize, const int16_t block[64])
  166. {
  167. int y;
  168. for (y = 0; y < 8; y++) {
  169. *(uint32_t *)&dst[0 + y*linesize] += *(uint32_t *)&block[0 + y*8];
  170. *(uint32_t *)&dst[2 + y*linesize] += *(uint32_t *)&block[2 + y*8];
  171. *(uint32_t *)&dst[4 + y*linesize] += *(uint32_t *)&block[4 + y*8];
  172. *(uint32_t *)&dst[6 + y*linesize] += *(uint32_t *)&block[6 + y*8];
  173. }
  174. }
  175. // XXX: export the function?
  176. static inline int norm_qscale(int qscale, int type)
  177. {
  178. switch (type) {
  179. case FF_QSCALE_TYPE_MPEG1: return qscale;
  180. case FF_QSCALE_TYPE_MPEG2: return qscale >> 1;
  181. case FF_QSCALE_TYPE_H264: return qscale >> 2;
  182. case FF_QSCALE_TYPE_VP56: return (63 - qscale + 2) >> 2;
  183. }
  184. return qscale;
  185. }
  186. static void filter(SPPContext *p, uint8_t *dst, uint8_t *src,
  187. int dst_linesize, int src_linesize, int width, int height,
  188. const uint8_t *qp_table, int qp_stride, int is_luma)
  189. {
  190. int x, y, i;
  191. const int count = 1 << p->log2_count;
  192. const int linesize = is_luma ? p->temp_linesize : FFALIGN(width+16, 16);
  193. DECLARE_ALIGNED(16, uint64_t, block_align)[32];
  194. int16_t *block = (int16_t *)block_align;
  195. int16_t *block2 = (int16_t *)(block_align + 16);
  196. for (y = 0; y < height; y++) {
  197. int index = 8 + 8*linesize + y*linesize;
  198. memcpy(p->src + index, src + y*src_linesize, width);
  199. for (x = 0; x < 8; x++) {
  200. p->src[index - x - 1] = p->src[index + x ];
  201. p->src[index + width + x ] = p->src[index + width - x - 1];
  202. }
  203. }
  204. for (y = 0; y < 8; y++) {
  205. memcpy(p->src + ( 7-y)*linesize, p->src + ( y+8)*linesize, linesize);
  206. memcpy(p->src + (height+8+y)*linesize, p->src + (height-y+7)*linesize, linesize);
  207. }
  208. for (y = 0; y < height + 8; y += 8) {
  209. memset(p->temp + (8 + y) * linesize, 0, 8 * linesize * sizeof(*p->temp));
  210. for (x = 0; x < width + 8; x += 8) {
  211. int qp;
  212. if (p->qp) {
  213. qp = p->qp;
  214. } else{
  215. const int qps = 3 + is_luma;
  216. qp = qp_table[(FFMIN(x, width - 1) >> qps) + (FFMIN(y, height - 1) >> qps) * qp_stride];
  217. qp = FFMAX(1, norm_qscale(qp, p->qscale_type));
  218. }
  219. for (i = 0; i < count; i++) {
  220. const int x1 = x + offset[i + count - 1][0];
  221. const int y1 = y + offset[i + count - 1][1];
  222. const int index = x1 + y1*linesize;
  223. p->dct->get_pixels(block, p->src + index, linesize);
  224. p->dct->fdct(block);
  225. p->requantize(block2, block, qp, p->dct->idct_permutation);
  226. p->dct->idct(block2);
  227. add_block(p->temp + index, linesize, block2);
  228. }
  229. }
  230. if (y)
  231. p->store_slice(dst + (y - 8) * dst_linesize, p->temp + 8 + y*linesize,
  232. dst_linesize, linesize, width,
  233. FFMIN(8, height + 8 - y), MAX_LEVEL - p->log2_count,
  234. ldither);
  235. }
  236. }
  237. static int query_formats(AVFilterContext *ctx)
  238. {
  239. static const enum PixelFormat pix_fmts[] = {
  240. AV_PIX_FMT_YUV444P, AV_PIX_FMT_YUV422P,
  241. AV_PIX_FMT_YUV420P, AV_PIX_FMT_YUV411P,
  242. AV_PIX_FMT_YUV410P, AV_PIX_FMT_YUV440P,
  243. AV_PIX_FMT_YUVJ444P, AV_PIX_FMT_YUVJ422P,
  244. AV_PIX_FMT_YUVJ420P, AV_PIX_FMT_YUVJ440P,
  245. AV_PIX_FMT_NONE
  246. };
  247. ff_set_common_formats(ctx, ff_make_format_list(pix_fmts));
  248. return 0;
  249. }
  250. static int config_input(AVFilterLink *inlink)
  251. {
  252. SPPContext *spp = inlink->dst->priv;
  253. const int h = FFALIGN(inlink->h + 16, 16);
  254. const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(inlink->format);
  255. spp->hsub = desc->log2_chroma_w;
  256. spp->vsub = desc->log2_chroma_h;
  257. spp->temp_linesize = FFALIGN(inlink->w + 16, 16);
  258. spp->temp = av_malloc_array(spp->temp_linesize, h * sizeof(*spp->temp));
  259. spp->src = av_malloc_array(spp->temp_linesize, h * sizeof(*spp->src));
  260. if (!spp->use_bframe_qp) {
  261. /* we are assuming here the qp blocks will not be smaller that 16x16 */
  262. spp->non_b_qp_alloc_size = FF_CEIL_RSHIFT(inlink->w, 4) * FF_CEIL_RSHIFT(inlink->h, 4);
  263. spp->non_b_qp_table = av_calloc(spp->non_b_qp_alloc_size, sizeof(*spp->non_b_qp_table));
  264. if (!spp->non_b_qp_table)
  265. return AVERROR(ENOMEM);
  266. }
  267. if (!spp->temp || !spp->src)
  268. return AVERROR(ENOMEM);
  269. return 0;
  270. }
  271. static int filter_frame(AVFilterLink *inlink, AVFrame *in)
  272. {
  273. AVFilterContext *ctx = inlink->dst;
  274. SPPContext *spp = ctx->priv;
  275. AVFilterLink *outlink = ctx->outputs[0];
  276. AVFrame *out = in;
  277. int qp_stride = 0;
  278. const int8_t *qp_table = NULL;
  279. /* if we are not in a constant user quantizer mode and we don't want to use
  280. * the quantizers from the B-frames (B-frames often have a higher QP), we
  281. * need to save the qp table from the last non B-frame; this is what the
  282. * following code block does */
  283. if (!spp->qp) {
  284. qp_table = av_frame_get_qp_table(in, &qp_stride, &spp->qscale_type);
  285. if (qp_table && !spp->use_bframe_qp && in->pict_type != AV_PICTURE_TYPE_B) {
  286. int w, h;
  287. /* if the qp stride is not set, it means the QP are only defined on
  288. * a line basis */
  289. if (!qp_stride) {
  290. w = FF_CEIL_RSHIFT(inlink->w, 4);
  291. h = 1;
  292. } else {
  293. w = FF_CEIL_RSHIFT(qp_stride, 4);
  294. h = FF_CEIL_RSHIFT(inlink->h, 4);
  295. }
  296. av_assert0(w * h <= spp->non_b_qp_alloc_size);
  297. memcpy(spp->non_b_qp_table, qp_table, w * h);
  298. }
  299. }
  300. if (spp->log2_count && !ctx->is_disabled) {
  301. if (!spp->use_bframe_qp && spp->non_b_qp_table)
  302. qp_table = spp->non_b_qp_table;
  303. if (qp_table || spp->qp) {
  304. const int cw = FF_CEIL_RSHIFT(inlink->w, spp->hsub);
  305. const int ch = FF_CEIL_RSHIFT(inlink->h, spp->vsub);
  306. /* get a new frame if in-place is not possible or if the dimensions
  307. * are not multiple of 8 */
  308. if (!av_frame_is_writable(in) || (inlink->w & 7) || (inlink->h & 7)) {
  309. const int aligned_w = FFALIGN(inlink->w, 8);
  310. const int aligned_h = FFALIGN(inlink->h, 8);
  311. out = ff_get_video_buffer(outlink, aligned_w, aligned_h);
  312. if (!out) {
  313. av_frame_free(&in);
  314. return AVERROR(ENOMEM);
  315. }
  316. av_frame_copy_props(out, in);
  317. out->width = in->width;
  318. out->height = in->height;
  319. }
  320. filter(spp, out->data[0], in->data[0], out->linesize[0], in->linesize[0], inlink->w, inlink->h, qp_table, qp_stride, 1);
  321. filter(spp, out->data[1], in->data[1], out->linesize[1], in->linesize[1], cw, ch, qp_table, qp_stride, 0);
  322. filter(spp, out->data[2], in->data[2], out->linesize[2], in->linesize[2], cw, ch, qp_table, qp_stride, 0);
  323. emms_c();
  324. }
  325. }
  326. if (in != out) {
  327. if (in->data[3])
  328. av_image_copy_plane(out->data[3], out->linesize[3],
  329. in ->data[3], in ->linesize[3],
  330. inlink->w, inlink->h);
  331. av_frame_free(&in);
  332. }
  333. return ff_filter_frame(outlink, out);
  334. }
  335. static int process_command(AVFilterContext *ctx, const char *cmd, const char *args,
  336. char *res, int res_len, int flags)
  337. {
  338. SPPContext *spp = ctx->priv;
  339. if (!strcmp(cmd, "level")) {
  340. if (!strcmp(args, "max"))
  341. spp->log2_count = MAX_LEVEL;
  342. else
  343. spp->log2_count = av_clip(strtol(args, NULL, 10), 0, MAX_LEVEL);
  344. return 0;
  345. }
  346. return AVERROR(ENOSYS);
  347. }
  348. static av_cold int init_dict(AVFilterContext *ctx, AVDictionary **opts)
  349. {
  350. SPPContext *spp = ctx->priv;
  351. int ret;
  352. spp->avctx = avcodec_alloc_context3(NULL);
  353. spp->dct = avcodec_dct_alloc();
  354. if (!spp->avctx || !spp->dct)
  355. return AVERROR(ENOMEM);
  356. if (opts) {
  357. AVDictionaryEntry *e = NULL;
  358. while ((e = av_dict_get(*opts, "", e, AV_DICT_IGNORE_SUFFIX))) {
  359. if ((ret = av_opt_set(spp->dct, e->key, e->value, 0)) < 0)
  360. return ret;
  361. }
  362. av_dict_free(opts);
  363. }
  364. avcodec_dct_init(spp->dct);
  365. spp->store_slice = store_slice_c;
  366. switch (spp->mode) {
  367. case MODE_HARD: spp->requantize = hardthresh_c; break;
  368. case MODE_SOFT: spp->requantize = softthresh_c; break;
  369. }
  370. if (ARCH_X86)
  371. ff_spp_init_x86(spp);
  372. return 0;
  373. }
  374. static av_cold void uninit(AVFilterContext *ctx)
  375. {
  376. SPPContext *spp = ctx->priv;
  377. av_freep(&spp->temp);
  378. av_freep(&spp->src);
  379. if (spp->avctx) {
  380. avcodec_close(spp->avctx);
  381. av_freep(&spp->avctx);
  382. }
  383. av_freep(&spp->dct);
  384. av_freep(&spp->non_b_qp_table);
  385. }
  386. static const AVFilterPad spp_inputs[] = {
  387. {
  388. .name = "default",
  389. .type = AVMEDIA_TYPE_VIDEO,
  390. .config_props = config_input,
  391. .filter_frame = filter_frame,
  392. },
  393. { NULL }
  394. };
  395. static const AVFilterPad spp_outputs[] = {
  396. {
  397. .name = "default",
  398. .type = AVMEDIA_TYPE_VIDEO,
  399. },
  400. { NULL }
  401. };
  402. AVFilter ff_vf_spp = {
  403. .name = "spp",
  404. .description = NULL_IF_CONFIG_SMALL("Apply a simple post processing filter."),
  405. .priv_size = sizeof(SPPContext),
  406. .init_dict = init_dict,
  407. .uninit = uninit,
  408. .query_formats = query_formats,
  409. .inputs = spp_inputs,
  410. .outputs = spp_outputs,
  411. .process_command = process_command,
  412. .priv_class = &spp_class,
  413. .flags = AVFILTER_FLAG_SUPPORT_TIMELINE_INTERNAL,
  414. };