Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
9 | * This program is distributed in the hope that it would be useful, |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
1da177e4 | 13 | * |
7b718769 NS |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write the Free Software Foundation, | |
16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
dda35b8f | 19 | #include "xfs_fs.h" |
1da177e4 LT |
20 | #include "xfs_log.h" |
21 | #include "xfs_sb.h" | |
a844f451 | 22 | #include "xfs_ag.h" |
1da177e4 | 23 | #include "xfs_trans.h" |
1da177e4 LT |
24 | #include "xfs_mount.h" |
25 | #include "xfs_bmap_btree.h" | |
1da177e4 | 26 | #include "xfs_alloc.h" |
1da177e4 LT |
27 | #include "xfs_dinode.h" |
28 | #include "xfs_inode.h" | |
fd3200be | 29 | #include "xfs_inode_item.h" |
dda35b8f | 30 | #include "xfs_bmap.h" |
1da177e4 | 31 | #include "xfs_error.h" |
739bfb2a | 32 | #include "xfs_vnodeops.h" |
f999a5bf | 33 | #include "xfs_da_btree.h" |
ddcd856d | 34 | #include "xfs_ioctl.h" |
dda35b8f | 35 | #include "xfs_trace.h" |
1da177e4 LT |
36 | |
37 | #include <linux/dcache.h> | |
2fe17c10 | 38 | #include <linux/falloc.h> |
d126d43f | 39 | #include <linux/pagevec.h> |
1da177e4 | 40 | |
f0f37e2f | 41 | static const struct vm_operations_struct xfs_file_vm_ops; |
1da177e4 | 42 | |
487f84f3 DC |
43 | /* |
44 | * Locking primitives for read and write IO paths to ensure we consistently use | |
45 | * and order the inode->i_mutex, ip->i_lock and ip->i_iolock. | |
46 | */ | |
47 | static inline void | |
48 | xfs_rw_ilock( | |
49 | struct xfs_inode *ip, | |
50 | int type) | |
51 | { | |
52 | if (type & XFS_IOLOCK_EXCL) | |
53 | mutex_lock(&VFS_I(ip)->i_mutex); | |
54 | xfs_ilock(ip, type); | |
55 | } | |
56 | ||
57 | static inline void | |
58 | xfs_rw_iunlock( | |
59 | struct xfs_inode *ip, | |
60 | int type) | |
61 | { | |
62 | xfs_iunlock(ip, type); | |
63 | if (type & XFS_IOLOCK_EXCL) | |
64 | mutex_unlock(&VFS_I(ip)->i_mutex); | |
65 | } | |
66 | ||
67 | static inline void | |
68 | xfs_rw_ilock_demote( | |
69 | struct xfs_inode *ip, | |
70 | int type) | |
71 | { | |
72 | xfs_ilock_demote(ip, type); | |
73 | if (type & XFS_IOLOCK_EXCL) | |
74 | mutex_unlock(&VFS_I(ip)->i_mutex); | |
75 | } | |
76 | ||
dda35b8f CH |
77 | /* |
78 | * xfs_iozero | |
79 | * | |
80 | * xfs_iozero clears the specified range of buffer supplied, | |
81 | * and marks all the affected blocks as valid and modified. If | |
82 | * an affected block is not allocated, it will be allocated. If | |
83 | * an affected block is not completely overwritten, and is not | |
84 | * valid before the operation, it will be read from disk before | |
85 | * being partially zeroed. | |
86 | */ | |
87 | STATIC int | |
88 | xfs_iozero( | |
89 | struct xfs_inode *ip, /* inode */ | |
90 | loff_t pos, /* offset in file */ | |
91 | size_t count) /* size of data to zero */ | |
92 | { | |
93 | struct page *page; | |
94 | struct address_space *mapping; | |
95 | int status; | |
96 | ||
97 | mapping = VFS_I(ip)->i_mapping; | |
98 | do { | |
99 | unsigned offset, bytes; | |
100 | void *fsdata; | |
101 | ||
102 | offset = (pos & (PAGE_CACHE_SIZE -1)); /* Within page */ | |
103 | bytes = PAGE_CACHE_SIZE - offset; | |
104 | if (bytes > count) | |
105 | bytes = count; | |
106 | ||
107 | status = pagecache_write_begin(NULL, mapping, pos, bytes, | |
108 | AOP_FLAG_UNINTERRUPTIBLE, | |
109 | &page, &fsdata); | |
110 | if (status) | |
111 | break; | |
112 | ||
113 | zero_user(page, offset, bytes); | |
114 | ||
115 | status = pagecache_write_end(NULL, mapping, pos, bytes, bytes, | |
116 | page, fsdata); | |
117 | WARN_ON(status <= 0); /* can't return less than zero! */ | |
118 | pos += bytes; | |
119 | count -= bytes; | |
120 | status = 0; | |
121 | } while (count); | |
122 | ||
123 | return (-status); | |
124 | } | |
125 | ||
1da2f2db CH |
126 | /* |
127 | * Fsync operations on directories are much simpler than on regular files, | |
128 | * as there is no file data to flush, and thus also no need for explicit | |
129 | * cache flush operations, and there are no non-transaction metadata updates | |
130 | * on directories either. | |
131 | */ | |
132 | STATIC int | |
133 | xfs_dir_fsync( | |
134 | struct file *file, | |
135 | loff_t start, | |
136 | loff_t end, | |
137 | int datasync) | |
138 | { | |
139 | struct xfs_inode *ip = XFS_I(file->f_mapping->host); | |
140 | struct xfs_mount *mp = ip->i_mount; | |
141 | xfs_lsn_t lsn = 0; | |
142 | ||
143 | trace_xfs_dir_fsync(ip); | |
144 | ||
145 | xfs_ilock(ip, XFS_ILOCK_SHARED); | |
146 | if (xfs_ipincount(ip)) | |
147 | lsn = ip->i_itemp->ili_last_lsn; | |
148 | xfs_iunlock(ip, XFS_ILOCK_SHARED); | |
149 | ||
150 | if (!lsn) | |
151 | return 0; | |
152 | return _xfs_log_force_lsn(mp, lsn, XFS_LOG_SYNC, NULL); | |
153 | } | |
154 | ||
fd3200be CH |
155 | STATIC int |
156 | xfs_file_fsync( | |
157 | struct file *file, | |
02c24a82 JB |
158 | loff_t start, |
159 | loff_t end, | |
fd3200be CH |
160 | int datasync) |
161 | { | |
7ea80859 CH |
162 | struct inode *inode = file->f_mapping->host; |
163 | struct xfs_inode *ip = XFS_I(inode); | |
a27a263b | 164 | struct xfs_mount *mp = ip->i_mount; |
fd3200be CH |
165 | int error = 0; |
166 | int log_flushed = 0; | |
b1037058 | 167 | xfs_lsn_t lsn = 0; |
fd3200be | 168 | |
cca28fb8 | 169 | trace_xfs_file_fsync(ip); |
fd3200be | 170 | |
02c24a82 JB |
171 | error = filemap_write_and_wait_range(inode->i_mapping, start, end); |
172 | if (error) | |
173 | return error; | |
174 | ||
a27a263b | 175 | if (XFS_FORCED_SHUTDOWN(mp)) |
fd3200be CH |
176 | return -XFS_ERROR(EIO); |
177 | ||
178 | xfs_iflags_clear(ip, XFS_ITRUNCATED); | |
179 | ||
a27a263b CH |
180 | if (mp->m_flags & XFS_MOUNT_BARRIER) { |
181 | /* | |
182 | * If we have an RT and/or log subvolume we need to make sure | |
183 | * to flush the write cache the device used for file data | |
184 | * first. This is to ensure newly written file data make | |
185 | * it to disk before logging the new inode size in case of | |
186 | * an extending write. | |
187 | */ | |
188 | if (XFS_IS_REALTIME_INODE(ip)) | |
189 | xfs_blkdev_issue_flush(mp->m_rtdev_targp); | |
190 | else if (mp->m_logdev_targp != mp->m_ddev_targp) | |
191 | xfs_blkdev_issue_flush(mp->m_ddev_targp); | |
192 | } | |
193 | ||
fd3200be | 194 | /* |
8a9c9980 CH |
195 | * All metadata updates are logged, which means that we just have |
196 | * to flush the log up to the latest LSN that touched the inode. | |
fd3200be CH |
197 | */ |
198 | xfs_ilock(ip, XFS_ILOCK_SHARED); | |
8f639dde CH |
199 | if (xfs_ipincount(ip)) { |
200 | if (!datasync || | |
201 | (ip->i_itemp->ili_fields & ~XFS_ILOG_TIMESTAMP)) | |
202 | lsn = ip->i_itemp->ili_last_lsn; | |
203 | } | |
8a9c9980 | 204 | xfs_iunlock(ip, XFS_ILOCK_SHARED); |
fd3200be | 205 | |
8a9c9980 | 206 | if (lsn) |
b1037058 CH |
207 | error = _xfs_log_force_lsn(mp, lsn, XFS_LOG_SYNC, &log_flushed); |
208 | ||
a27a263b CH |
209 | /* |
210 | * If we only have a single device, and the log force about was | |
211 | * a no-op we might have to flush the data device cache here. | |
212 | * This can only happen for fdatasync/O_DSYNC if we were overwriting | |
213 | * an already allocated file and thus do not have any metadata to | |
214 | * commit. | |
215 | */ | |
216 | if ((mp->m_flags & XFS_MOUNT_BARRIER) && | |
217 | mp->m_logdev_targp == mp->m_ddev_targp && | |
218 | !XFS_IS_REALTIME_INODE(ip) && | |
219 | !log_flushed) | |
220 | xfs_blkdev_issue_flush(mp->m_ddev_targp); | |
fd3200be CH |
221 | |
222 | return -error; | |
223 | } | |
224 | ||
00258e36 CH |
225 | STATIC ssize_t |
226 | xfs_file_aio_read( | |
dda35b8f CH |
227 | struct kiocb *iocb, |
228 | const struct iovec *iovp, | |
00258e36 CH |
229 | unsigned long nr_segs, |
230 | loff_t pos) | |
dda35b8f CH |
231 | { |
232 | struct file *file = iocb->ki_filp; | |
233 | struct inode *inode = file->f_mapping->host; | |
00258e36 CH |
234 | struct xfs_inode *ip = XFS_I(inode); |
235 | struct xfs_mount *mp = ip->i_mount; | |
dda35b8f CH |
236 | size_t size = 0; |
237 | ssize_t ret = 0; | |
00258e36 | 238 | int ioflags = 0; |
dda35b8f | 239 | xfs_fsize_t n; |
dda35b8f | 240 | |
dda35b8f CH |
241 | XFS_STATS_INC(xs_read_calls); |
242 | ||
00258e36 CH |
243 | BUG_ON(iocb->ki_pos != pos); |
244 | ||
245 | if (unlikely(file->f_flags & O_DIRECT)) | |
246 | ioflags |= IO_ISDIRECT; | |
247 | if (file->f_mode & FMODE_NOCMTIME) | |
248 | ioflags |= IO_INVIS; | |
249 | ||
52764329 DC |
250 | ret = generic_segment_checks(iovp, &nr_segs, &size, VERIFY_WRITE); |
251 | if (ret < 0) | |
252 | return ret; | |
dda35b8f CH |
253 | |
254 | if (unlikely(ioflags & IO_ISDIRECT)) { | |
255 | xfs_buftarg_t *target = | |
256 | XFS_IS_REALTIME_INODE(ip) ? | |
257 | mp->m_rtdev_targp : mp->m_ddev_targp; | |
fb595814 DC |
258 | if ((pos & target->bt_smask) || (size & target->bt_smask)) { |
259 | if (pos == i_size_read(inode)) | |
00258e36 | 260 | return 0; |
dda35b8f CH |
261 | return -XFS_ERROR(EINVAL); |
262 | } | |
263 | } | |
264 | ||
fb595814 | 265 | n = mp->m_super->s_maxbytes - pos; |
00258e36 | 266 | if (n <= 0 || size == 0) |
dda35b8f CH |
267 | return 0; |
268 | ||
269 | if (n < size) | |
270 | size = n; | |
271 | ||
272 | if (XFS_FORCED_SHUTDOWN(mp)) | |
273 | return -EIO; | |
274 | ||
0c38a251 DC |
275 | /* |
276 | * Locking is a bit tricky here. If we take an exclusive lock | |
277 | * for direct IO, we effectively serialise all new concurrent | |
278 | * read IO to this file and block it behind IO that is currently in | |
279 | * progress because IO in progress holds the IO lock shared. We only | |
280 | * need to hold the lock exclusive to blow away the page cache, so | |
281 | * only take lock exclusively if the page cache needs invalidation. | |
282 | * This allows the normal direct IO case of no page cache pages to | |
283 | * proceeed concurrently without serialisation. | |
284 | */ | |
285 | xfs_rw_ilock(ip, XFS_IOLOCK_SHARED); | |
286 | if ((ioflags & IO_ISDIRECT) && inode->i_mapping->nrpages) { | |
287 | xfs_rw_iunlock(ip, XFS_IOLOCK_SHARED); | |
487f84f3 DC |
288 | xfs_rw_ilock(ip, XFS_IOLOCK_EXCL); |
289 | ||
00258e36 | 290 | if (inode->i_mapping->nrpages) { |
fb595814 DC |
291 | ret = -filemap_write_and_wait_range( |
292 | VFS_I(ip)->i_mapping, | |
293 | pos, -1); | |
487f84f3 DC |
294 | if (ret) { |
295 | xfs_rw_iunlock(ip, XFS_IOLOCK_EXCL); | |
296 | return ret; | |
297 | } | |
fb595814 | 298 | truncate_pagecache_range(VFS_I(ip), pos, -1); |
00258e36 | 299 | } |
487f84f3 | 300 | xfs_rw_ilock_demote(ip, XFS_IOLOCK_EXCL); |
0c38a251 | 301 | } |
dda35b8f | 302 | |
fb595814 | 303 | trace_xfs_file_read(ip, size, pos, ioflags); |
dda35b8f | 304 | |
fb595814 | 305 | ret = generic_file_aio_read(iocb, iovp, nr_segs, pos); |
dda35b8f CH |
306 | if (ret > 0) |
307 | XFS_STATS_ADD(xs_read_bytes, ret); | |
308 | ||
487f84f3 | 309 | xfs_rw_iunlock(ip, XFS_IOLOCK_SHARED); |
dda35b8f CH |
310 | return ret; |
311 | } | |
312 | ||
00258e36 CH |
313 | STATIC ssize_t |
314 | xfs_file_splice_read( | |
dda35b8f CH |
315 | struct file *infilp, |
316 | loff_t *ppos, | |
317 | struct pipe_inode_info *pipe, | |
318 | size_t count, | |
00258e36 | 319 | unsigned int flags) |
dda35b8f | 320 | { |
00258e36 | 321 | struct xfs_inode *ip = XFS_I(infilp->f_mapping->host); |
00258e36 | 322 | int ioflags = 0; |
dda35b8f CH |
323 | ssize_t ret; |
324 | ||
325 | XFS_STATS_INC(xs_read_calls); | |
00258e36 CH |
326 | |
327 | if (infilp->f_mode & FMODE_NOCMTIME) | |
328 | ioflags |= IO_INVIS; | |
329 | ||
dda35b8f CH |
330 | if (XFS_FORCED_SHUTDOWN(ip->i_mount)) |
331 | return -EIO; | |
332 | ||
487f84f3 | 333 | xfs_rw_ilock(ip, XFS_IOLOCK_SHARED); |
dda35b8f | 334 | |
dda35b8f CH |
335 | trace_xfs_file_splice_read(ip, count, *ppos, ioflags); |
336 | ||
337 | ret = generic_file_splice_read(infilp, ppos, pipe, count, flags); | |
338 | if (ret > 0) | |
339 | XFS_STATS_ADD(xs_read_bytes, ret); | |
340 | ||
487f84f3 | 341 | xfs_rw_iunlock(ip, XFS_IOLOCK_SHARED); |
dda35b8f CH |
342 | return ret; |
343 | } | |
344 | ||
487f84f3 DC |
345 | /* |
346 | * xfs_file_splice_write() does not use xfs_rw_ilock() because | |
347 | * generic_file_splice_write() takes the i_mutex itself. This, in theory, | |
348 | * couuld cause lock inversions between the aio_write path and the splice path | |
349 | * if someone is doing concurrent splice(2) based writes and write(2) based | |
350 | * writes to the same inode. The only real way to fix this is to re-implement | |
351 | * the generic code here with correct locking orders. | |
352 | */ | |
00258e36 CH |
353 | STATIC ssize_t |
354 | xfs_file_splice_write( | |
dda35b8f CH |
355 | struct pipe_inode_info *pipe, |
356 | struct file *outfilp, | |
357 | loff_t *ppos, | |
358 | size_t count, | |
00258e36 | 359 | unsigned int flags) |
dda35b8f | 360 | { |
dda35b8f | 361 | struct inode *inode = outfilp->f_mapping->host; |
00258e36 | 362 | struct xfs_inode *ip = XFS_I(inode); |
00258e36 CH |
363 | int ioflags = 0; |
364 | ssize_t ret; | |
dda35b8f CH |
365 | |
366 | XFS_STATS_INC(xs_write_calls); | |
00258e36 CH |
367 | |
368 | if (outfilp->f_mode & FMODE_NOCMTIME) | |
369 | ioflags |= IO_INVIS; | |
370 | ||
dda35b8f CH |
371 | if (XFS_FORCED_SHUTDOWN(ip->i_mount)) |
372 | return -EIO; | |
373 | ||
374 | xfs_ilock(ip, XFS_IOLOCK_EXCL); | |
375 | ||
dda35b8f CH |
376 | trace_xfs_file_splice_write(ip, count, *ppos, ioflags); |
377 | ||
378 | ret = generic_file_splice_write(pipe, outfilp, ppos, count, flags); | |
ce7ae151 CH |
379 | if (ret > 0) |
380 | XFS_STATS_ADD(xs_write_bytes, ret); | |
dda35b8f | 381 | |
dda35b8f CH |
382 | xfs_iunlock(ip, XFS_IOLOCK_EXCL); |
383 | return ret; | |
384 | } | |
385 | ||
386 | /* | |
193aec10 CH |
387 | * This routine is called to handle zeroing any space in the last block of the |
388 | * file that is beyond the EOF. We do this since the size is being increased | |
389 | * without writing anything to that block and we don't want to read the | |
390 | * garbage on the disk. | |
dda35b8f CH |
391 | */ |
392 | STATIC int /* error (positive) */ | |
393 | xfs_zero_last_block( | |
193aec10 CH |
394 | struct xfs_inode *ip, |
395 | xfs_fsize_t offset, | |
396 | xfs_fsize_t isize) | |
dda35b8f | 397 | { |
193aec10 CH |
398 | struct xfs_mount *mp = ip->i_mount; |
399 | xfs_fileoff_t last_fsb = XFS_B_TO_FSBT(mp, isize); | |
400 | int zero_offset = XFS_B_FSB_OFFSET(mp, isize); | |
401 | int zero_len; | |
402 | int nimaps = 1; | |
403 | int error = 0; | |
404 | struct xfs_bmbt_irec imap; | |
dda35b8f | 405 | |
193aec10 | 406 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
5c8ed202 | 407 | error = xfs_bmapi_read(ip, last_fsb, 1, &imap, &nimaps, 0); |
193aec10 | 408 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
5c8ed202 | 409 | if (error) |
dda35b8f | 410 | return error; |
193aec10 | 411 | |
dda35b8f | 412 | ASSERT(nimaps > 0); |
193aec10 | 413 | |
dda35b8f CH |
414 | /* |
415 | * If the block underlying isize is just a hole, then there | |
416 | * is nothing to zero. | |
417 | */ | |
193aec10 | 418 | if (imap.br_startblock == HOLESTARTBLOCK) |
dda35b8f | 419 | return 0; |
dda35b8f CH |
420 | |
421 | zero_len = mp->m_sb.sb_blocksize - zero_offset; | |
422 | if (isize + zero_len > offset) | |
423 | zero_len = offset - isize; | |
193aec10 | 424 | return xfs_iozero(ip, isize, zero_len); |
dda35b8f CH |
425 | } |
426 | ||
427 | /* | |
193aec10 CH |
428 | * Zero any on disk space between the current EOF and the new, larger EOF. |
429 | * | |
430 | * This handles the normal case of zeroing the remainder of the last block in | |
431 | * the file and the unusual case of zeroing blocks out beyond the size of the | |
432 | * file. This second case only happens with fixed size extents and when the | |
433 | * system crashes before the inode size was updated but after blocks were | |
434 | * allocated. | |
435 | * | |
436 | * Expects the iolock to be held exclusive, and will take the ilock internally. | |
dda35b8f | 437 | */ |
dda35b8f CH |
438 | int /* error (positive) */ |
439 | xfs_zero_eof( | |
193aec10 CH |
440 | struct xfs_inode *ip, |
441 | xfs_off_t offset, /* starting I/O offset */ | |
442 | xfs_fsize_t isize) /* current inode size */ | |
dda35b8f | 443 | { |
193aec10 CH |
444 | struct xfs_mount *mp = ip->i_mount; |
445 | xfs_fileoff_t start_zero_fsb; | |
446 | xfs_fileoff_t end_zero_fsb; | |
447 | xfs_fileoff_t zero_count_fsb; | |
448 | xfs_fileoff_t last_fsb; | |
449 | xfs_fileoff_t zero_off; | |
450 | xfs_fsize_t zero_len; | |
451 | int nimaps; | |
452 | int error = 0; | |
453 | struct xfs_bmbt_irec imap; | |
454 | ||
455 | ASSERT(xfs_isilocked(ip, XFS_IOLOCK_EXCL)); | |
dda35b8f CH |
456 | ASSERT(offset > isize); |
457 | ||
458 | /* | |
459 | * First handle zeroing the block on which isize resides. | |
193aec10 | 460 | * |
dda35b8f CH |
461 | * We only zero a part of that block so it is handled specially. |
462 | */ | |
193aec10 CH |
463 | if (XFS_B_FSB_OFFSET(mp, isize) != 0) { |
464 | error = xfs_zero_last_block(ip, offset, isize); | |
465 | if (error) | |
466 | return error; | |
dda35b8f CH |
467 | } |
468 | ||
469 | /* | |
193aec10 CH |
470 | * Calculate the range between the new size and the old where blocks |
471 | * needing to be zeroed may exist. | |
472 | * | |
473 | * To get the block where the last byte in the file currently resides, | |
474 | * we need to subtract one from the size and truncate back to a block | |
475 | * boundary. We subtract 1 in case the size is exactly on a block | |
476 | * boundary. | |
dda35b8f CH |
477 | */ |
478 | last_fsb = isize ? XFS_B_TO_FSBT(mp, isize - 1) : (xfs_fileoff_t)-1; | |
479 | start_zero_fsb = XFS_B_TO_FSB(mp, (xfs_ufsize_t)isize); | |
480 | end_zero_fsb = XFS_B_TO_FSBT(mp, offset - 1); | |
481 | ASSERT((xfs_sfiloff_t)last_fsb < (xfs_sfiloff_t)start_zero_fsb); | |
482 | if (last_fsb == end_zero_fsb) { | |
483 | /* | |
484 | * The size was only incremented on its last block. | |
485 | * We took care of that above, so just return. | |
486 | */ | |
487 | return 0; | |
488 | } | |
489 | ||
490 | ASSERT(start_zero_fsb <= end_zero_fsb); | |
491 | while (start_zero_fsb <= end_zero_fsb) { | |
492 | nimaps = 1; | |
493 | zero_count_fsb = end_zero_fsb - start_zero_fsb + 1; | |
193aec10 CH |
494 | |
495 | xfs_ilock(ip, XFS_ILOCK_EXCL); | |
5c8ed202 DC |
496 | error = xfs_bmapi_read(ip, start_zero_fsb, zero_count_fsb, |
497 | &imap, &nimaps, 0); | |
193aec10 CH |
498 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
499 | if (error) | |
dda35b8f | 500 | return error; |
193aec10 | 501 | |
dda35b8f CH |
502 | ASSERT(nimaps > 0); |
503 | ||
504 | if (imap.br_state == XFS_EXT_UNWRITTEN || | |
505 | imap.br_startblock == HOLESTARTBLOCK) { | |
dda35b8f CH |
506 | start_zero_fsb = imap.br_startoff + imap.br_blockcount; |
507 | ASSERT(start_zero_fsb <= (end_zero_fsb + 1)); | |
508 | continue; | |
509 | } | |
510 | ||
511 | /* | |
512 | * There are blocks we need to zero. | |
dda35b8f | 513 | */ |
dda35b8f CH |
514 | zero_off = XFS_FSB_TO_B(mp, start_zero_fsb); |
515 | zero_len = XFS_FSB_TO_B(mp, imap.br_blockcount); | |
516 | ||
517 | if ((zero_off + zero_len) > offset) | |
518 | zero_len = offset - zero_off; | |
519 | ||
520 | error = xfs_iozero(ip, zero_off, zero_len); | |
193aec10 CH |
521 | if (error) |
522 | return error; | |
dda35b8f CH |
523 | |
524 | start_zero_fsb = imap.br_startoff + imap.br_blockcount; | |
525 | ASSERT(start_zero_fsb <= (end_zero_fsb + 1)); | |
dda35b8f CH |
526 | } |
527 | ||
528 | return 0; | |
dda35b8f CH |
529 | } |
530 | ||
4d8d1581 DC |
531 | /* |
532 | * Common pre-write limit and setup checks. | |
533 | * | |
5bf1f262 CH |
534 | * Called with the iolocked held either shared and exclusive according to |
535 | * @iolock, and returns with it held. Might upgrade the iolock to exclusive | |
536 | * if called for a direct write beyond i_size. | |
4d8d1581 DC |
537 | */ |
538 | STATIC ssize_t | |
539 | xfs_file_aio_write_checks( | |
540 | struct file *file, | |
541 | loff_t *pos, | |
542 | size_t *count, | |
543 | int *iolock) | |
544 | { | |
545 | struct inode *inode = file->f_mapping->host; | |
546 | struct xfs_inode *ip = XFS_I(inode); | |
4d8d1581 DC |
547 | int error = 0; |
548 | ||
7271d243 | 549 | restart: |
4d8d1581 | 550 | error = generic_write_checks(file, pos, count, S_ISBLK(inode->i_mode)); |
467f7899 | 551 | if (error) |
4d8d1581 | 552 | return error; |
4d8d1581 | 553 | |
4d8d1581 DC |
554 | /* |
555 | * If the offset is beyond the size of the file, we need to zero any | |
556 | * blocks that fall between the existing EOF and the start of this | |
2813d682 | 557 | * write. If zeroing is needed and we are currently holding the |
467f7899 CH |
558 | * iolock shared, we need to update it to exclusive which implies |
559 | * having to redo all checks before. | |
4d8d1581 | 560 | */ |
2813d682 | 561 | if (*pos > i_size_read(inode)) { |
7271d243 | 562 | if (*iolock == XFS_IOLOCK_SHARED) { |
467f7899 | 563 | xfs_rw_iunlock(ip, *iolock); |
7271d243 | 564 | *iolock = XFS_IOLOCK_EXCL; |
467f7899 | 565 | xfs_rw_ilock(ip, *iolock); |
7271d243 DC |
566 | goto restart; |
567 | } | |
ce7ae151 | 568 | error = -xfs_zero_eof(ip, *pos, i_size_read(inode)); |
467f7899 CH |
569 | if (error) |
570 | return error; | |
7271d243 | 571 | } |
4d8d1581 | 572 | |
8a9c9980 CH |
573 | /* |
574 | * Updating the timestamps will grab the ilock again from | |
575 | * xfs_fs_dirty_inode, so we have to call it after dropping the | |
576 | * lock above. Eventually we should look into a way to avoid | |
577 | * the pointless lock roundtrip. | |
578 | */ | |
c3b2da31 JB |
579 | if (likely(!(file->f_mode & FMODE_NOCMTIME))) { |
580 | error = file_update_time(file); | |
581 | if (error) | |
582 | return error; | |
583 | } | |
8a9c9980 | 584 | |
4d8d1581 DC |
585 | /* |
586 | * If we're writing the file then make sure to clear the setuid and | |
587 | * setgid bits if the process is not being run by root. This keeps | |
588 | * people from modifying setuid and setgid binaries. | |
589 | */ | |
590 | return file_remove_suid(file); | |
4d8d1581 DC |
591 | } |
592 | ||
f0d26e86 DC |
593 | /* |
594 | * xfs_file_dio_aio_write - handle direct IO writes | |
595 | * | |
596 | * Lock the inode appropriately to prepare for and issue a direct IO write. | |
eda77982 | 597 | * By separating it from the buffered write path we remove all the tricky to |
f0d26e86 DC |
598 | * follow locking changes and looping. |
599 | * | |
eda77982 DC |
600 | * If there are cached pages or we're extending the file, we need IOLOCK_EXCL |
601 | * until we're sure the bytes at the new EOF have been zeroed and/or the cached | |
602 | * pages are flushed out. | |
603 | * | |
604 | * In most cases the direct IO writes will be done holding IOLOCK_SHARED | |
605 | * allowing them to be done in parallel with reads and other direct IO writes. | |
606 | * However, if the IO is not aligned to filesystem blocks, the direct IO layer | |
607 | * needs to do sub-block zeroing and that requires serialisation against other | |
608 | * direct IOs to the same block. In this case we need to serialise the | |
609 | * submission of the unaligned IOs so that we don't get racing block zeroing in | |
610 | * the dio layer. To avoid the problem with aio, we also need to wait for | |
611 | * outstanding IOs to complete so that unwritten extent conversion is completed | |
612 | * before we try to map the overlapping block. This is currently implemented by | |
4a06fd26 | 613 | * hitting it with a big hammer (i.e. inode_dio_wait()). |
eda77982 | 614 | * |
f0d26e86 DC |
615 | * Returns with locks held indicated by @iolock and errors indicated by |
616 | * negative return values. | |
617 | */ | |
618 | STATIC ssize_t | |
619 | xfs_file_dio_aio_write( | |
620 | struct kiocb *iocb, | |
621 | const struct iovec *iovp, | |
622 | unsigned long nr_segs, | |
623 | loff_t pos, | |
d0606464 | 624 | size_t ocount) |
f0d26e86 DC |
625 | { |
626 | struct file *file = iocb->ki_filp; | |
627 | struct address_space *mapping = file->f_mapping; | |
628 | struct inode *inode = mapping->host; | |
629 | struct xfs_inode *ip = XFS_I(inode); | |
630 | struct xfs_mount *mp = ip->i_mount; | |
631 | ssize_t ret = 0; | |
f0d26e86 | 632 | size_t count = ocount; |
eda77982 | 633 | int unaligned_io = 0; |
d0606464 | 634 | int iolock; |
f0d26e86 DC |
635 | struct xfs_buftarg *target = XFS_IS_REALTIME_INODE(ip) ? |
636 | mp->m_rtdev_targp : mp->m_ddev_targp; | |
637 | ||
f0d26e86 DC |
638 | if ((pos & target->bt_smask) || (count & target->bt_smask)) |
639 | return -XFS_ERROR(EINVAL); | |
640 | ||
eda77982 DC |
641 | if ((pos & mp->m_blockmask) || ((pos + count) & mp->m_blockmask)) |
642 | unaligned_io = 1; | |
643 | ||
7271d243 DC |
644 | /* |
645 | * We don't need to take an exclusive lock unless there page cache needs | |
646 | * to be invalidated or unaligned IO is being executed. We don't need to | |
647 | * consider the EOF extension case here because | |
648 | * xfs_file_aio_write_checks() will relock the inode as necessary for | |
649 | * EOF zeroing cases and fill out the new inode size as appropriate. | |
650 | */ | |
651 | if (unaligned_io || mapping->nrpages) | |
d0606464 | 652 | iolock = XFS_IOLOCK_EXCL; |
f0d26e86 | 653 | else |
d0606464 CH |
654 | iolock = XFS_IOLOCK_SHARED; |
655 | xfs_rw_ilock(ip, iolock); | |
c58cb165 CH |
656 | |
657 | /* | |
658 | * Recheck if there are cached pages that need invalidate after we got | |
659 | * the iolock to protect against other threads adding new pages while | |
660 | * we were waiting for the iolock. | |
661 | */ | |
d0606464 CH |
662 | if (mapping->nrpages && iolock == XFS_IOLOCK_SHARED) { |
663 | xfs_rw_iunlock(ip, iolock); | |
664 | iolock = XFS_IOLOCK_EXCL; | |
665 | xfs_rw_ilock(ip, iolock); | |
c58cb165 | 666 | } |
f0d26e86 | 667 | |
d0606464 | 668 | ret = xfs_file_aio_write_checks(file, &pos, &count, &iolock); |
4d8d1581 | 669 | if (ret) |
d0606464 | 670 | goto out; |
f0d26e86 DC |
671 | |
672 | if (mapping->nrpages) { | |
fb595814 DC |
673 | ret = -filemap_write_and_wait_range(VFS_I(ip)->i_mapping, |
674 | pos, -1); | |
f0d26e86 | 675 | if (ret) |
d0606464 | 676 | goto out; |
fb595814 | 677 | truncate_pagecache_range(VFS_I(ip), pos, -1); |
f0d26e86 DC |
678 | } |
679 | ||
eda77982 DC |
680 | /* |
681 | * If we are doing unaligned IO, wait for all other IO to drain, | |
682 | * otherwise demote the lock if we had to flush cached pages | |
683 | */ | |
684 | if (unaligned_io) | |
4a06fd26 | 685 | inode_dio_wait(inode); |
d0606464 | 686 | else if (iolock == XFS_IOLOCK_EXCL) { |
f0d26e86 | 687 | xfs_rw_ilock_demote(ip, XFS_IOLOCK_EXCL); |
d0606464 | 688 | iolock = XFS_IOLOCK_SHARED; |
f0d26e86 DC |
689 | } |
690 | ||
691 | trace_xfs_file_direct_write(ip, count, iocb->ki_pos, 0); | |
692 | ret = generic_file_direct_write(iocb, iovp, | |
693 | &nr_segs, pos, &iocb->ki_pos, count, ocount); | |
694 | ||
d0606464 CH |
695 | out: |
696 | xfs_rw_iunlock(ip, iolock); | |
697 | ||
f0d26e86 DC |
698 | /* No fallback to buffered IO on errors for XFS. */ |
699 | ASSERT(ret < 0 || ret == count); | |
700 | return ret; | |
701 | } | |
702 | ||
00258e36 | 703 | STATIC ssize_t |
637bbc75 | 704 | xfs_file_buffered_aio_write( |
dda35b8f CH |
705 | struct kiocb *iocb, |
706 | const struct iovec *iovp, | |
00258e36 | 707 | unsigned long nr_segs, |
637bbc75 | 708 | loff_t pos, |
d0606464 | 709 | size_t ocount) |
dda35b8f CH |
710 | { |
711 | struct file *file = iocb->ki_filp; | |
712 | struct address_space *mapping = file->f_mapping; | |
713 | struct inode *inode = mapping->host; | |
00258e36 | 714 | struct xfs_inode *ip = XFS_I(inode); |
637bbc75 DC |
715 | ssize_t ret; |
716 | int enospc = 0; | |
d0606464 | 717 | int iolock = XFS_IOLOCK_EXCL; |
637bbc75 | 718 | size_t count = ocount; |
dda35b8f | 719 | |
d0606464 | 720 | xfs_rw_ilock(ip, iolock); |
dda35b8f | 721 | |
d0606464 | 722 | ret = xfs_file_aio_write_checks(file, &pos, &count, &iolock); |
4d8d1581 | 723 | if (ret) |
d0606464 | 724 | goto out; |
dda35b8f CH |
725 | |
726 | /* We can write back this queue in page reclaim */ | |
727 | current->backing_dev_info = mapping->backing_dev_info; | |
728 | ||
dda35b8f | 729 | write_retry: |
637bbc75 DC |
730 | trace_xfs_file_buffered_write(ip, count, iocb->ki_pos, 0); |
731 | ret = generic_file_buffered_write(iocb, iovp, nr_segs, | |
9aa05000 DC |
732 | pos, &iocb->ki_pos, count, 0); |
733 | ||
637bbc75 | 734 | /* |
9aa05000 DC |
735 | * If we just got an ENOSPC, try to write back all dirty inodes to |
736 | * convert delalloc space to free up some of the excess reserved | |
737 | * metadata space. | |
637bbc75 DC |
738 | */ |
739 | if (ret == -ENOSPC && !enospc) { | |
637bbc75 | 740 | enospc = 1; |
9aa05000 DC |
741 | xfs_flush_inodes(ip->i_mount); |
742 | goto write_retry; | |
dda35b8f | 743 | } |
d0606464 | 744 | |
dda35b8f | 745 | current->backing_dev_info = NULL; |
d0606464 CH |
746 | out: |
747 | xfs_rw_iunlock(ip, iolock); | |
637bbc75 DC |
748 | return ret; |
749 | } | |
750 | ||
751 | STATIC ssize_t | |
752 | xfs_file_aio_write( | |
753 | struct kiocb *iocb, | |
754 | const struct iovec *iovp, | |
755 | unsigned long nr_segs, | |
756 | loff_t pos) | |
757 | { | |
758 | struct file *file = iocb->ki_filp; | |
759 | struct address_space *mapping = file->f_mapping; | |
760 | struct inode *inode = mapping->host; | |
761 | struct xfs_inode *ip = XFS_I(inode); | |
762 | ssize_t ret; | |
637bbc75 DC |
763 | size_t ocount = 0; |
764 | ||
765 | XFS_STATS_INC(xs_write_calls); | |
766 | ||
767 | BUG_ON(iocb->ki_pos != pos); | |
768 | ||
769 | ret = generic_segment_checks(iovp, &nr_segs, &ocount, VERIFY_READ); | |
770 | if (ret) | |
771 | return ret; | |
772 | ||
773 | if (ocount == 0) | |
774 | return 0; | |
775 | ||
d9457dc0 | 776 | sb_start_write(inode->i_sb); |
637bbc75 | 777 | |
d9457dc0 JK |
778 | if (XFS_FORCED_SHUTDOWN(ip->i_mount)) { |
779 | ret = -EIO; | |
780 | goto out; | |
781 | } | |
637bbc75 DC |
782 | |
783 | if (unlikely(file->f_flags & O_DIRECT)) | |
d0606464 | 784 | ret = xfs_file_dio_aio_write(iocb, iovp, nr_segs, pos, ocount); |
637bbc75 DC |
785 | else |
786 | ret = xfs_file_buffered_aio_write(iocb, iovp, nr_segs, pos, | |
d0606464 | 787 | ocount); |
dda35b8f | 788 | |
d0606464 CH |
789 | if (ret > 0) { |
790 | ssize_t err; | |
dda35b8f | 791 | |
d0606464 | 792 | XFS_STATS_ADD(xs_write_bytes, ret); |
dda35b8f | 793 | |
d0606464 CH |
794 | /* Handle various SYNC-type writes */ |
795 | err = generic_write_sync(file, pos, ret); | |
796 | if (err < 0) | |
797 | ret = err; | |
dda35b8f CH |
798 | } |
799 | ||
d9457dc0 JK |
800 | out: |
801 | sb_end_write(inode->i_sb); | |
a363f0c2 | 802 | return ret; |
dda35b8f CH |
803 | } |
804 | ||
2fe17c10 CH |
805 | STATIC long |
806 | xfs_file_fallocate( | |
807 | struct file *file, | |
808 | int mode, | |
809 | loff_t offset, | |
810 | loff_t len) | |
811 | { | |
812 | struct inode *inode = file->f_path.dentry->d_inode; | |
813 | long error; | |
814 | loff_t new_size = 0; | |
815 | xfs_flock64_t bf; | |
816 | xfs_inode_t *ip = XFS_I(inode); | |
817 | int cmd = XFS_IOC_RESVSP; | |
82878897 | 818 | int attr_flags = XFS_ATTR_NOLOCK; |
2fe17c10 CH |
819 | |
820 | if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE)) | |
821 | return -EOPNOTSUPP; | |
822 | ||
823 | bf.l_whence = 0; | |
824 | bf.l_start = offset; | |
825 | bf.l_len = len; | |
826 | ||
827 | xfs_ilock(ip, XFS_IOLOCK_EXCL); | |
828 | ||
829 | if (mode & FALLOC_FL_PUNCH_HOLE) | |
830 | cmd = XFS_IOC_UNRESVSP; | |
831 | ||
832 | /* check the new inode size is valid before allocating */ | |
833 | if (!(mode & FALLOC_FL_KEEP_SIZE) && | |
834 | offset + len > i_size_read(inode)) { | |
835 | new_size = offset + len; | |
836 | error = inode_newsize_ok(inode, new_size); | |
837 | if (error) | |
838 | goto out_unlock; | |
839 | } | |
840 | ||
82878897 DC |
841 | if (file->f_flags & O_DSYNC) |
842 | attr_flags |= XFS_ATTR_SYNC; | |
843 | ||
844 | error = -xfs_change_file_space(ip, cmd, &bf, 0, attr_flags); | |
2fe17c10 CH |
845 | if (error) |
846 | goto out_unlock; | |
847 | ||
848 | /* Change file size if needed */ | |
849 | if (new_size) { | |
850 | struct iattr iattr; | |
851 | ||
852 | iattr.ia_valid = ATTR_SIZE; | |
853 | iattr.ia_size = new_size; | |
c4ed4243 | 854 | error = -xfs_setattr_size(ip, &iattr, XFS_ATTR_NOLOCK); |
2fe17c10 CH |
855 | } |
856 | ||
857 | out_unlock: | |
858 | xfs_iunlock(ip, XFS_IOLOCK_EXCL); | |
859 | return error; | |
860 | } | |
861 | ||
862 | ||
1da177e4 | 863 | STATIC int |
3562fd45 | 864 | xfs_file_open( |
1da177e4 | 865 | struct inode *inode, |
f999a5bf | 866 | struct file *file) |
1da177e4 | 867 | { |
f999a5bf | 868 | if (!(file->f_flags & O_LARGEFILE) && i_size_read(inode) > MAX_NON_LFS) |
1da177e4 | 869 | return -EFBIG; |
f999a5bf CH |
870 | if (XFS_FORCED_SHUTDOWN(XFS_M(inode->i_sb))) |
871 | return -EIO; | |
872 | return 0; | |
873 | } | |
874 | ||
875 | STATIC int | |
876 | xfs_dir_open( | |
877 | struct inode *inode, | |
878 | struct file *file) | |
879 | { | |
880 | struct xfs_inode *ip = XFS_I(inode); | |
881 | int mode; | |
882 | int error; | |
883 | ||
884 | error = xfs_file_open(inode, file); | |
885 | if (error) | |
886 | return error; | |
887 | ||
888 | /* | |
889 | * If there are any blocks, read-ahead block 0 as we're almost | |
890 | * certain to have the next operation be a read there. | |
891 | */ | |
892 | mode = xfs_ilock_map_shared(ip); | |
893 | if (ip->i_d.di_nextents > 0) | |
4bb20a83 | 894 | xfs_da_reada_buf(NULL, ip, 0, XFS_DATA_FORK, NULL); |
f999a5bf CH |
895 | xfs_iunlock(ip, mode); |
896 | return 0; | |
1da177e4 LT |
897 | } |
898 | ||
1da177e4 | 899 | STATIC int |
3562fd45 | 900 | xfs_file_release( |
1da177e4 LT |
901 | struct inode *inode, |
902 | struct file *filp) | |
903 | { | |
739bfb2a | 904 | return -xfs_release(XFS_I(inode)); |
1da177e4 LT |
905 | } |
906 | ||
1da177e4 | 907 | STATIC int |
3562fd45 | 908 | xfs_file_readdir( |
1da177e4 LT |
909 | struct file *filp, |
910 | void *dirent, | |
911 | filldir_t filldir) | |
912 | { | |
051e7cd4 | 913 | struct inode *inode = filp->f_path.dentry->d_inode; |
739bfb2a | 914 | xfs_inode_t *ip = XFS_I(inode); |
051e7cd4 CH |
915 | int error; |
916 | size_t bufsize; | |
917 | ||
918 | /* | |
919 | * The Linux API doesn't pass down the total size of the buffer | |
920 | * we read into down to the filesystem. With the filldir concept | |
921 | * it's not needed for correct information, but the XFS dir2 leaf | |
922 | * code wants an estimate of the buffer size to calculate it's | |
923 | * readahead window and size the buffers used for mapping to | |
924 | * physical blocks. | |
925 | * | |
926 | * Try to give it an estimate that's good enough, maybe at some | |
927 | * point we can change the ->readdir prototype to include the | |
a9cc799e | 928 | * buffer size. For now we use the current glibc buffer size. |
051e7cd4 | 929 | */ |
a9cc799e | 930 | bufsize = (size_t)min_t(loff_t, 32768, ip->i_d.di_size); |
051e7cd4 | 931 | |
739bfb2a | 932 | error = xfs_readdir(ip, dirent, bufsize, |
051e7cd4 CH |
933 | (xfs_off_t *)&filp->f_pos, filldir); |
934 | if (error) | |
935 | return -error; | |
936 | return 0; | |
1da177e4 LT |
937 | } |
938 | ||
1da177e4 | 939 | STATIC int |
3562fd45 | 940 | xfs_file_mmap( |
1da177e4 LT |
941 | struct file *filp, |
942 | struct vm_area_struct *vma) | |
943 | { | |
3562fd45 | 944 | vma->vm_ops = &xfs_file_vm_ops; |
6fac0cb4 | 945 | |
fbc1462b | 946 | file_accessed(filp); |
1da177e4 LT |
947 | return 0; |
948 | } | |
949 | ||
4f57dbc6 DC |
950 | /* |
951 | * mmap()d file has taken write protection fault and is being made | |
952 | * writable. We can set the page state up correctly for a writable | |
953 | * page, which means we can do correct delalloc accounting (ENOSPC | |
954 | * checking!) and unwritten extent mapping. | |
955 | */ | |
956 | STATIC int | |
957 | xfs_vm_page_mkwrite( | |
958 | struct vm_area_struct *vma, | |
c2ec175c | 959 | struct vm_fault *vmf) |
4f57dbc6 | 960 | { |
c2ec175c | 961 | return block_page_mkwrite(vma, vmf, xfs_get_blocks); |
4f57dbc6 DC |
962 | } |
963 | ||
d126d43f JL |
964 | /* |
965 | * This type is designed to indicate the type of offset we would like | |
966 | * to search from page cache for either xfs_seek_data() or xfs_seek_hole(). | |
967 | */ | |
968 | enum { | |
969 | HOLE_OFF = 0, | |
970 | DATA_OFF, | |
971 | }; | |
972 | ||
973 | /* | |
974 | * Lookup the desired type of offset from the given page. | |
975 | * | |
976 | * On success, return true and the offset argument will point to the | |
977 | * start of the region that was found. Otherwise this function will | |
978 | * return false and keep the offset argument unchanged. | |
979 | */ | |
980 | STATIC bool | |
981 | xfs_lookup_buffer_offset( | |
982 | struct page *page, | |
983 | loff_t *offset, | |
984 | unsigned int type) | |
985 | { | |
986 | loff_t lastoff = page_offset(page); | |
987 | bool found = false; | |
988 | struct buffer_head *bh, *head; | |
989 | ||
990 | bh = head = page_buffers(page); | |
991 | do { | |
992 | /* | |
993 | * Unwritten extents that have data in the page | |
994 | * cache covering them can be identified by the | |
995 | * BH_Unwritten state flag. Pages with multiple | |
996 | * buffers might have a mix of holes, data and | |
997 | * unwritten extents - any buffer with valid | |
998 | * data in it should have BH_Uptodate flag set | |
999 | * on it. | |
1000 | */ | |
1001 | if (buffer_unwritten(bh) || | |
1002 | buffer_uptodate(bh)) { | |
1003 | if (type == DATA_OFF) | |
1004 | found = true; | |
1005 | } else { | |
1006 | if (type == HOLE_OFF) | |
1007 | found = true; | |
1008 | } | |
1009 | ||
1010 | if (found) { | |
1011 | *offset = lastoff; | |
1012 | break; | |
1013 | } | |
1014 | lastoff += bh->b_size; | |
1015 | } while ((bh = bh->b_this_page) != head); | |
1016 | ||
1017 | return found; | |
1018 | } | |
1019 | ||
1020 | /* | |
1021 | * This routine is called to find out and return a data or hole offset | |
1022 | * from the page cache for unwritten extents according to the desired | |
1023 | * type for xfs_seek_data() or xfs_seek_hole(). | |
1024 | * | |
1025 | * The argument offset is used to tell where we start to search from the | |
1026 | * page cache. Map is used to figure out the end points of the range to | |
1027 | * lookup pages. | |
1028 | * | |
1029 | * Return true if the desired type of offset was found, and the argument | |
1030 | * offset is filled with that address. Otherwise, return false and keep | |
1031 | * offset unchanged. | |
1032 | */ | |
1033 | STATIC bool | |
1034 | xfs_find_get_desired_pgoff( | |
1035 | struct inode *inode, | |
1036 | struct xfs_bmbt_irec *map, | |
1037 | unsigned int type, | |
1038 | loff_t *offset) | |
1039 | { | |
1040 | struct xfs_inode *ip = XFS_I(inode); | |
1041 | struct xfs_mount *mp = ip->i_mount; | |
1042 | struct pagevec pvec; | |
1043 | pgoff_t index; | |
1044 | pgoff_t end; | |
1045 | loff_t endoff; | |
1046 | loff_t startoff = *offset; | |
1047 | loff_t lastoff = startoff; | |
1048 | bool found = false; | |
1049 | ||
1050 | pagevec_init(&pvec, 0); | |
1051 | ||
1052 | index = startoff >> PAGE_CACHE_SHIFT; | |
1053 | endoff = XFS_FSB_TO_B(mp, map->br_startoff + map->br_blockcount); | |
1054 | end = endoff >> PAGE_CACHE_SHIFT; | |
1055 | do { | |
1056 | int want; | |
1057 | unsigned nr_pages; | |
1058 | unsigned int i; | |
1059 | ||
1060 | want = min_t(pgoff_t, end - index, PAGEVEC_SIZE); | |
1061 | nr_pages = pagevec_lookup(&pvec, inode->i_mapping, index, | |
1062 | want); | |
1063 | /* | |
1064 | * No page mapped into given range. If we are searching holes | |
1065 | * and if this is the first time we got into the loop, it means | |
1066 | * that the given offset is landed in a hole, return it. | |
1067 | * | |
1068 | * If we have already stepped through some block buffers to find | |
1069 | * holes but they all contains data. In this case, the last | |
1070 | * offset is already updated and pointed to the end of the last | |
1071 | * mapped page, if it does not reach the endpoint to search, | |
1072 | * that means there should be a hole between them. | |
1073 | */ | |
1074 | if (nr_pages == 0) { | |
1075 | /* Data search found nothing */ | |
1076 | if (type == DATA_OFF) | |
1077 | break; | |
1078 | ||
1079 | ASSERT(type == HOLE_OFF); | |
1080 | if (lastoff == startoff || lastoff < endoff) { | |
1081 | found = true; | |
1082 | *offset = lastoff; | |
1083 | } | |
1084 | break; | |
1085 | } | |
1086 | ||
1087 | /* | |
1088 | * At lease we found one page. If this is the first time we | |
1089 | * step into the loop, and if the first page index offset is | |
1090 | * greater than the given search offset, a hole was found. | |
1091 | */ | |
1092 | if (type == HOLE_OFF && lastoff == startoff && | |
1093 | lastoff < page_offset(pvec.pages[0])) { | |
1094 | found = true; | |
1095 | break; | |
1096 | } | |
1097 | ||
1098 | for (i = 0; i < nr_pages; i++) { | |
1099 | struct page *page = pvec.pages[i]; | |
1100 | loff_t b_offset; | |
1101 | ||
1102 | /* | |
1103 | * At this point, the page may be truncated or | |
1104 | * invalidated (changing page->mapping to NULL), | |
1105 | * or even swizzled back from swapper_space to tmpfs | |
1106 | * file mapping. However, page->index will not change | |
1107 | * because we have a reference on the page. | |
1108 | * | |
1109 | * Searching done if the page index is out of range. | |
1110 | * If the current offset is not reaches the end of | |
1111 | * the specified search range, there should be a hole | |
1112 | * between them. | |
1113 | */ | |
1114 | if (page->index > end) { | |
1115 | if (type == HOLE_OFF && lastoff < endoff) { | |
1116 | *offset = lastoff; | |
1117 | found = true; | |
1118 | } | |
1119 | goto out; | |
1120 | } | |
1121 | ||
1122 | lock_page(page); | |
1123 | /* | |
1124 | * Page truncated or invalidated(page->mapping == NULL). | |
1125 | * We can freely skip it and proceed to check the next | |
1126 | * page. | |
1127 | */ | |
1128 | if (unlikely(page->mapping != inode->i_mapping)) { | |
1129 | unlock_page(page); | |
1130 | continue; | |
1131 | } | |
1132 | ||
1133 | if (!page_has_buffers(page)) { | |
1134 | unlock_page(page); | |
1135 | continue; | |
1136 | } | |
1137 | ||
1138 | found = xfs_lookup_buffer_offset(page, &b_offset, type); | |
1139 | if (found) { | |
1140 | /* | |
1141 | * The found offset may be less than the start | |
1142 | * point to search if this is the first time to | |
1143 | * come here. | |
1144 | */ | |
1145 | *offset = max_t(loff_t, startoff, b_offset); | |
1146 | unlock_page(page); | |
1147 | goto out; | |
1148 | } | |
1149 | ||
1150 | /* | |
1151 | * We either searching data but nothing was found, or | |
1152 | * searching hole but found a data buffer. In either | |
1153 | * case, probably the next page contains the desired | |
1154 | * things, update the last offset to it so. | |
1155 | */ | |
1156 | lastoff = page_offset(page) + PAGE_SIZE; | |
1157 | unlock_page(page); | |
1158 | } | |
1159 | ||
1160 | /* | |
1161 | * The number of returned pages less than our desired, search | |
1162 | * done. In this case, nothing was found for searching data, | |
1163 | * but we found a hole behind the last offset. | |
1164 | */ | |
1165 | if (nr_pages < want) { | |
1166 | if (type == HOLE_OFF) { | |
1167 | *offset = lastoff; | |
1168 | found = true; | |
1169 | } | |
1170 | break; | |
1171 | } | |
1172 | ||
1173 | index = pvec.pages[i - 1]->index + 1; | |
1174 | pagevec_release(&pvec); | |
1175 | } while (index <= end); | |
1176 | ||
1177 | out: | |
1178 | pagevec_release(&pvec); | |
1179 | return found; | |
1180 | } | |
1181 | ||
3fe3e6b1 JL |
1182 | STATIC loff_t |
1183 | xfs_seek_data( | |
1184 | struct file *file, | |
834ab122 | 1185 | loff_t start) |
3fe3e6b1 JL |
1186 | { |
1187 | struct inode *inode = file->f_mapping->host; | |
1188 | struct xfs_inode *ip = XFS_I(inode); | |
1189 | struct xfs_mount *mp = ip->i_mount; | |
3fe3e6b1 JL |
1190 | loff_t uninitialized_var(offset); |
1191 | xfs_fsize_t isize; | |
1192 | xfs_fileoff_t fsbno; | |
1193 | xfs_filblks_t end; | |
1194 | uint lock; | |
1195 | int error; | |
1196 | ||
1197 | lock = xfs_ilock_map_shared(ip); | |
1198 | ||
1199 | isize = i_size_read(inode); | |
1200 | if (start >= isize) { | |
1201 | error = ENXIO; | |
1202 | goto out_unlock; | |
1203 | } | |
1204 | ||
3fe3e6b1 JL |
1205 | /* |
1206 | * Try to read extents from the first block indicated | |
1207 | * by fsbno to the end block of the file. | |
1208 | */ | |
52f1acc8 | 1209 | fsbno = XFS_B_TO_FSBT(mp, start); |
3fe3e6b1 | 1210 | end = XFS_B_TO_FSB(mp, isize); |
52f1acc8 JL |
1211 | for (;;) { |
1212 | struct xfs_bmbt_irec map[2]; | |
1213 | int nmap = 2; | |
1214 | unsigned int i; | |
3fe3e6b1 | 1215 | |
52f1acc8 JL |
1216 | error = xfs_bmapi_read(ip, fsbno, end - fsbno, map, &nmap, |
1217 | XFS_BMAPI_ENTIRE); | |
1218 | if (error) | |
1219 | goto out_unlock; | |
3fe3e6b1 | 1220 | |
52f1acc8 JL |
1221 | /* No extents at given offset, must be beyond EOF */ |
1222 | if (nmap == 0) { | |
1223 | error = ENXIO; | |
1224 | goto out_unlock; | |
1225 | } | |
1226 | ||
1227 | for (i = 0; i < nmap; i++) { | |
1228 | offset = max_t(loff_t, start, | |
1229 | XFS_FSB_TO_B(mp, map[i].br_startoff)); | |
1230 | ||
1231 | /* Landed in a data extent */ | |
1232 | if (map[i].br_startblock == DELAYSTARTBLOCK || | |
1233 | (map[i].br_state == XFS_EXT_NORM && | |
1234 | !isnullstartblock(map[i].br_startblock))) | |
1235 | goto out; | |
1236 | ||
1237 | /* | |
1238 | * Landed in an unwritten extent, try to search data | |
1239 | * from page cache. | |
1240 | */ | |
1241 | if (map[i].br_state == XFS_EXT_UNWRITTEN) { | |
1242 | if (xfs_find_get_desired_pgoff(inode, &map[i], | |
1243 | DATA_OFF, &offset)) | |
1244 | goto out; | |
1245 | } | |
1246 | } | |
1247 | ||
1248 | /* | |
1249 | * map[0] is hole or its an unwritten extent but | |
1250 | * without data in page cache. Probably means that | |
1251 | * we are reading after EOF if nothing in map[1]. | |
1252 | */ | |
3fe3e6b1 JL |
1253 | if (nmap == 1) { |
1254 | error = ENXIO; | |
1255 | goto out_unlock; | |
1256 | } | |
1257 | ||
52f1acc8 JL |
1258 | ASSERT(i > 1); |
1259 | ||
1260 | /* | |
1261 | * Nothing was found, proceed to the next round of search | |
1262 | * if reading offset not beyond or hit EOF. | |
1263 | */ | |
1264 | fsbno = map[i - 1].br_startoff + map[i - 1].br_blockcount; | |
1265 | start = XFS_FSB_TO_B(mp, fsbno); | |
1266 | if (start >= isize) { | |
1267 | error = ENXIO; | |
1268 | goto out_unlock; | |
1269 | } | |
3fe3e6b1 JL |
1270 | } |
1271 | ||
52f1acc8 | 1272 | out: |
3fe3e6b1 JL |
1273 | if (offset != file->f_pos) |
1274 | file->f_pos = offset; | |
1275 | ||
1276 | out_unlock: | |
1277 | xfs_iunlock_map_shared(ip, lock); | |
1278 | ||
1279 | if (error) | |
1280 | return -error; | |
1281 | return offset; | |
1282 | } | |
1283 | ||
1284 | STATIC loff_t | |
1285 | xfs_seek_hole( | |
1286 | struct file *file, | |
834ab122 | 1287 | loff_t start) |
3fe3e6b1 JL |
1288 | { |
1289 | struct inode *inode = file->f_mapping->host; | |
1290 | struct xfs_inode *ip = XFS_I(inode); | |
1291 | struct xfs_mount *mp = ip->i_mount; | |
1292 | loff_t uninitialized_var(offset); | |
3fe3e6b1 JL |
1293 | xfs_fsize_t isize; |
1294 | xfs_fileoff_t fsbno; | |
b686d1f7 | 1295 | xfs_filblks_t end; |
3fe3e6b1 JL |
1296 | uint lock; |
1297 | int error; | |
1298 | ||
1299 | if (XFS_FORCED_SHUTDOWN(mp)) | |
1300 | return -XFS_ERROR(EIO); | |
1301 | ||
1302 | lock = xfs_ilock_map_shared(ip); | |
1303 | ||
1304 | isize = i_size_read(inode); | |
1305 | if (start >= isize) { | |
1306 | error = ENXIO; | |
1307 | goto out_unlock; | |
1308 | } | |
1309 | ||
1310 | fsbno = XFS_B_TO_FSBT(mp, start); | |
b686d1f7 JL |
1311 | end = XFS_B_TO_FSB(mp, isize); |
1312 | ||
1313 | for (;;) { | |
1314 | struct xfs_bmbt_irec map[2]; | |
1315 | int nmap = 2; | |
1316 | unsigned int i; | |
1317 | ||
1318 | error = xfs_bmapi_read(ip, fsbno, end - fsbno, map, &nmap, | |
1319 | XFS_BMAPI_ENTIRE); | |
1320 | if (error) | |
1321 | goto out_unlock; | |
1322 | ||
1323 | /* No extents at given offset, must be beyond EOF */ | |
1324 | if (nmap == 0) { | |
1325 | error = ENXIO; | |
1326 | goto out_unlock; | |
1327 | } | |
1328 | ||
1329 | for (i = 0; i < nmap; i++) { | |
1330 | offset = max_t(loff_t, start, | |
1331 | XFS_FSB_TO_B(mp, map[i].br_startoff)); | |
1332 | ||
1333 | /* Landed in a hole */ | |
1334 | if (map[i].br_startblock == HOLESTARTBLOCK) | |
1335 | goto out; | |
1336 | ||
1337 | /* | |
1338 | * Landed in an unwritten extent, try to search hole | |
1339 | * from page cache. | |
1340 | */ | |
1341 | if (map[i].br_state == XFS_EXT_UNWRITTEN) { | |
1342 | if (xfs_find_get_desired_pgoff(inode, &map[i], | |
1343 | HOLE_OFF, &offset)) | |
1344 | goto out; | |
1345 | } | |
1346 | } | |
3fe3e6b1 | 1347 | |
3fe3e6b1 | 1348 | /* |
b686d1f7 JL |
1349 | * map[0] contains data or its unwritten but contains |
1350 | * data in page cache, probably means that we are | |
1351 | * reading after EOF. We should fix offset to point | |
1352 | * to the end of the file(i.e., there is an implicit | |
1353 | * hole at the end of any file). | |
3fe3e6b1 | 1354 | */ |
b686d1f7 JL |
1355 | if (nmap == 1) { |
1356 | offset = isize; | |
1357 | break; | |
1358 | } | |
1359 | ||
1360 | ASSERT(i > 1); | |
1361 | ||
1362 | /* | |
1363 | * Both mappings contains data, proceed to the next round of | |
1364 | * search if the current reading offset not beyond or hit EOF. | |
1365 | */ | |
1366 | fsbno = map[i - 1].br_startoff + map[i - 1].br_blockcount; | |
1367 | start = XFS_FSB_TO_B(mp, fsbno); | |
1368 | if (start >= isize) { | |
1369 | offset = isize; | |
1370 | break; | |
1371 | } | |
3fe3e6b1 JL |
1372 | } |
1373 | ||
b686d1f7 JL |
1374 | out: |
1375 | /* | |
1376 | * At this point, we must have found a hole. However, the returned | |
1377 | * offset may be bigger than the file size as it may be aligned to | |
1378 | * page boundary for unwritten extents, we need to deal with this | |
1379 | * situation in particular. | |
1380 | */ | |
1381 | offset = min_t(loff_t, offset, isize); | |
3fe3e6b1 JL |
1382 | if (offset != file->f_pos) |
1383 | file->f_pos = offset; | |
1384 | ||
1385 | out_unlock: | |
1386 | xfs_iunlock_map_shared(ip, lock); | |
1387 | ||
1388 | if (error) | |
1389 | return -error; | |
1390 | return offset; | |
1391 | } | |
1392 | ||
1393 | STATIC loff_t | |
1394 | xfs_file_llseek( | |
1395 | struct file *file, | |
1396 | loff_t offset, | |
1397 | int origin) | |
1398 | { | |
1399 | switch (origin) { | |
1400 | case SEEK_END: | |
1401 | case SEEK_CUR: | |
1402 | case SEEK_SET: | |
1403 | return generic_file_llseek(file, offset, origin); | |
1404 | case SEEK_DATA: | |
834ab122 | 1405 | return xfs_seek_data(file, offset); |
3fe3e6b1 | 1406 | case SEEK_HOLE: |
834ab122 | 1407 | return xfs_seek_hole(file, offset); |
3fe3e6b1 JL |
1408 | default: |
1409 | return -EINVAL; | |
1410 | } | |
1411 | } | |
1412 | ||
4b6f5d20 | 1413 | const struct file_operations xfs_file_operations = { |
3fe3e6b1 | 1414 | .llseek = xfs_file_llseek, |
1da177e4 | 1415 | .read = do_sync_read, |
bb3f724e | 1416 | .write = do_sync_write, |
3562fd45 NS |
1417 | .aio_read = xfs_file_aio_read, |
1418 | .aio_write = xfs_file_aio_write, | |
1b895840 NS |
1419 | .splice_read = xfs_file_splice_read, |
1420 | .splice_write = xfs_file_splice_write, | |
3562fd45 | 1421 | .unlocked_ioctl = xfs_file_ioctl, |
1da177e4 | 1422 | #ifdef CONFIG_COMPAT |
3562fd45 | 1423 | .compat_ioctl = xfs_file_compat_ioctl, |
1da177e4 | 1424 | #endif |
3562fd45 NS |
1425 | .mmap = xfs_file_mmap, |
1426 | .open = xfs_file_open, | |
1427 | .release = xfs_file_release, | |
1428 | .fsync = xfs_file_fsync, | |
2fe17c10 | 1429 | .fallocate = xfs_file_fallocate, |
1da177e4 LT |
1430 | }; |
1431 | ||
4b6f5d20 | 1432 | const struct file_operations xfs_dir_file_operations = { |
f999a5bf | 1433 | .open = xfs_dir_open, |
1da177e4 | 1434 | .read = generic_read_dir, |
3562fd45 | 1435 | .readdir = xfs_file_readdir, |
59af1584 | 1436 | .llseek = generic_file_llseek, |
3562fd45 | 1437 | .unlocked_ioctl = xfs_file_ioctl, |
d3870398 | 1438 | #ifdef CONFIG_COMPAT |
3562fd45 | 1439 | .compat_ioctl = xfs_file_compat_ioctl, |
d3870398 | 1440 | #endif |
1da2f2db | 1441 | .fsync = xfs_dir_fsync, |
1da177e4 LT |
1442 | }; |
1443 | ||
f0f37e2f | 1444 | static const struct vm_operations_struct xfs_file_vm_ops = { |
54cb8821 | 1445 | .fault = filemap_fault, |
4f57dbc6 | 1446 | .page_mkwrite = xfs_vm_page_mkwrite, |
0b173bc4 | 1447 | .remap_pages = generic_file_remap_pages, |
6fac0cb4 | 1448 | }; |