Home
last modified time | relevance | path

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

123456

/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...]
/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...]
/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...]
H A Dmfenc.c540 int64_t score = 0; in mf_enca_output_score() local
544 score |= 1LL << 32; in mf_enca_output_score()
548 score |= 2LL << 32; in mf_enca_output_score()
553 score |= 4LL << 32; in mf_enca_output_score()
561 score |= (1LL << 31) - diff; // prefer lower bitrate in mf_enca_output_score()
563 score |= (1LL << 30) + diff; // prefer higher bitrate in mf_enca_output_score()
571 return score; in mf_enca_output_score()
588 int64_t score = 0; in mf_enca_input_score() local
595 score |= 1; in mf_enca_input_score()
599 score | in mf_enca_input_score()
639 int score = -1; mf_encv_output_score() local
747 int64_t score = -1; mf_choose_output_type() local
836 int64_t score = -1; mf_choose_input_type() 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...]
H A Dvf_psnr.c58 uint64_t **score; member
116 uint64_t **score; member
126 uint64_t *score = td->score[jobnr]; in compute_images_mse() local
143 score[c] = m; in compute_images_mse()
182 td.score = s->score; in do_psnr()
197 comp_sum[c] += s->score[j][c]; in do_psnr()
361 s->score = av_calloc(s->nb_threads, sizeof(*s->score)); in config_input_ref()
[all...]
H A Dsignature_lookup.c177 size_t i, j, k, l, hmax = 0, score; in get_matching_parameters() local
192 size_t score; in get_matching_parameters() member
204 hspace[i][j].score = 0; in get_matching_parameters()
265 score = hspace[framerate-1][offset+HOUGH_MAX_OFFSET].score + 1; in get_matching_parameters()
266 if (score > hmax ) in get_matching_parameters()
267 hmax = score; in get_matching_parameters()
268 hspace[framerate-1][offset+HOUGH_MAX_OFFSET].score = score; in get_matching_parameters()
281 if (hmax < hspace[i][j].score) { in get_matching_parameters()
[all...]
H A Dvf_ssim.c65 double **score; member
230 double **score; member
241 double *score = td->score[jobnr]; in ssim_plane_16bit() local
274 score[c] = ssim; in ssim_plane_16bit()
284 double *score = td->score[jobnr]; in ssim_plane() local
317 score[c] = ssim; in ssim_plane()
349 td.score = s->score; in do_ssim()
[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...]
/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...]
/third_party/mesa3d/src/gallium/drivers/radeonsi/
H A Dsi_test_dma_perf.c86 unsigned score; in si_test_dma_perf() member
145 double score = 0; in si_test_dma_perf() local
148 if (size >= 512 * 1024 && score < 400 * (size / (4 * 1024 * 1024))) { in si_test_dma_perf()
255 score = get_MBps_rate(size, result.u64 / (double)NUM_RUNS); in si_test_dma_perf()
256 printf("%7.0f ,", score); in si_test_dma_perf()
266 r->score = score; in si_test_dma_perf()
378 if (best->score * min_improvement < r->score) in si_test_dma_perf()
403 (prev_this_size->is_valid && prev_this_size->score * 1.0 in si_test_dma_perf()
[all...]
/third_party/ffmpeg/tools/
H A Dprobetest.c50 int score; in probe() local
52 score = fmt->read_probe(pd); in probe()
54 if (score > score_array[i] && score > AVPROBE_SCORE_MAX / 4) { in probe()
55 score_array[i] = score; in probe()
57 "Failure of %s probing code with score=%d type=%d p=%X size=%d\n", in probe()
58 fmt->name, score, type, p, size); in probe()
/third_party/skia/src/core/
H A DSkFontMgr.cpp213 int score; in matchStyleCSS3() member
215 Score& operator +=(int rhs) { this->score += rhs; return *this; } in matchStyleCSS3()
216 Score& operator <<=(int rhs) { this->score <<= rhs; return *this; } in matchStyleCSS3()
217 bool operator <(const Score& that) { return this->score < that.score; } in matchStyleCSS3()
251 static const int score[3][3] = { in matchStyleCSS3() local
258 currentScore += score[pattern.slant()][current.slant()]; in matchStyleCSS3()
264 // The 'closer' to the target weight, the higher the score. in matchStyleCSS3()
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dquant_enc.c92 printf("\nD:%d SD:%d R:%d H:%d nz:0x%x score:%d\n", in PrintBlockInfo()
94 (int)rd->score); in PrintBlockInfo()
526 // Init/Copy the common fields in score.
533 rd->score = MAX_COST; in InitScore()
542 dst->score = src->score; in CopyScore()
551 dst->score += src->score; in AddScore()
566 score_t score; // partial RD score member
690 const score_t score = TrellisQuantizeBlock() local
708 const score_t score = best_cur_score + last_pos_score; TrellisQuantizeBlock() local
1246 const score_t score = (score_t)VP8SSE16x16(src, ref) * RD_DISTO_MULT RefineUsingDistortion() local
1283 const score_t score = VP8SSE4x4(src, ref) * RD_DISTO_MULT RefineUsingDistortion() local
1321 const score_t score = VP8SSE16x8(src, ref) * RD_DISTO_MULT RefineUsingDistortion() local
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dfilters_utils.c58 int score = 0; in WebPEstimateBestFilter() local
61 score += i; in WebPEstimateBestFilter()
64 if (score < best_score) { in WebPEstimateBestFilter()
65 best_score = score; in WebPEstimateBestFilter()

Completed in 21 milliseconds

123456