/kernel/linux/linux-6.6/fs/jffs2/ |
H A D | build.c | 40 if (ic->next) in next_inode() 41 return ic->next; in next_inode() 61 for(fd = ic->scan_dents; fd; fd = fd->next) { in jffs2_build_inode_pass1() 151 dead_fds = fd->next; in jffs2_build_filesystem() 181 ic->scan_dents = fd->next; in jffs2_build_filesystem() 232 ic->scan_dents = fd->next; in jffs2_build_filesystem() 253 struct jffs2_raw_node_ref *next = raw->next_in_ino; in jffs2_build_remove_unlinked_inode() local 256 raw = next; in jffs2_build_remove_unlinked_inode() 267 ic->scan_dents = fd->next; in jffs2_build_remove_unlinked_inode() 295 fd->next in jffs2_build_remove_unlinked_inode() [all...] |
/kernel/linux/linux-6.6/fs/xfs/ |
H A D | xfs_mru_cache.c | 232 struct xfs_mru_cache_elem *elem, *next; variable 236 list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) { 249 list_for_each_entry_safe(elem, next, &tmp, list_node) { 261 * keep when the next reap must occur so we can determine 270 unsigned long now, next; in _xfs_mru_cache_reap() local 277 next = _xfs_mru_cache_migrate(mru, jiffies); in _xfs_mru_cache_reap() 280 mru->queued = next; in _xfs_mru_cache_reap() 283 if (next <= now) in _xfs_mru_cache_reap() 284 next = 0; in _xfs_mru_cache_reap() 286 next in _xfs_mru_cache_reap() [all...] |
/kernel/linux/linux-6.6/scripts/dtc/ |
H A D | srcpos.c | 15 struct search_path *next; /* next node in list, NULL for end */ member 140 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path() 221 node->next = NULL; in srcfile_add_search_path() 229 search_path_tail = &node->next; in srcfile_add_search_path() 263 assert(pos->next == NULL); in srcpos_copy() 281 for (p = pos; p->next != NULL; p = p->next); in srcpos_extend() 282 p->next = newtail; in srcpos_extend() 351 if (pos->next ! in srcpos_string_comment() [all...] |
/kernel/linux/linux-6.6/scripts/gcc-plugins/ |
H A D | stackleak_plugin.c | 270 rtx_insn *insn, *next; in remove_stack_tracking_gcall() local 283 for (insn = get_insns(); insn; insn = next) { in remove_stack_tracking_gcall() 286 next = NEXT_INSN(insn); in remove_stack_tracking_gcall() 324 if (GET_CODE(next) == NOTE && in remove_stack_tracking_gcall() 325 NOTE_KIND(next) == NOTE_INSN_CALL_ARG_LOCATION) { in remove_stack_tracking_gcall() 326 insn = next; in remove_stack_tracking_gcall() 327 next = NEXT_INSN(insn); in remove_stack_tracking_gcall() 337 rtx_insn *insn, *next; in remove_stack_tracking_gasm() local 353 for (insn = get_insns(); insn; insn = next) { in remove_stack_tracking_gasm() 356 next in remove_stack_tracking_gasm() [all...] |
/kernel/linux/linux-6.6/net/netfilter/ipvs/ |
H A D | ip_vs_proto.c | 53 pp->next = ip_vs_proto_table[hash]; in register_ip_vs_protocol() 76 pd->next = ipvs->proto_data_table[hash]; in register_ip_vs_proto_netns() 84 ipvs->proto_data_table[hash] = pd->next; in register_ip_vs_proto_netns() 102 for (; *pp_p; pp_p = &(*pp_p)->next) { in unregister_ip_vs_protocol() 104 *pp_p = pp->next; in unregister_ip_vs_protocol() 124 for (; *pd_p; pd_p = &(*pd_p)->next) { in unregister_ip_vs_proto_netns() 126 *pd_p = pd->next; in unregister_ip_vs_proto_netns() 145 for (pp = ip_vs_proto_table[hash]; pp; pp = pp->next) { in ip_vs_proto_get() 163 for (pd = ipvs->proto_data_table[hash]; pd; pd = pd->next) { in ip_vs_proto_data_get() 181 for (pd = ipvs->proto_data_table[i]; pd; pd = pd->next) { in ip_vs_protocol_timeout_change() [all...] |
/third_party/mesa3d/src/compiler/nir/ |
H A D | nir_opt_dead_cf.c | 11 * The above copyright notice and this permission notice (including the next 346 if (!exec_node_is_tail_sentinel(cur->node.next)) { in dead_cf_list() 363 nir_block *next = nir_cf_node_as_block(nir_cf_node_next(cur)); in dead_cf_list() local 364 if (!exec_list_is_empty(&next->instr_list) || in dead_cf_list() 365 !exec_node_is_tail_sentinel(next->cf_node.node.next)) { in dead_cf_list() 379 nir_block *next = nir_cf_node_as_block(nir_cf_node_next(cur)); in dead_cf_list() local 380 if (next->predecessors->entries == 0 && in dead_cf_list() 381 (!exec_list_is_empty(&next->instr_list) || in dead_cf_list() 382 !exec_node_is_tail_sentinel(next in dead_cf_list() [all...] |
/third_party/mesa3d/src/compiler/glsl/ |
H A D | opt_tree_grafting.cpp | 11 * The above copyright notice and this permission notice (including the next 326 for (ir_instruction *ir = (ir_instruction *)start->next; in try_tree_grafting() 327 ir != bb_last->next; in try_tree_grafting() 328 ir = (ir_instruction *)ir->next) { in try_tree_grafting() 350 ir_instruction *ir, *next; in tree_grafting_basic_block() local 352 for (ir = bb_first, next = (ir_instruction *)ir->next; in tree_grafting_basic_block() 353 ir != bb_last->next; in tree_grafting_basic_block() 354 ir = next, next in tree_grafting_basic_block() [all...] |
/third_party/node/deps/v8/src/handles/ |
H A D | handles-inl.h | 85 prev_next_ = data->next; in HandleScope() 123 std::swap(current->next, prev_next); in CloseScope() 132 ZapRange(current->next, limit); in CloseScope() 135 current->next, in CloseScope() 137 reinterpret_cast<Address>(current->next))); in CloseScope() 156 prev_next_ = current->next; in CloseAndEscape() 165 Address* result = data->next; in CreateHandle() 169 // Update the current next field, set the value in the created handle, in CreateHandle() 173 data->next = reinterpret_cast<Address*>(reinterpret_cast<Address>(result) + in CreateHandle() 197 current->limit = current->next; in SealHandleScope() [all...] |
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/ |
H A D | driver_utils.cpp | 235 char *next; in ParseLinuxOSVersion() local 236 *major = static_cast<int>(strtol(version, &next, 10)); in ParseLinuxOSVersion() 237 if (next == nullptr || *next != '.' || errno != 0) in ParseLinuxOSVersion() 242 *minor = static_cast<int>(strtol(next + 1, &next, 10)); in ParseLinuxOSVersion() 243 if (next == nullptr || *next != '.' || errno != 0) in ParseLinuxOSVersion() 248 *patch = static_cast<int>(strtol(next + 1, &next, 1 in ParseLinuxOSVersion() [all...] |
/third_party/selinux/libsepol/src/ |
H A D | nodes.c | 156 for (c = head; c != NULL; c = c->next) in sepol_node_count() 160 for (c = head; c != NULL; c = c->next) in sepol_node_count() 186 for (c = head; c; c = c->next) { in sepol_node_exists() 202 for (c = head; c; c = c->next) { in sepol_node_exists() 246 for (c = head; c; c = c->next) { in sepol_node_query() 265 for (c = head; c; c = c->next) { in sepol_node_query() 317 node->next = policydb->ocontexts[OCON_NODE]; in sepol_node_modify() 324 node->next = policydb->ocontexts[OCON_NODE6]; in sepol_node_modify() 357 for (c = head; c; c = c->next) { in sepol_node_iterate() 376 for (c = head; c; c = c->next) { in sepol_node_iterate() [all...] |
/third_party/selinux/libsepol/cil/test/unit/ |
H A D | test_cil_copy_ast.c | 73 CuAssertStrEquals(tc, copy_list->head->next->data, cil_l->head->next->data); in test_cil_copy_list() 75 CuAssertIntEquals(tc, copy_list->head->next->flavor, cil_l->head->next->flavor); in test_cil_copy_list() 95 CuAssertStrEquals(tc, copy_list->head->next->data, cil_l->head->next->data); in test_cil_copy_list_sublist() 96 CuAssertStrEquals(tc, ((struct cil_list *)copy_list->head->next->next->data)->head->data, ((struct cil_list *)cil_l->head->next->next in test_cil_copy_list_sublist() [all...] |
/foundation/communication/dsoftbus/core/bus_center/lnn/lane_hub/lane_manager/src/ |
H A D | lnn_lane_reliability.c | 51 LaneDetectInfo *next = NULL; in GetSameLaneDetectInfo() local 52 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneDetectList.list, LaneDetectInfo, node) { in GetSameLaneDetectInfo() 110 LaneDetectInfo *next = NULL; in DelLaneDetectInfo() local 111 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneDetectList.list, LaneDetectInfo, node) { in DelLaneDetectInfo() 126 LaneDetectInfo *next = NULL; in GetLaneDetectInfoByWlanFd() local 127 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneDetectList.list, LaneDetectInfo, node) { in GetLaneDetectInfoByWlanFd() 237 LaneDetectInfo *next = NULL; in GetAllDetectInfoWithDetectId() local 238 LIST_FOR_EACH_ENTRY_SAFE(item, next, &g_laneDetectList.list, LaneDetectInfo, node) { in GetAllDetectInfoWithDetectId() 258 LaneDetectInfo *next = NULL; in NotifyWlanDetectResult() local 259 LIST_FOR_EACH_ENTRY_SAFE(item, next, in NotifyWlanDetectResult() 345 LaneDetectInfo *next = NULL; NotifyDetectTimeout() local 380 LaneDetectInfo *next = NULL; DeinitLaneReliability() local [all...] |
/kernel/linux/linux-5.10/drivers/tty/ |
H A D | tty_buffer.c | 102 p->next = NULL; in tty_buffer_reset() 119 struct tty_buffer *p, *next; in tty_buffer_free_all() local 125 buf->head = p->next; in tty_buffer_free_all() 131 llist_for_each_entry_safe(p, next, llist, free) in tty_buffer_free_all() 224 struct tty_buffer *next; in tty_buffer_flush() local 232 while ((next = smp_load_acquire(&buf->head->next)) != NULL) { in tty_buffer_flush() 234 buf->head = next; in tty_buffer_flush() 284 * advanced to the next buffer in __tty_buffer_request_room() 286 smp_store_release(&b->next, in __tty_buffer_request_room() 489 struct tty_buffer *next; flush_to_ldisc() local [all...] |
/kernel/linux/linux-5.10/samples/bpf/ |
H A D | test_lru_dist.c | 37 struct list_head *next, *prev; member 42 list->next = list; in INIT_LIST_HEAD() 48 return head->next == head; in list_empty() 53 struct list_head *next) in __list_add() 55 next->prev = new; in __list_add() 56 new->next = next; in __list_add() 58 prev->next = new; in __list_add() 63 __list_add(new, head, head->next); in list_add() 66 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument 51 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument [all...] |
/kernel/linux/linux-5.10/tools/lib/traceevent/ |
H A D | kbuffer-parse.c | 35 * @next - offset from @data to the start of next event 51 unsigned int next; member 294 kbuf->next = kbuf->size; in old_update_pointers() 309 kbuf->next = kbuf->size; in old_update_pointers() 325 kbuf->next = kbuf->index + length; in old_update_pointers() 335 kbuf->curr = kbuf->next; in __old_next_event() 336 if (kbuf->next >= kbuf->size) in __old_next_event() 403 kbuf->next = kbuf->index + length; in update_pointers() 454 kbuf->curr = kbuf->next; in __next_event() [all...] |
/third_party/alsa-lib/src/pcm/ |
H A D | pcm_hooks.c | 82 struct list_head *pos, *next; in snd_pcm_hooks_close() local 86 list_for_each_safe(pos, next, &h->hooks[SND_PCM_HOOK_TYPE_CLOSE]) { in snd_pcm_hooks_close() 96 pos = hooks->next; in snd_pcm_hooks_close() 102 pos = h->dllist.next; in snd_pcm_hooks_close() 114 struct list_head *pos, *next; in snd_pcm_hooks_hw_params() local 118 list_for_each_safe(pos, next, &h->hooks[SND_PCM_HOOK_TYPE_HW_PARAMS]) { in snd_pcm_hooks_hw_params() 130 struct list_head *pos, *next; in snd_pcm_hooks_hw_free() local 134 list_for_each_safe(pos, next, &h->hooks[SND_PCM_HOOK_TYPE_HW_FREE]) { in snd_pcm_hooks_hw_free() 348 snd_config_iterator_t i, next; in snd_pcm_hook_add_conf() local 356 snd_config_for_each(i, next, con in snd_pcm_hook_add_conf() 484 snd_config_iterator_t i, next; _snd_pcm_hooks_open() local [all...] |
/third_party/musl/src/network/ |
H A D | res_msend.c | 113 int next; in res_msend_rc_ext() local 217 next = 0; in res_msend_rc_ext() 248 while (next < nqueries) { in res_msend_rc_ext() 254 { .iov_base = (void *)answers[next], in res_msend_rc_ext() 305 for (i=next; i<nqueries && ( in res_msend_rc_ext() 306 answers[next][0] != queries[i][0] || in res_msend_rc_ext() 307 answers[next][1] != queries[i][1] ); i++); in res_msend_rc_ext() 314 switch (answers[next][3] & 15) { in res_msend_rc_ext() 327 /* Store answer in the right slot, or update next in res_msend_rc_ext() 330 if (i == next) in res_msend_rc_ext() [all...] |
/third_party/lwip/src/core/ipv6/ |
H A D | mld6.c | 103 struct mld_group *next = group->next; /* avoid use-after-free below */ in mld6_stop() local 113 /* move to "next" */ in mld6_stop() 114 group = next; in mld6_stop() 131 group = group->next; in mld6_report_groups() 152 group = group->next; in mld6_lookfor_group() 179 group->next = netif_mld6_data(ifp); in mld6_new_group() 200 netif_set_client_data(netif, LWIP_NETIF_CLIENT_DATA_INDEX_MLD6, group->next); in mld6_remove_group() 204 for (tmpGroup = netif_mld6_data(netif); tmpGroup != NULL; tmpGroup = tmpGroup->next) { in mld6_remove_group() 205 if (tmpGroup->next in mld6_remove_group() [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/pthread_create/ |
H A D | s-c1.c | 102 /* The next structure is used to save the tests measures */ 106 struct __mes_t *next; member 159 m_cur->next = NULL; in main() 299 if (m_cur->next == NULL) { in main() 309 m_tmp->next = NULL; in main() 316 m_cur->next = m_tmp; in main() 319 /* Add this measure to the next element */ in main() 320 m_cur = m_cur->next; in main() 390 } /* next scenario */ in main() 407 while (sentinel.next ! in main() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/IntelJITEvents/ |
H A D | ittnotify_config.h | 308 struct ___itt_thread_info* next; member 347 struct ___itt_global* next; member 366 h->next = NULL; \ 370 h_tail->next = h; \ 383 h->next = NULL; \ 387 h_tail->next = h; \ 399 h->next = NULL; \ 403 h_tail->next = h; \ 415 h->next = NULL; \ 419 h_tail->next [all...] |
/third_party/skia/experimental/sktext/tests/ |
H A D | SelectableText.cpp | 206 auto next = selectableText->nextPosition(position); in UNIX_ONLY_TEST() local 207 REPORTER_ASSERT(reporter, position.fTextRange.fEnd == next.fTextRange.fStart); in UNIX_ONLY_TEST() 208 if (position.fLineIndex == next.fLineIndex - 1) { in UNIX_ONLY_TEST() 209 auto line = selectableText->getLine(next.fLineIndex); in UNIX_ONLY_TEST() 210 REPORTER_ASSERT(reporter, next.fGlyphRange.fStart == 0); in UNIX_ONLY_TEST() 211 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(next.fBoundaries.fLeft, 0.0f)); in UNIX_ONLY_TEST() 212 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(next.fBoundaries.fTop, line.fBounds.fTop)); in UNIX_ONLY_TEST() 213 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(next.fBoundaries.height(), line.fBounds.height())); in UNIX_ONLY_TEST() 215 REPORTER_ASSERT(reporter, position.fLineIndex == next.fLineIndex); in UNIX_ONLY_TEST() 216 REPORTER_ASSERT(reporter, position.fGlyphRange.fEnd == next in UNIX_ONLY_TEST() [all...] |
/third_party/zlib/examples/ |
H A D | gun.c | 93 unsigned char *next; in in() local 96 next = me->inbuf; in in() 97 *buf = next; in in() 103 ret = (int)read(me->infile, next, ret); in in() 108 next += ret; in in() 154 /* next input byte macro for use inside lunpipe() and gunpipe() */ 155 #define NEXT() (have ? 0 : (have = in(indp, &next)), \ 156 last = have ? (have--, (int)(*next++)) : -1) 187 next += chunk; \ 193 of buffered input at next 200 lunpipe(unsigned have, z_const unsigned char *next, struct ind *indp, int outfile, z_stream *strm) lunpipe() argument 387 z_const unsigned char *next = NULL; gunpipe() local [all...] |
/kernel/linux/linux-6.6/fs/btrfs/ |
H A D | relocation.c | 201 edge = list_entry(node->upper.next, in walk_up_backref() 212 * walk down backref nodes to find start of next reference path 228 edge = list_entry(edge->list[LOWER].next, in walk_down_backref() 272 node = list_entry(cache->detached.next, in update_backref_cache() 278 node = list_entry(cache->changed.next, in update_backref_cache() 424 edge = list_entry(cur->lower.next, in handle_useless_nodes() 623 new_edge = list_entry(new_node->lower.next, in clone_backref_node() 1435 * helper to find next relocated block in reloc tree 1644 struct btrfs_root *next; in clean_dirty_subvols() local 1648 list_for_each_entry_safe(root, next, in clean_dirty_subvols() 2159 struct btrfs_backref_node *next; select_reloc_root() local 2281 struct btrfs_backref_node *next; select_one_root() local 2325 struct btrfs_backref_node *next = node; calcu_metadata_size() local 2606 struct btrfs_backref_node *next = node; update_processed_blocks() local 2778 struct tree_block *next; relocate_tree_blocks() local [all...] |
/kernel/linux/linux-5.10/arch/xtensa/include/asm/ |
H A D | switch_to.h | 15 extern void *_switch_to(void *last, void *next); 17 #define switch_to(prev,next,last) \ 19 (last) = _switch_to(prev, next); \
|
/kernel/linux/linux-6.6/arch/xtensa/include/asm/ |
H A D | switch_to.h | 15 extern void *_switch_to(void *last, void *next); 17 #define switch_to(prev,next,last) \ 19 (last) = _switch_to(prev, next); \
|