Home
last modified time | relevance | path

Searched refs:next (Results 501 - 525 of 5697) sorted by relevance

1...<<21222324252627282930>>...228

/third_party/ltp/testcases/realtime/func/periodic_cpu_load/
H A Dperiodic_cpu_load_single.c95 nsec_t next, now; in periodic_thread() local
114 next = rt_gettime(); in periodic_thread()
116 next += period; in periodic_thread()
118 if (now > next) { in periodic_thread()
135 if (now > next) { in periodic_thread()
141 rt_nanosleep(next - now); in periodic_thread()
/third_party/ltp/tools/sparse/sparse-src/
H A Dscope.c36 static struct scope builtin_scope = { .next = &builtin_scope };
72 scope->next = *s; in start_scope()
80 scope->next = &builtin_scope; in start_file_scope()
115 *s = scope->next; in end_scope()
170 if (scope == &builtin_scope && block_scope->next == &builtin_scope) in is_outer_scope()
180 inner = inner->next; in is_in_scope()
/third_party/mesa3d/src/gallium/auxiliary/pipe-loader/
H A Dpipe_loader.c15 * next paragraph) shall be included in all copies or substantial portions
185 const char *next; in pipe_loader_find_module() local
189 for (next = library_paths; *next; library_paths = next + 1) { in pipe_loader_find_module()
190 next = strchrnul(library_paths, ':'); in pipe_loader_find_module()
191 len = next - library_paths; in pipe_loader_find_module()
/third_party/skia/src/sksl/ir/
H A DSkSLForStatement.h37 std::unique_ptr<Expression> next, in ForStatement()
45 , fNext(std::move(next)) in ForStatement()
53 std::unique_ptr<Expression> next,
67 std::unique_ptr<Expression> next,
88 std::unique_ptr<Expression>& next() { in next() function in SkSL::final
92 const std::unique_ptr<Expression>& next() const { in next() function in SkSL::final
34 ForStatement(int line, std::unique_ptr<Statement> initializer, std::unique_ptr<Expression> test, std::unique_ptr<Expression> next, std::unique_ptr<Statement> statement, std::unique_ptr<LoopUnrollInfo> unrollInfo, std::shared_ptr<SymbolTable> symbols) ForStatement() argument
/third_party/skia/src/sksl/lex/
H A DNFAState.h33 NFAState(Kind kind, std::vector<int> next) in NFAState()
35 , fNext(std::move(next)) {} in NFAState()
37 NFAState(char c, std::vector<int> next) in NFAState()
40 , fNext(std::move(next)) {} in NFAState()
46 NFAState(bool inverse, std::vector<bool> accepts, std::vector<int> next) in NFAState()
49 , fNext(std::move(next)) { in NFAState()
/third_party/toybox/lib/
H A Dcommas.c12 char *next, *arg; in comma_args() local
19 while ((next = comma_iterate(&arg, &len))) in comma_args()
20 if ((next = callback(data, next, len))) in comma_args()
22 (int)(5+strlen(toys.which->name)+strlen(err)+next-al->arg), '^'); in comma_args()
23 al = al->next; in comma_args()
45 // returns start of next entry or NULL if none
47 // advances *list to start of next entry
/third_party/toybox/toys/pending/
H A Dipcrm.c80 for (tmp = TT.mkey; tmp; tmp = tmp->next) do_ipcrm(1, 1, tmp->arg); in ipcrm_main()
81 for (tmp = TT.mid; tmp; tmp = tmp->next) do_ipcrm(0, 1, tmp->arg); in ipcrm_main()
82 for (tmp = TT.qkey; tmp; tmp = tmp->next) do_ipcrm(1, 2, tmp->arg); in ipcrm_main()
83 for (tmp = TT.qid; tmp; tmp = tmp->next) do_ipcrm(0, 2, tmp->arg); in ipcrm_main()
84 for (tmp = TT.skey; tmp; tmp = tmp->next) do_ipcrm(1, 3, tmp->arg); in ipcrm_main()
85 for (tmp = TT.sid; tmp; tmp = tmp->next) do_ipcrm(0, 3, tmp->arg); in ipcrm_main()
/third_party/rust/crates/peeking_take_while/src/
H A Dlib.rs7 //! `peeking_take_while` peeks at the next item in the iterator and runs the
54 //! assert_eq!(iter_xs.next(), Some(11));
57 //! assert_eq!(iter_ys.next(), Some(10));
84 /// `peeking_take_while` peeks at the next item in the iterator and runs the
143 fn next(&mut self) -> Option<Self::Item> { in fmt() functions
198 assert!(it1.next().is_none()); in not_fused()
199 assert_eq!(it1.next(), Some(0)); in not_fused()
200 assert!(it1.next().is_none()); in not_fused()
201 assert_eq!(it1.next(), Some(1)); in not_fused()
215 assert!(it1.next() in fused()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/eap_server/
H A Deap_server_methods.c28 for (m = eap_methods; m; m = m->next) { in eap_server_get_eap_method()
48 for (m = eap_methods; m; m = m->next) { in eap_server_get_type()
116 for (m = eap_methods; m; m = m->next) { in eap_server_method_register()
127 last->next = method; in eap_server_method_register()
147 eap_methods = eap_methods->next; in eap_server_unregister_methods()
171 for (m = eap_methods; m; m = m->next) { in eap_server_get_name()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/eap_server/
H A Deap_server_methods.c29 for (m = eap_methods; m; m = m->next) { in eap_server_get_eap_method()
49 for (m = eap_methods; m; m = m->next) { in eap_server_get_type()
118 for (m = eap_methods; m; m = m->next) { in eap_server_method_register()
130 last->next = method; in eap_server_method_register()
150 eap_methods = eap_methods->next; in eap_server_unregister_methods()
174 for (m = eap_methods; m; m = m->next) { in eap_server_get_name()
/third_party/ffmpeg/libavcodec/
H A Dlatm_parser.c40 * @return the position of the first byte of the next frame, or -1
89 int next; in latm_parse() local
92 next = buf_size; in latm_parse()
94 next = latm_find_frame_end(s1, buf, buf_size); in latm_parse()
96 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in latm_parse()
104 return next; in latm_parse()
H A Dh261_parser.c72 int next; in h261_parse() local
75 next = buf_size; in h261_parse()
77 next = h261_find_frame_end(pc, avctx, buf, buf_size); in h261_parse()
78 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in h261_parse()
86 return next; in h261_parse()
H A Dxbm_parser.c60 int next = END_NOT_FOUND, i = 0; in xbm_parse() local
77 next = i - 6; in xbm_parse()
80 next = i + 1; in xbm_parse()
88 if (ff_combine_frame(&bpc->pc, next, &buf, &buf_size) < 0) { in xbm_parse()
97 return next; in xbm_parse()
/third_party/jerryscript/tests/jerry/es2015/
H A Dgenerator-function.js25 assert(sharedProto.hasOwnProperty('next'));
48 var item = iterator.next();
52 item = iterator.next();
56 item = iterator.next();
60 item = iterator.next();
96 assert(f.next === undefined);
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.h15 * next paragraph) shall be included in all copies or substantial portions
55 struct cso_node *next; member
147 assert(*node == hash->end || (*node)->next); in cso_hash_find_node()
149 node = &(*node)->next; in cso_hash_find_node()
170 struct cso_hash_iter next = {iter.hash, cso_hash_data_next(iter.node)}; in cso_hash_iter_next() local
171 return next; in cso_hash_iter_next()
/third_party/node/test/parallel/
H A Dtest-https-client-renegotiation-limit.js43 function next() { function
46 test(next);
48 next();
51 function test(next) {
89 process.nextTick(next);
H A Dtest-tls-client-renegotiation-limit.js42 function next() { function
45 test(next);
47 next();
50 function test(next) {
78 process.nextTick(next);
/third_party/ntfs-3g/include/ntfs-3g/
H A Dcache.h28 struct CACHED_GENERIC *next; member
36 struct CACHED_INODE *next; member
46 struct CACHED_NIDATA *next; member
57 struct CACHED_LOOKUP *next; member
78 struct HASH_ENTRY *next; member
/third_party/musl/src/exit/
H A Dcxa_thread_atexit_impl.c31 struct dtor_list* next; member
44 thread_local_dtors = cur->next; in run_cur_thread_dtors()
92 dtor->next = thread_local_dtors; in __cxa_thread_atexit_impl()
114 dtor->next = thr->thread_local_dtors; in __cxa_thread_atexit_impl()
127 thr->thread_local_dtors= cur->next; in __cxa_thread_finalize()
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_balloc.c51 nghttp3_memblock_hd *p, *next; in nghttp3_balloc_clear() local
53 for (p = balloc->head; p; p = next) { in nghttp3_balloc_clear()
54 next = p->next; in nghttp3_balloc_clear()
76 hd->next = balloc->head; in nghttp3_balloc_get()
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_balloc.c50 ngtcp2_memblock_hd *p, *next; in ngtcp2_balloc_clear() local
52 for (p = balloc->head; p; p = next) { in ngtcp2_balloc_clear()
53 next = p->next; in ngtcp2_balloc_clear()
75 hd->next = balloc->head; in ngtcp2_balloc_get()
/third_party/skia/src/gpu/ops/
H A DGrOp.cpp31 void GrOp::chainConcat(GrOp::Owner next) { in chainConcat() argument
32 SkASSERT(next); in chainConcat()
33 SkASSERT(this->classID() == next->classID()); in chainConcat()
35 SkASSERT(next->isChainHead()); in chainConcat()
36 fNextInChain = std::move(next); in chainConcat()
/third_party/typescript/tests/baselines/reference/
H A DES5For-of37.js24 next: function () {
33 for (var _c = __values([0, 1, 2, 3, 4]), _d = _c.next(); !_d.done; _d = _c.next()) {
38 for (var _e = (e_2 = void 0, __values([1, 2, 3])), _f = _e.next(); !_f.done; _f = _e.next()) {
/third_party/pulseaudio/src/pulsecore/
H A Dqueue.c35 struct queue_entry *next; member
78 e->next = NULL; in pa_queue_push()
82 q->back->next = e; in pa_queue_push()
101 q->front = e->next; in pa_queue_pop()
104 pa_assert(!e->next); in pa_queue_pop()
/third_party/skia/experimental/graphite/src/
H A DDrawOrder.h41 // Get the next value in the sequence after this one
42 MonotonicValue next() const { return fIndex + 1; } in next() function in skgpu::MonotonicValue
65 * the next draw's.
69 * CompressedPaintersOrder, so long as one set is entirely drawn before the next.
142 CompressedPaintersOrder next = prevDraw.next(); in dependsOnPaintersOrder() local
143 if (fPaintOrder < next) { in dependsOnPaintersOrder()
144 fPaintOrder = next; in dependsOnPaintersOrder()

Completed in 9 milliseconds

1...<<21222324252627282930>>...228