Home
last modified time | relevance | path

Searched refs:next (Results 1 - 25 of 6705) sorted by relevance

12345678910>>...269

/kernel/linux/linux-6.6/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()
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()
65 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
112 struct list_head *next = entry->next; __list_del_entry_valid() local
128 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
146 __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
523 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
977 struct hlist_node *next = n->next; __hlist_del() local
1036 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() 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()
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()
89 hlist_bl_add_before(struct hlist_bl_node *n, struct hlist_bl_node *next) hlist_bl_add_before() argument
117 struct hlist_bl_node *next = n->next; __hlist_bl_del() local
[all...]
H A Drculist.h24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
29 * return the ->next pointer of a list_head in an rcu safe
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
74 * the prev/next entries already!
77 struct list_head *prev, struct list_head *next) in __list_add_rcu()
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()
76 __list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_rcu() argument
226 __list_splice_init_rcu(struct list_head *list, struct list_head *prev, struct list_head *next, void (*sync)(void)) __list_splice_init_rcu() argument
527 struct hlist_node *next = old->next; hlist_replace_rcu() local
651 hlist_add_before_rcu(struct hlist_node *n, struct hlist_node *next) hlist_add_before_rcu() argument
[all...]
/kernel/linux/linux-5.10/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
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()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
616 struct hlist_node *next = n->next; __hlist_del() local
650 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-6.6/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
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()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
627 struct hlist_node *next = n->next; __hlist_del() local
661 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dlist.h16 * sometimes we already know the next/prev entries and we can
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
42 struct list_head *next);
47 struct list_head *next) in __list_add_valid()
61 * the prev/next entries already!
65 struct list_head *next) in __list_add()
67 if (!__list_add_valid(new, prev, next)) in __list_add()
70 next->prev = new; in __list_add()
71 new->next = next; in __list_add()
45 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
63 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
110 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
318 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
433 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
835 struct hlist_node *next = n->next; __hlist_del() local
894 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() 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()
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()
89 hlist_bl_add_before(struct hlist_bl_node *n, struct hlist_bl_node *next) hlist_bl_add_before() argument
117 struct hlist_bl_node *next = n->next; __hlist_bl_del() local
[all...]
H A Drculist.h33 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
38 * return the ->next pointer of a list_head in an rcu safe
41 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
83 * the prev/next entries already!
86 struct list_head *prev, struct list_head *next) in __list_add_rcu()
88 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
91 new->next = next; in __list_add_rcu()
94 next->prev = new; in __list_add_rcu()
115 __list_add_rcu(new, head, head->next); in list_add_rcu()
85 __list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_rcu() argument
235 __list_splice_init_rcu(struct list_head *list, struct list_head *prev, struct list_head *next, void (*sync)(void)) __list_splice_init_rcu() argument
528 struct hlist_node *next = old->next; hlist_replace_rcu() local
652 hlist_add_before_rcu(struct hlist_node *n, struct hlist_node *next) hlist_add_before_rcu() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Dlist_debug.c23 struct list_head *next) in __list_add_valid_or_report()
27 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid_or_report()
28 "list_add corruption. next is NULL.\n") || in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid_or_report()
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", 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()
22 __list_add_valid_or_report(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid_or_report() argument
47 struct list_head *prev, *next; __list_del_entry_valid_or_report() local
[all...]
/kernel/linux/linux-6.6/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 in wq_list_add_tail()
[all...]
/kernel/linux/linux-5.10/lib/
H A Dlist_debug.c21 struct list_head *next) in __list_add_valid()
25 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid()
26 "list_add corruption. next is NULL.\n") || in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
28 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
20 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
44 struct list_head *prev, *next; __list_del_entry_valid() local
[all...]
/kernel/linux/linux-5.10/drivers/block/zram/zram_group/
H A Dzlist.c38 struct zlist_node *next) in zlist_before_add_check()
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check()
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
36 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
46 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
56 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
66 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
76 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
79 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
82 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
85 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
118 struct zlist_node *next = idx2node(nid, tab); zlist_add_nolock() local
165 struct zlist_node *next = idx2node(nid, tab); zlist_del_nolock() local
[all...]
/kernel/linux/linux-6.6/drivers/block/zram/zram_group/
H A Dzlist.c38 struct zlist_node *next) in zlist_before_add_check()
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check()
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
36 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
46 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
56 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
66 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
76 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
79 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
82 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
85 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
118 struct zlist_node *next = idx2node(nid, tab); zlist_add_nolock() local
165 struct zlist_node *next = idx2node(nid, tab); zlist_del_nolock() local
[all...]
/kernel/linux/linux-5.10/tools/usb/usbip/libsrc/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
38 * the prev/next entries already!
42 struct list_head *next) in __list_add()
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()
40 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
70 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/kernel/linux/linux-6.6/tools/usb/usbip/libsrc/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
38 * the prev/next entries already!
42 struct list_head *next) in __list_add()
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()
40 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
70 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/kernel/linux/linux-5.10/kernel/locking/
H A Dosq_lock.c38 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
46 struct optimistic_spin_node *next = NULL; in osq_wait_next() local
69 * We must xchg() the @node->next value, because if we were to in osq_wait_next()
71 * @node->next might complete Step-A and think its @prev is in osq_wait_next()
76 * wait for a new @node->next from its Step-C. in osq_wait_next()
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; osq_lock() local
209 struct optimistic_spin_node *node, *next; osq_unlock() local
[all...]
/kernel/linux/linux-6.6/kernel/locking/
H A Dosq_lock.c38 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
46 struct optimistic_spin_node *next = NULL; in osq_wait_next() local
69 * We must xchg() the @node->next value, because if we were to in osq_wait_next()
71 * @node->next might complete Step-A and think its @prev is in osq_wait_next()
76 * wait for a new @node->next from its Step-C. in osq_wait_next()
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; osq_lock() local
209 struct optimistic_spin_node *node, *next; osq_unlock() local
[all...]
/kernel/linux/linux-6.6/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()
66 if (pmd_none(*pmdp) && IS_ALIGNED(vaddr, PMD_SIZE) && (next - vaddr) >= PMD_SIZE) { in kasan_populate_pmd()
75 kasan_populate_pte(pmdp, vaddr, next); in kasan_populate_pmd()
76 } while (pmdp++, vaddr = next, vaddr != end); in kasan_populate_pmd()
84 unsigned long next; in kasan_populate_pud() local
94 next = pud_addr_end(vaddr, end); in kasan_populate_pud()
96 if (pud_none(*pudp) && IS_ALIGNED(vaddr, PUD_SIZE) && (next - vaddr) >= PUD_SIZE) { in kasan_populate_pud()
105 kasan_populate_pmd(pudp, vaddr, next); in kasan_populate_pud()
106 } while (pudp++, vaddr = next, vadd in kasan_populate_pud()
114 unsigned long next; kasan_populate_p4d() local
143 unsigned long next; kasan_populate_pgd() local
166 unsigned long next; kasan_early_clear_pud() local
191 unsigned long next; kasan_early_clear_p4d() local
216 unsigned long next; kasan_early_clear_pgd() local
237 unsigned long next; kasan_early_populate_pud() local
266 unsigned long next; kasan_early_populate_p4d() local
303 unsigned long next; kasan_early_populate_pgd() local
377 unsigned long next; kasan_shallow_populate_pud() local
397 unsigned long next; kasan_shallow_populate_p4d() local
416 unsigned long next; kasan_shallow_populate_pgd() local
[all...]
/kernel/linux/linux-5.10/arch/mips/include/asm/
H A Dswitch_to.h26 * @next: The task to begin executing.
27 * @next_ti: task_thread_info(next).
30 * the context of next. Returns prev.
33 struct task_struct *next, struct thread_info *next_ti);
62 next->thread.emulated_fp = 0; \
88 # define __sanitize_fcr31(next) \
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); \
[all...]
/kernel/linux/linux-6.6/arch/mips/include/asm/
H A Dswitch_to.h26 * @next: The task to begin executing.
27 * @next_ti: task_thread_info(next).
30 * the context of next. Returns prev.
33 struct task_struct *next, struct thread_info *next_ti);
62 next->thread.emulated_fp = 0; \
88 # define __sanitize_fcr31(next) \
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); \
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvif/
H A Dlist.h12 * The above copyright notice and this permission notice (including the next
92 * struct foo *iterator, *next;
93 * list_for_each_entry_safe(iterator, next, &bar.list_of_foos, entry) {
111 struct list_head *next, *prev; member
130 list->next = list->prev = list; in INIT_LIST_HEAD()
135 struct list_head *prev, struct list_head *next) in __list_add()
137 next->prev = entry; in __list_add()
138 entry->next = next; in __list_add()
140 prev->next in __list_add()
134 __list_add(struct list_head *entry, struct list_head *prev, struct list_head *next) __list_add() argument
186 __list_del(struct list_head *prev, struct list_head *next) __list_del() argument
[all...]
/kernel/linux/linux-5.10/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()
164 * DESCRIPTION: Get next op in tree (walking the tree in depth-first order)
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()
[all...]
/kernel/linux/linux-6.6/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()
164 * DESCRIPTION: Get next op in tree (walking the tree in depth-first order)
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()
[all...]
/kernel/linux/linux-5.10/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 in ___sym_malloc()
[all...]
/kernel/linux/linux-6.6/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 in ___sym_malloc()
[all...]

Completed in 11 milliseconds

12345678910>>...269