mqueue.c 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297
  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. struct ext_wait_queue { /* queue of sleeping tasks */
  49. struct task_struct *task;
  50. struct list_head list;
  51. struct msg_msg *msg; /* ptr of loaded message */
  52. int state; /* one of STATE_* values */
  53. };
  54. struct mqueue_inode_info {
  55. spinlock_t lock;
  56. struct inode vfs_inode;
  57. wait_queue_head_t wait_q;
  58. struct msg_msg **messages;
  59. struct mq_attr attr;
  60. struct sigevent notify;
  61. struct pid* notify_owner;
  62. struct user_struct *user; /* user who created, for accounting */
  63. struct sock *notify_sock;
  64. struct sk_buff *notify_cookie;
  65. /* for tasks waiting for free space and messages, respectively */
  66. struct ext_wait_queue e_wait_q[2];
  67. unsigned long qsize; /* size of queue in memory (sum of all msgs) */
  68. };
  69. static const struct inode_operations mqueue_dir_inode_operations;
  70. static const struct file_operations mqueue_file_operations;
  71. static struct super_operations mqueue_super_ops;
  72. static void remove_notification(struct mqueue_inode_info *info);
  73. static spinlock_t mq_lock;
  74. static struct kmem_cache *mqueue_inode_cachep;
  75. static struct vfsmount *mqueue_mnt;
  76. static unsigned int queues_count;
  77. static unsigned int queues_max = DFLT_QUEUESMAX;
  78. static unsigned int msg_max = DFLT_MSGMAX;
  79. static unsigned int msgsize_max = DFLT_MSGSIZEMAX;
  80. static struct ctl_table_header * mq_sysctl_table;
  81. static inline struct mqueue_inode_info *MQUEUE_I(struct inode *inode)
  82. {
  83. return container_of(inode, struct mqueue_inode_info, vfs_inode);
  84. }
  85. static struct inode *mqueue_get_inode(struct super_block *sb, int mode,
  86. struct mq_attr *attr)
  87. {
  88. struct inode *inode;
  89. inode = new_inode(sb);
  90. if (inode) {
  91. inode->i_mode = mode;
  92. inode->i_uid = current->fsuid;
  93. inode->i_gid = current->fsgid;
  94. inode->i_blocks = 0;
  95. inode->i_mtime = inode->i_ctime = inode->i_atime =
  96. CURRENT_TIME;
  97. if (S_ISREG(mode)) {
  98. struct mqueue_inode_info *info;
  99. struct task_struct *p = current;
  100. struct user_struct *u = p->user;
  101. unsigned long mq_bytes, mq_msg_tblsz;
  102. inode->i_fop = &mqueue_file_operations;
  103. inode->i_size = FILENT_SIZE;
  104. /* mqueue specific info */
  105. info = MQUEUE_I(inode);
  106. spin_lock_init(&info->lock);
  107. init_waitqueue_head(&info->wait_q);
  108. INIT_LIST_HEAD(&info->e_wait_q[0].list);
  109. INIT_LIST_HEAD(&info->e_wait_q[1].list);
  110. info->messages = NULL;
  111. info->notify_owner = NULL;
  112. info->qsize = 0;
  113. info->user = NULL; /* set when all is ok */
  114. memset(&info->attr, 0, sizeof(info->attr));
  115. info->attr.mq_maxmsg = DFLT_MSGMAX;
  116. info->attr.mq_msgsize = DFLT_MSGSIZEMAX;
  117. if (attr) {
  118. info->attr.mq_maxmsg = attr->mq_maxmsg;
  119. info->attr.mq_msgsize = attr->mq_msgsize;
  120. }
  121. mq_msg_tblsz = info->attr.mq_maxmsg * sizeof(struct msg_msg *);
  122. mq_bytes = (mq_msg_tblsz +
  123. (info->attr.mq_maxmsg * info->attr.mq_msgsize));
  124. spin_lock(&mq_lock);
  125. if (u->mq_bytes + mq_bytes < u->mq_bytes ||
  126. u->mq_bytes + mq_bytes >
  127. p->signal->rlim[RLIMIT_MSGQUEUE].rlim_cur) {
  128. spin_unlock(&mq_lock);
  129. goto out_inode;
  130. }
  131. u->mq_bytes += mq_bytes;
  132. spin_unlock(&mq_lock);
  133. info->messages = kmalloc(mq_msg_tblsz, GFP_KERNEL);
  134. if (!info->messages) {
  135. spin_lock(&mq_lock);
  136. u->mq_bytes -= mq_bytes;
  137. spin_unlock(&mq_lock);
  138. goto out_inode;
  139. }
  140. /* all is ok */
  141. info->user = get_uid(u);
  142. } else if (S_ISDIR(mode)) {
  143. inc_nlink(inode);
  144. /* Some things misbehave if size == 0 on a directory */
  145. inode->i_size = 2 * DIRENT_SIZE;
  146. inode->i_op = &mqueue_dir_inode_operations;
  147. inode->i_fop = &simple_dir_operations;
  148. }
  149. }
  150. return inode;
  151. out_inode:
  152. make_bad_inode(inode);
  153. iput(inode);
  154. return NULL;
  155. }
  156. static int mqueue_fill_super(struct super_block *sb, void *data, int silent)
  157. {
  158. struct inode *inode;
  159. sb->s_blocksize = PAGE_CACHE_SIZE;
  160. sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
  161. sb->s_magic = MQUEUE_MAGIC;
  162. sb->s_op = &mqueue_super_ops;
  163. inode = mqueue_get_inode(sb, S_IFDIR | S_ISVTX | S_IRWXUGO, NULL);
  164. if (!inode)
  165. return -ENOMEM;
  166. sb->s_root = d_alloc_root(inode);
  167. if (!sb->s_root) {
  168. iput(inode);
  169. return -ENOMEM;
  170. }
  171. return 0;
  172. }
  173. static int mqueue_get_sb(struct file_system_type *fs_type,
  174. int flags, const char *dev_name,
  175. void *data, struct vfsmount *mnt)
  176. {
  177. return get_sb_single(fs_type, flags, data, mqueue_fill_super, mnt);
  178. }
  179. static void init_once(struct kmem_cache *cachep, void *foo)
  180. {
  181. struct mqueue_inode_info *p = (struct mqueue_inode_info *) foo;
  182. inode_init_once(&p->vfs_inode);
  183. }
  184. static struct inode *mqueue_alloc_inode(struct super_block *sb)
  185. {
  186. struct mqueue_inode_info *ei;
  187. ei = kmem_cache_alloc(mqueue_inode_cachep, GFP_KERNEL);
  188. if (!ei)
  189. return NULL;
  190. return &ei->vfs_inode;
  191. }
  192. static void mqueue_destroy_inode(struct inode *inode)
  193. {
  194. kmem_cache_free(mqueue_inode_cachep, MQUEUE_I(inode));
  195. }
  196. static void mqueue_delete_inode(struct inode *inode)
  197. {
  198. struct mqueue_inode_info *info;
  199. struct user_struct *user;
  200. unsigned long mq_bytes;
  201. int i;
  202. if (S_ISDIR(inode->i_mode)) {
  203. clear_inode(inode);
  204. return;
  205. }
  206. info = MQUEUE_I(inode);
  207. spin_lock(&info->lock);
  208. for (i = 0; i < info->attr.mq_curmsgs; i++)
  209. free_msg(info->messages[i]);
  210. kfree(info->messages);
  211. spin_unlock(&info->lock);
  212. clear_inode(inode);
  213. mq_bytes = (info->attr.mq_maxmsg * sizeof(struct msg_msg *) +
  214. (info->attr.mq_maxmsg * info->attr.mq_msgsize));
  215. user = info->user;
  216. if (user) {
  217. spin_lock(&mq_lock);
  218. user->mq_bytes -= mq_bytes;
  219. queues_count--;
  220. spin_unlock(&mq_lock);
  221. free_uid(user);
  222. }
  223. }
  224. static int mqueue_create(struct inode *dir, struct dentry *dentry,
  225. int mode, struct nameidata *nd)
  226. {
  227. struct inode *inode;
  228. struct mq_attr *attr = dentry->d_fsdata;
  229. int error;
  230. spin_lock(&mq_lock);
  231. if (queues_count >= queues_max && !capable(CAP_SYS_RESOURCE)) {
  232. error = -ENOSPC;
  233. goto out_lock;
  234. }
  235. queues_count++;
  236. spin_unlock(&mq_lock);
  237. inode = mqueue_get_inode(dir->i_sb, mode, attr);
  238. if (!inode) {
  239. error = -ENOMEM;
  240. spin_lock(&mq_lock);
  241. queues_count--;
  242. goto out_lock;
  243. }
  244. dir->i_size += DIRENT_SIZE;
  245. dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
  246. d_instantiate(dentry, inode);
  247. dget(dentry);
  248. return 0;
  249. out_lock:
  250. spin_unlock(&mq_lock);
  251. return error;
  252. }
  253. static int mqueue_unlink(struct inode *dir, struct dentry *dentry)
  254. {
  255. struct inode *inode = dentry->d_inode;
  256. dir->i_ctime = dir->i_mtime = dir->i_atime = CURRENT_TIME;
  257. dir->i_size -= DIRENT_SIZE;
  258. drop_nlink(inode);
  259. dput(dentry);
  260. return 0;
  261. }
  262. /*
  263. * This is routine for system read from queue file.
  264. * To avoid mess with doing here some sort of mq_receive we allow
  265. * to read only queue size & notification info (the only values
  266. * that are interesting from user point of view and aren't accessible
  267. * through std routines)
  268. */
  269. static ssize_t mqueue_read_file(struct file *filp, char __user *u_data,
  270. size_t count, loff_t * off)
  271. {
  272. struct mqueue_inode_info *info = MQUEUE_I(filp->f_path.dentry->d_inode);
  273. char buffer[FILENT_SIZE];
  274. size_t slen;
  275. loff_t o;
  276. if (!count)
  277. return 0;
  278. spin_lock(&info->lock);
  279. snprintf(buffer, sizeof(buffer),
  280. "QSIZE:%-10lu NOTIFY:%-5d SIGNO:%-5d NOTIFY_PID:%-6d\n",
  281. info->qsize,
  282. info->notify_owner ? info->notify.sigev_notify : 0,
  283. (info->notify_owner &&
  284. info->notify.sigev_notify == SIGEV_SIGNAL) ?
  285. info->notify.sigev_signo : 0,
  286. pid_vnr(info->notify_owner));
  287. spin_unlock(&info->lock);
  288. buffer[sizeof(buffer)-1] = '\0';
  289. slen = strlen(buffer)+1;
  290. o = *off;
  291. if (o > slen)
  292. return 0;
  293. if (o + count > slen)
  294. count = slen - o;
  295. if (copy_to_user(u_data, buffer + o, count))
  296. return -EFAULT;
  297. *off = o + count;
  298. filp->f_path.dentry->d_inode->i_atime = filp->f_path.dentry->d_inode->i_ctime = CURRENT_TIME;
  299. return count;
  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. struct mq_attr attr;
  514. struct file *result;
  515. int ret;
  516. if (u_attr) {
  517. ret = -EFAULT;
  518. if (copy_from_user(&attr, u_attr, sizeof(attr)))
  519. goto out;
  520. ret = -EINVAL;
  521. if (!mq_attr_ok(&attr))
  522. goto out;
  523. /* store for use during create */
  524. dentry->d_fsdata = &attr;
  525. }
  526. mode &= ~current->fs->umask;
  527. ret = mnt_want_write(mqueue_mnt);
  528. if (ret)
  529. goto out;
  530. ret = vfs_create(dir->d_inode, dentry, mode, NULL);
  531. dentry->d_fsdata = NULL;
  532. if (ret)
  533. goto out_drop_write;
  534. result = dentry_open(dentry, mqueue_mnt, oflag);
  535. /*
  536. * dentry_open() took a persistent mnt_want_write(),
  537. * so we can now drop this one.
  538. */
  539. mnt_drop_write(mqueue_mnt);
  540. return result;
  541. out_drop_write:
  542. mnt_drop_write(mqueue_mnt);
  543. out:
  544. dput(dentry);
  545. mntput(mqueue_mnt);
  546. return ERR_PTR(ret);
  547. }
  548. /* Opens existing queue */
  549. static struct file *do_open(struct dentry *dentry, int oflag)
  550. {
  551. static int oflag2acc[O_ACCMODE] = { MAY_READ, MAY_WRITE,
  552. MAY_READ | MAY_WRITE };
  553. if ((oflag & O_ACCMODE) == (O_RDWR | O_WRONLY)) {
  554. dput(dentry);
  555. mntput(mqueue_mnt);
  556. return ERR_PTR(-EINVAL);
  557. }
  558. if (permission(dentry->d_inode, oflag2acc[oflag & O_ACCMODE], NULL)) {
  559. dput(dentry);
  560. mntput(mqueue_mnt);
  561. return ERR_PTR(-EACCES);
  562. }
  563. return dentry_open(dentry, mqueue_mnt, oflag);
  564. }
  565. asmlinkage long sys_mq_open(const char __user *u_name, int oflag, mode_t mode,
  566. struct mq_attr __user *u_attr)
  567. {
  568. struct dentry *dentry;
  569. struct file *filp;
  570. char *name;
  571. int fd, error;
  572. error = audit_mq_open(oflag, mode, u_attr);
  573. if (error != 0)
  574. return error;
  575. if (IS_ERR(name = getname(u_name)))
  576. return PTR_ERR(name);
  577. fd = get_unused_fd();
  578. if (fd < 0)
  579. goto out_putname;
  580. mutex_lock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  581. dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
  582. if (IS_ERR(dentry)) {
  583. error = PTR_ERR(dentry);
  584. goto out_err;
  585. }
  586. mntget(mqueue_mnt);
  587. if (oflag & O_CREAT) {
  588. if (dentry->d_inode) { /* entry already exists */
  589. audit_inode(name, dentry);
  590. error = -EEXIST;
  591. if (oflag & O_EXCL)
  592. goto out;
  593. filp = do_open(dentry, oflag);
  594. } else {
  595. filp = do_create(mqueue_mnt->mnt_root, dentry,
  596. oflag, mode, u_attr);
  597. }
  598. } else {
  599. error = -ENOENT;
  600. if (!dentry->d_inode)
  601. goto out;
  602. audit_inode(name, dentry);
  603. filp = do_open(dentry, oflag);
  604. }
  605. if (IS_ERR(filp)) {
  606. error = PTR_ERR(filp);
  607. goto out_putfd;
  608. }
  609. set_close_on_exec(fd, 1);
  610. fd_install(fd, filp);
  611. goto out_upsem;
  612. out:
  613. dput(dentry);
  614. mntput(mqueue_mnt);
  615. out_putfd:
  616. put_unused_fd(fd);
  617. out_err:
  618. fd = error;
  619. out_upsem:
  620. mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  621. out_putname:
  622. putname(name);
  623. return fd;
  624. }
  625. asmlinkage long sys_mq_unlink(const char __user *u_name)
  626. {
  627. int err;
  628. char *name;
  629. struct dentry *dentry;
  630. struct inode *inode = NULL;
  631. name = getname(u_name);
  632. if (IS_ERR(name))
  633. return PTR_ERR(name);
  634. mutex_lock_nested(&mqueue_mnt->mnt_root->d_inode->i_mutex,
  635. I_MUTEX_PARENT);
  636. dentry = lookup_one_len(name, mqueue_mnt->mnt_root, strlen(name));
  637. if (IS_ERR(dentry)) {
  638. err = PTR_ERR(dentry);
  639. goto out_unlock;
  640. }
  641. if (!dentry->d_inode) {
  642. err = -ENOENT;
  643. goto out_err;
  644. }
  645. inode = dentry->d_inode;
  646. if (inode)
  647. atomic_inc(&inode->i_count);
  648. err = mnt_want_write(mqueue_mnt);
  649. if (err)
  650. goto out_err;
  651. err = vfs_unlink(dentry->d_parent->d_inode, dentry);
  652. mnt_drop_write(mqueue_mnt);
  653. out_err:
  654. dput(dentry);
  655. out_unlock:
  656. mutex_unlock(&mqueue_mnt->mnt_root->d_inode->i_mutex);
  657. putname(name);
  658. if (inode)
  659. iput(inode);
  660. return err;
  661. }
  662. /* Pipelined send and receive functions.
  663. *
  664. * If a receiver finds no waiting message, then it registers itself in the
  665. * list of waiting receivers. A sender checks that list before adding the new
  666. * message into the message array. If there is a waiting receiver, then it
  667. * bypasses the message array and directly hands the message over to the
  668. * receiver.
  669. * The receiver accepts the message and returns without grabbing the queue
  670. * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
  671. * are necessary. The same algorithm is used for sysv semaphores, see
  672. * ipc/sem.c for more details.
  673. *
  674. * The same algorithm is used for senders.
  675. */
  676. /* pipelined_send() - send a message directly to the task waiting in
  677. * sys_mq_timedreceive() (without inserting message into a queue).
  678. */
  679. static inline void pipelined_send(struct mqueue_inode_info *info,
  680. struct msg_msg *message,
  681. struct ext_wait_queue *receiver)
  682. {
  683. receiver->msg = message;
  684. list_del(&receiver->list);
  685. receiver->state = STATE_PENDING;
  686. wake_up_process(receiver->task);
  687. smp_wmb();
  688. receiver->state = STATE_READY;
  689. }
  690. /* pipelined_receive() - if there is task waiting in sys_mq_timedsend()
  691. * gets its message and put to the queue (we have one free place for sure). */
  692. static inline void pipelined_receive(struct mqueue_inode_info *info)
  693. {
  694. struct ext_wait_queue *sender = wq_get_first_waiter(info, SEND);
  695. if (!sender) {
  696. /* for poll */
  697. wake_up_interruptible(&info->wait_q);
  698. return;
  699. }
  700. msg_insert(sender->msg, info);
  701. list_del(&sender->list);
  702. sender->state = STATE_PENDING;
  703. wake_up_process(sender->task);
  704. smp_wmb();
  705. sender->state = STATE_READY;
  706. }
  707. asmlinkage long sys_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr,
  708. size_t msg_len, unsigned int msg_prio,
  709. const struct timespec __user *u_abs_timeout)
  710. {
  711. struct file *filp;
  712. struct inode *inode;
  713. struct ext_wait_queue wait;
  714. struct ext_wait_queue *receiver;
  715. struct msg_msg *msg_ptr;
  716. struct mqueue_inode_info *info;
  717. long timeout;
  718. int ret;
  719. ret = audit_mq_timedsend(mqdes, msg_len, msg_prio, u_abs_timeout);
  720. if (ret != 0)
  721. return ret;
  722. if (unlikely(msg_prio >= (unsigned long) MQ_PRIO_MAX))
  723. return -EINVAL;
  724. timeout = prepare_timeout(u_abs_timeout);
  725. ret = -EBADF;
  726. filp = fget(mqdes);
  727. if (unlikely(!filp))
  728. goto out;
  729. inode = filp->f_path.dentry->d_inode;
  730. if (unlikely(filp->f_op != &mqueue_file_operations))
  731. goto out_fput;
  732. info = MQUEUE_I(inode);
  733. audit_inode(NULL, filp->f_path.dentry);
  734. if (unlikely(!(filp->f_mode & FMODE_WRITE)))
  735. goto out_fput;
  736. if (unlikely(msg_len > info->attr.mq_msgsize)) {
  737. ret = -EMSGSIZE;
  738. goto out_fput;
  739. }
  740. /* First try to allocate memory, before doing anything with
  741. * existing queues. */
  742. msg_ptr = load_msg(u_msg_ptr, msg_len);
  743. if (IS_ERR(msg_ptr)) {
  744. ret = PTR_ERR(msg_ptr);
  745. goto out_fput;
  746. }
  747. msg_ptr->m_ts = msg_len;
  748. msg_ptr->m_type = msg_prio;
  749. spin_lock(&info->lock);
  750. if (info->attr.mq_curmsgs == info->attr.mq_maxmsg) {
  751. if (filp->f_flags & O_NONBLOCK) {
  752. spin_unlock(&info->lock);
  753. ret = -EAGAIN;
  754. } else if (unlikely(timeout < 0)) {
  755. spin_unlock(&info->lock);
  756. ret = timeout;
  757. } else {
  758. wait.task = current;
  759. wait.msg = (void *) msg_ptr;
  760. wait.state = STATE_NONE;
  761. ret = wq_sleep(info, SEND, timeout, &wait);
  762. }
  763. if (ret < 0)
  764. free_msg(msg_ptr);
  765. } else {
  766. receiver = wq_get_first_waiter(info, RECV);
  767. if (receiver) {
  768. pipelined_send(info, msg_ptr, receiver);
  769. } else {
  770. /* adds message to the queue */
  771. msg_insert(msg_ptr, info);
  772. __do_notify(info);
  773. }
  774. inode->i_atime = inode->i_mtime = inode->i_ctime =
  775. CURRENT_TIME;
  776. spin_unlock(&info->lock);
  777. ret = 0;
  778. }
  779. out_fput:
  780. fput(filp);
  781. out:
  782. return ret;
  783. }
  784. asmlinkage ssize_t sys_mq_timedreceive(mqd_t mqdes, char __user *u_msg_ptr,
  785. size_t msg_len, unsigned int __user *u_msg_prio,
  786. const struct timespec __user *u_abs_timeout)
  787. {
  788. long timeout;
  789. ssize_t ret;
  790. struct msg_msg *msg_ptr;
  791. struct file *filp;
  792. struct inode *inode;
  793. struct mqueue_inode_info *info;
  794. struct ext_wait_queue wait;
  795. ret = audit_mq_timedreceive(mqdes, msg_len, u_msg_prio, u_abs_timeout);
  796. if (ret != 0)
  797. return ret;
  798. timeout = prepare_timeout(u_abs_timeout);
  799. ret = -EBADF;
  800. filp = fget(mqdes);
  801. if (unlikely(!filp))
  802. goto out;
  803. inode = filp->f_path.dentry->d_inode;
  804. if (unlikely(filp->f_op != &mqueue_file_operations))
  805. goto out_fput;
  806. info = MQUEUE_I(inode);
  807. audit_inode(NULL, filp->f_path.dentry);
  808. if (unlikely(!(filp->f_mode & FMODE_READ)))
  809. goto out_fput;
  810. /* checks if buffer is big enough */
  811. if (unlikely(msg_len < info->attr.mq_msgsize)) {
  812. ret = -EMSGSIZE;
  813. goto out_fput;
  814. }
  815. spin_lock(&info->lock);
  816. if (info->attr.mq_curmsgs == 0) {
  817. if (filp->f_flags & O_NONBLOCK) {
  818. spin_unlock(&info->lock);
  819. ret = -EAGAIN;
  820. msg_ptr = NULL;
  821. } else if (unlikely(timeout < 0)) {
  822. spin_unlock(&info->lock);
  823. ret = timeout;
  824. msg_ptr = NULL;
  825. } else {
  826. wait.task = current;
  827. wait.state = STATE_NONE;
  828. ret = wq_sleep(info, RECV, timeout, &wait);
  829. msg_ptr = wait.msg;
  830. }
  831. } else {
  832. msg_ptr = msg_get(info);
  833. inode->i_atime = inode->i_mtime = inode->i_ctime =
  834. CURRENT_TIME;
  835. /* There is now free space in queue. */
  836. pipelined_receive(info);
  837. spin_unlock(&info->lock);
  838. ret = 0;
  839. }
  840. if (ret == 0) {
  841. ret = msg_ptr->m_ts;
  842. if ((u_msg_prio && put_user(msg_ptr->m_type, u_msg_prio)) ||
  843. store_msg(u_msg_ptr, msg_ptr, msg_ptr->m_ts)) {
  844. ret = -EFAULT;
  845. }
  846. free_msg(msg_ptr);
  847. }
  848. out_fput:
  849. fput(filp);
  850. out:
  851. return ret;
  852. }
  853. /*
  854. * Notes: the case when user wants us to deregister (with NULL as pointer)
  855. * and he isn't currently owner of notification, will be silently discarded.
  856. * It isn't explicitly defined in the POSIX.
  857. */
  858. asmlinkage long sys_mq_notify(mqd_t mqdes,
  859. const struct sigevent __user *u_notification)
  860. {
  861. int ret;
  862. struct file *filp;
  863. struct sock *sock;
  864. struct inode *inode;
  865. struct sigevent notification;
  866. struct mqueue_inode_info *info;
  867. struct sk_buff *nc;
  868. ret = audit_mq_notify(mqdes, u_notification);
  869. if (ret != 0)
  870. return ret;
  871. nc = NULL;
  872. sock = NULL;
  873. if (u_notification != NULL) {
  874. if (copy_from_user(&notification, u_notification,
  875. sizeof(struct sigevent)))
  876. return -EFAULT;
  877. if (unlikely(notification.sigev_notify != SIGEV_NONE &&
  878. notification.sigev_notify != SIGEV_SIGNAL &&
  879. notification.sigev_notify != SIGEV_THREAD))
  880. return -EINVAL;
  881. if (notification.sigev_notify == SIGEV_SIGNAL &&
  882. !valid_signal(notification.sigev_signo)) {
  883. return -EINVAL;
  884. }
  885. if (notification.sigev_notify == SIGEV_THREAD) {
  886. long timeo;
  887. /* create the notify skb */
  888. nc = alloc_skb(NOTIFY_COOKIE_LEN, GFP_KERNEL);
  889. ret = -ENOMEM;
  890. if (!nc)
  891. goto out;
  892. ret = -EFAULT;
  893. if (copy_from_user(nc->data,
  894. notification.sigev_value.sival_ptr,
  895. NOTIFY_COOKIE_LEN)) {
  896. goto out;
  897. }
  898. /* TODO: add a header? */
  899. skb_put(nc, NOTIFY_COOKIE_LEN);
  900. /* and attach it to the socket */
  901. retry:
  902. filp = fget(notification.sigev_signo);
  903. ret = -EBADF;
  904. if (!filp)
  905. goto out;
  906. sock = netlink_getsockbyfilp(filp);
  907. fput(filp);
  908. if (IS_ERR(sock)) {
  909. ret = PTR_ERR(sock);
  910. sock = NULL;
  911. goto out;
  912. }
  913. timeo = MAX_SCHEDULE_TIMEOUT;
  914. ret = netlink_attachskb(sock, nc, 0, &timeo, NULL);
  915. if (ret == 1)
  916. goto retry;
  917. if (ret) {
  918. sock = NULL;
  919. nc = NULL;
  920. goto out;
  921. }
  922. }
  923. }
  924. ret = -EBADF;
  925. filp = fget(mqdes);
  926. if (!filp)
  927. goto out;
  928. inode = filp->f_path.dentry->d_inode;
  929. if (unlikely(filp->f_op != &mqueue_file_operations))
  930. goto out_fput;
  931. info = MQUEUE_I(inode);
  932. ret = 0;
  933. spin_lock(&info->lock);
  934. if (u_notification == NULL) {
  935. if (info->notify_owner == task_tgid(current)) {
  936. remove_notification(info);
  937. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  938. }
  939. } else if (info->notify_owner != NULL) {
  940. ret = -EBUSY;
  941. } else {
  942. switch (notification.sigev_notify) {
  943. case SIGEV_NONE:
  944. info->notify.sigev_notify = SIGEV_NONE;
  945. break;
  946. case SIGEV_THREAD:
  947. info->notify_sock = sock;
  948. info->notify_cookie = nc;
  949. sock = NULL;
  950. nc = NULL;
  951. info->notify.sigev_notify = SIGEV_THREAD;
  952. break;
  953. case SIGEV_SIGNAL:
  954. info->notify.sigev_signo = notification.sigev_signo;
  955. info->notify.sigev_value = notification.sigev_value;
  956. info->notify.sigev_notify = SIGEV_SIGNAL;
  957. break;
  958. }
  959. info->notify_owner = get_pid(task_tgid(current));
  960. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  961. }
  962. spin_unlock(&info->lock);
  963. out_fput:
  964. fput(filp);
  965. out:
  966. if (sock) {
  967. netlink_detachskb(sock, nc);
  968. } else if (nc) {
  969. dev_kfree_skb(nc);
  970. }
  971. return ret;
  972. }
  973. asmlinkage long sys_mq_getsetattr(mqd_t mqdes,
  974. const struct mq_attr __user *u_mqstat,
  975. struct mq_attr __user *u_omqstat)
  976. {
  977. int ret;
  978. struct mq_attr mqstat, omqstat;
  979. struct file *filp;
  980. struct inode *inode;
  981. struct mqueue_inode_info *info;
  982. if (u_mqstat != NULL) {
  983. if (copy_from_user(&mqstat, u_mqstat, sizeof(struct mq_attr)))
  984. return -EFAULT;
  985. if (mqstat.mq_flags & (~O_NONBLOCK))
  986. return -EINVAL;
  987. }
  988. ret = -EBADF;
  989. filp = fget(mqdes);
  990. if (!filp)
  991. goto out;
  992. inode = filp->f_path.dentry->d_inode;
  993. if (unlikely(filp->f_op != &mqueue_file_operations))
  994. goto out_fput;
  995. info = MQUEUE_I(inode);
  996. spin_lock(&info->lock);
  997. omqstat = info->attr;
  998. omqstat.mq_flags = filp->f_flags & O_NONBLOCK;
  999. if (u_mqstat) {
  1000. ret = audit_mq_getsetattr(mqdes, &mqstat);
  1001. if (ret != 0) {
  1002. spin_unlock(&info->lock);
  1003. goto out_fput;
  1004. }
  1005. if (mqstat.mq_flags & O_NONBLOCK)
  1006. filp->f_flags |= O_NONBLOCK;
  1007. else
  1008. filp->f_flags &= ~O_NONBLOCK;
  1009. inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1010. }
  1011. spin_unlock(&info->lock);
  1012. ret = 0;
  1013. if (u_omqstat != NULL && copy_to_user(u_omqstat, &omqstat,
  1014. sizeof(struct mq_attr)))
  1015. ret = -EFAULT;
  1016. out_fput:
  1017. fput(filp);
  1018. out:
  1019. return ret;
  1020. }
  1021. static const struct inode_operations mqueue_dir_inode_operations = {
  1022. .lookup = simple_lookup,
  1023. .create = mqueue_create,
  1024. .unlink = mqueue_unlink,
  1025. };
  1026. static const struct file_operations mqueue_file_operations = {
  1027. .flush = mqueue_flush_file,
  1028. .poll = mqueue_poll_file,
  1029. .read = mqueue_read_file,
  1030. };
  1031. static struct super_operations mqueue_super_ops = {
  1032. .alloc_inode = mqueue_alloc_inode,
  1033. .destroy_inode = mqueue_destroy_inode,
  1034. .statfs = simple_statfs,
  1035. .delete_inode = mqueue_delete_inode,
  1036. .drop_inode = generic_delete_inode,
  1037. };
  1038. static struct file_system_type mqueue_fs_type = {
  1039. .name = "mqueue",
  1040. .get_sb = mqueue_get_sb,
  1041. .kill_sb = kill_litter_super,
  1042. };
  1043. static int msg_max_limit_min = DFLT_MSGMAX;
  1044. static int msg_max_limit_max = HARD_MSGMAX;
  1045. static int msg_maxsize_limit_min = DFLT_MSGSIZEMAX;
  1046. static int msg_maxsize_limit_max = INT_MAX;
  1047. static ctl_table mq_sysctls[] = {
  1048. {
  1049. .procname = "queues_max",
  1050. .data = &queues_max,
  1051. .maxlen = sizeof(int),
  1052. .mode = 0644,
  1053. .proc_handler = &proc_dointvec,
  1054. },
  1055. {
  1056. .procname = "msg_max",
  1057. .data = &msg_max,
  1058. .maxlen = sizeof(int),
  1059. .mode = 0644,
  1060. .proc_handler = &proc_dointvec_minmax,
  1061. .extra1 = &msg_max_limit_min,
  1062. .extra2 = &msg_max_limit_max,
  1063. },
  1064. {
  1065. .procname = "msgsize_max",
  1066. .data = &msgsize_max,
  1067. .maxlen = sizeof(int),
  1068. .mode = 0644,
  1069. .proc_handler = &proc_dointvec_minmax,
  1070. .extra1 = &msg_maxsize_limit_min,
  1071. .extra2 = &msg_maxsize_limit_max,
  1072. },
  1073. { .ctl_name = 0 }
  1074. };
  1075. static ctl_table mq_sysctl_dir[] = {
  1076. {
  1077. .procname = "mqueue",
  1078. .mode = 0555,
  1079. .child = mq_sysctls,
  1080. },
  1081. { .ctl_name = 0 }
  1082. };
  1083. static ctl_table mq_sysctl_root[] = {
  1084. {
  1085. .ctl_name = CTL_FS,
  1086. .procname = "fs",
  1087. .mode = 0555,
  1088. .child = mq_sysctl_dir,
  1089. },
  1090. { .ctl_name = 0 }
  1091. };
  1092. static int __init init_mqueue_fs(void)
  1093. {
  1094. int error;
  1095. mqueue_inode_cachep = kmem_cache_create("mqueue_inode_cache",
  1096. sizeof(struct mqueue_inode_info), 0,
  1097. SLAB_HWCACHE_ALIGN, init_once);
  1098. if (mqueue_inode_cachep == NULL)
  1099. return -ENOMEM;
  1100. /* ignore failues - they are not fatal */
  1101. mq_sysctl_table = register_sysctl_table(mq_sysctl_root);
  1102. error = register_filesystem(&mqueue_fs_type);
  1103. if (error)
  1104. goto out_sysctl;
  1105. if (IS_ERR(mqueue_mnt = kern_mount(&mqueue_fs_type))) {
  1106. error = PTR_ERR(mqueue_mnt);
  1107. goto out_filesystem;
  1108. }
  1109. /* internal initialization - not common for vfs */
  1110. queues_count = 0;
  1111. spin_lock_init(&mq_lock);
  1112. return 0;
  1113. out_filesystem:
  1114. unregister_filesystem(&mqueue_fs_type);
  1115. out_sysctl:
  1116. if (mq_sysctl_table)
  1117. unregister_sysctl_table(mq_sysctl_table);
  1118. kmem_cache_destroy(mqueue_inode_cachep);
  1119. return error;
  1120. }
  1121. __initcall(init_mqueue_fs);