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 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/include/linux/nfs_page.h
|
|
|
|
*
|
|
|
|
* Copyright (C) 2000 Trond Myklebust
|
|
|
|
*
|
|
|
|
* NFS page cache wrapper.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _LINUX_NFS_PAGE_H
|
|
|
|
#define _LINUX_NFS_PAGE_H
|
|
|
|
|
|
|
|
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
#include <linux/wait.h>
|
|
|
|
#include <linux/sunrpc/auth.h>
|
|
|
|
#include <linux/nfs_xdr.h>
|
|
|
|
|
2007-06-17 17:26:38 +00:00
|
|
|
#include <linux/kref.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Valid flags for a dirty buffer
|
|
|
|
*/
|
2008-06-13 17:25:22 +00:00
|
|
|
enum {
|
2014-05-15 15:56:41 +00:00
|
|
|
PG_BUSY = 0, /* nfs_{un}lock_request */
|
|
|
|
PG_MAPPED, /* page private set for buffered io */
|
2023-01-19 21:33:35 +00:00
|
|
|
PG_FOLIO, /* Tracking a folio (unset for O_DIRECT) */
|
2014-05-15 15:56:41 +00:00
|
|
|
PG_CLEAN, /* write succeeded */
|
|
|
|
PG_COMMIT_TO_DS, /* used by pnfs layouts */
|
2014-07-18 00:42:16 +00:00
|
|
|
PG_INODE_REF, /* extra ref held by inode when in writeback */
|
2014-05-15 15:56:45 +00:00
|
|
|
PG_HEADLOCK, /* page group lock of wb_head */
|
|
|
|
PG_TEARDOWN, /* page group sync for destroy */
|
2014-05-15 15:56:46 +00:00
|
|
|
PG_UNLOCKPAGE, /* page group sync bit in read path */
|
|
|
|
PG_UPTODATE, /* page group sync bit in read path */
|
2014-05-15 15:56:47 +00:00
|
|
|
PG_WB_END, /* page group sync bit in write path */
|
|
|
|
PG_REMOVE, /* page group sync bit in write path */
|
2017-07-11 21:53:48 +00:00
|
|
|
PG_CONTENDED1, /* Is someone waiting for a lock? */
|
|
|
|
PG_CONTENDED2, /* Is someone waiting for a lock? */
|
2008-06-13 17:25:22 +00:00
|
|
|
};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2005-06-22 17:16:31 +00:00
|
|
|
struct nfs_inode;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct nfs_page {
|
2012-03-08 22:29:35 +00:00
|
|
|
struct list_head wb_list; /* Defines state of page: */
|
2023-01-19 21:33:35 +00:00
|
|
|
union {
|
|
|
|
struct page *wb_page; /* page to read in/write out */
|
|
|
|
struct folio *wb_folio;
|
|
|
|
};
|
2010-06-25 20:35:53 +00:00
|
|
|
struct nfs_lock_context *wb_lock_context; /* lock context info */
|
2016-04-01 12:29:48 +00:00
|
|
|
pgoff_t wb_index; /* Offset >> PAGE_SHIFT */
|
|
|
|
unsigned int wb_offset, /* Offset & ~PAGE_MASK */
|
2005-04-16 22:20:36 +00:00
|
|
|
wb_pgbase, /* Start of page data */
|
|
|
|
wb_bytes; /* Length of request */
|
2007-06-17 17:26:38 +00:00
|
|
|
struct kref wb_kref; /* reference count */
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned long wb_flags;
|
2012-06-08 15:56:09 +00:00
|
|
|
struct nfs_write_verifier wb_verf; /* Commit cookie */
|
2014-05-15 15:56:45 +00:00
|
|
|
struct nfs_page *wb_this_page; /* list of reqs for this page */
|
|
|
|
struct nfs_page *wb_head; /* head pointer for req list */
|
2019-04-07 17:59:08 +00:00
|
|
|
unsigned short wb_nio; /* Number of I/O attempts */
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2020-11-15 22:37:37 +00:00
|
|
|
struct nfs_pgio_mirror;
|
2011-06-10 17:30:23 +00:00
|
|
|
struct nfs_pageio_descriptor;
|
|
|
|
struct nfs_pageio_ops {
|
2011-06-10 17:30:23 +00:00
|
|
|
void (*pg_init)(struct nfs_pageio_descriptor *, struct nfs_page *);
|
2014-05-15 15:56:43 +00:00
|
|
|
size_t (*pg_test)(struct nfs_pageio_descriptor *, struct nfs_page *,
|
|
|
|
struct nfs_page *);
|
2011-06-10 17:30:23 +00:00
|
|
|
int (*pg_doio)(struct nfs_pageio_descriptor *);
|
2014-09-19 14:55:07 +00:00
|
|
|
unsigned int (*pg_get_mirror_count)(struct nfs_pageio_descriptor *,
|
|
|
|
struct nfs_page *);
|
2014-09-10 19:44:18 +00:00
|
|
|
void (*pg_cleanup)(struct nfs_pageio_descriptor *);
|
2020-11-15 22:37:37 +00:00
|
|
|
struct nfs_pgio_mirror *
|
|
|
|
(*pg_get_mirror)(struct nfs_pageio_descriptor *, u32);
|
|
|
|
u32 (*pg_set_mirror)(struct nfs_pageio_descriptor *, u32);
|
2011-06-10 17:30:23 +00:00
|
|
|
};
|
|
|
|
|
2014-05-06 13:12:30 +00:00
|
|
|
struct nfs_rw_ops {
|
2014-06-09 15:48:33 +00:00
|
|
|
struct nfs_pgio_header *(*rw_alloc_header)(void);
|
|
|
|
void (*rw_free_header)(struct nfs_pgio_header *);
|
2014-06-09 15:48:35 +00:00
|
|
|
int (*rw_done)(struct rpc_task *, struct nfs_pgio_header *,
|
|
|
|
struct inode *);
|
|
|
|
void (*rw_result)(struct rpc_task *, struct nfs_pgio_header *);
|
|
|
|
void (*rw_initiate)(struct nfs_pgio_header *, struct rpc_message *,
|
2014-06-09 20:12:20 +00:00
|
|
|
const struct nfs_rpc_ops *,
|
2014-05-06 13:12:37 +00:00
|
|
|
struct rpc_task_setup *, int);
|
2014-05-06 13:12:30 +00:00
|
|
|
};
|
|
|
|
|
2014-09-19 14:55:07 +00:00
|
|
|
struct nfs_pgio_mirror {
|
2007-04-02 22:48:28 +00:00
|
|
|
struct list_head pg_list;
|
2007-04-02 22:48:28 +00:00
|
|
|
unsigned long pg_bytes_written;
|
2007-04-02 22:48:28 +00:00
|
|
|
size_t pg_count;
|
|
|
|
size_t pg_bsize;
|
|
|
|
unsigned int pg_base;
|
2014-09-19 14:55:07 +00:00
|
|
|
unsigned char pg_recoalesce : 1;
|
|
|
|
};
|
2007-04-02 22:48:28 +00:00
|
|
|
|
2014-09-19 14:55:07 +00:00
|
|
|
struct nfs_pageio_descriptor {
|
2007-04-02 22:48:28 +00:00
|
|
|
struct inode *pg_inode;
|
2011-06-10 17:30:23 +00:00
|
|
|
const struct nfs_pageio_ops *pg_ops;
|
2014-05-06 13:12:30 +00:00
|
|
|
const struct nfs_rw_ops *pg_rw_ops;
|
2007-04-02 22:48:28 +00:00
|
|
|
int pg_ioflags;
|
|
|
|
int pg_error;
|
2011-07-12 17:42:02 +00:00
|
|
|
const struct rpc_call_ops *pg_rpc_callops;
|
2012-04-20 18:47:48 +00:00
|
|
|
const struct nfs_pgio_completion_ops *pg_completion_ops;
|
2011-03-01 01:34:14 +00:00
|
|
|
struct pnfs_layout_segment *pg_lseg;
|
2017-06-20 23:35:37 +00:00
|
|
|
struct nfs_io_completion *pg_io_completion;
|
2012-04-20 18:47:51 +00:00
|
|
|
struct nfs_direct_req *pg_dreq;
|
NFS: Convert buffered read paths to use netfs when fscache is enabled
Convert the NFS buffered read code paths to corresponding netfs APIs,
but only when fscache is configured and enabled.
The netfs API defines struct netfs_request_ops which must be filled
in by the network filesystem. For NFS, we only need to define 5 of
the functions, the main one being the issue_read() function.
The issue_read() function is called by the netfs layer when a read
cannot be fulfilled locally, and must be sent to the server (either
the cache is not active, or it is active but the data is not available).
Once the read from the server is complete, netfs requires a call to
netfs_subreq_terminated() which conveys either how many bytes were read
successfully, or an error. Note that issue_read() is called with a
structure, netfs_io_subrequest, which defines the IO requested, and
contains a start and a length (both in bytes), and assumes the underlying
netfs will return a either an error on the whole region, or the number
of bytes successfully read.
The NFS IO path is page based and the main APIs are the pgio APIs defined
in pagelist.c. For the pgio APIs, there is no way for the caller to
know how many RPCs will be sent and how the pages will be broken up
into underlying RPCs, each of which will have their own completion and
return code. In contrast, netfs is subrequest based, a single
subrequest may contain multiple pages, and a single subrequest is
initiated with issue_read() and terminated with netfs_subreq_terminated().
Thus, to utilze the netfs APIs, NFS needs some way to accommodate
the netfs API requirement on the single response to the whole
subrequest, while also minimizing disruptive changes to the NFS
pgio layer.
The approach taken with this patch is to allocate a small structure
for each nfs_netfs_issue_read() call, store the final error and number
of bytes successfully transferred in the structure, and update these values
as each RPC completes. The refcount on the structure is used as a marker
for the last RPC completion, is incremented in nfs_netfs_read_initiate(),
and decremented inside nfs_netfs_read_completion(), when a nfs_pgio_header
contains a valid pointer to the data. On the final put (which signals
the final outstanding RPC is complete) in nfs_netfs_read_completion(),
call netfs_subreq_terminated() with either the final error value (if
one or more READs complete with an error) or the number of bytes
successfully transferred (if all RPCs complete successfully). Note
that when all RPCs complete successfully, the number of bytes transferred
is capped to the length of the subrequest. Capping the transferred length
to the subrequest length prevents "Subreq overread" warnings from netfs.
This is due to the "aligned_len" in nfs_pageio_add_page(), and the
corner case where NFS requests a full page at the end of the file,
even when i_size reflects only a partial page (NFS overread).
Signed-off-by: Dave Wysochanski <dwysocha@redhat.com>
Tested-by: Daire Byrne <daire@dneg.com>
Signed-off-by: Anna Schumaker <Anna.Schumaker@Netapp.com>
2023-02-20 13:43:06 +00:00
|
|
|
#ifdef CONFIG_NFS_FSCACHE
|
|
|
|
void *pg_netfs;
|
|
|
|
#endif
|
2014-09-19 14:55:07 +00:00
|
|
|
unsigned int pg_bsize; /* default bsize for mirrors */
|
|
|
|
|
|
|
|
u32 pg_mirror_count;
|
|
|
|
struct nfs_pgio_mirror *pg_mirrors;
|
|
|
|
struct nfs_pgio_mirror pg_mirrors_static[1];
|
|
|
|
struct nfs_pgio_mirror *pg_mirrors_dynamic;
|
|
|
|
u32 pg_mirror_idx; /* current mirror */
|
2019-04-07 17:59:08 +00:00
|
|
|
unsigned short pg_maxretrans;
|
|
|
|
unsigned char pg_moreio : 1;
|
2007-04-02 22:48:28 +00:00
|
|
|
};
|
|
|
|
|
2014-09-19 14:55:07 +00:00
|
|
|
/* arbitrarily selected limit to number of mirrors */
|
|
|
|
#define NFS_PAGEIO_DESCRIPTOR_MIRROR_MAX 16
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#define NFS_WBACK_BUSY(req) (test_bit(PG_BUSY,&(req)->wb_flags))
|
|
|
|
|
2023-01-19 21:33:47 +00:00
|
|
|
extern struct nfs_page *nfs_page_create_from_page(struct nfs_open_context *ctx,
|
|
|
|
struct page *page,
|
|
|
|
unsigned int pgbase,
|
|
|
|
loff_t offset,
|
|
|
|
unsigned int count);
|
2023-01-19 21:33:41 +00:00
|
|
|
extern struct nfs_page *nfs_page_create_from_folio(struct nfs_open_context *ctx,
|
|
|
|
struct folio *folio,
|
|
|
|
unsigned int offset,
|
|
|
|
unsigned int count);
|
2014-05-15 15:56:45 +00:00
|
|
|
extern void nfs_release_request(struct nfs_page *);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
2007-04-02 22:48:28 +00:00
|
|
|
extern void nfs_pageio_init(struct nfs_pageio_descriptor *desc,
|
|
|
|
struct inode *inode,
|
2011-06-10 17:30:23 +00:00
|
|
|
const struct nfs_pageio_ops *pg_ops,
|
2012-04-20 18:47:48 +00:00
|
|
|
const struct nfs_pgio_completion_ops *compl_ops,
|
2014-05-06 13:12:30 +00:00
|
|
|
const struct nfs_rw_ops *rw_ops,
|
2007-04-02 22:48:28 +00:00
|
|
|
size_t bsize,
|
2017-08-20 15:33:25 +00:00
|
|
|
int how);
|
2007-04-02 22:48:28 +00:00
|
|
|
extern int nfs_pageio_add_request(struct nfs_pageio_descriptor *,
|
|
|
|
struct nfs_page *);
|
2014-06-09 15:48:38 +00:00
|
|
|
extern int nfs_pageio_resend(struct nfs_pageio_descriptor *,
|
|
|
|
struct nfs_pgio_header *);
|
2007-04-02 22:48:28 +00:00
|
|
|
extern void nfs_pageio_complete(struct nfs_pageio_descriptor *desc);
|
2007-05-20 14:18:27 +00:00
|
|
|
extern void nfs_pageio_cond_complete(struct nfs_pageio_descriptor *, pgoff_t);
|
2014-05-15 15:56:43 +00:00
|
|
|
extern size_t nfs_generic_pg_test(struct nfs_pageio_descriptor *desc,
|
2011-06-19 22:33:46 +00:00
|
|
|
struct nfs_page *prev,
|
|
|
|
struct nfs_page *req);
|
2005-04-16 22:20:36 +00:00
|
|
|
extern int nfs_wait_on_request(struct nfs_page *);
|
|
|
|
extern void nfs_unlock_request(struct nfs_page *req);
|
2014-05-15 15:56:45 +00:00
|
|
|
extern void nfs_unlock_and_release_request(struct nfs_page *);
|
2020-03-30 16:40:47 +00:00
|
|
|
extern struct nfs_page *nfs_page_group_lock_head(struct nfs_page *req);
|
2020-03-30 15:12:16 +00:00
|
|
|
extern int nfs_page_group_lock_subrequests(struct nfs_page *head);
|
2023-09-04 16:34:40 +00:00
|
|
|
extern void nfs_join_page_group(struct nfs_page *head,
|
|
|
|
struct nfs_commit_info *cinfo,
|
|
|
|
struct inode *inode);
|
2017-07-17 14:54:14 +00:00
|
|
|
extern int nfs_page_group_lock(struct nfs_page *);
|
2014-05-15 15:56:45 +00:00
|
|
|
extern void nfs_page_group_unlock(struct nfs_page *);
|
|
|
|
extern bool nfs_page_group_sync_on_bit(struct nfs_page *, unsigned int);
|
2020-04-01 17:04:49 +00:00
|
|
|
extern int nfs_page_set_headlock(struct nfs_page *req);
|
|
|
|
extern void nfs_page_clear_headlock(struct nfs_page *req);
|
2017-04-11 16:50:10 +00:00
|
|
|
extern bool nfs_async_iocounter_wait(struct rpc_task *, struct nfs_lock_context *);
|
2005-06-22 17:16:30 +00:00
|
|
|
|
2023-01-19 21:33:35 +00:00
|
|
|
/**
|
|
|
|
* nfs_page_to_folio - Retrieve a struct folio for the request
|
|
|
|
* @req: pointer to a struct nfs_page
|
|
|
|
*
|
|
|
|
* If a folio was assigned to @req, then return it, otherwise return NULL.
|
|
|
|
*/
|
|
|
|
static inline struct folio *nfs_page_to_folio(const struct nfs_page *req)
|
|
|
|
{
|
|
|
|
if (test_bit(PG_FOLIO, &req->wb_flags))
|
|
|
|
return req->wb_folio;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* nfs_page_to_page - Retrieve a struct page for the request
|
|
|
|
* @req: pointer to a struct nfs_page
|
|
|
|
* @pgbase: folio byte offset
|
|
|
|
*
|
|
|
|
* Return the page containing the byte that is at offset @pgbase relative
|
|
|
|
* to the start of the folio.
|
|
|
|
* Note: The request starts at offset @req->wb_pgbase.
|
|
|
|
*/
|
|
|
|
static inline struct page *nfs_page_to_page(const struct nfs_page *req,
|
|
|
|
size_t pgbase)
|
|
|
|
{
|
|
|
|
struct folio *folio = nfs_page_to_folio(req);
|
|
|
|
|
|
|
|
if (folio == NULL)
|
|
|
|
return req->wb_page;
|
|
|
|
return folio_page(folio, pgbase >> PAGE_SHIFT);
|
|
|
|
}
|
|
|
|
|
2023-01-19 21:33:38 +00:00
|
|
|
/**
|
|
|
|
* nfs_page_to_inode - Retrieve an inode for the request
|
|
|
|
* @req: pointer to a struct nfs_page
|
|
|
|
*/
|
|
|
|
static inline struct inode *nfs_page_to_inode(const struct nfs_page *req)
|
|
|
|
{
|
|
|
|
struct folio *folio = nfs_page_to_folio(req);
|
|
|
|
|
|
|
|
if (folio == NULL)
|
|
|
|
return page_file_mapping(req->wb_page)->host;
|
|
|
|
return folio_file_mapping(folio)->host;
|
|
|
|
}
|
|
|
|
|
2023-01-19 21:33:37 +00:00
|
|
|
/**
|
|
|
|
* nfs_page_max_length - Retrieve the maximum possible length for a request
|
|
|
|
* @req: pointer to a struct nfs_page
|
|
|
|
*
|
|
|
|
* Returns the maximum possible length of a request
|
|
|
|
*/
|
|
|
|
static inline size_t nfs_page_max_length(const struct nfs_page *req)
|
|
|
|
{
|
|
|
|
struct folio *folio = nfs_page_to_folio(req);
|
|
|
|
|
|
|
|
if (folio == NULL)
|
|
|
|
return PAGE_SIZE;
|
|
|
|
return folio_size(folio);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2012-05-09 17:19:15 +00:00
|
|
|
* Lock the page of an asynchronous request
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2012-03-15 21:16:40 +00:00
|
|
|
static inline int
|
|
|
|
nfs_lock_request(struct nfs_page *req)
|
|
|
|
{
|
2012-05-09 17:19:15 +00:00
|
|
|
return !test_and_set_bit(PG_BUSY, &req->wb_flags);
|
2012-03-15 21:16:40 +00:00
|
|
|
}
|
|
|
|
|
2005-06-22 17:16:31 +00:00
|
|
|
/**
|
|
|
|
* nfs_list_add_request - Insert a request into a list
|
|
|
|
* @req: request
|
|
|
|
* @head: head of list into which to insert the request.
|
|
|
|
*/
|
|
|
|
static inline void
|
|
|
|
nfs_list_add_request(struct nfs_page *req, struct list_head *head)
|
|
|
|
{
|
|
|
|
list_add_tail(&req->wb_list, head);
|
|
|
|
}
|
|
|
|
|
2019-02-18 16:35:54 +00:00
|
|
|
/**
|
|
|
|
* nfs_list_move_request - Move a request to a new list
|
|
|
|
* @req: request
|
|
|
|
* @head: head of list into which to insert the request.
|
|
|
|
*/
|
|
|
|
static inline void
|
|
|
|
nfs_list_move_request(struct nfs_page *req, struct list_head *head)
|
|
|
|
{
|
|
|
|
list_move_tail(&req->wb_list, head);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* nfs_list_remove_request - Remove a request from its wb_list
|
|
|
|
* @req: request
|
|
|
|
*/
|
|
|
|
static inline void
|
|
|
|
nfs_list_remove_request(struct nfs_page *req)
|
|
|
|
{
|
|
|
|
if (list_empty(&req->wb_list))
|
|
|
|
return;
|
|
|
|
list_del_init(&req->wb_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct nfs_page *
|
|
|
|
nfs_list_entry(struct list_head *head)
|
|
|
|
{
|
|
|
|
return list_entry(head, struct nfs_page, wb_list);
|
|
|
|
}
|
|
|
|
|
2022-08-09 16:50:28 +00:00
|
|
|
static inline loff_t req_offset(const struct nfs_page *req)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
mm, fs: get rid of PAGE_CACHE_* and page_cache_{get,release} macros
PAGE_CACHE_{SIZE,SHIFT,MASK,ALIGN} macros were introduced *long* time
ago with promise that one day it will be possible to implement page
cache with bigger chunks than PAGE_SIZE.
This promise never materialized. And unlikely will.
We have many places where PAGE_CACHE_SIZE assumed to be equal to
PAGE_SIZE. And it's constant source of confusion on whether
PAGE_CACHE_* or PAGE_* constant should be used in a particular case,
especially on the border between fs and mm.
Global switching to PAGE_CACHE_SIZE != PAGE_SIZE would cause to much
breakage to be doable.
Let's stop pretending that pages in page cache are special. They are
not.
The changes are pretty straight-forward:
- <foo> << (PAGE_CACHE_SHIFT - PAGE_SHIFT) -> <foo>;
- <foo> >> (PAGE_CACHE_SHIFT - PAGE_SHIFT) -> <foo>;
- PAGE_CACHE_{SIZE,SHIFT,MASK,ALIGN} -> PAGE_{SIZE,SHIFT,MASK,ALIGN};
- page_cache_get() -> get_page();
- page_cache_release() -> put_page();
This patch contains automated changes generated with coccinelle using
script below. For some reason, coccinelle doesn't patch header files.
I've called spatch for them manually.
The only adjustment after coccinelle is revert of changes to
PAGE_CAHCE_ALIGN definition: we are going to drop it later.
There are few places in the code where coccinelle didn't reach. I'll
fix them manually in a separate patch. Comments and documentation also
will be addressed with the separate patch.
virtual patch
@@
expression E;
@@
- E << (PAGE_CACHE_SHIFT - PAGE_SHIFT)
+ E
@@
expression E;
@@
- E >> (PAGE_CACHE_SHIFT - PAGE_SHIFT)
+ E
@@
@@
- PAGE_CACHE_SHIFT
+ PAGE_SHIFT
@@
@@
- PAGE_CACHE_SIZE
+ PAGE_SIZE
@@
@@
- PAGE_CACHE_MASK
+ PAGE_MASK
@@
expression E;
@@
- PAGE_CACHE_ALIGN(E)
+ PAGE_ALIGN(E)
@@
expression E;
@@
- page_cache_get(E)
+ get_page(E)
@@
expression E;
@@
- page_cache_release(E)
+ put_page(E)
Signed-off-by: Kirill A. Shutemov <kirill.shutemov@linux.intel.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-04-01 12:29:47 +00:00
|
|
|
return (((loff_t)req->wb_index) << PAGE_SHIFT) + req->wb_offset;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2019-04-07 17:59:11 +00:00
|
|
|
static inline struct nfs_open_context *
|
|
|
|
nfs_req_openctx(struct nfs_page *req)
|
|
|
|
{
|
2019-04-07 17:59:12 +00:00
|
|
|
return req->wb_lock_context->open_context;
|
2019-04-07 17:59:11 +00:00
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* _LINUX_NFS_PAGE_H */
|