fcntl.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591
  1. /*
  2. * linux/fs/fcntl.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/syscalls.h>
  7. #include <linux/init.h>
  8. #include <linux/mm.h>
  9. #include <linux/fs.h>
  10. #include <linux/file.h>
  11. #include <linux/fdtable.h>
  12. #include <linux/capability.h>
  13. #include <linux/dnotify.h>
  14. #include <linux/slab.h>
  15. #include <linux/module.h>
  16. #include <linux/security.h>
  17. #include <linux/ptrace.h>
  18. #include <linux/signal.h>
  19. #include <linux/rcupdate.h>
  20. #include <linux/pid_namespace.h>
  21. #include <asm/poll.h>
  22. #include <asm/siginfo.h>
  23. #include <asm/uaccess.h>
  24. void set_close_on_exec(unsigned int fd, int flag)
  25. {
  26. struct files_struct *files = current->files;
  27. struct fdtable *fdt;
  28. spin_lock(&files->file_lock);
  29. fdt = files_fdtable(files);
  30. if (flag)
  31. FD_SET(fd, fdt->close_on_exec);
  32. else
  33. FD_CLR(fd, fdt->close_on_exec);
  34. spin_unlock(&files->file_lock);
  35. }
  36. static int get_close_on_exec(unsigned int fd)
  37. {
  38. struct files_struct *files = current->files;
  39. struct fdtable *fdt;
  40. int res;
  41. rcu_read_lock();
  42. fdt = files_fdtable(files);
  43. res = FD_ISSET(fd, fdt->close_on_exec);
  44. rcu_read_unlock();
  45. return res;
  46. }
  47. asmlinkage long sys_dup3(unsigned int oldfd, unsigned int newfd, int flags)
  48. {
  49. int err = -EBADF;
  50. struct file * file, *tofree;
  51. struct files_struct * files = current->files;
  52. struct fdtable *fdt;
  53. if ((flags & ~O_CLOEXEC) != 0)
  54. return -EINVAL;
  55. if (unlikely(oldfd == newfd))
  56. return -EINVAL;
  57. spin_lock(&files->file_lock);
  58. err = expand_files(files, newfd);
  59. file = fcheck(oldfd);
  60. if (unlikely(!file))
  61. goto Ebadf;
  62. if (unlikely(err < 0)) {
  63. if (err == -EMFILE)
  64. goto Ebadf;
  65. goto out_unlock;
  66. }
  67. /*
  68. * We need to detect attempts to do dup2() over allocated but still
  69. * not finished descriptor. NB: OpenBSD avoids that at the price of
  70. * extra work in their equivalent of fget() - they insert struct
  71. * file immediately after grabbing descriptor, mark it larval if
  72. * more work (e.g. actual opening) is needed and make sure that
  73. * fget() treats larval files as absent. Potentially interesting,
  74. * but while extra work in fget() is trivial, locking implications
  75. * and amount of surgery on open()-related paths in VFS are not.
  76. * FreeBSD fails with -EBADF in the same situation, NetBSD "solution"
  77. * deadlocks in rather amusing ways, AFAICS. All of that is out of
  78. * scope of POSIX or SUS, since neither considers shared descriptor
  79. * tables and this condition does not arise without those.
  80. */
  81. err = -EBUSY;
  82. fdt = files_fdtable(files);
  83. tofree = fdt->fd[newfd];
  84. if (!tofree && FD_ISSET(newfd, fdt->open_fds))
  85. goto out_unlock;
  86. get_file(file);
  87. rcu_assign_pointer(fdt->fd[newfd], file);
  88. FD_SET(newfd, fdt->open_fds);
  89. if (flags & O_CLOEXEC)
  90. FD_SET(newfd, fdt->close_on_exec);
  91. else
  92. FD_CLR(newfd, fdt->close_on_exec);
  93. spin_unlock(&files->file_lock);
  94. if (tofree)
  95. filp_close(tofree, files);
  96. return newfd;
  97. Ebadf:
  98. err = -EBADF;
  99. out_unlock:
  100. spin_unlock(&files->file_lock);
  101. return err;
  102. }
  103. asmlinkage long sys_dup2(unsigned int oldfd, unsigned int newfd)
  104. {
  105. if (unlikely(newfd == oldfd)) { /* corner case */
  106. struct files_struct *files = current->files;
  107. rcu_read_lock();
  108. if (!fcheck_files(files, oldfd))
  109. oldfd = -EBADF;
  110. rcu_read_unlock();
  111. return oldfd;
  112. }
  113. return sys_dup3(oldfd, newfd, 0);
  114. }
  115. asmlinkage long sys_dup(unsigned int fildes)
  116. {
  117. int ret = -EBADF;
  118. struct file *file = fget(fildes);
  119. if (file) {
  120. ret = get_unused_fd();
  121. if (ret >= 0)
  122. fd_install(ret, file);
  123. else
  124. fput(file);
  125. }
  126. return ret;
  127. }
  128. #define SETFL_MASK (O_APPEND | O_NONBLOCK | O_NDELAY | FASYNC | O_DIRECT | O_NOATIME)
  129. static int setfl(int fd, struct file * filp, unsigned long arg)
  130. {
  131. struct inode * inode = filp->f_path.dentry->d_inode;
  132. int error = 0;
  133. /*
  134. * O_APPEND cannot be cleared if the file is marked as append-only
  135. * and the file is open for write.
  136. */
  137. if (((arg ^ filp->f_flags) & O_APPEND) && IS_APPEND(inode))
  138. return -EPERM;
  139. /* O_NOATIME can only be set by the owner or superuser */
  140. if ((arg & O_NOATIME) && !(filp->f_flags & O_NOATIME))
  141. if (!is_owner_or_cap(inode))
  142. return -EPERM;
  143. /* required for strict SunOS emulation */
  144. if (O_NONBLOCK != O_NDELAY)
  145. if (arg & O_NDELAY)
  146. arg |= O_NONBLOCK;
  147. if (arg & O_DIRECT) {
  148. if (!filp->f_mapping || !filp->f_mapping->a_ops ||
  149. !filp->f_mapping->a_ops->direct_IO)
  150. return -EINVAL;
  151. }
  152. if (filp->f_op && filp->f_op->check_flags)
  153. error = filp->f_op->check_flags(arg);
  154. if (error)
  155. return error;
  156. if ((arg ^ filp->f_flags) & FASYNC) {
  157. if (filp->f_op && filp->f_op->fasync) {
  158. error = filp->f_op->fasync(fd, filp, (arg & FASYNC) != 0);
  159. if (error < 0)
  160. goto out;
  161. }
  162. }
  163. filp->f_flags = (arg & SETFL_MASK) | (filp->f_flags & ~SETFL_MASK);
  164. out:
  165. return error;
  166. }
  167. static void f_modown(struct file *filp, struct pid *pid, enum pid_type type,
  168. uid_t uid, uid_t euid, int force)
  169. {
  170. write_lock_irq(&filp->f_owner.lock);
  171. if (force || !filp->f_owner.pid) {
  172. put_pid(filp->f_owner.pid);
  173. filp->f_owner.pid = get_pid(pid);
  174. filp->f_owner.pid_type = type;
  175. filp->f_owner.uid = uid;
  176. filp->f_owner.euid = euid;
  177. }
  178. write_unlock_irq(&filp->f_owner.lock);
  179. }
  180. int __f_setown(struct file *filp, struct pid *pid, enum pid_type type,
  181. int force)
  182. {
  183. const struct cred *cred = current_cred();
  184. int err;
  185. err = security_file_set_fowner(filp);
  186. if (err)
  187. return err;
  188. f_modown(filp, pid, type, cred->uid, cred->euid, force);
  189. return 0;
  190. }
  191. EXPORT_SYMBOL(__f_setown);
  192. int f_setown(struct file *filp, unsigned long arg, int force)
  193. {
  194. enum pid_type type;
  195. struct pid *pid;
  196. int who = arg;
  197. int result;
  198. type = PIDTYPE_PID;
  199. if (who < 0) {
  200. type = PIDTYPE_PGID;
  201. who = -who;
  202. }
  203. rcu_read_lock();
  204. pid = find_vpid(who);
  205. result = __f_setown(filp, pid, type, force);
  206. rcu_read_unlock();
  207. return result;
  208. }
  209. EXPORT_SYMBOL(f_setown);
  210. void f_delown(struct file *filp)
  211. {
  212. f_modown(filp, NULL, PIDTYPE_PID, 0, 0, 1);
  213. }
  214. pid_t f_getown(struct file *filp)
  215. {
  216. pid_t pid;
  217. read_lock(&filp->f_owner.lock);
  218. pid = pid_vnr(filp->f_owner.pid);
  219. if (filp->f_owner.pid_type == PIDTYPE_PGID)
  220. pid = -pid;
  221. read_unlock(&filp->f_owner.lock);
  222. return pid;
  223. }
  224. static long do_fcntl(int fd, unsigned int cmd, unsigned long arg,
  225. struct file *filp)
  226. {
  227. long err = -EINVAL;
  228. switch (cmd) {
  229. case F_DUPFD:
  230. case F_DUPFD_CLOEXEC:
  231. if (arg >= current->signal->rlim[RLIMIT_NOFILE].rlim_cur)
  232. break;
  233. err = alloc_fd(arg, cmd == F_DUPFD_CLOEXEC ? O_CLOEXEC : 0);
  234. if (err >= 0) {
  235. get_file(filp);
  236. fd_install(err, filp);
  237. }
  238. break;
  239. case F_GETFD:
  240. err = get_close_on_exec(fd) ? FD_CLOEXEC : 0;
  241. break;
  242. case F_SETFD:
  243. err = 0;
  244. set_close_on_exec(fd, arg & FD_CLOEXEC);
  245. break;
  246. case F_GETFL:
  247. err = filp->f_flags;
  248. break;
  249. case F_SETFL:
  250. err = setfl(fd, filp, arg);
  251. break;
  252. case F_GETLK:
  253. err = fcntl_getlk(filp, (struct flock __user *) arg);
  254. break;
  255. case F_SETLK:
  256. case F_SETLKW:
  257. err = fcntl_setlk(fd, filp, cmd, (struct flock __user *) arg);
  258. break;
  259. case F_GETOWN:
  260. /*
  261. * XXX If f_owner is a process group, the
  262. * negative return value will get converted
  263. * into an error. Oops. If we keep the
  264. * current syscall conventions, the only way
  265. * to fix this will be in libc.
  266. */
  267. err = f_getown(filp);
  268. force_successful_syscall_return();
  269. break;
  270. case F_SETOWN:
  271. err = f_setown(filp, arg, 1);
  272. break;
  273. case F_GETSIG:
  274. err = filp->f_owner.signum;
  275. break;
  276. case F_SETSIG:
  277. /* arg == 0 restores default behaviour. */
  278. if (!valid_signal(arg)) {
  279. break;
  280. }
  281. err = 0;
  282. filp->f_owner.signum = arg;
  283. break;
  284. case F_GETLEASE:
  285. err = fcntl_getlease(filp);
  286. break;
  287. case F_SETLEASE:
  288. err = fcntl_setlease(fd, filp, arg);
  289. break;
  290. case F_NOTIFY:
  291. err = fcntl_dirnotify(fd, filp, arg);
  292. break;
  293. default:
  294. break;
  295. }
  296. return err;
  297. }
  298. asmlinkage long sys_fcntl(unsigned int fd, unsigned int cmd, unsigned long arg)
  299. {
  300. struct file *filp;
  301. long err = -EBADF;
  302. filp = fget(fd);
  303. if (!filp)
  304. goto out;
  305. err = security_file_fcntl(filp, cmd, arg);
  306. if (err) {
  307. fput(filp);
  308. return err;
  309. }
  310. err = do_fcntl(fd, cmd, arg, filp);
  311. fput(filp);
  312. out:
  313. return err;
  314. }
  315. #if BITS_PER_LONG == 32
  316. asmlinkage long sys_fcntl64(unsigned int fd, unsigned int cmd, unsigned long arg)
  317. {
  318. struct file * filp;
  319. long err;
  320. err = -EBADF;
  321. filp = fget(fd);
  322. if (!filp)
  323. goto out;
  324. err = security_file_fcntl(filp, cmd, arg);
  325. if (err) {
  326. fput(filp);
  327. return err;
  328. }
  329. err = -EBADF;
  330. switch (cmd) {
  331. case F_GETLK64:
  332. err = fcntl_getlk64(filp, (struct flock64 __user *) arg);
  333. break;
  334. case F_SETLK64:
  335. case F_SETLKW64:
  336. err = fcntl_setlk64(fd, filp, cmd,
  337. (struct flock64 __user *) arg);
  338. break;
  339. default:
  340. err = do_fcntl(fd, cmd, arg, filp);
  341. break;
  342. }
  343. fput(filp);
  344. out:
  345. return err;
  346. }
  347. #endif
  348. /* Table to convert sigio signal codes into poll band bitmaps */
  349. static const long band_table[NSIGPOLL] = {
  350. POLLIN | POLLRDNORM, /* POLL_IN */
  351. POLLOUT | POLLWRNORM | POLLWRBAND, /* POLL_OUT */
  352. POLLIN | POLLRDNORM | POLLMSG, /* POLL_MSG */
  353. POLLERR, /* POLL_ERR */
  354. POLLPRI | POLLRDBAND, /* POLL_PRI */
  355. POLLHUP | POLLERR /* POLL_HUP */
  356. };
  357. static inline int sigio_perm(struct task_struct *p,
  358. struct fown_struct *fown, int sig)
  359. {
  360. return (((fown->euid == 0) ||
  361. (fown->euid == p->cred->suid) || (fown->euid == p->cred->uid) ||
  362. (fown->uid == p->cred->suid) || (fown->uid == p->cred->uid)) &&
  363. !security_file_send_sigiotask(p, fown, sig));
  364. }
  365. static void send_sigio_to_task(struct task_struct *p,
  366. struct fown_struct *fown,
  367. int fd,
  368. int reason)
  369. {
  370. if (!sigio_perm(p, fown, fown->signum))
  371. return;
  372. switch (fown->signum) {
  373. siginfo_t si;
  374. default:
  375. /* Queue a rt signal with the appropriate fd as its
  376. value. We use SI_SIGIO as the source, not
  377. SI_KERNEL, since kernel signals always get
  378. delivered even if we can't queue. Failure to
  379. queue in this case _should_ be reported; we fall
  380. back to SIGIO in that case. --sct */
  381. si.si_signo = fown->signum;
  382. si.si_errno = 0;
  383. si.si_code = reason;
  384. /* Make sure we are called with one of the POLL_*
  385. reasons, otherwise we could leak kernel stack into
  386. userspace. */
  387. BUG_ON((reason & __SI_MASK) != __SI_POLL);
  388. if (reason - POLL_IN >= NSIGPOLL)
  389. si.si_band = ~0L;
  390. else
  391. si.si_band = band_table[reason - POLL_IN];
  392. si.si_fd = fd;
  393. if (!group_send_sig_info(fown->signum, &si, p))
  394. break;
  395. /* fall-through: fall back on the old plain SIGIO signal */
  396. case 0:
  397. group_send_sig_info(SIGIO, SEND_SIG_PRIV, p);
  398. }
  399. }
  400. void send_sigio(struct fown_struct *fown, int fd, int band)
  401. {
  402. struct task_struct *p;
  403. enum pid_type type;
  404. struct pid *pid;
  405. read_lock(&fown->lock);
  406. type = fown->pid_type;
  407. pid = fown->pid;
  408. if (!pid)
  409. goto out_unlock_fown;
  410. read_lock(&tasklist_lock);
  411. do_each_pid_task(pid, type, p) {
  412. send_sigio_to_task(p, fown, fd, band);
  413. } while_each_pid_task(pid, type, p);
  414. read_unlock(&tasklist_lock);
  415. out_unlock_fown:
  416. read_unlock(&fown->lock);
  417. }
  418. static void send_sigurg_to_task(struct task_struct *p,
  419. struct fown_struct *fown)
  420. {
  421. if (sigio_perm(p, fown, SIGURG))
  422. group_send_sig_info(SIGURG, SEND_SIG_PRIV, p);
  423. }
  424. int send_sigurg(struct fown_struct *fown)
  425. {
  426. struct task_struct *p;
  427. enum pid_type type;
  428. struct pid *pid;
  429. int ret = 0;
  430. read_lock(&fown->lock);
  431. type = fown->pid_type;
  432. pid = fown->pid;
  433. if (!pid)
  434. goto out_unlock_fown;
  435. ret = 1;
  436. read_lock(&tasklist_lock);
  437. do_each_pid_task(pid, type, p) {
  438. send_sigurg_to_task(p, fown);
  439. } while_each_pid_task(pid, type, p);
  440. read_unlock(&tasklist_lock);
  441. out_unlock_fown:
  442. read_unlock(&fown->lock);
  443. return ret;
  444. }
  445. static DEFINE_RWLOCK(fasync_lock);
  446. static struct kmem_cache *fasync_cache __read_mostly;
  447. /*
  448. * fasync_helper() is used by some character device drivers (mainly mice)
  449. * to set up the fasync queue. It returns negative on error, 0 if it did
  450. * no changes and positive if it added/deleted the entry.
  451. */
  452. int fasync_helper(int fd, struct file * filp, int on, struct fasync_struct **fapp)
  453. {
  454. struct fasync_struct *fa, **fp;
  455. struct fasync_struct *new = NULL;
  456. int result = 0;
  457. if (on) {
  458. new = kmem_cache_alloc(fasync_cache, GFP_KERNEL);
  459. if (!new)
  460. return -ENOMEM;
  461. }
  462. write_lock_irq(&fasync_lock);
  463. for (fp = fapp; (fa = *fp) != NULL; fp = &fa->fa_next) {
  464. if (fa->fa_file == filp) {
  465. if(on) {
  466. fa->fa_fd = fd;
  467. kmem_cache_free(fasync_cache, new);
  468. } else {
  469. *fp = fa->fa_next;
  470. kmem_cache_free(fasync_cache, fa);
  471. result = 1;
  472. }
  473. goto out;
  474. }
  475. }
  476. if (on) {
  477. new->magic = FASYNC_MAGIC;
  478. new->fa_file = filp;
  479. new->fa_fd = fd;
  480. new->fa_next = *fapp;
  481. *fapp = new;
  482. result = 1;
  483. }
  484. out:
  485. write_unlock_irq(&fasync_lock);
  486. return result;
  487. }
  488. EXPORT_SYMBOL(fasync_helper);
  489. void __kill_fasync(struct fasync_struct *fa, int sig, int band)
  490. {
  491. while (fa) {
  492. struct fown_struct * fown;
  493. if (fa->magic != FASYNC_MAGIC) {
  494. printk(KERN_ERR "kill_fasync: bad magic number in "
  495. "fasync_struct!\n");
  496. return;
  497. }
  498. fown = &fa->fa_file->f_owner;
  499. /* Don't send SIGURG to processes which have not set a
  500. queued signum: SIGURG has its own default signalling
  501. mechanism. */
  502. if (!(sig == SIGURG && fown->signum == 0))
  503. send_sigio(fown, fa->fa_fd, band);
  504. fa = fa->fa_next;
  505. }
  506. }
  507. EXPORT_SYMBOL(__kill_fasync);
  508. void kill_fasync(struct fasync_struct **fp, int sig, int band)
  509. {
  510. /* First a quick test without locking: usually
  511. * the list is empty.
  512. */
  513. if (*fp) {
  514. read_lock(&fasync_lock);
  515. /* reread *fp after obtaining the lock */
  516. __kill_fasync(*fp, sig, band);
  517. read_unlock(&fasync_lock);
  518. }
  519. }
  520. EXPORT_SYMBOL(kill_fasync);
  521. static int __init fasync_init(void)
  522. {
  523. fasync_cache = kmem_cache_create("fasync_cache",
  524. sizeof(struct fasync_struct), 0, SLAB_PANIC, NULL);
  525. return 0;
  526. }
  527. module_init(fasync_init)