| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
47 costs[-ii] = cc;
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
47 costs[-ii] = cc;
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 185 // costs.
191 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1,
198 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
200 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0;
203 G.addEdge(node1, node2, std::move(costs));
213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
223 if (costs[i + 1][j + 1] !=
225 costs[i + 1][j + 1] > sameParityMax)
226 sameParityMax = costs[i + 1][j + 1];
234 if (sameParityMax > costs[i + 1][j + 1]
[all...] |
| /external/zopfli/src/zopfli/ |
| squeeze.c | 215 float* costs; local
229 costs = (float*)malloc(sizeof(float) * (blocksize + 1));
230 if (!costs) exit(-1); /* Allocation failed. */
238 for (i = 1; i < blocksize + 1; i++) costs[i] = ZOPFLI_LARGE_FLOAT;
239 costs[0] = 0; /* Because it's the start. */
243 size_t j = i - instart; /* Index in the costs array and length_array. */
259 costs[j + ZOPFLI_MAX_MATCH] = costs[j] + symbolcost;
273 double newCost = costs[j] + costmodel(in[i], 0, costcontext);
275 if (newCost < costs[j + 1])
[all...] |
| /external/webp/src/enc/ |
| quant.c | 528 const uint16_t* costs; // shortcut to cost tables member in struct:__anon21235
556 const CostArray* const costs = enc->proba_.level_cost_[coeff_type]; local
593 ss_cur[m].costs = costs[VP8EncBands[first]][ctx0];
627 ss_cur[m].costs = costs[band][ctx];
653 const score_t cost = VP8LevelCost(ss_prev[p].costs, level);
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/neon/ |
| variance_neon.asm | 76 ;vmov.32 r0, d0[0] ;this instruction costs a lot
|
| /external/v8/src/ |
| object-observe.js | 32 // Note that in order to reduce allocation and processing costs, the
|
| /external/valgrind/ |
| Android.mk | 407 callgrind/costs.c \
|
| /external/valgrind/callgrind/ |
| callgrind_annotate.in | 214 --inclusive=yes|no add subroutine costs to functions calls [no]
565 # inclusive costs
[all...] |
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_subpel_variance.asm | 1043 ; a byte costs 1 pack and 2 unpacks, but saves a register.
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/x86/ |
| vp9_subpel_variance.asm | 1043 ; a byte costs 1 pack and 2 unpacks, but saves a register.
[all...] |
