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 <manfreds@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>
66 #include <linux/config.h>
67 #include <linux/slab.h>
68 #include <linux/spinlock.h>
69 #include <linux/init.h>
70 #include <linux/proc_fs.h>
71 #include <linux/time.h>
72 #include <linux/smp_lock.h>
73 #include <linux/security.h>
74 #include <linux/vs_base.h>
76 #include <asm/uaccess.h>
80 #define sem_lock(id) ((struct sem_array*)ipc_lock(&sem_ids,id))
81 #define sem_unlock(sma) ipc_unlock(&(sma)->sem_perm)
82 #define sem_rmid(id) ((struct sem_array*)ipc_rmid(&sem_ids,id))
83 #define sem_checkid(sma, semid) \
84 ipc_checkid(&sem_ids,&sma->sem_perm,semid)
85 #define sem_buildid(id, seq) \
86 ipc_buildid(&sem_ids, id, seq)
87 static struct ipc_ids sem_ids;
89 static int newary (key_t, int, int);
90 static void freeary (struct sem_array *sma, int id);
92 static int sysvipc_sem_read_proc(char *buffer, char **start, off_t offset, int length, int *eof, void *data);
95 #define SEMMSL_FAST 256 /* 512 bytes on stack */
96 #define SEMOPM_FAST 64 /* ~ 372 bytes on stack */
99 * linked list protection:
101 * sem_array.sem_pending{,last},
102 * sem_array.sem_undo: sem_lock() for read/write
103 * sem_undo.proc_next: only "current" is allowed to read/write that field.
107 int sem_ctls[4] = {SEMMSL, SEMMNS, SEMOPM, SEMMNI};
108 #define sc_semmsl (sem_ctls[0])
109 #define sc_semmns (sem_ctls[1])
110 #define sc_semopm (sem_ctls[2])
111 #define sc_semmni (sem_ctls[3])
113 static int used_sems;
115 void __init sem_init (void)
118 ipc_init_ids(&sem_ids,sc_semmni);
120 #ifdef CONFIG_PROC_FS
121 create_proc_read_entry("sysvipc/sem", 0, NULL, sysvipc_sem_read_proc, NULL);
126 * Lockless wakeup algorithm:
127 * Without the check/retry algorithm a lockless wakeup is possible:
128 * - queue.status is initialized to -EINTR before blocking.
129 * - wakeup is performed by
130 * * unlinking the queue entry from sma->sem_pending
131 * * setting queue.status to IN_WAKEUP
132 * This is the notification for the blocked thread that a
133 * result value is imminent.
134 * * call wake_up_process
135 * * set queue.status to the final value.
136 * - the previously blocked thread checks queue.status:
137 * * if it's IN_WAKEUP, then it must wait until the value changes
138 * * if it's not -EINTR, then the operation was completed by
139 * update_queue. semtimedop can return queue.status without
140 * performing any operation on the semaphore array.
141 * * otherwise it must acquire the spinlock and check what's up.
143 * The two-stage algorithm is necessary to protect against the following
145 * - if queue.status is set after wake_up_process, then the woken up idle
146 * thread could race forward and try (and fail) to acquire sma->lock
147 * before update_queue had a chance to set queue.status
148 * - if queue.status is written before wake_up_process and if the
149 * blocked process is woken up by a signal between writing
150 * queue.status and the wake_up_process, then the woken up
151 * process could return from semtimedop and die by calling
152 * sys_exit before wake_up_process is called. Then wake_up_process
153 * will oops, because the task structure is already invalid.
154 * (yes, this happened on s390 with sysv msg).
159 static int newary (key_t key, int nsems, int semflg)
163 struct sem_array *sma;
168 if (used_sems + nsems > sc_semmns)
171 size = sizeof (*sma) + nsems * sizeof (struct sem);
172 sma = ipc_rcu_alloc(size);
176 memset (sma, 0, size);
178 sma->sem_perm.mode = (semflg & S_IRWXUGO);
179 sma->sem_perm.key = key;
180 sma->sem_perm.xid = current->xid;
182 sma->sem_perm.security = NULL;
183 retval = security_sem_alloc(sma);
189 id = ipc_addid(&sem_ids, &sma->sem_perm, sc_semmni);
191 security_sem_free(sma);
197 sma->sem_base = (struct sem *) &sma[1];
198 /* sma->sem_pending = NULL; */
199 sma->sem_pending_last = &sma->sem_pending;
200 /* sma->undo = NULL; */
201 sma->sem_nsems = nsems;
202 sma->sem_ctime = get_seconds();
205 return sem_buildid(id, sma->sem_perm.seq);
208 asmlinkage long sys_semget (key_t key, int nsems, int semflg)
210 int id, err = -EINVAL;
211 struct sem_array *sma;
213 if (nsems < 0 || nsems > sc_semmsl)
217 if (key == IPC_PRIVATE) {
218 err = newary(key, nsems, semflg);
219 } else if ((id = ipc_findkey(&sem_ids, key)) == -1) { /* key not used */
220 if (!(semflg & IPC_CREAT))
223 err = newary(key, nsems, semflg);
224 } else if (semflg & IPC_CREAT && semflg & IPC_EXCL) {
230 if (nsems > sma->sem_nsems)
232 else if (ipcperms(&sma->sem_perm, semflg))
235 int semid = sem_buildid(id, sma->sem_perm.seq);
236 err = security_sem_associate(sma, semflg);
247 /* Manage the doubly linked list sma->sem_pending as a FIFO:
248 * insert new queue elements at the tail sma->sem_pending_last.
250 static inline void append_to_queue (struct sem_array * sma,
251 struct sem_queue * q)
253 *(q->prev = sma->sem_pending_last) = q;
254 *(sma->sem_pending_last = &q->next) = NULL;
257 static inline void prepend_to_queue (struct sem_array * sma,
258 struct sem_queue * q)
260 q->next = sma->sem_pending;
261 *(q->prev = &sma->sem_pending) = q;
263 q->next->prev = &q->next;
264 else /* sma->sem_pending_last == &sma->sem_pending */
265 sma->sem_pending_last = &q->next;
268 static inline void remove_from_queue (struct sem_array * sma,
269 struct sem_queue * q)
271 *(q->prev) = q->next;
273 q->next->prev = q->prev;
274 else /* sma->sem_pending_last == &q->next */
275 sma->sem_pending_last = q->prev;
276 q->prev = NULL; /* mark as removed */
280 * Determine whether a sequence of semaphore operations would succeed
281 * all at once. Return 0 if yes, 1 if need to sleep, else return error code.
284 static int try_atomic_semop (struct sem_array * sma, struct sembuf * sops,
285 int nsops, struct sem_undo *un, int pid)
291 for (sop = sops; sop < sops + nsops; sop++) {
292 curr = sma->sem_base + sop->sem_num;
293 sem_op = sop->sem_op;
294 result = curr->semval;
296 if (!sem_op && result)
304 if (sop->sem_flg & SEM_UNDO) {
305 int undo = un->semadj[sop->sem_num] - sem_op;
307 * Exceeding the undo range is an error.
309 if (undo < (-SEMAEM - 1) || undo > SEMAEM)
312 curr->semval = result;
316 while (sop >= sops) {
317 sma->sem_base[sop->sem_num].sempid = pid;
318 if (sop->sem_flg & SEM_UNDO)
319 un->semadj[sop->sem_num] -= sop->sem_op;
323 sma->sem_otime = get_seconds();
331 if (sop->sem_flg & IPC_NOWAIT)
338 while (sop >= sops) {
339 sma->sem_base[sop->sem_num].semval -= sop->sem_op;
346 /* Go through the pending queue for the indicated semaphore
347 * looking for tasks that can be completed.
349 static void update_queue (struct sem_array * sma)
352 struct sem_queue * q;
354 q = sma->sem_pending;
356 error = try_atomic_semop(sma, q->sops, q->nsops,
359 /* Does q->sleeper still need to sleep? */
362 remove_from_queue(sma,q);
364 q->status = IN_WAKEUP;
365 wake_up_process(q->sleeper);
366 /* hands-off: q will disappear immediately after
377 /* The following counts are associated to each semaphore:
378 * semncnt number of tasks waiting on semval being nonzero
379 * semzcnt number of tasks waiting on semval being zero
380 * This model assumes that a task waits on exactly one semaphore.
381 * Since semaphore operations are to be performed atomically, tasks actually
382 * wait on a whole sequence of semaphores simultaneously.
383 * The counts we return here are a rough approximation, but still
384 * warrant that semncnt+semzcnt>0 if the task is on the pending queue.
386 static int count_semncnt (struct sem_array * sma, ushort semnum)
389 struct sem_queue * q;
392 for (q = sma->sem_pending; q; q = q->next) {
393 struct sembuf * sops = q->sops;
394 int nsops = q->nsops;
396 for (i = 0; i < nsops; i++)
397 if (sops[i].sem_num == semnum
398 && (sops[i].sem_op < 0)
399 && !(sops[i].sem_flg & IPC_NOWAIT))
404 static int count_semzcnt (struct sem_array * sma, ushort semnum)
407 struct sem_queue * q;
410 for (q = sma->sem_pending; q; q = q->next) {
411 struct sembuf * sops = q->sops;
412 int nsops = q->nsops;
414 for (i = 0; i < nsops; i++)
415 if (sops[i].sem_num == semnum
416 && (sops[i].sem_op == 0)
417 && !(sops[i].sem_flg & IPC_NOWAIT))
423 /* Free a semaphore set. freeary() is called with sem_ids.sem down and
424 * the spinlock for this semaphore set hold. sem_ids.sem remains locked
427 static void freeary (struct sem_array *sma, int id)
433 /* Invalidate the existing undo structures for this semaphore set.
434 * (They will be freed without any further action in exit_sem()
435 * or during the next semop.)
437 for (un = sma->undo; un; un = un->id_next)
440 /* Wake up all pending processes and let them fail with EIDRM. */
441 q = sma->sem_pending;
444 /* lazy remove_from_queue: we are killing the whole queue */
447 q->status = IN_WAKEUP;
448 wake_up_process(q->sleeper); /* doesn't sleep */
449 q->status = -EIDRM; /* hands-off q */
453 /* Remove the semaphore set from the ID array*/
457 used_sems -= sma->sem_nsems;
458 size = sizeof (*sma) + sma->sem_nsems * sizeof (struct sem);
459 security_sem_free(sma);
463 static unsigned long copy_semid_to_user(void __user *buf, struct semid64_ds *in, int version)
467 return copy_to_user(buf, in, sizeof(*in));
472 ipc64_perm_to_ipc_perm(&in->sem_perm, &out.sem_perm);
474 out.sem_otime = in->sem_otime;
475 out.sem_ctime = in->sem_ctime;
476 out.sem_nsems = in->sem_nsems;
478 return copy_to_user(buf, &out, sizeof(out));
485 static int semctl_nolock(int semid, int semnum, int cmd, int version, union semun arg)
488 struct sem_array *sma;
494 struct seminfo seminfo;
497 err = security_sem_semctl(NULL, cmd);
501 memset(&seminfo,0,sizeof(seminfo));
502 seminfo.semmni = sc_semmni;
503 seminfo.semmns = sc_semmns;
504 seminfo.semmsl = sc_semmsl;
505 seminfo.semopm = sc_semopm;
506 seminfo.semvmx = SEMVMX;
507 seminfo.semmnu = SEMMNU;
508 seminfo.semmap = SEMMAP;
509 seminfo.semume = SEMUME;
511 if (cmd == SEM_INFO) {
512 seminfo.semusz = sem_ids.in_use;
513 seminfo.semaem = used_sems;
515 seminfo.semusz = SEMUSZ;
516 seminfo.semaem = SEMAEM;
518 max_id = sem_ids.max_id;
520 if (copy_to_user (arg.__buf, &seminfo, sizeof(struct seminfo)))
522 return (max_id < 0) ? 0: max_id;
526 struct semid64_ds tbuf;
529 if(semid >= sem_ids.size)
532 memset(&tbuf,0,sizeof(tbuf));
534 sma = sem_lock(semid);
539 if (ipcperms (&sma->sem_perm, S_IRUGO))
542 err = security_sem_semctl(sma, cmd);
546 id = sem_buildid(semid, sma->sem_perm.seq);
548 kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm);
549 tbuf.sem_otime = sma->sem_otime;
550 tbuf.sem_ctime = sma->sem_ctime;
551 tbuf.sem_nsems = sma->sem_nsems;
553 if (copy_semid_to_user (arg.buf, &tbuf, version))
566 static int semctl_main(int semid, int semnum, int cmd, int version, union semun arg)
568 struct sem_array *sma;
571 ushort fast_sem_io[SEMMSL_FAST];
572 ushort* sem_io = fast_sem_io;
575 sma = sem_lock(semid);
579 nsems = sma->sem_nsems;
582 if (sem_checkid(sma,semid))
586 if (ipcperms (&sma->sem_perm, (cmd==SETVAL||cmd==SETALL)?S_IWUGO:S_IRUGO))
589 err = security_sem_semctl(sma, cmd);
597 ushort __user *array = arg.array;
600 if(nsems > SEMMSL_FAST) {
604 sem_io = ipc_alloc(sizeof(ushort)*nsems);
606 ipc_lock_by_ptr(&sma->sem_perm);
612 ipc_lock_by_ptr(&sma->sem_perm);
614 if (sma->sem_perm.deleted) {
621 for (i = 0; i < sma->sem_nsems; i++)
622 sem_io[i] = sma->sem_base[i].semval;
625 if(copy_to_user(array, sem_io, nsems*sizeof(ushort)))
637 if(nsems > SEMMSL_FAST) {
638 sem_io = ipc_alloc(sizeof(ushort)*nsems);
640 ipc_lock_by_ptr(&sma->sem_perm);
647 if (copy_from_user (sem_io, arg.array, nsems*sizeof(ushort))) {
648 ipc_lock_by_ptr(&sma->sem_perm);
655 for (i = 0; i < nsems; i++) {
656 if (sem_io[i] > SEMVMX) {
657 ipc_lock_by_ptr(&sma->sem_perm);
664 ipc_lock_by_ptr(&sma->sem_perm);
666 if (sma->sem_perm.deleted) {
672 for (i = 0; i < nsems; i++)
673 sma->sem_base[i].semval = sem_io[i];
674 for (un = sma->undo; un; un = un->id_next)
675 for (i = 0; i < nsems; i++)
677 sma->sem_ctime = get_seconds();
678 /* maybe some queued-up processes were waiting for this */
685 struct semid64_ds tbuf;
686 memset(&tbuf,0,sizeof(tbuf));
687 kernel_to_ipc64_perm(&sma->sem_perm, &tbuf.sem_perm);
688 tbuf.sem_otime = sma->sem_otime;
689 tbuf.sem_ctime = sma->sem_ctime;
690 tbuf.sem_nsems = sma->sem_nsems;
692 if (copy_semid_to_user (arg.buf, &tbuf, version))
696 /* GETVAL, GETPID, GETNCTN, GETZCNT, SETVAL: fall-through */
699 if(semnum < 0 || semnum >= nsems)
702 curr = &sma->sem_base[semnum];
712 err = count_semncnt(sma,semnum);
715 err = count_semzcnt(sma,semnum);
722 if (val > SEMVMX || val < 0)
725 for (un = sma->undo; un; un = un->id_next)
726 un->semadj[semnum] = 0;
728 curr->sempid = current->tgid;
729 sma->sem_ctime = get_seconds();
730 /* maybe some queued-up processes were waiting for this */
739 if(sem_io != fast_sem_io)
740 ipc_free(sem_io, sizeof(ushort)*nsems);
750 static inline unsigned long copy_semid_from_user(struct sem_setbuf *out, void __user *buf, int version)
755 struct semid64_ds tbuf;
757 if(copy_from_user(&tbuf, buf, sizeof(tbuf)))
760 out->uid = tbuf.sem_perm.uid;
761 out->gid = tbuf.sem_perm.gid;
762 out->mode = tbuf.sem_perm.mode;
768 struct semid_ds tbuf_old;
770 if(copy_from_user(&tbuf_old, buf, sizeof(tbuf_old)))
773 out->uid = tbuf_old.sem_perm.uid;
774 out->gid = tbuf_old.sem_perm.gid;
775 out->mode = tbuf_old.sem_perm.mode;
784 static int semctl_down(int semid, int semnum, int cmd, int version, union semun arg)
786 struct sem_array *sma;
788 struct sem_setbuf setbuf;
789 struct kern_ipc_perm *ipcp;
792 if(copy_semid_from_user (&setbuf, arg.buf, version))
795 sma = sem_lock(semid);
799 if (sem_checkid(sma,semid)) {
803 ipcp = &sma->sem_perm;
805 if (current->euid != ipcp->cuid &&
806 current->euid != ipcp->uid && !capable(CAP_SYS_ADMIN)) {
811 err = security_sem_semctl(sma, cmd);
821 ipcp->uid = setbuf.uid;
822 ipcp->gid = setbuf.gid;
823 ipcp->mode = (ipcp->mode & ~S_IRWXUGO)
824 | (setbuf.mode & S_IRWXUGO);
825 sma->sem_ctime = get_seconds();
841 asmlinkage long sys_semctl (int semid, int semnum, int cmd, union semun arg)
849 version = ipc_parse_version(&cmd);
855 err = semctl_nolock(semid,semnum,cmd,version,arg);
865 err = semctl_main(semid,semnum,cmd,version,arg);
870 err = semctl_down(semid,semnum,cmd,version,arg);
878 static inline void lock_semundo(void)
880 struct sem_undo_list *undo_list;
882 undo_list = current->sysvsem.undo_list;
883 if ((undo_list != NULL) && (atomic_read(&undo_list->refcnt) != 1))
884 spin_lock(&undo_list->lock);
887 /* This code has an interaction with copy_semundo().
888 * Consider; two tasks are sharing the undo_list. task1
889 * acquires the undo_list lock in lock_semundo(). If task2 now
890 * exits before task1 releases the lock (by calling
891 * unlock_semundo()), then task1 will never call spin_unlock().
892 * This leave the sem_undo_list in a locked state. If task1 now creats task3
893 * and once again shares the sem_undo_list, the sem_undo_list will still be
894 * locked, and future SEM_UNDO operations will deadlock. This case is
895 * dealt with in copy_semundo() by having it reinitialize the spin lock when
896 * the refcnt goes from 1 to 2.
898 static inline void unlock_semundo(void)
900 struct sem_undo_list *undo_list;
902 undo_list = current->sysvsem.undo_list;
903 if ((undo_list != NULL) && (atomic_read(&undo_list->refcnt) != 1))
904 spin_unlock(&undo_list->lock);
908 /* If the task doesn't already have a undo_list, then allocate one
909 * here. We guarantee there is only one thread using this undo list,
910 * and current is THE ONE
912 * If this allocation and assignment succeeds, but later
913 * portions of this code fail, there is no need to free the sem_undo_list.
914 * Just let it stay associated with the task, and it'll be freed later
917 * This can block, so callers must hold no locks.
919 static inline int get_undo_list(struct sem_undo_list **undo_listp)
921 struct sem_undo_list *undo_list;
924 undo_list = current->sysvsem.undo_list;
926 size = sizeof(struct sem_undo_list);
927 undo_list = (struct sem_undo_list *) kmalloc(size, GFP_KERNEL);
928 if (undo_list == NULL)
930 memset(undo_list, 0, size);
931 /* don't initialize unodhd->lock here. It's done
932 * in copy_semundo() instead.
934 atomic_set(&undo_list->refcnt, 1);
935 current->sysvsem.undo_list = undo_list;
937 *undo_listp = undo_list;
941 static struct sem_undo *lookup_undo(struct sem_undo_list *ulp, int semid)
943 struct sem_undo **last, *un;
945 last = &ulp->proc_list;
961 static struct sem_undo *find_undo(int semid)
963 struct sem_array *sma;
964 struct sem_undo_list *ulp;
965 struct sem_undo *un, *new;
969 error = get_undo_list(&ulp);
971 return ERR_PTR(error);
974 un = lookup_undo(ulp, semid);
976 if (likely(un!=NULL))
979 /* no undo structure around - allocate one. */
980 sma = sem_lock(semid);
981 un = ERR_PTR(-EINVAL);
984 un = ERR_PTR(-EIDRM);
985 if (sem_checkid(sma,semid)) {
989 nsems = sma->sem_nsems;
993 new = (struct sem_undo *) kmalloc(sizeof(struct sem_undo) + sizeof(short)*nsems, GFP_KERNEL);
995 ipc_lock_by_ptr(&sma->sem_perm);
998 return ERR_PTR(-ENOMEM);
1000 memset(new, 0, sizeof(struct sem_undo) + sizeof(short)*nsems);
1001 new->semadj = (short *) &new[1];
1005 un = lookup_undo(ulp, semid);
1009 ipc_lock_by_ptr(&sma->sem_perm);
1010 ipc_rcu_putref(sma);
1014 ipc_lock_by_ptr(&sma->sem_perm);
1015 ipc_rcu_putref(sma);
1016 if (sma->sem_perm.deleted) {
1020 un = ERR_PTR(-EIDRM);
1023 new->proc_next = ulp->proc_list;
1024 ulp->proc_list = new;
1025 new->id_next = sma->undo;
1034 asmlinkage long sys_semtimedop(int semid, struct sembuf __user *tsops,
1035 unsigned nsops, const struct timespec __user *timeout)
1037 int error = -EINVAL;
1038 struct sem_array *sma;
1039 struct sembuf fast_sops[SEMOPM_FAST];
1040 struct sembuf* sops = fast_sops, *sop;
1041 struct sem_undo *un;
1042 int undos = 0, decrease = 0, alter = 0, max;
1043 struct sem_queue queue;
1044 unsigned long jiffies_left = 0;
1046 if (nsops < 1 || semid < 0)
1048 if (nsops > sc_semopm)
1050 if(nsops > SEMOPM_FAST) {
1051 sops = kmalloc(sizeof(*sops)*nsops,GFP_KERNEL);
1055 if (copy_from_user (sops, tsops, nsops * sizeof(*tsops))) {
1060 struct timespec _timeout;
1061 if (copy_from_user(&_timeout, timeout, sizeof(*timeout))) {
1065 if (_timeout.tv_sec < 0 || _timeout.tv_nsec < 0 ||
1066 _timeout.tv_nsec >= 1000000000L) {
1070 jiffies_left = timespec_to_jiffies(&_timeout);
1073 for (sop = sops; sop < sops + nsops; sop++) {
1074 if (sop->sem_num >= max)
1076 if (sop->sem_flg & SEM_UNDO)
1078 if (sop->sem_op < 0)
1080 if (sop->sem_op > 0)
1087 un = find_undo(semid);
1089 error = PTR_ERR(un);
1095 sma = sem_lock(semid);
1100 if (sem_checkid(sma,semid))
1101 goto out_unlock_free;
1103 * semid identifies are not unique - find_undo may have
1104 * allocated an undo structure, it was invalidated by an RMID
1105 * and now a new array with received the same id. Check and retry.
1107 if (un && un->semid == -1) {
1112 if (max >= sma->sem_nsems)
1113 goto out_unlock_free;
1116 if (ipcperms(&sma->sem_perm, alter ? S_IWUGO : S_IRUGO))
1117 goto out_unlock_free;
1119 error = security_sem_semop(sma, sops, nsops, alter);
1121 goto out_unlock_free;
1123 error = try_atomic_semop (sma, sops, nsops, un, current->tgid);
1127 /* We need to sleep on this operation, so we put the current
1128 * task into the pending queue and go to sleep.
1133 queue.nsops = nsops;
1135 queue.pid = current->tgid;
1138 append_to_queue(sma ,&queue);
1140 prepend_to_queue(sma ,&queue);
1142 queue.status = -EINTR;
1143 queue.sleeper = current;
1144 current->state = TASK_INTERRUPTIBLE;
1148 jiffies_left = schedule_timeout(jiffies_left);
1152 error = queue.status;
1153 while(unlikely(error == IN_WAKEUP)) {
1155 error = queue.status;
1158 if (error != -EINTR) {
1159 /* fast path: update_queue already obtained all requested
1164 sma = sem_lock(semid);
1166 if(queue.prev != NULL)
1173 * If queue.status != -EINTR we are woken up by another process
1175 error = queue.status;
1176 if (error != -EINTR) {
1177 goto out_unlock_free;
1181 * If an interrupt occurred we have to clean up the queue
1183 if (timeout && jiffies_left == 0)
1185 remove_from_queue(sma,&queue);
1186 goto out_unlock_free;
1194 if(sops != fast_sops)
1199 asmlinkage long sys_semop (int semid, struct sembuf __user *tsops, unsigned nsops)
1201 return sys_semtimedop(semid, tsops, nsops, NULL);
1204 /* If CLONE_SYSVSEM is set, establish sharing of SEM_UNDO state between
1205 * parent and child tasks.
1207 * See the notes above unlock_semundo() regarding the spin_lock_init()
1208 * in this code. Initialize the undo_list->lock here instead of get_undo_list()
1209 * because of the reasoning in the comment above unlock_semundo.
1212 int copy_semundo(unsigned long clone_flags, struct task_struct *tsk)
1214 struct sem_undo_list *undo_list;
1217 if (clone_flags & CLONE_SYSVSEM) {
1218 error = get_undo_list(&undo_list);
1221 if (atomic_read(&undo_list->refcnt) == 1)
1222 spin_lock_init(&undo_list->lock);
1223 atomic_inc(&undo_list->refcnt);
1224 tsk->sysvsem.undo_list = undo_list;
1226 tsk->sysvsem.undo_list = NULL;
1232 * add semadj values to semaphores, free undo structures.
1233 * undo structures are not freed when semaphore arrays are destroyed
1234 * so some of them may be out of date.
1235 * IMPLEMENTATION NOTE: There is some confusion over whether the
1236 * set of adjustments that needs to be done should be done in an atomic
1237 * manner or not. That is, if we are attempting to decrement the semval
1238 * should we queue up and wait until we can do so legally?
1239 * The original implementation attempted to do this (queue and wait).
1240 * The current implementation does not do so. The POSIX standard
1241 * and SVID should be consulted to determine what behavior is mandated.
1243 void exit_sem(struct task_struct *tsk)
1245 struct sem_undo_list *undo_list;
1246 struct sem_undo *u, **up;
1248 undo_list = tsk->sysvsem.undo_list;
1252 if (!atomic_dec_and_test(&undo_list->refcnt))
1255 /* There's no need to hold the semundo list lock, as current
1256 * is the last task exiting for this undo list.
1258 for (up = &undo_list->proc_list; (u = *up); *up = u->proc_next, kfree(u)) {
1259 struct sem_array *sma;
1261 struct sem_undo *un, **unp;
1268 sma = sem_lock(semid);
1275 BUG_ON(sem_checkid(sma,u->semid));
1277 /* remove u from the sma->undo list */
1278 for (unp = &sma->undo; (un = *unp); unp = &un->id_next) {
1282 printk ("exit_sem undo list error id=%d\n", u->semid);
1286 /* perform adjustments registered in u */
1287 nsems = sma->sem_nsems;
1288 for (i = 0; i < nsems; i++) {
1289 struct sem * sem = &sma->sem_base[i];
1291 sem->semval += u->semadj[i];
1293 * Range checks of the new semaphore value,
1294 * not defined by sus:
1295 * - Some unices ignore the undo entirely
1296 * (e.g. HP UX 11i 11.22, Tru64 V5.1)
1297 * - some cap the value (e.g. FreeBSD caps
1298 * at 0, but doesn't enforce SEMVMX)
1300 * Linux caps the semaphore value, both at 0
1303 * Manfred <manfred@colorfullife.com>
1305 if (sem->semval < 0)
1307 if (sem->semval > SEMVMX)
1308 sem->semval = SEMVMX;
1309 sem->sempid = current->tgid;
1312 sma->sem_otime = get_seconds();
1313 /* maybe some queued-up processes were waiting for this */
1321 #ifdef CONFIG_PROC_FS
1322 static int sysvipc_sem_read_proc(char *buffer, char **start, off_t offset, int length, int *eof, void *data)
1328 len += sprintf(buffer, " key semid perms nsems uid gid cuid cgid otime ctime\n");
1331 for(i = 0; i <= sem_ids.max_id; i++) {
1332 struct sem_array *sma;
1335 if (!vx_check(sma->sem_perm.xid, VX_IDENT)) {
1339 len += sprintf(buffer + len, "%10d %10d %4o %10lu %5u %5u %5u %5u %10lu %10lu\n",
1341 sem_buildid(i,sma->sem_perm.seq),
1357 if(pos > offset + length)
1364 *start = buffer + (offset - begin);
1365 len -= (offset - begin);