fcntl.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622
  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/capability.h>
  12. #include <linux/dnotify.h>
  13. #include <linux/smp_lock.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 <asm/poll.h>
  21. #include <asm/siginfo.h>
  22. #include <asm/uaccess.h>
  23. void fastcall set_close_on_exec(unsigned int fd, int flag)
  24. {
  25. struct files_struct *files = current->files;
  26. struct fdtable *fdt;
  27. spin_lock(&files->file_lock);
  28. fdt = files_fdtable(files);
  29. if (flag)
  30. FD_SET(fd, fdt->close_on_exec);
  31. else
  32. FD_CLR(fd, fdt->close_on_exec);
  33. spin_unlock(&files->file_lock);
  34. }
  35. static int get_close_on_exec(unsigned int fd)
  36. {
  37. struct files_struct *files = current->files;
  38. struct fdtable *fdt;
  39. int res;
  40. rcu_read_lock();
  41. fdt = files_fdtable(files);
  42. res = FD_ISSET(fd, fdt->close_on_exec);
  43. rcu_read_unlock();
  44. return res;
  45. }
  46. /*
  47. * locate_fd finds a free file descriptor in the open_fds fdset,
  48. * expanding the fd arrays if necessary. Must be called with the
  49. * file_lock held for write.
  50. */
  51. static int locate_fd(struct files_struct *files,
  52. struct file *file, unsigned int orig_start)
  53. {
  54. unsigned int newfd;
  55. unsigned int start;
  56. int error;
  57. struct fdtable *fdt;
  58. error = -EINVAL;
  59. if (orig_start >= current->signal->rlim[RLIMIT_NOFILE].rlim_cur)
  60. goto out;
  61. repeat:
  62. fdt = files_fdtable(files);
  63. /*
  64. * Someone might have closed fd's in the range
  65. * orig_start..fdt->next_fd
  66. */
  67. start = orig_start;
  68. if (start < fdt->next_fd)
  69. start = fdt->next_fd;
  70. newfd = start;
  71. if (start < fdt->max_fdset) {
  72. newfd = find_next_zero_bit(fdt->open_fds->fds_bits,
  73. fdt->max_fdset, start);
  74. }
  75. error = -EMFILE;
  76. if (newfd >= current->signal->rlim[RLIMIT_NOFILE].rlim_cur)
  77. goto out;
  78. error = expand_files(files, newfd);
  79. if (error < 0)
  80. goto out;
  81. /*
  82. * If we needed to expand the fs array we
  83. * might have blocked - try again.
  84. */
  85. if (error)
  86. goto repeat;
  87. /*
  88. * We reacquired files_lock, so we are safe as long as
  89. * we reacquire the fdtable pointer and use it while holding
  90. * the lock, no one can free it during that time.
  91. */
  92. fdt = files_fdtable(files);
  93. if (start <= fdt->next_fd)
  94. fdt->next_fd = newfd + 1;
  95. error = newfd;
  96. out:
  97. return error;
  98. }
  99. static int dupfd(struct file *file, unsigned int start)
  100. {
  101. struct files_struct * files = current->files;
  102. struct fdtable *fdt;
  103. int fd;
  104. spin_lock(&files->file_lock);
  105. fd = locate_fd(files, file, start);
  106. if (fd >= 0) {
  107. /* locate_fd() may have expanded fdtable, load the ptr */
  108. fdt = files_fdtable(files);
  109. FD_SET(fd, fdt->open_fds);
  110. FD_CLR(fd, fdt->close_on_exec);
  111. spin_unlock(&files->file_lock);
  112. fd_install(fd, file);
  113. } else {
  114. spin_unlock(&files->file_lock);
  115. fput(file);
  116. }
  117. return fd;
  118. }
  119. asmlinkage long sys_dup2(unsigned int oldfd, unsigned int newfd)
  120. {
  121. int err = -EBADF;
  122. struct file * file, *tofree;
  123. struct files_struct * files = current->files;
  124. struct fdtable *fdt;
  125. spin_lock(&files->file_lock);
  126. if (!(file = fcheck(oldfd)))
  127. goto out_unlock;
  128. err = newfd;
  129. if (newfd == oldfd)
  130. goto out_unlock;
  131. err = -EBADF;
  132. if (newfd >= current->signal->rlim[RLIMIT_NOFILE].rlim_cur)
  133. goto out_unlock;
  134. get_file(file); /* We are now finished with oldfd */
  135. err = expand_files(files, newfd);
  136. if (err < 0)
  137. goto out_fput;
  138. /* To avoid races with open() and dup(), we will mark the fd as
  139. * in-use in the open-file bitmap throughout the entire dup2()
  140. * process. This is quite safe: do_close() uses the fd array
  141. * entry, not the bitmap, to decide what work needs to be
  142. * done. --sct */
  143. /* Doesn't work. open() might be there first. --AV */
  144. /* Yes. It's a race. In user space. Nothing sane to do */
  145. err = -EBUSY;
  146. fdt = files_fdtable(files);
  147. tofree = fdt->fd[newfd];
  148. if (!tofree && FD_ISSET(newfd, fdt->open_fds))
  149. goto out_fput;
  150. rcu_assign_pointer(fdt->fd[newfd], file);
  151. FD_SET(newfd, fdt->open_fds);
  152. FD_CLR(newfd, fdt->close_on_exec);
  153. spin_unlock(&files->file_lock);
  154. if (tofree)
  155. filp_close(tofree, files);
  156. err = newfd;
  157. out:
  158. return err;
  159. out_unlock:
  160. spin_unlock(&files->file_lock);
  161. goto out;
  162. out_fput:
  163. spin_unlock(&files->file_lock);
  164. fput(file);
  165. goto out;
  166. }
  167. asmlinkage long sys_dup(unsigned int fildes)
  168. {
  169. int ret = -EBADF;
  170. struct file * file = fget(fildes);
  171. if (file)
  172. ret = dupfd(file, 0);
  173. return ret;
  174. }
  175. #define SETFL_MASK (O_APPEND | O_NONBLOCK | O_NDELAY | FASYNC | O_DIRECT | O_NOATIME)
  176. static int setfl(int fd, struct file * filp, unsigned long arg)
  177. {
  178. struct inode * inode = filp->f_dentry->d_inode;
  179. int error = 0;
  180. /* O_APPEND cannot be cleared if the file is marked as append-only */
  181. if (!(arg & O_APPEND) && IS_APPEND(inode))
  182. return -EPERM;
  183. /* O_NOATIME can only be set by the owner or superuser */
  184. if ((arg & O_NOATIME) && !(filp->f_flags & O_NOATIME))
  185. if (current->fsuid != inode->i_uid && !capable(CAP_FOWNER))
  186. return -EPERM;
  187. /* required for strict SunOS emulation */
  188. if (O_NONBLOCK != O_NDELAY)
  189. if (arg & O_NDELAY)
  190. arg |= O_NONBLOCK;
  191. if (arg & O_DIRECT) {
  192. if (!filp->f_mapping || !filp->f_mapping->a_ops ||
  193. !filp->f_mapping->a_ops->direct_IO)
  194. return -EINVAL;
  195. }
  196. if (filp->f_op && filp->f_op->check_flags)
  197. error = filp->f_op->check_flags(arg);
  198. if (error)
  199. return error;
  200. lock_kernel();
  201. if ((arg ^ filp->f_flags) & FASYNC) {
  202. if (filp->f_op && filp->f_op->fasync) {
  203. error = filp->f_op->fasync(fd, filp, (arg & FASYNC) != 0);
  204. if (error < 0)
  205. goto out;
  206. }
  207. }
  208. filp->f_flags = (arg & SETFL_MASK) | (filp->f_flags & ~SETFL_MASK);
  209. out:
  210. unlock_kernel();
  211. return error;
  212. }
  213. static void f_modown(struct file *filp, unsigned long pid,
  214. uid_t uid, uid_t euid, int force)
  215. {
  216. write_lock_irq(&filp->f_owner.lock);
  217. if (force || !filp->f_owner.pid) {
  218. filp->f_owner.pid = pid;
  219. filp->f_owner.uid = uid;
  220. filp->f_owner.euid = euid;
  221. }
  222. write_unlock_irq(&filp->f_owner.lock);
  223. }
  224. int f_setown(struct file *filp, unsigned long arg, int force)
  225. {
  226. int err;
  227. err = security_file_set_fowner(filp);
  228. if (err)
  229. return err;
  230. f_modown(filp, arg, current->uid, current->euid, force);
  231. return 0;
  232. }
  233. EXPORT_SYMBOL(f_setown);
  234. void f_delown(struct file *filp)
  235. {
  236. f_modown(filp, 0, 0, 0, 1);
  237. }
  238. static long do_fcntl(int fd, unsigned int cmd, unsigned long arg,
  239. struct file *filp)
  240. {
  241. long err = -EINVAL;
  242. switch (cmd) {
  243. case F_DUPFD:
  244. get_file(filp);
  245. err = dupfd(filp, arg);
  246. break;
  247. case F_GETFD:
  248. err = get_close_on_exec(fd) ? FD_CLOEXEC : 0;
  249. break;
  250. case F_SETFD:
  251. err = 0;
  252. set_close_on_exec(fd, arg & FD_CLOEXEC);
  253. break;
  254. case F_GETFL:
  255. err = filp->f_flags;
  256. break;
  257. case F_SETFL:
  258. err = setfl(fd, filp, arg);
  259. break;
  260. case F_GETLK:
  261. err = fcntl_getlk(filp, (struct flock __user *) arg);
  262. break;
  263. case F_SETLK:
  264. case F_SETLKW:
  265. err = fcntl_setlk(fd, filp, cmd, (struct flock __user *) arg);
  266. break;
  267. case F_GETOWN:
  268. /*
  269. * XXX If f_owner is a process group, the
  270. * negative return value will get converted
  271. * into an error. Oops. If we keep the
  272. * current syscall conventions, the only way
  273. * to fix this will be in libc.
  274. */
  275. err = filp->f_owner.pid;
  276. force_successful_syscall_return();
  277. break;
  278. case F_SETOWN:
  279. err = f_setown(filp, arg, 1);
  280. break;
  281. case F_GETSIG:
  282. err = filp->f_owner.signum;
  283. break;
  284. case F_SETSIG:
  285. /* arg == 0 restores default behaviour. */
  286. if (!valid_signal(arg)) {
  287. break;
  288. }
  289. err = 0;
  290. filp->f_owner.signum = arg;
  291. break;
  292. case F_GETLEASE:
  293. err = fcntl_getlease(filp);
  294. break;
  295. case F_SETLEASE:
  296. err = fcntl_setlease(fd, filp, arg);
  297. break;
  298. case F_NOTIFY:
  299. err = fcntl_dirnotify(fd, filp, arg);
  300. break;
  301. default:
  302. break;
  303. }
  304. return err;
  305. }
  306. asmlinkage long sys_fcntl(unsigned int fd, unsigned int cmd, unsigned long arg)
  307. {
  308. struct file *filp;
  309. long err = -EBADF;
  310. filp = fget(fd);
  311. if (!filp)
  312. goto out;
  313. err = security_file_fcntl(filp, cmd, arg);
  314. if (err) {
  315. fput(filp);
  316. return err;
  317. }
  318. err = do_fcntl(fd, cmd, arg, filp);
  319. fput(filp);
  320. out:
  321. return err;
  322. }
  323. #if BITS_PER_LONG == 32
  324. asmlinkage long sys_fcntl64(unsigned int fd, unsigned int cmd, unsigned long arg)
  325. {
  326. struct file * filp;
  327. long err;
  328. err = -EBADF;
  329. filp = fget(fd);
  330. if (!filp)
  331. goto out;
  332. err = security_file_fcntl(filp, cmd, arg);
  333. if (err) {
  334. fput(filp);
  335. return err;
  336. }
  337. err = -EBADF;
  338. switch (cmd) {
  339. case F_GETLK64:
  340. err = fcntl_getlk64(filp, (struct flock64 __user *) arg);
  341. break;
  342. case F_SETLK64:
  343. case F_SETLKW64:
  344. err = fcntl_setlk64(fd, filp, cmd,
  345. (struct flock64 __user *) arg);
  346. break;
  347. default:
  348. err = do_fcntl(fd, cmd, arg, filp);
  349. break;
  350. }
  351. fput(filp);
  352. out:
  353. return err;
  354. }
  355. #endif
  356. /* Table to convert sigio signal codes into poll band bitmaps */
  357. static long band_table[NSIGPOLL] = {
  358. POLLIN | POLLRDNORM, /* POLL_IN */
  359. POLLOUT | POLLWRNORM | POLLWRBAND, /* POLL_OUT */
  360. POLLIN | POLLRDNORM | POLLMSG, /* POLL_MSG */
  361. POLLERR, /* POLL_ERR */
  362. POLLPRI | POLLRDBAND, /* POLL_PRI */
  363. POLLHUP | POLLERR /* POLL_HUP */
  364. };
  365. static inline int sigio_perm(struct task_struct *p,
  366. struct fown_struct *fown, int sig)
  367. {
  368. return (((fown->euid == 0) ||
  369. (fown->euid == p->suid) || (fown->euid == p->uid) ||
  370. (fown->uid == p->suid) || (fown->uid == p->uid)) &&
  371. !security_file_send_sigiotask(p, fown, sig));
  372. }
  373. static void send_sigio_to_task(struct task_struct *p,
  374. struct fown_struct *fown,
  375. int fd,
  376. int reason)
  377. {
  378. if (!sigio_perm(p, fown, fown->signum))
  379. return;
  380. switch (fown->signum) {
  381. siginfo_t si;
  382. default:
  383. /* Queue a rt signal with the appropriate fd as its
  384. value. We use SI_SIGIO as the source, not
  385. SI_KERNEL, since kernel signals always get
  386. delivered even if we can't queue. Failure to
  387. queue in this case _should_ be reported; we fall
  388. back to SIGIO in that case. --sct */
  389. si.si_signo = fown->signum;
  390. si.si_errno = 0;
  391. si.si_code = reason;
  392. /* Make sure we are called with one of the POLL_*
  393. reasons, otherwise we could leak kernel stack into
  394. userspace. */
  395. if ((reason & __SI_MASK) != __SI_POLL)
  396. BUG();
  397. if (reason - POLL_IN >= NSIGPOLL)
  398. si.si_band = ~0L;
  399. else
  400. si.si_band = band_table[reason - POLL_IN];
  401. si.si_fd = fd;
  402. if (!group_send_sig_info(fown->signum, &si, p))
  403. break;
  404. /* fall-through: fall back on the old plain SIGIO signal */
  405. case 0:
  406. group_send_sig_info(SIGIO, SEND_SIG_PRIV, p);
  407. }
  408. }
  409. void send_sigio(struct fown_struct *fown, int fd, int band)
  410. {
  411. struct task_struct *p;
  412. int pid;
  413. read_lock(&fown->lock);
  414. pid = fown->pid;
  415. if (!pid)
  416. goto out_unlock_fown;
  417. read_lock(&tasklist_lock);
  418. if (pid > 0) {
  419. p = find_task_by_pid(pid);
  420. if (p) {
  421. send_sigio_to_task(p, fown, fd, band);
  422. }
  423. } else {
  424. do_each_task_pid(-pid, PIDTYPE_PGID, p) {
  425. send_sigio_to_task(p, fown, fd, band);
  426. } while_each_task_pid(-pid, PIDTYPE_PGID, p);
  427. }
  428. read_unlock(&tasklist_lock);
  429. out_unlock_fown:
  430. read_unlock(&fown->lock);
  431. }
  432. static void send_sigurg_to_task(struct task_struct *p,
  433. struct fown_struct *fown)
  434. {
  435. if (sigio_perm(p, fown, SIGURG))
  436. group_send_sig_info(SIGURG, SEND_SIG_PRIV, p);
  437. }
  438. int send_sigurg(struct fown_struct *fown)
  439. {
  440. struct task_struct *p;
  441. int pid, ret = 0;
  442. read_lock(&fown->lock);
  443. pid = fown->pid;
  444. if (!pid)
  445. goto out_unlock_fown;
  446. ret = 1;
  447. read_lock(&tasklist_lock);
  448. if (pid > 0) {
  449. p = find_task_by_pid(pid);
  450. if (p) {
  451. send_sigurg_to_task(p, fown);
  452. }
  453. } else {
  454. do_each_task_pid(-pid, PIDTYPE_PGID, p) {
  455. send_sigurg_to_task(p, fown);
  456. } while_each_task_pid(-pid, PIDTYPE_PGID, p);
  457. }
  458. read_unlock(&tasklist_lock);
  459. out_unlock_fown:
  460. read_unlock(&fown->lock);
  461. return ret;
  462. }
  463. static DEFINE_RWLOCK(fasync_lock);
  464. static kmem_cache_t *fasync_cache;
  465. /*
  466. * fasync_helper() is used by some character device drivers (mainly mice)
  467. * to set up the fasync queue. It returns negative on error, 0 if it did
  468. * no changes and positive if it added/deleted the entry.
  469. */
  470. int fasync_helper(int fd, struct file * filp, int on, struct fasync_struct **fapp)
  471. {
  472. struct fasync_struct *fa, **fp;
  473. struct fasync_struct *new = NULL;
  474. int result = 0;
  475. if (on) {
  476. new = kmem_cache_alloc(fasync_cache, SLAB_KERNEL);
  477. if (!new)
  478. return -ENOMEM;
  479. }
  480. write_lock_irq(&fasync_lock);
  481. for (fp = fapp; (fa = *fp) != NULL; fp = &fa->fa_next) {
  482. if (fa->fa_file == filp) {
  483. if(on) {
  484. fa->fa_fd = fd;
  485. kmem_cache_free(fasync_cache, new);
  486. } else {
  487. *fp = fa->fa_next;
  488. kmem_cache_free(fasync_cache, fa);
  489. result = 1;
  490. }
  491. goto out;
  492. }
  493. }
  494. if (on) {
  495. new->magic = FASYNC_MAGIC;
  496. new->fa_file = filp;
  497. new->fa_fd = fd;
  498. new->fa_next = *fapp;
  499. *fapp = new;
  500. result = 1;
  501. }
  502. out:
  503. write_unlock_irq(&fasync_lock);
  504. return result;
  505. }
  506. EXPORT_SYMBOL(fasync_helper);
  507. void __kill_fasync(struct fasync_struct *fa, int sig, int band)
  508. {
  509. while (fa) {
  510. struct fown_struct * fown;
  511. if (fa->magic != FASYNC_MAGIC) {
  512. printk(KERN_ERR "kill_fasync: bad magic number in "
  513. "fasync_struct!\n");
  514. return;
  515. }
  516. fown = &fa->fa_file->f_owner;
  517. /* Don't send SIGURG to processes which have not set a
  518. queued signum: SIGURG has its own default signalling
  519. mechanism. */
  520. if (!(sig == SIGURG && fown->signum == 0))
  521. send_sigio(fown, fa->fa_fd, band);
  522. fa = fa->fa_next;
  523. }
  524. }
  525. EXPORT_SYMBOL(__kill_fasync);
  526. void kill_fasync(struct fasync_struct **fp, int sig, int band)
  527. {
  528. /* First a quick test without locking: usually
  529. * the list is empty.
  530. */
  531. if (*fp) {
  532. read_lock(&fasync_lock);
  533. /* reread *fp after obtaining the lock */
  534. __kill_fasync(*fp, sig, band);
  535. read_unlock(&fasync_lock);
  536. }
  537. }
  538. EXPORT_SYMBOL(kill_fasync);
  539. static int __init fasync_init(void)
  540. {
  541. fasync_cache = kmem_cache_create("fasync_cache",
  542. sizeof(struct fasync_struct), 0, SLAB_PANIC, NULL, NULL);
  543. return 0;
  544. }
  545. module_init(fasync_init)