2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2005 David Xu <davidxu@freebsd.org>
5 * Copyright (c) 2016-2017 Robert N. M. Watson
8 * Portions of this software were developed by BAE Systems, the University of
9 * Cambridge Computer Laboratory, and Memorial University under DARPA/AFRL
10 * contract FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent
11 * Computing (TC) research program.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * POSIX message queue implementation.
39 * 1) A mqueue filesystem can be mounted, each message queue appears
40 * in mounted directory, user can change queue's permission and
41 * ownership, or remove a queue. Manually creating a file in the
42 * directory causes a message queue to be created in the kernel with
43 * default message queue attributes applied and same name used, this
44 * method is not advocated since mq_open syscall allows user to specify
45 * different attributes. Also the file system can be mounted multiple
46 * times at different mount points but shows same contents.
48 * 2) Standard POSIX message queue API. The syscalls do not use vfs layer,
49 * but directly operate on internal data structure, this allows user to
50 * use the IPC facility without having to mount mqueue file system.
53 #include <sys/cdefs.h>
54 __FBSDID("$FreeBSD$");
56 #include "opt_capsicum.h"
57 #include "opt_compat.h"
59 #include <sys/param.h>
60 #include <sys/kernel.h>
61 #include <sys/systm.h>
62 #include <sys/limits.h>
63 #include <sys/malloc.h>
65 #include <sys/capsicum.h>
66 #include <sys/dirent.h>
67 #include <sys/event.h>
68 #include <sys/eventhandler.h>
69 #include <sys/fcntl.h>
71 #include <sys/filedesc.h>
74 #include <sys/module.h>
75 #include <sys/mount.h>
76 #include <sys/mqueue.h>
77 #include <sys/mutex.h>
78 #include <sys/namei.h>
79 #include <sys/posix4.h>
83 #include <sys/queue.h>
84 #include <sys/sysproto.h>
86 #include <sys/syscall.h>
87 #include <sys/syscallsubr.h>
88 #include <sys/sysent.h>
90 #include <sys/sysctl.h>
91 #include <sys/taskqueue.h>
92 #include <sys/unistd.h>
94 #include <sys/vnode.h>
95 #include <machine/atomic.h>
97 #include <security/audit/audit.h>
99 FEATURE(p1003_1b_mqueue, "POSIX P1003.1B message queues support");
102 * Limits and constants
104 #define MQFS_NAMELEN NAME_MAX
105 #define MQFS_DELEN (8 + MQFS_NAMELEN)
121 * mqfs_info: describes a mqfs instance
125 struct mqfs_node *mi_root;
126 struct unrhdr *mi_unrhdr;
130 LIST_ENTRY(mqfs_vdata) mv_link;
131 struct mqfs_node *mv_node;
132 struct vnode *mv_vnode;
137 * mqfs_node: describes a node (file or directory) within a mqfs
140 char mn_name[MQFS_NAMELEN+1];
141 struct mqfs_info *mn_info;
142 struct mqfs_node *mn_parent;
143 LIST_HEAD(,mqfs_node) mn_children;
144 LIST_ENTRY(mqfs_node) mn_sibling;
145 LIST_HEAD(,mqfs_vdata) mn_vnodes;
146 const void *mn_pr_root;
152 struct timespec mn_birth;
153 struct timespec mn_ctime;
154 struct timespec mn_atime;
155 struct timespec mn_mtime;
161 #define VTON(vp) (((struct mqfs_vdata *)((vp)->v_data))->mv_node)
162 #define VTOMQ(vp) ((struct mqueue *)(VTON(vp)->mn_data))
163 #define VFSTOMQFS(m) ((struct mqfs_info *)((m)->mnt_data))
164 #define FPTOMQ(fp) ((struct mqueue *)(((struct mqfs_node *) \
165 (fp)->f_data)->mn_data))
167 TAILQ_HEAD(msgq, mqueue_msg);
171 struct mqueue_notifier {
172 LIST_ENTRY(mqueue_notifier) nt_link;
173 struct sigevent nt_sigev;
175 struct proc *nt_proc;
188 struct selinfo mq_rsel;
189 struct selinfo mq_wsel;
190 struct mqueue_notifier *mq_notifier;
197 TAILQ_ENTRY(mqueue_msg) msg_link;
198 unsigned int msg_prio;
199 unsigned int msg_size;
200 /* following real data... */
203 static SYSCTL_NODE(_kern, OID_AUTO, mqueue, CTLFLAG_RW, 0,
204 "POSIX real time message queue");
206 static int default_maxmsg = 10;
207 static int default_msgsize = 1024;
209 static int maxmsg = 100;
210 SYSCTL_INT(_kern_mqueue, OID_AUTO, maxmsg, CTLFLAG_RW,
211 &maxmsg, 0, "Default maximum messages in queue");
212 static int maxmsgsize = 16384;
213 SYSCTL_INT(_kern_mqueue, OID_AUTO, maxmsgsize, CTLFLAG_RW,
214 &maxmsgsize, 0, "Default maximum message size");
215 static int maxmq = 100;
216 SYSCTL_INT(_kern_mqueue, OID_AUTO, maxmq, CTLFLAG_RW,
217 &maxmq, 0, "maximum message queues");
218 static int curmq = 0;
219 SYSCTL_INT(_kern_mqueue, OID_AUTO, curmq, CTLFLAG_RW,
220 &curmq, 0, "current message queue number");
221 static int unloadable = 0;
222 static MALLOC_DEFINE(M_MQUEUEDATA, "mqdata", "mqueue data");
224 static eventhandler_tag exit_tag;
226 /* Only one instance per-system */
227 static struct mqfs_info mqfs_data;
228 static uma_zone_t mqnode_zone;
229 static uma_zone_t mqueue_zone;
230 static uma_zone_t mvdata_zone;
231 static uma_zone_t mqnoti_zone;
232 static struct vop_vector mqfs_vnodeops;
233 static struct fileops mqueueops;
234 static unsigned mqfs_osd_jail_slot;
237 * Directory structure construction and manipulation
240 static struct mqfs_node *mqfs_create_dir(struct mqfs_node *parent,
241 const char *name, int namelen, struct ucred *cred, int mode);
242 static struct mqfs_node *mqfs_create_link(struct mqfs_node *parent,
243 const char *name, int namelen, struct ucred *cred, int mode);
246 static struct mqfs_node *mqfs_create_file(struct mqfs_node *parent,
247 const char *name, int namelen, struct ucred *cred, int mode);
248 static int mqfs_destroy(struct mqfs_node *mn);
249 static void mqfs_fileno_alloc(struct mqfs_info *mi, struct mqfs_node *mn);
250 static void mqfs_fileno_free(struct mqfs_info *mi, struct mqfs_node *mn);
251 static int mqfs_allocv(struct mount *mp, struct vnode **vpp, struct mqfs_node *pn);
252 static int mqfs_prison_remove(void *obj, void *data);
255 * Message queue construction and maniplation
257 static struct mqueue *mqueue_alloc(const struct mq_attr *attr);
258 static void mqueue_free(struct mqueue *mq);
259 static int mqueue_send(struct mqueue *mq, const char *msg_ptr,
260 size_t msg_len, unsigned msg_prio, int waitok,
261 const struct timespec *abs_timeout);
262 static int mqueue_receive(struct mqueue *mq, char *msg_ptr,
263 size_t msg_len, unsigned *msg_prio, int waitok,
264 const struct timespec *abs_timeout);
265 static int _mqueue_send(struct mqueue *mq, struct mqueue_msg *msg,
267 static int _mqueue_recv(struct mqueue *mq, struct mqueue_msg **msg,
269 static void mqueue_send_notification(struct mqueue *mq);
270 static void mqueue_fdclose(struct thread *td, int fd, struct file *fp);
271 static void mq_proc_exit(void *arg, struct proc *p);
276 static void filt_mqdetach(struct knote *kn);
277 static int filt_mqread(struct knote *kn, long hint);
278 static int filt_mqwrite(struct knote *kn, long hint);
280 struct filterops mq_rfiltops = {
282 .f_detach = filt_mqdetach,
283 .f_event = filt_mqread,
285 struct filterops mq_wfiltops = {
287 .f_detach = filt_mqdetach,
288 .f_event = filt_mqwrite,
292 * Initialize fileno bitmap
295 mqfs_fileno_init(struct mqfs_info *mi)
299 up = new_unrhdr(1, INT_MAX, NULL);
304 * Tear down fileno bitmap
307 mqfs_fileno_uninit(struct mqfs_info *mi)
312 mi->mi_unrhdr = NULL;
317 * Allocate a file number
320 mqfs_fileno_alloc(struct mqfs_info *mi, struct mqfs_node *mn)
322 /* make sure our parent has a file number */
323 if (mn->mn_parent && !mn->mn_parent->mn_fileno)
324 mqfs_fileno_alloc(mi, mn->mn_parent);
326 switch (mn->mn_type) {
330 case mqfstype_symlink:
331 mn->mn_fileno = alloc_unr(mi->mi_unrhdr);
334 KASSERT(mn->mn_parent != NULL,
335 ("mqfstype_this node has no parent"));
336 mn->mn_fileno = mn->mn_parent->mn_fileno;
338 case mqfstype_parent:
339 KASSERT(mn->mn_parent != NULL,
340 ("mqfstype_parent node has no parent"));
341 if (mn->mn_parent == mi->mi_root) {
342 mn->mn_fileno = mn->mn_parent->mn_fileno;
345 KASSERT(mn->mn_parent->mn_parent != NULL,
346 ("mqfstype_parent node has no grandparent"));
347 mn->mn_fileno = mn->mn_parent->mn_parent->mn_fileno;
351 ("mqfs_fileno_alloc() called for unknown type node: %d",
358 * Release a file number
361 mqfs_fileno_free(struct mqfs_info *mi, struct mqfs_node *mn)
363 switch (mn->mn_type) {
367 case mqfstype_symlink:
368 free_unr(mi->mi_unrhdr, mn->mn_fileno);
371 case mqfstype_parent:
372 /* ignore these, as they don't "own" their file number */
376 ("mqfs_fileno_free() called for unknown type node: %d",
382 static __inline struct mqfs_node *
385 return uma_zalloc(mqnode_zone, M_WAITOK | M_ZERO);
389 mqnode_free(struct mqfs_node *node)
391 uma_zfree(mqnode_zone, node);
395 mqnode_addref(struct mqfs_node *node)
397 atomic_fetchadd_int(&node->mn_refcount, 1);
401 mqnode_release(struct mqfs_node *node)
403 struct mqfs_info *mqfs;
406 mqfs = node->mn_info;
407 old = atomic_fetchadd_int(&node->mn_refcount, -1);
408 if (node->mn_type == mqfstype_dir ||
409 node->mn_type == mqfstype_root)
410 exp = 3; /* include . and .. */
414 int locked = sx_xlocked(&mqfs->mi_lock);
416 sx_xlock(&mqfs->mi_lock);
419 sx_xunlock(&mqfs->mi_lock);
424 * Add a node to a directory
427 mqfs_add_node(struct mqfs_node *parent, struct mqfs_node *node)
429 KASSERT(parent != NULL, ("%s(): parent is NULL", __func__));
430 KASSERT(parent->mn_info != NULL,
431 ("%s(): parent has no mn_info", __func__));
432 KASSERT(parent->mn_type == mqfstype_dir ||
433 parent->mn_type == mqfstype_root,
434 ("%s(): parent is not a directory", __func__));
436 node->mn_info = parent->mn_info;
437 node->mn_parent = parent;
438 LIST_INIT(&node->mn_children);
439 LIST_INIT(&node->mn_vnodes);
440 LIST_INSERT_HEAD(&parent->mn_children, node, mn_sibling);
441 mqnode_addref(parent);
445 static struct mqfs_node *
446 mqfs_create_node(const char *name, int namelen, struct ucred *cred, int mode,
449 struct mqfs_node *node;
451 node = mqnode_alloc();
452 strncpy(node->mn_name, name, namelen);
453 node->mn_pr_root = cred->cr_prison->pr_root;
454 node->mn_type = nodetype;
455 node->mn_refcount = 1;
456 vfs_timestamp(&node->mn_birth);
457 node->mn_ctime = node->mn_atime = node->mn_mtime
459 node->mn_uid = cred->cr_uid;
460 node->mn_gid = cred->cr_gid;
461 node->mn_mode = mode;
468 static struct mqfs_node *
469 mqfs_create_file(struct mqfs_node *parent, const char *name, int namelen,
470 struct ucred *cred, int mode)
472 struct mqfs_node *node;
474 node = mqfs_create_node(name, namelen, cred, mode, mqfstype_file);
475 if (mqfs_add_node(parent, node) != 0) {
483 * Add . and .. to a directory
486 mqfs_fixup_dir(struct mqfs_node *parent)
488 struct mqfs_node *dir;
490 dir = mqnode_alloc();
491 dir->mn_name[0] = '.';
492 dir->mn_type = mqfstype_this;
493 dir->mn_refcount = 1;
494 if (mqfs_add_node(parent, dir) != 0) {
499 dir = mqnode_alloc();
500 dir->mn_name[0] = dir->mn_name[1] = '.';
501 dir->mn_type = mqfstype_parent;
502 dir->mn_refcount = 1;
504 if (mqfs_add_node(parent, dir) != 0) {
517 static struct mqfs_node *
518 mqfs_create_dir(struct mqfs_node *parent, const char *name, int namelen,
519 struct ucred *cred, int mode)
521 struct mqfs_node *node;
523 node = mqfs_create_node(name, namelen, cred, mode, mqfstype_dir);
524 if (mqfs_add_node(parent, node) != 0) {
529 if (mqfs_fixup_dir(node) != 0) {
539 static struct mqfs_node *
540 mqfs_create_link(struct mqfs_node *parent, const char *name, int namelen,
541 struct ucred *cred, int mode)
543 struct mqfs_node *node;
545 node = mqfs_create_node(name, namelen, cred, mode, mqfstype_symlink);
546 if (mqfs_add_node(parent, node) != 0) {
556 * Destroy a node or a tree of nodes
559 mqfs_destroy(struct mqfs_node *node)
561 struct mqfs_node *parent;
563 KASSERT(node != NULL,
564 ("%s(): node is NULL", __func__));
565 KASSERT(node->mn_info != NULL,
566 ("%s(): node has no mn_info", __func__));
568 /* destroy children */
569 if (node->mn_type == mqfstype_dir || node->mn_type == mqfstype_root)
570 while (! LIST_EMPTY(&node->mn_children))
571 mqfs_destroy(LIST_FIRST(&node->mn_children));
573 /* unlink from parent */
574 if ((parent = node->mn_parent) != NULL) {
575 KASSERT(parent->mn_info == node->mn_info,
576 ("%s(): parent has different mn_info", __func__));
577 LIST_REMOVE(node, mn_sibling);
580 if (node->mn_fileno != 0)
581 mqfs_fileno_free(node->mn_info, node);
582 if (node->mn_data != NULL)
583 mqueue_free(node->mn_data);
589 * Mount a mqfs instance
592 mqfs_mount(struct mount *mp)
596 if (mp->mnt_flag & MNT_UPDATE)
599 mp->mnt_data = &mqfs_data;
601 mp->mnt_flag |= MNT_LOCAL;
606 vfs_mountedfrom(mp, "mqueue");
607 sbp->f_bsize = PAGE_SIZE;
608 sbp->f_iosize = PAGE_SIZE;
618 * Unmount a mqfs instance
621 mqfs_unmount(struct mount *mp, int mntflags)
625 error = vflush(mp, 0, (mntflags & MNT_FORCE) ? FORCECLOSE : 0,
631 * Return a root vnode
634 mqfs_root(struct mount *mp, int flags, struct vnode **vpp)
636 struct mqfs_info *mqfs;
639 mqfs = VFSTOMQFS(mp);
640 ret = mqfs_allocv(mp, vpp, mqfs->mi_root);
645 * Return filesystem stats
648 mqfs_statfs(struct mount *mp, struct statfs *sbp)
650 /* XXX update statistics */
655 * Initialize a mqfs instance
658 mqfs_init(struct vfsconf *vfc)
660 struct mqfs_node *root;
661 struct mqfs_info *mi;
662 osd_method_t methods[PR_MAXMETHOD] = {
663 [PR_METHOD_REMOVE] = mqfs_prison_remove,
666 mqnode_zone = uma_zcreate("mqnode", sizeof(struct mqfs_node),
667 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
668 mqueue_zone = uma_zcreate("mqueue", sizeof(struct mqueue),
669 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
670 mvdata_zone = uma_zcreate("mvdata",
671 sizeof(struct mqfs_vdata), NULL, NULL, NULL,
672 NULL, UMA_ALIGN_PTR, 0);
673 mqnoti_zone = uma_zcreate("mqnotifier", sizeof(struct mqueue_notifier),
674 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
676 sx_init(&mi->mi_lock, "mqfs lock");
677 /* set up the root diretory */
678 root = mqfs_create_node("/", 1, curthread->td_ucred, 01777,
681 LIST_INIT(&root->mn_children);
682 LIST_INIT(&root->mn_vnodes);
684 mqfs_fileno_init(mi);
685 mqfs_fileno_alloc(mi, root);
686 mqfs_fixup_dir(root);
687 exit_tag = EVENTHANDLER_REGISTER(process_exit, mq_proc_exit, NULL,
688 EVENTHANDLER_PRI_ANY);
689 mq_fdclose = mqueue_fdclose;
690 p31b_setcfg(CTL_P1003_1B_MESSAGE_PASSING, _POSIX_MESSAGE_PASSING);
691 mqfs_osd_jail_slot = osd_jail_register(NULL, methods);
696 * Destroy a mqfs instance
699 mqfs_uninit(struct vfsconf *vfc)
701 struct mqfs_info *mi;
705 osd_jail_deregister(mqfs_osd_jail_slot);
706 EVENTHANDLER_DEREGISTER(process_exit, exit_tag);
708 mqfs_destroy(mi->mi_root);
710 mqfs_fileno_uninit(mi);
711 sx_destroy(&mi->mi_lock);
712 uma_zdestroy(mqnode_zone);
713 uma_zdestroy(mqueue_zone);
714 uma_zdestroy(mvdata_zone);
715 uma_zdestroy(mqnoti_zone);
723 do_recycle(void *context, int pending __unused)
725 struct vnode *vp = (struct vnode *)context;
727 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
737 mqfs_allocv(struct mount *mp, struct vnode **vpp, struct mqfs_node *pn)
739 struct mqfs_vdata *vd;
740 struct mqfs_info *mqfs;
741 struct vnode *newvpp;
746 sx_xlock(&mqfs->mi_lock);
747 LIST_FOREACH(vd, &pn->mn_vnodes, mv_link) {
748 if (vd->mv_vnode->v_mount == mp) {
757 sx_xunlock(&mqfs->mi_lock);
758 error = vget(*vpp, LK_RETRY | LK_EXCLUSIVE, curthread);
762 sx_xunlock(&mqfs->mi_lock);
764 error = getnewvnode("mqueue", mp, &mqfs_vnodeops, &newvpp);
767 vn_lock(newvpp, LK_EXCLUSIVE | LK_RETRY);
768 error = insmntque(newvpp, mp);
772 sx_xlock(&mqfs->mi_lock);
774 * Check if it has already been allocated
775 * while we were blocked.
777 LIST_FOREACH(vd, &pn->mn_vnodes, mv_link) {
778 if (vd->mv_vnode->v_mount == mp) {
780 sx_xunlock(&mqfs->mi_lock);
790 vd = uma_zalloc(mvdata_zone, M_WAITOK);
794 TASK_INIT(&vd->mv_task, 0, do_recycle, *vpp);
795 LIST_INSERT_HEAD(&pn->mn_vnodes, vd, mv_link);
797 switch (pn->mn_type) {
799 (*vpp)->v_vflag = VV_ROOT;
803 case mqfstype_parent:
804 (*vpp)->v_type = VDIR;
807 (*vpp)->v_type = VREG;
809 case mqfstype_symlink:
810 (*vpp)->v_type = VLNK;
813 KASSERT(0, ("mqfs_allocf called for null node\n"));
815 panic("%s has unexpected type: %d", pn->mn_name, pn->mn_type);
817 sx_xunlock(&mqfs->mi_lock);
822 * Search a directory entry
824 static struct mqfs_node *
825 mqfs_search(struct mqfs_node *pd, const char *name, int len, struct ucred *cred)
827 struct mqfs_node *pn;
830 sx_assert(&pd->mn_info->mi_lock, SX_LOCKED);
831 pr_root = cred->cr_prison->pr_root;
832 LIST_FOREACH(pn, &pd->mn_children, mn_sibling) {
833 /* Only match names within the same prison root directory */
834 if ((pn->mn_pr_root == NULL || pn->mn_pr_root == pr_root) &&
835 strncmp(pn->mn_name, name, len) == 0 &&
836 pn->mn_name[len] == '\0')
843 * Look up a file or directory.
846 mqfs_lookupx(struct vop_cachedlookup_args *ap)
848 struct componentname *cnp;
849 struct vnode *dvp, **vpp;
850 struct mqfs_node *pd;
851 struct mqfs_node *pn;
852 struct mqfs_info *mqfs;
853 int nameiop, flags, error, namelen;
860 pname = cnp->cn_nameptr;
861 namelen = cnp->cn_namelen;
863 flags = cnp->cn_flags;
864 nameiop = cnp->cn_nameiop;
870 if (dvp->v_type != VDIR)
873 error = VOP_ACCESS(dvp, VEXEC, cnp->cn_cred, cnp->cn_thread);
877 /* shortcut: check if the name is too long */
878 if (cnp->cn_namelen >= MQFS_NAMELEN)
882 if (namelen == 1 && pname[0] == '.') {
883 if ((flags & ISLASTCN) && nameiop != LOOKUP)
892 if (cnp->cn_flags & ISDOTDOT) {
893 if (dvp->v_vflag & VV_ROOT)
895 if ((flags & ISLASTCN) && nameiop != LOOKUP)
898 KASSERT(pd->mn_parent, ("non-root directory has no parent"));
900 error = mqfs_allocv(dvp->v_mount, vpp, pn);
901 vn_lock(dvp, LK_EXCLUSIVE | LK_RETRY);
906 sx_xlock(&mqfs->mi_lock);
907 pn = mqfs_search(pd, pname, namelen, cnp->cn_cred);
910 sx_xunlock(&mqfs->mi_lock);
915 if (nameiop == DELETE && (flags & ISLASTCN)) {
916 error = VOP_ACCESS(dvp, VWRITE, cnp->cn_cred, td);
930 error = mqfs_allocv(dvp->v_mount, vpp, pn);
932 if (error == 0 && cnp->cn_flags & MAKEENTRY)
933 cache_enter(dvp, *vpp, cnp);
939 /* will create a new entry in the directory ? */
940 if ((nameiop == CREATE || nameiop == RENAME) && (flags & LOCKPARENT)
941 && (flags & ISLASTCN)) {
942 error = VOP_ACCESS(dvp, VWRITE, cnp->cn_cred, td);
945 cnp->cn_flags |= SAVENAME;
946 return (EJUSTRETURN);
952 struct vop_lookup_args {
953 struct vop_generic_args a_gen;
955 struct vnode **a_vpp;
956 struct componentname *a_cnp;
961 * vnode lookup operation
964 mqfs_lookup(struct vop_cachedlookup_args *ap)
968 rc = mqfs_lookupx(ap);
973 struct vop_create_args {
975 struct vnode **a_vpp;
976 struct componentname *a_cnp;
982 * vnode creation operation
985 mqfs_create(struct vop_create_args *ap)
987 struct mqfs_info *mqfs = VFSTOMQFS(ap->a_dvp->v_mount);
988 struct componentname *cnp = ap->a_cnp;
989 struct mqfs_node *pd;
990 struct mqfs_node *pn;
994 pd = VTON(ap->a_dvp);
995 if (pd->mn_type != mqfstype_root && pd->mn_type != mqfstype_dir)
997 mq = mqueue_alloc(NULL);
1000 sx_xlock(&mqfs->mi_lock);
1001 if ((cnp->cn_flags & HASBUF) == 0)
1002 panic("%s: no name", __func__);
1003 pn = mqfs_create_file(pd, cnp->cn_nameptr, cnp->cn_namelen,
1004 cnp->cn_cred, ap->a_vap->va_mode);
1006 sx_xunlock(&mqfs->mi_lock);
1010 sx_xunlock(&mqfs->mi_lock);
1011 error = mqfs_allocv(ap->a_dvp->v_mount, ap->a_vpp, pn);
1027 int do_unlink(struct mqfs_node *pn, struct ucred *ucred)
1029 struct mqfs_node *parent;
1030 struct mqfs_vdata *vd;
1033 sx_assert(&pn->mn_info->mi_lock, SX_LOCKED);
1035 if (ucred->cr_uid != pn->mn_uid &&
1036 (error = priv_check_cred(ucred, PRIV_MQ_ADMIN, 0)) != 0)
1038 else if (!pn->mn_deleted) {
1039 parent = pn->mn_parent;
1040 pn->mn_parent = NULL;
1042 LIST_REMOVE(pn, mn_sibling);
1043 LIST_FOREACH(vd, &pn->mn_vnodes, mv_link) {
1044 cache_purge(vd->mv_vnode);
1045 vhold(vd->mv_vnode);
1046 taskqueue_enqueue(taskqueue_thread, &vd->mv_task);
1049 mqnode_release(parent);
1056 struct vop_remove_args {
1057 struct vnode *a_dvp;
1059 struct componentname *a_cnp;
1064 * vnode removal operation
1067 mqfs_remove(struct vop_remove_args *ap)
1069 struct mqfs_info *mqfs = VFSTOMQFS(ap->a_dvp->v_mount);
1070 struct mqfs_node *pn;
1073 if (ap->a_vp->v_type == VDIR)
1075 pn = VTON(ap->a_vp);
1076 sx_xlock(&mqfs->mi_lock);
1077 error = do_unlink(pn, ap->a_cnp->cn_cred);
1078 sx_xunlock(&mqfs->mi_lock);
1083 struct vop_inactive_args {
1085 struct thread *a_td;
1090 mqfs_inactive(struct vop_inactive_args *ap)
1092 struct mqfs_node *pn = VTON(ap->a_vp);
1100 struct vop_reclaim_args {
1101 struct vop_generic_args a_gen;
1103 struct thread *a_td;
1108 mqfs_reclaim(struct vop_reclaim_args *ap)
1110 struct mqfs_info *mqfs = VFSTOMQFS(ap->a_vp->v_mount);
1111 struct vnode *vp = ap->a_vp;
1112 struct mqfs_node *pn;
1113 struct mqfs_vdata *vd;
1117 sx_xlock(&mqfs->mi_lock);
1119 LIST_REMOVE(vd, mv_link);
1120 uma_zfree(mvdata_zone, vd);
1122 sx_xunlock(&mqfs->mi_lock);
1127 struct vop_open_args {
1128 struct vop_generic_args a_gen;
1131 struct ucred *a_cred;
1132 struct thread *a_td;
1138 mqfs_open(struct vop_open_args *ap)
1144 struct vop_close_args {
1145 struct vop_generic_args a_gen;
1148 struct ucred *a_cred;
1149 struct thread *a_td;
1154 mqfs_close(struct vop_close_args *ap)
1160 struct vop_access_args {
1161 struct vop_generic_args a_gen;
1163 accmode_t a_accmode;
1164 struct ucred *a_cred;
1165 struct thread *a_td;
1170 * Verify permissions
1173 mqfs_access(struct vop_access_args *ap)
1175 struct vnode *vp = ap->a_vp;
1179 error = VOP_GETATTR(vp, &vattr, ap->a_cred);
1182 error = vaccess(vp->v_type, vattr.va_mode, vattr.va_uid,
1183 vattr.va_gid, ap->a_accmode, ap->a_cred, NULL);
1188 struct vop_getattr_args {
1189 struct vop_generic_args a_gen;
1191 struct vattr *a_vap;
1192 struct ucred *a_cred;
1197 * Get file attributes
1200 mqfs_getattr(struct vop_getattr_args *ap)
1202 struct vnode *vp = ap->a_vp;
1203 struct mqfs_node *pn = VTON(vp);
1204 struct vattr *vap = ap->a_vap;
1207 vap->va_type = vp->v_type;
1208 vap->va_mode = pn->mn_mode;
1210 vap->va_uid = pn->mn_uid;
1211 vap->va_gid = pn->mn_gid;
1212 vap->va_fsid = vp->v_mount->mnt_stat.f_fsid.val[0];
1213 vap->va_fileid = pn->mn_fileno;
1215 vap->va_blocksize = PAGE_SIZE;
1216 vap->va_bytes = vap->va_size = 0;
1217 vap->va_atime = pn->mn_atime;
1218 vap->va_mtime = pn->mn_mtime;
1219 vap->va_ctime = pn->mn_ctime;
1220 vap->va_birthtime = pn->mn_birth;
1223 vap->va_rdev = NODEV;
1225 vap->va_filerev = 0;
1230 struct vop_setattr_args {
1231 struct vop_generic_args a_gen;
1233 struct vattr *a_vap;
1234 struct ucred *a_cred;
1241 mqfs_setattr(struct vop_setattr_args *ap)
1243 struct mqfs_node *pn;
1254 if ((vap->va_type != VNON) ||
1255 (vap->va_nlink != VNOVAL) ||
1256 (vap->va_fsid != VNOVAL) ||
1257 (vap->va_fileid != VNOVAL) ||
1258 (vap->va_blocksize != VNOVAL) ||
1259 (vap->va_flags != VNOVAL && vap->va_flags != 0) ||
1260 (vap->va_rdev != VNOVAL) ||
1261 ((int)vap->va_bytes != VNOVAL) ||
1262 (vap->va_gen != VNOVAL)) {
1269 if (vap->va_uid == (uid_t)VNOVAL)
1273 if (vap->va_gid == (gid_t)VNOVAL)
1278 if (uid != pn->mn_uid || gid != pn->mn_gid) {
1280 * To modify the ownership of a file, must possess VADMIN
1283 if ((error = VOP_ACCESS(vp, VADMIN, ap->a_cred, td)))
1287 * XXXRW: Why is there a privilege check here: shouldn't the
1288 * check in VOP_ACCESS() be enough? Also, are the group bits
1289 * below definitely right?
1291 if (((ap->a_cred->cr_uid != pn->mn_uid) || uid != pn->mn_uid ||
1292 (gid != pn->mn_gid && !groupmember(gid, ap->a_cred))) &&
1293 (error = priv_check(td, PRIV_MQ_ADMIN)) != 0)
1300 if (vap->va_mode != (mode_t)VNOVAL) {
1301 if ((ap->a_cred->cr_uid != pn->mn_uid) &&
1302 (error = priv_check(td, PRIV_MQ_ADMIN)))
1304 pn->mn_mode = vap->va_mode;
1308 if (vap->va_atime.tv_sec != VNOVAL || vap->va_mtime.tv_sec != VNOVAL) {
1309 /* See the comment in ufs_vnops::ufs_setattr(). */
1310 if ((error = VOP_ACCESS(vp, VADMIN, ap->a_cred, td)) &&
1311 ((vap->va_vaflags & VA_UTIMES_NULL) == 0 ||
1312 (error = VOP_ACCESS(vp, VWRITE, ap->a_cred, td))))
1314 if (vap->va_atime.tv_sec != VNOVAL) {
1315 pn->mn_atime = vap->va_atime;
1317 if (vap->va_mtime.tv_sec != VNOVAL) {
1318 pn->mn_mtime = vap->va_mtime;
1323 vfs_timestamp(&pn->mn_ctime);
1329 struct vop_read_args {
1330 struct vop_generic_args a_gen;
1334 struct ucred *a_cred;
1342 mqfs_read(struct vop_read_args *ap)
1345 struct vnode *vp = ap->a_vp;
1346 struct uio *uio = ap->a_uio;
1347 struct mqfs_node *pn;
1351 if (vp->v_type != VREG)
1356 snprintf(buf, sizeof(buf),
1357 "QSIZE:%-10ld MAXMSG:%-10ld CURMSG:%-10ld MSGSIZE:%-10ld\n",
1362 buf[sizeof(buf)-1] = '\0';
1364 error = uiomove_frombuf(buf, len, uio);
1369 struct vop_readdir_args {
1370 struct vop_generic_args a_gen;
1373 struct ucred *a_cred;
1381 * Return directory entries.
1384 mqfs_readdir(struct vop_readdir_args *ap)
1387 struct mqfs_info *mi;
1388 struct mqfs_node *pd;
1389 struct mqfs_node *pn;
1390 struct dirent entry;
1392 const void *pr_root;
1393 int *tmp_ncookies = NULL;
1398 mi = VFSTOMQFS(vp->v_mount);
1402 if (vp->v_type != VDIR)
1405 if (uio->uio_offset < 0)
1408 if (ap->a_ncookies != NULL) {
1409 tmp_ncookies = ap->a_ncookies;
1410 *ap->a_ncookies = 0;
1411 ap->a_ncookies = NULL;
1417 pr_root = ap->a_cred->cr_prison->pr_root;
1418 sx_xlock(&mi->mi_lock);
1420 LIST_FOREACH(pn, &pd->mn_children, mn_sibling) {
1421 entry.d_reclen = sizeof(entry);
1424 * Only show names within the same prison root directory
1425 * (or not associated with a prison, e.g. "." and "..").
1427 if (pn->mn_pr_root != NULL && pn->mn_pr_root != pr_root)
1430 mqfs_fileno_alloc(mi, pn);
1431 entry.d_fileno = pn->mn_fileno;
1432 for (i = 0; i < MQFS_NAMELEN - 1 && pn->mn_name[i] != '\0'; ++i)
1433 entry.d_name[i] = pn->mn_name[i];
1434 entry.d_name[i] = 0;
1436 switch (pn->mn_type) {
1440 case mqfstype_parent:
1441 entry.d_type = DT_DIR;
1444 entry.d_type = DT_REG;
1446 case mqfstype_symlink:
1447 entry.d_type = DT_LNK;
1450 panic("%s has unexpected node type: %d", pn->mn_name,
1453 if (entry.d_reclen > uio->uio_resid)
1455 if (offset >= uio->uio_offset) {
1456 error = vfs_read_dirent(ap, &entry, offset);
1460 offset += entry.d_reclen;
1462 sx_xunlock(&mi->mi_lock);
1464 uio->uio_offset = offset;
1466 if (tmp_ncookies != NULL)
1467 ap->a_ncookies = tmp_ncookies;
1475 struct vop_mkdir_args {
1476 struct vnode *a_dvp;
1477 struvt vnode **a_vpp;
1478 struvt componentname *a_cnp;
1479 struct vattr *a_vap;
1484 * Create a directory.
1487 mqfs_mkdir(struct vop_mkdir_args *ap)
1489 struct mqfs_info *mqfs = VFSTOMQFS(ap->a_dvp->v_mount);
1490 struct componentname *cnp = ap->a_cnp;
1491 struct mqfs_node *pd = VTON(ap->a_dvp);
1492 struct mqfs_node *pn;
1495 if (pd->mn_type != mqfstype_root && pd->mn_type != mqfstype_dir)
1497 sx_xlock(&mqfs->mi_lock);
1498 if ((cnp->cn_flags & HASBUF) == 0)
1499 panic("%s: no name", __func__);
1500 pn = mqfs_create_dir(pd, cnp->cn_nameptr, cnp->cn_namelen,
1501 ap->a_vap->cn_cred, ap->a_vap->va_mode);
1504 sx_xunlock(&mqfs->mi_lock);
1508 error = mqfs_allocv(ap->a_dvp->v_mount, ap->a_vpp, pn);
1515 struct vop_rmdir_args {
1516 struct vnode *a_dvp;
1518 struct componentname *a_cnp;
1523 * Remove a directory.
1526 mqfs_rmdir(struct vop_rmdir_args *ap)
1528 struct mqfs_info *mqfs = VFSTOMQFS(ap->a_dvp->v_mount);
1529 struct mqfs_node *pn = VTON(ap->a_vp);
1530 struct mqfs_node *pt;
1532 if (pn->mn_type != mqfstype_dir)
1535 sx_xlock(&mqfs->mi_lock);
1536 if (pn->mn_deleted) {
1537 sx_xunlock(&mqfs->mi_lock);
1541 pt = LIST_FIRST(&pn->mn_children);
1542 pt = LIST_NEXT(pt, mn_sibling);
1543 pt = LIST_NEXT(pt, mn_sibling);
1545 sx_xunlock(&mqfs->mi_lock);
1549 pn->mn_parent = NULL;
1551 LIST_REMOVE(pn, mn_sibling);
1554 sx_xunlock(&mqfs->mi_lock);
1555 cache_purge(ap->a_vp);
1562 * See if this prison root is obsolete, and clean up associated queues if it is.
1565 mqfs_prison_remove(void *obj, void *data __unused)
1567 const struct prison *pr = obj;
1568 const struct prison *tpr;
1569 struct mqfs_node *pn, *tpn;
1573 TAILQ_FOREACH(tpr, &allprison, pr_list) {
1574 if (tpr->pr_root == pr->pr_root && tpr != pr && tpr->pr_ref > 0)
1579 * No jails are rooted in this directory anymore,
1580 * so no queues should be either.
1582 sx_xlock(&mqfs_data.mi_lock);
1583 LIST_FOREACH_SAFE(pn, &mqfs_data.mi_root->mn_children,
1585 if (pn->mn_pr_root == pr->pr_root)
1586 (void)do_unlink(pn, curthread->td_ucred);
1588 sx_xunlock(&mqfs_data.mi_lock);
1594 * Allocate a message queue
1596 static struct mqueue *
1597 mqueue_alloc(const struct mq_attr *attr)
1603 mq = uma_zalloc(mqueue_zone, M_WAITOK | M_ZERO);
1604 TAILQ_INIT(&mq->mq_msgq);
1606 mq->mq_maxmsg = attr->mq_maxmsg;
1607 mq->mq_msgsize = attr->mq_msgsize;
1609 mq->mq_maxmsg = default_maxmsg;
1610 mq->mq_msgsize = default_msgsize;
1612 mtx_init(&mq->mq_mutex, "mqueue lock", NULL, MTX_DEF);
1613 knlist_init_mtx(&mq->mq_rsel.si_note, &mq->mq_mutex);
1614 knlist_init_mtx(&mq->mq_wsel.si_note, &mq->mq_mutex);
1615 atomic_add_int(&curmq, 1);
1620 * Destroy a message queue
1623 mqueue_free(struct mqueue *mq)
1625 struct mqueue_msg *msg;
1627 while ((msg = TAILQ_FIRST(&mq->mq_msgq)) != NULL) {
1628 TAILQ_REMOVE(&mq->mq_msgq, msg, msg_link);
1629 free(msg, M_MQUEUEDATA);
1632 mtx_destroy(&mq->mq_mutex);
1633 seldrain(&mq->mq_rsel);
1634 seldrain(&mq->mq_wsel);
1635 knlist_destroy(&mq->mq_rsel.si_note);
1636 knlist_destroy(&mq->mq_wsel.si_note);
1637 uma_zfree(mqueue_zone, mq);
1638 atomic_add_int(&curmq, -1);
1642 * Load a message from user space
1644 static struct mqueue_msg *
1645 mqueue_loadmsg(const char *msg_ptr, size_t msg_size, int msg_prio)
1647 struct mqueue_msg *msg;
1651 len = sizeof(struct mqueue_msg) + msg_size;
1652 msg = malloc(len, M_MQUEUEDATA, M_WAITOK);
1653 error = copyin(msg_ptr, ((char *)msg) + sizeof(struct mqueue_msg),
1656 free(msg, M_MQUEUEDATA);
1659 msg->msg_size = msg_size;
1660 msg->msg_prio = msg_prio;
1666 * Save a message to user space
1669 mqueue_savemsg(struct mqueue_msg *msg, char *msg_ptr, int *msg_prio)
1673 error = copyout(((char *)msg) + sizeof(*msg), msg_ptr,
1675 if (error == 0 && msg_prio != NULL)
1676 error = copyout(&msg->msg_prio, msg_prio, sizeof(int));
1681 * Free a message's memory
1683 static __inline void
1684 mqueue_freemsg(struct mqueue_msg *msg)
1686 free(msg, M_MQUEUEDATA);
1690 * Send a message. if waitok is false, thread will not be
1691 * blocked if there is no data in queue, otherwise, absolute
1692 * time will be checked.
1695 mqueue_send(struct mqueue *mq, const char *msg_ptr,
1696 size_t msg_len, unsigned msg_prio, int waitok,
1697 const struct timespec *abs_timeout)
1699 struct mqueue_msg *msg;
1700 struct timespec ts, ts2;
1704 if (msg_prio >= MQ_PRIO_MAX)
1706 if (msg_len > mq->mq_msgsize)
1708 msg = mqueue_loadmsg(msg_ptr, msg_len, msg_prio);
1712 /* O_NONBLOCK case */
1714 error = _mqueue_send(mq, msg, -1);
1720 /* we allow a null timeout (wait forever) */
1721 if (abs_timeout == NULL) {
1722 error = _mqueue_send(mq, msg, 0);
1728 /* send it before checking time */
1729 error = _mqueue_send(mq, msg, -1);
1733 if (error != EAGAIN)
1736 if (abs_timeout->tv_nsec >= 1000000000 || abs_timeout->tv_nsec < 0) {
1743 timespecsub(&ts2, &ts);
1744 if (ts2.tv_sec < 0 || (ts2.tv_sec == 0 && ts2.tv_nsec <= 0)) {
1748 TIMESPEC_TO_TIMEVAL(&tv, &ts2);
1749 error = _mqueue_send(mq, msg, tvtohz(&tv));
1750 if (error != ETIMEDOUT)
1756 mqueue_freemsg(msg);
1761 * Common routine to send a message
1764 _mqueue_send(struct mqueue *mq, struct mqueue_msg *msg, int timo)
1766 struct mqueue_msg *msg2;
1769 mtx_lock(&mq->mq_mutex);
1770 while (mq->mq_curmsgs >= mq->mq_maxmsg && error == 0) {
1772 mtx_unlock(&mq->mq_mutex);
1776 error = msleep(&mq->mq_senders, &mq->mq_mutex,
1777 PCATCH, "mqsend", timo);
1779 if (error == EAGAIN)
1782 if (mq->mq_curmsgs >= mq->mq_maxmsg) {
1783 mtx_unlock(&mq->mq_mutex);
1787 if (TAILQ_EMPTY(&mq->mq_msgq)) {
1788 TAILQ_INSERT_HEAD(&mq->mq_msgq, msg, msg_link);
1790 if (msg->msg_prio <= TAILQ_LAST(&mq->mq_msgq, msgq)->msg_prio) {
1791 TAILQ_INSERT_TAIL(&mq->mq_msgq, msg, msg_link);
1793 TAILQ_FOREACH(msg2, &mq->mq_msgq, msg_link) {
1794 if (msg2->msg_prio < msg->msg_prio)
1797 TAILQ_INSERT_BEFORE(msg2, msg, msg_link);
1801 mq->mq_totalbytes += msg->msg_size;
1802 if (mq->mq_receivers)
1803 wakeup_one(&mq->mq_receivers);
1804 else if (mq->mq_notifier != NULL)
1805 mqueue_send_notification(mq);
1806 if (mq->mq_flags & MQ_RSEL) {
1807 mq->mq_flags &= ~MQ_RSEL;
1808 selwakeup(&mq->mq_rsel);
1810 KNOTE_LOCKED(&mq->mq_rsel.si_note, 0);
1811 mtx_unlock(&mq->mq_mutex);
1816 * Send realtime a signal to process which registered itself
1817 * successfully by mq_notify.
1820 mqueue_send_notification(struct mqueue *mq)
1822 struct mqueue_notifier *nt;
1827 mtx_assert(&mq->mq_mutex, MA_OWNED);
1828 nt = mq->mq_notifier;
1829 if (nt->nt_sigev.sigev_notify != SIGEV_NONE) {
1831 error = sigev_findtd(p, &nt->nt_sigev, &td);
1833 mq->mq_notifier = NULL;
1836 if (!KSI_ONQ(&nt->nt_ksi)) {
1837 ksiginfo_set_sigev(&nt->nt_ksi, &nt->nt_sigev);
1838 tdsendsignal(p, td, nt->nt_ksi.ksi_signo, &nt->nt_ksi);
1842 mq->mq_notifier = NULL;
1846 * Get a message. if waitok is false, thread will not be
1847 * blocked if there is no data in queue, otherwise, absolute
1848 * time will be checked.
1851 mqueue_receive(struct mqueue *mq, char *msg_ptr,
1852 size_t msg_len, unsigned *msg_prio, int waitok,
1853 const struct timespec *abs_timeout)
1855 struct mqueue_msg *msg;
1856 struct timespec ts, ts2;
1860 if (msg_len < mq->mq_msgsize)
1863 /* O_NONBLOCK case */
1865 error = _mqueue_recv(mq, &msg, -1);
1871 /* we allow a null timeout (wait forever). */
1872 if (abs_timeout == NULL) {
1873 error = _mqueue_recv(mq, &msg, 0);
1879 /* try to get a message before checking time */
1880 error = _mqueue_recv(mq, &msg, -1);
1884 if (error != EAGAIN)
1887 if (abs_timeout->tv_nsec >= 1000000000 || abs_timeout->tv_nsec < 0) {
1895 timespecsub(&ts2, &ts);
1896 if (ts2.tv_sec < 0 || (ts2.tv_sec == 0 && ts2.tv_nsec <= 0)) {
1900 TIMESPEC_TO_TIMEVAL(&tv, &ts2);
1901 error = _mqueue_recv(mq, &msg, tvtohz(&tv));
1904 if (error != ETIMEDOUT)
1909 error = mqueue_savemsg(msg, msg_ptr, msg_prio);
1911 curthread->td_retval[0] = msg->msg_size;
1912 curthread->td_retval[1] = 0;
1914 mqueue_freemsg(msg);
1919 * Common routine to receive a message
1922 _mqueue_recv(struct mqueue *mq, struct mqueue_msg **msg, int timo)
1926 mtx_lock(&mq->mq_mutex);
1927 while ((*msg = TAILQ_FIRST(&mq->mq_msgq)) == NULL && error == 0) {
1929 mtx_unlock(&mq->mq_mutex);
1933 error = msleep(&mq->mq_receivers, &mq->mq_mutex,
1934 PCATCH, "mqrecv", timo);
1936 if (error == EAGAIN)
1941 TAILQ_REMOVE(&mq->mq_msgq, *msg, msg_link);
1943 mq->mq_totalbytes -= (*msg)->msg_size;
1945 wakeup_one(&mq->mq_senders);
1946 if (mq->mq_flags & MQ_WSEL) {
1947 mq->mq_flags &= ~MQ_WSEL;
1948 selwakeup(&mq->mq_wsel);
1950 KNOTE_LOCKED(&mq->mq_wsel.si_note, 0);
1952 if (mq->mq_notifier != NULL && mq->mq_receivers == 0 &&
1953 !TAILQ_EMPTY(&mq->mq_msgq)) {
1954 mqueue_send_notification(mq);
1956 mtx_unlock(&mq->mq_mutex);
1960 static __inline struct mqueue_notifier *
1961 notifier_alloc(void)
1963 return (uma_zalloc(mqnoti_zone, M_WAITOK | M_ZERO));
1966 static __inline void
1967 notifier_free(struct mqueue_notifier *p)
1969 uma_zfree(mqnoti_zone, p);
1972 static struct mqueue_notifier *
1973 notifier_search(struct proc *p, int fd)
1975 struct mqueue_notifier *nt;
1977 LIST_FOREACH(nt, &p->p_mqnotifier, nt_link) {
1978 if (nt->nt_ksi.ksi_mqd == fd)
1984 static __inline void
1985 notifier_insert(struct proc *p, struct mqueue_notifier *nt)
1987 LIST_INSERT_HEAD(&p->p_mqnotifier, nt, nt_link);
1990 static __inline void
1991 notifier_delete(struct proc *p, struct mqueue_notifier *nt)
1993 LIST_REMOVE(nt, nt_link);
1998 notifier_remove(struct proc *p, struct mqueue *mq, int fd)
2000 struct mqueue_notifier *nt;
2002 mtx_assert(&mq->mq_mutex, MA_OWNED);
2004 nt = notifier_search(p, fd);
2006 if (mq->mq_notifier == nt)
2007 mq->mq_notifier = NULL;
2008 sigqueue_take(&nt->nt_ksi);
2009 notifier_delete(p, nt);
2015 kern_kmq_open(struct thread *td, const char *upath, int flags, mode_t mode,
2016 const struct mq_attr *attr)
2018 char path[MQFS_NAMELEN + 1];
2019 struct mqfs_node *pn;
2020 struct filedesc *fdp;
2023 int fd, error, len, cmode;
2025 AUDIT_ARG_FFLAGS(flags);
2026 AUDIT_ARG_MODE(mode);
2028 fdp = td->td_proc->p_fd;
2029 cmode = (((mode & ~fdp->fd_cmask) & ALLPERMS) & ~S_ISTXT);
2031 if ((flags & O_CREAT) != 0 && attr != NULL) {
2032 if (attr->mq_maxmsg <= 0 || attr->mq_maxmsg > maxmsg)
2034 if (attr->mq_msgsize <= 0 || attr->mq_msgsize > maxmsgsize)
2038 error = copyinstr(upath, path, MQFS_NAMELEN + 1, NULL);
2043 * The first character of name must be a slash (/) character
2044 * and the remaining characters of name cannot include any slash
2048 if (len < 2 || path[0] != '/' || strchr(path + 1, '/') != NULL)
2050 AUDIT_ARG_UPATH1_CANON(path);
2052 error = falloc(td, &fp, &fd, O_CLOEXEC);
2056 sx_xlock(&mqfs_data.mi_lock);
2057 pn = mqfs_search(mqfs_data.mi_root, path + 1, len - 1, td->td_ucred);
2059 if (!(flags & O_CREAT)) {
2062 mq = mqueue_alloc(attr);
2066 pn = mqfs_create_file(mqfs_data.mi_root,
2067 path + 1, len - 1, td->td_ucred,
2080 if ((flags & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL)) {
2083 accmode_t accmode = 0;
2089 error = vaccess(VREG, pn->mn_mode, pn->mn_uid,
2090 pn->mn_gid, accmode, td->td_ucred, NULL);
2095 sx_xunlock(&mqfs_data.mi_lock);
2096 fdclose(td, fp, fd);
2102 sx_xunlock(&mqfs_data.mi_lock);
2104 finit(fp, flags & (FREAD | FWRITE | O_NONBLOCK), DTYPE_MQUEUE, pn,
2107 td->td_retval[0] = fd;
2113 * Syscall to open a message queue.
2116 sys_kmq_open(struct thread *td, struct kmq_open_args *uap)
2118 struct mq_attr attr;
2121 if ((uap->flags & O_ACCMODE) == O_ACCMODE || uap->flags & O_EXEC)
2123 flags = FFLAGS(uap->flags);
2124 if ((flags & O_CREAT) != 0 && uap->attr != NULL) {
2125 error = copyin(uap->attr, &attr, sizeof(attr));
2129 return (kern_kmq_open(td, uap->path, flags, uap->mode,
2130 uap->attr != NULL ? &attr : NULL));
2134 * Syscall to unlink a message queue.
2137 sys_kmq_unlink(struct thread *td, struct kmq_unlink_args *uap)
2139 char path[MQFS_NAMELEN+1];
2140 struct mqfs_node *pn;
2143 error = copyinstr(uap->path, path, MQFS_NAMELEN + 1, NULL);
2148 if (len < 2 || path[0] != '/' || strchr(path + 1, '/') != NULL)
2150 AUDIT_ARG_UPATH1_CANON(path);
2152 sx_xlock(&mqfs_data.mi_lock);
2153 pn = mqfs_search(mqfs_data.mi_root, path + 1, len - 1, td->td_ucred);
2155 error = do_unlink(pn, td->td_ucred);
2158 sx_xunlock(&mqfs_data.mi_lock);
2162 typedef int (*_fgetf)(struct thread *, int, cap_rights_t *, struct file **);
2165 * Get message queue by giving file slot
2168 _getmq(struct thread *td, int fd, cap_rights_t *rightsp, _fgetf func,
2169 struct file **fpp, struct mqfs_node **ppn, struct mqueue **pmq)
2171 struct mqfs_node *pn;
2174 error = func(td, fd, rightsp, fpp);
2177 if (&mqueueops != (*fpp)->f_ops) {
2181 pn = (*fpp)->f_data;
2190 getmq(struct thread *td, int fd, struct file **fpp, struct mqfs_node **ppn,
2191 struct mqueue **pmq)
2193 cap_rights_t rights;
2195 return _getmq(td, fd, cap_rights_init(&rights, CAP_EVENT), fget,
2200 getmq_read(struct thread *td, int fd, struct file **fpp,
2201 struct mqfs_node **ppn, struct mqueue **pmq)
2203 cap_rights_t rights;
2205 return _getmq(td, fd, cap_rights_init(&rights, CAP_READ), fget_read,
2210 getmq_write(struct thread *td, int fd, struct file **fpp,
2211 struct mqfs_node **ppn, struct mqueue **pmq)
2213 cap_rights_t rights;
2215 return _getmq(td, fd, cap_rights_init(&rights, CAP_WRITE), fget_write,
2220 kern_kmq_setattr(struct thread *td, int mqd, const struct mq_attr *attr,
2221 struct mq_attr *oattr)
2229 if (attr != NULL && (attr->mq_flags & ~O_NONBLOCK) != 0)
2231 error = getmq(td, mqd, &fp, NULL, &mq);
2234 oattr->mq_maxmsg = mq->mq_maxmsg;
2235 oattr->mq_msgsize = mq->mq_msgsize;
2236 oattr->mq_curmsgs = mq->mq_curmsgs;
2239 oflag = flag = fp->f_flag;
2240 flag &= ~O_NONBLOCK;
2241 flag |= (attr->mq_flags & O_NONBLOCK);
2242 } while (atomic_cmpset_int(&fp->f_flag, oflag, flag) == 0);
2245 oattr->mq_flags = (O_NONBLOCK & oflag);
2251 sys_kmq_setattr(struct thread *td, struct kmq_setattr_args *uap)
2253 struct mq_attr attr, oattr;
2256 if (uap->attr != NULL) {
2257 error = copyin(uap->attr, &attr, sizeof(attr));
2261 error = kern_kmq_setattr(td, uap->mqd, uap->attr != NULL ? &attr : NULL,
2263 if (error == 0 && uap->oattr != NULL) {
2264 bzero(oattr.__reserved, sizeof(oattr.__reserved));
2265 error = copyout(&oattr, uap->oattr, sizeof(oattr));
2271 sys_kmq_timedreceive(struct thread *td, struct kmq_timedreceive_args *uap)
2275 struct timespec *abs_timeout, ets;
2279 AUDIT_ARG_FD(uap->mqd);
2280 error = getmq_read(td, uap->mqd, &fp, NULL, &mq);
2283 if (uap->abs_timeout != NULL) {
2284 error = copyin(uap->abs_timeout, &ets, sizeof(ets));
2290 waitok = !(fp->f_flag & O_NONBLOCK);
2291 error = mqueue_receive(mq, uap->msg_ptr, uap->msg_len,
2292 uap->msg_prio, waitok, abs_timeout);
2298 sys_kmq_timedsend(struct thread *td, struct kmq_timedsend_args *uap)
2302 struct timespec *abs_timeout, ets;
2305 AUDIT_ARG_FD(uap->mqd);
2306 error = getmq_write(td, uap->mqd, &fp, NULL, &mq);
2309 if (uap->abs_timeout != NULL) {
2310 error = copyin(uap->abs_timeout, &ets, sizeof(ets));
2316 waitok = !(fp->f_flag & O_NONBLOCK);
2317 error = mqueue_send(mq, uap->msg_ptr, uap->msg_len,
2318 uap->msg_prio, waitok, abs_timeout);
2324 kern_kmq_notify(struct thread *td, int mqd, struct sigevent *sigev)
2327 cap_rights_t rights;
2329 struct filedesc *fdp;
2332 struct file *fp, *fp2;
2333 struct mqueue_notifier *nt, *newnt = NULL;
2337 if (sigev != NULL) {
2338 if (sigev->sigev_notify != SIGEV_SIGNAL &&
2339 sigev->sigev_notify != SIGEV_THREAD_ID &&
2340 sigev->sigev_notify != SIGEV_NONE)
2342 if ((sigev->sigev_notify == SIGEV_SIGNAL ||
2343 sigev->sigev_notify == SIGEV_THREAD_ID) &&
2344 !_SIG_VALID(sigev->sigev_signo))
2348 fdp = td->td_proc->p_fd;
2349 error = getmq(td, mqd, &fp, NULL, &mq);
2353 FILEDESC_SLOCK(fdp);
2354 fp2 = fget_locked(fdp, mqd);
2356 FILEDESC_SUNLOCK(fdp);
2361 error = cap_check(cap_rights(fdp, mqd),
2362 cap_rights_init(&rights, CAP_EVENT));
2364 FILEDESC_SUNLOCK(fdp);
2369 FILEDESC_SUNLOCK(fdp);
2373 mtx_lock(&mq->mq_mutex);
2374 FILEDESC_SUNLOCK(fdp);
2375 if (sigev != NULL) {
2376 if (mq->mq_notifier != NULL) {
2380 nt = notifier_search(p, mqd);
2382 if (newnt == NULL) {
2384 mtx_unlock(&mq->mq_mutex);
2385 newnt = notifier_alloc();
2391 sigqueue_take(&nt->nt_ksi);
2392 if (newnt != NULL) {
2393 notifier_free(newnt);
2399 ksiginfo_init(&nt->nt_ksi);
2400 nt->nt_ksi.ksi_flags |= KSI_INS | KSI_EXT;
2401 nt->nt_ksi.ksi_code = SI_MESGQ;
2403 nt->nt_ksi.ksi_mqd = mqd;
2404 notifier_insert(p, nt);
2406 nt->nt_sigev = *sigev;
2407 mq->mq_notifier = nt;
2410 * if there is no receivers and message queue
2411 * is not empty, we should send notification
2412 * as soon as possible.
2414 if (mq->mq_receivers == 0 &&
2415 !TAILQ_EMPTY(&mq->mq_msgq))
2416 mqueue_send_notification(mq);
2419 notifier_remove(p, mq, mqd);
2421 mtx_unlock(&mq->mq_mutex);
2426 notifier_free(newnt);
2431 sys_kmq_notify(struct thread *td, struct kmq_notify_args *uap)
2433 struct sigevent ev, *evp;
2436 if (uap->sigev == NULL) {
2439 error = copyin(uap->sigev, &ev, sizeof(ev));
2444 return (kern_kmq_notify(td, uap->mqd, evp));
2448 mqueue_fdclose(struct thread *td, int fd, struct file *fp)
2450 struct filedesc *fdp;
2453 fdp = td->td_proc->p_fd;
2454 FILEDESC_LOCK_ASSERT(fdp);
2456 if (fp->f_ops == &mqueueops) {
2458 mtx_lock(&mq->mq_mutex);
2459 notifier_remove(td->td_proc, mq, fd);
2461 /* have to wakeup thread in same process */
2462 if (mq->mq_flags & MQ_RSEL) {
2463 mq->mq_flags &= ~MQ_RSEL;
2464 selwakeup(&mq->mq_rsel);
2466 if (mq->mq_flags & MQ_WSEL) {
2467 mq->mq_flags &= ~MQ_WSEL;
2468 selwakeup(&mq->mq_wsel);
2470 mtx_unlock(&mq->mq_mutex);
2475 mq_proc_exit(void *arg __unused, struct proc *p)
2477 struct filedesc *fdp;
2483 FILEDESC_SLOCK(fdp);
2484 for (i = 0; i < fdp->fd_nfiles; ++i) {
2485 fp = fget_locked(fdp, i);
2486 if (fp != NULL && fp->f_ops == &mqueueops) {
2488 mtx_lock(&mq->mq_mutex);
2489 notifier_remove(p, FPTOMQ(fp), i);
2490 mtx_unlock(&mq->mq_mutex);
2493 FILEDESC_SUNLOCK(fdp);
2494 KASSERT(LIST_EMPTY(&p->p_mqnotifier), ("mq notifiers left"));
2498 mqf_poll(struct file *fp, int events, struct ucred *active_cred,
2501 struct mqueue *mq = FPTOMQ(fp);
2504 mtx_lock(&mq->mq_mutex);
2505 if (events & (POLLIN | POLLRDNORM)) {
2506 if (mq->mq_curmsgs) {
2507 revents |= events & (POLLIN | POLLRDNORM);
2509 mq->mq_flags |= MQ_RSEL;
2510 selrecord(td, &mq->mq_rsel);
2513 if (events & POLLOUT) {
2514 if (mq->mq_curmsgs < mq->mq_maxmsg)
2517 mq->mq_flags |= MQ_WSEL;
2518 selrecord(td, &mq->mq_wsel);
2521 mtx_unlock(&mq->mq_mutex);
2526 mqf_close(struct file *fp, struct thread *td)
2528 struct mqfs_node *pn;
2530 fp->f_ops = &badfileops;
2533 sx_xlock(&mqfs_data.mi_lock);
2535 sx_xunlock(&mqfs_data.mi_lock);
2540 mqf_stat(struct file *fp, struct stat *st, struct ucred *active_cred,
2543 struct mqfs_node *pn = fp->f_data;
2545 bzero(st, sizeof *st);
2546 sx_xlock(&mqfs_data.mi_lock);
2547 st->st_atim = pn->mn_atime;
2548 st->st_mtim = pn->mn_mtime;
2549 st->st_ctim = pn->mn_ctime;
2550 st->st_birthtim = pn->mn_birth;
2551 st->st_uid = pn->mn_uid;
2552 st->st_gid = pn->mn_gid;
2553 st->st_mode = S_IFIFO | pn->mn_mode;
2554 sx_xunlock(&mqfs_data.mi_lock);
2559 mqf_chmod(struct file *fp, mode_t mode, struct ucred *active_cred,
2562 struct mqfs_node *pn;
2567 sx_xlock(&mqfs_data.mi_lock);
2568 error = vaccess(VREG, pn->mn_mode, pn->mn_uid, pn->mn_gid, VADMIN,
2572 pn->mn_mode = mode & ACCESSPERMS;
2574 sx_xunlock(&mqfs_data.mi_lock);
2579 mqf_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
2582 struct mqfs_node *pn;
2587 sx_xlock(&mqfs_data.mi_lock);
2588 if (uid == (uid_t)-1)
2590 if (gid == (gid_t)-1)
2592 if (((uid != pn->mn_uid && uid != active_cred->cr_uid) ||
2593 (gid != pn->mn_gid && !groupmember(gid, active_cred))) &&
2594 (error = priv_check_cred(active_cred, PRIV_VFS_CHOWN, 0)))
2599 sx_xunlock(&mqfs_data.mi_lock);
2604 mqf_kqfilter(struct file *fp, struct knote *kn)
2606 struct mqueue *mq = FPTOMQ(fp);
2609 if (kn->kn_filter == EVFILT_READ) {
2610 kn->kn_fop = &mq_rfiltops;
2611 knlist_add(&mq->mq_rsel.si_note, kn, 0);
2612 } else if (kn->kn_filter == EVFILT_WRITE) {
2613 kn->kn_fop = &mq_wfiltops;
2614 knlist_add(&mq->mq_wsel.si_note, kn, 0);
2621 filt_mqdetach(struct knote *kn)
2623 struct mqueue *mq = FPTOMQ(kn->kn_fp);
2625 if (kn->kn_filter == EVFILT_READ)
2626 knlist_remove(&mq->mq_rsel.si_note, kn, 0);
2627 else if (kn->kn_filter == EVFILT_WRITE)
2628 knlist_remove(&mq->mq_wsel.si_note, kn, 0);
2630 panic("filt_mqdetach");
2634 filt_mqread(struct knote *kn, long hint)
2636 struct mqueue *mq = FPTOMQ(kn->kn_fp);
2638 mtx_assert(&mq->mq_mutex, MA_OWNED);
2639 return (mq->mq_curmsgs != 0);
2643 filt_mqwrite(struct knote *kn, long hint)
2645 struct mqueue *mq = FPTOMQ(kn->kn_fp);
2647 mtx_assert(&mq->mq_mutex, MA_OWNED);
2648 return (mq->mq_curmsgs < mq->mq_maxmsg);
2652 mqf_fill_kinfo(struct file *fp, struct kinfo_file *kif, struct filedesc *fdp)
2655 kif->kf_type = KF_TYPE_MQUEUE;
2659 static struct fileops mqueueops = {
2660 .fo_read = invfo_rdwr,
2661 .fo_write = invfo_rdwr,
2662 .fo_truncate = invfo_truncate,
2663 .fo_ioctl = invfo_ioctl,
2664 .fo_poll = mqf_poll,
2665 .fo_kqfilter = mqf_kqfilter,
2666 .fo_stat = mqf_stat,
2667 .fo_close = mqf_close,
2668 .fo_chmod = mqf_chmod,
2669 .fo_chown = mqf_chown,
2670 .fo_sendfile = invfo_sendfile,
2671 .fo_fill_kinfo = mqf_fill_kinfo,
2674 static struct vop_vector mqfs_vnodeops = {
2675 .vop_default = &default_vnodeops,
2676 .vop_access = mqfs_access,
2677 .vop_cachedlookup = mqfs_lookup,
2678 .vop_lookup = vfs_cache_lookup,
2679 .vop_reclaim = mqfs_reclaim,
2680 .vop_create = mqfs_create,
2681 .vop_remove = mqfs_remove,
2682 .vop_inactive = mqfs_inactive,
2683 .vop_open = mqfs_open,
2684 .vop_close = mqfs_close,
2685 .vop_getattr = mqfs_getattr,
2686 .vop_setattr = mqfs_setattr,
2687 .vop_read = mqfs_read,
2688 .vop_write = VOP_EOPNOTSUPP,
2689 .vop_readdir = mqfs_readdir,
2690 .vop_mkdir = VOP_EOPNOTSUPP,
2691 .vop_rmdir = VOP_EOPNOTSUPP
2694 static struct vfsops mqfs_vfsops = {
2695 .vfs_init = mqfs_init,
2696 .vfs_uninit = mqfs_uninit,
2697 .vfs_mount = mqfs_mount,
2698 .vfs_unmount = mqfs_unmount,
2699 .vfs_root = mqfs_root,
2700 .vfs_statfs = mqfs_statfs,
2703 static struct vfsconf mqueuefs_vfsconf = {
2704 .vfc_version = VFS_VERSION,
2705 .vfc_name = "mqueuefs",
2706 .vfc_vfsops = &mqfs_vfsops,
2708 .vfc_flags = VFCF_SYNTHETIC
2711 static struct syscall_helper_data mq_syscalls[] = {
2712 SYSCALL_INIT_HELPER(kmq_open),
2713 SYSCALL_INIT_HELPER_F(kmq_setattr, SYF_CAPENABLED),
2714 SYSCALL_INIT_HELPER_F(kmq_timedsend, SYF_CAPENABLED),
2715 SYSCALL_INIT_HELPER_F(kmq_timedreceive, SYF_CAPENABLED),
2716 SYSCALL_INIT_HELPER_F(kmq_notify, SYF_CAPENABLED),
2717 SYSCALL_INIT_HELPER(kmq_unlink),
2721 #ifdef COMPAT_FREEBSD32
2722 #include <compat/freebsd32/freebsd32.h>
2723 #include <compat/freebsd32/freebsd32_proto.h>
2724 #include <compat/freebsd32/freebsd32_signal.h>
2725 #include <compat/freebsd32/freebsd32_syscall.h>
2726 #include <compat/freebsd32/freebsd32_util.h>
2729 mq_attr_from32(const struct mq_attr32 *from, struct mq_attr *to)
2732 to->mq_flags = from->mq_flags;
2733 to->mq_maxmsg = from->mq_maxmsg;
2734 to->mq_msgsize = from->mq_msgsize;
2735 to->mq_curmsgs = from->mq_curmsgs;
2739 mq_attr_to32(const struct mq_attr *from, struct mq_attr32 *to)
2742 to->mq_flags = from->mq_flags;
2743 to->mq_maxmsg = from->mq_maxmsg;
2744 to->mq_msgsize = from->mq_msgsize;
2745 to->mq_curmsgs = from->mq_curmsgs;
2749 freebsd32_kmq_open(struct thread *td, struct freebsd32_kmq_open_args *uap)
2751 struct mq_attr attr;
2752 struct mq_attr32 attr32;
2755 if ((uap->flags & O_ACCMODE) == O_ACCMODE || uap->flags & O_EXEC)
2757 flags = FFLAGS(uap->flags);
2758 if ((flags & O_CREAT) != 0 && uap->attr != NULL) {
2759 error = copyin(uap->attr, &attr32, sizeof(attr32));
2762 mq_attr_from32(&attr32, &attr);
2764 return (kern_kmq_open(td, uap->path, flags, uap->mode,
2765 uap->attr != NULL ? &attr : NULL));
2769 freebsd32_kmq_setattr(struct thread *td, struct freebsd32_kmq_setattr_args *uap)
2771 struct mq_attr attr, oattr;
2772 struct mq_attr32 attr32, oattr32;
2775 if (uap->attr != NULL) {
2776 error = copyin(uap->attr, &attr32, sizeof(attr32));
2779 mq_attr_from32(&attr32, &attr);
2781 error = kern_kmq_setattr(td, uap->mqd, uap->attr != NULL ? &attr : NULL,
2783 if (error == 0 && uap->oattr != NULL) {
2784 mq_attr_to32(&oattr, &oattr32);
2785 bzero(oattr32.__reserved, sizeof(oattr32.__reserved));
2786 error = copyout(&oattr32, uap->oattr, sizeof(oattr32));
2792 freebsd32_kmq_timedsend(struct thread *td,
2793 struct freebsd32_kmq_timedsend_args *uap)
2797 struct timespec32 ets32;
2798 struct timespec *abs_timeout, ets;
2802 AUDIT_ARG_FD(uap->mqd);
2803 error = getmq_write(td, uap->mqd, &fp, NULL, &mq);
2806 if (uap->abs_timeout != NULL) {
2807 error = copyin(uap->abs_timeout, &ets32, sizeof(ets32));
2810 CP(ets32, ets, tv_sec);
2811 CP(ets32, ets, tv_nsec);
2815 waitok = !(fp->f_flag & O_NONBLOCK);
2816 error = mqueue_send(mq, uap->msg_ptr, uap->msg_len,
2817 uap->msg_prio, waitok, abs_timeout);
2823 freebsd32_kmq_timedreceive(struct thread *td,
2824 struct freebsd32_kmq_timedreceive_args *uap)
2828 struct timespec32 ets32;
2829 struct timespec *abs_timeout, ets;
2832 AUDIT_ARG_FD(uap->mqd);
2833 error = getmq_read(td, uap->mqd, &fp, NULL, &mq);
2836 if (uap->abs_timeout != NULL) {
2837 error = copyin(uap->abs_timeout, &ets32, sizeof(ets32));
2840 CP(ets32, ets, tv_sec);
2841 CP(ets32, ets, tv_nsec);
2845 waitok = !(fp->f_flag & O_NONBLOCK);
2846 error = mqueue_receive(mq, uap->msg_ptr, uap->msg_len,
2847 uap->msg_prio, waitok, abs_timeout);
2853 freebsd32_kmq_notify(struct thread *td, struct freebsd32_kmq_notify_args *uap)
2855 struct sigevent ev, *evp;
2856 struct sigevent32 ev32;
2859 if (uap->sigev == NULL) {
2862 error = copyin(uap->sigev, &ev32, sizeof(ev32));
2865 error = convert_sigevent32(&ev32, &ev);
2870 return (kern_kmq_notify(td, uap->mqd, evp));
2873 static struct syscall_helper_data mq32_syscalls[] = {
2874 SYSCALL32_INIT_HELPER(freebsd32_kmq_open),
2875 SYSCALL32_INIT_HELPER_F(freebsd32_kmq_setattr, SYF_CAPENABLED),
2876 SYSCALL32_INIT_HELPER_F(freebsd32_kmq_timedsend, SYF_CAPENABLED),
2877 SYSCALL32_INIT_HELPER_F(freebsd32_kmq_timedreceive, SYF_CAPENABLED),
2878 SYSCALL32_INIT_HELPER_F(freebsd32_kmq_notify, SYF_CAPENABLED),
2879 SYSCALL32_INIT_HELPER_COMPAT(kmq_unlink),
2889 error = syscall_helper_register(mq_syscalls, SY_THR_STATIC_KLD);
2892 #ifdef COMPAT_FREEBSD32
2893 error = syscall32_helper_register(mq32_syscalls, SY_THR_STATIC_KLD);
2904 #ifdef COMPAT_FREEBSD32
2905 syscall32_helper_unregister(mq32_syscalls);
2907 syscall_helper_unregister(mq_syscalls);
2912 mq_modload(struct module *module, int cmd, void *arg)
2916 error = vfs_modevent(module, cmd, arg);
2935 static moduledata_t mqueuefs_mod = {
2940 DECLARE_MODULE(mqueuefs, mqueuefs_mod, SI_SUB_VFS, SI_ORDER_MIDDLE);
2941 MODULE_VERSION(mqueuefs, 1);