/media/libvpx/vp8/encoder/tokenize.c

http://github.com/zpao/v8monkey · C · 521 lines · 387 code · 119 blank · 15 comment · 56 complexity · 28fd89b1ab42d9a59aeedd6db8544d10 MD5 · raw file

  1. /*
  2. * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
  3. *
  4. * Use of this source code is governed by a BSD-style license
  5. * that can be found in the LICENSE file in the root of the source
  6. * tree. An additional intellectual property rights grant can be found
  7. * in the file PATENTS. All contributing project authors may
  8. * be found in the AUTHORS file in the root of the source tree.
  9. */
  10. #include <math.h>
  11. #include <stdio.h>
  12. #include <string.h>
  13. #include <assert.h>
  14. #include "onyx_int.h"
  15. #include "tokenize.h"
  16. #include "vpx_mem/vpx_mem.h"
  17. /* Global event counters used for accumulating statistics across several
  18. compressions, then generating context.c = initial stats. */
  19. #ifdef ENTROPY_STATS
  20. _int64 context_counters[BLOCK_TYPES] [COEF_BANDS] [PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS];
  21. #endif
  22. void vp8_stuff_mb(VP8_COMP *cpi, MACROBLOCKD *x, TOKENEXTRA **t) ;
  23. void vp8_fix_contexts(MACROBLOCKD *x);
  24. static TOKENVALUE dct_value_tokens[DCT_MAX_VALUE*2];
  25. const TOKENVALUE *vp8_dct_value_tokens_ptr;
  26. static int dct_value_cost[DCT_MAX_VALUE*2];
  27. const int *vp8_dct_value_cost_ptr;
  28. #if 0
  29. int skip_true_count = 0;
  30. int skip_false_count = 0;
  31. #endif
  32. static void fill_value_tokens()
  33. {
  34. TOKENVALUE *const t = dct_value_tokens + DCT_MAX_VALUE;
  35. vp8_extra_bit_struct *const e = vp8_extra_bits;
  36. int i = -DCT_MAX_VALUE;
  37. int sign = 1;
  38. do
  39. {
  40. if (!i)
  41. sign = 0;
  42. {
  43. const int a = sign ? -i : i;
  44. int eb = sign;
  45. if (a > 4)
  46. {
  47. int j = 4;
  48. while (++j < 11 && e[j].base_val <= a) {}
  49. t[i].Token = --j;
  50. eb |= (a - e[j].base_val) << 1;
  51. }
  52. else
  53. t[i].Token = a;
  54. t[i].Extra = eb;
  55. }
  56. // initialize the cost for extra bits for all possible coefficient value.
  57. {
  58. int cost = 0;
  59. vp8_extra_bit_struct *p = vp8_extra_bits + t[i].Token;
  60. if (p->base_val)
  61. {
  62. const int extra = t[i].Extra;
  63. const int Length = p->Len;
  64. if (Length)
  65. cost += vp8_treed_cost(p->tree, p->prob, extra >> 1, Length);
  66. cost += vp8_cost_bit(vp8_prob_half, extra & 1); /* sign */
  67. dct_value_cost[i + DCT_MAX_VALUE] = cost;
  68. }
  69. }
  70. }
  71. while (++i < DCT_MAX_VALUE);
  72. vp8_dct_value_tokens_ptr = dct_value_tokens + DCT_MAX_VALUE;
  73. vp8_dct_value_cost_ptr = dct_value_cost + DCT_MAX_VALUE;
  74. }
  75. static void tokenize2nd_order_b
  76. (
  77. MACROBLOCKD *x,
  78. TOKENEXTRA **tp,
  79. VP8_COMP *cpi
  80. )
  81. {
  82. int pt; /* near block/prev token context index */
  83. int c; /* start at DC */
  84. TOKENEXTRA *t = *tp;/* store tokens starting here */
  85. const BLOCKD *b;
  86. const short *qcoeff_ptr;
  87. ENTROPY_CONTEXT * a;
  88. ENTROPY_CONTEXT * l;
  89. int band, rc, v, token;
  90. b = x->block + 24;
  91. qcoeff_ptr = b->qcoeff;
  92. a = (ENTROPY_CONTEXT *)x->above_context + 8;
  93. l = (ENTROPY_CONTEXT *)x->left_context + 8;
  94. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  95. for (c = 0; c < b->eob; c++)
  96. {
  97. rc = vp8_default_zig_zag1d[c];
  98. band = vp8_coef_bands[c];
  99. v = qcoeff_ptr[rc];
  100. t->Extra = vp8_dct_value_tokens_ptr[v].Extra;
  101. token = vp8_dct_value_tokens_ptr[v].Token;
  102. t->Token = token;
  103. t->context_tree = cpi->common.fc.coef_probs [1] [band] [pt];
  104. t->skip_eob_node = ((pt == 0) && (band > 0));
  105. ++cpi->coef_counts [1] [band] [pt] [token];
  106. pt = vp8_prev_token_class[token];
  107. t++;
  108. }
  109. if (c < 16)
  110. {
  111. band = vp8_coef_bands[c];
  112. t->Token = DCT_EOB_TOKEN;
  113. t->context_tree = cpi->common.fc.coef_probs [1] [band] [pt];
  114. t->skip_eob_node = ((pt == 0) && (band > 0));
  115. ++cpi->coef_counts [1] [band] [pt] [DCT_EOB_TOKEN];
  116. t++;
  117. }
  118. *tp = t;
  119. pt = (c != 0); /* 0 <-> all coeff data is zero */
  120. *a = *l = pt;
  121. }
  122. static void tokenize1st_order_b
  123. (
  124. MACROBLOCKD *x,
  125. TOKENEXTRA **tp,
  126. int type, /* which plane: 0=Y no DC, 1=Y2, 2=UV, 3=Y with DC */
  127. VP8_COMP *cpi
  128. )
  129. {
  130. unsigned int block;
  131. const BLOCKD *b;
  132. int pt; /* near block/prev token context index */
  133. int c;
  134. int token;
  135. TOKENEXTRA *t = *tp;/* store tokens starting here */
  136. const short *qcoeff_ptr;
  137. ENTROPY_CONTEXT * a;
  138. ENTROPY_CONTEXT * l;
  139. int band, rc, v;
  140. int tmp1, tmp2;
  141. b = x->block;
  142. /* Luma */
  143. for (block = 0; block < 16; block++, b++)
  144. {
  145. tmp1 = vp8_block2above[block];
  146. tmp2 = vp8_block2left[block];
  147. qcoeff_ptr = b->qcoeff;
  148. a = (ENTROPY_CONTEXT *)x->above_context + tmp1;
  149. l = (ENTROPY_CONTEXT *)x->left_context + tmp2;
  150. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  151. c = type ? 0 : 1;
  152. for (; c < b->eob; c++)
  153. {
  154. rc = vp8_default_zig_zag1d[c];
  155. band = vp8_coef_bands[c];
  156. v = qcoeff_ptr[rc];
  157. t->Extra = vp8_dct_value_tokens_ptr[v].Extra;
  158. token = vp8_dct_value_tokens_ptr[v].Token;
  159. t->Token = token;
  160. t->context_tree = cpi->common.fc.coef_probs [type] [band] [pt];
  161. t->skip_eob_node = pt == 0 &&
  162. ((band > 0 && type > 0) || (band > 1 && type == 0));
  163. ++cpi->coef_counts [type] [band] [pt] [token];
  164. pt = vp8_prev_token_class[token];
  165. t++;
  166. }
  167. if (c < 16)
  168. {
  169. band = vp8_coef_bands[c];
  170. t->Token = DCT_EOB_TOKEN;
  171. t->context_tree = cpi->common.fc.coef_probs [type] [band] [pt];
  172. t->skip_eob_node = pt == 0 &&
  173. ((band > 0 && type > 0) || (band > 1 && type == 0));
  174. ++cpi->coef_counts [type] [band] [pt] [DCT_EOB_TOKEN];
  175. t++;
  176. }
  177. *tp = t;
  178. pt = (c != !type); /* 0 <-> all coeff data is zero */
  179. *a = *l = pt;
  180. }
  181. /* Chroma */
  182. for (block = 16; block < 24; block++, b++)
  183. {
  184. tmp1 = vp8_block2above[block];
  185. tmp2 = vp8_block2left[block];
  186. qcoeff_ptr = b->qcoeff;
  187. a = (ENTROPY_CONTEXT *)x->above_context + tmp1;
  188. l = (ENTROPY_CONTEXT *)x->left_context + tmp2;
  189. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  190. for (c = 0; c < b->eob; c++)
  191. {
  192. rc = vp8_default_zig_zag1d[c];
  193. band = vp8_coef_bands[c];
  194. v = qcoeff_ptr[rc];
  195. t->Extra = vp8_dct_value_tokens_ptr[v].Extra;
  196. token = vp8_dct_value_tokens_ptr[v].Token;
  197. t->Token = token;
  198. t->context_tree = cpi->common.fc.coef_probs [2] [band] [pt];
  199. t->skip_eob_node = ((pt == 0) && (band > 0));
  200. ++cpi->coef_counts [2] [band] [pt] [token];
  201. pt = vp8_prev_token_class[token];
  202. t++;
  203. }
  204. if (c < 16)
  205. {
  206. band = vp8_coef_bands[c];
  207. t->Token = DCT_EOB_TOKEN;
  208. t->context_tree = cpi->common.fc.coef_probs [2] [band] [pt];
  209. t->skip_eob_node = ((pt == 0) && (band > 0));
  210. ++cpi->coef_counts [2] [band] [pt] [DCT_EOB_TOKEN];
  211. t++;
  212. }
  213. *tp = t;
  214. pt = (c != 0); /* 0 <-> all coeff data is zero */
  215. *a = *l = pt;
  216. }
  217. }
  218. static int mb_is_skippable(MACROBLOCKD *x, int has_y2_block)
  219. {
  220. int skip = 1;
  221. int i = 0;
  222. if (has_y2_block)
  223. {
  224. for (i = 0; i < 16; i++)
  225. skip &= (x->block[i].eob < 2);
  226. }
  227. for (; i < 24 + has_y2_block; i++)
  228. skip &= (!x->block[i].eob);
  229. return skip;
  230. }
  231. void vp8_tokenize_mb(VP8_COMP *cpi, MACROBLOCKD *x, TOKENEXTRA **t)
  232. {
  233. int plane_type;
  234. int has_y2_block;
  235. has_y2_block = (x->mode_info_context->mbmi.mode != B_PRED
  236. && x->mode_info_context->mbmi.mode != SPLITMV);
  237. x->mode_info_context->mbmi.mb_skip_coeff = mb_is_skippable(x, has_y2_block);
  238. if (x->mode_info_context->mbmi.mb_skip_coeff)
  239. {
  240. cpi->skip_true_count++;
  241. if (!cpi->common.mb_no_coeff_skip)
  242. vp8_stuff_mb(cpi, x, t) ;
  243. else
  244. {
  245. vp8_fix_contexts(x);
  246. }
  247. return;
  248. }
  249. cpi->skip_false_count++;
  250. plane_type = 3;
  251. if(has_y2_block)
  252. {
  253. tokenize2nd_order_b(x, t, cpi);
  254. plane_type = 0;
  255. }
  256. tokenize1st_order_b(x, t, plane_type, cpi);
  257. }
  258. #ifdef ENTROPY_STATS
  259. void init_context_counters(void)
  260. {
  261. vpx_memset(context_counters, 0, sizeof(context_counters));
  262. }
  263. void print_context_counters()
  264. {
  265. int type, band, pt, t;
  266. FILE *const f = fopen("context.c", "w");
  267. fprintf(f, "#include \"entropy.h\"\n");
  268. fprintf(f, "\n/* *** GENERATED FILE: DO NOT EDIT *** */\n\n");
  269. fprintf(f, "int Contexts[BLOCK_TYPES] [COEF_BANDS] [PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS];\n\n");
  270. fprintf(f, "const int default_contexts[BLOCK_TYPES] [COEF_BANDS] [PREV_COEF_CONTEXTS] [MAX_ENTROPY_TOKENS] = {");
  271. # define Comma( X) (X? ",":"")
  272. type = 0;
  273. do
  274. {
  275. fprintf(f, "%s\n { /* block Type %d */", Comma(type), type);
  276. band = 0;
  277. do
  278. {
  279. fprintf(f, "%s\n { /* Coeff Band %d */", Comma(band), band);
  280. pt = 0;
  281. do
  282. {
  283. fprintf(f, "%s\n {", Comma(pt));
  284. t = 0;
  285. do
  286. {
  287. const _int64 x = context_counters [type] [band] [pt] [t];
  288. const int y = (int) x;
  289. assert(x == (_int64) y); /* no overflow handling yet */
  290. fprintf(f, "%s %d", Comma(t), y);
  291. }
  292. while (++t < MAX_ENTROPY_TOKENS);
  293. fprintf(f, "}");
  294. }
  295. while (++pt < PREV_COEF_CONTEXTS);
  296. fprintf(f, "\n }");
  297. }
  298. while (++band < COEF_BANDS);
  299. fprintf(f, "\n }");
  300. }
  301. while (++type < BLOCK_TYPES);
  302. fprintf(f, "\n};\n");
  303. fclose(f);
  304. }
  305. #endif
  306. void vp8_tokenize_initialize()
  307. {
  308. fill_value_tokens();
  309. }
  310. static __inline void stuff2nd_order_b
  311. (
  312. TOKENEXTRA **tp,
  313. ENTROPY_CONTEXT *a,
  314. ENTROPY_CONTEXT *l,
  315. VP8_COMP *cpi
  316. )
  317. {
  318. int pt; /* near block/prev token context index */
  319. TOKENEXTRA *t = *tp; /* store tokens starting here */
  320. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  321. t->Token = DCT_EOB_TOKEN;
  322. t->context_tree = cpi->common.fc.coef_probs [1] [0] [pt];
  323. t->skip_eob_node = 0;
  324. ++cpi->coef_counts [1] [0] [pt] [DCT_EOB_TOKEN];
  325. ++t;
  326. *tp = t;
  327. pt = 0;
  328. *a = *l = pt;
  329. }
  330. static __inline void stuff1st_order_b
  331. (
  332. TOKENEXTRA **tp,
  333. ENTROPY_CONTEXT *a,
  334. ENTROPY_CONTEXT *l,
  335. VP8_COMP *cpi
  336. )
  337. {
  338. int pt; /* near block/prev token context index */
  339. TOKENEXTRA *t = *tp; /* store tokens starting here */
  340. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  341. t->Token = DCT_EOB_TOKEN;
  342. t->context_tree = cpi->common.fc.coef_probs [0] [1] [pt];
  343. t->skip_eob_node = 0;
  344. ++cpi->coef_counts [0] [1] [pt] [DCT_EOB_TOKEN];
  345. ++t;
  346. *tp = t;
  347. pt = 0; /* 0 <-> all coeff data is zero */
  348. *a = *l = pt;
  349. }
  350. static __inline
  351. void stuff1st_order_buv
  352. (
  353. TOKENEXTRA **tp,
  354. ENTROPY_CONTEXT *a,
  355. ENTROPY_CONTEXT *l,
  356. VP8_COMP *cpi
  357. )
  358. {
  359. int pt; /* near block/prev token context index */
  360. TOKENEXTRA *t = *tp; /* store tokens starting here */
  361. VP8_COMBINEENTROPYCONTEXTS(pt, *a, *l);
  362. t->Token = DCT_EOB_TOKEN;
  363. t->context_tree = cpi->common.fc.coef_probs [2] [0] [pt];
  364. t->skip_eob_node = 0;
  365. ++cpi->coef_counts[2] [0] [pt] [DCT_EOB_TOKEN];
  366. ++t;
  367. *tp = t;
  368. pt = 0; /* 0 <-> all coeff data is zero */
  369. *a = *l = pt;
  370. }
  371. void vp8_stuff_mb(VP8_COMP *cpi, MACROBLOCKD *x, TOKENEXTRA **t)
  372. {
  373. ENTROPY_CONTEXT * A = (ENTROPY_CONTEXT *)x->above_context;
  374. ENTROPY_CONTEXT * L = (ENTROPY_CONTEXT *)x->left_context;
  375. int plane_type;
  376. int b;
  377. stuff2nd_order_b(t,
  378. A + vp8_block2above[24], L + vp8_block2left[24], cpi);
  379. plane_type = 0;
  380. for (b = 0; b < 16; b++)
  381. stuff1st_order_b(t,
  382. A + vp8_block2above[b],
  383. L + vp8_block2left[b], cpi);
  384. for (b = 16; b < 24; b++)
  385. stuff1st_order_buv(t,
  386. A + vp8_block2above[b],
  387. L + vp8_block2left[b], cpi);
  388. }
  389. void vp8_fix_contexts(MACROBLOCKD *x)
  390. {
  391. /* Clear entropy contexts for Y2 blocks */
  392. if (x->mode_info_context->mbmi.mode != B_PRED && x->mode_info_context->mbmi.mode != SPLITMV)
  393. {
  394. vpx_memset(x->above_context, 0, sizeof(ENTROPY_CONTEXT_PLANES));
  395. vpx_memset(x->left_context, 0, sizeof(ENTROPY_CONTEXT_PLANES));
  396. }
  397. else
  398. {
  399. vpx_memset(x->above_context, 0, sizeof(ENTROPY_CONTEXT_PLANES)-1);
  400. vpx_memset(x->left_context, 0, sizeof(ENTROPY_CONTEXT_PLANES)-1);
  401. }
  402. }