Searched refs:costs (Results 1 – 11 of 11) sorted by relevance
24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPSdspR2() local25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPSdspR2()34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPSdspR2()
326 CostArrayPtr const costs = res->costs; in GetResidualCost_C() local327 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_C()340 t = costs[n + 1][ctx]; in GetResidualCost_C()
24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPS32() local25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPS32()34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPS32()
51 CostArrayPtr const costs = res->costs; in GetResidualCost_SSE2() local52 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_SSE2()87 t = costs[n + 1][ctx]; in GetResidualCost_SSE2()
57 CostArrayPtr const costs = res->costs; in GetResidualCost_NEON() local58 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_NEON()90 t = costs[n + 1][ctx]; in GetResidualCost_NEON()
36 CostArrayPtr costs; member
567 const uint16_t* costs; // shortcut to cost tables member594 CostArrayPtr const costs = in TrellisQuantizeBlock() local632 ss_cur[m].costs = costs[first][ctx0]; in TrellisQuantizeBlock()668 ss_cur[m].costs = costs[n + 1][ctx]; in TrellisQuantizeBlock()688 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock()
211 res->costs = enc->proba_.remapped_costs_[coeff_type]; in VP8InitResidual()
15 (e.g., counting huffman bits/precompression; filter inertia; filter costs).
594 choice costs only a small amount of memory and has several benefits:
937 therefore costs a good deal of space and time. The default is2170 switchover costs.
Completed in 18 milliseconds