2 * POSIX message queues filesystem for Linux.
4 * Copyright (C) 2003,2004 Krzysztof Benedyczak (golbi@mat.uni.torun.pl)
5 * Michal Wronski (Michal.Wronski@motorola.com)
7 * Spinlocks: Mohamed Abbas (abbas.mohamed@intel.com)
8 * Lockless receive & send, fd based notify:
9 * Manfred Spraul (manfred@colorfullife.com)
11 * This file is released under the GPL.
14 #include <linux/capability.h>
15 #include <linux/init.h>
16 #include <linux/pagemap.h>
17 #include <linux/file.h>
18 #include <linux/mount.h>
19 #include <linux/namei.h>
20 #include <linux/sysctl.h>
21 #include <linux/poll.h>
22 #include <linux/mqueue.h>
23 #include <linux/msg.h>
24 #include <linux/skbuff.h>
25 #include <linux/netlink.h>
26 #include <linux/syscalls.h>
27 #include <linux/signal.h>
28 #include <linux/mutex.h>
33 #define MQUEUE_MAGIC 0x19800202
34 #define DIRENT_SIZE 20
35 #define FILENT_SIZE 80
41 #define STATE_PENDING 1
46 #define CTL_QUEUESMAX 2
48 #define CTL_MSGSIZEMAX 4
51 #define DFLT_QUEUESMAX 256 /* max number of message queues */
52 #define DFLT_MSGMAX 10 /* max number of messages in each queue */
53 #define HARD_MSGMAX (131072/sizeof(void*))
54 #define DFLT_MSGSIZEMAX 8192 /* max message size */
57 struct ext_wait_queue
{ /* queue of sleeping tasks */
58 struct task_struct
*task
;
59 struct list_head list
;
60 struct msg_msg
*msg
; /* ptr of loaded message */
61 int state
; /* one of STATE_* values */
64 struct mqueue_inode_info
{
66 struct inode vfs_inode
;
67 wait_queue_head_t wait_q
;
69 struct msg_msg
**messages
;
72 struct sigevent notify
;
74 struct user_struct
*user
; /* user who created, for accounting */
75 struct sock
*notify_sock
;
76 struct sk_buff
*notify_cookie
;
78 /* for tasks waiting for free space and messages, respectively */
79 struct ext_wait_queue e_wait_q
[2];
81 unsigned long qsize
; /* size of queue in memory (sum of all msgs) */
84 static struct inode_operations mqueue_dir_inode_operations
;
85 static struct file_operations mqueue_file_operations
;
86 static struct super_operations mqueue_super_ops
;
87 static void remove_notification(struct mqueue_inode_info
*info
);
89 static spinlock_t mq_lock
;
90 static kmem_cache_t
*mqueue_inode_cachep
;
91 static struct vfsmount
*mqueue_mnt
;
93 static unsigned int queues_count
;
94 static unsigned int queues_max
= DFLT_QUEUESMAX
;
95 static unsigned int msg_max
= DFLT_MSGMAX
;
96 static unsigned int msgsize_max
= DFLT_MSGSIZEMAX
;
98 static struct ctl_table_header
* mq_sysctl_table
;
100 static inline struct mqueue_inode_info
*MQUEUE_I(struct inode
*inode
)
102 return container_of(inode
, struct mqueue_inode_info
, vfs_inode
);
105 static struct inode
*mqueue_get_inode(struct super_block
*sb
, int mode
,
106 struct mq_attr
*attr
)
110 inode
= new_inode(sb
);
112 inode
->i_mode
= mode
;
113 inode
->i_uid
= current
->fsuid
;
114 inode
->i_gid
= current
->fsgid
;
115 inode
->i_blksize
= PAGE_CACHE_SIZE
;
117 inode
->i_mtime
= inode
->i_ctime
= inode
->i_atime
=
121 struct mqueue_inode_info
*info
;
122 struct task_struct
*p
= current
;
123 struct user_struct
*u
= p
->user
;
124 unsigned long mq_bytes
, mq_msg_tblsz
;
126 inode
->i_fop
= &mqueue_file_operations
;
127 inode
->i_size
= FILENT_SIZE
;
128 /* mqueue specific info */
129 info
= MQUEUE_I(inode
);
130 spin_lock_init(&info
->lock
);
131 init_waitqueue_head(&info
->wait_q
);
132 INIT_LIST_HEAD(&info
->e_wait_q
[0].list
);
133 INIT_LIST_HEAD(&info
->e_wait_q
[1].list
);
134 info
->messages
= NULL
;
135 info
->notify_owner
= 0;
137 info
->user
= NULL
; /* set when all is ok */
138 memset(&info
->attr
, 0, sizeof(info
->attr
));
139 info
->attr
.mq_maxmsg
= DFLT_MSGMAX
;
140 info
->attr
.mq_msgsize
= DFLT_MSGSIZEMAX
;
142 info
->attr
.mq_maxmsg
= attr
->mq_maxmsg
;
143 info
->attr
.mq_msgsize
= attr
->mq_msgsize
;
145 mq_msg_tblsz
= info
->attr
.mq_maxmsg
* sizeof(struct msg_msg
*);
146 mq_bytes
= (mq_msg_tblsz
+
147 (info
->attr
.mq_maxmsg
* info
->attr
.mq_msgsize
));
150 if (u
->mq_bytes
+ mq_bytes
< u
->mq_bytes
||
151 u
->mq_bytes
+ mq_bytes
>
152 p
->signal
->rlim
[RLIMIT_MSGQUEUE
].rlim_cur
) {
153 spin_unlock(&mq_lock
);
156 u
->mq_bytes
+= mq_bytes
;
157 spin_unlock(&mq_lock
);
159 info
->messages
= kmalloc(mq_msg_tblsz
, GFP_KERNEL
);
160 if (!info
->messages
) {
162 u
->mq_bytes
-= mq_bytes
;
163 spin_unlock(&mq_lock
);
167 info
->user
= get_uid(u
);
168 } else if (S_ISDIR(mode
)) {
170 /* Some things misbehave if size == 0 on a directory */
171 inode
->i_size
= 2 * DIRENT_SIZE
;
172 inode
->i_op
= &mqueue_dir_inode_operations
;
173 inode
->i_fop
= &simple_dir_operations
;
178 make_bad_inode(inode
);
183 static int mqueue_fill_super(struct super_block
*sb
, void *data
, int silent
)
187 sb
->s_blocksize
= PAGE_CACHE_SIZE
;
188 sb
->s_blocksize_bits
= PAGE_CACHE_SHIFT
;
189 sb
->s_magic
= MQUEUE_MAGIC
;
190 sb
->s_op
= &mqueue_super_ops
;
192 inode
= mqueue_get_inode(sb
, S_IFDIR
| S_ISVTX
| S_IRWXUGO
, NULL
);
196 sb
->s_root
= d_alloc_root(inode
);
205 static struct super_block
*mqueue_get_sb(struct file_system_type
*fs_type
,
206 int flags
, const char *dev_name
,
209 return get_sb_single(fs_type
, flags
, data
, mqueue_fill_super
);
212 static void init_once(void *foo
, kmem_cache_t
* cachep
, unsigned long flags
)
214 struct mqueue_inode_info
*p
= (struct mqueue_inode_info
*) foo
;
216 if ((flags
& (SLAB_CTOR_VERIFY
| SLAB_CTOR_CONSTRUCTOR
)) ==
217 SLAB_CTOR_CONSTRUCTOR
)
218 inode_init_once(&p
->vfs_inode
);
221 static struct inode
*mqueue_alloc_inode(struct super_block
*sb
)
223 struct mqueue_inode_info
*ei
;
225 ei
= kmem_cache_alloc(mqueue_inode_cachep
, SLAB_KERNEL
);
228 return &ei
->vfs_inode
;
231 static void mqueue_destroy_inode(struct inode
*inode
)
233 kmem_cache_free(mqueue_inode_cachep
, MQUEUE_I(inode
));
236 static void mqueue_delete_inode(struct inode
*inode
)
238 struct mqueue_inode_info
*info
;
239 struct user_struct
*user
;
240 unsigned long mq_bytes
;
243 if (S_ISDIR(inode
->i_mode
)) {
247 info
= MQUEUE_I(inode
);
248 spin_lock(&info
->lock
);
249 for (i
= 0; i
< info
->attr
.mq_curmsgs
; i
++)
250 free_msg(info
->messages
[i
]);
251 kfree(info
->messages
);
252 spin_unlock(&info
->lock
);
256 mq_bytes
= (info
->attr
.mq_maxmsg
* sizeof(struct msg_msg
*) +
257 (info
->attr
.mq_maxmsg
* info
->attr
.mq_msgsize
));
261 user
->mq_bytes
-= mq_bytes
;
263 spin_unlock(&mq_lock
);
268 static int mqueue_create(struct inode
*dir
, struct dentry
*dentry
,
269 int mode
, struct nameidata
*nd
)
272 struct mq_attr
*attr
= dentry
->d_fsdata
;
276 if (queues_count
>= queues_max
&& !capable(CAP_SYS_RESOURCE
)) {
281 spin_unlock(&mq_lock
);
283 inode
= mqueue_get_inode(dir
->i_sb
, mode
, attr
);
291 dir
->i_size
+= DIRENT_SIZE
;
292 dir
->i_ctime
= dir
->i_mtime
= dir
->i_atime
= CURRENT_TIME
;
294 d_instantiate(dentry
, inode
);
298 spin_unlock(&mq_lock
);
302 static int mqueue_unlink(struct inode
*dir
, struct dentry
*dentry
)
304 struct inode
*inode
= dentry
->d_inode
;
306 dir
->i_ctime
= dir
->i_mtime
= dir
->i_atime
= CURRENT_TIME
;
307 dir
->i_size
-= DIRENT_SIZE
;
314 * This is routine for system read from queue file.
315 * To avoid mess with doing here some sort of mq_receive we allow
316 * to read only queue size & notification info (the only values
317 * that are interesting from user point of view and aren't accessible
318 * through std routines)
320 static ssize_t
mqueue_read_file(struct file
*filp
, char __user
*u_data
,
321 size_t count
, loff_t
* off
)
323 struct mqueue_inode_info
*info
= MQUEUE_I(filp
->f_dentry
->d_inode
);
324 char buffer
[FILENT_SIZE
];
331 spin_lock(&info
->lock
);
332 snprintf(buffer
, sizeof(buffer
),
333 "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
335 info
->notify_owner
? info
->notify
.sigev_notify
: 0,
336 (info
->notify_owner
&&
337 info
->notify
.sigev_notify
== SIGEV_SIGNAL
) ?
338 info
->notify
.sigev_signo
: 0,
340 spin_unlock(&info
->lock
);
341 buffer
[sizeof(buffer
)-1] = '\0';
342 slen
= strlen(buffer
)+1;
348 if (o
+ count
> slen
)
351 if (copy_to_user(u_data
, buffer
+ o
, count
))
355 filp
->f_dentry
->d_inode
->i_atime
= filp
->f_dentry
->d_inode
->i_ctime
= CURRENT_TIME
;
359 static int mqueue_flush_file(struct file
*filp
)
361 struct mqueue_inode_info
*info
= MQUEUE_I(filp
->f_dentry
->d_inode
);
363 spin_lock(&info
->lock
);
364 if (current
->tgid
== info
->notify_owner
)
365 remove_notification(info
);
367 spin_unlock(&info
->lock
);
371 static unsigned int mqueue_poll_file(struct file
*filp
, struct poll_table_struct
*poll_tab
)
373 struct mqueue_inode_info
*info
= MQUEUE_I(filp
->f_dentry
->d_inode
);
376 poll_wait(filp
, &info
->wait_q
, poll_tab
);
378 spin_lock(&info
->lock
);
379 if (info
->attr
.mq_curmsgs
)
380 retval
= POLLIN
| POLLRDNORM
;
382 if (info
->attr
.mq_curmsgs
< info
->attr
.mq_maxmsg
)
383 retval
|= POLLOUT
| POLLWRNORM
;
384 spin_unlock(&info
->lock
);
389 /* Adds current to info->e_wait_q[sr] before element with smaller prio */
390 static void wq_add(struct mqueue_inode_info
*info
, int sr
,
391 struct ext_wait_queue
*ewp
)
393 struct ext_wait_queue
*walk
;
397 list_for_each_entry(walk
, &info
->e_wait_q
[sr
].list
, list
) {
398 if (walk
->task
->static_prio
<= current
->static_prio
) {
399 list_add_tail(&ewp
->list
, &walk
->list
);
403 list_add_tail(&ewp
->list
, &info
->e_wait_q
[sr
].list
);
407 * Puts current task to sleep. Caller must hold queue lock. After return
411 static int wq_sleep(struct mqueue_inode_info
*info
, int sr
,
412 long timeout
, struct ext_wait_queue
*ewp
)
417 wq_add(info
, sr
, ewp
);
420 set_current_state(TASK_INTERRUPTIBLE
);
422 spin_unlock(&info
->lock
);
423 time
= schedule_timeout(timeout
);
425 while (ewp
->state
== STATE_PENDING
)
428 if (ewp
->state
== STATE_READY
) {
432 spin_lock(&info
->lock
);
433 if (ewp
->state
== STATE_READY
) {
437 if (signal_pending(current
)) {
438 retval
= -ERESTARTSYS
;
446 list_del(&ewp
->list
);
448 spin_unlock(&info
->lock
);
454 * Returns waiting task that should be serviced first or NULL if none exists
456 static struct ext_wait_queue
*wq_get_first_waiter(
457 struct mqueue_inode_info
*info
, int sr
)
459 struct list_head
*ptr
;
461 ptr
= info
->e_wait_q
[sr
].list
.prev
;
462 if (ptr
== &info
->e_wait_q
[sr
].list
)
464 return list_entry(ptr
, struct ext_wait_queue
, list
);
467 /* Auxiliary functions to manipulate messages' list */
468 static void msg_insert(struct msg_msg
*ptr
, struct mqueue_inode_info
*info
)
472 k
= info
->attr
.mq_curmsgs
- 1;
473 while (k
>= 0 && info
->messages
[k
]->m_type
>= ptr
->m_type
) {
474 info
->messages
[k
+ 1] = info
->messages
[k
];
477 info
->attr
.mq_curmsgs
++;
478 info
->qsize
+= ptr
->m_ts
;
479 info
->messages
[k
+ 1] = ptr
;
482 static inline struct msg_msg
*msg_get(struct mqueue_inode_info
*info
)
484 info
->qsize
-= info
->messages
[--info
->attr
.mq_curmsgs
]->m_ts
;
485 return info
->messages
[info
->attr
.mq_curmsgs
];
488 static inline void set_cookie(struct sk_buff
*skb
, char code
)
490 ((char*)skb
->data
)[NOTIFY_COOKIE_LEN
-1] = code
;
494 * The next function is only to split too long sys_mq_timedsend
496 static void __do_notify(struct mqueue_inode_info
*info
)
499 * invoked when there is registered process and there isn't process
500 * waiting synchronously for message AND state of queue changed from
501 * empty to not empty. Here we are sure that no one is waiting
503 if (info
->notify_owner
&&
504 info
->attr
.mq_curmsgs
== 1) {
505 struct siginfo sig_i
;
506 switch (info
->notify
.sigev_notify
) {
512 sig_i
.si_signo
= info
->notify
.sigev_signo
;
514 sig_i
.si_code
= SI_MESGQ
;
515 sig_i
.si_value
= info
->notify
.sigev_value
;
516 sig_i
.si_pid
= current
->tgid
;
517 sig_i
.si_uid
= current
->uid
;
519 kill_proc_info(info
->notify
.sigev_signo
,
520 &sig_i
, info
->notify_owner
);
523 set_cookie(info
->notify_cookie
, NOTIFY_WOKENUP
);
524 netlink_sendskb(info
->notify_sock
,
525 info
->notify_cookie
, 0);
528 /* after notification unregisters process */
529 info
->notify_owner
= 0;
531 wake_up(&info
->wait_q
);
534 static long prepare_timeout(const struct timespec __user
*u_arg
)
536 struct timespec ts
, nowts
;
540 if (unlikely(copy_from_user(&ts
, u_arg
,
541 sizeof(struct timespec
))))
544 if (unlikely(ts
.tv_nsec
< 0 || ts
.tv_sec
< 0
545 || ts
.tv_nsec
>= NSEC_PER_SEC
))
547 nowts
= CURRENT_TIME
;
548 /* first subtract as jiffies can't be too big */
549 ts
.tv_sec
-= nowts
.tv_sec
;
550 if (ts
.tv_nsec
< nowts
.tv_nsec
) {
551 ts
.tv_nsec
+= NSEC_PER_SEC
;
554 ts
.tv_nsec
-= nowts
.tv_nsec
;
558 timeout
= timespec_to_jiffies(&ts
) + 1;
560 return MAX_SCHEDULE_TIMEOUT
;
565 static void remove_notification(struct mqueue_inode_info
*info
)
567 if (info
->notify_owner
!= 0 &&
568 info
->notify
.sigev_notify
== SIGEV_THREAD
) {
569 set_cookie(info
->notify_cookie
, NOTIFY_REMOVED
);
570 netlink_sendskb(info
->notify_sock
, info
->notify_cookie
, 0);
572 info
->notify_owner
= 0;
575 static int mq_attr_ok(struct mq_attr
*attr
)
577 if (attr
->mq_maxmsg
<= 0 || attr
->mq_msgsize
<= 0)
579 if (capable(CAP_SYS_RESOURCE
)) {
580 if (attr
->mq_maxmsg
> HARD_MSGMAX
)
583 if (attr
->mq_maxmsg
> msg_max
||
584 attr
->mq_msgsize
> msgsize_max
)
587 /* check for overflow */
588 if (attr
->mq_msgsize
> ULONG_MAX
/attr
->mq_maxmsg
)
590 if ((unsigned long)(attr
->mq_maxmsg
* attr
->mq_msgsize
) +
591 (attr
->mq_maxmsg
* sizeof (struct msg_msg
*)) <
592 (unsigned long)(attr
->mq_maxmsg
* attr
->mq_msgsize
))
598 * Invoked when creating a new queue via sys_mq_open
600 static struct file
*do_create(struct dentry
*dir
, struct dentry
*dentry
,
601 int oflag
, mode_t mode
, struct mq_attr __user
*u_attr
)
608 if (copy_from_user(&attr
, u_attr
, sizeof(attr
)))
611 if (!mq_attr_ok(&attr
))
613 /* store for use during create */
614 dentry
->d_fsdata
= &attr
;
617 mode
&= ~current
->fs
->umask
;
618 ret
= vfs_create(dir
->d_inode
, dentry
, mode
, NULL
);
619 dentry
->d_fsdata
= NULL
;
623 return dentry_open(dentry
, mqueue_mnt
, oflag
);
631 /* Opens existing queue */
632 static struct file
*do_open(struct dentry
*dentry
, int oflag
)
634 static int oflag2acc
[O_ACCMODE
] = { MAY_READ
, MAY_WRITE
,
635 MAY_READ
| MAY_WRITE
};
637 if ((oflag
& O_ACCMODE
) == (O_RDWR
| O_WRONLY
)) {
640 return ERR_PTR(-EINVAL
);
643 if (permission(dentry
->d_inode
, oflag2acc
[oflag
& O_ACCMODE
], NULL
)) {
646 return ERR_PTR(-EACCES
);
649 return dentry_open(dentry
, mqueue_mnt
, oflag
);
652 asmlinkage
long sys_mq_open(const char __user
*u_name
, int oflag
, mode_t mode
,
653 struct mq_attr __user
*u_attr
)
655 struct dentry
*dentry
;
660 if (IS_ERR(name
= getname(u_name
)))
661 return PTR_ERR(name
);
663 fd
= get_unused_fd();
667 mutex_lock(&mqueue_mnt
->mnt_root
->d_inode
->i_mutex
);
668 dentry
= lookup_one_len(name
, mqueue_mnt
->mnt_root
, strlen(name
));
669 if (IS_ERR(dentry
)) {
670 error
= PTR_ERR(dentry
);
675 if (oflag
& O_CREAT
) {
676 if (dentry
->d_inode
) { /* entry already exists */
680 filp
= do_open(dentry
, oflag
);
682 filp
= do_create(mqueue_mnt
->mnt_root
, dentry
,
683 oflag
, mode
, u_attr
);
687 if (!dentry
->d_inode
)
689 filp
= do_open(dentry
, oflag
);
693 error
= PTR_ERR(filp
);
697 set_close_on_exec(fd
, 1);
698 fd_install(fd
, filp
);
709 mutex_unlock(&mqueue_mnt
->mnt_root
->d_inode
->i_mutex
);
715 asmlinkage
long sys_mq_unlink(const char __user
*u_name
)
719 struct dentry
*dentry
;
720 struct inode
*inode
= NULL
;
722 name
= getname(u_name
);
724 return PTR_ERR(name
);
726 mutex_lock(&mqueue_mnt
->mnt_root
->d_inode
->i_mutex
);
727 dentry
= lookup_one_len(name
, mqueue_mnt
->mnt_root
, strlen(name
));
728 if (IS_ERR(dentry
)) {
729 err
= PTR_ERR(dentry
);
733 if (!dentry
->d_inode
) {
738 inode
= dentry
->d_inode
;
740 atomic_inc(&inode
->i_count
);
742 err
= vfs_unlink(dentry
->d_parent
->d_inode
, dentry
);
747 mutex_unlock(&mqueue_mnt
->mnt_root
->d_inode
->i_mutex
);
755 /* Pipelined send and receive functions.
757 * If a receiver finds no waiting message, then it registers itself in the
758 * list of waiting receivers. A sender checks that list before adding the new
759 * message into the message array. If there is a waiting receiver, then it
760 * bypasses the message array and directly hands the message over to the
762 * The receiver accepts the message and returns without grabbing the queue
763 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
764 * are necessary. The same algorithm is used for sysv semaphores, see
765 * ipc/sem.c for more details.
767 * The same algorithm is used for senders.
770 /* pipelined_send() - send a message directly to the task waiting in
771 * sys_mq_timedreceive() (without inserting message into a queue).
773 static inline void pipelined_send(struct mqueue_inode_info
*info
,
774 struct msg_msg
*message
,
775 struct ext_wait_queue
*receiver
)
777 receiver
->msg
= message
;
778 list_del(&receiver
->list
);
779 receiver
->state
= STATE_PENDING
;
780 wake_up_process(receiver
->task
);
782 receiver
->state
= STATE_READY
;
785 /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
786 * gets its message and put to the queue (we have one free place for sure). */
787 static inline void pipelined_receive(struct mqueue_inode_info
*info
)
789 struct ext_wait_queue
*sender
= wq_get_first_waiter(info
, SEND
);
793 wake_up_interruptible(&info
->wait_q
);
796 msg_insert(sender
->msg
, info
);
797 list_del(&sender
->list
);
798 sender
->state
= STATE_PENDING
;
799 wake_up_process(sender
->task
);
801 sender
->state
= STATE_READY
;
804 asmlinkage
long sys_mq_timedsend(mqd_t mqdes
, const char __user
*u_msg_ptr
,
805 size_t msg_len
, unsigned int msg_prio
,
806 const struct timespec __user
*u_abs_timeout
)
810 struct ext_wait_queue wait
;
811 struct ext_wait_queue
*receiver
;
812 struct msg_msg
*msg_ptr
;
813 struct mqueue_inode_info
*info
;
817 if (unlikely(msg_prio
>= (unsigned long) MQ_PRIO_MAX
))
820 timeout
= prepare_timeout(u_abs_timeout
);
827 inode
= filp
->f_dentry
->d_inode
;
828 if (unlikely(filp
->f_op
!= &mqueue_file_operations
))
830 info
= MQUEUE_I(inode
);
832 if (unlikely(!(filp
->f_mode
& FMODE_WRITE
)))
835 if (unlikely(msg_len
> info
->attr
.mq_msgsize
)) {
840 /* First try to allocate memory, before doing anything with
841 * existing queues. */
842 msg_ptr
= load_msg(u_msg_ptr
, msg_len
);
843 if (IS_ERR(msg_ptr
)) {
844 ret
= PTR_ERR(msg_ptr
);
847 msg_ptr
->m_ts
= msg_len
;
848 msg_ptr
->m_type
= msg_prio
;
850 spin_lock(&info
->lock
);
852 if (info
->attr
.mq_curmsgs
== info
->attr
.mq_maxmsg
) {
853 if (filp
->f_flags
& O_NONBLOCK
) {
854 spin_unlock(&info
->lock
);
856 } else if (unlikely(timeout
< 0)) {
857 spin_unlock(&info
->lock
);
861 wait
.msg
= (void *) msg_ptr
;
862 wait
.state
= STATE_NONE
;
863 ret
= wq_sleep(info
, SEND
, timeout
, &wait
);
868 receiver
= wq_get_first_waiter(info
, RECV
);
870 pipelined_send(info
, msg_ptr
, receiver
);
872 /* adds message to the queue */
873 msg_insert(msg_ptr
, info
);
876 inode
->i_atime
= inode
->i_mtime
= inode
->i_ctime
=
878 spin_unlock(&info
->lock
);
887 asmlinkage ssize_t
sys_mq_timedreceive(mqd_t mqdes
, char __user
*u_msg_ptr
,
888 size_t msg_len
, unsigned int __user
*u_msg_prio
,
889 const struct timespec __user
*u_abs_timeout
)
893 struct msg_msg
*msg_ptr
;
896 struct mqueue_inode_info
*info
;
897 struct ext_wait_queue wait
;
899 timeout
= prepare_timeout(u_abs_timeout
);
906 inode
= filp
->f_dentry
->d_inode
;
907 if (unlikely(filp
->f_op
!= &mqueue_file_operations
))
909 info
= MQUEUE_I(inode
);
911 if (unlikely(!(filp
->f_mode
& FMODE_READ
)))
914 /* checks if buffer is big enough */
915 if (unlikely(msg_len
< info
->attr
.mq_msgsize
)) {
920 spin_lock(&info
->lock
);
921 if (info
->attr
.mq_curmsgs
== 0) {
922 if (filp
->f_flags
& O_NONBLOCK
) {
923 spin_unlock(&info
->lock
);
926 } else if (unlikely(timeout
< 0)) {
927 spin_unlock(&info
->lock
);
932 wait
.state
= STATE_NONE
;
933 ret
= wq_sleep(info
, RECV
, timeout
, &wait
);
937 msg_ptr
= msg_get(info
);
939 inode
->i_atime
= inode
->i_mtime
= inode
->i_ctime
=
942 /* There is now free space in queue. */
943 pipelined_receive(info
);
944 spin_unlock(&info
->lock
);
950 if ((u_msg_prio
&& put_user(msg_ptr
->m_type
, u_msg_prio
)) ||
951 store_msg(u_msg_ptr
, msg_ptr
, msg_ptr
->m_ts
)) {
963 * Notes: the case when user wants us to deregister (with NULL as pointer)
964 * and he isn't currently owner of notification, will be silently discarded.
965 * It isn't explicitly defined in the POSIX.
967 asmlinkage
long sys_mq_notify(mqd_t mqdes
,
968 const struct sigevent __user
*u_notification
)
974 struct sigevent notification
;
975 struct mqueue_inode_info
*info
;
980 if (u_notification
!= NULL
) {
981 if (copy_from_user(¬ification
, u_notification
,
982 sizeof(struct sigevent
)))
985 if (unlikely(notification
.sigev_notify
!= SIGEV_NONE
&&
986 notification
.sigev_notify
!= SIGEV_SIGNAL
&&
987 notification
.sigev_notify
!= SIGEV_THREAD
))
989 if (notification
.sigev_notify
== SIGEV_SIGNAL
&&
990 !valid_signal(notification
.sigev_signo
)) {
993 if (notification
.sigev_notify
== SIGEV_THREAD
) {
994 /* create the notify skb */
995 nc
= alloc_skb(NOTIFY_COOKIE_LEN
, GFP_KERNEL
);
1000 if (copy_from_user(nc
->data
,
1001 notification
.sigev_value
.sival_ptr
,
1002 NOTIFY_COOKIE_LEN
)) {
1006 /* TODO: add a header? */
1007 skb_put(nc
, NOTIFY_COOKIE_LEN
);
1008 /* and attach it to the socket */
1010 filp
= fget(notification
.sigev_signo
);
1014 sock
= netlink_getsockbyfilp(filp
);
1017 ret
= PTR_ERR(sock
);
1022 ret
= netlink_attachskb(sock
, nc
, 0,
1023 MAX_SCHEDULE_TIMEOUT
, NULL
);
1039 inode
= filp
->f_dentry
->d_inode
;
1040 if (unlikely(filp
->f_op
!= &mqueue_file_operations
))
1042 info
= MQUEUE_I(inode
);
1045 spin_lock(&info
->lock
);
1046 if (u_notification
== NULL
) {
1047 if (info
->notify_owner
== current
->tgid
) {
1048 remove_notification(info
);
1049 inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
1051 } else if (info
->notify_owner
!= 0) {
1054 switch (notification
.sigev_notify
) {
1056 info
->notify
.sigev_notify
= SIGEV_NONE
;
1059 info
->notify_sock
= sock
;
1060 info
->notify_cookie
= nc
;
1063 info
->notify
.sigev_notify
= SIGEV_THREAD
;
1066 info
->notify
.sigev_signo
= notification
.sigev_signo
;
1067 info
->notify
.sigev_value
= notification
.sigev_value
;
1068 info
->notify
.sigev_notify
= SIGEV_SIGNAL
;
1071 info
->notify_owner
= current
->tgid
;
1072 inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
1074 spin_unlock(&info
->lock
);
1079 netlink_detachskb(sock
, nc
);
1086 asmlinkage
long sys_mq_getsetattr(mqd_t mqdes
,
1087 const struct mq_attr __user
*u_mqstat
,
1088 struct mq_attr __user
*u_omqstat
)
1091 struct mq_attr mqstat
, omqstat
;
1093 struct inode
*inode
;
1094 struct mqueue_inode_info
*info
;
1096 if (u_mqstat
!= NULL
) {
1097 if (copy_from_user(&mqstat
, u_mqstat
, sizeof(struct mq_attr
)))
1099 if (mqstat
.mq_flags
& (~O_NONBLOCK
))
1108 inode
= filp
->f_dentry
->d_inode
;
1109 if (unlikely(filp
->f_op
!= &mqueue_file_operations
))
1111 info
= MQUEUE_I(inode
);
1113 spin_lock(&info
->lock
);
1115 omqstat
= info
->attr
;
1116 omqstat
.mq_flags
= filp
->f_flags
& O_NONBLOCK
;
1118 if (mqstat
.mq_flags
& O_NONBLOCK
)
1119 filp
->f_flags
|= O_NONBLOCK
;
1121 filp
->f_flags
&= ~O_NONBLOCK
;
1123 inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
1126 spin_unlock(&info
->lock
);
1129 if (u_omqstat
!= NULL
&& copy_to_user(u_omqstat
, &omqstat
,
1130 sizeof(struct mq_attr
)))
1139 static struct inode_operations mqueue_dir_inode_operations
= {
1140 .lookup
= simple_lookup
,
1141 .create
= mqueue_create
,
1142 .unlink
= mqueue_unlink
,
1145 static struct file_operations mqueue_file_operations
= {
1146 .flush
= mqueue_flush_file
,
1147 .poll
= mqueue_poll_file
,
1148 .read
= mqueue_read_file
,
1151 static struct super_operations mqueue_super_ops
= {
1152 .alloc_inode
= mqueue_alloc_inode
,
1153 .destroy_inode
= mqueue_destroy_inode
,
1154 .statfs
= simple_statfs
,
1155 .delete_inode
= mqueue_delete_inode
,
1156 .drop_inode
= generic_delete_inode
,
1159 static struct file_system_type mqueue_fs_type
= {
1161 .get_sb
= mqueue_get_sb
,
1162 .kill_sb
= kill_litter_super
,
1165 static int msg_max_limit_min
= DFLT_MSGMAX
;
1166 static int msg_max_limit_max
= HARD_MSGMAX
;
1168 static int msg_maxsize_limit_min
= DFLT_MSGSIZEMAX
;
1169 static int msg_maxsize_limit_max
= INT_MAX
;
1171 static ctl_table mq_sysctls
[] = {
1173 .ctl_name
= CTL_QUEUESMAX
,
1174 .procname
= "queues_max",
1175 .data
= &queues_max
,
1176 .maxlen
= sizeof(int),
1178 .proc_handler
= &proc_dointvec
,
1181 .ctl_name
= CTL_MSGMAX
,
1182 .procname
= "msg_max",
1184 .maxlen
= sizeof(int),
1186 .proc_handler
= &proc_dointvec_minmax
,
1187 .extra1
= &msg_max_limit_min
,
1188 .extra2
= &msg_max_limit_max
,
1191 .ctl_name
= CTL_MSGSIZEMAX
,
1192 .procname
= "msgsize_max",
1193 .data
= &msgsize_max
,
1194 .maxlen
= sizeof(int),
1196 .proc_handler
= &proc_dointvec_minmax
,
1197 .extra1
= &msg_maxsize_limit_min
,
1198 .extra2
= &msg_maxsize_limit_max
,
1203 static ctl_table mq_sysctl_dir
[] = {
1205 .ctl_name
= FS_MQUEUE
,
1206 .procname
= "mqueue",
1208 .child
= mq_sysctls
,
1213 static ctl_table mq_sysctl_root
[] = {
1218 .child
= mq_sysctl_dir
,
1223 static int __init
init_mqueue_fs(void)
1227 mqueue_inode_cachep
= kmem_cache_create("mqueue_inode_cache",
1228 sizeof(struct mqueue_inode_info
), 0,
1229 SLAB_HWCACHE_ALIGN
, init_once
, NULL
);
1230 if (mqueue_inode_cachep
== NULL
)
1233 /* ignore failues - they are not fatal */
1234 mq_sysctl_table
= register_sysctl_table(mq_sysctl_root
, 0);
1236 error
= register_filesystem(&mqueue_fs_type
);
1240 if (IS_ERR(mqueue_mnt
= kern_mount(&mqueue_fs_type
))) {
1241 error
= PTR_ERR(mqueue_mnt
);
1242 goto out_filesystem
;
1245 /* internal initialization - not common for vfs */
1247 spin_lock_init(&mq_lock
);
1252 unregister_filesystem(&mqueue_fs_type
);
1254 if (mq_sysctl_table
)
1255 unregister_sysctl_table(mq_sysctl_table
);
1256 if (kmem_cache_destroy(mqueue_inode_cachep
)) {
1258 "mqueue_inode_cache: not all structures were freed\n");
1263 __initcall(init_mqueue_fs
);