sys_mqueue.c revision 1.18 1 1.18 rmind /* $NetBSD: sys_mqueue.c,v 1.18 2009/05/26 00:39:14 rmind Exp $ */
2 1.1 rmind
3 1.1 rmind /*
4 1.8 rmind * Copyright (c) 2007, 2008 Mindaugas Rasiukevicius <rmind at NetBSD org>
5 1.5 rmind * All rights reserved.
6 1.1 rmind *
7 1.1 rmind * Redistribution and use in source and binary forms, with or without
8 1.1 rmind * modification, are permitted provided that the following conditions
9 1.1 rmind * are met:
10 1.1 rmind * 1. Redistributions of source code must retain the above copyright
11 1.1 rmind * notice, this list of conditions and the following disclaimer.
12 1.1 rmind * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 rmind * notice, this list of conditions and the following disclaimer in the
14 1.1 rmind * documentation and/or other materials provided with the distribution.
15 1.1 rmind *
16 1.8 rmind * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 1.8 rmind * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 1.8 rmind * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 1.8 rmind * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 1.8 rmind * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 1.8 rmind * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 1.8 rmind * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 1.8 rmind * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 1.8 rmind * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 1.8 rmind * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 1.8 rmind * SUCH DAMAGE.
27 1.1 rmind */
28 1.1 rmind
29 1.1 rmind /*
30 1.1 rmind * Implementation of POSIX message queues.
31 1.1 rmind * Defined in the Base Definitions volume of IEEE Std 1003.1-2001.
32 1.12 rmind *
33 1.12 rmind * Locking
34 1.1 rmind *
35 1.12 rmind * Global list of message queues (mqueue_head) and proc_t::p_mqueue_cnt
36 1.12 rmind * counter are protected by mqlist_mtx lock. The very message queue and
37 1.12 rmind * its members are protected by mqueue::mq_mtx.
38 1.1 rmind *
39 1.1 rmind * Lock order:
40 1.1 rmind * mqlist_mtx
41 1.1 rmind * -> mqueue::mq_mtx
42 1.1 rmind */
43 1.1 rmind
44 1.1 rmind #include <sys/cdefs.h>
45 1.18 rmind __KERNEL_RCSID(0, "$NetBSD: sys_mqueue.c,v 1.18 2009/05/26 00:39:14 rmind Exp $");
46 1.1 rmind
47 1.1 rmind #include <sys/param.h>
48 1.1 rmind #include <sys/types.h>
49 1.1 rmind #include <sys/condvar.h>
50 1.1 rmind #include <sys/errno.h>
51 1.1 rmind #include <sys/fcntl.h>
52 1.1 rmind #include <sys/file.h>
53 1.1 rmind #include <sys/filedesc.h>
54 1.1 rmind #include <sys/kauth.h>
55 1.1 rmind #include <sys/kernel.h>
56 1.1 rmind #include <sys/kmem.h>
57 1.1 rmind #include <sys/lwp.h>
58 1.1 rmind #include <sys/mqueue.h>
59 1.1 rmind #include <sys/mutex.h>
60 1.1 rmind #include <sys/pool.h>
61 1.8 rmind #include <sys/poll.h>
62 1.1 rmind #include <sys/proc.h>
63 1.1 rmind #include <sys/queue.h>
64 1.8 rmind #include <sys/select.h>
65 1.1 rmind #include <sys/signal.h>
66 1.1 rmind #include <sys/signalvar.h>
67 1.12 rmind #include <sys/stat.h>
68 1.1 rmind #include <sys/sysctl.h>
69 1.1 rmind #include <sys/syscallargs.h>
70 1.1 rmind #include <sys/systm.h>
71 1.1 rmind #include <sys/unistd.h>
72 1.1 rmind #include <sys/vnode.h>
73 1.1 rmind
74 1.1 rmind /* System-wide limits. */
75 1.1 rmind static u_int mq_open_max = MQ_OPEN_MAX;
76 1.1 rmind static u_int mq_prio_max = MQ_PRIO_MAX;
77 1.1 rmind
78 1.1 rmind static u_int mq_max_msgsize = 16 * MQ_DEF_MSGSIZE;
79 1.1 rmind static u_int mq_def_maxmsg = 32;
80 1.1 rmind
81 1.1 rmind static kmutex_t mqlist_mtx;
82 1.8 rmind static pool_cache_t mqmsg_cache;
83 1.4 matt static LIST_HEAD(, mqueue) mqueue_head =
84 1.4 matt LIST_HEAD_INITIALIZER(mqueue_head);
85 1.1 rmind
86 1.8 rmind static int mq_poll_fop(file_t *, int);
87 1.15 christos static int mq_stat_fop(file_t *, struct stat *);
88 1.7 ad static int mq_close_fop(file_t *);
89 1.1 rmind
90 1.1 rmind static const struct fileops mqops = {
91 1.14 ad .fo_read = fbadop_read,
92 1.14 ad .fo_write = fbadop_write,
93 1.14 ad .fo_ioctl = fbadop_ioctl,
94 1.14 ad .fo_fcntl = fnullop_fcntl,
95 1.14 ad .fo_poll = mq_poll_fop,
96 1.15 christos .fo_stat = mq_stat_fop,
97 1.14 ad .fo_close = mq_close_fop,
98 1.14 ad .fo_kqfilter = fnullop_kqfilter,
99 1.14 ad .fo_drain = fnullop_drain,
100 1.1 rmind };
101 1.1 rmind
102 1.1 rmind /*
103 1.1 rmind * Initialize POSIX message queue subsystem.
104 1.1 rmind */
105 1.1 rmind void
106 1.1 rmind mqueue_sysinit(void)
107 1.1 rmind {
108 1.1 rmind
109 1.9 ad mqmsg_cache = pool_cache_init(MQ_DEF_MSGSIZE, coherency_unit,
110 1.12 rmind 0, 0, "mqmsgpl", NULL, IPL_NONE, NULL, NULL, NULL);
111 1.1 rmind mutex_init(&mqlist_mtx, MUTEX_DEFAULT, IPL_NONE);
112 1.1 rmind }
113 1.1 rmind
114 1.1 rmind /*
115 1.1 rmind * Free the message.
116 1.1 rmind */
117 1.1 rmind static void
118 1.1 rmind mqueue_freemsg(struct mq_msg *msg, const size_t size)
119 1.1 rmind {
120 1.1 rmind
121 1.1 rmind if (size > MQ_DEF_MSGSIZE)
122 1.1 rmind kmem_free(msg, size);
123 1.1 rmind else
124 1.8 rmind pool_cache_put(mqmsg_cache, msg);
125 1.1 rmind }
126 1.1 rmind
127 1.1 rmind /*
128 1.1 rmind * Destroy the message queue.
129 1.1 rmind */
130 1.1 rmind static void
131 1.1 rmind mqueue_destroy(struct mqueue *mq)
132 1.1 rmind {
133 1.1 rmind struct mq_msg *msg;
134 1.1 rmind
135 1.1 rmind while ((msg = TAILQ_FIRST(&mq->mq_head)) != NULL) {
136 1.1 rmind TAILQ_REMOVE(&mq->mq_head, msg, msg_queue);
137 1.1 rmind mqueue_freemsg(msg, sizeof(struct mq_msg) + msg->msg_len);
138 1.1 rmind }
139 1.8 rmind seldestroy(&mq->mq_rsel);
140 1.8 rmind seldestroy(&mq->mq_wsel);
141 1.1 rmind cv_destroy(&mq->mq_send_cv);
142 1.1 rmind cv_destroy(&mq->mq_recv_cv);
143 1.1 rmind mutex_destroy(&mq->mq_mtx);
144 1.1 rmind kmem_free(mq, sizeof(struct mqueue));
145 1.1 rmind }
146 1.1 rmind
147 1.1 rmind /*
148 1.1 rmind * Lookup for file name in general list of message queues.
149 1.1 rmind * => locks the message queue
150 1.1 rmind */
151 1.1 rmind static void *
152 1.1 rmind mqueue_lookup(char *name)
153 1.1 rmind {
154 1.1 rmind struct mqueue *mq;
155 1.1 rmind KASSERT(mutex_owned(&mqlist_mtx));
156 1.1 rmind
157 1.1 rmind LIST_FOREACH(mq, &mqueue_head, mq_list) {
158 1.1 rmind if (strncmp(mq->mq_name, name, MQ_NAMELEN) == 0) {
159 1.1 rmind mutex_enter(&mq->mq_mtx);
160 1.1 rmind return mq;
161 1.1 rmind }
162 1.1 rmind }
163 1.1 rmind
164 1.1 rmind return NULL;
165 1.1 rmind }
166 1.1 rmind
167 1.1 rmind /*
168 1.18 rmind * mqueue_get: get the mqueue from the descriptor.
169 1.18 rmind * => locks the message queue, if found.
170 1.18 rmind * => holds a reference on the file descriptor.
171 1.1 rmind */
172 1.1 rmind static int
173 1.18 rmind mqueue_get(mqd_t mqd, file_t **fpr)
174 1.1 rmind {
175 1.18 rmind struct mqueue *mq;
176 1.7 ad file_t *fp;
177 1.1 rmind
178 1.7 ad fp = fd_getfile((int)mqd);
179 1.18 rmind if (__predict_false(fp == NULL)) {
180 1.18 rmind return EBADF;
181 1.18 rmind }
182 1.18 rmind if (__predict_false(fp->f_type != DTYPE_MQUEUE)) {
183 1.18 rmind fd_putfile((int)mqd);
184 1.1 rmind return EBADF;
185 1.18 rmind }
186 1.1 rmind mq = fp->f_data;
187 1.1 rmind mutex_enter(&mq->mq_mtx);
188 1.1 rmind
189 1.18 rmind *fpr = fp;
190 1.1 rmind return 0;
191 1.1 rmind }
192 1.1 rmind
193 1.1 rmind /*
194 1.1 rmind * Converter from struct timespec to the ticks.
195 1.1 rmind * Used by mq_timedreceive(), mq_timedsend().
196 1.1 rmind */
197 1.13 christos int
198 1.13 christos abstimeout2timo(struct timespec *ts, int *timo)
199 1.1 rmind {
200 1.1 rmind int error;
201 1.1 rmind
202 1.1 rmind /*
203 1.1 rmind * According to POSIX, validation check is needed only in case of
204 1.1 rmind * blocking. Thus, set the invalid value right now, and fail latter.
205 1.1 rmind */
206 1.13 christos error = itimespecfix(ts);
207 1.13 christos *timo = (error == 0) ? tstohz(ts) : -1;
208 1.1 rmind
209 1.1 rmind return 0;
210 1.1 rmind }
211 1.1 rmind
212 1.1 rmind static int
213 1.15 christos mq_stat_fop(file_t *fp, struct stat *st)
214 1.15 christos {
215 1.15 christos struct mqueue *mq = fp->f_data;
216 1.15 christos
217 1.15 christos (void)memset(st, 0, sizeof(*st));
218 1.16 christos
219 1.16 christos mutex_enter(&mq->mq_mtx);
220 1.15 christos st->st_mode = mq->mq_mode;
221 1.15 christos st->st_uid = mq->mq_euid;
222 1.15 christos st->st_gid = mq->mq_egid;
223 1.15 christos st->st_atimespec = mq->mq_atime;
224 1.15 christos st->st_mtimespec = mq->mq_mtime;
225 1.15 christos st->st_ctimespec = st->st_birthtimespec = mq->mq_btime;
226 1.16 christos st->st_uid = kauth_cred_geteuid(fp->f_cred);
227 1.16 christos st->st_gid = kauth_cred_getegid(fp->f_cred);
228 1.16 christos mutex_exit(&mq->mq_mtx);
229 1.16 christos
230 1.15 christos return 0;
231 1.15 christos }
232 1.15 christos
233 1.15 christos static int
234 1.8 rmind mq_poll_fop(file_t *fp, int events)
235 1.8 rmind {
236 1.8 rmind struct mqueue *mq = fp->f_data;
237 1.8 rmind int revents = 0;
238 1.8 rmind
239 1.8 rmind mutex_enter(&mq->mq_mtx);
240 1.8 rmind if (events & (POLLIN | POLLRDNORM)) {
241 1.8 rmind /* Ready for receiving, if there are messages in the queue */
242 1.8 rmind if (mq->mq_attrib.mq_curmsgs)
243 1.8 rmind revents |= (POLLIN | POLLRDNORM);
244 1.8 rmind else
245 1.8 rmind selrecord(curlwp, &mq->mq_rsel);
246 1.8 rmind }
247 1.8 rmind if (events & (POLLOUT | POLLWRNORM)) {
248 1.8 rmind /* Ready for sending, if the message queue is not full */
249 1.8 rmind if (mq->mq_attrib.mq_curmsgs < mq->mq_attrib.mq_maxmsg)
250 1.8 rmind revents |= (POLLOUT | POLLWRNORM);
251 1.8 rmind else
252 1.8 rmind selrecord(curlwp, &mq->mq_wsel);
253 1.8 rmind }
254 1.8 rmind mutex_exit(&mq->mq_mtx);
255 1.8 rmind
256 1.8 rmind return revents;
257 1.8 rmind }
258 1.8 rmind
259 1.8 rmind static int
260 1.7 ad mq_close_fop(file_t *fp)
261 1.1 rmind {
262 1.7 ad struct proc *p = curproc;
263 1.1 rmind struct mqueue *mq = fp->f_data;
264 1.1 rmind bool destroy;
265 1.1 rmind
266 1.1 rmind mutex_enter(&mqlist_mtx);
267 1.1 rmind mutex_enter(&mq->mq_mtx);
268 1.1 rmind
269 1.1 rmind /* Decrease the counters */
270 1.1 rmind p->p_mqueue_cnt--;
271 1.1 rmind mq->mq_refcnt--;
272 1.1 rmind
273 1.1 rmind /* Remove notification if registered for this process */
274 1.1 rmind if (mq->mq_notify_proc == p)
275 1.1 rmind mq->mq_notify_proc = NULL;
276 1.1 rmind
277 1.1 rmind /*
278 1.1 rmind * If this is the last reference and mqueue is marked for unlink,
279 1.1 rmind * remove and later destroy the message queue.
280 1.1 rmind */
281 1.1 rmind if (mq->mq_refcnt == 0 && (mq->mq_attrib.mq_flags & MQ_UNLINK)) {
282 1.1 rmind LIST_REMOVE(mq, mq_list);
283 1.1 rmind destroy = true;
284 1.1 rmind } else
285 1.1 rmind destroy = false;
286 1.1 rmind
287 1.1 rmind mutex_exit(&mq->mq_mtx);
288 1.1 rmind mutex_exit(&mqlist_mtx);
289 1.1 rmind
290 1.1 rmind if (destroy)
291 1.1 rmind mqueue_destroy(mq);
292 1.1 rmind
293 1.1 rmind return 0;
294 1.1 rmind }
295 1.1 rmind
296 1.1 rmind /*
297 1.1 rmind * General mqueue system calls.
298 1.1 rmind */
299 1.1 rmind
300 1.1 rmind int
301 1.8 rmind sys_mq_open(struct lwp *l, const struct sys_mq_open_args *uap,
302 1.8 rmind register_t *retval)
303 1.1 rmind {
304 1.6 dsl /* {
305 1.1 rmind syscallarg(const char *) name;
306 1.1 rmind syscallarg(int) oflag;
307 1.1 rmind syscallarg(mode_t) mode;
308 1.1 rmind syscallarg(struct mq_attr) attr;
309 1.6 dsl } */
310 1.1 rmind struct proc *p = l->l_proc;
311 1.1 rmind struct mqueue *mq, *mq_new = NULL;
312 1.7 ad file_t *fp;
313 1.1 rmind char *name;
314 1.1 rmind int mqd, error, oflag;
315 1.1 rmind
316 1.1 rmind oflag = SCARG(uap, oflag);
317 1.1 rmind
318 1.1 rmind /* Get the name from the user-space */
319 1.1 rmind name = kmem_zalloc(MQ_NAMELEN, KM_SLEEP);
320 1.1 rmind error = copyinstr(SCARG(uap, name), name, MQ_NAMELEN - 1, NULL);
321 1.1 rmind if (error) {
322 1.1 rmind kmem_free(name, MQ_NAMELEN);
323 1.1 rmind return error;
324 1.1 rmind }
325 1.1 rmind
326 1.1 rmind if (oflag & O_CREAT) {
327 1.12 rmind struct cwdinfo *cwdi = p->p_cwdi;
328 1.1 rmind struct mq_attr attr;
329 1.1 rmind
330 1.1 rmind /* Check the limit */
331 1.1 rmind if (p->p_mqueue_cnt == mq_open_max) {
332 1.1 rmind kmem_free(name, MQ_NAMELEN);
333 1.1 rmind return EMFILE;
334 1.1 rmind }
335 1.1 rmind
336 1.18 rmind /* Empty name is invalid */
337 1.18 rmind if (name[0] == '\0') {
338 1.18 rmind kmem_free(name, MQ_NAMELEN);
339 1.18 rmind return EINVAL;
340 1.18 rmind }
341 1.18 rmind
342 1.1 rmind /* Check for mqueue attributes */
343 1.1 rmind if (SCARG(uap, attr)) {
344 1.1 rmind error = copyin(SCARG(uap, attr), &attr,
345 1.1 rmind sizeof(struct mq_attr));
346 1.1 rmind if (error) {
347 1.1 rmind kmem_free(name, MQ_NAMELEN);
348 1.1 rmind return error;
349 1.1 rmind }
350 1.1 rmind if (attr.mq_maxmsg <= 0 || attr.mq_msgsize <= 0 ||
351 1.1 rmind attr.mq_msgsize > mq_max_msgsize) {
352 1.1 rmind kmem_free(name, MQ_NAMELEN);
353 1.1 rmind return EINVAL;
354 1.1 rmind }
355 1.1 rmind attr.mq_curmsgs = 0;
356 1.1 rmind } else {
357 1.1 rmind memset(&attr, 0, sizeof(struct mq_attr));
358 1.1 rmind attr.mq_maxmsg = mq_def_maxmsg;
359 1.1 rmind attr.mq_msgsize =
360 1.1 rmind MQ_DEF_MSGSIZE - sizeof(struct mq_msg);
361 1.1 rmind }
362 1.1 rmind
363 1.1 rmind /*
364 1.1 rmind * Allocate new mqueue, initialize data structures,
365 1.1 rmind * copy the name, attributes and set the flag.
366 1.1 rmind */
367 1.1 rmind mq_new = kmem_zalloc(sizeof(struct mqueue), KM_SLEEP);
368 1.1 rmind
369 1.1 rmind mutex_init(&mq_new->mq_mtx, MUTEX_DEFAULT, IPL_NONE);
370 1.1 rmind cv_init(&mq_new->mq_send_cv, "mqsendcv");
371 1.1 rmind cv_init(&mq_new->mq_recv_cv, "mqrecvcv");
372 1.1 rmind TAILQ_INIT(&mq_new->mq_head);
373 1.8 rmind selinit(&mq_new->mq_rsel);
374 1.8 rmind selinit(&mq_new->mq_wsel);
375 1.1 rmind
376 1.1 rmind strlcpy(mq_new->mq_name, name, MQ_NAMELEN);
377 1.1 rmind memcpy(&mq_new->mq_attrib, &attr, sizeof(struct mq_attr));
378 1.18 rmind
379 1.18 rmind CTASSERT((O_MASK & (MQ_UNLINK | MQ_RECEIVE)) == 0);
380 1.18 rmind mq_new->mq_attrib.mq_flags = (O_MASK & oflag);
381 1.1 rmind
382 1.1 rmind /* Store mode and effective UID with GID */
383 1.12 rmind mq_new->mq_mode = ((SCARG(uap, mode) &
384 1.12 rmind ~cwdi->cwdi_cmask) & ALLPERMS) & ~S_ISTXT;
385 1.1 rmind mq_new->mq_euid = kauth_cred_geteuid(l->l_cred);
386 1.1 rmind mq_new->mq_egid = kauth_cred_getegid(l->l_cred);
387 1.1 rmind }
388 1.1 rmind
389 1.1 rmind /* Allocate file structure and descriptor */
390 1.7 ad error = fd_allocfile(&fp, &mqd);
391 1.1 rmind if (error) {
392 1.1 rmind if (mq_new)
393 1.1 rmind mqueue_destroy(mq_new);
394 1.1 rmind kmem_free(name, MQ_NAMELEN);
395 1.1 rmind return error;
396 1.1 rmind }
397 1.1 rmind fp->f_type = DTYPE_MQUEUE;
398 1.11 rmind fp->f_flag = FFLAGS(oflag) & (FREAD | FWRITE);
399 1.1 rmind fp->f_ops = &mqops;
400 1.1 rmind
401 1.1 rmind /* Look up for mqueue with such name */
402 1.1 rmind mutex_enter(&mqlist_mtx);
403 1.1 rmind mq = mqueue_lookup(name);
404 1.1 rmind if (mq) {
405 1.18 rmind mode_t acc_mode;
406 1.18 rmind
407 1.12 rmind KASSERT(mutex_owned(&mq->mq_mtx));
408 1.11 rmind
409 1.1 rmind /* Check if mqueue is not marked as unlinking */
410 1.1 rmind if (mq->mq_attrib.mq_flags & MQ_UNLINK) {
411 1.1 rmind error = EACCES;
412 1.1 rmind goto exit;
413 1.1 rmind }
414 1.1 rmind /* Fail if O_EXCL is set, and mqueue already exists */
415 1.1 rmind if ((oflag & O_CREAT) && (oflag & O_EXCL)) {
416 1.1 rmind error = EEXIST;
417 1.1 rmind goto exit;
418 1.1 rmind }
419 1.18 rmind
420 1.18 rmind /*
421 1.18 rmind * Check the permissions. Note the difference between
422 1.18 rmind * VREAD/VWRITE and FREAD/FWRITE.
423 1.18 rmind */
424 1.18 rmind acc_mode = 0;
425 1.18 rmind if (fp->f_flag & FREAD) {
426 1.18 rmind acc_mode |= VREAD;
427 1.18 rmind }
428 1.18 rmind if (fp->f_flag & FWRITE) {
429 1.18 rmind acc_mode |= VWRITE;
430 1.18 rmind }
431 1.18 rmind if (vaccess(VNON, mq->mq_mode, mq->mq_euid, mq->mq_egid,
432 1.18 rmind acc_mode, l->l_cred)) {
433 1.1 rmind error = EACCES;
434 1.1 rmind goto exit;
435 1.1 rmind }
436 1.1 rmind } else {
437 1.1 rmind /* Fail if mqueue neither exists, nor we create it */
438 1.1 rmind if ((oflag & O_CREAT) == 0) {
439 1.1 rmind mutex_exit(&mqlist_mtx);
440 1.1 rmind KASSERT(mq_new == NULL);
441 1.7 ad fd_abort(p, fp, mqd);
442 1.1 rmind kmem_free(name, MQ_NAMELEN);
443 1.1 rmind return ENOENT;
444 1.1 rmind }
445 1.1 rmind
446 1.1 rmind /* Check the limit */
447 1.1 rmind if (p->p_mqueue_cnt == mq_open_max) {
448 1.1 rmind error = EMFILE;
449 1.1 rmind goto exit;
450 1.1 rmind }
451 1.1 rmind
452 1.1 rmind /* Insert the queue to the list */
453 1.1 rmind mq = mq_new;
454 1.1 rmind mutex_enter(&mq->mq_mtx);
455 1.1 rmind LIST_INSERT_HEAD(&mqueue_head, mq, mq_list);
456 1.1 rmind mq_new = NULL;
457 1.15 christos getnanotime(&mq->mq_btime);
458 1.15 christos mq->mq_atime = mq->mq_mtime = mq->mq_btime;
459 1.1 rmind }
460 1.1 rmind
461 1.1 rmind /* Increase the counters, and make descriptor ready */
462 1.1 rmind p->p_mqueue_cnt++;
463 1.1 rmind mq->mq_refcnt++;
464 1.1 rmind fp->f_data = mq;
465 1.1 rmind exit:
466 1.1 rmind mutex_exit(&mq->mq_mtx);
467 1.1 rmind mutex_exit(&mqlist_mtx);
468 1.1 rmind
469 1.1 rmind if (mq_new)
470 1.1 rmind mqueue_destroy(mq_new);
471 1.1 rmind if (error) {
472 1.7 ad fd_abort(p, fp, mqd);
473 1.7 ad } else {
474 1.7 ad fd_affix(p, fp, mqd);
475 1.1 rmind *retval = mqd;
476 1.7 ad }
477 1.1 rmind kmem_free(name, MQ_NAMELEN);
478 1.1 rmind
479 1.1 rmind return error;
480 1.1 rmind }
481 1.1 rmind
482 1.1 rmind int
483 1.8 rmind sys_mq_close(struct lwp *l, const struct sys_mq_close_args *uap,
484 1.8 rmind register_t *retval)
485 1.1 rmind {
486 1.1 rmind
487 1.6 dsl return sys_close(l, (const void *)uap, retval);
488 1.1 rmind }
489 1.1 rmind
490 1.1 rmind /*
491 1.1 rmind * Primary mq_receive1() function.
492 1.1 rmind */
493 1.13 christos int
494 1.1 rmind mq_receive1(struct lwp *l, mqd_t mqdes, void *msg_ptr, size_t msg_len,
495 1.1 rmind unsigned *msg_prio, int t, ssize_t *mlen)
496 1.1 rmind {
497 1.7 ad file_t *fp = NULL;
498 1.1 rmind struct mqueue *mq;
499 1.1 rmind struct mq_msg *msg = NULL;
500 1.1 rmind int error;
501 1.1 rmind
502 1.1 rmind /* Get the message queue */
503 1.18 rmind error = mqueue_get(mqdes, &fp);
504 1.1 rmind if (error)
505 1.1 rmind return error;
506 1.1 rmind mq = fp->f_data;
507 1.1 rmind
508 1.15 christos getnanotime(&mq->mq_atime);
509 1.1 rmind /* Check the message size limits */
510 1.1 rmind if (msg_len < mq->mq_attrib.mq_msgsize) {
511 1.1 rmind error = EMSGSIZE;
512 1.1 rmind goto error;
513 1.1 rmind }
514 1.1 rmind
515 1.1 rmind /* Check if queue is empty */
516 1.2 ad while (TAILQ_EMPTY(&mq->mq_head)) {
517 1.1 rmind if (mq->mq_attrib.mq_flags & O_NONBLOCK) {
518 1.1 rmind error = EAGAIN;
519 1.1 rmind goto error;
520 1.1 rmind }
521 1.1 rmind if (t < 0) {
522 1.1 rmind error = EINVAL;
523 1.1 rmind goto error;
524 1.1 rmind }
525 1.1 rmind /*
526 1.1 rmind * Block until someone sends the message.
527 1.1 rmind * While doing this, notification should not be sent.
528 1.1 rmind */
529 1.1 rmind mq->mq_attrib.mq_flags |= MQ_RECEIVE;
530 1.1 rmind error = cv_timedwait_sig(&mq->mq_send_cv, &mq->mq_mtx, t);
531 1.1 rmind mq->mq_attrib.mq_flags &= ~MQ_RECEIVE;
532 1.1 rmind if (error || (mq->mq_attrib.mq_flags & MQ_UNLINK)) {
533 1.3 rmind error = (error == EWOULDBLOCK) ? ETIMEDOUT : EINTR;
534 1.1 rmind goto error;
535 1.1 rmind }
536 1.1 rmind }
537 1.1 rmind
538 1.1 rmind /* Remove the message from the queue */
539 1.1 rmind msg = TAILQ_FIRST(&mq->mq_head);
540 1.1 rmind KASSERT(msg != NULL);
541 1.1 rmind TAILQ_REMOVE(&mq->mq_head, msg, msg_queue);
542 1.1 rmind
543 1.1 rmind /* Decrement the counter and signal waiter, if any */
544 1.1 rmind mq->mq_attrib.mq_curmsgs--;
545 1.1 rmind cv_signal(&mq->mq_recv_cv);
546 1.8 rmind
547 1.8 rmind /* Ready for sending now */
548 1.8 rmind selnotify(&mq->mq_wsel, POLLOUT | POLLWRNORM, 0);
549 1.1 rmind error:
550 1.1 rmind mutex_exit(&mq->mq_mtx);
551 1.7 ad fd_putfile((int)mqdes);
552 1.1 rmind if (error)
553 1.1 rmind return error;
554 1.1 rmind
555 1.1 rmind /*
556 1.1 rmind * Copy the data to the user-space.
557 1.1 rmind * Note: According to POSIX, no message should be removed from the
558 1.1 rmind * queue in case of fail - this would be violated.
559 1.1 rmind */
560 1.1 rmind *mlen = msg->msg_len;
561 1.1 rmind error = copyout(msg->msg_ptr, msg_ptr, msg->msg_len);
562 1.1 rmind if (error == 0 && msg_prio)
563 1.1 rmind error = copyout(&msg->msg_prio, msg_prio, sizeof(unsigned));
564 1.1 rmind mqueue_freemsg(msg, sizeof(struct mq_msg) + msg->msg_len);
565 1.1 rmind
566 1.1 rmind return error;
567 1.1 rmind }
568 1.1 rmind
569 1.1 rmind int
570 1.8 rmind sys_mq_receive(struct lwp *l, const struct sys_mq_receive_args *uap,
571 1.8 rmind register_t *retval)
572 1.1 rmind {
573 1.6 dsl /* {
574 1.1 rmind syscallarg(mqd_t) mqdes;
575 1.1 rmind syscallarg(char *) msg_ptr;
576 1.1 rmind syscallarg(size_t) msg_len;
577 1.1 rmind syscallarg(unsigned *) msg_prio;
578 1.6 dsl } */
579 1.1 rmind int error;
580 1.1 rmind ssize_t mlen;
581 1.1 rmind
582 1.1 rmind error = mq_receive1(l, SCARG(uap, mqdes), SCARG(uap, msg_ptr),
583 1.1 rmind SCARG(uap, msg_len), SCARG(uap, msg_prio), 0, &mlen);
584 1.1 rmind if (error == 0)
585 1.1 rmind *retval = mlen;
586 1.1 rmind
587 1.1 rmind return error;
588 1.1 rmind }
589 1.1 rmind
590 1.1 rmind int
591 1.13 christos sys___mq_timedreceive50(struct lwp *l,
592 1.13 christos const struct sys___mq_timedreceive50_args *uap, register_t *retval)
593 1.1 rmind {
594 1.6 dsl /* {
595 1.1 rmind syscallarg(mqd_t) mqdes;
596 1.1 rmind syscallarg(char *) msg_ptr;
597 1.1 rmind syscallarg(size_t) msg_len;
598 1.1 rmind syscallarg(unsigned *) msg_prio;
599 1.1 rmind syscallarg(const struct timespec *) abs_timeout;
600 1.6 dsl } */
601 1.1 rmind int error, t;
602 1.1 rmind ssize_t mlen;
603 1.13 christos struct timespec ts;
604 1.1 rmind
605 1.1 rmind /* Get and convert time value */
606 1.1 rmind if (SCARG(uap, abs_timeout)) {
607 1.13 christos error = copyin(SCARG(uap, abs_timeout), &ts, sizeof(ts));
608 1.13 christos if (error)
609 1.13 christos return error;
610 1.13 christos
611 1.13 christos error = abstimeout2timo(&ts, &t);
612 1.1 rmind if (error)
613 1.1 rmind return error;
614 1.1 rmind } else
615 1.1 rmind t = 0;
616 1.1 rmind
617 1.1 rmind error = mq_receive1(l, SCARG(uap, mqdes), SCARG(uap, msg_ptr),
618 1.1 rmind SCARG(uap, msg_len), SCARG(uap, msg_prio), t, &mlen);
619 1.1 rmind if (error == 0)
620 1.1 rmind *retval = mlen;
621 1.1 rmind
622 1.1 rmind return error;
623 1.1 rmind }
624 1.1 rmind
625 1.1 rmind /*
626 1.1 rmind * Primary mq_send1() function.
627 1.1 rmind */
628 1.13 christos int
629 1.1 rmind mq_send1(struct lwp *l, mqd_t mqdes, const char *msg_ptr, size_t msg_len,
630 1.1 rmind unsigned msg_prio, int t)
631 1.1 rmind {
632 1.7 ad file_t *fp = NULL;
633 1.1 rmind struct mqueue *mq;
634 1.1 rmind struct mq_msg *msg, *pos_msg;
635 1.1 rmind struct proc *notify = NULL;
636 1.1 rmind ksiginfo_t ksi;
637 1.1 rmind size_t size;
638 1.1 rmind int error;
639 1.1 rmind
640 1.1 rmind /* Check the priority range */
641 1.1 rmind if (msg_prio >= mq_prio_max)
642 1.1 rmind return EINVAL;
643 1.1 rmind
644 1.1 rmind /* Allocate a new message */
645 1.1 rmind size = sizeof(struct mq_msg) + msg_len;
646 1.1 rmind if (size > mq_max_msgsize)
647 1.1 rmind return EMSGSIZE;
648 1.1 rmind
649 1.1 rmind if (size > MQ_DEF_MSGSIZE)
650 1.1 rmind msg = kmem_alloc(size, KM_SLEEP);
651 1.1 rmind else
652 1.8 rmind msg = pool_cache_get(mqmsg_cache, PR_WAITOK);
653 1.1 rmind
654 1.1 rmind /* Get the data from user-space */
655 1.1 rmind error = copyin(msg_ptr, msg->msg_ptr, msg_len);
656 1.1 rmind if (error) {
657 1.1 rmind mqueue_freemsg(msg, size);
658 1.1 rmind return error;
659 1.1 rmind }
660 1.1 rmind msg->msg_len = msg_len;
661 1.1 rmind msg->msg_prio = msg_prio;
662 1.1 rmind
663 1.1 rmind /* Get the mqueue */
664 1.18 rmind error = mqueue_get(mqdes, &fp);
665 1.1 rmind if (error) {
666 1.1 rmind mqueue_freemsg(msg, size);
667 1.1 rmind return error;
668 1.1 rmind }
669 1.1 rmind mq = fp->f_data;
670 1.1 rmind
671 1.15 christos getnanotime(&mq->mq_mtime);
672 1.15 christos
673 1.1 rmind /* Check the message size limit */
674 1.1 rmind if (msg_len <= 0 || msg_len > mq->mq_attrib.mq_msgsize) {
675 1.1 rmind error = EMSGSIZE;
676 1.1 rmind goto error;
677 1.1 rmind }
678 1.1 rmind
679 1.1 rmind /* Check if queue is full */
680 1.2 ad while (mq->mq_attrib.mq_curmsgs >= mq->mq_attrib.mq_maxmsg) {
681 1.1 rmind if (mq->mq_attrib.mq_flags & O_NONBLOCK) {
682 1.1 rmind error = EAGAIN;
683 1.1 rmind goto error;
684 1.1 rmind }
685 1.1 rmind if (t < 0) {
686 1.1 rmind error = EINVAL;
687 1.1 rmind goto error;
688 1.1 rmind }
689 1.1 rmind /* Block until queue becomes available */
690 1.1 rmind error = cv_timedwait_sig(&mq->mq_recv_cv, &mq->mq_mtx, t);
691 1.1 rmind if (error || (mq->mq_attrib.mq_flags & MQ_UNLINK)) {
692 1.1 rmind error = (error == EWOULDBLOCK) ? ETIMEDOUT : error;
693 1.1 rmind goto error;
694 1.1 rmind }
695 1.1 rmind }
696 1.1 rmind KASSERT(mq->mq_attrib.mq_curmsgs < mq->mq_attrib.mq_maxmsg);
697 1.1 rmind
698 1.1 rmind /* Insert message into the queue, according to the priority */
699 1.1 rmind TAILQ_FOREACH(pos_msg, &mq->mq_head, msg_queue)
700 1.1 rmind if (msg->msg_prio > pos_msg->msg_prio)
701 1.1 rmind break;
702 1.1 rmind if (pos_msg == NULL)
703 1.1 rmind TAILQ_INSERT_TAIL(&mq->mq_head, msg, msg_queue);
704 1.1 rmind else
705 1.1 rmind TAILQ_INSERT_BEFORE(pos_msg, msg, msg_queue);
706 1.1 rmind
707 1.1 rmind /* Check for the notify */
708 1.1 rmind if (mq->mq_attrib.mq_curmsgs == 0 && mq->mq_notify_proc &&
709 1.1 rmind (mq->mq_attrib.mq_flags & MQ_RECEIVE) == 0) {
710 1.1 rmind /* Initialize the signal */
711 1.1 rmind KSI_INIT(&ksi);
712 1.1 rmind ksi.ksi_signo = mq->mq_sig_notify.sigev_signo;
713 1.1 rmind ksi.ksi_code = SI_MESGQ;
714 1.1 rmind ksi.ksi_value = mq->mq_sig_notify.sigev_value;
715 1.1 rmind /* Unregister the process */
716 1.1 rmind notify = mq->mq_notify_proc;
717 1.1 rmind mq->mq_notify_proc = NULL;
718 1.1 rmind }
719 1.1 rmind
720 1.1 rmind /* Increment the counter and signal waiter, if any */
721 1.1 rmind mq->mq_attrib.mq_curmsgs++;
722 1.1 rmind cv_signal(&mq->mq_send_cv);
723 1.8 rmind
724 1.8 rmind /* Ready for receiving now */
725 1.8 rmind selnotify(&mq->mq_rsel, POLLIN | POLLRDNORM, 0);
726 1.1 rmind error:
727 1.1 rmind mutex_exit(&mq->mq_mtx);
728 1.7 ad fd_putfile((int)mqdes);
729 1.1 rmind
730 1.1 rmind if (error) {
731 1.1 rmind mqueue_freemsg(msg, size);
732 1.1 rmind } else if (notify) {
733 1.1 rmind /* Send the notify, if needed */
734 1.10 ad mutex_enter(proc_lock);
735 1.1 rmind kpsignal(notify, &ksi, NULL);
736 1.10 ad mutex_exit(proc_lock);
737 1.1 rmind }
738 1.1 rmind
739 1.1 rmind return error;
740 1.1 rmind }
741 1.1 rmind
742 1.1 rmind int
743 1.8 rmind sys_mq_send(struct lwp *l, const struct sys_mq_send_args *uap,
744 1.8 rmind register_t *retval)
745 1.1 rmind {
746 1.6 dsl /* {
747 1.1 rmind syscallarg(mqd_t) mqdes;
748 1.1 rmind syscallarg(const char *) msg_ptr;
749 1.1 rmind syscallarg(size_t) msg_len;
750 1.1 rmind syscallarg(unsigned) msg_prio;
751 1.6 dsl } */
752 1.1 rmind
753 1.1 rmind return mq_send1(l, SCARG(uap, mqdes), SCARG(uap, msg_ptr),
754 1.1 rmind SCARG(uap, msg_len), SCARG(uap, msg_prio), 0);
755 1.1 rmind }
756 1.1 rmind
757 1.1 rmind int
758 1.13 christos sys___mq_timedsend50(struct lwp *l, const struct sys___mq_timedsend50_args *uap,
759 1.8 rmind register_t *retval)
760 1.1 rmind {
761 1.6 dsl /* {
762 1.1 rmind syscallarg(mqd_t) mqdes;
763 1.1 rmind syscallarg(const char *) msg_ptr;
764 1.1 rmind syscallarg(size_t) msg_len;
765 1.1 rmind syscallarg(unsigned) msg_prio;
766 1.1 rmind syscallarg(const struct timespec *) abs_timeout;
767 1.6 dsl } */
768 1.1 rmind int t;
769 1.13 christos struct timespec ts;
770 1.13 christos int error;
771 1.1 rmind
772 1.1 rmind /* Get and convert time value */
773 1.1 rmind if (SCARG(uap, abs_timeout)) {
774 1.13 christos error = copyin(SCARG(uap, abs_timeout), &ts, sizeof(ts));
775 1.13 christos if (error)
776 1.13 christos return error;
777 1.13 christos error = abstimeout2timo(&ts, &t);
778 1.1 rmind if (error)
779 1.1 rmind return error;
780 1.1 rmind } else
781 1.1 rmind t = 0;
782 1.1 rmind
783 1.1 rmind return mq_send1(l, SCARG(uap, mqdes), SCARG(uap, msg_ptr),
784 1.1 rmind SCARG(uap, msg_len), SCARG(uap, msg_prio), t);
785 1.1 rmind }
786 1.1 rmind
787 1.1 rmind int
788 1.8 rmind sys_mq_notify(struct lwp *l, const struct sys_mq_notify_args *uap,
789 1.8 rmind register_t *retval)
790 1.1 rmind {
791 1.6 dsl /* {
792 1.1 rmind syscallarg(mqd_t) mqdes;
793 1.1 rmind syscallarg(const struct sigevent *) notification;
794 1.6 dsl } */
795 1.7 ad file_t *fp = NULL;
796 1.1 rmind struct mqueue *mq;
797 1.1 rmind struct sigevent sig;
798 1.1 rmind int error;
799 1.1 rmind
800 1.1 rmind if (SCARG(uap, notification)) {
801 1.1 rmind /* Get the signal from user-space */
802 1.1 rmind error = copyin(SCARG(uap, notification), &sig,
803 1.1 rmind sizeof(struct sigevent));
804 1.1 rmind if (error)
805 1.1 rmind return error;
806 1.1 rmind }
807 1.1 rmind
808 1.18 rmind error = mqueue_get(SCARG(uap, mqdes), &fp);
809 1.1 rmind if (error)
810 1.1 rmind return error;
811 1.1 rmind mq = fp->f_data;
812 1.1 rmind
813 1.1 rmind if (SCARG(uap, notification)) {
814 1.1 rmind /* Register notification: set the signal and target process */
815 1.1 rmind if (mq->mq_notify_proc == NULL) {
816 1.1 rmind memcpy(&mq->mq_sig_notify, &sig,
817 1.1 rmind sizeof(struct sigevent));
818 1.1 rmind mq->mq_notify_proc = l->l_proc;
819 1.1 rmind } else {
820 1.1 rmind /* Fail if someone else already registered */
821 1.1 rmind error = EBUSY;
822 1.1 rmind }
823 1.1 rmind } else {
824 1.1 rmind /* Unregister the notification */
825 1.1 rmind mq->mq_notify_proc = NULL;
826 1.1 rmind }
827 1.1 rmind mutex_exit(&mq->mq_mtx);
828 1.7 ad fd_putfile((int)SCARG(uap, mqdes));
829 1.1 rmind
830 1.1 rmind return error;
831 1.1 rmind }
832 1.1 rmind
833 1.1 rmind int
834 1.8 rmind sys_mq_getattr(struct lwp *l, const struct sys_mq_getattr_args *uap,
835 1.8 rmind register_t *retval)
836 1.1 rmind {
837 1.6 dsl /* {
838 1.1 rmind syscallarg(mqd_t) mqdes;
839 1.1 rmind syscallarg(struct mq_attr *) mqstat;
840 1.6 dsl } */
841 1.7 ad file_t *fp = NULL;
842 1.1 rmind struct mqueue *mq;
843 1.1 rmind struct mq_attr attr;
844 1.1 rmind int error;
845 1.1 rmind
846 1.1 rmind /* Get the message queue */
847 1.18 rmind error = mqueue_get(SCARG(uap, mqdes), &fp);
848 1.1 rmind if (error)
849 1.1 rmind return error;
850 1.1 rmind mq = fp->f_data;
851 1.1 rmind memcpy(&attr, &mq->mq_attrib, sizeof(struct mq_attr));
852 1.1 rmind mutex_exit(&mq->mq_mtx);
853 1.7 ad fd_putfile((int)SCARG(uap, mqdes));
854 1.1 rmind
855 1.1 rmind return copyout(&attr, SCARG(uap, mqstat), sizeof(struct mq_attr));
856 1.1 rmind }
857 1.1 rmind
858 1.1 rmind int
859 1.8 rmind sys_mq_setattr(struct lwp *l, const struct sys_mq_setattr_args *uap,
860 1.8 rmind register_t *retval)
861 1.1 rmind {
862 1.6 dsl /* {
863 1.1 rmind syscallarg(mqd_t) mqdes;
864 1.1 rmind syscallarg(const struct mq_attr *) mqstat;
865 1.1 rmind syscallarg(struct mq_attr *) omqstat;
866 1.6 dsl } */
867 1.7 ad file_t *fp = NULL;
868 1.1 rmind struct mqueue *mq;
869 1.1 rmind struct mq_attr attr;
870 1.1 rmind int error, nonblock;
871 1.1 rmind
872 1.1 rmind error = copyin(SCARG(uap, mqstat), &attr, sizeof(struct mq_attr));
873 1.1 rmind if (error)
874 1.1 rmind return error;
875 1.1 rmind nonblock = (attr.mq_flags & O_NONBLOCK);
876 1.1 rmind
877 1.1 rmind /* Get the message queue */
878 1.18 rmind error = mqueue_get(SCARG(uap, mqdes), &fp);
879 1.1 rmind if (error)
880 1.1 rmind return error;
881 1.1 rmind mq = fp->f_data;
882 1.1 rmind
883 1.1 rmind /* Copy the old attributes, if needed */
884 1.1 rmind if (SCARG(uap, omqstat))
885 1.1 rmind memcpy(&attr, &mq->mq_attrib, sizeof(struct mq_attr));
886 1.1 rmind
887 1.1 rmind /* Ignore everything, except O_NONBLOCK */
888 1.1 rmind if (nonblock)
889 1.1 rmind mq->mq_attrib.mq_flags |= O_NONBLOCK;
890 1.1 rmind else
891 1.1 rmind mq->mq_attrib.mq_flags &= ~O_NONBLOCK;
892 1.1 rmind
893 1.1 rmind mutex_exit(&mq->mq_mtx);
894 1.7 ad fd_putfile((int)SCARG(uap, mqdes));
895 1.1 rmind
896 1.1 rmind /*
897 1.1 rmind * Copy the data to the user-space.
898 1.1 rmind * Note: According to POSIX, the new attributes should not be set in
899 1.1 rmind * case of fail - this would be violated.
900 1.1 rmind */
901 1.1 rmind if (SCARG(uap, omqstat))
902 1.1 rmind error = copyout(&attr, SCARG(uap, omqstat),
903 1.1 rmind sizeof(struct mq_attr));
904 1.1 rmind
905 1.1 rmind return error;
906 1.1 rmind }
907 1.1 rmind
908 1.1 rmind int
909 1.8 rmind sys_mq_unlink(struct lwp *l, const struct sys_mq_unlink_args *uap,
910 1.8 rmind register_t *retval)
911 1.1 rmind {
912 1.6 dsl /* {
913 1.1 rmind syscallarg(const char *) name;
914 1.6 dsl } */
915 1.1 rmind struct mqueue *mq;
916 1.1 rmind char *name;
917 1.1 rmind int error, refcnt = 0;
918 1.1 rmind
919 1.1 rmind /* Get the name from the user-space */
920 1.1 rmind name = kmem_zalloc(MQ_NAMELEN, KM_SLEEP);
921 1.1 rmind error = copyinstr(SCARG(uap, name), name, MQ_NAMELEN - 1, NULL);
922 1.1 rmind if (error) {
923 1.1 rmind kmem_free(name, MQ_NAMELEN);
924 1.1 rmind return error;
925 1.1 rmind }
926 1.1 rmind
927 1.1 rmind /* Lookup for this file */
928 1.1 rmind mutex_enter(&mqlist_mtx);
929 1.1 rmind mq = mqueue_lookup(name);
930 1.1 rmind if (mq == NULL) {
931 1.1 rmind error = ENOENT;
932 1.1 rmind goto error;
933 1.1 rmind }
934 1.1 rmind
935 1.1 rmind /* Check the permissions */
936 1.18 rmind if (kauth_cred_geteuid(l->l_cred) != mq->mq_euid &&
937 1.18 rmind kauth_authorize_generic(l->l_cred, KAUTH_GENERIC_ISSUSER, NULL)) {
938 1.1 rmind mutex_exit(&mq->mq_mtx);
939 1.1 rmind error = EACCES;
940 1.1 rmind goto error;
941 1.1 rmind }
942 1.1 rmind
943 1.1 rmind /* Mark message queue as unlinking, before leaving the window */
944 1.1 rmind mq->mq_attrib.mq_flags |= MQ_UNLINK;
945 1.1 rmind
946 1.1 rmind /* Wake up all waiters, if there are such */
947 1.1 rmind cv_broadcast(&mq->mq_send_cv);
948 1.1 rmind cv_broadcast(&mq->mq_recv_cv);
949 1.1 rmind
950 1.8 rmind selnotify(&mq->mq_rsel, POLLHUP, 0);
951 1.8 rmind selnotify(&mq->mq_wsel, POLLHUP, 0);
952 1.8 rmind
953 1.1 rmind refcnt = mq->mq_refcnt;
954 1.1 rmind if (refcnt == 0)
955 1.1 rmind LIST_REMOVE(mq, mq_list);
956 1.1 rmind
957 1.1 rmind mutex_exit(&mq->mq_mtx);
958 1.1 rmind error:
959 1.1 rmind mutex_exit(&mqlist_mtx);
960 1.1 rmind
961 1.1 rmind /*
962 1.1 rmind * If there are no references - destroy the message
963 1.1 rmind * queue, otherwise, the last mq_close() will do that.
964 1.1 rmind */
965 1.1 rmind if (error == 0 && refcnt == 0)
966 1.1 rmind mqueue_destroy(mq);
967 1.1 rmind
968 1.1 rmind kmem_free(name, MQ_NAMELEN);
969 1.1 rmind return error;
970 1.1 rmind }
971 1.1 rmind
972 1.1 rmind /*
973 1.1 rmind * SysCtl.
974 1.1 rmind */
975 1.1 rmind
976 1.1 rmind SYSCTL_SETUP(sysctl_mqueue_setup, "sysctl mqueue setup")
977 1.1 rmind {
978 1.1 rmind const struct sysctlnode *node = NULL;
979 1.1 rmind
980 1.1 rmind sysctl_createv(clog, 0, NULL, NULL,
981 1.1 rmind CTLFLAG_PERMANENT,
982 1.1 rmind CTLTYPE_NODE, "kern", NULL,
983 1.1 rmind NULL, 0, NULL, 0,
984 1.1 rmind CTL_KERN, CTL_EOL);
985 1.1 rmind sysctl_createv(clog, 0, NULL, NULL,
986 1.1 rmind CTLFLAG_PERMANENT|CTLFLAG_IMMEDIATE,
987 1.1 rmind CTLTYPE_INT, "posix_msg",
988 1.1 rmind SYSCTL_DESCR("Version of IEEE Std 1003.1 and its "
989 1.1 rmind "Message Passing option to which the "
990 1.1 rmind "system attempts to conform"),
991 1.1 rmind NULL, _POSIX_MESSAGE_PASSING, NULL, 0,
992 1.1 rmind CTL_KERN, CTL_CREATE, CTL_EOL);
993 1.1 rmind sysctl_createv(clog, 0, NULL, &node,
994 1.1 rmind CTLFLAG_PERMANENT,
995 1.1 rmind CTLTYPE_NODE, "mqueue",
996 1.1 rmind SYSCTL_DESCR("Message queue options"),
997 1.1 rmind NULL, 0, NULL, 0,
998 1.1 rmind CTL_KERN, CTL_CREATE, CTL_EOL);
999 1.1 rmind
1000 1.1 rmind if (node == NULL)
1001 1.1 rmind return;
1002 1.1 rmind
1003 1.1 rmind sysctl_createv(clog, 0, &node, NULL,
1004 1.1 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1005 1.1 rmind CTLTYPE_INT, "mq_open_max",
1006 1.1 rmind SYSCTL_DESCR("Maximal number of message queue descriptors "
1007 1.1 rmind "that process could open"),
1008 1.1 rmind NULL, 0, &mq_open_max, 0,
1009 1.1 rmind CTL_CREATE, CTL_EOL);
1010 1.1 rmind sysctl_createv(clog, 0, &node, NULL,
1011 1.1 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1012 1.1 rmind CTLTYPE_INT, "mq_prio_max",
1013 1.1 rmind SYSCTL_DESCR("Maximal priority of the message"),
1014 1.1 rmind NULL, 0, &mq_prio_max, 0,
1015 1.1 rmind CTL_CREATE, CTL_EOL);
1016 1.1 rmind sysctl_createv(clog, 0, &node, NULL,
1017 1.1 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1018 1.1 rmind CTLTYPE_INT, "mq_max_msgsize",
1019 1.1 rmind SYSCTL_DESCR("Maximal allowed size of the message"),
1020 1.1 rmind NULL, 0, &mq_max_msgsize, 0,
1021 1.1 rmind CTL_CREATE, CTL_EOL);
1022 1.1 rmind sysctl_createv(clog, 0, &node, NULL,
1023 1.1 rmind CTLFLAG_PERMANENT | CTLFLAG_READWRITE,
1024 1.1 rmind CTLTYPE_INT, "mq_def_maxmsg",
1025 1.1 rmind SYSCTL_DESCR("Default maximal message count"),
1026 1.1 rmind NULL, 0, &mq_def_maxmsg, 0,
1027 1.1 rmind CTL_CREATE, CTL_EOL);
1028 1.1 rmind }
1029 1.1 rmind
1030 1.1 rmind /*
1031 1.1 rmind * Debugging.
1032 1.1 rmind */
1033 1.1 rmind #if defined(DDB)
1034 1.1 rmind
1035 1.1 rmind void
1036 1.1 rmind mqueue_print_list(void (*pr)(const char *, ...))
1037 1.1 rmind {
1038 1.1 rmind struct mqueue *mq;
1039 1.1 rmind
1040 1.1 rmind (*pr)("Global list of the message queues:\n");
1041 1.1 rmind (*pr)("%20s %10s %8s %8s %3s %4s %4s %4s\n",
1042 1.1 rmind "Name", "Ptr", "Mode", "Flags", "Ref",
1043 1.1 rmind "MaxMsg", "MsgSze", "CurMsg");
1044 1.1 rmind LIST_FOREACH(mq, &mqueue_head, mq_list) {
1045 1.1 rmind (*pr)("%20s %10p %8x %8x %3u %6lu %6lu %6lu\n",
1046 1.1 rmind mq->mq_name, mq, mq->mq_mode,
1047 1.1 rmind mq->mq_attrib.mq_flags, mq->mq_refcnt,
1048 1.1 rmind mq->mq_attrib.mq_maxmsg, mq->mq_attrib.mq_msgsize,
1049 1.1 rmind mq->mq_attrib.mq_curmsgs);
1050 1.1 rmind }
1051 1.1 rmind }
1052 1.1 rmind
1053 1.1 rmind #endif /* defined(DDB) */
1054