License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 17:07:57 +03:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* linux/fs/ext2/file.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1992, 1993, 1994, 1995
|
|
|
|
* Remy Card (card@masi.ibp.fr)
|
|
|
|
* Laboratoire MASI - Institut Blaise Pascal
|
|
|
|
* Universite Pierre et Marie Curie (Paris VI)
|
|
|
|
*
|
|
|
|
* from
|
|
|
|
*
|
|
|
|
* linux/fs/minix/file.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1991, 1992 Linus Torvalds
|
|
|
|
*
|
|
|
|
* ext2 fs regular file handling primitives
|
|
|
|
*
|
|
|
|
* 64-bit file support on 64-bit platforms by Jakub Jelinek
|
|
|
|
* (jj@sunsite.ms.mff.cuni.cz)
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/time.h>
|
2009-12-16 03:46:49 +03:00
|
|
|
#include <linux/pagemap.h>
|
2015-09-09 00:58:40 +03:00
|
|
|
#include <linux/dax.h>
|
2010-03-03 17:05:07 +03:00
|
|
|
#include <linux/quotaops.h>
|
2016-09-19 04:30:29 +03:00
|
|
|
#include <linux/iomap.h>
|
|
|
|
#include <linux/uio.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include "ext2.h"
|
|
|
|
#include "xattr.h"
|
|
|
|
#include "acl.h"
|
|
|
|
|
2015-02-17 02:59:25 +03:00
|
|
|
#ifdef CONFIG_FS_DAX
|
2016-09-19 04:30:29 +03:00
|
|
|
static ssize_t ext2_dax_read_iter(struct kiocb *iocb, struct iov_iter *to)
|
|
|
|
{
|
|
|
|
struct inode *inode = iocb->ki_filp->f_mapping->host;
|
|
|
|
ssize_t ret;
|
|
|
|
|
|
|
|
if (!iov_iter_count(to))
|
|
|
|
return 0; /* skip atime */
|
|
|
|
|
|
|
|
inode_lock_shared(inode);
|
2016-11-08 03:32:46 +03:00
|
|
|
ret = dax_iomap_rw(iocb, to, &ext2_iomap_ops);
|
2016-09-19 04:30:29 +03:00
|
|
|
inode_unlock_shared(inode);
|
|
|
|
|
|
|
|
file_accessed(iocb->ki_filp);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t ext2_dax_write_iter(struct kiocb *iocb, struct iov_iter *from)
|
|
|
|
{
|
|
|
|
struct file *file = iocb->ki_filp;
|
|
|
|
struct inode *inode = file->f_mapping->host;
|
|
|
|
ssize_t ret;
|
|
|
|
|
|
|
|
inode_lock(inode);
|
|
|
|
ret = generic_write_checks(iocb, from);
|
|
|
|
if (ret <= 0)
|
|
|
|
goto out_unlock;
|
|
|
|
ret = file_remove_privs(file);
|
|
|
|
if (ret)
|
|
|
|
goto out_unlock;
|
|
|
|
ret = file_update_time(file);
|
|
|
|
if (ret)
|
|
|
|
goto out_unlock;
|
|
|
|
|
2016-11-08 03:32:46 +03:00
|
|
|
ret = dax_iomap_rw(iocb, from, &ext2_iomap_ops);
|
2016-09-19 04:30:29 +03:00
|
|
|
if (ret > 0 && iocb->ki_pos > i_size_read(inode)) {
|
|
|
|
i_size_write(inode, iocb->ki_pos);
|
|
|
|
mark_inode_dirty(inode);
|
|
|
|
}
|
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
inode_unlock(inode);
|
|
|
|
if (ret > 0)
|
|
|
|
ret = generic_write_sync(iocb, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2015-10-14 01:25:37 +03:00
|
|
|
/*
|
|
|
|
* The lock ordering for ext2 DAX fault paths is:
|
|
|
|
*
|
2020-06-09 07:33:54 +03:00
|
|
|
* mmap_lock (MM)
|
2015-10-14 01:25:37 +03:00
|
|
|
* sb_start_pagefault (vfs, freeze)
|
|
|
|
* ext2_inode_info->dax_sem
|
|
|
|
* address_space->i_mmap_rwsem or page_lock (mutually exclusive in DAX)
|
|
|
|
* ext2_inode_info->truncate_mutex
|
|
|
|
*
|
|
|
|
* The default page_lock and i_size verification done by non-DAX fault paths
|
|
|
|
* is sufficient because ext2 doesn't support hole punching.
|
|
|
|
*/
|
2018-04-14 22:33:42 +03:00
|
|
|
static vm_fault_t ext2_dax_fault(struct vm_fault *vmf)
|
2015-02-17 02:59:02 +03:00
|
|
|
{
|
2017-02-25 01:56:41 +03:00
|
|
|
struct inode *inode = file_inode(vmf->vma->vm_file);
|
2015-10-14 01:25:37 +03:00
|
|
|
struct ext2_inode_info *ei = EXT2_I(inode);
|
2018-04-14 22:33:42 +03:00
|
|
|
vm_fault_t ret;
|
2020-09-05 15:12:01 +03:00
|
|
|
bool write = (vmf->flags & FAULT_FLAG_WRITE) &&
|
|
|
|
(vmf->vma->vm_flags & VM_SHARED);
|
2015-10-14 01:25:37 +03:00
|
|
|
|
2020-09-05 15:12:01 +03:00
|
|
|
if (write) {
|
2015-10-14 01:25:37 +03:00
|
|
|
sb_start_pagefault(inode->i_sb);
|
2017-02-25 01:56:41 +03:00
|
|
|
file_update_time(vmf->vma->vm_file);
|
2015-10-14 01:25:37 +03:00
|
|
|
}
|
|
|
|
down_read(&ei->dax_sem);
|
|
|
|
|
2018-01-08 00:38:43 +03:00
|
|
|
ret = dax_iomap_fault(vmf, PE_SIZE_PTE, NULL, NULL, &ext2_iomap_ops);
|
2015-10-14 01:25:37 +03:00
|
|
|
|
|
|
|
up_read(&ei->dax_sem);
|
2020-09-05 15:12:01 +03:00
|
|
|
if (write)
|
2015-10-14 01:25:37 +03:00
|
|
|
sb_end_pagefault(inode->i_sb);
|
|
|
|
return ret;
|
2015-02-17 02:59:02 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct vm_operations_struct ext2_dax_vm_ops = {
|
|
|
|
.fault = ext2_dax_fault,
|
2016-11-08 03:31:33 +03:00
|
|
|
/*
|
mm,fs,dax: change ->pmd_fault to ->huge_fault
Patch series "1G transparent hugepage support for device dax", v2.
The following series implements support for 1G trasparent hugepage on
x86 for device dax. The bulk of the code was written by Mathew Wilcox a
while back supporting transparent 1G hugepage for fs DAX. I have
forward ported the relevant bits to 4.10-rc. The current submission has
only the necessary code to support device DAX.
Comments from Dan Williams: So the motivation and intended user of this
functionality mirrors the motivation and users of 1GB page support in
hugetlbfs. Given expected capacities of persistent memory devices an
in-memory database may want to reduce tlb pressure beyond what they can
already achieve with 2MB mappings of a device-dax file. We have
customer feedback to that effect as Willy mentioned in his previous
version of these patches [1].
[1]: https://lkml.org/lkml/2016/1/31/52
Comments from Nilesh @ Oracle:
There are applications which have a process model; and if you assume
10,000 processes attempting to mmap all the 6TB memory available on a
server; we are looking at the following:
processes : 10,000
memory : 6TB
pte @ 4k page size: 8 bytes / 4K of memory * #processes = 6TB / 4k * 8 * 10000 = 1.5GB * 80000 = 120,000GB
pmd @ 2M page size: 120,000 / 512 = ~240GB
pud @ 1G page size: 240GB / 512 = ~480MB
As you can see with 2M pages, this system will use up an exorbitant
amount of DRAM to hold the page tables; but the 1G pages finally brings
it down to a reasonable level. Memory sizes will keep increasing; so
this number will keep increasing.
An argument can be made to convert the applications from process model
to thread model, but in the real world that may not be always practical.
Hopefully this helps explain the use case where this is valuable.
This patch (of 3):
In preparation for adding the ability to handle PUD pages, convert
vm_operations_struct.pmd_fault to vm_operations_struct.huge_fault. The
vm_fault structure is extended to include a union of the different page
table pointers that may be needed, and three flag bits are reserved to
indicate which type of pointer is in the union.
[ross.zwisler@linux.intel.com: remove unused function ext4_dax_huge_fault()]
Link: http://lkml.kernel.org/r/1485813172-7284-1-git-send-email-ross.zwisler@linux.intel.com
[dave.jiang@intel.com: clear PMD or PUD size flags when in fall through path]
Link: http://lkml.kernel.org/r/148589842696.5820.16078080610311444794.stgit@djiang5-desk3.ch.intel.com
Link: http://lkml.kernel.org/r/148545058784.17912.6353162518188733642.stgit@djiang5-desk3.ch.intel.com
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com>
Signed-off-by: Dave Jiang <dave.jiang@intel.com>
Signed-off-by: Ross Zwisler <ross.zwisler@linux.intel.com>
Cc: Dave Hansen <dave.hansen@linux.intel.com>
Cc: Vlastimil Babka <vbabka@suse.cz>
Cc: Jan Kara <jack@suse.com>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com>
Cc: Nilesh Choudhury <nilesh.choudhury@oracle.com>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Dave Jiang <dave.jiang@intel.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2017-02-25 01:56:59 +03:00
|
|
|
* .huge_fault is not supported for DAX because allocation in ext2
|
2016-11-08 03:31:33 +03:00
|
|
|
* cannot be reliably aligned to huge page sizes and so pmd faults
|
|
|
|
* will always fail and fail back to regular faults.
|
|
|
|
*/
|
2016-02-27 22:01:13 +03:00
|
|
|
.page_mkwrite = ext2_dax_fault,
|
dax: use common 4k zero page for dax mmap reads
When servicing mmap() reads from file holes the current DAX code
allocates a page cache page of all zeroes and places the struct page
pointer in the mapping->page_tree radix tree.
This has three major drawbacks:
1) It consumes memory unnecessarily. For every 4k page that is read via
a DAX mmap() over a hole, we allocate a new page cache page. This
means that if you read 1GiB worth of pages, you end up using 1GiB of
zeroed memory. This is easily visible by looking at the overall
memory consumption of the system or by looking at /proc/[pid]/smaps:
7f62e72b3000-7f63272b3000 rw-s 00000000 103:00 12 /root/dax/data
Size: 1048576 kB
Rss: 1048576 kB
Pss: 1048576 kB
Shared_Clean: 0 kB
Shared_Dirty: 0 kB
Private_Clean: 1048576 kB
Private_Dirty: 0 kB
Referenced: 1048576 kB
Anonymous: 0 kB
LazyFree: 0 kB
AnonHugePages: 0 kB
ShmemPmdMapped: 0 kB
Shared_Hugetlb: 0 kB
Private_Hugetlb: 0 kB
Swap: 0 kB
SwapPss: 0 kB
KernelPageSize: 4 kB
MMUPageSize: 4 kB
Locked: 0 kB
2) It is slower than using a common zero page because each page fault
has more work to do. Instead of just inserting a common zero page we
have to allocate a page cache page, zero it, and then insert it. Here
are the average latencies of dax_load_hole() as measured by ftrace on
a random test box:
Old method, using zeroed page cache pages: 3.4 us
New method, using the common 4k zero page: 0.8 us
This was the average latency over 1 GiB of sequential reads done by
this simple fio script:
[global]
size=1G
filename=/root/dax/data
fallocate=none
[io]
rw=read
ioengine=mmap
3) The fact that we had to check for both DAX exceptional entries and
for page cache pages in the radix tree made the DAX code more
complex.
Solve these issues by following the lead of the DAX PMD code and using a
common 4k zero page instead. As with the PMD code we will now insert a
DAX exceptional entry into the radix tree instead of a struct page
pointer which allows us to remove all the special casing in the DAX
code.
Note that we do still pretty aggressively check for regular pages in the
DAX radix tree, especially where we take action based on the bits set in
the page. If we ever find a regular page in our radix tree now that
most likely means that someone besides DAX is inserting pages (which has
happened lots of times in the past), and we want to find that out early
and fail loudly.
This solution also removes the extra memory consumption. Here is that
same /proc/[pid]/smaps after 1GiB of reading from a hole with the new
code:
7f2054a74000-7f2094a74000 rw-s 00000000 103:00 12 /root/dax/data
Size: 1048576 kB
Rss: 0 kB
Pss: 0 kB
Shared_Clean: 0 kB
Shared_Dirty: 0 kB
Private_Clean: 0 kB
Private_Dirty: 0 kB
Referenced: 0 kB
Anonymous: 0 kB
LazyFree: 0 kB
AnonHugePages: 0 kB
ShmemPmdMapped: 0 kB
Shared_Hugetlb: 0 kB
Private_Hugetlb: 0 kB
Swap: 0 kB
SwapPss: 0 kB
KernelPageSize: 4 kB
MMUPageSize: 4 kB
Locked: 0 kB
Overall system memory consumption is similarly improved.
Another major change is that we remove dax_pfn_mkwrite() from our fault
flow, and instead rely on the page fault itself to make the PTE dirty
and writeable. The following description from the patch adding the
vm_insert_mixed_mkwrite() call explains this a little more:
"To be able to use the common 4k zero page in DAX we need to have our
PTE fault path look more like our PMD fault path where a PTE entry
can be marked as dirty and writeable as it is first inserted rather
than waiting for a follow-up dax_pfn_mkwrite() =>
finish_mkwrite_fault() call.
Right now we can rely on having a dax_pfn_mkwrite() call because we
can distinguish between these two cases in do_wp_page():
case 1: 4k zero page => writable DAX storage
case 2: read-only DAX storage => writeable DAX storage
This distinction is made by via vm_normal_page(). vm_normal_page()
returns false for the common 4k zero page, though, just as it does
for DAX ptes. Instead of special casing the DAX + 4k zero page case
we will simplify our DAX PTE page fault sequence so that it matches
our DAX PMD sequence, and get rid of the dax_pfn_mkwrite() helper.
We will instead use dax_iomap_fault() to handle write-protection
faults.
This means that insert_pfn() needs to follow the lead of
insert_pfn_pmd() and allow us to pass in a 'mkwrite' flag. If
'mkwrite' is set insert_pfn() will do the work that was previously
done by wp_page_reuse() as part of the dax_pfn_mkwrite() call path"
Link: http://lkml.kernel.org/r/20170724170616.25810-4-ross.zwisler@linux.intel.com
Signed-off-by: Ross Zwisler <ross.zwisler@linux.intel.com>
Reviewed-by: Jan Kara <jack@suse.cz>
Cc: "Darrick J. Wong" <darrick.wong@oracle.com>
Cc: "Theodore Ts'o" <tytso@mit.edu>
Cc: Alexander Viro <viro@zeniv.linux.org.uk>
Cc: Andreas Dilger <adilger.kernel@dilger.ca>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Dave Chinner <david@fromorbit.com>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Jonathan Corbet <corbet@lwn.net>
Cc: Matthew Wilcox <mawilcox@microsoft.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
Cc: Kirill A. Shutemov <kirill.shutemov@linux.intel.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2017-09-07 02:18:43 +03:00
|
|
|
.pfn_mkwrite = ext2_dax_fault,
|
2015-02-17 02:59:02 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
static int ext2_file_mmap(struct file *file, struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
if (!IS_DAX(file_inode(file)))
|
|
|
|
return generic_file_mmap(file, vma);
|
|
|
|
|
|
|
|
file_accessed(file);
|
|
|
|
vma->vm_ops = &ext2_dax_vm_ops;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
#define ext2_file_mmap generic_file_mmap
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
2007-07-16 10:40:22 +04:00
|
|
|
* Called when filp is released. This happens when all file descriptors
|
|
|
|
* for a single struct file are closed. Note that different open() calls
|
|
|
|
* for the same file yield different struct file structures.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
|
|
|
static int ext2_release_file (struct inode * inode, struct file * filp)
|
|
|
|
{
|
2007-10-17 10:30:46 +04:00
|
|
|
if (filp->f_mode & FMODE_WRITE) {
|
|
|
|
mutex_lock(&EXT2_I(inode)->truncate_mutex);
|
|
|
|
ext2_discard_reservation(inode);
|
|
|
|
mutex_unlock(&EXT2_I(inode)->truncate_mutex);
|
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-07-17 04:44:56 +04:00
|
|
|
int ext2_fsync(struct file *file, loff_t start, loff_t end, int datasync)
|
2009-12-16 03:46:49 +03:00
|
|
|
{
|
|
|
|
int ret;
|
2010-05-26 19:53:25 +04:00
|
|
|
struct super_block *sb = file->f_mapping->host->i_sb;
|
2009-12-16 03:46:49 +03:00
|
|
|
|
2011-07-17 04:44:56 +04:00
|
|
|
ret = generic_file_fsync(file, start, end, datasync);
|
2017-07-06 14:02:21 +03:00
|
|
|
if (ret == -EIO)
|
2009-12-16 03:46:49 +03:00
|
|
|
/* We don't really know where the IO error happened... */
|
|
|
|
ext2_error(sb, __func__,
|
|
|
|
"detected IO error when writing metadata buffers");
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-09-19 04:30:29 +03:00
|
|
|
static ssize_t ext2_file_read_iter(struct kiocb *iocb, struct iov_iter *to)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_FS_DAX
|
|
|
|
if (IS_DAX(iocb->ki_filp->f_mapping->host))
|
|
|
|
return ext2_dax_read_iter(iocb, to);
|
|
|
|
#endif
|
|
|
|
return generic_file_read_iter(iocb, to);
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t ext2_file_write_iter(struct kiocb *iocb, struct iov_iter *from)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_FS_DAX
|
|
|
|
if (IS_DAX(iocb->ki_filp->f_mapping->host))
|
|
|
|
return ext2_dax_write_iter(iocb, from);
|
|
|
|
#endif
|
|
|
|
return generic_file_write_iter(iocb, from);
|
|
|
|
}
|
|
|
|
|
2006-03-28 13:56:42 +04:00
|
|
|
const struct file_operations ext2_file_operations = {
|
2005-04-17 02:20:36 +04:00
|
|
|
.llseek = generic_file_llseek,
|
2016-09-19 04:30:29 +03:00
|
|
|
.read_iter = ext2_file_read_iter,
|
|
|
|
.write_iter = ext2_file_write_iter,
|
2008-02-06 12:40:10 +03:00
|
|
|
.unlocked_ioctl = ext2_ioctl,
|
2006-08-29 22:06:20 +04:00
|
|
|
#ifdef CONFIG_COMPAT
|
|
|
|
.compat_ioctl = ext2_compat_ioctl,
|
|
|
|
#endif
|
2015-02-17 02:59:02 +03:00
|
|
|
.mmap = ext2_file_mmap,
|
2010-03-03 17:05:06 +03:00
|
|
|
.open = dquot_file_open,
|
2005-04-17 02:20:36 +04:00
|
|
|
.release = ext2_release_file,
|
2009-12-16 03:46:49 +03:00
|
|
|
.fsync = ext2_fsync,
|
2016-10-08 02:59:59 +03:00
|
|
|
.get_unmapped_area = thp_get_unmapped_area,
|
2006-03-30 17:15:30 +04:00
|
|
|
.splice_read = generic_file_splice_read,
|
2014-04-05 12:27:08 +04:00
|
|
|
.splice_write = iter_file_splice_write,
|
2005-04-17 02:20:36 +04:00
|
|
|
};
|
|
|
|
|
2007-02-12 11:55:38 +03:00
|
|
|
const struct inode_operations ext2_file_inode_operations = {
|
2005-04-17 02:20:36 +04:00
|
|
|
.listxattr = ext2_listxattr,
|
2019-02-18 04:07:02 +03:00
|
|
|
.getattr = ext2_getattr,
|
2005-04-17 02:20:36 +04:00
|
|
|
.setattr = ext2_setattr,
|
2011-07-23 19:37:31 +04:00
|
|
|
.get_acl = ext2_get_acl,
|
2013-12-20 17:16:44 +04:00
|
|
|
.set_acl = ext2_set_acl,
|
2008-10-04 01:32:43 +04:00
|
|
|
.fiemap = ext2_fiemap,
|
2005-04-17 02:20:36 +04:00
|
|
|
};
|