/third_party/ffmpeg/libavcodec/ |
H A D | h263_parser.c | 78 int next; local 81 next = buf_size; 84 next= ff_h263_find_frame_end(pc, buf, buf_size); 86 next = h263_find_frame_end(pc, buf, buf_size); 89 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { 98 return next;
|
H A D | webp_parser.c | 43 int next = END_NOT_FOUND; in webp_parse() local 69 next = i - 15; in webp_parse() 93 if (ff_combine_frame(&ctx->pc, next, &buf, &buf_size) < 0) in webp_parse() 96 if (next != END_NOT_FOUND && next < 0) in webp_parse() 104 return next; in webp_parse()
|
H A D | mpegaudio_parser.c | 52 int next= END_NOT_FOUND; in mpegaudio_parse() local 63 next= i; in mpegaudio_parse() 99 next = buf_size; in mpegaudio_parse() 115 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in mpegaudio_parse() 124 return next; in mpegaudio_parse() 130 return next; in mpegaudio_parse() 135 return next; in mpegaudio_parse()
|
/third_party/jerryscript/tests/jerry/es2015/ |
H A D | array-prototype-keys.js | 26 var current_item = iterator.next (); 32 current_item = iterator.next (); 52 current_item = iterator.next (); 61 current_item = iterator.next (); 69 current_item = iterator.next (); 80 current_item = iterator.next ();
|
H A D | array-prototype-entries.js | 26 var current_item = iterator.next (); 33 current_item = iterator.next (); 57 current_item = iterator.next (); 68 current_item = iterator.next (); 76 current_item = iterator.next (); 87 current_item = iterator.next ();
|
/third_party/mesa3d/src/freedreno/ir3/ |
H A D | ir3_remove_unreachable.c | 11 * The above copyright notice and this permission notice (including the next 99 assert(block->node.next != &ir->block_list); in delete_block() 100 struct ir3_block *next = list_entry(block->node.next, struct ir3_block, node); in delete_block() local 102 pred->physical_successors[1] = next; in delete_block() 104 pred->physical_successors[0] = next; in delete_block() 105 ir3_block_add_physical_predecessor(next, pred); in delete_block()
|
/third_party/node/deps/npm/node_modules/spdx-expression-parse/ |
H A D | parse.js | 19 function next () { 29 next() 38 next() 53 next() 61 next() 71 next()
|
/third_party/typescript/tests/baselines/reference/ |
H A D | contextualOverloadListFromArrayUnion.js | 35 function next() { 47 next() 52 next() 79 function next() {
function 93 next();
98 next();
|
/third_party/libfuse/lib/ |
H A D | fuse_loop_mt.c | 43 struct fuse_worker *next; member 108 static void list_add_worker(struct fuse_worker *w, struct fuse_worker *next) in list_add_worker() argument 110 struct fuse_worker *prev = next->prev; in list_add_worker() 111 w->next = next; in list_add_worker() 113 prev->next = w; in list_add_worker() 114 next->prev = w; in list_add_worker() 120 struct fuse_worker *next = w->next; in list_del_worker() local 121 prev->next in list_del_worker() [all...] |
/third_party/python/Lib/test/ |
H A D | test_itertools.py | 115 next(i3) 188 self.assertEqual(next(it), 'a') 222 next(testIntermediate) 229 next(testIntermediate) 312 next(testIntermediate) 525 next(testIntermediate) 551 next(c) 555 next(c) 556 self.assertEqual(next(c), -8) 559 self.assertEqual(type(next(coun [all...] |
/third_party/lwip/src/core/ipv6/ |
H A D | ip6_frag.c | 128 r = r->next; in ip6_reass_tmr() 132 /* get the next pointer before freeing */ in ip6_reass_tmr() 133 r = r->next; in ip6_reass_tmr() 153 r = r->next; in ip6_reass_tmr_tick() 216 /* get the next pointer before freeing */ in ip6_reass_free_complete_datagram() 226 reassdatagrams = ipr->next; in ip6_reass_free_complete_datagram() 230 if (prev->next == ipr) { in ip6_reass_free_complete_datagram() 233 prev = prev->next; in ip6_reass_free_complete_datagram() 236 prev->next = ipr->next; in ip6_reass_free_complete_datagram() [all...] |
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
H A D | CollationDataBuilder.java | 225 int next = cond.next; in addCE32() 226 if(next < 0) { in addCE32() 229 cond.next = index; in addCE32() 232 ConditionalCE32 nextCond = getConditionalCE32(next); in addCE32() 237 cond.next = index; in addCE32() 238 getConditionalCE32(index).next = next; in addCE32() 262 while(trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { in copyFrom() 274 while(iter.next() in optimize() 395 int next; global() field in CollationDataBuilder.ConditionalCE32 [all...] |
/third_party/skia/third_party/externals/expat/expat/lib/ |
H A D | xmlparse.c | 329 struct block *next; member 405 struct open_internal_entity *next; member 461 const char *s, const char *next); 465 const char *next, const char **nextPtr, 1275 openEntityList = openEntity->next; in XML_ParserReset() 1276 openEntity->next = parser->m_freeInternalEntities; in XML_ParserReset() 1535 entityList = entityList->next; in XML_ParserFree() 2687 const char *next = start; /* XmlContentTok doesn't always set the last arg */ in externalEntityInitProcessor2() local 2688 int tok = XmlContentTok(parser->m_encoding, start, end, &next); in externalEntityInitProcessor2() 2692 if (! accountingDiffTolerated(parser, tok, start, next, __LINE_ in externalEntityInitProcessor2() 2733 const char *next = start; /* XmlContentTok doesn't always set the last arg */ externalEntityInitProcessor3() local 2809 const char *next = s; /* XmlContentTok doesn't always set the last arg */ doContent() local 3958 const char *next = s; /* in case of XML_TOK_NONE or XML_TOK_PARTIAL */ doCdataSection() local 4084 const char *next = *startPtr; /* in case of XML_TOK_NONE or XML_TOK_PARTIAL */ doIgnoreSection() local 4194 processXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s, const char *next) processXmlDecl() argument 4356 const char *next = start; entityValueInitProcessor() local 4438 const char *next = s; externalParEntProcessor() local 4485 const char *next = s; entityValueProcessor() local 4522 const char *next = s; prologProcessor() local 4530 doProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end, int tok, const char *next, const char **nextPtr, XML_Bool haveMore, XML_Bool allowClosingDoctype, enum XML_Account account) doProlog() argument 5600 const char *next = NULL; epilogProcessor() local 5668 const char *next; processInternalEntity() local 5734 const char *next; internalEntityProcessor() local 5835 const char *next appendAttributeValue() local 6048 const char *next storeEntityValue() local 7404 int next; nextScaffoldPart() local [all...] |
/third_party/ltp/testcases/realtime/func/sched_latency/ |
H A D | sched_latency.c | 123 nsec_t next = 0, now = 0, sched_delta = 0, delta = 0, prev = in periodic_thread() local 131 iter_start = next = now; in periodic_thread() 142 next += period; in periodic_thread() 146 if (next < now) { in periodic_thread() 160 (next - iter_start) / 1000); in periodic_thread() 161 printf("next scheduled start is in the past!\n"); in periodic_thread() 166 sched_delta = next - now; /* how long we should sleep */ in periodic_thread() 171 rt_nanosleep(next - now); in periodic_thread() 175 } while (now < next); in periodic_thread()
|
/third_party/rust/crates/heck/src/ |
H A D | lib.rs | 17 //! be within a single word, except that the last will be part of the next word 115 while let Some((i, c)) = char_indices.next() { in transform() 124 if let Some(&(next_i, next)) = char_indices.peek() { in transform() 135 // Word boundary after if next is underscore or current is in transform() 136 // not uppercase and next is uppercase in transform() 137 if next == '_' || (next_mode == WordMode::Lowercase && next.is_uppercase()) { in transform() 146 // Otherwise if current and previous are uppercase and next in transform() 148 } else if mode == WordMode::Uppercase && c.is_uppercase() && next.is_lowercase() { in transform() 180 while let Some(c) = chars.next() { in lowercase() [all...] |
/third_party/icu/icu4c/source/test/intltest/ |
H A D | rbbiapts.cpp | 88 // source and dest iterator produce the same next() after assignment. in TestCloneEquals() 122 int bixnext = bix->next(); in TestCloneEquals() 123 int bi2next = bi2->next(); in TestCloneEquals() 128 if (bi2->next() != 8) { in TestCloneEquals() 129 errln("%s:%d ERROR: iterator.next() failed after deleting copy.", __FILE__, __LINE__); in TestCloneEquals() 286 wordIter1->next(2); in TestGetSetAdoptText() 340 pos = wordIter1->next(); in TestGetSetAdoptText() 342 pos = wordIter1->next(); in TestGetSetAdoptText() 344 pos = wordIter1->next(); in TestGetSetAdoptText() 346 pos = wordIter1->next(); in TestGetSetAdoptText() [all...] |
/third_party/elfutils/lib/ |
H A D | dynamicsizehash.c | 89 htab->table[idx].next = htab->first; in insert_entry_2() 94 htab->first = htab->table[idx].next = &htab->table[idx]; in insert_entry_2() 97 htab->table[idx].next = htab->first->next; in insert_entry_2() 98 htab->first = htab->first->next = &htab->table[idx]; in insert_entry_2() 149 first = first->next; in insert_entry_2() 153 runp = first = first->next; in insert_entry_2() 157 while ((runp = runp->next) != first); in insert_entry_2() 286 p = ((TYPENAME(NAME) *) p)->next; in NAME() 298 p = htab->first->next; in NAME() [all...] |
/third_party/curl/lib/ |
H A D | http_proxy.c | 181 result = cf->next->cft->do_connect(cf->next, data, blocking, done); in http_proxy_cf_connect() 188 int alpn = Curl_conn_cf_is_ssl(cf->next)? in http_proxy_cf_connect() 202 cf_protocol = cf->next; in http_proxy_cf_connect() 211 cf_protocol = cf->next; in http_proxy_cf_connect() 255 cf->next->cft->get_host(cf->next, data, phost, pdisplay_host, pport); in Curl_cf_http_proxy_get_host() 280 for(f = cf->next; f; f = f->next) { in http_proxy_cf_close() 289 if(cf->next) in http_proxy_cf_close() [all...] |
/third_party/mbedtls/library/ |
H A D | asn1parse.c | 296 mbedtls_asn1_sequence *next = seq->next; in mbedtls_asn1_sequence_free() local 298 seq = next; in mbedtls_asn1_sequence_free() 318 cur->next = in asn1_get_sequence_of_cb() 321 if (cur->next == NULL) { in asn1_get_sequence_of_cb() 325 cur = cur->next; in asn1_get_sequence_of_cb() 438 *head = cur->next; in mbedtls_asn1_free_named_data_list() 447 for (mbedtls_asn1_named_data *next; name != NULL; name = next) { in mbedtls_asn1_free_named_data_list_shallow() 448 next in mbedtls_asn1_free_named_data_list_shallow() [all...] |
/third_party/node/deps/v8/src/wasm/ |
H A D | wasm-linkage.h | 165 // Get the next D-register (Liftoff only uses the even S-registers). in CanAllocateFP() 166 int next = fp_allocator_.NextSlot(2) / 2; in CanAllocateFP() local 168 return next < fp_count_ && fp_regs_[next].code() < 16; in CanAllocateFP() 171 int next = fp_allocator_.NextSlot(2) / 2; in CanAllocateFP() local 172 return next < fp_count_; in CanAllocateFP() 175 int next = fp_allocator_.NextSlot(4) / 2; in CanAllocateFP() local 176 return next < fp_count_ - 1; // 2 D-registers are required. in CanAllocateFP() 205 int next = fp_allocator_.Allocate(2) / 2; in NextFpReg() local 206 return fp_regs_[next] in NextFpReg() 209 int next = fp_allocator_.Allocate(4) / 2; NextFpReg() local [all...] |
/third_party/node/deps/v8/src/objects/ |
H A D | js-weak-refs-inl.h | 181 prev_cell.set_next(next()); in Nullify() 183 next()); in Nullify() 186 fr.set_active_cells(next()); in Nullify() 188 fr, fr.RawField(JSFinalizationRegistry::kActiveCellsOffset), next()); in Nullify() 190 if (next().IsWeakCell()) { in Nullify() 191 WeakCell next_cell = WeakCell::cast(next()); in Nullify() 207 gc_notify_updated_slot(*this, RawField(WeakCell::kNextOffset), next()); in Nullify() 226 fr.set_active_cells(next()); in RemoveFromFinalizationRegistryCells() 229 fr.set_cleared_cells(next()); in RemoveFromFinalizationRegistryCells() 233 prev_cell.set_next(next()); in RemoveFromFinalizationRegistryCells() [all...] |
/third_party/node/deps/openssl/openssl/crypto/ |
H A D | initthread.c | 41 THREAD_EVENT_HANDLER *next; member 333 curr = curr->next; in init_thread_stop() 338 *hands = curr->next; in init_thread_stop() 340 prev->next = curr->next; in init_thread_stop() 343 curr = curr->next; in init_thread_stop() 404 hand->next = *hands; in ossl_init_thread_start() 439 prev->next = curr->next; in init_thread_deregister() 441 *hands = curr->next; in init_thread_deregister() [all...] |
/third_party/openssl/crypto/ |
H A D | initthread.c | 41 THREAD_EVENT_HANDLER *next; member 333 curr = curr->next; in init_thread_stop() 338 *hands = curr->next; in init_thread_stop() 340 prev->next = curr->next; in init_thread_stop() 343 curr = curr->next; in init_thread_stop() 404 hand->next = *hands; in ossl_init_thread_start() 439 prev->next = curr->next; in init_thread_deregister() 441 *hands = curr->next; in init_thread_deregister() [all...] |
/third_party/openssl/test/ |
H A D | asynciotest.c | 93 BIO *next = BIO_next(bio); in async_read() local 97 if (next == NULL) in async_read() 105 ret = BIO_read(next, out, 1); in async_read() 106 if (ret <= 0 && BIO_should_read(next)) in async_read() 129 BIO *next = BIO_next(bio); in async_write() local 133 if (next == NULL) in async_write() 222 ret = BIO_write(next, smallrec, MIN_RECORD_LEN); in async_write() 242 ret = BIO_write(next, in + written, inl - written); in async_write() 245 if (ret <= 0 && BIO_should_write(next)) in async_write() 260 BIO *next in async_ctrl() local [all...] |
/third_party/googletest/googletest/samples/ |
H A D | sample3-inl.h | 44 // type E and a pointer to the next node. 53 // Gets the next node in the queue. 54 QueueNode* next() { return next_; } in next() function in QueueNode 55 const QueueNode* next() const { return next_; } in next() function in QueueNode 58 // Creates a node with a given element value. The next pointer is 85 QueueNode<E>* next = node->next(); in Clear() local 88 node = next; in Clear() 90 next = node->next(); in Clear() [all...] |