ltsleep.c revision 1.6.10.2 1 /* $NetBSD: ltsleep.c,v 1.6.10.2 2009/06/20 07:20:35 yamt 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.6.10.2 2009/06/20 07:20:35 yamt 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
60 lts.id = ident;
61 cv_init(<s.cv, NULL);
62
63 mutex_enter(&sleepermtx);
64 if (slock)
65 simple_unlock(slock);
66 LIST_INSERT_HEAD(&sleepers, <s, entries);
67
68 /* protected by sleepermtx */
69 cv_wait(<s.cv, &sleepermtx);
70
71 LIST_REMOVE(<s, entries);
72 mutex_exit(&sleepermtx);
73
74 cv_destroy(<s.cv);
75
76 if (slock && (prio & PNORELOCK) == 0)
77 simple_lock(slock);
78
79 return 0;
80 }
81
82 int
83 mtsleep(wchan_t ident, pri_t prio, const char *wmesg, int timo,
84 kmutex_t *lock)
85 {
86 struct ltsleeper lts;
87
88 lts.id = ident;
89 cv_init(<s.cv, NULL);
90
91 mutex_enter(&sleepermtx);
92 LIST_INSERT_HEAD(&sleepers, <s, entries);
93
94 /* protected by sleepermtx */
95 mutex_exit(lock);
96 cv_wait(<s.cv, &sleepermtx);
97
98 LIST_REMOVE(<s, entries);
99 mutex_exit(&sleepermtx);
100
101 cv_destroy(<s.cv);
102
103 if ((prio & PNORELOCK) == 0)
104 mutex_enter(lock);
105
106 return 0;
107 }
108
109 void
110 wakeup(wchan_t ident)
111 {
112 struct ltsleeper *ltsp;
113
114 mutex_enter(&sleepermtx);
115 LIST_FOREACH(ltsp, &sleepers, entries)
116 if (ltsp->id == ident)
117 cv_signal(<sp->cv);
118 mutex_exit(&sleepermtx);
119 }
120
121 void
122 wakeup_one(wchan_t ident)
123 {
124 struct ltsleeper *ltsp;
125
126 mutex_enter(&sleepermtx);
127 LIST_FOREACH(ltsp, &sleepers, entries) {
128 if (ltsp->id == ident) {
129 cv_signal(<sp->cv);
130 break;
131 }
132 }
133 mutex_exit(&sleepermtx);
134 }
135
136 void
137 rump_sleepers_init(void)
138 {
139
140 mutex_init(&sleepermtx, MUTEX_DEFAULT, 0);
141 }
142