blob: 8727032e3a6fbd6038aa4283a58cf1ce782d37f2 [file] [log] [blame]
Oleg Nesterove73f8952012-05-11 10:59:07 +10001#include <linux/spinlock.h>
2#include <linux/task_work.h>
3#include <linux/tracehook.h>
4
Oleg Nesterov9da33de2012-08-26 21:12:11 +02005static struct callback_head work_exited; /* all we need is ->next == NULL */
6
Oleg Nesterov892f6662013-09-11 14:23:31 -07007/**
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 * RETURNS:
22 * 0 if succeeds or -ESRCH.
23 */
Oleg Nesterove73f8952012-05-11 10:59:07 +100024int
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020025task_work_add(struct task_struct *task, struct callback_head *work, bool notify)
Oleg Nesterove73f8952012-05-11 10:59:07 +100026{
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020027 struct callback_head *head;
Oleg Nesterov9da33de2012-08-26 21:12:11 +020028
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020029 do {
30 head = ACCESS_ONCE(task->task_works);
Oleg Nesterov9da33de2012-08-26 21:12:11 +020031 if (unlikely(head == &work_exited))
32 return -ESRCH;
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020033 work->next = head;
34 } while (cmpxchg(&task->task_works, head, work) != head);
Oleg Nesterove73f8952012-05-11 10:59:07 +100035
Al Viroed3e6942012-06-27 11:31:24 +040036 if (notify)
Oleg Nesterove73f8952012-05-11 10:59:07 +100037 set_notify_resume(task);
Al Viroed3e6942012-06-27 11:31:24 +040038 return 0;
Oleg Nesterove73f8952012-05-11 10:59:07 +100039}
40
Oleg Nesterov892f6662013-09-11 14:23:31 -070041/**
42 * task_work_cancel - cancel a pending work added by task_work_add()
43 * @task: the task which should execute the work
44 * @func: identifies the work to remove
45 *
46 * Find the last queued pending work with ->func == @func and remove
47 * it from queue.
48 *
49 * RETURNS:
50 * The found work or NULL if not found.
51 */
Al Viro67d12142012-06-27 11:07:19 +040052struct callback_head *
Oleg Nesterove73f8952012-05-11 10:59:07 +100053task_work_cancel(struct task_struct *task, task_work_func_t func)
54{
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020055 struct callback_head **pprev = &task->task_works;
Oleg Nesterov205e5502013-09-11 14:23:30 -070056 struct callback_head *work;
Oleg Nesterove73f8952012-05-11 10:59:07 +100057 unsigned long flags;
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020058 /*
59 * If cmpxchg() fails we continue without updating pprev.
60 * Either we raced with task_work_add() which added the
61 * new entry before this work, we will find it again. Or
Oleg Nesterov9da33de2012-08-26 21:12:11 +020062 * we raced with task_work_run(), *pprev == NULL/exited.
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020063 */
Oleg Nesterove73f8952012-05-11 10:59:07 +100064 raw_spin_lock_irqsave(&task->pi_lock, flags);
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020065 while ((work = ACCESS_ONCE(*pprev))) {
Oleg Nesterov205e5502013-09-11 14:23:30 -070066 smp_read_barrier_depends();
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020067 if (work->func != func)
68 pprev = &work->next;
69 else if (cmpxchg(pprev, work, work->next) == work)
70 break;
Oleg Nesterove73f8952012-05-11 10:59:07 +100071 }
Oleg Nesterove73f8952012-05-11 10:59:07 +100072 raw_spin_unlock_irqrestore(&task->pi_lock, flags);
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020073
74 return work;
Oleg Nesterove73f8952012-05-11 10:59:07 +100075}
76
Oleg Nesterov892f6662013-09-11 14:23:31 -070077/**
78 * task_work_run - execute the works added by task_work_add()
79 *
80 * Flush the pending works. Should be used by the core kernel code.
81 * Called before the task returns to the user-mode or stops, or when
82 * it exits. In the latter case task_work_add() can no longer add the
83 * new work after task_work_run() returns.
84 */
Oleg Nesterove73f8952012-05-11 10:59:07 +100085void task_work_run(void)
86{
87 struct task_struct *task = current;
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020088 struct callback_head *work, *head, *next;
Oleg Nesterove73f8952012-05-11 10:59:07 +100089
Oleg Nesterovac3d0da2012-08-26 21:12:09 +020090 for (;;) {
Oleg Nesterov9da33de2012-08-26 21:12:11 +020091 /*
92 * work->func() can do task_work_add(), do not set
93 * work_exited unless the list is empty.
94 */
95 do {
96 work = ACCESS_ONCE(task->task_works);
97 head = !work && (task->flags & PF_EXITING) ?
98 &work_exited : NULL;
99 } while (cmpxchg(&task->task_works, work, head) != work);
100
Oleg Nesterovac3d0da2012-08-26 21:12:09 +0200101 if (!work)
102 break;
103 /*
104 * Synchronize with task_work_cancel(). It can't remove
105 * the first entry == work, cmpxchg(task_works) should
106 * fail, but it can play with *work and other entries.
107 */
108 raw_spin_unlock_wait(&task->pi_lock);
109 smp_mb();
Oleg Nesterove73f8952012-05-11 10:59:07 +1000110
Oleg Nesterovac3d0da2012-08-26 21:12:09 +0200111 /* Reverse the list to run the works in fifo order */
112 head = NULL;
113 do {
114 next = work->next;
115 work->next = head;
116 head = work;
117 work = next;
118 } while (work);
Oleg Nesterove73f8952012-05-11 10:59:07 +1000119
Oleg Nesterovac3d0da2012-08-26 21:12:09 +0200120 work = head;
121 do {
122 next = work->next;
123 work->func(work);
124 work = next;
Eric Dumazetf3418612012-08-21 15:05:14 +0200125 cond_resched();
Oleg Nesterovac3d0da2012-08-26 21:12:09 +0200126 } while (work);
Oleg Nesterove73f8952012-05-11 10:59:07 +1000127 }
128}