Home
last modified time | relevance | path

Searched refs:next (Results 1326 - 1350 of 6320) sorted by relevance

1...<<51525354555657585960>>...253

/third_party/ffmpeg/libavformat/
H A Dcache.c104 CacheEntry *entry = NULL, *next[2] = {NULL, NULL}; in add_entry() local
125 entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); in add_entry()
128 entry = next[0]; in add_entry()
165 CacheEntry *entry, *next[2] = {NULL, NULL}; in cache_read() local
168 entry = av_tree_find(c->root, &c->logical_pos, cmp, (void**)next); in cache_read()
171 entry = next[0]; in cache_read()
H A Durl.c168 const char *d, *next; in append_path() local
174 next = d + (d < in_end && *d == '/'); in append_path()
182 if (out_end - out < next - in) in append_path()
184 memmove(out, in, next - in); in append_path()
185 out += next - in; in append_path()
187 in = next; in append_path()
/third_party/curl/lib/
H A Dhash.c124 for(le = l->head; le; le = le->next) { in Curl_hash_add()
158 for(le = l->head; le; le = le->next) { in Curl_hash_delete()
184 for(le = l->head; le; le = le->next) { in Curl_hash_pick()
206 le = le->next) { in Curl_hash_apply()
263 lnext = le->next; in Curl_hash_clean_with_criterium()
313 /* Get the next element in the current list, if any */ in Curl_hash_next_element()
315 iter->current_element = iter->current_element->next; in Curl_hash_next_element()
317 /* If we have reached the end of the list, find the next one */ in Curl_hash_next_element()
H A Dheaders.c87 for(e = data->state.httphdrs.head; e; e = e->next) { in curl_easy_header()
106 for(e = data->state.httphdrs.head; e; e = e->next) { in curl_easy_header()
149 pick = pick->next; in curl_easy_nextheader()
155 /* make sure it is the next header of the desired type */ in curl_easy_nextheader()
160 pick = pick->next; in curl_easy_nextheader()
172 for(e = data->state.httphdrs.head; e; e = e->next) { in curl_easy_nextheader()
358 n = e->next; in Curl_headers_cleanup()
/third_party/icu/icu4c/source/test/intltest/
H A Dpluralmaptest.cpp118 const UnicodeString *current = map.next(index); in TestIterate()
121 current = map.next(index); in TestIterate()
124 current = map.next(index); in TestIterate()
127 current = map.next(index); in TestIterate()
133 current = map2.next(index); in TestIterate()
136 current = map2.next(index); in TestIterate()
/third_party/icu/icu4c/source/common/
H A Ducharstrie.cpp48 next(U16_TRAIL(cp)) : in firstForCodePoint()
55 next(cp) : in nextForCodePoint()
56 (USTRINGTRIE_HAS_NEXT(next(U16_LEAD(cp))) ? in nextForCodePoint()
57 next(U16_TRAIL(cp)) : in nextForCodePoint()
155 UCharsTrie::next(int32_t uchar) { in next() function in UCharsTrie
178 UCharsTrie::next(ConstChar16Ptr ptr, int32_t sLength) { in next() function in UCharsTrie
190 // Fetch the next input unit, if there is one. in next()
243 // Fetch the next input unit, if there is one. in next()
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
306 Node *next; member in StringTrieBuilder::IntermediateValueNode
319 length(len), next(nextNode) {} in LinearMatchNode()
324 Node *next; member in StringTrieBuilder::LinearMatchNode
394 length(len), next(subNode) {} in BranchHeadNode()
400 Node *next; // A branch sub-node. member in StringTrieBuilder::BranchHeadNode
/third_party/libuv/test/
H A Dbenchmark-pump.c311 struct req_list_s* next; member
323 req_freelist = req->next; in req_alloc()
335 req->next = req_freelist; in req_free()
346 struct buf_list_s* next; member
358 buf_freelist = ab->next; in buf_alloc()
371 ab->next = buf_freelist; in buf_free()
/third_party/libwebsockets/lib/roles/h2/
H A Dminihuf.c315 int next = 1; variable
367 state[walk].state[code_bit(n, m)] = next; in main()
368 walk = next++; in main()
378 for (n = 0; n < next; n++) { in main()
387 for (n = 0; n < next; n++) { in main()
404 for (n = 0; n < next; n++) { in main()
/third_party/libwebsockets/lib/roles/http/
H A Dminilex.c207 int next = 1; variable
305 state[walk].state[state[walk].count] = next; in issue()
307 walk = next++; in issue()
318 for (n = 0; n < next; n++) { in issue()
327 for (n = 0; n < next; n++) { in issue()
351 for (n = 0; n < next; n++) { in issue()
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
306 Node *next; member in StringTrieBuilder::IntermediateValueNode
319 length(len), next(nextNode) {} in LinearMatchNode()
324 Node *next; member in StringTrieBuilder::LinearMatchNode
394 length(len), next(subNode) {} in BranchHeadNode()
400 Node *next; // A branch sub-node. member in StringTrieBuilder::BranchHeadNode
/third_party/node/deps/icu-small/source/common/
H A Ducharstrie.cpp48 next(U16_TRAIL(cp)) : in firstForCodePoint()
55 next(cp) : in nextForCodePoint()
56 (USTRINGTRIE_HAS_NEXT(next(U16_LEAD(cp))) ? in nextForCodePoint()
57 next(U16_TRAIL(cp)) : in nextForCodePoint()
155 UCharsTrie::next(int32_t uchar) { in next() function in UCharsTrie
178 UCharsTrie::next(ConstChar16Ptr ptr, int32_t sLength) { in next() function in UCharsTrie
190 // Fetch the next input unit, if there is one. in next()
243 // Fetch the next input unit, if there is one. in next()
/third_party/nghttp2/tests/
H A Dnghttp2_buf_test.c63 CU_ASSERT(bufs.cur == bufs.head->next); in test_nghttp2_bufs_add()
120 CU_ASSERT(bufs.cur == bufs.head->next); in test_nghttp2_bufs_addb()
213 CU_ASSERT(chain->next == bufs.cur); in test_nghttp2_bufs_remove()
257 for (ci = bufs.head; ci; ci = ci->next) { in test_nghttp2_bufs_reset()
262 CU_ASSERT(bufs.head->next == NULL); in test_nghttp2_bufs_reset()
308 bufs.cur = bufs.head->next; in test_nghttp2_bufs_next_present()
/third_party/libinput/src/
H A Dutil-prop-parsers.c11 * The above copyright notice and this permission notice (including the next
501 char *current, *next; in parse_evdev_abs_prop() local
517 next = index(current, ':'); in parse_evdev_abs_prop()
518 if (next) in parse_evdev_abs_prop()
519 *next = '\0'; in parse_evdev_abs_prop()
527 current = next ? ++next : NULL; in parse_evdev_abs_prop()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/
H A DMatcherCompiler.java166 DfaNode next = singleOutput(current); in buildSequencesFrom()
167 if (dfa.inDegree(next) > 1) { in buildSequencesFrom()
170 current = next; in buildSequencesFrom()
221 Operation next = getOp(nodes.get(n)); in createOps()
222 Operation merged = current.mergeWith(next); in createOps()
227 current = next; in createOps()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DEdgeWriter.java99 Optional<AnyPath> next = AnyPathVisitor.extractAnyPath(e); in visitSequence()
100 if (next.isPresent()) { in visitSequence()
101 any = any.join(next.get()); in visitSequence()
190 Optional<AnyPath> next = AnyPathVisitor.extractAnyPath(e); in visitSequence()
191 if (next.isPresent()) { in visitSequence()
192 path = path.join(next.get()); in visitSequence()
242 // Find the lo/hi size of the next contiguous range (inclusive). in appendRegex()
/third_party/rust/crates/aho-corasick/src/
H A Dautomaton.rs92 /// An optional prefilter for quickly skipping to the next candidate match.
151 /// Given the current state that this automaton is in and the next input
152 /// byte, this method returns the identifier of the next state. The
157 /// This is not safe so that implementors may look up the next state
165 /// implementation never returns a `fail_id()` for the next state.
167 let next = self.next_state(current, input); in next_state_no_fail()
170 next != fail_id(), in next_state_no_fail()
171 "automaton should never return fail_id for next state" in next_state_no_fail()
173 next in next_state_no_fail()
221 let c = prefilter::next(prestat in standard_find_at_imp()
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-common.cc254 struct hb_language_item_t *next; member
292 hb_language_item_t *next = first_lang->next; in free_langs() local
295 first_lang = next; in free_langs()
305 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next) in lang_find_or_insert()
313 lang->next = first_lang; in lang_find_or_insert()
H A Dhb-utf.hh40 next (const codepoint_t *text, in next() function
118 if (likely (next (text, end, unicode, replacement) == end)) in prev()
187 next (const codepoint_t *text, in next() function
295 next (const TCodepoint *text, in next() function
353 next (const codepoint_t *text, in next() function
404 next (const codepoint_t *text, in next() function
/third_party/skia/tools/flags/
H A DCommandLineFlags.cpp173 // Skip the space on the next line in print_indented()
250 for (SkFlagInfo* flag = CommandLineFlags::gHead; flag; flag = flag->next()) { in Parse()
262 for (SkFlagInfo* flag = CommandLineFlags::gHead; flag; flag = flag->next()) { in Parse()
296 // Can be handled by match, above, but can also be set by the next in Parse()
331 flag = flag->next(); in Parse()
350 SkFlagInfo* next = flag->next(); in Parse() local
352 flag = next; in Parse()
/third_party/skia/third_party/externals/icu/source/common/
H A Ducharstrie.cpp48 next(U16_TRAIL(cp)) : in firstForCodePoint()
55 next(cp) : in nextForCodePoint()
56 (USTRINGTRIE_HAS_NEXT(next(U16_LEAD(cp))) ? in nextForCodePoint()
57 next(U16_TRAIL(cp)) : in nextForCodePoint()
155 UCharsTrie::next(int32_t uchar) { in next() function in UCharsTrie
178 UCharsTrie::next(ConstChar16Ptr ptr, int32_t sLength) { in next() function in UCharsTrie
190 // Fetch the next input unit, if there is one. in next()
243 // Fetch the next input unit, if there is one. in next()
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
306 Node *next; member in StringTrieBuilder::IntermediateValueNode
319 length(len), next(nextNode) {} in LinearMatchNode()
324 Node *next; member in StringTrieBuilder::LinearMatchNode
394 length(len), next(subNode) {} in BranchHeadNode()
400 Node *next; // A branch sub-node. member in StringTrieBuilder::BranchHeadNode
/third_party/protobuf/src/google/protobuf/
H A Darena_impl.h54 // Align n to next multiple of 8 (from Hacker's Delight, Chapter 3.) in AlignUpTo8()
157 CleanupChunk* next; // Next node in the list. member
228 SerialArena* next() const { return next_; } in next() function in google::protobuf::internal::ArenaImpl::SerialArena
229 void set_next(SerialArena* next) { next_ = next; } in set_next() argument
257 Block(size_t size, Block* next);
264 Block* next() const { return next_; } in next() function in google::protobuf::internal::ArenaImpl::Block
/third_party/python/Lib/test/
H A Dtest_list.py135 next(itorig)
144 next(itorig)
152 self.assertRaises(StopIteration, next, itorig)
171 next(itorig)
180 next(itorig)
188 self.assertRaises(StopIteration, next, itorig)
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dhashtablez_sampler.cc95 HashtablezInfo* next = s->next; in ~HashtablezSampler() local
97 s = next; in ~HashtablezSampler()
102 sample->next = all_.load(std::memory_order_relaxed); in PushNew()
103 while (!all_.compare_exchange_weak(sample->next, sample, in PushNew()
166 s = s->next; in Iterate()
205 // Small values of interval are equivalent to just sampling next time. in SampleSlow()

Completed in 17 milliseconds

1...<<51525354555657585960>>...253