2 * POSIX message queues filesystem for Linux.
4 * Copyright (C) 2003,2004 Krzysztof Benedyczak (golbi@mat.uni.torun.pl)
5 * Michal Wronski (michal.wronski@gmail.com)
7 * Spinlocks: Mohamed Abbas (abbas.mohamed@intel.com)
8 * Lockless receive & send, fd based notify:
9 * Manfred Spraul (manfred@colorfullife.com)
11 * Audit: George Wilson (ltcgcw@us.ibm.com)
13 * This file is released under the GPL.
16 #include <linux/capability.h>
17 #include <linux/init.h>
18 #include <linux/pagemap.h>
19 #include <linux/file.h>
20 #include <linux/mount.h>
21 #include <linux/namei.h>
22 #include <linux/sysctl.h>
23 #include <linux/poll.h>
24 #include <linux/mqueue.h>
25 #include <linux/msg.h>
26 #include <linux/skbuff.h>
27 #include <linux/netlink.h>
28 #include <linux/syscalls.h>
29 #include <linux/audit.h>
30 #include <linux/signal.h>
31 #include <linux/mutex.h>
36 #define MQUEUE_MAGIC 0x19800202
37 #define DIRENT_SIZE 20
38 #define FILENT_SIZE 80
44 #define STATE_PENDING 1
49 #define CTL_QUEUESMAX 2
51 #define CTL_MSGSIZEMAX 4
54 #define DFLT_QUEUESMAX 256 /* max number of message queues */
55 #define DFLT_MSGMAX 10 /* max number of messages in each queue */
56 #define HARD_MSGMAX (131072/sizeof(void*))
57 #define DFLT_MSGSIZEMAX 8192 /* max message size */
60 struct ext_wait_queue { /* queue of sleeping tasks */
61 struct task_struct *task;
62 struct list_head list;
63 struct msg_msg *msg; /* ptr of loaded message */
64 int state; /* one of STATE_* values */
67 struct mqueue_inode_info {
69 struct inode vfs_inode;
70 wait_queue_head_t wait_q;
72 struct msg_msg **messages;
75 struct sigevent notify;
76 struct pid* notify_owner;
77 struct user_struct *user; /* user who created, for accounting */
78 struct sock *notify_sock;
79 struct sk_buff *notify_cookie;
81 /* for tasks waiting for free space and messages, respectively */
82 struct ext_wait_queue e_wait_q[2];
84 unsigned long qsize; /* size of queue in memory (sum of all msgs) */
87 static const struct inode_operations mqueue_dir_inode_operations;
88 static const struct file_operations mqueue_file_operations;
89 static struct super_operations mqueue_super_ops;
90 static void remove_notification(struct mqueue_inode_info *info);
92 static spinlock_t mq_lock;
93 static struct kmem_cache *mqueue_inode_cachep;
94 static struct vfsmount *mqueue_mnt;
96 static unsigned int queues_count;
97 static unsigned int queues_max = DFLT_QUEUESMAX;
98 static unsigned int msg_max = DFLT_MSGMAX;
99 static unsigned int msgsize_max = DFLT_MSGSIZEMAX;
101 static struct ctl_table_header * mq_sysctl_table;
103 static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode)
105 return container_of(inode, struct mqueue_inode_info, vfs_inode);
108 static struct inode *mqueue_get_inode(struct super_block *sb, int mode,
109 struct mq_attr *attr)
113 inode = new_inode(sb);
115 inode->i_mode = mode;
116 inode->i_uid = current->fsuid;
117 inode->i_gid = current->fsgid;
119 inode->i_mtime = inode->i_ctime = inode->i_atime =
123 struct mqueue_inode_info *info;
124 struct task_struct *p = current;
125 struct user_struct *u = p->user;
126 unsigned long mq_bytes, mq_msg_tblsz;
128 inode->i_fop = &mqueue_file_operations;
129 inode->i_size = FILENT_SIZE;
130 /* mqueue specific info */
131 info = MQUEUE_I(inode);
132 spin_lock_init(&info->lock);
133 init_waitqueue_head(&info->wait_q);
134 INIT_LIST_HEAD(&info->e_wait_q[0].list);
135 INIT_LIST_HEAD(&info->e_wait_q[1].list);
136 info->messages = NULL;
137 info->notify_owner = NULL;
139 info->user = NULL; /* set when all is ok */
140 memset(&info->attr, 0, sizeof(info->attr));
141 info->attr.mq_maxmsg = DFLT_MSGMAX;
142 info->attr.mq_msgsize = DFLT_MSGSIZEMAX;
144 info->attr.mq_maxmsg = attr->mq_maxmsg;
145 info->attr.mq_msgsize = attr->mq_msgsize;
147 mq_msg_tblsz = info->attr.mq_maxmsg * sizeof(struct msg_msg *);
148 mq_bytes = (mq_msg_tblsz +
149 (info->attr.mq_maxmsg * info->attr.mq_msgsize));
152 if (u->mq_bytes + mq_bytes < u->mq_bytes ||
153 u->mq_bytes + mq_bytes >
154 p->signal->rlim[RLIMIT_MSGQUEUE].rlim_cur) {
155 spin_unlock(&mq_lock);
158 u->mq_bytes += mq_bytes;
159 spin_unlock(&mq_lock);
161 info->messages = kmalloc(mq_msg_tblsz, GFP_KERNEL);
162 if (!info->messages) {
164 u->mq_bytes -= mq_bytes;
165 spin_unlock(&mq_lock);
169 info->user = get_uid(u);
170 } else if (S_ISDIR(mode)) {
172 /* Some things misbehave if size == 0 on a directory */
173 inode->i_size = 2 * DIRENT_SIZE;
174 inode->i_op = &mqueue_dir_inode_operations;
175 inode->i_fop = &simple_dir_operations;
180 make_bad_inode(inode);
185 static int mqueue_fill_super(struct super_block *sb, void *data, int silent)
189 sb->s_blocksize = PAGE_CACHE_SIZE;
190 sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
191 sb->s_magic = MQUEUE_MAGIC;
192 sb->s_op = &mqueue_super_ops;
194 inode = mqueue_get_inode(sb, S_IFDIR | S_ISVTX | S_IRWXUGO, NULL);
198 sb->s_root = d_alloc_root(inode);
207 static int mqueue_get_sb(struct file_system_type *fs_type,
208 int flags, const char *dev_name,
209 void *data, struct vfsmount *mnt)
211 return get_sb_single(fs_type, flags, data, mqueue_fill_super, mnt);
214 static void init_once(void *foo, struct kmem_cache * cachep, unsigned long flags)
216 struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo;
218 if (flags & SLAB_CTOR_CONSTRUCTOR)
219 inode_init_once(&p->vfs_inode);
222 static struct inode *mqueue_alloc_inode(struct super_block *sb)
224 struct mqueue_inode_info *ei;
226 ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL);
229 return &ei->vfs_inode;
232 static void mqueue_destroy_inode(struct inode *inode)
234 kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode));
237 static void mqueue_delete_inode(struct inode *inode)
239 struct mqueue_inode_info *info;
240 struct user_struct *user;
241 unsigned long mq_bytes;
244 if (S_ISDIR(inode->i_mode)) {
248 info = MQUEUE_I(inode);
249 spin_lock(&info->lock);
250 for (i = 0; i < info->attr.mq_curmsgs; i++)
251 free_msg(info->messages[i]);
252 kfree(info->messages);
253 spin_unlock(&info->lock);
257 mq_bytes = (info->attr.mq_maxmsg * sizeof(struct msg_msg *) +
258 (info->attr.mq_maxmsg * info->attr.mq_msgsize));
262 user->mq_bytes -= mq_bytes;
264 spin_unlock(&mq_lock);
269 static int mqueue_create(struct inode *dir, struct dentry *dentry,
270 int mode, struct nameidata *nd)
273 struct mq_attr *attr = dentry->d_fsdata;
277 if (queues_count >= queues_max && !capable(CAP_SYS_RESOURCE)) {
282 spin_unlock(&mq_lock);
284 inode = mqueue_get_inode(dir->i_sb, mode, attr);
292 dir->i_size += DIRENT_SIZE;
293 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
295 d_instantiate(dentry, inode);
299 spin_unlock(&mq_lock);
303 static int mqueue_unlink(struct inode *dir, struct dentry *dentry)
305 struct inode *inode = dentry->d_inode;
307 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
308 dir->i_size -= DIRENT_SIZE;
315 * This is routine for system read from queue file.
316 * To avoid mess with doing here some sort of mq_receive we allow
317 * to read only queue size & notification info (the only values
318 * that are interesting from user point of view and aren't accessible
319 * through std routines)
321 static ssize_t mqueue_read_file(struct file *filp, char __user *u_data,
322 size_t count, loff_t * off)
324 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
325 char buffer[FILENT_SIZE];
332 spin_lock(&info->lock);
333 snprintf(buffer, sizeof(buffer),
334 "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
336 info->notify_owner ? info->notify.sigev_notify : 0,
337 (info->notify_owner &&
338 info->notify.sigev_notify == SIGEV_SIGNAL) ?
339 info->notify.sigev_signo : 0,
340 pid_nr(info->notify_owner));
341 spin_unlock(&info->lock);
342 buffer[sizeof(buffer)-1] = '\0';
343 slen = strlen(buffer)+1;
349 if (o + count > slen)
352 if (copy_to_user(u_data, buffer + o, count))
356 filp->f_path.dentry->d_inode->i_atime = filp->f_path.dentry->d_inode->i_ctime = CURRENT_TIME;
360 static int mqueue_flush_file(struct file *filp, fl_owner_t id)
362 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
364 spin_lock(&info->lock);
365 if (task_tgid(current) == info->notify_owner)
366 remove_notification(info);
368 spin_unlock(&info->lock);
372 static unsigned int mqueue_poll_file(struct file *filp, struct poll_table_struct *poll_tab)
374 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
377 poll_wait(filp, &info->wait_q, poll_tab);
379 spin_lock(&info->lock);
380 if (info->attr.mq_curmsgs)
381 retval = POLLIN | POLLRDNORM;
383 if (info->attr.mq_curmsgs < info->attr.mq_maxmsg)
384 retval |= POLLOUT | POLLWRNORM;
385 spin_unlock(&info->lock);
390 /* Adds current to info->e_wait_q[sr] before element with smaller prio */
391 static void wq_add(struct mqueue_inode_info *info, int sr,
392 struct ext_wait_queue *ewp)
394 struct ext_wait_queue *walk;
398 list_for_each_entry(walk, &info->e_wait_q[sr].list, list) {
399 if (walk->task->static_prio <= current->static_prio) {
400 list_add_tail(&ewp->list, &walk->list);
404 list_add_tail(&ewp->list, &info->e_wait_q[sr].list);
408 * Puts current task to sleep. Caller must hold queue lock. After return
412 static int wq_sleep(struct mqueue_inode_info *info, int sr,
413 long timeout, struct ext_wait_queue *ewp)
418 wq_add(info, sr, ewp);
421 set_current_state(TASK_INTERRUPTIBLE);
423 spin_unlock(&info->lock);
424 time = schedule_timeout(timeout);
426 while (ewp->state == STATE_PENDING)
429 if (ewp->state == STATE_READY) {
433 spin_lock(&info->lock);
434 if (ewp->state == STATE_READY) {
438 if (signal_pending(current)) {
439 retval = -ERESTARTSYS;
447 list_del(&ewp->list);
449 spin_unlock(&info->lock);
455 * Returns waiting task that should be serviced first or NULL if none exists
457 static struct ext_wait_queue *wq_get_first_waiter(
458 struct mqueue_inode_info *info, int sr)
460 struct list_head *ptr;
462 ptr = info->e_wait_q[sr].list.prev;
463 if (ptr == &info->e_wait_q[sr].list)
465 return list_entry(ptr, struct ext_wait_queue, list);
468 /* Auxiliary functions to manipulate messages' list */
469 static void msg_insert(struct msg_msg *ptr, struct mqueue_inode_info *info)
473 k = info->attr.mq_curmsgs - 1;
474 while (k >= 0 && info->messages[k]->m_type >= ptr->m_type) {
475 info->messages[k + 1] = info->messages[k];
478 info->attr.mq_curmsgs++;
479 info->qsize += ptr->m_ts;
480 info->messages[k + 1] = ptr;
483 static inline struct msg_msg *msg_get(struct mqueue_inode_info *info)
485 info->qsize -= info->messages[--info->attr.mq_curmsgs]->m_ts;
486 return info->messages[info->attr.mq_curmsgs];
489 static inline void set_cookie(struct sk_buff *skb, char code)
491 ((char*)skb->data)[NOTIFY_COOKIE_LEN-1] = code;
495 * The next function is only to split too long sys_mq_timedsend
497 static void __do_notify(struct mqueue_inode_info *info)
500 * invoked when there is registered process and there isn't process
501 * waiting synchronously for message AND state of queue changed from
502 * empty to not empty. Here we are sure that no one is waiting
504 if (info->notify_owner &&
505 info->attr.mq_curmsgs == 1) {
506 struct siginfo sig_i;
507 switch (info->notify.sigev_notify) {
513 sig_i.si_signo = info->notify.sigev_signo;
515 sig_i.si_code = SI_MESGQ;
516 sig_i.si_value = info->notify.sigev_value;
517 sig_i.si_pid = current->tgid;
518 sig_i.si_uid = current->uid;
520 kill_pid_info(info->notify.sigev_signo,
521 &sig_i, info->notify_owner);
524 set_cookie(info->notify_cookie, NOTIFY_WOKENUP);
525 netlink_sendskb(info->notify_sock,
526 info->notify_cookie, 0);
529 /* after notification unregisters process */
530 put_pid(info->notify_owner);
531 info->notify_owner = NULL;
533 wake_up(&info->wait_q);
536 static long prepare_timeout(const struct timespec __user *u_arg)
538 struct timespec ts, nowts;
542 if (unlikely(copy_from_user(&ts, u_arg,
543 sizeof(struct timespec))))
546 if (unlikely(ts.tv_nsec < 0 || ts.tv_sec < 0
547 || ts.tv_nsec >= NSEC_PER_SEC))
549 nowts = CURRENT_TIME;
550 /* first subtract as jiffies can't be too big */
551 ts.tv_sec -= nowts.tv_sec;
552 if (ts.tv_nsec < nowts.tv_nsec) {
553 ts.tv_nsec += NSEC_PER_SEC;
556 ts.tv_nsec -= nowts.tv_nsec;
560 timeout = timespec_to_jiffies(&ts) + 1;
562 return MAX_SCHEDULE_TIMEOUT;
567 static void remove_notification(struct mqueue_inode_info *info)
569 if (info->notify_owner != NULL &&
570 info->notify.sigev_notify == SIGEV_THREAD) {
571 set_cookie(info->notify_cookie, NOTIFY_REMOVED);
572 netlink_sendskb(info->notify_sock, info->notify_cookie, 0);
574 put_pid(info->notify_owner);
575 info->notify_owner = NULL;
578 static int mq_attr_ok(struct mq_attr *attr)
580 if (attr->mq_maxmsg <= 0 || attr->mq_msgsize <= 0)
582 if (capable(CAP_SYS_RESOURCE)) {
583 if (attr->mq_maxmsg > HARD_MSGMAX)
586 if (attr->mq_maxmsg > msg_max ||
587 attr->mq_msgsize > msgsize_max)
590 /* check for overflow */
591 if (attr->mq_msgsize > ULONG_MAX/attr->mq_maxmsg)
593 if ((unsigned long)(attr->mq_maxmsg * attr->mq_msgsize) +
594 (attr->mq_maxmsg * sizeof (struct msg_msg *)) <
595 (unsigned long)(attr->mq_maxmsg * attr->mq_msgsize))
601 * Invoked when creating a new queue via sys_mq_open
603 static struct file *do_create(struct dentry *dir, struct dentry *dentry,
604 int oflag, mode_t mode, struct mq_attr __user *u_attr)
611 if (copy_from_user(&attr, u_attr, sizeof(attr)))
614 if (!mq_attr_ok(&attr))
616 /* store for use during create */
617 dentry->d_fsdata = &attr;
620 mode &= ~current->fs->umask;
621 ret = vfs_create(dir->d_inode, dentry, mode, NULL);
622 dentry->d_fsdata = NULL;
626 return dentry_open(dentry, mqueue_mnt, oflag);
634 /* Opens existing queue */
635 static struct file *do_open(struct dentry *dentry, int oflag)
637 static int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE,
638 MAY_READ | MAY_WRITE };
640 if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) {
643 return ERR_PTR(-EINVAL);
646 if (permission(dentry->d_inode, oflag2acc[oflag & O_ACCMODE], NULL)) {
649 return ERR_PTR(-EACCES);
652 return dentry_open(dentry, mqueue_mnt, oflag);
655 asmlinkage long sys_mq_open(const char __user *u_name, int oflag, mode_t mode,
656 struct mq_attr __user *u_attr)
658 struct dentry *dentry;
663 error = audit_mq_open(oflag, mode, u_attr);
667 if (IS_ERR(name = getname(u_name)))
668 return PTR_ERR(name);
670 fd = get_unused_fd();
674 mutex_lock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
675 dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
676 if (IS_ERR(dentry)) {
677 error = PTR_ERR(dentry);
682 if (oflag & O_CREAT) {
683 if (dentry->d_inode) { /* entry already exists */
684 audit_inode(name, dentry->d_inode);
688 filp = do_open(dentry, oflag);
690 filp = do_create(mqueue_mnt->mnt_root, dentry,
691 oflag, mode, u_attr);
695 if (!dentry->d_inode)
697 audit_inode(name, dentry->d_inode);
698 filp = do_open(dentry, oflag);
702 error = PTR_ERR(filp);
706 set_close_on_exec(fd, 1);
707 fd_install(fd, filp);
718 mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
724 asmlinkage long sys_mq_unlink(const char __user *u_name)
728 struct dentry *dentry;
729 struct inode *inode = NULL;
731 name = getname(u_name);
733 return PTR_ERR(name);
735 mutex_lock_nested(&mqueue_mnt->mnt_root->d_inode->i_mutex,
737 dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
738 if (IS_ERR(dentry)) {
739 err = PTR_ERR(dentry);
743 if (!dentry->d_inode) {
748 inode = dentry->d_inode;
750 atomic_inc(&inode->i_count);
752 err = vfs_unlink(dentry->d_parent->d_inode, dentry);
757 mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
765 /* Pipelined send and receive functions.
767 * If a receiver finds no waiting message, then it registers itself in the
768 * list of waiting receivers. A sender checks that list before adding the new
769 * message into the message array. If there is a waiting receiver, then it
770 * bypasses the message array and directly hands the message over to the
772 * The receiver accepts the message and returns without grabbing the queue
773 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
774 * are necessary. The same algorithm is used for sysv semaphores, see
775 * ipc/sem.c for more details.
777 * The same algorithm is used for senders.
780 /* pipelined_send() - send a message directly to the task waiting in
781 * sys_mq_timedreceive() (without inserting message into a queue).
783 static inline void pipelined_send(struct mqueue_inode_info *info,
784 struct msg_msg *message,
785 struct ext_wait_queue *receiver)
787 receiver->msg = message;
788 list_del(&receiver->list);
789 receiver->state = STATE_PENDING;
790 wake_up_process(receiver->task);
792 receiver->state = STATE_READY;
795 /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
796 * gets its message and put to the queue (we have one free place for sure). */
797 static inline void pipelined_receive(struct mqueue_inode_info *info)
799 struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND);
803 wake_up_interruptible(&info->wait_q);
806 msg_insert(sender->msg, info);
807 list_del(&sender->list);
808 sender->state = STATE_PENDING;
809 wake_up_process(sender->task);
811 sender->state = STATE_READY;
814 asmlinkage long sys_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr,
815 size_t msg_len, unsigned int msg_prio,
816 const struct timespec __user *u_abs_timeout)
820 struct ext_wait_queue wait;
821 struct ext_wait_queue *receiver;
822 struct msg_msg *msg_ptr;
823 struct mqueue_inode_info *info;
827 ret = audit_mq_timedsend(mqdes, msg_len, msg_prio, u_abs_timeout);
831 if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX))
834 timeout = prepare_timeout(u_abs_timeout);
841 inode = filp->f_path.dentry->d_inode;
842 if (unlikely(filp->f_op != &mqueue_file_operations))
844 info = MQUEUE_I(inode);
845 audit_inode(NULL, inode);
847 if (unlikely(!(filp->f_mode & FMODE_WRITE)))
850 if (unlikely(msg_len > info->attr.mq_msgsize)) {
855 /* First try to allocate memory, before doing anything with
856 * existing queues. */
857 msg_ptr = load_msg(u_msg_ptr, msg_len);
858 if (IS_ERR(msg_ptr)) {
859 ret = PTR_ERR(msg_ptr);
862 msg_ptr->m_ts = msg_len;
863 msg_ptr->m_type = msg_prio;
865 spin_lock(&info->lock);
867 if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) {
868 if (filp->f_flags & O_NONBLOCK) {
869 spin_unlock(&info->lock);
871 } else if (unlikely(timeout < 0)) {
872 spin_unlock(&info->lock);
876 wait.msg = (void *) msg_ptr;
877 wait.state = STATE_NONE;
878 ret = wq_sleep(info, SEND, timeout, &wait);
883 receiver = wq_get_first_waiter(info, RECV);
885 pipelined_send(info, msg_ptr, receiver);
887 /* adds message to the queue */
888 msg_insert(msg_ptr, info);
891 inode->i_atime = inode->i_mtime = inode->i_ctime =
893 spin_unlock(&info->lock);
902 asmlinkage ssize_t sys_mq_timedreceive(mqd_t mqdes, char __user *u_msg_ptr,
903 size_t msg_len, unsigned int __user *u_msg_prio,
904 const struct timespec __user *u_abs_timeout)
908 struct msg_msg *msg_ptr;
911 struct mqueue_inode_info *info;
912 struct ext_wait_queue wait;
914 ret = audit_mq_timedreceive(mqdes, msg_len, u_msg_prio, u_abs_timeout);
918 timeout = prepare_timeout(u_abs_timeout);
925 inode = filp->f_path.dentry->d_inode;
926 if (unlikely(filp->f_op != &mqueue_file_operations))
928 info = MQUEUE_I(inode);
929 audit_inode(NULL, inode);
931 if (unlikely(!(filp->f_mode & FMODE_READ)))
934 /* checks if buffer is big enough */
935 if (unlikely(msg_len < info->attr.mq_msgsize)) {
940 spin_lock(&info->lock);
941 if (info->attr.mq_curmsgs == 0) {
942 if (filp->f_flags & O_NONBLOCK) {
943 spin_unlock(&info->lock);
946 } else if (unlikely(timeout < 0)) {
947 spin_unlock(&info->lock);
952 wait.state = STATE_NONE;
953 ret = wq_sleep(info, RECV, timeout, &wait);
957 msg_ptr = msg_get(info);
959 inode->i_atime = inode->i_mtime = inode->i_ctime =
962 /* There is now free space in queue. */
963 pipelined_receive(info);
964 spin_unlock(&info->lock);
970 if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) ||
971 store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) {
983 * Notes: the case when user wants us to deregister (with NULL as pointer)
984 * and he isn't currently owner of notification, will be silently discarded.
985 * It isn't explicitly defined in the POSIX.
987 asmlinkage long sys_mq_notify(mqd_t mqdes,
988 const struct sigevent __user *u_notification)
994 struct sigevent notification;
995 struct mqueue_inode_info *info;
998 ret = audit_mq_notify(mqdes, u_notification);
1004 if (u_notification != NULL) {
1005 if (copy_from_user(¬ification, u_notification,
1006 sizeof(struct sigevent)))
1009 if (unlikely(notification.sigev_notify != SIGEV_NONE &&
1010 notification.sigev_notify != SIGEV_SIGNAL &&
1011 notification.sigev_notify != SIGEV_THREAD))
1013 if (notification.sigev_notify == SIGEV_SIGNAL &&
1014 !valid_signal(notification.sigev_signo)) {
1017 if (notification.sigev_notify == SIGEV_THREAD) {
1018 /* create the notify skb */
1019 nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL);
1024 if (copy_from_user(nc->data,
1025 notification.sigev_value.sival_ptr,
1026 NOTIFY_COOKIE_LEN)) {
1030 /* TODO: add a header? */
1031 skb_put(nc, NOTIFY_COOKIE_LEN);
1032 /* and attach it to the socket */
1034 filp = fget(notification.sigev_signo);
1038 sock = netlink_getsockbyfilp(filp);
1041 ret = PTR_ERR(sock);
1046 ret = netlink_attachskb(sock, nc, 0,
1047 MAX_SCHEDULE_TIMEOUT, NULL);
1063 inode = filp->f_path.dentry->d_inode;
1064 if (unlikely(filp->f_op != &mqueue_file_operations))
1066 info = MQUEUE_I(inode);
1069 spin_lock(&info->lock);
1070 if (u_notification == NULL) {
1071 if (info->notify_owner == task_tgid(current)) {
1072 remove_notification(info);
1073 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1075 } else if (info->notify_owner != NULL) {
1078 switch (notification.sigev_notify) {
1080 info->notify.sigev_notify = SIGEV_NONE;
1083 info->notify_sock = sock;
1084 info->notify_cookie = nc;
1087 info->notify.sigev_notify = SIGEV_THREAD;
1090 info->notify.sigev_signo = notification.sigev_signo;
1091 info->notify.sigev_value = notification.sigev_value;
1092 info->notify.sigev_notify = SIGEV_SIGNAL;
1096 info->notify_owner = get_pid(task_tgid(current));
1097 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1099 spin_unlock(&info->lock);
1104 netlink_detachskb(sock, nc);
1111 asmlinkage long sys_mq_getsetattr(mqd_t mqdes,
1112 const struct mq_attr __user *u_mqstat,
1113 struct mq_attr __user *u_omqstat)
1116 struct mq_attr mqstat, omqstat;
1118 struct inode *inode;
1119 struct mqueue_inode_info *info;
1121 if (u_mqstat != NULL) {
1122 if (copy_from_user(&mqstat, u_mqstat, sizeof(struct mq_attr)))
1124 if (mqstat.mq_flags & (~O_NONBLOCK))
1133 inode = filp->f_path.dentry->d_inode;
1134 if (unlikely(filp->f_op != &mqueue_file_operations))
1136 info = MQUEUE_I(inode);
1138 spin_lock(&info->lock);
1140 omqstat = info->attr;
1141 omqstat.mq_flags = filp->f_flags & O_NONBLOCK;
1143 ret = audit_mq_getsetattr(mqdes, &mqstat);
1146 if (mqstat.mq_flags & O_NONBLOCK)
1147 filp->f_flags |= O_NONBLOCK;
1149 filp->f_flags &= ~O_NONBLOCK;
1151 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1154 spin_unlock(&info->lock);
1157 if (u_omqstat != NULL && copy_to_user(u_omqstat, &omqstat,
1158 sizeof(struct mq_attr)))
1167 static const struct inode_operations mqueue_dir_inode_operations = {
1168 .lookup = simple_lookup,
1169 .create = mqueue_create,
1170 .unlink = mqueue_unlink,
1173 static const struct file_operations mqueue_file_operations = {
1174 .flush = mqueue_flush_file,
1175 .poll = mqueue_poll_file,
1176 .read = mqueue_read_file,
1179 static struct super_operations mqueue_super_ops = {
1180 .alloc_inode = mqueue_alloc_inode,
1181 .destroy_inode = mqueue_destroy_inode,
1182 .statfs = simple_statfs,
1183 .delete_inode = mqueue_delete_inode,
1184 .drop_inode = generic_delete_inode,
1187 static struct file_system_type mqueue_fs_type = {
1189 .get_sb = mqueue_get_sb,
1190 .kill_sb = kill_litter_super,
1193 static int msg_max_limit_min = DFLT_MSGMAX;
1194 static int msg_max_limit_max = HARD_MSGMAX;
1196 static int msg_maxsize_limit_min = DFLT_MSGSIZEMAX;
1197 static int msg_maxsize_limit_max = INT_MAX;
1199 static ctl_table mq_sysctls[] = {
1201 .ctl_name = CTL_QUEUESMAX,
1202 .procname = "queues_max",
1203 .data = &queues_max,
1204 .maxlen = sizeof(int),
1206 .proc_handler = &proc_dointvec,
1209 .ctl_name = CTL_MSGMAX,
1210 .procname = "msg_max",
1212 .maxlen = sizeof(int),
1214 .proc_handler = &proc_dointvec_minmax,
1215 .extra1 = &msg_max_limit_min,
1216 .extra2 = &msg_max_limit_max,
1219 .ctl_name = CTL_MSGSIZEMAX,
1220 .procname = "msgsize_max",
1221 .data = &msgsize_max,
1222 .maxlen = sizeof(int),
1224 .proc_handler = &proc_dointvec_minmax,
1225 .extra1 = &msg_maxsize_limit_min,
1226 .extra2 = &msg_maxsize_limit_max,
1231 static ctl_table mq_sysctl_dir[] = {
1233 .ctl_name = FS_MQUEUE,
1234 .procname = "mqueue",
1236 .child = mq_sysctls,
1241 static ctl_table mq_sysctl_root[] = {
1246 .child = mq_sysctl_dir,
1251 static int __init init_mqueue_fs(void)
1255 mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache",
1256 sizeof(struct mqueue_inode_info), 0,
1257 SLAB_HWCACHE_ALIGN, init_once, NULL);
1258 if (mqueue_inode_cachep == NULL)
1261 /* ignore failues - they are not fatal */
1262 mq_sysctl_table = register_sysctl_table(mq_sysctl_root);
1264 error = register_filesystem(&mqueue_fs_type);
1268 if (IS_ERR(mqueue_mnt = kern_mount(&mqueue_fs_type))) {
1269 error = PTR_ERR(mqueue_mnt);
1270 goto out_filesystem;
1273 /* internal initialization - not common for vfs */
1275 spin_lock_init(&mq_lock);
1280 unregister_filesystem(&mqueue_fs_type);
1282 if (mq_sysctl_table)
1283 unregister_sysctl_table(mq_sysctl_table);
1284 kmem_cache_destroy(mqueue_inode_cachep);
1288 __initcall(init_mqueue_fs);