| /external/libxml2/optim/ |
| hash_dict.txt | 2 costs. Not worth it unless validating big DTDs
|
| /external/llvm/lib/Analysis/ |
| TargetTransformInfo.cpp | 52 assert(Cost >= 0 && "TTI should not produce negative costs!");
58 assert(Cost >= 0 && "TTI should not produce negative costs!");
65 assert(Cost >= 0 && "TTI should not produce negative costs!");
72 assert(Cost >= 0 && "TTI should not produce negative costs!");
78 assert(Cost >= 0 && "TTI should not produce negative costs!");
139 assert(Cost >= 0 && "TTI should not produce negative costs!");
186 assert(Cost >= 0 && "TTI should not produce negative costs!");
192 assert(Cost >= 0 && "TTI should not produce negative costs!");
199 assert(Cost >= 0 && "TTI should not produce negative costs!");
206 assert(Cost >= 0 && "TTI should not produce negative costs!");
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs,
48 costs[-ii] = cc;
50 cost(costs, tree, probs, ii, cc);
54 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) {
55 cost(costs, tree, probs, 0, 0);
58 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) {
61 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
62 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 48 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_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/include/llvm/CodeGen/PBQP/ |
| Graph.h | 75 NodeEntry(VectorPtr Costs) : Costs(Costs) {}
97 VectorPtr Costs;
105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
106 : Costs(Costs) {
117 Costs = nullptr;
169 MatrixPtr Costs;
378 /// @brief Add a node with the given costs
[all...] |
| ReductionRules.h | 26 /// Propagate costs from the given node, which must be of degree one, to its
158 // costs, then ... there is no available register.
170 // order and greedily compute a minimum solution based on the node costs, and
171 // the dependent costs due to previously solved nodes.
175 // costs. Given that, the backpropagate function doesn't attempt to
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| autotuned_index.h | 322 void optimizeKMeans(std::vector<CostData>& costs)
331 costs.reserve(costs.size() + kmeansParamSpaceSize);
343 costs.push_back(cost);
370 void optimizeKDTree(std::vector<CostData>& costs)
383 costs.push_back(cost);
413 std::vector<CostData> costs; local
446 costs.push_back(linear_cost);
451 optimizeKMeans(costs);
452 optimizeKDTree(costs);
[all...] |
| /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/libvpx/libvpx/vp8/encoder/ |
| treewriter.h | 121 /* Fill array of costs for all possible token values. */
124 int *Costs, const vp8_prob *, vp8_tree
128 int *Costs, const vp8_prob *, vp8_tree, int
|
| /external/valgrind/callgrind/ |
| costs.h | 2 /*--- Callgrind cost array interface. costs.h ---*/
41 /* Array of 64bit costs. This is separated from other structs
42 * to support a dynamic number of costs for a cost item.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| treewriter.h | 120 /* Fill array of costs for all possible token values. */
123 int *Costs, const vp8_prob *, vp8_tree
127 int *Costs, const vp8_prob *, vp8_tree, int
|
| /external/chromium-trace/catapult/perf_insights/perf_insights/ui/reports/ |
| v8_report.html | 89 <div id="script-costs">
90 Script costs
91 <tr-ui-b-table id="script-costs-table"></tr-ui-b-table>
94 <div id="costs-histogram-container">
96 <select id="costs-histogram-cost-type"></select> values:
97 <tr-v-ui-histogram-span id="costs-histogram"></tr-v-ui-histogram-span>
214 this.shadowRoot.querySelector('#script-costs').style.display = 'none';
217 this.shadowRoot.querySelector('#script-costs').style.display = '';
235 '#script-costs-table');
361 var histogram = this.shadowRoot.querySelector('#costs-histogram')
[all...] |
| /external/skia/src/core/ |
| SkRecords.cpp | 23 #if 0 // Disabled to see if we ever really race on this. It costs time, chromium:496982.
|
| /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/ |
| cost.h | 36 CostArrayPtr costs; member in struct:VP8Residual
57 // Mode costs
|
| /external/autotest/test_suites/ |
| control.sanity | 21 restricted because of the potential performance costs.
|
| /external/libpng/ |
| TODO | 18 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/webp/src/dsp/ |
| cost_mips_dsp_r2.c | 24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
|
| cost_sse2.c | 51 CostArrayPtr const costs = res->costs; local
52 const uint16_t* t = costs[n][ctx0];
87 t = costs[n + 1][ctx];
|
| cost_mips32.c | 24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
|
| /frameworks/opt/bitmap/src/com/android/bitmap/ |
| UnrefedBitmapCache.java | 27 * nothing can be returned. This is useful if you know you will incur high costs upon receiving
28 * nothing from the pool, and you do not want to incur those costs at the critical moment when the
|
| /external/autotest/client/site_tests/platform_FileNum/ |
| platform_FileNum.py | 31 _TEST_TEXT = 'ChromeOS rocks with fast response and low maintenance costs!'
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| scalarize.ll | 4 ; Test vector scalarization costs.
|
