Home
last modified time | relevance | path

Searched refs:score (Results 1 - 25 of 248) sorted by relevance

12345678910

/third_party/ffmpeg/libavformat/
H A Dformat.c59 int score_max, score; in av_guess_format() local
72 score = 0; in av_guess_format()
74 score += 100; in av_guess_format()
76 score += 10; in av_guess_format()
79 score += 5; in av_guess_format()
81 if (score > score_max) { in av_guess_format()
82 score_max = score; in av_guess_format()
136 int score, score_max = 0; in av_probe_input_format3() local
167 score = 0; in av_probe_input_format3()
169 score in av_probe_input_format3()
223 int score = 0; av_probe_input_format() local
234 int score = 0; av_probe_input_buffer2() local
[all...]
/foundation/resourceschedule/memmgr/test/unittest/phone/
H A Dreclaim_strategy_manager_test.cpp68 int score = 100; in HWTEST_F() local
69 std::shared_ptr<ReclaimParam> para = std::make_shared<ReclaimParam>(pid, appId, appName, userId, score, in HWTEST_F()
82 int score = 100; in HWTEST_F() local
83 std::shared_ptr<ReclaimParam> para = std::make_shared<ReclaimParam>(pid, appId, appName, userId, score, in HWTEST_F()
102 int score = 100; in HWTEST_F() local
103 ReclaimStrategyManager::GetInstance().NotifyAccountPriorityChanged(userId, score); in HWTEST_F()
107 std::shared_ptr<ReclaimParam> para = std::make_shared<ReclaimParam>(pid, appId, appName, userId, score, in HWTEST_F()
114 ReclaimStrategyManager::GetInstance().NotifyAccountPriorityChanged(userId, score + score); in HWTEST_F()
116 EXPECT_EQ(memcg->score_, score in HWTEST_F()
133 int score = 100; HWTEST_F() local
157 int score = RECLAIM_SCORE_MIN - 1; HWTEST_F() local
181 int score = 100; HWTEST_F() local
198 int score = 100; HWTEST_F() local
215 int score = 100; HWTEST_F() local
[all...]
H A Duser_memcg_test.cpp82 int score = 0; in HWTEST_F() local
83 memcg->SetScore(score); in HWTEST_F()
84 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
85 score = -1; in HWTEST_F()
86 memcg->SetScore(score); in HWTEST_F()
87 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
88 score = 2000; in HWTEST_F()
89 memcg->SetScore(score); in HWTEST_F()
90 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
183 int score in HWTEST_F() local
[all...]
H A Dmemcg_test.cpp78 int score = 0; in HWTEST_F() local
79 memcg->SetScore(score); in HWTEST_F()
80 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
81 score = -1; in HWTEST_F()
82 memcg->SetScore(score); in HWTEST_F()
83 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
84 score = 2000; in HWTEST_F()
85 memcg->SetScore(score); in HWTEST_F()
86 EXPECT_EQ(memcg->score_, score); in HWTEST_F()
139 int score in HWTEST_F() local
[all...]
/foundation/communication/wifi/wifi/services/wifi_standard/wifi_framework/wifi_manage/wifi_sta/
H A Dsta_saved_device_appraisal.cpp66 int score = 0; in DeviceAppraisals() local
67 AppraiseDeviceQuality(score, scanInfo, device, info, device.connFailedCount >= MAX_RETRY_COUNT); in DeviceAppraisals()
68 WIFI_LOGD("The device networkId:%{public}d ssid:%{public}s score:%{public}d rssi:%{public}d.", in DeviceAppraisals()
69 device.networkId, SsidAnonymize(scanInfo.ssid).c_str(), score, scanInfo.rssi); in DeviceAppraisals()
70 if (CheckHigherPriority(score, highestScore, scanInfo.rssi, scanInfoElected.rssi)) { in DeviceAppraisals()
71 highestScore = score; in DeviceAppraisals()
120 void StaSavedDeviceAppraisal::AppraiseDeviceQuality(int &score, InterScanInfo &scanInfo, in AppraiseDeviceQuality() argument
127 /* Signal strength score */ in AppraiseDeviceQuality()
128 score += signalBaseScore + signalStrength * signalScorePerLevel; in AppraiseDeviceQuality()
129 WIFI_LOGD("signalstrength score i in AppraiseDeviceQuality()
217 CheckHigherPriority(int score, int lastScore, int rssi, int selectedRssi) CheckHigherPriority() argument
[all...]
/third_party/skia/third_party/externals/brotli/research/
H A Ddurchschlag.cc21 Score score; member
30 Score score; member
36 return (a.score > b.score) || in operator ()()
37 ((a.score == b.score) && (a.position < b.position)); in operator ()()
43 return (a.score < b.score) || in operator ()()
44 ((a.score == b.score) in operator ()()
91 Score score = 0; buildCandidatesList() local
183 Score score = 0; rebuildCandidatesList() local
513 Score score = 0; durchschlagGenerateExclusive() local
612 Score score = 0; durchschlagGenerateCollaborative() local
[all...]
/kernel/linux/linux-5.10/arch/powerpc/kernel/
H A Dsmp-tbsync.c80 int i, score=0; in start_contest() local
107 score += tbsync->race_result; in start_contest()
110 return score; in start_contest()
115 int i, score, score2, old, min=0, max=5000, offset=1000; in smp_generic_give_timebase() local
131 score = start_contest(kSetAndTest, offset, NUM_ITER); in smp_generic_give_timebase()
133 pr_debug("score %d, offset %d\n", score, offset ); in smp_generic_give_timebase()
135 if( score > 0 ) in smp_generic_give_timebase()
141 score = start_contest(kSetAndTest, min, NUM_ITER); in smp_generic_give_timebase()
144 pr_debug("Min %d (score in smp_generic_give_timebase()
[all...]
/kernel/linux/linux-6.6/arch/powerpc/kernel/
H A Dsmp-tbsync.c80 int i, score=0; in start_contest() local
107 score += tbsync->race_result; in start_contest()
110 return score; in start_contest()
115 int i, score, score2, old, min=0, max=5000, offset=1000; in smp_generic_give_timebase() local
131 score = start_contest(kSetAndTest, offset, NUM_ITER); in smp_generic_give_timebase()
133 pr_debug("score %d, offset %d\n", score, offset ); in smp_generic_give_timebase()
135 if( score > 0 ) in smp_generic_give_timebase()
141 score = start_contest(kSetAndTest, min, NUM_ITER); in smp_generic_give_timebase()
144 pr_debug("Min %d (score in smp_generic_give_timebase()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/nvkm/subdev/bios/
H A Dshadow.c35 int score; member
56 int score = 1; in shadow_image() local
91 score += 1; in shadow_image()
92 score += 1; in shadow_image()
96 score += 3; in shadow_image()
100 score += 3; in shadow_image()
105 score += shadow_image(bios, idx + 1, offset + image.size, mthd); in shadow_image()
106 return score; in shadow_image()
123 mthd->score = shadow_image(bios, 0, 0, mthd); in shadow_method()
126 nvkm_debug(subdev, "scored %d\n", mthd->score); in shadow_method()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/subdev/bios/
H A Dshadow.c35 int score; member
56 int score = 1; in shadow_image() local
91 score += 1; in shadow_image()
92 score += 1; in shadow_image()
96 score += 3; in shadow_image()
100 score += 3; in shadow_image()
105 score += shadow_image(bios, idx + 1, offset + image.size, mthd); in shadow_image()
106 return score; in shadow_image()
123 mthd->score = shadow_image(bios, 0, 0, mthd); in shadow_method()
126 nvkm_debug(subdev, "scored %d\n", mthd->score); in shadow_method()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dh263enc.h86 int score = ff_h263_inter_MCBPC_bits[i + offset] * lambda; in get_p_cbp() local
87 if (i & 1) score += s->coded_score[5]; in get_p_cbp()
88 if (i & 2) score += s->coded_score[4]; in get_p_cbp()
90 if (score < best_cbpc_score) { in get_p_cbp()
91 best_cbpc_score = score; in get_p_cbp()
97 int score= ff_h263_cbpy_tab[i ^ 0xF][1] * lambda; in get_p_cbp() local
98 if (i & 1) score += s->coded_score[3]; in get_p_cbp()
99 if (i & 2) score += s->coded_score[2]; in get_p_cbp()
100 if (i & 4) score += s->coded_score[1]; in get_p_cbp()
101 if (i & 8) score in get_p_cbp()
[all...]
H A Dmsvideo1enc.c98 int score; in encode_frame() local
120 score = 0; in encode_frame()
131 score += t*t; in encode_frame()
135 score /= quality; in encode_frame()
136 score += 2; in encode_frame()
137 if(score < bestscore){ in encode_frame()
138 bestscore = score; in encode_frame()
142 score = 0; in encode_frame()
158 score += t*t; in encode_frame()
162 score / in encode_frame()
[all...]
H A Dsvq1enc.c86 int score = 0, i; in ssd_int8_vs_int16_c() local
89 score += (pix1[i] - pix2[i]) * (pix1[i] - pix2[i]); in ssd_int8_vs_int16_c()
90 return score; in ssd_int8_vs_int16_c()
154 int sqr, diff, score; in encode_block() local
159 score = sqr - (diff * (int64_t)diff >> (level + 3)); // FIXME: 64 bits slooow in encode_block()
160 if (score < best_vector_score) { in encode_block()
164 best_vector_score = score; in encode_block()
190 int score = 0; in encode_block() local
196 score += encode_block(s, src, ref, decoded, stride, level - 1, in encode_block()
198 score in encode_block()
375 int score[4] = { 0, 0, 0, 0 }, best; svq1_encode_plane() local
[all...]
/third_party/ffmpeg/libavfilter/
H A Dvf_identity.c42 double score, min_score, max_score, score_comp[4]; member
65 unsigned score = 0; in identity_line_8bit() local
68 score += main_line[j] == ref_line[j]; in identity_line_8bit()
70 return score; in identity_line_8bit()
77 unsigned score = 0; in identity_line_16bit() local
80 score += main_line[j] == ref_line[j]; in identity_line_16bit()
82 return score; in identity_line_16bit()
92 uint64_t **score; member
102 uint64_t *score = td->score[jobn in compute_images_msad() local
130 uint64_t *score = td->score[jobnr]; compute_images_identity() local
177 double comp_score[4], score = 0.; do_identity() local
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h146 |out|->score is updated only if a better match is found. */
161 score_t min_score = out->score; in FindLongestMatch()
162 score_t best_score = out->score; in FindLongestMatch()
173 const score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
174 if (best_score < score) { in FindLongestMatch()
177 out->score = score; in FindLongestMatch()
183 best_score = score; in FindLongestMatch()
208 const score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch() local
209 if (best_score < score) { in FindLongestMatch()
239 const score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_forgetful_chain_inc.h190 |out|->score is updated only if a better match is found. */
205 score_t min_score = out->score; in FindLongestMatch()
206 score_t best_score = out->score; in FindLongestMatch()
228 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
229 if (best_score < score) { in FindLongestMatch()
230 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
231 if (best_score < score) { in FindLongestMatch()
232 best_score = score; in FindLongestMatch()
236 out->score = best_score; in FindLongestMatch()
268 score, sinc in FindLongestMatch()
269 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_longest_match64_inc.h161 |out|->score is updated only if a better match is found. */
174 score_t min_score = out->score; in FindLongestMatch()
175 score_t best_score = out->score; in FindLongestMatch()
203 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
205 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
206 if (best_score < score) { in FindLongestMatch()
207 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
208 if (best_score < score) { in FindLongestMatch()
209 best_score = score; in FindLongestMatch()
213 out->score in FindLongestMatch()
246 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_longest_match_inc.h157 |out|->score is updated only if a better match is found. */
170 score_t min_score = out->score; in FindLongestMatch()
171 score_t best_score = out->score; in FindLongestMatch()
199 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
201 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
202 if (best_score < score) { in FindLongestMatch()
203 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
204 if (best_score < score) { in FindLongestMatch()
205 best_score = score; in FindLongestMatch()
209 out->score in FindLongestMatch()
241 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h146 |out|->score is updated only if a better match is found. */
161 score_t min_score = out->score; in FindLongestMatch()
162 score_t best_score = out->score; in FindLongestMatch()
173 const score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
174 if (best_score < score) { in FindLongestMatch()
177 out->score = score; in FindLongestMatch()
183 best_score = score; in FindLongestMatch()
208 const score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch() local
209 if (best_score < score) { in FindLongestMatch()
239 const score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_longest_match_inc.h157 |out|->score is updated only if a better match is found. */
170 score_t min_score = out->score; in FindLongestMatch()
171 score_t best_score = out->score; in FindLongestMatch()
199 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
201 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
202 if (best_score < score) { in FindLongestMatch()
203 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
204 if (best_score < score) { in FindLongestMatch()
205 best_score = score; in FindLongestMatch()
209 out->score in FindLongestMatch()
241 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_forgetful_chain_inc.h190 |out|->score is updated only if a better match is found. */
205 score_t min_score = out->score; in FindLongestMatch()
206 score_t best_score = out->score; in FindLongestMatch()
228 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
229 if (best_score < score) { in FindLongestMatch()
230 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
231 if (best_score < score) { in FindLongestMatch()
232 best_score = score; in FindLongestMatch()
236 out->score = best_score; in FindLongestMatch()
268 score, sinc in FindLongestMatch()
269 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
H A Dhash_longest_match64_inc.h161 |out|->score is updated only if a better match is found. */
174 score_t min_score = out->score; in FindLongestMatch()
175 score_t best_score = out->score; in FindLongestMatch()
203 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
205 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FindLongestMatch() local
206 if (best_score < score) { in FindLongestMatch()
207 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i); in FindLongestMatch()
208 if (best_score < score) { in FindLongestMatch()
209 best_score = score; in FindLongestMatch()
213 out->score in FindLongestMatch()
246 score_t score = BackwardReferenceScore(len, backward); FindLongestMatch() local
[all...]
/kernel/linux/linux-6.6/drivers/acpi/
H A Dglue.c131 int score; member
139 int score; in check_one_child() local
159 * First, get the score for the previously found object and terminate in check_one_child()
162 if (!wd->score) { in check_one_child()
163 score = find_child_checks(wd->adev, wd->check_children); in check_one_child()
164 if (score == FIND_CHILD_MAX_SCORE) in check_one_child()
167 wd->score = score; in check_one_child()
170 * Second, if the object that has just been found has a better score, in check_one_child()
172 * the new score i in check_one_child()
[all...]
/third_party/libwebsockets/lib/core-net/client/
H A Dsort-dns.c86 lws_dns_score_t score; member
166 lws_sort_dns_classify(lws_sockaddr46 *sa46, lws_dns_score_t *score) in lws_sort_dns_classify() argument
173 memset(score, 0, sizeof(*score)); in lws_sort_dns_classify()
196 *score = pol->score; in lws_sort_dns_classify()
476 if (score_srca.label == da->score.label && in lws_sort_dns_dcomp()
477 score_srcb.label != db->score.label) in lws_sort_dns_dcomp()
479 if (score_srca.label != da->score.label && in lws_sort_dns_dcomp()
480 score_srcb.label == db->score in lws_sort_dns_dcomp()
[all...]
/third_party/skia/third_party/etc1/
H A Detc1.cpp244 etc1_uint32 score; // Lower is more accurate member
249 if (a->score > b->score) { in take_best()
320 etc1_uint32 score = (etc1_uint32) (6 * square(decodedG - pixelG)); in chooseModifier() local
321 if (score >= bestScore) { in chooseModifier()
325 score += (etc1_uint32) (3 * square(decodedR - pixelR)); in chooseModifier()
326 if (score >= bestScore) { in chooseModifier()
330 score += (etc1_uint32) square(decodedB - pixelB); in chooseModifier()
331 if (score < bestScore) { in chooseModifier()
332 bestScore = score; in chooseModifier()
346 int score = pCompressed->score; etc_encode_subblock_helper() local
[all...]

Completed in 14 milliseconds

12345678910