Home
last modified time | relevance | path

Searched refs:cost (Results 1 - 25 of 166) sorted by relevance

1234567

/foundation/communication/ipc/ipc/native/test/unittest/common/
H A Dipc_payload_statistics_unittest.cpp195 IPCPayloadCost cost = IPCPayloadStatistics::GetDescriptorCodeCost(PID, u"string1", CODE); in HWTEST_F() local
196 EXPECT_EQ(cost.totalCost, 0); in HWTEST_F()
197 EXPECT_EQ(cost.maxCost, 0); in HWTEST_F()
198 EXPECT_EQ(cost.minCost, 0); in HWTEST_F()
199 EXPECT_EQ(cost.averCost, 0); in HWTEST_F()
209 IPCPayloadCost cost = IPCPayloadStatistics::GetDescriptorCodeCost(INVALID_PID, u"string1", CODE); in HWTEST_F() local
210 EXPECT_EQ(cost.totalCost, 0); in HWTEST_F()
211 EXPECT_EQ(cost.maxCost, 0); in HWTEST_F()
212 EXPECT_EQ(cost.minCost, 0); in HWTEST_F()
213 EXPECT_EQ(cost in HWTEST_F()
223 IPCPayloadCost cost = IPCPayloadStatistics::GetDescriptorCodeCost(PID, u"", CODE); HWTEST_F() local
237 IPCPayloadCost cost = IPCPayloadStatistics::GetDescriptorCodeCost(PID, u"string1", INVALID_CODE); HWTEST_F() local
[all...]
H A Dipc_payload_statistics_impl_unittest.cpp316 IPCPayloadCost cost = instance.GetDescriptorCodeCost(PID_1, u"string1", DESC_CODE_1); in HWTEST_F() local
317 EXPECT_EQ(cost.totalCost, 0); in HWTEST_F()
318 EXPECT_EQ(cost.maxCost, 0); in HWTEST_F()
319 EXPECT_EQ(cost.minCost, 0); in HWTEST_F()
320 EXPECT_EQ(cost.averCost, 0); in HWTEST_F()
444 IPCPayloadCost cost = instance.GetDescriptorCodeCost(pid, interfaceInfo.desc, interfaceInfo.code); in HWTEST_F() local
445 EXPECT_EQ(cost.totalCost, currentCost); in HWTEST_F()
446 EXPECT_EQ(cost.maxCost, currentCost); in HWTEST_F()
447 EXPECT_EQ(cost.minCost, currentCost); in HWTEST_F()
448 EXPECT_EQ(cost in HWTEST_F()
493 IPCPayloadCost cost = instance.GetDescriptorCodeCost(pid, interfaceInfo.desc, interfaceInfo.code); HWTEST_F() local
542 IPCPayloadCost cost = instance.GetDescriptorCodeCost(pid, interfaceInfo.desc, interfaceInfo.code); HWTEST_F() local
[all...]
/third_party/ffmpeg/libavcodec/
H A Daaccoder_trellis.h54 float cost; ///< path cost member
76 path[0][cb].cost = run_bits+4; in codebook_trellis_rate()
83 float cost_stay_here = path[swb][0].cost; in codebook_trellis_rate()
90 path[swb+1][0].cost = cost_get_here; in codebook_trellis_rate()
94 path[swb+1][0].cost = cost_stay_here; in codebook_trellis_rate()
97 next_minbits = path[swb+1][0].cost; in codebook_trellis_rate()
100 path[swb+1][cb].cost = 61450; in codebook_trellis_rate()
112 path[swb+1][cb].cost = 61450; in codebook_trellis_rate()
120 path[swb+1][cb].cost in codebook_trellis_rate()
[all...]
/foundation/communication/ipc/ipc/native/src/core/source/
H A Dipc_payload_statistics_impl.cpp69 totalCost += iterDesc->second.cost.totalCost; in GetTotalCost()
114 uint64_t cost = 0; in GetCost() local
121 cost += iterDesc->second.cost.totalCost; in GetCost()
127 return cost; in GetCost()
165 IPCPayloadCost cost = { 0, 0, 0, 0 }; in GetDescriptorCodeCost() local
170 return cost; in GetDescriptorCodeCost()
174 return cost; in GetDescriptorCodeCost()
177 payloadInfo.cost.averCost = payloadInfo.cost in GetDescriptorCodeCost()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dexpand.c77 /* The cost of a symbol expression is lower for on-stack symbols */ in expand_symbol_expression()
413 int cost; in expand_binop() local
415 cost = expand_expression(expr->left); in expand_binop()
416 cost += expand_expression(expr->right); in expand_binop()
421 return cost + 1; in expand_binop()
428 int cost, rcost; in expand_logical() local
431 cost = expand_expression(left); in expand_logical()
473 return cost + BRANCH_COST + rcost; in expand_logical()
478 int cost; in expand_comma() local
480 cost in expand_comma()
520 int cost; expand_compare() local
547 int cost, cond_cost; expand_conditional() local
826 int cost; expand_preop() local
857 int cost = 0; expand_arguments() local
868 int cost; expand_cast() local
885 expand_symbol_call(struct expression *expr, int cost) expand_symbol_call() argument
925 int cost; expand_call() local
943 int cost = 0; expand_expression_list() local
1138 int cost = expand_statement(stmt); expand_expression() local
1248 int cost = 0; expand_asm_statement() local
1274 int cost, statements; expand_compound() local
[all...]
/third_party/skia/samplecode/
H A DSampleTiming.cpp37 double cost[H][W]; variable
49 cost[y][x] = elapsed.count();
50 min = std::min(min, cost[y][x]);
51 max = std::max(max, cost[y][x]);
61 p.setAlphaf( (cost[y][x] - min) / (max - min) );
83 cost[y][x] = elapsed.count();
84 min = std::min(min, cost[y][x]);
85 max = std::max(max, cost[y][x]);
90 p.setAlphaf( (cost[y][x] - min) / (max - min) );
/third_party/musl/Benchmark/musl/
H A Dlibc_dlopen.cpp26 explicit ScopeTime(const char *name) : cost(0), soName(name) in ScopeTime()
35 cost = (timeCurrent.tv_sec - timeStart.tv_sec) * THOUSAND + in CurrentTime()
37 printf("%s current cost %f ms.\n", soName, cost); in CurrentTime()
43 cost = (timeEnd.tv_sec - timeStart.tv_sec) * THOUSAND + in ~ScopeTime()
45 printf("dlopen %s cost %f ms.\n", soName, cost); in ~ScopeTime()
49 double cost; member in ScopeTime
/foundation/graphic/graphic_utils_lite/interfaces/innerkits/
H A Dgraphic_performance.h56 void UpdateItem(std::string name, int32_t cost, int32_t warmup) in UpdateItem() argument
70 item.minCost = (item.minCost > cost) ? cost : item.minCost; in UpdateItem()
71 item.maxCost = (item.maxCost < cost) ? cost : item.maxCost; in UpdateItem()
72 item.avgCost = item.avgCost + 1.0 * (cost - item.avgCost) / (item.times - warmup); in UpdateItem()
132 int32_t cost = (now.tv_sec - tm_.tv_sec) * 1000000 + (now.tv_usec - tm_.tv_usec); in ~PerformanceTool() local
133 Performance::GetInstance()->UpdateItem(name_, cost, warmUp_); in ~PerformanceTool()
/test/xts/acts/global_lite/i18n_lite/resource_parse_load/src/
H A Dhap_resource_test.cpp75 auto cost = CurrentTimeUsec() - start; in HWTEST_F() local
76 HILOG_DEBUG("load cost: %ld us.", cost); in HWTEST_F()
87 cost = CurrentTimeUsec() - start; in HWTEST_F()
89 HILOG_DEBUG("GetIdValues by id cost: %ld us.", cost); in HWTEST_F()
113 cost = CurrentTimeUsec() - start; in HWTEST_F()
115 HILOG_DEBUG("GetIdValues by name cost: %ld us.", cost); in HWTEST_F()
154 auto cost in HWTEST_F() local
222 auto cost = CurrentTimeUsec() - start; HWTEST_F() local
[all...]
/kernel/linux/linux-5.10/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()
[all...]
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 in nft_limit_obj_bytes_eval() local
[all...]
/third_party/skia/third_party/externals/libwebp/src/dsp/
H A Dcost_mips32.c29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_MIPS32() local
62 "addu %[cost], %[cost], %[temp1] \n\t" in GetResidualCost_MIPS32()
69 "addu %[cost], %[cost], %[temp0] \n\t" in GetResidualCost_MIPS32()
75 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg), in GetResidualCost_MIPS32()
88 cost += VP8LevelCost(t, v); in GetResidualCost_MIPS32()
93 cost += VP8BitCost(0, last_p0); in GetResidualCost_MIPS32()
96 return cost; in GetResidualCost_MIPS32()
[all...]
H A Dcost_mips_dsp_r2.c29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_MIPSdspR2() local
59 "addu %[cost], %[cost], %[temp1] \n\t" in GetResidualCost_MIPSdspR2()
65 "addu %[cost], %[cost], %[temp0] \n\t" in GetResidualCost_MIPSdspR2()
70 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg), in GetResidualCost_MIPSdspR2()
83 cost += VP8LevelCost(t, v); in GetResidualCost_MIPSdspR2()
88 cost += VP8BitCost(0, last_p0); in GetResidualCost_MIPSdspR2()
91 return cost; in GetResidualCost_MIPSdspR2()
[all...]
H A Dcost.c16 // Boolean-cost cost table
48 // Level cost tables
331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_C() local
339 cost += VP8LevelCost(t, v); in GetResidualCost_C()
346 cost += VP8LevelCost(t, v); in GetResidualCost_C()
351 cost += VP8BitCost(0, last_p0); in GetResidualCost_C()
354 return cost; in GetResidualCost_C()
H A Dcost_neon.c10 // ARM NEON version of cost functions
62 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_NEON() local
89 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost() in GetResidualCost_NEON()
97 cost += VP8LevelFixedCosts[flevel] + t[level]; in GetResidualCost_NEON()
102 cost += VP8BitCost(0, last_p0); in GetResidualCost_NEON()
105 return cost; in GetResidualCost_NEON()
H A Dcost_sse2.c10 // SSE2 version of cost functions
56 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; in GetResidualCost_SSE2() local
86 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost() in GetResidualCost_SSE2()
94 cost += VP8LevelFixedCosts[flevel] + t[level]; in GetResidualCost_SSE2()
99 cost += VP8BitCost(0, last_p0); in GetResidualCost_SSE2()
102 return cost; in GetResidualCost_SSE2()
/kernel/linux/linux-6.6/net/netfilter/
H A Dxt_limit.c34 `credit_cap'. The `peak rate' becomes the cost of passing the
35 test, `cost'.
39 discarded. Every time the match passes, you lose `cost' credits;
72 if ((READ_ONCE(priv->credit) < r->cost) && (READ_ONCE(priv->prev) == jiffies)) in limit_mt()
83 if (new_credit >= r->cost) { in limit_mt()
85 new_credit -= r->cost; in limit_mt()
128 if (r->cost == 0) { in limit_mt_check()
130 r->cost = user2credits(r->avg); in limit_mt_check()
150 u_int32_t credit_cap, cost; member
166 .cost in limit_mt_compat_from_user()
[all...]
H A Dnft_limit.c32 static inline bool nft_limit_eval(struct nft_limit_priv *priv, u64 cost) in nft_limit_eval() argument
44 delta = tokens - cost; in nft_limit_eval()
174 u64 cost; member
183 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
206 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
231 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone()
253 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
255 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
334 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
385 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); nft_limit_obj_bytes_eval() local
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Denergy_model.h18 * @cost: The cost coefficient associated with this level, used during
25 unsigned long cost; member
34 * but a lower or equal power cost. Such inefficient states are ignored when
104 * which would reduce big value stored in the 'cost' field, then multiply by
106 * e.g. power ~1.3 Watt at max freq, so the 'cost' value > 1mln micro-Watts.
108 * could be 4096, then multiplication: 'cost' * 'sum_util' would overflow.
115 #define em_estimate_energy(cost, sum_util, scale_cpu) \
116 (((cost) * (sum_util)) / (scale_cpu))
118 #define em_estimate_energy(cost, sum_uti
[all...]
/foundation/bundlemanager/ecological_rule_manager/interfaces/innerkits/src/
H A Decological_rule_mgr_service_client.cpp115 int64_t cost = GetCurrentTimeMicro() - start; in QueryFreeInstallExperience() local
116 LOG_DEBUG("[ERMS-DFX] QueryFreeInstallExperience interface cost %{public}" PRId64 " mirco seconds.", cost); in QueryFreeInstallExperience()
130 int64_t cost = GetCurrentTimeMicro() - start; in EvaluateResolveInfos() local
131 LOG_DEBUG("[ERMS-DFX] EvaluateResolveInfos interface cost %{public}" PRId64 " mirco seconds.", cost); in EvaluateResolveInfos()
152 int64_t cost = GetCurrentTimeMicro() - start; in QueryStartExperience() local
153 LOG_DEBUG("[ERMS-DFX] QueryStartExperience interface cost %{public}" PRId64 " mirco seconds.", cost); in QueryStartExperience()
172 int64_t cost in IsSupportPublishForm() local
[all...]
/kernel/linux/linux-6.6/kernel/power/
H A Denergy_model.c45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
157 /* Compute the cost of each performance state. */ in em_create_perf_table()
160 unsigned long power_res, cost; in em_create_perf_table() local
163 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_create_perf_table()
164 if (ret || !cost || cost > EM_MAX_POWER) { in em_create_perf_table()
165 dev_err(dev, "EM: invalid cost %lu %d\n", in em_create_perf_table()
166 cost, ret); in em_create_perf_table()
171 cost in em_create_perf_table()
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_shader.h59 unsigned cost; member
61 ra_edge(value *a, value *b, unsigned cost) : a(a), b(b), cost(cost) {} in ra_edge()
104 unsigned cost; member
107 ra_chunk() : values(), flags(), cost(), pin() {} in ra_chunk()
126 ra_constraint(constraint_kind kind) : kind(kind), cost(0) {} in ra_constraint()
130 unsigned cost; member in r600_sb::ra_constraint
145 return t1->cost > t2->cost; in operator ()()
[all...]
H A Dsb_ra_coalesce.cpp44 void coalescer::add_edge(value* a, value* b, unsigned cost) { in add_edge() argument
46 edges.insert(new ra_edge(a,b, cost)); in add_edge()
107 c1->cost += c2->cost + e->cost; in unify_chunks()
154 c1->cost += e->cost; in build_chunks()
176 sblog << " cost = " << e->cost << "\n"; in dump_edges()
202 sblog << " ra_chunk cost in dump_chunk()
255 unsigned cost = 0; build_constraint_queue() local
[all...]
/third_party/astc-encoder/Test/
H A Dastc_profile_valgrind.py56 cost = float(match.group(1).replace(",", ""))
64 totalCost += cost
69 functionTable[index][1] += cost
70 functionTable[index][2] += cost
74 functionTable.append([function, cost, cost])
76 # Sort the table by accumulated cost
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dbackward_references_cost_enc.c10 // Improves a given set of backward references by analyzing its bit cost.
124 float prev_cost, float* const cost, uint16_t* const dist_array) { in AddSingleLiteralWithCostModel()
137 if (cost[idx] > cost_val) { in AddSingleLiteralWithCostModel()
138 cost[idx] = (float)cost_val; in AddSingleLiteralWithCostModel()
150 // the cost for the MAX_LENGTH following pixels computed. Those following pixels
151 // at index index_ + k (k from 0 to MAX_LENGTH) have a cost of:
152 // cost_ = distance cost at index + GetLengthCost(cost_model, k)
156 // minimal values using intervals of constant cost.
275 // With the current cost model, we usually have below 20 intervals. in CostManagerInit()
276 // The worst case scenario with a cost mode in CostManagerInit()
121 AddSingleLiteralWithCostModel( const uint32_t* const argb, VP8LColorCache* const hashers, const CostModel* const cost_model, int idx, int use_color_cache, float prev_cost, float* const cost, uint16_t* const dist_array) AddSingleLiteralWithCostModel() argument
321 UpdateCost(CostManager* const manager, int i, int position, float cost) UpdateCost() argument
334 UpdateCostPerInterval(CostManager* const manager, int start, int end, int position, float cost) UpdateCostPerInterval() argument
419 InsertInterval(CostManager* const manager, CostInterval* const interval_in, float cost, int position, int start, int end) InsertInterval() argument
495 const float cost = (float)(distance_cost + cost_cache_intervals[i].cost_); PushInterval() local
[all...]

Completed in 14 milliseconds

1234567