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

1234567891011>>

/linux-master/arch/xtensa/include/asm/
H A Dswitch_to.h15 extern void *_switch_to(void *last, void *next);
17 #define switch_to(prev,next,last) \
19 (last) = _switch_to(prev, next); \
/linux-master/lib/
H A Dlist_debug.c23 struct list_head *next)
27 CHECK_DATA_CORRUPTION(next == NULL,
28 "list_add corruption. next is NULL.\n") ||
29 CHECK_DATA_CORRUPTION(next->prev != prev,
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n",
31 prev, next->prev, next) ||
32 CHECK_DATA_CORRUPTION(prev->next != next,
22 __list_add_valid_or_report(struct list_head *new, struct list_head *prev, struct list_head *next) argument
47 struct list_head *prev, *next; local
[all...]
H A Dcpumask.c24 unsigned int next; local
27 next = cpumask_next(n, mask);
29 if (wrap && n < start && next >= start) {
32 } else if (next >= nr_cpumask_bits) {
38 return next;
172 unsigned int next, prev; local
177 next = find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p),
179 if (next < nr_cpu_ids)
180 __this_cpu_write(distribute_cpu_mask_prev, next);
182 return next;
194 unsigned int next, prev; local
[all...]
H A Dllist.c32 new_last->next = first;
49 * llist_add) sequence in another user may change @head->first->next,
55 struct llist_node *entry, *next; local
61 next = READ_ONCE(entry->next);
62 } while (!try_cmpxchg(&head->first, &entry, next));
82 struct llist_node *entry, *next; local
89 next = READ_ONCE(entry->next);
90 } while (!try_cmpxchg(&head->first, &entry, next));
[all...]
/linux-master/arch/microblaze/include/asm/
H A Dswitch_to.h13 struct thread_info *next);
15 #define switch_to(prev, next, last) \
18 task_thread_info(next)); \
/linux-master/arch/nios2/include/asm/
H A Dswitch_to.h17 #define switch_to(prev, next, last) \
26 : "r" (prev), "r" (next) \
/linux-master/scripts/kconfig/
H A Dlist_types.h6 struct list_head *next, *prev; member in struct:list_head
14 struct hlist_node *next, **pprev; member in struct:hlist_node
/linux-master/tools/testing/selftests/bpf/progs/
H A Dtest_core_read_macros.c13 struct callback_head___shuffled *next; member in struct:callback_head___shuffled
38 /* next pointers for kernel address space have to be initialized from
41 k_probe_in.next = &k_probe_in;
42 __builtin_preserve_access_index(({k_core_in.next = &k_core_in;}));
44 k_probe_out = (long)BPF_PROBE_READ(&k_probe_in, next, next, func);
45 k_core_out = (long)BPF_CORE_READ(&k_core_in, next, next, func);
46 u_probe_out = (long)BPF_PROBE_READ_USER(u_probe_in, next, next, fun
[all...]
/linux-master/arch/arm64/kvm/hyp/nvhe/
H A Dlist_debug.c31 struct list_head *next)
33 if (NVHE_CHECK_DATA_CORRUPTION(next->prev != prev) ||
34 NVHE_CHECK_DATA_CORRUPTION(prev->next != next) ||
35 NVHE_CHECK_DATA_CORRUPTION(new == prev || new == next))
44 struct list_head *prev, *next; local
47 next = entry->next;
49 if (NVHE_CHECK_DATA_CORRUPTION(next == LIST_POISON1) ||
51 NVHE_CHECK_DATA_CORRUPTION(prev->next !
30 __list_add_valid_or_report(struct list_head *new, struct list_head *prev, struct list_head *next) argument
[all...]
/linux-master/arch/arc/include/asm/
H A Dswitch_to.h17 #define switch_to(prev, next, last) \
19 dsp_save_restore(prev, next); \
20 fpu_save_restore(prev, next); \
21 last = __switch_to(prev, next);\
/linux-master/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; local
27 pos->next = node;
28 node->next = next;
29 if (!next)
36 node->next
[all...]
/linux-master/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 in struct:list_head
30 list->next = list;
38 * the prev/next entries already!
42 struct list_head *next)
44 next->prev = new;
45 new->next = next;
47 prev->next = new;
60 __list_add(new, head, head->next);
40 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
70 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/linux-master/arch/loongarch/include/asm/
H A Dswitch_to.h17 * @next: The task to begin executing.
18 * @next_ti: task_thread_info(next).
23 * the context of next. Returns prev.
26 struct task_struct *next, struct thread_info *next_ti,
35 #define switch_to(prev, next, last) \
39 hw_breakpoint_thread_switch(next); \
40 (last) = __switch_to(prev, next, task_thread_info(next), \
/linux-master/kernel/locking/
H A Dosq_lock.c16 struct optimistic_spin_node *next, *prev; member in struct:optimistic_spin_node
45 * Get a stable @node->next pointer, either for unlock() or unqueue() purposes.
72 * We must xchg() the @node->next value, because if we were to
74 * @node->next might complete Step-A and think its @prev is
79 * wait for a new @node->next from its Step-C.
81 if (node->next) {
82 struct optimistic_spin_node *next; local
84 next = xchg(&node->next, NULL);
85 if (next)
96 struct optimistic_spin_node *prev, *next; local
212 struct optimistic_spin_node *node, *next; local
[all...]
H A Dmcs_spinlock.h19 struct mcs_spinlock *next; member in struct:mcs_spinlock
71 node->next = NULL;
91 WRITE_ONCE(prev->next, node);
104 struct mcs_spinlock *next = READ_ONCE(node->next); local
106 if (likely(!next)) {
112 /* Wait until the next pointer is set */
113 while (!(next = READ_ONCE(node->next)))
117 /* Pass lock to next waite
[all...]
/linux-master/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...]
/linux-master/arch/csky/include/asm/
H A Dswitch_to.h10 struct task_struct *next)
13 restore_from_user_fp(&next->thread.user_fp);
17 struct task_struct *next)
27 #define switch_to(prev, next, last) \
30 struct task_struct *__next = (next); \
32 ((last) = __switch_to((prev), (next))); \
9 __switch_to_fpu(struct task_struct *prev, struct task_struct *next) argument
16 __switch_to_fpu(struct task_struct *prev, struct task_struct *next) argument
/linux-master/drivers/md/dm-vdo/
H A Dfunnel-queue.c25 queue->stub.next = NULL;
41 * Barrier requirements: We need a read barrier between reading a "next" field pointer
46 struct funnel_queue_entry *next = READ_ONCE(oldest->next); local
53 if (next == NULL)
59 oldest = next;
61 next = READ_ONCE(oldest->next);
68 if (next == NULL) {
74 * assigned previous->next
[all...]
/linux-master/arch/parisc/include/asm/
H A Dswitch_to.h9 #define switch_to(prev, next, last) do { \
10 (last) = _switch_to(prev, next); \
/linux-master/include/asm-generic/
H A Dswitch_to.h21 #define switch_to(prev, next, last) \
23 ((last) = __switch_to((prev), (next))); \
/linux-master/arch/powerpc/include/asm/
H A Dmembarrier.h5 struct mm_struct *next,
16 likely(!(atomic_read(&next->membarrier_state) &
4 membarrier_arch_switch_mm(struct mm_struct *prev, struct mm_struct *next, struct task_struct *tsk) argument
/linux-master/arch/riscv/include/asm/
H A Dmembarrier.h6 struct mm_struct *next,
17 likely(!(atomic_read(&next->membarrier_state) &
5 membarrier_arch_switch_mm(struct mm_struct *prev, struct mm_struct *next, struct task_struct *tsk) argument
/linux-master/arch/sparc/include/asm/
H A Dswitch_to_64.h7 #define prepare_arch_switch(next) \
15 * for l0/l1. It will use one for 'next' and the other to hold
16 * the output value of 'last'. 'next' is not referenced again
21 #define switch_to(prev, next, last) \
26 task_thread_info(next); \
57 : "0" (task_thread_info(next)), \
/linux-master/tools/firewire/
H A Dlist.h3 struct list *next, *prev; member in struct:list
9 list->next = list;
16 return list->next == list;
23 new_link->next = link;
24 new_link->prev->next = new_link;
25 new_link->next->prev = new_link;
37 list_insert(list->next, new_link);
43 link->prev->next = link->next;
44 link->next
[all...]
/linux-master/include/drm/
H A Dspsc_queue.h35 struct spsc_node *next; member in struct:spsc_node
69 node->next = NULL;
73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next);
91 struct spsc_node *next, *node; local
101 next = READ_ONCE(node->next);
102 WRITE_ONCE(queue->head, next);
104 if (unlikely(!next)) {
108 (long)&node->next, (long) &queue->head) != (long)&node->next) {
[all...]

Completed in 380 milliseconds

1234567891011>>