Home
last modified time | relevance | path

Searched refs:next (Results 476 - 500 of 12963) sorted by relevance

1...<<11121314151617181920>>...519

/third_party/mesa3d/src/intel/vulkan/tests/
H A Dblock_pool_no_free.c11 * The above copyright notice and this permission notice (including the next
79 unsigned next[NUM_THREADS]; in validate_monotonic() local
80 memset(next, 0, sizeof(next)); in validate_monotonic()
84 /* First, we find which thread has the lowest next element */ in validate_monotonic()
88 if (next[i] >= BLOCKS_PER_THREAD) in validate_monotonic()
91 if (thread_min > blocks[i][next[i]]) { in validate_monotonic()
92 thread_min = blocks[i][next[i]]; in validate_monotonic()
97 /* The only way this can happen is if all of the next[] values are at in validate_monotonic()
103 /* That next elemen in validate_monotonic()
[all...]
/third_party/libinput/src/
H A Dutil-strings.c12 * The above copyright notice and this permission notice (including the next
30 * Return the next word in a string pointed to by state before the first
44 const char *next = *state; in next_word() local
47 if (!*next) in next_word()
50 next += strspn(next, separators); in next_word()
51 if (!*next) { in next_word()
52 *state = next; in next_word()
56 l = strcspn(next, separators); in next_word()
57 *state = next in next_word()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_cull.c15 * next paragraph) shall be included in all copies or substantial portions
88 /* triangle is not culled, pass to next stage */ in cull_tri()
89 stage->next->tri( stage->next, header ); in cull_tri()
99 stage->next->tri( stage->next, header ); in cull_tri()
121 stage->next->flush( stage->next, flags ); in cull_flush()
127 stage->next->reset_stipple_counter( stage->next ); in cull_reset_stipple_counter()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcordz_handle.cc47 CordzHandle* next = dq_next_; in ~CordzHandle() local
51 while (next && !next->is_snapshot_) { in ~CordzHandle()
52 to_delete.push_back(next); in ~CordzHandle()
53 next = next->dq_next_; in ~CordzHandle()
57 dq_prev_->dq_next_ = next; in ~CordzHandle()
59 if (next) { in ~CordzHandle()
60 next->dq_prev_ = dq_prev_; in ~CordzHandle()
/third_party/skia/src/pathops/
H A DSkOpCoincidence.cpp31 // sets the span's end to the ptT referenced by the previous-next
38 const SkOpPtT* testPtT = prev ? prev->next()->ptT() in setEnd()
39 : origSpan->upCast()->next()->prev()->ptT(); in setEnd()
78 SkOpSpanBase* next = end->final() ? nullptr : end->upCast()->next(); in expand() local
79 if (next && next->deleted()) { in expand()
83 if (!next || !(oppPtT = next->contains(oppSegment))) { in expand()
86 double midT = (end->t() + next in expand()
114 set(SkCoincidentSpans* next, const SkOpPtT* coinPtTStart, const SkOpPtT* coinPtTEnd, const SkOpPtT* oppPtTStart, const SkOpPtT* oppPtTEnd) set() argument
158 const SkOpSpanBase* next = start->upCast()->next(); ordered() local
1134 SkOpSpanBase* next = start->next(); DEBUG_COIN_DECLARE_ONLY_PARAMS() local
1155 SkCoincidentSpans* next; release() local
1179 SkCoincidentSpans* next; releaseDeleted() local
1364 SkOpSpanBase* next = start; DEBUG_COIN_DECLARE_ONLY_PARAMS() local
[all...]
/drivers/hdf_core/framework/utils/src/
H A Dhdf_map.c24 struct MapNode *next; member
57 node->next = map->nodes[idx]; in MapAddNode()
80 struct MapNode *next = NULL; in MapResize() local
86 next = node->next; in MapResize()
88 node = next; in MapResize()
151 node = node->next; in MapSet()
210 node = node->next; in MapGet()
235 map->nodes[idx] = node->next; in MapErase()
237 prev->next in MapErase()
265 struct MapNode *next = NULL; MapDelete() local
[all...]
/kernel/linux/linux-6.6/arch/riscv/kernel/
H A Dhibernate.c198 unsigned long next; in temp_pgtable_map_pmd() local
217 next = pmd_addr_end(start, end); in temp_pgtable_map_pmd()
225 ret = temp_pgtable_map_pte(dst_pmdp, src_pmdp, start, next, prot); in temp_pgtable_map_pmd()
229 } while (dst_pmdp++, src_pmdp++, start = next, start != end); in temp_pgtable_map_pmd()
237 unsigned long next; in temp_pgtable_map_pud() local
256 next = pud_addr_end(start, end); in temp_pgtable_map_pud()
264 ret = temp_pgtable_map_pmd(dst_pudp, src_pudp, start, next, prot); in temp_pgtable_map_pud()
268 } while (dst_pudp++, src_pudp++, start = next, start != end); in temp_pgtable_map_pud()
276 unsigned long next; in temp_pgtable_map_p4d() local
295 next in temp_pgtable_map_p4d()
316 unsigned long next; temp_pgtable_mapping() local
[all...]
H A Dvector.c177 int cur, next; in riscv_v_vstate_ctrl_init() local
182 next = riscv_v_ctrl_get_next(tsk); in riscv_v_vstate_ctrl_init()
183 if (!next) { in riscv_v_vstate_ctrl_init()
189 cur = next; in riscv_v_vstate_ctrl_init()
191 /* Clear next mask if inherit-bit is not set */ in riscv_v_vstate_ctrl_init()
194 next = PR_RISCV_V_VSTATE_CTRL_DEFAULT; in riscv_v_vstate_ctrl_init()
196 riscv_v_ctrl_set(tsk, cur, next, inherit); in riscv_v_vstate_ctrl_init()
210 int cur, next; in riscv_v_vstate_ctrl_set_current() local
235 next = VSTATE_CTRL_GET_NEXT(arg); in riscv_v_vstate_ctrl_set_current()
237 switch (next) { in riscv_v_vstate_ctrl_set_current()
[all...]
/third_party/mbedtls/library/
H A Dssl_cache.c48 for (cur = cache->chain; cur != NULL; cur = cur->next) { in ssl_cache_find_entry()
152 for (cur = cache->chain; cur != NULL; cur = cur->next) { in ssl_cache_pick_writing_slot()
169 for (cur = cache->chain; cur != NULL; cur = cur->next) { in ssl_cache_pick_writing_slot()
195 last->next = cur; in ssl_cache_pick_writing_slot()
219 cache->chain = old->next; in ssl_cache_pick_writing_slot()
220 old->next = NULL; in ssl_cache_pick_writing_slot()
221 last->next = old; in ssl_cache_pick_writing_slot()
232 * so we reuse `old` to record `next` temporarily. */ in ssl_cache_pick_writing_slot()
233 old = cur->next; in ssl_cache_pick_writing_slot()
235 cur->next in ssl_cache_pick_writing_slot()
[all...]
/third_party/selinux/libsepol/src/
H A Dsidtab.c53 cur = cur->next; in sepol_sidtab_insert()
71 newnode->next = prev->next; in sepol_sidtab_insert()
72 prev->next = newnode; in sepol_sidtab_insert()
74 newnode->next = s->htable[hvalue]; in sepol_sidtab_insert()
95 cur = cur->next; in sepol_sidtab_search()
103 cur = cur->next; in sepol_sidtab_search()
128 cur = cur->next; in sepol_sidtab_map()
152 last->next = cur->next; in sepol_sidtab_map_remove_on_error()
[all...]
/kernel/linux/linux-6.6/arch/powerpc/lib/
H A Dqspinlock.c16 struct qnode *next; member
157 * acquire barrier in get_tail_qnode() when the next CPU finds this tail
358 struct qnode *next; in propagate_yield_cpu() local
370 next = READ_ONCE(node->next); in propagate_yield_cpu()
371 if (!next) in propagate_yield_cpu()
375 next->yield_cpu = owner; in propagate_yield_cpu()
378 next->yield_cpu = owner; in propagate_yield_cpu()
400 if (node->next && node->next in yield_to_prev()
543 struct qnode *next, *node; queued_spin_lock_mcs_queue() local
[all...]
/kernel/linux/linux-5.10/arch/s390/mm/
H A Dpgalloc.c370 unsigned long next = (addr + (SIZE)) & ~((SIZE) - 1); \
372 return (next - 1) < (end - 1) ? next : end; \
394 unsigned long *pte, next; in base_page_walk() local
401 next = base_page_addr_end(addr, end); in base_page_walk()
403 } while (pte++, addr = next, addr < end); in base_page_walk()
410 unsigned long *ste, next, table; in base_segment_walk() local
416 next = base_segment_addr_end(addr, end); in base_segment_walk()
426 rc = base_page_walk(table, addr, next, alloc); in base_segment_walk()
432 } while (ste++, addr = next, add in base_segment_walk()
439 unsigned long *rtte, next, table; base_region3_walk() local
467 unsigned long *rste, next, table; base_region2_walk() local
495 unsigned long *rfte, next, table; base_region1_walk() local
[all...]
/kernel/linux/linux-6.6/arch/s390/boot/
H A Dvmem.c309 unsigned long next, pages = 0; in pgtable_pmd_populate() local
314 for (; addr < end; addr = next, pmd++) { in pgtable_pmd_populate()
315 next = pmd_addr_end(addr, end); in pgtable_pmd_populate()
317 if (kasan_pmd_populate_zero_shadow(pmd, addr, next, mode)) in pgtable_pmd_populate()
319 if (can_large_pmd(pmd, addr, next)) { in pgtable_pmd_populate()
333 pgtable_pte_populate(pmd, addr, next, mode); in pgtable_pmd_populate()
342 unsigned long next, pages = 0; in pgtable_pud_populate() local
347 for (; addr < end; addr = next, pud++) { in pgtable_pud_populate()
348 next = pud_addr_end(addr, end); in pgtable_pud_populate()
350 if (kasan_pud_populate_zero_shadow(pud, addr, next, mod in pgtable_pud_populate()
375 unsigned long next; pgtable_p4d_populate() local
394 unsigned long next; pgtable_populate() local
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/chelsio/libcxgb/
H A Dlibcxgb_ppm.c134 pool->next, count, 0); in ppm_get_cpu_entries()
136 pool->next = 0; in ppm_get_cpu_entries()
141 pool->next = i + count; in ppm_get_cpu_entries()
142 if (pool->next >= ppm->pool_index_max) in ppm_get_cpu_entries()
143 pool->next = 0; in ppm_get_cpu_entries()
147 pr_debug("%s: cpu %u, idx %d + %d (%d), next %u.\n", in ppm_get_cpu_entries()
149 pool->next); in ppm_get_cpu_entries()
164 ppm->next, count, 0); in ppm_get_entries()
166 ppm->next = 0; in ppm_get_entries()
173 ppm->next in ppm_get_entries()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/chelsio/libcxgb/
H A Dlibcxgb_ppm.c134 pool->next, count, 0); in ppm_get_cpu_entries()
136 pool->next = 0; in ppm_get_cpu_entries()
141 pool->next = i + count; in ppm_get_cpu_entries()
142 if (pool->next >= ppm->pool_index_max) in ppm_get_cpu_entries()
143 pool->next = 0; in ppm_get_cpu_entries()
147 pr_debug("%s: cpu %u, idx %d + %d (%d), next %u.\n", in ppm_get_cpu_entries()
149 pool->next); in ppm_get_cpu_entries()
164 ppm->next, count, 0); in ppm_get_entries()
166 ppm->next = 0; in ppm_get_entries()
173 ppm->next in ppm_get_entries()
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_cfg.cpp11 * The above copyright notice and this permission notice (including the next
132 if ((const bblock_t *)this->link.next != that) in can_combine_with()
187 bblock_t *next; in cfg_t() local
214 next = new_block(); in cfg_t()
215 cur_if->add_successor(mem_ctx, next, bblock_link_logical); in cfg_t()
217 set_next_block(&cur, next, ip); in cfg_t()
225 next = new_block(); in cfg_t()
227 cur_if->add_successor(mem_ctx, next, bblock_link_logical); in cfg_t()
228 cur_else->add_successor(mem_ctx, next, bblock_link_physical); in cfg_t()
230 set_next_block(&cur, next, i in cfg_t()
[all...]
/third_party/node/deps/openssl/openssl/crypto/evp/
H A Dbio_enc.c110 BIO *next; in enc_read() local
116 next = BIO_next(b); in enc_read()
117 if ((ctx == NULL) || (next == NULL)) in enc_read()
151 i = BIO_read(next, ctx->read_start, ENC_BLOCK_SIZE); in enc_read()
159 /* Should be continue next time we are called? */ in enc_read()
160 if (!BIO_should_retry(next)) { in enc_read()
238 BIO *next; in enc_write() local
241 next = BIO_next(b); in enc_write()
242 if ((ctx == NULL) || (next == NULL)) in enc_write()
250 i = BIO_write(next, in enc_write()
301 BIO *next; enc_ctrl() local
398 BIO *next = BIO_next(b); enc_callback_ctrl() local
[all...]
/third_party/openssl/crypto/evp/
H A Dbio_enc.c110 BIO *next; in enc_read() local
116 next = BIO_next(b); in enc_read()
117 if ((ctx == NULL) || (next == NULL)) in enc_read()
151 i = BIO_read(next, ctx->read_start, ENC_BLOCK_SIZE); in enc_read()
159 /* Should be continue next time we are called? */ in enc_read()
160 if (!BIO_should_retry(next)) { in enc_read()
238 BIO *next; in enc_write() local
241 next = BIO_next(b); in enc_write()
242 if ((ctx == NULL) || (next == NULL)) in enc_write()
250 i = BIO_write(next, in enc_write()
301 BIO *next; enc_ctrl() local
398 BIO *next = BIO_next(b); enc_callback_ctrl() local
[all...]
/third_party/toybox/toys/pending/
H A Dfsck.c52 struct f_sys_info *next; member
56 struct child_list *next; member
68 for (child = c_list; child; child = child->next) in kill_all()
91 while (temp->next) temp = temp->next; in create_db()
92 temp->next = xzalloc(sizeof(struct f_sys_info)); in create_db()
93 temp = temp->next; in create_db()
240 child->next = c_list; in do_fsck()
244 child->next =NULL; in do_fsck()
274 temp = temp->next; in wait_for()
[all...]
/kernel/linux/linux-5.10/arch/sparc/include/asm/
H A Dswitch_to_64.h7 #define prepare_arch_switch(next) \
15 * for l0/l1. It will use one for 'next' and the other to hold
16 * the output value of 'last'. 'next' is not referenced again
21 #define switch_to(prev, next, last) \
26 : : "r" (task_thread_info(next)->current_ds));\
28 task_thread_info(next); \
59 : "0" (task_thread_info(next)), \
/kernel/linux/linux-6.6/arch/loongarch/include/asm/
H A Dswitch_to.h17 * @next: The task to begin executing.
18 * @next_ti: task_thread_info(next).
23 * the context of next. Returns prev.
26 struct task_struct *next, struct thread_info *next_ti,
35 #define switch_to(prev, next, last) \
39 hw_breakpoint_thread_switch(next); \
40 (last) = __switch_to(prev, next, task_thread_info(next), \
/base/powermgr/display_manager/brightness_manager/src/
H A Dlight_lux_buffer.cpp125 unsigned int next = mEnd; in Push() local
143 next = mCapacity; in Push()
149 mBufferTime[next] = timestamp; in Push()
153 mBufferData[next] = data; in Push()
156 mEnd = next + 1; in Push()
170 unsigned int next = mStart + 1; in Prune() local
171 if (next >= mCapacity) { in Prune()
172 next -= mCapacity; in Prune()
174 if (mBufferTime[next] > horizon) { in Prune()
177 mStart = next; in Prune()
[all...]
/third_party/ffmpeg/libavfilter/
H A Daf_aformat.c65 char *next, *cur = str; \
70 next = strchr(cur, '|'); \
71 if (next) \
72 *next++ = 0; \
82 cur = next; \
95 char *next, *cur = s->channel_layouts_str; in parse_channel_layouts() local
100 next = strchr(cur, '|'); in parse_channel_layouts()
101 if (next) in parse_channel_layouts()
102 *next++ = 0; in parse_channel_layouts()
127 cur = next; in parse_channel_layouts()
[all...]
/third_party/elfutils/libcpu/
H A Di386_parse.y76 struct bitvalue *next;
88 struct argname *next;
95 struct argument *next;
128 struct instruction *next;
358 args = args->next;
362 newp->next = instructions;
394 while (runp->next != NULL)
395 runp = runp->next;
396 runp->next = $3;
409 while (runp->next !
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dextent_map.c190 static int mergable_maps(struct extent_map *prev, struct extent_map *next) in mergable_maps() argument
203 test_bit(EXTENT_FLAG_LOGGING, &next->flags)) in mergable_maps()
211 if (!list_empty(&prev->list) || !list_empty(&next->list)) in mergable_maps()
214 ASSERT(next->block_start != EXTENT_MAP_DELALLOC && in mergable_maps()
217 if (prev->map_lookup || next->map_lookup) in mergable_maps()
219 test_bit(EXTENT_FLAG_FS_MAPPING, &next->flags)); in mergable_maps()
221 if (extent_map_end(prev) == next->start && in mergable_maps()
222 prev->flags == next->flags && in mergable_maps()
223 prev->map_lookup == next->map_lookup && in mergable_maps()
224 ((next in mergable_maps()
424 struct rb_node *next = NULL; __lookup_extent_mapping() local
516 struct rb_node *next; next_extent_map() local
546 struct extent_map *next; merge_extent_mapping() local
[all...]

Completed in 15 milliseconds

1...<<11121314151617181920>>...519