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 */
|
2010-04-06 22:14:15 +00:00
|
|
|
#ifndef _FS_CEPH_LIBCEPH_H
|
|
|
|
|
#define _FS_CEPH_LIBCEPH_H
|
|
|
|
|
|
2012-10-02 17:01:25 +00:00
|
|
|
#include <linux/ceph/ceph_debug.h>
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
#include <asm/unaligned.h>
|
|
|
|
|
#include <linux/backing-dev.h>
|
|
|
|
|
#include <linux/completion.h>
|
|
|
|
|
#include <linux/exportfs.h>
|
2011-11-24 01:12:59 +00:00
|
|
|
#include <linux/bug.h>
|
2010-04-06 22:14:15 +00:00
|
|
|
#include <linux/fs.h>
|
|
|
|
|
#include <linux/mempool.h>
|
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
|
#include <linux/wait.h>
|
|
|
|
|
#include <linux/writeback.h>
|
|
|
|
|
#include <linux/slab.h>
|
2017-03-17 12:10:27 +00:00
|
|
|
#include <linux/refcount.h>
|
2010-04-06 22:14:15 +00:00
|
|
|
|
2012-10-02 17:01:25 +00:00
|
|
|
#include <linux/ceph/types.h>
|
|
|
|
|
#include <linux/ceph/messenger.h>
|
|
|
|
|
#include <linux/ceph/msgpool.h>
|
|
|
|
|
#include <linux/ceph/mon_client.h>
|
|
|
|
|
#include <linux/ceph/osd_client.h>
|
|
|
|
|
#include <linux/ceph/ceph_fs.h>
|
2016-02-05 07:36:22 +00:00
|
|
|
#include <linux/ceph/string_table.h>
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* mount options
|
|
|
|
|
*/
|
|
|
|
|
#define CEPH_OPT_FSID (1<<0)
|
|
|
|
|
#define CEPH_OPT_NOSHARE (1<<1) /* don't share client with other sbs */
|
|
|
|
|
#define CEPH_OPT_MYIP (1<<2) /* specified my ip */
|
|
|
|
|
#define CEPH_OPT_NOCRC (1<<3) /* no data crc on writes */
|
2015-10-28 22:52:06 +00:00
|
|
|
#define CEPH_OPT_NOMSGAUTH (1<<4) /* don't require msg signing feat */
|
2015-01-23 11:11:25 +00:00
|
|
|
#define CEPH_OPT_TCP_NODELAY (1<<5) /* TCP_NODELAY on TCP sockets */
|
2015-10-28 22:52:06 +00:00
|
|
|
#define CEPH_OPT_NOMSGSIGN (1<<6) /* don't sign msgs */
|
2018-12-18 09:31:48 +00:00
|
|
|
#define CEPH_OPT_ABORT_ON_FULL (1<<7) /* abort w/ ENOSPC when full */
|
2010-04-06 22:14:15 +00:00
|
|
|
|
2015-01-23 11:11:25 +00:00
|
|
|
#define CEPH_OPT_DEFAULT (CEPH_OPT_TCP_NODELAY)
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
#define ceph_set_opt(client, opt) \
|
|
|
|
|
(client)->options->flags |= CEPH_OPT_##opt;
|
|
|
|
|
#define ceph_test_opt(client, opt) \
|
|
|
|
|
(!!((client)->options->flags & CEPH_OPT_##opt))
|
|
|
|
|
|
|
|
|
|
struct ceph_options {
|
|
|
|
|
int flags;
|
|
|
|
|
struct ceph_fsid fsid;
|
|
|
|
|
struct ceph_entity_addr my_addr;
|
2015-05-15 09:02:17 +00:00
|
|
|
unsigned long mount_timeout; /* jiffies */
|
|
|
|
|
unsigned long osd_idle_ttl; /* jiffies */
|
|
|
|
|
unsigned long osd_keepalive_timeout; /* jiffies */
|
2017-02-12 16:11:07 +00:00
|
|
|
unsigned long osd_request_timeout; /* jiffies */
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
/*
|
2018-12-18 09:31:48 +00:00
|
|
|
* any type that can't be simply compared or doesn't need
|
2010-04-06 22:14:15 +00:00
|
|
|
* to be compared should go beyond this point,
|
|
|
|
|
* ceph_compare_options() should be updated accordingly
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
struct ceph_entity_addr *mon_addr; /* should be the first
|
|
|
|
|
pointer type of args */
|
|
|
|
|
int num_mon;
|
|
|
|
|
char *name;
|
2011-03-25 23:32:57 +00:00
|
|
|
struct ceph_crypto_key *key;
|
2010-04-06 22:14:15 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* defaults
|
|
|
|
|
*/
|
2015-05-15 09:02:17 +00:00
|
|
|
#define CEPH_MOUNT_TIMEOUT_DEFAULT msecs_to_jiffies(60 * 1000)
|
|
|
|
|
#define CEPH_OSD_KEEPALIVE_DEFAULT msecs_to_jiffies(5 * 1000)
|
|
|
|
|
#define CEPH_OSD_IDLE_TTL_DEFAULT msecs_to_jiffies(60 * 1000)
|
2017-02-12 16:11:07 +00:00
|
|
|
#define CEPH_OSD_REQUEST_TIMEOUT_DEFAULT 0 /* no timeout */
|
2016-01-21 15:33:15 +00:00
|
|
|
|
2016-01-21 15:33:19 +00:00
|
|
|
#define CEPH_MONC_HUNT_INTERVAL msecs_to_jiffies(3 * 1000)
|
2016-01-21 15:33:15 +00:00
|
|
|
#define CEPH_MONC_PING_INTERVAL msecs_to_jiffies(10 * 1000)
|
|
|
|
|
#define CEPH_MONC_PING_TIMEOUT msecs_to_jiffies(30 * 1000)
|
2016-01-21 15:33:19 +00:00
|
|
|
#define CEPH_MONC_HUNT_BACKOFF 2
|
|
|
|
|
#define CEPH_MONC_HUNT_MAX_MULT 10
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
#define CEPH_MSG_MAX_FRONT_LEN (16*1024*1024)
|
2013-03-09 00:51:03 +00:00
|
|
|
#define CEPH_MSG_MAX_MIDDLE_LEN (16*1024*1024)
|
2018-09-26 16:03:16 +00:00
|
|
|
|
|
|
|
|
/*
|
2019-04-08 12:16:05 +00:00
|
|
|
* The largest possible rbd data object is 32M.
|
|
|
|
|
* The largest possible rbd object map object is 64M.
|
|
|
|
|
*
|
2018-09-26 16:03:16 +00:00
|
|
|
* There is no limit on the size of cephfs objects, but it has to obey
|
|
|
|
|
* rsize and wsize mount options anyway.
|
|
|
|
|
*/
|
2019-04-08 12:16:05 +00:00
|
|
|
#define CEPH_MSG_MAX_DATA_LEN (64*1024*1024)
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
#define CEPH_AUTH_NAME_DEFAULT "guest"
|
|
|
|
|
|
|
|
|
|
/* mount state */
|
|
|
|
|
enum {
|
|
|
|
|
CEPH_MOUNT_MOUNTING,
|
|
|
|
|
CEPH_MOUNT_MOUNTED,
|
|
|
|
|
CEPH_MOUNT_UNMOUNTING,
|
|
|
|
|
CEPH_MOUNT_UNMOUNTED,
|
|
|
|
|
CEPH_MOUNT_SHUTDOWN,
|
|
|
|
|
};
|
|
|
|
|
|
2015-05-15 09:02:17 +00:00
|
|
|
static inline unsigned long ceph_timeout_jiffies(unsigned long timeout)
|
|
|
|
|
{
|
|
|
|
|
return timeout ?: MAX_SCHEDULE_TIMEOUT;
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-06 22:14:15 +00:00
|
|
|
struct ceph_mds_client;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* per client state
|
|
|
|
|
*
|
|
|
|
|
* possibly shared by multiple mount points, if they are
|
|
|
|
|
* mounting the same ceph filesystem/cluster.
|
|
|
|
|
*/
|
|
|
|
|
struct ceph_client {
|
|
|
|
|
struct ceph_fsid fsid;
|
|
|
|
|
bool have_fsid;
|
|
|
|
|
|
|
|
|
|
void *private;
|
|
|
|
|
|
|
|
|
|
struct ceph_options *options;
|
|
|
|
|
|
|
|
|
|
struct mutex mount_mutex; /* serialize mount attempts */
|
|
|
|
|
wait_queue_head_t auth_wq;
|
|
|
|
|
int auth_err;
|
|
|
|
|
|
|
|
|
|
int (*extra_mon_dispatch)(struct ceph_client *, struct ceph_msg *);
|
|
|
|
|
|
2013-12-24 19:19:23 +00:00
|
|
|
u64 supported_features;
|
|
|
|
|
u64 required_features;
|
2010-04-06 22:14:15 +00:00
|
|
|
|
2012-05-27 04:26:43 +00:00
|
|
|
struct ceph_messenger msgr; /* messenger instance */
|
2010-04-06 22:14:15 +00:00
|
|
|
struct ceph_mon_client monc;
|
|
|
|
|
struct ceph_osd_client osdc;
|
|
|
|
|
|
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
|
struct dentry *debugfs_dir;
|
|
|
|
|
struct dentry *debugfs_monmap;
|
|
|
|
|
struct dentry *debugfs_osdmap;
|
2015-03-25 18:07:41 +00:00
|
|
|
struct dentry *debugfs_options;
|
2010-04-06 22:14:15 +00:00
|
|
|
#endif
|
|
|
|
|
};
|
|
|
|
|
|
2015-10-28 22:50:58 +00:00
|
|
|
#define from_msgr(ms) container_of(ms, struct ceph_client, msgr)
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* snapshots
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* A "snap context" is the set of existing snapshots when we
|
|
|
|
|
* write data. It is used by the OSD to guide its COW behavior.
|
|
|
|
|
*
|
|
|
|
|
* The ceph_snap_context is refcounted, and attached to each dirty
|
|
|
|
|
* page, indicating which context the dirty data belonged when it was
|
|
|
|
|
* dirtied.
|
|
|
|
|
*/
|
|
|
|
|
struct ceph_snap_context {
|
2017-03-17 12:10:27 +00:00
|
|
|
refcount_t nref;
|
2010-04-06 22:14:15 +00:00
|
|
|
u64 seq;
|
2012-07-14 01:35:11 +00:00
|
|
|
u32 num_snaps;
|
2010-04-06 22:14:15 +00:00
|
|
|
u64 snaps[];
|
|
|
|
|
};
|
|
|
|
|
|
2013-04-30 05:44:32 +00:00
|
|
|
extern struct ceph_snap_context *ceph_create_snap_context(u32 snap_count,
|
|
|
|
|
gfp_t gfp_flags);
|
|
|
|
|
extern struct ceph_snap_context *ceph_get_snap_context(
|
|
|
|
|
struct ceph_snap_context *sc);
|
|
|
|
|
extern void ceph_put_snap_context(struct ceph_snap_context *sc);
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* calculate the number of pages a given length and offset map onto,
|
|
|
|
|
* if we align the data.
|
|
|
|
|
*/
|
|
|
|
|
static inline int calc_pages_for(u64 off, u64 len)
|
|
|
|
|
{
|
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 ((off+len+PAGE_SIZE-1) >> PAGE_SHIFT) -
|
|
|
|
|
(off >> PAGE_SHIFT);
|
2010-04-06 22:14:15 +00:00
|
|
|
}
|
|
|
|
|
|
2017-06-19 10:18:05 +00:00
|
|
|
#define RB_BYVAL(a) (a)
|
|
|
|
|
#define RB_BYPTR(a) (&(a))
|
|
|
|
|
#define RB_CMP3WAY(a, b) ((a) < (b) ? -1 : (a) > (b))
|
|
|
|
|
|
|
|
|
|
#define DEFINE_RB_INSDEL_FUNCS2(name, type, keyfld, cmpexp, keyexp, nodefld) \
|
2016-04-28 14:07:22 +00:00
|
|
|
static void insert_##name(struct rb_root *root, type *t) \
|
|
|
|
|
{ \
|
|
|
|
|
struct rb_node **n = &root->rb_node; \
|
|
|
|
|
struct rb_node *parent = NULL; \
|
|
|
|
|
\
|
|
|
|
|
BUG_ON(!RB_EMPTY_NODE(&t->nodefld)); \
|
|
|
|
|
\
|
|
|
|
|
while (*n) { \
|
|
|
|
|
type *cur = rb_entry(*n, type, nodefld); \
|
2017-06-19 10:18:05 +00:00
|
|
|
int cmp; \
|
2016-04-28 14:07:22 +00:00
|
|
|
\
|
|
|
|
|
parent = *n; \
|
2017-06-19 10:18:05 +00:00
|
|
|
cmp = cmpexp(keyexp(t->keyfld), keyexp(cur->keyfld)); \
|
|
|
|
|
if (cmp < 0) \
|
2016-04-28 14:07:22 +00:00
|
|
|
n = &(*n)->rb_left; \
|
2017-06-19 10:18:05 +00:00
|
|
|
else if (cmp > 0) \
|
2016-04-28 14:07:22 +00:00
|
|
|
n = &(*n)->rb_right; \
|
|
|
|
|
else \
|
|
|
|
|
BUG(); \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
rb_link_node(&t->nodefld, parent, n); \
|
|
|
|
|
rb_insert_color(&t->nodefld, root); \
|
|
|
|
|
} \
|
|
|
|
|
static void erase_##name(struct rb_root *root, type *t) \
|
|
|
|
|
{ \
|
|
|
|
|
BUG_ON(RB_EMPTY_NODE(&t->nodefld)); \
|
|
|
|
|
rb_erase(&t->nodefld, root); \
|
|
|
|
|
RB_CLEAR_NODE(&t->nodefld); \
|
|
|
|
|
}
|
|
|
|
|
|
2017-06-19 10:18:05 +00:00
|
|
|
/*
|
|
|
|
|
* @lookup_param_type is a parameter and not constructed from (@type,
|
|
|
|
|
* @keyfld) with typeof() because adding const is too unwieldy.
|
|
|
|
|
*/
|
|
|
|
|
#define DEFINE_RB_LOOKUP_FUNC2(name, type, keyfld, cmpexp, keyexp, \
|
|
|
|
|
lookup_param_type, nodefld) \
|
|
|
|
|
static type *lookup_##name(struct rb_root *root, lookup_param_type key) \
|
2016-04-28 14:07:22 +00:00
|
|
|
{ \
|
|
|
|
|
struct rb_node *n = root->rb_node; \
|
|
|
|
|
\
|
|
|
|
|
while (n) { \
|
|
|
|
|
type *cur = rb_entry(n, type, nodefld); \
|
2017-06-19 10:18:05 +00:00
|
|
|
int cmp; \
|
2016-04-28 14:07:22 +00:00
|
|
|
\
|
2017-06-19 10:18:05 +00:00
|
|
|
cmp = cmpexp(key, keyexp(cur->keyfld)); \
|
|
|
|
|
if (cmp < 0) \
|
2016-04-28 14:07:22 +00:00
|
|
|
n = n->rb_left; \
|
2017-06-19 10:18:05 +00:00
|
|
|
else if (cmp > 0) \
|
2016-04-28 14:07:22 +00:00
|
|
|
n = n->rb_right; \
|
|
|
|
|
else \
|
|
|
|
|
return cur; \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
return NULL; \
|
|
|
|
|
}
|
|
|
|
|
|
2017-06-19 10:18:05 +00:00
|
|
|
#define DEFINE_RB_FUNCS2(name, type, keyfld, cmpexp, keyexp, \
|
|
|
|
|
lookup_param_type, nodefld) \
|
|
|
|
|
DEFINE_RB_INSDEL_FUNCS2(name, type, keyfld, cmpexp, keyexp, nodefld) \
|
|
|
|
|
DEFINE_RB_LOOKUP_FUNC2(name, type, keyfld, cmpexp, keyexp, \
|
|
|
|
|
lookup_param_type, nodefld)
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Shorthands for integer keys.
|
|
|
|
|
*/
|
|
|
|
|
#define DEFINE_RB_INSDEL_FUNCS(name, type, keyfld, nodefld) \
|
|
|
|
|
DEFINE_RB_INSDEL_FUNCS2(name, type, keyfld, RB_CMP3WAY, RB_BYVAL, nodefld)
|
|
|
|
|
|
|
|
|
|
#define DEFINE_RB_LOOKUP_FUNC(name, type, keyfld, nodefld) \
|
|
|
|
|
extern type __lookup_##name##_key; \
|
|
|
|
|
DEFINE_RB_LOOKUP_FUNC2(name, type, keyfld, RB_CMP3WAY, RB_BYVAL, \
|
|
|
|
|
typeof(__lookup_##name##_key.keyfld), nodefld)
|
|
|
|
|
|
2016-04-28 14:07:22 +00:00
|
|
|
#define DEFINE_RB_FUNCS(name, type, keyfld, nodefld) \
|
|
|
|
|
DEFINE_RB_INSDEL_FUNCS(name, type, keyfld, nodefld) \
|
|
|
|
|
DEFINE_RB_LOOKUP_FUNC(name, type, keyfld, nodefld)
|
|
|
|
|
|
2014-01-09 18:08:21 +00:00
|
|
|
extern struct kmem_cache *ceph_inode_cachep;
|
|
|
|
|
extern struct kmem_cache *ceph_cap_cachep;
|
2015-06-10 09:26:13 +00:00
|
|
|
extern struct kmem_cache *ceph_cap_flush_cachep;
|
2014-01-09 18:08:21 +00:00
|
|
|
extern struct kmem_cache *ceph_dentry_cachep;
|
|
|
|
|
extern struct kmem_cache *ceph_file_cachep;
|
2018-03-13 02:42:44 +00:00
|
|
|
extern struct kmem_cache *ceph_dir_file_cachep;
|
2014-01-09 18:08:21 +00:00
|
|
|
|
2010-04-06 22:14:15 +00:00
|
|
|
/* ceph_common.c */
|
2013-01-30 17:13:33 +00:00
|
|
|
extern bool libceph_compatible(void *data);
|
|
|
|
|
|
2010-04-06 22:14:15 +00:00
|
|
|
extern const char *ceph_msg_type_name(int type);
|
|
|
|
|
extern int ceph_check_fsid(struct ceph_client *client, struct ceph_fsid *fsid);
|
2014-01-09 18:08:21 +00:00
|
|
|
extern void *ceph_kvmalloc(size_t size, gfp_t flags);
|
2010-04-06 22:14:15 +00:00
|
|
|
|
2012-01-24 16:08:36 +00:00
|
|
|
extern struct ceph_options *ceph_parse_options(char *options,
|
2010-04-06 22:14:15 +00:00
|
|
|
const char *dev_name, const char *dev_name_end,
|
|
|
|
|
int (*parse_extra_token)(char *c, void *private),
|
|
|
|
|
void *private);
|
2018-12-18 09:31:48 +00:00
|
|
|
int ceph_print_client_options(struct seq_file *m, struct ceph_client *client,
|
|
|
|
|
bool show_all);
|
2010-04-06 22:14:15 +00:00
|
|
|
extern void ceph_destroy_options(struct ceph_options *opt);
|
|
|
|
|
extern int ceph_compare_options(struct ceph_options *new_opt,
|
|
|
|
|
struct ceph_client *client);
|
2017-03-03 17:16:07 +00:00
|
|
|
struct ceph_client *ceph_create_client(struct ceph_options *opt, void *private);
|
2016-08-18 16:38:43 +00:00
|
|
|
struct ceph_entity_addr *ceph_client_addr(struct ceph_client *client);
|
2016-08-12 12:59:58 +00:00
|
|
|
u64 ceph_client_gid(struct ceph_client *client);
|
2010-04-06 22:14:15 +00:00
|
|
|
extern void ceph_destroy_client(struct ceph_client *client);
|
|
|
|
|
extern int __ceph_open_session(struct ceph_client *client,
|
|
|
|
|
unsigned long started);
|
|
|
|
|
extern int ceph_open_session(struct ceph_client *client);
|
2019-03-20 08:46:58 +00:00
|
|
|
int ceph_wait_for_latest_osdmap(struct ceph_client *client,
|
|
|
|
|
unsigned long timeout);
|
2010-04-06 22:14:15 +00:00
|
|
|
|
|
|
|
|
/* pagevec.c */
|
|
|
|
|
extern void ceph_release_page_vector(struct page **pages, int num_pages);
|
2010-12-16 04:45:41 +00:00
|
|
|
extern void ceph_put_page_vector(struct page **pages, int num_pages,
|
|
|
|
|
bool dirty);
|
2010-04-06 22:14:15 +00:00
|
|
|
extern struct page **ceph_alloc_page_vector(int num_pages, gfp_t flags);
|
|
|
|
|
extern int ceph_copy_user_to_page_vector(struct page **pages,
|
2013-02-06 19:11:38 +00:00
|
|
|
const void __user *data,
|
2010-04-06 22:14:15 +00:00
|
|
|
loff_t off, size_t len);
|
2013-02-06 19:11:38 +00:00
|
|
|
extern void ceph_copy_to_page_vector(struct page **pages,
|
2013-02-06 19:11:38 +00:00
|
|
|
const void *data,
|
2010-04-06 22:14:15 +00:00
|
|
|
loff_t off, size_t len);
|
2013-02-06 19:11:38 +00:00
|
|
|
extern void ceph_copy_from_page_vector(struct page **pages,
|
2013-02-06 19:11:38 +00:00
|
|
|
void *data,
|
2010-04-06 22:14:15 +00:00
|
|
|
loff_t off, size_t len);
|
|
|
|
|
extern void ceph_zero_page_vector_range(int off, int len, struct page **pages);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif /* _FS_CEPH_SUPER_H */
|