Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 3001) sorted by relevance

12345678910>>...121

/linux-6.1.9/tools/include/linux/
Dlist.h27 list->next = list; in INIT_LIST_HEAD()
40 struct list_head *next) in __list_add() argument
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
87 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
89 next->prev = prev; in __list_del()
90 WRITE_ONCE(prev->next, next); in __list_del()
[all …]
/linux-6.1.9/include/linux/
Dlist.h37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
44 struct list_head *next);
49 struct list_head *next) in __list_add_valid() argument
67 struct list_head *next) in __list_add() argument
69 if (!__list_add_valid(new, prev, next)) in __list_add()
72 next->prev = new; in __list_add()
73 new->next = next; in __list_add()
75 WRITE_ONCE(prev->next, new); in __list_add()
88 __list_add(new, head, head->next); in list_add()
112 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
[all …]
Drculist.h24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
77 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
79 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
82 new->next = next; in __list_add_rcu()
85 next->prev = new; in __list_add_rcu()
106 __list_add_rcu(new, head, head->next); in list_add_rcu()
200 new->next = old->next; in list_replace_rcu()
203 new->next->prev = new; in list_replace_rcu()
228 struct list_head *next, in __list_splice_init_rcu() argument
[all …]
Dlist_bl.h39 struct hlist_bl_node *next, **pprev; member
46 h->next = NULL; in INIT_HLIST_BL_NODE()
82 n->next = first; in hlist_bl_add_head()
84 first->pprev = &n->next; in hlist_bl_add_head()
90 struct hlist_bl_node *next) in hlist_bl_add_before() argument
92 struct hlist_bl_node **pprev = next->pprev; in hlist_bl_add_before()
95 n->next = next; in hlist_bl_add_before()
96 next->pprev = &n->next; in hlist_bl_add_before()
107 n->next = prev->next; in hlist_bl_add_behind()
108 n->pprev = &prev->next; in hlist_bl_add_behind()
[all …]
/linux-6.1.9/lib/
Dlist_debug.c21 struct list_head *next) in __list_add_valid() argument
25 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
32 next, prev->next, prev) || in __list_add_valid()
33 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid()
35 new, prev, next)) in __list_add_valid()
44 struct list_head *prev, *next; in __list_del_entry_valid() local
47 next = entry->next; in __list_del_entry_valid()
[all …]
Dlist_sort.c25 tail = &a->next; in merge()
26 a = a->next; in merge()
33 tail = &b->next; in merge()
34 b = b->next; in merge()
61 tail->next = a; in merge_final()
64 a = a->next; in merge_final()
68 tail->next = b; in merge_final()
71 b = b->next; in merge_final()
80 tail->next = b; in merge_final()
93 b = b->next; in merge_final()
[all …]
Dcpumask.c24 unsigned int next; in cpumask_next_wrap() local
27 next = cpumask_next(n, mask); in cpumask_next_wrap()
29 if (wrap && n < start && next >= start) { in cpumask_next_wrap()
32 } else if (next >= nr_cpumask_bits) { in cpumask_next_wrap()
38 return next; in cpumask_next_wrap()
164 unsigned int next, prev; in cpumask_any_and_distribute() local
169 next = find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p), in cpumask_any_and_distribute()
171 if (next < nr_cpu_ids) in cpumask_any_and_distribute()
172 __this_cpu_write(distribute_cpu_mask_prev, next); in cpumask_any_and_distribute()
174 return next; in cpumask_any_and_distribute()
[all …]
/linux-6.1.9/io_uring/
Dslist.h7 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
10 for (; pos; prv = pos, pos = (pos)->next)
22 struct io_wq_work_node *next = pos->next; in wq_list_add_after() local
24 pos->next = node; in wq_list_add_after()
25 node->next = next; in wq_list_add_after()
26 if (!next) in wq_list_add_after()
45 list0->last->next = list1->first; in wq_list_merge()
55 node->next = NULL; in wq_list_add_tail()
60 list->last->next = node; in wq_list_add_tail()
68 node->next = list->first; in wq_list_add_head()
[all …]
/linux-6.1.9/kernel/locking/
Dosq_lock.c46 struct optimistic_spin_node *next = NULL; in osq_wait_next() local
78 if (node->next) { in osq_wait_next()
79 next = xchg(&node->next, NULL); in osq_wait_next()
80 if (next) in osq_wait_next()
87 return next; in osq_wait_next()
93 struct optimistic_spin_node *prev, *next; in osq_lock() local
98 node->next = NULL; in osq_lock()
126 WRITE_ONCE(prev->next, node); in osq_lock()
161 if (data_race(prev->next) == node && in osq_lock()
162 cmpxchg(&prev->next, node, NULL) == node) in osq_lock()
[all …]
/linux-6.1.9/drivers/memory/tegra/
Dtegra210-emc-cc-r21021.c78 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] = \
79 next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] / \
80 next->ptfv_list[PTFV_DVFS_SAMPLES_INDEX]; })
86 ({ next->ptfv_list[PTFV_DQSOSC_MOVAVG_ ## dev ## _INDEX] += \
102 next->ptfv_list[dqs] = \
104 (next->ptfv_list[dqs] * \
105 next->ptfv_list[w])) / \
106 (next->ptfv_list[w] + 1); \
109 __stringify(dev), nval, next->ptfv_list[dqs]); \
120 struct tegra210_emc_timing *next = emc->next; in update_clock_tree_delay() local
[all …]
/linux-6.1.9/tools/usb/usbip/libsrc/
Dlist.h20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
42 struct list_head *next) in __list_add() argument
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
47 prev->next = new; in __list_add()
60 __list_add(new, head, head->next); in list_add()
70 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
[all …]
/linux-6.1.9/drivers/scsi/sym53c8xx_2/
Dsym_malloc.c64 while (!h[j].next) { in ___sym_malloc()
66 h[j].next = (m_link_p) M_GET_MEM_CLUSTER(); in ___sym_malloc()
67 if (h[j].next) in ___sym_malloc()
68 h[j].next->next = NULL; in ___sym_malloc()
74 a = h[j].next; in ___sym_malloc()
76 h[j].next = h[j].next->next; in ___sym_malloc()
80 h[j].next = (m_link_p) (a+s); in ___sym_malloc()
81 h[j].next->next = NULL; in ___sym_malloc()
120 ((m_link_p) a)->next = h[i].next; in ___sym_mfree()
121 h[i].next = (m_link_p) a; in ___sym_mfree()
[all …]
/linux-6.1.9/arch/mips/include/asm/
Dswitch_to.h33 struct task_struct *next, struct thread_info *next_ti);
62 next->thread.emulated_fp = 0; \
88 # define __sanitize_fcr31(next) \ argument
90 unsigned long fcr31 = mask_fcr31_x(next->thread.fpu.fcr31); \
94 pc = (void __user *)task_pt_regs(next)->cp0_epc; \
95 next->thread.fpu.fcr31 &= ~fcr31; \
96 force_fcr31_sig(fcr31, pc, next); \
100 # define __sanitize_fcr31(next) argument
109 #define switch_to(prev, next, last) \ argument
113 if (tsk_used_math(next)) \
[all …]
/linux-6.1.9/scripts/kconfig/
Dlist.h25 struct list_head *next, *prev; member
50 for (pos = list_entry((head)->next, typeof(*pos), member); \
52 pos = list_entry(pos->member.next, typeof(*pos), member))
62 for (pos = list_entry((head)->next, typeof(*pos), member), \
63 n = list_entry(pos->member.next, typeof(*pos), member); \
65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
73 return head->next == head; in list_empty()
84 struct list_head *next) in __list_add() argument
86 next->prev = _new; in __list_add()
87 _new->next = next; in __list_add()
[all …]
/linux-6.1.9/drivers/acpi/acpica/
Dpstree.c74 arg = arg->common.next; in acpi_ps_get_arg()
133 while (prev_arg->common.next) { in acpi_ps_append_arg()
134 prev_arg = prev_arg->common.next; in acpi_ps_append_arg()
136 prev_arg->common.next = arg; in acpi_ps_append_arg()
147 arg = arg->common.next; in acpi_ps_append_arg()
172 union acpi_parse_object *next = NULL; in acpi_ps_get_depth_next() local
184 next = acpi_ps_get_arg(op, 0); in acpi_ps_get_depth_next()
185 if (next) { in acpi_ps_get_depth_next()
186 ASL_CV_LABEL_FILENODE(next); in acpi_ps_get_depth_next()
187 return (next); in acpi_ps_get_depth_next()
[all …]
/linux-6.1.9/drivers/pci/hotplug/
Dcpqphp_ctrl.c121 slot = slot->next; in cpqhp_find_slot()
307 if (!((*head)->next)) in sort_by_size()
314 if (((*head)->next) && in sort_by_size()
315 ((*head)->length > (*head)->next->length)) { in sort_by_size()
318 *head = (*head)->next; in sort_by_size()
319 current_res->next = (*head)->next; in sort_by_size()
320 (*head)->next = current_res; in sort_by_size()
325 while (current_res->next && current_res->next->next) { in sort_by_size()
326 if (current_res->next->length > current_res->next->next->length) { in sort_by_size()
328 next_res = current_res->next; in sort_by_size()
[all …]
/linux-6.1.9/arch/riscv/mm/
Dkasan_init.c62 unsigned long next; in kasan_populate_pmd() local
75 next = pmd_addr_end(vaddr, end); in kasan_populate_pmd()
77 if (pmd_none(*pmdp) && IS_ALIGNED(vaddr, PMD_SIZE) && (next - vaddr) >= PMD_SIZE) { in kasan_populate_pmd()
85 kasan_populate_pte(pmdp, vaddr, next); in kasan_populate_pmd()
86 } while (pmdp++, vaddr = next, vaddr != end); in kasan_populate_pmd()
103 unsigned long next; in kasan_populate_pud() local
130 next = pud_addr_end(vaddr, end); in kasan_populate_pud()
132 if (pud_none(*pudp) && IS_ALIGNED(vaddr, PUD_SIZE) && (next - vaddr) >= PUD_SIZE) { in kasan_populate_pud()
146 kasan_populate_pmd(pudp, vaddr, next); in kasan_populate_pud()
147 } while (pudp++, vaddr = next, vaddr != end); in kasan_populate_pud()
[all …]
/linux-6.1.9/arch/x86/mm/
Dident_map.c24 unsigned long next; in ident_pud_init() local
26 for (; addr < end; addr = next) { in ident_pud_init()
30 next = (addr & PUD_MASK) + PUD_SIZE; in ident_pud_init()
31 if (next > end) in ident_pud_init()
32 next = end; in ident_pud_init()
48 ident_pmd_init(info, pmd, addr, next); in ident_pud_init()
54 ident_pmd_init(info, pmd, addr, next); in ident_pud_init()
64 unsigned long next; in ident_p4d_init() local
67 for (; addr < end; addr = next) { in ident_p4d_init()
71 next = (addr & P4D_MASK) + P4D_SIZE; in ident_p4d_init()
[all …]
/linux-6.1.9/net/ax25/
Dax25_iface.c35 struct listen_struct *next; member
48 ap->next = protocol_list; in ax25_register_pid()
65 protocol_list = protocol->next; in ax25_protocol_release()
69 while (protocol != NULL && protocol->next != NULL) { in ax25_protocol_release()
70 if (protocol->next->pid == pid) { in ax25_protocol_release()
71 protocol->next = protocol->next->next; in ax25_protocol_release()
75 protocol = protocol->next; in ax25_protocol_release()
115 listen->next = listen_list; in ax25_listen_register()
136 listen_list = listen->next; in ax25_listen_release()
142 while (listen != NULL && listen->next != NULL) { in ax25_listen_release()
[all …]
/linux-6.1.9/mm/kasan/
Dinit.c113 unsigned long next; in zero_pmd_populate() local
116 next = pmd_addr_end(addr, end); in zero_pmd_populate()
136 zero_pte_populate(pmd, addr, next); in zero_pmd_populate()
137 } while (pmd++, addr = next, addr != end); in zero_pmd_populate()
146 unsigned long next; in zero_pud_populate() local
149 next = pud_addr_end(addr, end); in zero_pud_populate()
173 zero_pmd_populate(pud, addr, next); in zero_pud_populate()
174 } while (pud++, addr = next, addr != end); in zero_pud_populate()
183 unsigned long next; in zero_p4d_populate() local
186 next = p4d_addr_end(addr, end); in zero_p4d_populate()
[all …]
/linux-6.1.9/drivers/gpu/drm/nouveau/nvkm/subdev/fb/
Dramgk104.c210 struct nvkm_ram_data *next = ram->base.next; in r1373f4_fini() local
211 u8 v0 = next->bios.ramcfg_11_03_c0; in r1373f4_fini()
212 u8 v1 = next->bios.ramcfg_11_03_30; in r1373f4_fini()
243 u32 next = (prev & ~mask) | data; in gk104_ram_nuts() local
244 nvkm_memx_wr32(fuc->memx, addr, next); in gk104_ram_nuts()
255 struct nvkm_ram_data *next = ram->base.next; in gk104_ram_calc_gddr5() local
256 int vc = !next->bios.ramcfg_11_02_08; in gk104_ram_calc_gddr5()
257 int mv = !next->bios.ramcfg_11_02_04; in gk104_ram_calc_gddr5()
311 switch (next->bios.ramcfg_11_03_c0) { in gk104_ram_calc_gddr5()
318 switch (next->bios.ramcfg_11_03_30) { in gk104_ram_calc_gddr5()
[all …]
Dgddr5.c41 xd = !ram->next->bios.ramcfg_DLLoff; in nvkm_gddr5_calc()
43 switch (ram->next->bios.ramcfg_ver) { in nvkm_gddr5_calc()
45 pd = ram->next->bios.ramcfg_11_01_80; in nvkm_gddr5_calc()
46 lf = ram->next->bios.ramcfg_11_01_40; in nvkm_gddr5_calc()
47 vh = ram->next->bios.ramcfg_11_02_10; in nvkm_gddr5_calc()
48 vr = ram->next->bios.ramcfg_11_02_04; in nvkm_gddr5_calc()
49 vo = ram->next->bios.ramcfg_11_06; in nvkm_gddr5_calc()
50 l3 = !ram->next->bios.ramcfg_11_07_02; in nvkm_gddr5_calc()
56 switch (ram->next->bios.timing_ver) { in nvkm_gddr5_calc()
58 WL = (ram->next->bios.timing[1] & 0x00000f80) >> 7; in nvkm_gddr5_calc()
[all …]
/linux-6.1.9/tools/lib/
Dlist_sort.c24 tail = &a->next; in merge()
25 a = a->next; in merge()
32 tail = &b->next; in merge()
33 b = b->next; in merge()
60 tail->next = a; in merge_final()
63 a = a->next; in merge_final()
67 tail->next = b; in merge_final()
70 b = b->next; in merge_final()
79 tail->next = b; in merge_final()
92 b = b->next; in merge_final()
[all …]
/linux-6.1.9/scripts/mod/
Dlist.h39 struct list_head *next, *prev; member
56 list->next = list; in INIT_LIST_HEAD()
68 struct list_head *next) in __list_add() argument
70 next->prev = new; in __list_add()
71 new->next = next; in __list_add()
73 prev->next = new; in __list_add()
86 __list_add(new, head, head->next); in list_add()
109 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
111 next->prev = prev; in __list_del()
112 prev->next = next; in __list_del()
[all …]
/linux-6.1.9/tools/testing/selftests/bpf/progs/
Dtest_core_read_macros.c13 struct callback_head___shuffled *next; member
41 k_probe_in.next = &k_probe_in; in handler()
42 __builtin_preserve_access_index(({k_core_in.next = &k_core_in;})); in handler()
44 k_probe_out = (long)BPF_PROBE_READ(&k_probe_in, next, next, func); in handler()
45 k_core_out = (long)BPF_CORE_READ(&k_core_in, next, next, func); in handler()
46 u_probe_out = (long)BPF_PROBE_READ_USER(u_probe_in, next, next, func); in handler()
47 u_core_out = (long)BPF_CORE_READ_USER(u_core_in, next, next, func); in handler()

12345678910>>...121