mqueue.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296
  1. /*
  2. * POSIX message queues filesystem for Linux.
  3. *
  4. * Copyright (C) 2003,2004 Krzysztof Benedyczak (golbi@mat.uni.torun.pl)
  5. * Michal Wronski (michal.wronski@gmail.com)
  6. *
  7. * Spinlocks: Mohamed Abbas (abbas.mohamed@intel.com)
  8. * Lockless receive & send, fd based notify:
  9. * Manfred Spraul (manfred@colorfullife.com)
  10. *
  11. * Audit: George Wilson (ltcgcw@us.ibm.com)
  12. *
  13. * This file is released under the GPL.
  14. */
  15. #include <linux/capability.h>
  16. #include <linux/init.h>
  17. #include <linux/pagemap.h>
  18. #include <linux/file.h>
  19. #include <linux/mount.h>
  20. #include <linux/namei.h>
  21. #include <linux/sysctl.h>
  22. #include <linux/poll.h>
  23. #include <linux/mqueue.h>
  24. #include <linux/msg.h>
  25. #include <linux/skbuff.h>
  26. #include <linux/netlink.h>
  27. #include <linux/syscalls.h>
  28. #include <linux/audit.h>
  29. #include <linux/signal.h>
  30. #include <linux/mutex.h>
  31. #include <linux/nsproxy.h>
  32. #include <linux/pid.h>
  33. #include <net/sock.h>
  34. #include "util.h"
  35. #define MQUEUE_MAGIC 0x19800202
  36. #define DIRENT_SIZE 20
  37. #define FILENT_SIZE 80
  38. #define SEND 0
  39. #define RECV 1
  40. #define STATE_NONE 0
  41. #define STATE_PENDING 1
  42. #define STATE_READY 2
  43. /* default values */
  44. #define DFLT_QUEUESMAX 256 /* max number of message queues */
  45. #define DFLT_MSGMAX 10 /* max number of messages in each queue */
  46. #define HARD_MSGMAX (131072/sizeof(void*))
  47. #define DFLT_MSGSIZEMAX 8192 /* max message size */
  48. /*
  49. * Define the ranges various user-specified maximum values can
  50. * be set to.
  51. */
  52. #define MIN_MSGMAX 1 /* min value for msg_max */
  53. #define MAX_MSGMAX HARD_MSGMAX /* max value for msg_max */
  54. #define MIN_MSGSIZEMAX 128 /* min value for msgsize_max */
  55. #define MAX_MSGSIZEMAX (8192*128) /* max value for msgsize_max */
  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 */
  61. };
  62. struct mqueue_inode_info {
  63. spinlock_t lock;
  64. struct inode vfs_inode;
  65. wait_queue_head_t wait_q;
  66. struct msg_msg **messages;
  67. struct mq_attr attr;
  68. struct sigevent notify;
  69. struct pid* notify_owner;
  70. struct user_struct *user; /* user who created, for accounting */
  71. struct sock *notify_sock;
  72. struct sk_buff *notify_cookie;
  73. /* for tasks waiting for free space and messages, respectively */
  74. struct ext_wait_queue e_wait_q[2];
  75. unsigned long qsize; /* size of queue in memory (sum of all msgs) */
  76. };
  77. static const struct inode_operations mqueue_dir_inode_operations;
  78. static const struct file_operations mqueue_file_operations;
  79. static struct super_operations mqueue_super_ops;
  80. static void remove_notification(struct mqueue_inode_info *info);
  81. static spinlock_t mq_lock;
  82. static struct kmem_cache *mqueue_inode_cachep;
  83. static struct vfsmount *mqueue_mnt;
  84. static unsigned int queues_count;
  85. static unsigned int queues_max = DFLT_QUEUESMAX;
  86. static unsigned int msg_max = DFLT_MSGMAX;
  87. static unsigned int msgsize_max = DFLT_MSGSIZEMAX;
  88. static struct ctl_table_header * mq_sysctl_table;
  89. static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode)
  90. {
  91. return container_of(inode, struct mqueue_inode_info, vfs_inode);
  92. }
  93. static struct inode *mqueue_get_inode(struct super_block *sb, int mode,
  94. struct mq_attr *attr)
  95. {
  96. struct user_struct *u = current_user();
  97. struct inode *inode;
  98. inode = new_inode(sb);
  99. if (inode) {
  100. inode->i_mode = mode;
  101. inode->i_uid = current_fsuid();
  102. inode->i_gid = current_fsgid();
  103. inode->i_blocks = 0;
  104. inode->i_mtime = inode->i_ctime = inode->i_atime =
  105. CURRENT_TIME;
  106. if (S_ISREG(mode)) {
  107. struct mqueue_inode_info *info;
  108. struct task_struct *p = current;
  109. unsigned long mq_bytes, mq_msg_tblsz;
  110. inode->i_fop = &mqueue_file_operations;
  111. inode->i_size = FILENT_SIZE;
  112. /* mqueue specific info */
  113. info = MQUEUE_I(inode);
  114. spin_lock_init(&info->lock);
  115. init_waitqueue_head(&info->wait_q);
  116. INIT_LIST_HEAD(&info->e_wait_q[0].list);
  117. INIT_LIST_HEAD(&info->e_wait_q[1].list);
  118. info->messages = NULL;
  119. info->notify_owner = NULL;
  120. info->qsize = 0;
  121. info->user = NULL; /* set when all is ok */
  122. memset(&info->attr, 0, sizeof(info->attr));
  123. info->attr.mq_maxmsg = msg_max;
  124. info->attr.mq_msgsize = msgsize_max;
  125. if (attr) {
  126. info->attr.mq_maxmsg = attr->mq_maxmsg;
  127. info->attr.mq_msgsize = attr->mq_msgsize;
  128. }
  129. mq_msg_tblsz = info->attr.mq_maxmsg * sizeof(struct msg_msg *);
  130. mq_bytes = (mq_msg_tblsz +
  131. (info->attr.mq_maxmsg * info->attr.mq_msgsize));
  132. spin_lock(&mq_lock);
  133. if (u->mq_bytes + mq_bytes < u->mq_bytes ||
  134. u->mq_bytes + mq_bytes >
  135. p->signal->rlim[RLIMIT_MSGQUEUE].rlim_cur) {
  136. spin_unlock(&mq_lock);
  137. goto out_inode;
  138. }
  139. u->mq_bytes += mq_bytes;
  140. spin_unlock(&mq_lock);
  141. info->messages = kmalloc(mq_msg_tblsz, GFP_KERNEL);
  142. if (!info->messages) {
  143. spin_lock(&mq_lock);
  144. u->mq_bytes -= mq_bytes;
  145. spin_unlock(&mq_lock);
  146. goto out_inode;
  147. }
  148. /* all is ok */
  149. info->user = get_uid(u);
  150. } else if (S_ISDIR(mode)) {
  151. inc_nlink(inode);
  152. /* Some things misbehave if size == 0 on a directory */
  153. inode->i_size = 2 * DIRENT_SIZE;
  154. inode->i_op = &mqueue_dir_inode_operations;
  155. inode->i_fop = &simple_dir_operations;
  156. }
  157. }
  158. return inode;
  159. out_inode:
  160. make_bad_inode(inode);
  161. iput(inode);
  162. return NULL;
  163. }
  164. static int mqueue_fill_super(struct super_block *sb, void *data, int silent)
  165. {
  166. struct inode *inode;
  167. sb->s_blocksize = PAGE_CACHE_SIZE;
  168. sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
  169. sb->s_magic = MQUEUE_MAGIC;
  170. sb->s_op = &mqueue_super_ops;
  171. inode = mqueue_get_inode(sb, S_IFDIR | S_ISVTX | S_IRWXUGO, NULL);
  172. if (!inode)
  173. return -ENOMEM;
  174. sb->s_root = d_alloc_root(inode);
  175. if (!sb->s_root) {
  176. iput(inode);
  177. return -ENOMEM;
  178. }
  179. return 0;
  180. }
  181. static int mqueue_get_sb(struct file_system_type *fs_type,
  182. int flags, const char *dev_name,
  183. void *data, struct vfsmount *mnt)
  184. {
  185. return get_sb_single(fs_type, flags, data, mqueue_fill_super, mnt);
  186. }
  187. static void init_once(void *foo)
  188. {
  189. struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo;
  190. inode_init_once(&p->vfs_inode);
  191. }
  192. static struct inode *mqueue_alloc_inode(struct super_block *sb)
  193. {
  194. struct mqueue_inode_info *ei;
  195. ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL);
  196. if (!ei)
  197. return NULL;
  198. return &ei->vfs_inode;
  199. }
  200. static void mqueue_destroy_inode(struct inode *inode)
  201. {
  202. kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode));
  203. }
  204. static void mqueue_delete_inode(struct inode *inode)
  205. {
  206. struct mqueue_inode_info *info;
  207. struct user_struct *user;
  208. unsigned long mq_bytes;
  209. int i;
  210. if (S_ISDIR(inode->i_mode)) {
  211. clear_inode(inode);
  212. return;
  213. }
  214. info = MQUEUE_I(inode);
  215. spin_lock(&info->lock);
  216. for (i = 0; i < info->attr.mq_curmsgs; i++)
  217. free_msg(info->messages[i]);
  218. kfree(info->messages);
  219. spin_unlock(&info->lock);
  220. clear_inode(inode);
  221. mq_bytes = (info->attr.mq_maxmsg * sizeof(struct msg_msg *) +
  222. (info->attr.mq_maxmsg * info->attr.mq_msgsize));
  223. user = info->user;
  224. if (user) {
  225. spin_lock(&mq_lock);
  226. user->mq_bytes -= mq_bytes;
  227. queues_count--;
  228. spin_unlock(&mq_lock);
  229. free_uid(user);
  230. }
  231. }
  232. static int mqueue_create(struct inode *dir, struct dentry *dentry,
  233. int mode, struct nameidata *nd)
  234. {
  235. struct inode *inode;
  236. struct mq_attr *attr = dentry->d_fsdata;
  237. int error;
  238. spin_lock(&mq_lock);
  239. if (queues_count >= queues_max && !capable(CAP_SYS_RESOURCE)) {
  240. error = -ENOSPC;
  241. goto out_lock;
  242. }
  243. queues_count++;
  244. spin_unlock(&mq_lock);
  245. inode = mqueue_get_inode(dir->i_sb, mode, attr);
  246. if (!inode) {
  247. error = -ENOMEM;
  248. spin_lock(&mq_lock);
  249. queues_count--;
  250. goto out_lock;
  251. }
  252. dir->i_size += DIRENT_SIZE;
  253. dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
  254. d_instantiate(dentry, inode);
  255. dget(dentry);
  256. return 0;
  257. out_lock:
  258. spin_unlock(&mq_lock);
  259. return error;
  260. }
  261. static int mqueue_unlink(struct inode *dir, struct dentry *dentry)
  262. {
  263. struct inode *inode = dentry->d_inode;
  264. dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
  265. dir->i_size -= DIRENT_SIZE;
  266. drop_nlink(inode);
  267. dput(dentry);
  268. return 0;
  269. }
  270. /*
  271. * This is routine for system read from queue file.
  272. * To avoid mess with doing here some sort of mq_receive we allow
  273. * to read only queue size & notification info (the only values
  274. * that are interesting from user point of view and aren't accessible
  275. * through std routines)
  276. */
  277. static ssize_t mqueue_read_file(struct file *filp, char __user *u_data,
  278. size_t count, loff_t *off)
  279. {
  280. struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
  281. char buffer[FILENT_SIZE];
  282. ssize_t ret;
  283. spin_lock(&info->lock);
  284. snprintf(buffer, sizeof(buffer),
  285. "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
  286. info->qsize,
  287. info->notify_owner ? info->notify.sigev_notify : 0,
  288. (info->notify_owner &&
  289. info->notify.sigev_notify == SIGEV_SIGNAL) ?
  290. info->notify.sigev_signo : 0,
  291. pid_vnr(info->notify_owner));
  292. spin_unlock(&info->lock);
  293. buffer[sizeof(buffer)-1] = '\0';
  294. ret = simple_read_from_buffer(u_data, count, off, buffer,
  295. strlen(buffer));
  296. if (ret <= 0)
  297. return ret;
  298. filp->f_path.dentry->d_inode->i_atime = filp->f_path.dentry->d_inode->i_ctime = CURRENT_TIME;
  299. return ret;
  300. }
  301. static int mqueue_flush_file(struct file *filp, fl_owner_t id)
  302. {
  303. struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
  304. spin_lock(&info->lock);
  305. if (task_tgid(current) == info->notify_owner)
  306. remove_notification(info);
  307. spin_unlock(&info->lock);
  308. return 0;
  309. }
  310. static unsigned int mqueue_poll_file(struct file *filp, struct poll_table_struct *poll_tab)
  311. {
  312. struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
  313. int retval = 0;
  314. poll_wait(filp, &info->wait_q, poll_tab);
  315. spin_lock(&info->lock);
  316. if (info->attr.mq_curmsgs)
  317. retval = POLLIN | POLLRDNORM;
  318. if (info->attr.mq_curmsgs < info->attr.mq_maxmsg)
  319. retval |= POLLOUT | POLLWRNORM;
  320. spin_unlock(&info->lock);
  321. return retval;
  322. }
  323. /* Adds current to info->e_wait_q[sr] before element with smaller prio */
  324. static void wq_add(struct mqueue_inode_info *info, int sr,
  325. struct ext_wait_queue *ewp)
  326. {
  327. struct ext_wait_queue *walk;
  328. ewp->task = current;
  329. list_for_each_entry(walk, &info->e_wait_q[sr].list, list) {
  330. if (walk->task->static_prio <= current->static_prio) {
  331. list_add_tail(&ewp->list, &walk->list);
  332. return;
  333. }
  334. }
  335. list_add_tail(&ewp->list, &info->e_wait_q[sr].list);
  336. }
  337. /*
  338. * Puts current task to sleep. Caller must hold queue lock. After return
  339. * lock isn't held.
  340. * sr: SEND or RECV
  341. */
  342. static int wq_sleep(struct mqueue_inode_info *info, int sr,
  343. long timeout, struct ext_wait_queue *ewp)
  344. {
  345. int retval;
  346. signed long time;
  347. wq_add(info, sr, ewp);
  348. for (;;) {
  349. set_current_state(TASK_INTERRUPTIBLE);
  350. spin_unlock(&info->lock);
  351. time = schedule_timeout(timeout);
  352. while (ewp->state == STATE_PENDING)
  353. cpu_relax();
  354. if (ewp->state == STATE_READY) {
  355. retval = 0;
  356. goto out;
  357. }
  358. spin_lock(&info->lock);
  359. if (ewp->state == STATE_READY) {
  360. retval = 0;
  361. goto out_unlock;
  362. }
  363. if (signal_pending(current)) {
  364. retval = -ERESTARTSYS;
  365. break;
  366. }
  367. if (time == 0) {
  368. retval = -ETIMEDOUT;
  369. break;
  370. }
  371. }
  372. list_del(&ewp->list);
  373. out_unlock:
  374. spin_unlock(&info->lock);
  375. out:
  376. return retval;
  377. }
  378. /*
  379. * Returns waiting task that should be serviced first or NULL if none exists
  380. */
  381. static struct ext_wait_queue *wq_get_first_waiter(
  382. struct mqueue_inode_info *info, int sr)
  383. {
  384. struct list_head *ptr;
  385. ptr = info->e_wait_q[sr].list.prev;
  386. if (ptr == &info->e_wait_q[sr].list)
  387. return NULL;
  388. return list_entry(ptr, struct ext_wait_queue, list);
  389. }
  390. /* Auxiliary functions to manipulate messages' list */
  391. static void msg_insert(struct msg_msg *ptr, struct mqueue_inode_info *info)
  392. {
  393. int k;
  394. k = info->attr.mq_curmsgs - 1;
  395. while (k >= 0 && info->messages[k]->m_type >= ptr->m_type) {
  396. info->messages[k + 1] = info->messages[k];
  397. k--;
  398. }
  399. info->attr.mq_curmsgs++;
  400. info->qsize += ptr->m_ts;
  401. info->messages[k + 1] = ptr;
  402. }
  403. static inline struct msg_msg *msg_get(struct mqueue_inode_info *info)
  404. {
  405. info->qsize -= info->messages[--info->attr.mq_curmsgs]->m_ts;
  406. return info->messages[info->attr.mq_curmsgs];
  407. }
  408. static inline void set_cookie(struct sk_buff *skb, char code)
  409. {
  410. ((char*)skb->data)[NOTIFY_COOKIE_LEN-1] = code;
  411. }
  412. /*
  413. * The next function is only to split too long sys_mq_timedsend
  414. */
  415. static void __do_notify(struct mqueue_inode_info *info)
  416. {
  417. /* notification
  418. * invoked when there is registered process and there isn't process
  419. * waiting synchronously for message AND state of queue changed from
  420. * empty to not empty. Here we are sure that no one is waiting
  421. * synchronously. */
  422. if (info->notify_owner &&
  423. info->attr.mq_curmsgs == 1) {
  424. struct siginfo sig_i;
  425. switch (info->notify.sigev_notify) {
  426. case SIGEV_NONE:
  427. break;
  428. case SIGEV_SIGNAL:
  429. /* sends signal */
  430. sig_i.si_signo = info->notify.sigev_signo;
  431. sig_i.si_errno = 0;
  432. sig_i.si_code = SI_MESGQ;
  433. sig_i.si_value = info->notify.sigev_value;
  434. sig_i.si_pid = task_tgid_vnr(current);
  435. sig_i.si_uid = current_uid();
  436. kill_pid_info(info->notify.sigev_signo,
  437. &sig_i, info->notify_owner);
  438. break;
  439. case SIGEV_THREAD:
  440. set_cookie(info->notify_cookie, NOTIFY_WOKENUP);
  441. netlink_sendskb(info->notify_sock, info->notify_cookie);
  442. break;
  443. }
  444. /* after notification unregisters process */
  445. put_pid(info->notify_owner);
  446. info->notify_owner = NULL;
  447. }
  448. wake_up(&info->wait_q);
  449. }
  450. static long prepare_timeout(const struct timespec __user *u_arg)
  451. {
  452. struct timespec ts, nowts;
  453. long timeout;
  454. if (u_arg) {
  455. if (unlikely(copy_from_user(&ts, u_arg,
  456. sizeof(struct timespec))))
  457. return -EFAULT;
  458. if (unlikely(ts.tv_nsec < 0 || ts.tv_sec < 0
  459. || ts.tv_nsec >= NSEC_PER_SEC))
  460. return -EINVAL;
  461. nowts = CURRENT_TIME;
  462. /* first subtract as jiffies can't be too big */
  463. ts.tv_sec -= nowts.tv_sec;
  464. if (ts.tv_nsec < nowts.tv_nsec) {
  465. ts.tv_nsec += NSEC_PER_SEC;
  466. ts.tv_sec--;
  467. }
  468. ts.tv_nsec -= nowts.tv_nsec;
  469. if (ts.tv_sec < 0)
  470. return 0;
  471. timeout = timespec_to_jiffies(&ts) + 1;
  472. } else
  473. return MAX_SCHEDULE_TIMEOUT;
  474. return timeout;
  475. }
  476. static void remove_notification(struct mqueue_inode_info *info)
  477. {
  478. if (info->notify_owner != NULL &&
  479. info->notify.sigev_notify == SIGEV_THREAD) {
  480. set_cookie(info->notify_cookie, NOTIFY_REMOVED);
  481. netlink_sendskb(info->notify_sock, info->notify_cookie);
  482. }
  483. put_pid(info->notify_owner);
  484. info->notify_owner = NULL;
  485. }
  486. static int mq_attr_ok(struct mq_attr *attr)
  487. {
  488. if (attr->mq_maxmsg <= 0 || attr->mq_msgsize <= 0)
  489. return 0;
  490. if (capable(CAP_SYS_RESOURCE)) {
  491. if (attr->mq_maxmsg > HARD_MSGMAX)
  492. return 0;
  493. } else {
  494. if (attr->mq_maxmsg > msg_max ||
  495. attr->mq_msgsize > msgsize_max)
  496. return 0;
  497. }
  498. /* check for overflow */
  499. if (attr->mq_msgsize > ULONG_MAX/attr->mq_maxmsg)
  500. return 0;
  501. if ((unsigned long)(attr->mq_maxmsg * attr->mq_msgsize) +
  502. (attr->mq_maxmsg * sizeof (struct msg_msg *)) <
  503. (unsigned long)(attr->mq_maxmsg * attr->mq_msgsize))
  504. return 0;
  505. return 1;
  506. }
  507. /*
  508. * Invoked when creating a new queue via sys_mq_open
  509. */
  510. static struct file *do_create(struct dentry *dir, struct dentry *dentry,
  511. int oflag, mode_t mode, struct mq_attr __user *u_attr)
  512. {
  513. const struct cred *cred = current_cred();
  514. struct mq_attr attr;
  515. struct file *result;
  516. int ret;
  517. if (u_attr) {
  518. ret = -EFAULT;
  519. if (copy_from_user(&attr, u_attr, sizeof(attr)))
  520. goto out;
  521. ret = -EINVAL;
  522. if (!mq_attr_ok(&attr))
  523. goto out;
  524. /* store for use during create */
  525. dentry->d_fsdata = &attr;
  526. }
  527. mode &= ~current->fs->umask;
  528. ret = mnt_want_write(mqueue_mnt);
  529. if (ret)
  530. goto out;
  531. ret = vfs_create(dir->d_inode, dentry, mode, NULL);
  532. dentry->d_fsdata = NULL;
  533. if (ret)
  534. goto out_drop_write;
  535. result = dentry_open(dentry, mqueue_mnt, oflag, cred);
  536. /*
  537. * dentry_open() took a persistent mnt_want_write(),
  538. * so we can now drop this one.
  539. */
  540. mnt_drop_write(mqueue_mnt);
  541. return result;
  542. out_drop_write:
  543. mnt_drop_write(mqueue_mnt);
  544. out:
  545. dput(dentry);
  546. mntput(mqueue_mnt);
  547. return ERR_PTR(ret);
  548. }
  549. /* Opens existing queue */
  550. static struct file *do_open(struct dentry *dentry, int oflag)
  551. {
  552. const struct cred *cred = current_cred();
  553. static const int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE,
  554. MAY_READ | MAY_WRITE };
  555. if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) {
  556. dput(dentry);
  557. mntput(mqueue_mnt);
  558. return ERR_PTR(-EINVAL);
  559. }
  560. if (inode_permission(dentry->d_inode, oflag2acc[oflag & O_ACCMODE])) {
  561. dput(dentry);
  562. mntput(mqueue_mnt);
  563. return ERR_PTR(-EACCES);
  564. }
  565. return dentry_open(dentry, mqueue_mnt, oflag, cred);
  566. }
  567. asmlinkage long sys_mq_open(const char __user *u_name, int oflag, mode_t mode,
  568. struct mq_attr __user *u_attr)
  569. {
  570. struct dentry *dentry;
  571. struct file *filp;
  572. char *name;
  573. int fd, error;
  574. error = audit_mq_open(oflag, mode, u_attr);
  575. if (error != 0)
  576. return error;
  577. if (IS_ERR(name = getname(u_name)))
  578. return PTR_ERR(name);
  579. fd = get_unused_fd_flags(O_CLOEXEC);
  580. if (fd < 0)
  581. goto out_putname;
  582. mutex_lock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  583. dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
  584. if (IS_ERR(dentry)) {
  585. error = PTR_ERR(dentry);
  586. goto out_err;
  587. }
  588. mntget(mqueue_mnt);
  589. if (oflag & O_CREAT) {
  590. if (dentry->d_inode) { /* entry already exists */
  591. audit_inode(name, dentry);
  592. error = -EEXIST;
  593. if (oflag & O_EXCL)
  594. goto out;
  595. filp = do_open(dentry, oflag);
  596. } else {
  597. filp = do_create(mqueue_mnt->mnt_root, dentry,
  598. oflag, mode, u_attr);
  599. }
  600. } else {
  601. error = -ENOENT;
  602. if (!dentry->d_inode)
  603. goto out;
  604. audit_inode(name, dentry);
  605. filp = do_open(dentry, oflag);
  606. }
  607. if (IS_ERR(filp)) {
  608. error = PTR_ERR(filp);
  609. goto out_putfd;
  610. }
  611. fd_install(fd, filp);
  612. goto out_upsem;
  613. out:
  614. dput(dentry);
  615. mntput(mqueue_mnt);
  616. out_putfd:
  617. put_unused_fd(fd);
  618. out_err:
  619. fd = error;
  620. out_upsem:
  621. mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  622. out_putname:
  623. putname(name);
  624. return fd;
  625. }
  626. asmlinkage long sys_mq_unlink(const char __user *u_name)
  627. {
  628. int err;
  629. char *name;
  630. struct dentry *dentry;
  631. struct inode *inode = NULL;
  632. name = getname(u_name);
  633. if (IS_ERR(name))
  634. return PTR_ERR(name);
  635. mutex_lock_nested(&mqueue_mnt->mnt_root->d_inode->i_mutex,
  636. I_MUTEX_PARENT);
  637. dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
  638. if (IS_ERR(dentry)) {
  639. err = PTR_ERR(dentry);
  640. goto out_unlock;
  641. }
  642. if (!dentry->d_inode) {
  643. err = -ENOENT;
  644. goto out_err;
  645. }
  646. inode = dentry->d_inode;
  647. if (inode)
  648. atomic_inc(&inode->i_count);
  649. err = mnt_want_write(mqueue_mnt);
  650. if (err)
  651. goto out_err;
  652. err = vfs_unlink(dentry->d_parent->d_inode, dentry);
  653. mnt_drop_write(mqueue_mnt);
  654. out_err:
  655. dput(dentry);
  656. out_unlock:
  657. mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  658. putname(name);
  659. if (inode)
  660. iput(inode);
  661. return err;
  662. }
  663. /* Pipelined send and receive functions.
  664. *
  665. * If a receiver finds no waiting message, then it registers itself in the
  666. * list of waiting receivers. A sender checks that list before adding the new
  667. * message into the message array. If there is a waiting receiver, then it
  668. * bypasses the message array and directly hands the message over to the
  669. * receiver.
  670. * The receiver accepts the message and returns without grabbing the queue
  671. * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
  672. * are necessary. The same algorithm is used for sysv semaphores, see
  673. * ipc/sem.c for more details.
  674. *
  675. * The same algorithm is used for senders.
  676. */
  677. /* pipelined_send() - send a message directly to the task waiting in
  678. * sys_mq_timedreceive() (without inserting message into a queue).
  679. */
  680. static inline void pipelined_send(struct mqueue_inode_info *info,
  681. struct msg_msg *message,
  682. struct ext_wait_queue *receiver)
  683. {
  684. receiver->msg = message;
  685. list_del(&receiver->list);
  686. receiver->state = STATE_PENDING;
  687. wake_up_process(receiver->task);
  688. smp_wmb();
  689. receiver->state = STATE_READY;
  690. }
  691. /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
  692. * gets its message and put to the queue (we have one free place for sure). */
  693. static inline void pipelined_receive(struct mqueue_inode_info *info)
  694. {
  695. struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND);
  696. if (!sender) {
  697. /* for poll */
  698. wake_up_interruptible(&info->wait_q);
  699. return;
  700. }
  701. msg_insert(sender->msg, info);
  702. list_del(&sender->list);
  703. sender->state = STATE_PENDING;
  704. wake_up_process(sender->task);
  705. smp_wmb();
  706. sender->state = STATE_READY;
  707. }
  708. asmlinkage long sys_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr,
  709. size_t msg_len, unsigned int msg_prio,
  710. const struct timespec __user *u_abs_timeout)
  711. {
  712. struct file *filp;
  713. struct inode *inode;
  714. struct ext_wait_queue wait;
  715. struct ext_wait_queue *receiver;
  716. struct msg_msg *msg_ptr;
  717. struct mqueue_inode_info *info;
  718. long timeout;
  719. int ret;
  720. ret = audit_mq_timedsend(mqdes, msg_len, msg_prio, u_abs_timeout);
  721. if (ret != 0)
  722. return ret;
  723. if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX))
  724. return -EINVAL;
  725. timeout = prepare_timeout(u_abs_timeout);
  726. ret = -EBADF;
  727. filp = fget(mqdes);
  728. if (unlikely(!filp))
  729. goto out;
  730. inode = filp->f_path.dentry->d_inode;
  731. if (unlikely(filp->f_op != &mqueue_file_operations))
  732. goto out_fput;
  733. info = MQUEUE_I(inode);
  734. audit_inode(NULL, filp->f_path.dentry);
  735. if (unlikely(!(filp->f_mode & FMODE_WRITE)))
  736. goto out_fput;
  737. if (unlikely(msg_len > info->attr.mq_msgsize)) {
  738. ret = -EMSGSIZE;
  739. goto out_fput;
  740. }
  741. /* First try to allocate memory, before doing anything with
  742. * existing queues. */
  743. msg_ptr = load_msg(u_msg_ptr, msg_len);
  744. if (IS_ERR(msg_ptr)) {
  745. ret = PTR_ERR(msg_ptr);
  746. goto out_fput;
  747. }
  748. msg_ptr->m_ts = msg_len;
  749. msg_ptr->m_type = msg_prio;
  750. spin_lock(&info->lock);
  751. if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) {
  752. if (filp->f_flags & O_NONBLOCK) {
  753. spin_unlock(&info->lock);
  754. ret = -EAGAIN;
  755. } else if (unlikely(timeout < 0)) {
  756. spin_unlock(&info->lock);
  757. ret = timeout;
  758. } else {
  759. wait.task = current;
  760. wait.msg = (void *) msg_ptr;
  761. wait.state = STATE_NONE;
  762. ret = wq_sleep(info, SEND, timeout, &wait);
  763. }
  764. if (ret < 0)
  765. free_msg(msg_ptr);
  766. } else {
  767. receiver = wq_get_first_waiter(info, RECV);
  768. if (receiver) {
  769. pipelined_send(info, msg_ptr, receiver);
  770. } else {
  771. /* adds message to the queue */
  772. msg_insert(msg_ptr, info);
  773. __do_notify(info);
  774. }
  775. inode->i_atime = inode->i_mtime = inode->i_ctime =
  776. CURRENT_TIME;
  777. spin_unlock(&info->lock);
  778. ret = 0;
  779. }
  780. out_fput:
  781. fput(filp);
  782. out:
  783. return ret;
  784. }
  785. asmlinkage ssize_t sys_mq_timedreceive(mqd_t mqdes, char __user *u_msg_ptr,
  786. size_t msg_len, unsigned int __user *u_msg_prio,
  787. const struct timespec __user *u_abs_timeout)
  788. {
  789. long timeout;
  790. ssize_t ret;
  791. struct msg_msg *msg_ptr;
  792. struct file *filp;
  793. struct inode *inode;
  794. struct mqueue_inode_info *info;
  795. struct ext_wait_queue wait;
  796. ret = audit_mq_timedreceive(mqdes, msg_len, u_msg_prio, u_abs_timeout);
  797. if (ret != 0)
  798. return ret;
  799. timeout = prepare_timeout(u_abs_timeout);
  800. ret = -EBADF;
  801. filp = fget(mqdes);
  802. if (unlikely(!filp))
  803. goto out;
  804. inode = filp->f_path.dentry->d_inode;
  805. if (unlikely(filp->f_op != &mqueue_file_operations))
  806. goto out_fput;
  807. info = MQUEUE_I(inode);
  808. audit_inode(NULL, filp->f_path.dentry);
  809. if (unlikely(!(filp->f_mode & FMODE_READ)))
  810. goto out_fput;
  811. /* checks if buffer is big enough */
  812. if (unlikely(msg_len < info->attr.mq_msgsize)) {
  813. ret = -EMSGSIZE;
  814. goto out_fput;
  815. }
  816. spin_lock(&info->lock);
  817. if (info->attr.mq_curmsgs == 0) {
  818. if (filp->f_flags & O_NONBLOCK) {
  819. spin_unlock(&info->lock);
  820. ret = -EAGAIN;
  821. msg_ptr = NULL;
  822. } else if (unlikely(timeout < 0)) {
  823. spin_unlock(&info->lock);
  824. ret = timeout;
  825. msg_ptr = NULL;
  826. } else {
  827. wait.task = current;
  828. wait.state = STATE_NONE;
  829. ret = wq_sleep(info, RECV, timeout, &wait);
  830. msg_ptr = wait.msg;
  831. }
  832. } else {
  833. msg_ptr = msg_get(info);
  834. inode->i_atime = inode->i_mtime = inode->i_ctime =
  835. CURRENT_TIME;
  836. /* There is now free space in queue. */
  837. pipelined_receive(info);
  838. spin_unlock(&info->lock);
  839. ret = 0;
  840. }
  841. if (ret == 0) {
  842. ret = msg_ptr->m_ts;
  843. if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) ||
  844. store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) {
  845. ret = -EFAULT;
  846. }
  847. free_msg(msg_ptr);
  848. }
  849. out_fput:
  850. fput(filp);
  851. out:
  852. return ret;
  853. }
  854. /*
  855. * Notes: the case when user wants us to deregister (with NULL as pointer)
  856. * and he isn't currently owner of notification, will be silently discarded.
  857. * It isn't explicitly defined in the POSIX.
  858. */
  859. asmlinkage long sys_mq_notify(mqd_t mqdes,
  860. const struct sigevent __user *u_notification)
  861. {
  862. int ret;
  863. struct file *filp;
  864. struct sock *sock;
  865. struct inode *inode;
  866. struct sigevent notification;
  867. struct mqueue_inode_info *info;
  868. struct sk_buff *nc;
  869. ret = audit_mq_notify(mqdes, u_notification);
  870. if (ret != 0)
  871. return ret;
  872. nc = NULL;
  873. sock = NULL;
  874. if (u_notification != NULL) {
  875. if (copy_from_user(&notification, u_notification,
  876. sizeof(struct sigevent)))
  877. return -EFAULT;
  878. if (unlikely(notification.sigev_notify != SIGEV_NONE &&
  879. notification.sigev_notify != SIGEV_SIGNAL &&
  880. notification.sigev_notify != SIGEV_THREAD))
  881. return -EINVAL;
  882. if (notification.sigev_notify == SIGEV_SIGNAL &&
  883. !valid_signal(notification.sigev_signo)) {
  884. return -EINVAL;
  885. }
  886. if (notification.sigev_notify == SIGEV_THREAD) {
  887. long timeo;
  888. /* create the notify skb */
  889. nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL);
  890. ret = -ENOMEM;
  891. if (!nc)
  892. goto out;
  893. ret = -EFAULT;
  894. if (copy_from_user(nc->data,
  895. notification.sigev_value.sival_ptr,
  896. NOTIFY_COOKIE_LEN)) {
  897. goto out;
  898. }
  899. /* TODO: add a header? */
  900. skb_put(nc, NOTIFY_COOKIE_LEN);
  901. /* and attach it to the socket */
  902. retry:
  903. filp = fget(notification.sigev_signo);
  904. ret = -EBADF;
  905. if (!filp)
  906. goto out;
  907. sock = netlink_getsockbyfilp(filp);
  908. fput(filp);
  909. if (IS_ERR(sock)) {
  910. ret = PTR_ERR(sock);
  911. sock = NULL;
  912. goto out;
  913. }
  914. timeo = MAX_SCHEDULE_TIMEOUT;
  915. ret = netlink_attachskb(sock, nc, &timeo, NULL);
  916. if (ret == 1)
  917. goto retry;
  918. if (ret) {
  919. sock = NULL;
  920. nc = NULL;
  921. goto out;
  922. }
  923. }
  924. }
  925. ret = -EBADF;
  926. filp = fget(mqdes);
  927. if (!filp)
  928. goto out;
  929. inode = filp->f_path.dentry->d_inode;
  930. if (unlikely(filp->f_op != &mqueue_file_operations))
  931. goto out_fput;
  932. info = MQUEUE_I(inode);
  933. ret = 0;
  934. spin_lock(&info->lock);
  935. if (u_notification == NULL) {
  936. if (info->notify_owner == task_tgid(current)) {
  937. remove_notification(info);
  938. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  939. }
  940. } else if (info->notify_owner != NULL) {
  941. ret = -EBUSY;
  942. } else {
  943. switch (notification.sigev_notify) {
  944. case SIGEV_NONE:
  945. info->notify.sigev_notify = SIGEV_NONE;
  946. break;
  947. case SIGEV_THREAD:
  948. info->notify_sock = sock;
  949. info->notify_cookie = nc;
  950. sock = NULL;
  951. nc = NULL;
  952. info->notify.sigev_notify = SIGEV_THREAD;
  953. break;
  954. case SIGEV_SIGNAL:
  955. info->notify.sigev_signo = notification.sigev_signo;
  956. info->notify.sigev_value = notification.sigev_value;
  957. info->notify.sigev_notify = SIGEV_SIGNAL;
  958. break;
  959. }
  960. info->notify_owner = get_pid(task_tgid(current));
  961. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  962. }
  963. spin_unlock(&info->lock);
  964. out_fput:
  965. fput(filp);
  966. out:
  967. if (sock) {
  968. netlink_detachskb(sock, nc);
  969. } else if (nc) {
  970. dev_kfree_skb(nc);
  971. }
  972. return ret;
  973. }
  974. asmlinkage long sys_mq_getsetattr(mqd_t mqdes,
  975. const struct mq_attr __user *u_mqstat,
  976. struct mq_attr __user *u_omqstat)
  977. {
  978. int ret;
  979. struct mq_attr mqstat, omqstat;
  980. struct file *filp;
  981. struct inode *inode;
  982. struct mqueue_inode_info *info;
  983. if (u_mqstat != NULL) {
  984. if (copy_from_user(&mqstat, u_mqstat, sizeof(struct mq_attr)))
  985. return -EFAULT;
  986. if (mqstat.mq_flags & (~O_NONBLOCK))
  987. return -EINVAL;
  988. }
  989. ret = -EBADF;
  990. filp = fget(mqdes);
  991. if (!filp)
  992. goto out;
  993. inode = filp->f_path.dentry->d_inode;
  994. if (unlikely(filp->f_op != &mqueue_file_operations))
  995. goto out_fput;
  996. info = MQUEUE_I(inode);
  997. spin_lock(&info->lock);
  998. omqstat = info->attr;
  999. omqstat.mq_flags = filp->f_flags & O_NONBLOCK;
  1000. if (u_mqstat) {
  1001. ret = audit_mq_getsetattr(mqdes, &mqstat);
  1002. if (ret != 0) {
  1003. spin_unlock(&info->lock);
  1004. goto out_fput;
  1005. }
  1006. if (mqstat.mq_flags & O_NONBLOCK)
  1007. filp->f_flags |= O_NONBLOCK;
  1008. else
  1009. filp->f_flags &= ~O_NONBLOCK;
  1010. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1011. }
  1012. spin_unlock(&info->lock);
  1013. ret = 0;
  1014. if (u_omqstat != NULL && copy_to_user(u_omqstat, &omqstat,
  1015. sizeof(struct mq_attr)))
  1016. ret = -EFAULT;
  1017. out_fput:
  1018. fput(filp);
  1019. out:
  1020. return ret;
  1021. }
  1022. static const struct inode_operations mqueue_dir_inode_operations = {
  1023. .lookup = simple_lookup,
  1024. .create = mqueue_create,
  1025. .unlink = mqueue_unlink,
  1026. };
  1027. static const struct file_operations mqueue_file_operations = {
  1028. .flush = mqueue_flush_file,
  1029. .poll = mqueue_poll_file,
  1030. .read = mqueue_read_file,
  1031. };
  1032. static struct super_operations mqueue_super_ops = {
  1033. .alloc_inode = mqueue_alloc_inode,
  1034. .destroy_inode = mqueue_destroy_inode,
  1035. .statfs = simple_statfs,
  1036. .delete_inode = mqueue_delete_inode,
  1037. .drop_inode = generic_delete_inode,
  1038. };
  1039. static struct file_system_type mqueue_fs_type = {
  1040. .name = "mqueue",
  1041. .get_sb = mqueue_get_sb,
  1042. .kill_sb = kill_litter_super,
  1043. };
  1044. static int msg_max_limit_min = MIN_MSGMAX;
  1045. static int msg_max_limit_max = MAX_MSGMAX;
  1046. static int msg_maxsize_limit_min = MIN_MSGSIZEMAX;
  1047. static int msg_maxsize_limit_max = MAX_MSGSIZEMAX;
  1048. static ctl_table mq_sysctls[] = {
  1049. {
  1050. .procname = "queues_max",
  1051. .data = &queues_max,
  1052. .maxlen = sizeof(int),
  1053. .mode = 0644,
  1054. .proc_handler = &proc_dointvec,
  1055. },
  1056. {
  1057. .procname = "msg_max",
  1058. .data = &msg_max,
  1059. .maxlen = sizeof(int),
  1060. .mode = 0644,
  1061. .proc_handler = &proc_dointvec_minmax,
  1062. .extra1 = &msg_max_limit_min,
  1063. .extra2 = &msg_max_limit_max,
  1064. },
  1065. {
  1066. .procname = "msgsize_max",
  1067. .data = &msgsize_max,
  1068. .maxlen = sizeof(int),
  1069. .mode = 0644,
  1070. .proc_handler = &proc_dointvec_minmax,
  1071. .extra1 = &msg_maxsize_limit_min,
  1072. .extra2 = &msg_maxsize_limit_max,
  1073. },
  1074. { .ctl_name = 0 }
  1075. };
  1076. static ctl_table mq_sysctl_dir[] = {
  1077. {
  1078. .procname = "mqueue",
  1079. .mode = 0555,
  1080. .child = mq_sysctls,
  1081. },
  1082. { .ctl_name = 0 }
  1083. };
  1084. static ctl_table mq_sysctl_root[] = {
  1085. {
  1086. .ctl_name = CTL_FS,
  1087. .procname = "fs",
  1088. .mode = 0555,
  1089. .child = mq_sysctl_dir,
  1090. },
  1091. { .ctl_name = 0 }
  1092. };
  1093. static int __init init_mqueue_fs(void)
  1094. {
  1095. int error;
  1096. mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache",
  1097. sizeof(struct mqueue_inode_info), 0,
  1098. SLAB_HWCACHE_ALIGN, init_once);
  1099. if (mqueue_inode_cachep == NULL)
  1100. return -ENOMEM;
  1101. /* ignore failues - they are not fatal */
  1102. mq_sysctl_table = register_sysctl_table(mq_sysctl_root);
  1103. error = register_filesystem(&mqueue_fs_type);
  1104. if (error)
  1105. goto out_sysctl;
  1106. if (IS_ERR(mqueue_mnt = kern_mount(&mqueue_fs_type))) {
  1107. error = PTR_ERR(mqueue_mnt);
  1108. goto out_filesystem;
  1109. }
  1110. /* internal initialization - not common for vfs */
  1111. queues_count = 0;
  1112. spin_lock_init(&mq_lock);
  1113. return 0;
  1114. out_filesystem:
  1115. unregister_filesystem(&mqueue_fs_type);
  1116. out_sysctl:
  1117. if (mq_sysctl_table)
  1118. unregister_sysctl_table(mq_sysctl_table);
  1119. kmem_cache_destroy(mqueue_inode_cachep);
  1120. return error;
  1121. }
  1122. __initcall(init_mqueue_fs);