| /external/libvpx/libvpx/vp8/encoder/ |
| treewriter.c | 13 static void cost(int *const C, vp8_tree T, const vp8_prob *const P, int i, function
24 cost(C, T, P, j, d);
29 cost(c, t, p, 0, 0);
32 cost(c, t, p, start, 0);
|
| /bionic/libc/kernel/uapi/linux/netfilter/ |
| xt_limit.h | 29 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /bionic/libc/kernel/uapi/linux/netfilter_bridge/ |
| ebt_limit.h | 29 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /external/brotli/c/enc/ |
| backward_references_hq.h | 51 pass |cost| it used to store the goal function. When node is processed its
52 |cost| is invalidated in favor of |shortcut|. On path back-tracing pass
55 /* Smallest cost to get to this byte from the beginning, as found so far. */
56 float cost; member in union:ZopfliNode::__anon14414
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
|
| /external/iptables/include/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/uapi/linux/netfilter/ |
| xt_limit.h | 21 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
| ebt_limit.h | 22 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, function
52 cost(costs, tree, probs, ii, cc);
57 cost(costs, tree, probs, 0, 0);
64 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 23 // The factor to scale from cost in bits to cost in vp9_prob_cost units.
39 int cost = 0; local
44 cost += vp9_cost_bit(probs[i >> 1], bit);
48 return cost;
|
| vp9_tokenize.h | 60 const int16_t *cost; member in struct:__anon26275
|
| /external/tensorflow/tensorflow/core/kernels/ |
| svd_op_impl.h | 71 double cost = 12 * std::max(m, n) * std::min(m, n) * std::min(m, n); variable
72 return cost >= static_cast<double>(kint64max) ? kint64max
73 : static_cast<int64>(cost);
|
| linalg_ops_common.h | 94 // Returns the cost per matrix operation. This is used to determine the
96 // batch mode. Cost per unit is assumed to be roughly 1ns, based on comments
103 double cost = std::max(m, n) * std::min(m, n) * std::min(m, n); local
104 return cost >= static_cast<double>(kint64max) ? kint64max
105 : static_cast<int64>(cost);
124 // parallelized. The number of threads used is determined by a cost model from
|
| matrix_solve_ls_op_impl.h | 66 double cost = std::max(m, n) * std::min(m, n) * (std::min(m, n) + num_rhss); variable
67 return cost >= static_cast<double>(kint64max) ? kint64max
68 : static_cast<int64>(cost);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node_utils.cpp | 67 * Computes the combined bigram / unigram cost for the given dicNode.
83 const float cost = static_cast<float>(MAX_PROBABILITY - wordAttributes.getProbability()) local
85 return cost;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /external/clang/utils/ |
| CmpDriver | 41 def cost(a, b): function in function:insertMinimumPadding
52 current = cost(a, b)
56 candidate = cost(a_0, b)
|
| /external/libnl/python/netlink/route/links/ |
| bridge.py | 66 def cost(self): member in class:BRIDGELink
72 @cost.setter
73 def cost(self, cost): member in class:BRIDGELink
75 if cost < 0 or cost >= 2**32:
77 capi.rtnl_link_bridge_set_cost(self._link, int(cost))
|
| /external/webrtc/webrtc/test/ |
| common_unittest.cc | 64 virtual int cost(int x) const { function in struct:webrtc::__anon44469::Algo1_CostFunction
72 virtual int cost(int x) const { function in struct:webrtc::__anon44469::SqrCost
80 EXPECT_EQ(25, config.Get<Algo1_CostFunction>().cost(5));
|
| /external/clang/test/CodeGenCXX/ |
| array-operator-delete-call.cpp | 22 struct COST
24 S *cost; member in struct:COST
28 ~COST();
29 COST();
33 COST::COST()
35 cost = new S[3];
40 COST::~COST()
42 if (cost) {
[all...] |
| /external/webp/src/dsp/ |
| cost.c | 16 // Boolean-cost cost table
48 // Level cost tables
331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
339 cost += VP8LevelCost(t, v);
346 cost += VP8LevelCost(t, v);
351 cost += VP8BitCost(0, last_p0);
354 return cost;
|
| /test/suite_harness/common/host-side/tradefed/src/com/android/compatibility/common/tradefed/util/ |
| LinearPartition.java | 104 float cost = Math.max(table[x][j - 1], table[i][0] - table[x][0]); local
105 if (table[i][j] > cost) {
106 table[i][j] = cost;
|
| /external/eigen/bench/ |
| benchCholesky.cpp | 34 double cost = 0; local
38 cost += 2*(r*j+r+j);
82 << "(" << 1e-9 * cost*repeats/timerNoSqrt.best() << " GFLOPS)\t"
84 << "(" << 1e-9 * cost*repeats/timerSqrt.best() << " GFLOPS)\n";
|
| /external/iproute2/ip/ |
| iplink_bridge_slave.c | 28 " [ cost COST ]\n"
124 "cost",
125 "cost %d ",
263 __u32 cost; local
278 } else if (matches(*argv, "cost") == 0) {
280 if (get_u32(&cost, *argv, 0))
281 invarg("cost is invalid", *argv);
282 addattr32(n, 1024, IFLA_BRPORT_COST, cost);
|
| /external/tensorflow/tensorflow/contrib/image/kernels/ |
| segmentation_ops.cc | 101 int cost = (union_find.block_height() + union_find.block_width()) * 20; local
103 num_images * num_blocks_vertically * num_blocks_horizontally, cost,
|
