| /linux-6.12.1/include/linux/ |
| D | list.h | 37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
55 struct list_head *next);
67 struct list_head *next) in __list_add_valid() argument
83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
88 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
112 struct list_head *next = entry->next; in __list_del_entry_valid() local
119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
130 struct list_head *next) in __list_add_valid() argument
148 struct list_head *next) in __list_add() argument
150 if (!__list_add_valid(new, prev, next)) in __list_add()
[all …]
|
| D | rculist.h | 24 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()
203 new->next = old->next; in list_replace_rcu()
206 new->next->prev = new; in list_replace_rcu()
231 struct list_head *next, in __list_splice_init_rcu() argument
[all …]
|
| D | list_bl.h | 39 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.12.1/tools/include/linux/ |
| D | list.h | 27 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.12.1/lib/ |
| D | list_debug.c | 23 struct list_head *next) in __list_add_valid_or_report() argument
27 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid_or_report()
34 next, prev->next, prev) || in __list_add_valid_or_report()
35 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid_or_report()
37 new, prev, next)) in __list_add_valid_or_report()
47 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local
50 next = entry->next; in __list_del_entry_valid_or_report()
[all …]
|
| D | list_sort.c | 25 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 …]
|
| D | cpumask.c | 24 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()
172 unsigned int next, prev; in cpumask_any_and_distribute() local
177 next = find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p), in cpumask_any_and_distribute()
179 if (next < nr_cpu_ids) in cpumask_any_and_distribute()
180 __this_cpu_write(distribute_cpu_mask_prev, next); in cpumask_any_and_distribute()
182 return next; in cpumask_any_and_distribute()
[all …]
|
| /linux-6.12.1/io_uring/ |
| D | slist.h | 7 for (pos = (head)->first; pos; pos = (pos)->next)
10 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
13 for (; pos; prv = pos, pos = (pos)->next)
25 struct io_wq_work_node *next = pos->next; in wq_list_add_after() local
27 pos->next = node; in wq_list_add_after()
28 node->next = next; in wq_list_add_after()
29 if (!next) in wq_list_add_after()
36 node->next = NULL; in wq_list_add_tail()
41 list->last->next = node; in wq_list_add_tail()
49 node->next = list->first; in wq_list_add_head()
[all …]
|
| /linux-6.12.1/kernel/locking/ |
| D | osq_lock.c | 16 struct optimistic_spin_node *next, *prev; member
81 if (node->next) { in osq_wait_next()
82 struct optimistic_spin_node *next; in osq_wait_next() local
84 next = xchg(&node->next, NULL); in osq_wait_next()
85 if (next) in osq_wait_next()
86 return next; in osq_wait_next()
96 struct optimistic_spin_node *prev, *next; in osq_lock() local
101 node->next = NULL; in osq_lock()
129 WRITE_ONCE(prev->next, node); in osq_lock()
164 if (data_race(prev->next) == node && in osq_lock()
[all …]
|
| /linux-6.12.1/tools/usb/usbip/libsrc/ |
| D | list.h | 20 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.12.1/drivers/scsi/sym53c8xx_2/ |
| D | sym_malloc.c | 64 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.12.1/arch/riscv/mm/ |
| D | kasan_init.c | 54 unsigned long next; in kasan_populate_pmd() local
64 next = pmd_addr_end(vaddr, end); in kasan_populate_pmd()
67 (next - vaddr) >= PMD_SIZE) { in kasan_populate_pmd()
76 kasan_populate_pte(pmdp, vaddr, next); in kasan_populate_pmd()
77 } while (pmdp++, vaddr = next, vaddr != end); in kasan_populate_pmd()
85 unsigned long next; in kasan_populate_pud() local
95 next = pud_addr_end(vaddr, end); in kasan_populate_pud()
98 (next - vaddr) >= PUD_SIZE) { in kasan_populate_pud()
107 kasan_populate_pmd(pudp, vaddr, next); in kasan_populate_pud()
108 } while (pudp++, vaddr = next, vaddr != end); in kasan_populate_pud()
[all …]
|
| /linux-6.12.1/arch/mips/include/asm/ |
| D | switch_to.h | 33 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.12.1/scripts/include/ |
| D | list.h | 53 list->next = list; in INIT_LIST_HEAD()
65 struct list_head *next) in __list_add() argument
67 next->prev = new; in __list_add()
68 new->next = next; in __list_add()
70 prev->next = new; in __list_add()
83 __list_add(new, head, head->next); in list_add()
106 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
108 next->prev = prev; in __list_del()
109 prev->next = next; in __list_del()
114 __list_del(entry->prev, entry->next); in __list_del_entry()
[all …]
|
| /linux-6.12.1/drivers/acpi/acpica/ |
| D | pstree.c | 74 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.12.1/drivers/pci/hotplug/ |
| D | cpqphp_ctrl.c | 121 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.12.1/drivers/memory/tegra/ |
| D | tegra210-emc-cc-r21021.c | 78 ({ next->ptfv_list[(dev)] = \
79 next->ptfv_list[(dev)] / \
80 next->ptfv_list[PTFV_DVFS_SAMPLES_INDEX]; })
86 ({ next->ptfv_list[(dev)] += \
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]); \
184 struct tegra210_emc_timing *next) in periodic_compensation_handler() argument
[all …]
|
| /linux-6.12.1/tools/lib/ |
| D | list_sort.c | 24 tail = &a->next; in merge()
25 a = a->next; in merge()
32 tail = &b->next; in merge()
33 b = b->next; in merge()
59 tail->next = a; in merge_final()
62 a = a->next; in merge_final()
66 tail->next = b; in merge_final()
69 b = b->next; in merge_final()
78 tail->next = b; in merge_final()
82 b = b->next; in merge_final()
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/nouveau/nvkm/subdev/fb/ |
| D | ramgk104.c | 210 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 …]
|
| D | gddr5.c | 41 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.12.1/rust/kernel/ |
| D | list.rs | 136 next: *mut ListLinksFields, field
168 next: ptr::null_mut(), in new()
226 next: ptr::null_mut(), in new()
267 (*item).next = item; in push_back()
271 let next = self.first; in push_back() localVariable
274 let prev = unsafe { (*next).prev }; in push_back()
279 (*item).next = next; in push_back()
281 (*prev).next = item; in push_back()
282 (*next).prev = item; in push_back()
306 (*item).next = item; in push_front()
[all …]
|
| /linux-6.12.1/net/ax25/ |
| D | ax25_iface.c | 35 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.12.1/mm/kasan/ |
| D | init.c | 117 unsigned long next; in zero_pmd_populate() local
120 next = pmd_addr_end(addr, end); in zero_pmd_populate()
142 zero_pte_populate(pmd, addr, next); in zero_pmd_populate()
143 } while (pmd++, addr = next, addr != end); in zero_pmd_populate()
156 unsigned long next; in zero_pud_populate() local
159 next = pud_addr_end(addr, end); in zero_pud_populate()
184 zero_pmd_populate(pud, addr, next); in zero_pud_populate()
185 } while (pud++, addr = next, addr != end); in zero_pud_populate()
198 unsigned long next; in zero_p4d_populate() local
201 next = p4d_addr_end(addr, end); in zero_p4d_populate()
[all …]
|
| /linux-6.12.1/drivers/net/ethernet/microchip/sparx5/ |
| D | sparx5_sdlb.c | 115 u32 itr, next; in sparx5_sdlb_group_get_last() local
120 next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_last()
121 if (itr == next) in sparx5_sdlb_group_get_last()
124 itr = next; in sparx5_sdlb_group_get_last()
138 u32 idx, u32 *prev, u32 *next, in sparx5_sdlb_group_get_adjacent() argument
145 *next = *first; in sparx5_sdlb_group_get_adjacent()
149 *next = sparx5_sdlb_group_get_next(sparx5, group, itr); in sparx5_sdlb_group_get_adjacent()
154 if (itr == *next) in sparx5_sdlb_group_get_adjacent()
158 itr = *next; in sparx5_sdlb_group_get_adjacent()
164 u32 itr, next; in sparx5_sdlb_group_get_count() local
[all …]
|
| /linux-6.12.1/drivers/usb/host/ |
| D | ohci-dbg.c | 23 #define ohci_dbg_sw(ohci, next, size, format, arg...) \ argument
25 if (next != NULL) { \
27 s_len = scnprintf (*next, *size, format, ## arg ); \
28 *size -= s_len; *next += s_len; \
34 #define ohci_dbg_nosw(ohci, next, size, format, arg...) \ argument
37 s_len = scnprintf(*next, *size, format, ## arg); \
38 *size -= s_len; *next += s_len; \
46 char **next, in ohci_dump_intr_mask() argument
49 ohci_dbg_sw (ohci, next, size, "%s 0x%08x%s%s%s%s%s%s%s%s%s\n", in ohci_dump_intr_mask()
68 char **next, in maybe_print_eds() argument
[all …]
|