Searched refs:score_t (Results 1 – 10 of 10) sorted by relevance
/external/brotli/c/enc/ |
D | hash.h | 58 #define score_t size_t macro 69 score_t score; 134 static BROTLI_INLINE score_t BackwardReferenceScore( in BackwardReferenceScore() 136 return BROTLI_SCORE_BASE + BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length - in BackwardReferenceScore() 140 static BROTLI_INLINE score_t BackwardReferenceScoreUsingLastDistance( in BackwardReferenceScoreUsingLastDistance() 142 return BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length + in BackwardReferenceScoreUsingLastDistance() 146 static BROTLI_INLINE score_t BackwardReferencePenaltyUsingLastDistance( in BackwardReferencePenaltyUsingLastDistance() 148 return (score_t)39 + ((0x1CA10 >> (distance_short_code & 0xE)) & 0xE); in BackwardReferencePenaltyUsingLastDistance() 160 score_t score; in TestStaticDictionaryItem()
|
D | hash_longest_match_quickly_inc.h | 139 score_t min_score = out->score; in FN() 140 score_t best_score = out->score; in FN() 152 const score_t score = BackwardReferenceScoreUsingLastDistance(len); in FN() 186 const score_t score = BackwardReferenceScore(len, backward); in FN() 212 const score_t score = BackwardReferenceScore(len, backward); in FN()
|
D | hash_forgetful_chain_inc.h | 166 score_t min_score = out->score; in FN() 167 score_t best_score = out->score; in FN() 189 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FN() 230 score_t score = BackwardReferenceScore(len, backward); in FN()
|
D | hash_longest_match64_inc.h | 173 score_t min_score = out->score; in FN() 174 score_t best_score = out->score; in FN() 204 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FN() 246 score_t score = BackwardReferenceScore(len, backward); in FN()
|
D | hash_longest_match_inc.h | 166 score_t min_score = out->score; in FN() 167 score_t best_score = out->score; in FN() 197 score_t score = BackwardReferenceScoreUsingLastDistance(len); in FN() 238 score_t score = BackwardReferenceScore(len, backward); in FN()
|
D | backward_references_inc.h | 32 const score_t kMinScore = BROTLI_SCORE_BASE + 100; in EXPORT_FN() 52 const score_t cost_diff_lazy = 175; in EXPORT_FN()
|
D | hash_rolling_inc.h | 193 score_t score = BackwardReferenceScore(len, backward); in FN()
|
/external/webp/src/enc/ |
D | quant_enc.c | 566 score_t score; // partial RD score 583 static WEBP_INLINE score_t RDScoreTrellis(int lambda, score_t rate, in RDScoreTrellis() 584 score_t distortion) { in RDScoreTrellis() 602 score_t best_score; in TrellisQuantizeBlock() 606 score_t cost; in TrellisQuantizeBlock() 630 const score_t rate = (ctx0 == 0) ? VP8BitCost(1, last_proba) : 0; in TrellisQuantizeBlock() 663 score_t base_score; in TrellisQuantizeBlock() 664 score_t best_cur_score = MAX_COST; in TrellisQuantizeBlock() 688 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock() 690 const score_t score = in TrellisQuantizeBlock() [all …]
|
D | vp8i_enc.h | 107 typedef int64_t score_t; // type used for scores, rate, distortion typedef 110 #define MAX_COST ((score_t)0x7fffffffffffffLL) 204 score_t i4_penalty_; // penalty for using Intra4 212 score_t D, SD; // Distortion, spectral distortion 213 score_t H, R, score; // header bits, rate, score.
|
D | webp_enc.c | 110 (score_t)256 * 510 * 8 * 1024 / (enc->mb_w_ * enc->mb_h_); in MapConfigToTools()
|