2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
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.
11 #include "vp8/common/header.h"
13 #include "vp8/common/entropymode.h"
14 #include "vp8/common/findnearmv.h"
16 #include "vp8/common/systemdependent.h"
20 #include "vpx/vpx_encoder.h"
21 #include "vpx_mem/vpx_mem.h"
22 #include "vpx_ports/system_state.h"
23 #include "bitstream.h"
25 #include "defaultcoefcounts.h"
26 #include "vp8/common/common.h"
28 const int vp8cx_base_skip_false_prob[128] = {
29 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
30 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
31 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
32 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 251, 248, 244, 240,
33 236, 232, 229, 225, 221, 217, 213, 208, 204, 199, 194, 190, 187, 183, 179,
34 175, 172, 168, 164, 160, 157, 153, 149, 145, 142, 138, 134, 130, 127, 124,
35 120, 117, 114, 110, 107, 104, 101, 98, 95, 92, 89, 86, 83, 80, 77,
36 74, 71, 68, 65, 62, 59, 56, 53, 50, 47, 44, 41, 38, 35, 32,
37 30, 28, 26, 24, 22, 20, 18, 16,
40 #if defined(SECTIONBITS_OUTPUT)
41 unsigned __int64 Sectionbits[500];
44 #ifdef VP8_ENTROPY_STATS
45 int intra_mode_stats[10][10][10];
46 static unsigned int tree_update_hist[BLOCK_TYPES][COEF_BANDS]
47 [PREV_COEF_CONTEXTS][ENTROPY_NODES][2];
48 extern unsigned int active_section;
52 int count_mb_seg[4] = { 0, 0, 0, 0 };
55 static void update_mode(vp8_writer *const w, int n, vp8_token tok[/* n */],
56 vp8_tree tree, vp8_prob Pnew[/* n-1 */],
57 vp8_prob Pcur[/* n-1 */],
58 unsigned int bct[/* n-1 */][2],
59 const unsigned int num_events[/* n */]) {
60 unsigned int new_b = 0, old_b = 0;
63 vp8_tree_probs_from_distribution(n--, tok, tree, Pnew, bct, num_events, 256,
67 new_b += vp8_cost_branch(bct[i], Pnew[i]);
68 old_b += vp8_cost_branch(bct[i], Pcur[i]);
71 if (new_b + (n << 8) < old_b) {
77 const vp8_prob p = Pnew[j];
79 vp8_write_literal(w, Pcur[j] = p ? p : 1, 8);
85 static void update_mbintra_mode_probs(VP8_COMP *cpi) {
86 VP8_COMMON *const x = &cpi->common;
88 vp8_writer *const w = cpi->bc;
91 vp8_prob Pnew[VP8_YMODES - 1];
92 unsigned int bct[VP8_YMODES - 1][2];
94 update_mode(w, VP8_YMODES, vp8_ymode_encodings, vp8_ymode_tree, Pnew,
95 x->fc.ymode_prob, bct, (unsigned int *)cpi->mb.ymode_count);
98 vp8_prob Pnew[VP8_UV_MODES - 1];
99 unsigned int bct[VP8_UV_MODES - 1][2];
101 update_mode(w, VP8_UV_MODES, vp8_uv_mode_encodings, vp8_uv_mode_tree, Pnew,
102 x->fc.uv_mode_prob, bct, (unsigned int *)cpi->mb.uv_mode_count);
106 static void write_ymode(vp8_writer *bc, int m, const vp8_prob *p) {
107 vp8_write_token(bc, vp8_ymode_tree, p, vp8_ymode_encodings + m);
110 static void kfwrite_ymode(vp8_writer *bc, int m, const vp8_prob *p) {
111 vp8_write_token(bc, vp8_kf_ymode_tree, p, vp8_kf_ymode_encodings + m);
114 static void write_uv_mode(vp8_writer *bc, int m, const vp8_prob *p) {
115 vp8_write_token(bc, vp8_uv_mode_tree, p, vp8_uv_mode_encodings + m);
118 static void write_bmode(vp8_writer *bc, int m, const vp8_prob *p) {
119 vp8_write_token(bc, vp8_bmode_tree, p, vp8_bmode_encodings + m);
122 static void write_split(vp8_writer *bc, int x) {
123 vp8_write_token(bc, vp8_mbsplit_tree, vp8_mbsplit_probs,
124 vp8_mbsplit_encodings + x);
127 void vp8_pack_tokens(vp8_writer *w, const TOKENEXTRA *p, int xcount) {
128 const TOKENEXTRA *stop = p + xcount;
131 int count = w->count;
132 unsigned int range = w->range;
133 unsigned int lowvalue = w->lowvalue;
136 const int t = p->Token;
137 vp8_token *a = vp8_coef_encodings + t;
138 const vp8_extra_bit_struct *b = vp8_extra_bits + t;
140 const unsigned char *pp = p->context_tree;
144 if (p->skip_eob_node) {
150 const int bb = (v >> --n) & 1;
151 split = 1 + (((range - 1) * pp[i >> 1]) >> 8);
152 i = vp8_coef_tree[i + bb];
156 range = range - split;
161 shift = vp8_norm[range];
166 int offset = shift - count;
168 if ((lowvalue << (offset - 1)) & 0x80000000) {
171 while (x >= 0 && w->buffer[x] == 0xff) {
172 w->buffer[x] = (unsigned char)0;
179 validate_buffer(w->buffer + w->pos, 1, w->buffer_end, w->error);
181 w->buffer[w->pos++] = (lowvalue >> (24 - offset));
184 lowvalue &= 0xffffff;
192 const int e = p->Extra, L = b->Len;
195 const unsigned char *proba = b->prob;
196 const int v2 = e >> 1;
197 int n2 = L; /* number of bits in v2, assumed nonzero */
201 const int bb = (v2 >> --n2) & 1;
202 split = 1 + (((range - 1) * proba[i >> 1]) >> 8);
207 range = range - split;
212 shift = vp8_norm[range];
217 int offset = shift - count;
219 if ((lowvalue << (offset - 1)) & 0x80000000) {
222 while (x >= 0 && w->buffer[x] == 0xff) {
223 w->buffer[x] = (unsigned char)0;
230 validate_buffer(w->buffer + w->pos, 1, w->buffer_end, w->error);
232 w->buffer[w->pos++] = (lowvalue >> (24 - offset));
235 lowvalue &= 0xffffff;
244 split = (range + 1) >> 1;
248 range = range - split;
255 if ((lowvalue & 0x80000000)) {
258 while (x >= 0 && w->buffer[x] == 0xff) {
259 w->buffer[x] = (unsigned char)0;
271 validate_buffer(w->buffer + w->pos, 1, w->buffer_end, w->error);
273 w->buffer[w->pos++] = (lowvalue >> 24);
274 lowvalue &= 0xffffff;
283 w->lowvalue = lowvalue;
287 static void write_partition_size(unsigned char *cx_data, int size) {
292 csize = (size >> 8) & 0xff;
293 *(cx_data + 1) = csize;
294 csize = (size >> 16) & 0xff;
295 *(cx_data + 2) = csize;
298 static void pack_tokens_into_partitions(VP8_COMP *cpi, unsigned char *cx_data,
299 unsigned char *cx_data_end,
302 unsigned char *ptr = cx_data;
303 unsigned char *ptr_end = cx_data_end;
306 for (i = 0; i < num_part; ++i) {
311 vp8_start_encode(w, ptr, ptr_end);
313 for (mb_row = i; mb_row < cpi->common.mb_rows; mb_row += num_part) {
314 const TOKENEXTRA *p = cpi->tplist[mb_row].start;
315 const TOKENEXTRA *stop = cpi->tplist[mb_row].stop;
316 int tokens = (int)(stop - p);
318 vp8_pack_tokens(w, p, tokens);
326 #if CONFIG_MULTITHREAD
327 static void pack_mb_row_tokens(VP8_COMP *cpi, vp8_writer *w) {
330 for (mb_row = 0; mb_row < cpi->common.mb_rows; ++mb_row) {
331 const TOKENEXTRA *p = cpi->tplist[mb_row].start;
332 const TOKENEXTRA *stop = cpi->tplist[mb_row].stop;
333 int tokens = (int)(stop - p);
335 vp8_pack_tokens(w, p, tokens);
338 #endif // CONFIG_MULTITHREAD
340 static void write_mv_ref(vp8_writer *w, MB_PREDICTION_MODE m,
342 assert(NEARESTMV <= m && m <= SPLITMV);
343 vp8_write_token(w, vp8_mv_ref_tree, p,
344 vp8_mv_ref_encoding_array + (m - NEARESTMV));
347 static void write_sub_mv_ref(vp8_writer *w, B_PREDICTION_MODE m,
349 assert(LEFT4X4 <= m && m <= NEW4X4);
350 vp8_write_token(w, vp8_sub_mv_ref_tree, p,
351 vp8_sub_mv_ref_encoding_array + (m - LEFT4X4));
354 static void write_mv(vp8_writer *w, const MV *mv, const int_mv *ref,
355 const MV_CONTEXT *mvc) {
357 e.row = mv->row - ref->as_mv.row;
358 e.col = mv->col - ref->as_mv.col;
360 vp8_encode_motion_vector(w, &e, mvc);
363 static void write_mb_features(vp8_writer *w, const MB_MODE_INFO *mi,
364 const MACROBLOCKD *x) {
365 /* Encode the MB segment id. */
366 if (x->segmentation_enabled && x->update_mb_segmentation_map) {
367 switch (mi->segment_id) {
369 vp8_write(w, 0, x->mb_segment_tree_probs[0]);
370 vp8_write(w, 0, x->mb_segment_tree_probs[1]);
373 vp8_write(w, 0, x->mb_segment_tree_probs[0]);
374 vp8_write(w, 1, x->mb_segment_tree_probs[1]);
377 vp8_write(w, 1, x->mb_segment_tree_probs[0]);
378 vp8_write(w, 0, x->mb_segment_tree_probs[2]);
381 vp8_write(w, 1, x->mb_segment_tree_probs[0]);
382 vp8_write(w, 1, x->mb_segment_tree_probs[2]);
385 /* TRAP.. This should not happen */
387 vp8_write(w, 0, x->mb_segment_tree_probs[0]);
388 vp8_write(w, 0, x->mb_segment_tree_probs[1]);
393 void vp8_convert_rfct_to_prob(VP8_COMP *const cpi) {
394 const int *const rfct = cpi->mb.count_mb_ref_frame_usage;
395 const int rf_intra = rfct[INTRA_FRAME];
397 rfct[LAST_FRAME] + rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME];
399 /* Calculate the probabilities used to code the ref frame based on usage */
400 if (!(cpi->prob_intra_coded = rf_intra * 255 / (rf_intra + rf_inter))) {
401 cpi->prob_intra_coded = 1;
404 cpi->prob_last_coded = rf_inter ? (rfct[LAST_FRAME] * 255) / rf_inter : 128;
406 if (!cpi->prob_last_coded) cpi->prob_last_coded = 1;
408 cpi->prob_gf_coded = (rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME])
409 ? (rfct[GOLDEN_FRAME] * 255) /
410 (rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME])
413 if (!cpi->prob_gf_coded) cpi->prob_gf_coded = 1;
416 static void pack_inter_mode_mvs(VP8_COMP *const cpi) {
417 VP8_COMMON *const pc = &cpi->common;
418 vp8_writer *const w = cpi->bc;
419 const MV_CONTEXT *mvc = pc->fc.mvc;
421 MODE_INFO *m = pc->mi;
422 const int mis = pc->mode_info_stride;
425 int prob_skip_false = 0;
427 cpi->mb.partition_info = cpi->mb.pi;
429 vp8_convert_rfct_to_prob(cpi);
431 #ifdef VP8_ENTROPY_STATS
435 if (pc->mb_no_coeff_skip) {
436 int total_mbs = pc->mb_rows * pc->mb_cols;
438 prob_skip_false = (total_mbs - cpi->mb.skip_true_count) * 256 / total_mbs;
440 if (prob_skip_false <= 1) prob_skip_false = 1;
442 if (prob_skip_false > 255) prob_skip_false = 255;
444 cpi->prob_skip_false = prob_skip_false;
445 vp8_write_literal(w, prob_skip_false, 8);
448 vp8_write_literal(w, cpi->prob_intra_coded, 8);
449 vp8_write_literal(w, cpi->prob_last_coded, 8);
450 vp8_write_literal(w, cpi->prob_gf_coded, 8);
452 update_mbintra_mode_probs(cpi);
454 vp8_write_mvprobs(cpi);
456 while (++mb_row < pc->mb_rows) {
459 while (++mb_col < pc->mb_cols) {
460 const MB_MODE_INFO *const mi = &m->mbmi;
461 const MV_REFERENCE_FRAME rf = mi->ref_frame;
462 const MB_PREDICTION_MODE mode = mi->mode;
464 MACROBLOCKD *xd = &cpi->mb.e_mbd;
466 /* Distance of Mb to the various image edges.
467 * These specified to 8th pel as they are always compared to MV
468 * values that are in 1/8th pel units
470 xd->mb_to_left_edge = -((mb_col * 16) << 3);
471 xd->mb_to_right_edge = ((pc->mb_cols - 1 - mb_col) * 16) << 3;
472 xd->mb_to_top_edge = -((mb_row * 16) << 3);
473 xd->mb_to_bottom_edge = ((pc->mb_rows - 1 - mb_row) * 16) << 3;
475 #ifdef VP8_ENTROPY_STATS
479 if (cpi->mb.e_mbd.update_mb_segmentation_map) {
480 write_mb_features(w, mi, &cpi->mb.e_mbd);
483 if (pc->mb_no_coeff_skip) {
484 vp8_encode_bool(w, m->mbmi.mb_skip_coeff, prob_skip_false);
487 if (rf == INTRA_FRAME) {
488 vp8_write(w, 0, cpi->prob_intra_coded);
489 #ifdef VP8_ENTROPY_STATS
492 write_ymode(w, mode, pc->fc.ymode_prob);
494 if (mode == B_PRED) {
498 write_bmode(w, m->bmi[j].as_mode, pc->fc.bmode_prob);
502 write_uv_mode(w, mi->uv_mode, pc->fc.uv_mode_prob);
503 } else { /* inter coded */
505 vp8_prob mv_ref_p[VP8_MVREFS - 1];
507 vp8_write(w, 1, cpi->prob_intra_coded);
509 if (rf == LAST_FRAME)
510 vp8_write(w, 0, cpi->prob_last_coded);
512 vp8_write(w, 1, cpi->prob_last_coded);
513 vp8_write(w, (rf == GOLDEN_FRAME) ? 0 : 1, cpi->prob_gf_coded);
520 vp8_find_near_mvs(xd, m, &n1, &n2, &best_mv, ct, rf,
521 cpi->common.ref_frame_sign_bias);
522 vp8_clamp_mv2(&best_mv, xd);
524 vp8_mv_ref_probs(mv_ref_p, ct);
526 #ifdef VP8_ENTROPY_STATS
527 accum_mv_refs(mode, ct);
531 #ifdef VP8_ENTROPY_STATS
535 write_mv_ref(w, mode, mv_ref_p);
537 switch (mode) /* new, split require MVs */
541 #ifdef VP8_ENTROPY_STATS
545 write_mv(w, &mi->mv.as_mv, &best_mv, mvc);
552 ++count_mb_seg[mi->partitioning];
555 write_split(w, mi->partitioning);
558 B_PREDICTION_MODE blockmode;
560 const int *const L = vp8_mbsplits[mi->partitioning];
561 int k = -1; /* first block in subset j */
563 int_mv leftmv, abovemv;
565 blockmode = cpi->mb.partition_info->bmi[j].mode;
566 blockmv = cpi->mb.partition_info->bmi[j].mv;
567 while (j != L[++k]) {
570 leftmv.as_int = left_block_mv(m, k);
571 abovemv.as_int = above_block_mv(m, k, mis);
572 mv_contz = vp8_mv_cont(&leftmv, &abovemv);
574 write_sub_mv_ref(w, blockmode, vp8_sub_mv_ref_prob2[mv_contz]);
576 if (blockmode == NEW4X4) {
577 #ifdef VP8_ENTROPY_STATS
580 write_mv(w, &blockmv.as_mv, &best_mv, (const MV_CONTEXT *)mvc);
582 } while (++j < cpi->mb.partition_info->count);
590 cpi->mb.partition_info++;
593 ++m; /* skip L prediction border */
594 cpi->mb.partition_info++;
598 static void write_kfmodes(VP8_COMP *cpi) {
599 vp8_writer *const bc = cpi->bc;
600 const VP8_COMMON *const c = &cpi->common;
602 MODE_INFO *m = c->mi;
605 int prob_skip_false = 0;
607 if (c->mb_no_coeff_skip) {
608 int total_mbs = c->mb_rows * c->mb_cols;
610 prob_skip_false = (total_mbs - cpi->mb.skip_true_count) * 256 / total_mbs;
612 if (prob_skip_false <= 1) prob_skip_false = 1;
614 if (prob_skip_false >= 255) prob_skip_false = 255;
616 cpi->prob_skip_false = prob_skip_false;
617 vp8_write_literal(bc, prob_skip_false, 8);
620 while (++mb_row < c->mb_rows) {
623 while (++mb_col < c->mb_cols) {
624 const int ym = m->mbmi.mode;
626 if (cpi->mb.e_mbd.update_mb_segmentation_map) {
627 write_mb_features(bc, &m->mbmi, &cpi->mb.e_mbd);
630 if (c->mb_no_coeff_skip) {
631 vp8_encode_bool(bc, m->mbmi.mb_skip_coeff, prob_skip_false);
634 kfwrite_ymode(bc, ym, vp8_kf_ymode_prob);
637 const int mis = c->mode_info_stride;
641 const B_PREDICTION_MODE A = above_block_mode(m, i, mis);
642 const B_PREDICTION_MODE L = left_block_mode(m, i);
643 const int bm = m->bmi[i].as_mode;
645 #ifdef VP8_ENTROPY_STATS
646 ++intra_mode_stats[A][L][bm];
649 write_bmode(bc, bm, vp8_kf_bmode_prob[A][L]);
653 write_uv_mode(bc, (m++)->mbmi.uv_mode, vp8_kf_uv_mode_prob);
656 m++; /* skip L prediction border */
661 /* This function is used for debugging probability trees. */
662 static void print_prob_tree(vp8_prob
663 coef_probs[BLOCK_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS][ENTROPY_NODES])
665 /* print coef probability tree */
667 FILE* f = fopen("enc_tree_probs.txt", "a");
669 for (i = 0; i < BLOCK_TYPES; ++i)
672 for (j = 0; j < COEF_BANDS; ++j)
675 for (k = 0; k < PREV_COEF_CONTEXTS; ++k)
678 for (l = 0; l < ENTROPY_NODES; ++l)
681 (unsigned int)(coef_probs [i][j][k][l]));
694 static void sum_probs_over_prev_coef_context(
695 const unsigned int probs[PREV_COEF_CONTEXTS][MAX_ENTROPY_TOKENS],
698 for (i = 0; i < MAX_ENTROPY_TOKENS; ++i) {
699 for (j = 0; j < PREV_COEF_CONTEXTS; ++j) {
700 const unsigned int tmp = out[i];
701 out[i] += probs[j][i];
703 if (out[i] < tmp) out[i] = UINT_MAX;
708 static int prob_update_savings(const unsigned int *ct, const vp8_prob oldp,
709 const vp8_prob newp, const vp8_prob upd) {
710 const int old_b = vp8_cost_branch(ct, oldp);
711 const int new_b = vp8_cost_branch(ct, newp);
712 const int update_b = 8 + ((vp8_cost_one(upd) - vp8_cost_zero(upd)) >> 8);
714 return old_b - new_b - update_b;
717 static int independent_coef_context_savings(VP8_COMP *cpi) {
718 MACROBLOCK *const x = &cpi->mb;
725 unsigned int prev_coef_count_sum[MAX_ENTROPY_TOKENS] = { 0 };
726 int prev_coef_savings[MAX_ENTROPY_TOKENS] = { 0 };
727 const unsigned int(*probs)[MAX_ENTROPY_TOKENS];
728 /* Calculate new probabilities given the constraint that
729 * they must be equal over the prev coef contexts
732 probs = (const unsigned int(*)[MAX_ENTROPY_TOKENS])x->coef_counts[i][j];
734 /* Reset to default probabilities at key frames */
735 if (cpi->common.frame_type == KEY_FRAME) {
736 probs = default_coef_counts[i][j];
739 sum_probs_over_prev_coef_context(probs, prev_coef_count_sum);
742 /* at every context */
744 /* calc probs and branch cts for this frame only */
745 int t = 0; /* token/prob index */
747 vp8_tree_probs_from_distribution(
748 MAX_ENTROPY_TOKENS, vp8_coef_encodings, vp8_coef_tree,
749 cpi->frame_coef_probs[i][j][k], cpi->frame_branch_ct[i][j][k],
750 prev_coef_count_sum, 256, 1);
753 const unsigned int *ct = cpi->frame_branch_ct[i][j][k][t];
754 const vp8_prob newp = cpi->frame_coef_probs[i][j][k][t];
755 const vp8_prob oldp = cpi->common.fc.coef_probs[i][j][k][t];
756 const vp8_prob upd = vp8_coef_update_probs[i][j][k][t];
757 const int s = prob_update_savings(ct, oldp, newp, upd);
759 if (cpi->common.frame_type != KEY_FRAME ||
760 (cpi->common.frame_type == KEY_FRAME && newp != oldp)) {
761 prev_coef_savings[t] += s;
763 } while (++t < ENTROPY_NODES);
764 } while (++k < PREV_COEF_CONTEXTS);
767 /* We only update probabilities if we can save bits, except
768 * for key frames where we have to update all probabilities
769 * to get the equal probabilities across the prev coef
772 if (prev_coef_savings[k] > 0 || cpi->common.frame_type == KEY_FRAME) {
773 savings += prev_coef_savings[k];
775 } while (++k < ENTROPY_NODES);
776 } while (++j < COEF_BANDS);
777 } while (++i < BLOCK_TYPES);
781 static int default_coef_context_savings(VP8_COMP *cpi) {
782 MACROBLOCK *const x = &cpi->mb;
790 /* at every context */
792 /* calc probs and branch cts for this frame only */
793 int t = 0; /* token/prob index */
795 vp8_tree_probs_from_distribution(
796 MAX_ENTROPY_TOKENS, vp8_coef_encodings, vp8_coef_tree,
797 cpi->frame_coef_probs[i][j][k], cpi->frame_branch_ct[i][j][k],
798 x->coef_counts[i][j][k], 256, 1);
801 const unsigned int *ct = cpi->frame_branch_ct[i][j][k][t];
802 const vp8_prob newp = cpi->frame_coef_probs[i][j][k][t];
803 const vp8_prob oldp = cpi->common.fc.coef_probs[i][j][k][t];
804 const vp8_prob upd = vp8_coef_update_probs[i][j][k][t];
805 const int s = prob_update_savings(ct, oldp, newp, upd);
810 } while (++t < ENTROPY_NODES);
811 } while (++k < PREV_COEF_CONTEXTS);
812 } while (++j < COEF_BANDS);
813 } while (++i < BLOCK_TYPES);
817 void vp8_calc_ref_frame_costs(int *ref_frame_cost, int prob_intra,
818 int prob_last, int prob_garf) {
819 assert(prob_intra >= 0);
820 assert(prob_intra <= 255);
821 assert(prob_last >= 0);
822 assert(prob_last <= 255);
823 assert(prob_garf >= 0);
824 assert(prob_garf <= 255);
825 ref_frame_cost[INTRA_FRAME] = vp8_cost_zero(prob_intra);
826 ref_frame_cost[LAST_FRAME] =
827 vp8_cost_one(prob_intra) + vp8_cost_zero(prob_last);
828 ref_frame_cost[GOLDEN_FRAME] = vp8_cost_one(prob_intra) +
829 vp8_cost_one(prob_last) +
830 vp8_cost_zero(prob_garf);
831 ref_frame_cost[ALTREF_FRAME] = vp8_cost_one(prob_intra) +
832 vp8_cost_one(prob_last) +
833 vp8_cost_one(prob_garf);
836 int vp8_estimate_entropy_savings(VP8_COMP *cpi) {
839 const int *const rfct = cpi->mb.count_mb_ref_frame_usage;
840 const int rf_intra = rfct[INTRA_FRAME];
842 rfct[LAST_FRAME] + rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME];
843 int new_intra, new_last, new_garf, oldtotal, newtotal;
844 int ref_frame_cost[MAX_REF_FRAMES];
846 vpx_clear_system_state();
848 if (cpi->common.frame_type != KEY_FRAME) {
849 if (!(new_intra = rf_intra * 255 / (rf_intra + rf_inter))) new_intra = 1;
851 new_last = rf_inter ? (rfct[LAST_FRAME] * 255) / rf_inter : 128;
853 new_garf = (rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME])
854 ? (rfct[GOLDEN_FRAME] * 255) /
855 (rfct[GOLDEN_FRAME] + rfct[ALTREF_FRAME])
858 vp8_calc_ref_frame_costs(ref_frame_cost, new_intra, new_last, new_garf);
860 newtotal = rfct[INTRA_FRAME] * ref_frame_cost[INTRA_FRAME] +
861 rfct[LAST_FRAME] * ref_frame_cost[LAST_FRAME] +
862 rfct[GOLDEN_FRAME] * ref_frame_cost[GOLDEN_FRAME] +
863 rfct[ALTREF_FRAME] * ref_frame_cost[ALTREF_FRAME];
866 vp8_calc_ref_frame_costs(ref_frame_cost, cpi->prob_intra_coded,
867 cpi->prob_last_coded, cpi->prob_gf_coded);
869 oldtotal = rfct[INTRA_FRAME] * ref_frame_cost[INTRA_FRAME] +
870 rfct[LAST_FRAME] * ref_frame_cost[LAST_FRAME] +
871 rfct[GOLDEN_FRAME] * ref_frame_cost[GOLDEN_FRAME] +
872 rfct[ALTREF_FRAME] * ref_frame_cost[ALTREF_FRAME];
874 savings += (oldtotal - newtotal) / 256;
877 if (cpi->oxcf.error_resilient_mode & VPX_ERROR_RESILIENT_PARTITIONS) {
878 savings += independent_coef_context_savings(cpi);
880 savings += default_coef_context_savings(cpi);
886 #if CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING
887 int vp8_update_coef_context(VP8_COMP *cpi) {
890 if (cpi->common.frame_type == KEY_FRAME) {
891 /* Reset to default counts/probabilities at key frames */
892 vp8_copy(cpi->mb.coef_counts, default_coef_counts);
895 if (cpi->oxcf.error_resilient_mode & VPX_ERROR_RESILIENT_PARTITIONS)
896 savings += independent_coef_context_savings(cpi);
898 savings += default_coef_context_savings(cpi);
904 void vp8_update_coef_probs(VP8_COMP *cpi) {
906 #if !(CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING)
907 vp8_writer *const w = cpi->bc;
911 vpx_clear_system_state();
918 int prev_coef_savings[ENTROPY_NODES] = { 0 };
919 if (cpi->oxcf.error_resilient_mode & VPX_ERROR_RESILIENT_PARTITIONS) {
920 for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
921 int t; /* token/prob index */
922 for (t = 0; t < ENTROPY_NODES; ++t) {
923 const unsigned int *ct = cpi->frame_branch_ct[i][j][k][t];
924 const vp8_prob newp = cpi->frame_coef_probs[i][j][k][t];
925 const vp8_prob oldp = cpi->common.fc.coef_probs[i][j][k][t];
926 const vp8_prob upd = vp8_coef_update_probs[i][j][k][t];
928 prev_coef_savings[t] += prob_update_savings(ct, oldp, newp, upd);
934 /* note: use result from vp8_estimate_entropy_savings, so no
935 * need to call vp8_tree_probs_from_distribution here.
938 /* at every context */
940 /* calc probs and branch cts for this frame only */
941 int t = 0; /* token/prob index */
944 const vp8_prob newp = cpi->frame_coef_probs[i][j][k][t];
946 vp8_prob *Pold = cpi->common.fc.coef_probs[i][j][k] + t;
947 const vp8_prob upd = vp8_coef_update_probs[i][j][k][t];
949 int s = prev_coef_savings[t];
952 if (!(cpi->oxcf.error_resilient_mode &
953 VPX_ERROR_RESILIENT_PARTITIONS)) {
954 s = prob_update_savings(cpi->frame_branch_ct[i][j][k][t], *Pold,
960 /* Force updates on key frames if the new is different,
961 * so that we can be sure we end up with equal probabilities
962 * over the prev coef contexts.
964 if ((cpi->oxcf.error_resilient_mode &
965 VPX_ERROR_RESILIENT_PARTITIONS) &&
966 cpi->common.frame_type == KEY_FRAME && newp != *Pold) {
970 #if CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING
971 cpi->update_probs[i][j][k][t] = u;
973 vp8_write(w, u, upd);
976 #ifdef VP8_ENTROPY_STATS
977 ++tree_update_hist[i][j][k][t][u];
981 /* send/use new probability */
984 #if !(CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING)
985 vp8_write_literal(w, newp, 8);
991 } while (++t < ENTROPY_NODES);
993 /* Accum token counts for generation of default statistics */
994 #ifdef VP8_ENTROPY_STATS
998 context_counters[i][j][k][t] += cpi->coef_counts[i][j][k][t];
999 } while (++t < MAX_ENTROPY_TOKENS);
1003 } while (++k < PREV_COEF_CONTEXTS);
1004 } while (++j < COEF_BANDS);
1005 } while (++i < BLOCK_TYPES);
1008 #if CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING
1009 static void pack_coef_probs(VP8_COMP *cpi) {
1011 vp8_writer *const w = cpi->bc;
1020 int t = 0; /* token/prob index */
1023 const vp8_prob newp = cpi->common.fc.coef_probs[i][j][k][t];
1024 const vp8_prob upd = vp8_coef_update_probs[i][j][k][t];
1026 const char u = cpi->update_probs[i][j][k][t];
1028 vp8_write(w, u, upd);
1031 /* send/use new probability */
1032 vp8_write_literal(w, newp, 8);
1034 } while (++t < ENTROPY_NODES);
1035 } while (++k < PREV_COEF_CONTEXTS);
1036 } while (++j < COEF_BANDS);
1037 } while (++i < BLOCK_TYPES);
1041 #ifdef PACKET_TESTING
1045 static void put_delta_q(vp8_writer *bc, int delta_q) {
1047 vp8_write_bit(bc, 1);
1048 vp8_write_literal(bc, abs(delta_q), 4);
1051 vp8_write_bit(bc, 1);
1053 vp8_write_bit(bc, 0);
1055 vp8_write_bit(bc, 0);
1058 void vp8_pack_bitstream(VP8_COMP *cpi, unsigned char *dest,
1059 unsigned char *dest_end, size_t *size) {
1062 VP8_COMMON *const pc = &cpi->common;
1063 vp8_writer *const bc = cpi->bc;
1064 MACROBLOCKD *const xd = &cpi->mb.e_mbd;
1065 int extra_bytes_packed = 0;
1067 unsigned char *cx_data = dest;
1068 unsigned char *cx_data_end = dest_end;
1069 const int *mb_feature_data_bits;
1071 oh.show_frame = (int)pc->show_frame;
1072 oh.type = (int)pc->frame_type;
1073 oh.version = pc->version;
1074 oh.first_partition_length_in_bytes = 0;
1076 mb_feature_data_bits = vp8_mb_feature_data_bits;
1078 bc[0].error = &pc->error;
1080 validate_buffer(cx_data, 3, cx_data_end, &cpi->common.error);
1083 #if defined(SECTIONBITS_OUTPUT)
1084 Sectionbits[active_section = 1] += sizeof(VP8_HEADER) * 8 * 256;
1087 /* every keyframe send startcode, width, height, scale factor, clamp
1090 if (oh.type == KEY_FRAME) {
1093 validate_buffer(cx_data, 7, cx_data_end, &cpi->common.error);
1095 /* Start / synch code */
1100 v = (pc->horiz_scale << 14) | pc->Width;
1102 cx_data[4] = v >> 8;
1104 v = (pc->vert_scale << 14) | pc->Height;
1106 cx_data[6] = v >> 8;
1108 extra_bytes_packed = 7;
1109 cx_data += extra_bytes_packed;
1111 vp8_start_encode(bc, cx_data, cx_data_end);
1113 /* signal clr type */
1114 vp8_write_bit(bc, 0);
1115 vp8_write_bit(bc, pc->clamp_type);
1118 vp8_start_encode(bc, cx_data, cx_data_end);
1121 /* Signal whether or not Segmentation is enabled */
1122 vp8_write_bit(bc, xd->segmentation_enabled);
1124 /* Indicate which features are enabled */
1125 if (xd->segmentation_enabled) {
1126 /* Signal whether or not the segmentation map is being updated. */
1127 vp8_write_bit(bc, xd->update_mb_segmentation_map);
1128 vp8_write_bit(bc, xd->update_mb_segmentation_data);
1130 if (xd->update_mb_segmentation_data) {
1133 vp8_write_bit(bc, xd->mb_segement_abs_delta);
1135 /* For each segmentation feature (Quant and loop filter level) */
1136 for (i = 0; i < MB_LVL_MAX; ++i) {
1137 /* For each of the segments */
1138 for (j = 0; j < MAX_MB_SEGMENTS; ++j) {
1139 Data = xd->segment_feature_data[i][j];
1141 /* Frame level data */
1143 vp8_write_bit(bc, 1);
1147 vp8_write_literal(bc, Data, mb_feature_data_bits[i]);
1148 vp8_write_bit(bc, 1);
1150 vp8_write_literal(bc, Data, mb_feature_data_bits[i]);
1151 vp8_write_bit(bc, 0);
1154 vp8_write_bit(bc, 0);
1159 if (xd->update_mb_segmentation_map) {
1160 /* Write the probs used to decode the segment id for each mb */
1161 for (i = 0; i < MB_FEATURE_TREE_PROBS; ++i) {
1162 int Data = xd->mb_segment_tree_probs[i];
1165 vp8_write_bit(bc, 1);
1166 vp8_write_literal(bc, Data, 8);
1168 vp8_write_bit(bc, 0);
1173 vp8_write_bit(bc, pc->filter_type);
1174 vp8_write_literal(bc, pc->filter_level, 6);
1175 vp8_write_literal(bc, pc->sharpness_level, 3);
1177 /* Write out loop filter deltas applied at the MB level based on mode
1178 * or ref frame (if they are enabled).
1180 vp8_write_bit(bc, xd->mode_ref_lf_delta_enabled);
1182 if (xd->mode_ref_lf_delta_enabled) {
1183 /* Do the deltas need to be updated */
1185 xd->mode_ref_lf_delta_update || cpi->oxcf.error_resilient_mode;
1187 vp8_write_bit(bc, send_update);
1192 for (i = 0; i < MAX_REF_LF_DELTAS; ++i) {
1193 Data = xd->ref_lf_deltas[i];
1195 /* Frame level data */
1196 if (xd->ref_lf_deltas[i] != xd->last_ref_lf_deltas[i] ||
1197 cpi->oxcf.error_resilient_mode) {
1198 xd->last_ref_lf_deltas[i] = xd->ref_lf_deltas[i];
1199 vp8_write_bit(bc, 1);
1202 vp8_write_literal(bc, (Data & 0x3F), 6);
1203 vp8_write_bit(bc, 0); /* sign */
1206 vp8_write_literal(bc, (Data & 0x3F), 6);
1207 vp8_write_bit(bc, 1); /* sign */
1210 vp8_write_bit(bc, 0);
1214 for (i = 0; i < MAX_MODE_LF_DELTAS; ++i) {
1215 Data = xd->mode_lf_deltas[i];
1217 if (xd->mode_lf_deltas[i] != xd->last_mode_lf_deltas[i] ||
1218 cpi->oxcf.error_resilient_mode) {
1219 xd->last_mode_lf_deltas[i] = xd->mode_lf_deltas[i];
1220 vp8_write_bit(bc, 1);
1223 vp8_write_literal(bc, (Data & 0x3F), 6);
1224 vp8_write_bit(bc, 0); /* sign */
1227 vp8_write_literal(bc, (Data & 0x3F), 6);
1228 vp8_write_bit(bc, 1); /* sign */
1231 vp8_write_bit(bc, 0);
1236 /* signal here is multi token partition is enabled */
1237 vp8_write_literal(bc, pc->multi_token_partition, 2);
1239 /* Frame Qbaseline quantizer index */
1240 vp8_write_literal(bc, pc->base_qindex, 7);
1242 /* Transmit Dc, Second order and Uv quantizer delta information */
1243 put_delta_q(bc, pc->y1dc_delta_q);
1244 put_delta_q(bc, pc->y2dc_delta_q);
1245 put_delta_q(bc, pc->y2ac_delta_q);
1246 put_delta_q(bc, pc->uvdc_delta_q);
1247 put_delta_q(bc, pc->uvac_delta_q);
1249 /* When there is a key frame all reference buffers are updated using
1252 if (pc->frame_type != KEY_FRAME) {
1253 /* Should the GF or ARF be updated using the transmitted frame
1256 vp8_write_bit(bc, pc->refresh_golden_frame);
1257 vp8_write_bit(bc, pc->refresh_alt_ref_frame);
1259 /* If not being updated from current frame should either GF or ARF
1260 * be updated from another buffer
1262 if (!pc->refresh_golden_frame)
1263 vp8_write_literal(bc, pc->copy_buffer_to_gf, 2);
1265 if (!pc->refresh_alt_ref_frame)
1266 vp8_write_literal(bc, pc->copy_buffer_to_arf, 2);
1268 /* Indicate reference frame sign bias for Golden and ARF frames
1269 * (always 0 for last frame buffer)
1271 vp8_write_bit(bc, pc->ref_frame_sign_bias[GOLDEN_FRAME]);
1272 vp8_write_bit(bc, pc->ref_frame_sign_bias[ALTREF_FRAME]);
1275 #if !(CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING)
1276 if (cpi->oxcf.error_resilient_mode & VPX_ERROR_RESILIENT_PARTITIONS) {
1277 if (pc->frame_type == KEY_FRAME) {
1278 pc->refresh_entropy_probs = 1;
1280 pc->refresh_entropy_probs = 0;
1285 vp8_write_bit(bc, pc->refresh_entropy_probs);
1287 if (pc->frame_type != KEY_FRAME) vp8_write_bit(bc, pc->refresh_last_frame);
1289 #ifdef VP8_ENTROPY_STATS
1291 if (pc->frame_type == INTER_FRAME)
1298 vpx_clear_system_state();
1300 #if CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING
1301 pack_coef_probs(cpi);
1303 if (pc->refresh_entropy_probs == 0) {
1304 /* save a copy for later refresh */
1305 memcpy(&cpi->common.lfc, &cpi->common.fc, sizeof(cpi->common.fc));
1308 vp8_update_coef_probs(cpi);
1311 #ifdef VP8_ENTROPY_STATS
1315 /* Write out the mb_no_coeff_skip flag */
1316 vp8_write_bit(bc, pc->mb_no_coeff_skip);
1318 if (pc->frame_type == KEY_FRAME) {
1321 #ifdef VP8_ENTROPY_STATS
1325 pack_inter_mode_mvs(cpi);
1327 #ifdef VP8_ENTROPY_STATS
1332 vp8_stop_encode(bc);
1336 oh.first_partition_length_in_bytes = cpi->bc->pos;
1338 /* update frame tag */
1340 int v = (oh.first_partition_length_in_bytes << 5) | (oh.show_frame << 4) |
1341 (oh.version << 1) | oh.type;
1348 *size = VP8_HEADER_SIZE + extra_bytes_packed + cpi->bc->pos;
1350 cpi->partition_sz[0] = (unsigned int)*size;
1352 #if CONFIG_REALTIME_ONLY & CONFIG_ONTHEFLY_BITPACKING
1354 const int num_part = (1 << pc->multi_token_partition);
1355 unsigned char *dp = cpi->partition_d[0] + cpi->partition_sz[0];
1358 /* write token part sizes (all but last) if more than 1 */
1359 validate_buffer(dp, 3 * (num_part - 1), cpi->partition_d_end[0],
1362 cpi->partition_sz[0] += 3 * (num_part - 1);
1364 for (i = 1; i < num_part; ++i) {
1365 write_partition_size(dp, cpi->partition_sz[i]);
1370 if (!cpi->output_partition) {
1371 /* concatenate partition buffers */
1372 for (i = 0; i < num_part; ++i) {
1373 memmove(dp, cpi->partition_d[i + 1], cpi->partition_sz[i + 1]);
1374 cpi->partition_d[i + 1] = dp;
1375 dp += cpi->partition_sz[i + 1];
1379 /* update total size */
1381 for (i = 0; i < num_part + 1; ++i) {
1382 *size += cpi->partition_sz[i];
1386 if (pc->multi_token_partition != ONE_PARTITION) {
1387 int num_part = 1 << pc->multi_token_partition;
1389 /* partition size table at the end of first partition */
1390 cpi->partition_sz[0] += 3 * (num_part - 1);
1391 *size += 3 * (num_part - 1);
1393 validate_buffer(cx_data, 3 * (num_part - 1), cx_data_end, &pc->error);
1395 for (i = 1; i < num_part + 1; ++i) {
1396 cpi->bc[i].error = &pc->error;
1399 pack_tokens_into_partitions(cpi, cx_data + 3 * (num_part - 1), cx_data_end,
1402 for (i = 1; i < num_part; ++i) {
1403 cpi->partition_sz[i] = cpi->bc[i].pos;
1404 write_partition_size(cx_data, cpi->partition_sz[i]);
1406 *size += cpi->partition_sz[i]; /* add to total */
1409 /* add last partition to total size */
1410 cpi->partition_sz[i] = cpi->bc[i].pos;
1411 *size += cpi->partition_sz[i];
1413 bc[1].error = &pc->error;
1415 vp8_start_encode(&cpi->bc[1], cx_data, cx_data_end);
1417 #if CONFIG_MULTITHREAD
1418 if (vpx_atomic_load_acquire(&cpi->b_multi_threaded)) {
1419 pack_mb_row_tokens(cpi, &cpi->bc[1]);
1421 vp8_pack_tokens(&cpi->bc[1], cpi->tok, cpi->tok_count);
1424 vp8_pack_tokens(&cpi->bc[1], cpi->tok, cpi->tok_count);
1425 #endif // CONFIG_MULTITHREAD
1427 vp8_stop_encode(&cpi->bc[1]);
1429 *size += cpi->bc[1].pos;
1430 cpi->partition_sz[1] = cpi->bc[1].pos;
1435 #ifdef VP8_ENTROPY_STATS
1436 void print_tree_update_probs() {
1438 FILE *f = fopen("context.c", "a");
1440 fprintf(f, "\n/* Update probabilities for token entropy tree. */\n\n");
1442 "const vp8_prob tree_update_probs[BLOCK_TYPES] [COEF_BANDS] "
1443 "[PREV_COEF_CONTEXTS] [ENTROPY_NODES] = {\n");
1445 for (i = 0; i < BLOCK_TYPES; ++i) {
1446 fprintf(f, " { \n");
1448 for (j = 0; j < COEF_BANDS; ++j) {
1451 for (k = 0; k < PREV_COEF_CONTEXTS; ++k) {
1454 for (l = 0; l < ENTROPY_NODES; ++l) {
1456 tree_update_hist[i][j][k][l][0] + tree_update_hist[i][j][k][l][1];
1459 if (((tree_update_hist[i][j][k][l][0] * 255) / Sum) > 0)
1460 fprintf(f, "%3ld, ",
1461 (tree_update_hist[i][j][k][l][0] * 255) / Sum);
1463 fprintf(f, "%3ld, ", 1);
1465 fprintf(f, "%3ld, ", 128);
1471 fprintf(f, " },\n");
1474 fprintf(f, " },\n");