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