Loading...
1#include <linux/spinlock.h>
2#include <linux/task_work.h>
3#include <linux/tracehook.h>
4
5static struct callback_head work_exited; /* all we need is ->next == NULL */
6
7/**
8 * task_work_add - ask the @task to execute @work->func()
9 * @task: the task which should run the callback
10 * @work: the callback to run
11 * @notify: send the notification if true
12 *
13 * Queue @work for task_work_run() below and notify the @task if @notify.
14 * Fails if the @task is exiting/exited and thus it can't process this @work.
15 * Otherwise @work->func() will be called when the @task returns from kernel
16 * mode or exits.
17 *
18 * This is like the signal handler which runs in kernel mode, but it doesn't
19 * try to wake up the @task.
20 *
21 * Note: there is no ordering guarantee on works queued here.
22 *
23 * RETURNS:
24 * 0 if succeeds or -ESRCH.
25 */
26int
27task_work_add(struct task_struct *task, struct callback_head *work, bool notify)
28{
29 struct callback_head *head;
30
31 do {
32 head = ACCESS_ONCE(task->task_works);
33 if (unlikely(head == &work_exited))
34 return -ESRCH;
35 work->next = head;
36 } while (cmpxchg(&task->task_works, head, work) != head);
37
38 if (notify)
39 set_notify_resume(task);
40 return 0;
41}
42
43/**
44 * task_work_cancel - cancel a pending work added by task_work_add()
45 * @task: the task which should execute the work
46 * @func: identifies the work to remove
47 *
48 * Find the last queued pending work with ->func == @func and remove
49 * it from queue.
50 *
51 * RETURNS:
52 * The found work or NULL if not found.
53 */
54struct callback_head *
55task_work_cancel(struct task_struct *task, task_work_func_t func)
56{
57 struct callback_head **pprev = &task->task_works;
58 struct callback_head *work;
59 unsigned long flags;
60 /*
61 * If cmpxchg() fails we continue without updating pprev.
62 * Either we raced with task_work_add() which added the
63 * new entry before this work, we will find it again. Or
64 * we raced with task_work_run(), *pprev == NULL/exited.
65 */
66 raw_spin_lock_irqsave(&task->pi_lock, flags);
67 while ((work = ACCESS_ONCE(*pprev))) {
68 smp_read_barrier_depends();
69 if (work->func != func)
70 pprev = &work->next;
71 else if (cmpxchg(pprev, work, work->next) == work)
72 break;
73 }
74 raw_spin_unlock_irqrestore(&task->pi_lock, flags);
75
76 return work;
77}
78
79/**
80 * task_work_run - execute the works added by task_work_add()
81 *
82 * Flush the pending works. Should be used by the core kernel code.
83 * Called before the task returns to the user-mode or stops, or when
84 * it exits. In the latter case task_work_add() can no longer add the
85 * new work after task_work_run() returns.
86 */
87void task_work_run(void)
88{
89 struct task_struct *task = current;
90 struct callback_head *work, *head, *next;
91
92 for (;;) {
93 /*
94 * work->func() can do task_work_add(), do not set
95 * work_exited unless the list is empty.
96 */
97 do {
98 work = ACCESS_ONCE(task->task_works);
99 head = !work && (task->flags & PF_EXITING) ?
100 &work_exited : NULL;
101 } while (cmpxchg(&task->task_works, work, head) != work);
102
103 if (!work)
104 break;
105 /*
106 * Synchronize with task_work_cancel(). It can't remove
107 * the first entry == work, cmpxchg(task_works) should
108 * fail, but it can play with *work and other entries.
109 */
110 raw_spin_unlock_wait(&task->pi_lock);
111 smp_mb();
112
113 do {
114 next = work->next;
115 work->func(work);
116 work = next;
117 cond_resched();
118 } while (work);
119 }
120}
1// SPDX-License-Identifier: GPL-2.0
2#include <linux/spinlock.h>
3#include <linux/task_work.h>
4#include <linux/tracehook.h>
5
6static struct callback_head work_exited; /* all we need is ->next == NULL */
7
8/**
9 * task_work_add - ask the @task to execute @work->func()
10 * @task: the task which should run the callback
11 * @work: the callback to run
12 * @notify: send the notification if true
13 *
14 * Queue @work for task_work_run() below and notify the @task if @notify.
15 * Fails if the @task is exiting/exited and thus it can't process this @work.
16 * Otherwise @work->func() will be called when the @task returns from kernel
17 * mode or exits.
18 *
19 * This is like the signal handler which runs in kernel mode, but it doesn't
20 * try to wake up the @task.
21 *
22 * Note: there is no ordering guarantee on works queued here.
23 *
24 * RETURNS:
25 * 0 if succeeds or -ESRCH.
26 */
27int
28task_work_add(struct task_struct *task, struct callback_head *work, bool notify)
29{
30 struct callback_head *head;
31
32 do {
33 head = READ_ONCE(task->task_works);
34 if (unlikely(head == &work_exited))
35 return -ESRCH;
36 work->next = head;
37 } while (cmpxchg(&task->task_works, head, work) != head);
38
39 if (notify)
40 set_notify_resume(task);
41 return 0;
42}
43
44/**
45 * task_work_cancel - cancel a pending work added by task_work_add()
46 * @task: the task which should execute the work
47 * @func: identifies the work to remove
48 *
49 * Find the last queued pending work with ->func == @func and remove
50 * it from queue.
51 *
52 * RETURNS:
53 * The found work or NULL if not found.
54 */
55struct callback_head *
56task_work_cancel(struct task_struct *task, task_work_func_t func)
57{
58 struct callback_head **pprev = &task->task_works;
59 struct callback_head *work;
60 unsigned long flags;
61
62 if (likely(!task->task_works))
63 return NULL;
64 /*
65 * If cmpxchg() fails we continue without updating pprev.
66 * Either we raced with task_work_add() which added the
67 * new entry before this work, we will find it again. Or
68 * we raced with task_work_run(), *pprev == NULL/exited.
69 */
70 raw_spin_lock_irqsave(&task->pi_lock, flags);
71 while ((work = READ_ONCE(*pprev))) {
72 if (work->func != func)
73 pprev = &work->next;
74 else if (cmpxchg(pprev, work, work->next) == work)
75 break;
76 }
77 raw_spin_unlock_irqrestore(&task->pi_lock, flags);
78
79 return work;
80}
81
82/**
83 * task_work_run - execute the works added by task_work_add()
84 *
85 * Flush the pending works. Should be used by the core kernel code.
86 * Called before the task returns to the user-mode or stops, or when
87 * it exits. In the latter case task_work_add() can no longer add the
88 * new work after task_work_run() returns.
89 */
90void task_work_run(void)
91{
92 struct task_struct *task = current;
93 struct callback_head *work, *head, *next;
94
95 for (;;) {
96 /*
97 * work->func() can do task_work_add(), do not set
98 * work_exited unless the list is empty.
99 */
100 raw_spin_lock_irq(&task->pi_lock);
101 do {
102 work = READ_ONCE(task->task_works);
103 head = !work && (task->flags & PF_EXITING) ?
104 &work_exited : NULL;
105 } while (cmpxchg(&task->task_works, work, head) != work);
106 raw_spin_unlock_irq(&task->pi_lock);
107
108 if (!work)
109 break;
110
111 do {
112 next = work->next;
113 work->func(work);
114 work = next;
115 cond_resched();
116 } while (work);
117 }
118}