| /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/libvpx/libvpx/vp9/encoder/ |
| vp9_treewriter.c | 13 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
23 costs[-ii] = cc;
25 cost(costs, tree, probs, ii, cc);
29 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
30 cost(costs, tree, probs, 0, 0);
33 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
36 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
37 cost(costs, tree, probs, 2, 0);
|
| vp9_treewriter.h | 84 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
85 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| vp9_boolhuff.h | 32 // Variables used to track bit costs without outputing to the bitstream
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 59 Vector costs; member in class:PBQP::Graph::NodeEntry
63 NodeEntry() : costs(0, 0) {}
65 NodeEntry(const Vector &costs) : costs(costs), degree(0) {}
66 Vector& getCosts() { return costs; }
67 const Vector& getCosts() const { return costs; }
87 Matrix costs; member in class:PBQP::Graph::EdgeEntry
90 EdgeEntry() : costs(0, 0, 0) {}
92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
[all...] |
| HeuristicBase.h | 31 /// costs on the given edge.
201 /// \brief Prepare a change in the costs on the given edge.
207 /// \brief Handle the change in the costs on the given edge.
|
| /external/libvpx/libvpx/vp8/encoder/ |
| treewriter.h | 116 /* Fill array of costs for all possible token values. */
119 int *Costs, const vp8_prob *, vp8_tree
123 int *Costs, const vp8_prob *, vp8_tree, int
|
| boolhuff.h | 35 /* Variables used to track bit costs without outputing to the bitstream */
|
| /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 | 83 /* Operations on costs. A cost pointer of 0 means zero cost.
87 /* Set costs of event set to 0 */
91 /* Set costs of an event set to zero */
|
| Makefile.am | 20 costs.h \
39 costs.c \
|
| /packages/apps/UnifiedEmail/src/com/android/bitmap/ |
| AltBitmapCache.java | 24 * nothing can be returned. This is useful if you know you will incur high costs upon receiving
25 * nothing from the pool, and you do not want to incur those costs at the critical moment when the
|
| /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/chromium_org/third_party/skia/include/core/ |
| SkTileGridPicture.h | 19 * and playback costs, but is less effective at eliminating extraneous
|
| /external/libpng/ |
| TODO | 17 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/skia/include/core/ |
| SkTileGridPicture.h | 19 * and playback costs, but is less effective at eliminating extraneous
|
| /external/linux-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:
|
| /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);
|
| /external/chromium_org/third_party/libwebp/enc/ |
| cost.h | 40 // Mode costs
|
| /external/webp/src/enc/ |
| cost.h | 40 // Mode costs
|
| /frameworks/base/core/res/res/layout/ |
| app_permission_item_money.xml | 18 Defines the layout of a single permission item that costs money.
|
| /external/chromium_org/third_party/icu/source/common/ |
| dictbe.h | 201 * TrieWordDictionary with costs associated with each word and
223 * engine is deleted. The TrieWordDictionary must contain costs for each word
|
| /external/llvm/include/llvm/Analysis/ |
| TargetTransformInfo.h | 80 /// costs. The costs are returned as an unsigned rather than a member of this
83 /// into the enum. Moreover, it is common to sum or average costs which works
86 /// Note that these costs should usually reflect the intersection of code-size
189 /// and execution-speed costs. This would allow modelling the core of this
|
| /external/valgrind/main/callgrind/docs/ |
| cl-format.xml | 155 <function>main</function> is 820, which is the sum of self cost 20 and costs
236 <para>If a Callgrind data file should hold costs for each assembler instruction
309 to specify an additional event type "Sum", which is calculated by adding costs
352 <screen>CostLine := SubPositionList Costs?</screen>
355 <screen>Costs := (Number Space+)+</screen>
470 <para><computeroutput>summary: costs</computeroutput> [Callgrind]</para>
471 <para><computeroutput>totals: costs</computeroutput> [Cachegrind]</para>
|
