Home
last modified time | relevance | path

Searched refs:next (Results 4026 - 4050 of 12627) sorted by relevance

1...<<161162163164165166167168169170>>...506

/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbset.c23 struct bkey *k, *next; in bch_dump_bset() local
25 for (k = i->start; k < bset_bkey_last(i); k = next) { in bch_dump_bset()
26 next = bkey_next(k); in bch_dump_bset()
36 if (next < bset_bkey_last(i) && in bch_dump_bset()
38 &START_KEY(next) : next) > 0) in bch_dump_bset()
113 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check() local
115 if (next < iter->data->end && in bch_btree_iter_next_check()
117 &START_KEY(next) : next) > in bch_btree_iter_next_check()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/net/mptcp/
H A Dmptcp_connect.c550 int next = read(fd, msg_buf, sizeof(msg_buf)); in do_recvmsg_cmsg() local
553 ret, (unsigned int)len, last_hint, tcp_inq.last, next); in do_recvmsg_cmsg()
1162 char *next = strchr(type, ','); in parse_cmsg_types() local
1167 if (next) { in parse_cmsg_types()
1168 parse_cmsg_types(next + 1); in parse_cmsg_types()
1169 len = next - type; in parse_cmsg_types()
1190 char *next = strchr(name, ','); in parse_setsock_options() local
1193 if (next) { in parse_setsock_options()
1194 parse_setsock_options(next + 1); in parse_setsock_options()
1195 len = next in parse_setsock_options()
[all...]
/kernel/liteos_a/net/lwip-2.1/porting/src/
H A Dsockets.c437 for (netif = group->netif_list; netif != NULL; netif = netif->next) {
439 for (netif = netif_list; netif != NULL; netif = netif->next) {
500 for (netif = group->netif_list; netif != NULL; netif = netif->next) {
502 for (netif = netif_list; netif != NULL; netif = netif->next) {
637 loc_netif = loc_netif->next;
645 loc_netif = loc_netif->next;
808 loc_netif = loc_netif->next;
816 loc_netif = loc_netif->next;
1074 for (netif = group->netif_list; netif != NULL; netif = netif->next) {
1076 for (netif = netif_list; netif != NULL; netif = netif->next) {
[all...]
/kernel/linux/linux-6.6/kernel/trace/
H A Dtrace_functions_graph.c430 struct ftrace_graph_ret_entry *next; in get_return_for_leaf() local
438 next = &data->ret; in get_return_for_leaf()
443 /* First peek to compare current entry and the next one */ in get_return_for_leaf()
449 * the next one. in get_return_for_leaf()
460 next = ring_buffer_event_data(event); in get_return_for_leaf()
464 * Save current and next entries for later reference in get_return_for_leaf()
469 * If the next event is not a return type, then in get_return_for_leaf()
473 if (next->ent.type == TRACE_GRAPH_RET) in get_return_for_leaf()
474 data->ret = *next; in get_return_for_leaf()
476 data->ret.ent.type = next in get_return_for_leaf()
[all...]
H A Dtrace_events_trigger.c201 .next = trigger_next,
249 char *command, *next; in trigger_process_regex() local
253 next = buff = skip_spaces(buff); in trigger_process_regex()
254 command = strsep(&next, ": \t"); in trigger_process_regex()
255 if (next) { in trigger_process_regex()
256 next = skip_spaces(next); in trigger_process_regex()
257 if (!*next) in trigger_process_regex()
258 next = NULL; in trigger_process_regex()
265 ret = p->parse(p, file, buff, command, next); in trigger_process_regex()
[all...]
/kernel/linux/linux-6.6/kernel/time/
H A Dhrtimer.c185 * We do not migrate the timer when it is expiring before the next
513 struct timerqueue_node *next; in __hrtimer_next_event_base() local
516 next = timerqueue_getnext(&base->active); in __hrtimer_next_event_base()
517 timer = container_of(next, struct hrtimer, node); in __hrtimer_next_event_base()
519 /* Get to the next timer in the queue. */ in __hrtimer_next_event_base()
520 next = timerqueue_iterate_next(next); in __hrtimer_next_event_base()
521 if (!next) in __hrtimer_next_event_base()
524 timer = container_of(next, struct hrtimer, node); in __hrtimer_next_event_base()
688 * next even
915 struct timerqueue_node *next; update_needs_ipi() local
[all...]
/third_party/ffmpeg/libavformat/
H A Davisynth.c104 struct AviSynthContext *next; member
201 avs->next = avs_ctx_list; in avisynth_context_create()
214 avs_ctx_list = avs->next; in avisynth_context_destroy()
217 while (prev->next != avs) in avisynth_context_destroy()
218 prev = prev->next; in avisynth_context_destroy()
219 prev->next = avs->next; in avisynth_context_destroy()
237 AviSynthContext *next = avs->next; in avisynth_atexit_handler() local
239 avs = next; in avisynth_atexit_handler()
[all...]
H A Dflvenc.c76 struct FLVFileposition *next; member
564 position->next = NULL; in flv_append_keyframe_info()
566 flv->filepositions->next = position; in flv_append_keyframe_info()
567 position->next = NULL; in flv_append_keyframe_info()
568 flv->filepositions = flv->filepositions->next; in flv_append_keyframe_info()
761 for (newflv_posinfo = flv->head_filepositions; newflv_posinfo; newflv_posinfo = newflv_posinfo->next) { in flv_write_trailer()
767 for (newflv_posinfo = flv->head_filepositions; newflv_posinfo; newflv_posinfo = newflv_posinfo->next) { in flv_write_trailer()
1043 FLVFileposition *next = filepos->next; in flv_deinit() local
1045 filepos = next; in flv_deinit()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DLiveInterval.cpp164 iterator MergeTo = std::next(I); in extendSegmentEndTo()
180 segments().erase(std::next(I), MergeTo); in extendSegmentEndTo()
215 segments().erase(std::next(MergeTo), std::next(I)); in extendSegmentStartTo()
241 // Otherwise, if this segment ends in the middle of, or right next in addSegment()
507 // Get next segment and abort if it was not adjacent.
627 segments.insert(std::next(I), Segment(End, OldEnd, ValNo));
667 for (iterator I = std::next(OutIt), E = end(); I != E; ++I) {
677 // Didn't merge. Move OutIt to the next segment,
832 // Go to the next segmen
[all...]
/third_party/skia/src/core/
H A DSkRegion.cpp74 * Return the beginning of the next scanline (i.e. the next Y-value)
230 iter.next(); in toString()
244 iter.next(); in toString()
701 void next() { in next() function
789 rec.next(); in operate_on_span()
842 // skip X values and slots for the next Y+intervalCount in addSpan()
1405 void SkRegion::Iterator::next() { in next() function in SkRegion::Iterator
1457 fIter.next(); in Cliperator()
1461 void SkRegion::Cliperator::next() { in next() function in SkRegion::Cliperator
1528 bool SkRegion::Spanerator::next(int* left, int* right) { next() function in SkRegion::Spanerator
[all...]
/third_party/rust/crates/regex/src/
H A Dcompile.rs493 let next = self.insts.len(); in c_class_bytes()
499 prev_hole = self.fill_split(split, Some(next), None); in c_class_bytes()
501 let next = self.insts.len(); in c_class_bytes()
507 self.fill(prev_hole, next); in c_class_bytes()
522 match exprs.next() { in c_concat()
558 let next = self.insts.len(); in c_alternate()
559 self.fill_split(prev_hole.0, None, Some(next)); in c_alternate()
767 let next = self.insts.len(); in fill_to_next()
768 self.fill(hole, next); in fill_to_next()
996 let utf8_seq = match it.next() { in compile()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/
H A Deloop.c346 int next; in eloop_sock_table_add_sock() local
385 next = new_max_sock + 16; in eloop_sock_table_add_sock()
386 temp_table = os_realloc_array(eloop.fd_table, next, in eloop_sock_table_add_sock()
391 eloop.max_fd = next; in eloop_sock_table_add_sock()
398 next = eloop.epoll_max_event_num == 0 ? 8 : in eloop_sock_table_add_sock()
400 temp_events = os_realloc_array(eloop.epoll_events, next, in eloop_sock_table_add_sock()
408 eloop.epoll_max_event_num = next; in eloop_sock_table_add_sock()
414 next = eloop.kqueue_nevents == 0 ? 8 : eloop.kqueue_nevents * 2; in eloop_sock_table_add_sock()
415 temp_events = os_malloc(next * sizeof(*temp_events)); in eloop_sock_table_add_sock()
425 eloop.kqueue_nevents = next; in eloop_sock_table_add_sock()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/
H A Deloop.c348 size_t next; in eloop_sock_table_add_sock() local
388 next = new_max_sock + 16; in eloop_sock_table_add_sock()
389 temp_table = os_realloc_array(eloop.fd_table, next, in eloop_sock_table_add_sock()
394 eloop.max_fd = next; in eloop_sock_table_add_sock()
401 next = eloop.epoll_max_event_num == 0 ? 8 : in eloop_sock_table_add_sock()
403 temp_events = os_realloc_array(eloop.epoll_events, next, in eloop_sock_table_add_sock()
411 eloop.epoll_max_event_num = next; in eloop_sock_table_add_sock()
417 next = eloop.kqueue_nevents == 0 ? 8 : eloop.kqueue_nevents * 2; in eloop_sock_table_add_sock()
418 temp_events = os_malloc(next * sizeof(*temp_events)); in eloop_sock_table_add_sock()
428 eloop.kqueue_nevents = next; in eloop_sock_table_add_sock()
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/sw/rdmavt/
H A Dqp.c199 * Calculate the table size - the next power of 2 larger than the in rvt_wss_init()
237 * race - the next possible racer will not start until the next clean
267 * Uniquely grab the entry to clean and move to next. in wss_advance_clean_counter()
371 /* next page */ in init_qpn_table()
521 * alloc_qpn - Allocate the next available qpn or zero/one for QP type
792 qpp = &q->next) { in rvt_remove_qp()
795 rcu_dereference_protected(qp->next, in rvt_remove_qp()
1138 RCU_INIT_POINTER(qp->next, NULL); in rvt_create_qp()
1441 qp->next in rvt_insert_qp()
1850 u32 next; rvt_post_recv() local
2016 u32 next; rvt_post_one_wr() local
2264 u32 next; rvt_post_srq_recv() local
[all...]
/kernel/linux/linux-5.10/kernel/trace/
H A Dring_buffer.c331 local_t write; /* index for next write */
332 unsigned read; /* index for next read */
923 * empty. The flag only causes the next event to run in ring_buffer_wait()
1031 * is set, the next event will wake the task up, but we can get stuck in ring_buffer_poll_wait()
1121 * ASCII art, the reader sets its old page to point to the next
1137 * head->list->prev->next bit 1 bit 0
1199 * the reader page). But if the next page is a header page,
1208 val = (unsigned long)list->next; in rb_is_head_page()
1227 return rb_list_head(list->next) != &page->list; in rb_is_reader_page()
1238 ptr = (unsigned long *)&list->next; in rb_set_list_to_head()
[all...]
/kernel/linux/linux-6.6/fs/fuse/
H A Dfile.c400 struct fuse_writepage_args *next; member
1698 struct fuse_writepage_args *aux, *next; variable
1739 for (aux = wpa->next; aux; aux = next) {
1740 next = aux->next;
1741 aux->next = NULL;
1765 wpa = list_entry(fi->queued_writes.next,
1829 while (wpa->next) { in fuse_writepage_end()
1832 struct fuse_writepage_args *next in fuse_writepage_end() local
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/sw/rdmavt/
H A Dqp.c157 * Calculate the table size - the next power of 2 larger than the in rvt_wss_init()
195 * race - the next possible racer will not start until the next clean
225 * Uniquely grab the entry to clean and move to next. in wss_advance_clean_counter()
330 /* next page */ in init_qpn_table()
480 * alloc_qpn - Allocate the next available qpn or zero/one for QP type
752 qpp = &q->next) { in rvt_remove_qp()
755 rcu_dereference_protected(qp->next, in rvt_remove_qp()
1098 RCU_INIT_POINTER(qp->next, NULL); in rvt_create_qp()
1385 qp->next in rvt_insert_qp()
1798 u32 next; rvt_post_recv() local
1965 u32 next; rvt_post_one_wr() local
2213 u32 next; rvt_post_srq_recv() local
[all...]
/kernel/linux/linux-5.10/drivers/edac/
H A Dxgene_edac.c132 struct list_head next; member
421 list_add(&ctx->next, &edac->mcus); in xgene_edac_mc_add()
509 struct list_head next; member
963 list_add(&ctx->next, &edac->pmds); in xgene_edac_pmd_add()
1017 struct list_head next; member
1246 list_add(&ctx->next, &edac->l3s); in xgene_edac_l3_add()
1784 list_add(&ctx->next, &edac->socs); in xgene_edac_soc_add()
1826 list_for_each_entry(mcu, &ctx->mcus, next) in xgene_edac_isr()
1830 list_for_each_entry(pmd, &ctx->pmds, next) { in xgene_edac_isr()
1835 list_for_each_entry(node, &ctx->l3s, next) in xgene_edac_isr()
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/intersil/hostap/
H A Dhostap_ap.c305 * broadcast, so it may be delayed until next DTIM; there is not much in hostap_deauth_all_stas()
374 .next = ap_control_proc_next,
404 for (ptr = mac_restrictions->mac_list.next; in ap_control_del_mac()
405 ptr != &mac_restrictions->mac_list; ptr = ptr->next) { in ap_control_del_mac()
455 for (ptr = mac_restrictions->mac_list.next, n = ptr->next; in ap_control_flush_macs()
457 ptr = n, n = ptr->next) { in ap_control_flush_macs()
504 for (ptr = ap->sta_list.next, n = ptr->next; ptr != &ap->sta_list; in ap_control_kickall()
505 ptr = n, n = ptr->next) { in ap_control_kickall()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/sun/
H A Dsunvnet_common.c280 * area so we can round the copy length up to the next multiple of
757 * send out another START message at the next TX.
1015 BUG_ON(port->tx_bufs[txi].skb->next); in vnet_clean_tx_ring()
1017 port->tx_bufs[txi].skb->next = skb; in vnet_clean_tx_ring()
1034 struct sk_buff *next; in vnet_free_skbs() local
1037 next = skb->next; in vnet_free_skbs()
1038 skb->next = NULL; in vnet_free_skbs()
1040 skb = next; in vnet_free_skbs()
1226 struct sk_buff *segs, *curr, *next; in vnet_handle_offloads() local
[all...]
/kernel/linux/linux-5.10/drivers/usb/host/
H A Dehci-sched.c27 * periodic_next_shadow - return "next" pointer on shadow list
81 /* update shadow and hardware lists ... the old "next" pointers in periodic_unlink()
419 * (different dev or endpoint) until the next uframe. in tt_no_collision()
623 ehci->qh_scan_next = list_entry(qh->intr_node.next, in qh_unlink_periodic()
670 else if (ehci->intr_unlink.next == &qh->unlink_node) { in start_unlink_intr()
691 else if (ehci->intr_unlink_wait.next == &qh->unlink_node) { in start_unlink_intr_wait()
742 /* complete split running into next frame? in check_period()
976 * always holds the next qh to scan; if the next qh in scan_intr()
1390 /* for IN, don't wrap CSPLIT into the next fram in sitd_slot_ok()
1466 u32 now, base, next, start, period, span, now2; iso_stream_schedule() local
[all...]
H A Dsl811-hcd.c297 /* pick the next endpoint for a transaction, and issue it.
312 sl811->next_periodic = ep->next; in start()
317 ep = container_of(sl811->async.next, in start()
321 * transfer for the next frame ... in start()
331 if (ep->schedule.next == &sl811->async) in start()
334 sl811->next_async = container_of(ep->schedule.next, in start()
344 urb = container_of(ep->hep->urb_list.next, struct urb, urb_list); in start()
348 * packet, wait till the next frame. too-simple algorithm... in start()
457 prev = &temp->next;
459 *prev = ep->next;
[all...]
/kernel/linux/linux-5.10/kernel/printk/
H A Dprintk.c397 /* the next printk record to read by syslog(READ) or /proc/kmsg */
402 /* the next printk record to write to the console */
407 /* the next printk record to read after the last 'clear' command */
984 VMCOREINFO_OFFSET(prb_data_blk_lpos, next); in log_buf_vmcoreinfo_setup()
1366 char *next; in record_print_text() local
1384 next = memchr(text, '\n', text_len); in record_print_text()
1385 if (next) { in record_print_text()
1386 line_len = next - text; in record_print_text()
1496 /* message is gone, move to next valid one */ in syslog_print()
2839 newcon->next in register_console()
[all...]
/kernel/linux/linux-6.6/drivers/usb/host/
H A Dehci-sched.c27 * periodic_next_shadow - return "next" pointer on shadow list
81 /* update shadow and hardware lists ... the old "next" pointers in periodic_unlink()
425 * (different dev or endpoint) until the next uframe. in tt_no_collision()
630 ehci->qh_scan_next = list_entry(qh->intr_node.next, in qh_unlink_periodic()
677 else if (ehci->intr_unlink.next == &qh->unlink_node) { in start_unlink_intr()
698 else if (ehci->intr_unlink_wait.next == &qh->unlink_node) { in start_unlink_intr_wait()
749 /* complete split running into next frame? in check_period()
983 * always holds the next qh to scan; if the next qh in scan_intr()
1401 /* for IN, don't wrap CSPLIT into the next fram in sitd_slot_ok()
1477 u32 now, base, next, start, period, span, now2; iso_stream_schedule() local
[all...]
H A Dsl811-hcd.c297 /* pick the next endpoint for a transaction, and issue it.
312 sl811->next_periodic = ep->next; in start()
317 ep = container_of(sl811->async.next, in start()
321 * transfer for the next frame ... in start()
331 if (ep->schedule.next == &sl811->async) in start()
334 sl811->next_async = container_of(ep->schedule.next, in start()
344 urb = container_of(ep->hep->urb_list.next, struct urb, urb_list); in start()
348 * packet, wait till the next frame. too-simple algorithm... in start()
457 prev = &temp->next;
459 *prev = ep->next;
[all...]

Completed in 54 milliseconds

1...<<161162163164165166167168169170>>...506