Home
last modified time | relevance | path

Searched refs:best_len (Results 1 – 10 of 10) sorted by relevance

/external/chromium_org/third_party/brotli/src/brotli/enc/
Dhash.h201 size_t best_len = *best_len_out; in FindLongestMatch() local
235 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
236 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
237 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
256 best_len = len; in FindLongestMatch()
258 *best_len_out = best_len; in FindLongestMatch()
259 *best_len_code_out = best_len; in FindLongestMatch()
287 best_len = len; in FindLongestMatch()
289 *best_len_out = best_len; in FindLongestMatch()
290 *best_len_code_out = best_len; in FindLongestMatch()
[all …]
Dbackward_references.cc62 size_t best_len = 0; in CreateBackwardReferences() local
72 &best_len, &best_len_code, &best_dist, &best_score, in CreateBackwardReferences()
83 best_len = best_len_M1; in CreateBackwardReferences()
109 if (best_len >= 4) { in CreateBackwardReferences()
114 const int tail_length = best_len_2 - best_len + 1; in CreateBackwardReferences()
117 literal_cost[(i + best_len + k) & ringbuffer_mask] - in CreateBackwardReferences()
135 best_len = best_len_2; in CreateBackwardReferences()
147 i + 2 * best_len + random_heuristics_window_size; in CreateBackwardReferences()
150 cmd.copy_length_ = best_len; in CreateBackwardReferences()
163 for (int j = 1; j < best_len - 1; ++j) { in CreateBackwardReferences()
[all …]
/external/ppp/pppd/plugins/pppoatm/
Dmisc.c23 int ref_len,best_len,len; in __atmlib_fetch() local
29 best_len = 0; in __atmlib_fetch()
33 if (*value != '!' && len <= ref_len && len > best_len && in __atmlib_fetch()
36 best_len = len; in __atmlib_fetch()
40 if (best > -1) (*pos) += best_len; in __atmlib_fetch()
/external/llvm/test/CodeGen/X86/
Dzlib-longest-match.ll82 %best_len.0 = phi i32 [ %best_len.1, %land.rhs131 ], [ %3, %entry ]
89 %idxprom25 = sext i32 %best_len.0 to i64
97 %sub30 = add nsw i32 %best_len.0, -1
198 %cmp112 = icmp sgt i32 %sub110, %best_len.0
219 …best_len.1 = phi i32 [ %best_len.0, %do.body ], [ %best_len.0, %lor.lhs.false ], [ %best_len.0, %l…
236 …%best_len.2 = phi i32 [ %best_len.1, %land.rhs131 ], [ %best_len.1, %do.cond125 ], [ %sub110, %if.…
237 %cmp137 = icmp ugt i32 %best_len.2, %11
238 %.best_len.2 = select i1 %cmp137, i32 %11, i32 %best_len.2
239 ret i32 %.best_len.2
/external/qemu/distrib/zlib-1.2.8/
Ddeflate.c1156 int best_len = s->prev_length; /* best match length so far */ local
1172 register ush scan_end = *(ushf*)(scan+best_len-1);
1175 register Byte scan_end1 = scan[best_len-1];
1176 register Byte scan_end = scan[best_len];
1211 if (*(ushf*)(match+best_len-1) != scan_end ||
1242 if (match[best_len] != scan_end ||
1243 match[best_len-1] != scan_end1 ||
1273 if (len > best_len) {
1275 best_len = len;
1278 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/chromium_org/third_party/zlib/
Ddeflate.c1147 int best_len = s->prev_length; /* best match length so far */ local
1163 register ush scan_end = *(ushf*)(scan+best_len-1);
1166 register Byte scan_end1 = scan[best_len-1];
1167 register Byte scan_end = scan[best_len];
1205 if (*(ushf*)(match+best_len-1) != scan_end ||
1238 if (match[best_len] != scan_end ||
1239 match[best_len-1] != scan_end1 ||
1277 if (len > best_len) {
1279 best_len = len;
1282 scan_end = *(ushf*)(scan+best_len-1);
[all …]
Dmixed-source.patch182 if (match[best_len] != scan_end ||
/external/zlib/src/
Ddeflate.c1156 int best_len = s->prev_length; /* best match length so far */ local
1172 register ush scan_end = *(ushf*)(scan+best_len-1);
1175 register Byte scan_end1 = scan[best_len-1];
1176 register Byte scan_end = scan[best_len];
1211 if (*(ushf*)(match+best_len-1) != scan_end ||
1242 if (match[best_len] != scan_end ||
1243 match[best_len-1] != scan_end1 ||
1273 if (len > best_len) {
1275 best_len = len;
1278 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Dfx_zlib_deflate.c1155 int best_len = s->prev_length; /* best match length so far */ in longest_match() local
1171 register ush scan_end = *(ushf*)(scan+best_len-1); in longest_match()
1174 register Byte scan_end1 = scan[best_len-1]; in longest_match()
1175 register Byte scan_end = scan[best_len]; in longest_match()
1210 if (*(ushf*)(match+best_len-1) != scan_end || in longest_match()
1241 if (match[best_len] != scan_end || in longest_match()
1242 match[best_len-1] != scan_end1 || in longest_match()
1272 if (len > best_len) { in longest_match()
1274 best_len = len; in longest_match()
1277 scan_end = *(ushf*)(scan+best_len-1); in longest_match()
[all …]
/external/zlib/src/contrib/masmx86/
Dmatch686.asm53 best_len equ dword ptr [esp+NbStack-36] define