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>
32 #include <linux/nsproxy.h>
33 #include <linux/pid.h>
34 #include <linux/ipc_namespace.h>
35 #include <linux/slab.h>
40 #define MQUEUE_MAGIC 0x19800202
41 #define DIRENT_SIZE 20
42 #define FILENT_SIZE 80
48 #define STATE_PENDING 1
51 struct ext_wait_queue { /* queue of sleeping tasks */
52 struct task_struct *task;
53 struct list_head list;
54 struct msg_msg *msg; /* ptr of loaded message */
55 int state; /* one of STATE_* values */
58 struct mqueue_inode_info {
60 struct inode vfs_inode;
61 wait_queue_head_t wait_q;
63 struct msg_msg **messages;
66 struct sigevent notify;
67 struct pid* notify_owner;
68 struct user_struct *user; /* user who created, for accounting */
69 struct sock *notify_sock;
70 struct sk_buff *notify_cookie;
72 /* for tasks waiting for free space and messages, respectively */
73 struct ext_wait_queue e_wait_q[2];
75 unsigned long qsize; /* size of queue in memory (sum of all msgs) */
78 static const struct inode_operations mqueue_dir_inode_operations;
79 static const struct file_operations mqueue_file_operations;
80 static const struct super_operations mqueue_super_ops;
81 static void remove_notification(struct mqueue_inode_info *info);
83 static struct kmem_cache *mqueue_inode_cachep;
85 static struct ctl_table_header * mq_sysctl_table;
87 static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode)
89 return container_of(inode, struct mqueue_inode_info, vfs_inode);
93 * This routine should be called with the mq_lock held.
95 static inline struct ipc_namespace *__get_ns_from_inode(struct inode *inode)
97 return get_ipc_ns(inode->i_sb->s_fs_info);
100 static struct ipc_namespace *get_ns_from_inode(struct inode *inode)
102 struct ipc_namespace *ns;
105 ns = __get_ns_from_inode(inode);
106 spin_unlock(&mq_lock);
110 static struct inode *mqueue_get_inode(struct super_block *sb,
111 struct ipc_namespace *ipc_ns, int mode,
112 struct mq_attr *attr)
114 struct user_struct *u = current_user();
117 inode = new_inode(sb);
119 inode->i_mode = mode;
120 inode->i_uid = current_fsuid();
121 inode->i_gid = current_fsgid();
122 inode->i_mtime = inode->i_ctime = inode->i_atime =
126 struct mqueue_inode_info *info;
127 struct task_struct *p = current;
128 unsigned long mq_bytes, mq_msg_tblsz;
130 inode->i_fop = &mqueue_file_operations;
131 inode->i_size = FILENT_SIZE;
132 /* mqueue specific info */
133 info = MQUEUE_I(inode);
134 spin_lock_init(&info->lock);
135 init_waitqueue_head(&info->wait_q);
136 INIT_LIST_HEAD(&info->e_wait_q[0].list);
137 INIT_LIST_HEAD(&info->e_wait_q[1].list);
138 info->notify_owner = NULL;
140 info->user = NULL; /* set when all is ok */
141 memset(&info->attr, 0, sizeof(info->attr));
142 info->attr.mq_maxmsg = ipc_ns->mq_msg_max;
143 info->attr.mq_msgsize = ipc_ns->mq_msgsize_max;
145 info->attr.mq_maxmsg = attr->mq_maxmsg;
146 info->attr.mq_msgsize = attr->mq_msgsize;
148 mq_msg_tblsz = info->attr.mq_maxmsg * sizeof(struct msg_msg *);
149 info->messages = kmalloc(mq_msg_tblsz, GFP_KERNEL);
153 mq_bytes = (mq_msg_tblsz +
154 (info->attr.mq_maxmsg * info->attr.mq_msgsize));
157 if (u->mq_bytes + mq_bytes < u->mq_bytes ||
158 u->mq_bytes + mq_bytes >
159 task_rlimit(p, RLIMIT_MSGQUEUE)) {
160 spin_unlock(&mq_lock);
161 /* mqueue_delete_inode() releases info->messages */
164 u->mq_bytes += mq_bytes;
165 spin_unlock(&mq_lock);
168 info->user = get_uid(u);
169 } else if (S_ISDIR(mode)) {
171 /* Some things misbehave if size == 0 on a directory */
172 inode->i_size = 2 * DIRENT_SIZE;
173 inode->i_op = &mqueue_dir_inode_operations;
174 inode->i_fop = &simple_dir_operations;
183 static int mqueue_fill_super(struct super_block *sb, void *data, int silent)
186 struct ipc_namespace *ns = data;
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, ns, S_IFDIR | S_ISVTX | S_IRWXUGO,
201 sb->s_root = d_alloc_root(inode);
213 static int mqueue_get_sb(struct file_system_type *fs_type,
214 int flags, const char *dev_name,
215 void *data, struct vfsmount *mnt)
217 if (!(flags & MS_KERNMOUNT))
218 data = current->nsproxy->ipc_ns;
219 return get_sb_ns(fs_type, flags, data, mqueue_fill_super, mnt);
222 static void init_once(void *foo)
224 struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo;
226 inode_init_once(&p->vfs_inode);
229 static struct inode *mqueue_alloc_inode(struct super_block *sb)
231 struct mqueue_inode_info *ei;
233 ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL);
236 return &ei->vfs_inode;
239 static void mqueue_destroy_inode(struct inode *inode)
241 kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode));
244 static void mqueue_delete_inode(struct inode *inode)
246 struct mqueue_inode_info *info;
247 struct user_struct *user;
248 unsigned long mq_bytes;
250 struct ipc_namespace *ipc_ns;
252 if (S_ISDIR(inode->i_mode)) {
256 ipc_ns = get_ns_from_inode(inode);
257 info = MQUEUE_I(inode);
258 spin_lock(&info->lock);
259 for (i = 0; i < info->attr.mq_curmsgs; i++)
260 free_msg(info->messages[i]);
261 kfree(info->messages);
262 spin_unlock(&info->lock);
266 /* Total amount of bytes accounted for the mqueue */
267 mq_bytes = info->attr.mq_maxmsg * (sizeof(struct msg_msg *)
268 + info->attr.mq_msgsize);
272 user->mq_bytes -= mq_bytes;
274 * get_ns_from_inode() ensures that the
275 * (ipc_ns = sb->s_fs_info) is either a valid ipc_ns
276 * to which we now hold a reference, or it is NULL.
277 * We can't put it here under mq_lock, though.
280 ipc_ns->mq_queues_count--;
281 spin_unlock(&mq_lock);
288 static int mqueue_create(struct inode *dir, struct dentry *dentry,
289 int mode, struct nameidata *nd)
292 struct mq_attr *attr = dentry->d_fsdata;
294 struct ipc_namespace *ipc_ns;
297 ipc_ns = __get_ns_from_inode(dir);
302 if (ipc_ns->mq_queues_count >= ipc_ns->mq_queues_max &&
303 !capable(CAP_SYS_RESOURCE)) {
307 ipc_ns->mq_queues_count++;
308 spin_unlock(&mq_lock);
310 inode = mqueue_get_inode(dir->i_sb, ipc_ns, mode, attr);
314 ipc_ns->mq_queues_count--;
319 dir->i_size += DIRENT_SIZE;
320 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
322 d_instantiate(dentry, inode);
326 spin_unlock(&mq_lock);
332 static int mqueue_unlink(struct inode *dir, struct dentry *dentry)
334 struct inode *inode = dentry->d_inode;
336 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
337 dir->i_size -= DIRENT_SIZE;
344 * This is routine for system read from queue file.
345 * To avoid mess with doing here some sort of mq_receive we allow
346 * to read only queue size & notification info (the only values
347 * that are interesting from user point of view and aren't accessible
348 * through std routines)
350 static ssize_t mqueue_read_file(struct file *filp, char __user *u_data,
351 size_t count, loff_t *off)
353 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
354 char buffer[FILENT_SIZE];
357 spin_lock(&info->lock);
358 snprintf(buffer, sizeof(buffer),
359 "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
361 info->notify_owner ? info->notify.sigev_notify : 0,
362 (info->notify_owner &&
363 info->notify.sigev_notify == SIGEV_SIGNAL) ?
364 info->notify.sigev_signo : 0,
365 pid_vnr(info->notify_owner));
366 spin_unlock(&info->lock);
367 buffer[sizeof(buffer)-1] = '\0';
369 ret = simple_read_from_buffer(u_data, count, off, buffer,
374 filp->f_path.dentry->d_inode->i_atime = filp->f_path.dentry->d_inode->i_ctime = CURRENT_TIME;
378 static int mqueue_flush_file(struct file *filp, fl_owner_t id)
380 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
382 spin_lock(&info->lock);
383 if (task_tgid(current) == info->notify_owner)
384 remove_notification(info);
386 spin_unlock(&info->lock);
390 static unsigned int mqueue_poll_file(struct file *filp, struct poll_table_struct *poll_tab)
392 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
395 poll_wait(filp, &info->wait_q, poll_tab);
397 spin_lock(&info->lock);
398 if (info->attr.mq_curmsgs)
399 retval = POLLIN | POLLRDNORM;
401 if (info->attr.mq_curmsgs < info->attr.mq_maxmsg)
402 retval |= POLLOUT | POLLWRNORM;
403 spin_unlock(&info->lock);
408 /* Adds current to info->e_wait_q[sr] before element with smaller prio */
409 static void wq_add(struct mqueue_inode_info *info, int sr,
410 struct ext_wait_queue *ewp)
412 struct ext_wait_queue *walk;
416 list_for_each_entry(walk, &info->e_wait_q[sr].list, list) {
417 if (walk->task->static_prio <= current->static_prio) {
418 list_add_tail(&ewp->list, &walk->list);
422 list_add_tail(&ewp->list, &info->e_wait_q[sr].list);
426 * Puts current task to sleep. Caller must hold queue lock. After return
430 static int wq_sleep(struct mqueue_inode_info *info, int sr,
431 ktime_t *timeout, struct ext_wait_queue *ewp)
436 wq_add(info, sr, ewp);
439 set_current_state(TASK_INTERRUPTIBLE);
441 spin_unlock(&info->lock);
442 time = schedule_hrtimeout_range_clock(timeout,
443 HRTIMER_MODE_ABS, 0, CLOCK_REALTIME);
445 while (ewp->state == STATE_PENDING)
448 if (ewp->state == STATE_READY) {
452 spin_lock(&info->lock);
453 if (ewp->state == STATE_READY) {
457 if (signal_pending(current)) {
458 retval = -ERESTARTSYS;
466 list_del(&ewp->list);
468 spin_unlock(&info->lock);
474 * Returns waiting task that should be serviced first or NULL if none exists
476 static struct ext_wait_queue *wq_get_first_waiter(
477 struct mqueue_inode_info *info, int sr)
479 struct list_head *ptr;
481 ptr = info->e_wait_q[sr].list.prev;
482 if (ptr == &info->e_wait_q[sr].list)
484 return list_entry(ptr, struct ext_wait_queue, list);
487 /* Auxiliary functions to manipulate messages' list */
488 static void msg_insert(struct msg_msg *ptr, struct mqueue_inode_info *info)
492 k = info->attr.mq_curmsgs - 1;
493 while (k >= 0 && info->messages[k]->m_type >= ptr->m_type) {
494 info->messages[k + 1] = info->messages[k];
497 info->attr.mq_curmsgs++;
498 info->qsize += ptr->m_ts;
499 info->messages[k + 1] = ptr;
502 static inline struct msg_msg *msg_get(struct mqueue_inode_info *info)
504 info->qsize -= info->messages[--info->attr.mq_curmsgs]->m_ts;
505 return info->messages[info->attr.mq_curmsgs];
508 static inline void set_cookie(struct sk_buff *skb, char code)
510 ((char*)skb->data)[NOTIFY_COOKIE_LEN-1] = code;
514 * The next function is only to split too long sys_mq_timedsend
516 static void __do_notify(struct mqueue_inode_info *info)
519 * invoked when there is registered process and there isn't process
520 * waiting synchronously for message AND state of queue changed from
521 * empty to not empty. Here we are sure that no one is waiting
523 if (info->notify_owner &&
524 info->attr.mq_curmsgs == 1) {
525 struct siginfo sig_i;
526 switch (info->notify.sigev_notify) {
532 sig_i.si_signo = info->notify.sigev_signo;
534 sig_i.si_code = SI_MESGQ;
535 sig_i.si_value = info->notify.sigev_value;
536 sig_i.si_pid = task_tgid_nr_ns(current,
537 ns_of_pid(info->notify_owner));
538 sig_i.si_uid = current_uid();
540 kill_pid_info(info->notify.sigev_signo,
541 &sig_i, info->notify_owner);
544 set_cookie(info->notify_cookie, NOTIFY_WOKENUP);
545 netlink_sendskb(info->notify_sock, info->notify_cookie);
548 /* after notification unregisters process */
549 put_pid(info->notify_owner);
550 info->notify_owner = NULL;
552 wake_up(&info->wait_q);
555 static int prepare_timeout(const struct timespec __user *u_abs_timeout,
556 ktime_t *expires, struct timespec *ts)
558 if (copy_from_user(ts, u_abs_timeout, sizeof(struct timespec)))
560 if (!timespec_valid(ts))
563 *expires = timespec_to_ktime(*ts);
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);
574 put_pid(info->notify_owner);
575 info->notify_owner = NULL;
578 static int mq_attr_ok(struct ipc_namespace *ipc_ns, 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 > ipc_ns->mq_msg_max ||
587 attr->mq_msgsize > ipc_ns->mq_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 + 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 ipc_namespace *ipc_ns, struct dentry *dir,
604 struct dentry *dentry, int oflag, mode_t mode,
605 struct mq_attr *attr)
607 const struct cred *cred = current_cred();
612 if (!mq_attr_ok(ipc_ns, attr)) {
616 /* store for use during create */
617 dentry->d_fsdata = attr;
620 mode &= ~current_umask();
621 ret = mnt_want_write(ipc_ns->mq_mnt);
624 ret = vfs_create(dir->d_inode, dentry, mode, NULL);
625 dentry->d_fsdata = NULL;
629 result = dentry_open(dentry, ipc_ns->mq_mnt, oflag, cred);
631 * dentry_open() took a persistent mnt_want_write(),
632 * so we can now drop this one.
634 mnt_drop_write(ipc_ns->mq_mnt);
638 mnt_drop_write(ipc_ns->mq_mnt);
641 mntput(ipc_ns->mq_mnt);
645 /* Opens existing queue */
646 static struct file *do_open(struct ipc_namespace *ipc_ns,
647 struct dentry *dentry, int oflag)
650 const struct cred *cred = current_cred();
652 static const int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE,
653 MAY_READ | MAY_WRITE };
655 if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) {
660 if (inode_permission(dentry->d_inode, oflag2acc[oflag & O_ACCMODE])) {
665 return dentry_open(dentry, ipc_ns->mq_mnt, oflag, cred);
669 mntput(ipc_ns->mq_mnt);
673 SYSCALL_DEFINE4(mq_open, const char __user *, u_name, int, oflag, mode_t, mode,
674 struct mq_attr __user *, u_attr)
676 struct dentry *dentry;
681 struct ipc_namespace *ipc_ns = current->nsproxy->ipc_ns;
683 if (u_attr && copy_from_user(&attr, u_attr, sizeof(struct mq_attr)))
686 audit_mq_open(oflag, mode, u_attr ? &attr : NULL);
688 if (IS_ERR(name = getname(u_name)))
689 return PTR_ERR(name);
691 fd = get_unused_fd_flags(O_CLOEXEC);
695 mutex_lock(&ipc_ns->mq_mnt->mnt_root->d_inode->i_mutex);
696 dentry = lookup_one_len(name, ipc_ns->mq_mnt->mnt_root, strlen(name));
697 if (IS_ERR(dentry)) {
698 error = PTR_ERR(dentry);
701 mntget(ipc_ns->mq_mnt);
703 if (oflag & O_CREAT) {
704 if (dentry->d_inode) { /* entry already exists */
705 audit_inode(name, dentry);
706 if (oflag & O_EXCL) {
710 filp = do_open(ipc_ns, dentry, oflag);
712 filp = do_create(ipc_ns, ipc_ns->mq_mnt->mnt_root,
714 u_attr ? &attr : NULL);
717 if (!dentry->d_inode) {
721 audit_inode(name, dentry);
722 filp = do_open(ipc_ns, dentry, oflag);
726 error = PTR_ERR(filp);
730 fd_install(fd, filp);
735 mntput(ipc_ns->mq_mnt);
740 mutex_unlock(&ipc_ns->mq_mnt->mnt_root->d_inode->i_mutex);
746 SYSCALL_DEFINE1(mq_unlink, const char __user *, u_name)
750 struct dentry *dentry;
751 struct inode *inode = NULL;
752 struct ipc_namespace *ipc_ns = current->nsproxy->ipc_ns;
754 name = getname(u_name);
756 return PTR_ERR(name);
758 mutex_lock_nested(&ipc_ns->mq_mnt->mnt_root->d_inode->i_mutex,
760 dentry = lookup_one_len(name, ipc_ns->mq_mnt->mnt_root, strlen(name));
761 if (IS_ERR(dentry)) {
762 err = PTR_ERR(dentry);
766 if (!dentry->d_inode) {
771 inode = dentry->d_inode;
773 atomic_inc(&inode->i_count);
774 err = mnt_want_write(ipc_ns->mq_mnt);
777 err = vfs_unlink(dentry->d_parent->d_inode, dentry);
778 mnt_drop_write(ipc_ns->mq_mnt);
783 mutex_unlock(&ipc_ns->mq_mnt->mnt_root->d_inode->i_mutex);
791 /* Pipelined send and receive functions.
793 * If a receiver finds no waiting message, then it registers itself in the
794 * list of waiting receivers. A sender checks that list before adding the new
795 * message into the message array. If there is a waiting receiver, then it
796 * bypasses the message array and directly hands the message over to the
798 * The receiver accepts the message and returns without grabbing the queue
799 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
800 * are necessary. The same algorithm is used for sysv semaphores, see
801 * ipc/sem.c for more details.
803 * The same algorithm is used for senders.
806 /* pipelined_send() - send a message directly to the task waiting in
807 * sys_mq_timedreceive() (without inserting message into a queue).
809 static inline void pipelined_send(struct mqueue_inode_info *info,
810 struct msg_msg *message,
811 struct ext_wait_queue *receiver)
813 receiver->msg = message;
814 list_del(&receiver->list);
815 receiver->state = STATE_PENDING;
816 wake_up_process(receiver->task);
818 receiver->state = STATE_READY;
821 /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
822 * gets its message and put to the queue (we have one free place for sure). */
823 static inline void pipelined_receive(struct mqueue_inode_info *info)
825 struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND);
829 wake_up_interruptible(&info->wait_q);
832 msg_insert(sender->msg, info);
833 list_del(&sender->list);
834 sender->state = STATE_PENDING;
835 wake_up_process(sender->task);
837 sender->state = STATE_READY;
840 SYSCALL_DEFINE5(mq_timedsend, mqd_t, mqdes, const char __user *, u_msg_ptr,
841 size_t, msg_len, unsigned int, msg_prio,
842 const struct timespec __user *, u_abs_timeout)
846 struct ext_wait_queue wait;
847 struct ext_wait_queue *receiver;
848 struct msg_msg *msg_ptr;
849 struct mqueue_inode_info *info;
850 ktime_t expires, *timeout = NULL;
855 int res = prepare_timeout(u_abs_timeout, &expires, &ts);
861 if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX))
864 audit_mq_sendrecv(mqdes, msg_len, msg_prio, timeout ? &ts : NULL);
867 if (unlikely(!filp)) {
872 inode = filp->f_path.dentry->d_inode;
873 if (unlikely(filp->f_op != &mqueue_file_operations)) {
877 info = MQUEUE_I(inode);
878 audit_inode(NULL, filp->f_path.dentry);
880 if (unlikely(!(filp->f_mode & FMODE_WRITE))) {
885 if (unlikely(msg_len > info->attr.mq_msgsize)) {
890 /* First try to allocate memory, before doing anything with
891 * existing queues. */
892 msg_ptr = load_msg(u_msg_ptr, msg_len);
893 if (IS_ERR(msg_ptr)) {
894 ret = PTR_ERR(msg_ptr);
897 msg_ptr->m_ts = msg_len;
898 msg_ptr->m_type = msg_prio;
900 spin_lock(&info->lock);
902 if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) {
903 if (filp->f_flags & O_NONBLOCK) {
904 spin_unlock(&info->lock);
908 wait.msg = (void *) msg_ptr;
909 wait.state = STATE_NONE;
910 ret = wq_sleep(info, SEND, timeout, &wait);
915 receiver = wq_get_first_waiter(info, RECV);
917 pipelined_send(info, msg_ptr, receiver);
919 /* adds message to the queue */
920 msg_insert(msg_ptr, info);
923 inode->i_atime = inode->i_mtime = inode->i_ctime =
925 spin_unlock(&info->lock);
934 SYSCALL_DEFINE5(mq_timedreceive, mqd_t, mqdes, char __user *, u_msg_ptr,
935 size_t, msg_len, unsigned int __user *, u_msg_prio,
936 const struct timespec __user *, u_abs_timeout)
939 struct msg_msg *msg_ptr;
942 struct mqueue_inode_info *info;
943 struct ext_wait_queue wait;
944 ktime_t expires, *timeout = NULL;
948 int res = prepare_timeout(u_abs_timeout, &expires, &ts);
954 audit_mq_sendrecv(mqdes, msg_len, 0, timeout ? &ts : NULL);
957 if (unlikely(!filp)) {
962 inode = filp->f_path.dentry->d_inode;
963 if (unlikely(filp->f_op != &mqueue_file_operations)) {
967 info = MQUEUE_I(inode);
968 audit_inode(NULL, filp->f_path.dentry);
970 if (unlikely(!(filp->f_mode & FMODE_READ))) {
975 /* checks if buffer is big enough */
976 if (unlikely(msg_len < info->attr.mq_msgsize)) {
981 spin_lock(&info->lock);
982 if (info->attr.mq_curmsgs == 0) {
983 if (filp->f_flags & O_NONBLOCK) {
984 spin_unlock(&info->lock);
988 wait.state = STATE_NONE;
989 ret = wq_sleep(info, RECV, timeout, &wait);
993 msg_ptr = msg_get(info);
995 inode->i_atime = inode->i_mtime = inode->i_ctime =
998 /* There is now free space in queue. */
999 pipelined_receive(info);
1000 spin_unlock(&info->lock);
1004 ret = msg_ptr->m_ts;
1006 if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) ||
1007 store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) {
1019 * Notes: the case when user wants us to deregister (with NULL as pointer)
1020 * and he isn't currently owner of notification, will be silently discarded.
1021 * It isn't explicitly defined in the POSIX.
1023 SYSCALL_DEFINE2(mq_notify, mqd_t, mqdes,
1024 const struct sigevent __user *, u_notification)
1029 struct inode *inode;
1030 struct sigevent notification;
1031 struct mqueue_inode_info *info;
1034 if (u_notification) {
1035 if (copy_from_user(¬ification, u_notification,
1036 sizeof(struct sigevent)))
1040 audit_mq_notify(mqdes, u_notification ? ¬ification : NULL);
1044 if (u_notification != NULL) {
1045 if (unlikely(notification.sigev_notify != SIGEV_NONE &&
1046 notification.sigev_notify != SIGEV_SIGNAL &&
1047 notification.sigev_notify != SIGEV_THREAD))
1049 if (notification.sigev_notify == SIGEV_SIGNAL &&
1050 !valid_signal(notification.sigev_signo)) {
1053 if (notification.sigev_notify == SIGEV_THREAD) {
1056 /* create the notify skb */
1057 nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL);
1062 if (copy_from_user(nc->data,
1063 notification.sigev_value.sival_ptr,
1064 NOTIFY_COOKIE_LEN)) {
1069 /* TODO: add a header? */
1070 skb_put(nc, NOTIFY_COOKIE_LEN);
1071 /* and attach it to the socket */
1073 filp = fget(notification.sigev_signo);
1078 sock = netlink_getsockbyfilp(filp);
1081 ret = PTR_ERR(sock);
1086 timeo = MAX_SCHEDULE_TIMEOUT;
1087 ret = netlink_attachskb(sock, nc, &timeo, NULL);
1104 inode = filp->f_path.dentry->d_inode;
1105 if (unlikely(filp->f_op != &mqueue_file_operations)) {
1109 info = MQUEUE_I(inode);
1112 spin_lock(&info->lock);
1113 if (u_notification == NULL) {
1114 if (info->notify_owner == task_tgid(current)) {
1115 remove_notification(info);
1116 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1118 } else if (info->notify_owner != NULL) {
1121 switch (notification.sigev_notify) {
1123 info->notify.sigev_notify = SIGEV_NONE;
1126 info->notify_sock = sock;
1127 info->notify_cookie = nc;
1130 info->notify.sigev_notify = SIGEV_THREAD;
1133 info->notify.sigev_signo = notification.sigev_signo;
1134 info->notify.sigev_value = notification.sigev_value;
1135 info->notify.sigev_notify = SIGEV_SIGNAL;
1139 info->notify_owner = get_pid(task_tgid(current));
1140 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1142 spin_unlock(&info->lock);
1147 netlink_detachskb(sock, nc);
1154 SYSCALL_DEFINE3(mq_getsetattr, mqd_t, mqdes,
1155 const struct mq_attr __user *, u_mqstat,
1156 struct mq_attr __user *, u_omqstat)
1159 struct mq_attr mqstat, omqstat;
1161 struct inode *inode;
1162 struct mqueue_inode_info *info;
1164 if (u_mqstat != NULL) {
1165 if (copy_from_user(&mqstat, u_mqstat, sizeof(struct mq_attr)))
1167 if (mqstat.mq_flags & (~O_NONBLOCK))
1177 inode = filp->f_path.dentry->d_inode;
1178 if (unlikely(filp->f_op != &mqueue_file_operations)) {
1182 info = MQUEUE_I(inode);
1184 spin_lock(&info->lock);
1186 omqstat = info->attr;
1187 omqstat.mq_flags = filp->f_flags & O_NONBLOCK;
1189 audit_mq_getsetattr(mqdes, &mqstat);
1190 spin_lock(&filp->f_lock);
1191 if (mqstat.mq_flags & O_NONBLOCK)
1192 filp->f_flags |= O_NONBLOCK;
1194 filp->f_flags &= ~O_NONBLOCK;
1195 spin_unlock(&filp->f_lock);
1197 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1200 spin_unlock(&info->lock);
1203 if (u_omqstat != NULL && copy_to_user(u_omqstat, &omqstat,
1204 sizeof(struct mq_attr)))
1213 static const struct inode_operations mqueue_dir_inode_operations = {
1214 .lookup = simple_lookup,
1215 .create = mqueue_create,
1216 .unlink = mqueue_unlink,
1219 static const struct file_operations mqueue_file_operations = {
1220 .flush = mqueue_flush_file,
1221 .poll = mqueue_poll_file,
1222 .read = mqueue_read_file,
1225 static const struct super_operations mqueue_super_ops = {
1226 .alloc_inode = mqueue_alloc_inode,
1227 .destroy_inode = mqueue_destroy_inode,
1228 .statfs = simple_statfs,
1229 .delete_inode = mqueue_delete_inode,
1230 .drop_inode = generic_delete_inode,
1233 static struct file_system_type mqueue_fs_type = {
1235 .get_sb = mqueue_get_sb,
1236 .kill_sb = kill_litter_super,
1239 int mq_init_ns(struct ipc_namespace *ns)
1241 ns->mq_queues_count = 0;
1242 ns->mq_queues_max = DFLT_QUEUESMAX;
1243 ns->mq_msg_max = DFLT_MSGMAX;
1244 ns->mq_msgsize_max = DFLT_MSGSIZEMAX;
1246 ns->mq_mnt = kern_mount_data(&mqueue_fs_type, ns);
1247 if (IS_ERR(ns->mq_mnt)) {
1248 int err = PTR_ERR(ns->mq_mnt);
1255 void mq_clear_sbinfo(struct ipc_namespace *ns)
1257 ns->mq_mnt->mnt_sb->s_fs_info = NULL;
1260 void mq_put_mnt(struct ipc_namespace *ns)
1265 static int __init init_mqueue_fs(void)
1269 mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache",
1270 sizeof(struct mqueue_inode_info), 0,
1271 SLAB_HWCACHE_ALIGN, init_once);
1272 if (mqueue_inode_cachep == NULL)
1275 /* ignore failures - they are not fatal */
1276 mq_sysctl_table = mq_register_sysctl_table();
1278 error = register_filesystem(&mqueue_fs_type);
1282 spin_lock_init(&mq_lock);
1284 init_ipc_ns.mq_mnt = kern_mount_data(&mqueue_fs_type, &init_ipc_ns);
1285 if (IS_ERR(init_ipc_ns.mq_mnt)) {
1286 error = PTR_ERR(init_ipc_ns.mq_mnt);
1287 goto out_filesystem;
1293 unregister_filesystem(&mqueue_fs_type);
1295 if (mq_sysctl_table)
1296 unregister_sysctl_table(mq_sysctl_table);
1297 kmem_cache_destroy(mqueue_inode_cachep);
1301 __initcall(init_mqueue_fs);