| /external/brotli/c/enc/ |
| D | hash_longest_match64_inc.h | 175 size_t best_len = out->len; in FN() local
191 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
192 prev_ix + best_len > ring_buffer_mask || in FN()
193 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
209 best_len = len; in FN()
210 out->len = best_len; in FN()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
234 prev_ix + best_len > ring_buffer_mask || in FN()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
249 best_len = len; in FN()
[all …]
|
| D | hash_longest_match_inc.h | 168 size_t best_len = out->len; in FN() local
184 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
185 prev_ix + best_len > ring_buffer_mask || in FN()
186 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
202 best_len = len; in FN()
203 out->len = best_len; in FN()
225 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
226 prev_ix + best_len > ring_buffer_mask || in FN()
227 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
241 best_len = len; in FN()
[all …]
|
| D | hash_to_binary_tree_inc.h | 118 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in FN()
164 if (matches && len > *best_len) { in FN()
165 *best_len = len; in FN()
210 size_t best_len = 1; in FN() local
217 for (i = cur_ix - 1; i > stop && best_len <= 2; --i) { in FN()
232 if (len > best_len) { in FN()
233 best_len = len; in FN()
238 if (best_len < max_length) { in FN()
240 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FN()
246 size_t minlen = BROTLI_MAX(size_t, 4, best_len + 1); in FN()
|
| D | hash_forgetful_chain_inc.h | 168 size_t best_len = out->len; in FN() local
194 best_len = len; in FN()
195 out->len = best_len; in FN()
217 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
218 prev_ix + best_len > ring_buffer_mask || in FN()
219 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
233 best_len = len; in FN()
234 out->len = best_len; in FN()
|
| D | hash_longest_match_quickly_inc.h | 141 size_t best_len = best_len_in; in FN() local
147 if (compare_char == data[prev_ix + best_len]) { in FN()
155 best_len = len; in FN()
159 compare_char = data[cur_ix_masked + best_len]; in FN()
202 if (compare_char != data[prev_ix + best_len]) { in FN()
215 best_len = len; in FN()
216 out->len = best_len; in FN()
219 compare_char = data[cur_ix_masked + best_len]; in FN()
|
| D | backward_references_hq.c | 444 size_t best_len = min_len - 1; in UpdateNodes() local
446 for (; j < BROTLI_NUM_DISTANCE_SHORT_CODES && best_len < max_len; ++j) { in UpdateNodes()
452 uint8_t continuation = ringbuffer[cur_ix_masked + best_len]; in UpdateNodes()
453 if (cur_ix_masked + best_len > ringbuffer_mask) { in UpdateNodes()
467 if (prev_ix + best_len > ringbuffer_mask || in UpdateNodes()
468 continuation != ringbuffer[prev_ix + best_len]) { in UpdateNodes()
481 for (l = best_len + 1; l <= len; ++l) { in UpdateNodes()
492 best_len = l; in UpdateNodes()
|
| /external/ppp/pppd/plugins/pppoatm/ |
| D | misc.c | 23 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/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | zlib-longest-match.ll | 81 %best_len.0 = phi i32 [ %best_len.1, %land.rhs131 ], [ %3, %entry ]
88 %idxprom25 = sext i32 %best_len.0 to i64
96 %sub30 = add nsw i32 %best_len.0, -1
197 %cmp112 = icmp sgt i32 %sub110, %best_len.0
218 …best_len.1 = phi i32 [ %best_len.0, %do.body ], [ %best_len.0, %lor.lhs.false ], [ %best_len.0, %l…
235 …%best_len.2 = phi i32 [ %best_len.1, %land.rhs131 ], [ %best_len.1, %do.cond125 ], [ %sub110, %if.…
236 %cmp137 = icmp ugt i32 %best_len.2, %11
237 %.best_len.2 = select i1 %cmp137, i32 %11, i32 %best_len.2
238 ret i32 %.best_len.2
|
| /external/llvm/test/CodeGen/X86/ |
| D | zlib-longest-match.ll | 81 %best_len.0 = phi i32 [ %best_len.1, %land.rhs131 ], [ %3, %entry ]
88 %idxprom25 = sext i32 %best_len.0 to i64
96 %sub30 = add nsw i32 %best_len.0, -1
197 %cmp112 = icmp sgt i32 %sub110, %best_len.0
218 …best_len.1 = phi i32 [ %best_len.0, %do.body ], [ %best_len.0, %lor.lhs.false ], [ %best_len.0, %l…
235 …%best_len.2 = phi i32 [ %best_len.1, %land.rhs131 ], [ %best_len.1, %do.cond125 ], [ %sub110, %if.…
236 %cmp137 = icmp ugt i32 %best_len.2, %11
237 %.best_len.2 = select i1 %cmp137, i32 %11, i32 %best_len.2
238 ret i32 %.best_len.2
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| D | lsr-on-unrolled-loops.ll | 450 %best_len.2 = phi i32 [ %8, %bb2 ], [ %best_len.0, %bb24 ] ; <i32> [#uses=8]
455 %.sum32 = add i32 %cur_match_addr.0, %best_len.2 ; <i32> [#uses=1]
462 %41 = add nsw i32 %best_len.2, -1 ; <i32> [#uses=1]
594 %81 = icmp sgt i32 %80, %best_len.2 ; <i1> [#uses=1]
612 …%best_len.0 = phi i32 [ %best_len.2, %bb6 ], [ %best_len.2, %bb7 ], [ %best_len.2, %bb8 ], [ %best…
636 …%best_len.1 = phi i32 [ %best_len.0, %bb23 ], [ %best_len.0, %bb24 ], [ %80, %bb21 ] ; <i32> [#use…
637 %93 = icmp ugt i32 %best_len.1, %32 ; <i1> [#uses=1]
638 %merge = select i1 %93, i32 %32, i32 %best_len.1 ; <i32> [#uses=1]
|
| /external/u-boot/lib/zlib/ |
| D | deflate.c | 1069 int best_len = s->prev_length; /* best match length so far */ local
1085 register ush scan_end = *(ushf*)(scan+best_len-1);
1088 register Byte scan_end1 = scan[best_len-1];
1089 register Byte scan_end = scan[best_len];
1124 if (*(ushf*)(match+best_len-1) != scan_end ||
1155 if (match[best_len] != scan_end ||
1156 match[best_len-1] != scan_end1 ||
1186 if (len > best_len) {
1188 best_len = len;
1191 scan_end = *(ushf*)(scan+best_len-1);
[all …]
|
| /external/zlib/src/ |
| D | deflate.c | 1244 int best_len = (int)s->prev_length; /* best match length so far */ local
1260 register ush scan_end = *(ushf*)(scan+best_len-1);
1263 register Byte scan_end1 = scan[best_len-1];
1264 register Byte scan_end = scan[best_len];
1299 if (*(ushf*)(match+best_len-1) != scan_end ||
1330 if (match[best_len] != scan_end ||
1331 match[best_len-1] != scan_end1 ||
1361 if (len > best_len) {
1363 best_len = len;
1366 scan_end = *(ushf*)(scan+best_len-1);
[all …]
|
| /external/python/cpython2/Modules/zlib/ |
| D | deflate.c | 1244 int best_len = (int)s->prev_length; /* best match length so far */ local
1260 register ush scan_end = *(ushf*)(scan+best_len-1);
1263 register Byte scan_end1 = scan[best_len-1];
1264 register Byte scan_end = scan[best_len];
1299 if (*(ushf*)(match+best_len-1) != scan_end ||
1330 if (match[best_len] != scan_end ||
1331 match[best_len-1] != scan_end1 ||
1361 if (len > best_len) {
1363 best_len = len;
1366 scan_end = *(ushf*)(scan+best_len-1);
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/InstCombine/ |
| D | gep-combine-loop-invariant.ll | 6 define i32 @foo(i8* nocapture readnone %match, i32 %cur_match, i32 %best_len, i32 %scan_end, i32* n…
49 %idx.ext1 = zext i32 %best_len to i64
|
| /external/zlib/src/contrib/masmx86/ |
| D | match686.asm | 53 best_len equ dword ptr [esp+NbStack-36] define
|