Code clean-up for include/asm-arm/arch-omap/omap-alsa.h
[linux-ginger.git] / ipc / mqueue.c
blob94fd3b08fb77036d35ecd1a337785f1847fe1613
1 /*
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>
35 #include <net/sock.h>
36 #include "util.h"
38 #define MQUEUE_MAGIC 0x19800202
39 #define DIRENT_SIZE 20
40 #define FILENT_SIZE 80
42 #define SEND 0
43 #define RECV 1
45 #define STATE_NONE 0
46 #define STATE_PENDING 1
47 #define STATE_READY 2
49 /* default values */
50 #define DFLT_QUEUESMAX 256 /* max number of message queues */
51 #define DFLT_MSGMAX 10 /* max number of messages in each queue */
52 #define HARD_MSGMAX (131072/sizeof(void*))
53 #define DFLT_MSGSIZEMAX 8192 /* max message size */
56 struct ext_wait_queue { /* queue of sleeping tasks */
57 struct task_struct *task;
58 struct list_head list;
59 struct msg_msg *msg; /* ptr of loaded message */
60 int state; /* one of STATE_* values */
63 struct mqueue_inode_info {
64 spinlock_t lock;
65 struct inode vfs_inode;
66 wait_queue_head_t wait_q;
68 struct msg_msg **messages;
69 struct mq_attr attr;
71 struct sigevent notify;
72 struct pid* notify_owner;
73 struct user_struct *user; /* user who created, for accounting */
74 struct sock *notify_sock;
75 struct sk_buff *notify_cookie;
77 /* for tasks waiting for free space and messages, respectively */
78 struct ext_wait_queue e_wait_q[2];
80 unsigned long qsize; /* size of queue in memory (sum of all msgs) */
83 static const struct inode_operations mqueue_dir_inode_operations;
84 static const struct file_operations mqueue_file_operations;
85 static struct super_operations mqueue_super_ops;
86 static void remove_notification(struct mqueue_inode_info *info);
88 static spinlock_t mq_lock;
89 static struct kmem_cache *mqueue_inode_cachep;
90 static struct vfsmount *mqueue_mnt;
92 static unsigned int queues_count;
93 static unsigned int queues_max = DFLT_QUEUESMAX;
94 static unsigned int msg_max = DFLT_MSGMAX;
95 static unsigned int msgsize_max = DFLT_MSGSIZEMAX;
97 static struct ctl_table_header * mq_sysctl_table;
99 static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode)
101 return container_of(inode, struct mqueue_inode_info, vfs_inode);
104 static struct inode *mqueue_get_inode(struct super_block *sb, int mode,
105 struct mq_attr *attr)
107 struct inode *inode;
109 inode = new_inode(sb);
110 if (inode) {
111 inode->i_mode = mode;
112 inode->i_uid = current->fsuid;
113 inode->i_gid = current->fsgid;
114 inode->i_blocks = 0;
115 inode->i_mtime = inode->i_ctime = inode->i_atime =
116 CURRENT_TIME;
118 if (S_ISREG(mode)) {
119 struct mqueue_inode_info *info;
120 struct task_struct *p = current;
121 struct user_struct *u = p->user;
122 unsigned long mq_bytes, mq_msg_tblsz;
124 inode->i_fop = &mqueue_file_operations;
125 inode->i_size = FILENT_SIZE;
126 /* mqueue specific info */
127 info = MQUEUE_I(inode);
128 spin_lock_init(&info->lock);
129 init_waitqueue_head(&info->wait_q);
130 INIT_LIST_HEAD(&info->e_wait_q[0].list);
131 INIT_LIST_HEAD(&info->e_wait_q[1].list);
132 info->messages = NULL;
133 info->notify_owner = NULL;
134 info->qsize = 0;
135 info->user = NULL; /* set when all is ok */
136 memset(&info->attr, 0, sizeof(info->attr));
137 info->attr.mq_maxmsg = DFLT_MSGMAX;
138 info->attr.mq_msgsize = DFLT_MSGSIZEMAX;
139 if (attr) {
140 info->attr.mq_maxmsg = attr->mq_maxmsg;
141 info->attr.mq_msgsize = attr->mq_msgsize;
143 mq_msg_tblsz = info->attr.mq_maxmsg * sizeof(struct msg_msg *);
144 mq_bytes = (mq_msg_tblsz +
145 (info->attr.mq_maxmsg * info->attr.mq_msgsize));
147 spin_lock(&mq_lock);
148 if (u->mq_bytes + mq_bytes < u->mq_bytes ||
149 u->mq_bytes + mq_bytes >
150 p->signal->rlim[RLIMIT_MSGQUEUE].rlim_cur) {
151 spin_unlock(&mq_lock);
152 goto out_inode;
154 u->mq_bytes += mq_bytes;
155 spin_unlock(&mq_lock);
157 info->messages = kmalloc(mq_msg_tblsz, GFP_KERNEL);
158 if (!info->messages) {
159 spin_lock(&mq_lock);
160 u->mq_bytes -= mq_bytes;
161 spin_unlock(&mq_lock);
162 goto out_inode;
164 /* all is ok */
165 info->user = get_uid(u);
166 } else if (S_ISDIR(mode)) {
167 inc_nlink(inode);
168 /* Some things misbehave if size == 0 on a directory */
169 inode->i_size = 2 * DIRENT_SIZE;
170 inode->i_op = &mqueue_dir_inode_operations;
171 inode->i_fop = &simple_dir_operations;
174 return inode;
175 out_inode:
176 make_bad_inode(inode);
177 iput(inode);
178 return NULL;
181 static int mqueue_fill_super(struct super_block *sb, void *data, int silent)
183 struct inode *inode;
185 sb->s_blocksize = PAGE_CACHE_SIZE;
186 sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
187 sb->s_magic = MQUEUE_MAGIC;
188 sb->s_op = &mqueue_super_ops;
190 inode = mqueue_get_inode(sb, S_IFDIR | S_ISVTX | S_IRWXUGO, NULL);
191 if (!inode)
192 return -ENOMEM;
194 sb->s_root = d_alloc_root(inode);
195 if (!sb->s_root) {
196 iput(inode);
197 return -ENOMEM;
200 return 0;
203 static int mqueue_get_sb(struct file_system_type *fs_type,
204 int flags, const char *dev_name,
205 void *data, struct vfsmount *mnt)
207 return get_sb_single(fs_type, flags, data, mqueue_fill_super, mnt);
210 static void init_once(struct kmem_cache *cachep, void *foo)
212 struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo;
214 inode_init_once(&p->vfs_inode);
217 static struct inode *mqueue_alloc_inode(struct super_block *sb)
219 struct mqueue_inode_info *ei;
221 ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL);
222 if (!ei)
223 return NULL;
224 return &ei->vfs_inode;
227 static void mqueue_destroy_inode(struct inode *inode)
229 kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode));
232 static void mqueue_delete_inode(struct inode *inode)
234 struct mqueue_inode_info *info;
235 struct user_struct *user;
236 unsigned long mq_bytes;
237 int i;
239 if (S_ISDIR(inode->i_mode)) {
240 clear_inode(inode);
241 return;
243 info = MQUEUE_I(inode);
244 spin_lock(&info->lock);
245 for (i = 0; i < info->attr.mq_curmsgs; i++)
246 free_msg(info->messages[i]);
247 kfree(info->messages);
248 spin_unlock(&info->lock);
250 clear_inode(inode);
252 mq_bytes = (info->attr.mq_maxmsg * sizeof(struct msg_msg *) +
253 (info->attr.mq_maxmsg * info->attr.mq_msgsize));
254 user = info->user;
255 if (user) {
256 spin_lock(&mq_lock);
257 user->mq_bytes -= mq_bytes;
258 queues_count--;
259 spin_unlock(&mq_lock);
260 free_uid(user);
264 static int mqueue_create(struct inode *dir, struct dentry *dentry,
265 int mode, struct nameidata *nd)
267 struct inode *inode;
268 struct mq_attr *attr = dentry->d_fsdata;
269 int error;
271 spin_lock(&mq_lock);
272 if (queues_count >= queues_max && !capable(CAP_SYS_RESOURCE)) {
273 error = -ENOSPC;
274 goto out_lock;
276 queues_count++;
277 spin_unlock(&mq_lock);
279 inode = mqueue_get_inode(dir->i_sb, mode, attr);
280 if (!inode) {
281 error = -ENOMEM;
282 spin_lock(&mq_lock);
283 queues_count--;
284 goto out_lock;
287 dir->i_size += DIRENT_SIZE;
288 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
290 d_instantiate(dentry, inode);
291 dget(dentry);
292 return 0;
293 out_lock:
294 spin_unlock(&mq_lock);
295 return error;
298 static int mqueue_unlink(struct inode *dir, struct dentry *dentry)
300 struct inode *inode = dentry->d_inode;
302 dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
303 dir->i_size -= DIRENT_SIZE;
304 drop_nlink(inode);
305 dput(dentry);
306 return 0;
310 * This is routine for system read from queue file.
311 * To avoid mess with doing here some sort of mq_receive we allow
312 * to read only queue size & notification info (the only values
313 * that are interesting from user point of view and aren't accessible
314 * through std routines)
316 static ssize_t mqueue_read_file(struct file *filp, char __user *u_data,
317 size_t count, loff_t * off)
319 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
320 char buffer[FILENT_SIZE];
321 size_t slen;
322 loff_t o;
324 if (!count)
325 return 0;
327 spin_lock(&info->lock);
328 snprintf(buffer, sizeof(buffer),
329 "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
330 info->qsize,
331 info->notify_owner ? info->notify.sigev_notify : 0,
332 (info->notify_owner &&
333 info->notify.sigev_notify == SIGEV_SIGNAL) ?
334 info->notify.sigev_signo : 0,
335 pid_vnr(info->notify_owner));
336 spin_unlock(&info->lock);
337 buffer[sizeof(buffer)-1] = '\0';
338 slen = strlen(buffer)+1;
340 o = *off;
341 if (o > slen)
342 return 0;
344 if (o + count > slen)
345 count = slen - o;
347 if (copy_to_user(u_data, buffer + o, count))
348 return -EFAULT;
350 *off = o + count;
351 filp->f_path.dentry->d_inode->i_atime = filp->f_path.dentry->d_inode->i_ctime = CURRENT_TIME;
352 return count;
355 static int mqueue_flush_file(struct file *filp, fl_owner_t id)
357 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
359 spin_lock(&info->lock);
360 if (task_tgid(current) == info->notify_owner)
361 remove_notification(info);
363 spin_unlock(&info->lock);
364 return 0;
367 static unsigned int mqueue_poll_file(struct file *filp, struct poll_table_struct *poll_tab)
369 struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
370 int retval = 0;
372 poll_wait(filp, &info->wait_q, poll_tab);
374 spin_lock(&info->lock);
375 if (info->attr.mq_curmsgs)
376 retval = POLLIN | POLLRDNORM;
378 if (info->attr.mq_curmsgs < info->attr.mq_maxmsg)
379 retval |= POLLOUT | POLLWRNORM;
380 spin_unlock(&info->lock);
382 return retval;
385 /* Adds current to info->e_wait_q[sr] before element with smaller prio */
386 static void wq_add(struct mqueue_inode_info *info, int sr,
387 struct ext_wait_queue *ewp)
389 struct ext_wait_queue *walk;
391 ewp->task = current;
393 list_for_each_entry(walk, &info->e_wait_q[sr].list, list) {
394 if (walk->task->static_prio <= current->static_prio) {
395 list_add_tail(&ewp->list, &walk->list);
396 return;
399 list_add_tail(&ewp->list, &info->e_wait_q[sr].list);
403 * Puts current task to sleep. Caller must hold queue lock. After return
404 * lock isn't held.
405 * sr: SEND or RECV
407 static int wq_sleep(struct mqueue_inode_info *info, int sr,
408 long timeout, struct ext_wait_queue *ewp)
410 int retval;
411 signed long time;
413 wq_add(info, sr, ewp);
415 for (;;) {
416 set_current_state(TASK_INTERRUPTIBLE);
418 spin_unlock(&info->lock);
419 time = schedule_timeout(timeout);
421 while (ewp->state == STATE_PENDING)
422 cpu_relax();
424 if (ewp->state == STATE_READY) {
425 retval = 0;
426 goto out;
428 spin_lock(&info->lock);
429 if (ewp->state == STATE_READY) {
430 retval = 0;
431 goto out_unlock;
433 if (signal_pending(current)) {
434 retval = -ERESTARTSYS;
435 break;
437 if (time == 0) {
438 retval = -ETIMEDOUT;
439 break;
442 list_del(&ewp->list);
443 out_unlock:
444 spin_unlock(&info->lock);
445 out:
446 return retval;
450 * Returns waiting task that should be serviced first or NULL if none exists
452 static struct ext_wait_queue *wq_get_first_waiter(
453 struct mqueue_inode_info *info, int sr)
455 struct list_head *ptr;
457 ptr = info->e_wait_q[sr].list.prev;
458 if (ptr == &info->e_wait_q[sr].list)
459 return NULL;
460 return list_entry(ptr, struct ext_wait_queue, list);
463 /* Auxiliary functions to manipulate messages' list */
464 static void msg_insert(struct msg_msg *ptr, struct mqueue_inode_info *info)
466 int k;
468 k = info->attr.mq_curmsgs - 1;
469 while (k >= 0 && info->messages[k]->m_type >= ptr->m_type) {
470 info->messages[k + 1] = info->messages[k];
471 k--;
473 info->attr.mq_curmsgs++;
474 info->qsize += ptr->m_ts;
475 info->messages[k + 1] = ptr;
478 static inline struct msg_msg *msg_get(struct mqueue_inode_info *info)
480 info->qsize -= info->messages[--info->attr.mq_curmsgs]->m_ts;
481 return info->messages[info->attr.mq_curmsgs];
484 static inline void set_cookie(struct sk_buff *skb, char code)
486 ((char*)skb->data)[NOTIFY_COOKIE_LEN-1] = code;
490 * The next function is only to split too long sys_mq_timedsend
492 static void __do_notify(struct mqueue_inode_info *info)
494 /* notification
495 * invoked when there is registered process and there isn't process
496 * waiting synchronously for message AND state of queue changed from
497 * empty to not empty. Here we are sure that no one is waiting
498 * synchronously. */
499 if (info->notify_owner &&
500 info->attr.mq_curmsgs == 1) {
501 struct siginfo sig_i;
502 switch (info->notify.sigev_notify) {
503 case SIGEV_NONE:
504 break;
505 case SIGEV_SIGNAL:
506 /* sends signal */
508 sig_i.si_signo = info->notify.sigev_signo;
509 sig_i.si_errno = 0;
510 sig_i.si_code = SI_MESGQ;
511 sig_i.si_value = info->notify.sigev_value;
512 sig_i.si_pid = task_tgid_vnr(current);
513 sig_i.si_uid = current->uid;
515 kill_pid_info(info->notify.sigev_signo,
516 &sig_i, info->notify_owner);
517 break;
518 case SIGEV_THREAD:
519 set_cookie(info->notify_cookie, NOTIFY_WOKENUP);
520 netlink_sendskb(info->notify_sock, info->notify_cookie);
521 break;
523 /* after notification unregisters process */
524 put_pid(info->notify_owner);
525 info->notify_owner = NULL;
527 wake_up(&info->wait_q);
530 static long prepare_timeout(const struct timespec __user *u_arg)
532 struct timespec ts, nowts;
533 long timeout;
535 if (u_arg) {
536 if (unlikely(copy_from_user(&ts, u_arg,
537 sizeof(struct timespec))))
538 return -EFAULT;
540 if (unlikely(ts.tv_nsec < 0 || ts.tv_sec < 0
541 || ts.tv_nsec >= NSEC_PER_SEC))
542 return -EINVAL;
543 nowts = CURRENT_TIME;
544 /* first subtract as jiffies can't be too big */
545 ts.tv_sec -= nowts.tv_sec;
546 if (ts.tv_nsec < nowts.tv_nsec) {
547 ts.tv_nsec += NSEC_PER_SEC;
548 ts.tv_sec--;
550 ts.tv_nsec -= nowts.tv_nsec;
551 if (ts.tv_sec < 0)
552 return 0;
554 timeout = timespec_to_jiffies(&ts) + 1;
555 } else
556 return MAX_SCHEDULE_TIMEOUT;
558 return timeout;
561 static void remove_notification(struct mqueue_inode_info *info)
563 if (info->notify_owner != NULL &&
564 info->notify.sigev_notify == SIGEV_THREAD) {
565 set_cookie(info->notify_cookie, NOTIFY_REMOVED);
566 netlink_sendskb(info->notify_sock, info->notify_cookie);
568 put_pid(info->notify_owner);
569 info->notify_owner = NULL;
572 static int mq_attr_ok(struct mq_attr *attr)
574 if (attr->mq_maxmsg <= 0 || attr->mq_msgsize <= 0)
575 return 0;
576 if (capable(CAP_SYS_RESOURCE)) {
577 if (attr->mq_maxmsg > HARD_MSGMAX)
578 return 0;
579 } else {
580 if (attr->mq_maxmsg > msg_max ||
581 attr->mq_msgsize > msgsize_max)
582 return 0;
584 /* check for overflow */
585 if (attr->mq_msgsize > ULONG_MAX/attr->mq_maxmsg)
586 return 0;
587 if ((unsigned long)(attr->mq_maxmsg * attr->mq_msgsize) +
588 (attr->mq_maxmsg * sizeof (struct msg_msg *)) <
589 (unsigned long)(attr->mq_maxmsg * attr->mq_msgsize))
590 return 0;
591 return 1;
595 * Invoked when creating a new queue via sys_mq_open
597 static struct file *do_create(struct dentry *dir, struct dentry *dentry,
598 int oflag, mode_t mode, struct mq_attr __user *u_attr)
600 struct mq_attr attr;
601 struct file *result;
602 int ret;
604 if (u_attr) {
605 ret = -EFAULT;
606 if (copy_from_user(&attr, u_attr, sizeof(attr)))
607 goto out;
608 ret = -EINVAL;
609 if (!mq_attr_ok(&attr))
610 goto out;
611 /* store for use during create */
612 dentry->d_fsdata = &attr;
615 mode &= ~current->fs->umask;
616 ret = mnt_want_write(mqueue_mnt);
617 if (ret)
618 goto out;
619 ret = vfs_create(dir->d_inode, dentry, mode, NULL);
620 dentry->d_fsdata = NULL;
621 if (ret)
622 goto out_drop_write;
624 result = dentry_open(dentry, mqueue_mnt, oflag);
626 * dentry_open() took a persistent mnt_want_write(),
627 * so we can now drop this one.
629 mnt_drop_write(mqueue_mnt);
630 return result;
632 out_drop_write:
633 mnt_drop_write(mqueue_mnt);
634 out:
635 dput(dentry);
636 mntput(mqueue_mnt);
637 return ERR_PTR(ret);
640 /* Opens existing queue */
641 static struct file *do_open(struct dentry *dentry, int oflag)
643 static int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE,
644 MAY_READ | MAY_WRITE };
646 if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) {
647 dput(dentry);
648 mntput(mqueue_mnt);
649 return ERR_PTR(-EINVAL);
652 if (permission(dentry->d_inode, oflag2acc[oflag & O_ACCMODE], NULL)) {
653 dput(dentry);
654 mntput(mqueue_mnt);
655 return ERR_PTR(-EACCES);
658 return dentry_open(dentry, mqueue_mnt, oflag);
661 asmlinkage long sys_mq_open(const char __user *u_name, int oflag, mode_t mode,
662 struct mq_attr __user *u_attr)
664 struct dentry *dentry;
665 struct file *filp;
666 char *name;
667 int fd, error;
669 error = audit_mq_open(oflag, mode, u_attr);
670 if (error != 0)
671 return error;
673 if (IS_ERR(name = getname(u_name)))
674 return PTR_ERR(name);
676 fd = get_unused_fd();
677 if (fd < 0)
678 goto out_putname;
680 mutex_lock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
681 dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
682 if (IS_ERR(dentry)) {
683 error = PTR_ERR(dentry);
684 goto out_err;
686 mntget(mqueue_mnt);
688 if (oflag & O_CREAT) {
689 if (dentry->d_inode) { /* entry already exists */
690 audit_inode(name, dentry);
691 error = -EEXIST;
692 if (oflag & O_EXCL)
693 goto out;
694 filp = do_open(dentry, oflag);
695 } else {
696 filp = do_create(mqueue_mnt->mnt_root, dentry,
697 oflag, mode, u_attr);
699 } else {
700 error = -ENOENT;
701 if (!dentry->d_inode)
702 goto out;
703 audit_inode(name, dentry);
704 filp = do_open(dentry, oflag);
707 if (IS_ERR(filp)) {
708 error = PTR_ERR(filp);
709 goto out_putfd;
712 set_close_on_exec(fd, 1);
713 fd_install(fd, filp);
714 goto out_upsem;
716 out:
717 dput(dentry);
718 mntput(mqueue_mnt);
719 out_putfd:
720 put_unused_fd(fd);
721 out_err:
722 fd = error;
723 out_upsem:
724 mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
725 out_putname:
726 putname(name);
727 return fd;
730 asmlinkage long sys_mq_unlink(const char __user *u_name)
732 int err;
733 char *name;
734 struct dentry *dentry;
735 struct inode *inode = NULL;
737 name = getname(u_name);
738 if (IS_ERR(name))
739 return PTR_ERR(name);
741 mutex_lock_nested(&mqueue_mnt->mnt_root->d_inode->i_mutex,
742 I_MUTEX_PARENT);
743 dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
744 if (IS_ERR(dentry)) {
745 err = PTR_ERR(dentry);
746 goto out_unlock;
749 if (!dentry->d_inode) {
750 err = -ENOENT;
751 goto out_err;
754 inode = dentry->d_inode;
755 if (inode)
756 atomic_inc(&inode->i_count);
757 err = mnt_want_write(mqueue_mnt);
758 if (err)
759 goto out_err;
760 err = vfs_unlink(dentry->d_parent->d_inode, dentry);
761 mnt_drop_write(mqueue_mnt);
762 out_err:
763 dput(dentry);
765 out_unlock:
766 mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
767 putname(name);
768 if (inode)
769 iput(inode);
771 return err;
774 /* Pipelined send and receive functions.
776 * If a receiver finds no waiting message, then it registers itself in the
777 * list of waiting receivers. A sender checks that list before adding the new
778 * message into the message array. If there is a waiting receiver, then it
779 * bypasses the message array and directly hands the message over to the
780 * receiver.
781 * The receiver accepts the message and returns without grabbing the queue
782 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
783 * are necessary. The same algorithm is used for sysv semaphores, see
784 * ipc/sem.c for more details.
786 * The same algorithm is used for senders.
789 /* pipelined_send() - send a message directly to the task waiting in
790 * sys_mq_timedreceive() (without inserting message into a queue).
792 static inline void pipelined_send(struct mqueue_inode_info *info,
793 struct msg_msg *message,
794 struct ext_wait_queue *receiver)
796 receiver->msg = message;
797 list_del(&receiver->list);
798 receiver->state = STATE_PENDING;
799 wake_up_process(receiver->task);
800 smp_wmb();
801 receiver->state = STATE_READY;
804 /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
805 * gets its message and put to the queue (we have one free place for sure). */
806 static inline void pipelined_receive(struct mqueue_inode_info *info)
808 struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND);
810 if (!sender) {
811 /* for poll */
812 wake_up_interruptible(&info->wait_q);
813 return;
815 msg_insert(sender->msg, info);
816 list_del(&sender->list);
817 sender->state = STATE_PENDING;
818 wake_up_process(sender->task);
819 smp_wmb();
820 sender->state = STATE_READY;
823 asmlinkage long sys_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr,
824 size_t msg_len, unsigned int msg_prio,
825 const struct timespec __user *u_abs_timeout)
827 struct file *filp;
828 struct inode *inode;
829 struct ext_wait_queue wait;
830 struct ext_wait_queue *receiver;
831 struct msg_msg *msg_ptr;
832 struct mqueue_inode_info *info;
833 long timeout;
834 int ret;
836 ret = audit_mq_timedsend(mqdes, msg_len, msg_prio, u_abs_timeout);
837 if (ret != 0)
838 return ret;
840 if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX))
841 return -EINVAL;
843 timeout = prepare_timeout(u_abs_timeout);
845 ret = -EBADF;
846 filp = fget(mqdes);
847 if (unlikely(!filp))
848 goto out;
850 inode = filp->f_path.dentry->d_inode;
851 if (unlikely(filp->f_op != &mqueue_file_operations))
852 goto out_fput;
853 info = MQUEUE_I(inode);
854 audit_inode(NULL, filp->f_path.dentry);
856 if (unlikely(!(filp->f_mode & FMODE_WRITE)))
857 goto out_fput;
859 if (unlikely(msg_len > info->attr.mq_msgsize)) {
860 ret = -EMSGSIZE;
861 goto out_fput;
864 /* First try to allocate memory, before doing anything with
865 * existing queues. */
866 msg_ptr = load_msg(u_msg_ptr, msg_len);
867 if (IS_ERR(msg_ptr)) {
868 ret = PTR_ERR(msg_ptr);
869 goto out_fput;
871 msg_ptr->m_ts = msg_len;
872 msg_ptr->m_type = msg_prio;
874 spin_lock(&info->lock);
876 if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) {
877 if (filp->f_flags & O_NONBLOCK) {
878 spin_unlock(&info->lock);
879 ret = -EAGAIN;
880 } else if (unlikely(timeout < 0)) {
881 spin_unlock(&info->lock);
882 ret = timeout;
883 } else {
884 wait.task = current;
885 wait.msg = (void *) msg_ptr;
886 wait.state = STATE_NONE;
887 ret = wq_sleep(info, SEND, timeout, &wait);
889 if (ret < 0)
890 free_msg(msg_ptr);
891 } else {
892 receiver = wq_get_first_waiter(info, RECV);
893 if (receiver) {
894 pipelined_send(info, msg_ptr, receiver);
895 } else {
896 /* adds message to the queue */
897 msg_insert(msg_ptr, info);
898 __do_notify(info);
900 inode->i_atime = inode->i_mtime = inode->i_ctime =
901 CURRENT_TIME;
902 spin_unlock(&info->lock);
903 ret = 0;
905 out_fput:
906 fput(filp);
907 out:
908 return ret;
911 asmlinkage ssize_t sys_mq_timedreceive(mqd_t mqdes, char __user *u_msg_ptr,
912 size_t msg_len, unsigned int __user *u_msg_prio,
913 const struct timespec __user *u_abs_timeout)
915 long timeout;
916 ssize_t ret;
917 struct msg_msg *msg_ptr;
918 struct file *filp;
919 struct inode *inode;
920 struct mqueue_inode_info *info;
921 struct ext_wait_queue wait;
923 ret = audit_mq_timedreceive(mqdes, msg_len, u_msg_prio, u_abs_timeout);
924 if (ret != 0)
925 return ret;
927 timeout = prepare_timeout(u_abs_timeout);
929 ret = -EBADF;
930 filp = fget(mqdes);
931 if (unlikely(!filp))
932 goto out;
934 inode = filp->f_path.dentry->d_inode;
935 if (unlikely(filp->f_op != &mqueue_file_operations))
936 goto out_fput;
937 info = MQUEUE_I(inode);
938 audit_inode(NULL, filp->f_path.dentry);
940 if (unlikely(!(filp->f_mode & FMODE_READ)))
941 goto out_fput;
943 /* checks if buffer is big enough */
944 if (unlikely(msg_len < info->attr.mq_msgsize)) {
945 ret = -EMSGSIZE;
946 goto out_fput;
949 spin_lock(&info->lock);
950 if (info->attr.mq_curmsgs == 0) {
951 if (filp->f_flags & O_NONBLOCK) {
952 spin_unlock(&info->lock);
953 ret = -EAGAIN;
954 msg_ptr = NULL;
955 } else if (unlikely(timeout < 0)) {
956 spin_unlock(&info->lock);
957 ret = timeout;
958 msg_ptr = NULL;
959 } else {
960 wait.task = current;
961 wait.state = STATE_NONE;
962 ret = wq_sleep(info, RECV, timeout, &wait);
963 msg_ptr = wait.msg;
965 } else {
966 msg_ptr = msg_get(info);
968 inode->i_atime = inode->i_mtime = inode->i_ctime =
969 CURRENT_TIME;
971 /* There is now free space in queue. */
972 pipelined_receive(info);
973 spin_unlock(&info->lock);
974 ret = 0;
976 if (ret == 0) {
977 ret = msg_ptr->m_ts;
979 if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) ||
980 store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) {
981 ret = -EFAULT;
983 free_msg(msg_ptr);
985 out_fput:
986 fput(filp);
987 out:
988 return ret;
992 * Notes: the case when user wants us to deregister (with NULL as pointer)
993 * and he isn't currently owner of notification, will be silently discarded.
994 * It isn't explicitly defined in the POSIX.
996 asmlinkage long sys_mq_notify(mqd_t mqdes,
997 const struct sigevent __user *u_notification)
999 int ret;
1000 struct file *filp;
1001 struct sock *sock;
1002 struct inode *inode;
1003 struct sigevent notification;
1004 struct mqueue_inode_info *info;
1005 struct sk_buff *nc;
1007 ret = audit_mq_notify(mqdes, u_notification);
1008 if (ret != 0)
1009 return ret;
1011 nc = NULL;
1012 sock = NULL;
1013 if (u_notification != NULL) {
1014 if (copy_from_user(&notification, u_notification,
1015 sizeof(struct sigevent)))
1016 return -EFAULT;
1018 if (unlikely(notification.sigev_notify != SIGEV_NONE &&
1019 notification.sigev_notify != SIGEV_SIGNAL &&
1020 notification.sigev_notify != SIGEV_THREAD))
1021 return -EINVAL;
1022 if (notification.sigev_notify == SIGEV_SIGNAL &&
1023 !valid_signal(notification.sigev_signo)) {
1024 return -EINVAL;
1026 if (notification.sigev_notify == SIGEV_THREAD) {
1027 long timeo;
1029 /* create the notify skb */
1030 nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL);
1031 ret = -ENOMEM;
1032 if (!nc)
1033 goto out;
1034 ret = -EFAULT;
1035 if (copy_from_user(nc->data,
1036 notification.sigev_value.sival_ptr,
1037 NOTIFY_COOKIE_LEN)) {
1038 goto out;
1041 /* TODO: add a header? */
1042 skb_put(nc, NOTIFY_COOKIE_LEN);
1043 /* and attach it to the socket */
1044 retry:
1045 filp = fget(notification.sigev_signo);
1046 ret = -EBADF;
1047 if (!filp)
1048 goto out;
1049 sock = netlink_getsockbyfilp(filp);
1050 fput(filp);
1051 if (IS_ERR(sock)) {
1052 ret = PTR_ERR(sock);
1053 sock = NULL;
1054 goto out;
1057 timeo = MAX_SCHEDULE_TIMEOUT;
1058 ret = netlink_attachskb(sock, nc, 0, &timeo, NULL);
1059 if (ret == 1)
1060 goto retry;
1061 if (ret) {
1062 sock = NULL;
1063 nc = NULL;
1064 goto out;
1069 ret = -EBADF;
1070 filp = fget(mqdes);
1071 if (!filp)
1072 goto out;
1074 inode = filp->f_path.dentry->d_inode;
1075 if (unlikely(filp->f_op != &mqueue_file_operations))
1076 goto out_fput;
1077 info = MQUEUE_I(inode);
1079 ret = 0;
1080 spin_lock(&info->lock);
1081 if (u_notification == NULL) {
1082 if (info->notify_owner == task_tgid(current)) {
1083 remove_notification(info);
1084 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1086 } else if (info->notify_owner != NULL) {
1087 ret = -EBUSY;
1088 } else {
1089 switch (notification.sigev_notify) {
1090 case SIGEV_NONE:
1091 info->notify.sigev_notify = SIGEV_NONE;
1092 break;
1093 case SIGEV_THREAD:
1094 info->notify_sock = sock;
1095 info->notify_cookie = nc;
1096 sock = NULL;
1097 nc = NULL;
1098 info->notify.sigev_notify = SIGEV_THREAD;
1099 break;
1100 case SIGEV_SIGNAL:
1101 info->notify.sigev_signo = notification.sigev_signo;
1102 info->notify.sigev_value = notification.sigev_value;
1103 info->notify.sigev_notify = SIGEV_SIGNAL;
1104 break;
1107 info->notify_owner = get_pid(task_tgid(current));
1108 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1110 spin_unlock(&info->lock);
1111 out_fput:
1112 fput(filp);
1113 out:
1114 if (sock) {
1115 netlink_detachskb(sock, nc);
1116 } else if (nc) {
1117 dev_kfree_skb(nc);
1119 return ret;
1122 asmlinkage long sys_mq_getsetattr(mqd_t mqdes,
1123 const struct mq_attr __user *u_mqstat,
1124 struct mq_attr __user *u_omqstat)
1126 int ret;
1127 struct mq_attr mqstat, omqstat;
1128 struct file *filp;
1129 struct inode *inode;
1130 struct mqueue_inode_info *info;
1132 if (u_mqstat != NULL) {
1133 if (copy_from_user(&mqstat, u_mqstat, sizeof(struct mq_attr)))
1134 return -EFAULT;
1135 if (mqstat.mq_flags & (~O_NONBLOCK))
1136 return -EINVAL;
1139 ret = -EBADF;
1140 filp = fget(mqdes);
1141 if (!filp)
1142 goto out;
1144 inode = filp->f_path.dentry->d_inode;
1145 if (unlikely(filp->f_op != &mqueue_file_operations))
1146 goto out_fput;
1147 info = MQUEUE_I(inode);
1149 spin_lock(&info->lock);
1151 omqstat = info->attr;
1152 omqstat.mq_flags = filp->f_flags & O_NONBLOCK;
1153 if (u_mqstat) {
1154 ret = audit_mq_getsetattr(mqdes, &mqstat);
1155 if (ret != 0) {
1156 spin_unlock(&info->lock);
1157 goto out_fput;
1159 if (mqstat.mq_flags & O_NONBLOCK)
1160 filp->f_flags |= O_NONBLOCK;
1161 else
1162 filp->f_flags &= ~O_NONBLOCK;
1164 inode->i_atime = inode->i_ctime = CURRENT_TIME;
1167 spin_unlock(&info->lock);
1169 ret = 0;
1170 if (u_omqstat != NULL && copy_to_user(u_omqstat, &omqstat,
1171 sizeof(struct mq_attr)))
1172 ret = -EFAULT;
1174 out_fput:
1175 fput(filp);
1176 out:
1177 return ret;
1180 static const struct inode_operations mqueue_dir_inode_operations = {
1181 .lookup = simple_lookup,
1182 .create = mqueue_create,
1183 .unlink = mqueue_unlink,
1186 static const struct file_operations mqueue_file_operations = {
1187 .flush = mqueue_flush_file,
1188 .poll = mqueue_poll_file,
1189 .read = mqueue_read_file,
1192 static struct super_operations mqueue_super_ops = {
1193 .alloc_inode = mqueue_alloc_inode,
1194 .destroy_inode = mqueue_destroy_inode,
1195 .statfs = simple_statfs,
1196 .delete_inode = mqueue_delete_inode,
1197 .drop_inode = generic_delete_inode,
1200 static struct file_system_type mqueue_fs_type = {
1201 .name = "mqueue",
1202 .get_sb = mqueue_get_sb,
1203 .kill_sb = kill_litter_super,
1206 static int msg_max_limit_min = DFLT_MSGMAX;
1207 static int msg_max_limit_max = HARD_MSGMAX;
1209 static int msg_maxsize_limit_min = DFLT_MSGSIZEMAX;
1210 static int msg_maxsize_limit_max = INT_MAX;
1212 static ctl_table mq_sysctls[] = {
1214 .procname = "queues_max",
1215 .data = &queues_max,
1216 .maxlen = sizeof(int),
1217 .mode = 0644,
1218 .proc_handler = &proc_dointvec,
1221 .procname = "msg_max",
1222 .data = &msg_max,
1223 .maxlen = sizeof(int),
1224 .mode = 0644,
1225 .proc_handler = &proc_dointvec_minmax,
1226 .extra1 = &msg_max_limit_min,
1227 .extra2 = &msg_max_limit_max,
1230 .procname = "msgsize_max",
1231 .data = &msgsize_max,
1232 .maxlen = sizeof(int),
1233 .mode = 0644,
1234 .proc_handler = &proc_dointvec_minmax,
1235 .extra1 = &msg_maxsize_limit_min,
1236 .extra2 = &msg_maxsize_limit_max,
1238 { .ctl_name = 0 }
1241 static ctl_table mq_sysctl_dir[] = {
1243 .procname = "mqueue",
1244 .mode = 0555,
1245 .child = mq_sysctls,
1247 { .ctl_name = 0 }
1250 static ctl_table mq_sysctl_root[] = {
1252 .ctl_name = CTL_FS,
1253 .procname = "fs",
1254 .mode = 0555,
1255 .child = mq_sysctl_dir,
1257 { .ctl_name = 0 }
1260 static int __init init_mqueue_fs(void)
1262 int error;
1264 mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache",
1265 sizeof(struct mqueue_inode_info), 0,
1266 SLAB_HWCACHE_ALIGN, init_once);
1267 if (mqueue_inode_cachep == NULL)
1268 return -ENOMEM;
1270 /* ignore failues - they are not fatal */
1271 mq_sysctl_table = register_sysctl_table(mq_sysctl_root);
1273 error = register_filesystem(&mqueue_fs_type);
1274 if (error)
1275 goto out_sysctl;
1277 if (IS_ERR(mqueue_mnt = kern_mount(&mqueue_fs_type))) {
1278 error = PTR_ERR(mqueue_mnt);
1279 goto out_filesystem;
1282 /* internal initialization - not common for vfs */
1283 queues_count = 0;
1284 spin_lock_init(&mq_lock);
1286 return 0;
1288 out_filesystem:
1289 unregister_filesystem(&mqueue_fs_type);
1290 out_sysctl:
1291 if (mq_sysctl_table)
1292 unregister_sysctl_table(mq_sysctl_table);
1293 kmem_cache_destroy(mqueue_inode_cachep);
1294 return error;
1297 __initcall(init_mqueue_fs);