]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/ipc/sem.c | |
3 | * Copyright (C) 1992 Krishna Balasubramanian | |
4 | * Copyright (C) 1995 Eric Schenk, Bruno Haible | |
5 | * | |
6 | * IMPLEMENTATION NOTES ON CODE REWRITE (Eric Schenk, January 1995): | |
7 | * This code underwent a massive rewrite in order to solve some problems | |
8 | * with the original code. In particular the original code failed to | |
9 | * wake up processes that were waiting for semval to go to 0 if the | |
10 | * value went to 0 and was then incremented rapidly enough. In solving | |
11 | * this problem I have also modified the implementation so that it | |
12 | * processes pending operations in a FIFO manner, thus give a guarantee | |
13 | * that processes waiting for a lock on the semaphore won't starve | |
14 | * unless another locking process fails to unlock. | |
15 | * In addition the following two changes in behavior have been introduced: | |
16 | * - The original implementation of semop returned the value | |
17 | * last semaphore element examined on success. This does not | |
18 | * match the manual page specifications, and effectively | |
19 | * allows the user to read the semaphore even if they do not | |
20 | * have read permissions. The implementation now returns 0 | |
21 | * on success as stated in the manual page. | |
22 | * - There is some confusion over whether the set of undo adjustments | |
23 | * to be performed at exit should be done in an atomic manner. | |
24 | * That is, if we are attempting to decrement the semval should we queue | |
25 | * up and wait until we can do so legally? | |
26 | * The original implementation attempted to do this. | |
27 | * The current implementation does not do so. This is because I don't | |
28 | * think it is the right thing (TM) to do, and because I couldn't | |
29 | * see a clean way to get the old behavior with the new design. | |
30 | * The POSIX standard and SVID should be consulted to determine | |
31 | * what behavior is mandated. | |
32 | * | |
33 | * Further notes on refinement (Christoph Rohland, December 1998): | |
34 | * - The POSIX standard says, that the undo adjustments simply should | |
35 | * redo. So the current implementation is o.K. | |
36 | * - The previous code had two flaws: | |
37 | * 1) It actively gave the semaphore to the next waiting process | |
38 | * sleeping on the semaphore. Since this process did not have the | |
39 | * cpu this led to many unnecessary context switches and bad | |
40 | * performance. Now we only check which process should be able to | |
41 | * get the semaphore and if this process wants to reduce some | |
42 | * semaphore value we simply wake it up without doing the | |
43 | * operation. So it has to try to get it later. Thus e.g. the | |
44 | * running process may reacquire the semaphore during the current | |
45 | * time slice. If it only waits for zero or increases the semaphore, | |
46 | * we do the operation in advance and wake it up. | |
47 | * 2) It did not wake up all zero waiting processes. We try to do | |
48 | * better but only get the semops right which only wait for zero or | |
49 | * increase. If there are decrement operations in the operations | |
50 | * array we do the same as before. | |
51 | * | |
52 | * With the incarnation of O(1) scheduler, it becomes unnecessary to perform | |
53 | * check/retry algorithm for waking up blocked processes as the new scheduler | |
54 | * is better at handling thread switch than the old one. | |
55 | * | |
56 | * /proc/sysvipc/sem support (c) 1999 Dragos Acostachioaie <dragos@iname.com> | |
57 | * | |
58 | * SMP-threaded, sysctl's added | |
624dffcb | 59 | * (c) 1999 Manfred Spraul <manfred@colorfullife.com> |
1da177e4 | 60 | * Enforced range limit on SEM_UNDO |
046c6884 | 61 | * (c) 2001 Red Hat Inc |
1da177e4 LT |
62 | * Lockless wakeup |
63 | * (c) 2003 Manfred Spraul <manfred@colorfullife.com> | |
073115d6 SG |
64 | * |
65 | * support for audit of ipc object properties and permission changes | |
66 | * Dustin Kirkland <dustin.kirkland@us.ibm.com> | |
e3893534 KK |
67 | * |
68 | * namespaces support | |
69 | * OpenVZ, SWsoft Inc. | |
70 | * Pavel Emelianov <xemul@openvz.org> | |
1da177e4 LT |
71 | */ |
72 | ||
1da177e4 LT |
73 | #include <linux/slab.h> |
74 | #include <linux/spinlock.h> | |
75 | #include <linux/init.h> | |
76 | #include <linux/proc_fs.h> | |
77 | #include <linux/time.h> | |
1da177e4 LT |
78 | #include <linux/security.h> |
79 | #include <linux/syscalls.h> | |
80 | #include <linux/audit.h> | |
c59ede7b | 81 | #include <linux/capability.h> |
19b4946c | 82 | #include <linux/seq_file.h> |
3e148c79 | 83 | #include <linux/rwsem.h> |
e3893534 | 84 | #include <linux/nsproxy.h> |
ae5e1b22 | 85 | #include <linux/ipc_namespace.h> |
5f921ae9 | 86 | |
1da177e4 LT |
87 | #include <asm/uaccess.h> |
88 | #include "util.h" | |
89 | ||
ed2ddbf8 | 90 | #define sem_ids(ns) ((ns)->ids[IPC_SEM_IDS]) |
e3893534 | 91 | |
e3893534 | 92 | #define sem_unlock(sma) ipc_unlock(&(sma)->sem_perm) |
1b531f21 | 93 | #define sem_checkid(sma, semid) ipc_checkid(&sma->sem_perm, semid) |
1da177e4 | 94 | |
7748dbfa | 95 | static int newary(struct ipc_namespace *, struct ipc_params *); |
01b8b07a | 96 | static void freeary(struct ipc_namespace *, struct kern_ipc_perm *); |
1da177e4 | 97 | #ifdef CONFIG_PROC_FS |
19b4946c | 98 | static int sysvipc_sem_proc_show(struct seq_file *s, void *it); |
1da177e4 LT |
99 | #endif |
100 | ||
101 | #define SEMMSL_FAST 256 /* 512 bytes on stack */ | |
102 | #define SEMOPM_FAST 64 /* ~ 372 bytes on stack */ | |
103 | ||
104 | /* | |
105 | * linked list protection: | |
106 | * sem_undo.id_next, | |
107 | * sem_array.sem_pending{,last}, | |
108 | * sem_array.sem_undo: sem_lock() for read/write | |
109 | * sem_undo.proc_next: only "current" is allowed to read/write that field. | |
110 | * | |
111 | */ | |
112 | ||
e3893534 KK |
113 | #define sc_semmsl sem_ctls[0] |
114 | #define sc_semmns sem_ctls[1] | |
115 | #define sc_semopm sem_ctls[2] | |
116 | #define sc_semmni sem_ctls[3] | |
117 | ||
ed2ddbf8 | 118 | void sem_init_ns(struct ipc_namespace *ns) |
e3893534 | 119 | { |
e3893534 KK |
120 | ns->sc_semmsl = SEMMSL; |
121 | ns->sc_semmns = SEMMNS; | |
122 | ns->sc_semopm = SEMOPM; | |
123 | ns->sc_semmni = SEMMNI; | |
124 | ns->used_sems = 0; | |
ed2ddbf8 | 125 | ipc_init_ids(&ns->ids[IPC_SEM_IDS]); |
e3893534 KK |
126 | } |
127 | ||
ae5e1b22 | 128 | #ifdef CONFIG_IPC_NS |
e3893534 KK |
129 | void sem_exit_ns(struct ipc_namespace *ns) |
130 | { | |
01b8b07a | 131 | free_ipcs(ns, &sem_ids(ns), freeary); |
7d6feeb2 | 132 | idr_destroy(&ns->ids[IPC_SEM_IDS].ipcs_idr); |
e3893534 | 133 | } |
ae5e1b22 | 134 | #endif |
1da177e4 LT |
135 | |
136 | void __init sem_init (void) | |
137 | { | |
ed2ddbf8 | 138 | sem_init_ns(&init_ipc_ns); |
19b4946c MW |
139 | ipc_init_proc_interface("sysvipc/sem", |
140 | " key semid perms nsems uid gid cuid cgid otime ctime\n", | |
e3893534 | 141 | IPC_SEM_IDS, sysvipc_sem_proc_show); |
1da177e4 LT |
142 | } |
143 | ||
3e148c79 ND |
144 | /* |
145 | * sem_lock_(check_) routines are called in the paths where the rw_mutex | |
146 | * is not held. | |
147 | */ | |
023a5355 ND |
148 | static inline struct sem_array *sem_lock(struct ipc_namespace *ns, int id) |
149 | { | |
03f02c76 ND |
150 | struct kern_ipc_perm *ipcp = ipc_lock(&sem_ids(ns), id); |
151 | ||
b1ed88b4 PP |
152 | if (IS_ERR(ipcp)) |
153 | return (struct sem_array *)ipcp; | |
154 | ||
03f02c76 | 155 | return container_of(ipcp, struct sem_array, sem_perm); |
023a5355 ND |
156 | } |
157 | ||
158 | static inline struct sem_array *sem_lock_check(struct ipc_namespace *ns, | |
159 | int id) | |
160 | { | |
03f02c76 ND |
161 | struct kern_ipc_perm *ipcp = ipc_lock_check(&sem_ids(ns), id); |
162 | ||
b1ed88b4 PP |
163 | if (IS_ERR(ipcp)) |
164 | return (struct sem_array *)ipcp; | |
165 | ||
03f02c76 | 166 | return container_of(ipcp, struct sem_array, sem_perm); |
023a5355 ND |
167 | } |
168 | ||
6ff37972 PP |
169 | static inline void sem_lock_and_putref(struct sem_array *sma) |
170 | { | |
171 | ipc_lock_by_ptr(&sma->sem_perm); | |
172 | ipc_rcu_putref(sma); | |
173 | } | |
174 | ||
175 | static inline void sem_getref_and_unlock(struct sem_array *sma) | |
176 | { | |
177 | ipc_rcu_getref(sma); | |
178 | ipc_unlock(&(sma)->sem_perm); | |
179 | } | |
180 | ||
181 | static inline void sem_putref(struct sem_array *sma) | |
182 | { | |
183 | ipc_lock_by_ptr(&sma->sem_perm); | |
184 | ipc_rcu_putref(sma); | |
185 | ipc_unlock(&(sma)->sem_perm); | |
186 | } | |
187 | ||
7ca7e564 ND |
188 | static inline void sem_rmid(struct ipc_namespace *ns, struct sem_array *s) |
189 | { | |
190 | ipc_rmid(&sem_ids(ns), &s->sem_perm); | |
191 | } | |
192 | ||
1da177e4 LT |
193 | /* |
194 | * Lockless wakeup algorithm: | |
195 | * Without the check/retry algorithm a lockless wakeup is possible: | |
196 | * - queue.status is initialized to -EINTR before blocking. | |
197 | * - wakeup is performed by | |
198 | * * unlinking the queue entry from sma->sem_pending | |
199 | * * setting queue.status to IN_WAKEUP | |
200 | * This is the notification for the blocked thread that a | |
201 | * result value is imminent. | |
202 | * * call wake_up_process | |
203 | * * set queue.status to the final value. | |
204 | * - the previously blocked thread checks queue.status: | |
205 | * * if it's IN_WAKEUP, then it must wait until the value changes | |
206 | * * if it's not -EINTR, then the operation was completed by | |
207 | * update_queue. semtimedop can return queue.status without | |
5f921ae9 | 208 | * performing any operation on the sem array. |
1da177e4 LT |
209 | * * otherwise it must acquire the spinlock and check what's up. |
210 | * | |
211 | * The two-stage algorithm is necessary to protect against the following | |
212 | * races: | |
213 | * - if queue.status is set after wake_up_process, then the woken up idle | |
214 | * thread could race forward and try (and fail) to acquire sma->lock | |
215 | * before update_queue had a chance to set queue.status | |
216 | * - if queue.status is written before wake_up_process and if the | |
217 | * blocked process is woken up by a signal between writing | |
218 | * queue.status and the wake_up_process, then the woken up | |
219 | * process could return from semtimedop and die by calling | |
220 | * sys_exit before wake_up_process is called. Then wake_up_process | |
221 | * will oops, because the task structure is already invalid. | |
222 | * (yes, this happened on s390 with sysv msg). | |
223 | * | |
224 | */ | |
225 | #define IN_WAKEUP 1 | |
226 | ||
f4566f04 ND |
227 | /** |
228 | * newary - Create a new semaphore set | |
229 | * @ns: namespace | |
230 | * @params: ptr to the structure that contains key, semflg and nsems | |
231 | * | |
3e148c79 | 232 | * Called with sem_ids.rw_mutex held (as a writer) |
f4566f04 ND |
233 | */ |
234 | ||
7748dbfa | 235 | static int newary(struct ipc_namespace *ns, struct ipc_params *params) |
1da177e4 LT |
236 | { |
237 | int id; | |
238 | int retval; | |
239 | struct sem_array *sma; | |
240 | int size; | |
7748dbfa ND |
241 | key_t key = params->key; |
242 | int nsems = params->u.nsems; | |
243 | int semflg = params->flg; | |
b97e820f | 244 | int i; |
1da177e4 LT |
245 | |
246 | if (!nsems) | |
247 | return -EINVAL; | |
e3893534 | 248 | if (ns->used_sems + nsems > ns->sc_semmns) |
1da177e4 LT |
249 | return -ENOSPC; |
250 | ||
251 | size = sizeof (*sma) + nsems * sizeof (struct sem); | |
252 | sma = ipc_rcu_alloc(size); | |
253 | if (!sma) { | |
254 | return -ENOMEM; | |
255 | } | |
256 | memset (sma, 0, size); | |
257 | ||
258 | sma->sem_perm.mode = (semflg & S_IRWXUGO); | |
259 | sma->sem_perm.key = key; | |
260 | ||
261 | sma->sem_perm.security = NULL; | |
262 | retval = security_sem_alloc(sma); | |
263 | if (retval) { | |
264 | ipc_rcu_putref(sma); | |
265 | return retval; | |
266 | } | |
267 | ||
e3893534 | 268 | id = ipc_addid(&sem_ids(ns), &sma->sem_perm, ns->sc_semmni); |
283bb7fa | 269 | if (id < 0) { |
1da177e4 LT |
270 | security_sem_free(sma); |
271 | ipc_rcu_putref(sma); | |
283bb7fa | 272 | return id; |
1da177e4 | 273 | } |
e3893534 | 274 | ns->used_sems += nsems; |
1da177e4 LT |
275 | |
276 | sma->sem_base = (struct sem *) &sma[1]; | |
b97e820f MS |
277 | |
278 | for (i = 0; i < nsems; i++) | |
279 | INIT_LIST_HEAD(&sma->sem_base[i].sem_pending); | |
280 | ||
281 | sma->complex_count = 0; | |
a1193f8e | 282 | INIT_LIST_HEAD(&sma->sem_pending); |
4daa28f6 | 283 | INIT_LIST_HEAD(&sma->list_id); |
1da177e4 LT |
284 | sma->sem_nsems = nsems; |
285 | sma->sem_ctime = get_seconds(); | |
286 | sem_unlock(sma); | |
287 | ||
7ca7e564 | 288 | return sma->sem_perm.id; |
1da177e4 LT |
289 | } |
290 | ||
7748dbfa | 291 | |
f4566f04 | 292 | /* |
3e148c79 | 293 | * Called with sem_ids.rw_mutex and ipcp locked. |
f4566f04 | 294 | */ |
03f02c76 | 295 | static inline int sem_security(struct kern_ipc_perm *ipcp, int semflg) |
7748dbfa | 296 | { |
03f02c76 ND |
297 | struct sem_array *sma; |
298 | ||
299 | sma = container_of(ipcp, struct sem_array, sem_perm); | |
300 | return security_sem_associate(sma, semflg); | |
7748dbfa ND |
301 | } |
302 | ||
f4566f04 | 303 | /* |
3e148c79 | 304 | * Called with sem_ids.rw_mutex and ipcp locked. |
f4566f04 | 305 | */ |
03f02c76 ND |
306 | static inline int sem_more_checks(struct kern_ipc_perm *ipcp, |
307 | struct ipc_params *params) | |
7748dbfa | 308 | { |
03f02c76 ND |
309 | struct sem_array *sma; |
310 | ||
311 | sma = container_of(ipcp, struct sem_array, sem_perm); | |
312 | if (params->u.nsems > sma->sem_nsems) | |
7748dbfa ND |
313 | return -EINVAL; |
314 | ||
315 | return 0; | |
316 | } | |
317 | ||
d5460c99 | 318 | SYSCALL_DEFINE3(semget, key_t, key, int, nsems, int, semflg) |
1da177e4 | 319 | { |
e3893534 | 320 | struct ipc_namespace *ns; |
7748dbfa ND |
321 | struct ipc_ops sem_ops; |
322 | struct ipc_params sem_params; | |
e3893534 KK |
323 | |
324 | ns = current->nsproxy->ipc_ns; | |
1da177e4 | 325 | |
e3893534 | 326 | if (nsems < 0 || nsems > ns->sc_semmsl) |
1da177e4 | 327 | return -EINVAL; |
7ca7e564 | 328 | |
7748dbfa ND |
329 | sem_ops.getnew = newary; |
330 | sem_ops.associate = sem_security; | |
331 | sem_ops.more_checks = sem_more_checks; | |
332 | ||
333 | sem_params.key = key; | |
334 | sem_params.flg = semflg; | |
335 | sem_params.u.nsems = nsems; | |
1da177e4 | 336 | |
7748dbfa | 337 | return ipcget(ns, &sem_ids(ns), &sem_ops, &sem_params); |
1da177e4 LT |
338 | } |
339 | ||
1da177e4 LT |
340 | /* |
341 | * Determine whether a sequence of semaphore operations would succeed | |
342 | * all at once. Return 0 if yes, 1 if need to sleep, else return error code. | |
343 | */ | |
344 | ||
345 | static int try_atomic_semop (struct sem_array * sma, struct sembuf * sops, | |
346 | int nsops, struct sem_undo *un, int pid) | |
347 | { | |
348 | int result, sem_op; | |
349 | struct sembuf *sop; | |
350 | struct sem * curr; | |
351 | ||
352 | for (sop = sops; sop < sops + nsops; sop++) { | |
353 | curr = sma->sem_base + sop->sem_num; | |
354 | sem_op = sop->sem_op; | |
355 | result = curr->semval; | |
356 | ||
357 | if (!sem_op && result) | |
358 | goto would_block; | |
359 | ||
360 | result += sem_op; | |
361 | if (result < 0) | |
362 | goto would_block; | |
363 | if (result > SEMVMX) | |
364 | goto out_of_range; | |
365 | if (sop->sem_flg & SEM_UNDO) { | |
366 | int undo = un->semadj[sop->sem_num] - sem_op; | |
367 | /* | |
368 | * Exceeding the undo range is an error. | |
369 | */ | |
370 | if (undo < (-SEMAEM - 1) || undo > SEMAEM) | |
371 | goto out_of_range; | |
372 | } | |
373 | curr->semval = result; | |
374 | } | |
375 | ||
376 | sop--; | |
377 | while (sop >= sops) { | |
378 | sma->sem_base[sop->sem_num].sempid = pid; | |
379 | if (sop->sem_flg & SEM_UNDO) | |
380 | un->semadj[sop->sem_num] -= sop->sem_op; | |
381 | sop--; | |
382 | } | |
383 | ||
1da177e4 LT |
384 | return 0; |
385 | ||
386 | out_of_range: | |
387 | result = -ERANGE; | |
388 | goto undo; | |
389 | ||
390 | would_block: | |
391 | if (sop->sem_flg & IPC_NOWAIT) | |
392 | result = -EAGAIN; | |
393 | else | |
394 | result = 1; | |
395 | ||
396 | undo: | |
397 | sop--; | |
398 | while (sop >= sops) { | |
399 | sma->sem_base[sop->sem_num].semval -= sop->sem_op; | |
400 | sop--; | |
401 | } | |
402 | ||
403 | return result; | |
404 | } | |
405 | ||
0a2b9d4c MS |
406 | /** wake_up_sem_queue_prepare(q, error): Prepare wake-up |
407 | * @q: queue entry that must be signaled | |
408 | * @error: Error value for the signal | |
409 | * | |
410 | * Prepare the wake-up of the queue entry q. | |
d4212093 | 411 | */ |
0a2b9d4c MS |
412 | static void wake_up_sem_queue_prepare(struct list_head *pt, |
413 | struct sem_queue *q, int error) | |
d4212093 | 414 | { |
0a2b9d4c MS |
415 | if (list_empty(pt)) { |
416 | /* | |
417 | * Hold preempt off so that we don't get preempted and have the | |
418 | * wakee busy-wait until we're scheduled back on. | |
419 | */ | |
420 | preempt_disable(); | |
421 | } | |
d4212093 | 422 | q->status = IN_WAKEUP; |
0a2b9d4c MS |
423 | q->pid = error; |
424 | ||
425 | list_add_tail(&q->simple_list, pt); | |
426 | } | |
427 | ||
428 | /** | |
429 | * wake_up_sem_queue_do(pt) - do the actual wake-up | |
430 | * @pt: list of tasks to be woken up | |
431 | * | |
432 | * Do the actual wake-up. | |
433 | * The function is called without any locks held, thus the semaphore array | |
434 | * could be destroyed already and the tasks can disappear as soon as the | |
435 | * status is set to the actual return code. | |
436 | */ | |
437 | static void wake_up_sem_queue_do(struct list_head *pt) | |
438 | { | |
439 | struct sem_queue *q, *t; | |
440 | int did_something; | |
441 | ||
442 | did_something = !list_empty(pt); | |
443 | list_for_each_entry_safe(q, t, pt, simple_list) { | |
444 | wake_up_process(q->sleeper); | |
445 | /* q can disappear immediately after writing q->status. */ | |
446 | smp_wmb(); | |
447 | q->status = q->pid; | |
448 | } | |
449 | if (did_something) | |
450 | preempt_enable(); | |
d4212093 NP |
451 | } |
452 | ||
b97e820f MS |
453 | static void unlink_queue(struct sem_array *sma, struct sem_queue *q) |
454 | { | |
455 | list_del(&q->list); | |
456 | if (q->nsops == 1) | |
457 | list_del(&q->simple_list); | |
458 | else | |
459 | sma->complex_count--; | |
460 | } | |
461 | ||
fd5db422 MS |
462 | /** check_restart(sma, q) |
463 | * @sma: semaphore array | |
464 | * @q: the operation that just completed | |
465 | * | |
466 | * update_queue is O(N^2) when it restarts scanning the whole queue of | |
467 | * waiting operations. Therefore this function checks if the restart is | |
468 | * really necessary. It is called after a previously waiting operation | |
469 | * was completed. | |
470 | */ | |
471 | static int check_restart(struct sem_array *sma, struct sem_queue *q) | |
472 | { | |
473 | struct sem *curr; | |
474 | struct sem_queue *h; | |
475 | ||
476 | /* if the operation didn't modify the array, then no restart */ | |
477 | if (q->alter == 0) | |
478 | return 0; | |
479 | ||
480 | /* pending complex operations are too difficult to analyse */ | |
481 | if (sma->complex_count) | |
482 | return 1; | |
483 | ||
484 | /* we were a sleeping complex operation. Too difficult */ | |
485 | if (q->nsops > 1) | |
486 | return 1; | |
487 | ||
488 | curr = sma->sem_base + q->sops[0].sem_num; | |
489 | ||
490 | /* No-one waits on this queue */ | |
491 | if (list_empty(&curr->sem_pending)) | |
492 | return 0; | |
493 | ||
494 | /* the new semaphore value */ | |
495 | if (curr->semval) { | |
496 | /* It is impossible that someone waits for the new value: | |
497 | * - q is a previously sleeping simple operation that | |
498 | * altered the array. It must be a decrement, because | |
499 | * simple increments never sleep. | |
500 | * - The value is not 0, thus wait-for-zero won't proceed. | |
501 | * - If there are older (higher priority) decrements | |
502 | * in the queue, then they have observed the original | |
503 | * semval value and couldn't proceed. The operation | |
504 | * decremented to value - thus they won't proceed either. | |
505 | */ | |
506 | BUG_ON(q->sops[0].sem_op >= 0); | |
507 | return 0; | |
508 | } | |
509 | /* | |
510 | * semval is 0. Check if there are wait-for-zero semops. | |
511 | * They must be the first entries in the per-semaphore simple queue | |
512 | */ | |
513 | h = list_first_entry(&curr->sem_pending, struct sem_queue, simple_list); | |
514 | BUG_ON(h->nsops != 1); | |
515 | BUG_ON(h->sops[0].sem_num != q->sops[0].sem_num); | |
516 | ||
517 | /* Yes, there is a wait-for-zero semop. Restart */ | |
518 | if (h->sops[0].sem_op == 0) | |
519 | return 1; | |
520 | ||
521 | /* Again - no-one is waiting for the new value. */ | |
522 | return 0; | |
523 | } | |
524 | ||
636c6be8 MS |
525 | |
526 | /** | |
527 | * update_queue(sma, semnum): Look for tasks that can be completed. | |
528 | * @sma: semaphore array. | |
529 | * @semnum: semaphore that was modified. | |
0a2b9d4c | 530 | * @pt: list head for the tasks that must be woken up. |
636c6be8 MS |
531 | * |
532 | * update_queue must be called after a semaphore in a semaphore array | |
533 | * was modified. If multiple semaphore were modified, then @semnum | |
534 | * must be set to -1. | |
0a2b9d4c MS |
535 | * The tasks that must be woken up are added to @pt. The return code |
536 | * is stored in q->pid. | |
537 | * The function return 1 if at least one semop was completed successfully. | |
1da177e4 | 538 | */ |
0a2b9d4c | 539 | static int update_queue(struct sem_array *sma, int semnum, struct list_head *pt) |
1da177e4 | 540 | { |
636c6be8 MS |
541 | struct sem_queue *q; |
542 | struct list_head *walk; | |
543 | struct list_head *pending_list; | |
544 | int offset; | |
0a2b9d4c | 545 | int semop_completed = 0; |
636c6be8 MS |
546 | |
547 | /* if there are complex operations around, then knowing the semaphore | |
548 | * that was modified doesn't help us. Assume that multiple semaphores | |
549 | * were modified. | |
550 | */ | |
551 | if (sma->complex_count) | |
552 | semnum = -1; | |
553 | ||
554 | if (semnum == -1) { | |
555 | pending_list = &sma->sem_pending; | |
556 | offset = offsetof(struct sem_queue, list); | |
557 | } else { | |
558 | pending_list = &sma->sem_base[semnum].sem_pending; | |
559 | offset = offsetof(struct sem_queue, simple_list); | |
560 | } | |
9cad200c NP |
561 | |
562 | again: | |
636c6be8 MS |
563 | walk = pending_list->next; |
564 | while (walk != pending_list) { | |
fd5db422 | 565 | int error, restart; |
636c6be8 MS |
566 | |
567 | q = (struct sem_queue *)((char *)walk - offset); | |
568 | walk = walk->next; | |
1da177e4 | 569 | |
d987f8b2 MS |
570 | /* If we are scanning the single sop, per-semaphore list of |
571 | * one semaphore and that semaphore is 0, then it is not | |
572 | * necessary to scan the "alter" entries: simple increments | |
573 | * that affect only one entry succeed immediately and cannot | |
574 | * be in the per semaphore pending queue, and decrements | |
575 | * cannot be successful if the value is already 0. | |
576 | */ | |
577 | if (semnum != -1 && sma->sem_base[semnum].semval == 0 && | |
578 | q->alter) | |
579 | break; | |
580 | ||
1da177e4 LT |
581 | error = try_atomic_semop(sma, q->sops, q->nsops, |
582 | q->undo, q->pid); | |
583 | ||
584 | /* Does q->sleeper still need to sleep? */ | |
9cad200c NP |
585 | if (error > 0) |
586 | continue; | |
587 | ||
b97e820f | 588 | unlink_queue(sma, q); |
9cad200c | 589 | |
0a2b9d4c | 590 | if (error) { |
fd5db422 | 591 | restart = 0; |
0a2b9d4c MS |
592 | } else { |
593 | semop_completed = 1; | |
fd5db422 | 594 | restart = check_restart(sma, q); |
0a2b9d4c | 595 | } |
fd5db422 | 596 | |
0a2b9d4c | 597 | wake_up_sem_queue_prepare(pt, q, error); |
fd5db422 | 598 | if (restart) |
9cad200c | 599 | goto again; |
1da177e4 | 600 | } |
0a2b9d4c | 601 | return semop_completed; |
1da177e4 LT |
602 | } |
603 | ||
0a2b9d4c MS |
604 | /** |
605 | * do_smart_update(sma, sops, nsops, otime, pt) - optimized update_queue | |
fd5db422 MS |
606 | * @sma: semaphore array |
607 | * @sops: operations that were performed | |
608 | * @nsops: number of operations | |
0a2b9d4c MS |
609 | * @otime: force setting otime |
610 | * @pt: list head of the tasks that must be woken up. | |
fd5db422 MS |
611 | * |
612 | * do_smart_update() does the required called to update_queue, based on the | |
613 | * actual changes that were performed on the semaphore array. | |
0a2b9d4c MS |
614 | * Note that the function does not do the actual wake-up: the caller is |
615 | * responsible for calling wake_up_sem_queue_do(@pt). | |
616 | * It is safe to perform this call after dropping all locks. | |
fd5db422 | 617 | */ |
0a2b9d4c MS |
618 | static void do_smart_update(struct sem_array *sma, struct sembuf *sops, int nsops, |
619 | int otime, struct list_head *pt) | |
fd5db422 MS |
620 | { |
621 | int i; | |
622 | ||
623 | if (sma->complex_count || sops == NULL) { | |
0a2b9d4c MS |
624 | if (update_queue(sma, -1, pt)) |
625 | otime = 1; | |
626 | goto done; | |
fd5db422 MS |
627 | } |
628 | ||
629 | for (i = 0; i < nsops; i++) { | |
630 | if (sops[i].sem_op > 0 || | |
631 | (sops[i].sem_op < 0 && | |
632 | sma->sem_base[sops[i].sem_num].semval == 0)) | |
0a2b9d4c MS |
633 | if (update_queue(sma, sops[i].sem_num, pt)) |
634 | otime = 1; | |
fd5db422 | 635 | } |
0a2b9d4c MS |
636 | done: |
637 | if (otime) | |
638 | sma->sem_otime = get_seconds(); | |
fd5db422 MS |
639 | } |
640 | ||
641 | ||
1da177e4 LT |
642 | /* The following counts are associated to each semaphore: |
643 | * semncnt number of tasks waiting on semval being nonzero | |
644 | * semzcnt number of tasks waiting on semval being zero | |
645 | * This model assumes that a task waits on exactly one semaphore. | |
646 | * Since semaphore operations are to be performed atomically, tasks actually | |
647 | * wait on a whole sequence of semaphores simultaneously. | |
648 | * The counts we return here are a rough approximation, but still | |
649 | * warrant that semncnt+semzcnt>0 if the task is on the pending queue. | |
650 | */ | |
651 | static int count_semncnt (struct sem_array * sma, ushort semnum) | |
652 | { | |
653 | int semncnt; | |
654 | struct sem_queue * q; | |
655 | ||
656 | semncnt = 0; | |
a1193f8e | 657 | list_for_each_entry(q, &sma->sem_pending, list) { |
1da177e4 LT |
658 | struct sembuf * sops = q->sops; |
659 | int nsops = q->nsops; | |
660 | int i; | |
661 | for (i = 0; i < nsops; i++) | |
662 | if (sops[i].sem_num == semnum | |
663 | && (sops[i].sem_op < 0) | |
664 | && !(sops[i].sem_flg & IPC_NOWAIT)) | |
665 | semncnt++; | |
666 | } | |
667 | return semncnt; | |
668 | } | |
a1193f8e | 669 | |
1da177e4 LT |
670 | static int count_semzcnt (struct sem_array * sma, ushort semnum) |
671 | { | |
672 | int semzcnt; | |
673 | struct sem_queue * q; | |
674 | ||
675 | semzcnt = 0; | |
a1193f8e | 676 | list_for_each_entry(q, &sma->sem_pending, list) { |
1da177e4 LT |
677 | struct sembuf * sops = q->sops; |
678 | int nsops = q->nsops; | |
679 | int i; | |
680 | for (i = 0; i < nsops; i++) | |
681 | if (sops[i].sem_num == semnum | |
682 | && (sops[i].sem_op == 0) | |
683 | && !(sops[i].sem_flg & IPC_NOWAIT)) | |
684 | semzcnt++; | |
685 | } | |
686 | return semzcnt; | |
687 | } | |
688 | ||
6d97e234 | 689 | static void free_un(struct rcu_head *head) |
380af1b3 MS |
690 | { |
691 | struct sem_undo *un = container_of(head, struct sem_undo, rcu); | |
692 | kfree(un); | |
693 | } | |
694 | ||
3e148c79 ND |
695 | /* Free a semaphore set. freeary() is called with sem_ids.rw_mutex locked |
696 | * as a writer and the spinlock for this semaphore set hold. sem_ids.rw_mutex | |
697 | * remains locked on exit. | |
1da177e4 | 698 | */ |
01b8b07a | 699 | static void freeary(struct ipc_namespace *ns, struct kern_ipc_perm *ipcp) |
1da177e4 | 700 | { |
380af1b3 MS |
701 | struct sem_undo *un, *tu; |
702 | struct sem_queue *q, *tq; | |
01b8b07a | 703 | struct sem_array *sma = container_of(ipcp, struct sem_array, sem_perm); |
0a2b9d4c | 704 | struct list_head tasks; |
1da177e4 | 705 | |
380af1b3 | 706 | /* Free the existing undo structures for this semaphore set. */ |
4daa28f6 | 707 | assert_spin_locked(&sma->sem_perm.lock); |
380af1b3 MS |
708 | list_for_each_entry_safe(un, tu, &sma->list_id, list_id) { |
709 | list_del(&un->list_id); | |
710 | spin_lock(&un->ulp->lock); | |
1da177e4 | 711 | un->semid = -1; |
380af1b3 MS |
712 | list_del_rcu(&un->list_proc); |
713 | spin_unlock(&un->ulp->lock); | |
714 | call_rcu(&un->rcu, free_un); | |
715 | } | |
1da177e4 LT |
716 | |
717 | /* Wake up all pending processes and let them fail with EIDRM. */ | |
0a2b9d4c | 718 | INIT_LIST_HEAD(&tasks); |
380af1b3 | 719 | list_for_each_entry_safe(q, tq, &sma->sem_pending, list) { |
b97e820f | 720 | unlink_queue(sma, q); |
0a2b9d4c | 721 | wake_up_sem_queue_prepare(&tasks, q, -EIDRM); |
1da177e4 LT |
722 | } |
723 | ||
7ca7e564 ND |
724 | /* Remove the semaphore set from the IDR */ |
725 | sem_rmid(ns, sma); | |
1da177e4 LT |
726 | sem_unlock(sma); |
727 | ||
0a2b9d4c | 728 | wake_up_sem_queue_do(&tasks); |
e3893534 | 729 | ns->used_sems -= sma->sem_nsems; |
1da177e4 LT |
730 | security_sem_free(sma); |
731 | ipc_rcu_putref(sma); | |
732 | } | |
733 | ||
734 | static unsigned long copy_semid_to_user(void __user *buf, struct semid64_ds *in, int version) | |
735 | { | |
736 | switch(version) { | |
737 | case IPC_64: | |
738 | return copy_to_user(buf, in, sizeof(*in)); | |
739 | case IPC_OLD: | |
740 | { | |
741 | struct semid_ds out; | |
742 | ||
743 | ipc64_perm_to_ipc_perm(&in->sem_perm, &out.sem_perm); | |
744 | ||
745 | out.sem_otime = in->sem_otime; | |
746 | out.sem_ctime = in->sem_ctime; | |
747 | out.sem_nsems = in->sem_nsems; | |
748 | ||
749 | return copy_to_user(buf, &out, sizeof(out)); | |
750 | } | |
751 | default: | |
752 | return -EINVAL; | |
753 | } | |
754 | } | |
755 | ||
4b9fcb0e PP |
756 | static int semctl_nolock(struct ipc_namespace *ns, int semid, |
757 | int cmd, int version, union semun arg) | |
1da177e4 | 758 | { |
e5cc9c7b | 759 | int err; |
1da177e4 LT |
760 | struct sem_array *sma; |
761 | ||
762 | switch(cmd) { | |
763 | case IPC_INFO: | |
764 | case SEM_INFO: | |
765 | { | |
766 | struct seminfo seminfo; | |
767 | int max_id; | |
768 | ||
769 | err = security_sem_semctl(NULL, cmd); | |
770 | if (err) | |
771 | return err; | |
772 | ||
773 | memset(&seminfo,0,sizeof(seminfo)); | |
e3893534 KK |
774 | seminfo.semmni = ns->sc_semmni; |
775 | seminfo.semmns = ns->sc_semmns; | |
776 | seminfo.semmsl = ns->sc_semmsl; | |
777 | seminfo.semopm = ns->sc_semopm; | |
1da177e4 LT |
778 | seminfo.semvmx = SEMVMX; |
779 | seminfo.semmnu = SEMMNU; | |
780 | seminfo.semmap = SEMMAP; | |
781 | seminfo.semume = SEMUME; | |
3e148c79 | 782 | down_read(&sem_ids(ns).rw_mutex); |
1da177e4 | 783 | if (cmd == SEM_INFO) { |
e3893534 KK |
784 | seminfo.semusz = sem_ids(ns).in_use; |
785 | seminfo.semaem = ns->used_sems; | |
1da177e4 LT |
786 | } else { |
787 | seminfo.semusz = SEMUSZ; | |
788 | seminfo.semaem = SEMAEM; | |
789 | } | |
7ca7e564 | 790 | max_id = ipc_get_maxid(&sem_ids(ns)); |
3e148c79 | 791 | up_read(&sem_ids(ns).rw_mutex); |
1da177e4 LT |
792 | if (copy_to_user (arg.__buf, &seminfo, sizeof(struct seminfo))) |
793 | return -EFAULT; | |
794 | return (max_id < 0) ? 0: max_id; | |
795 | } | |
4b9fcb0e | 796 | case IPC_STAT: |
1da177e4 LT |
797 | case SEM_STAT: |
798 | { | |
799 | struct semid64_ds tbuf; | |
800 | int id; | |
801 | ||
4b9fcb0e PP |
802 | if (cmd == SEM_STAT) { |
803 | sma = sem_lock(ns, semid); | |
804 | if (IS_ERR(sma)) | |
805 | return PTR_ERR(sma); | |
806 | id = sma->sem_perm.id; | |
807 | } else { | |
808 | sma = sem_lock_check(ns, semid); | |
809 | if (IS_ERR(sma)) | |
810 | return PTR_ERR(sma); | |
811 | id = 0; | |
812 | } | |
1da177e4 LT |
813 | |
814 | err = -EACCES; | |
815 | if (ipcperms (&sma->sem_perm, S_IRUGO)) | |
816 | goto out_unlock; | |
817 | ||
818 | err = security_sem_semctl(sma, cmd); | |
819 | if (err) | |
820 | goto out_unlock; | |
821 | ||
023a5355 ND |
822 | memset(&tbuf, 0, sizeof(tbuf)); |
823 | ||
1da177e4 LT |
824 | kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm); |
825 | tbuf.sem_otime = sma->sem_otime; | |
826 | tbuf.sem_ctime = sma->sem_ctime; | |
827 | tbuf.sem_nsems = sma->sem_nsems; | |
828 | sem_unlock(sma); | |
829 | if (copy_semid_to_user (arg.buf, &tbuf, version)) | |
830 | return -EFAULT; | |
831 | return id; | |
832 | } | |
833 | default: | |
834 | return -EINVAL; | |
835 | } | |
1da177e4 LT |
836 | out_unlock: |
837 | sem_unlock(sma); | |
838 | return err; | |
839 | } | |
840 | ||
e3893534 KK |
841 | static int semctl_main(struct ipc_namespace *ns, int semid, int semnum, |
842 | int cmd, int version, union semun arg) | |
1da177e4 LT |
843 | { |
844 | struct sem_array *sma; | |
845 | struct sem* curr; | |
846 | int err; | |
847 | ushort fast_sem_io[SEMMSL_FAST]; | |
848 | ushort* sem_io = fast_sem_io; | |
849 | int nsems; | |
0a2b9d4c | 850 | struct list_head tasks; |
1da177e4 | 851 | |
023a5355 ND |
852 | sma = sem_lock_check(ns, semid); |
853 | if (IS_ERR(sma)) | |
854 | return PTR_ERR(sma); | |
1da177e4 | 855 | |
0a2b9d4c | 856 | INIT_LIST_HEAD(&tasks); |
1da177e4 LT |
857 | nsems = sma->sem_nsems; |
858 | ||
1da177e4 LT |
859 | err = -EACCES; |
860 | if (ipcperms (&sma->sem_perm, (cmd==SETVAL||cmd==SETALL)?S_IWUGO:S_IRUGO)) | |
861 | goto out_unlock; | |
862 | ||
863 | err = security_sem_semctl(sma, cmd); | |
864 | if (err) | |
865 | goto out_unlock; | |
866 | ||
867 | err = -EACCES; | |
868 | switch (cmd) { | |
869 | case GETALL: | |
870 | { | |
871 | ushort __user *array = arg.array; | |
872 | int i; | |
873 | ||
874 | if(nsems > SEMMSL_FAST) { | |
6ff37972 | 875 | sem_getref_and_unlock(sma); |
1da177e4 LT |
876 | |
877 | sem_io = ipc_alloc(sizeof(ushort)*nsems); | |
878 | if(sem_io == NULL) { | |
6ff37972 | 879 | sem_putref(sma); |
1da177e4 LT |
880 | return -ENOMEM; |
881 | } | |
882 | ||
6ff37972 | 883 | sem_lock_and_putref(sma); |
1da177e4 LT |
884 | if (sma->sem_perm.deleted) { |
885 | sem_unlock(sma); | |
886 | err = -EIDRM; | |
887 | goto out_free; | |
888 | } | |
889 | } | |
890 | ||
891 | for (i = 0; i < sma->sem_nsems; i++) | |
892 | sem_io[i] = sma->sem_base[i].semval; | |
893 | sem_unlock(sma); | |
894 | err = 0; | |
895 | if(copy_to_user(array, sem_io, nsems*sizeof(ushort))) | |
896 | err = -EFAULT; | |
897 | goto out_free; | |
898 | } | |
899 | case SETALL: | |
900 | { | |
901 | int i; | |
902 | struct sem_undo *un; | |
903 | ||
6ff37972 | 904 | sem_getref_and_unlock(sma); |
1da177e4 LT |
905 | |
906 | if(nsems > SEMMSL_FAST) { | |
907 | sem_io = ipc_alloc(sizeof(ushort)*nsems); | |
908 | if(sem_io == NULL) { | |
6ff37972 | 909 | sem_putref(sma); |
1da177e4 LT |
910 | return -ENOMEM; |
911 | } | |
912 | } | |
913 | ||
914 | if (copy_from_user (sem_io, arg.array, nsems*sizeof(ushort))) { | |
6ff37972 | 915 | sem_putref(sma); |
1da177e4 LT |
916 | err = -EFAULT; |
917 | goto out_free; | |
918 | } | |
919 | ||
920 | for (i = 0; i < nsems; i++) { | |
921 | if (sem_io[i] > SEMVMX) { | |
6ff37972 | 922 | sem_putref(sma); |
1da177e4 LT |
923 | err = -ERANGE; |
924 | goto out_free; | |
925 | } | |
926 | } | |
6ff37972 | 927 | sem_lock_and_putref(sma); |
1da177e4 LT |
928 | if (sma->sem_perm.deleted) { |
929 | sem_unlock(sma); | |
930 | err = -EIDRM; | |
931 | goto out_free; | |
932 | } | |
933 | ||
934 | for (i = 0; i < nsems; i++) | |
935 | sma->sem_base[i].semval = sem_io[i]; | |
4daa28f6 MS |
936 | |
937 | assert_spin_locked(&sma->sem_perm.lock); | |
938 | list_for_each_entry(un, &sma->list_id, list_id) { | |
1da177e4 LT |
939 | for (i = 0; i < nsems; i++) |
940 | un->semadj[i] = 0; | |
4daa28f6 | 941 | } |
1da177e4 LT |
942 | sma->sem_ctime = get_seconds(); |
943 | /* maybe some queued-up processes were waiting for this */ | |
0a2b9d4c | 944 | do_smart_update(sma, NULL, 0, 0, &tasks); |
1da177e4 LT |
945 | err = 0; |
946 | goto out_unlock; | |
947 | } | |
1da177e4 LT |
948 | /* GETVAL, GETPID, GETNCTN, GETZCNT, SETVAL: fall-through */ |
949 | } | |
950 | err = -EINVAL; | |
951 | if(semnum < 0 || semnum >= nsems) | |
952 | goto out_unlock; | |
953 | ||
954 | curr = &sma->sem_base[semnum]; | |
955 | ||
956 | switch (cmd) { | |
957 | case GETVAL: | |
958 | err = curr->semval; | |
959 | goto out_unlock; | |
960 | case GETPID: | |
961 | err = curr->sempid; | |
962 | goto out_unlock; | |
963 | case GETNCNT: | |
964 | err = count_semncnt(sma,semnum); | |
965 | goto out_unlock; | |
966 | case GETZCNT: | |
967 | err = count_semzcnt(sma,semnum); | |
968 | goto out_unlock; | |
969 | case SETVAL: | |
970 | { | |
971 | int val = arg.val; | |
972 | struct sem_undo *un; | |
4daa28f6 | 973 | |
1da177e4 LT |
974 | err = -ERANGE; |
975 | if (val > SEMVMX || val < 0) | |
976 | goto out_unlock; | |
977 | ||
4daa28f6 MS |
978 | assert_spin_locked(&sma->sem_perm.lock); |
979 | list_for_each_entry(un, &sma->list_id, list_id) | |
1da177e4 | 980 | un->semadj[semnum] = 0; |
4daa28f6 | 981 | |
1da177e4 | 982 | curr->semval = val; |
b488893a | 983 | curr->sempid = task_tgid_vnr(current); |
1da177e4 LT |
984 | sma->sem_ctime = get_seconds(); |
985 | /* maybe some queued-up processes were waiting for this */ | |
0a2b9d4c | 986 | do_smart_update(sma, NULL, 0, 0, &tasks); |
1da177e4 LT |
987 | err = 0; |
988 | goto out_unlock; | |
989 | } | |
990 | } | |
991 | out_unlock: | |
992 | sem_unlock(sma); | |
0a2b9d4c MS |
993 | wake_up_sem_queue_do(&tasks); |
994 | ||
1da177e4 LT |
995 | out_free: |
996 | if(sem_io != fast_sem_io) | |
997 | ipc_free(sem_io, sizeof(ushort)*nsems); | |
998 | return err; | |
999 | } | |
1000 | ||
016d7132 PP |
1001 | static inline unsigned long |
1002 | copy_semid_from_user(struct semid64_ds *out, void __user *buf, int version) | |
1da177e4 LT |
1003 | { |
1004 | switch(version) { | |
1005 | case IPC_64: | |
016d7132 | 1006 | if (copy_from_user(out, buf, sizeof(*out))) |
1da177e4 | 1007 | return -EFAULT; |
1da177e4 | 1008 | return 0; |
1da177e4 LT |
1009 | case IPC_OLD: |
1010 | { | |
1011 | struct semid_ds tbuf_old; | |
1012 | ||
1013 | if(copy_from_user(&tbuf_old, buf, sizeof(tbuf_old))) | |
1014 | return -EFAULT; | |
1015 | ||
016d7132 PP |
1016 | out->sem_perm.uid = tbuf_old.sem_perm.uid; |
1017 | out->sem_perm.gid = tbuf_old.sem_perm.gid; | |
1018 | out->sem_perm.mode = tbuf_old.sem_perm.mode; | |
1da177e4 LT |
1019 | |
1020 | return 0; | |
1021 | } | |
1022 | default: | |
1023 | return -EINVAL; | |
1024 | } | |
1025 | } | |
1026 | ||
522bb2a2 PP |
1027 | /* |
1028 | * This function handles some semctl commands which require the rw_mutex | |
1029 | * to be held in write mode. | |
1030 | * NOTE: no locks must be held, the rw_mutex is taken inside this function. | |
1031 | */ | |
21a4826a PP |
1032 | static int semctl_down(struct ipc_namespace *ns, int semid, |
1033 | int cmd, int version, union semun arg) | |
1da177e4 LT |
1034 | { |
1035 | struct sem_array *sma; | |
1036 | int err; | |
016d7132 | 1037 | struct semid64_ds semid64; |
1da177e4 LT |
1038 | struct kern_ipc_perm *ipcp; |
1039 | ||
1040 | if(cmd == IPC_SET) { | |
016d7132 | 1041 | if (copy_semid_from_user(&semid64, arg.buf, version)) |
1da177e4 | 1042 | return -EFAULT; |
1da177e4 | 1043 | } |
073115d6 | 1044 | |
a5f75e7f PP |
1045 | ipcp = ipcctl_pre_down(&sem_ids(ns), semid, cmd, &semid64.sem_perm, 0); |
1046 | if (IS_ERR(ipcp)) | |
1047 | return PTR_ERR(ipcp); | |
073115d6 | 1048 | |
a5f75e7f | 1049 | sma = container_of(ipcp, struct sem_array, sem_perm); |
1da177e4 LT |
1050 | |
1051 | err = security_sem_semctl(sma, cmd); | |
1052 | if (err) | |
1053 | goto out_unlock; | |
1054 | ||
1055 | switch(cmd){ | |
1056 | case IPC_RMID: | |
01b8b07a | 1057 | freeary(ns, ipcp); |
522bb2a2 | 1058 | goto out_up; |
1da177e4 | 1059 | case IPC_SET: |
8f4a3809 | 1060 | ipc_update_perm(&semid64.sem_perm, ipcp); |
1da177e4 | 1061 | sma->sem_ctime = get_seconds(); |
1da177e4 LT |
1062 | break; |
1063 | default: | |
1da177e4 | 1064 | err = -EINVAL; |
1da177e4 | 1065 | } |
1da177e4 LT |
1066 | |
1067 | out_unlock: | |
1068 | sem_unlock(sma); | |
522bb2a2 PP |
1069 | out_up: |
1070 | up_write(&sem_ids(ns).rw_mutex); | |
1da177e4 LT |
1071 | return err; |
1072 | } | |
1073 | ||
6673e0c3 | 1074 | SYSCALL_DEFINE(semctl)(int semid, int semnum, int cmd, union semun arg) |
1da177e4 LT |
1075 | { |
1076 | int err = -EINVAL; | |
1077 | int version; | |
e3893534 | 1078 | struct ipc_namespace *ns; |
1da177e4 LT |
1079 | |
1080 | if (semid < 0) | |
1081 | return -EINVAL; | |
1082 | ||
1083 | version = ipc_parse_version(&cmd); | |
e3893534 | 1084 | ns = current->nsproxy->ipc_ns; |
1da177e4 LT |
1085 | |
1086 | switch(cmd) { | |
1087 | case IPC_INFO: | |
1088 | case SEM_INFO: | |
4b9fcb0e | 1089 | case IPC_STAT: |
1da177e4 | 1090 | case SEM_STAT: |
4b9fcb0e | 1091 | err = semctl_nolock(ns, semid, cmd, version, arg); |
1da177e4 LT |
1092 | return err; |
1093 | case GETALL: | |
1094 | case GETVAL: | |
1095 | case GETPID: | |
1096 | case GETNCNT: | |
1097 | case GETZCNT: | |
1da177e4 LT |
1098 | case SETVAL: |
1099 | case SETALL: | |
e3893534 | 1100 | err = semctl_main(ns,semid,semnum,cmd,version,arg); |
1da177e4 LT |
1101 | return err; |
1102 | case IPC_RMID: | |
1103 | case IPC_SET: | |
21a4826a | 1104 | err = semctl_down(ns, semid, cmd, version, arg); |
1da177e4 LT |
1105 | return err; |
1106 | default: | |
1107 | return -EINVAL; | |
1108 | } | |
1109 | } | |
6673e0c3 HC |
1110 | #ifdef CONFIG_HAVE_SYSCALL_WRAPPERS |
1111 | asmlinkage long SyS_semctl(int semid, int semnum, int cmd, union semun arg) | |
1112 | { | |
1113 | return SYSC_semctl((int) semid, (int) semnum, (int) cmd, arg); | |
1114 | } | |
1115 | SYSCALL_ALIAS(sys_semctl, SyS_semctl); | |
1116 | #endif | |
1da177e4 | 1117 | |
1da177e4 LT |
1118 | /* If the task doesn't already have a undo_list, then allocate one |
1119 | * here. We guarantee there is only one thread using this undo list, | |
1120 | * and current is THE ONE | |
1121 | * | |
1122 | * If this allocation and assignment succeeds, but later | |
1123 | * portions of this code fail, there is no need to free the sem_undo_list. | |
1124 | * Just let it stay associated with the task, and it'll be freed later | |
1125 | * at exit time. | |
1126 | * | |
1127 | * This can block, so callers must hold no locks. | |
1128 | */ | |
1129 | static inline int get_undo_list(struct sem_undo_list **undo_listp) | |
1130 | { | |
1131 | struct sem_undo_list *undo_list; | |
1da177e4 LT |
1132 | |
1133 | undo_list = current->sysvsem.undo_list; | |
1134 | if (!undo_list) { | |
2453a306 | 1135 | undo_list = kzalloc(sizeof(*undo_list), GFP_KERNEL); |
1da177e4 LT |
1136 | if (undo_list == NULL) |
1137 | return -ENOMEM; | |
00a5dfdb | 1138 | spin_lock_init(&undo_list->lock); |
1da177e4 | 1139 | atomic_set(&undo_list->refcnt, 1); |
4daa28f6 MS |
1140 | INIT_LIST_HEAD(&undo_list->list_proc); |
1141 | ||
1da177e4 LT |
1142 | current->sysvsem.undo_list = undo_list; |
1143 | } | |
1144 | *undo_listp = undo_list; | |
1145 | return 0; | |
1146 | } | |
1147 | ||
bf17bb71 | 1148 | static struct sem_undo *__lookup_undo(struct sem_undo_list *ulp, int semid) |
1da177e4 | 1149 | { |
bf17bb71 | 1150 | struct sem_undo *un; |
4daa28f6 | 1151 | |
bf17bb71 NP |
1152 | list_for_each_entry_rcu(un, &ulp->list_proc, list_proc) { |
1153 | if (un->semid == semid) | |
1154 | return un; | |
1da177e4 | 1155 | } |
4daa28f6 | 1156 | return NULL; |
1da177e4 LT |
1157 | } |
1158 | ||
bf17bb71 NP |
1159 | static struct sem_undo *lookup_undo(struct sem_undo_list *ulp, int semid) |
1160 | { | |
1161 | struct sem_undo *un; | |
1162 | ||
1163 | assert_spin_locked(&ulp->lock); | |
1164 | ||
1165 | un = __lookup_undo(ulp, semid); | |
1166 | if (un) { | |
1167 | list_del_rcu(&un->list_proc); | |
1168 | list_add_rcu(&un->list_proc, &ulp->list_proc); | |
1169 | } | |
1170 | return un; | |
1171 | } | |
1172 | ||
4daa28f6 MS |
1173 | /** |
1174 | * find_alloc_undo - Lookup (and if not present create) undo array | |
1175 | * @ns: namespace | |
1176 | * @semid: semaphore array id | |
1177 | * | |
1178 | * The function looks up (and if not present creates) the undo structure. | |
1179 | * The size of the undo structure depends on the size of the semaphore | |
1180 | * array, thus the alloc path is not that straightforward. | |
380af1b3 MS |
1181 | * Lifetime-rules: sem_undo is rcu-protected, on success, the function |
1182 | * performs a rcu_read_lock(). | |
4daa28f6 MS |
1183 | */ |
1184 | static struct sem_undo *find_alloc_undo(struct ipc_namespace *ns, int semid) | |
1da177e4 LT |
1185 | { |
1186 | struct sem_array *sma; | |
1187 | struct sem_undo_list *ulp; | |
1188 | struct sem_undo *un, *new; | |
1189 | int nsems; | |
1190 | int error; | |
1191 | ||
1192 | error = get_undo_list(&ulp); | |
1193 | if (error) | |
1194 | return ERR_PTR(error); | |
1195 | ||
380af1b3 | 1196 | rcu_read_lock(); |
c530c6ac | 1197 | spin_lock(&ulp->lock); |
1da177e4 | 1198 | un = lookup_undo(ulp, semid); |
c530c6ac | 1199 | spin_unlock(&ulp->lock); |
1da177e4 LT |
1200 | if (likely(un!=NULL)) |
1201 | goto out; | |
380af1b3 | 1202 | rcu_read_unlock(); |
1da177e4 LT |
1203 | |
1204 | /* no undo structure around - allocate one. */ | |
4daa28f6 | 1205 | /* step 1: figure out the size of the semaphore array */ |
023a5355 ND |
1206 | sma = sem_lock_check(ns, semid); |
1207 | if (IS_ERR(sma)) | |
1208 | return ERR_PTR(PTR_ERR(sma)); | |
1209 | ||
1da177e4 | 1210 | nsems = sma->sem_nsems; |
6ff37972 | 1211 | sem_getref_and_unlock(sma); |
1da177e4 | 1212 | |
4daa28f6 | 1213 | /* step 2: allocate new undo structure */ |
4668edc3 | 1214 | new = kzalloc(sizeof(struct sem_undo) + sizeof(short)*nsems, GFP_KERNEL); |
1da177e4 | 1215 | if (!new) { |
6ff37972 | 1216 | sem_putref(sma); |
1da177e4 LT |
1217 | return ERR_PTR(-ENOMEM); |
1218 | } | |
1da177e4 | 1219 | |
380af1b3 | 1220 | /* step 3: Acquire the lock on semaphore array */ |
6ff37972 | 1221 | sem_lock_and_putref(sma); |
1da177e4 LT |
1222 | if (sma->sem_perm.deleted) { |
1223 | sem_unlock(sma); | |
1da177e4 LT |
1224 | kfree(new); |
1225 | un = ERR_PTR(-EIDRM); | |
1226 | goto out; | |
1227 | } | |
380af1b3 MS |
1228 | spin_lock(&ulp->lock); |
1229 | ||
1230 | /* | |
1231 | * step 4: check for races: did someone else allocate the undo struct? | |
1232 | */ | |
1233 | un = lookup_undo(ulp, semid); | |
1234 | if (un) { | |
1235 | kfree(new); | |
1236 | goto success; | |
1237 | } | |
4daa28f6 MS |
1238 | /* step 5: initialize & link new undo structure */ |
1239 | new->semadj = (short *) &new[1]; | |
380af1b3 | 1240 | new->ulp = ulp; |
4daa28f6 MS |
1241 | new->semid = semid; |
1242 | assert_spin_locked(&ulp->lock); | |
380af1b3 | 1243 | list_add_rcu(&new->list_proc, &ulp->list_proc); |
4daa28f6 MS |
1244 | assert_spin_locked(&sma->sem_perm.lock); |
1245 | list_add(&new->list_id, &sma->list_id); | |
380af1b3 | 1246 | un = new; |
4daa28f6 | 1247 | |
380af1b3 | 1248 | success: |
c530c6ac | 1249 | spin_unlock(&ulp->lock); |
380af1b3 MS |
1250 | rcu_read_lock(); |
1251 | sem_unlock(sma); | |
1da177e4 LT |
1252 | out: |
1253 | return un; | |
1254 | } | |
1255 | ||
d5460c99 HC |
1256 | SYSCALL_DEFINE4(semtimedop, int, semid, struct sembuf __user *, tsops, |
1257 | unsigned, nsops, const struct timespec __user *, timeout) | |
1da177e4 LT |
1258 | { |
1259 | int error = -EINVAL; | |
1260 | struct sem_array *sma; | |
1261 | struct sembuf fast_sops[SEMOPM_FAST]; | |
1262 | struct sembuf* sops = fast_sops, *sop; | |
1263 | struct sem_undo *un; | |
b78755ab | 1264 | int undos = 0, alter = 0, max; |
1da177e4 LT |
1265 | struct sem_queue queue; |
1266 | unsigned long jiffies_left = 0; | |
e3893534 | 1267 | struct ipc_namespace *ns; |
0a2b9d4c | 1268 | struct list_head tasks; |
e3893534 KK |
1269 | |
1270 | ns = current->nsproxy->ipc_ns; | |
1da177e4 LT |
1271 | |
1272 | if (nsops < 1 || semid < 0) | |
1273 | return -EINVAL; | |
e3893534 | 1274 | if (nsops > ns->sc_semopm) |
1da177e4 LT |
1275 | return -E2BIG; |
1276 | if(nsops > SEMOPM_FAST) { | |
1277 | sops = kmalloc(sizeof(*sops)*nsops,GFP_KERNEL); | |
1278 | if(sops==NULL) | |
1279 | return -ENOMEM; | |
1280 | } | |
1281 | if (copy_from_user (sops, tsops, nsops * sizeof(*tsops))) { | |
1282 | error=-EFAULT; | |
1283 | goto out_free; | |
1284 | } | |
1285 | if (timeout) { | |
1286 | struct timespec _timeout; | |
1287 | if (copy_from_user(&_timeout, timeout, sizeof(*timeout))) { | |
1288 | error = -EFAULT; | |
1289 | goto out_free; | |
1290 | } | |
1291 | if (_timeout.tv_sec < 0 || _timeout.tv_nsec < 0 || | |
1292 | _timeout.tv_nsec >= 1000000000L) { | |
1293 | error = -EINVAL; | |
1294 | goto out_free; | |
1295 | } | |
1296 | jiffies_left = timespec_to_jiffies(&_timeout); | |
1297 | } | |
1298 | max = 0; | |
1299 | for (sop = sops; sop < sops + nsops; sop++) { | |
1300 | if (sop->sem_num >= max) | |
1301 | max = sop->sem_num; | |
1302 | if (sop->sem_flg & SEM_UNDO) | |
b78755ab MS |
1303 | undos = 1; |
1304 | if (sop->sem_op != 0) | |
1da177e4 LT |
1305 | alter = 1; |
1306 | } | |
1da177e4 | 1307 | |
1da177e4 | 1308 | if (undos) { |
4daa28f6 | 1309 | un = find_alloc_undo(ns, semid); |
1da177e4 LT |
1310 | if (IS_ERR(un)) { |
1311 | error = PTR_ERR(un); | |
1312 | goto out_free; | |
1313 | } | |
1314 | } else | |
1315 | un = NULL; | |
1316 | ||
0a2b9d4c MS |
1317 | INIT_LIST_HEAD(&tasks); |
1318 | ||
023a5355 ND |
1319 | sma = sem_lock_check(ns, semid); |
1320 | if (IS_ERR(sma)) { | |
380af1b3 MS |
1321 | if (un) |
1322 | rcu_read_unlock(); | |
023a5355 | 1323 | error = PTR_ERR(sma); |
1da177e4 | 1324 | goto out_free; |
023a5355 ND |
1325 | } |
1326 | ||
1da177e4 | 1327 | /* |
4daa28f6 | 1328 | * semid identifiers are not unique - find_alloc_undo may have |
1da177e4 | 1329 | * allocated an undo structure, it was invalidated by an RMID |
4daa28f6 | 1330 | * and now a new array with received the same id. Check and fail. |
380af1b3 MS |
1331 | * This case can be detected checking un->semid. The existance of |
1332 | * "un" itself is guaranteed by rcu. | |
1da177e4 | 1333 | */ |
4daa28f6 | 1334 | error = -EIDRM; |
380af1b3 MS |
1335 | if (un) { |
1336 | if (un->semid == -1) { | |
1337 | rcu_read_unlock(); | |
1338 | goto out_unlock_free; | |
1339 | } else { | |
1340 | /* | |
1341 | * rcu lock can be released, "un" cannot disappear: | |
1342 | * - sem_lock is acquired, thus IPC_RMID is | |
1343 | * impossible. | |
1344 | * - exit_sem is impossible, it always operates on | |
1345 | * current (or a dead task). | |
1346 | */ | |
1347 | ||
1348 | rcu_read_unlock(); | |
1349 | } | |
1350 | } | |
4daa28f6 | 1351 | |
1da177e4 LT |
1352 | error = -EFBIG; |
1353 | if (max >= sma->sem_nsems) | |
1354 | goto out_unlock_free; | |
1355 | ||
1356 | error = -EACCES; | |
1357 | if (ipcperms(&sma->sem_perm, alter ? S_IWUGO : S_IRUGO)) | |
1358 | goto out_unlock_free; | |
1359 | ||
1360 | error = security_sem_semop(sma, sops, nsops, alter); | |
1361 | if (error) | |
1362 | goto out_unlock_free; | |
1363 | ||
b488893a | 1364 | error = try_atomic_semop (sma, sops, nsops, un, task_tgid_vnr(current)); |
1da177e4 LT |
1365 | if (error <= 0) { |
1366 | if (alter && error == 0) | |
0a2b9d4c | 1367 | do_smart_update(sma, sops, nsops, 1, &tasks); |
636c6be8 | 1368 | |
1da177e4 LT |
1369 | goto out_unlock_free; |
1370 | } | |
1371 | ||
1372 | /* We need to sleep on this operation, so we put the current | |
1373 | * task into the pending queue and go to sleep. | |
1374 | */ | |
1375 | ||
1da177e4 LT |
1376 | queue.sops = sops; |
1377 | queue.nsops = nsops; | |
1378 | queue.undo = un; | |
b488893a | 1379 | queue.pid = task_tgid_vnr(current); |
1da177e4 LT |
1380 | queue.alter = alter; |
1381 | if (alter) | |
a1193f8e | 1382 | list_add_tail(&queue.list, &sma->sem_pending); |
1da177e4 | 1383 | else |
a1193f8e | 1384 | list_add(&queue.list, &sma->sem_pending); |
1da177e4 | 1385 | |
b97e820f MS |
1386 | if (nsops == 1) { |
1387 | struct sem *curr; | |
1388 | curr = &sma->sem_base[sops->sem_num]; | |
1389 | ||
1390 | if (alter) | |
1391 | list_add_tail(&queue.simple_list, &curr->sem_pending); | |
1392 | else | |
1393 | list_add(&queue.simple_list, &curr->sem_pending); | |
1394 | } else { | |
1395 | INIT_LIST_HEAD(&queue.simple_list); | |
1396 | sma->complex_count++; | |
1397 | } | |
1398 | ||
1da177e4 LT |
1399 | queue.status = -EINTR; |
1400 | queue.sleeper = current; | |
1401 | current->state = TASK_INTERRUPTIBLE; | |
1402 | sem_unlock(sma); | |
1403 | ||
1404 | if (timeout) | |
1405 | jiffies_left = schedule_timeout(jiffies_left); | |
1406 | else | |
1407 | schedule(); | |
1408 | ||
1409 | error = queue.status; | |
1410 | while(unlikely(error == IN_WAKEUP)) { | |
1411 | cpu_relax(); | |
1412 | error = queue.status; | |
1413 | } | |
1414 | ||
1415 | if (error != -EINTR) { | |
1416 | /* fast path: update_queue already obtained all requested | |
1417 | * resources */ | |
1418 | goto out_free; | |
1419 | } | |
1420 | ||
e3893534 | 1421 | sma = sem_lock(ns, semid); |
023a5355 | 1422 | if (IS_ERR(sma)) { |
1da177e4 LT |
1423 | error = -EIDRM; |
1424 | goto out_free; | |
1425 | } | |
1426 | ||
1427 | /* | |
1428 | * If queue.status != -EINTR we are woken up by another process | |
1429 | */ | |
1430 | error = queue.status; | |
1431 | if (error != -EINTR) { | |
1432 | goto out_unlock_free; | |
1433 | } | |
1434 | ||
1435 | /* | |
1436 | * If an interrupt occurred we have to clean up the queue | |
1437 | */ | |
1438 | if (timeout && jiffies_left == 0) | |
1439 | error = -EAGAIN; | |
b97e820f | 1440 | unlink_queue(sma, &queue); |
1da177e4 LT |
1441 | |
1442 | out_unlock_free: | |
1443 | sem_unlock(sma); | |
0a2b9d4c MS |
1444 | |
1445 | wake_up_sem_queue_do(&tasks); | |
1da177e4 LT |
1446 | out_free: |
1447 | if(sops != fast_sops) | |
1448 | kfree(sops); | |
1449 | return error; | |
1450 | } | |
1451 | ||
d5460c99 HC |
1452 | SYSCALL_DEFINE3(semop, int, semid, struct sembuf __user *, tsops, |
1453 | unsigned, nsops) | |
1da177e4 LT |
1454 | { |
1455 | return sys_semtimedop(semid, tsops, nsops, NULL); | |
1456 | } | |
1457 | ||
1458 | /* If CLONE_SYSVSEM is set, establish sharing of SEM_UNDO state between | |
1459 | * parent and child tasks. | |
1da177e4 LT |
1460 | */ |
1461 | ||
1462 | int copy_semundo(unsigned long clone_flags, struct task_struct *tsk) | |
1463 | { | |
1464 | struct sem_undo_list *undo_list; | |
1465 | int error; | |
1466 | ||
1467 | if (clone_flags & CLONE_SYSVSEM) { | |
1468 | error = get_undo_list(&undo_list); | |
1469 | if (error) | |
1470 | return error; | |
1da177e4 LT |
1471 | atomic_inc(&undo_list->refcnt); |
1472 | tsk->sysvsem.undo_list = undo_list; | |
1473 | } else | |
1474 | tsk->sysvsem.undo_list = NULL; | |
1475 | ||
1476 | return 0; | |
1477 | } | |
1478 | ||
1479 | /* | |
1480 | * add semadj values to semaphores, free undo structures. | |
1481 | * undo structures are not freed when semaphore arrays are destroyed | |
1482 | * so some of them may be out of date. | |
1483 | * IMPLEMENTATION NOTE: There is some confusion over whether the | |
1484 | * set of adjustments that needs to be done should be done in an atomic | |
1485 | * manner or not. That is, if we are attempting to decrement the semval | |
1486 | * should we queue up and wait until we can do so legally? | |
1487 | * The original implementation attempted to do this (queue and wait). | |
1488 | * The current implementation does not do so. The POSIX standard | |
1489 | * and SVID should be consulted to determine what behavior is mandated. | |
1490 | */ | |
1491 | void exit_sem(struct task_struct *tsk) | |
1492 | { | |
4daa28f6 | 1493 | struct sem_undo_list *ulp; |
1da177e4 | 1494 | |
4daa28f6 MS |
1495 | ulp = tsk->sysvsem.undo_list; |
1496 | if (!ulp) | |
1da177e4 | 1497 | return; |
9edff4ab | 1498 | tsk->sysvsem.undo_list = NULL; |
1da177e4 | 1499 | |
4daa28f6 | 1500 | if (!atomic_dec_and_test(&ulp->refcnt)) |
1da177e4 LT |
1501 | return; |
1502 | ||
380af1b3 | 1503 | for (;;) { |
1da177e4 | 1504 | struct sem_array *sma; |
380af1b3 | 1505 | struct sem_undo *un; |
0a2b9d4c | 1506 | struct list_head tasks; |
380af1b3 | 1507 | int semid; |
4daa28f6 MS |
1508 | int i; |
1509 | ||
380af1b3 | 1510 | rcu_read_lock(); |
05725f7e JP |
1511 | un = list_entry_rcu(ulp->list_proc.next, |
1512 | struct sem_undo, list_proc); | |
380af1b3 MS |
1513 | if (&un->list_proc == &ulp->list_proc) |
1514 | semid = -1; | |
1515 | else | |
1516 | semid = un->semid; | |
1517 | rcu_read_unlock(); | |
4daa28f6 | 1518 | |
380af1b3 MS |
1519 | if (semid == -1) |
1520 | break; | |
1da177e4 | 1521 | |
380af1b3 | 1522 | sma = sem_lock_check(tsk->nsproxy->ipc_ns, un->semid); |
1da177e4 | 1523 | |
380af1b3 MS |
1524 | /* exit_sem raced with IPC_RMID, nothing to do */ |
1525 | if (IS_ERR(sma)) | |
1526 | continue; | |
1da177e4 | 1527 | |
bf17bb71 | 1528 | un = __lookup_undo(ulp, semid); |
380af1b3 MS |
1529 | if (un == NULL) { |
1530 | /* exit_sem raced with IPC_RMID+semget() that created | |
1531 | * exactly the same semid. Nothing to do. | |
1532 | */ | |
1533 | sem_unlock(sma); | |
1534 | continue; | |
1535 | } | |
1536 | ||
1537 | /* remove un from the linked lists */ | |
4daa28f6 MS |
1538 | assert_spin_locked(&sma->sem_perm.lock); |
1539 | list_del(&un->list_id); | |
1540 | ||
380af1b3 MS |
1541 | spin_lock(&ulp->lock); |
1542 | list_del_rcu(&un->list_proc); | |
1543 | spin_unlock(&ulp->lock); | |
1544 | ||
4daa28f6 MS |
1545 | /* perform adjustments registered in un */ |
1546 | for (i = 0; i < sma->sem_nsems; i++) { | |
5f921ae9 | 1547 | struct sem * semaphore = &sma->sem_base[i]; |
4daa28f6 MS |
1548 | if (un->semadj[i]) { |
1549 | semaphore->semval += un->semadj[i]; | |
1da177e4 LT |
1550 | /* |
1551 | * Range checks of the new semaphore value, | |
1552 | * not defined by sus: | |
1553 | * - Some unices ignore the undo entirely | |
1554 | * (e.g. HP UX 11i 11.22, Tru64 V5.1) | |
1555 | * - some cap the value (e.g. FreeBSD caps | |
1556 | * at 0, but doesn't enforce SEMVMX) | |
1557 | * | |
1558 | * Linux caps the semaphore value, both at 0 | |
1559 | * and at SEMVMX. | |
1560 | * | |
1561 | * Manfred <manfred@colorfullife.com> | |
1562 | */ | |
5f921ae9 IM |
1563 | if (semaphore->semval < 0) |
1564 | semaphore->semval = 0; | |
1565 | if (semaphore->semval > SEMVMX) | |
1566 | semaphore->semval = SEMVMX; | |
b488893a | 1567 | semaphore->sempid = task_tgid_vnr(current); |
1da177e4 LT |
1568 | } |
1569 | } | |
1da177e4 | 1570 | /* maybe some queued-up processes were waiting for this */ |
0a2b9d4c MS |
1571 | INIT_LIST_HEAD(&tasks); |
1572 | do_smart_update(sma, NULL, 0, 1, &tasks); | |
1da177e4 | 1573 | sem_unlock(sma); |
0a2b9d4c | 1574 | wake_up_sem_queue_do(&tasks); |
380af1b3 MS |
1575 | |
1576 | call_rcu(&un->rcu, free_un); | |
1da177e4 | 1577 | } |
4daa28f6 | 1578 | kfree(ulp); |
1da177e4 LT |
1579 | } |
1580 | ||
1581 | #ifdef CONFIG_PROC_FS | |
19b4946c | 1582 | static int sysvipc_sem_proc_show(struct seq_file *s, void *it) |
1da177e4 | 1583 | { |
19b4946c MW |
1584 | struct sem_array *sma = it; |
1585 | ||
1586 | return seq_printf(s, | |
b97e820f | 1587 | "%10d %10d %4o %10u %5u %5u %5u %5u %10lu %10lu\n", |
19b4946c | 1588 | sma->sem_perm.key, |
7ca7e564 | 1589 | sma->sem_perm.id, |
19b4946c MW |
1590 | sma->sem_perm.mode, |
1591 | sma->sem_nsems, | |
1592 | sma->sem_perm.uid, | |
1593 | sma->sem_perm.gid, | |
1594 | sma->sem_perm.cuid, | |
1595 | sma->sem_perm.cgid, | |
1596 | sma->sem_otime, | |
1597 | sma->sem_ctime); | |
1da177e4 LT |
1598 | } |
1599 | #endif |