ltsleep.c revision 1.2.2.2
1 1.2.2.2 mjf /* $NetBSD: ltsleep.c,v 1.2.2.2 2008/02/18 21:07:22 mjf Exp $ */ 2 1.1 pooka 3 1.1 pooka /* 4 1.1 pooka * Copyright (c) 2007 Antti Kantee. All Rights Reserved. 5 1.1 pooka * 6 1.1 pooka * Development of this software was supported by the 7 1.1 pooka * Finnish Cultural Foundation. 8 1.1 pooka * 9 1.1 pooka * Redistribution and use in source and binary forms, with or without 10 1.1 pooka * modification, are permitted provided that the following conditions 11 1.1 pooka * are met: 12 1.1 pooka * 1. Redistributions of source code must retain the above copyright 13 1.1 pooka * notice, this list of conditions and the following disclaimer. 14 1.1 pooka * 2. Redistributions in binary form must reproduce the above copyright 15 1.1 pooka * notice, this list of conditions and the following disclaimer in the 16 1.1 pooka * documentation and/or other materials provided with the distribution. 17 1.1 pooka * 18 1.1 pooka * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS 19 1.1 pooka * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 20 1.1 pooka * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 21 1.1 pooka * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 22 1.1 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 1.1 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 24 1.1 pooka * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 1.1 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 1.1 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 1.1 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 1.1 pooka * SUCH DAMAGE. 29 1.1 pooka */ 30 1.1 pooka 31 1.1 pooka #include <sys/param.h> 32 1.1 pooka #include <sys/proc.h> 33 1.1 pooka #include <sys/queue.h> 34 1.2.2.2 mjf #include <sys/simplelock.h> 35 1.1 pooka 36 1.1 pooka #include "rump_private.h" 37 1.2.2.1 mjf #include "rumpuser.h" 38 1.1 pooka 39 1.1 pooka struct ltsleeper { 40 1.1 pooka wchan_t id; 41 1.1 pooka kcondvar_t cv; 42 1.1 pooka LIST_ENTRY(ltsleeper) entries; 43 1.1 pooka }; 44 1.1 pooka 45 1.1 pooka static LIST_HEAD(, ltsleeper) sleepers = LIST_HEAD_INITIALIZER(sleepers); 46 1.1 pooka static kmutex_t sleepermtx; 47 1.1 pooka 48 1.2.2.2 mjf kcondvar_t lbolt; /* Oh Kath Ra */ 49 1.2.2.2 mjf 50 1.1 pooka int 51 1.1 pooka ltsleep(wchan_t ident, pri_t prio, const char *wmesg, int timo, 52 1.1 pooka volatile struct simplelock *slock) 53 1.1 pooka { 54 1.1 pooka struct ltsleeper lts; 55 1.2.2.1 mjf int iplrecurse; 56 1.1 pooka 57 1.1 pooka lts.id = ident; 58 1.1 pooka cv_init(<s.cv, NULL); 59 1.1 pooka 60 1.1 pooka mutex_enter(&sleepermtx); 61 1.1 pooka LIST_INSERT_HEAD(&sleepers, <s, entries); 62 1.2.2.1 mjf 63 1.2.2.1 mjf /* release spl */ 64 1.2.2.1 mjf iplrecurse = rumpuser_whatis_ipl(); 65 1.2.2.1 mjf while (iplrecurse--) 66 1.2.2.1 mjf rumpuser_rw_exit(&rumpspl); 67 1.2.2.1 mjf 68 1.2 pooka /* protected by sleepermtx */ 69 1.1 pooka if (slock) 70 1.1 pooka simple_unlock(slock); 71 1.1 pooka cv_wait(<s.cv, &sleepermtx); 72 1.2.2.1 mjf 73 1.2.2.1 mjf /* retake ipl */ 74 1.2.2.1 mjf iplrecurse = rumpuser_whatis_ipl(); 75 1.2.2.1 mjf while (iplrecurse--) 76 1.2.2.1 mjf rumpuser_rw_enter(&rumpspl, 0); 77 1.2.2.1 mjf 78 1.1 pooka LIST_REMOVE(<s, entries); 79 1.1 pooka mutex_exit(&sleepermtx); 80 1.1 pooka 81 1.2 pooka cv_destroy(<s.cv); 82 1.2 pooka 83 1.1 pooka if (slock && (prio & PNORELOCK) == 0) 84 1.1 pooka simple_lock(slock); 85 1.1 pooka 86 1.1 pooka return 0; 87 1.1 pooka } 88 1.1 pooka 89 1.2.2.2 mjf int 90 1.2.2.2 mjf mtsleep(wchan_t ident, pri_t prio, const char *wmesg, int timo, 91 1.2.2.2 mjf kmutex_t *lock) 92 1.2.2.2 mjf { 93 1.2.2.2 mjf struct ltsleeper lts; 94 1.2.2.2 mjf int iplrecurse; 95 1.2.2.2 mjf 96 1.2.2.2 mjf lts.id = ident; 97 1.2.2.2 mjf cv_init(<s.cv, NULL); 98 1.2.2.2 mjf 99 1.2.2.2 mjf mutex_enter(&sleepermtx); 100 1.2.2.2 mjf LIST_INSERT_HEAD(&sleepers, <s, entries); 101 1.2.2.2 mjf 102 1.2.2.2 mjf /* release spl */ 103 1.2.2.2 mjf iplrecurse = rumpuser_whatis_ipl(); 104 1.2.2.2 mjf while (iplrecurse--) 105 1.2.2.2 mjf rumpuser_rw_exit(&rumpspl); 106 1.2.2.2 mjf 107 1.2.2.2 mjf /* protected by sleepermtx */ 108 1.2.2.2 mjf mutex_exit(lock); 109 1.2.2.2 mjf cv_wait(<s.cv, &sleepermtx); 110 1.2.2.2 mjf 111 1.2.2.2 mjf /* retake ipl */ 112 1.2.2.2 mjf iplrecurse = rumpuser_whatis_ipl(); 113 1.2.2.2 mjf while (iplrecurse--) 114 1.2.2.2 mjf rumpuser_rw_enter(&rumpspl, 0); 115 1.2.2.2 mjf 116 1.2.2.2 mjf LIST_REMOVE(<s, entries); 117 1.2.2.2 mjf mutex_exit(&sleepermtx); 118 1.2.2.2 mjf 119 1.2.2.2 mjf cv_destroy(<s.cv); 120 1.2.2.2 mjf 121 1.2.2.2 mjf if ((prio & PNORELOCK) == 0) 122 1.2.2.2 mjf mutex_enter(lock); 123 1.2.2.2 mjf 124 1.2.2.2 mjf return 0; 125 1.2.2.2 mjf } 126 1.2.2.2 mjf 127 1.1 pooka void 128 1.1 pooka wakeup(wchan_t ident) 129 1.1 pooka { 130 1.1 pooka struct ltsleeper *ltsp; 131 1.1 pooka 132 1.1 pooka mutex_enter(&sleepermtx); 133 1.1 pooka LIST_FOREACH(ltsp, &sleepers, entries) 134 1.1 pooka if (ltsp->id == ident) 135 1.1 pooka cv_signal(<sp->cv); 136 1.1 pooka mutex_exit(&sleepermtx); 137 1.1 pooka } 138 1.1 pooka 139 1.1 pooka void 140 1.1 pooka rump_sleepers_init() 141 1.1 pooka { 142 1.1 pooka 143 1.1 pooka mutex_init(&sleepermtx, MUTEX_DEFAULT, 0); 144 1.1 pooka } 145
Indexes created Tue Sep 30 20:09:53 GMT 2025