158e1645e0
layout based on Oleg's suggestion; single-linked list, task->task_works points to the last element, forward pointer from said last element points to head. I'd still prefer much more regular scheme with two pointers in task_work, but... Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
32 lines
686 B
C
32 lines
686 B
C
#ifndef _LINUX_TASK_WORK_H
|
|
#define _LINUX_TASK_WORK_H
|
|
|
|
#include <linux/list.h>
|
|
#include <linux/sched.h>
|
|
|
|
struct task_work;
|
|
typedef void (*task_work_func_t)(struct task_work *);
|
|
|
|
struct task_work {
|
|
struct task_work *next;
|
|
task_work_func_t func;
|
|
};
|
|
|
|
static inline void
|
|
init_task_work(struct task_work *twork, task_work_func_t func)
|
|
{
|
|
twork->func = func;
|
|
}
|
|
|
|
int task_work_add(struct task_struct *task, struct task_work *twork, bool);
|
|
struct task_work *task_work_cancel(struct task_struct *, task_work_func_t);
|
|
void task_work_run(void);
|
|
|
|
static inline void exit_task_work(struct task_struct *task)
|
|
{
|
|
if (unlikely(task->task_works))
|
|
task_work_run();
|
|
}
|
|
|
|
#endif /* _LINUX_TASK_WORK_H */
|