Home
last modified time | relevance | path

Searched refs:UNCONSTRAINED_NODES (Results 1 – 8 of 8) sorted by relevance

/external/libvpx/libvpx/vp9/common/
Dvp9_entropy.h143 #define UNCONSTRAINED_NODES 3 macro
147 #define MODEL_NODES (ENTROPY_NODES - UNCONSTRAINED_NODES)
152 [COEFF_CONTEXTS][UNCONSTRAINED_NODES];
156 [UNCONSTRAINED_NODES + 1];
Dvp9_entropy.c752 memcpy(full, model, sizeof(vpx_prob) * UNCONSTRAINED_NODES); in vp9_model_to_full_probs()
753 extend_to_full_distribution(&full[UNCONSTRAINED_NODES], model[PIVOT_NODE]); in vp9_model_to_full_probs()
789 const unsigned int branch_ct[UNCONSTRAINED_NODES][2] = { in adapt_coef_probs()
794 for (m = 0; m < UNCONSTRAINED_NODES; ++m) in adapt_coef_probs()
Dvp9_thread_common.c344 for (n = 0; n < UNCONSTRAINED_NODES + 1; n++) in vp9_accumulate_frame_counts()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_subexp.c149 memcpy(newplist, oldp, sizeof(vpx_prob) * UNCONSTRAINED_NODES); in vp9_prob_diff_update_savings_search_model()
150 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model()
164 for (i = UNCONSTRAINED_NODES, new_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model()
182 for (i = UNCONSTRAINED_NODES, new_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model()
Dvp9_tokenize.c487 vpx_prob (*const coef_probs)[COEFF_CONTEXTS][UNCONSTRAINED_NODES] = in tokenize_b()
Dvp9_bitstream.c162 int len = UNCONSTRAINED_NODES - p->skip_eob_node; in pack_mb_tokens()
520 for (m = 0; m < UNCONSTRAINED_NODES; ++m) in build_tree_distribution()
536 const int entropy_nodes_update = UNCONSTRAINED_NODES; in update_coef_probs_common()
/external/libvpx/libvpx/vp9/decoder/
Dvp9_detokenize.c58 const vpx_prob (*coef_probs)[COEFF_CONTEXTS][UNCONSTRAINED_NODES] = in decode_coefs()
61 unsigned int (*coef_counts)[COEFF_CONTEXTS][UNCONSTRAINED_NODES + 1]; in decode_coefs()
Dvp9_decodeframe.c1041 for (m = 0; m < UNCONSTRAINED_NODES; ++m) in read_coef_probs_common()