accessors.c revision 1.1.10.3
1 1.1.10.2 tls /* $NetBSD: accessors.c,v 1.1.10.3 2017/12/03 11:39:16 jdolecek Exp $ */ 2 1.1.10.2 tls 3 1.1.10.2 tls /* 4 1.1.10.2 tls * Copyright (c) 2007-2011 Antti Kantee. All Rights Reserved. 5 1.1.10.2 tls * 6 1.1.10.2 tls * Redistribution and use in source and binary forms, with or without 7 1.1.10.2 tls * modification, are permitted provided that the following conditions 8 1.1.10.2 tls * are met: 9 1.1.10.2 tls * 1. Redistributions of source code must retain the above copyright 10 1.1.10.2 tls * notice, this list of conditions and the following disclaimer. 11 1.1.10.2 tls * 2. Redistributions in binary form must reproduce the above copyright 12 1.1.10.2 tls * notice, this list of conditions and the following disclaimer in the 13 1.1.10.2 tls * documentation and/or other materials provided with the distribution. 14 1.1.10.2 tls * 15 1.1.10.2 tls * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS 16 1.1.10.2 tls * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 17 1.1.10.2 tls * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 18 1.1.10.2 tls * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 19 1.1.10.2 tls * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20 1.1.10.2 tls * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 21 1.1.10.2 tls * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22 1.1.10.2 tls * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23 1.1.10.2 tls * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24 1.1.10.2 tls * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25 1.1.10.2 tls * SUCH DAMAGE. 26 1.1.10.2 tls */ 27 1.1.10.2 tls 28 1.1.10.2 tls /* 29 1.1.10.2 tls * This file contains various data structure accessor routines. 30 1.1.10.2 tls * They are meant to help clients that make calls into the depths 31 1.1.10.2 tls * of the kernel (e.g. at vfs layer) bypassing the syscall layer. 32 1.1.10.2 tls */ 33 1.1.10.2 tls 34 1.1.10.2 tls #include <sys/cdefs.h> 35 1.1.10.2 tls __KERNEL_RCSID(0, "$NetBSD: accessors.c,v 1.1.10.3 2017/12/03 11:39:16 jdolecek Exp $"); 36 1.1.10.2 tls 37 1.1.10.2 tls #include <sys/param.h> 38 1.1.10.2 tls #include <sys/kauth.h> 39 1.1.10.2 tls #include <sys/kmem.h> 40 1.1.10.2 tls #include <sys/uio.h> 41 1.1.10.2 tls 42 1.1.10.3 jdolecek #include <rump-sys/kern.h> 43 1.1.10.2 tls 44 1.1.10.2 tls struct uio * 45 1.1.10.2 tls rump_uio_setup(void *buf, size_t bufsize, off_t offset, enum rump_uiorw rw) 46 1.1.10.2 tls { 47 1.1.10.2 tls struct uio *uio; 48 1.1.10.2 tls enum uio_rw uiorw; 49 1.1.10.2 tls 50 1.1.10.2 tls switch (rw) { 51 1.1.10.2 tls case RUMPUIO_READ: 52 1.1.10.2 tls uiorw = UIO_READ; 53 1.1.10.2 tls break; 54 1.1.10.2 tls case RUMPUIO_WRITE: 55 1.1.10.2 tls uiorw = UIO_WRITE; 56 1.1.10.2 tls break; 57 1.1.10.2 tls default: 58 1.1.10.2 tls panic("%s: invalid rw %d", __func__, rw); 59 1.1.10.2 tls } 60 1.1.10.2 tls 61 1.1.10.2 tls uio = kmem_alloc(sizeof(struct uio), KM_SLEEP); 62 1.1.10.2 tls uio->uio_iov = kmem_alloc(sizeof(struct iovec), KM_SLEEP); 63 1.1.10.2 tls 64 1.1.10.2 tls uio->uio_iov->iov_base = buf; 65 1.1.10.2 tls uio->uio_iov->iov_len = bufsize; 66 1.1.10.2 tls 67 1.1.10.2 tls uio->uio_iovcnt = 1; 68 1.1.10.2 tls uio->uio_offset = offset; 69 1.1.10.2 tls uio->uio_resid = bufsize; 70 1.1.10.2 tls uio->uio_rw = uiorw; 71 1.1.10.3 jdolecek uio->uio_vmspace = curproc->p_vmspace; 72 1.1.10.2 tls 73 1.1.10.2 tls return uio; 74 1.1.10.2 tls } 75 1.1.10.2 tls 76 1.1.10.2 tls size_t 77 1.1.10.2 tls rump_uio_getresid(struct uio *uio) 78 1.1.10.2 tls { 79 1.1.10.2 tls 80 1.1.10.2 tls return uio->uio_resid; 81 1.1.10.2 tls } 82 1.1.10.2 tls 83 1.1.10.2 tls off_t 84 1.1.10.2 tls rump_uio_getoff(struct uio *uio) 85 1.1.10.2 tls { 86 1.1.10.2 tls 87 1.1.10.2 tls return uio->uio_offset; 88 1.1.10.2 tls } 89 1.1.10.2 tls 90 1.1.10.2 tls size_t 91 1.1.10.2 tls rump_uio_free(struct uio *uio) 92 1.1.10.2 tls { 93 1.1.10.2 tls size_t resid; 94 1.1.10.2 tls 95 1.1.10.2 tls resid = uio->uio_resid; 96 1.1.10.2 tls kmem_free(uio->uio_iov, sizeof(*uio->uio_iov)); 97 1.1.10.2 tls kmem_free(uio, sizeof(*uio)); 98 1.1.10.2 tls 99 1.1.10.2 tls return resid; 100 1.1.10.2 tls } 101 1.1.10.2 tls 102 1.1.10.2 tls kauth_cred_t 103 1.1.10.2 tls rump_cred_create(uid_t uid, gid_t gid, size_t ngroups, gid_t *groups) 104 1.1.10.2 tls { 105 1.1.10.2 tls kauth_cred_t cred; 106 1.1.10.2 tls int rv; 107 1.1.10.2 tls 108 1.1.10.2 tls cred = kauth_cred_alloc(); 109 1.1.10.2 tls kauth_cred_setuid(cred, uid); 110 1.1.10.2 tls kauth_cred_seteuid(cred, uid); 111 1.1.10.2 tls kauth_cred_setsvuid(cred, uid); 112 1.1.10.2 tls kauth_cred_setgid(cred, gid); 113 1.1.10.2 tls kauth_cred_setgid(cred, gid); 114 1.1.10.2 tls kauth_cred_setegid(cred, gid); 115 1.1.10.2 tls kauth_cred_setsvgid(cred, gid); 116 1.1.10.2 tls rv = kauth_cred_setgroups(cred, groups, ngroups, 0, UIO_SYSSPACE); 117 1.1.10.2 tls /* oh this is silly. and by "this" I mean kauth_cred_setgroups() */ 118 1.1.10.2 tls assert(rv == 0); 119 1.1.10.2 tls 120 1.1.10.2 tls return cred; 121 1.1.10.2 tls } 122 1.1.10.2 tls 123 1.1.10.2 tls void 124 1.1.10.2 tls rump_cred_put(kauth_cred_t cred) 125 1.1.10.2 tls { 126 1.1.10.2 tls 127 1.1.10.2 tls kauth_cred_free(cred); 128 1.1.10.2 tls } 129
Indexes created Wed Oct 01 19:09:53 GMT 2025