Home
last modified time | relevance | path

Searched full:cost (Results 1 – 25 of 993) sorted by relevance

12345678910>>...40

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/lib/gconv/
H A Dgconv-modules28 # cost: optional cost of the transformation. Default is 1.
206 # from to module cost
222 # from to module cost
238 # from to module cost
252 # from to module cost
266 # from to module cost
281 # from to module cost
298 # from to module cost
317 # from to module cost
332 # from to module cost
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/lib64/gconv/
H A Dgconv-modules28 # cost: optional cost of the transformation. Default is 1.
206 # from to module cost
222 # from to module cost
238 # from to module cost
252 # from to module cost
266 # from to module cost
281 # from to module cost
298 # from to module cost
317 # from to module cost
332 # from to module cost
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dexpmed.h47 /* This structure holds the "cost" of a multiply sequence. The
48 "cost" field holds the total rtx_cost of every operator in the
49 synthetic multiplication sequence, hence cost(a op b) is defined
50 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
72 lower "cost". If "cost"s are tied, the lower latency is cheaper. */
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
[all …]
H A Dtree-inline.h190 /* Cost per call. */
193 /* Cost per indirect call. */
196 /* Cost per call to a target specific builtin */
199 /* Cost of "expensive" div and mod operations. */
202 /* Cost for omp construct. */
205 /* Cost for tm transaction. */
208 /* Cost of return. */
212 cost of a switch statement is logarithmic rather than linear in number
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dexpmed.h47 /* This structure holds the "cost" of a multiply sequence. The
48 "cost" field holds the total rtx_cost of every operator in the
49 synthetic multiplication sequence, hence cost(a op b) is defined
50 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
72 lower "cost". If "cost"s are tied, the lower latency is cheaper. */
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
[all …]
H A Dtree-inline.h190 /* Cost per call. */
193 /* Cost per indirect call. */
196 /* Cost per call to a target specific builtin */
199 /* Cost of "expensive" div and mod operations. */
202 /* Cost for omp construct. */
205 /* Cost for tm transaction. */
208 /* Cost of return. */
212 cost of a switch statement is logarithmic rather than linear in number
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/location/maps/
H A Dqcache3q_p.h102 * * maxCost = maximum total cost for the whole cache
118 inline explicit Node() : q(0), n(0), p(0), pop(0), cost(0) {} in Node()
126 int cost; variable
132 inline explicit Queue() : f(0), l(0), cost(0), pop(0), size(0) {} in Queue()
136 int cost; // total cost of nodes on the queue variable
157 inline int totalCost() const { return q1_->cost + q2_->cost + q3_->cost; } in totalCost()
160 bool insert(const Key &key, QSharedPointer<T> object, int cost = 1);
197 qDebug("q1: cost=%d, size=%d, pop=%llu", q1_->cost, q1_->size, q1_->pop); in printStats()
198 qDebug("q2: cost=%d, size=%d, pop=%llu", q2_->cost, q2_->size, q2_->pop); in printStats()
199 qDebug("q3: cost=%d, size=%d, pop=%llu", q3_->cost, q3_->size, q3_->pop); in printStats()
[all …]
H A Dqgeofiletilecache.cpp144 …extureUsage(30); // byte size of texture is >> compressed image, hence unitary cost should be lower in init()
486 int cost = 1; in addToDiskCache() local
489 cost = fi.size(); in addToDiskCache()
491 diskCache_.insert(spec, td, cost); in addToDiskCache()
502 int cost = 1; in addToDiskCache() local
504 cost = bytes.size(); in addToDiskCache()
506 if (diskCache_.insert(spec, td, cost)) { in addToDiskCache()
527 int cost = 1; in addToMemoryCache() local
529 cost = bytes.size(); in addToMemoryCache()
530 memoryCache_.insert(spec, tm, cost); in addToMemoryCache()
[all …]
/OK3568_Linux_fs/kernel/arch/arm64/boot/dts/rockchip/
H A Drk3399-sched-energy.dtsi10 busy-cost-data = <
19 idle-cost-data = <
28 busy-cost-data = <
39 idle-cost-data = <
48 busy-cost-data = <
57 idle-cost-data = <
66 busy-cost-data = <
77 idle-cost-data = <
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dautotuned_index.h225 void evaluate_kmeans(CostData& cost) in evaluate_kmeans() argument
232 get_param<int>(cost.params,"iterations"), in evaluate_kmeans()
233 get_param<int>(cost.params,"branching")); in evaluate_kmeans()
234 KMeansIndex<Distance> kmeans(sampledDataset_, cost.params, distance_); in evaluate_kmeans()
245 cost.memoryCost = (kmeans.usedMemory() + datasetMemory) / datasetMemory; in evaluate_kmeans()
246 cost.searchTimeCost = searchTime; in evaluate_kmeans()
247 cost.buildTimeCost = buildTime; in evaluate_kmeans()
252 void evaluate_kdtree(CostData& cost) in evaluate_kdtree() argument
258 Logger::info("KDTree using params: trees=%d\n", get_param<int>(cost.params,"trees")); in evaluate_kdtree()
259 KDTreeIndex<Distance> kdtree(sampledDataset_, cost.params, distance_); in evaluate_kdtree()
[all …]
/OK3568_Linux_fs/kernel/net/netfilter/
H A Dxt_limit.c36 `credit_cap'. The `peak rate' becomes the cost of passing the
37 test, `cost'.
41 discarded. Every time the match passes, you lose `cost' credits;
76 if (priv->credit >= r->cost) { in limit_mt()
78 priv->credit -= r->cost; in limit_mt()
121 if (r->cost == 0) { in limit_mt_check()
123 r->cost = user2credits(r->avg); in limit_mt_check()
144 u_int32_t credit_cap, cost; member
160 .cost = cm->cost, in limit_mt_compat_from_user()
174 .cost = m->cost, in limit_mt_compat_to_user()
H A Dnft_limit.c28 static inline bool nft_limit_eval(struct nft_limit *limit, u64 cost) in nft_limit_eval() argument
40 delta = tokens - cost; in nft_limit_eval()
126 u64 cost; member
135 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
158 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
183 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
185 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
245 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
260 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
287 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/config/arm/
H A Daarch-common-protos.h46 /* RTX cost table definitions. These are used when tuning for speed rather
47 than for size and should reflect the _additional_ cost over the cost
67 const int non_exec; /* Extra cost when not executing insn. */
69 cost. */
75 const int flag_setting; /* Additional cost if multiply sets flags. */
82 /* Calculations of LDM costs are complex. We assume an initial cost
85 ldm_regs_per_insn_subsequent registers cost one more insn.
95 const int load_sign_extend; /* Additional to load cost. */
96 const int ldrd; /* Cost of LDRD. */
H A Darm-protos.h259 /* Vectorizer cost model implementation. */
261 const int scalar_stmt_cost; /* Cost of any scalar operation, excluding
263 const int scalar_load_cost; /* Cost of scalar load. */
264 const int scalar_store_cost; /* Cost of scalar store. */
265 const int vec_stmt_cost; /* Cost of any vector operation, excluding
268 const int vec_to_scalar_cost; /* Cost of vect-to-scalar operation. */
269 const int scalar_to_vec_cost; /* Cost of scalar-to-vector operation. */
270 const int vec_align_load_cost; /* Cost of aligned vector load. */
271 const int vec_unalign_load_cost; /* Cost of unaligned vector load. */
272 const int vec_unalign_store_cost; /* Cost of unaligned vector load. */
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/config/arm/
H A Daarch-common-protos.h46 /* RTX cost table definitions. These are used when tuning for speed rather
47 than for size and should reflect the _additional_ cost over the cost
67 const int non_exec; /* Extra cost when not executing insn. */
69 cost. */
75 const int flag_setting; /* Additional cost if multiply sets flags. */
82 /* Calculations of LDM costs are complex. We assume an initial cost
85 ldm_regs_per_insn_subsequent registers cost one more insn.
95 const int load_sign_extend; /* Additional to load cost. */
96 const int ldrd; /* Cost of LDRD. */
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/config/aarch64/
H A Daarch64-protos.h159 cost models and vectors for address cost calculations, register
162 /* Scaled addressing modes can vary cost depending on the mode of the
174 /* Additional cost for addresses. */
186 /* Additional costs for register copies. Cost is for one register. */
195 /* Cost for vector insn classes. */
198 const int scalar_int_stmt_cost; /* Cost of any int scalar operation,
200 const int scalar_fp_stmt_cost; /* Cost of any fp scalar operation,
202 const int scalar_load_cost; /* Cost of scalar load. */
203 const int scalar_store_cost; /* Cost of scalar store. */
204 const int vec_int_stmt_cost; /* Cost of any int vector operation,
[all …]
/OK3568_Linux_fs/external/mpp/mpp/hal/rkenc/h264e/
H A Dhal_h264e_vepu541_reg.h596 * Offset of (RDO) chroma cost weight table
599 /* Offset of (RDO) chroma cost weight table, values from 0 to 6. */
610 /* Data0 in chroma cost weight table. */
613 /* Low 9 bits of data1 in chroma cost weight table. */
623 /* High 9 bits of data1 in chroma cost weight table. */
626 /* Data2 in chroma cost weight table. */
636 /* Data3 in chroma cost weight table. */
639 /* Low 9 bits of data4 in chroma cost weight table. */
649 /* High 9 bits of data4 in chroma cost weight table. */
652 /* Data5 in chroma cost weight table. */
[all …]
H A Dhal_h264e_vepu541_reg_l2.h102 * Weights of the cost for H.264 LUMA 8x8 intra prediction
109 * Weights of the cost for H.264 LUMA 4x4 intra prediction
116 * Weights of the cost for H.264 LUMA 16x16 intra prediction
123 * Weights of the cost for H.264 CHROMA 8x8 intra prediction
171 * Weights of 16x16 cost for H.264 anti ringing noise.
186 * Weights of 8x8 cost for H.264 anti ringing noise.
201 * Weights of 4x4 cost for H.264 anti ringing noise.
335 * Weight of SATD cost when QP is 0~51 for HEVC intra prediction.
389 * RME MVD(motion vector difference) cost penalty, H.264 only.
392 /* MVD cost penalty enable. */
[all …]
/OK3568_Linux_fs/kernel/block/
H A Dblk-iocost.c3 * IO cost model based controller.
10 * observable cost metric. This is distinguished from CPU and memory where
22 * While there is no cost metric we can trivially observe, it isn't a
23 * complete mystery. For example, on a rotational device, seek cost
30 * 1. IO Cost Model
32 * IO cost model estimates the cost of an IO given its basic parameters and
33 * history (e.g. the end sector of the last IO). The cost is measured in
34 * device time. If a given IO is estimated to cost 10ms, the device should
37 * Currently, there's only one builtin cost model - linear. Each IO is
38 * classified as sequential or random and given a base cost accordingly.
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/location/doc/src/plugins/
H A Dmapbox.qdoc105 \li The cost strategy to use to cache map tiles on disk.
114 The default size of this cache is 6000 if \b unitary is used as cost strategy,
115 or 50 MiB, if \b bytesize is used as cost strategy.
120 \li The cost strategy to use to cache map tiles in memory.
129 The Default size of this cache is 100 if \b unitary is used as cost strategy, or
130 3 MiB, if \b bytesize is used as cost strategy.
133 \li The cost strategy to use to cache decompressed map tiles in memory.
142 The Default size of this cache is 30 if \b unitary is used as cost strategy, or
143 6 MiB, if \b bytesize is used as cost strategy.
H A Desri.qdoc100 \li The cost strategy to use to cache map tiles on disk.
108 …Disk cache size for map tiles. The default size of the cache is 50 MiB when \b bytesize is the cost
109 strategy for this cache, or 1000 tiles, when \b unitary is the cost strategy.
112 \li The cost strategy to use to cache map tiles in memory.
120 …emory cache size for map tiles. The default size of the cache is 3 MiB when \b bytesize is the cost
121 strategy for this cache, or 100 tiles, when \b unitary is the cost strategy.
124 \li The cost strategy to use to cache decompressed map tiles in memory.
132 …xture cache size for map tiles. The default size of the cache is 6 MiB when \b bytesize is the cost
133 strategy for this cache, or 30 tiles, when \b unitary is the cost strategy.
H A Dnokia.qdoc101 \li The cost strategy to use to cache map tiles on disk.
109 …Disk cache size for map tiles. The default size of the cache is 50 MiB when \b bytesize is the cost
110 strategy for this cache, or 1000 tiles, when \b unitary is the cost strategy.
113 \li The cost strategy to use to cache map tiles in memory.
121 …emory cache size for map tiles. The default size of the cache is 3 MiB when \b bytesize is the cost
122 strategy for this cache, or 100 tiles, when \b unitary is the cost strategy.
125 \li The cost strategy to use to cache decompressed map tiles in memory.
133 …xture cache size for map tiles. The default size of the cache is 6 MiB when \b bytesize is the cost
134 strategy for this cache, or 30 tiles, when \b unitary is the cost strategy.
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852bs/phl/hal_g6/mac/mac_ax/
H A Dhci_fc.c396 2, /*CH 0-11 pre-cost */
397 40, /*H2C pre-cost */
398 0, /* WP CH 0-7 pre-cost */
399 0, /* WP CH 8-11 pre-cost */
407 2, /*CH 0-11 pre-cost */
408 40, /*H2C pre-cost */
409 0, /* WP CH 0-7 pre-cost */
410 0, /* WP CH 8-11 pre-cost */
418 1, /*CH 0-11 pre-cost */
419 40, /*H2C pre-cost */
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852be/phl/hal_g6/mac/mac_ax/
H A Dhci_fc.c396 2, /*CH 0-11 pre-cost */
397 40, /*H2C pre-cost */
398 0, /* WP CH 0-7 pre-cost */
399 0, /* WP CH 8-11 pre-cost */
407 2, /*CH 0-11 pre-cost */
408 40, /*H2C pre-cost */
409 0, /* WP CH 0-7 pre-cost */
410 0, /* WP CH 8-11 pre-cost */
418 1, /*CH 0-11 pre-cost */
419 40, /*H2C pre-cost */
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Denergy_model.h19 * @cost: The cost coefficient associated with this level, used during
25 unsigned long cost; member
180 * as 'ps->cost'. in em_cpu_energy()
183 * share the same 'ps->cost', and the same CPU capacity. Hence, the in em_cpu_energy()
187 * ps->cost * \Sum cpu_util in em_cpu_energy()
191 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()

12345678910>>...40