ioctl.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621
  1. /*
  2. * linux/fs/ioctl.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/syscalls.h>
  7. #include <linux/mm.h>
  8. #include <linux/capability.h>
  9. #include <linux/file.h>
  10. #include <linux/fs.h>
  11. #include <linux/security.h>
  12. #include <linux/module.h>
  13. #include <linux/uaccess.h>
  14. #include <linux/writeback.h>
  15. #include <linux/buffer_head.h>
  16. #include <linux/falloc.h>
  17. #include <asm/ioctls.h>
  18. /* So that the fiemap access checks can't overflow on 32 bit machines. */
  19. #define FIEMAP_MAX_EXTENTS (UINT_MAX / sizeof(struct fiemap_extent))
  20. /**
  21. * vfs_ioctl - call filesystem specific ioctl methods
  22. * @filp: open file to invoke ioctl method on
  23. * @cmd: ioctl command to execute
  24. * @arg: command-specific argument for ioctl
  25. *
  26. * Invokes filesystem specific ->unlocked_ioctl, if one exists; otherwise
  27. * returns -ENOTTY.
  28. *
  29. * Returns 0 on success, -errno on error.
  30. */
  31. static long vfs_ioctl(struct file *filp, unsigned int cmd,
  32. unsigned long arg)
  33. {
  34. int error = -ENOTTY;
  35. if (!filp->f_op || !filp->f_op->unlocked_ioctl)
  36. goto out;
  37. error = filp->f_op->unlocked_ioctl(filp, cmd, arg);
  38. if (error == -ENOIOCTLCMD)
  39. error = -EINVAL;
  40. out:
  41. return error;
  42. }
  43. static int ioctl_fibmap(struct file *filp, int __user *p)
  44. {
  45. struct address_space *mapping = filp->f_mapping;
  46. int res, block;
  47. /* do we support this mess? */
  48. if (!mapping->a_ops->bmap)
  49. return -EINVAL;
  50. if (!capable(CAP_SYS_RAWIO))
  51. return -EPERM;
  52. res = get_user(block, p);
  53. if (res)
  54. return res;
  55. res = mapping->a_ops->bmap(mapping, block);
  56. return put_user(res, p);
  57. }
  58. /**
  59. * fiemap_fill_next_extent - Fiemap helper function
  60. * @fieinfo: Fiemap context passed into ->fiemap
  61. * @logical: Extent logical start offset, in bytes
  62. * @phys: Extent physical start offset, in bytes
  63. * @len: Extent length, in bytes
  64. * @flags: FIEMAP_EXTENT flags that describe this extent
  65. *
  66. * Called from file system ->fiemap callback. Will populate extent
  67. * info as passed in via arguments and copy to user memory. On
  68. * success, extent count on fieinfo is incremented.
  69. *
  70. * Returns 0 on success, -errno on error, 1 if this was the last
  71. * extent that will fit in user array.
  72. */
  73. #define SET_UNKNOWN_FLAGS (FIEMAP_EXTENT_DELALLOC)
  74. #define SET_NO_UNMOUNTED_IO_FLAGS (FIEMAP_EXTENT_DATA_ENCRYPTED)
  75. #define SET_NOT_ALIGNED_FLAGS (FIEMAP_EXTENT_DATA_TAIL|FIEMAP_EXTENT_DATA_INLINE)
  76. int fiemap_fill_next_extent(struct fiemap_extent_info *fieinfo, u64 logical,
  77. u64 phys, u64 len, u32 flags)
  78. {
  79. struct fiemap_extent extent;
  80. struct fiemap_extent *dest = fieinfo->fi_extents_start;
  81. /* only count the extents */
  82. if (fieinfo->fi_extents_max == 0) {
  83. fieinfo->fi_extents_mapped++;
  84. return (flags & FIEMAP_EXTENT_LAST) ? 1 : 0;
  85. }
  86. if (fieinfo->fi_extents_mapped >= fieinfo->fi_extents_max)
  87. return 1;
  88. if (flags & SET_UNKNOWN_FLAGS)
  89. flags |= FIEMAP_EXTENT_UNKNOWN;
  90. if (flags & SET_NO_UNMOUNTED_IO_FLAGS)
  91. flags |= FIEMAP_EXTENT_ENCODED;
  92. if (flags & SET_NOT_ALIGNED_FLAGS)
  93. flags |= FIEMAP_EXTENT_NOT_ALIGNED;
  94. memset(&extent, 0, sizeof(extent));
  95. extent.fe_logical = logical;
  96. extent.fe_physical = phys;
  97. extent.fe_length = len;
  98. extent.fe_flags = flags;
  99. dest += fieinfo->fi_extents_mapped;
  100. if (copy_to_user(dest, &extent, sizeof(extent)))
  101. return -EFAULT;
  102. fieinfo->fi_extents_mapped++;
  103. if (fieinfo->fi_extents_mapped == fieinfo->fi_extents_max)
  104. return 1;
  105. return (flags & FIEMAP_EXTENT_LAST) ? 1 : 0;
  106. }
  107. EXPORT_SYMBOL(fiemap_fill_next_extent);
  108. /**
  109. * fiemap_check_flags - check validity of requested flags for fiemap
  110. * @fieinfo: Fiemap context passed into ->fiemap
  111. * @fs_flags: Set of fiemap flags that the file system understands
  112. *
  113. * Called from file system ->fiemap callback. This will compute the
  114. * intersection of valid fiemap flags and those that the fs supports. That
  115. * value is then compared against the user supplied flags. In case of bad user
  116. * flags, the invalid values will be written into the fieinfo structure, and
  117. * -EBADR is returned, which tells ioctl_fiemap() to return those values to
  118. * userspace. For this reason, a return code of -EBADR should be preserved.
  119. *
  120. * Returns 0 on success, -EBADR on bad flags.
  121. */
  122. int fiemap_check_flags(struct fiemap_extent_info *fieinfo, u32 fs_flags)
  123. {
  124. u32 incompat_flags;
  125. incompat_flags = fieinfo->fi_flags & ~(FIEMAP_FLAGS_COMPAT & fs_flags);
  126. if (incompat_flags) {
  127. fieinfo->fi_flags = incompat_flags;
  128. return -EBADR;
  129. }
  130. return 0;
  131. }
  132. EXPORT_SYMBOL(fiemap_check_flags);
  133. static int fiemap_check_ranges(struct super_block *sb,
  134. u64 start, u64 len, u64 *new_len)
  135. {
  136. u64 maxbytes = (u64) sb->s_maxbytes;
  137. *new_len = len;
  138. if (len == 0)
  139. return -EINVAL;
  140. if (start > maxbytes)
  141. return -EFBIG;
  142. /*
  143. * Shrink request scope to what the fs can actually handle.
  144. */
  145. if (len > maxbytes || (maxbytes - len) < start)
  146. *new_len = maxbytes - start;
  147. return 0;
  148. }
  149. static int ioctl_fiemap(struct file *filp, unsigned long arg)
  150. {
  151. struct fiemap fiemap;
  152. struct fiemap_extent_info fieinfo = { 0, };
  153. struct inode *inode = filp->f_path.dentry->d_inode;
  154. struct super_block *sb = inode->i_sb;
  155. u64 len;
  156. int error;
  157. if (!inode->i_op->fiemap)
  158. return -EOPNOTSUPP;
  159. if (copy_from_user(&fiemap, (struct fiemap __user *)arg,
  160. sizeof(struct fiemap)))
  161. return -EFAULT;
  162. if (fiemap.fm_extent_count > FIEMAP_MAX_EXTENTS)
  163. return -EINVAL;
  164. error = fiemap_check_ranges(sb, fiemap.fm_start, fiemap.fm_length,
  165. &len);
  166. if (error)
  167. return error;
  168. fieinfo.fi_flags = fiemap.fm_flags;
  169. fieinfo.fi_extents_max = fiemap.fm_extent_count;
  170. fieinfo.fi_extents_start = (struct fiemap_extent *)(arg + sizeof(fiemap));
  171. if (fiemap.fm_extent_count != 0 &&
  172. !access_ok(VERIFY_WRITE, fieinfo.fi_extents_start,
  173. fieinfo.fi_extents_max * sizeof(struct fiemap_extent)))
  174. return -EFAULT;
  175. if (fieinfo.fi_flags & FIEMAP_FLAG_SYNC)
  176. filemap_write_and_wait(inode->i_mapping);
  177. error = inode->i_op->fiemap(inode, &fieinfo, fiemap.fm_start, len);
  178. fiemap.fm_flags = fieinfo.fi_flags;
  179. fiemap.fm_mapped_extents = fieinfo.fi_extents_mapped;
  180. if (copy_to_user((char *)arg, &fiemap, sizeof(fiemap)))
  181. error = -EFAULT;
  182. return error;
  183. }
  184. #ifdef CONFIG_BLOCK
  185. static inline sector_t logical_to_blk(struct inode *inode, loff_t offset)
  186. {
  187. return (offset >> inode->i_blkbits);
  188. }
  189. static inline loff_t blk_to_logical(struct inode *inode, sector_t blk)
  190. {
  191. return (blk << inode->i_blkbits);
  192. }
  193. /**
  194. * __generic_block_fiemap - FIEMAP for block based inodes (no locking)
  195. * @inode: the inode to map
  196. * @fieinfo: the fiemap info struct that will be passed back to userspace
  197. * @start: where to start mapping in the inode
  198. * @len: how much space to map
  199. * @get_block: the fs's get_block function
  200. *
  201. * This does FIEMAP for block based inodes. Basically it will just loop
  202. * through get_block until we hit the number of extents we want to map, or we
  203. * go past the end of the file and hit a hole.
  204. *
  205. * If it is possible to have data blocks beyond a hole past @inode->i_size, then
  206. * please do not use this function, it will stop at the first unmapped block
  207. * beyond i_size.
  208. *
  209. * If you use this function directly, you need to do your own locking. Use
  210. * generic_block_fiemap if you want the locking done for you.
  211. */
  212. int __generic_block_fiemap(struct inode *inode,
  213. struct fiemap_extent_info *fieinfo, loff_t start,
  214. loff_t len, get_block_t *get_block)
  215. {
  216. struct buffer_head map_bh;
  217. sector_t start_blk, last_blk;
  218. loff_t isize = i_size_read(inode);
  219. u64 logical = 0, phys = 0, size = 0;
  220. u32 flags = FIEMAP_EXTENT_MERGED;
  221. bool past_eof = false, whole_file = false;
  222. int ret = 0;
  223. ret = fiemap_check_flags(fieinfo, FIEMAP_FLAG_SYNC);
  224. if (ret)
  225. return ret;
  226. /*
  227. * Either the i_mutex or other appropriate locking needs to be held
  228. * since we expect isize to not change at all through the duration of
  229. * this call.
  230. */
  231. if (len >= isize) {
  232. whole_file = true;
  233. len = isize;
  234. }
  235. start_blk = logical_to_blk(inode, start);
  236. last_blk = logical_to_blk(inode, start + len - 1);
  237. do {
  238. /*
  239. * we set b_size to the total size we want so it will map as
  240. * many contiguous blocks as possible at once
  241. */
  242. memset(&map_bh, 0, sizeof(struct buffer_head));
  243. map_bh.b_size = len;
  244. ret = get_block(inode, start_blk, &map_bh, 0);
  245. if (ret)
  246. break;
  247. /* HOLE */
  248. if (!buffer_mapped(&map_bh)) {
  249. start_blk++;
  250. /*
  251. * We want to handle the case where there is an
  252. * allocated block at the front of the file, and then
  253. * nothing but holes up to the end of the file properly,
  254. * to make sure that extent at the front gets properly
  255. * marked with FIEMAP_EXTENT_LAST
  256. */
  257. if (!past_eof &&
  258. blk_to_logical(inode, start_blk) >= isize)
  259. past_eof = 1;
  260. /*
  261. * First hole after going past the EOF, this is our
  262. * last extent
  263. */
  264. if (past_eof && size) {
  265. flags = FIEMAP_EXTENT_MERGED|FIEMAP_EXTENT_LAST;
  266. ret = fiemap_fill_next_extent(fieinfo, logical,
  267. phys, size,
  268. flags);
  269. } else if (size) {
  270. ret = fiemap_fill_next_extent(fieinfo, logical,
  271. phys, size, flags);
  272. size = 0;
  273. }
  274. /* if we have holes up to/past EOF then we're done */
  275. if (start_blk > last_blk || past_eof || ret)
  276. break;
  277. } else {
  278. /*
  279. * We have gone over the length of what we wanted to
  280. * map, and it wasn't the entire file, so add the extent
  281. * we got last time and exit.
  282. *
  283. * This is for the case where say we want to map all the
  284. * way up to the second to the last block in a file, but
  285. * the last block is a hole, making the second to last
  286. * block FIEMAP_EXTENT_LAST. In this case we want to
  287. * see if there is a hole after the second to last block
  288. * so we can mark it properly. If we found data after
  289. * we exceeded the length we were requesting, then we
  290. * are good to go, just add the extent to the fieinfo
  291. * and break
  292. */
  293. if (start_blk > last_blk && !whole_file) {
  294. ret = fiemap_fill_next_extent(fieinfo, logical,
  295. phys, size,
  296. flags);
  297. break;
  298. }
  299. /*
  300. * if size != 0 then we know we already have an extent
  301. * to add, so add it.
  302. */
  303. if (size) {
  304. ret = fiemap_fill_next_extent(fieinfo, logical,
  305. phys, size,
  306. flags);
  307. if (ret)
  308. break;
  309. }
  310. logical = blk_to_logical(inode, start_blk);
  311. phys = blk_to_logical(inode, map_bh.b_blocknr);
  312. size = map_bh.b_size;
  313. flags = FIEMAP_EXTENT_MERGED;
  314. start_blk += logical_to_blk(inode, size);
  315. /*
  316. * If we are past the EOF, then we need to make sure as
  317. * soon as we find a hole that the last extent we found
  318. * is marked with FIEMAP_EXTENT_LAST
  319. */
  320. if (!past_eof && logical + size >= isize)
  321. past_eof = true;
  322. }
  323. cond_resched();
  324. } while (1);
  325. /* If ret is 1 then we just hit the end of the extent array */
  326. if (ret == 1)
  327. ret = 0;
  328. return ret;
  329. }
  330. EXPORT_SYMBOL(__generic_block_fiemap);
  331. /**
  332. * generic_block_fiemap - FIEMAP for block based inodes
  333. * @inode: The inode to map
  334. * @fieinfo: The mapping information
  335. * @start: The initial block to map
  336. * @len: The length of the extect to attempt to map
  337. * @get_block: The block mapping function for the fs
  338. *
  339. * Calls __generic_block_fiemap to map the inode, after taking
  340. * the inode's mutex lock.
  341. */
  342. int generic_block_fiemap(struct inode *inode,
  343. struct fiemap_extent_info *fieinfo, u64 start,
  344. u64 len, get_block_t *get_block)
  345. {
  346. int ret;
  347. mutex_lock(&inode->i_mutex);
  348. ret = __generic_block_fiemap(inode, fieinfo, start, len, get_block);
  349. mutex_unlock(&inode->i_mutex);
  350. return ret;
  351. }
  352. EXPORT_SYMBOL(generic_block_fiemap);
  353. #endif /* CONFIG_BLOCK */
  354. /*
  355. * This provides compatibility with legacy XFS pre-allocation ioctls
  356. * which predate the fallocate syscall.
  357. *
  358. * Only the l_start, l_len and l_whence fields of the 'struct space_resv'
  359. * are used here, rest are ignored.
  360. */
  361. int ioctl_preallocate(struct file *filp, void __user *argp)
  362. {
  363. struct inode *inode = filp->f_path.dentry->d_inode;
  364. struct space_resv sr;
  365. if (copy_from_user(&sr, argp, sizeof(sr)))
  366. return -EFAULT;
  367. switch (sr.l_whence) {
  368. case SEEK_SET:
  369. break;
  370. case SEEK_CUR:
  371. sr.l_start += filp->f_pos;
  372. break;
  373. case SEEK_END:
  374. sr.l_start += i_size_read(inode);
  375. break;
  376. default:
  377. return -EINVAL;
  378. }
  379. return do_fallocate(filp, FALLOC_FL_KEEP_SIZE, sr.l_start, sr.l_len);
  380. }
  381. static int file_ioctl(struct file *filp, unsigned int cmd,
  382. unsigned long arg)
  383. {
  384. struct inode *inode = filp->f_path.dentry->d_inode;
  385. int __user *p = (int __user *)arg;
  386. switch (cmd) {
  387. case FIBMAP:
  388. return ioctl_fibmap(filp, p);
  389. case FIONREAD:
  390. return put_user(i_size_read(inode) - filp->f_pos, p);
  391. case FS_IOC_RESVSP:
  392. case FS_IOC_RESVSP64:
  393. return ioctl_preallocate(filp, p);
  394. }
  395. return vfs_ioctl(filp, cmd, arg);
  396. }
  397. static int ioctl_fionbio(struct file *filp, int __user *argp)
  398. {
  399. unsigned int flag;
  400. int on, error;
  401. error = get_user(on, argp);
  402. if (error)
  403. return error;
  404. flag = O_NONBLOCK;
  405. #ifdef __sparc__
  406. /* SunOS compatibility item. */
  407. if (O_NONBLOCK != O_NDELAY)
  408. flag |= O_NDELAY;
  409. #endif
  410. spin_lock(&filp->f_lock);
  411. if (on)
  412. filp->f_flags |= flag;
  413. else
  414. filp->f_flags &= ~flag;
  415. spin_unlock(&filp->f_lock);
  416. return error;
  417. }
  418. static int ioctl_fioasync(unsigned int fd, struct file *filp,
  419. int __user *argp)
  420. {
  421. unsigned int flag;
  422. int on, error;
  423. error = get_user(on, argp);
  424. if (error)
  425. return error;
  426. flag = on ? FASYNC : 0;
  427. /* Did FASYNC state change ? */
  428. if ((flag ^ filp->f_flags) & FASYNC) {
  429. if (filp->f_op && filp->f_op->fasync)
  430. /* fasync() adjusts filp->f_flags */
  431. error = filp->f_op->fasync(fd, filp, on);
  432. else
  433. error = -ENOTTY;
  434. }
  435. return error < 0 ? error : 0;
  436. }
  437. static int ioctl_fsfreeze(struct file *filp)
  438. {
  439. struct super_block *sb = filp->f_path.dentry->d_inode->i_sb;
  440. if (!capable(CAP_SYS_ADMIN))
  441. return -EPERM;
  442. /* If filesystem doesn't support freeze feature, return. */
  443. if (sb->s_op->freeze_fs == NULL)
  444. return -EOPNOTSUPP;
  445. /* Freeze */
  446. return freeze_super(sb);
  447. }
  448. static int ioctl_fsthaw(struct file *filp)
  449. {
  450. struct super_block *sb = filp->f_path.dentry->d_inode->i_sb;
  451. if (!capable(CAP_SYS_ADMIN))
  452. return -EPERM;
  453. /* Thaw */
  454. return thaw_super(sb);
  455. }
  456. /*
  457. * When you add any new common ioctls to the switches above and below
  458. * please update compat_sys_ioctl() too.
  459. *
  460. * do_vfs_ioctl() is not for drivers and not intended to be EXPORT_SYMBOL()'d.
  461. * It's just a simple helper for sys_ioctl and compat_sys_ioctl.
  462. */
  463. int do_vfs_ioctl(struct file *filp, unsigned int fd, unsigned int cmd,
  464. unsigned long arg)
  465. {
  466. int error = 0;
  467. int __user *argp = (int __user *)arg;
  468. switch (cmd) {
  469. case FIOCLEX:
  470. set_close_on_exec(fd, 1);
  471. break;
  472. case FIONCLEX:
  473. set_close_on_exec(fd, 0);
  474. break;
  475. case FIONBIO:
  476. error = ioctl_fionbio(filp, argp);
  477. break;
  478. case FIOASYNC:
  479. error = ioctl_fioasync(fd, filp, argp);
  480. break;
  481. case FIOQSIZE:
  482. if (S_ISDIR(filp->f_path.dentry->d_inode->i_mode) ||
  483. S_ISREG(filp->f_path.dentry->d_inode->i_mode) ||
  484. S_ISLNK(filp->f_path.dentry->d_inode->i_mode)) {
  485. loff_t res =
  486. inode_get_bytes(filp->f_path.dentry->d_inode);
  487. error = copy_to_user((loff_t __user *)arg, &res,
  488. sizeof(res)) ? -EFAULT : 0;
  489. } else
  490. error = -ENOTTY;
  491. break;
  492. case FIFREEZE:
  493. error = ioctl_fsfreeze(filp);
  494. break;
  495. case FITHAW:
  496. error = ioctl_fsthaw(filp);
  497. break;
  498. case FS_IOC_FIEMAP:
  499. return ioctl_fiemap(filp, arg);
  500. case FIGETBSZ:
  501. {
  502. struct inode *inode = filp->f_path.dentry->d_inode;
  503. int __user *p = (int __user *)arg;
  504. return put_user(inode->i_sb->s_blocksize, p);
  505. }
  506. default:
  507. if (S_ISREG(filp->f_path.dentry->d_inode->i_mode))
  508. error = file_ioctl(filp, cmd, arg);
  509. else
  510. error = vfs_ioctl(filp, cmd, arg);
  511. break;
  512. }
  513. return error;
  514. }
  515. SYSCALL_DEFINE3(ioctl, unsigned int, fd, unsigned int, cmd, unsigned long, arg)
  516. {
  517. struct file *filp;
  518. int error = -EBADF;
  519. int fput_needed;
  520. filp = fget_light(fd, &fput_needed);
  521. if (!filp)
  522. goto out;
  523. error = security_file_ioctl(filp, cmd, arg);
  524. if (error)
  525. goto out_fput;
  526. error = do_vfs_ioctl(filp, fd, cmd, arg);
  527. out_fput:
  528. fput_light(filp, fput_needed);
  529. out:
  530. return error;
  531. }