2006-03-31 12:30:42 +02:00
|
|
|
/*
|
|
|
|
* High-level sync()-related operations
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/file.h>
|
|
|
|
#include <linux/fs.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2006-03-31 12:30:42 +02:00
|
|
|
#include <linux/module.h>
|
2006-10-18 19:55:46 +02:00
|
|
|
#include <linux/sched.h>
|
2006-03-31 12:30:42 +02:00
|
|
|
#include <linux/writeback.h>
|
|
|
|
#include <linux/syscalls.h>
|
|
|
|
#include <linux/linkage.h>
|
|
|
|
#include <linux/pagemap.h>
|
2006-08-29 20:05:54 +02:00
|
|
|
#include <linux/quotaops.h>
|
|
|
|
#include <linux/buffer_head.h>
|
2009-04-27 16:43:48 +02:00
|
|
|
#include "internal.h"
|
2006-03-31 12:30:42 +02:00
|
|
|
|
|
|
|
#define VALID_FLAGS (SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE| \
|
|
|
|
SYNC_FILE_RANGE_WAIT_AFTER)
|
|
|
|
|
2009-04-27 16:43:52 +02:00
|
|
|
/*
|
2009-09-02 12:34:32 +02:00
|
|
|
* Do the filesystem syncing work. For simple filesystems
|
|
|
|
* writeback_inodes_sb(sb) just dirties buffers with inodes so we have to
|
|
|
|
* submit IO for these buffers via __sync_blockdev(). This also speeds up the
|
|
|
|
* wait == 1 case since in that case write_inode() functions do
|
|
|
|
* sync_dirty_buffer() and thus effectively write one block at a time.
|
2009-04-27 16:43:52 +02:00
|
|
|
*/
|
2009-04-27 16:43:53 +02:00
|
|
|
static int __sync_filesystem(struct super_block *sb, int wait)
|
2009-04-27 16:43:52 +02:00
|
|
|
{
|
2009-09-16 15:02:33 +02:00
|
|
|
/*
|
|
|
|
* This should be safe, as we require bdi backing to actually
|
|
|
|
* write out data in the first place
|
|
|
|
*/
|
|
|
|
if (!sb->s_bdi)
|
|
|
|
return 0;
|
|
|
|
|
2010-02-16 09:44:52 +01:00
|
|
|
if (sb->s_qcop && sb->s_qcop->quota_sync)
|
|
|
|
sb->s_qcop->quota_sync(sb, -1, wait);
|
|
|
|
|
|
|
|
if (wait)
|
2009-09-02 12:34:32 +02:00
|
|
|
sync_inodes_sb(sb);
|
2010-02-16 09:44:52 +01:00
|
|
|
else
|
|
|
|
writeback_inodes_sb(sb);
|
|
|
|
|
2009-04-27 16:43:52 +02:00
|
|
|
if (sb->s_op->sync_fs)
|
|
|
|
sb->s_op->sync_fs(sb, wait);
|
|
|
|
return __sync_blockdev(sb->s_bdev, wait);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write out and wait upon all dirty data associated with this
|
|
|
|
* superblock. Filesystem data as well as the underlying block
|
|
|
|
* device. Takes the superblock lock.
|
|
|
|
*/
|
2009-04-27 16:43:53 +02:00
|
|
|
int sync_filesystem(struct super_block *sb)
|
2009-04-27 16:43:52 +02:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
2009-05-05 15:41:25 +02:00
|
|
|
/*
|
|
|
|
* We need to be protected against the filesystem going from
|
|
|
|
* r/o to r/w or vice versa.
|
|
|
|
*/
|
|
|
|
WARN_ON(!rwsem_is_locked(&sb->s_umount));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No point in syncing out anything if the filesystem is read-only.
|
|
|
|
*/
|
|
|
|
if (sb->s_flags & MS_RDONLY)
|
|
|
|
return 0;
|
|
|
|
|
2009-04-27 16:43:53 +02:00
|
|
|
ret = __sync_filesystem(sb, 0);
|
2009-04-27 16:43:52 +02:00
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2009-04-27 16:43:53 +02:00
|
|
|
return __sync_filesystem(sb, 1);
|
2009-04-27 16:43:52 +02:00
|
|
|
}
|
2009-04-27 16:43:53 +02:00
|
|
|
EXPORT_SYMBOL_GPL(sync_filesystem);
|
2009-04-27 16:43:52 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Sync all the data for all the filesystems (called by sys_sync() and
|
|
|
|
* emergency sync)
|
|
|
|
*
|
|
|
|
* This operation is careful to avoid the livelock which could easily happen
|
|
|
|
* if two or more filesystems are being continuously dirtied. s_need_sync
|
|
|
|
* is used only here. We set it against all filesystems and then clear it as
|
|
|
|
* we sync them. So redirtied filesystems are skipped.
|
|
|
|
*
|
|
|
|
* But if process A is currently running sync_filesystems and then process B
|
|
|
|
* calls sync_filesystems as well, process B will set all the s_need_sync
|
|
|
|
* flags again, which will cause process A to resync everything. Fix that with
|
|
|
|
* a local mutex.
|
|
|
|
*/
|
|
|
|
static void sync_filesystems(int wait)
|
|
|
|
{
|
|
|
|
struct super_block *sb;
|
|
|
|
static DEFINE_MUTEX(mutex);
|
|
|
|
|
|
|
|
mutex_lock(&mutex); /* Could be down_interruptible */
|
|
|
|
spin_lock(&sb_lock);
|
2009-05-05 15:41:25 +02:00
|
|
|
list_for_each_entry(sb, &super_blocks, s_list)
|
2009-04-27 16:43:52 +02:00
|
|
|
sb->s_need_sync = 1;
|
|
|
|
|
|
|
|
restart:
|
|
|
|
list_for_each_entry(sb, &super_blocks, s_list) {
|
|
|
|
if (!sb->s_need_sync)
|
|
|
|
continue;
|
|
|
|
sb->s_need_sync = 0;
|
|
|
|
sb->s_count++;
|
|
|
|
spin_unlock(&sb_lock);
|
2009-05-05 15:41:25 +02:00
|
|
|
|
2009-04-27 16:43:52 +02:00
|
|
|
down_read(&sb->s_umount);
|
2009-09-16 15:02:33 +02:00
|
|
|
if (!(sb->s_flags & MS_RDONLY) && sb->s_root && sb->s_bdi)
|
2009-04-27 16:43:53 +02:00
|
|
|
__sync_filesystem(sb, wait);
|
2009-04-27 16:43:52 +02:00
|
|
|
up_read(&sb->s_umount);
|
2009-05-05 15:41:25 +02:00
|
|
|
|
2009-04-27 16:43:52 +02:00
|
|
|
/* restart only when sb is no longer on the list */
|
|
|
|
spin_lock(&sb_lock);
|
|
|
|
if (__put_super_and_need_restart(sb))
|
|
|
|
goto restart;
|
|
|
|
}
|
|
|
|
spin_unlock(&sb_lock);
|
|
|
|
mutex_unlock(&mutex);
|
|
|
|
}
|
|
|
|
|
2009-07-05 21:08:08 +02:00
|
|
|
/*
|
|
|
|
* sync everything. Start out by waking pdflush, because that writes back
|
|
|
|
* all queues in parallel.
|
|
|
|
*/
|
2009-04-27 16:43:51 +02:00
|
|
|
SYSCALL_DEFINE0(sync)
|
2006-08-29 20:05:54 +02:00
|
|
|
{
|
2009-09-09 09:08:54 +02:00
|
|
|
wakeup_flusher_threads(0);
|
2009-04-27 16:43:51 +02:00
|
|
|
sync_filesystems(0);
|
|
|
|
sync_filesystems(1);
|
2006-08-29 20:05:54 +02:00
|
|
|
if (unlikely(laptop_mode))
|
|
|
|
laptop_sync_completion();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-03-17 09:38:40 +01:00
|
|
|
static void do_sync_work(struct work_struct *work)
|
|
|
|
{
|
2009-04-27 16:43:51 +02:00
|
|
|
/*
|
|
|
|
* Sync twice to reduce the possibility we skipped some inodes / pages
|
|
|
|
* because they were temporarily locked
|
|
|
|
*/
|
|
|
|
sync_filesystems(0);
|
|
|
|
sync_filesystems(0);
|
|
|
|
printk("Emergency Sync complete\n");
|
2009-03-17 09:38:40 +01:00
|
|
|
kfree(work);
|
|
|
|
}
|
|
|
|
|
2006-08-29 20:05:54 +02:00
|
|
|
void emergency_sync(void)
|
|
|
|
{
|
2009-03-17 09:38:40 +01:00
|
|
|
struct work_struct *work;
|
|
|
|
|
|
|
|
work = kmalloc(sizeof(*work), GFP_ATOMIC);
|
|
|
|
if (work) {
|
|
|
|
INIT_WORK(work, do_sync_work);
|
|
|
|
schedule_work(work);
|
|
|
|
}
|
2006-08-29 20:05:54 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Generic function to fsync a file.
|
|
|
|
*
|
|
|
|
* filp may be NULL if called via the msync of a vma.
|
|
|
|
*/
|
|
|
|
int file_fsync(struct file *filp, struct dentry *dentry, int datasync)
|
|
|
|
{
|
|
|
|
struct inode * inode = dentry->d_inode;
|
|
|
|
struct super_block * sb;
|
|
|
|
int ret, err;
|
|
|
|
|
|
|
|
/* sync the inode to buffers */
|
|
|
|
ret = write_inode_now(inode, 0);
|
|
|
|
|
|
|
|
/* sync the superblock to buffers */
|
|
|
|
sb = inode->i_sb;
|
2008-04-29 09:59:42 +02:00
|
|
|
if (sb->s_dirt && sb->s_op->write_super)
|
2006-08-29 20:05:54 +02:00
|
|
|
sb->s_op->write_super(sb);
|
|
|
|
|
|
|
|
/* .. finally sync the buffers to disk */
|
|
|
|
err = sync_blockdev(sb->s_bdev);
|
|
|
|
if (!ret)
|
|
|
|
ret = err;
|
|
|
|
return ret;
|
|
|
|
}
|
2009-09-23 01:43:51 +02:00
|
|
|
EXPORT_SYMBOL(file_fsync);
|
2006-08-29 20:05:54 +02:00
|
|
|
|
2008-12-22 21:11:15 +01:00
|
|
|
/**
|
2009-08-17 19:52:36 +02:00
|
|
|
* vfs_fsync_range - helper to sync a range of data & metadata to disk
|
2008-12-22 21:11:15 +01:00
|
|
|
* @file: file to sync
|
|
|
|
* @dentry: dentry of @file
|
2009-08-17 19:52:36 +02:00
|
|
|
* @start: offset in bytes of the beginning of data range to sync
|
|
|
|
* @end: offset in bytes of the end of data range (inclusive)
|
|
|
|
* @datasync: perform only datasync
|
2008-12-22 21:11:15 +01:00
|
|
|
*
|
2009-08-17 19:52:36 +02:00
|
|
|
* Write back data in range @start..@end and metadata for @file to disk. If
|
|
|
|
* @datasync is set only metadata needed to access modified file data is
|
|
|
|
* written.
|
2008-12-22 21:11:15 +01:00
|
|
|
*
|
|
|
|
* In case this function is called from nfsd @file may be %NULL and
|
|
|
|
* only @dentry is set. This can only happen when the filesystem
|
|
|
|
* implements the export_operations API.
|
|
|
|
*/
|
2009-08-17 19:52:36 +02:00
|
|
|
int vfs_fsync_range(struct file *file, struct dentry *dentry, loff_t start,
|
|
|
|
loff_t end, int datasync)
|
2006-08-29 20:05:54 +02:00
|
|
|
{
|
2008-12-22 21:11:15 +01:00
|
|
|
const struct file_operations *fop;
|
|
|
|
struct address_space *mapping;
|
|
|
|
int err, ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get mapping and operations from the file in case we have
|
|
|
|
* as file, or get the default values for them in case we
|
|
|
|
* don't have a struct file available. Damn nfsd..
|
|
|
|
*/
|
|
|
|
if (file) {
|
|
|
|
mapping = file->f_mapping;
|
|
|
|
fop = file->f_op;
|
|
|
|
} else {
|
|
|
|
mapping = dentry->d_inode->i_mapping;
|
|
|
|
fop = dentry->d_inode->i_fop;
|
|
|
|
}
|
2006-08-29 20:05:54 +02:00
|
|
|
|
2008-12-22 21:11:15 +01:00
|
|
|
if (!fop || !fop->fsync) {
|
2006-08-29 20:05:54 +02:00
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
fsync: wait for data writeout completion before calling ->fsync
Currenly vfs_fsync(_range) first calls filemap_fdatawrite to write out
the data, the calls into ->fsync to write out the metadata and then finally
calls filemap_fdatawait to wait for the data I/O to complete. What sounds
like a clever micro-optimization actually is nast trap for many filesystems.
For many modern filesystems i_size or other inode information is only
updated on I/O completion and we need to wait for I/O to finish before
we can write out the metadata. For old fashionen filesystems that
instanciate blocks during the actual write and also update the metadata
at that point it opens up a large window were we could expose uninitialized
blocks after a crash. While a few filesystems that need it already wait
for the I/O to finish inside their ->fsync methods it is rather suboptimal
as it is done under the i_mutex and also always for the whole file instead
of just a part as we could do for O_SYNC handling.
Here is a small audit of all fsync instances in the tree:
- spufs_mfc_fsync:
- ps3flash_fsync:
- vol_cdev_fsync:
- printer_fsync:
- fb_deferred_io_fsync:
- bad_file_fsync:
- simple_sync_file:
don't care - filesystems/drivers do't use the page cache or are
purely in-memory.
- simple_fsync:
- file_fsync:
- affs_file_fsync:
- fat_file_fsync:
- jfs_fsync:
- ubifs_fsync:
- reiserfs_dir_fsync:
- reiserfs_sync_file:
never touch pagecache themselves. We need to wait before if we do
not want to expose stale data after an allocation.
- afs_fsync:
- fuse_fsync_common:
do the waiting writeback itself in awkward ways, would benefit from
proper semantics
- block_fsync:
Does a filemap_write_and_wait on the block device inode. Because we
now have f_mapping that is the same inode we call it on in vfs_fsync.
So just removing it and letting the VFS do the work in one go would
be an improvement.
- btrfs_sync_file:
- cifs_fsync:
- xfs_file_fsync:
need the wait first and currently do it themselves. would benefit from
doing it outside i_mutex.
- coda_fsync:
- ecryptfs_fsync:
- exofs_file_fsync:
- shm_fsync:
only passes the fsync through to the lower layer
- ext3_sync_file:
doesn't seem to care, comments are confusing.
- ext4_sync_file:
would need the wait to work correctly for delalloc mode with late
i_size updates. Otherwise the ext3 comment applies.
currently implemens it's own writeback and wait in an odd way,
could benefit from doing it properly.
- gfs2_fsync:
not needed for journaled data mode, but probably harmless there.
Currently writes back data asynchronously itself. Needs some
major audit.
- hostfs_fsync:
just calls fsync/datasync on the host FD. Without the wait before
data might not even be inflight yet if we're unlucky.
- hpfs_file_fsync:
- ncp_fsync:
no-ops. Dangerous before and after.
- jffs2_fsync:
just calls jffs2_flush_wbuf_gc, not sure how this relates to data.
- nfs_fsync_dir:
just increments stats, claims all directory operations are synchronous
- nfs_file_fsync:
only writes out data??? Looks very odd.
- nilfs_sync_file:
looks like it expects all data done, but not sure from the code
- ntfs_dir_fsync:
- ntfs_file_fsync:
appear to do their own data writeback. Very convoluted code.
- ocfs2_sync_file:
does it's own data writeback, but no wait. probably needs the wait.
- smb_fsync:
according to a comment expects all pages written already, probably needs
the wait before.
This patch only changes vfs_fsync_range, removal of the wait in the methods
that have it is left to the filesystem maintainers. Note that most
filesystems really do need an audit for their fsync methods given the
gems found in this very brief audit.
Signed-off-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Jan Kara <jack@suse.cz>
2009-09-03 12:39:39 +02:00
|
|
|
ret = filemap_write_and_wait_range(mapping, start, end);
|
2006-08-29 20:05:54 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We need to protect against concurrent writers, which could cause
|
|
|
|
* livelocks in fsync_buffers_list().
|
|
|
|
*/
|
|
|
|
mutex_lock(&mapping->host->i_mutex);
|
2008-12-22 21:11:15 +01:00
|
|
|
err = fop->fsync(file, dentry, datasync);
|
2006-08-29 20:05:54 +02:00
|
|
|
if (!ret)
|
|
|
|
ret = err;
|
|
|
|
mutex_unlock(&mapping->host->i_mutex);
|
2009-08-17 19:52:36 +02:00
|
|
|
|
2006-08-29 20:05:54 +02:00
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
2009-08-17 19:52:36 +02:00
|
|
|
EXPORT_SYMBOL(vfs_fsync_range);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* vfs_fsync - perform a fsync or fdatasync on a file
|
|
|
|
* @file: file to sync
|
|
|
|
* @dentry: dentry of @file
|
|
|
|
* @datasync: only perform a fdatasync operation
|
|
|
|
*
|
|
|
|
* Write back data and metadata for @file to disk. If @datasync is
|
|
|
|
* set only metadata needed to access modified file data is written.
|
|
|
|
*
|
|
|
|
* In case this function is called from nfsd @file may be %NULL and
|
|
|
|
* only @dentry is set. This can only happen when the filesystem
|
|
|
|
* implements the export_operations API.
|
|
|
|
*/
|
|
|
|
int vfs_fsync(struct file *file, struct dentry *dentry, int datasync)
|
|
|
|
{
|
|
|
|
return vfs_fsync_range(file, dentry, 0, LLONG_MAX, datasync);
|
|
|
|
}
|
2008-12-22 21:11:15 +01:00
|
|
|
EXPORT_SYMBOL(vfs_fsync);
|
2006-08-29 20:05:54 +02:00
|
|
|
|
2008-12-22 21:11:15 +01:00
|
|
|
static int do_fsync(unsigned int fd, int datasync)
|
2006-08-29 20:05:54 +02:00
|
|
|
{
|
|
|
|
struct file *file;
|
|
|
|
int ret = -EBADF;
|
|
|
|
|
|
|
|
file = fget(fd);
|
|
|
|
if (file) {
|
2008-12-22 21:11:15 +01:00
|
|
|
ret = vfs_fsync(file, file->f_path.dentry, datasync);
|
2006-08-29 20:05:54 +02:00
|
|
|
fput(file);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-01-14 14:14:11 +01:00
|
|
|
SYSCALL_DEFINE1(fsync, unsigned int, fd)
|
2006-08-29 20:05:54 +02:00
|
|
|
{
|
2008-12-22 21:11:15 +01:00
|
|
|
return do_fsync(fd, 0);
|
2006-08-29 20:05:54 +02:00
|
|
|
}
|
|
|
|
|
2009-01-14 14:14:11 +01:00
|
|
|
SYSCALL_DEFINE1(fdatasync, unsigned int, fd)
|
2006-08-29 20:05:54 +02:00
|
|
|
{
|
2008-12-22 21:11:15 +01:00
|
|
|
return do_fsync(fd, 1);
|
2006-08-29 20:05:54 +02:00
|
|
|
}
|
|
|
|
|
2009-08-17 19:52:36 +02:00
|
|
|
/**
|
|
|
|
* generic_write_sync - perform syncing after a write if file / inode is sync
|
|
|
|
* @file: file to which the write happened
|
|
|
|
* @pos: offset where the write started
|
|
|
|
* @count: length of the write
|
|
|
|
*
|
|
|
|
* This is just a simple wrapper about our general syncing function.
|
|
|
|
*/
|
|
|
|
int generic_write_sync(struct file *file, loff_t pos, loff_t count)
|
|
|
|
{
|
2009-10-27 11:05:28 +01:00
|
|
|
if (!(file->f_flags & O_DSYNC) && !IS_SYNC(file->f_mapping->host))
|
2009-08-17 19:52:36 +02:00
|
|
|
return 0;
|
|
|
|
return vfs_fsync_range(file, file->f_path.dentry, pos,
|
2009-10-27 11:05:28 +01:00
|
|
|
pos + count - 1,
|
|
|
|
(file->f_flags & __O_SYNC) ? 0 : 1);
|
2009-08-17 19:52:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(generic_write_sync);
|
|
|
|
|
2006-03-31 12:30:42 +02:00
|
|
|
/*
|
|
|
|
* sys_sync_file_range() permits finely controlled syncing over a segment of
|
|
|
|
* a file in the range offset .. (offset+nbytes-1) inclusive. If nbytes is
|
|
|
|
* zero then sys_sync_file_range() will operate from offset out to EOF.
|
|
|
|
*
|
|
|
|
* The flag bits are:
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_BEFORE: wait upon writeout of all pages in the range
|
|
|
|
* before performing the write.
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WRITE: initiate writeout of all those dirty pages in the
|
2008-07-24 06:27:36 +02:00
|
|
|
* range which are not presently under writeback. Note that this may block for
|
|
|
|
* significant periods due to exhaustion of disk request structures.
|
2006-03-31 12:30:42 +02:00
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_AFTER: wait upon writeout of all pages in the range
|
|
|
|
* after performing the write.
|
|
|
|
*
|
|
|
|
* Useful combinations of the flag bits are:
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE: ensures that all pages
|
|
|
|
* in the range which were dirty on entry to sys_sync_file_range() are placed
|
|
|
|
* under writeout. This is a start-write-for-data-integrity operation.
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WRITE: start writeout of all dirty pages in the range which
|
|
|
|
* are not presently under writeout. This is an asynchronous flush-to-disk
|
|
|
|
* operation. Not suitable for data integrity operations.
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_BEFORE (or SYNC_FILE_RANGE_WAIT_AFTER): wait for
|
|
|
|
* completion of writeout of all pages in the range. This will be used after an
|
|
|
|
* earlier SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE operation to wait
|
|
|
|
* for that operation to complete and to return the result.
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE|SYNC_FILE_RANGE_WAIT_AFTER:
|
|
|
|
* a traditional sync() operation. This is a write-for-data-integrity operation
|
|
|
|
* which will ensure that all pages in the range which were dirty on entry to
|
|
|
|
* sys_sync_file_range() are committed to disk.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* SYNC_FILE_RANGE_WAIT_BEFORE and SYNC_FILE_RANGE_WAIT_AFTER will detect any
|
|
|
|
* I/O errors or ENOSPC conditions and will return those to the caller, after
|
|
|
|
* clearing the EIO and ENOSPC flags in the address_space.
|
|
|
|
*
|
|
|
|
* It should be noted that none of these operations write out the file's
|
|
|
|
* metadata. So unless the application is strictly performing overwrites of
|
|
|
|
* already-instantiated disk blocks, there are no guarantees here that the data
|
|
|
|
* will be available after a crash.
|
|
|
|
*/
|
2009-01-14 14:14:02 +01:00
|
|
|
SYSCALL_DEFINE(sync_file_range)(int fd, loff_t offset, loff_t nbytes,
|
|
|
|
unsigned int flags)
|
2006-03-31 12:30:42 +02:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct file *file;
|
2009-12-17 14:24:40 +01:00
|
|
|
struct address_space *mapping;
|
2006-03-31 12:30:42 +02:00
|
|
|
loff_t endbyte; /* inclusive */
|
|
|
|
int fput_needed;
|
|
|
|
umode_t i_mode;
|
|
|
|
|
|
|
|
ret = -EINVAL;
|
|
|
|
if (flags & ~VALID_FLAGS)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
endbyte = offset + nbytes;
|
|
|
|
|
|
|
|
if ((s64)offset < 0)
|
|
|
|
goto out;
|
|
|
|
if ((s64)endbyte < 0)
|
|
|
|
goto out;
|
|
|
|
if (endbyte < offset)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (sizeof(pgoff_t) == 4) {
|
|
|
|
if (offset >= (0x100000000ULL << PAGE_CACHE_SHIFT)) {
|
|
|
|
/*
|
|
|
|
* The range starts outside a 32 bit machine's
|
|
|
|
* pagecache addressing capabilities. Let it "succeed"
|
|
|
|
*/
|
|
|
|
ret = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (endbyte >= (0x100000000ULL << PAGE_CACHE_SHIFT)) {
|
|
|
|
/*
|
|
|
|
* Out to EOF
|
|
|
|
*/
|
|
|
|
nbytes = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nbytes == 0)
|
[PATCH] writeback: fix range handling
When a writeback_control's `start' and `end' fields are used to
indicate a one-byte-range starting at file offset zero, the required
values of .start=0,.end=0 mean that the ->writepages() implementation
has no way of telling that it is being asked to perform a range
request. Because we're currently overloading (start == 0 && end == 0)
to mean "this is not a write-a-range request".
To make all this sane, the patch changes range of writeback_control.
So caller does: If it is calling ->writepages() to write pages, it
sets range (range_start/end or range_cyclic) always.
And if range_cyclic is true, ->writepages() thinks the range is
cyclic, otherwise it just uses range_start and range_end.
This patch does,
- Add LLONG_MAX, LLONG_MIN, ULLONG_MAX to include/linux/kernel.h
-1 is usually ok for range_end (type is long long). But, if someone did,
range_end += val; range_end is "val - 1"
u64val = range_end >> bits; u64val is "~(0ULL)"
or something, they are wrong. So, this adds LLONG_MAX to avoid nasty
things, and uses LLONG_MAX for range_end.
- All callers of ->writepages() sets range_start/end or range_cyclic.
- Fix updates of ->writeback_index. It seems already bit strange.
If it starts at 0 and ended by check of nr_to_write, this last
index may reduce chance to scan end of file. So, this updates
->writeback_index only if range_cyclic is true or whole-file is
scanned.
Signed-off-by: OGAWA Hirofumi <hirofumi@mail.parknet.co.jp>
Cc: Nathan Scott <nathans@sgi.com>
Cc: Anton Altaparmakov <aia21@cantab.net>
Cc: Steven French <sfrench@us.ibm.com>
Cc: "Vladimir V. Saveliev" <vs@namesys.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-06-23 11:03:26 +02:00
|
|
|
endbyte = LLONG_MAX;
|
2006-03-31 12:30:42 +02:00
|
|
|
else
|
|
|
|
endbyte--; /* inclusive */
|
|
|
|
|
|
|
|
ret = -EBADF;
|
|
|
|
file = fget_light(fd, &fput_needed);
|
|
|
|
if (!file)
|
|
|
|
goto out;
|
|
|
|
|
2006-12-08 11:36:35 +01:00
|
|
|
i_mode = file->f_path.dentry->d_inode->i_mode;
|
2006-03-31 12:30:42 +02:00
|
|
|
ret = -ESPIPE;
|
|
|
|
if (!S_ISREG(i_mode) && !S_ISBLK(i_mode) && !S_ISDIR(i_mode) &&
|
|
|
|
!S_ISLNK(i_mode))
|
|
|
|
goto out_put;
|
|
|
|
|
2009-12-17 14:24:40 +01:00
|
|
|
mapping = file->f_mapping;
|
|
|
|
if (!mapping) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
if (flags & SYNC_FILE_RANGE_WAIT_BEFORE) {
|
|
|
|
ret = filemap_fdatawait_range(mapping, offset, endbyte);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & SYNC_FILE_RANGE_WRITE) {
|
|
|
|
ret = filemap_fdatawrite_range(mapping, offset, endbyte);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_put;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flags & SYNC_FILE_RANGE_WAIT_AFTER)
|
|
|
|
ret = filemap_fdatawait_range(mapping, offset, endbyte);
|
|
|
|
|
2006-03-31 12:30:42 +02:00
|
|
|
out_put:
|
|
|
|
fput_light(file, fput_needed);
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
2009-01-14 14:14:02 +01:00
|
|
|
#ifdef CONFIG_HAVE_SYSCALL_WRAPPERS
|
|
|
|
asmlinkage long SyS_sync_file_range(long fd, loff_t offset, loff_t nbytes,
|
|
|
|
long flags)
|
|
|
|
{
|
|
|
|
return SYSC_sync_file_range((int) fd, offset, nbytes,
|
|
|
|
(unsigned int) flags);
|
|
|
|
}
|
|
|
|
SYSCALL_ALIAS(sys_sync_file_range, SyS_sync_file_range);
|
|
|
|
#endif
|
2006-03-31 12:30:42 +02:00
|
|
|
|
Introduce fixed sys_sync_file_range2() syscall, implement on PowerPC and ARM
Not all the world is an i386. Many architectures need 64-bit arguments to be
aligned in suitable pairs of registers, and the original
sys_sync_file_range(int, loff_t, loff_t, int) was therefore wasting an
argument register for padding after the first integer. Since we don't
normally have more than 6 arguments for system calls, that left no room for
the final argument on some architectures.
Fix this by introducing sys_sync_file_range2(int, int, loff_t, loff_t) which
all fits nicely. In fact, ARM already had that, but called it
sys_arm_sync_file_range. Move it to fs/sync.c and rename it, then implement
the needed compatibility routine. And stop the missing syscall check from
bitching about the absence of sys_sync_file_range() if we've implemented
sys_sync_file_range2() instead.
Tested on PPC32 and with 32-bit and 64-bit userspace on PPC64.
Signed-off-by: David Woodhouse <dwmw2@infradead.org>
Acked-by: Russell King <rmk+kernel@arm.linux.org.uk>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Paul Mackerras <paulus@samba.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-06-27 23:10:09 +02:00
|
|
|
/* It would be nice if people remember that not all the world's an i386
|
|
|
|
when they introduce new system calls */
|
2009-01-14 14:14:02 +01:00
|
|
|
SYSCALL_DEFINE(sync_file_range2)(int fd, unsigned int flags,
|
|
|
|
loff_t offset, loff_t nbytes)
|
Introduce fixed sys_sync_file_range2() syscall, implement on PowerPC and ARM
Not all the world is an i386. Many architectures need 64-bit arguments to be
aligned in suitable pairs of registers, and the original
sys_sync_file_range(int, loff_t, loff_t, int) was therefore wasting an
argument register for padding after the first integer. Since we don't
normally have more than 6 arguments for system calls, that left no room for
the final argument on some architectures.
Fix this by introducing sys_sync_file_range2(int, int, loff_t, loff_t) which
all fits nicely. In fact, ARM already had that, but called it
sys_arm_sync_file_range. Move it to fs/sync.c and rename it, then implement
the needed compatibility routine. And stop the missing syscall check from
bitching about the absence of sys_sync_file_range() if we've implemented
sys_sync_file_range2() instead.
Tested on PPC32 and with 32-bit and 64-bit userspace on PPC64.
Signed-off-by: David Woodhouse <dwmw2@infradead.org>
Acked-by: Russell King <rmk+kernel@arm.linux.org.uk>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Paul Mackerras <paulus@samba.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-06-27 23:10:09 +02:00
|
|
|
{
|
|
|
|
return sys_sync_file_range(fd, offset, nbytes, flags);
|
|
|
|
}
|
2009-01-14 14:14:02 +01:00
|
|
|
#ifdef CONFIG_HAVE_SYSCALL_WRAPPERS
|
|
|
|
asmlinkage long SyS_sync_file_range2(long fd, long flags,
|
|
|
|
loff_t offset, loff_t nbytes)
|
|
|
|
{
|
|
|
|
return SYSC_sync_file_range2((int) fd, (unsigned int) flags,
|
|
|
|
offset, nbytes);
|
|
|
|
}
|
|
|
|
SYSCALL_ALIAS(sys_sync_file_range2, SyS_sync_file_range2);
|
|
|
|
#endif
|