| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/ |
| robots.txt | 1 # There's nothing useful to index here. No need to pay the server costs for getting it crawled.
|
| /external/chromium_org/third_party/libvpx/source/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);
|
| vp9_writer.h | 30 // Variables used to track bit costs without outputing to the bitstream
|
| /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/include/llvm/CodeGen/PBQP/ |
| Graph.h | 72 NodeEntry(VectorPtr Costs) : Costs(Costs) {}
94 VectorPtr Costs;
102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
103 : Costs(Costs) {
114 Costs = nullptr;
166 MatrixPtr Costs;
353 /// \brief Add a node with the given costs
[all...] |
| ReductionRules.h | 25 /// Propagate costs from the given node, which must be of degree one, to its
150 // order and greedily compute a minimum solution based on the node costs, and
151 // the dependent costs due to previously solved nodes.
155 // costs. Given that, the backpropagate function doesn't attempt to
|
| /external/chromium_org/third_party/libvpx/source/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
|
| boolhuff.h | 39 /* Variables used to track bit costs without outputing to the bitstream */
|
| /external/libvpx/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
|
| /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/valgrind/main/callgrind/ |
| costs.h | 17 /* Array of 64bit costs. This is separated from other structs
18 * to support a dynamic number of costs for a cost item.
|
| events.h | 85 /* Operations on costs. A cost pointer of 0 means zero cost.
89 /* Set costs of event set to 0 */
93 /* Set costs of an event set to zero */
|
| Makefile.in | 78 callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.$(OBJEXT) \
91 callstack.c clo.c context.c costs.c debug.c dump.c events.c \
98 callgrind_@VGCONF_ARCH_SEC@_@VGCONF_OS@-costs.$(OBJEXT) \
649 costs.h \
659 costs.c \
814 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.Po@am__quote@
[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...] |
| /art/runtime/base/unix_file/ |
| null_file.h | 27 // conjunction with /dev/null, but that's not portable and costs a file
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Parser/ |
| innerHTML-setter-siblings.html | 9 // which avoids some of the costs in transplating nodes from the
|
| /external/libpng/ |
| TODO | 17 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| levenshtein.c | 28 * It does so by calculating the costs of the path ending in characters
32 * This implementation allows the costs to be weighted:
|
| /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/llvm/test/Analysis/CostModel/X86/ |
| scalarize.ll | 4 ; Test vector scalarization costs.
|
| /external/srec/srec/crec/ |
| srec_debug.c | 98 costdata* costs = &stoken->cost[0]; local
115 p, costs[i], costs[i] + cost_offset, word_backtrace[i], duration[i], word_backtrace_trans);
|
