Home
last modified time | relevance | path

Searched refs:next (Results 6301 - 6325 of 12623) sorted by relevance

1...<<251252253254255256257258259260>>...505

/kernel/linux/linux-6.6/drivers/net/ethernet/i825xx/
H A Dsun3_82586.c595 p->xmit_buffs[i]->next = 0xffff; in init586()
647 rfd[i].next = make16(rfd + (i+1) % (p->num_recv_buffs+rfdadd) ); in alloc_rfa()
662 rbd[i].next = make16((rbd + (i+1) % p->num_recv_buffs)); in alloc_rfa()
805 rbd = (struct rbd_struct *) make32(rbd->next); in sun3_82586_rcv_int()
823 p->rfd_top = (struct rfd_struct *) make32(p->rfd_top->next); /* step to next RFD */ in sun3_82586_rcv_int()
847 printk("%s: RU hasn't fetched next RFD (not busy/complete)\n",dev->name); in sun3_82586_rcv_int()
863 rfds = (struct rfd_struct *) make32(rfds->next); in sun3_82586_rcv_int()
1089 /* linkpointer of xmit-command already points to next nop cmd */ in sun3_82586_send_packet()
/kernel/linux/linux-6.6/fs/nfs/
H A Dpagelist.c102 hdr->req = nfs_list_entry(mirror->pg_list.next); in nfs_pgheader_init()
452 struct nfs_page *tmp, *next; in nfs_page_group_destroy() local
459 next = tmp->wb_this_page; in nfs_page_group_destroy()
464 tmp = next; in nfs_page_group_destroy()
1022 req = nfs_list_entry(head->next); in nfs_generic_pgio()
1486 struct nfs_page *req = nfs_list_entry(pages.next); in nfs_pageio_resend()
/kernel/linux/linux-6.6/fs/hmdfs/comm/
H A Dconnection.c425 unsigned int next; in hmdfs_update_node_waiting_evt() local
455 next = hmdfs_node_inc_evt_seq(node); in hmdfs_update_node_waiting_evt()
456 node->seq_tbl[(node->seq_wr_idx++) % RAW_NODE_EVT_MAX_NR] = next; in hmdfs_update_node_waiting_evt()
457 *seq = next; in hmdfs_update_node_waiting_evt()
855 struct connection *next = NULL; in hmdfs_disconnect_node() local
872 list_for_each_entry_safe(conn_impl, next, &local_conns, list) { in hmdfs_disconnect_node()
/kernel/linux/linux-6.6/fs/ocfs2/
H A Dquota_local.c239 struct ocfs2_quota_chunk *pos, *next; in ocfs2_release_local_quota_bitmaps() local
241 list_for_each_entry_safe(pos, next, head, qc_chunk) { in ocfs2_release_local_quota_bitmaps()
318 struct ocfs2_recovery_chunk *next; in free_recovery_list() local
321 list_for_each_entry_safe(rchunk, next, head, rc_list) { in free_recovery_list()
471 struct ocfs2_recovery_chunk *rchunk, *next; in ocfs2_recover_local_quota_file() local
476 list_for_each_entry_safe(rchunk, next, &(rec->r_list[type]), rc_list) { in ocfs2_recover_local_quota_file()
/kernel/linux/linux-6.6/fs/overlayfs/
H A Dsuper.c1230 struct dentry *next = dentry, *parent; in ovl_check_layer() local
1236 parent = dget_parent(next); in ovl_check_layer()
1239 while (!err && parent != next) { in ovl_check_layer()
1246 next = parent; in ovl_check_layer()
1247 parent = dget_parent(next); in ovl_check_layer()
1248 dput(next); in ovl_check_layer()
/kernel/linux/linux-6.6/drivers/tty/serial/
H A Dip22zilog.c66 struct uart_ip22zilog_port *next; member
229 * until the next TX complete interrupt. Else, we do it right now.
364 /* TX still busy? Just wait for the next TX done interrupt. in ip22zilog_transmit_chars()
457 up = up->next; in ip22zilog_interrupt()
479 up = up->next; in ip22zilog_interrupt()
706 up->next->flags |= IP22ZILOG_FLAG_RESET_DONE; in __ip22zilog_reset()
1091 up[channel].next = &up[channel - 1]; in ip22zilog_prepare()
1092 up[channel].next = NULL; in ip22zilog_prepare()
/kernel/linux/linux-6.6/drivers/scsi/
H A Dscsi_scan.c181 struct async_scan_data *next = list_entry(scanning_hosts.next, in scsi_complete_async_scans() local
183 complete(&next->prev_finished); in scsi_complete_async_scans()
1928 struct async_scan_data *next = list_entry(scanning_hosts.next, in scsi_finish_async_scan() local
1930 complete(&next->prev_finished); in scsi_finish_async_scan()
/kernel/linux/linux-6.6/drivers/vfio/
H A Dvfio_main.c600 * vfio_mig_get_next_state - Compute the next step in the FSM
603 * @next_fsm - Pointer to the next step to get to new_fsm
606 * Upon success the next step in the state progression between cur_fsm and
610 * returns the next step to get to new_fsm. The function may need to be called
797 * driver will instead see an arc from the original state to the next in vfio_mig_get_next_state()
1404 * next offsets prior to copying to the user buffer.
1412 /* Ensure that the next capability struct will be aligned */ in vfio_info_cap_add()
1433 for (tmp = buf; tmp->next; tmp = buf + tmp->next) in vfio_info_cap_add()
1436 tmp->next in vfio_info_cap_add()
[all...]
/kernel/linux/linux-6.6/drivers/dma/
H A Dowl-dma.c130 * @OWL_DMADESC_NEXT_LLI: physical address of the next link list
366 struct owl_dma_lli *next, in owl_dma_add_lli()
370 list_add_tail(&next->node, &txd->lli_list); in owl_dma_add_lli()
373 prev->hw[OWL_DMADESC_NEXT_LLI] = next->phys; in owl_dma_add_lli()
378 return next; in owl_dma_add_lli()
661 * Start the next descriptor (if any), in owl_dma_interrupt()
792 /* Start from the next active node */ in owl_dma_getbytes_chan()
1053 struct owl_dma_vchan *next; in owl_dma_free() local
1056 next, &od->dma.channels, vc.chan.device_node) { in owl_dma_free()
364 owl_dma_add_lli(struct owl_dma_txd *txd, struct owl_dma_lli *prev, struct owl_dma_lli *next, bool is_cyclic) owl_dma_add_lli() argument
/kernel/linux/linux-6.6/drivers/firewire/
H A Dsbp2.c308 struct sbp2_pointer next; member
516 struct sbp2_orb *orb, *next; in sbp2_cancel_orbs() local
525 list_for_each_entry_safe(orb, next, &list, link) { in sbp2_cancel_orbs()
1216 struct sbp2_logical_unit *lu, *next; in sbp2_remove() local
1224 list_for_each_entry_safe(lu, next, &tgt->lu_list, link) { in sbp2_remove()
1459 orb->request.next.high = cpu_to_be32(SBP2_ORB_NULL); in sbp2_scsi_queuecommand()
/kernel/linux/linux-6.6/drivers/net/hamradio/
H A Dyam.c138 struct yam_mcs *next; member
385 p = p->next; in add_mcs()
395 p->next = yam_data; in add_mcs()
410 p = p->next; in get_mcs()
825 .next = yam_seq_next,
1172 yam_data = yam_data->next; in yam_cleanup_driver()
/kernel/linux/linux-6.6/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dusb.c411 req = list_entry(q->next, struct brcmf_usbreq, list); in brcmf_usb_deq()
412 list_del_init(q->next); in brcmf_usb_deq()
457 req = list_entry(q->next, struct brcmf_usbreq, list); in brcmf_usbdev_qinit()
460 list_del(q->next); in brcmf_usbdev_qinit()
469 struct brcmf_usbreq *req, *next; in brcmf_usb_free_q() local
471 list_for_each_entry_safe(req, next, q, list) { in brcmf_usb_free_q()
/kernel/linux/linux-6.6/drivers/pci/hotplug/
H A Dibmphp_ebda.c267 "ibmphp_ebda: next read is beyond ebda_sz\n")) in ibmphp_access_ebda()
270 next_offset = readw(io_mem + offset); /* offset of next blk */ in ibmphp_access_ebda()
295 re = readw(io_mem + sub_addr); /* next sub blk */ in ibmphp_access_ebda()
322 rc = readw(io_mem + sub_addr); /* next sub blk */ in ibmphp_access_ebda()
1033 struct bus_info *bus_info, *next; in ibmphp_free_bus_info_queue() local
1035 list_for_each_entry_safe(bus_info, next, &bus_info_head, in ibmphp_free_bus_info_queue()
1043 struct controller *controller = NULL, *next; in ibmphp_free_ebda_hpc_queue() local
1046 list_for_each_entry_safe(controller, next, &ebda_hpc_head, in ibmphp_free_ebda_hpc_queue()
1060 struct ebda_pci_rsrc *resource, *next; in ibmphp_free_ebda_pci_rsrc_queue() local
1062 list_for_each_entry_safe(resource, next, in ibmphp_free_ebda_pci_rsrc_queue()
[all...]
/kernel/linux/linux-6.6/tools/objtool/
H A Delf.c41 __node->next = __elf_table_entry(name, key); \
51 *head = node->next; in __elf_hash_del()
55 for (prev = NULL, cur = *head; cur; prev = cur, cur = cur->next) { in __elf_hash_del()
57 prev->next = cur->next; in __elf_hash_del()
75 obj = elf_list_entry(obj->member.next, typeof(*(obj)), member))
238 /* hole until start of next symbol */ in find_symbol_hole_containing()
626 /* get next data descriptor for the relevant sections */ in elf_update_symbol()
647 /* if @idx == 0, it's the next contiguous entry, create it */ in elf_update_symbol()
1266 /* get next dat in elf_truncate_section()
[all...]
/kernel/linux/linux-6.6/net/xfrm/
H A Dxfrm_interface_core.c147 for (xi = rcu_dereference(start); xi; xi = rcu_dereference(xi->next))
219 rcu_assign_pointer(xi->next , rtnl_dereference(*xip)); in xfrmi_link()
230 xip = &iter->next) { in xfrmi_unlink()
232 rcu_assign_pointer(*xip, xi->next); in xfrmi_unlink()
277 xip = &xi->next) in xfrmi_locate()
975 xip = &xi->next) in xfrmi_exit_batch_net()
/kernel/linux/linux-6.6/net/sched/
H A Dsch_netem.c159 * As skb->rbnode uses same storage than skb->next, skb->prev and skb->tstamp,
160 * and skb->next & skb->prev are scratch space for a qdisc,
169 /* we assume we can use skb next/prev/tstamp as storage for rb_node */ in netem_skb_cb()
215 * next state and if the next packet has to be transmitted or lost. in loss_4state()
268 * next state. A second random number is extracted and the comparison
269 * with the loss probability of the current state decides if the next
394 q->t_tail->next = nskb; in tfifo_enqueue()
508 segs = skb->next; in netem_enqueue()
531 skb->next in netem_enqueue()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/rseq/
H A Dparam_test.c360 struct percpu_list_node *next; member
612 node->next = (struct percpu_list_node *)expect; in this_cpu_list_push()
643 offset = offsetof(struct percpu_list_node, next); in this_cpu_list_pop()
672 list->c[cpu].head = node->next; in __percpu_list_pop()
728 node->next = list.c[i].head; in test_percpu_list()
1267 node->next = NULL; in test_membarrier_init_percpu_list()
/kernel/linux/linux-6.6/mm/damon/
H A Dsysfs.c1089 struct damon_target *t, *next; in damon_sysfs_destroy_targets() local
1092 damon_for_each_target_safe(t, next, ctx) { in damon_sysfs_destroy_targets()
1197 struct damon_target *t, *next; in damon_sysfs_set_targets() local
1204 damon_for_each_target_safe(t, next, ctx) { in damon_sysfs_set_targets()
1232 struct damon_target *t, *next; in damon_sysfs_before_terminate() local
1252 damon_for_each_target_safe(t, next, ctx) { in damon_sysfs_before_terminate()
1469 * DAMON, we free kdamond->damon_ctx in next in damon_sysfs_turn_damon_off()
/kernel/linux/linux-6.6/net/dccp/
H A Dfeat.c543 struct dccp_feat_entry *entry, *next; in dccp_feat_list_purge() local
545 list_for_each_entry_safe(entry, next, fn_list, node) in dccp_feat_list_purge()
629 * @skb: next sk_buff to be sent to the peer
637 struct dccp_feat_entry *pos, *next; in dccp_feat_insert_opts() local
642 list_for_each_entry_safe_reverse(pos, next, fn, node) { in dccp_feat_insert_opts()
1513 struct dccp_feat_entry *cur, *next; in dccp_feat_activate_values() local
1557 list_for_each_entry_safe(cur, next, fn_list, node) in dccp_feat_activate_values()
/kernel/linux/linux-6.6/net/mac802154/
H A Dllsec.c926 struct mac802154_llsec_device_key *next; in llsec_update_devkey_record() local
928 next = kzalloc(sizeof(*devkey), GFP_ATOMIC); in llsec_update_devkey_record()
929 if (!next) in llsec_update_devkey_record()
932 next->devkey.key_id = *in_key; in llsec_update_devkey_record()
938 list_add_rcu(&next->devkey.list, &dev->dev.keys); in llsec_update_devkey_record()
940 kfree_sensitive(next); in llsec_update_devkey_record()
/kernel/linux/linux-6.6/net/ipv6/
H A Dip6_vti.c75 for (t = rcu_dereference(start); t; t = rcu_dereference(t->next))
157 rcu_assign_pointer(t->next, rtnl_dereference(*tp)); in vti6_tnl_link()
169 tp = &iter->next) { in vti6_tnl_unlink()
171 rcu_assign_pointer(*tp, t->next); in vti6_tnl_unlink()
266 tp = &t->next) { in vti6_locate()
1129 t = rtnl_dereference(t->next); in vti6_destroy_tunnels()
/third_party/ffmpeg/libavcodec/
H A Dratecontrol.c576 char *next; in ff_rate_control_init() local
578 next = strchr(p, ';'); in ff_rate_control_init()
579 if (next) { in ff_rate_control_init()
580 (*next) = 0; // sscanf is unbelievably slow on looong strings // FIXME copy / do not write in ff_rate_control_init()
581 next++; in ff_rate_control_init()
602 p = next; in ff_rate_control_init()
/third_party/ffmpeg/libswresample/x86/
H A Daudio_convert.asm54 .next:
87 jl .next
112 .next:
159 jl .next
179 .next:
196 jl .next
/third_party/backends/backend/
H A Dniash.c166 int next; in _ConvertGammaTable() local
169 next = ((i + 1) * HW_GAMMA_SIZE) / SANE_GAMMA_SIZE; in _ConvertGammaTable()
175 for (j = current + 1; j < HW_GAMMA_SIZE && j < next; ++j) in _ConvertGammaTable()
178 (saneGamma[i] * (next - j) + in _ConvertGammaTable()
179 saneGamma[i + 1] * (j - current)) / (next - current); in _ConvertGammaTable()
181 current = next; in _ConvertGammaTable()
435 "_WaitForLamp: Values seem stable, skipping next calibration cycle\n"); in _WaitForLamp()
517 for the next time */ in _WaitForLamp()
1412 /* time to read the next line? */ in sane_read()
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
H A DStringSearch.java65 * calling a {@link #reset} followed by a {@link #next} or {@link #previous}.
83 * requires swapping with the next character. E.g certain Thai and
498 // in next() in handleNext()
500 // next match will not preceed the current offset in handleNext()
722 while ((ce = coleiter.next()) != CollationElementIterator.NULLORDER) { in initializePatternCETable()
898 * Find the next break boundary after startIndex. If the UStringSearch object
1035 // 2. An int64_t CE weight is determined for each resulting unit (high 16 bits are primary strength, next in search()
1036 // 16 bits are secondary, next 16 (the high 16 bits of the low 32-bit half) are tertiary. Any of these in search()
1069 // redo with same patCE, next targCE in search()
1073 // redo with same targCE, next patC in search()
[all...]

Completed in 49 milliseconds

1...<<251252253254255256257258259260>>...505