Blame view
ipc/mqueue.c
40.3 KB
1da177e4c
|
1 2 3 4 |
/* * POSIX message queues filesystem for Linux. * * Copyright (C) 2003,2004 Krzysztof Benedyczak (golbi@mat.uni.torun.pl) |
f66e928b9
|
5 |
* Michal Wronski (michal.wronski@gmail.com) |
1da177e4c
|
6 7 8 |
* * Spinlocks: Mohamed Abbas (abbas.mohamed@intel.com) * Lockless receive & send, fd based notify: |
239521f31
|
9 |
* Manfred Spraul (manfred@colorfullife.com) |
1da177e4c
|
10 |
* |
20ca73bc7
|
11 12 |
* Audit: George Wilson (ltcgcw@us.ibm.com) * |
1da177e4c
|
13 14 |
* This file is released under the GPL. */ |
c59ede7b7
|
15 |
#include <linux/capability.h> |
1da177e4c
|
16 17 18 19 |
#include <linux/init.h> #include <linux/pagemap.h> #include <linux/file.h> #include <linux/mount.h> |
935c6912b
|
20 |
#include <linux/fs_context.h> |
1da177e4c
|
21 22 23 24 25 26 |
#include <linux/namei.h> #include <linux/sysctl.h> #include <linux/poll.h> #include <linux/mqueue.h> #include <linux/msg.h> #include <linux/skbuff.h> |
5b5c4d1a1
|
27 |
#include <linux/vmalloc.h> |
1da177e4c
|
28 29 |
#include <linux/netlink.h> #include <linux/syscalls.h> |
20ca73bc7
|
30 |
#include <linux/audit.h> |
7ed20e1ad
|
31 |
#include <linux/signal.h> |
5f921ae96
|
32 |
#include <linux/mutex.h> |
b488893a3
|
33 34 |
#include <linux/nsproxy.h> #include <linux/pid.h> |
614b84cf4
|
35 |
#include <linux/ipc_namespace.h> |
6b550f949
|
36 |
#include <linux/user_namespace.h> |
5a0e3ad6a
|
37 |
#include <linux/slab.h> |
84f001e15
|
38 |
#include <linux/sched/wake_q.h> |
3f07c0144
|
39 |
#include <linux/sched/signal.h> |
8703e8a46
|
40 |
#include <linux/sched/user.h> |
5f921ae96
|
41 |
|
1da177e4c
|
42 43 |
#include <net/sock.h> #include "util.h" |
935c6912b
|
44 45 46 |
struct mqueue_fs_context { struct ipc_namespace *ipc_ns; }; |
1da177e4c
|
47 48 49 50 51 52 53 54 |
#define MQUEUE_MAGIC 0x19800202 #define DIRENT_SIZE 20 #define FILENT_SIZE 80 #define SEND 0 #define RECV 1 #define STATE_NONE 0 |
fa6004ad4
|
55 |
#define STATE_READY 1 |
1da177e4c
|
56 |
|
d6629859b
|
57 58 59 60 61 |
struct posix_msg_tree_node { struct rb_node rb_node; struct list_head msg_list; int priority; }; |
1da177e4c
|
62 63 64 65 66 67 68 69 70 71 72 |
struct ext_wait_queue { /* queue of sleeping tasks */ struct task_struct *task; struct list_head list; struct msg_msg *msg; /* ptr of loaded message */ int state; /* one of STATE_* values */ }; struct mqueue_inode_info { spinlock_t lock; struct inode vfs_inode; wait_queue_head_t wait_q; |
d6629859b
|
73 |
struct rb_root msg_tree; |
a5091fda4
|
74 |
struct rb_node *msg_tree_rightmost; |
ce2d52cc1
|
75 |
struct posix_msg_tree_node *node_cache; |
1da177e4c
|
76 77 78 |
struct mq_attr attr; struct sigevent notify; |
239521f31
|
79 |
struct pid *notify_owner; |
6f9ac6d93
|
80 |
struct user_namespace *notify_user_ns; |
338cec325
|
81 |
struct user_struct *user; /* user who created, for accounting */ |
1da177e4c
|
82 83 84 85 86 87 88 89 |
struct sock *notify_sock; struct sk_buff *notify_cookie; /* for tasks waiting for free space and messages, respectively */ struct ext_wait_queue e_wait_q[2]; unsigned long qsize; /* size of queue in memory (sum of all msgs) */ }; |
935c6912b
|
90 |
static struct file_system_type mqueue_fs_type; |
92e1d5be9
|
91 |
static const struct inode_operations mqueue_dir_inode_operations; |
9a32144e9
|
92 |
static const struct file_operations mqueue_file_operations; |
b87221de6
|
93 |
static const struct super_operations mqueue_super_ops; |
935c6912b
|
94 |
static const struct fs_context_operations mqueue_fs_context_ops; |
1da177e4c
|
95 |
static void remove_notification(struct mqueue_inode_info *info); |
e18b890bb
|
96 |
static struct kmem_cache *mqueue_inode_cachep; |
1da177e4c
|
97 |
|
239521f31
|
98 |
static struct ctl_table_header *mq_sysctl_table; |
1da177e4c
|
99 100 101 102 103 |
static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode) { return container_of(inode, struct mqueue_inode_info, vfs_inode); } |
7eafd7c74
|
104 105 106 107 |
/* * This routine should be called with the mq_lock held. */ static inline struct ipc_namespace *__get_ns_from_inode(struct inode *inode) |
614b84cf4
|
108 |
{ |
7eafd7c74
|
109 |
return get_ipc_ns(inode->i_sb->s_fs_info); |
614b84cf4
|
110 |
} |
7eafd7c74
|
111 |
static struct ipc_namespace *get_ns_from_inode(struct inode *inode) |
614b84cf4
|
112 |
{ |
7eafd7c74
|
113 114 115 116 117 118 |
struct ipc_namespace *ns; spin_lock(&mq_lock); ns = __get_ns_from_inode(inode); spin_unlock(&mq_lock); return ns; |
614b84cf4
|
119 |
} |
d6629859b
|
120 121 122 123 124 |
/* Auxiliary functions to manipulate messages' list */ static int msg_insert(struct msg_msg *msg, struct mqueue_inode_info *info) { struct rb_node **p, *parent = NULL; struct posix_msg_tree_node *leaf; |
a5091fda4
|
125 |
bool rightmost = true; |
d6629859b
|
126 127 128 129 130 131 132 133 |
p = &info->msg_tree.rb_node; while (*p) { parent = *p; leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); if (likely(leaf->priority == msg->m_type)) goto insert_msg; |
a5091fda4
|
134 |
else if (msg->m_type < leaf->priority) { |
d6629859b
|
135 |
p = &(*p)->rb_left; |
a5091fda4
|
136 137 |
rightmost = false; } else |
d6629859b
|
138 139 |
p = &(*p)->rb_right; } |
ce2d52cc1
|
140 141 142 143 144 145 146 |
if (info->node_cache) { leaf = info->node_cache; info->node_cache = NULL; } else { leaf = kmalloc(sizeof(*leaf), GFP_ATOMIC); if (!leaf) return -ENOMEM; |
ce2d52cc1
|
147 |
INIT_LIST_HEAD(&leaf->msg_list); |
ce2d52cc1
|
148 |
} |
d6629859b
|
149 |
leaf->priority = msg->m_type; |
a5091fda4
|
150 151 152 |
if (rightmost) info->msg_tree_rightmost = &leaf->rb_node; |
d6629859b
|
153 154 |
rb_link_node(&leaf->rb_node, parent, p); rb_insert_color(&leaf->rb_node, &info->msg_tree); |
d6629859b
|
155 156 157 158 159 160 |
insert_msg: info->attr.mq_curmsgs++; info->qsize += msg->m_ts; list_add_tail(&msg->m_list, &leaf->msg_list); return 0; } |
a5091fda4
|
161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 |
static inline void msg_tree_erase(struct posix_msg_tree_node *leaf, struct mqueue_inode_info *info) { struct rb_node *node = &leaf->rb_node; if (info->msg_tree_rightmost == node) info->msg_tree_rightmost = rb_prev(node); rb_erase(node, &info->msg_tree); if (info->node_cache) { kfree(leaf); } else { info->node_cache = leaf; } } |
d6629859b
|
176 177 |
static inline struct msg_msg *msg_get(struct mqueue_inode_info *info) { |
a5091fda4
|
178 |
struct rb_node *parent = NULL; |
d6629859b
|
179 180 181 182 |
struct posix_msg_tree_node *leaf; struct msg_msg *msg; try_again: |
a5091fda4
|
183 184 185 186 187 188 |
/* * During insert, low priorities go to the left and high to the * right. On receive, we want the highest priorities first, so * walk all the way to the right. */ parent = info->msg_tree_rightmost; |
d6629859b
|
189 190 191 192 193 194 195 196 197 198 199 |
if (!parent) { if (info->attr.mq_curmsgs) { pr_warn_once("Inconsistency in POSIX message queue, " "no tree element, but supposedly messages " "should exist! "); info->attr.mq_curmsgs = 0; } return NULL; } leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); |
ce2d52cc1
|
200 |
if (unlikely(list_empty(&leaf->msg_list))) { |
d6629859b
|
201 202 203 204 |
pr_warn_once("Inconsistency in POSIX message queue, " "empty leaf node but we haven't implemented " "lazy leaf delete! "); |
a5091fda4
|
205 |
msg_tree_erase(leaf, info); |
d6629859b
|
206 207 208 209 210 211 |
goto try_again; } else { msg = list_first_entry(&leaf->msg_list, struct msg_msg, m_list); list_del(&msg->m_list); if (list_empty(&leaf->msg_list)) { |
a5091fda4
|
212 |
msg_tree_erase(leaf, info); |
d6629859b
|
213 214 215 216 217 218 |
} } info->attr.mq_curmsgs--; info->qsize -= msg->m_ts; return msg; } |
7eafd7c74
|
219 |
static struct inode *mqueue_get_inode(struct super_block *sb, |
1b9d5ff76
|
220 |
struct ipc_namespace *ipc_ns, umode_t mode, |
7eafd7c74
|
221 |
struct mq_attr *attr) |
1da177e4c
|
222 |
{ |
86a264abe
|
223 |
struct user_struct *u = current_user(); |
1da177e4c
|
224 |
struct inode *inode; |
d40dcdb01
|
225 |
int ret = -ENOMEM; |
1da177e4c
|
226 227 |
inode = new_inode(sb); |
04715206c
|
228 229 230 231 232 233 234 |
if (!inode) goto err; inode->i_ino = get_next_ino(); inode->i_mode = mode; inode->i_uid = current_fsuid(); inode->i_gid = current_fsgid(); |
078cd8279
|
235 |
inode->i_mtime = inode->i_ctime = inode->i_atime = current_time(inode); |
04715206c
|
236 237 238 |
if (S_ISREG(mode)) { struct mqueue_inode_info *info; |
d6629859b
|
239 |
unsigned long mq_bytes, mq_treesize; |
04715206c
|
240 241 242 243 244 245 246 247 248 249 |
inode->i_fop = &mqueue_file_operations; inode->i_size = FILENT_SIZE; /* mqueue specific info */ info = MQUEUE_I(inode); spin_lock_init(&info->lock); init_waitqueue_head(&info->wait_q); INIT_LIST_HEAD(&info->e_wait_q[0].list); INIT_LIST_HEAD(&info->e_wait_q[1].list); info->notify_owner = NULL; |
6f9ac6d93
|
250 |
info->notify_user_ns = NULL; |
04715206c
|
251 252 |
info->qsize = 0; info->user = NULL; /* set when all is ok */ |
d6629859b
|
253 |
info->msg_tree = RB_ROOT; |
a5091fda4
|
254 |
info->msg_tree_rightmost = NULL; |
ce2d52cc1
|
255 |
info->node_cache = NULL; |
04715206c
|
256 |
memset(&info->attr, 0, sizeof(info->attr)); |
cef0184c1
|
257 258 259 260 |
info->attr.mq_maxmsg = min(ipc_ns->mq_msg_max, ipc_ns->mq_msg_default); info->attr.mq_msgsize = min(ipc_ns->mq_msgsize_max, ipc_ns->mq_msgsize_default); |
04715206c
|
261 262 263 264 |
if (attr) { info->attr.mq_maxmsg = attr->mq_maxmsg; info->attr.mq_msgsize = attr->mq_msgsize; } |
d6629859b
|
265 266 267 268 269 270 271 272 273 274 275 276 277 |
/* * We used to allocate a static array of pointers and account * the size of that array as well as one msg_msg struct per * possible message into the queue size. That's no longer * accurate as the queue is now an rbtree and will grow and * shrink depending on usage patterns. We can, however, still * account one msg_msg struct per message, but the nodes are * allocated depending on priority usage, and most programs * only use one, or a handful, of priorities. However, since * this is pinned memory, we need to assume worst case, so * that means the min(mq_maxmsg, max_priorities) * struct * posix_msg_tree_node. */ |
05c1b2903
|
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 |
ret = -EINVAL; if (info->attr.mq_maxmsg <= 0 || info->attr.mq_msgsize <= 0) goto out_inode; if (capable(CAP_SYS_RESOURCE)) { if (info->attr.mq_maxmsg > HARD_MSGMAX || info->attr.mq_msgsize > HARD_MSGSIZEMAX) goto out_inode; } else { if (info->attr.mq_maxmsg > ipc_ns->mq_msg_max || info->attr.mq_msgsize > ipc_ns->mq_msgsize_max) goto out_inode; } ret = -EOVERFLOW; /* check for overflow */ if (info->attr.mq_msgsize > ULONG_MAX/info->attr.mq_maxmsg) goto out_inode; |
d6629859b
|
295 296 297 |
mq_treesize = info->attr.mq_maxmsg * sizeof(struct msg_msg) + min_t(unsigned int, info->attr.mq_maxmsg, MQ_PRIO_MAX) * sizeof(struct posix_msg_tree_node); |
05c1b2903
|
298 299 300 301 |
mq_bytes = info->attr.mq_maxmsg * info->attr.mq_msgsize; if (mq_bytes + mq_treesize < mq_bytes) goto out_inode; mq_bytes += mq_treesize; |
04715206c
|
302 303 |
spin_lock(&mq_lock); if (u->mq_bytes + mq_bytes < u->mq_bytes || |
2a4e64b8f
|
304 |
u->mq_bytes + mq_bytes > rlimit(RLIMIT_MSGQUEUE)) { |
04715206c
|
305 306 |
spin_unlock(&mq_lock); /* mqueue_evict_inode() releases info->messages */ |
d40dcdb01
|
307 |
ret = -EMFILE; |
04715206c
|
308 |
goto out_inode; |
1da177e4c
|
309 |
} |
04715206c
|
310 311 312 313 314 315 316 317 318 319 320 |
u->mq_bytes += mq_bytes; spin_unlock(&mq_lock); /* all is ok */ info->user = get_uid(u); } else if (S_ISDIR(mode)) { inc_nlink(inode); /* Some things misbehave if size == 0 on a directory */ inode->i_size = 2 * DIRENT_SIZE; inode->i_op = &mqueue_dir_inode_operations; inode->i_fop = &simple_dir_operations; |
1da177e4c
|
321 |
} |
04715206c
|
322 |
|
1da177e4c
|
323 324 |
return inode; out_inode: |
1da177e4c
|
325 |
iput(inode); |
04715206c
|
326 |
err: |
d40dcdb01
|
327 |
return ERR_PTR(ret); |
1da177e4c
|
328 |
} |
935c6912b
|
329 |
static int mqueue_fill_super(struct super_block *sb, struct fs_context *fc) |
1da177e4c
|
330 331 |
{ struct inode *inode; |
cfb2f6f6e
|
332 |
struct ipc_namespace *ns = sb->s_fs_info; |
1da177e4c
|
333 |
|
a2982cc92
|
334 |
sb->s_iflags |= SB_I_NOEXEC | SB_I_NODEV; |
09cbfeaf1
|
335 336 |
sb->s_blocksize = PAGE_SIZE; sb->s_blocksize_bits = PAGE_SHIFT; |
1da177e4c
|
337 338 |
sb->s_magic = MQUEUE_MAGIC; sb->s_op = &mqueue_super_ops; |
48fde701a
|
339 340 341 |
inode = mqueue_get_inode(sb, ns, S_IFDIR | S_ISVTX | S_IRWXUGO, NULL); if (IS_ERR(inode)) return PTR_ERR(inode); |
1da177e4c
|
342 |
|
48fde701a
|
343 344 345 346 |
sb->s_root = d_make_root(inode); if (!sb->s_root) return -ENOMEM; return 0; |
1da177e4c
|
347 |
} |
935c6912b
|
348 |
static int mqueue_get_tree(struct fs_context *fc) |
1da177e4c
|
349 |
{ |
935c6912b
|
350 |
struct mqueue_fs_context *ctx = fc->fs_private; |
533770cc0
|
351 |
return get_tree_keyed(fc, mqueue_fill_super, ctx->ipc_ns); |
935c6912b
|
352 353 354 355 356 |
} static void mqueue_fs_context_free(struct fs_context *fc) { struct mqueue_fs_context *ctx = fc->fs_private; |
709a643da
|
357 |
put_ipc_ns(ctx->ipc_ns); |
935c6912b
|
358 359 360 361 362 363 364 365 366 367 368 369 |
kfree(ctx); } static int mqueue_init_fs_context(struct fs_context *fc) { struct mqueue_fs_context *ctx; ctx = kzalloc(sizeof(struct mqueue_fs_context), GFP_KERNEL); if (!ctx) return -ENOMEM; ctx->ipc_ns = get_ipc_ns(current->nsproxy->ipc_ns); |
709a643da
|
370 371 |
put_user_ns(fc->user_ns); fc->user_ns = get_user_ns(ctx->ipc_ns->user_ns); |
935c6912b
|
372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 |
fc->fs_private = ctx; fc->ops = &mqueue_fs_context_ops; return 0; } static struct vfsmount *mq_create_mount(struct ipc_namespace *ns) { struct mqueue_fs_context *ctx; struct fs_context *fc; struct vfsmount *mnt; fc = fs_context_for_mount(&mqueue_fs_type, SB_KERNMOUNT); if (IS_ERR(fc)) return ERR_CAST(fc); ctx = fc->fs_private; put_ipc_ns(ctx->ipc_ns); ctx->ipc_ns = get_ipc_ns(ns); |
709a643da
|
390 391 |
put_user_ns(fc->user_ns); fc->user_ns = get_user_ns(ctx->ipc_ns->user_ns); |
935c6912b
|
392 393 394 395 |
mnt = fc_mount(fc); put_fs_context(fc); return mnt; |
1da177e4c
|
396 |
} |
51cc50685
|
397 |
static void init_once(void *foo) |
1da177e4c
|
398 399 |
{ struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo; |
a35afb830
|
400 |
inode_init_once(&p->vfs_inode); |
1da177e4c
|
401 402 403 404 405 |
} static struct inode *mqueue_alloc_inode(struct super_block *sb) { struct mqueue_inode_info *ei; |
e94b17660
|
406 |
ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL); |
1da177e4c
|
407 408 409 410 |
if (!ei) return NULL; return &ei->vfs_inode; } |
015d79561
|
411 |
static void mqueue_free_inode(struct inode *inode) |
1da177e4c
|
412 413 414 |
{ kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode)); } |
6d8af64c1
|
415 |
static void mqueue_evict_inode(struct inode *inode) |
1da177e4c
|
416 417 418 |
{ struct mqueue_inode_info *info; struct user_struct *user; |
7eafd7c74
|
419 |
struct ipc_namespace *ipc_ns; |
d6a2946a8
|
420 421 |
struct msg_msg *msg, *nmsg; LIST_HEAD(tmp_msg); |
1da177e4c
|
422 |
|
dbd5768f8
|
423 |
clear_inode(inode); |
6d8af64c1
|
424 425 |
if (S_ISDIR(inode->i_mode)) |
1da177e4c
|
426 |
return; |
6d8af64c1
|
427 |
|
7eafd7c74
|
428 |
ipc_ns = get_ns_from_inode(inode); |
1da177e4c
|
429 430 |
info = MQUEUE_I(inode); spin_lock(&info->lock); |
d6629859b
|
431 |
while ((msg = msg_get(info)) != NULL) |
d6a2946a8
|
432 |
list_add_tail(&msg->m_list, &tmp_msg); |
ce2d52cc1
|
433 |
kfree(info->node_cache); |
1da177e4c
|
434 |
spin_unlock(&info->lock); |
d6a2946a8
|
435 436 437 438 |
list_for_each_entry_safe(msg, nmsg, &tmp_msg, m_list) { list_del(&msg->m_list); free_msg(msg); } |
1da177e4c
|
439 440 |
user = info->user; if (user) { |
a318f12ed
|
441 442 443 444 445 446 447 448 449 |
unsigned long mq_bytes, mq_treesize; /* Total amount of bytes accounted for the mqueue */ mq_treesize = info->attr.mq_maxmsg * sizeof(struct msg_msg) + min_t(unsigned int, info->attr.mq_maxmsg, MQ_PRIO_MAX) * sizeof(struct posix_msg_tree_node); mq_bytes = mq_treesize + (info->attr.mq_maxmsg * info->attr.mq_msgsize); |
1da177e4c
|
450 451 |
spin_lock(&mq_lock); user->mq_bytes -= mq_bytes; |
7eafd7c74
|
452 453 454 455 456 457 458 459 |
/* * get_ns_from_inode() ensures that the * (ipc_ns = sb->s_fs_info) is either a valid ipc_ns * to which we now hold a reference, or it is NULL. * We can't put it here under mq_lock, though. */ if (ipc_ns) ipc_ns->mq_queues_count--; |
1da177e4c
|
460 461 462 |
spin_unlock(&mq_lock); free_uid(user); } |
7eafd7c74
|
463 464 |
if (ipc_ns) put_ipc_ns(ipc_ns); |
1da177e4c
|
465 |
} |
eecec19d9
|
466 |
static int mqueue_create_attr(struct dentry *dentry, umode_t mode, void *arg) |
1da177e4c
|
467 |
{ |
eecec19d9
|
468 |
struct inode *dir = dentry->d_parent->d_inode; |
1da177e4c
|
469 |
struct inode *inode; |
eecec19d9
|
470 |
struct mq_attr *attr = arg; |
1da177e4c
|
471 |
int error; |
7eafd7c74
|
472 |
struct ipc_namespace *ipc_ns; |
1da177e4c
|
473 474 |
spin_lock(&mq_lock); |
7eafd7c74
|
475 476 477 478 479 |
ipc_ns = __get_ns_from_inode(dir); if (!ipc_ns) { error = -EACCES; goto out_unlock; } |
f3713fd9c
|
480 481 482 |
if (ipc_ns->mq_queues_count >= ipc_ns->mq_queues_max && !capable(CAP_SYS_RESOURCE)) { |
1da177e4c
|
483 |
error = -ENOSPC; |
614b84cf4
|
484 |
goto out_unlock; |
1da177e4c
|
485 |
} |
614b84cf4
|
486 |
ipc_ns->mq_queues_count++; |
1da177e4c
|
487 |
spin_unlock(&mq_lock); |
7eafd7c74
|
488 |
inode = mqueue_get_inode(dir->i_sb, ipc_ns, mode, attr); |
d40dcdb01
|
489 490 |
if (IS_ERR(inode)) { error = PTR_ERR(inode); |
1da177e4c
|
491 |
spin_lock(&mq_lock); |
614b84cf4
|
492 493 |
ipc_ns->mq_queues_count--; goto out_unlock; |
1da177e4c
|
494 |
} |
7eafd7c74
|
495 |
put_ipc_ns(ipc_ns); |
1da177e4c
|
496 |
dir->i_size += DIRENT_SIZE; |
078cd8279
|
497 |
dir->i_ctime = dir->i_mtime = dir->i_atime = current_time(dir); |
1da177e4c
|
498 499 500 501 |
d_instantiate(dentry, inode); dget(dentry); return 0; |
614b84cf4
|
502 |
out_unlock: |
1da177e4c
|
503 |
spin_unlock(&mq_lock); |
7eafd7c74
|
504 505 |
if (ipc_ns) put_ipc_ns(ipc_ns); |
1da177e4c
|
506 507 |
return error; } |
eecec19d9
|
508 509 510 511 512 |
static int mqueue_create(struct inode *dir, struct dentry *dentry, umode_t mode, bool excl) { return mqueue_create_attr(dentry, mode, NULL); } |
1da177e4c
|
513 514 |
static int mqueue_unlink(struct inode *dir, struct dentry *dentry) { |
75c3cfa85
|
515 |
struct inode *inode = d_inode(dentry); |
1da177e4c
|
516 |
|
078cd8279
|
517 |
dir->i_ctime = dir->i_mtime = dir->i_atime = current_time(dir); |
1da177e4c
|
518 |
dir->i_size -= DIRENT_SIZE; |
239521f31
|
519 520 521 |
drop_nlink(inode); dput(dentry); return 0; |
1da177e4c
|
522 523 524 525 526 527 528 529 530 531 |
} /* * This is routine for system read from queue file. * To avoid mess with doing here some sort of mq_receive we allow * to read only queue size & notification info (the only values * that are interesting from user point of view and aren't accessible * through std routines) */ static ssize_t mqueue_read_file(struct file *filp, char __user *u_data, |
f1a43f93f
|
532 |
size_t count, loff_t *off) |
1da177e4c
|
533 |
{ |
496ad9aa8
|
534 |
struct mqueue_inode_info *info = MQUEUE_I(file_inode(filp)); |
1da177e4c
|
535 |
char buffer[FILENT_SIZE]; |
f1a43f93f
|
536 |
ssize_t ret; |
1da177e4c
|
537 538 539 540 541 542 543 544 545 546 |
spin_lock(&info->lock); snprintf(buffer, sizeof(buffer), "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d ", info->qsize, info->notify_owner ? info->notify.sigev_notify : 0, (info->notify_owner && info->notify.sigev_notify == SIGEV_SIGNAL) ? info->notify.sigev_signo : 0, |
6c5f3e7b4
|
547 |
pid_vnr(info->notify_owner)); |
1da177e4c
|
548 549 |
spin_unlock(&info->lock); buffer[sizeof(buffer)-1] = '\0'; |
1da177e4c
|
550 |
|
f1a43f93f
|
551 552 553 554 |
ret = simple_read_from_buffer(u_data, count, off, buffer, strlen(buffer)); if (ret <= 0) return ret; |
1da177e4c
|
555 |
|
078cd8279
|
556 |
file_inode(filp)->i_atime = file_inode(filp)->i_ctime = current_time(file_inode(filp)); |
f1a43f93f
|
557 |
return ret; |
1da177e4c
|
558 |
} |
75e1fcc0b
|
559 |
static int mqueue_flush_file(struct file *filp, fl_owner_t id) |
1da177e4c
|
560 |
{ |
496ad9aa8
|
561 |
struct mqueue_inode_info *info = MQUEUE_I(file_inode(filp)); |
1da177e4c
|
562 563 |
spin_lock(&info->lock); |
a03fcb730
|
564 |
if (task_tgid(current) == info->notify_owner) |
1da177e4c
|
565 566 567 568 569 |
remove_notification(info); spin_unlock(&info->lock); return 0; } |
9dd957485
|
570 |
static __poll_t mqueue_poll_file(struct file *filp, struct poll_table_struct *poll_tab) |
1da177e4c
|
571 |
{ |
496ad9aa8
|
572 |
struct mqueue_inode_info *info = MQUEUE_I(file_inode(filp)); |
9dd957485
|
573 |
__poll_t retval = 0; |
1da177e4c
|
574 575 576 577 578 |
poll_wait(filp, &info->wait_q, poll_tab); spin_lock(&info->lock); if (info->attr.mq_curmsgs) |
a9a08845e
|
579 |
retval = EPOLLIN | EPOLLRDNORM; |
1da177e4c
|
580 581 |
if (info->attr.mq_curmsgs < info->attr.mq_maxmsg) |
a9a08845e
|
582 |
retval |= EPOLLOUT | EPOLLWRNORM; |
1da177e4c
|
583 584 585 586 587 588 589 590 591 592 |
spin_unlock(&info->lock); return retval; } /* Adds current to info->e_wait_q[sr] before element with smaller prio */ static void wq_add(struct mqueue_inode_info *info, int sr, struct ext_wait_queue *ewp) { struct ext_wait_queue *walk; |
1da177e4c
|
593 |
list_for_each_entry(walk, &info->e_wait_q[sr].list, list) { |
68e34f4e8
|
594 |
if (walk->task->prio <= current->prio) { |
1da177e4c
|
595 596 597 598 599 600 601 602 603 604 605 606 607 |
list_add_tail(&ewp->list, &walk->list); return; } } list_add_tail(&ewp->list, &info->e_wait_q[sr].list); } /* * Puts current task to sleep. Caller must hold queue lock. After return * lock isn't held. * sr: SEND or RECV */ static int wq_sleep(struct mqueue_inode_info *info, int sr, |
9ca7d8e68
|
608 |
ktime_t *timeout, struct ext_wait_queue *ewp) |
eac0b1c36
|
609 |
__releases(&info->lock) |
1da177e4c
|
610 611 612 613 614 615 616 |
{ int retval; signed long time; wq_add(info, sr, ewp); for (;;) { |
fa6004ad4
|
617 |
__set_current_state(TASK_INTERRUPTIBLE); |
1da177e4c
|
618 619 |
spin_unlock(&info->lock); |
32ea845d5
|
620 621 |
time = schedule_hrtimeout_range_clock(timeout, 0, HRTIMER_MODE_ABS, CLOCK_REALTIME); |
1da177e4c
|
622 |
|
1da177e4c
|
623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 |
if (ewp->state == STATE_READY) { retval = 0; goto out; } spin_lock(&info->lock); if (ewp->state == STATE_READY) { retval = 0; goto out_unlock; } if (signal_pending(current)) { retval = -ERESTARTSYS; break; } if (time == 0) { retval = -ETIMEDOUT; break; } } list_del(&ewp->list); out_unlock: spin_unlock(&info->lock); out: return retval; } /* * Returns waiting task that should be serviced first or NULL if none exists */ static struct ext_wait_queue *wq_get_first_waiter( struct mqueue_inode_info *info, int sr) { struct list_head *ptr; ptr = info->e_wait_q[sr].list.prev; if (ptr == &info->e_wait_q[sr].list) return NULL; return list_entry(ptr, struct ext_wait_queue, list); } |
1da177e4c
|
661 662 663 |
static inline void set_cookie(struct sk_buff *skb, char code) { |
239521f31
|
664 |
((char *)skb->data)[NOTIFY_COOKIE_LEN-1] = code; |
1da177e4c
|
665 666 667 668 669 670 671 672 673 674 675 676 677 678 |
} /* * The next function is only to split too long sys_mq_timedsend */ static void __do_notify(struct mqueue_inode_info *info) { /* notification * invoked when there is registered process and there isn't process * waiting synchronously for message AND state of queue changed from * empty to not empty. Here we are sure that no one is waiting * synchronously. */ if (info->notify_owner && info->attr.mq_curmsgs == 1) { |
ae7795bc6
|
679 |
struct kernel_siginfo sig_i; |
1da177e4c
|
680 681 682 683 684 |
switch (info->notify.sigev_notify) { case SIGEV_NONE: break; case SIGEV_SIGNAL: /* sends signal */ |
faf1f22b6
|
685 |
clear_siginfo(&sig_i); |
1da177e4c
|
686 687 688 689 |
sig_i.si_signo = info->notify.sigev_signo; sig_i.si_errno = 0; sig_i.si_code = SI_MESGQ; sig_i.si_value = info->notify.sigev_value; |
6b550f949
|
690 691 |
/* map current pid/uid into info->owner's namespaces */ rcu_read_lock(); |
a6684999f
|
692 693 |
sig_i.si_pid = task_tgid_nr_ns(current, ns_of_pid(info->notify_owner)); |
76b6db010
|
694 |
sig_i.si_uid = from_kuid_munged(info->notify_user_ns, current_uid()); |
6b550f949
|
695 |
rcu_read_unlock(); |
1da177e4c
|
696 |
|
a03fcb730
|
697 698 |
kill_pid_info(info->notify.sigev_signo, &sig_i, info->notify_owner); |
1da177e4c
|
699 700 701 |
break; case SIGEV_THREAD: set_cookie(info->notify_cookie, NOTIFY_WOKENUP); |
7ee015e0f
|
702 |
netlink_sendskb(info->notify_sock, info->notify_cookie); |
1da177e4c
|
703 704 705 |
break; } /* after notification unregisters process */ |
a03fcb730
|
706 |
put_pid(info->notify_owner); |
6f9ac6d93
|
707 |
put_user_ns(info->notify_user_ns); |
a03fcb730
|
708 |
info->notify_owner = NULL; |
6f9ac6d93
|
709 |
info->notify_user_ns = NULL; |
1da177e4c
|
710 711 712 |
} wake_up(&info->wait_q); } |
21fc538d8
|
713 |
static int prepare_timeout(const struct __kernel_timespec __user *u_abs_timeout, |
b90477263
|
714 |
struct timespec64 *ts) |
1da177e4c
|
715 |
{ |
b90477263
|
716 |
if (get_timespec64(ts, u_abs_timeout)) |
9ca7d8e68
|
717 |
return -EFAULT; |
b90477263
|
718 |
if (!timespec64_valid(ts)) |
9ca7d8e68
|
719 |
return -EINVAL; |
9ca7d8e68
|
720 |
return 0; |
1da177e4c
|
721 722 723 724 |
} static void remove_notification(struct mqueue_inode_info *info) { |
a03fcb730
|
725 |
if (info->notify_owner != NULL && |
1da177e4c
|
726 727 |
info->notify.sigev_notify == SIGEV_THREAD) { set_cookie(info->notify_cookie, NOTIFY_REMOVED); |
7ee015e0f
|
728 |
netlink_sendskb(info->notify_sock, info->notify_cookie); |
1da177e4c
|
729 |
} |
a03fcb730
|
730 |
put_pid(info->notify_owner); |
6f9ac6d93
|
731 |
put_user_ns(info->notify_user_ns); |
a03fcb730
|
732 |
info->notify_owner = NULL; |
6f9ac6d93
|
733 |
info->notify_user_ns = NULL; |
1da177e4c
|
734 |
} |
066cc813e
|
735 736 |
static int prepare_open(struct dentry *dentry, int oflag, int ro, umode_t mode, struct filename *name, |
614b84cf4
|
737 |
struct mq_attr *attr) |
1da177e4c
|
738 |
{ |
745ca2475
|
739 740 |
static const int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE, MAY_READ | MAY_WRITE }; |
765927b2d
|
741 |
int acc; |
066cc813e
|
742 |
|
9b20d7fc5
|
743 744 |
if (d_really_is_negative(dentry)) { if (!(oflag & O_CREAT)) |
066cc813e
|
745 |
return -ENOENT; |
9b20d7fc5
|
746 747 748 749 750 |
if (ro) return ro; audit_inode_parent_hidden(name, dentry->d_parent); return vfs_mkobj(dentry, mode & ~current_umask(), mqueue_create_attr, attr); |
066cc813e
|
751 |
} |
9b20d7fc5
|
752 753 754 755 |
/* it already existed */ audit_inode(name, dentry, 0); if ((oflag & (O_CREAT|O_EXCL)) == (O_CREAT|O_EXCL)) return -EEXIST; |
765927b2d
|
756 |
if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) |
af4a5372e
|
757 |
return -EINVAL; |
765927b2d
|
758 |
acc = oflag2acc[oflag & O_ACCMODE]; |
066cc813e
|
759 |
return inode_permission(d_inode(dentry), acc); |
1da177e4c
|
760 |
} |
0d0606060
|
761 762 |
static int do_mq_open(const char __user *u_name, int oflag, umode_t mode, struct mq_attr *attr) |
1da177e4c
|
763 |
{ |
cfb2f6f6e
|
764 765 |
struct vfsmount *mnt = current->nsproxy->ipc_ns->mq_mnt; struct dentry *root = mnt->mnt_root; |
91a27b2a7
|
766 |
struct filename *name; |
a713fd7f5
|
767 |
struct path path; |
1da177e4c
|
768 |
int fd, error; |
312b90fbe
|
769 |
int ro; |
1da177e4c
|
770 |
|
0d0606060
|
771 |
audit_mq_open(oflag, mode, attr); |
20ca73bc7
|
772 |
|
1da177e4c
|
773 774 |
if (IS_ERR(name = getname(u_name))) return PTR_ERR(name); |
269f21344
|
775 |
fd = get_unused_fd_flags(O_CLOEXEC); |
1da177e4c
|
776 777 |
if (fd < 0) goto out_putname; |
312b90fbe
|
778 |
ro = mnt_want_write(mnt); /* we'll drop it in any case */ |
5955102c9
|
779 |
inode_lock(d_inode(root)); |
91a27b2a7
|
780 |
path.dentry = lookup_one_len(name->name, root, strlen(name->name)); |
765927b2d
|
781 782 |
if (IS_ERR(path.dentry)) { error = PTR_ERR(path.dentry); |
4294a8eed
|
783 |
goto out_putfd; |
1da177e4c
|
784 |
} |
312b90fbe
|
785 |
path.mnt = mntget(mnt); |
066cc813e
|
786 787 788 789 790 791 792 |
error = prepare_open(path.dentry, oflag, ro, mode, name, attr); if (!error) { struct file *file = dentry_open(&path, oflag, current_cred()); if (!IS_ERR(file)) fd_install(fd, file); else error = PTR_ERR(file); |
7c7dce920
|
793 |
} |
765927b2d
|
794 |
path_put(&path); |
7c7dce920
|
795 |
out_putfd: |
765927b2d
|
796 797 798 799 |
if (error) { put_unused_fd(fd); fd = error; } |
5955102c9
|
800 |
inode_unlock(d_inode(root)); |
38d78e587
|
801 802 |
if (!ro) mnt_drop_write(mnt); |
1da177e4c
|
803 804 805 806 |
out_putname: putname(name); return fd; } |
0d0606060
|
807 808 809 810 811 812 813 814 815 |
SYSCALL_DEFINE4(mq_open, const char __user *, u_name, int, oflag, umode_t, mode, struct mq_attr __user *, u_attr) { struct mq_attr attr; if (u_attr && copy_from_user(&attr, u_attr, sizeof(struct mq_attr))) return -EFAULT; return do_mq_open(u_name, oflag, mode, u_attr ? &attr : NULL); } |
d5460c997
|
816 |
SYSCALL_DEFINE1(mq_unlink, const char __user *, u_name) |
1da177e4c
|
817 818 |
{ int err; |
91a27b2a7
|
819 |
struct filename *name; |
1da177e4c
|
820 821 |
struct dentry *dentry; struct inode *inode = NULL; |
7eafd7c74
|
822 |
struct ipc_namespace *ipc_ns = current->nsproxy->ipc_ns; |
312b90fbe
|
823 |
struct vfsmount *mnt = ipc_ns->mq_mnt; |
1da177e4c
|
824 825 826 827 |
name = getname(u_name); if (IS_ERR(name)) return PTR_ERR(name); |
79f6530cb
|
828 |
audit_inode_parent_hidden(name, mnt->mnt_root); |
312b90fbe
|
829 830 831 |
err = mnt_want_write(mnt); if (err) goto out_name; |
5955102c9
|
832 |
inode_lock_nested(d_inode(mnt->mnt_root), I_MUTEX_PARENT); |
91a27b2a7
|
833 834 |
dentry = lookup_one_len(name->name, mnt->mnt_root, strlen(name->name)); |
1da177e4c
|
835 836 837 838 |
if (IS_ERR(dentry)) { err = PTR_ERR(dentry); goto out_unlock; } |
75c3cfa85
|
839 |
inode = d_inode(dentry); |
312b90fbe
|
840 841 842 |
if (!inode) { err = -ENOENT; } else { |
7de9c6ee3
|
843 |
ihold(inode); |
75c3cfa85
|
844 |
err = vfs_unlink(d_inode(dentry->d_parent), dentry, NULL); |
312b90fbe
|
845 |
} |
1da177e4c
|
846 847 848 |
dput(dentry); out_unlock: |
5955102c9
|
849 |
inode_unlock(d_inode(mnt->mnt_root)); |
1da177e4c
|
850 851 |
if (inode) iput(inode); |
312b90fbe
|
852 853 854 |
mnt_drop_write(mnt); out_name: putname(name); |
1da177e4c
|
855 856 857 858 859 860 861 862 863 864 |
return err; } /* Pipelined send and receive functions. * * If a receiver finds no waiting message, then it registers itself in the * list of waiting receivers. A sender checks that list before adding the new * message into the message array. If there is a waiting receiver, then it * bypasses the message array and directly hands the message over to the |
fa6004ad4
|
865 866 867 868 869 870 871 872 873 |
* receiver. The receiver accepts the message and returns without grabbing the * queue spinlock: * * - Set pointer to message. * - Queue the receiver task for later wakeup (without the info->lock). * - Update its state to STATE_READY. Now the receiver can continue. * - Wake up the process after the lock is dropped. Should the process wake up * before this wakeup (due to a timeout or a signal) it will either see * STATE_READY and continue or acquire the lock to check the state again. |
1da177e4c
|
874 875 876 877 878 879 880 |
* * The same algorithm is used for senders. */ /* pipelined_send() - send a message directly to the task waiting in * sys_mq_timedreceive() (without inserting message into a queue). */ |
fa6004ad4
|
881 882 |
static inline void pipelined_send(struct wake_q_head *wake_q, struct mqueue_inode_info *info, |
1da177e4c
|
883 884 885 886 887 |
struct msg_msg *message, struct ext_wait_queue *receiver) { receiver->msg = message; list_del(&receiver->list); |
fa6004ad4
|
888 889 890 891 892 893 894 895 896 |
wake_q_add(wake_q, receiver->task); /* * Rely on the implicit cmpxchg barrier from wake_q_add such * that we can ensure that updating receiver->state is the last * write operation: As once set, the receiver can continue, * and if we don't have the reference count from the wake_q, * yet, at that point we can later have a use-after-free * condition and bogus wakeup. */ |
1da177e4c
|
897 898 899 900 901 |
receiver->state = STATE_READY; } /* pipelined_receive() - if there is task waiting in sys_mq_timedsend() * gets its message and put to the queue (we have one free place for sure). */ |
fa6004ad4
|
902 903 |
static inline void pipelined_receive(struct wake_q_head *wake_q, struct mqueue_inode_info *info) |
1da177e4c
|
904 905 906 907 908 909 910 911 |
{ struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND); if (!sender) { /* for poll */ wake_up_interruptible(&info->wait_q); return; } |
d6629859b
|
912 913 |
if (msg_insert(sender->msg, info)) return; |
fa6004ad4
|
914 |
|
1da177e4c
|
915 |
list_del(&sender->list); |
fa6004ad4
|
916 |
wake_q_add(wake_q, sender->task); |
1da177e4c
|
917 918 |
sender->state = STATE_READY; } |
0d0606060
|
919 920 |
static int do_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr, size_t msg_len, unsigned int msg_prio, |
b90477263
|
921 |
struct timespec64 *ts) |
1da177e4c
|
922 |
{ |
2903ff019
|
923 |
struct fd f; |
1da177e4c
|
924 925 926 927 928 |
struct inode *inode; struct ext_wait_queue wait; struct ext_wait_queue *receiver; struct msg_msg *msg_ptr; struct mqueue_inode_info *info; |
9ca7d8e68
|
929 |
ktime_t expires, *timeout = NULL; |
ce2d52cc1
|
930 |
struct posix_msg_tree_node *new_leaf = NULL; |
2903ff019
|
931 |
int ret = 0; |
194a6b5b9
|
932 |
DEFINE_WAKE_Q(wake_q); |
1da177e4c
|
933 934 935 |
if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX)) return -EINVAL; |
0d0606060
|
936 |
if (ts) { |
b90477263
|
937 |
expires = timespec64_to_ktime(*ts); |
0d0606060
|
938 939 940 941 |
timeout = &expires; } audit_mq_sendrecv(mqdes, msg_len, msg_prio, ts); |
1da177e4c
|
942 |
|
2903ff019
|
943 944 |
f = fdget(mqdes); if (unlikely(!f.file)) { |
8d8ffefaa
|
945 |
ret = -EBADF; |
1da177e4c
|
946 |
goto out; |
8d8ffefaa
|
947 |
} |
1da177e4c
|
948 |
|
496ad9aa8
|
949 |
inode = file_inode(f.file); |
2903ff019
|
950 |
if (unlikely(f.file->f_op != &mqueue_file_operations)) { |
8d8ffefaa
|
951 |
ret = -EBADF; |
1da177e4c
|
952 |
goto out_fput; |
8d8ffefaa
|
953 |
} |
1da177e4c
|
954 |
info = MQUEUE_I(inode); |
9f45f5bf3
|
955 |
audit_file(f.file); |
1da177e4c
|
956 |
|
2903ff019
|
957 |
if (unlikely(!(f.file->f_mode & FMODE_WRITE))) { |
8d8ffefaa
|
958 |
ret = -EBADF; |
1da177e4c
|
959 |
goto out_fput; |
8d8ffefaa
|
960 |
} |
1da177e4c
|
961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 |
if (unlikely(msg_len > info->attr.mq_msgsize)) { ret = -EMSGSIZE; goto out_fput; } /* First try to allocate memory, before doing anything with * existing queues. */ msg_ptr = load_msg(u_msg_ptr, msg_len); if (IS_ERR(msg_ptr)) { ret = PTR_ERR(msg_ptr); goto out_fput; } msg_ptr->m_ts = msg_len; msg_ptr->m_type = msg_prio; |
ce2d52cc1
|
976 977 978 979 980 981 982 |
/* * msg_insert really wants us to have a valid, spare node struct so * it doesn't have to kmalloc a GFP_ATOMIC allocation, but it will * fall back to that if necessary. */ if (!info->node_cache) new_leaf = kmalloc(sizeof(*new_leaf), GFP_KERNEL); |
1da177e4c
|
983 |
spin_lock(&info->lock); |
ce2d52cc1
|
984 985 |
if (!info->node_cache && new_leaf) { /* Save our speculative allocation into the cache */ |
ce2d52cc1
|
986 987 |
INIT_LIST_HEAD(&new_leaf->msg_list); info->node_cache = new_leaf; |
ce2d52cc1
|
988 989 990 991 |
new_leaf = NULL; } else { kfree(new_leaf); } |
1da177e4c
|
992 |
if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) { |
2903ff019
|
993 |
if (f.file->f_flags & O_NONBLOCK) { |
1da177e4c
|
994 |
ret = -EAGAIN; |
1da177e4c
|
995 996 997 998 999 |
} else { wait.task = current; wait.msg = (void *) msg_ptr; wait.state = STATE_NONE; ret = wq_sleep(info, SEND, timeout, &wait); |
ce2d52cc1
|
1000 1001 1002 1003 1004 |
/* * wq_sleep must be called with info->lock held, and * returns with the lock released */ goto out_free; |
1da177e4c
|
1005 |
} |
1da177e4c
|
1006 1007 1008 |
} else { receiver = wq_get_first_waiter(info, RECV); if (receiver) { |
fa6004ad4
|
1009 |
pipelined_send(&wake_q, info, msg_ptr, receiver); |
1da177e4c
|
1010 1011 |
} else { /* adds message to the queue */ |
ce2d52cc1
|
1012 1013 1014 |
ret = msg_insert(msg_ptr, info); if (ret) goto out_unlock; |
1da177e4c
|
1015 1016 1017 |
__do_notify(info); } inode->i_atime = inode->i_mtime = inode->i_ctime = |
078cd8279
|
1018 |
current_time(inode); |
1da177e4c
|
1019 |
} |
ce2d52cc1
|
1020 1021 |
out_unlock: spin_unlock(&info->lock); |
fa6004ad4
|
1022 |
wake_up_q(&wake_q); |
ce2d52cc1
|
1023 1024 1025 |
out_free: if (ret) free_msg(msg_ptr); |
1da177e4c
|
1026 |
out_fput: |
2903ff019
|
1027 |
fdput(f); |
1da177e4c
|
1028 1029 1030 |
out: return ret; } |
0d0606060
|
1031 1032 |
static int do_mq_timedreceive(mqd_t mqdes, char __user *u_msg_ptr, size_t msg_len, unsigned int __user *u_msg_prio, |
b90477263
|
1033 |
struct timespec64 *ts) |
1da177e4c
|
1034 |
{ |
1da177e4c
|
1035 1036 |
ssize_t ret; struct msg_msg *msg_ptr; |
2903ff019
|
1037 |
struct fd f; |
1da177e4c
|
1038 1039 1040 |
struct inode *inode; struct mqueue_inode_info *info; struct ext_wait_queue wait; |
9ca7d8e68
|
1041 |
ktime_t expires, *timeout = NULL; |
ce2d52cc1
|
1042 |
struct posix_msg_tree_node *new_leaf = NULL; |
1da177e4c
|
1043 |
|
0d0606060
|
1044 |
if (ts) { |
b90477263
|
1045 |
expires = timespec64_to_ktime(*ts); |
9ca7d8e68
|
1046 |
timeout = &expires; |
c32c8af43
|
1047 |
} |
20ca73bc7
|
1048 |
|
0d0606060
|
1049 |
audit_mq_sendrecv(mqdes, msg_len, 0, ts); |
1da177e4c
|
1050 |
|
2903ff019
|
1051 1052 |
f = fdget(mqdes); if (unlikely(!f.file)) { |
8d8ffefaa
|
1053 |
ret = -EBADF; |
1da177e4c
|
1054 |
goto out; |
8d8ffefaa
|
1055 |
} |
1da177e4c
|
1056 |
|
496ad9aa8
|
1057 |
inode = file_inode(f.file); |
2903ff019
|
1058 |
if (unlikely(f.file->f_op != &mqueue_file_operations)) { |
8d8ffefaa
|
1059 |
ret = -EBADF; |
1da177e4c
|
1060 |
goto out_fput; |
8d8ffefaa
|
1061 |
} |
1da177e4c
|
1062 |
info = MQUEUE_I(inode); |
9f45f5bf3
|
1063 |
audit_file(f.file); |
1da177e4c
|
1064 |
|
2903ff019
|
1065 |
if (unlikely(!(f.file->f_mode & FMODE_READ))) { |
8d8ffefaa
|
1066 |
ret = -EBADF; |
1da177e4c
|
1067 |
goto out_fput; |
8d8ffefaa
|
1068 |
} |
1da177e4c
|
1069 1070 1071 1072 1073 1074 |
/* checks if buffer is big enough */ if (unlikely(msg_len < info->attr.mq_msgsize)) { ret = -EMSGSIZE; goto out_fput; } |
ce2d52cc1
|
1075 1076 1077 1078 1079 1080 1081 |
/* * msg_insert really wants us to have a valid, spare node struct so * it doesn't have to kmalloc a GFP_ATOMIC allocation, but it will * fall back to that if necessary. */ if (!info->node_cache) new_leaf = kmalloc(sizeof(*new_leaf), GFP_KERNEL); |
1da177e4c
|
1082 |
spin_lock(&info->lock); |
ce2d52cc1
|
1083 1084 1085 |
if (!info->node_cache && new_leaf) { /* Save our speculative allocation into the cache */ |
ce2d52cc1
|
1086 1087 |
INIT_LIST_HEAD(&new_leaf->msg_list); info->node_cache = new_leaf; |
ce2d52cc1
|
1088 1089 1090 |
} else { kfree(new_leaf); } |
1da177e4c
|
1091 |
if (info->attr.mq_curmsgs == 0) { |
2903ff019
|
1092 |
if (f.file->f_flags & O_NONBLOCK) { |
1da177e4c
|
1093 1094 |
spin_unlock(&info->lock); ret = -EAGAIN; |
1da177e4c
|
1095 1096 1097 1098 1099 1100 1101 |
} else { wait.task = current; wait.state = STATE_NONE; ret = wq_sleep(info, RECV, timeout, &wait); msg_ptr = wait.msg; } } else { |
194a6b5b9
|
1102 |
DEFINE_WAKE_Q(wake_q); |
fa6004ad4
|
1103 |
|
1da177e4c
|
1104 1105 1106 |
msg_ptr = msg_get(info); inode->i_atime = inode->i_mtime = inode->i_ctime = |
078cd8279
|
1107 |
current_time(inode); |
1da177e4c
|
1108 1109 |
/* There is now free space in queue. */ |
fa6004ad4
|
1110 |
pipelined_receive(&wake_q, info); |
1da177e4c
|
1111 |
spin_unlock(&info->lock); |
fa6004ad4
|
1112 |
wake_up_q(&wake_q); |
1da177e4c
|
1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 |
ret = 0; } if (ret == 0) { ret = msg_ptr->m_ts; if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) || store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) { ret = -EFAULT; } free_msg(msg_ptr); } out_fput: |
2903ff019
|
1125 |
fdput(f); |
1da177e4c
|
1126 1127 1128 |
out: return ret; } |
0d0606060
|
1129 1130 |
SYSCALL_DEFINE5(mq_timedsend, mqd_t, mqdes, const char __user *, u_msg_ptr, size_t, msg_len, unsigned int, msg_prio, |
21fc538d8
|
1131 |
const struct __kernel_timespec __user *, u_abs_timeout) |
0d0606060
|
1132 |
{ |
b90477263
|
1133 |
struct timespec64 ts, *p = NULL; |
0d0606060
|
1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 |
if (u_abs_timeout) { int res = prepare_timeout(u_abs_timeout, &ts); if (res) return res; p = &ts; } return do_mq_timedsend(mqdes, u_msg_ptr, msg_len, msg_prio, p); } SYSCALL_DEFINE5(mq_timedreceive, mqd_t, mqdes, char __user *, u_msg_ptr, size_t, msg_len, unsigned int __user *, u_msg_prio, |
21fc538d8
|
1145 |
const struct __kernel_timespec __user *, u_abs_timeout) |
0d0606060
|
1146 |
{ |
b90477263
|
1147 |
struct timespec64 ts, *p = NULL; |
0d0606060
|
1148 1149 1150 1151 1152 1153 1154 1155 |
if (u_abs_timeout) { int res = prepare_timeout(u_abs_timeout, &ts); if (res) return res; p = &ts; } return do_mq_timedreceive(mqdes, u_msg_ptr, msg_len, u_msg_prio, p); } |
1da177e4c
|
1156 1157 1158 1159 1160 |
/* * Notes: the case when user wants us to deregister (with NULL as pointer) * and he isn't currently owner of notification, will be silently discarded. * It isn't explicitly defined in the POSIX. */ |
0d0606060
|
1161 |
static int do_mq_notify(mqd_t mqdes, const struct sigevent *notification) |
1da177e4c
|
1162 |
{ |
2903ff019
|
1163 1164 |
int ret; struct fd f; |
1da177e4c
|
1165 1166 |
struct sock *sock; struct inode *inode; |
1da177e4c
|
1167 1168 |
struct mqueue_inode_info *info; struct sk_buff *nc; |
0d0606060
|
1169 |
audit_mq_notify(mqdes, notification); |
1da177e4c
|
1170 |
|
20114f71b
|
1171 1172 |
nc = NULL; sock = NULL; |
0d0606060
|
1173 1174 1175 1176 |
if (notification != NULL) { if (unlikely(notification->sigev_notify != SIGEV_NONE && notification->sigev_notify != SIGEV_SIGNAL && notification->sigev_notify != SIGEV_THREAD)) |
1da177e4c
|
1177 |
return -EINVAL; |
0d0606060
|
1178 1179 |
if (notification->sigev_notify == SIGEV_SIGNAL && !valid_signal(notification->sigev_signo)) { |
1da177e4c
|
1180 1181 |
return -EINVAL; } |
0d0606060
|
1182 |
if (notification->sigev_notify == SIGEV_THREAD) { |
c3d8d1e30
|
1183 |
long timeo; |
1da177e4c
|
1184 1185 |
/* create the notify skb */ nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL); |
c231740dd
|
1186 1187 |
if (!nc) return -ENOMEM; |
1da177e4c
|
1188 |
if (copy_from_user(nc->data, |
0d0606060
|
1189 |
notification->sigev_value.sival_ptr, |
1da177e4c
|
1190 |
NOTIFY_COOKIE_LEN)) { |
8d8ffefaa
|
1191 |
ret = -EFAULT; |
c231740dd
|
1192 |
goto free_skb; |
1da177e4c
|
1193 1194 1195 1196 1197 1198 |
} /* TODO: add a header? */ skb_put(nc, NOTIFY_COOKIE_LEN); /* and attach it to the socket */ retry: |
0d0606060
|
1199 |
f = fdget(notification->sigev_signo); |
2903ff019
|
1200 |
if (!f.file) { |
8d8ffefaa
|
1201 |
ret = -EBADF; |
1da177e4c
|
1202 |
goto out; |
8d8ffefaa
|
1203 |
} |
2903ff019
|
1204 1205 |
sock = netlink_getsockbyfilp(f.file); fdput(f); |
1da177e4c
|
1206 1207 |
if (IS_ERR(sock)) { ret = PTR_ERR(sock); |
c231740dd
|
1208 |
goto free_skb; |
1da177e4c
|
1209 |
} |
c3d8d1e30
|
1210 |
timeo = MAX_SCHEDULE_TIMEOUT; |
9457afee8
|
1211 |
ret = netlink_attachskb(sock, nc, &timeo, NULL); |
f991af3da
|
1212 1213 |
if (ret == 1) { sock = NULL; |
8d8ffefaa
|
1214 |
goto retry; |
f991af3da
|
1215 |
} |
c231740dd
|
1216 1217 |
if (ret) return ret; |
1da177e4c
|
1218 1219 |
} } |
2903ff019
|
1220 1221 |
f = fdget(mqdes); if (!f.file) { |
8d8ffefaa
|
1222 |
ret = -EBADF; |
1da177e4c
|
1223 |
goto out; |
8d8ffefaa
|
1224 |
} |
1da177e4c
|
1225 |
|
496ad9aa8
|
1226 |
inode = file_inode(f.file); |
2903ff019
|
1227 |
if (unlikely(f.file->f_op != &mqueue_file_operations)) { |
8d8ffefaa
|
1228 |
ret = -EBADF; |
1da177e4c
|
1229 |
goto out_fput; |
8d8ffefaa
|
1230 |
} |
1da177e4c
|
1231 1232 1233 1234 |
info = MQUEUE_I(inode); ret = 0; spin_lock(&info->lock); |
0d0606060
|
1235 |
if (notification == NULL) { |
a03fcb730
|
1236 |
if (info->notify_owner == task_tgid(current)) { |
1da177e4c
|
1237 |
remove_notification(info); |
078cd8279
|
1238 |
inode->i_atime = inode->i_ctime = current_time(inode); |
1da177e4c
|
1239 |
} |
a03fcb730
|
1240 |
} else if (info->notify_owner != NULL) { |
1da177e4c
|
1241 1242 |
ret = -EBUSY; } else { |
0d0606060
|
1243 |
switch (notification->sigev_notify) { |
1da177e4c
|
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 |
case SIGEV_NONE: info->notify.sigev_notify = SIGEV_NONE; break; case SIGEV_THREAD: info->notify_sock = sock; info->notify_cookie = nc; sock = NULL; nc = NULL; info->notify.sigev_notify = SIGEV_THREAD; break; case SIGEV_SIGNAL: |
0d0606060
|
1255 1256 |
info->notify.sigev_signo = notification->sigev_signo; info->notify.sigev_value = notification->sigev_value; |
1da177e4c
|
1257 1258 1259 |
info->notify.sigev_notify = SIGEV_SIGNAL; break; } |
a03fcb730
|
1260 1261 |
info->notify_owner = get_pid(task_tgid(current)); |
6f9ac6d93
|
1262 |
info->notify_user_ns = get_user_ns(current_user_ns()); |
078cd8279
|
1263 |
inode->i_atime = inode->i_ctime = current_time(inode); |
1da177e4c
|
1264 1265 1266 |
} spin_unlock(&info->lock); out_fput: |
2903ff019
|
1267 |
fdput(f); |
1da177e4c
|
1268 |
out: |
3ab08fe20
|
1269 |
if (sock) |
1da177e4c
|
1270 |
netlink_detachskb(sock, nc); |
97b0b1ad5
|
1271 |
else |
c231740dd
|
1272 |
free_skb: |
1da177e4c
|
1273 |
dev_kfree_skb(nc); |
3ab08fe20
|
1274 |
|
1da177e4c
|
1275 1276 |
return ret; } |
0d0606060
|
1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 |
SYSCALL_DEFINE2(mq_notify, mqd_t, mqdes, const struct sigevent __user *, u_notification) { struct sigevent n, *p = NULL; if (u_notification) { if (copy_from_user(&n, u_notification, sizeof(struct sigevent))) return -EFAULT; p = &n; } return do_mq_notify(mqdes, p); } static int do_mq_getsetattr(int mqdes, struct mq_attr *new, struct mq_attr *old) |
1da177e4c
|
1290 |
{ |
2903ff019
|
1291 |
struct fd f; |
1da177e4c
|
1292 1293 |
struct inode *inode; struct mqueue_inode_info *info; |
0d0606060
|
1294 1295 |
if (new && (new->mq_flags & (~O_NONBLOCK))) return -EINVAL; |
1da177e4c
|
1296 |
|
2903ff019
|
1297 |
f = fdget(mqdes); |
0d0606060
|
1298 1299 |
if (!f.file) return -EBADF; |
1da177e4c
|
1300 |
|
2903ff019
|
1301 |
if (unlikely(f.file->f_op != &mqueue_file_operations)) { |
0d0606060
|
1302 1303 |
fdput(f); return -EBADF; |
8d8ffefaa
|
1304 |
} |
0d0606060
|
1305 1306 |
inode = file_inode(f.file); |
1da177e4c
|
1307 1308 1309 |
info = MQUEUE_I(inode); spin_lock(&info->lock); |
0d0606060
|
1310 1311 1312 1313 1314 1315 |
if (old) { *old = info->attr; old->mq_flags = f.file->f_flags & O_NONBLOCK; } if (new) { audit_mq_getsetattr(mqdes, new); |
2903ff019
|
1316 |
spin_lock(&f.file->f_lock); |
0d0606060
|
1317 |
if (new->mq_flags & O_NONBLOCK) |
2903ff019
|
1318 |
f.file->f_flags |= O_NONBLOCK; |
1da177e4c
|
1319 |
else |
2903ff019
|
1320 1321 |
f.file->f_flags &= ~O_NONBLOCK; spin_unlock(&f.file->f_lock); |
1da177e4c
|
1322 |
|
078cd8279
|
1323 |
inode->i_atime = inode->i_ctime = current_time(inode); |
1da177e4c
|
1324 1325 1326 |
} spin_unlock(&info->lock); |
0d0606060
|
1327 1328 1329 |
fdput(f); return 0; } |
1da177e4c
|
1330 |
|
0d0606060
|
1331 1332 1333 1334 1335 1336 1337 |
SYSCALL_DEFINE3(mq_getsetattr, mqd_t, mqdes, const struct mq_attr __user *, u_mqstat, struct mq_attr __user *, u_omqstat) { int ret; struct mq_attr mqstat, omqstat; struct mq_attr *new = NULL, *old = NULL; |
1da177e4c
|
1338 |
|
0d0606060
|
1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 |
if (u_mqstat) { new = &mqstat; if (copy_from_user(new, u_mqstat, sizeof(struct mq_attr))) return -EFAULT; } if (u_omqstat) old = &omqstat; ret = do_mq_getsetattr(mqdes, new, old); if (ret || !old) return ret; if (copy_to_user(u_omqstat, old, sizeof(struct mq_attr))) return -EFAULT; return 0; } #ifdef CONFIG_COMPAT struct compat_mq_attr { compat_long_t mq_flags; /* message queue flags */ compat_long_t mq_maxmsg; /* maximum number of messages */ compat_long_t mq_msgsize; /* maximum message size */ compat_long_t mq_curmsgs; /* number of messages currently queued */ compat_long_t __reserved[4]; /* ignored for input, zeroed for output */ }; static inline int get_compat_mq_attr(struct mq_attr *attr, const struct compat_mq_attr __user *uattr) { struct compat_mq_attr v; if (copy_from_user(&v, uattr, sizeof(*uattr))) return -EFAULT; memset(attr, 0, sizeof(*attr)); attr->mq_flags = v.mq_flags; attr->mq_maxmsg = v.mq_maxmsg; attr->mq_msgsize = v.mq_msgsize; attr->mq_curmsgs = v.mq_curmsgs; return 0; } static inline int put_compat_mq_attr(const struct mq_attr *attr, struct compat_mq_attr __user *uattr) { struct compat_mq_attr v; memset(&v, 0, sizeof(v)); v.mq_flags = attr->mq_flags; v.mq_maxmsg = attr->mq_maxmsg; v.mq_msgsize = attr->mq_msgsize; v.mq_curmsgs = attr->mq_curmsgs; if (copy_to_user(uattr, &v, sizeof(*uattr))) return -EFAULT; return 0; } COMPAT_SYSCALL_DEFINE4(mq_open, const char __user *, u_name, int, oflag, compat_mode_t, mode, struct compat_mq_attr __user *, u_attr) { struct mq_attr attr, *p = NULL; if (u_attr && oflag & O_CREAT) { p = &attr; if (get_compat_mq_attr(&attr, u_attr)) return -EFAULT; } return do_mq_open(u_name, oflag, mode, p); } |
b0d175781
|
1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 |
COMPAT_SYSCALL_DEFINE2(mq_notify, mqd_t, mqdes, const struct compat_sigevent __user *, u_notification) { struct sigevent n, *p = NULL; if (u_notification) { if (get_compat_sigevent(&n, u_notification)) return -EFAULT; if (n.sigev_notify == SIGEV_THREAD) n.sigev_value.sival_ptr = compat_ptr(n.sigev_value.sival_int); p = &n; } return do_mq_notify(mqdes, p); } COMPAT_SYSCALL_DEFINE3(mq_getsetattr, mqd_t, mqdes, const struct compat_mq_attr __user *, u_mqstat, struct compat_mq_attr __user *, u_omqstat) { int ret; struct mq_attr mqstat, omqstat; struct mq_attr *new = NULL, *old = NULL; if (u_mqstat) { new = &mqstat; if (get_compat_mq_attr(new, u_mqstat)) return -EFAULT; } if (u_omqstat) old = &omqstat; ret = do_mq_getsetattr(mqdes, new, old); if (ret || !old) return ret; if (put_compat_mq_attr(old, u_omqstat)) return -EFAULT; return 0; } #endif #ifdef CONFIG_COMPAT_32BIT_TIME |
9afc5eee6
|
1450 |
static int compat_prepare_timeout(const struct old_timespec32 __user *p, |
b90477263
|
1451 |
struct timespec64 *ts) |
0d0606060
|
1452 |
{ |
9afc5eee6
|
1453 |
if (get_old_timespec32(ts, p)) |
0d0606060
|
1454 |
return -EFAULT; |
b90477263
|
1455 |
if (!timespec64_valid(ts)) |
0d0606060
|
1456 1457 1458 |
return -EINVAL; return 0; } |
8dabe7245
|
1459 1460 1461 1462 |
SYSCALL_DEFINE5(mq_timedsend_time32, mqd_t, mqdes, const char __user *, u_msg_ptr, unsigned int, msg_len, unsigned int, msg_prio, const struct old_timespec32 __user *, u_abs_timeout) |
0d0606060
|
1463 |
{ |
b90477263
|
1464 |
struct timespec64 ts, *p = NULL; |
0d0606060
|
1465 1466 1467 1468 1469 1470 1471 1472 |
if (u_abs_timeout) { int res = compat_prepare_timeout(u_abs_timeout, &ts); if (res) return res; p = &ts; } return do_mq_timedsend(mqdes, u_msg_ptr, msg_len, msg_prio, p); } |
8dabe7245
|
1473 1474 1475 1476 |
SYSCALL_DEFINE5(mq_timedreceive_time32, mqd_t, mqdes, char __user *, u_msg_ptr, unsigned int, msg_len, unsigned int __user *, u_msg_prio, const struct old_timespec32 __user *, u_abs_timeout) |
0d0606060
|
1477 |
{ |
b90477263
|
1478 |
struct timespec64 ts, *p = NULL; |
0d0606060
|
1479 1480 1481 1482 1483 1484 1485 1486 |
if (u_abs_timeout) { int res = compat_prepare_timeout(u_abs_timeout, &ts); if (res) return res; p = &ts; } return do_mq_timedreceive(mqdes, u_msg_ptr, msg_len, u_msg_prio, p); } |
0d0606060
|
1487 |
#endif |
1da177e4c
|
1488 |
|
92e1d5be9
|
1489 |
static const struct inode_operations mqueue_dir_inode_operations = { |
1da177e4c
|
1490 1491 1492 1493 |
.lookup = simple_lookup, .create = mqueue_create, .unlink = mqueue_unlink, }; |
9a32144e9
|
1494 |
static const struct file_operations mqueue_file_operations = { |
1da177e4c
|
1495 1496 1497 |
.flush = mqueue_flush_file, .poll = mqueue_poll_file, .read = mqueue_read_file, |
6038f373a
|
1498 |
.llseek = default_llseek, |
1da177e4c
|
1499 |
}; |
b87221de6
|
1500 |
static const struct super_operations mqueue_super_ops = { |
1da177e4c
|
1501 |
.alloc_inode = mqueue_alloc_inode, |
015d79561
|
1502 |
.free_inode = mqueue_free_inode, |
6d8af64c1
|
1503 |
.evict_inode = mqueue_evict_inode, |
1da177e4c
|
1504 |
.statfs = simple_statfs, |
1da177e4c
|
1505 |
}; |
935c6912b
|
1506 1507 1508 1509 |
static const struct fs_context_operations mqueue_fs_context_ops = { .free = mqueue_fs_context_free, .get_tree = mqueue_get_tree, }; |
1da177e4c
|
1510 |
static struct file_system_type mqueue_fs_type = { |
935c6912b
|
1511 1512 1513 1514 |
.name = "mqueue", .init_fs_context = mqueue_init_fs_context, .kill_sb = kill_litter_super, .fs_flags = FS_USERNS_MOUNT, |
1da177e4c
|
1515 |
}; |
7eafd7c74
|
1516 1517 |
int mq_init_ns(struct ipc_namespace *ns) { |
935c6912b
|
1518 |
struct vfsmount *m; |
7eafd7c74
|
1519 1520 1521 1522 |
ns->mq_queues_count = 0; ns->mq_queues_max = DFLT_QUEUESMAX; ns->mq_msg_max = DFLT_MSGMAX; ns->mq_msgsize_max = DFLT_MSGSIZEMAX; |
cef0184c1
|
1523 1524 |
ns->mq_msg_default = DFLT_MSG; ns->mq_msgsize_default = DFLT_MSGSIZE; |
7eafd7c74
|
1525 |
|
935c6912b
|
1526 1527 1528 1529 |
m = mq_create_mount(ns); if (IS_ERR(m)) return PTR_ERR(m); ns->mq_mnt = m; |
7eafd7c74
|
1530 1531 1532 1533 1534 |
return 0; } void mq_clear_sbinfo(struct ipc_namespace *ns) { |
cfb2f6f6e
|
1535 |
ns->mq_mnt->mnt_sb->s_fs_info = NULL; |
7eafd7c74
|
1536 1537 1538 1539 |
} void mq_put_mnt(struct ipc_namespace *ns) { |
cfb2f6f6e
|
1540 |
kern_unmount(ns->mq_mnt); |
7eafd7c74
|
1541 |
} |
1da177e4c
|
1542 1543 1544 1545 1546 1547 |
static int __init init_mqueue_fs(void) { int error; mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache", sizeof(struct mqueue_inode_info), 0, |
5d097056c
|
1548 |
SLAB_HWCACHE_ALIGN|SLAB_ACCOUNT, init_once); |
1da177e4c
|
1549 1550 |
if (mqueue_inode_cachep == NULL) return -ENOMEM; |
2329e392a
|
1551 |
/* ignore failures - they are not fatal */ |
bdc8e5f85
|
1552 |
mq_sysctl_table = mq_register_sysctl_table(); |
1da177e4c
|
1553 1554 1555 1556 |
error = register_filesystem(&mqueue_fs_type); if (error) goto out_sysctl; |
7eafd7c74
|
1557 |
spin_lock_init(&mq_lock); |
6f686574c
|
1558 1559 |
error = mq_init_ns(&init_ipc_ns); if (error) |
1da177e4c
|
1560 |
goto out_filesystem; |
1da177e4c
|
1561 |
|
1da177e4c
|
1562 1563 1564 1565 1566 1567 1568 |
return 0; out_filesystem: unregister_filesystem(&mqueue_fs_type); out_sysctl: if (mq_sysctl_table) unregister_sysctl_table(mq_sysctl_table); |
1a1d92c10
|
1569 |
kmem_cache_destroy(mqueue_inode_cachep); |
1da177e4c
|
1570 1571 |
return error; } |
6d08a2567
|
1572 |
device_initcall(init_mqueue_fs); |