| /xsrc/external/mit/brotli/dist/c/enc/ |
| hash_longest_match_quickly_inc.h | 146 |out|->score is updated only if a better match is found. */
161 score_t min_score = out->score;
162 score_t best_score = out->score;
173 const score_t score = BackwardReferenceScoreUsingLastDistance(len); local
174 if (best_score < score) {
177 out->score = score;
183 best_score = score;
208 const score_t score = BackwardReferenceScore(len, backward); local
209 if (best_score < score) {
239 const score_t score = BackwardReferenceScore(len, backward); local
[all...] |
| hash_forgetful_chain_inc.h | 190 |out|->score is updated only if a better match is found. */
205 score_t min_score = out->score;
206 score_t best_score = out->score;
228 score_t score = BackwardReferenceScoreUsingLastDistance(len); local
229 if (best_score < score) {
230 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
231 if (best_score < score) {
232 best_score = score;
236 out->score = best_score;
268 score, since we are not interested in such short matches. *
269 score_t score = BackwardReferenceScore(len, backward); local
[all...] |
| hash_longest_match64_inc.h | 161 |out|->score is updated only if a better match is found. */
174 score_t min_score = out->score;
175 score_t best_score = out->score;
203 a few unnecessary binary logarithms in backward reference score,
205 score_t score = BackwardReferenceScoreUsingLastDistance(len); local
206 if (best_score < score) {
207 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
208 if (best_score < score) {
209 best_score = score;
213 out->score = best_score
246 score_t score = BackwardReferenceScore(len, backward); local
[all...] |
| hash_longest_match_inc.h | 157 |out|->score is updated only if a better match is found. */
170 score_t min_score = out->score;
171 score_t best_score = out->score;
199 a few unnecessary binary logarithms in backward reference score,
201 score_t score = BackwardReferenceScoreUsingLastDistance(len); local
202 if (best_score < score) {
203 if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);
204 if (best_score < score) {
205 best_score = score;
209 out->score = best_score
241 score_t score = BackwardReferenceScore(len, backward); local
[all...] |
| backward_references_inc.h | 33 /* Minimum score to accept a backward reference. */
49 sr.score = kMinScore;
53 if (sr.score > kMinScore) {
64 sr2.score = kMinScore;
73 if (sr2.score >= sr.score + cost_diff_lazy) {
|
| hash_rolling_inc.h | 189 score_t score = BackwardReferenceScore(len, backward); local
190 if (score > out->score) {
193 out->score = score;
|
| hash.h | 54 score_t score; member in struct:HasherSearchResult
100 /* Score must be positive after applying maximal penalty. */
143 score_t score; local
164 score = BackwardReferenceScore(matchlen, backward);
165 if (score < out->score) {
171 out->score = score;
|
| /xsrc/external/mit/xorg-server/dist/glx/ |
| glxscreens.c | 259 int score = 0; local
297 score += 32;
299 score += 16;
301 score += 8;
303 score += 4;
305 score += 2;
307 score++;
309 if (score > best_score) {
311 best_score = score;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/radeonsi/ |
| si_test_dma_perf.c | 86 unsigned score; member in struct:si_result
145 double score = 0; local
148 if (size >= 512 * 1024 && score < 400 * (size / (4 * 1024 * 1024))) {
255 score = get_MBps_rate(size, result.u64 / (double)NUM_RUNS);
256 printf("%7.0f ,", score);
266 r->score = score;
378 if (best->score * min_improvement < r->score)
403 (prev_this_size->is_valid && prev_this_size->score * 1.03 > best->score))
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/glx/ |
| glxscreens.c | 287 int score = 0; local
305 score += 8;
307 score += 4;
309 score += 2;
311 score++;
313 if (score > best_score) {
315 best_score = score;
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/radeonsi/ |
| si_test_dma_perf.c | 88 unsigned score; member in struct:si_result
139 double score = 0; local
143 score < 400 * (size / (4*1024*1024))) {
276 score = get_MBps_rate(size, total / (double)NUM_RUNS);
277 printf("%7.0f ,", score);
288 r->score = score;
400 if (best->score * min_improvement < r->score)
427 prev_this_size->score * 1.03 > best->score))
[all...] |
| /xsrc/external/mit/xorg-server/dist/exa/ |
| exa_migration_classic.c | 86 * Returns TRUE if the pixmap is either pinned in FB, or has a sufficient score
88 * had more acceleration than fallbacks, or has no score yet.
90 * Only valid if using a migration scheme that tracks score.
100 return pExaPixmap->score >= 0;
466 if (pExaPixmap->score == EXA_PIXMAP_SCORE_PINNED) {
472 DBG_MIGRATE(("UseScreen %p score %d\n",
473 (void *) pPixmap, pExaPixmap->score));
475 if (pExaPixmap->score == EXA_PIXMAP_SCORE_INIT) {
477 pExaPixmap->score = 0;
480 if (pExaPixmap->score < EXA_PIXMAP_SCORE_MAX
[all...] |
| exa_classic.c | 86 pExaPixmap->score = EXA_PIXMAP_SCORE_PINNED;
88 pExaPixmap->score = EXA_PIXMAP_SCORE_INIT;
|
| /xsrc/external/mit/xorg-server.old/dist/exa/ |
| exa_migration_classic.c | 86 * Returns TRUE if the pixmap is either pinned in FB, or has a sufficient score
88 * had more acceleration than fallbacks, or has no score yet.
90 * Only valid if using a migration scheme that tracks score.
100 return pExaPixmap->score >= 0;
456 if (pExaPixmap->score == EXA_PIXMAP_SCORE_PINNED) {
462 DBG_MIGRATE(("UseScreen %p score %d\n",
463 (pointer)pPixmap, pExaPixmap->score));
465 if (pExaPixmap->score == EXA_PIXMAP_SCORE_INIT) {
467 pExaPixmap->score = 0;
470 if (pExaPixmap->score < EXA_PIXMAP_SCORE_MAX
[all...] |
| /xsrc/external/mit/MesaLib/dist/include/android_stub/system/ |
| camera.h | 261 int32_t score; member in struct:camera_face
|
| /xsrc/external/mit/MesaLib/dist/src/intel/compiler/ |
| brw_nir_analyze_ubo_ranges.c | 54 score(const struct ubo_range_entry *entry) function
60 * Compares score for two UBO range entries.
71 int delta = score(b) - score(a);
192 "benefit %2d, cost %2d, score = %2d\n",
194 info->offsets, entry->benefit, entry->range.length, score(entry));
|
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| brw_nir_analyze_ubo_ranges.c | 54 score(const struct ubo_range_entry *entry) function
60 * Compares score for two UBO range entries.
71 int delta = score(b) - score(a);
190 "benefit %2d, cost %2d, score = %2d\n",
192 info->offsets, entry->benefit, entry->range.length, score(entry));
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| scheduler.c | 727 int score = 0; local
765 score--;
767 score += pred_score;
773 return score;
793 * actually change any state, only returning the score were the node to be
800 int score = _schedule_try_node(ctx, node, speculative); local
806 score = INT_MIN;
815 return score;
1311 int score = schedule_try_node(ctx, node, true); local
1312 if (score == INT_MIN && !best_node &
1335 ASSERTED int score = schedule_try_node(ctx, best_node, false); local
1366 ASSERTED int score = schedule_try_node(ctx, move, false); local
[all...] |
| /xsrc/external/mit/freetype/dist/src/autofit/ |
| afwarp.c | 66 /* Score segments for a given `scale' and `delta' in the range */
68 /* the new best score is equal to the old one, prefer the */
127 /* score the length of the segments for the given range */
132 /* find best score */
139 AF_WarpScore score = scores[idx]; local
143 if ( score > warper->best_score ||
144 ( score == warper->best_score &&
147 warper->best_score = score;
|
| afhints.h | 279 FT_Pos score; /* used during stem matching */ member in struct:AF_SegmentRec_
301 FT_Int score; /* used during stem matching */ member in struct:AF_EdgeRec_
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/ |
| node_to_instr.c | 252 unsigned int score = ppir_node_score(node); local
253 if (!best || score > best_score) {
255 best_score = score;
|
| /xsrc/external/mit/fontconfig/dist/src/ |
| fcmatch.c | 874 double score[PRI_END], bestscore[PRI_END]; local
906 if (!FcCompare (p, s->fonts[f], score, result, &data))
913 printf ("Score");
916 printf (" %g", score[i]);
922 if (best && bestscore[i] < score[i])
924 if (!best || score[i] < bestscore[i])
927 bestscore[i] = score[i];
937 /* Update the binding according to the score to indicate how exactly values matches on. */
982 printf ("Best score");
1112 double score[PRI_END] member in struct:_FcSortNode
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_emit_nvc0.cpp | 3023 SchedDataCalculator(const Target *targ) : score(NULL), prevData(0),
3161 RegScores *score; // for current BB
3248 score = &scoreBoards.at(bb->getId());
3260 score->setMax(&scoreBoards.at(in->getId()));
3267 score->print(cycle);
3300 const int regsFree = score->getLatest();
3314 score->rebase(cycle); // common base for initializing out blocks' scores
3332 ready = score->res.sfu;
3336 ready = score->res.imul;
3339 ready = score->res.tex
[all...] |
| nv50_ir_sched_gm107.h | 8 SchedDataCalculatorGM107(const TargetGM107 *targ) : score(NULL), targ(targ) {}
102 RegScores *score; // for current BB member in class:nv50_ir::SchedDataCalculatorGM107
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_emit_nvc0.cpp | 3153 RegScores *score; // for current BB
3240 score = &scoreBoards.at(bb->getId());
3252 score->setMax(&scoreBoards.at(in->getId()));
3259 score->print(cycle);
3292 const int regsFree = score->getLatest();
3306 score->rebase(cycle); // common base for initializing out blocks' scores
3324 ready = score->res.sfu;
3328 ready = score->res.imul;
3331 ready = score->res.tex;
3334 ready = score->res.ld[insn->src(0).getFile()]
[all...] |
