3 * Copyright (C) 1992 Krishna Balasubramanian
4 * Copyright (C) 1995 Eric Schenk, Bruno Haible
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.
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.
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.
56 * /proc/sysvipc/sem support (c) 1999 Dragos Acostachioaie <dragos@iname.com>
58 * SMP-threaded, sysctl's added
59 * (c) 1999 Manfred Spraul <manfred@colorfullife.com>
60 * Enforced range limit on SEM_UNDO
61 * (c) 2001 Red Hat Inc <alan@redhat.com>
63 * (c) 2003 Manfred Spraul <manfred@colorfullife.com>
65 * support for audit of ipc object properties and permission changes
66 * Dustin Kirkland <dustin.kirkland@us.ibm.com>
70 * Pavel Emelianov <xemul@openvz.org>
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>
78 #include <linux/security.h>
79 #include <linux/syscalls.h>
80 #include <linux/audit.h>
81 #include <linux/capability.h>
82 #include <linux/seq_file.h>
83 #include <linux/mutex.h>
84 #include <linux/nsproxy.h>
86 #include <asm/uaccess.h>
89 #define sem_ids(ns) (*((ns)->ids[IPC_SEM_IDS]))
91 #define sem_unlock(sma) ipc_unlock(&(sma)->sem_perm)
92 #define sem_checkid(ns, sma, semid) \
93 ipc_checkid(&sem_ids(ns),&sma->sem_perm,semid)
94 #define sem_buildid(ns, id, seq) \
95 ipc_buildid(&sem_ids(ns), id, seq)
97 static struct ipc_ids init_sem_ids;
99 static int newary(struct ipc_namespace *, struct ipc_params *);
100 static void freeary(struct ipc_namespace *, struct sem_array *);
101 #ifdef CONFIG_PROC_FS
102 static int sysvipc_sem_proc_show(struct seq_file *s, void *it);
105 #define SEMMSL_FAST 256 /* 512 bytes on stack */
106 #define SEMOPM_FAST 64 /* ~ 372 bytes on stack */
109 * linked list protection:
111 * sem_array.sem_pending{,last},
112 * sem_array.sem_undo: sem_lock() for read/write
113 * sem_undo.proc_next: only "current" is allowed to read/write that field.
117 #define sc_semmsl sem_ctls[0]
118 #define sc_semmns sem_ctls[1]
119 #define sc_semopm sem_ctls[2]
120 #define sc_semmni sem_ctls[3]
122 static void __sem_init_ns(struct ipc_namespace *ns, struct ipc_ids *ids)
124 ns->ids[IPC_SEM_IDS] = ids;
125 ns->sc_semmsl = SEMMSL;
126 ns->sc_semmns = SEMMNS;
127 ns->sc_semopm = SEMOPM;
128 ns->sc_semmni = SEMMNI;
133 int sem_init_ns(struct ipc_namespace *ns)
137 ids = kmalloc(sizeof(struct ipc_ids), GFP_KERNEL);
141 __sem_init_ns(ns, ids);
145 void sem_exit_ns(struct ipc_namespace *ns)
147 struct sem_array *sma;
151 mutex_lock(&sem_ids(ns).mutex);
153 in_use = sem_ids(ns).in_use;
155 for (total = 0, next_id = 0; total < in_use; next_id++) {
156 sma = idr_find(&sem_ids(ns).ipcs_idr, next_id);
159 ipc_lock_by_ptr(&sma->sem_perm);
163 mutex_unlock(&sem_ids(ns).mutex);
165 kfree(ns->ids[IPC_SEM_IDS]);
166 ns->ids[IPC_SEM_IDS] = NULL;
169 void __init sem_init (void)
171 __sem_init_ns(&init_ipc_ns, &init_sem_ids);
172 ipc_init_proc_interface("sysvipc/sem",
173 " key semid perms nsems uid gid cuid cgid otime ctime\n",
174 IPC_SEM_IDS, sysvipc_sem_proc_show);
177 static inline struct sem_array *sem_lock(struct ipc_namespace *ns, int id)
179 struct kern_ipc_perm *ipcp = ipc_lock(&sem_ids(ns), id);
181 return container_of(ipcp, struct sem_array, sem_perm);
184 static inline struct sem_array *sem_lock_check(struct ipc_namespace *ns,
187 struct kern_ipc_perm *ipcp = ipc_lock_check(&sem_ids(ns), id);
189 return container_of(ipcp, struct sem_array, sem_perm);
192 static inline void sem_rmid(struct ipc_namespace *ns, struct sem_array *s)
194 ipc_rmid(&sem_ids(ns), &s->sem_perm);
198 * Lockless wakeup algorithm:
199 * Without the check/retry algorithm a lockless wakeup is possible:
200 * - queue.status is initialized to -EINTR before blocking.
201 * - wakeup is performed by
202 * * unlinking the queue entry from sma->sem_pending
203 * * setting queue.status to IN_WAKEUP
204 * This is the notification for the blocked thread that a
205 * result value is imminent.
206 * * call wake_up_process
207 * * set queue.status to the final value.
208 * - the previously blocked thread checks queue.status:
209 * * if it's IN_WAKEUP, then it must wait until the value changes
210 * * if it's not -EINTR, then the operation was completed by
211 * update_queue. semtimedop can return queue.status without
212 * performing any operation on the sem array.
213 * * otherwise it must acquire the spinlock and check what's up.
215 * The two-stage algorithm is necessary to protect against the following
217 * - if queue.status is set after wake_up_process, then the woken up idle
218 * thread could race forward and try (and fail) to acquire sma->lock
219 * before update_queue had a chance to set queue.status
220 * - if queue.status is written before wake_up_process and if the
221 * blocked process is woken up by a signal between writing
222 * queue.status and the wake_up_process, then the woken up
223 * process could return from semtimedop and die by calling
224 * sys_exit before wake_up_process is called. Then wake_up_process
225 * will oops, because the task structure is already invalid.
226 * (yes, this happened on s390 with sysv msg).
232 * newary - Create a new semaphore set
234 * @params: ptr to the structure that contains key, semflg and nsems
236 * Called with sem_ids.mutex held
239 static int newary(struct ipc_namespace *ns, struct ipc_params *params)
243 struct sem_array *sma;
245 key_t key = params->key;
246 int nsems = params->u.nsems;
247 int semflg = params->flg;
251 if (ns->used_sems + nsems > ns->sc_semmns)
254 size = sizeof (*sma) + nsems * sizeof (struct sem);
255 sma = ipc_rcu_alloc(size);
259 memset (sma, 0, size);
261 sma->sem_perm.mode = (semflg & S_IRWXUGO);
262 sma->sem_perm.key = key;
264 sma->sem_perm.security = NULL;
265 retval = security_sem_alloc(sma);
271 id = ipc_addid(&sem_ids(ns), &sma->sem_perm, ns->sc_semmni);
273 security_sem_free(sma);
277 ns->used_sems += nsems;
279 sma->sem_perm.id = sem_buildid(ns, id, sma->sem_perm.seq);
280 sma->sem_base = (struct sem *) &sma[1];
281 /* sma->sem_pending = NULL; */
282 sma->sem_pending_last = &sma->sem_pending;
283 /* sma->undo = NULL; */
284 sma->sem_nsems = nsems;
285 sma->sem_ctime = get_seconds();
288 return sma->sem_perm.id;
293 * Called with sem_ids.mutex and ipcp locked.
295 static inline int sem_security(struct kern_ipc_perm *ipcp, int semflg)
297 struct sem_array *sma;
299 sma = container_of(ipcp, struct sem_array, sem_perm);
300 return security_sem_associate(sma, semflg);
304 * Called with sem_ids.mutex and ipcp locked.
306 static inline int sem_more_checks(struct kern_ipc_perm *ipcp,
307 struct ipc_params *params)
309 struct sem_array *sma;
311 sma = container_of(ipcp, struct sem_array, sem_perm);
312 if (params->u.nsems > sma->sem_nsems)
318 asmlinkage long sys_semget(key_t key, int nsems, int semflg)
320 struct ipc_namespace *ns;
321 struct ipc_ops sem_ops;
322 struct ipc_params sem_params;
324 ns = current->nsproxy->ipc_ns;
326 if (nsems < 0 || nsems > ns->sc_semmsl)
329 sem_ops.getnew = newary;
330 sem_ops.associate = sem_security;
331 sem_ops.more_checks = sem_more_checks;
333 sem_params.key = key;
334 sem_params.flg = semflg;
335 sem_params.u.nsems = nsems;
337 return ipcget(ns, &sem_ids(ns), &sem_ops, &sem_params);
340 /* Manage the doubly linked list sma->sem_pending as a FIFO:
341 * insert new queue elements at the tail sma->sem_pending_last.
343 static inline void append_to_queue (struct sem_array * sma,
344 struct sem_queue * q)
346 *(q->prev = sma->sem_pending_last) = q;
347 *(sma->sem_pending_last = &q->next) = NULL;
350 static inline void prepend_to_queue (struct sem_array * sma,
351 struct sem_queue * q)
353 q->next = sma->sem_pending;
354 *(q->prev = &sma->sem_pending) = q;
356 q->next->prev = &q->next;
357 else /* sma->sem_pending_last == &sma->sem_pending */
358 sma->sem_pending_last = &q->next;
361 static inline void remove_from_queue (struct sem_array * sma,
362 struct sem_queue * q)
364 *(q->prev) = q->next;
366 q->next->prev = q->prev;
367 else /* sma->sem_pending_last == &q->next */
368 sma->sem_pending_last = q->prev;
369 q->prev = NULL; /* mark as removed */
373 * Determine whether a sequence of semaphore operations would succeed
374 * all at once. Return 0 if yes, 1 if need to sleep, else return error code.
377 static int try_atomic_semop (struct sem_array * sma, struct sembuf * sops,
378 int nsops, struct sem_undo *un, int pid)
384 for (sop = sops; sop < sops + nsops; sop++) {
385 curr = sma->sem_base + sop->sem_num;
386 sem_op = sop->sem_op;
387 result = curr->semval;
389 if (!sem_op && result)
397 if (sop->sem_flg & SEM_UNDO) {
398 int undo = un->semadj[sop->sem_num] - sem_op;
400 * Exceeding the undo range is an error.
402 if (undo < (-SEMAEM - 1) || undo > SEMAEM)
405 curr->semval = result;
409 while (sop >= sops) {
410 sma->sem_base[sop->sem_num].sempid = pid;
411 if (sop->sem_flg & SEM_UNDO)
412 un->semadj[sop->sem_num] -= sop->sem_op;
416 sma->sem_otime = get_seconds();
424 if (sop->sem_flg & IPC_NOWAIT)
431 while (sop >= sops) {
432 sma->sem_base[sop->sem_num].semval -= sop->sem_op;
439 /* Go through the pending queue for the indicated semaphore
440 * looking for tasks that can be completed.
442 static void update_queue (struct sem_array * sma)
445 struct sem_queue * q;
447 q = sma->sem_pending;
449 error = try_atomic_semop(sma, q->sops, q->nsops,
452 /* Does q->sleeper still need to sleep? */
455 remove_from_queue(sma,q);
456 q->status = IN_WAKEUP;
458 * Continue scanning. The next operation
459 * that must be checked depends on the type of the
460 * completed operation:
461 * - if the operation modified the array, then
462 * restart from the head of the queue and
463 * check for threads that might be waiting
464 * for semaphore values to become 0.
465 * - if the operation didn't modify the array,
466 * then just continue.
469 n = sma->sem_pending;
472 wake_up_process(q->sleeper);
473 /* hands-off: q will disappear immediately after
485 /* The following counts are associated to each semaphore:
486 * semncnt number of tasks waiting on semval being nonzero
487 * semzcnt number of tasks waiting on semval being zero
488 * This model assumes that a task waits on exactly one semaphore.
489 * Since semaphore operations are to be performed atomically, tasks actually
490 * wait on a whole sequence of semaphores simultaneously.
491 * The counts we return here are a rough approximation, but still
492 * warrant that semncnt+semzcnt>0 if the task is on the pending queue.
494 static int count_semncnt (struct sem_array * sma, ushort semnum)
497 struct sem_queue * q;
500 for (q = sma->sem_pending; q; q = q->next) {
501 struct sembuf * sops = q->sops;
502 int nsops = q->nsops;
504 for (i = 0; i < nsops; i++)
505 if (sops[i].sem_num == semnum
506 && (sops[i].sem_op < 0)
507 && !(sops[i].sem_flg & IPC_NOWAIT))
512 static int count_semzcnt (struct sem_array * sma, ushort semnum)
515 struct sem_queue * q;
518 for (q = sma->sem_pending; q; q = q->next) {
519 struct sembuf * sops = q->sops;
520 int nsops = q->nsops;
522 for (i = 0; i < nsops; i++)
523 if (sops[i].sem_num == semnum
524 && (sops[i].sem_op == 0)
525 && !(sops[i].sem_flg & IPC_NOWAIT))
531 /* Free a semaphore set. freeary() is called with sem_ids.mutex locked and
532 * the spinlock for this semaphore set hold. sem_ids.mutex remains locked
535 static void freeary(struct ipc_namespace *ns, struct sem_array *sma)
540 /* Invalidate the existing undo structures for this semaphore set.
541 * (They will be freed without any further action in exit_sem()
542 * or during the next semop.)
544 for (un = sma->undo; un; un = un->id_next)
547 /* Wake up all pending processes and let them fail with EIDRM. */
548 q = sma->sem_pending;
551 /* lazy remove_from_queue: we are killing the whole queue */
554 q->status = IN_WAKEUP;
555 wake_up_process(q->sleeper); /* doesn't sleep */
557 q->status = -EIDRM; /* hands-off q */
561 /* Remove the semaphore set from the IDR */
565 ns->used_sems -= sma->sem_nsems;
566 security_sem_free(sma);
570 static unsigned long copy_semid_to_user(void __user *buf, struct semid64_ds *in, int version)
574 return copy_to_user(buf, in, sizeof(*in));
579 ipc64_perm_to_ipc_perm(&in->sem_perm, &out.sem_perm);
581 out.sem_otime = in->sem_otime;
582 out.sem_ctime = in->sem_ctime;
583 out.sem_nsems = in->sem_nsems;
585 return copy_to_user(buf, &out, sizeof(out));
592 static int semctl_nolock(struct ipc_namespace *ns, int semid, int semnum,
593 int cmd, int version, union semun arg)
596 struct sem_array *sma;
602 struct seminfo seminfo;
605 err = security_sem_semctl(NULL, cmd);
609 memset(&seminfo,0,sizeof(seminfo));
610 seminfo.semmni = ns->sc_semmni;
611 seminfo.semmns = ns->sc_semmns;
612 seminfo.semmsl = ns->sc_semmsl;
613 seminfo.semopm = ns->sc_semopm;
614 seminfo.semvmx = SEMVMX;
615 seminfo.semmnu = SEMMNU;
616 seminfo.semmap = SEMMAP;
617 seminfo.semume = SEMUME;
618 mutex_lock(&sem_ids(ns).mutex);
619 if (cmd == SEM_INFO) {
620 seminfo.semusz = sem_ids(ns).in_use;
621 seminfo.semaem = ns->used_sems;
623 seminfo.semusz = SEMUSZ;
624 seminfo.semaem = SEMAEM;
626 max_id = ipc_get_maxid(&sem_ids(ns));
627 mutex_unlock(&sem_ids(ns).mutex);
628 if (copy_to_user (arg.__buf, &seminfo, sizeof(struct seminfo)))
630 return (max_id < 0) ? 0: max_id;
634 struct semid64_ds tbuf;
637 sma = sem_lock(ns, semid);
642 if (ipcperms (&sma->sem_perm, S_IRUGO))
645 err = security_sem_semctl(sma, cmd);
649 id = sma->sem_perm.id;
651 memset(&tbuf, 0, sizeof(tbuf));
653 kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm);
654 tbuf.sem_otime = sma->sem_otime;
655 tbuf.sem_ctime = sma->sem_ctime;
656 tbuf.sem_nsems = sma->sem_nsems;
658 if (copy_semid_to_user (arg.buf, &tbuf, version))
671 static int semctl_main(struct ipc_namespace *ns, int semid, int semnum,
672 int cmd, int version, union semun arg)
674 struct sem_array *sma;
677 ushort fast_sem_io[SEMMSL_FAST];
678 ushort* sem_io = fast_sem_io;
681 sma = sem_lock_check(ns, semid);
685 nsems = sma->sem_nsems;
688 if (ipcperms (&sma->sem_perm, (cmd==SETVAL||cmd==SETALL)?S_IWUGO:S_IRUGO))
691 err = security_sem_semctl(sma, cmd);
699 ushort __user *array = arg.array;
702 if(nsems > SEMMSL_FAST) {
706 sem_io = ipc_alloc(sizeof(ushort)*nsems);
708 ipc_lock_by_ptr(&sma->sem_perm);
714 ipc_lock_by_ptr(&sma->sem_perm);
716 if (sma->sem_perm.deleted) {
723 for (i = 0; i < sma->sem_nsems; i++)
724 sem_io[i] = sma->sem_base[i].semval;
727 if(copy_to_user(array, sem_io, nsems*sizeof(ushort)))
739 if(nsems > SEMMSL_FAST) {
740 sem_io = ipc_alloc(sizeof(ushort)*nsems);
742 ipc_lock_by_ptr(&sma->sem_perm);
749 if (copy_from_user (sem_io, arg.array, nsems*sizeof(ushort))) {
750 ipc_lock_by_ptr(&sma->sem_perm);
757 for (i = 0; i < nsems; i++) {
758 if (sem_io[i] > SEMVMX) {
759 ipc_lock_by_ptr(&sma->sem_perm);
766 ipc_lock_by_ptr(&sma->sem_perm);
768 if (sma->sem_perm.deleted) {
774 for (i = 0; i < nsems; i++)
775 sma->sem_base[i].semval = sem_io[i];
776 for (un = sma->undo; un; un = un->id_next)
777 for (i = 0; i < nsems; i++)
779 sma->sem_ctime = get_seconds();
780 /* maybe some queued-up processes were waiting for this */
787 struct semid64_ds tbuf;
788 memset(&tbuf,0,sizeof(tbuf));
789 kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm);
790 tbuf.sem_otime = sma->sem_otime;
791 tbuf.sem_ctime = sma->sem_ctime;
792 tbuf.sem_nsems = sma->sem_nsems;
794 if (copy_semid_to_user (arg.buf, &tbuf, version))
798 /* GETVAL, GETPID, GETNCTN, GETZCNT, SETVAL: fall-through */
801 if(semnum < 0 || semnum >= nsems)
804 curr = &sma->sem_base[semnum];
814 err = count_semncnt(sma,semnum);
817 err = count_semzcnt(sma,semnum);
824 if (val > SEMVMX || val < 0)
827 for (un = sma->undo; un; un = un->id_next)
828 un->semadj[semnum] = 0;
830 curr->sempid = task_tgid_vnr(current);
831 sma->sem_ctime = get_seconds();
832 /* maybe some queued-up processes were waiting for this */
841 if(sem_io != fast_sem_io)
842 ipc_free(sem_io, sizeof(ushort)*nsems);
852 static inline unsigned long copy_semid_from_user(struct sem_setbuf *out, void __user *buf, int version)
857 struct semid64_ds tbuf;
859 if(copy_from_user(&tbuf, buf, sizeof(tbuf)))
862 out->uid = tbuf.sem_perm.uid;
863 out->gid = tbuf.sem_perm.gid;
864 out->mode = tbuf.sem_perm.mode;
870 struct semid_ds tbuf_old;
872 if(copy_from_user(&tbuf_old, buf, sizeof(tbuf_old)))
875 out->uid = tbuf_old.sem_perm.uid;
876 out->gid = tbuf_old.sem_perm.gid;
877 out->mode = tbuf_old.sem_perm.mode;
886 static int semctl_down(struct ipc_namespace *ns, int semid, int semnum,
887 int cmd, int version, union semun arg)
889 struct sem_array *sma;
891 struct sem_setbuf uninitialized_var(setbuf);
892 struct kern_ipc_perm *ipcp;
895 if(copy_semid_from_user (&setbuf, arg.buf, version))
898 sma = sem_lock_check(ns, semid);
902 ipcp = &sma->sem_perm;
904 err = audit_ipc_obj(ipcp);
908 if (cmd == IPC_SET) {
909 err = audit_ipc_set_perm(0, setbuf.uid, setbuf.gid, setbuf.mode);
913 if (current->euid != ipcp->cuid &&
914 current->euid != ipcp->uid && !capable(CAP_SYS_ADMIN)) {
919 err = security_sem_semctl(sma, cmd);
929 ipcp->uid = setbuf.uid;
930 ipcp->gid = setbuf.gid;
931 ipcp->mode = (ipcp->mode & ~S_IRWXUGO)
932 | (setbuf.mode & S_IRWXUGO);
933 sma->sem_ctime = get_seconds();
949 asmlinkage long sys_semctl (int semid, int semnum, int cmd, union semun arg)
953 struct ipc_namespace *ns;
958 version = ipc_parse_version(&cmd);
959 ns = current->nsproxy->ipc_ns;
965 err = semctl_nolock(ns,semid,semnum,cmd,version,arg);
975 err = semctl_main(ns,semid,semnum,cmd,version,arg);
979 mutex_lock(&sem_ids(ns).mutex);
980 err = semctl_down(ns,semid,semnum,cmd,version,arg);
981 mutex_unlock(&sem_ids(ns).mutex);
988 static inline void lock_semundo(void)
990 struct sem_undo_list *undo_list;
992 undo_list = current->sysvsem.undo_list;
994 spin_lock(&undo_list->lock);
997 /* This code has an interaction with copy_semundo().
998 * Consider; two tasks are sharing the undo_list. task1
999 * acquires the undo_list lock in lock_semundo(). If task2 now
1000 * exits before task1 releases the lock (by calling
1001 * unlock_semundo()), then task1 will never call spin_unlock().
1002 * This leave the sem_undo_list in a locked state. If task1 now creats task3
1003 * and once again shares the sem_undo_list, the sem_undo_list will still be
1004 * locked, and future SEM_UNDO operations will deadlock. This case is
1005 * dealt with in copy_semundo() by having it reinitialize the spin lock when
1006 * the refcnt goes from 1 to 2.
1008 static inline void unlock_semundo(void)
1010 struct sem_undo_list *undo_list;
1012 undo_list = current->sysvsem.undo_list;
1014 spin_unlock(&undo_list->lock);
1018 /* If the task doesn't already have a undo_list, then allocate one
1019 * here. We guarantee there is only one thread using this undo list,
1020 * and current is THE ONE
1022 * If this allocation and assignment succeeds, but later
1023 * portions of this code fail, there is no need to free the sem_undo_list.
1024 * Just let it stay associated with the task, and it'll be freed later
1027 * This can block, so callers must hold no locks.
1029 static inline int get_undo_list(struct sem_undo_list **undo_listp)
1031 struct sem_undo_list *undo_list;
1033 undo_list = current->sysvsem.undo_list;
1035 undo_list = kzalloc(sizeof(*undo_list), GFP_KERNEL);
1036 if (undo_list == NULL)
1038 spin_lock_init(&undo_list->lock);
1039 atomic_set(&undo_list->refcnt, 1);
1040 current->sysvsem.undo_list = undo_list;
1042 *undo_listp = undo_list;
1046 static struct sem_undo *lookup_undo(struct sem_undo_list *ulp, int semid)
1048 struct sem_undo **last, *un;
1050 last = &ulp->proc_list;
1053 if(un->semid==semid)
1056 *last=un->proc_next;
1059 last=&un->proc_next;
1066 static struct sem_undo *find_undo(struct ipc_namespace *ns, int semid)
1068 struct sem_array *sma;
1069 struct sem_undo_list *ulp;
1070 struct sem_undo *un, *new;
1074 error = get_undo_list(&ulp);
1076 return ERR_PTR(error);
1079 un = lookup_undo(ulp, semid);
1081 if (likely(un!=NULL))
1084 /* no undo structure around - allocate one. */
1085 sma = sem_lock_check(ns, semid);
1087 return ERR_PTR(PTR_ERR(sma));
1089 nsems = sma->sem_nsems;
1090 ipc_rcu_getref(sma);
1093 new = kzalloc(sizeof(struct sem_undo) + sizeof(short)*nsems, GFP_KERNEL);
1095 ipc_lock_by_ptr(&sma->sem_perm);
1096 ipc_rcu_putref(sma);
1098 return ERR_PTR(-ENOMEM);
1100 new->semadj = (short *) &new[1];
1104 un = lookup_undo(ulp, semid);
1108 ipc_lock_by_ptr(&sma->sem_perm);
1109 ipc_rcu_putref(sma);
1113 ipc_lock_by_ptr(&sma->sem_perm);
1114 ipc_rcu_putref(sma);
1115 if (sma->sem_perm.deleted) {
1119 un = ERR_PTR(-EIDRM);
1122 new->proc_next = ulp->proc_list;
1123 ulp->proc_list = new;
1124 new->id_next = sma->undo;
1133 asmlinkage long sys_semtimedop(int semid, struct sembuf __user *tsops,
1134 unsigned nsops, const struct timespec __user *timeout)
1136 int error = -EINVAL;
1137 struct sem_array *sma;
1138 struct sembuf fast_sops[SEMOPM_FAST];
1139 struct sembuf* sops = fast_sops, *sop;
1140 struct sem_undo *un;
1141 int undos = 0, alter = 0, max;
1142 struct sem_queue queue;
1143 unsigned long jiffies_left = 0;
1144 struct ipc_namespace *ns;
1146 ns = current->nsproxy->ipc_ns;
1148 if (nsops < 1 || semid < 0)
1150 if (nsops > ns->sc_semopm)
1152 if(nsops > SEMOPM_FAST) {
1153 sops = kmalloc(sizeof(*sops)*nsops,GFP_KERNEL);
1157 if (copy_from_user (sops, tsops, nsops * sizeof(*tsops))) {
1162 struct timespec _timeout;
1163 if (copy_from_user(&_timeout, timeout, sizeof(*timeout))) {
1167 if (_timeout.tv_sec < 0 || _timeout.tv_nsec < 0 ||
1168 _timeout.tv_nsec >= 1000000000L) {
1172 jiffies_left = timespec_to_jiffies(&_timeout);
1175 for (sop = sops; sop < sops + nsops; sop++) {
1176 if (sop->sem_num >= max)
1178 if (sop->sem_flg & SEM_UNDO)
1180 if (sop->sem_op != 0)
1186 un = find_undo(ns, semid);
1188 error = PTR_ERR(un);
1194 sma = sem_lock_check(ns, semid);
1196 error = PTR_ERR(sma);
1201 * semid identifiers are not unique - find_undo may have
1202 * allocated an undo structure, it was invalidated by an RMID
1203 * and now a new array with received the same id. Check and retry.
1205 if (un && un->semid == -1) {
1210 if (max >= sma->sem_nsems)
1211 goto out_unlock_free;
1214 if (ipcperms(&sma->sem_perm, alter ? S_IWUGO : S_IRUGO))
1215 goto out_unlock_free;
1217 error = security_sem_semop(sma, sops, nsops, alter);
1219 goto out_unlock_free;
1221 error = try_atomic_semop (sma, sops, nsops, un, task_tgid_vnr(current));
1223 if (alter && error == 0)
1225 goto out_unlock_free;
1228 /* We need to sleep on this operation, so we put the current
1229 * task into the pending queue and go to sleep.
1234 queue.nsops = nsops;
1236 queue.pid = task_tgid_vnr(current);
1238 queue.alter = alter;
1240 append_to_queue(sma ,&queue);
1242 prepend_to_queue(sma ,&queue);
1244 queue.status = -EINTR;
1245 queue.sleeper = current;
1246 current->state = TASK_INTERRUPTIBLE;
1250 jiffies_left = schedule_timeout(jiffies_left);
1254 error = queue.status;
1255 while(unlikely(error == IN_WAKEUP)) {
1257 error = queue.status;
1260 if (error != -EINTR) {
1261 /* fast path: update_queue already obtained all requested
1266 sma = sem_lock(ns, semid);
1268 BUG_ON(queue.prev != NULL);
1274 * If queue.status != -EINTR we are woken up by another process
1276 error = queue.status;
1277 if (error != -EINTR) {
1278 goto out_unlock_free;
1282 * If an interrupt occurred we have to clean up the queue
1284 if (timeout && jiffies_left == 0)
1286 remove_from_queue(sma,&queue);
1287 goto out_unlock_free;
1292 if(sops != fast_sops)
1297 asmlinkage long sys_semop (int semid, struct sembuf __user *tsops, unsigned nsops)
1299 return sys_semtimedop(semid, tsops, nsops, NULL);
1302 /* If CLONE_SYSVSEM is set, establish sharing of SEM_UNDO state between
1303 * parent and child tasks.
1305 * See the notes above unlock_semundo() regarding the spin_lock_init()
1306 * in this code. Initialize the undo_list->lock here instead of get_undo_list()
1307 * because of the reasoning in the comment above unlock_semundo.
1310 int copy_semundo(unsigned long clone_flags, struct task_struct *tsk)
1312 struct sem_undo_list *undo_list;
1315 if (clone_flags & CLONE_SYSVSEM) {
1316 error = get_undo_list(&undo_list);
1319 atomic_inc(&undo_list->refcnt);
1320 tsk->sysvsem.undo_list = undo_list;
1322 tsk->sysvsem.undo_list = NULL;
1328 * add semadj values to semaphores, free undo structures.
1329 * undo structures are not freed when semaphore arrays are destroyed
1330 * so some of them may be out of date.
1331 * IMPLEMENTATION NOTE: There is some confusion over whether the
1332 * set of adjustments that needs to be done should be done in an atomic
1333 * manner or not. That is, if we are attempting to decrement the semval
1334 * should we queue up and wait until we can do so legally?
1335 * The original implementation attempted to do this (queue and wait).
1336 * The current implementation does not do so. The POSIX standard
1337 * and SVID should be consulted to determine what behavior is mandated.
1339 void exit_sem(struct task_struct *tsk)
1341 struct sem_undo_list *undo_list;
1342 struct sem_undo *u, **up;
1343 struct ipc_namespace *ns;
1345 undo_list = tsk->sysvsem.undo_list;
1349 if (!atomic_dec_and_test(&undo_list->refcnt))
1352 ns = tsk->nsproxy->ipc_ns;
1353 /* There's no need to hold the semundo list lock, as current
1354 * is the last task exiting for this undo list.
1356 for (up = &undo_list->proc_list; (u = *up); *up = u->proc_next, kfree(u)) {
1357 struct sem_array *sma;
1359 struct sem_undo *un, **unp;
1366 sma = sem_lock(ns, semid);
1373 BUG_ON(sem_checkid(ns,sma,u->semid));
1375 /* remove u from the sma->undo list */
1376 for (unp = &sma->undo; (un = *unp); unp = &un->id_next) {
1380 printk ("exit_sem undo list error id=%d\n", u->semid);
1384 /* perform adjustments registered in u */
1385 nsems = sma->sem_nsems;
1386 for (i = 0; i < nsems; i++) {
1387 struct sem * semaphore = &sma->sem_base[i];
1389 semaphore->semval += u->semadj[i];
1391 * Range checks of the new semaphore value,
1392 * not defined by sus:
1393 * - Some unices ignore the undo entirely
1394 * (e.g. HP UX 11i 11.22, Tru64 V5.1)
1395 * - some cap the value (e.g. FreeBSD caps
1396 * at 0, but doesn't enforce SEMVMX)
1398 * Linux caps the semaphore value, both at 0
1401 * Manfred <manfred@colorfullife.com>
1403 if (semaphore->semval < 0)
1404 semaphore->semval = 0;
1405 if (semaphore->semval > SEMVMX)
1406 semaphore->semval = SEMVMX;
1407 semaphore->sempid = task_tgid_vnr(current);
1410 sma->sem_otime = get_seconds();
1411 /* maybe some queued-up processes were waiting for this */
1419 #ifdef CONFIG_PROC_FS
1420 static int sysvipc_sem_proc_show(struct seq_file *s, void *it)
1422 struct sem_array *sma = it;
1424 return seq_printf(s,
1425 "%10d %10d %4o %10lu %5u %5u %5u %5u %10lu %10lu\n",