3 * Copyright (C) 1992 Krishna Balasubramanian
4 * Copyright (C) 1995 Eric Schenk, Bruno Haible
6 * /proc/sysvipc/sem support (c) 1999 Dragos Acostachioaie <dragos@iname.com>
8 * SMP-threaded, sysctl's added
9 * (c) 1999 Manfred Spraul <manfred@colorfullife.com>
10 * Enforced range limit on SEM_UNDO
11 * (c) 2001 Red Hat Inc
13 * (c) 2003 Manfred Spraul <manfred@colorfullife.com>
14 * Further wakeup optimizations, documentation
15 * (c) 2010 Manfred Spraul <manfred@colorfullife.com>
17 * support for audit of ipc object properties and permission changes
18 * Dustin Kirkland <dustin.kirkland@us.ibm.com>
22 * Pavel Emelianov <xemul@openvz.org>
24 * Implementation notes: (May 2010)
25 * This file implements System V semaphores.
27 * User space visible behavior:
28 * - FIFO ordering for semop() operations (just FIFO, not starvation
30 * - multiple semaphore operations that alter the same semaphore in
31 * one semop() are handled.
32 * - sem_ctime (time of last semctl()) is updated in the IPC_SET, SETVAL and
34 * - two Linux specific semctl() commands: SEM_STAT, SEM_INFO.
35 * - undo adjustments at process exit are limited to 0..SEMVMX.
36 * - namespace are supported.
37 * - SEMMSL, SEMMNS, SEMOPM and SEMMNI can be configured at runtine by writing
38 * to /proc/sys/kernel/sem.
39 * - statistics about the usage are reported in /proc/sysvipc/sem.
43 * - all global variables are read-mostly.
44 * - semop() calls and semctl(RMID) are synchronized by RCU.
45 * - most operations do write operations (actually: spin_lock calls) to
46 * the per-semaphore array structure.
47 * Thus: Perfect SMP scaling between independent semaphore arrays.
48 * If multiple semaphores in one array are used, then cache line
49 * trashing on the semaphore array spinlock will limit the scaling.
50 * - semncnt and semzcnt are calculated on demand in count_semncnt() and
52 * - the task that performs a successful semop() scans the list of all
53 * sleeping tasks and completes any pending operations that can be fulfilled.
54 * Semaphores are actively given to waiting tasks (necessary for FIFO).
55 * (see update_queue())
56 * - To improve the scalability, the actual wake-up calls are performed after
57 * dropping all locks. (see wake_up_sem_queue_prepare(),
58 * wake_up_sem_queue_do())
59 * - All work is done by the waker, the woken up task does not have to do
60 * anything - not even acquiring a lock or dropping a refcount.
61 * - A woken up task may not even touch the semaphore array anymore, it may
62 * have been destroyed already by a semctl(RMID).
63 * - The synchronizations between wake-ups due to a timeout/signal and a
64 * wake-up due to a completed semaphore operation is achieved by using an
65 * intermediate state (IN_WAKEUP).
66 * - UNDO values are stored in an array (one per process and per
67 * semaphore array, lazily allocated). For backwards compatibility, multiple
68 * modes for the UNDO variables are supported (per process, per thread)
69 * (see copy_semundo, CLONE_SYSVSEM)
70 * - There are two lists of the pending operations: a per-array list
71 * and per-semaphore list (stored in the array). This allows to achieve FIFO
72 * ordering without always scanning all pending operations.
73 * The worst-case behavior is nevertheless O(N^2) for N wakeups.
76 #include <linux/slab.h>
77 #include <linux/spinlock.h>
78 #include <linux/init.h>
79 #include <linux/proc_fs.h>
80 #include <linux/time.h>
81 #include <linux/security.h>
82 #include <linux/syscalls.h>
83 #include <linux/audit.h>
84 #include <linux/capability.h>
85 #include <linux/seq_file.h>
86 #include <linux/rwsem.h>
87 #include <linux/nsproxy.h>
88 #include <linux/ipc_namespace.h>
90 #include <asm/uaccess.h>
93 /* One semaphore structure for each semaphore in the system. */
95 int semval; /* current value */
96 int sempid; /* pid of last operation */
97 spinlock_t lock; /* spinlock for fine-grained semtimedop */
98 struct list_head sem_pending; /* pending single-sop operations */
101 /* One queue for each sleeping process in the system. */
103 struct list_head list; /* queue of pending operations */
104 struct task_struct *sleeper; /* this process */
105 struct sem_undo *undo; /* undo structure */
106 int pid; /* process id of requesting process */
107 int status; /* completion status of operation */
108 struct sembuf *sops; /* array of pending operations */
109 int nsops; /* number of operations */
110 int alter; /* does *sops alter the array? */
113 /* Each task has a list of undo requests. They are executed automatically
114 * when the process exits.
117 struct list_head list_proc; /* per-process list: *
118 * all undos from one process
120 struct rcu_head rcu; /* rcu struct for sem_undo */
121 struct sem_undo_list *ulp; /* back ptr to sem_undo_list */
122 struct list_head list_id; /* per semaphore array list:
123 * all undos for one array */
124 int semid; /* semaphore set identifier */
125 short *semadj; /* array of adjustments */
126 /* one per semaphore */
129 /* sem_undo_list controls shared access to the list of sem_undo structures
130 * that may be shared among all a CLONE_SYSVSEM task group.
132 struct sem_undo_list {
135 struct list_head list_proc;
139 #define sem_ids(ns) ((ns)->ids[IPC_SEM_IDS])
141 #define sem_checkid(sma, semid) ipc_checkid(&sma->sem_perm, semid)
143 static int newary(struct ipc_namespace *, struct ipc_params *);
144 static void freeary(struct ipc_namespace *, struct kern_ipc_perm *);
145 #ifdef CONFIG_PROC_FS
146 static int sysvipc_sem_proc_show(struct seq_file *s, void *it);
149 #define SEMMSL_FAST 256 /* 512 bytes on stack */
150 #define SEMOPM_FAST 64 /* ~ 372 bytes on stack */
153 * linked list protection:
155 * sem_array.sem_pending{,last},
156 * sem_array.sem_undo: sem_lock() for read/write
157 * sem_undo.proc_next: only "current" is allowed to read/write that field.
161 #define sc_semmsl sem_ctls[0]
162 #define sc_semmns sem_ctls[1]
163 #define sc_semopm sem_ctls[2]
164 #define sc_semmni sem_ctls[3]
166 void sem_init_ns(struct ipc_namespace *ns)
168 ns->sc_semmsl = SEMMSL;
169 ns->sc_semmns = SEMMNS;
170 ns->sc_semopm = SEMOPM;
171 ns->sc_semmni = SEMMNI;
173 ipc_init_ids(&ns->ids[IPC_SEM_IDS]);
177 void sem_exit_ns(struct ipc_namespace *ns)
179 free_ipcs(ns, &sem_ids(ns), freeary);
180 idr_destroy(&ns->ids[IPC_SEM_IDS].ipcs_idr);
184 void __init sem_init (void)
186 sem_init_ns(&init_ipc_ns);
187 ipc_init_proc_interface("sysvipc/sem",
188 " key semid perms nsems uid gid cuid cgid otime ctime\n",
189 IPC_SEM_IDS, sysvipc_sem_proc_show);
193 * If the request contains only one semaphore operation, and there are
194 * no complex transactions pending, lock only the semaphore involved.
195 * Otherwise, lock the entire semaphore array, since we either have
196 * multiple semaphores in our own semops, or we need to look at
197 * semaphores from other pending complex operations.
199 * Carefully guard against sma->complex_count changing between zero
200 * and non-zero while we are spinning for the lock. The value of
201 * sma->complex_count cannot change while we are holding the lock,
202 * so sem_unlock should be fine.
204 * The global lock path checks that all the local locks have been released,
205 * checking each local lock once. This means that the local lock paths
206 * cannot start their critical sections while the global lock is held.
208 static inline int sem_lock(struct sem_array *sma, struct sembuf *sops,
213 if (nsops == 1 && !sma->complex_count) {
214 struct sem *sem = sma->sem_base + sops->sem_num;
216 /* Lock just the semaphore we are interested in. */
217 spin_lock(&sem->lock);
220 * If sma->complex_count was set while we were spinning,
221 * we may need to look at things we did not lock here.
223 if (unlikely(sma->complex_count)) {
224 spin_unlock(&sem->lock);
229 * Another process is holding the global lock on the
230 * sem_array; we cannot enter our critical section,
231 * but have to wait for the global lock to be released.
233 if (unlikely(spin_is_locked(&sma->sem_perm.lock))) {
234 spin_unlock(&sem->lock);
235 spin_unlock_wait(&sma->sem_perm.lock);
239 locknum = sops->sem_num;
243 * Lock the semaphore array, and wait for all of the
244 * individual semaphore locks to go away. The code
245 * above ensures no new single-lock holders will enter
246 * their critical section while the array lock is held.
249 spin_lock(&sma->sem_perm.lock);
250 for (i = 0; i < sma->sem_nsems; i++) {
251 struct sem *sem = sma->sem_base + i;
252 spin_unlock_wait(&sem->lock);
259 static inline void sem_unlock(struct sem_array *sma, int locknum)
262 spin_unlock(&sma->sem_perm.lock);
264 struct sem *sem = sma->sem_base + locknum;
265 spin_unlock(&sem->lock);
270 * sem_lock_(check_) routines are called in the paths where the rw_mutex
273 static inline struct sem_array *sem_obtain_lock(struct ipc_namespace *ns,
274 int id, struct sembuf *sops, int nsops, int *locknum)
276 struct kern_ipc_perm *ipcp;
277 struct sem_array *sma;
280 ipcp = ipc_obtain_object(&sem_ids(ns), id);
282 sma = ERR_CAST(ipcp);
286 sma = container_of(ipcp, struct sem_array, sem_perm);
287 *locknum = sem_lock(sma, sops, nsops);
289 /* ipc_rmid() may have already freed the ID while sem_lock
290 * was spinning: verify that the structure is still valid
293 return container_of(ipcp, struct sem_array, sem_perm);
295 sem_unlock(sma, *locknum);
296 sma = ERR_PTR(-EINVAL);
302 static inline struct sem_array *sem_obtain_object(struct ipc_namespace *ns, int id)
304 struct kern_ipc_perm *ipcp = ipc_obtain_object(&sem_ids(ns), id);
307 return ERR_CAST(ipcp);
309 return container_of(ipcp, struct sem_array, sem_perm);
312 static inline struct sem_array *sem_obtain_object_check(struct ipc_namespace *ns,
315 struct kern_ipc_perm *ipcp = ipc_obtain_object_check(&sem_ids(ns), id);
318 return ERR_CAST(ipcp);
320 return container_of(ipcp, struct sem_array, sem_perm);
323 static inline void sem_lock_and_putref(struct sem_array *sma)
326 sem_lock(sma, NULL, -1);
330 static inline void sem_putref(struct sem_array *sma)
332 sem_lock_and_putref(sma);
337 static inline void sem_rmid(struct ipc_namespace *ns, struct sem_array *s)
339 ipc_rmid(&sem_ids(ns), &s->sem_perm);
343 * Lockless wakeup algorithm:
344 * Without the check/retry algorithm a lockless wakeup is possible:
345 * - queue.status is initialized to -EINTR before blocking.
346 * - wakeup is performed by
347 * * unlinking the queue entry from sma->sem_pending
348 * * setting queue.status to IN_WAKEUP
349 * This is the notification for the blocked thread that a
350 * result value is imminent.
351 * * call wake_up_process
352 * * set queue.status to the final value.
353 * - the previously blocked thread checks queue.status:
354 * * if it's IN_WAKEUP, then it must wait until the value changes
355 * * if it's not -EINTR, then the operation was completed by
356 * update_queue. semtimedop can return queue.status without
357 * performing any operation on the sem array.
358 * * otherwise it must acquire the spinlock and check what's up.
360 * The two-stage algorithm is necessary to protect against the following
362 * - if queue.status is set after wake_up_process, then the woken up idle
363 * thread could race forward and try (and fail) to acquire sma->lock
364 * before update_queue had a chance to set queue.status
365 * - if queue.status is written before wake_up_process and if the
366 * blocked process is woken up by a signal between writing
367 * queue.status and the wake_up_process, then the woken up
368 * process could return from semtimedop and die by calling
369 * sys_exit before wake_up_process is called. Then wake_up_process
370 * will oops, because the task structure is already invalid.
371 * (yes, this happened on s390 with sysv msg).
377 * newary - Create a new semaphore set
379 * @params: ptr to the structure that contains key, semflg and nsems
381 * Called with sem_ids.rw_mutex held (as a writer)
384 static int newary(struct ipc_namespace *ns, struct ipc_params *params)
388 struct sem_array *sma;
390 key_t key = params->key;
391 int nsems = params->u.nsems;
392 int semflg = params->flg;
397 if (ns->used_sems + nsems > ns->sc_semmns)
400 size = sizeof (*sma) + nsems * sizeof (struct sem);
401 sma = ipc_rcu_alloc(size);
405 memset (sma, 0, size);
407 sma->sem_perm.mode = (semflg & S_IRWXUGO);
408 sma->sem_perm.key = key;
410 sma->sem_perm.security = NULL;
411 retval = security_sem_alloc(sma);
417 id = ipc_addid(&sem_ids(ns), &sma->sem_perm, ns->sc_semmni);
419 security_sem_free(sma);
423 ns->used_sems += nsems;
425 sma->sem_base = (struct sem *) &sma[1];
427 for (i = 0; i < nsems; i++) {
428 INIT_LIST_HEAD(&sma->sem_base[i].sem_pending);
429 spin_lock_init(&sma->sem_base[i].lock);
432 sma->complex_count = 0;
433 INIT_LIST_HEAD(&sma->sem_pending);
434 INIT_LIST_HEAD(&sma->list_id);
435 sma->sem_nsems = nsems;
436 sma->sem_ctime = get_seconds();
440 return sma->sem_perm.id;
445 * Called with sem_ids.rw_mutex and ipcp locked.
447 static inline int sem_security(struct kern_ipc_perm *ipcp, int semflg)
449 struct sem_array *sma;
451 sma = container_of(ipcp, struct sem_array, sem_perm);
452 return security_sem_associate(sma, semflg);
456 * Called with sem_ids.rw_mutex and ipcp locked.
458 static inline int sem_more_checks(struct kern_ipc_perm *ipcp,
459 struct ipc_params *params)
461 struct sem_array *sma;
463 sma = container_of(ipcp, struct sem_array, sem_perm);
464 if (params->u.nsems > sma->sem_nsems)
470 SYSCALL_DEFINE3(semget, key_t, key, int, nsems, int, semflg)
472 struct ipc_namespace *ns;
473 struct ipc_ops sem_ops;
474 struct ipc_params sem_params;
476 ns = current->nsproxy->ipc_ns;
478 if (nsems < 0 || nsems > ns->sc_semmsl)
481 sem_ops.getnew = newary;
482 sem_ops.associate = sem_security;
483 sem_ops.more_checks = sem_more_checks;
485 sem_params.key = key;
486 sem_params.flg = semflg;
487 sem_params.u.nsems = nsems;
489 return ipcget(ns, &sem_ids(ns), &sem_ops, &sem_params);
493 * Determine whether a sequence of semaphore operations would succeed
494 * all at once. Return 0 if yes, 1 if need to sleep, else return error code.
497 static int try_atomic_semop (struct sem_array * sma, struct sembuf * sops,
498 int nsops, struct sem_undo *un, int pid)
504 for (sop = sops; sop < sops + nsops; sop++) {
505 curr = sma->sem_base + sop->sem_num;
506 sem_op = sop->sem_op;
507 result = curr->semval;
509 if (!sem_op && result)
517 if (sop->sem_flg & SEM_UNDO) {
518 int undo = un->semadj[sop->sem_num] - sem_op;
520 * Exceeding the undo range is an error.
522 if (undo < (-SEMAEM - 1) || undo > SEMAEM)
525 curr->semval = result;
529 while (sop >= sops) {
530 sma->sem_base[sop->sem_num].sempid = pid;
531 if (sop->sem_flg & SEM_UNDO)
532 un->semadj[sop->sem_num] -= sop->sem_op;
543 if (sop->sem_flg & IPC_NOWAIT)
550 while (sop >= sops) {
551 sma->sem_base[sop->sem_num].semval -= sop->sem_op;
558 /** wake_up_sem_queue_prepare(q, error): Prepare wake-up
559 * @q: queue entry that must be signaled
560 * @error: Error value for the signal
562 * Prepare the wake-up of the queue entry q.
564 static void wake_up_sem_queue_prepare(struct list_head *pt,
565 struct sem_queue *q, int error)
567 if (list_empty(pt)) {
569 * Hold preempt off so that we don't get preempted and have the
570 * wakee busy-wait until we're scheduled back on.
574 q->status = IN_WAKEUP;
577 list_add_tail(&q->list, pt);
581 * wake_up_sem_queue_do(pt) - do the actual wake-up
582 * @pt: list of tasks to be woken up
584 * Do the actual wake-up.
585 * The function is called without any locks held, thus the semaphore array
586 * could be destroyed already and the tasks can disappear as soon as the
587 * status is set to the actual return code.
589 static void wake_up_sem_queue_do(struct list_head *pt)
591 struct sem_queue *q, *t;
594 did_something = !list_empty(pt);
595 list_for_each_entry_safe(q, t, pt, list) {
596 wake_up_process(q->sleeper);
597 /* q can disappear immediately after writing q->status. */
605 static void unlink_queue(struct sem_array *sma, struct sem_queue *q)
609 sma->complex_count--;
612 /** check_restart(sma, q)
613 * @sma: semaphore array
614 * @q: the operation that just completed
616 * update_queue is O(N^2) when it restarts scanning the whole queue of
617 * waiting operations. Therefore this function checks if the restart is
618 * really necessary. It is called after a previously waiting operation
621 static int check_restart(struct sem_array *sma, struct sem_queue *q)
626 /* if the operation didn't modify the array, then no restart */
630 /* pending complex operations are too difficult to analyse */
631 if (sma->complex_count)
634 /* we were a sleeping complex operation. Too difficult */
638 curr = sma->sem_base + q->sops[0].sem_num;
640 /* No-one waits on this queue */
641 if (list_empty(&curr->sem_pending))
644 /* the new semaphore value */
646 /* It is impossible that someone waits for the new value:
647 * - q is a previously sleeping simple operation that
648 * altered the array. It must be a decrement, because
649 * simple increments never sleep.
650 * - The value is not 0, thus wait-for-zero won't proceed.
651 * - If there are older (higher priority) decrements
652 * in the queue, then they have observed the original
653 * semval value and couldn't proceed. The operation
654 * decremented to value - thus they won't proceed either.
656 BUG_ON(q->sops[0].sem_op >= 0);
660 * semval is 0. Check if there are wait-for-zero semops.
661 * They must be the first entries in the per-semaphore queue
663 h = list_first_entry(&curr->sem_pending, struct sem_queue, list);
664 BUG_ON(h->nsops != 1);
665 BUG_ON(h->sops[0].sem_num != q->sops[0].sem_num);
667 /* Yes, there is a wait-for-zero semop. Restart */
668 if (h->sops[0].sem_op == 0)
671 /* Again - no-one is waiting for the new value. */
677 * update_queue(sma, semnum): Look for tasks that can be completed.
678 * @sma: semaphore array.
679 * @semnum: semaphore that was modified.
680 * @pt: list head for the tasks that must be woken up.
682 * update_queue must be called after a semaphore in a semaphore array
683 * was modified. If multiple semaphores were modified, update_queue must
684 * be called with semnum = -1, as well as with the number of each modified
686 * The tasks that must be woken up are added to @pt. The return code
687 * is stored in q->pid.
688 * The function return 1 if at least one semop was completed successfully.
690 static int update_queue(struct sem_array *sma, int semnum, struct list_head *pt)
693 struct list_head *walk;
694 struct list_head *pending_list;
695 int semop_completed = 0;
698 pending_list = &sma->sem_pending;
700 pending_list = &sma->sem_base[semnum].sem_pending;
703 walk = pending_list->next;
704 while (walk != pending_list) {
707 q = container_of(walk, struct sem_queue, list);
710 /* If we are scanning the single sop, per-semaphore list of
711 * one semaphore and that semaphore is 0, then it is not
712 * necessary to scan the "alter" entries: simple increments
713 * that affect only one entry succeed immediately and cannot
714 * be in the per semaphore pending queue, and decrements
715 * cannot be successful if the value is already 0.
717 if (semnum != -1 && sma->sem_base[semnum].semval == 0 &&
721 error = try_atomic_semop(sma, q->sops, q->nsops,
724 /* Does q->sleeper still need to sleep? */
728 unlink_queue(sma, q);
734 restart = check_restart(sma, q);
737 wake_up_sem_queue_prepare(pt, q, error);
741 return semop_completed;
745 * do_smart_update(sma, sops, nsops, otime, pt) - optimized update_queue
746 * @sma: semaphore array
747 * @sops: operations that were performed
748 * @nsops: number of operations
749 * @otime: force setting otime
750 * @pt: list head of the tasks that must be woken up.
752 * do_smart_update() does the required called to update_queue, based on the
753 * actual changes that were performed on the semaphore array.
754 * Note that the function does not do the actual wake-up: the caller is
755 * responsible for calling wake_up_sem_queue_do(@pt).
756 * It is safe to perform this call after dropping all locks.
758 static void do_smart_update(struct sem_array *sma, struct sembuf *sops, int nsops,
759 int otime, struct list_head *pt)
763 if (sma->complex_count || sops == NULL) {
764 if (update_queue(sma, -1, pt))
769 /* No semops; something special is going on. */
770 for (i = 0; i < sma->sem_nsems; i++) {
771 if (update_queue(sma, i, pt))
777 /* Check the semaphores that were modified. */
778 for (i = 0; i < nsops; i++) {
779 if (sops[i].sem_op > 0 ||
780 (sops[i].sem_op < 0 &&
781 sma->sem_base[sops[i].sem_num].semval == 0))
782 if (update_queue(sma, sops[i].sem_num, pt))
787 sma->sem_otime = get_seconds();
791 /* The following counts are associated to each semaphore:
792 * semncnt number of tasks waiting on semval being nonzero
793 * semzcnt number of tasks waiting on semval being zero
794 * This model assumes that a task waits on exactly one semaphore.
795 * Since semaphore operations are to be performed atomically, tasks actually
796 * wait on a whole sequence of semaphores simultaneously.
797 * The counts we return here are a rough approximation, but still
798 * warrant that semncnt+semzcnt>0 if the task is on the pending queue.
800 static int count_semncnt (struct sem_array * sma, ushort semnum)
803 struct sem_queue * q;
806 list_for_each_entry(q, &sma->sem_pending, list) {
807 struct sembuf * sops = q->sops;
808 int nsops = q->nsops;
810 for (i = 0; i < nsops; i++)
811 if (sops[i].sem_num == semnum
812 && (sops[i].sem_op < 0)
813 && !(sops[i].sem_flg & IPC_NOWAIT))
819 static int count_semzcnt (struct sem_array * sma, ushort semnum)
822 struct sem_queue * q;
825 list_for_each_entry(q, &sma->sem_pending, list) {
826 struct sembuf * sops = q->sops;
827 int nsops = q->nsops;
829 for (i = 0; i < nsops; i++)
830 if (sops[i].sem_num == semnum
831 && (sops[i].sem_op == 0)
832 && !(sops[i].sem_flg & IPC_NOWAIT))
838 /* Free a semaphore set. freeary() is called with sem_ids.rw_mutex locked
839 * as a writer and the spinlock for this semaphore set hold. sem_ids.rw_mutex
840 * remains locked on exit.
842 static void freeary(struct ipc_namespace *ns, struct kern_ipc_perm *ipcp)
844 struct sem_undo *un, *tu;
845 struct sem_queue *q, *tq;
846 struct sem_array *sma = container_of(ipcp, struct sem_array, sem_perm);
847 struct list_head tasks;
850 /* Free the existing undo structures for this semaphore set. */
851 assert_spin_locked(&sma->sem_perm.lock);
852 list_for_each_entry_safe(un, tu, &sma->list_id, list_id) {
853 list_del(&un->list_id);
854 spin_lock(&un->ulp->lock);
856 list_del_rcu(&un->list_proc);
857 spin_unlock(&un->ulp->lock);
861 /* Wake up all pending processes and let them fail with EIDRM. */
862 INIT_LIST_HEAD(&tasks);
863 list_for_each_entry_safe(q, tq, &sma->sem_pending, list) {
864 unlink_queue(sma, q);
865 wake_up_sem_queue_prepare(&tasks, q, -EIDRM);
867 for (i = 0; i < sma->sem_nsems; i++) {
868 struct sem *sem = sma->sem_base + i;
869 list_for_each_entry_safe(q, tq, &sem->sem_pending, list) {
870 unlink_queue(sma, q);
871 wake_up_sem_queue_prepare(&tasks, q, -EIDRM);
875 /* Remove the semaphore set from the IDR */
880 wake_up_sem_queue_do(&tasks);
881 ns->used_sems -= sma->sem_nsems;
882 security_sem_free(sma);
886 static unsigned long copy_semid_to_user(void __user *buf, struct semid64_ds *in, int version)
890 return copy_to_user(buf, in, sizeof(*in));
895 memset(&out, 0, sizeof(out));
897 ipc64_perm_to_ipc_perm(&in->sem_perm, &out.sem_perm);
899 out.sem_otime = in->sem_otime;
900 out.sem_ctime = in->sem_ctime;
901 out.sem_nsems = in->sem_nsems;
903 return copy_to_user(buf, &out, sizeof(out));
910 static int semctl_nolock(struct ipc_namespace *ns, int semid,
911 int cmd, int version, void __user *p)
914 struct sem_array *sma;
920 struct seminfo seminfo;
923 err = security_sem_semctl(NULL, cmd);
927 memset(&seminfo,0,sizeof(seminfo));
928 seminfo.semmni = ns->sc_semmni;
929 seminfo.semmns = ns->sc_semmns;
930 seminfo.semmsl = ns->sc_semmsl;
931 seminfo.semopm = ns->sc_semopm;
932 seminfo.semvmx = SEMVMX;
933 seminfo.semmnu = SEMMNU;
934 seminfo.semmap = SEMMAP;
935 seminfo.semume = SEMUME;
936 down_read(&sem_ids(ns).rw_mutex);
937 if (cmd == SEM_INFO) {
938 seminfo.semusz = sem_ids(ns).in_use;
939 seminfo.semaem = ns->used_sems;
941 seminfo.semusz = SEMUSZ;
942 seminfo.semaem = SEMAEM;
944 max_id = ipc_get_maxid(&sem_ids(ns));
945 up_read(&sem_ids(ns).rw_mutex);
946 if (copy_to_user(p, &seminfo, sizeof(struct seminfo)))
948 return (max_id < 0) ? 0: max_id;
953 struct semid64_ds tbuf;
956 memset(&tbuf, 0, sizeof(tbuf));
958 if (cmd == SEM_STAT) {
960 sma = sem_obtain_object(ns, semid);
965 id = sma->sem_perm.id;
968 sma = sem_obtain_object_check(ns, semid);
976 if (ipcperms(ns, &sma->sem_perm, S_IRUGO))
979 err = security_sem_semctl(sma, cmd);
983 kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm);
984 tbuf.sem_otime = sma->sem_otime;
985 tbuf.sem_ctime = sma->sem_ctime;
986 tbuf.sem_nsems = sma->sem_nsems;
988 if (copy_semid_to_user(p, &tbuf, version))
1000 static int semctl_setval(struct ipc_namespace *ns, int semid, int semnum,
1003 struct sem_undo *un;
1004 struct sem_array *sma;
1007 struct list_head tasks;
1009 #if defined(CONFIG_64BIT) && defined(__BIG_ENDIAN)
1010 /* big-endian 64bit */
1013 /* 32bit or little-endian 64bit */
1017 if (val > SEMVMX || val < 0)
1020 INIT_LIST_HEAD(&tasks);
1023 sma = sem_obtain_object_check(ns, semid);
1026 return PTR_ERR(sma);
1029 if (semnum < 0 || semnum >= sma->sem_nsems) {
1035 if (ipcperms(ns, &sma->sem_perm, S_IWUGO)) {
1040 err = security_sem_semctl(sma, SETVAL);
1046 sem_lock(sma, NULL, -1);
1048 curr = &sma->sem_base[semnum];
1050 assert_spin_locked(&sma->sem_perm.lock);
1051 list_for_each_entry(un, &sma->list_id, list_id)
1052 un->semadj[semnum] = 0;
1055 curr->sempid = task_tgid_vnr(current);
1056 sma->sem_ctime = get_seconds();
1057 /* maybe some queued-up processes were waiting for this */
1058 do_smart_update(sma, NULL, 0, 0, &tasks);
1059 sem_unlock(sma, -1);
1061 wake_up_sem_queue_do(&tasks);
1065 static int semctl_main(struct ipc_namespace *ns, int semid, int semnum,
1066 int cmd, void __user *p)
1068 struct sem_array *sma;
1071 ushort fast_sem_io[SEMMSL_FAST];
1072 ushort* sem_io = fast_sem_io;
1073 struct list_head tasks;
1075 INIT_LIST_HEAD(&tasks);
1078 sma = sem_obtain_object_check(ns, semid);
1081 return PTR_ERR(sma);
1084 nsems = sma->sem_nsems;
1087 if (ipcperms(ns, &sma->sem_perm,
1088 cmd == SETALL ? S_IWUGO : S_IRUGO)) {
1093 err = security_sem_semctl(sma, cmd);
1103 ushort __user *array = p;
1106 sem_lock(sma, NULL, -1);
1107 if(nsems > SEMMSL_FAST) {
1108 if (!ipc_rcu_getref(sma)) {
1109 sem_unlock(sma, -1);
1114 sem_unlock(sma, -1);
1116 sem_io = ipc_alloc(sizeof(ushort)*nsems);
1117 if(sem_io == NULL) {
1122 sem_lock_and_putref(sma);
1123 if (sma->sem_perm.deleted) {
1124 sem_unlock(sma, -1);
1130 for (i = 0; i < sma->sem_nsems; i++)
1131 sem_io[i] = sma->sem_base[i].semval;
1132 sem_unlock(sma, -1);
1135 if(copy_to_user(array, sem_io, nsems*sizeof(ushort)))
1142 struct sem_undo *un;
1144 if (!ipc_rcu_getref(sma)) {
1150 if(nsems > SEMMSL_FAST) {
1151 sem_io = ipc_alloc(sizeof(ushort)*nsems);
1152 if(sem_io == NULL) {
1158 if (copy_from_user (sem_io, p, nsems*sizeof(ushort))) {
1164 for (i = 0; i < nsems; i++) {
1165 if (sem_io[i] > SEMVMX) {
1171 sem_lock_and_putref(sma);
1172 if (sma->sem_perm.deleted) {
1173 sem_unlock(sma, -1);
1179 for (i = 0; i < nsems; i++)
1180 sma->sem_base[i].semval = sem_io[i];
1182 assert_spin_locked(&sma->sem_perm.lock);
1183 list_for_each_entry(un, &sma->list_id, list_id) {
1184 for (i = 0; i < nsems; i++)
1187 sma->sem_ctime = get_seconds();
1188 /* maybe some queued-up processes were waiting for this */
1189 do_smart_update(sma, NULL, 0, 0, &tasks);
1193 /* GETVAL, GETPID, GETNCTN, GETZCNT: fall-through */
1196 if (semnum < 0 || semnum >= nsems) {
1201 sem_lock(sma, NULL, -1);
1202 curr = &sma->sem_base[semnum];
1212 err = count_semncnt(sma,semnum);
1215 err = count_semzcnt(sma,semnum);
1220 sem_unlock(sma, -1);
1223 wake_up_sem_queue_do(&tasks);
1225 if(sem_io != fast_sem_io)
1226 ipc_free(sem_io, sizeof(ushort)*nsems);
1230 static inline unsigned long
1231 copy_semid_from_user(struct semid64_ds *out, void __user *buf, int version)
1235 if (copy_from_user(out, buf, sizeof(*out)))
1240 struct semid_ds tbuf_old;
1242 if(copy_from_user(&tbuf_old, buf, sizeof(tbuf_old)))
1245 out->sem_perm.uid = tbuf_old.sem_perm.uid;
1246 out->sem_perm.gid = tbuf_old.sem_perm.gid;
1247 out->sem_perm.mode = tbuf_old.sem_perm.mode;
1257 * This function handles some semctl commands which require the rw_mutex
1258 * to be held in write mode.
1259 * NOTE: no locks must be held, the rw_mutex is taken inside this function.
1261 static int semctl_down(struct ipc_namespace *ns, int semid,
1262 int cmd, int version, void __user *p)
1264 struct sem_array *sma;
1266 struct semid64_ds semid64;
1267 struct kern_ipc_perm *ipcp;
1269 if(cmd == IPC_SET) {
1270 if (copy_semid_from_user(&semid64, p, version))
1274 ipcp = ipcctl_pre_down_nolock(ns, &sem_ids(ns), semid, cmd,
1275 &semid64.sem_perm, 0);
1277 return PTR_ERR(ipcp);
1279 sma = container_of(ipcp, struct sem_array, sem_perm);
1281 err = security_sem_semctl(sma, cmd);
1289 sem_lock(sma, NULL, -1);
1293 sem_lock(sma, NULL, -1);
1294 err = ipc_update_perm(&semid64.sem_perm, ipcp);
1297 sma->sem_ctime = get_seconds();
1306 sem_unlock(sma, -1);
1309 up_write(&sem_ids(ns).rw_mutex);
1313 SYSCALL_DEFINE4(semctl, int, semid, int, semnum, int, cmd, unsigned long, arg)
1316 struct ipc_namespace *ns;
1317 void __user *p = (void __user *)arg;
1322 version = ipc_parse_version(&cmd);
1323 ns = current->nsproxy->ipc_ns;
1330 return semctl_nolock(ns, semid, cmd, version, p);
1337 return semctl_main(ns, semid, semnum, cmd, p);
1339 return semctl_setval(ns, semid, semnum, arg);
1342 return semctl_down(ns, semid, cmd, version, p);
1348 /* If the task doesn't already have a undo_list, then allocate one
1349 * here. We guarantee there is only one thread using this undo list,
1350 * and current is THE ONE
1352 * If this allocation and assignment succeeds, but later
1353 * portions of this code fail, there is no need to free the sem_undo_list.
1354 * Just let it stay associated with the task, and it'll be freed later
1357 * This can block, so callers must hold no locks.
1359 static inline int get_undo_list(struct sem_undo_list **undo_listp)
1361 struct sem_undo_list *undo_list;
1363 undo_list = current->sysvsem.undo_list;
1365 undo_list = kzalloc(sizeof(*undo_list), GFP_KERNEL);
1366 if (undo_list == NULL)
1368 spin_lock_init(&undo_list->lock);
1369 atomic_set(&undo_list->refcnt, 1);
1370 INIT_LIST_HEAD(&undo_list->list_proc);
1372 current->sysvsem.undo_list = undo_list;
1374 *undo_listp = undo_list;
1378 static struct sem_undo *__lookup_undo(struct sem_undo_list *ulp, int semid)
1380 struct sem_undo *un;
1382 list_for_each_entry_rcu(un, &ulp->list_proc, list_proc) {
1383 if (un->semid == semid)
1389 static struct sem_undo *lookup_undo(struct sem_undo_list *ulp, int semid)
1391 struct sem_undo *un;
1393 assert_spin_locked(&ulp->lock);
1395 un = __lookup_undo(ulp, semid);
1397 list_del_rcu(&un->list_proc);
1398 list_add_rcu(&un->list_proc, &ulp->list_proc);
1404 * find_alloc_undo - Lookup (and if not present create) undo array
1406 * @semid: semaphore array id
1408 * The function looks up (and if not present creates) the undo structure.
1409 * The size of the undo structure depends on the size of the semaphore
1410 * array, thus the alloc path is not that straightforward.
1411 * Lifetime-rules: sem_undo is rcu-protected, on success, the function
1412 * performs a rcu_read_lock().
1414 static struct sem_undo *find_alloc_undo(struct ipc_namespace *ns, int semid)
1416 struct sem_array *sma;
1417 struct sem_undo_list *ulp;
1418 struct sem_undo *un, *new;
1421 error = get_undo_list(&ulp);
1423 return ERR_PTR(error);
1426 spin_lock(&ulp->lock);
1427 un = lookup_undo(ulp, semid);
1428 spin_unlock(&ulp->lock);
1429 if (likely(un!=NULL))
1432 /* no undo structure around - allocate one. */
1433 /* step 1: figure out the size of the semaphore array */
1434 sma = sem_obtain_object_check(ns, semid);
1437 return ERR_CAST(sma);
1440 nsems = sma->sem_nsems;
1441 if (!ipc_rcu_getref(sma)) {
1443 un = ERR_PTR(-EIDRM);
1448 /* step 2: allocate new undo structure */
1449 new = kzalloc(sizeof(struct sem_undo) + sizeof(short)*nsems, GFP_KERNEL);
1452 return ERR_PTR(-ENOMEM);
1455 /* step 3: Acquire the lock on semaphore array */
1456 /* This also does the rcu_read_lock() */
1457 sem_lock_and_putref(sma);
1458 if (sma->sem_perm.deleted) {
1459 sem_unlock(sma, -1);
1462 un = ERR_PTR(-EIDRM);
1465 spin_lock(&ulp->lock);
1468 * step 4: check for races: did someone else allocate the undo struct?
1470 un = lookup_undo(ulp, semid);
1475 /* step 5: initialize & link new undo structure */
1476 new->semadj = (short *) &new[1];
1479 assert_spin_locked(&ulp->lock);
1480 list_add_rcu(&new->list_proc, &ulp->list_proc);
1481 assert_spin_locked(&sma->sem_perm.lock);
1482 list_add(&new->list_id, &sma->list_id);
1486 spin_unlock(&ulp->lock);
1487 sem_unlock(sma, -1);
1494 * get_queue_result - Retrieve the result code from sem_queue
1495 * @q: Pointer to queue structure
1497 * Retrieve the return code from the pending queue. If IN_WAKEUP is found in
1498 * q->status, then we must loop until the value is replaced with the final
1499 * value: This may happen if a task is woken up by an unrelated event (e.g.
1500 * signal) and in parallel the task is woken up by another task because it got
1501 * the requested semaphores.
1503 * The function can be called with or without holding the semaphore spinlock.
1505 static int get_queue_result(struct sem_queue *q)
1510 while (unlikely(error == IN_WAKEUP)) {
1519 SYSCALL_DEFINE4(semtimedop, int, semid, struct sembuf __user *, tsops,
1520 unsigned, nsops, const struct timespec __user *, timeout)
1522 int error = -EINVAL;
1523 struct sem_array *sma;
1524 struct sembuf fast_sops[SEMOPM_FAST];
1525 struct sembuf* sops = fast_sops, *sop;
1526 struct sem_undo *un;
1527 int undos = 0, alter = 0, max, locknum;
1528 struct sem_queue queue;
1529 unsigned long jiffies_left = 0;
1530 struct ipc_namespace *ns;
1531 struct list_head tasks;
1533 ns = current->nsproxy->ipc_ns;
1535 if (nsops < 1 || semid < 0)
1537 if (nsops > ns->sc_semopm)
1539 if(nsops > SEMOPM_FAST) {
1540 sops = kmalloc(sizeof(*sops)*nsops,GFP_KERNEL);
1544 if (copy_from_user (sops, tsops, nsops * sizeof(*tsops))) {
1549 struct timespec _timeout;
1550 if (copy_from_user(&_timeout, timeout, sizeof(*timeout))) {
1554 if (_timeout.tv_sec < 0 || _timeout.tv_nsec < 0 ||
1555 _timeout.tv_nsec >= 1000000000L) {
1559 jiffies_left = timespec_to_jiffies(&_timeout);
1562 for (sop = sops; sop < sops + nsops; sop++) {
1563 if (sop->sem_num >= max)
1565 if (sop->sem_flg & SEM_UNDO)
1567 if (sop->sem_op != 0)
1571 INIT_LIST_HEAD(&tasks);
1574 /* On success, find_alloc_undo takes the rcu_read_lock */
1575 un = find_alloc_undo(ns, semid);
1577 error = PTR_ERR(un);
1585 sma = sem_obtain_object_check(ns, semid);
1588 error = PTR_ERR(sma);
1593 if (max >= sma->sem_nsems) {
1599 if (ipcperms(ns, &sma->sem_perm, alter ? S_IWUGO : S_IRUGO)) {
1604 error = security_sem_semop(sma, sops, nsops, alter);
1611 * semid identifiers are not unique - find_alloc_undo may have
1612 * allocated an undo structure, it was invalidated by an RMID
1613 * and now a new array with received the same id. Check and fail.
1614 * This case can be detected checking un->semid. The existence of
1615 * "un" itself is guaranteed by rcu.
1618 locknum = sem_lock(sma, sops, nsops);
1619 if (un && un->semid == -1)
1620 goto out_unlock_free;
1622 error = try_atomic_semop (sma, sops, nsops, un, task_tgid_vnr(current));
1624 if (alter && error == 0)
1625 do_smart_update(sma, sops, nsops, 1, &tasks);
1627 goto out_unlock_free;
1630 /* We need to sleep on this operation, so we put the current
1631 * task into the pending queue and go to sleep.
1635 queue.nsops = nsops;
1637 queue.pid = task_tgid_vnr(current);
1638 queue.alter = alter;
1642 curr = &sma->sem_base[sops->sem_num];
1645 list_add_tail(&queue.list, &curr->sem_pending);
1647 list_add(&queue.list, &curr->sem_pending);
1650 list_add_tail(&queue.list, &sma->sem_pending);
1652 list_add(&queue.list, &sma->sem_pending);
1653 sma->complex_count++;
1656 queue.status = -EINTR;
1657 queue.sleeper = current;
1660 current->state = TASK_INTERRUPTIBLE;
1661 sem_unlock(sma, locknum);
1665 jiffies_left = schedule_timeout(jiffies_left);
1669 error = get_queue_result(&queue);
1671 if (error != -EINTR) {
1672 /* fast path: update_queue already obtained all requested
1674 * Perform a smp_mb(): User space could assume that semop()
1675 * is a memory barrier: Without the mb(), the cpu could
1676 * speculatively read in user space stale data that was
1677 * overwritten by the previous owner of the semaphore.
1684 sma = sem_obtain_lock(ns, semid, sops, nsops, &locknum);
1687 * Wait until it's guaranteed that no wakeup_sem_queue_do() is ongoing.
1689 error = get_queue_result(&queue);
1692 * Array removed? If yes, leave without sem_unlock().
1700 * If queue.status != -EINTR we are woken up by another process.
1701 * Leave without unlink_queue(), but with sem_unlock().
1704 if (error != -EINTR) {
1705 goto out_unlock_free;
1709 * If an interrupt occurred we have to clean up the queue
1711 if (timeout && jiffies_left == 0)
1715 * If the wakeup was spurious, just retry
1717 if (error == -EINTR && !signal_pending(current))
1720 unlink_queue(sma, &queue);
1723 sem_unlock(sma, locknum);
1726 wake_up_sem_queue_do(&tasks);
1728 if(sops != fast_sops)
1733 SYSCALL_DEFINE3(semop, int, semid, struct sembuf __user *, tsops,
1736 return sys_semtimedop(semid, tsops, nsops, NULL);
1739 /* If CLONE_SYSVSEM is set, establish sharing of SEM_UNDO state between
1740 * parent and child tasks.
1743 int copy_semundo(unsigned long clone_flags, struct task_struct *tsk)
1745 struct sem_undo_list *undo_list;
1748 if (clone_flags & CLONE_SYSVSEM) {
1749 error = get_undo_list(&undo_list);
1752 atomic_inc(&undo_list->refcnt);
1753 tsk->sysvsem.undo_list = undo_list;
1755 tsk->sysvsem.undo_list = NULL;
1761 * add semadj values to semaphores, free undo structures.
1762 * undo structures are not freed when semaphore arrays are destroyed
1763 * so some of them may be out of date.
1764 * IMPLEMENTATION NOTE: There is some confusion over whether the
1765 * set of adjustments that needs to be done should be done in an atomic
1766 * manner or not. That is, if we are attempting to decrement the semval
1767 * should we queue up and wait until we can do so legally?
1768 * The original implementation attempted to do this (queue and wait).
1769 * The current implementation does not do so. The POSIX standard
1770 * and SVID should be consulted to determine what behavior is mandated.
1772 void exit_sem(struct task_struct *tsk)
1774 struct sem_undo_list *ulp;
1776 ulp = tsk->sysvsem.undo_list;
1779 tsk->sysvsem.undo_list = NULL;
1781 if (!atomic_dec_and_test(&ulp->refcnt))
1785 struct sem_array *sma;
1786 struct sem_undo *un;
1787 struct list_head tasks;
1791 un = list_entry_rcu(ulp->list_proc.next,
1792 struct sem_undo, list_proc);
1793 if (&un->list_proc == &ulp->list_proc)
1803 sma = sem_obtain_object_check(tsk->nsproxy->ipc_ns, un->semid);
1804 /* exit_sem raced with IPC_RMID, nothing to do */
1810 sem_lock(sma, NULL, -1);
1811 un = __lookup_undo(ulp, semid);
1813 /* exit_sem raced with IPC_RMID+semget() that created
1814 * exactly the same semid. Nothing to do.
1816 sem_unlock(sma, -1);
1821 /* remove un from the linked lists */
1822 assert_spin_locked(&sma->sem_perm.lock);
1823 list_del(&un->list_id);
1825 spin_lock(&ulp->lock);
1826 list_del_rcu(&un->list_proc);
1827 spin_unlock(&ulp->lock);
1829 /* perform adjustments registered in un */
1830 for (i = 0; i < sma->sem_nsems; i++) {
1831 struct sem * semaphore = &sma->sem_base[i];
1832 if (un->semadj[i]) {
1833 semaphore->semval += un->semadj[i];
1835 * Range checks of the new semaphore value,
1836 * not defined by sus:
1837 * - Some unices ignore the undo entirely
1838 * (e.g. HP UX 11i 11.22, Tru64 V5.1)
1839 * - some cap the value (e.g. FreeBSD caps
1840 * at 0, but doesn't enforce SEMVMX)
1842 * Linux caps the semaphore value, both at 0
1845 * Manfred <manfred@colorfullife.com>
1847 if (semaphore->semval < 0)
1848 semaphore->semval = 0;
1849 if (semaphore->semval > SEMVMX)
1850 semaphore->semval = SEMVMX;
1851 semaphore->sempid = task_tgid_vnr(current);
1854 /* maybe some queued-up processes were waiting for this */
1855 INIT_LIST_HEAD(&tasks);
1856 do_smart_update(sma, NULL, 0, 1, &tasks);
1857 sem_unlock(sma, -1);
1859 wake_up_sem_queue_do(&tasks);
1866 #ifdef CONFIG_PROC_FS
1867 static int sysvipc_sem_proc_show(struct seq_file *s, void *it)
1869 struct user_namespace *user_ns = seq_user_ns(s);
1870 struct sem_array *sma = it;
1872 return seq_printf(s,
1873 "%10d %10d %4o %10u %5u %5u %5u %5u %10lu %10lu\n",
1878 from_kuid_munged(user_ns, sma->sem_perm.uid),
1879 from_kgid_munged(user_ns, sma->sem_perm.gid),
1880 from_kuid_munged(user_ns, sma->sem_perm.cuid),
1881 from_kgid_munged(user_ns, sma->sem_perm.cgid),