2 * Implementation of SVID semaphores
4 * Author: Daniel Boulet
6 * This software is provided ``AS IS'' without any warranties of any kind.
9 * Copyright (c) 2003-2005 McAfee, Inc.
10 * Copyright (c) 2016-2017 Robert N. M. Watson
11 * All rights reserved.
13 * This software was developed for the FreeBSD Project in part by McAfee
14 * Research, the Security Research Division of McAfee, Inc under DARPA/SPAWAR
15 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS research
18 * Portions of this software were developed by BAE Systems, the University of
19 * Cambridge Computer Laboratory, and Memorial University under DARPA/AFRL
20 * contract FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent
21 * Computing (TC) research program.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the above copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
32 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
33 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
36 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 #include <sys/cdefs.h>
46 __FBSDID("$FreeBSD$");
48 #include "opt_compat.h"
49 #include "opt_sysvipc.h"
51 #include <sys/param.h>
52 #include <sys/systm.h>
53 #include <sys/sysproto.h>
54 #include <sys/eventhandler.h>
55 #include <sys/kernel.h>
58 #include <sys/module.h>
59 #include <sys/mutex.h>
60 #include <sys/racct.h>
63 #include <sys/syscall.h>
64 #include <sys/syscallsubr.h>
65 #include <sys/sysent.h>
66 #include <sys/sysctl.h>
68 #include <sys/malloc.h>
71 #include <security/audit/audit.h>
72 #include <security/mac/mac_framework.h>
74 FEATURE(sysv_sem, "System V semaphores support");
76 static MALLOC_DEFINE(M_SEM, "sem", "SVID compatible semaphores");
79 #define DPRINTF(a) printf a
84 static int seminit(void);
85 static int sysvsem_modload(struct module *, int, void *);
86 static int semunload(void);
87 static void semexit_myhook(void *arg, struct proc *p);
88 static int sysctl_sema(SYSCTL_HANDLER_ARGS);
89 static int semvalid(int semid, struct prison *rpr,
90 struct semid_kernel *semakptr);
91 static void sem_remove(int semidx, struct ucred *cred);
92 static struct prison *sem_find_prison(struct ucred *);
93 static int sem_prison_cansee(struct prison *, struct semid_kernel *);
94 static int sem_prison_check(void *, void *);
95 static int sem_prison_set(void *, void *);
96 static int sem_prison_get(void *, void *);
97 static int sem_prison_remove(void *, void *);
98 static void sem_prison_cleanup(struct prison *);
100 #ifndef _SYS_SYSPROTO_H_
101 struct __semctl_args;
102 int __semctl(struct thread *td, struct __semctl_args *uap);
104 int semget(struct thread *td, struct semget_args *uap);
106 int semop(struct thread *td, struct semop_args *uap);
109 static struct sem_undo *semu_alloc(struct thread *td);
110 static int semundo_adjust(struct thread *td, struct sem_undo **supptr,
111 int semid, int semseq, int semnum, int adjval);
112 static void semundo_clear(int semid, int semnum);
114 static struct mtx sem_mtx; /* semaphore global lock */
115 static struct mtx sem_undo_mtx;
116 static int semtot = 0;
117 static struct semid_kernel *sema; /* semaphore id pool */
118 static struct mtx *sema_mtx; /* semaphore id pool mutexes*/
119 static struct sem *sem; /* semaphore pool */
120 LIST_HEAD(, sem_undo) semu_list; /* list of active undo structures */
121 LIST_HEAD(, sem_undo) semu_free_list; /* list of free undo structures */
122 static int *semu; /* undo structure pool */
123 static eventhandler_tag semexit_tag;
124 static unsigned sem_prison_slot; /* prison OSD slot */
126 #define SEMUNDO_MTX sem_undo_mtx
127 #define SEMUNDO_LOCK() mtx_lock(&SEMUNDO_MTX);
128 #define SEMUNDO_UNLOCK() mtx_unlock(&SEMUNDO_MTX);
129 #define SEMUNDO_LOCKASSERT(how) mtx_assert(&SEMUNDO_MTX, (how));
132 u_short semval; /* semaphore value */
133 pid_t sempid; /* pid of last operation */
134 u_short semncnt; /* # awaiting semval > cval */
135 u_short semzcnt; /* # awaiting semval = 0 */
139 * Undo structure (one per process)
142 LIST_ENTRY(sem_undo) un_next; /* ptr to next active undo structure */
143 struct proc *un_proc; /* owner of this structure */
144 short un_cnt; /* # of active entries */
146 short un_adjval; /* adjust on exit values */
147 short un_num; /* semaphore # */
148 int un_id; /* semid */
149 unsigned short un_seq;
150 } un_ent[1]; /* undo entries */
154 * Configuration parameters
157 #define SEMMNI 50 /* # of semaphore identifiers */
160 #define SEMMNS 340 /* # of semaphores in system */
163 #define SEMUME 50 /* max # of undo entries per process */
166 #define SEMMNU 150 /* # of undo structures in system */
169 /* shouldn't need tuning */
171 #define SEMMSL SEMMNS /* max # of semaphores per id */
174 #define SEMOPM 100 /* max # of operations per semop call */
177 #define SEMVMX 32767 /* semaphore maximum value */
178 #define SEMAEM 16384 /* adjust on exit max value */
181 * Due to the way semaphore memory is allocated, we have to ensure that
182 * SEMUSZ is properly aligned.
185 #define SEM_ALIGN(bytes) roundup2(bytes, sizeof(long))
187 /* actual size of an undo structure */
188 #define SEMUSZ SEM_ALIGN(offsetof(struct sem_undo, un_ent[SEMUME]))
191 * Macro to find a particular sem_undo vector
194 ((struct sem_undo *)(((intptr_t)semu)+ix * seminfo.semusz))
197 * semaphore info struct
199 struct seminfo seminfo = {
200 SEMMNI, /* # of semaphore identifiers */
201 SEMMNS, /* # of semaphores in system */
202 SEMMNU, /* # of undo structures in system */
203 SEMMSL, /* max # of semaphores per id */
204 SEMOPM, /* max # of operations per semop call */
205 SEMUME, /* max # of undo entries per process */
206 SEMUSZ, /* size in bytes of undo structure */
207 SEMVMX, /* semaphore maximum value */
208 SEMAEM /* adjust on exit max value */
211 SYSCTL_INT(_kern_ipc, OID_AUTO, semmni, CTLFLAG_RDTUN, &seminfo.semmni, 0,
212 "Number of semaphore identifiers");
213 SYSCTL_INT(_kern_ipc, OID_AUTO, semmns, CTLFLAG_RDTUN, &seminfo.semmns, 0,
214 "Maximum number of semaphores in the system");
215 SYSCTL_INT(_kern_ipc, OID_AUTO, semmnu, CTLFLAG_RDTUN, &seminfo.semmnu, 0,
216 "Maximum number of undo structures in the system");
217 SYSCTL_INT(_kern_ipc, OID_AUTO, semmsl, CTLFLAG_RWTUN, &seminfo.semmsl, 0,
218 "Max semaphores per id");
219 SYSCTL_INT(_kern_ipc, OID_AUTO, semopm, CTLFLAG_RDTUN, &seminfo.semopm, 0,
220 "Max operations per semop call");
221 SYSCTL_INT(_kern_ipc, OID_AUTO, semume, CTLFLAG_RDTUN, &seminfo.semume, 0,
222 "Max undo entries per process");
223 SYSCTL_INT(_kern_ipc, OID_AUTO, semusz, CTLFLAG_RDTUN, &seminfo.semusz, 0,
224 "Size in bytes of undo structure");
225 SYSCTL_INT(_kern_ipc, OID_AUTO, semvmx, CTLFLAG_RWTUN, &seminfo.semvmx, 0,
226 "Semaphore maximum value");
227 SYSCTL_INT(_kern_ipc, OID_AUTO, semaem, CTLFLAG_RWTUN, &seminfo.semaem, 0,
228 "Adjust on exit max value");
229 SYSCTL_PROC(_kern_ipc, OID_AUTO, sema,
230 CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_MPSAFE,
231 NULL, 0, sysctl_sema, "", "Semaphore id pool");
233 static struct syscall_helper_data sem_syscalls[] = {
234 SYSCALL_INIT_HELPER(__semctl),
235 SYSCALL_INIT_HELPER(semget),
236 SYSCALL_INIT_HELPER(semop),
237 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
238 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
239 SYSCALL_INIT_HELPER(semsys),
240 SYSCALL_INIT_HELPER_COMPAT(freebsd7___semctl),
245 #ifdef COMPAT_FREEBSD32
246 #include <compat/freebsd32/freebsd32.h>
247 #include <compat/freebsd32/freebsd32_ipc.h>
248 #include <compat/freebsd32/freebsd32_proto.h>
249 #include <compat/freebsd32/freebsd32_signal.h>
250 #include <compat/freebsd32/freebsd32_syscall.h>
251 #include <compat/freebsd32/freebsd32_util.h>
253 static struct syscall_helper_data sem32_syscalls[] = {
254 SYSCALL32_INIT_HELPER(freebsd32_semctl),
255 SYSCALL32_INIT_HELPER_COMPAT(semget),
256 SYSCALL32_INIT_HELPER_COMPAT(semop),
257 SYSCALL32_INIT_HELPER(freebsd32_semsys),
258 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
259 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
260 SYSCALL32_INIT_HELPER(freebsd7_freebsd32_semctl),
272 osd_method_t methods[PR_MAXMETHOD] = {
273 [PR_METHOD_CHECK] = sem_prison_check,
274 [PR_METHOD_SET] = sem_prison_set,
275 [PR_METHOD_GET] = sem_prison_get,
276 [PR_METHOD_REMOVE] = sem_prison_remove,
279 sem = malloc(sizeof(struct sem) * seminfo.semmns, M_SEM, M_WAITOK);
280 sema = malloc(sizeof(struct semid_kernel) * seminfo.semmni, M_SEM,
282 sema_mtx = malloc(sizeof(struct mtx) * seminfo.semmni, M_SEM,
284 semu = malloc(seminfo.semmnu * seminfo.semusz, M_SEM, M_WAITOK);
286 for (i = 0; i < seminfo.semmni; i++) {
287 sema[i].u.sem_base = 0;
288 sema[i].u.sem_perm.mode = 0;
289 sema[i].u.sem_perm.seq = 0;
291 mac_sysvsem_init(&sema[i]);
294 for (i = 0; i < seminfo.semmni; i++)
295 mtx_init(&sema_mtx[i], "semid", NULL, MTX_DEF);
296 LIST_INIT(&semu_free_list);
297 for (i = 0; i < seminfo.semmnu; i++) {
298 struct sem_undo *suptr = SEMU(i);
299 suptr->un_proc = NULL;
300 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
302 LIST_INIT(&semu_list);
303 mtx_init(&sem_mtx, "sem", NULL, MTX_DEF);
304 mtx_init(&sem_undo_mtx, "semu", NULL, MTX_DEF);
305 semexit_tag = EVENTHANDLER_REGISTER(process_exit, semexit_myhook, NULL,
306 EVENTHANDLER_PRI_ANY);
308 /* Set current prisons according to their allow.sysvipc. */
309 sem_prison_slot = osd_jail_register(NULL, methods);
310 rsv = osd_reserve(sem_prison_slot);
311 prison_lock(&prison0);
312 (void)osd_jail_set_reserved(&prison0, sem_prison_slot, rsv, &prison0);
313 prison_unlock(&prison0);
315 sx_slock(&allprison_lock);
316 TAILQ_FOREACH(pr, &allprison, pr_list) {
318 rsv = osd_reserve(sem_prison_slot);
320 if ((pr->pr_allow & PR_ALLOW_SYSVIPC) && pr->pr_ref > 0) {
321 (void)osd_jail_set_reserved(pr, sem_prison_slot, rsv,
328 osd_free_reserved(rsv);
329 sx_sunlock(&allprison_lock);
331 error = syscall_helper_register(sem_syscalls, SY_THR_STATIC_KLD);
334 #ifdef COMPAT_FREEBSD32
335 error = syscall32_helper_register(sem32_syscalls, SY_THR_STATIC_KLD);
351 #ifdef COMPAT_FREEBSD32
352 syscall32_helper_unregister(sem32_syscalls);
354 syscall_helper_unregister(sem_syscalls);
355 EVENTHANDLER_DEREGISTER(process_exit, semexit_tag);
356 if (sem_prison_slot != 0)
357 osd_jail_deregister(sem_prison_slot);
359 for (i = 0; i < seminfo.semmni; i++)
360 mac_sysvsem_destroy(&sema[i]);
365 for (i = 0; i < seminfo.semmni; i++)
366 mtx_destroy(&sema_mtx[i]);
367 free(sema_mtx, M_SEM);
368 mtx_destroy(&sem_mtx);
369 mtx_destroy(&sem_undo_mtx);
374 sysvsem_modload(struct module *module, int cmd, void *arg)
396 static moduledata_t sysvsem_mod = {
402 DECLARE_MODULE(sysvsem, sysvsem_mod, SI_SUB_SYSV_SEM, SI_ORDER_FIRST);
403 MODULE_VERSION(sysvsem, 1);
406 * Allocate a new sem_undo structure for a process
407 * (returns ptr to structure or NULL if no more room)
410 static struct sem_undo *
411 semu_alloc(struct thread *td)
413 struct sem_undo *suptr;
415 SEMUNDO_LOCKASSERT(MA_OWNED);
416 if ((suptr = LIST_FIRST(&semu_free_list)) == NULL)
418 LIST_REMOVE(suptr, un_next);
419 LIST_INSERT_HEAD(&semu_list, suptr, un_next);
421 suptr->un_proc = td->td_proc;
426 semu_try_free(struct sem_undo *suptr)
429 SEMUNDO_LOCKASSERT(MA_OWNED);
431 if (suptr->un_cnt != 0)
433 LIST_REMOVE(suptr, un_next);
434 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
439 * Adjust a particular entry for a particular proc
443 semundo_adjust(struct thread *td, struct sem_undo **supptr, int semid,
444 int semseq, int semnum, int adjval)
446 struct proc *p = td->td_proc;
447 struct sem_undo *suptr;
451 SEMUNDO_LOCKASSERT(MA_OWNED);
452 /* Look for and remember the sem_undo if the caller doesn't provide
457 LIST_FOREACH(suptr, &semu_list, un_next) {
458 if (suptr->un_proc == p) {
466 suptr = semu_alloc(td);
474 * Look for the requested entry and adjust it (delete if adjval becomes
477 sunptr = &suptr->un_ent[0];
478 for (i = 0; i < suptr->un_cnt; i++, sunptr++) {
479 if (sunptr->un_id != semid || sunptr->un_num != semnum)
482 adjval += sunptr->un_adjval;
483 if (adjval > seminfo.semaem || adjval < -seminfo.semaem)
486 sunptr->un_adjval = adjval;
487 if (sunptr->un_adjval == 0) {
489 if (i < suptr->un_cnt)
491 suptr->un_ent[suptr->un_cnt];
492 if (suptr->un_cnt == 0)
493 semu_try_free(suptr);
498 /* Didn't find the right entry - create it */
501 if (adjval > seminfo.semaem || adjval < -seminfo.semaem)
503 if (suptr->un_cnt != seminfo.semume) {
504 sunptr = &suptr->un_ent[suptr->un_cnt];
506 sunptr->un_adjval = adjval;
507 sunptr->un_id = semid;
508 sunptr->un_num = semnum;
509 sunptr->un_seq = semseq;
516 semundo_clear(int semid, int semnum)
518 struct sem_undo *suptr, *suptr1;
522 SEMUNDO_LOCKASSERT(MA_OWNED);
523 LIST_FOREACH_SAFE(suptr, &semu_list, un_next, suptr1) {
524 sunptr = &suptr->un_ent[0];
525 for (i = 0; i < suptr->un_cnt; i++, sunptr++) {
526 if (sunptr->un_id != semid)
528 if (semnum == -1 || sunptr->un_num == semnum) {
530 if (i < suptr->un_cnt) {
532 suptr->un_ent[suptr->un_cnt];
535 semu_try_free(suptr);
544 semvalid(int semid, struct prison *rpr, struct semid_kernel *semakptr)
547 return ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
548 semakptr->u.sem_perm.seq != IPCID_TO_SEQ(semid) ||
549 sem_prison_cansee(rpr, semakptr) ? EINVAL : 0);
553 sem_remove(int semidx, struct ucred *cred)
555 struct semid_kernel *semakptr;
558 KASSERT(semidx >= 0 && semidx < seminfo.semmni,
559 ("semidx out of bounds"));
560 semakptr = &sema[semidx];
561 semakptr->u.sem_perm.cuid = cred ? cred->cr_uid : 0;
562 semakptr->u.sem_perm.uid = cred ? cred->cr_uid : 0;
563 semakptr->u.sem_perm.mode = 0;
564 racct_sub_cred(semakptr->cred, RACCT_NSEM, semakptr->u.sem_nsems);
565 crfree(semakptr->cred);
566 semakptr->cred = NULL;
568 semundo_clear(semidx, -1);
571 mac_sysvsem_cleanup(semakptr);
574 for (i = 0; i < seminfo.semmni; i++) {
575 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
576 sema[i].u.sem_base > semakptr->u.sem_base)
577 mtx_lock_flags(&sema_mtx[i], LOP_DUPOK);
579 for (i = semakptr->u.sem_base - sem; i < semtot; i++)
580 sem[i] = sem[i + semakptr->u.sem_nsems];
581 for (i = 0; i < seminfo.semmni; i++) {
582 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
583 sema[i].u.sem_base > semakptr->u.sem_base) {
584 sema[i].u.sem_base -= semakptr->u.sem_nsems;
585 mtx_unlock(&sema_mtx[i]);
588 semtot -= semakptr->u.sem_nsems;
591 static struct prison *
592 sem_find_prison(struct ucred *cred)
594 struct prison *pr, *rpr;
596 pr = cred->cr_prison;
598 rpr = osd_jail_get(pr, sem_prison_slot);
604 sem_prison_cansee(struct prison *rpr, struct semid_kernel *semakptr)
607 if (semakptr->cred == NULL ||
608 !(rpr == semakptr->cred->cr_prison ||
609 prison_ischild(rpr, semakptr->cred->cr_prison)))
615 * Note that the user-mode half of this passes a union, not a pointer.
617 #ifndef _SYS_SYSPROTO_H_
618 struct __semctl_args {
626 sys___semctl(struct thread *td, struct __semctl_args *uap)
628 struct semid_ds dsbuf;
629 union semun arg, semun;
640 error = copyin(uap->arg, &arg, sizeof(arg));
652 error = copyin(arg.buf, &dsbuf, sizeof(dsbuf));
659 semun.array = arg.array;
666 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
674 error = copyout(&dsbuf, arg.buf, sizeof(dsbuf));
679 td->td_retval[0] = rval;
684 kern_semctl(struct thread *td, int semid, int semnum, int cmd,
685 union semun *arg, register_t *rval)
688 struct ucred *cred = td->td_ucred;
691 struct semid_ds *sbuf;
692 struct semid_kernel *semakptr;
693 struct mtx *sema_mtxp;
694 u_short usval, count;
697 DPRINTF(("call to semctl(%d, %d, %d, 0x%p)\n",
698 semid, semnum, cmd, arg));
700 AUDIT_ARG_SVIPC_CMD(cmd);
701 AUDIT_ARG_SVIPC_ID(semid);
703 rpr = sem_find_prison(td->td_ucred);
712 * For this command we assume semid is an array index
713 * rather than an IPC id.
715 if (semid < 0 || semid >= seminfo.semmni)
717 semakptr = &sema[semid];
718 sema_mtxp = &sema_mtx[semid];
720 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0) {
724 if ((error = sem_prison_cansee(rpr, semakptr)))
726 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
729 error = mac_sysvsem_check_semctl(cred, semakptr, cmd);
733 bcopy(&semakptr->u, arg->buf, sizeof(struct semid_ds));
734 if (cred->cr_prison != semakptr->cred->cr_prison)
735 arg->buf->sem_perm.key = IPC_PRIVATE;
736 *rval = IXSEQ_TO_IPCID(semid, semakptr->u.sem_perm);
737 mtx_unlock(sema_mtxp);
741 semidx = IPCID_TO_IX(semid);
742 if (semidx < 0 || semidx >= seminfo.semmni)
745 semakptr = &sema[semidx];
746 sema_mtxp = &sema_mtx[semidx];
752 error = mac_sysvsem_check_semctl(cred, semakptr, cmd);
762 if ((error = semvalid(semid, rpr, semakptr)) != 0)
764 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_M)))
766 sem_remove(semidx, cred);
770 AUDIT_ARG_SVIPC_PERM(&arg->buf->sem_perm);
771 if ((error = semvalid(semid, rpr, semakptr)) != 0)
773 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_M)))
776 semakptr->u.sem_perm.uid = sbuf->sem_perm.uid;
777 semakptr->u.sem_perm.gid = sbuf->sem_perm.gid;
778 semakptr->u.sem_perm.mode = (semakptr->u.sem_perm.mode &
779 ~0777) | (sbuf->sem_perm.mode & 0777);
780 semakptr->u.sem_ctime = time_second;
784 if ((error = semvalid(semid, rpr, semakptr)) != 0)
786 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
788 bcopy(&semakptr->u, arg->buf, sizeof(struct semid_ds));
789 if (cred->cr_prison != semakptr->cred->cr_prison)
790 arg->buf->sem_perm.key = IPC_PRIVATE;
794 if ((error = semvalid(semid, rpr, semakptr)) != 0)
796 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
798 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
802 *rval = semakptr->u.sem_base[semnum].semncnt;
806 if ((error = semvalid(semid, rpr, semakptr)) != 0)
808 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
810 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
814 *rval = semakptr->u.sem_base[semnum].sempid;
818 if ((error = semvalid(semid, rpr, semakptr)) != 0)
820 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
822 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
826 *rval = semakptr->u.sem_base[semnum].semval;
831 * Unfortunately, callers of this function don't know
832 * in advance how many semaphores are in this set.
833 * While we could just allocate the maximum size array
834 * and pass the actual size back to the caller, that
835 * won't work for SETALL since we can't copyin() more
836 * data than the user specified as we may return a
839 * Note that the number of semaphores in a set is
840 * fixed for the life of that set. The only way that
841 * the 'count' could change while are blocked in
842 * malloc() is if this semaphore set were destroyed
843 * and a new one created with the same index.
844 * However, semvalid() will catch that due to the
845 * sequence number unless exactly 0x8000 (or a
846 * multiple thereof) semaphore sets for the same index
847 * are created and destroyed while we are in malloc!
850 count = semakptr->u.sem_nsems;
851 mtx_unlock(sema_mtxp);
852 array = malloc(sizeof(*array) * count, M_TEMP, M_WAITOK);
854 if ((error = semvalid(semid, rpr, semakptr)) != 0)
856 KASSERT(count == semakptr->u.sem_nsems, ("nsems changed"));
857 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
859 for (i = 0; i < semakptr->u.sem_nsems; i++)
860 array[i] = semakptr->u.sem_base[i].semval;
861 mtx_unlock(sema_mtxp);
862 error = copyout(array, arg->array, count * sizeof(*array));
867 if ((error = semvalid(semid, rpr, semakptr)) != 0)
869 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
871 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
875 *rval = semakptr->u.sem_base[semnum].semzcnt;
879 if ((error = semvalid(semid, rpr, semakptr)) != 0)
881 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_W)))
883 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
887 if (arg->val < 0 || arg->val > seminfo.semvmx) {
891 semakptr->u.sem_base[semnum].semval = arg->val;
893 semundo_clear(semidx, semnum);
900 * See comment on GETALL for why 'count' shouldn't change
901 * and why we require a userland buffer.
903 count = semakptr->u.sem_nsems;
904 mtx_unlock(sema_mtxp);
905 array = malloc(sizeof(*array) * count, M_TEMP, M_WAITOK);
906 error = copyin(arg->array, array, count * sizeof(*array));
910 if ((error = semvalid(semid, rpr, semakptr)) != 0)
912 KASSERT(count == semakptr->u.sem_nsems, ("nsems changed"));
913 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_W)))
915 for (i = 0; i < semakptr->u.sem_nsems; i++) {
917 if (usval > seminfo.semvmx) {
921 semakptr->u.sem_base[i].semval = usval;
924 semundo_clear(semidx, -1);
935 mtx_unlock(sema_mtxp);
937 mtx_unlock(&sem_mtx);
943 #ifndef _SYS_SYSPROTO_H_
951 sys_semget(struct thread *td, struct semget_args *uap)
953 int semid, error = 0;
955 int nsems = uap->nsems;
956 int semflg = uap->semflg;
957 struct ucred *cred = td->td_ucred;
959 DPRINTF(("semget(0x%x, %d, 0%o)\n", key, nsems, semflg));
961 AUDIT_ARG_VALUE(semflg);
963 if (sem_find_prison(cred) == NULL)
967 if (key != IPC_PRIVATE) {
968 for (semid = 0; semid < seminfo.semmni; semid++) {
969 if ((sema[semid].u.sem_perm.mode & SEM_ALLOC) &&
970 sema[semid].cred != NULL &&
971 sema[semid].cred->cr_prison == cred->cr_prison &&
972 sema[semid].u.sem_perm.key == key)
975 if (semid < seminfo.semmni) {
976 AUDIT_ARG_SVIPC_ID(semid);
977 DPRINTF(("found public key\n"));
978 if ((semflg & IPC_CREAT) && (semflg & IPC_EXCL)) {
979 DPRINTF(("not exclusive\n"));
983 if ((error = ipcperm(td, &sema[semid].u.sem_perm,
987 if (nsems > 0 && sema[semid].u.sem_nsems < nsems) {
988 DPRINTF(("too small\n"));
993 error = mac_sysvsem_check_semget(cred, &sema[semid]);
1001 DPRINTF(("need to allocate the semid_kernel\n"));
1002 if (key == IPC_PRIVATE || (semflg & IPC_CREAT)) {
1003 if (nsems <= 0 || nsems > seminfo.semmsl) {
1004 DPRINTF(("nsems out of range (0<%d<=%d)\n", nsems,
1009 if (nsems > seminfo.semmns - semtot) {
1011 "not enough semaphores left (need %d, got %d)\n",
1012 nsems, seminfo.semmns - semtot));
1016 for (semid = 0; semid < seminfo.semmni; semid++) {
1017 if ((sema[semid].u.sem_perm.mode & SEM_ALLOC) == 0)
1020 if (semid == seminfo.semmni) {
1021 DPRINTF(("no more semid_kernel's available\n"));
1027 PROC_LOCK(td->td_proc);
1028 error = racct_add(td->td_proc, RACCT_NSEM, nsems);
1029 PROC_UNLOCK(td->td_proc);
1036 DPRINTF(("semid %d is available\n", semid));
1037 mtx_lock(&sema_mtx[semid]);
1038 KASSERT((sema[semid].u.sem_perm.mode & SEM_ALLOC) == 0,
1039 ("Lost semaphore %d", semid));
1040 sema[semid].u.sem_perm.key = key;
1041 sema[semid].u.sem_perm.cuid = cred->cr_uid;
1042 sema[semid].u.sem_perm.uid = cred->cr_uid;
1043 sema[semid].u.sem_perm.cgid = cred->cr_gid;
1044 sema[semid].u.sem_perm.gid = cred->cr_gid;
1045 sema[semid].u.sem_perm.mode = (semflg & 0777) | SEM_ALLOC;
1046 sema[semid].cred = crhold(cred);
1047 sema[semid].u.sem_perm.seq =
1048 (sema[semid].u.sem_perm.seq + 1) & 0x7fff;
1049 sema[semid].u.sem_nsems = nsems;
1050 sema[semid].u.sem_otime = 0;
1051 sema[semid].u.sem_ctime = time_second;
1052 sema[semid].u.sem_base = &sem[semtot];
1054 bzero(sema[semid].u.sem_base,
1055 sizeof(sema[semid].u.sem_base[0])*nsems);
1057 mac_sysvsem_create(cred, &sema[semid]);
1059 mtx_unlock(&sema_mtx[semid]);
1060 DPRINTF(("sembase = %p, next = %p\n",
1061 sema[semid].u.sem_base, &sem[semtot]));
1063 DPRINTF(("didn't find it and wasn't asked to create it\n"));
1069 td->td_retval[0] = IXSEQ_TO_IPCID(semid, sema[semid].u.sem_perm);
1071 mtx_unlock(&sem_mtx);
1075 #ifndef _SYS_SYSPROTO_H_
1078 struct sembuf *sops;
1083 sys_semop(struct thread *td, struct semop_args *uap)
1085 #define SMALL_SOPS 8
1086 struct sembuf small_sops[SMALL_SOPS];
1087 int semid = uap->semid;
1088 size_t nsops = uap->nsops;
1090 struct sembuf *sops;
1091 struct semid_kernel *semakptr;
1092 struct sembuf *sopptr = NULL;
1093 struct sem *semptr = NULL;
1094 struct sem_undo *suptr;
1095 struct mtx *sema_mtxp;
1098 int do_wakeup, do_undos;
1104 DPRINTF(("call to semop(%d, %p, %u)\n", semid, sops, nsops));
1106 AUDIT_ARG_SVIPC_ID(semid);
1108 rpr = sem_find_prison(td->td_ucred);
1112 semid = IPCID_TO_IX(semid); /* Convert back to zero origin */
1114 if (semid < 0 || semid >= seminfo.semmni)
1117 /* Allocate memory for sem_ops */
1118 if (nsops <= SMALL_SOPS)
1120 else if (nsops > seminfo.semopm) {
1121 DPRINTF(("too many sops (max=%d, nsops=%d)\n", seminfo.semopm,
1127 PROC_LOCK(td->td_proc);
1129 racct_get_available(td->td_proc, RACCT_NSEMOP)) {
1130 PROC_UNLOCK(td->td_proc);
1133 PROC_UNLOCK(td->td_proc);
1137 sops = malloc(nsops * sizeof(*sops), M_TEMP, M_WAITOK);
1139 if ((error = copyin(uap->sops, sops, nsops * sizeof(sops[0]))) != 0) {
1140 DPRINTF(("error = %d from copyin(%p, %p, %d)\n", error,
1141 uap->sops, sops, nsops * sizeof(sops[0])));
1142 if (sops != small_sops)
1147 semakptr = &sema[semid];
1148 sema_mtxp = &sema_mtx[semid];
1149 mtx_lock(sema_mtxp);
1150 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0) {
1154 seq = semakptr->u.sem_perm.seq;
1155 if (seq != IPCID_TO_SEQ(uap->semid)) {
1159 if ((error = sem_prison_cansee(rpr, semakptr)) != 0)
1162 * Initial pass through sops to see what permissions are needed.
1163 * Also perform any checks that don't need repeating on each
1164 * attempt to satisfy the request vector.
1166 j = 0; /* permission needed */
1168 for (i = 0; i < nsops; i++) {
1170 if (sopptr->sem_num >= semakptr->u.sem_nsems) {
1174 if (sopptr->sem_flg & SEM_UNDO && sopptr->sem_op != 0)
1176 j |= (sopptr->sem_op == 0) ? SEM_R : SEM_A;
1179 if ((error = ipcperm(td, &semakptr->u.sem_perm, j))) {
1180 DPRINTF(("error = %d from ipaccess\n", error));
1184 error = mac_sysvsem_check_semop(td->td_ucred, semakptr, j);
1190 * Loop trying to satisfy the vector of requests.
1191 * If we reach a point where we must wait, any requests already
1192 * performed are rolled back and we go to sleep until some other
1193 * process wakes us up. At this point, we start all over again.
1195 * This ensures that from the perspective of other tasks, a set
1196 * of requests is atomic (never partially satisfied).
1200 error = 0; /* error return if necessary */
1202 for (i = 0; i < nsops; i++) {
1204 semptr = &semakptr->u.sem_base[sopptr->sem_num];
1207 "semop: semakptr=%p, sem_base=%p, "
1208 "semptr=%p, sem[%d]=%d : op=%d, flag=%s\n",
1209 semakptr, semakptr->u.sem_base, semptr,
1210 sopptr->sem_num, semptr->semval, sopptr->sem_op,
1211 (sopptr->sem_flg & IPC_NOWAIT) ?
1212 "nowait" : "wait"));
1214 if (sopptr->sem_op < 0) {
1215 if (semptr->semval + sopptr->sem_op < 0) {
1216 DPRINTF(("semop: can't do it now\n"));
1219 semptr->semval += sopptr->sem_op;
1220 if (semptr->semval == 0 &&
1221 semptr->semzcnt > 0)
1224 } else if (sopptr->sem_op == 0) {
1225 if (semptr->semval != 0) {
1226 DPRINTF(("semop: not zero now\n"));
1229 } else if (semptr->semval + sopptr->sem_op >
1234 if (semptr->semncnt > 0)
1236 semptr->semval += sopptr->sem_op;
1241 * Did we get through the entire vector?
1247 * No ... rollback anything that we've already done
1249 DPRINTF(("semop: rollback 0 through %d\n", i-1));
1250 for (j = 0; j < i; j++)
1251 semakptr->u.sem_base[sops[j].sem_num].semval -=
1254 /* If we detected an error, return it */
1259 * If the request that we couldn't satisfy has the
1260 * NOWAIT flag set then return with EAGAIN.
1262 if (sopptr->sem_flg & IPC_NOWAIT) {
1267 if (sopptr->sem_op == 0)
1272 DPRINTF(("semop: good night!\n"));
1273 error = msleep(semakptr, sema_mtxp, (PZERO - 4) | PCATCH,
1275 DPRINTF(("semop: good morning (error=%d)!\n", error));
1276 /* return code is checked below, after sem[nz]cnt-- */
1279 * Make sure that the semaphore still exists
1281 seq = semakptr->u.sem_perm.seq;
1282 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
1283 seq != IPCID_TO_SEQ(uap->semid)) {
1289 * Renew the semaphore's pointer after wakeup since
1290 * during msleep sem_base may have been modified and semptr
1291 * is not valid any more
1293 semptr = &semakptr->u.sem_base[sopptr->sem_num];
1296 * The semaphore is still alive. Readjust the count of
1297 * waiting processes.
1299 if (sopptr->sem_op == 0)
1305 * Is it really morning, or was our sleep interrupted?
1306 * (Delayed check of msleep() return code because we
1307 * need to decrement sem[nz]cnt either way.)
1313 DPRINTF(("semop: good morning!\n"));
1318 * Process any SEM_UNDO requests.
1323 for (i = 0; i < nsops; i++) {
1325 * We only need to deal with SEM_UNDO's for non-zero
1330 if ((sops[i].sem_flg & SEM_UNDO) == 0)
1332 adjval = sops[i].sem_op;
1335 error = semundo_adjust(td, &suptr, semid, seq,
1336 sops[i].sem_num, -adjval);
1341 * Oh-Oh! We ran out of either sem_undo's or undo's.
1342 * Rollback the adjustments to this point and then
1343 * rollback the semaphore ups and down so we can return
1344 * with an error with all structures restored. We
1345 * rollback the undo's in the exact reverse order that
1346 * we applied them. This guarantees that we won't run
1347 * out of space as we roll things back out.
1349 for (j = 0; j < i; j++) {
1351 if ((sops[k].sem_flg & SEM_UNDO) == 0)
1353 adjval = sops[k].sem_op;
1356 if (semundo_adjust(td, &suptr, semid, seq,
1357 sops[k].sem_num, adjval) != 0)
1358 panic("semop - can't undo undos");
1361 for (j = 0; j < nsops; j++)
1362 semakptr->u.sem_base[sops[j].sem_num].semval -=
1365 DPRINTF(("error = %d from semundo_adjust\n", error));
1368 } /* loop through the sops */
1370 } /* if (do_undos) */
1372 /* We're definitely done - set the sempid's and time */
1373 for (i = 0; i < nsops; i++) {
1375 semptr = &semakptr->u.sem_base[sopptr->sem_num];
1376 semptr->sempid = td->td_proc->p_pid;
1378 semakptr->u.sem_otime = time_second;
1381 * Do a wakeup if any semaphore was up'd whilst something was
1385 DPRINTF(("semop: doing wakeup\n"));
1387 DPRINTF(("semop: back from wakeup\n"));
1389 DPRINTF(("semop: done\n"));
1390 td->td_retval[0] = 0;
1392 mtx_unlock(sema_mtxp);
1393 if (sops != small_sops)
1399 * Go through the undo structures for this process and apply the adjustments to
1403 semexit_myhook(void *arg, struct proc *p)
1405 struct sem_undo *suptr;
1406 struct semid_kernel *semakptr;
1407 struct mtx *sema_mtxp;
1408 int semid, semnum, adjval, ix;
1412 * Go through the chain of undo vectors looking for one
1413 * associated with this process.
1415 if (LIST_EMPTY(&semu_list))
1418 LIST_FOREACH(suptr, &semu_list, un_next) {
1419 if (suptr->un_proc == p)
1422 if (suptr == NULL) {
1426 LIST_REMOVE(suptr, un_next);
1428 DPRINTF(("proc @%p has undo structure with %d entries\n", p,
1432 * If there are any active undo elements then process them.
1434 if (suptr->un_cnt > 0) {
1436 for (ix = 0; ix < suptr->un_cnt; ix++) {
1437 semid = suptr->un_ent[ix].un_id;
1438 semnum = suptr->un_ent[ix].un_num;
1439 adjval = suptr->un_ent[ix].un_adjval;
1440 seq = suptr->un_ent[ix].un_seq;
1441 semakptr = &sema[semid];
1442 sema_mtxp = &sema_mtx[semid];
1444 mtx_lock(sema_mtxp);
1445 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
1446 (semakptr->u.sem_perm.seq != seq)) {
1447 mtx_unlock(sema_mtxp);
1450 if (semnum >= semakptr->u.sem_nsems)
1451 panic("semexit - semnum out of range");
1454 "semexit: %p id=%d num=%d(adj=%d) ; sem=%d\n",
1455 suptr->un_proc, suptr->un_ent[ix].un_id,
1456 suptr->un_ent[ix].un_num,
1457 suptr->un_ent[ix].un_adjval,
1458 semakptr->u.sem_base[semnum].semval));
1460 if (adjval < 0 && semakptr->u.sem_base[semnum].semval <
1462 semakptr->u.sem_base[semnum].semval = 0;
1464 semakptr->u.sem_base[semnum].semval += adjval;
1467 DPRINTF(("semexit: back from wakeup\n"));
1468 mtx_unlock(sema_mtxp);
1474 * Deallocate the undo vector.
1476 DPRINTF(("removing vector\n"));
1477 suptr->un_proc = NULL;
1479 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
1484 sysctl_sema(SYSCTL_HANDLER_ARGS)
1486 struct prison *pr, *rpr;
1487 struct semid_kernel tsemak;
1490 pr = req->td->td_ucred->cr_prison;
1491 rpr = sem_find_prison(req->td->td_ucred);
1493 for (i = 0; i < seminfo.semmni; i++) {
1494 mtx_lock(&sema_mtx[i]);
1495 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) == 0 ||
1496 rpr == NULL || sem_prison_cansee(rpr, &sema[i]) != 0)
1497 bzero(&tsemak, sizeof(tsemak));
1500 if (tsemak.cred->cr_prison != pr)
1501 tsemak.u.sem_perm.key = IPC_PRIVATE;
1503 mtx_unlock(&sema_mtx[i]);
1504 error = SYSCTL_OUT(req, &tsemak, sizeof(tsemak));
1512 sem_prison_check(void *obj, void *data)
1514 struct prison *pr = obj;
1515 struct prison *prpr;
1516 struct vfsoptlist *opts = data;
1520 * sysvsem is a jailsys integer.
1521 * It must be "disable" if the parent jail is disabled.
1523 error = vfs_copyopt(opts, "sysvsem", &jsys, sizeof(jsys));
1524 if (error != ENOENT) {
1528 case JAIL_SYS_DISABLE:
1531 case JAIL_SYS_INHERIT:
1532 prison_lock(pr->pr_parent);
1533 prpr = osd_jail_get(pr->pr_parent, sem_prison_slot);
1534 prison_unlock(pr->pr_parent);
1547 sem_prison_set(void *obj, void *data)
1549 struct prison *pr = obj;
1550 struct prison *tpr, *orpr, *nrpr, *trpr;
1551 struct vfsoptlist *opts = data;
1556 * sysvsem controls which jail is the root of the associated sems (this
1557 * jail or same as the parent), or if the feature is available at all.
1559 if (vfs_copyopt(opts, "sysvsem", &jsys, sizeof(jsys)) == ENOENT)
1560 jsys = vfs_flagopt(opts, "allow.sysvipc", NULL, 0)
1562 : vfs_flagopt(opts, "allow.nosysvipc", NULL, 0)
1565 if (jsys == JAIL_SYS_DISABLE) {
1567 orpr = osd_jail_get(pr, sem_prison_slot);
1569 osd_jail_del(pr, sem_prison_slot);
1573 sem_prison_cleanup(pr);
1574 /* Disable all child jails as well. */
1575 FOREACH_PRISON_DESCENDANT(pr, tpr, descend) {
1577 trpr = osd_jail_get(tpr, sem_prison_slot);
1579 osd_jail_del(tpr, sem_prison_slot);
1582 sem_prison_cleanup(tpr);
1589 } else if (jsys != -1) {
1590 if (jsys == JAIL_SYS_NEW)
1593 prison_lock(pr->pr_parent);
1594 nrpr = osd_jail_get(pr->pr_parent, sem_prison_slot);
1595 prison_unlock(pr->pr_parent);
1597 rsv = osd_reserve(sem_prison_slot);
1599 orpr = osd_jail_get(pr, sem_prison_slot);
1601 (void)osd_jail_set_reserved(pr, sem_prison_slot, rsv,
1604 osd_free_reserved(rsv);
1608 sem_prison_cleanup(pr);
1610 /* Change child jails matching the old root, */
1611 FOREACH_PRISON_DESCENDANT(pr, tpr, descend) {
1613 trpr = osd_jail_get(tpr,
1616 (void)osd_jail_set(tpr,
1617 sem_prison_slot, nrpr);
1620 sem_prison_cleanup(tpr);
1634 sem_prison_get(void *obj, void *data)
1636 struct prison *pr = obj;
1638 struct vfsoptlist *opts = data;
1641 /* Set sysvsem based on the jail's root prison. */
1643 rpr = osd_jail_get(pr, sem_prison_slot);
1645 jsys = rpr == NULL ? JAIL_SYS_DISABLE
1646 : rpr == pr ? JAIL_SYS_NEW : JAIL_SYS_INHERIT;
1647 error = vfs_setopt(opts, "sysvsem", &jsys, sizeof(jsys));
1648 if (error == ENOENT)
1654 sem_prison_remove(void *obj, void *data __unused)
1656 struct prison *pr = obj;
1660 rpr = osd_jail_get(pr, sem_prison_slot);
1663 sem_prison_cleanup(pr);
1668 sem_prison_cleanup(struct prison *pr)
1672 /* Remove any sems that belong to this jail. */
1674 for (i = 0; i < seminfo.semmni; i++) {
1675 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
1676 sema[i].cred != NULL && sema[i].cred->cr_prison == pr) {
1677 mtx_lock(&sema_mtx[i]);
1678 sem_remove(i, NULL);
1679 mtx_unlock(&sema_mtx[i]);
1682 mtx_unlock(&sem_mtx);
1685 SYSCTL_JAIL_PARAM_SYS_NODE(sysvsem, CTLFLAG_RW, "SYSV semaphores");
1687 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1688 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1690 /* XXX casting to (sy_call_t *) is bogus, as usual. */
1691 static sy_call_t *semcalls[] = {
1692 (sy_call_t *)freebsd7___semctl, (sy_call_t *)sys_semget,
1693 (sy_call_t *)sys_semop
1697 * Entry point for all SEM calls.
1702 /* XXX actually varargs. */
1703 struct semsys_args /* {
1713 AUDIT_ARG_SVIPC_WHICH(uap->which);
1714 if (uap->which < 0 || uap->which >= nitems(semcalls))
1716 error = (*semcalls[uap->which])(td, &uap->a2);
1721 #define CP(src, dst, fld) do { (dst).fld = (src).fld; } while (0)
1724 #ifndef _SYS_SYSPROTO_H_
1725 struct freebsd7___semctl_args {
1729 union semun_old *arg;
1733 freebsd7___semctl(struct thread *td, struct freebsd7___semctl_args *uap)
1735 struct semid_ds_old dsold;
1736 struct semid_ds dsbuf;
1737 union semun_old arg;
1749 error = copyin(uap->arg, &arg, sizeof(arg));
1761 error = copyin(arg.buf, &dsold, sizeof(dsold));
1764 ipcperm_old2new(&dsold.sem_perm, &dsbuf.sem_perm);
1765 CP(dsold, dsbuf, sem_base);
1766 CP(dsold, dsbuf, sem_nsems);
1767 CP(dsold, dsbuf, sem_otime);
1768 CP(dsold, dsbuf, sem_ctime);
1773 semun.array = arg.array;
1776 semun.val = arg.val;
1780 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
1788 bzero(&dsold, sizeof(dsold));
1789 ipcperm_new2old(&dsbuf.sem_perm, &dsold.sem_perm);
1790 CP(dsbuf, dsold, sem_base);
1791 CP(dsbuf, dsold, sem_nsems);
1792 CP(dsbuf, dsold, sem_otime);
1793 CP(dsbuf, dsold, sem_ctime);
1794 error = copyout(&dsold, arg.buf, sizeof(dsold));
1799 td->td_retval[0] = rval;
1803 #endif /* COMPAT_FREEBSD{4,5,6,7} */
1805 #ifdef COMPAT_FREEBSD32
1808 freebsd32_semsys(struct thread *td, struct freebsd32_semsys_args *uap)
1811 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1812 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1813 AUDIT_ARG_SVIPC_WHICH(uap->which);
1814 switch (uap->which) {
1816 return (freebsd7_freebsd32_semctl(td,
1817 (struct freebsd7_freebsd32_semctl_args *)&uap->a2));
1819 return (sys_semsys(td, (struct semsys_args *)uap));
1822 return (nosys(td, NULL));
1826 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1827 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1829 freebsd7_freebsd32_semctl(struct thread *td,
1830 struct freebsd7_freebsd32_semctl_args *uap)
1832 struct semid_ds32_old dsbuf32;
1833 struct semid_ds dsbuf;
1846 error = copyin(uap->arg, &arg, sizeof(arg));
1858 error = copyin(PTRIN(arg.buf), &dsbuf32, sizeof(dsbuf32));
1861 freebsd32_ipcperm_old_in(&dsbuf32.sem_perm, &dsbuf.sem_perm);
1862 PTRIN_CP(dsbuf32, dsbuf, sem_base);
1863 CP(dsbuf32, dsbuf, sem_nsems);
1864 CP(dsbuf32, dsbuf, sem_otime);
1865 CP(dsbuf32, dsbuf, sem_ctime);
1870 semun.array = PTRIN(arg.array);
1873 semun.val = arg.val;
1877 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
1885 bzero(&dsbuf32, sizeof(dsbuf32));
1886 freebsd32_ipcperm_old_out(&dsbuf.sem_perm, &dsbuf32.sem_perm);
1887 PTROUT_CP(dsbuf, dsbuf32, sem_base);
1888 CP(dsbuf, dsbuf32, sem_nsems);
1889 CP(dsbuf, dsbuf32, sem_otime);
1890 CP(dsbuf, dsbuf32, sem_ctime);
1891 error = copyout(&dsbuf32, PTRIN(arg.buf), sizeof(dsbuf32));
1896 td->td_retval[0] = rval;
1902 freebsd32_semctl(struct thread *td, struct freebsd32_semctl_args *uap)
1904 struct semid_ds32 dsbuf32;
1905 struct semid_ds dsbuf;
1918 error = copyin(uap->arg, &arg, sizeof(arg));
1930 error = copyin(PTRIN(arg.buf), &dsbuf32, sizeof(dsbuf32));
1933 freebsd32_ipcperm_in(&dsbuf32.sem_perm, &dsbuf.sem_perm);
1934 PTRIN_CP(dsbuf32, dsbuf, sem_base);
1935 CP(dsbuf32, dsbuf, sem_nsems);
1936 CP(dsbuf32, dsbuf, sem_otime);
1937 CP(dsbuf32, dsbuf, sem_ctime);
1942 semun.array = PTRIN(arg.array);
1945 semun.val = arg.val;
1949 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
1957 bzero(&dsbuf32, sizeof(dsbuf32));
1958 freebsd32_ipcperm_out(&dsbuf.sem_perm, &dsbuf32.sem_perm);
1959 PTROUT_CP(dsbuf, dsbuf32, sem_base);
1960 CP(dsbuf, dsbuf32, sem_nsems);
1961 CP(dsbuf, dsbuf32, sem_otime);
1962 CP(dsbuf, dsbuf32, sem_ctime);
1963 error = copyout(&dsbuf32, PTRIN(arg.buf), sizeof(dsbuf32));
1968 td->td_retval[0] = rval;
1972 #endif /* COMPAT_FREEBSD32 */