]> git.proxmox.com Git - mirror_ubuntu-focal-kernel.git/blob - include/linux/sunrpc/sched.h
SUNRPC: allow the caller of rpc_run_task to preallocate the struct rpc_task
[mirror_ubuntu-focal-kernel.git] / include / linux / sunrpc / sched.h
1 /*
2 * linux/include/linux/sunrpc/sched.h
3 *
4 * Scheduling primitives for kernel Sun RPC.
5 *
6 * Copyright (C) 1996, Olaf Kirch <okir@monad.swb.de>
7 */
8
9 #ifndef _LINUX_SUNRPC_SCHED_H_
10 #define _LINUX_SUNRPC_SCHED_H_
11
12 #include <linux/timer.h>
13 #include <linux/sunrpc/types.h>
14 #include <linux/rcupdate.h>
15 #include <linux/spinlock.h>
16 #include <linux/wait.h>
17 #include <linux/workqueue.h>
18 #include <linux/sunrpc/xdr.h>
19
20 /*
21 * This is the actual RPC procedure call info.
22 */
23 struct rpc_procinfo;
24 struct rpc_message {
25 struct rpc_procinfo * rpc_proc; /* Procedure information */
26 void * rpc_argp; /* Arguments */
27 void * rpc_resp; /* Result */
28 struct rpc_cred * rpc_cred; /* Credentials */
29 };
30
31 struct rpc_call_ops;
32 struct rpc_wait_queue;
33 struct rpc_wait {
34 struct list_head list; /* wait queue links */
35 struct list_head links; /* Links to related tasks */
36 struct rpc_wait_queue * rpc_waitq; /* RPC wait queue we're on */
37 };
38
39 /*
40 * This is the RPC task struct
41 */
42 struct rpc_task {
43 #ifdef RPC_DEBUG
44 unsigned long tk_magic; /* 0xf00baa */
45 #endif
46 atomic_t tk_count; /* Reference count */
47 struct list_head tk_task; /* global list of tasks */
48 struct rpc_clnt * tk_client; /* RPC client */
49 struct rpc_rqst * tk_rqstp; /* RPC request */
50 int tk_status; /* result of last operation */
51
52 /*
53 * RPC call state
54 */
55 struct rpc_message tk_msg; /* RPC call info */
56 __u8 tk_garb_retry;
57 __u8 tk_cred_retry;
58
59 /*
60 * timeout_fn to be executed by timer bottom half
61 * callback to be executed after waking up
62 * action next procedure for async tasks
63 * tk_ops caller callbacks
64 */
65 void (*tk_timeout_fn)(struct rpc_task *);
66 void (*tk_callback)(struct rpc_task *);
67 void (*tk_action)(struct rpc_task *);
68 const struct rpc_call_ops *tk_ops;
69 void * tk_calldata;
70
71 /*
72 * tk_timer is used for async processing by the RPC scheduling
73 * primitives. You should not access this directly unless
74 * you have a pathological interest in kernel oopses.
75 */
76 struct timer_list tk_timer; /* kernel timer */
77 unsigned long tk_timeout; /* timeout for rpc_sleep() */
78 unsigned short tk_flags; /* misc flags */
79 unsigned long tk_runstate; /* Task run status */
80 struct workqueue_struct *tk_workqueue; /* Normally rpciod, but could
81 * be any workqueue
82 */
83 union {
84 struct work_struct tk_work; /* Async task work queue */
85 struct rpc_wait tk_wait; /* RPC wait */
86 struct rcu_head tk_rcu; /* for task deletion */
87 } u;
88
89 unsigned short tk_timeouts; /* maj timeouts */
90 size_t tk_bytes_sent; /* total bytes sent */
91 unsigned long tk_start; /* RPC task init timestamp */
92 long tk_rtt; /* round-trip time (jiffies) */
93
94 pid_t tk_owner; /* Process id for batching tasks */
95 unsigned char tk_priority : 2;/* Task priority */
96
97 #ifdef RPC_DEBUG
98 unsigned short tk_pid; /* debugging aid */
99 #endif
100 };
101 #define tk_xprt tk_client->cl_xprt
102
103 /* support walking a list of tasks on a wait queue */
104 #define task_for_each(task, pos, head) \
105 list_for_each(pos, head) \
106 if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1)
107
108 #define task_for_first(task, head) \
109 if (!list_empty(head) && \
110 ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1))
111
112 typedef void (*rpc_action)(struct rpc_task *);
113
114 struct rpc_call_ops {
115 void (*rpc_call_prepare)(struct rpc_task *, void *);
116 void (*rpc_call_done)(struct rpc_task *, void *);
117 void (*rpc_release)(void *);
118 };
119
120 struct rpc_task_setup {
121 struct rpc_task *task;
122 struct rpc_clnt *rpc_client;
123 const struct rpc_message *rpc_message;
124 const struct rpc_call_ops *callback_ops;
125 void *callback_data;
126 unsigned short flags;
127 signed char priority;
128 };
129
130 /*
131 * RPC task flags
132 */
133 #define RPC_TASK_ASYNC 0x0001 /* is an async task */
134 #define RPC_TASK_SWAPPER 0x0002 /* is swapping in/out */
135 #define RPC_CALL_MAJORSEEN 0x0020 /* major timeout seen */
136 #define RPC_TASK_ROOTCREDS 0x0040 /* force root creds */
137 #define RPC_TASK_DYNAMIC 0x0080 /* task was kmalloc'ed */
138 #define RPC_TASK_KILLED 0x0100 /* task was killed */
139 #define RPC_TASK_SOFT 0x0200 /* Use soft timeouts */
140 #define RPC_TASK_NOINTR 0x0400 /* uninterruptible task */
141
142 #define RPC_IS_ASYNC(t) ((t)->tk_flags & RPC_TASK_ASYNC)
143 #define RPC_IS_SWAPPER(t) ((t)->tk_flags & RPC_TASK_SWAPPER)
144 #define RPC_DO_ROOTOVERRIDE(t) ((t)->tk_flags & RPC_TASK_ROOTCREDS)
145 #define RPC_ASSASSINATED(t) ((t)->tk_flags & RPC_TASK_KILLED)
146 #define RPC_DO_CALLBACK(t) ((t)->tk_callback != NULL)
147 #define RPC_IS_SOFT(t) ((t)->tk_flags & RPC_TASK_SOFT)
148 #define RPC_TASK_UNINTERRUPTIBLE(t) ((t)->tk_flags & RPC_TASK_NOINTR)
149
150 #define RPC_TASK_RUNNING 0
151 #define RPC_TASK_QUEUED 1
152 #define RPC_TASK_WAKEUP 2
153 #define RPC_TASK_HAS_TIMER 3
154 #define RPC_TASK_ACTIVE 4
155
156 #define RPC_IS_RUNNING(t) test_bit(RPC_TASK_RUNNING, &(t)->tk_runstate)
157 #define rpc_set_running(t) set_bit(RPC_TASK_RUNNING, &(t)->tk_runstate)
158 #define rpc_test_and_set_running(t) \
159 test_and_set_bit(RPC_TASK_RUNNING, &(t)->tk_runstate)
160 #define rpc_clear_running(t) \
161 do { \
162 smp_mb__before_clear_bit(); \
163 clear_bit(RPC_TASK_RUNNING, &(t)->tk_runstate); \
164 smp_mb__after_clear_bit(); \
165 } while (0)
166
167 #define RPC_IS_QUEUED(t) test_bit(RPC_TASK_QUEUED, &(t)->tk_runstate)
168 #define rpc_set_queued(t) set_bit(RPC_TASK_QUEUED, &(t)->tk_runstate)
169 #define rpc_clear_queued(t) \
170 do { \
171 smp_mb__before_clear_bit(); \
172 clear_bit(RPC_TASK_QUEUED, &(t)->tk_runstate); \
173 smp_mb__after_clear_bit(); \
174 } while (0)
175
176 #define rpc_start_wakeup(t) \
177 (test_and_set_bit(RPC_TASK_WAKEUP, &(t)->tk_runstate) == 0)
178 #define rpc_finish_wakeup(t) \
179 do { \
180 smp_mb__before_clear_bit(); \
181 clear_bit(RPC_TASK_WAKEUP, &(t)->tk_runstate); \
182 smp_mb__after_clear_bit(); \
183 } while (0)
184
185 #define RPC_IS_ACTIVATED(t) test_bit(RPC_TASK_ACTIVE, &(t)->tk_runstate)
186
187 /*
188 * Task priorities.
189 * Note: if you change these, you must also change
190 * the task initialization definitions below.
191 */
192 #define RPC_PRIORITY_LOW (-1)
193 #define RPC_PRIORITY_NORMAL (0)
194 #define RPC_PRIORITY_HIGH (1)
195 #define RPC_NR_PRIORITY (1 + RPC_PRIORITY_HIGH - RPC_PRIORITY_LOW)
196
197 /*
198 * RPC synchronization objects
199 */
200 struct rpc_wait_queue {
201 spinlock_t lock;
202 struct list_head tasks[RPC_NR_PRIORITY]; /* task queue for each priority level */
203 pid_t owner; /* process id of last task serviced */
204 unsigned char maxpriority; /* maximum priority (0 if queue is not a priority queue) */
205 unsigned char priority; /* current priority */
206 unsigned char count; /* # task groups remaining serviced so far */
207 unsigned char nr; /* # tasks remaining for cookie */
208 unsigned short qlen; /* total # tasks waiting in queue */
209 #ifdef RPC_DEBUG
210 const char * name;
211 #endif
212 };
213
214 /*
215 * This is the # requests to send consecutively
216 * from a single cookie. The aim is to improve
217 * performance of NFS operations such as read/write.
218 */
219 #define RPC_BATCH_COUNT 16
220
221 #ifndef RPC_DEBUG
222 # define RPC_WAITQ_INIT(var,qname) { \
223 .lock = __SPIN_LOCK_UNLOCKED(var.lock), \
224 .tasks = { \
225 [0] = LIST_HEAD_INIT(var.tasks[0]), \
226 [1] = LIST_HEAD_INIT(var.tasks[1]), \
227 [2] = LIST_HEAD_INIT(var.tasks[2]), \
228 }, \
229 }
230 #else
231 # define RPC_WAITQ_INIT(var,qname) { \
232 .lock = __SPIN_LOCK_UNLOCKED(var.lock), \
233 .tasks = { \
234 [0] = LIST_HEAD_INIT(var.tasks[0]), \
235 [1] = LIST_HEAD_INIT(var.tasks[1]), \
236 [2] = LIST_HEAD_INIT(var.tasks[2]), \
237 }, \
238 .name = qname, \
239 }
240 #endif
241 # define RPC_WAITQ(var,qname) struct rpc_wait_queue var = RPC_WAITQ_INIT(var,qname)
242
243 #define RPC_IS_PRIORITY(q) ((q)->maxpriority > 0)
244
245 /*
246 * Function prototypes
247 */
248 struct rpc_task *rpc_new_task(const struct rpc_task_setup *);
249 struct rpc_task *rpc_run_task(const struct rpc_task_setup *);
250 void rpc_init_task(struct rpc_task *task, const struct rpc_task_setup *);
251 void rpc_put_task(struct rpc_task *);
252 void rpc_exit_task(struct rpc_task *);
253 void rpc_release_calldata(const struct rpc_call_ops *, void *);
254 void rpc_killall_tasks(struct rpc_clnt *);
255 void rpc_execute(struct rpc_task *);
256 void rpc_init_priority_wait_queue(struct rpc_wait_queue *, const char *);
257 void rpc_init_wait_queue(struct rpc_wait_queue *, const char *);
258 void rpc_sleep_on(struct rpc_wait_queue *, struct rpc_task *,
259 rpc_action action, rpc_action timer);
260 void rpc_wake_up_task(struct rpc_task *);
261 void rpc_wake_up(struct rpc_wait_queue *);
262 struct rpc_task *rpc_wake_up_next(struct rpc_wait_queue *);
263 void rpc_wake_up_status(struct rpc_wait_queue *, int);
264 void rpc_delay(struct rpc_task *, unsigned long);
265 void * rpc_malloc(struct rpc_task *, size_t);
266 void rpc_free(void *);
267 int rpciod_up(void);
268 void rpciod_down(void);
269 int __rpc_wait_for_completion_task(struct rpc_task *task, int (*)(void *));
270 #ifdef RPC_DEBUG
271 void rpc_show_tasks(void);
272 #endif
273 int rpc_init_mempool(void);
274 void rpc_destroy_mempool(void);
275 extern struct workqueue_struct *rpciod_workqueue;
276
277 static inline void rpc_exit(struct rpc_task *task, int status)
278 {
279 task->tk_status = status;
280 task->tk_action = rpc_exit_task;
281 }
282
283 static inline int rpc_wait_for_completion_task(struct rpc_task *task)
284 {
285 return __rpc_wait_for_completion_task(task, NULL);
286 }
287
288 #ifdef RPC_DEBUG
289 static inline const char * rpc_qname(struct rpc_wait_queue *q)
290 {
291 return ((q && q->name) ? q->name : "unknown");
292 }
293 #endif
294
295 #endif /* _LINUX_SUNRPC_SCHED_H_ */