852 lines
18 KiB
C
852 lines
18 KiB
C
/* $NetBSD: uipc_sem.c,v 1.47 2016/10/31 15:08:45 maxv Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 2011 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Mindaugas Rasiukevicius.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 2002 Alfred Perlstein <alfred@FreeBSD.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* Implementation of POSIX semaphore.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__KERNEL_RCSID(0, "$NetBSD: uipc_sem.c,v 1.47 2016/10/31 15:08:45 maxv Exp $");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/atomic.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/ksem.h>
|
|
#include <sys/syscall.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/kmem.h>
|
|
#include <sys/fcntl.h>
|
|
#include <sys/file.h>
|
|
#include <sys/filedesc.h>
|
|
#include <sys/kauth.h>
|
|
#include <sys/module.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/semaphore.h>
|
|
#include <sys/syscall.h>
|
|
#include <sys/syscallargs.h>
|
|
#include <sys/syscallvar.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
MODULE(MODULE_CLASS_MISC, ksem, NULL);
|
|
|
|
#define SEM_MAX_NAMELEN 14
|
|
|
|
#define SEM_NSEMS_MAX 256
|
|
#define KS_UNLINKED 0x01
|
|
|
|
static kmutex_t ksem_lock __cacheline_aligned;
|
|
static LIST_HEAD(,ksem) ksem_head __cacheline_aligned;
|
|
static u_int nsems_total __cacheline_aligned;
|
|
static u_int nsems __cacheline_aligned;
|
|
|
|
static kauth_listener_t ksem_listener;
|
|
|
|
static int ksem_sysinit(void);
|
|
static int ksem_sysfini(bool);
|
|
static int ksem_modcmd(modcmd_t, void *);
|
|
static int ksem_close_fop(file_t *);
|
|
static int ksem_stat_fop(file_t *, struct stat *);
|
|
static int ksem_read_fop(file_t *, off_t *, struct uio *,
|
|
kauth_cred_t, int);
|
|
|
|
static const struct fileops semops = {
|
|
.fo_read = ksem_read_fop,
|
|
.fo_write = fbadop_write,
|
|
.fo_ioctl = fbadop_ioctl,
|
|
.fo_fcntl = fnullop_fcntl,
|
|
.fo_poll = fnullop_poll,
|
|
.fo_stat = ksem_stat_fop,
|
|
.fo_close = ksem_close_fop,
|
|
.fo_kqfilter = fnullop_kqfilter,
|
|
.fo_restart = fnullop_restart,
|
|
};
|
|
|
|
static const struct syscall_package ksem_syscalls[] = {
|
|
{ SYS__ksem_init, 0, (sy_call_t *)sys__ksem_init },
|
|
{ SYS__ksem_open, 0, (sy_call_t *)sys__ksem_open },
|
|
{ SYS__ksem_unlink, 0, (sy_call_t *)sys__ksem_unlink },
|
|
{ SYS__ksem_close, 0, (sy_call_t *)sys__ksem_close },
|
|
{ SYS__ksem_post, 0, (sy_call_t *)sys__ksem_post },
|
|
{ SYS__ksem_wait, 0, (sy_call_t *)sys__ksem_wait },
|
|
{ SYS__ksem_trywait, 0, (sy_call_t *)sys__ksem_trywait },
|
|
{ SYS__ksem_getvalue, 0, (sy_call_t *)sys__ksem_getvalue },
|
|
{ SYS__ksem_destroy, 0, (sy_call_t *)sys__ksem_destroy },
|
|
{ SYS__ksem_timedwait, 0, (sy_call_t *)sys__ksem_timedwait },
|
|
{ 0, 0, NULL },
|
|
};
|
|
|
|
struct sysctllog *ksem_clog;
|
|
int ksem_max;
|
|
|
|
static int
|
|
ksem_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
|
|
void *arg0, void *arg1, void *arg2, void *arg3)
|
|
{
|
|
ksem_t *ks;
|
|
mode_t mode;
|
|
|
|
if (action != KAUTH_SYSTEM_SEMAPHORE)
|
|
return KAUTH_RESULT_DEFER;
|
|
|
|
ks = arg1;
|
|
mode = ks->ks_mode;
|
|
|
|
if ((kauth_cred_geteuid(cred) == ks->ks_uid && (mode & S_IWUSR) != 0) ||
|
|
(kauth_cred_getegid(cred) == ks->ks_gid && (mode & S_IWGRP) != 0) ||
|
|
(mode & S_IWOTH) != 0)
|
|
return KAUTH_RESULT_ALLOW;
|
|
|
|
return KAUTH_RESULT_DEFER;
|
|
}
|
|
|
|
static int
|
|
ksem_sysinit(void)
|
|
{
|
|
int error;
|
|
const struct sysctlnode *rnode;
|
|
|
|
mutex_init(&ksem_lock, MUTEX_DEFAULT, IPL_NONE);
|
|
LIST_INIT(&ksem_head);
|
|
nsems_total = 0;
|
|
nsems = 0;
|
|
|
|
error = syscall_establish(NULL, ksem_syscalls);
|
|
if (error) {
|
|
(void)ksem_sysfini(false);
|
|
}
|
|
|
|
ksem_listener = kauth_listen_scope(KAUTH_SCOPE_SYSTEM,
|
|
ksem_listener_cb, NULL);
|
|
|
|
/* Define module-specific sysctl tree */
|
|
|
|
ksem_max = KSEM_MAX;
|
|
ksem_clog = NULL;
|
|
|
|
sysctl_createv(&ksem_clog, 0, NULL, &rnode,
|
|
CTLFLAG_PERMANENT,
|
|
CTLTYPE_NODE, "posix",
|
|
SYSCTL_DESCR("POSIX options"),
|
|
NULL, 0, NULL, 0,
|
|
CTL_KERN, CTL_CREATE, CTL_EOL);
|
|
sysctl_createv(&ksem_clog, 0, &rnode, NULL,
|
|
CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
|
|
CTLTYPE_INT, "semmax",
|
|
SYSCTL_DESCR("Maximal number of semaphores"),
|
|
NULL, 0, &ksem_max, 0,
|
|
CTL_CREATE, CTL_EOL);
|
|
sysctl_createv(&ksem_clog, 0, &rnode, NULL,
|
|
CTLFLAG_PERMANENT | CTLFLAG_READONLY,
|
|
CTLTYPE_INT, "semcnt",
|
|
SYSCTL_DESCR("Current number of semaphores"),
|
|
NULL, 0, &nsems, 0,
|
|
CTL_CREATE, CTL_EOL);
|
|
|
|
return error;
|
|
}
|
|
|
|
static int
|
|
ksem_sysfini(bool interface)
|
|
{
|
|
int error;
|
|
|
|
if (interface) {
|
|
error = syscall_disestablish(NULL, ksem_syscalls);
|
|
if (error != 0) {
|
|
return error;
|
|
}
|
|
/*
|
|
* Make sure that no semaphores are in use. Note: semops
|
|
* must be unused at this point.
|
|
*/
|
|
if (nsems_total) {
|
|
error = syscall_establish(NULL, ksem_syscalls);
|
|
KASSERT(error == 0);
|
|
return EBUSY;
|
|
}
|
|
}
|
|
kauth_unlisten_scope(ksem_listener);
|
|
mutex_destroy(&ksem_lock);
|
|
sysctl_teardown(&ksem_clog);
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
ksem_modcmd(modcmd_t cmd, void *arg)
|
|
{
|
|
|
|
switch (cmd) {
|
|
case MODULE_CMD_INIT:
|
|
return ksem_sysinit();
|
|
|
|
case MODULE_CMD_FINI:
|
|
return ksem_sysfini(true);
|
|
|
|
default:
|
|
return ENOTTY;
|
|
}
|
|
}
|
|
|
|
static ksem_t *
|
|
ksem_lookup(const char *name)
|
|
{
|
|
ksem_t *ks;
|
|
|
|
KASSERT(mutex_owned(&ksem_lock));
|
|
|
|
LIST_FOREACH(ks, &ksem_head, ks_entry) {
|
|
if (strcmp(ks->ks_name, name) == 0) {
|
|
mutex_enter(&ks->ks_lock);
|
|
return ks;
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static int
|
|
ksem_perm(lwp_t *l, ksem_t *ks)
|
|
{
|
|
kauth_cred_t uc = l->l_cred;
|
|
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
|
|
if (kauth_authorize_system(uc, KAUTH_SYSTEM_SEMAPHORE, 0, ks, NULL, NULL) != 0)
|
|
return EACCES;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* ksem_get: get the semaphore from the descriptor.
|
|
*
|
|
* => locks the semaphore, if found.
|
|
* => holds a reference on the file descriptor.
|
|
*/
|
|
static int
|
|
ksem_get(int fd, ksem_t **ksret)
|
|
{
|
|
ksem_t *ks;
|
|
file_t *fp;
|
|
|
|
fp = fd_getfile(fd);
|
|
if (__predict_false(fp == NULL))
|
|
return EINVAL;
|
|
if (__predict_false(fp->f_type != DTYPE_SEM)) {
|
|
fd_putfile(fd);
|
|
return EINVAL;
|
|
}
|
|
ks = fp->f_ksem;
|
|
mutex_enter(&ks->ks_lock);
|
|
|
|
*ksret = ks;
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* ksem_create: allocate and setup a new semaphore structure.
|
|
*/
|
|
static int
|
|
ksem_create(lwp_t *l, const char *name, ksem_t **ksret, mode_t mode, u_int val)
|
|
{
|
|
ksem_t *ks;
|
|
kauth_cred_t uc;
|
|
char *kname;
|
|
size_t len;
|
|
|
|
/* Pre-check for the limit. */
|
|
if (nsems >= ksem_max) {
|
|
return ENFILE;
|
|
}
|
|
|
|
if (val > SEM_VALUE_MAX) {
|
|
return EINVAL;
|
|
}
|
|
|
|
if (name != NULL) {
|
|
len = strlen(name);
|
|
if (len > SEM_MAX_NAMELEN) {
|
|
return ENAMETOOLONG;
|
|
}
|
|
/* Name must start with a '/' but not contain one. */
|
|
if (*name != '/' || len < 2 || strchr(name + 1, '/') != NULL) {
|
|
return EINVAL;
|
|
}
|
|
kname = kmem_alloc(++len, KM_SLEEP);
|
|
strlcpy(kname, name, len);
|
|
} else {
|
|
kname = NULL;
|
|
len = 0;
|
|
}
|
|
|
|
if (atomic_inc_uint_nv(&l->l_proc->p_nsems) > SEM_NSEMS_MAX) {
|
|
atomic_dec_uint(&l->l_proc->p_nsems);
|
|
if (kname != NULL)
|
|
kmem_free(kname, len);
|
|
return -1;
|
|
}
|
|
|
|
ks = kmem_zalloc(sizeof(ksem_t), KM_SLEEP);
|
|
mutex_init(&ks->ks_lock, MUTEX_DEFAULT, IPL_NONE);
|
|
cv_init(&ks->ks_cv, "psem");
|
|
ks->ks_name = kname;
|
|
ks->ks_namelen = len;
|
|
ks->ks_mode = mode;
|
|
ks->ks_value = val;
|
|
ks->ks_ref = 1;
|
|
|
|
uc = l->l_cred;
|
|
ks->ks_uid = kauth_cred_geteuid(uc);
|
|
ks->ks_gid = kauth_cred_getegid(uc);
|
|
|
|
atomic_inc_uint(&nsems_total);
|
|
*ksret = ks;
|
|
return 0;
|
|
}
|
|
|
|
static void
|
|
ksem_free(ksem_t *ks)
|
|
{
|
|
|
|
KASSERT(!cv_has_waiters(&ks->ks_cv));
|
|
|
|
if (ks->ks_name) {
|
|
KASSERT(ks->ks_namelen > 0);
|
|
kmem_free(ks->ks_name, ks->ks_namelen);
|
|
}
|
|
mutex_destroy(&ks->ks_lock);
|
|
cv_destroy(&ks->ks_cv);
|
|
kmem_free(ks, sizeof(ksem_t));
|
|
|
|
atomic_dec_uint(&nsems_total);
|
|
atomic_dec_uint(&curproc->p_nsems);
|
|
}
|
|
|
|
int
|
|
sys__ksem_init(struct lwp *l, const struct sys__ksem_init_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
unsigned int value;
|
|
intptr_t *idp;
|
|
} */
|
|
|
|
return do_ksem_init(l, SCARG(uap, value), SCARG(uap, idp), copyout);
|
|
}
|
|
|
|
int
|
|
do_ksem_init(lwp_t *l, u_int val, intptr_t *idp, copyout_t docopyout)
|
|
{
|
|
proc_t *p = l->l_proc;
|
|
ksem_t *ks;
|
|
file_t *fp;
|
|
intptr_t id;
|
|
int fd, error;
|
|
|
|
error = fd_allocfile(&fp, &fd);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
fp->f_type = DTYPE_SEM;
|
|
fp->f_flag = FREAD | FWRITE;
|
|
fp->f_ops = &semops;
|
|
|
|
id = (intptr_t)fd;
|
|
error = (*docopyout)(&id, idp, sizeof(*idp));
|
|
if (error) {
|
|
fd_abort(p, fp, fd);
|
|
return error;
|
|
}
|
|
|
|
/* Note the mode does not matter for anonymous semaphores. */
|
|
error = ksem_create(l, NULL, &ks, 0, val);
|
|
if (error) {
|
|
fd_abort(p, fp, fd);
|
|
return error;
|
|
}
|
|
fp->f_ksem = ks;
|
|
fd_affix(p, fp, fd);
|
|
return error;
|
|
}
|
|
|
|
int
|
|
sys__ksem_open(struct lwp *l, const struct sys__ksem_open_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
const char *name;
|
|
int oflag;
|
|
mode_t mode;
|
|
unsigned int value;
|
|
intptr_t *idp;
|
|
} */
|
|
|
|
return do_ksem_open(l, SCARG(uap, name), SCARG(uap, oflag),
|
|
SCARG(uap, mode), SCARG(uap, value), SCARG(uap, idp), copyout);
|
|
}
|
|
|
|
int
|
|
do_ksem_open(struct lwp *l, const char *semname, int oflag, mode_t mode,
|
|
unsigned int value, intptr_t *idp, copyout_t docopyout)
|
|
{
|
|
char name[SEM_MAX_NAMELEN + 1];
|
|
proc_t *p = l->l_proc;
|
|
ksem_t *ksnew = NULL, *ks;
|
|
file_t *fp;
|
|
intptr_t id;
|
|
int fd, error;
|
|
|
|
error = copyinstr(semname, name, sizeof(name), NULL);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
error = fd_allocfile(&fp, &fd);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
fp->f_type = DTYPE_SEM;
|
|
fp->f_flag = FREAD | FWRITE;
|
|
fp->f_ops = &semops;
|
|
|
|
/*
|
|
* The ID (file descriptor number) can be stored early.
|
|
* Note that zero is a special value for libpthread.
|
|
*/
|
|
id = (intptr_t)fd;
|
|
error = (*docopyout)(&id, idp, sizeof(*idp));
|
|
if (error) {
|
|
goto err;
|
|
}
|
|
|
|
if (oflag & O_CREAT) {
|
|
/* Create a new semaphore. */
|
|
error = ksem_create(l, name, &ksnew, mode, value);
|
|
if (error) {
|
|
goto err;
|
|
}
|
|
KASSERT(ksnew != NULL);
|
|
}
|
|
|
|
/* Lookup for a semaphore with such name. */
|
|
mutex_enter(&ksem_lock);
|
|
ks = ksem_lookup(name);
|
|
if (ks) {
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
mutex_exit(&ksem_lock);
|
|
|
|
/* Check for exclusive create. */
|
|
if (oflag & O_EXCL) {
|
|
mutex_exit(&ks->ks_lock);
|
|
error = EEXIST;
|
|
goto err;
|
|
}
|
|
/*
|
|
* Verify permissions. If we can access it,
|
|
* add the reference of this thread.
|
|
*/
|
|
error = ksem_perm(l, ks);
|
|
if (error == 0) {
|
|
ks->ks_ref++;
|
|
}
|
|
mutex_exit(&ks->ks_lock);
|
|
if (error) {
|
|
goto err;
|
|
}
|
|
} else {
|
|
/* Fail if not found and not creating. */
|
|
if ((oflag & O_CREAT) == 0) {
|
|
mutex_exit(&ksem_lock);
|
|
KASSERT(ksnew == NULL);
|
|
error = ENOENT;
|
|
goto err;
|
|
}
|
|
|
|
/* Check for the limit locked. */
|
|
if (nsems >= ksem_max) {
|
|
mutex_exit(&ksem_lock);
|
|
error = ENFILE;
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
* Finally, insert semaphore into the list.
|
|
* Note: it already has the initial reference.
|
|
*/
|
|
ks = ksnew;
|
|
LIST_INSERT_HEAD(&ksem_head, ks, ks_entry);
|
|
nsems++;
|
|
mutex_exit(&ksem_lock);
|
|
|
|
ksnew = NULL;
|
|
}
|
|
KASSERT(ks != NULL);
|
|
fp->f_ksem = ks;
|
|
fd_affix(p, fp, fd);
|
|
err:
|
|
if (error) {
|
|
fd_abort(p, fp, fd);
|
|
}
|
|
if (ksnew) {
|
|
ksem_free(ksnew);
|
|
}
|
|
return error;
|
|
}
|
|
|
|
int
|
|
sys__ksem_close(struct lwp *l, const struct sys__ksem_close_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
} */
|
|
int fd = (int)SCARG(uap, id);
|
|
|
|
if (fd_getfile(fd) == NULL) {
|
|
return EBADF;
|
|
}
|
|
return fd_close(fd);
|
|
}
|
|
|
|
static int
|
|
ksem_read_fop(file_t *fp, off_t *offset, struct uio *uio, kauth_cred_t cred,
|
|
int flags)
|
|
{
|
|
size_t len;
|
|
char *name;
|
|
ksem_t *ks = fp->f_ksem;
|
|
|
|
mutex_enter(&ks->ks_lock);
|
|
len = ks->ks_namelen;
|
|
name = ks->ks_name;
|
|
mutex_exit(&ks->ks_lock);
|
|
if (name == NULL || len == 0)
|
|
return 0;
|
|
return uiomove(name, len, uio);
|
|
}
|
|
|
|
static int
|
|
ksem_stat_fop(file_t *fp, struct stat *ub)
|
|
{
|
|
ksem_t *ks = fp->f_ksem;
|
|
|
|
mutex_enter(&ks->ks_lock);
|
|
|
|
memset(ub, 0, sizeof(*ub));
|
|
|
|
ub->st_mode = ks->ks_mode | ((ks->ks_name && ks->ks_namelen)
|
|
? _S_IFLNK : _S_IFREG);
|
|
ub->st_uid = ks->ks_uid;
|
|
ub->st_gid = ks->ks_gid;
|
|
ub->st_size = ks->ks_value;
|
|
ub->st_blocks = (ub->st_size) ? 1 : 0;
|
|
ub->st_nlink = ks->ks_ref;
|
|
ub->st_blksize = 4096;
|
|
|
|
nanotime(&ub->st_atimespec);
|
|
ub->st_mtimespec = ub->st_ctimespec = ub->st_birthtimespec =
|
|
ub->st_atimespec;
|
|
|
|
/*
|
|
* Left as 0: st_dev, st_ino, st_rdev, st_flags, st_gen.
|
|
* XXX (st_dev, st_ino) should be unique.
|
|
*/
|
|
mutex_exit(&ks->ks_lock);
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
ksem_close_fop(file_t *fp)
|
|
{
|
|
ksem_t *ks = fp->f_ksem;
|
|
bool destroy = false;
|
|
|
|
mutex_enter(&ks->ks_lock);
|
|
KASSERT(ks->ks_ref > 0);
|
|
if (--ks->ks_ref == 0) {
|
|
/*
|
|
* Destroy if the last reference and semaphore is unnamed,
|
|
* or unlinked (for named semaphore).
|
|
*/
|
|
destroy = (ks->ks_flags & KS_UNLINKED) || (ks->ks_name == NULL);
|
|
}
|
|
mutex_exit(&ks->ks_lock);
|
|
|
|
if (destroy) {
|
|
ksem_free(ks);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
sys__ksem_unlink(struct lwp *l, const struct sys__ksem_unlink_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
const char *name;
|
|
} */
|
|
char name[SEM_MAX_NAMELEN + 1];
|
|
ksem_t *ks;
|
|
u_int refcnt;
|
|
int error;
|
|
|
|
error = copyinstr(SCARG(uap, name), name, sizeof(name), NULL);
|
|
if (error)
|
|
return error;
|
|
|
|
mutex_enter(&ksem_lock);
|
|
ks = ksem_lookup(name);
|
|
if (ks == NULL) {
|
|
mutex_exit(&ksem_lock);
|
|
return ENOENT;
|
|
}
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
|
|
/* Verify permissions. */
|
|
error = ksem_perm(l, ks);
|
|
if (error) {
|
|
mutex_exit(&ks->ks_lock);
|
|
mutex_exit(&ksem_lock);
|
|
return error;
|
|
}
|
|
|
|
/* Remove from the global list. */
|
|
LIST_REMOVE(ks, ks_entry);
|
|
nsems--;
|
|
mutex_exit(&ksem_lock);
|
|
|
|
refcnt = ks->ks_ref;
|
|
if (refcnt) {
|
|
/* Mark as unlinked, if there are references. */
|
|
ks->ks_flags |= KS_UNLINKED;
|
|
}
|
|
mutex_exit(&ks->ks_lock);
|
|
|
|
if (refcnt == 0) {
|
|
ksem_free(ks);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
sys__ksem_post(struct lwp *l, const struct sys__ksem_post_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
} */
|
|
int fd = (int)SCARG(uap, id), error;
|
|
ksem_t *ks;
|
|
|
|
error = ksem_get(fd, &ks);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
if (ks->ks_value == SEM_VALUE_MAX) {
|
|
error = EOVERFLOW;
|
|
goto out;
|
|
}
|
|
ks->ks_value++;
|
|
if (ks->ks_waiters) {
|
|
cv_broadcast(&ks->ks_cv);
|
|
}
|
|
out:
|
|
mutex_exit(&ks->ks_lock);
|
|
fd_putfile(fd);
|
|
return error;
|
|
}
|
|
|
|
int
|
|
do_ksem_wait(lwp_t *l, intptr_t id, bool try_p, struct timespec *abstime)
|
|
{
|
|
int fd = (int)id, error, timeo;
|
|
ksem_t *ks;
|
|
|
|
error = ksem_get(fd, &ks);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
while (ks->ks_value == 0) {
|
|
ks->ks_waiters++;
|
|
if (!try_p && abstime != NULL) {
|
|
error = ts2timo(CLOCK_REALTIME, TIMER_ABSTIME, abstime,
|
|
&timeo, NULL);
|
|
if (error != 0)
|
|
goto out;
|
|
} else {
|
|
timeo = 0;
|
|
}
|
|
error = try_p ? EAGAIN : cv_timedwait_sig(&ks->ks_cv,
|
|
&ks->ks_lock, timeo);
|
|
ks->ks_waiters--;
|
|
if (error)
|
|
goto out;
|
|
}
|
|
ks->ks_value--;
|
|
out:
|
|
mutex_exit(&ks->ks_lock);
|
|
fd_putfile(fd);
|
|
return error;
|
|
}
|
|
|
|
int
|
|
sys__ksem_wait(struct lwp *l, const struct sys__ksem_wait_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
} */
|
|
|
|
return do_ksem_wait(l, SCARG(uap, id), false, NULL);
|
|
}
|
|
|
|
int
|
|
sys__ksem_timedwait(struct lwp *l, const struct sys__ksem_timedwait_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
const struct timespec *abstime;
|
|
} */
|
|
struct timespec ts;
|
|
int error;
|
|
|
|
error = copyin(SCARG(uap, abstime), &ts, sizeof(ts));
|
|
if (error != 0)
|
|
return error;
|
|
|
|
if (ts.tv_sec < 0 || ts.tv_nsec < 0 || ts.tv_nsec >= 1000000000)
|
|
return EINVAL;
|
|
|
|
error = do_ksem_wait(l, SCARG(uap, id), false, &ts);
|
|
if (error == EWOULDBLOCK)
|
|
error = ETIMEDOUT;
|
|
return error;
|
|
}
|
|
|
|
int
|
|
sys__ksem_trywait(struct lwp *l, const struct sys__ksem_trywait_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
} */
|
|
|
|
return do_ksem_wait(l, SCARG(uap, id), true, NULL);
|
|
}
|
|
|
|
int
|
|
sys__ksem_getvalue(struct lwp *l, const struct sys__ksem_getvalue_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
unsigned int *value;
|
|
} */
|
|
int fd = (int)SCARG(uap, id), error;
|
|
ksem_t *ks;
|
|
unsigned int val;
|
|
|
|
error = ksem_get(fd, &ks);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
val = ks->ks_value;
|
|
mutex_exit(&ks->ks_lock);
|
|
fd_putfile(fd);
|
|
|
|
return copyout(&val, SCARG(uap, value), sizeof(val));
|
|
}
|
|
|
|
int
|
|
sys__ksem_destroy(struct lwp *l, const struct sys__ksem_destroy_args *uap,
|
|
register_t *retval)
|
|
{
|
|
/* {
|
|
intptr_t id;
|
|
} */
|
|
int fd = (int)SCARG(uap, id), error;
|
|
ksem_t *ks;
|
|
|
|
error = ksem_get(fd, &ks);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
KASSERT(mutex_owned(&ks->ks_lock));
|
|
|
|
/* Operation is only for unnamed semaphores. */
|
|
if (ks->ks_name != NULL) {
|
|
error = EINVAL;
|
|
goto out;
|
|
}
|
|
/* Cannot destroy if there are waiters. */
|
|
if (ks->ks_waiters) {
|
|
error = EBUSY;
|
|
goto out;
|
|
}
|
|
out:
|
|
mutex_exit(&ks->ks_lock);
|
|
if (error) {
|
|
fd_putfile(fd);
|
|
return error;
|
|
}
|
|
return fd_close(fd);
|
|
}
|