sem.c revision 1.3 1 1.3 simonb /* $NetBSD: sem.c,v 1.3 2003/12/07 12:53:19 simonb Exp $ */
2 1.1 thorpej
3 1.1 thorpej /*-
4 1.1 thorpej * Copyright (c) 2003 The NetBSD Foundation, Inc.
5 1.1 thorpej * All rights reserved.
6 1.1 thorpej *
7 1.1 thorpej * This code is derived from software contributed to The NetBSD Foundation
8 1.1 thorpej * by Jason R. Thorpe.
9 1.1 thorpej *
10 1.1 thorpej * Redistribution and use in source and binary forms, with or without
11 1.1 thorpej * modification, are permitted provided that the following conditions
12 1.1 thorpej * are met:
13 1.1 thorpej * 1. Redistributions of source code must retain the above copyright
14 1.1 thorpej * notice, this list of conditions and the following disclaimer.
15 1.1 thorpej * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 thorpej * notice, this list of conditions and the following disclaimer in the
17 1.1 thorpej * documentation and/or other materials provided with the distribution.
18 1.1 thorpej * 3. All advertising materials mentioning features or use of this software
19 1.1 thorpej * must display the following acknowledgement:
20 1.1 thorpej * This product includes software developed by the NetBSD
21 1.1 thorpej * Foundation, Inc. and its contributors.
22 1.1 thorpej * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 thorpej * contributors may be used to endorse or promote products derived
24 1.1 thorpej * from this software without specific prior written permission.
25 1.1 thorpej *
26 1.1 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 thorpej * POSSIBILITY OF SUCH DAMAGE.
37 1.1 thorpej */
38 1.1 thorpej
39 1.1 thorpej /*
40 1.1 thorpej * Copyright (C) 2000 Jason Evans <jasone (at) freebsd.org>.
41 1.1 thorpej * All rights reserved.
42 1.1 thorpej *
43 1.1 thorpej * Redistribution and use in source and binary forms, with or without
44 1.1 thorpej * modification, are permitted provided that the following conditions
45 1.1 thorpej * are met:
46 1.1 thorpej * 1. Redistributions of source code must retain the above copyright
47 1.1 thorpej * notice(s), this list of conditions and the following disclaimer as
48 1.1 thorpej * the first lines of this file unmodified other than the possible
49 1.1 thorpej * addition of one or more copyright notices.
50 1.1 thorpej * 2. Redistributions in binary form must reproduce the above copyright
51 1.1 thorpej * notice(s), this list of conditions and the following disclaimer in
52 1.1 thorpej * the documentation and/or other materials provided with the
53 1.1 thorpej * distribution.
54 1.1 thorpej *
55 1.1 thorpej * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY
56 1.1 thorpej * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
57 1.1 thorpej * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
58 1.1 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE
59 1.1 thorpej * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
60 1.1 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
61 1.1 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
62 1.1 thorpej * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
63 1.1 thorpej * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
64 1.1 thorpej * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
65 1.1 thorpej * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
66 1.1 thorpej */
67 1.2 lukem
68 1.2 lukem #include <sys/cdefs.h>
69 1.3 simonb __RCSID("$NetBSD: sem.c,v 1.3 2003/12/07 12:53:19 simonb Exp $");
70 1.1 thorpej
71 1.1 thorpej /*
72 1.1 thorpej * If an application is linked against both librt and libpthread, the
73 1.1 thorpej * libpthread versions must be used. Provide weak aliases to cause
74 1.1 thorpej * this behavior.
75 1.1 thorpej */
76 1.1 thorpej #define sem_init _librt_sem_init
77 1.1 thorpej #define sem_destroy _librt_sem_destroy
78 1.1 thorpej #define sem_open _librt_sem_open
79 1.1 thorpej #define sem_close _librt_sem_close
80 1.1 thorpej #define sem_unlink _librt_sem_unlink
81 1.1 thorpej #define sem_wait _librt_sem_wait
82 1.1 thorpej #define sem_trywait _librt_sem_trywait
83 1.1 thorpej #define sem_post _librt_sem_post
84 1.1 thorpej #define sem_getvalue _librt_sem_getvalue
85 1.1 thorpej
86 1.1 thorpej #define _LIBC /* XXX to get semid_t type */
87 1.1 thorpej
88 1.1 thorpej #include <sys/types.h>
89 1.1 thorpej #include <sys/ksem.h>
90 1.1 thorpej #include <sys/queue.h>
91 1.1 thorpej #include <stdlib.h>
92 1.1 thorpej #include <errno.h>
93 1.1 thorpej #include <fcntl.h>
94 1.1 thorpej #include <semaphore.h>
95 1.1 thorpej #include <stdarg.h>
96 1.1 thorpej
97 1.1 thorpej struct _sem_st {
98 1.1 thorpej unsigned int ksem_magic;
99 1.1 thorpej #define KSEM_MAGIC 0x90af0421U
100 1.1 thorpej
101 1.1 thorpej LIST_ENTRY(_sem_st) ksem_list;
102 1.1 thorpej semid_t ksem_semid; /* 0 -> user (non-shared) */
103 1.1 thorpej sem_t *ksem_identity;
104 1.1 thorpej };
105 1.1 thorpej
106 1.1 thorpej static int sem_alloc(unsigned int value, semid_t semid, sem_t *semp);
107 1.1 thorpej static void sem_free(sem_t sem);
108 1.1 thorpej
109 1.1 thorpej static LIST_HEAD(, _sem_st) named_sems = LIST_HEAD_INITIALIZER(&named_sems);
110 1.1 thorpej
111 1.3 simonb #ifdef __weak_alias
112 1.1 thorpej __weak_alias(sem_init,_librt_sem_init)
113 1.1 thorpej __weak_alias(sem_destroy,_librt_sem_destroy)
114 1.1 thorpej __weak_alias(sem_open,_librt_sem_open)
115 1.1 thorpej __weak_alias(sem_close,_librt_sem_close)
116 1.1 thorpej __weak_alias(sem_unlink,_librt_sem_unlink)
117 1.1 thorpej __weak_alias(sem_wait,_librt_sem_wait)
118 1.1 thorpej __weak_alias(sem_trywait,_librt_sem_trywait)
119 1.1 thorpej __weak_alias(sem_post,_librt_sem_post)
120 1.1 thorpej __weak_alias(sem_getvalue,_librt_sem_getvalue)
121 1.3 simonb #endif
122 1.1 thorpej
123 1.1 thorpej static void
124 1.1 thorpej sem_free(sem_t sem)
125 1.1 thorpej {
126 1.1 thorpej
127 1.1 thorpej sem->ksem_magic = 0;
128 1.1 thorpej free(sem);
129 1.1 thorpej }
130 1.1 thorpej
131 1.1 thorpej static int
132 1.1 thorpej sem_alloc(unsigned int value, semid_t semid, sem_t *semp)
133 1.1 thorpej {
134 1.1 thorpej sem_t sem;
135 1.1 thorpej
136 1.1 thorpej if (value > SEM_VALUE_MAX)
137 1.1 thorpej return (EINVAL);
138 1.1 thorpej
139 1.1 thorpej if ((sem = malloc(sizeof(struct _sem_st))) == NULL)
140 1.1 thorpej return (ENOSPC);
141 1.1 thorpej
142 1.1 thorpej sem->ksem_magic = KSEM_MAGIC;
143 1.1 thorpej sem->ksem_semid = semid;
144 1.1 thorpej
145 1.1 thorpej *semp = sem;
146 1.1 thorpej return (0);
147 1.1 thorpej }
148 1.1 thorpej
149 1.1 thorpej /* ARGSUSED */
150 1.1 thorpej int
151 1.1 thorpej sem_init(sem_t *sem, int pshared, unsigned int value)
152 1.1 thorpej {
153 1.1 thorpej semid_t semid;
154 1.1 thorpej int error;
155 1.1 thorpej
156 1.1 thorpej if (_ksem_init(value, &semid) == -1)
157 1.1 thorpej return (-1);
158 1.1 thorpej
159 1.1 thorpej if ((error = sem_alloc(value, semid, sem)) != 0) {
160 1.1 thorpej _ksem_destroy(semid);
161 1.1 thorpej errno = error;
162 1.1 thorpej return (-1);
163 1.1 thorpej }
164 1.1 thorpej
165 1.1 thorpej return (0);
166 1.1 thorpej }
167 1.1 thorpej
168 1.1 thorpej int
169 1.1 thorpej sem_destroy(sem_t *sem)
170 1.1 thorpej {
171 1.1 thorpej
172 1.1 thorpej #ifdef ERRORCHECK
173 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
174 1.1 thorpej errno = EINVAL;
175 1.1 thorpej return (-1);
176 1.1 thorpej }
177 1.1 thorpej #endif
178 1.1 thorpej
179 1.1 thorpej if (_ksem_destroy((*sem)->ksem_semid) == -1)
180 1.1 thorpej return (-1);
181 1.1 thorpej
182 1.1 thorpej sem_free(*sem);
183 1.1 thorpej
184 1.1 thorpej return (0);
185 1.1 thorpej }
186 1.1 thorpej
187 1.1 thorpej sem_t *
188 1.1 thorpej sem_open(const char *name, int oflag, ...)
189 1.1 thorpej {
190 1.1 thorpej sem_t *sem, s;
191 1.1 thorpej semid_t semid;
192 1.1 thorpej mode_t mode;
193 1.1 thorpej unsigned int value;
194 1.1 thorpej int error;
195 1.1 thorpej va_list ap;
196 1.1 thorpej
197 1.1 thorpej mode = 0;
198 1.1 thorpej value = 0;
199 1.1 thorpej
200 1.1 thorpej if (oflag & O_CREAT) {
201 1.1 thorpej va_start(ap, oflag);
202 1.1 thorpej mode = va_arg(ap, int);
203 1.1 thorpej value = va_arg(ap, unsigned int);
204 1.1 thorpej va_end(ap);
205 1.1 thorpej }
206 1.1 thorpej
207 1.1 thorpej /*
208 1.1 thorpej * We can be lazy and let the kernel handle the oflag,
209 1.1 thorpej * we'll just merge duplicate IDs into our list.
210 1.1 thorpej */
211 1.1 thorpej if (_ksem_open(name, oflag, mode, value, &semid) == -1)
212 1.1 thorpej return (SEM_FAILED);
213 1.1 thorpej
214 1.1 thorpej /*
215 1.1 thorpej * Search for a duplicate ID, we must return the same sem_t *
216 1.1 thorpej * if we locate one.
217 1.1 thorpej */
218 1.1 thorpej LIST_FOREACH(s, &named_sems, ksem_list) {
219 1.1 thorpej if (s->ksem_semid == semid)
220 1.1 thorpej return (s->ksem_identity);
221 1.1 thorpej }
222 1.1 thorpej
223 1.1 thorpej if ((sem = malloc(sizeof(*sem))) == NULL) {
224 1.1 thorpej error = ENOSPC;
225 1.1 thorpej goto bad;
226 1.1 thorpej }
227 1.1 thorpej if ((error = sem_alloc(value, semid, sem)) != 0)
228 1.1 thorpej goto bad;
229 1.1 thorpej
230 1.1 thorpej LIST_INSERT_HEAD(&named_sems, *sem, ksem_list);
231 1.1 thorpej (*sem)->ksem_identity = sem;
232 1.1 thorpej
233 1.1 thorpej return (sem);
234 1.1 thorpej
235 1.1 thorpej bad:
236 1.1 thorpej _ksem_close(semid);
237 1.1 thorpej if (sem != NULL) {
238 1.1 thorpej if (*sem != NULL)
239 1.1 thorpej sem_free(*sem);
240 1.1 thorpej free(sem);
241 1.1 thorpej }
242 1.1 thorpej errno = error;
243 1.1 thorpej return (SEM_FAILED);
244 1.1 thorpej }
245 1.1 thorpej
246 1.1 thorpej int
247 1.1 thorpej sem_close(sem_t *sem)
248 1.1 thorpej {
249 1.1 thorpej
250 1.1 thorpej #ifdef ERRORCHECK
251 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
252 1.1 thorpej errno = EINVAL;
253 1.1 thorpej return (-1);
254 1.1 thorpej }
255 1.1 thorpej #endif
256 1.1 thorpej
257 1.1 thorpej if (_ksem_close((*sem)->ksem_semid) == -1)
258 1.1 thorpej return (-1);
259 1.1 thorpej
260 1.1 thorpej LIST_REMOVE((*sem), ksem_list);
261 1.1 thorpej sem_free(*sem);
262 1.1 thorpej free(sem);
263 1.1 thorpej return (0);
264 1.1 thorpej }
265 1.1 thorpej
266 1.1 thorpej int
267 1.1 thorpej sem_unlink(const char *name)
268 1.1 thorpej {
269 1.1 thorpej
270 1.1 thorpej return (_ksem_unlink(name));
271 1.1 thorpej }
272 1.1 thorpej
273 1.1 thorpej int
274 1.1 thorpej sem_wait(sem_t *sem)
275 1.1 thorpej {
276 1.1 thorpej
277 1.1 thorpej #ifdef ERRORCHECK
278 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
279 1.1 thorpej errno = EINVAL;
280 1.1 thorpej return (-1);
281 1.1 thorpej }
282 1.1 thorpej #endif
283 1.1 thorpej
284 1.1 thorpej return (_ksem_wait((*sem)->ksem_semid));
285 1.1 thorpej }
286 1.1 thorpej
287 1.1 thorpej int
288 1.1 thorpej sem_trywait(sem_t *sem)
289 1.1 thorpej {
290 1.1 thorpej
291 1.1 thorpej #ifdef ERRORCHECK
292 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
293 1.1 thorpej errno = EINVAL;
294 1.1 thorpej return (-1);
295 1.1 thorpej }
296 1.1 thorpej #endif
297 1.1 thorpej
298 1.1 thorpej return (_ksem_trywait((*sem)->ksem_semid));
299 1.1 thorpej }
300 1.1 thorpej
301 1.1 thorpej int
302 1.1 thorpej sem_post(sem_t *sem)
303 1.1 thorpej {
304 1.1 thorpej
305 1.1 thorpej #ifdef ERRORCHECK
306 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
307 1.1 thorpej errno = EINVAL;
308 1.1 thorpej return (-1);
309 1.1 thorpej }
310 1.1 thorpej #endif
311 1.1 thorpej
312 1.1 thorpej return (_ksem_post((*sem)->ksem_semid));
313 1.1 thorpej }
314 1.1 thorpej
315 1.1 thorpej int
316 1.1 thorpej sem_getvalue(sem_t * __restrict sem, int * __restrict sval)
317 1.1 thorpej {
318 1.1 thorpej
319 1.1 thorpej #ifdef ERRORCHECK
320 1.1 thorpej if (sem == NULL || *sem == NULL || (*sem)->ksem_magic != KSEM_MAGIC) {
321 1.1 thorpej errno = EINVAL;
322 1.1 thorpej return (-1);
323 1.1 thorpej }
324 1.1 thorpej #endif
325 1.1 thorpej return (_ksem_getvalue((*sem)->ksem_semid, sval));
326 1.1 thorpej }
327