Home
last modified time | relevance | path

Searched refs:cost (Results 1 – 25 of 381) sorted by relevance

12345678910>>...16

/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.h59 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)))
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
98 struct mult_cost cost; member
123 struct mult_cost cost; member
153 int cost[2][NUM_MODE_IPV_INT]; member
272 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
340 set_zero_cost (bool speed, int cost) in set_zero_cost() argument
[all …]
H A Dtree-vectorizer.h1384 unsigned cost = targetm.vectorize.add_stmt_cost (data, count, kind,
1388 cost, where);
1389 return cost;
1412 stmt_info_for_cost *cost;
1414 FOR_EACH_VEC_ELT (*cost_vec, i, cost)
1415 add_stmt_cost (data, cost->count, cost->kind, cost->stmt_info,
1416 cost->misalign, cost->where);
/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.h59 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)))
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
98 struct mult_cost cost; member
123 struct mult_cost cost; member
153 int cost[2][NUM_MODE_IPV_INT]; member
272 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
340 set_zero_cost (bool speed, int cost) in set_zero_cost() argument
[all …]
H A Dtree-vectorizer.h1384 unsigned cost = targetm.vectorize.add_stmt_cost (data, count, kind,
1388 cost, where);
1389 return cost;
1412 stmt_info_for_cost *cost;
1414 FOR_EACH_VEC_ELT (*cost_vec, i, cost)
1415 add_stmt_cost (data, cost->count, cost->kind, cost->stmt_info,
1416 cost->misalign, cost->where);
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/location/maps/
H A Dqcache3q_p.h118 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()
243 node->cost = costs[i]; in deserializeQueue()
[all …]
H A Dqgeofiletilecache.cpp486 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()
539 int cost = 1; in addToTextureCache() local
[all …]
/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/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/kernel/net/netfilter/
H A Dxt_limit.c76 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 …]
H A Dxt_hashlimit.c103 u_int64_t cost; member
596 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
601 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
712 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
733 u64 cost; in hashlimit_mt_common() local
760 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
761 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
774 cost = hashlimit_byte_cost(skb->len, dh); in hashlimit_mt_common()
776 cost = dh->rateinfo.cost; in hashlimit_mt_common()
778 if (dh->rateinfo.credit >= cost) { in hashlimit_mt_common()
[all …]
/OK3568_Linux_fs/kernel/net/bridge/netfilter/
H A Debt_limit.c46 if (info->credit >= info->cost) { in ebt_limit_mt()
48 info->credit -= info->cost; in ebt_limit_mt()
85 info->cost = user2credits(info->avg); in ebt_limit_mt_check()
98 compat_uint_t credit, credit_cap, cost; member
/OK3568_Linux_fs/u-boot/lib/bzip2/
H A Dbzlib_compress.c297 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
397 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
424 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
425 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
426 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
432 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
442 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
/OK3568_Linux_fs/kernel/block/
H A Dblk-iocost.c716 static u64 cost_to_abs_cost(u64 cost, u32 hw_inuse) in cost_to_abs_cost() argument
718 return DIV64_U64_ROUND_UP(cost * hw_inuse, WEIGHT_ONE); in cost_to_abs_cost()
722 u64 abs_cost, u64 cost) in iocg_commit_bio() argument
726 bio->bi_iocost_cost = cost; in iocg_commit_bio()
727 atomic64_add(cost, &iocg->vtime); in iocg_commit_bio()
1389 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1391 ctx->vbudget -= cost; in iocg_wake_fn()
1396 iocg_commit_bio(ctx->iocg, wait->bio, wait->abs_cost, cost); in iocg_wake_fn()
2419 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2423 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
/OK3568_Linux_fs/kernel/drivers/gpu/arm/mali400/mali/common/
H A Dmali_pm.c1164 static void mali_pm_stat_from_mask(u32 mask, u32 *num_pp, u32 *cost) in mali_pm_stat_from_mask() argument
1176 *cost += MALI_GP_COST; in mali_pm_stat_from_mask()
1197 *cost += MALI_PP_COST; in mali_pm_stat_from_mask()
1211 *cost += MALI_PP_COST; in mali_pm_stat_from_mask()
1216 *cost += MALI_L2_COST; in mali_pm_stat_from_mask()
1239 u32 num_pp, cost, mask; in mali_pm_power_cost_setup() local
1277 cost = 0; in mali_pm_power_cost_setup()
1279 mali_pm_stat_from_mask(mask, &num_pp, &cost); in mali_pm_power_cost_setup()
1283 if (best_cost[i] >= cost) { in mali_pm_power_cost_setup()
1284 best_cost[i] = cost; in mali_pm_power_cost_setup()
/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/kernel/drivers/soc/rockchip/
H A Drockchip_performance.c53 target_cost = em->table[0].cost + (em->table[0].cost >> 2); in update_perf_level_locked()
56 if (em->table[i].cost >= target_cost) in update_perf_level_locked()
/OK3568_Linux_fs/kernel/kernel/power/
H A Denergy_model.c44 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
162 table[i].cost = div64_u64(fmax * power_res, in em_create_perf_table()
164 if (table[i].cost >= prev_cost) { in em_create_perf_table()
168 prev_cost = table[i].cost; in em_create_perf_table()
/OK3568_Linux_fs/external/xserver/exa/
H A Dexa_offscreen.c94 unsigned cost, best_cost; in exaFindAreaToEvict() local
100 cost = 0; in exaFindAreaToEvict()
118 cost = 0; in exaFindAreaToEvict()
124 cost += end->eviction_cost; in exaFindAreaToEvict()
129 if (avail >= real_size && cost < best_cost) { in exaFindAreaToEvict()
131 best_cost = cost; in exaFindAreaToEvict()
135 cost -= begin->eviction_cost; in exaFindAreaToEvict()
/OK3568_Linux_fs/kernel/include/linux/
H A Denergy_model.h25 unsigned long cost; member
191 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
/OK3568_Linux_fs/kernel/kernel/bpf/
H A Dqueue_stack_maps.c72 u64 size, queue_size, cost; in queue_stack_map_alloc() local
75 cost = queue_size = sizeof(*qs) + size * attr->value_size; in queue_stack_map_alloc()
77 ret = bpf_map_charge_init(&mem, cost); in queue_stack_map_alloc()

12345678910>>...16