Home | History | Annotate | Line # | Download | only in rumpkern
locks.c revision 1.16.4.2
      1  1.16.4.2      haad /*	$NetBSD: locks.c,v 1.16.4.2 2008/12/13 01:15:34 haad Exp $	*/
      2      1.14        ad 
      3      1.14        ad /*-
      4      1.14        ad  * Copyright (c) 2008 The NetBSD Foundation, Inc.
      5      1.14        ad  * All rights reserved.
      6      1.14        ad  *
      7      1.14        ad  * Redistribution and use in source and binary forms, with or without
      8      1.14        ad  * modification, are permitted provided that the following conditions
      9      1.14        ad  * are met:
     10      1.14        ad  * 1. Redistributions of source code must retain the above copyright
     11      1.14        ad  *    notice, this list of conditions and the following disclaimer.
     12      1.14        ad  * 2. Redistributions in binary form must reproduce the above copyright
     13      1.14        ad  *    notice, this list of conditions and the following disclaimer in the
     14      1.14        ad  *    documentation and/or other materials provided with the distribution.
     15      1.14        ad  *
     16      1.14        ad  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     17      1.14        ad  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     18      1.14        ad  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     19      1.14        ad  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     20      1.14        ad  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     21      1.14        ad  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     22      1.14        ad  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     23      1.14        ad  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     24      1.14        ad  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     25      1.14        ad  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     26      1.14        ad  * POSSIBILITY OF SUCH DAMAGE.
     27      1.14        ad  */
     28       1.1     pooka 
     29       1.1     pooka /*
     30       1.1     pooka  * Copyright (c) 2007 Antti Kantee.  All Rights Reserved.
     31       1.1     pooka  *
     32       1.1     pooka  * Development of this software was supported by the
     33       1.1     pooka  * Finnish Cultural Foundation.
     34       1.1     pooka  *
     35       1.1     pooka  * Redistribution and use in source and binary forms, with or without
     36       1.1     pooka  * modification, are permitted provided that the following conditions
     37       1.1     pooka  * are met:
     38       1.1     pooka  * 1. Redistributions of source code must retain the above copyright
     39       1.1     pooka  *    notice, this list of conditions and the following disclaimer.
     40       1.1     pooka  * 2. Redistributions in binary form must reproduce the above copyright
     41       1.1     pooka  *    notice, this list of conditions and the following disclaimer in the
     42       1.1     pooka  *    documentation and/or other materials provided with the distribution.
     43       1.1     pooka  *
     44       1.1     pooka  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
     45       1.1     pooka  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
     46       1.1     pooka  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
     47       1.1     pooka  * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     48       1.1     pooka  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     49       1.1     pooka  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     50       1.1     pooka  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     51       1.1     pooka  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     52       1.1     pooka  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     53       1.1     pooka  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     54       1.1     pooka  * SUCH DAMAGE.
     55       1.1     pooka  */
     56       1.1     pooka 
     57       1.1     pooka #include <sys/param.h>
     58       1.1     pooka #include <sys/mutex.h>
     59       1.1     pooka #include <sys/rwlock.h>
     60      1.14        ad #include <sys/atomic.h>
     61       1.1     pooka 
     62  1.16.4.1      haad #include <rump/rumpuser.h>
     63       1.2     pooka 
     64  1.16.4.1      haad #include "rump_private.h"
     65       1.1     pooka 
     66       1.1     pooka void
     67       1.1     pooka mutex_init(kmutex_t *mtx, kmutex_type_t type, int ipl)
     68       1.1     pooka {
     69       1.1     pooka 
     70       1.1     pooka 	rumpuser_mutex_init(&mtx->kmtx_mtx);
     71       1.1     pooka }
     72       1.1     pooka 
     73       1.1     pooka void
     74       1.1     pooka mutex_destroy(kmutex_t *mtx)
     75       1.1     pooka {
     76       1.1     pooka 
     77       1.1     pooka 	rumpuser_mutex_destroy(mtx->kmtx_mtx);
     78       1.1     pooka }
     79       1.1     pooka 
     80       1.1     pooka void
     81       1.1     pooka mutex_enter(kmutex_t *mtx)
     82       1.1     pooka {
     83       1.1     pooka 
     84       1.1     pooka 	rumpuser_mutex_enter(mtx->kmtx_mtx);
     85       1.1     pooka }
     86       1.1     pooka 
     87       1.6     pooka void
     88       1.6     pooka mutex_spin_enter(kmutex_t *mtx)
     89       1.6     pooka {
     90       1.6     pooka 
     91  1.16.4.1      haad 	if (__predict_true(mtx != RUMP_LMUTEX_MAGIC))
     92  1.16.4.1      haad 		mutex_enter(mtx);
     93       1.6     pooka }
     94       1.6     pooka 
     95       1.1     pooka int
     96       1.1     pooka mutex_tryenter(kmutex_t *mtx)
     97       1.1     pooka {
     98       1.1     pooka 
     99      1.12     pooka 	return rumpuser_mutex_tryenter(mtx->kmtx_mtx);
    100       1.1     pooka }
    101       1.1     pooka 
    102       1.1     pooka void
    103       1.1     pooka mutex_exit(kmutex_t *mtx)
    104       1.1     pooka {
    105       1.1     pooka 
    106       1.1     pooka 	rumpuser_mutex_exit(mtx->kmtx_mtx);
    107       1.1     pooka }
    108       1.1     pooka 
    109       1.6     pooka void
    110       1.6     pooka mutex_spin_exit(kmutex_t *mtx)
    111       1.6     pooka {
    112       1.6     pooka 
    113  1.16.4.1      haad 	if (__predict_true(mtx != RUMP_LMUTEX_MAGIC))
    114  1.16.4.1      haad 		mutex_exit(mtx);
    115       1.6     pooka }
    116       1.6     pooka 
    117       1.1     pooka int
    118       1.1     pooka mutex_owned(kmutex_t *mtx)
    119       1.1     pooka {
    120       1.1     pooka 
    121      1.10        ad 	return rumpuser_mutex_held(mtx->kmtx_mtx);
    122       1.1     pooka }
    123       1.1     pooka 
    124       1.1     pooka /* reader/writer locks */
    125       1.1     pooka 
    126       1.1     pooka void
    127       1.1     pooka rw_init(krwlock_t *rw)
    128       1.1     pooka {
    129       1.1     pooka 
    130       1.1     pooka 	rumpuser_rw_init(&rw->krw_pthlock);
    131       1.1     pooka }
    132       1.1     pooka 
    133       1.1     pooka void
    134       1.1     pooka rw_destroy(krwlock_t *rw)
    135       1.1     pooka {
    136       1.1     pooka 
    137       1.1     pooka 	rumpuser_rw_destroy(rw->krw_pthlock);
    138       1.1     pooka }
    139       1.1     pooka 
    140       1.1     pooka void
    141       1.1     pooka rw_enter(krwlock_t *rw, const krw_t op)
    142       1.1     pooka {
    143       1.1     pooka 
    144       1.1     pooka 	rumpuser_rw_enter(rw->krw_pthlock, op == RW_WRITER);
    145       1.1     pooka }
    146       1.1     pooka 
    147       1.1     pooka int
    148       1.1     pooka rw_tryenter(krwlock_t *rw, const krw_t op)
    149       1.1     pooka {
    150       1.1     pooka 
    151       1.1     pooka 	return rumpuser_rw_tryenter(rw->krw_pthlock, op == RW_WRITER);
    152       1.1     pooka }
    153       1.1     pooka 
    154       1.1     pooka void
    155       1.1     pooka rw_exit(krwlock_t *rw)
    156       1.1     pooka {
    157       1.1     pooka 
    158       1.1     pooka 	rumpuser_rw_exit(rw->krw_pthlock);
    159       1.1     pooka }
    160       1.1     pooka 
    161       1.1     pooka /* always fails */
    162       1.1     pooka int
    163       1.1     pooka rw_tryupgrade(krwlock_t *rw)
    164       1.1     pooka {
    165       1.1     pooka 
    166       1.1     pooka 	return 0;
    167       1.1     pooka }
    168       1.1     pooka 
    169       1.6     pooka int
    170       1.6     pooka rw_write_held(krwlock_t *rw)
    171       1.6     pooka {
    172       1.6     pooka 
    173      1.10        ad 	return rumpuser_rw_wrheld(rw->krw_pthlock);
    174      1.10        ad }
    175      1.10        ad 
    176      1.10        ad int
    177      1.10        ad rw_read_held(krwlock_t *rw)
    178      1.10        ad {
    179      1.10        ad 
    180      1.10        ad 	return rumpuser_rw_rdheld(rw->krw_pthlock);
    181      1.10        ad }
    182      1.10        ad 
    183      1.10        ad int
    184      1.10        ad rw_lock_held(krwlock_t *rw)
    185      1.10        ad {
    186      1.10        ad 
    187      1.10        ad 	return rumpuser_rw_held(rw->krw_pthlock);
    188       1.6     pooka }
    189       1.6     pooka 
    190       1.1     pooka /* curriculum vitaes */
    191       1.1     pooka 
    192       1.1     pooka /* forgive me for I have sinned */
    193       1.1     pooka #define RUMPCV(a) ((struct rumpuser_cv *)(__UNCONST((a)->cv_wmesg)))
    194       1.1     pooka 
    195       1.1     pooka void
    196       1.1     pooka cv_init(kcondvar_t *cv, const char *msg)
    197       1.1     pooka {
    198       1.1     pooka 
    199       1.1     pooka 	rumpuser_cv_init((struct rumpuser_cv **)__UNCONST(&cv->cv_wmesg));
    200       1.1     pooka }
    201       1.1     pooka 
    202       1.1     pooka void
    203       1.1     pooka cv_destroy(kcondvar_t *cv)
    204       1.1     pooka {
    205       1.1     pooka 
    206       1.1     pooka 	rumpuser_cv_destroy(RUMPCV(cv));
    207       1.1     pooka }
    208       1.1     pooka 
    209       1.1     pooka void
    210       1.1     pooka cv_wait(kcondvar_t *cv, kmutex_t *mtx)
    211       1.1     pooka {
    212       1.1     pooka 
    213       1.1     pooka 	rumpuser_cv_wait(RUMPCV(cv), mtx->kmtx_mtx);
    214       1.1     pooka }
    215       1.1     pooka 
    216       1.3     pooka int
    217       1.5     pooka cv_wait_sig(kcondvar_t *cv, kmutex_t *mtx)
    218       1.5     pooka {
    219       1.5     pooka 
    220       1.5     pooka 	rumpuser_cv_wait(RUMPCV(cv), mtx->kmtx_mtx);
    221       1.5     pooka 	return 0;
    222       1.5     pooka }
    223       1.5     pooka 
    224       1.5     pooka int
    225       1.3     pooka cv_timedwait(kcondvar_t *cv, kmutex_t *mtx, int ticks)
    226       1.3     pooka {
    227      1.16        ad #ifdef DIAGNOSTIC
    228       1.3     pooka 	extern int hz;
    229      1.16        ad #endif
    230       1.3     pooka 
    231       1.9     pooka 	if (ticks == 0) {
    232       1.9     pooka 		cv_wait(cv, mtx);
    233       1.9     pooka 		return 0;
    234       1.9     pooka 	} else {
    235       1.9     pooka 		KASSERT(hz == 100);
    236       1.9     pooka 		return rumpuser_cv_timedwait(RUMPCV(cv), mtx->kmtx_mtx, ticks);
    237       1.9     pooka 	}
    238       1.3     pooka }
    239       1.3     pooka 
    240       1.5     pooka int
    241       1.5     pooka cv_timedwait_sig(kcondvar_t *cv, kmutex_t *mtx, int ticks)
    242       1.5     pooka {
    243       1.5     pooka 
    244       1.9     pooka 	return cv_timedwait(cv, mtx, ticks);
    245       1.5     pooka }
    246       1.5     pooka 
    247       1.1     pooka void
    248       1.1     pooka cv_signal(kcondvar_t *cv)
    249       1.1     pooka {
    250       1.1     pooka 
    251       1.1     pooka 	rumpuser_cv_signal(RUMPCV(cv));
    252       1.1     pooka }
    253       1.2     pooka 
    254       1.4     pooka void
    255       1.4     pooka cv_broadcast(kcondvar_t *cv)
    256       1.4     pooka {
    257       1.4     pooka 
    258       1.4     pooka 	rumpuser_cv_broadcast(RUMPCV(cv));
    259       1.4     pooka }
    260       1.4     pooka 
    261  1.16.4.1      haad bool
    262  1.16.4.1      haad cv_has_waiters(kcondvar_t *cv)
    263  1.16.4.1      haad {
    264  1.16.4.1      haad 
    265  1.16.4.1      haad 	return rumpuser_cv_has_waiters(RUMPCV(cv));
    266  1.16.4.1      haad }
    267  1.16.4.1      haad 
    268  1.16.4.1      haad /*
    269  1.16.4.1      haad  * giant lock
    270  1.16.4.1      haad  */
    271       1.2     pooka 
    272  1.16.4.2      haad static volatile int lockcnt;
    273       1.2     pooka void
    274      1.13  drochner _kernel_lock(int nlocks)
    275       1.2     pooka {
    276       1.2     pooka 
    277  1.16.4.1      haad 	while (nlocks--) {
    278  1.16.4.1      haad 		mutex_enter(&rump_giantlock);
    279  1.16.4.1      haad 		lockcnt++;
    280  1.16.4.1      haad 	}
    281       1.2     pooka }
    282       1.2     pooka 
    283       1.2     pooka void
    284      1.13  drochner _kernel_unlock(int nlocks, int *countp)
    285       1.2     pooka {
    286       1.2     pooka 
    287  1.16.4.1      haad 	if (!mutex_owned(&rump_giantlock)) {
    288  1.16.4.1      haad 		KASSERT(nlocks == 0);
    289  1.16.4.1      haad 		if (countp)
    290  1.16.4.1      haad 			*countp = 0;
    291  1.16.4.1      haad 		return;
    292  1.16.4.1      haad 	}
    293  1.16.4.1      haad 
    294       1.2     pooka 	if (countp)
    295  1.16.4.1      haad 		*countp = lockcnt;
    296  1.16.4.1      haad 	if (nlocks == 0)
    297  1.16.4.1      haad 		nlocks = lockcnt;
    298  1.16.4.1      haad 	if (nlocks == -1) {
    299  1.16.4.1      haad 		KASSERT(lockcnt == 1);
    300  1.16.4.1      haad 		nlocks = 1;
    301  1.16.4.1      haad 	}
    302  1.16.4.1      haad 	KASSERT(nlocks <= lockcnt);
    303  1.16.4.1      haad 	while (nlocks--) {
    304  1.16.4.1      haad 		lockcnt--;
    305  1.16.4.1      haad 		mutex_exit(&rump_giantlock);
    306  1.16.4.1      haad 	}
    307       1.2     pooka }
    308      1.14        ad 
    309      1.14        ad struct kmutexobj {
    310      1.14        ad 	kmutex_t	mo_lock;
    311      1.14        ad 	u_int		mo_refcnt;
    312      1.14        ad };
    313      1.14        ad 
    314      1.14        ad kmutex_t *
    315      1.14        ad mutex_obj_alloc(kmutex_type_t type, int ipl)
    316      1.14        ad {
    317      1.14        ad 	struct kmutexobj *mo;
    318      1.14        ad 
    319      1.14        ad 	mo = kmem_alloc(sizeof(*mo), KM_SLEEP);
    320      1.14        ad 	mutex_init(&mo->mo_lock, type, ipl);
    321      1.14        ad 	mo->mo_refcnt = 1;
    322      1.14        ad 
    323      1.14        ad 	return (kmutex_t *)mo;
    324      1.14        ad }
    325      1.14        ad 
    326      1.14        ad void
    327      1.14        ad mutex_obj_hold(kmutex_t *lock)
    328      1.14        ad {
    329      1.14        ad 	struct kmutexobj *mo = (struct kmutexobj *)lock;
    330      1.14        ad 
    331      1.14        ad 	atomic_inc_uint(&mo->mo_refcnt);
    332      1.14        ad }
    333      1.14        ad 
    334      1.14        ad bool
    335      1.14        ad mutex_obj_free(kmutex_t *lock)
    336      1.14        ad {
    337      1.14        ad 	struct kmutexobj *mo = (struct kmutexobj *)lock;
    338      1.14        ad 
    339      1.14        ad 	if (atomic_dec_uint_nv(&mo->mo_refcnt) > 0) {
    340      1.14        ad 		return false;
    341      1.14        ad 	}
    342      1.14        ad 	mutex_destroy(&mo->mo_lock);
    343      1.14        ad 	kmem_free(mo, sizeof(*mo));
    344      1.14        ad 	return true;
    345      1.14        ad }
    346