Home
last modified time | relevance | path

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

12345678910>>...118

/linux/include/linux/
H A Dlist.h18 * sometimes we already know the next/prev entries and we can
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
73 * With the hardening version, elide checking if next and prev in __list_add_valid()
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; __list_del_entry_valid() local
130 __list_add_valid(struct list_head * new,struct list_head * prev,struct list_head * next) __list_add_valid() argument
148 __list_add(struct list_head * new,struct list_head * prev,struct list_head * next) __list_add() argument
193 __list_del(struct list_head * prev,struct list_head * next) __list_del() argument
409 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
525 __list_splice(const struct list_head * list,struct list_head * prev,struct list_head * next) __list_splice() argument
985 struct hlist_node *next = n->next; __hlist_del() local
1045 hlist_add_before(struct hlist_node * n,struct hlist_node * next) hlist_add_before() argument
[all...]
H A 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()
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 …]
H A 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/tools/include/linux/
H A 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/io_uring/
H A Dslist.h7 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/lib/
H A Dlist_debug.c23 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 …]
H A Dlist_sort.c22 tail = &a->next; in merge()
23 a = a->next; in merge()
30 tail = &b->next; in merge()
31 b = b->next; in merge()
58 tail->next = a; in merge_final()
61 a = a->next; in merge_final()
65 tail->next = b; in merge_final()
68 b = b->next; in merge_final()
77 tail->next = b; in merge_final()
90 b = b->next; in merge_final()
[all …]
H A 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()
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/drivers/scsi/sym53c8xx_2/
H A 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/tools/usb/usbip/libsrc/
H A 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/arch/riscv/mm/
H A Dkasan_init.c54 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/scripts/include/
H A Dlist.h53 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/drivers/pci/hotplug/
H A 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/drivers/memory/tegra/
H A Dtegra210-emc-cc-r21021.c78 ({ 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/drivers/acpi/acpica/
H A 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/drivers/gpu/drm/nouveau/nvkm/subdev/fb/
H A 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 …]
H A 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/rust/kernel/
H A Dlist.rs28 /// only have one `ListArc` (for each pair of prev/next pointers), this ensures that the same
29 /// prev/next pointers are not used for several linked lists.
35 /// * All prev/next pointers in `ListLinks` fields of items in the list are valid and form a cycle.
91 /// * The returned pointer is valid until the next call to `post_remove`.
136 next: *mut ListLinksFields, field
140 /// The prev/next pointers for an item in a linked list.
168 next: ptr::null_mut(), in new()
226 next: ptr::null_mut(), in new()
267 (*item).next = item; in push_back()
271 let next in push_back() localVariable
310 let next = self.first; push_front() localVariable
548 fn next(&mut self) -> Option<ArcBorrow<'a, T>> { next() method
557 let next = unsafe { (*current).next }; next() localVariable
607 pub fn next(self) -> Option<Cursor<'a, T, ID>> { next() method
609 let next = unsafe { (*self.current).next }; next() localVariable
666 fn next(&mut self) -> Option<ListArc<T, ID>> { next() method
[all...]
/linux/mm/kasan/
H A Dinit.c113 unsigned long next; in zero_pmd_populate()
116 next = pmd_addr_end(addr, end); in zero_pmd_populate()
138 zero_pte_populate(pmd, addr, next); in zero_pmd_populate()
139 } while (pmd++, addr = next, addr != end); in zero_pmd_populate()
148 unsigned long next; in pmd_init()
151 next = pud_addr_end(addr, end);
176 zero_pmd_populate(pud, addr, next); in zero_pud_populate()
177 } while (pud++, addr = next, addr != end); in zero_pud_populate()
186 unsigned long next; in zero_pud_populate()
189 next in zero_pud_populate()
117 unsigned long next; zero_pmd_populate() local
156 unsigned long next; zero_pud_populate() local
198 unsigned long next; zero_p4d_populate() local
248 unsigned long next; kasan_populate_early_shadow() local
361 unsigned long next; kasan_remove_pte_table() local
383 unsigned long next; kasan_remove_pmd_table() local
409 unsigned long next; kasan_remove_pud_table() local
436 unsigned long next; kasan_remove_p4d_table() local
461 unsigned long addr, end, next; kasan_remove_zero_shadow() local
[all...]
/linux/net/ax25/
H A 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/tools/lib/
H A Dlist_sort.c22 tail = &a->next; in merge()
23 a = a->next; in merge()
30 tail = &b->next; in merge()
31 b = b->next; in merge()
57 tail->next = a; in merge_final()
60 a = a->next; in merge_final()
64 tail->next = b; in merge_final()
67 b = b->next; in merge_final()
76 tail->next = b; in merge_final()
80 b = b->next; in merge_final()
[all …]
/linux/drivers/usb/host/
H A Dohci-dbg.c23 #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 …]
/linux/arch/arm64/kernel/
H A Dprocess.c493 static void tls_thread_switch(struct task_struct *next) in tls_thread_switch() argument
497 if (is_compat_thread(task_thread_info(next))) in tls_thread_switch()
498 write_sysreg(next->thread.uw.tp_value, tpidrro_el0); in tls_thread_switch()
502 write_sysreg(*task_user_tls(next), tpidr_el0); in tls_thread_switch()
504 write_sysreg_s(next->thread.tpidr2_el0, SYS_TPIDR2_EL0); in tls_thread_switch()
511 static void ssbs_thread_switch(struct task_struct *next) in ssbs_thread_switch() argument
517 if (unlikely(next->flags & PF_KTHREAD)) in ssbs_thread_switch()
527 spectre_v4_enable_task_mitigation(next); in ssbs_thread_switch()
539 static void entry_task_switch(struct task_struct *next) in entry_task_switch() argument
541 __this_cpu_write(__entry_task, next); in entry_task_switch()
[all …]
/linux/arch/parisc/include/asm/
H A Dmmu_context.h51 struct mm_struct *next, struct task_struct *tsk) in switch_mm_irqs_off() argument
53 if (prev != next) { in switch_mm_irqs_off()
57 spinlock_t *pgd_lock = &next->page_table_lock; in switch_mm_irqs_off()
60 mtctl(__pa(next->pgd), 25); in switch_mm_irqs_off()
61 load_context(next->context); in switch_mm_irqs_off()
66 struct mm_struct *next, struct task_struct *tsk) in switch_mm() argument
70 if (prev == next) in switch_mm()
74 switch_mm_irqs_off(prev, next, tsk); in switch_mm()
80 static inline void activate_mm(struct mm_struct *prev, struct mm_struct *next) in activate_mm() argument
90 BUG_ON(next == &init_mm); /* Should never happen */ in activate_mm()
[all …]
/linux/tools/testing/selftests/bpf/progs/
H A 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>>...118