2 * Copyright (c) 2014 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 "vp9/encoder/vp9_context_tree.h"
13 static const BLOCK_SIZE square[] = {
20 static void alloc_mode_context(VP9_COMMON *cm, int num_4x4_blk,
21 PICK_MODE_CONTEXT *ctx) {
22 const int num_blk = (num_4x4_blk < 4 ? 4 : num_4x4_blk);
23 const int num_pix = num_blk << 4;
25 ctx->num_4x4_blk = num_blk;
27 CHECK_MEM_ERROR(cm, ctx->zcoeff_blk,
28 vpx_calloc(num_4x4_blk, sizeof(uint8_t)));
29 for (i = 0; i < MAX_MB_PLANE; ++i) {
30 for (k = 0; k < 3; ++k) {
31 CHECK_MEM_ERROR(cm, ctx->coeff[i][k],
32 vpx_memalign(16, num_pix * sizeof(int16_t)));
33 CHECK_MEM_ERROR(cm, ctx->qcoeff[i][k],
34 vpx_memalign(16, num_pix * sizeof(int16_t)));
35 CHECK_MEM_ERROR(cm, ctx->dqcoeff[i][k],
36 vpx_memalign(16, num_pix * sizeof(int16_t)));
37 CHECK_MEM_ERROR(cm, ctx->eobs[i][k],
38 vpx_memalign(16, num_pix * sizeof(uint16_t)));
39 ctx->coeff_pbuf[i][k] = ctx->coeff[i][k];
40 ctx->qcoeff_pbuf[i][k] = ctx->qcoeff[i][k];
41 ctx->dqcoeff_pbuf[i][k] = ctx->dqcoeff[i][k];
42 ctx->eobs_pbuf[i][k] = ctx->eobs[i][k];
47 static void free_mode_context(PICK_MODE_CONTEXT *ctx) {
49 vpx_free(ctx->zcoeff_blk);
51 for (i = 0; i < MAX_MB_PLANE; ++i) {
52 for (k = 0; k < 3; ++k) {
53 vpx_free(ctx->coeff[i][k]);
55 vpx_free(ctx->qcoeff[i][k]);
56 ctx->qcoeff[i][k] = 0;
57 vpx_free(ctx->dqcoeff[i][k]);
58 ctx->dqcoeff[i][k] = 0;
59 vpx_free(ctx->eobs[i][k]);
65 static void alloc_tree_contexts(VP9_COMMON *cm, PC_TREE *tree,
67 alloc_mode_context(cm, num_4x4_blk, &tree->none);
68 alloc_mode_context(cm, num_4x4_blk/2, &tree->horizontal[0]);
69 alloc_mode_context(cm, num_4x4_blk/2, &tree->vertical[0]);
71 /* TODO(Jbb): for 4x8 and 8x4 these allocated values are not used.
72 * Figure out a better way to do this. */
73 alloc_mode_context(cm, num_4x4_blk/2, &tree->horizontal[1]);
74 alloc_mode_context(cm, num_4x4_blk/2, &tree->vertical[1]);
77 static void free_tree_contexts(PC_TREE *tree) {
78 free_mode_context(&tree->none);
79 free_mode_context(&tree->horizontal[0]);
80 free_mode_context(&tree->horizontal[1]);
81 free_mode_context(&tree->vertical[0]);
82 free_mode_context(&tree->vertical[1]);
85 // This function sets up a tree of contexts such that at each square
86 // partition level. There are contexts for none, horizontal, vertical, and
87 // split. Along with a block_size value and a selected block_size which
88 // represents the state of our search.
89 void vp9_setup_pc_tree(VP9_COMMON *cm, MACROBLOCK *x) {
91 const int leaf_nodes = 64;
92 const int tree_nodes = 64 + 16 + 4 + 1;
93 int pc_tree_index = 0;
95 PICK_MODE_CONTEXT *this_leaf;
99 vpx_free(x->leaf_tree);
100 CHECK_MEM_ERROR(cm, x->leaf_tree, vpx_calloc(leaf_nodes,
101 sizeof(*x->leaf_tree)));
102 vpx_free(x->pc_tree);
103 CHECK_MEM_ERROR(cm, x->pc_tree, vpx_calloc(tree_nodes, sizeof(*x->pc_tree)));
105 this_pc = &x->pc_tree[0];
106 this_leaf = &x->leaf_tree[0];
108 // 4x4 blocks smaller than 8x8 but in the same 8x8 block share the same
109 // context so we only need to allocate 1 for each 8x8 block.
110 for (i = 0; i < leaf_nodes; ++i)
111 alloc_mode_context(cm, 1, &x->leaf_tree[i]);
113 // Sets up all the leaf nodes in the tree.
114 for (pc_tree_index = 0; pc_tree_index < leaf_nodes; ++pc_tree_index) {
115 PC_TREE *const tree = &x->pc_tree[pc_tree_index];
116 tree->block_size = square[0];
117 alloc_tree_contexts(cm, tree, 4);
118 tree->leaf_split[0] = this_leaf++;
119 for (j = 1; j < 4; j++)
120 tree->leaf_split[j] = tree->leaf_split[0];
123 // Each node has 4 leaf nodes, fill each block_size level of the tree
124 // from leafs to the root.
125 for (nodes = 16; nodes > 0; nodes >>= 2) {
126 for (i = 0; i < nodes; ++i) {
127 PC_TREE *const tree = &x->pc_tree[pc_tree_index];
128 alloc_tree_contexts(cm, tree, 4 << (2 * square_index));
129 tree->block_size = square[square_index];
130 for (j = 0; j < 4; j++)
131 tree->split[j] = this_pc++;
136 x->pc_root = &x->pc_tree[tree_nodes - 1];
137 x->pc_root[0].none.best_mode_index = 2;
140 void vp9_free_pc_tree(MACROBLOCK *x) {
141 const int tree_nodes = 64 + 16 + 4 + 1;
144 // Set up all 4x4 mode contexts
145 for (i = 0; i < 64; ++i)
146 free_mode_context(&x->leaf_tree[i]);
148 // Sets up all the leaf nodes in the tree.
149 for (i = 0; i < tree_nodes; ++i)
150 free_tree_contexts(&x->pc_tree[i]);
152 vpx_free(x->pc_tree);
154 vpx_free(x->leaf_tree);