Home
last modified time | relevance | path

Searched refs:backward (Results 1 - 25 of 46) sorted by relevance

12

/third_party/node/deps/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h34 help create backward references to previous data.
78 system to find accidentally good backward references here and there. */ in Prepare()
139 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
191 size_t backward; in FindLongestMatch() local
196 backward = cur_ix - prev_ix; in FindLongestMatch()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
208 const score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch()
211 out->distance = backward; in FindLongestMatch()
225 size_t backward; in FindLongestMatch() local
[all...]
H A Dhash_forgetful_chain_inc.h12 help create backward references to previous data.
180 /* Find a longest backward match of &data[cur_ix] up to the length of
215 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
216 size_t prev_ix = (cur_ix - backward); in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
235 out->distance = backward; in FindLongestMatch()
244 size_t backward = 0; in FindLongestMatch() local
251 backward += delta; in FindLongestMatch()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FindLongestMatch()
253 prev_ix = (cur_ix - backward) in FindLongestMatch()
[all...]
H A Dhash_longest_match64_inc.h11 help create backward references to previous data.
35 /* Only block_size_ newest backward references are kept,
56 /* Buckets containing block_size_ of backward references. */
151 /* Find a longest backward match of &data[cur_ix] up to the length of
182 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
183 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
203 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
212 out->distance = backward; in FindLongestMatch()
228 const size_t backward in FindLongestMatch() local
[all...]
H A Dhash_longest_match_inc.h11 help create backward references to previous data.
34 /* Only block_size_ newest backward references are kept,
53 /* Buckets containing block_size_ of backward references. */
147 /* Find a longest backward match of &data[cur_ix] up to the length of
178 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
179 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
199 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
208 out->distance = backward; in FindLongestMatch()
223 const size_t backward in FindLongestMatch() local
[all...]
H A Dhash_to_binary_tree_inc.h144 const size_t backward = cur_ix - prev_ix; in StoreAndFindMatches() local
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in StoreAndFindMatches()
165 InitBackwardMatch(matches++, backward, len); in StoreAndFindMatches()
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
220 const size_t backward = cur_ix - prev_ix; in FindAllMatches() local
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindAllMatches()
235 InitBackwardMatch(matches++, backward, len); in FindAllMatches()
H A Dhash_rolling_inc.h180 /* The cast to 32-bit makes backward distances up to 4GB work even in FindLongestMatch()
182 size_t backward = (uint32_t)(cur_ix - found_ix); in FindLongestMatch() local
183 if (backward <= max_backward) { in FindLongestMatch()
189 score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch()
192 out->distance = backward; in FindLongestMatch()
H A Dhash.h8 help create backward references to previous data. */
103 /* Usually, we always choose the longest backward reference. This function
106 If we choose a backward reference that is further away, it will
114 This function is used to sometimes discard a longer backward reference
142 size_t backward; in TestStaticDictionaryItem() local
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
161 if (backward > max_distance) { in TestStaticDictionaryItem()
164 score = BackwardReferenceScore(matchlen, backward); in TestStaticDictionaryItem()
170 out->distance = backward; in TestStaticDictionaryItem()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h34 help create backward references to previous data.
78 system to find accidentally good backward references here and there. */ in Prepare()
139 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
191 size_t backward; in FindLongestMatch() local
196 backward = cur_ix - prev_ix; in FindLongestMatch()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
208 const score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch()
211 out->distance = backward; in FindLongestMatch()
225 size_t backward; in FindLongestMatch() local
[all...]
H A Dhash_forgetful_chain_inc.h12 help create backward references to previous data.
180 /* Find a longest backward match of &data[cur_ix] up to the length of
215 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
216 size_t prev_ix = (cur_ix - backward); in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
235 out->distance = backward; in FindLongestMatch()
244 size_t backward = 0; in FindLongestMatch() local
251 backward += delta; in FindLongestMatch()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FindLongestMatch()
253 prev_ix = (cur_ix - backward) in FindLongestMatch()
[all...]
H A Dhash_longest_match_inc.h11 help create backward references to previous data.
34 /* Only block_size_ newest backward references are kept,
53 /* Buckets containing block_size_ of backward references. */
147 /* Find a longest backward match of &data[cur_ix] up to the length of
178 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
179 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
199 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
208 out->distance = backward; in FindLongestMatch()
223 const size_t backward in FindLongestMatch() local
[all...]
H A Dhash_longest_match64_inc.h11 help create backward references to previous data.
35 /* Only block_size_ newest backward references are kept,
56 /* Buckets containing block_size_ of backward references. */
151 /* Find a longest backward match of &data[cur_ix] up to the length of
182 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch() local
183 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
203 a few unnecessary binary logarithms in backward reference score, in FindLongestMatch()
212 out->distance = backward; in FindLongestMatch()
228 const size_t backward in FindLongestMatch() local
[all...]
H A Dhash_to_binary_tree_inc.h144 const size_t backward = cur_ix - prev_ix; in StoreAndFindMatches() local
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in StoreAndFindMatches()
165 InitBackwardMatch(matches++, backward, len); in StoreAndFindMatches()
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
220 const size_t backward = cur_ix - prev_ix; in FindAllMatches() local
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindAllMatches()
235 InitBackwardMatch(matches++, backward, len); in FindAllMatches()
H A Dhash_rolling_inc.h180 /* The cast to 32-bit makes backward distances up to 4GB work even in FindLongestMatch()
182 size_t backward = (uint32_t)(cur_ix - found_ix); in FindLongestMatch() local
183 if (backward <= max_backward) { in FindLongestMatch()
189 score_t score = BackwardReferenceScore(len, backward); in FindLongestMatch()
192 out->distance = backward; in FindLongestMatch()
H A Dhash.h8 help create backward references to previous data. */
103 /* Usually, we always choose the longest backward reference. This function
106 If we choose a backward reference that is further away, it will
114 This function is used to sometimes discard a longer backward reference
142 size_t backward; in TestStaticDictionaryItem() local
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
161 if (backward > max_distance) { in TestStaticDictionaryItem()
164 score = BackwardReferenceScore(matchlen, backward); in TestStaticDictionaryItem()
170 out->distance = backward; in TestStaticDictionaryItem()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dtest-bimap.cc43 assert (bm.backward (6) == 3); in main()
70 assert (ibm.backward (0) == 0); in main()
71 assert (ibm.backward (1) == 1); in main()
72 assert (ibm.backward (2) == 2); in main()
/third_party/python/Lib/idlelib/idle_test/
H A Dtest_searchengine.py317 backward = self.make_search(self.engine.search_backward)
319 Equal(backward(pat, 3, 5, True), self.res)
320 Equal(backward(pat, 2, 0, True), self.res) # wrap
321 Equal(backward(pat, 2, 0, False), None) # no wrap
322 Equal(backward(pat, 2, 16, False), self.res)
324 Equal(backward(self.failpat, 3, 9, True), None)
325 Equal(backward(self.emptypat, 2, 10, True, ok=True), (2, (9,9)))
328 Equal(backward(self.emptypat, 2, 9, True), (2, (5, 9)))
/third_party/python/Lib/turtledemo/
H A Dpeace.py30 backward(640)
50 backward(170)
H A Dbytedesign.py39 self.backward(64.65 * scale)
64 self.backward(28 * scale)
71 self.backward(2.5 * scale)
77 self.backward(2.5 * scale)
H A Dyinyang.py36 backward(radius*0.35)
H A Dlindenmayer.py75 backward(195)
/third_party/ffmpeg/libavcodec/
H A Dhnm4video.c156 uint8_t tag, previous, backline, backward, swap; in decode_interframe_v4() local
200 backward = bytestream2_peek_byte(&gb) & 0x80; in decode_interframe_v4()
209 if (!backward && offset + 2*count > hnm->width * hnm->height) { in decode_interframe_v4()
212 } else if (backward && offset + 1 >= hnm->width * hnm->height) { in decode_interframe_v4()
221 if(backward) { in decode_interframe_v4()
243 if (backward) in decode_interframe_v4()
257 if (backward) in decode_interframe_v4()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DRegisterScavenging.h77 /// Use backward() to move towards the beginning of the block. This is
104 void backward();
106 /// Call backward() as long as the internal iterator does not point to \p I.
107 void backward(MachineBasicBlock::iterator I) { in backward() function in llvm::RegScavenger
109 backward(); in backward()
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_video.c277 bool forward, backward; in nouveau_vpe_mb_mv_header() local
289 backward = mb->macroblock_type & PIPE_MPEG12_MB_TYPE_MOTION_BACKWARD; in nouveau_vpe_mb_mv_header()
291 assert(!backward || dec->future < 8); in nouveau_vpe_mb_mv_header()
304 if (backward && forward) { in nouveau_vpe_mb_mv_header()
309 } else assert(!backward); in nouveau_vpe_mb_mv_header()
326 if (backward && forward) in nouveau_vpe_mb_mv_header()
330 else assert(!backward); in nouveau_vpe_mb_mv_header()
346 if (backward) in nouveau_vpe_mb_mv_header()
363 if (backward) { in nouveau_vpe_mb_mv_header()
/third_party/pulseaudio/speex/libspeexdsp/
H A Dfftwrap.c300 kiss_fftr_cfg backward; member
309 table->backward = kiss_fftr_alloc(size,1,NULL,NULL); in spx_fft_init()
318 kiss_fftr_free(t->backward); in spx_fft_destroy()
351 kiss_fftri2(t->backward, in, out); in spx_ifft()
/third_party/ffmpeg/libavfilter/
H A Dvf_vignette.c62 int backward; member
86 { "mode", "set forward/backward mode", OFFSET(backward), AV_OPT_TYPE_INT, {.i64 = 0}, 0, 1, FLAGS, "mode" },
88 { "backward", NULL, 0, AV_OPT_TYPE_CONST, {.i64 = 1}, INT_MIN, INT_MAX, FLAGS, "mode"},
175 if (s->backward) { in update_context()

Completed in 19 milliseconds

12