/third_party/node/deps/zlib/ |
H A D | gzread.c | 142 state->x.next = state->out; in gz_look() 143 memcpy(state->x.next, strm->next_in, strm->avail_in); in gz_look() 152 On return, state->x.have and state->x.next point to the just decompressed 154 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 192 state->x.next = strm->next_out - state->x.have; in gz_decomp() 223 state->x.next = state->out; in gz_fetch() 246 state->x.next += n; in gz_skip() 295 memcpy(buf, state->x.next, n); in gz_read() 296 state->x.next += n; in gz_read() 430 return *(state->x.next) in gzgetc() [all...] |
/third_party/nghttp2/lib/ |
H A D | nghttp2_buf.c | 100 (*chain)->next = NULL; in buf_chain_new() 192 next_chain = chain->next; in nghttp2_bufs_free() 211 chain->next = NULL; in nghttp2_bufs_wrap_init() 247 cur_chain->next = NULL; in nghttp2_bufs_wrap_init2() 251 dst_chain = &cur_chain->next; in nghttp2_bufs_wrap_init2() 282 for (ci = bufs->cur; ci; ci = ci->next) { in nghttp2_bufs_seek_last_present() 296 for (ci = bufs->head; ci; ci = ci->next) { in nghttp2_bufs_len() 307 if (bufs->cur->next) { in bufs_alloc_chain() 308 bufs->cur = bufs->cur->next; in bufs_alloc_chain() 327 bufs->cur->next in bufs_alloc_chain() [all...] |
/third_party/node/deps/nghttp2/lib/ |
H A D | nghttp2_buf.c | 100 (*chain)->next = NULL; in buf_chain_new() 192 next_chain = chain->next; in nghttp2_bufs_free() 211 chain->next = NULL; in nghttp2_bufs_wrap_init() 247 cur_chain->next = NULL; in nghttp2_bufs_wrap_init2() 251 dst_chain = &cur_chain->next; in nghttp2_bufs_wrap_init2() 282 for (ci = bufs->cur; ci; ci = ci->next) { in nghttp2_bufs_seek_last_present() 296 for (ci = bufs->head; ci; ci = ci->next) { in nghttp2_bufs_len() 307 if (bufs->cur->next) { in bufs_alloc_chain() 308 bufs->cur = bufs->cur->next; in bufs_alloc_chain() 327 bufs->cur->next in bufs_alloc_chain() [all...] |
/third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_scene.c | 15 * next paragraph) shall be included in all copies or substantial portions 48 struct resource_ref *next; member 56 struct shader_ref *next; member 154 bin->tail->next = NULL; in lp_scene_bin_reset() 255 for (struct resource_ref *ref = scene->resources; ref; ref = ref->next) { in lp_scene_end_rasterization() 271 ref = ref->next) { in lp_scene_end_rasterization() 294 for (struct shader_ref *ref = scene->frag_shaders; ref; ref = ref->next) { in lp_scene_end_rasterization() 311 tmp = block->next; in lp_scene_end_rasterization() 317 list->head->next = NULL; in lp_scene_end_rasterization() 345 bin->tail->next in lp_scene_new_cmd_block() [all...] |
/third_party/lwip/src/core/ipv4/ |
H A D | igmp.c | 167 struct igmp_group *next = group->next; /* avoid use-after-free below */ in igmp_stop() local 180 /* move to "next" */ in igmp_stop() 181 group = next; in igmp_stop() 200 group = group->next; in igmp_report_groups() 205 group = group->next; in igmp_report_groups() 226 group = group->next; in igmp_lookfor_group() 270 group->next = NULL; in igmp_lookup_group() 276 group->next = list_head->next; in igmp_lookup_group() [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/sem_init/ |
H A D | s-c1.c | 89 /* The next structure is used to save the tests measures */ 96 struct __mes_t *next; member 109 struct __test_t *next; member 132 m_cur->next = NULL; in main() 139 sems_cur->next = NULL; in main() 235 sems_cur->next = sems_tmp; in main() 237 sems_cur->next = NULL; in main() 255 m_tmp->next = NULL; in main() 257 m_cur->next = m_tmp; in main() 317 free(sems_cur->next); in main() [all...] |
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/ |
H A D | 1-2.c | 55 while (children->next != NULL) { \ 56 tmp = children->next; \ 57 children->next = tmp->next; \ 67 while (children->next != NULL) { \ 68 tmp = children->next; \ 69 children->next = tmp->next; \ 229 struct _children *next; member 232 static children_t sentinel = {.next [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/sem_open/ |
H A D | s-c1.c | 88 /* The next structure is used to save the tests measures */ 95 struct __mes_t *next; member 108 struct __test_t *next; member 132 m_cur->next = NULL; in main() 139 sems_cur->next = NULL; in main() 239 sems_cur->next = sems_tmp; in main() 241 sems_cur->next = NULL; in main() 259 m_tmp->next = NULL; in main() 261 m_cur->next = m_tmp; in main() 327 free(sems_cur->next); in main() [all...] |
/third_party/lwip/src/include/lwip/priv/ |
H A D | tcp_priv.h | 102 (((tpcb)->unsent != NULL) && (((tpcb)->unsent->next != NULL) || \ 254 struct tcp_seg *next; /* used when putting segments on a queue */ member 363 tcp_tmp_pcb = tcp_tmp_pcb->next) { \ 367 (npcb)->next = *(pcbs); \ 368 LWIP_ASSERT("TCP_REG: npcb->next != npcb", (npcb)->next != (npcb)); \ 378 *(pcbs) = (*pcbs)->next; \ 379 } else for (tcp_tmp_pcb = *(pcbs); tcp_tmp_pcb != NULL; tcp_tmp_pcb = tcp_tmp_pcb->next) { \ 380 if(tcp_tmp_pcb->next == (npcb)) { \ 381 tcp_tmp_pcb->next [all...] |
/third_party/skia/third_party/externals/zlib/ |
H A D | gzread.c | 159 state->x.next = state->out; 161 memcpy(state->x.next, strm->next_in, strm->avail_in); 171 On return, state->x.have and state->x.next point to the just decompressed 173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 213 state->x.next = strm->next_out - state->x.have; 246 state->x.next = state->out; 272 state->x.next += n; 325 memcpy(buf, state->x.next, n); 326 state->x.next += n; 472 return *(state->x.next) [all...] |
/third_party/zlib/ |
H A D | gzread.c | 161 state->x.next = state->out; in gz_look() 162 memcpy(state->x.next, strm->next_in, strm->avail_in); in gz_look() 171 On return, state->x.have and state->x.next point to the just decompressed 173 the next gzip stream or raw data, once state->x.have is depleted. Returns 0 214 state->x.next = strm->next_out - state->x.have; in gz_decomp() 252 state->x.next = state->out; in gz_fetch() 278 state->x.next += n; in gz_skip() 340 memcpy(buf, state->x.next, n); in gz_read() 341 state->x.next += n; in gz_read() 494 return *(state->x.next) in gzgetc() [all...] |
/kernel/linux/linux-6.6/arch/um/include/asm/ |
H A D | mmu_context.h | 28 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, in switch_mm() argument 33 if(prev != next){ in switch_mm() 35 cpumask_set_cpu(cpu, mm_cpumask(next)); in switch_mm() 36 if(next != &init_mm) in switch_mm() 37 __switch_mm(&next->context.id); in switch_mm()
|
/third_party/ffmpeg/libavcodec/ |
H A D | ipu_parser.c | 39 int next = END_NOT_FOUND, i = 0; in ipu_parse() local 48 next = buf_size; in ipu_parse() 53 next = i + 1; in ipu_parse() 59 if (ff_combine_frame(&ipc->pc, next, &buf, &buf_size) < 0) { in ipu_parse() 69 return next; in ipu_parse()
|
H A D | qoi_parser.c | 39 int next = END_NOT_FOUND, i = 0; in qoi_parse() local 48 next = buf_size; in qoi_parse() 53 next = i + 1; in qoi_parse() 59 if (ff_combine_frame(&ipc->pc, next, &buf, &buf_size) < 0) { in qoi_parse() 69 return next; in qoi_parse()
|
/third_party/musl/porting/uniproton/kernel/src/stdio/ |
H A D | fclose.c | 27 if (f->prev) f->prev->next = f->next;
in __fclose() 28 if (f->next) f->next->prev = f->prev;
in __fclose() 29 if (*head == f) *head = f->next;
in __fclose()
|
/third_party/musl/porting/liteos_m/kernel/src/stdio/ |
H A D | fclose.c | 27 if (f->prev) f->prev->next = f->next;
in __fclose() 28 if (f->next) f->next->prev = f->prev;
in __fclose() 29 if (*head == f) *head = f->next;
in __fclose()
|
/third_party/skia/third_party/externals/swiftshader/tests/ReactorBenchmarks/ |
H A D | ReactorBenchmarks.cpp | 46 Int next = 1; in BENCHMARK_DEFINE_F() local 49 Yield(next); in BENCHMARK_DEFINE_F() 50 auto tmp = current + next; in BENCHMARK_DEFINE_F() 51 current = next; in BENCHMARK_DEFINE_F() 52 next = tmp; in BENCHMARK_DEFINE_F()
|
/kernel/linux/linux-6.6/arch/s390/mm/ |
H A D | pgalloc.c | 510 unsigned long next = (addr + (SIZE)) & ~((SIZE) - 1); \ 512 return (next - 1) < (end - 1) ? next : end; \ 534 unsigned long *pte, next; in base_page_walk() local 541 next = base_page_addr_end(addr, end); in base_page_walk() 543 } while (pte++, addr = next, addr < end); in base_page_walk() 550 unsigned long *ste, next, *table; in base_segment_walk() local 556 next = base_segment_addr_end(addr, end); in base_segment_walk() 566 rc = base_page_walk(table, addr, next, alloc); in base_segment_walk() 572 } while (ste++, addr = next, add in base_segment_walk() 579 unsigned long *rtte, next, *table; base_region3_walk() local 607 unsigned long *rste, next, *table; base_region2_walk() local 635 unsigned long *rfte, next, *table; base_region1_walk() local [all...] |
/kernel/linux/linux-5.10/security/apparmor/ |
H A D | match.c | 69 * unpack_table - unpack a dfa table (one of accept, default, base, next check) 174 /* next.size == chk.size */ in verify_table_headers() 231 pr_err("AppArmor DFA next/check upper bounds error\n"); in verify_dfa() 409 #define match_char(state, def, base, next, check, C) \ 419 (state) = (next)[pos]; \ 444 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local 456 match_char(state, def, base, next, check, in aa_dfa_match_len() 459 /* default is direct to next state */ in aa_dfa_match_len() 461 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match_len() 484 u16 *next in aa_dfa_match() local 523 u16 *next = NEXT_TABLE(dfa); aa_dfa_next() local 541 u16 *next = NEXT_TABLE(dfa); aa_dfa_outofband_transition() local 572 u16 *next = NEXT_TABLE(dfa); aa_dfa_match_until() local 633 u16 *next = NEXT_TABLE(dfa); aa_dfa_matchn_until() local 709 u16 *next = NEXT_TABLE(dfa); leftmatch_fb() local [all...] |
/kernel/linux/linux-5.10/mm/ |
H A D | slob.c | 23 * sufficient free blocks (using a next-fit-like approach) followed by 79 * or offset of next block if -ve (in SLOB_UNITs). 81 * Free blocks of size 1 unit simply contain the offset of the next block. 83 * memory, and the offset of the next free block in the second SLOB_UNIT. 144 * Encode the given size and next info into a free slob block s. 146 static void set_slob(slob_t *s, slobidx_t size, slob_t *next) in set_slob() argument 149 slobidx_t offset = next - base; in set_slob() 169 * Return the next free slob block pointer after this one. 174 slobidx_t next; in slob_next() local 177 next in slob_next() 261 slob_t *next; slob_page_alloc() local 385 slob_t *prev, *next, *b = (slob_t *)block; slob_free() local [all...] |
/kernel/linux/linux-5.10/lib/ |
H A D | kobject_uevent.c | 102 const char *next = buf; in action_arg_word_end() local 104 while (next <= buf_end && *next != delim) in action_arg_word_end() 105 if (!isalnum(*next++)) in action_arg_word_end() 108 if (next == buf) in action_arg_word_end() 111 return next; in action_arg_word_end() 118 const char *next, *buf_end, *key; in kobject_action_args() local 141 next = buf + UUID_STRING_LEN; in kobject_action_args() 144 while (next <= buf_end) { in kobject_action_args() 145 if (*next ! in kobject_action_args() [all...] |
/kernel/linux/linux-6.6/arch/x86/kernel/ |
H A D | process_64.c | 302 * The next task is using 64-bit TLS, is not using this in load_seg_legacy() 319 * next states are fully zeroed, we can skip in load_seg_legacy() 337 * The next task is using a real segment. Loading the selector in load_seg_legacy() 345 * Store prev's PKRU value and load next's PKRU value if they differ. PKRU 351 struct thread_struct *next) in x86_pkru_load() 363 if (prev->pkru != next->pkru) in x86_pkru_load() 364 wrpkru(next->pkru); in x86_pkru_load() 368 struct thread_struct *next) in x86_fsgsbase_load() 372 if (unlikely(prev->fsindex || next->fsindex)) in x86_fsgsbase_load() 373 loadseg(FS, next in x86_fsgsbase_load() 350 x86_pkru_load(struct thread_struct *prev, struct thread_struct *next) x86_pkru_load() argument 367 x86_fsgsbase_load(struct thread_struct *prev, struct thread_struct *next) x86_fsgsbase_load() argument 564 struct thread_struct *next = &next_p->thread; __switch_to() local [all...] |
/kernel/linux/linux-6.6/security/apparmor/ |
H A D | match.c | 69 * unpack_table - unpack a dfa table (one of accept, default, base, next check) 174 /* next.size == chk.size */ in verify_table_headers() 231 pr_err("AppArmor DFA next/check upper bounds error\n"); in verify_dfa() 409 #define match_char(state, def, base, next, check, C) \ 419 (state) = (next)[pos]; \ 444 u16 *next = NEXT_TABLE(dfa); in aa_dfa_match_len() local 456 match_char(state, def, base, next, check, in aa_dfa_match_len() 459 /* default is direct to next state */ in aa_dfa_match_len() 461 match_char(state, def, base, next, check, (u8) *str++); in aa_dfa_match_len() 483 u16 *next in aa_dfa_match() local 521 u16 *next = NEXT_TABLE(dfa); aa_dfa_next() local 539 u16 *next = NEXT_TABLE(dfa); aa_dfa_outofband_transition() local 570 u16 *next = NEXT_TABLE(dfa); aa_dfa_match_until() local 631 u16 *next = NEXT_TABLE(dfa); aa_dfa_matchn_until() local 707 u16 *next = NEXT_TABLE(dfa); leftmatch_fb() local [all...] |
/kernel/linux/linux-6.6/lib/ |
H A D | kobject_uevent.c | 102 const char *next = buf; in action_arg_word_end() local 104 while (next <= buf_end && *next != delim) in action_arg_word_end() 105 if (!isalnum(*next++)) in action_arg_word_end() 108 if (next == buf) in action_arg_word_end() 111 return next; in action_arg_word_end() 118 const char *next, *buf_end, *key; in kobject_action_args() local 141 next = buf + UUID_STRING_LEN; in kobject_action_args() 144 while (next <= buf_end) { in kobject_action_args() 145 if (*next ! in kobject_action_args() [all...] |
/third_party/mesa3d/src/gallium/winsys/svga/drm/ |
H A D | pb_buffer_simple_fenced.c | 15 * next paragraph) shall be included in all copies or substantial portions 165 struct list_head *curr, *next; in fenced_manager_dump_locked() local 171 curr = fenced_mgr->unfenced.next; in fenced_manager_dump_locked() 172 next = curr->next; in fenced_manager_dump_locked() 181 curr = next; in fenced_manager_dump_locked() 182 next = curr->next; in fenced_manager_dump_locked() 185 curr = fenced_mgr->fenced.next; in fenced_manager_dump_locked() 186 next in fenced_manager_dump_locked() 365 struct list_head *curr, *next; fenced_manager_check_signalled_locked() local [all...] |