Home
last modified time | relevance | path

Searched refs:next (Results 1251 - 1275 of 12684) sorted by relevance

1...<<51525354555657585960>>...508

/third_party/libwebsockets/lib/misc/lwsac/
H A Dlwsac.c69 return lac->next; in lwsac_get_next()
117 bf = bf->next; in _lwsac_use()
176 lachead->curr->next = bf; in _lwsac_use()
180 bf->next = NULL; in _lwsac_use()
230 head = head->next; in lwsac_scan_extant()
244 head = head->next; in lwsac_total_overhead()
270 struct lwsac *tmp = it->next; in lwsac_free()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_phi_builder.c11 * The above copyright notice and this permission notice (including the next
144 nir_block *next = (nir_block *) dom_entry->key; in nir_phi_builder_add_value() local
153 if (next == pb->impl->end_block) in nir_phi_builder_add_value()
156 if (_mesa_hash_table_search(&val->ht, INDEX_TO_KEY(next->index)) == NULL) { in nir_phi_builder_add_value()
161 nir_phi_builder_value_set_block_def(val, next, NEEDS_PHI); in nir_phi_builder_add_value()
163 if (pb->work[next->index] < pb->iter_count) { in nir_phi_builder_add_value()
164 pb->work[next->index] = pb->iter_count; in nir_phi_builder_add_value()
165 pb->W[w_end++] = next; in nir_phi_builder_add_value()
252 * 1) To speed up lookup next time even if the next tim in nir_phi_builder_value_get_block_def()
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dir_function.cpp11 * The above copyright notice and this permission notice (including the next
55 ; node_a = node_a->next, node_b = node_b->next) { in parameter_lists_match()
234 ; node_a = node_a->next, in is_best_inexact_overload()
235 node_b = node_b->next, in is_best_inexact_overload()
236 node_p = node_p->next) { in is_best_inexact_overload()
381 ; node_a = node_a->next, node_b = node_b->next) { in parameter_lists_match_exact()
/third_party/libwebsockets/plugins/
H A Dprotocol_lws_status.c47 struct per_session_data__lws_status *next; member
78 } lws_end_foreach_ll(pss, next); in trigger_resend()
123 pss->next = vhd->live_pss_list; in callback_lws_status()
171 } lws_end_foreach_ll(pss2, next); in callback_lws_status()
174 /* our next guy went away */ in callback_lws_status()
187 pss->walk_next = pss->walk_next->next; in callback_lws_status()
226 *ppss = pss->next; in callback_lws_status()
229 } lws_end_foreach_llp(ppss, next); in callback_lws_status()
/third_party/node/test/parallel/
H A Dtest-repl-programmatic-history.js28 const next = _iter.next();
29 if (next.done) {
36 const action = next.value;
219 write(chunk, _, next) {
225 return next();
233 next();
H A Dtest-repl-persistent-history.js30 const next = _iter.next();
31 if (next.done) {
38 const action = next.value;
222 write(chunk, _, next) {
228 return next();
236 next();
/third_party/node/deps/v8/src/zone/
H A Dzone.cc75 segment_head_ = segment_head_->next(); in Reset()
111 Segment* next = current->next(); in DeleteAll() local
114 current = next; in DeleteAll()
209 Segment* next = current->next(); in ~ZoneScope() local
211 current = next; in ~ZoneScope()
/third_party/libwebsockets/win32port/zlib/
H A Dinftrees.c27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
201 next = *table; /* current table to fill in */
233 min = fill; /* save offset to next table */
236 next[(huff >> drop) + fill] = here;
250 /* go to next symbol, update count, len */
264 next += min; /* here min is 1 << curr */
266 /* determine length of next tabl
[all...]
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/pthread_mutex_lock/
H A Ds-c2.c98 /* The condition used to signal the main thread to go to the next step */
118 struct _td *next; /* It is a chained list */ member
240 sentinel.next = NULL; in main()
314 cur->next = tmp; in main()
363 while (cur->next != NULL) { in main()
365 tmp = cur->next; in main()
366 cur->next = tmp->next; in main()
/third_party/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_offset.c15 * next paragraph) shall be included in all copies or substantial portions
127 stage->next->tri( stage->next, header ); in do_offset_tri()
211 stage->next->flush( stage->next, flags ); in offset_flush()
217 stage->next->reset_stipple_counter( stage->next ); in offset_reset_stipple_counter()
239 offset->stage.next = NULL; in draw_offset_stage()
/third_party/pulseaudio/src/pulsecore/
H A Dmemblockq.h84 struct list_item *next, *prev; member
113 q->prev->next = q->next; in drop_block()
116 bq->blocks = q->next; in drop_block()
119 if (q->next) { in drop_block()
120 q->next->prev = q->prev; in drop_block()
131 bq->current_read = q->next; in drop_block()
168 /* Return a copy of the next memory chunk in the queue. It is not
/third_party/skia/src/core/
H A DSkTSort.h116 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
117 if (!lessThan(*next, *(next - 1))) { in SkTInsertionSort()
120 T insert = std::move(*next); in SkTInsertionSort()
121 T* hole = next; in SkTInsertionSort()
/third_party/skia/third_party/externals/tint/tools/src/cmd/intrinsic-gen/lexer/
H A Dlexer.go52 l.next()
54 l.next()
75 l.next() // Skip opening quote
81 l.next() // Skip closing quote
86 l.next() // Consume newline
105 // next() consumes and returns the next rune in the source, or 0 if reached EOF
106 func (l *lexer) next() rune {
122 // skip() consumes the next `n` runes in the source
125 l.next()
[all...]
/third_party/toybox/kconfig/
H A Dexpr.h19 struct file *next; member
72 struct symbol *next; member
85 #define for_all_symbols(i, sym) for (i = 0; i < 257; i++) for (sym = symbol_hash[i]; sym; sym = sym->next) if (sym->type != S_OTHER)
114 struct property *next; member
126 for (st = sym->prop; st; st = st->next) \
131 for (st = sym->prop; st; st = st->next) \
135 struct menu *next; member
/third_party/toybox/scripts/
H A Dmkflags.c17 struct flag *next; member
99 new->next = list->lopt; in digest()
104 blank->next = list; in digest()
132 new->next = list; in digest()
214 offlist = offlist->next; in main()
240 aflist = aflist->next; in main()
241 if (enabled) flist = flist->next; in main()
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/
H A Dpkcs1.c204 const u8 *pos, *end, *next, *da_end; in pkcs1_v15_sig_ver() local
270 if (asn1_get_oid(hdr.payload, hdr.length, &oid, &next)) { in pkcs1_v15_sig_ver()
277 next, da_end - next); in pkcs1_v15_sig_ver()
284 if (da_end > next && in pkcs1_v15_sig_ver()
285 (asn1_get_next(next, da_end - next, &hdr) < 0 || in pkcs1_v15_sig_ver()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/
H A Dpkcs1.c208 const u8 *pos, *end, *next, *da_end; in pkcs1_v15_sig_ver() local
270 if (asn1_get_oid(hdr.payload, hdr.length, &oid, &next)) { in pkcs1_v15_sig_ver()
277 next, da_end - next); in pkcs1_v15_sig_ver()
284 if (da_end > next && in pkcs1_v15_sig_ver()
285 (asn1_get_next(next, da_end - next, &hdr) < 0 || in pkcs1_v15_sig_ver()
/third_party/skia/third_party/externals/freetype/src/pshinter/
H A Dpshalgo.c950 end = end->next; in psh_glyph_compute_inflections()
993 after = after->next; in psh_glyph_compute_inflections()
1011 start = start->next; in psh_glyph_compute_inflections()
1178 FT_UInt first = 0, next, n; in psh_glyph_init() local
1189 next = (FT_UInt)outline->contours[n] + 1; in psh_glyph_init()
1190 count = next - first; in psh_glyph_init()
1199 point->prev = points + next - 1; in psh_glyph_init()
1204 point[0].next = point + 1; in psh_glyph_init()
1209 point->next = points + first; in psh_glyph_init()
1213 first = next; in psh_glyph_init()
1587 FT_UInt next = FT_MIN( mask->end_point, glyph->num_points ); psh_glyph_find_strong_points() local
1928 PSH_Point first, next, point; psh_glyph_interpolate_other_points() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Drhashtable.c231 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
243 next = rht_dereference_bucket(entry->next, old_tbl, old_hash); in rhashtable_rehash_one()
245 if (rht_is_a_nulls(next)) in rhashtable_rehash_one()
248 pprev = &entry->next; in rhashtable_rehash_one()
260 RCU_INIT_POINTER(entry->next, head); in rhashtable_rehash_one()
265 rcu_assign_pointer(*pprev, next); in rhashtable_rehash_one()
268 rht_assign_locked(bkt, next); in rhashtable_rehash_one()
510 pprev = &head->next; in rhashtable_lookup_one()
520 RCU_INIT_POINTER(list->next, plis in rhashtable_lookup_one()
1144 struct rhash_head *pos, *next; rhashtable_free_and_destroy() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Drhashtable.c231 struct rhash_head *head, *next, *entry; in rhashtable_rehash_one() local
244 next = rht_dereference_bucket(entry->next, old_tbl, old_hash); in rhashtable_rehash_one()
246 if (rht_is_a_nulls(next)) in rhashtable_rehash_one()
249 pprev = &entry->next; in rhashtable_rehash_one()
262 RCU_INIT_POINTER(entry->next, head); in rhashtable_rehash_one()
267 rcu_assign_pointer(*pprev, next); in rhashtable_rehash_one()
270 rht_assign_locked(bkt, next); in rhashtable_rehash_one()
513 pprev = &head->next; in rhashtable_lookup_one()
523 RCU_INIT_POINTER(list->next, plis in rhashtable_lookup_one()
1148 struct rhash_head *pos, *next; rhashtable_free_and_destroy() local
[all...]
/third_party/ffmpeg/libavcodec/
H A Ddvenc.c165 uint8_t next[64]; member
208 /* Construct the next VLC */ in dv_encode_ac()
210 bi->cur_ac = bi->next[prev]; in dv_encode_ac()
417 bi->next[prev] = i; in dv_set_class_number_sd()
422 bi->next[prev] = i; in dv_set_class_number_sd()
431 i = bi->next[prev]; in dv_set_class_number_sd()
435 for (; i < mb_area_start[area + 1]; i = bi->next[i]) { in dv_set_class_number_sd()
440 bi->next[prev] = i; in dv_set_class_number_sd()
445 bi->next[prev] = i; in dv_set_class_number_sd()
604 b->next[pre in dv100_actual_quantize()
[all...]
/third_party/skia/third_party/externals/libpng/contrib/libtests/
H A Dpngimage.c368 struct buffer_list *next; /* next buffer in list */ member
385 buffer->first.next = NULL; in buffer_init()
395 struct buffer_list *next = list->next; in buffer_destroy_list() local
397 buffer_destroy_list(next); in buffer_destroy_list()
404 struct buffer_list *list = buffer->first.next; in buffer_destroy()
443 assert(current->next == NULL); in buffer_extend()
449 add->next = NULL; in buffer_extend()
450 current->next in buffer_extend()
1383 int next = first_transform(tr); skip_transform() local
1506 unsigned int next = current; test_one_file() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A Dregcomp.c193 char *next; /* next character in RE */ member
250 #define PEEK() (*p->next)
251 #define PEEK2() (*(p->next+1))
252 #define MORE() (p->next < p->end)
253 #define MORE2() (p->next+1 < p->end)
258 #define NEXT() (p->next++)
259 #define NEXT2() (p->next += 2)
260 #define NEXTn(n) (p->next += (n))
261 #define GETNEXT() (*p->next
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmap.h416 Node* next; member
503 if (node_->next == nullptr) { in operator ++()
518 node_ = node_->next; in operator ++()
543 while ((l = l->next) != nullptr) { in revalidate_if_necessary()
578 Node* next = node->next; in clear() local
580 node = next; in clear()
589 typename Tree::iterator next = tree_it; in clear() local
590 ++next; in clear()
593 tree_it = next; in clear()
850 Node* next = node->next; TransferList() local
919 Node* next = node->next; CopyListToTree() local
[all...]
/kernel/linux/linux-5.10/kernel/locking/
H A Dlockdep.c1407 * a path from the next lock to be acquired to a previous held lock
1408 * indicates that adding the <prev> -> <next> lock dependency will
1552 * For dependency @prev -> @next:
1554 * SR: @prev is shared reader (->read != 0) and @next is recursive reader
1556 * ER: @prev is exclusive locker (->read == 0) and @next is recursive reader
1557 * SN: @prev is shared reader and @next is non-recursive locker (->read != 2)
1558 * EN: @prev is exclusive locker and @next is non-recursive locker
1562 * bit1 is next->read != 2
1575 __calc_dep_bit(struct held_lock *prev, struct held_lock *next) in __calc_dep_bit() argument
1577 return (prev->read == 0) + ((next in __calc_dep_bit()
1580 calc_dep(struct held_lock *prev, struct held_lock *next) calc_dep() argument
1590 __calc_dep_bitb(struct held_lock *prev, struct held_lock *next) __calc_dep_bitb() argument
1595 calc_depb(struct held_lock *prev, struct held_lock *next) calc_depb() argument
2492 print_bad_irq_dependency(struct task_struct *curr, struct lock_list *prev_root, struct lock_list *next_root, struct lock_list *backwards_entry, struct lock_list *forwards_entry, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit1, enum lock_usage_bit bit2, const char *irqclass) print_bad_irq_dependency() argument
2724 check_irq_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) check_irq_usage() argument
2812 check_irq_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) check_irq_usage() argument
2842 struct lock_class *next = hlock_class(nxt); print_deadlock_scenario() local
2859 print_deadlock_bug(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) print_deadlock_bug() argument
2895 check_deadlock(struct task_struct *curr, struct held_lock *next) check_deadlock() argument
2953 check_prev_add(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, u16 distance, struct lock_trace **const trace) check_prev_add() argument
3087 check_prevs_add(struct task_struct *curr, struct held_lock *next) check_prevs_add() argument
3207 int next = chain_hlocks[offset]; chain_block_next() local
3229 init_chain_block(int offset, int next, int bucket, int size) init_chain_block() argument
3243 int next = chain_block_buckets[bucket]; add_chain_block() local
3295 del_chain_block(int bucket, int size, int next) del_chain_block() argument
4626 check_wait_context(struct task_struct *curr, struct held_lock *next) check_wait_context() argument
4691 check_wait_context(struct task_struct *curr, struct held_lock *next) check_wait_context() argument
[all...]

Completed in 23 milliseconds

1...<<51525354555657585960>>...508