2 * Implementation of SVID semaphores
4 * Author: Daniel Boulet
6 * This software is provided ``AS IS'' without any warranties of any kind.
9 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
11 * Copyright (c) 2003-2005 McAfee, Inc.
12 * Copyright (c) 2016-2017 Robert N. M. Watson
13 * All rights reserved.
15 * This software was developed for the FreeBSD Project in part by McAfee
16 * Research, the Security Research Division of McAfee, Inc under DARPA/SPAWAR
17 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS research
20 * Portions of this software were developed by BAE Systems, the University of
21 * Cambridge Computer Laboratory, and Memorial University under DARPA/AFRL
22 * contract FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent
23 * Computing (TC) research program.
25 * Redistribution and use in source and binary forms, with or without
26 * modification, are permitted provided that the following conditions
28 * 1. Redistributions of source code must retain the above copyright
29 * notice, this list of conditions and the following disclaimer.
30 * 2. Redistributions in binary form must reproduce the above copyright
31 * notice, this list of conditions and the following disclaimer in the
32 * documentation and/or other materials provided with the distribution.
34 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
35 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
38 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
47 #include <sys/cdefs.h>
48 __FBSDID("$FreeBSD$");
50 #include "opt_sysvipc.h"
52 #include <sys/param.h>
53 #include <sys/systm.h>
54 #include <sys/sysproto.h>
55 #include <sys/abi_compat.h>
56 #include <sys/eventhandler.h>
57 #include <sys/kernel.h>
60 #include <sys/module.h>
61 #include <sys/mutex.h>
62 #include <sys/racct.h>
65 #include <sys/syscall.h>
66 #include <sys/syscallsubr.h>
67 #include <sys/sysent.h>
68 #include <sys/sysctl.h>
70 #include <sys/malloc.h>
73 #include <security/audit/audit.h>
74 #include <security/mac/mac_framework.h>
76 FEATURE(sysv_sem, "System V semaphores support");
78 static MALLOC_DEFINE(M_SEM, "sem", "SVID compatible semaphores");
81 #define DPRINTF(a) printf a
86 static int seminit(void);
87 static int sysvsem_modload(struct module *, int, void *);
88 static int semunload(void);
89 static void semexit_myhook(void *arg, struct proc *p);
90 static int sysctl_sema(SYSCTL_HANDLER_ARGS);
91 static int semvalid(int semid, struct prison *rpr,
92 struct semid_kernel *semakptr);
93 static void sem_remove(int semidx, struct ucred *cred);
94 static struct prison *sem_find_prison(struct ucred *);
95 static int sem_prison_cansee(struct prison *, struct semid_kernel *);
96 static int sem_prison_check(void *, void *);
97 static int sem_prison_set(void *, void *);
98 static int sem_prison_get(void *, void *);
99 static int sem_prison_remove(void *, void *);
100 static void sem_prison_cleanup(struct prison *);
102 #ifndef _SYS_SYSPROTO_H_
103 struct __semctl_args;
104 int __semctl(struct thread *td, struct __semctl_args *uap);
106 int semget(struct thread *td, struct semget_args *uap);
108 int semop(struct thread *td, struct semop_args *uap);
111 static struct sem_undo *semu_alloc(struct thread *td);
112 static int semundo_adjust(struct thread *td, struct sem_undo **supptr,
113 int semid, int semseq, int semnum, int adjval);
114 static void semundo_clear(int semid, int semnum);
116 static struct mtx sem_mtx; /* semaphore global lock */
117 static struct mtx sem_undo_mtx;
118 static int semtot = 0;
119 static struct semid_kernel *sema; /* semaphore id pool */
120 static struct mtx *sema_mtx; /* semaphore id pool mutexes*/
121 static struct sem *sem; /* semaphore pool */
122 LIST_HEAD(, sem_undo) semu_list; /* list of active undo structures */
123 LIST_HEAD(, sem_undo) semu_free_list; /* list of free undo structures */
124 static int *semu; /* undo structure pool */
125 static eventhandler_tag semexit_tag;
126 static unsigned sem_prison_slot; /* prison OSD slot */
128 #define SEMUNDO_MTX sem_undo_mtx
129 #define SEMUNDO_LOCK() mtx_lock(&SEMUNDO_MTX);
130 #define SEMUNDO_UNLOCK() mtx_unlock(&SEMUNDO_MTX);
131 #define SEMUNDO_LOCKASSERT(how) mtx_assert(&SEMUNDO_MTX, (how));
134 u_short semval; /* semaphore value */
135 pid_t sempid; /* pid of last operation */
136 u_short semncnt; /* # awaiting semval > cval */
137 u_short semzcnt; /* # awaiting semval = 0 */
141 * Undo structure (one per process)
144 LIST_ENTRY(sem_undo) un_next; /* ptr to next active undo structure */
145 struct proc *un_proc; /* owner of this structure */
146 short un_cnt; /* # of active entries */
148 short un_adjval; /* adjust on exit values */
149 short un_num; /* semaphore # */
150 int un_id; /* semid */
151 unsigned short un_seq;
152 } un_ent[1]; /* undo entries */
156 * Configuration parameters
159 #define SEMMNI 50 /* # of semaphore identifiers */
162 #define SEMMNS 340 /* # of semaphores in system */
165 #define SEMUME 50 /* max # of undo entries per process */
168 #define SEMMNU 150 /* # of undo structures in system */
171 /* shouldn't need tuning */
173 #define SEMMSL SEMMNS /* max # of semaphores per id */
176 #define SEMOPM 100 /* max # of operations per semop call */
179 #define SEMVMX 32767 /* semaphore maximum value */
180 #define SEMAEM 16384 /* adjust on exit max value */
183 * Due to the way semaphore memory is allocated, we have to ensure that
184 * SEMUSZ is properly aligned.
187 #define SEM_ALIGN(bytes) roundup2(bytes, sizeof(long))
189 /* actual size of an undo structure */
190 #define SEMUSZ(x) SEM_ALIGN(offsetof(struct sem_undo, un_ent[(x)]))
193 * Macro to find a particular sem_undo vector
196 ((struct sem_undo *)(((intptr_t)semu) + (ix) * seminfo.semusz))
199 * semaphore info struct
201 struct seminfo seminfo = {
202 .semmni = SEMMNI, /* # of semaphore identifiers */
203 .semmns = SEMMNS, /* # of semaphores in system */
204 .semmnu = SEMMNU, /* # of undo structures in system */
205 .semmsl = SEMMSL, /* max # of semaphores per id */
206 .semopm = SEMOPM, /* max # of operations per semop call */
207 .semume = SEMUME, /* max # of undo entries per process */
208 .semusz = SEMUSZ(SEMUME), /* size in bytes of undo structure */
209 .semvmx = SEMVMX, /* semaphore maximum value */
210 .semaem = SEMAEM, /* adjust on exit max value */
213 SYSCTL_INT(_kern_ipc, OID_AUTO, semmni, CTLFLAG_RDTUN, &seminfo.semmni, 0,
214 "Number of semaphore identifiers");
215 SYSCTL_INT(_kern_ipc, OID_AUTO, semmns, CTLFLAG_RDTUN, &seminfo.semmns, 0,
216 "Maximum number of semaphores in the system");
217 SYSCTL_INT(_kern_ipc, OID_AUTO, semmnu, CTLFLAG_RDTUN, &seminfo.semmnu, 0,
218 "Maximum number of undo structures in the system");
219 SYSCTL_INT(_kern_ipc, OID_AUTO, semmsl, CTLFLAG_RWTUN, &seminfo.semmsl, 0,
220 "Max semaphores per id");
221 SYSCTL_INT(_kern_ipc, OID_AUTO, semopm, CTLFLAG_RDTUN, &seminfo.semopm, 0,
222 "Max operations per semop call");
223 SYSCTL_INT(_kern_ipc, OID_AUTO, semume, CTLFLAG_RDTUN, &seminfo.semume, 0,
224 "Max undo entries per process");
225 SYSCTL_INT(_kern_ipc, OID_AUTO, semusz, CTLFLAG_RD, &seminfo.semusz, 0,
226 "Size in bytes of undo structure");
227 SYSCTL_INT(_kern_ipc, OID_AUTO, semvmx, CTLFLAG_RWTUN, &seminfo.semvmx, 0,
228 "Semaphore maximum value");
229 SYSCTL_INT(_kern_ipc, OID_AUTO, semaem, CTLFLAG_RWTUN, &seminfo.semaem, 0,
230 "Adjust on exit max value");
231 SYSCTL_PROC(_kern_ipc, OID_AUTO, sema,
232 CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_MPSAFE,
233 NULL, 0, sysctl_sema, "",
234 "Array of struct semid_kernel for each potential semaphore");
236 static struct syscall_helper_data sem_syscalls[] = {
237 SYSCALL_INIT_HELPER(__semctl),
238 SYSCALL_INIT_HELPER(semget),
239 SYSCALL_INIT_HELPER(semop),
240 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
241 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
242 SYSCALL_INIT_HELPER(semsys),
243 SYSCALL_INIT_HELPER_COMPAT(freebsd7___semctl),
248 #ifdef COMPAT_FREEBSD32
249 #include <compat/freebsd32/freebsd32.h>
250 #include <compat/freebsd32/freebsd32_ipc.h>
251 #include <compat/freebsd32/freebsd32_proto.h>
252 #include <compat/freebsd32/freebsd32_signal.h>
253 #include <compat/freebsd32/freebsd32_syscall.h>
254 #include <compat/freebsd32/freebsd32_util.h>
256 static struct syscall_helper_data sem32_syscalls[] = {
257 SYSCALL32_INIT_HELPER(freebsd32_semctl),
258 SYSCALL32_INIT_HELPER_COMPAT(semget),
259 SYSCALL32_INIT_HELPER_COMPAT(semop),
260 SYSCALL32_INIT_HELPER(freebsd32_semsys),
261 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
262 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
263 SYSCALL32_INIT_HELPER(freebsd7_freebsd32_semctl),
275 osd_method_t methods[PR_MAXMETHOD] = {
276 [PR_METHOD_CHECK] = sem_prison_check,
277 [PR_METHOD_SET] = sem_prison_set,
278 [PR_METHOD_GET] = sem_prison_get,
279 [PR_METHOD_REMOVE] = sem_prison_remove,
282 sem = malloc(sizeof(struct sem) * seminfo.semmns, M_SEM, M_WAITOK);
283 sema = malloc(sizeof(struct semid_kernel) * seminfo.semmni, M_SEM,
285 sema_mtx = malloc(sizeof(struct mtx) * seminfo.semmni, M_SEM,
287 seminfo.semusz = SEMUSZ(seminfo.semume);
288 semu = malloc(seminfo.semmnu * seminfo.semusz, M_SEM, M_WAITOK);
290 for (i = 0; i < seminfo.semmni; i++) {
291 sema[i].u.__sem_base = 0;
292 sema[i].u.sem_perm.mode = 0;
293 sema[i].u.sem_perm.seq = 0;
295 mac_sysvsem_init(&sema[i]);
298 for (i = 0; i < seminfo.semmni; i++)
299 mtx_init(&sema_mtx[i], "semid", NULL, MTX_DEF);
300 LIST_INIT(&semu_free_list);
301 for (i = 0; i < seminfo.semmnu; i++) {
302 struct sem_undo *suptr = SEMU(i);
303 suptr->un_proc = NULL;
304 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
306 LIST_INIT(&semu_list);
307 mtx_init(&sem_mtx, "sem", NULL, MTX_DEF);
308 mtx_init(&sem_undo_mtx, "semu", NULL, MTX_DEF);
309 semexit_tag = EVENTHANDLER_REGISTER(process_exit, semexit_myhook, NULL,
310 EVENTHANDLER_PRI_ANY);
312 /* Set current prisons according to their allow.sysvipc. */
313 sem_prison_slot = osd_jail_register(NULL, methods);
314 rsv = osd_reserve(sem_prison_slot);
315 prison_lock(&prison0);
316 (void)osd_jail_set_reserved(&prison0, sem_prison_slot, rsv, &prison0);
317 prison_unlock(&prison0);
319 sx_slock(&allprison_lock);
320 TAILQ_FOREACH(pr, &allprison, pr_list) {
322 rsv = osd_reserve(sem_prison_slot);
324 if (pr->pr_allow & PR_ALLOW_SYSVIPC) {
325 (void)osd_jail_set_reserved(pr, sem_prison_slot, rsv,
332 osd_free_reserved(rsv);
333 sx_sunlock(&allprison_lock);
335 error = syscall_helper_register(sem_syscalls, SY_THR_STATIC_KLD);
338 #ifdef COMPAT_FREEBSD32
339 error = syscall32_helper_register(sem32_syscalls, SY_THR_STATIC_KLD);
355 #ifdef COMPAT_FREEBSD32
356 syscall32_helper_unregister(sem32_syscalls);
358 syscall_helper_unregister(sem_syscalls);
359 EVENTHANDLER_DEREGISTER(process_exit, semexit_tag);
360 if (sem_prison_slot != 0)
361 osd_jail_deregister(sem_prison_slot);
363 for (i = 0; i < seminfo.semmni; i++)
364 mac_sysvsem_destroy(&sema[i]);
369 for (i = 0; i < seminfo.semmni; i++)
370 mtx_destroy(&sema_mtx[i]);
371 free(sema_mtx, M_SEM);
372 mtx_destroy(&sem_mtx);
373 mtx_destroy(&sem_undo_mtx);
378 sysvsem_modload(struct module *module, int cmd, void *arg)
398 static moduledata_t sysvsem_mod = {
404 DECLARE_MODULE(sysvsem, sysvsem_mod, SI_SUB_SYSV_SEM, SI_ORDER_FIRST);
405 MODULE_VERSION(sysvsem, 1);
408 * Allocate a new sem_undo structure for a process
409 * (returns ptr to structure or NULL if no more room)
412 static struct sem_undo *
413 semu_alloc(struct thread *td)
415 struct sem_undo *suptr;
417 SEMUNDO_LOCKASSERT(MA_OWNED);
418 if ((suptr = LIST_FIRST(&semu_free_list)) == NULL)
420 LIST_REMOVE(suptr, un_next);
421 LIST_INSERT_HEAD(&semu_list, suptr, un_next);
423 suptr->un_proc = td->td_proc;
428 semu_try_free(struct sem_undo *suptr)
431 SEMUNDO_LOCKASSERT(MA_OWNED);
433 if (suptr->un_cnt != 0)
435 LIST_REMOVE(suptr, un_next);
436 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
441 * Adjust a particular entry for a particular proc
445 semundo_adjust(struct thread *td, struct sem_undo **supptr, int semid,
446 int semseq, int semnum, int adjval)
448 struct proc *p = td->td_proc;
449 struct sem_undo *suptr;
453 SEMUNDO_LOCKASSERT(MA_OWNED);
454 /* Look for and remember the sem_undo if the caller doesn't provide
459 LIST_FOREACH(suptr, &semu_list, un_next) {
460 if (suptr->un_proc == p) {
468 suptr = semu_alloc(td);
476 * Look for the requested entry and adjust it (delete if adjval becomes
479 sunptr = &suptr->un_ent[0];
480 for (i = 0; i < suptr->un_cnt; i++, sunptr++) {
481 if (sunptr->un_id != semid || sunptr->un_num != semnum)
484 adjval += sunptr->un_adjval;
485 if (adjval > seminfo.semaem || adjval < -seminfo.semaem)
488 sunptr->un_adjval = adjval;
489 if (sunptr->un_adjval == 0) {
491 if (i < suptr->un_cnt)
493 suptr->un_ent[suptr->un_cnt];
494 if (suptr->un_cnt == 0)
495 semu_try_free(suptr);
500 /* Didn't find the right entry - create it */
503 if (adjval > seminfo.semaem || adjval < -seminfo.semaem)
505 if (suptr->un_cnt != seminfo.semume) {
506 sunptr = &suptr->un_ent[suptr->un_cnt];
508 sunptr->un_adjval = adjval;
509 sunptr->un_id = semid;
510 sunptr->un_num = semnum;
511 sunptr->un_seq = semseq;
518 semundo_clear(int semid, int semnum)
520 struct sem_undo *suptr, *suptr1;
524 SEMUNDO_LOCKASSERT(MA_OWNED);
525 LIST_FOREACH_SAFE(suptr, &semu_list, un_next, suptr1) {
526 sunptr = &suptr->un_ent[0];
527 for (i = 0; i < suptr->un_cnt; i++, sunptr++) {
528 if (sunptr->un_id != semid)
530 if (semnum == -1 || sunptr->un_num == semnum) {
532 if (i < suptr->un_cnt) {
534 suptr->un_ent[suptr->un_cnt];
537 semu_try_free(suptr);
546 semvalid(int semid, struct prison *rpr, struct semid_kernel *semakptr)
549 return ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
550 semakptr->u.sem_perm.seq != IPCID_TO_SEQ(semid) ||
551 sem_prison_cansee(rpr, semakptr) ? EINVAL : 0);
555 sem_remove(int semidx, struct ucred *cred)
557 struct semid_kernel *semakptr;
560 KASSERT(semidx >= 0 && semidx < seminfo.semmni,
561 ("semidx out of bounds"));
562 mtx_assert(&sem_mtx, MA_OWNED);
563 semakptr = &sema[semidx];
564 KASSERT(semakptr->u.__sem_base - sem + semakptr->u.sem_nsems <= semtot,
565 ("sem_remove: sema %d corrupted sem pointer %p %p %d %d",
566 semidx, semakptr->u.__sem_base, sem, semakptr->u.sem_nsems,
569 semakptr->u.sem_perm.cuid = cred ? cred->cr_uid : 0;
570 semakptr->u.sem_perm.uid = cred ? cred->cr_uid : 0;
571 semakptr->u.sem_perm.mode = 0;
572 racct_sub_cred(semakptr->cred, RACCT_NSEM, semakptr->u.sem_nsems);
573 crfree(semakptr->cred);
574 semakptr->cred = NULL;
576 semundo_clear(semidx, -1);
579 mac_sysvsem_cleanup(semakptr);
582 for (i = 0; i < seminfo.semmni; i++) {
583 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
584 sema[i].u.__sem_base > semakptr->u.__sem_base)
585 mtx_lock_flags(&sema_mtx[i], LOP_DUPOK);
587 for (i = semakptr->u.__sem_base - sem + semakptr->u.sem_nsems;
589 sem[i - semakptr->u.sem_nsems] = sem[i];
590 for (i = 0; i < seminfo.semmni; i++) {
591 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
592 sema[i].u.__sem_base > semakptr->u.__sem_base) {
593 sema[i].u.__sem_base -= semakptr->u.sem_nsems;
594 mtx_unlock(&sema_mtx[i]);
597 semtot -= semakptr->u.sem_nsems;
600 static struct prison *
601 sem_find_prison(struct ucred *cred)
603 struct prison *pr, *rpr;
605 pr = cred->cr_prison;
607 rpr = osd_jail_get(pr, sem_prison_slot);
613 sem_prison_cansee(struct prison *rpr, struct semid_kernel *semakptr)
616 if (semakptr->cred == NULL ||
617 !(rpr == semakptr->cred->cr_prison ||
618 prison_ischild(rpr, semakptr->cred->cr_prison)))
624 * Note that the user-mode half of this passes a union, not a pointer.
626 #ifndef _SYS_SYSPROTO_H_
627 struct __semctl_args {
635 sys___semctl(struct thread *td, struct __semctl_args *uap)
637 struct semid_ds dsbuf;
638 union semun arg, semun;
649 error = copyin(uap->arg, &arg, sizeof(arg));
661 error = copyin(arg.buf, &dsbuf, sizeof(dsbuf));
668 semun.array = arg.array;
675 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
683 error = copyout(&dsbuf, arg.buf, sizeof(dsbuf));
688 td->td_retval[0] = rval;
693 kern_semctl(struct thread *td, int semid, int semnum, int cmd,
694 union semun *arg, register_t *rval)
697 struct ucred *cred = td->td_ucred;
700 struct semid_ds *sbuf;
701 struct semid_kernel *semakptr;
702 struct mtx *sema_mtxp;
703 u_short usval, count;
706 DPRINTF(("call to semctl(%d, %d, %d, 0x%p)\n",
707 semid, semnum, cmd, arg));
709 AUDIT_ARG_SVIPC_CMD(cmd);
710 AUDIT_ARG_SVIPC_ID(semid);
712 rpr = sem_find_prison(td->td_ucred);
721 * For this command we assume semid is an array index
722 * rather than an IPC id.
724 if (semid < 0 || semid >= seminfo.semmni)
726 semakptr = &sema[semid];
727 sema_mtxp = &sema_mtx[semid];
729 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0) {
733 if ((error = sem_prison_cansee(rpr, semakptr)))
735 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
738 error = mac_sysvsem_check_semctl(cred, semakptr, cmd);
742 bcopy(&semakptr->u, arg->buf, sizeof(struct semid_ds));
743 if (cred->cr_prison != semakptr->cred->cr_prison)
744 arg->buf->sem_perm.key = IPC_PRIVATE;
745 *rval = IXSEQ_TO_IPCID(semid, semakptr->u.sem_perm);
746 mtx_unlock(sema_mtxp);
750 semidx = IPCID_TO_IX(semid);
751 if (semidx < 0 || semidx >= seminfo.semmni)
754 semakptr = &sema[semidx];
755 sema_mtxp = &sema_mtx[semidx];
761 error = mac_sysvsem_check_semctl(cred, semakptr, cmd);
771 if ((error = semvalid(semid, rpr, semakptr)) != 0)
773 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_M)))
775 sem_remove(semidx, cred);
779 AUDIT_ARG_SVIPC_PERM(&arg->buf->sem_perm);
780 if ((error = semvalid(semid, rpr, semakptr)) != 0)
782 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_M)))
785 semakptr->u.sem_perm.uid = sbuf->sem_perm.uid;
786 semakptr->u.sem_perm.gid = sbuf->sem_perm.gid;
787 semakptr->u.sem_perm.mode = (semakptr->u.sem_perm.mode &
788 ~0777) | (sbuf->sem_perm.mode & 0777);
789 semakptr->u.sem_ctime = time_second;
793 if ((error = semvalid(semid, rpr, semakptr)) != 0)
795 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
797 bcopy(&semakptr->u, arg->buf, sizeof(struct semid_ds));
798 if (cred->cr_prison != semakptr->cred->cr_prison)
799 arg->buf->sem_perm.key = IPC_PRIVATE;
802 * Try to hide the fact that the structure layout is shared by
803 * both the kernel and userland. This pointer is not useful to
806 arg->buf->__sem_base = NULL;
810 if ((error = semvalid(semid, rpr, semakptr)) != 0)
812 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
814 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
818 *rval = semakptr->u.__sem_base[semnum].semncnt;
822 if ((error = semvalid(semid, rpr, semakptr)) != 0)
824 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
826 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
830 *rval = semakptr->u.__sem_base[semnum].sempid;
834 if ((error = semvalid(semid, rpr, semakptr)) != 0)
836 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
838 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
842 *rval = semakptr->u.__sem_base[semnum].semval;
847 * Unfortunately, callers of this function don't know
848 * in advance how many semaphores are in this set.
849 * While we could just allocate the maximum size array
850 * and pass the actual size back to the caller, that
851 * won't work for SETALL since we can't copyin() more
852 * data than the user specified as we may return a
855 * Note that the number of semaphores in a set is
856 * fixed for the life of that set. The only way that
857 * the 'count' could change while are blocked in
858 * malloc() is if this semaphore set were destroyed
859 * and a new one created with the same index.
860 * However, semvalid() will catch that due to the
861 * sequence number unless exactly 0x8000 (or a
862 * multiple thereof) semaphore sets for the same index
863 * are created and destroyed while we are in malloc!
866 count = semakptr->u.sem_nsems;
867 mtx_unlock(sema_mtxp);
868 array = malloc(sizeof(*array) * count, M_TEMP, M_WAITOK);
870 if ((error = semvalid(semid, rpr, semakptr)) != 0)
872 KASSERT(count == semakptr->u.sem_nsems, ("nsems changed"));
873 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
875 for (i = 0; i < semakptr->u.sem_nsems; i++)
876 array[i] = semakptr->u.__sem_base[i].semval;
877 mtx_unlock(sema_mtxp);
878 error = copyout(array, arg->array, count * sizeof(*array));
883 if ((error = semvalid(semid, rpr, semakptr)) != 0)
885 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_R)))
887 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
891 *rval = semakptr->u.__sem_base[semnum].semzcnt;
895 if ((error = semvalid(semid, rpr, semakptr)) != 0)
897 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_W)))
899 if (semnum < 0 || semnum >= semakptr->u.sem_nsems) {
903 if (arg->val < 0 || arg->val > seminfo.semvmx) {
907 semakptr->u.__sem_base[semnum].semval = arg->val;
909 semundo_clear(semidx, semnum);
916 * See comment on GETALL for why 'count' shouldn't change
917 * and why we require a userland buffer.
919 count = semakptr->u.sem_nsems;
920 mtx_unlock(sema_mtxp);
921 array = malloc(sizeof(*array) * count, M_TEMP, M_WAITOK);
922 error = copyin(arg->array, array, count * sizeof(*array));
926 if ((error = semvalid(semid, rpr, semakptr)) != 0)
928 KASSERT(count == semakptr->u.sem_nsems, ("nsems changed"));
929 if ((error = ipcperm(td, &semakptr->u.sem_perm, IPC_W)))
931 for (i = 0; i < semakptr->u.sem_nsems; i++) {
933 if (usval > seminfo.semvmx) {
937 semakptr->u.__sem_base[i].semval = usval;
940 semundo_clear(semidx, -1);
951 mtx_unlock(sema_mtxp);
953 mtx_unlock(&sem_mtx);
959 #ifndef _SYS_SYSPROTO_H_
967 sys_semget(struct thread *td, struct semget_args *uap)
969 int semid, error = 0;
971 int nsems = uap->nsems;
972 int semflg = uap->semflg;
973 struct ucred *cred = td->td_ucred;
975 DPRINTF(("semget(0x%x, %d, 0%o)\n", key, nsems, semflg));
977 AUDIT_ARG_VALUE(semflg);
979 if (sem_find_prison(cred) == NULL)
983 if (key != IPC_PRIVATE) {
984 for (semid = 0; semid < seminfo.semmni; semid++) {
985 if ((sema[semid].u.sem_perm.mode & SEM_ALLOC) &&
986 sema[semid].cred != NULL &&
987 sema[semid].cred->cr_prison == cred->cr_prison &&
988 sema[semid].u.sem_perm.key == key)
991 if (semid < seminfo.semmni) {
992 AUDIT_ARG_SVIPC_ID(semid);
993 DPRINTF(("found public key\n"));
994 if ((semflg & IPC_CREAT) && (semflg & IPC_EXCL)) {
995 DPRINTF(("not exclusive\n"));
999 if ((error = ipcperm(td, &sema[semid].u.sem_perm,
1003 if (nsems > 0 && sema[semid].u.sem_nsems < nsems) {
1004 DPRINTF(("too small\n"));
1009 error = mac_sysvsem_check_semget(cred, &sema[semid]);
1017 DPRINTF(("need to allocate the semid_kernel\n"));
1018 if (key == IPC_PRIVATE || (semflg & IPC_CREAT)) {
1019 if (nsems <= 0 || nsems > seminfo.semmsl) {
1020 DPRINTF(("nsems out of range (0<%d<=%d)\n", nsems,
1025 if (nsems > seminfo.semmns - semtot) {
1027 "not enough semaphores left (need %d, got %d)\n",
1028 nsems, seminfo.semmns - semtot));
1032 for (semid = 0; semid < seminfo.semmni; semid++) {
1033 if ((sema[semid].u.sem_perm.mode & SEM_ALLOC) == 0)
1036 if (semid == seminfo.semmni) {
1037 DPRINTF(("no more semid_kernel's available\n"));
1043 PROC_LOCK(td->td_proc);
1044 error = racct_add(td->td_proc, RACCT_NSEM, nsems);
1045 PROC_UNLOCK(td->td_proc);
1052 DPRINTF(("semid %d is available\n", semid));
1053 mtx_lock(&sema_mtx[semid]);
1054 KASSERT((sema[semid].u.sem_perm.mode & SEM_ALLOC) == 0,
1055 ("Lost semaphore %d", semid));
1056 sema[semid].u.sem_perm.key = key;
1057 sema[semid].u.sem_perm.cuid = cred->cr_uid;
1058 sema[semid].u.sem_perm.uid = cred->cr_uid;
1059 sema[semid].u.sem_perm.cgid = cred->cr_gid;
1060 sema[semid].u.sem_perm.gid = cred->cr_gid;
1061 sema[semid].u.sem_perm.mode = (semflg & 0777) | SEM_ALLOC;
1062 sema[semid].cred = crhold(cred);
1063 sema[semid].u.sem_perm.seq =
1064 (sema[semid].u.sem_perm.seq + 1) & 0x7fff;
1065 sema[semid].u.sem_nsems = nsems;
1066 sema[semid].u.sem_otime = 0;
1067 sema[semid].u.sem_ctime = time_second;
1068 sema[semid].u.__sem_base = &sem[semtot];
1070 bzero(sema[semid].u.__sem_base,
1071 sizeof(sema[semid].u.__sem_base[0])*nsems);
1073 mac_sysvsem_create(cred, &sema[semid]);
1075 mtx_unlock(&sema_mtx[semid]);
1076 DPRINTF(("sembase = %p, next = %p\n",
1077 sema[semid].u.__sem_base, &sem[semtot]));
1079 DPRINTF(("didn't find it and wasn't asked to create it\n"));
1085 td->td_retval[0] = IXSEQ_TO_IPCID(semid, sema[semid].u.sem_perm);
1087 mtx_unlock(&sem_mtx);
1091 #ifndef _SYS_SYSPROTO_H_
1094 struct sembuf *sops;
1099 sys_semop(struct thread *td, struct semop_args *uap)
1102 return (kern_semop(td, uap->semid, uap->sops, uap->nsops, NULL));
1106 kern_semop(struct thread *td, int usemid, struct sembuf *usops,
1107 size_t nsops, struct timespec *timeout)
1109 #define SMALL_SOPS 8
1110 struct sembuf small_sops[SMALL_SOPS];
1113 struct sembuf *sops;
1114 struct semid_kernel *semakptr;
1115 struct sembuf *sopptr = NULL;
1116 struct sem *semptr = NULL;
1117 struct sem_undo *suptr;
1118 struct mtx *sema_mtxp;
1119 sbintime_t sbt, precision;
1122 int do_wakeup, do_undos;
1128 DPRINTF(("call to semop(%d, %p, %u)\n", usemid, usops, nsops));
1130 AUDIT_ARG_SVIPC_ID(usemid);
1132 rpr = sem_find_prison(td->td_ucred);
1136 semid = IPCID_TO_IX(usemid); /* Convert back to zero origin */
1138 if (semid < 0 || semid >= seminfo.semmni)
1140 if (timeout != NULL) {
1141 if (!timespecvalid_interval(timeout))
1144 if (timespecisset(timeout)) {
1145 if (timeout->tv_sec < INT32_MAX / 2) {
1146 precision = tstosbt(*timeout);
1147 if (TIMESEL(&sbt, precision))
1150 precision >>= tc_precexp;
1156 precision = sbt = 0;
1158 /* Allocate memory for sem_ops */
1159 if (nsops <= SMALL_SOPS)
1161 else if (nsops > seminfo.semopm) {
1162 DPRINTF(("too many sops (max=%d, nsops=%d)\n", seminfo.semopm,
1168 PROC_LOCK(td->td_proc);
1170 racct_get_available(td->td_proc, RACCT_NSEMOP)) {
1171 PROC_UNLOCK(td->td_proc);
1174 PROC_UNLOCK(td->td_proc);
1178 sops = malloc(nsops * sizeof(*sops), M_TEMP, M_WAITOK);
1180 if ((error = copyin(usops, sops, nsops * sizeof(sops[0]))) != 0) {
1181 DPRINTF(("error = %d from copyin(%p, %p, %d)\n", error,
1182 usops, sops, nsops * sizeof(sops[0])));
1183 if (sops != small_sops)
1188 semakptr = &sema[semid];
1189 sema_mtxp = &sema_mtx[semid];
1190 mtx_lock(sema_mtxp);
1191 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0) {
1195 seq = semakptr->u.sem_perm.seq;
1196 if (seq != IPCID_TO_SEQ(usemid)) {
1200 if ((error = sem_prison_cansee(rpr, semakptr)) != 0)
1203 * Initial pass through sops to see what permissions are needed.
1204 * Also perform any checks that don't need repeating on each
1205 * attempt to satisfy the request vector.
1207 j = 0; /* permission needed */
1209 for (i = 0; i < nsops; i++) {
1211 if (sopptr->sem_num >= semakptr->u.sem_nsems) {
1215 if (sopptr->sem_flg & SEM_UNDO && sopptr->sem_op != 0)
1217 j |= (sopptr->sem_op == 0) ? SEM_R : SEM_A;
1220 if ((error = ipcperm(td, &semakptr->u.sem_perm, j))) {
1221 DPRINTF(("error = %d from ipaccess\n", error));
1225 error = mac_sysvsem_check_semop(td->td_ucred, semakptr, j);
1231 * Loop trying to satisfy the vector of requests.
1232 * If we reach a point where we must wait, any requests already
1233 * performed are rolled back and we go to sleep until some other
1234 * process wakes us up. At this point, we start all over again.
1236 * This ensures that from the perspective of other tasks, a set
1237 * of requests is atomic (never partially satisfied).
1241 error = 0; /* error return if necessary */
1243 for (i = 0; i < nsops; i++) {
1245 semptr = &semakptr->u.__sem_base[sopptr->sem_num];
1248 "semop: semakptr=%p, __sem_base=%p, "
1249 "semptr=%p, sem[%d]=%d : op=%d, flag=%s\n",
1250 semakptr, semakptr->u.__sem_base, semptr,
1251 sopptr->sem_num, semptr->semval, sopptr->sem_op,
1252 (sopptr->sem_flg & IPC_NOWAIT) ?
1253 "nowait" : "wait"));
1255 if (sopptr->sem_op < 0) {
1256 if (semptr->semval + sopptr->sem_op < 0) {
1257 DPRINTF(("semop: can't do it now\n"));
1260 semptr->semval += sopptr->sem_op;
1261 if (semptr->semval == 0 &&
1262 semptr->semzcnt > 0)
1265 } else if (sopptr->sem_op == 0) {
1266 if (semptr->semval != 0) {
1267 DPRINTF(("semop: not zero now\n"));
1270 } else if (semptr->semval + sopptr->sem_op >
1275 if (semptr->semncnt > 0)
1277 semptr->semval += sopptr->sem_op;
1282 * Did we get through the entire vector?
1288 * No ... rollback anything that we've already done
1290 DPRINTF(("semop: rollback 0 through %d\n", i-1));
1291 for (j = 0; j < i; j++)
1292 semakptr->u.__sem_base[sops[j].sem_num].semval -=
1295 /* If we detected an error, return it */
1300 * If the request that we couldn't satisfy has the
1301 * NOWAIT flag set then return with EAGAIN.
1303 if (sopptr->sem_flg & IPC_NOWAIT) {
1308 if (sopptr->sem_op == 0)
1313 DPRINTF(("semop: good night!\n"));
1314 error = msleep_sbt(semakptr, sema_mtxp, (PZERO - 4) | PCATCH,
1315 "semwait", sbt, precision, C_ABSOLUTE);
1316 DPRINTF(("semop: good morning (error=%d)!\n", error));
1317 /* return code is checked below, after sem[nz]cnt-- */
1320 * Make sure that the semaphore still exists
1322 seq = semakptr->u.sem_perm.seq;
1323 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
1324 seq != IPCID_TO_SEQ(usemid)) {
1330 * Renew the semaphore's pointer after wakeup since
1331 * during msleep __sem_base may have been modified and semptr
1332 * is not valid any more
1334 semptr = &semakptr->u.__sem_base[sopptr->sem_num];
1337 * The semaphore is still alive. Readjust the count of
1338 * waiting processes.
1340 if (sopptr->sem_op == 0)
1346 * Is it really morning, or was our sleep interrupted?
1347 * (Delayed check of msleep() return code because we
1348 * need to decrement sem[nz]cnt either way.)
1351 if (error == ERESTART)
1355 DPRINTF(("semop: good morning!\n"));
1360 * Process any SEM_UNDO requests.
1365 for (i = 0; i < nsops; i++) {
1367 * We only need to deal with SEM_UNDO's for non-zero
1372 if ((sops[i].sem_flg & SEM_UNDO) == 0)
1374 adjval = sops[i].sem_op;
1377 error = semundo_adjust(td, &suptr, semid, seq,
1378 sops[i].sem_num, -adjval);
1383 * Oh-Oh! We ran out of either sem_undo's or undo's.
1384 * Rollback the adjustments to this point and then
1385 * rollback the semaphore ups and down so we can return
1386 * with an error with all structures restored. We
1387 * rollback the undo's in the exact reverse order that
1388 * we applied them. This guarantees that we won't run
1389 * out of space as we roll things back out.
1391 for (j = 0; j < i; j++) {
1393 if ((sops[k].sem_flg & SEM_UNDO) == 0)
1395 adjval = sops[k].sem_op;
1398 if (semundo_adjust(td, &suptr, semid, seq,
1399 sops[k].sem_num, adjval) != 0)
1400 panic("semop - can't undo undos");
1403 for (j = 0; j < nsops; j++)
1404 semakptr->u.__sem_base[sops[j].sem_num].semval -=
1407 DPRINTF(("error = %d from semundo_adjust\n", error));
1410 } /* loop through the sops */
1412 } /* if (do_undos) */
1414 /* We're definitely done - set the sempid's and time */
1415 for (i = 0; i < nsops; i++) {
1417 semptr = &semakptr->u.__sem_base[sopptr->sem_num];
1418 semptr->sempid = td->td_proc->p_pid;
1420 semakptr->u.sem_otime = time_second;
1423 * Do a wakeup if any semaphore was up'd whilst something was
1427 DPRINTF(("semop: doing wakeup\n"));
1429 DPRINTF(("semop: back from wakeup\n"));
1431 DPRINTF(("semop: done\n"));
1432 td->td_retval[0] = 0;
1434 mtx_unlock(sema_mtxp);
1435 if (sops != small_sops)
1441 * Go through the undo structures for this process and apply the adjustments to
1445 semexit_myhook(void *arg, struct proc *p)
1447 struct sem_undo *suptr;
1448 struct semid_kernel *semakptr;
1449 struct mtx *sema_mtxp;
1450 int semid, semnum, adjval, ix;
1454 * Go through the chain of undo vectors looking for one
1455 * associated with this process.
1457 if (LIST_EMPTY(&semu_list))
1460 LIST_FOREACH(suptr, &semu_list, un_next) {
1461 if (suptr->un_proc == p)
1464 if (suptr == NULL) {
1468 LIST_REMOVE(suptr, un_next);
1470 DPRINTF(("proc @%p has undo structure with %d entries\n", p,
1474 * If there are any active undo elements then process them.
1476 if (suptr->un_cnt > 0) {
1478 for (ix = 0; ix < suptr->un_cnt; ix++) {
1479 semid = suptr->un_ent[ix].un_id;
1480 semnum = suptr->un_ent[ix].un_num;
1481 adjval = suptr->un_ent[ix].un_adjval;
1482 seq = suptr->un_ent[ix].un_seq;
1483 semakptr = &sema[semid];
1484 sema_mtxp = &sema_mtx[semid];
1486 mtx_lock(sema_mtxp);
1487 if ((semakptr->u.sem_perm.mode & SEM_ALLOC) == 0 ||
1488 (semakptr->u.sem_perm.seq != seq)) {
1489 mtx_unlock(sema_mtxp);
1492 if (semnum >= semakptr->u.sem_nsems)
1493 panic("semexit - semnum out of range");
1496 "semexit: %p id=%d num=%d(adj=%d) ; sem=%d\n",
1497 suptr->un_proc, suptr->un_ent[ix].un_id,
1498 suptr->un_ent[ix].un_num,
1499 suptr->un_ent[ix].un_adjval,
1500 semakptr->u.__sem_base[semnum].semval));
1502 if (adjval < 0 && semakptr->u.__sem_base[semnum].semval <
1504 semakptr->u.__sem_base[semnum].semval = 0;
1506 semakptr->u.__sem_base[semnum].semval += adjval;
1509 DPRINTF(("semexit: back from wakeup\n"));
1510 mtx_unlock(sema_mtxp);
1516 * Deallocate the undo vector.
1518 DPRINTF(("removing vector\n"));
1519 suptr->un_proc = NULL;
1521 LIST_INSERT_HEAD(&semu_free_list, suptr, un_next);
1526 sysctl_sema(SYSCTL_HANDLER_ARGS)
1528 struct prison *pr, *rpr;
1529 struct semid_kernel tsemak;
1530 #ifdef COMPAT_FREEBSD32
1531 struct semid_kernel32 tsemak32;
1537 pr = req->td->td_ucred->cr_prison;
1538 rpr = sem_find_prison(req->td->td_ucred);
1540 for (i = 0; i < seminfo.semmni; i++) {
1541 mtx_lock(&sema_mtx[i]);
1542 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) == 0 ||
1543 rpr == NULL || sem_prison_cansee(rpr, &sema[i]) != 0)
1544 bzero(&tsemak, sizeof(tsemak));
1547 if (tsemak.cred->cr_prison != pr)
1548 tsemak.u.sem_perm.key = IPC_PRIVATE;
1550 mtx_unlock(&sema_mtx[i]);
1551 #ifdef COMPAT_FREEBSD32
1552 if (SV_CURPROC_FLAG(SV_ILP32)) {
1553 bzero(&tsemak32, sizeof(tsemak32));
1554 freebsd32_ipcperm_out(&tsemak.u.sem_perm,
1555 &tsemak32.u.sem_perm);
1556 /* Don't copy u.__sem_base */
1557 CP(tsemak, tsemak32, u.sem_nsems);
1558 CP(tsemak, tsemak32, u.sem_otime);
1559 CP(tsemak, tsemak32, u.sem_ctime);
1560 /* Don't copy label or cred */
1561 outaddr = &tsemak32;
1562 outsize = sizeof(tsemak32);
1566 tsemak.u.__sem_base = NULL;
1567 tsemak.label = NULL;
1570 outsize = sizeof(tsemak);
1572 error = SYSCTL_OUT(req, outaddr, outsize);
1580 sem_prison_check(void *obj, void *data)
1582 struct prison *pr = obj;
1583 struct prison *prpr;
1584 struct vfsoptlist *opts = data;
1588 * sysvsem is a jailsys integer.
1589 * It must be "disable" if the parent jail is disabled.
1591 error = vfs_copyopt(opts, "sysvsem", &jsys, sizeof(jsys));
1592 if (error != ENOENT) {
1596 case JAIL_SYS_DISABLE:
1599 case JAIL_SYS_INHERIT:
1600 prison_lock(pr->pr_parent);
1601 prpr = osd_jail_get(pr->pr_parent, sem_prison_slot);
1602 prison_unlock(pr->pr_parent);
1615 sem_prison_set(void *obj, void *data)
1617 struct prison *pr = obj;
1618 struct prison *tpr, *orpr, *nrpr, *trpr;
1619 struct vfsoptlist *opts = data;
1624 * sysvsem controls which jail is the root of the associated sems (this
1625 * jail or same as the parent), or if the feature is available at all.
1627 if (vfs_copyopt(opts, "sysvsem", &jsys, sizeof(jsys)) == ENOENT)
1628 jsys = vfs_flagopt(opts, "allow.sysvipc", NULL, 0)
1630 : vfs_flagopt(opts, "allow.nosysvipc", NULL, 0)
1633 if (jsys == JAIL_SYS_DISABLE) {
1635 orpr = osd_jail_get(pr, sem_prison_slot);
1637 osd_jail_del(pr, sem_prison_slot);
1641 sem_prison_cleanup(pr);
1642 /* Disable all child jails as well. */
1643 FOREACH_PRISON_DESCENDANT(pr, tpr, descend) {
1645 trpr = osd_jail_get(tpr, sem_prison_slot);
1647 osd_jail_del(tpr, sem_prison_slot);
1650 sem_prison_cleanup(tpr);
1657 } else if (jsys != -1) {
1658 if (jsys == JAIL_SYS_NEW)
1661 prison_lock(pr->pr_parent);
1662 nrpr = osd_jail_get(pr->pr_parent, sem_prison_slot);
1663 prison_unlock(pr->pr_parent);
1665 rsv = osd_reserve(sem_prison_slot);
1667 orpr = osd_jail_get(pr, sem_prison_slot);
1669 (void)osd_jail_set_reserved(pr, sem_prison_slot, rsv,
1672 osd_free_reserved(rsv);
1676 sem_prison_cleanup(pr);
1678 /* Change child jails matching the old root, */
1679 FOREACH_PRISON_DESCENDANT(pr, tpr, descend) {
1681 trpr = osd_jail_get(tpr,
1684 (void)osd_jail_set(tpr,
1685 sem_prison_slot, nrpr);
1688 sem_prison_cleanup(tpr);
1702 sem_prison_get(void *obj, void *data)
1704 struct prison *pr = obj;
1706 struct vfsoptlist *opts = data;
1709 /* Set sysvsem based on the jail's root prison. */
1711 rpr = osd_jail_get(pr, sem_prison_slot);
1713 jsys = rpr == NULL ? JAIL_SYS_DISABLE
1714 : rpr == pr ? JAIL_SYS_NEW : JAIL_SYS_INHERIT;
1715 error = vfs_setopt(opts, "sysvsem", &jsys, sizeof(jsys));
1716 if (error == ENOENT)
1722 sem_prison_remove(void *obj, void *data __unused)
1724 struct prison *pr = obj;
1728 rpr = osd_jail_get(pr, sem_prison_slot);
1731 sem_prison_cleanup(pr);
1736 sem_prison_cleanup(struct prison *pr)
1740 /* Remove any sems that belong to this jail. */
1742 for (i = 0; i < seminfo.semmni; i++) {
1743 if ((sema[i].u.sem_perm.mode & SEM_ALLOC) &&
1744 sema[i].cred != NULL && sema[i].cred->cr_prison == pr) {
1745 mtx_lock(&sema_mtx[i]);
1746 sem_remove(i, NULL);
1747 mtx_unlock(&sema_mtx[i]);
1750 mtx_unlock(&sem_mtx);
1753 SYSCTL_JAIL_PARAM_SYS_NODE(sysvsem, CTLFLAG_RW, "SYSV semaphores");
1755 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1756 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1758 /* XXX casting to (sy_call_t *) is bogus, as usual. */
1759 static sy_call_t *semcalls[] = {
1760 (sy_call_t *)freebsd7___semctl, (sy_call_t *)sys_semget,
1761 (sy_call_t *)sys_semop
1765 * Entry point for all SEM calls.
1770 /* XXX actually varargs. */
1771 struct semsys_args /* {
1781 AUDIT_ARG_SVIPC_WHICH(uap->which);
1782 if (uap->which < 0 || uap->which >= nitems(semcalls))
1784 error = (*semcalls[uap->which])(td, &uap->a2);
1788 #ifndef _SYS_SYSPROTO_H_
1789 struct freebsd7___semctl_args {
1793 union semun_old *arg;
1797 freebsd7___semctl(struct thread *td, struct freebsd7___semctl_args *uap)
1799 struct semid_ds_old dsold;
1800 struct semid_ds dsbuf;
1801 union semun_old arg;
1813 error = copyin(uap->arg, &arg, sizeof(arg));
1825 error = copyin(arg.buf, &dsold, sizeof(dsold));
1828 ipcperm_old2new(&dsold.sem_perm, &dsbuf.sem_perm);
1829 CP(dsold, dsbuf, __sem_base);
1830 CP(dsold, dsbuf, sem_nsems);
1831 CP(dsold, dsbuf, sem_otime);
1832 CP(dsold, dsbuf, sem_ctime);
1837 semun.array = arg.array;
1840 semun.val = arg.val;
1844 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
1852 bzero(&dsold, sizeof(dsold));
1853 ipcperm_new2old(&dsbuf.sem_perm, &dsold.sem_perm);
1854 CP(dsbuf, dsold, __sem_base);
1855 CP(dsbuf, dsold, sem_nsems);
1856 CP(dsbuf, dsold, sem_otime);
1857 CP(dsbuf, dsold, sem_ctime);
1858 error = copyout(&dsold, arg.buf, sizeof(dsold));
1863 td->td_retval[0] = rval;
1867 #endif /* COMPAT_FREEBSD{4,5,6,7} */
1869 #ifdef COMPAT_FREEBSD32
1872 freebsd32_semsys(struct thread *td, struct freebsd32_semsys_args *uap)
1875 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1876 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1877 AUDIT_ARG_SVIPC_WHICH(uap->which);
1878 switch (uap->which) {
1880 return (freebsd7_freebsd32_semctl(td,
1881 (struct freebsd7_freebsd32_semctl_args *)&uap->a2));
1883 return (sys_semsys(td, (struct semsys_args *)uap));
1886 return (nosys(td, NULL));
1890 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
1891 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
1893 freebsd7_freebsd32_semctl(struct thread *td,
1894 struct freebsd7_freebsd32_semctl_args *uap)
1896 struct semid_ds32_old dsbuf32;
1897 struct semid_ds dsbuf;
1910 error = copyin(uap->arg, &arg, sizeof(arg));
1922 error = copyin(PTRIN(arg.buf), &dsbuf32, sizeof(dsbuf32));
1925 freebsd32_ipcperm_old_in(&dsbuf32.sem_perm, &dsbuf.sem_perm);
1926 PTRIN_CP(dsbuf32, dsbuf, __sem_base);
1927 CP(dsbuf32, dsbuf, sem_nsems);
1928 CP(dsbuf32, dsbuf, sem_otime);
1929 CP(dsbuf32, dsbuf, sem_ctime);
1934 semun.array = PTRIN(arg.array);
1937 semun.val = arg.val;
1941 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
1949 bzero(&dsbuf32, sizeof(dsbuf32));
1950 freebsd32_ipcperm_old_out(&dsbuf.sem_perm, &dsbuf32.sem_perm);
1951 PTROUT_CP(dsbuf, dsbuf32, __sem_base);
1952 CP(dsbuf, dsbuf32, sem_nsems);
1953 CP(dsbuf, dsbuf32, sem_otime);
1954 CP(dsbuf, dsbuf32, sem_ctime);
1955 error = copyout(&dsbuf32, PTRIN(arg.buf), sizeof(dsbuf32));
1960 td->td_retval[0] = rval;
1966 freebsd32_semctl(struct thread *td, struct freebsd32_semctl_args *uap)
1968 struct semid_ds32 dsbuf32;
1969 struct semid_ds dsbuf;
1982 error = copyin(uap->arg, &arg, sizeof(arg));
1994 error = copyin(PTRIN(arg.buf), &dsbuf32, sizeof(dsbuf32));
1997 freebsd32_ipcperm_in(&dsbuf32.sem_perm, &dsbuf.sem_perm);
1998 PTRIN_CP(dsbuf32, dsbuf, __sem_base);
1999 CP(dsbuf32, dsbuf, sem_nsems);
2000 CP(dsbuf32, dsbuf, sem_otime);
2001 CP(dsbuf32, dsbuf, sem_ctime);
2006 semun.array = PTRIN(arg.array);
2009 semun.val = arg.val;
2013 error = kern_semctl(td, uap->semid, uap->semnum, uap->cmd, &semun,
2021 bzero(&dsbuf32, sizeof(dsbuf32));
2022 freebsd32_ipcperm_out(&dsbuf.sem_perm, &dsbuf32.sem_perm);
2023 PTROUT_CP(dsbuf, dsbuf32, __sem_base);
2024 CP(dsbuf, dsbuf32, sem_nsems);
2025 CP(dsbuf, dsbuf32, sem_otime);
2026 CP(dsbuf, dsbuf32, sem_ctime);
2027 error = copyout(&dsbuf32, PTRIN(arg.buf), sizeof(dsbuf32));
2032 td->td_retval[0] = rval;
2036 #endif /* COMPAT_FREEBSD32 */