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
|
|
|
#ifndef _SYSV_H
|
|
|
|
|
#define _SYSV_H
|
|
|
|
|
|
|
|
|
|
#include <linux/buffer_head.h>
|
|
|
|
|
|
|
|
|
|
typedef __u16 __bitwise __fs16;
|
|
|
|
|
typedef __u32 __bitwise __fs32;
|
|
|
|
|
|
|
|
|
|
#include <linux/sysv_fs.h>
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* SystemV/V7/Coherent super-block data in memory
|
|
|
|
|
*
|
|
|
|
|
* The SystemV/V7/Coherent superblock contains dynamic data (it gets modified
|
|
|
|
|
* while the system is running). This is in contrast to the Minix and Berkeley
|
|
|
|
|
* filesystems (where the superblock is never modified). This affects the
|
|
|
|
|
* sync() operation: we must keep the superblock in a disk buffer and use this
|
|
|
|
|
* one as our "working copy".
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
struct sysv_sb_info {
|
|
|
|
|
struct super_block *s_sb; /* VFS superblock */
|
|
|
|
|
int s_type; /* file system type: FSTYPE_{XENIX|SYSV|COH} */
|
|
|
|
|
char s_bytesex; /* bytesex (le/be/pdp) */
|
|
|
|
|
unsigned int s_inodes_per_block; /* number of inodes per block */
|
|
|
|
|
unsigned int s_inodes_per_block_1; /* inodes_per_block - 1 */
|
|
|
|
|
unsigned int s_inodes_per_block_bits; /* log2(inodes_per_block) */
|
|
|
|
|
unsigned int s_ind_per_block; /* number of indirections per block */
|
|
|
|
|
unsigned int s_ind_per_block_bits; /* log2(ind_per_block) */
|
|
|
|
|
unsigned int s_ind_per_block_2; /* ind_per_block ^ 2 */
|
|
|
|
|
unsigned int s_toobig_block; /* 10 + ipb + ipb^2 + ipb^3 */
|
|
|
|
|
unsigned int s_block_base; /* physical block number of block 0 */
|
|
|
|
|
unsigned short s_fic_size; /* free inode cache size, NICINOD */
|
|
|
|
|
unsigned short s_flc_size; /* free block list chunk size, NICFREE */
|
|
|
|
|
/* The superblock is kept in one or two disk buffers: */
|
|
|
|
|
struct buffer_head *s_bh1;
|
|
|
|
|
struct buffer_head *s_bh2;
|
|
|
|
|
/* These are pointers into the disk buffer, to compensate for
|
|
|
|
|
different superblock layout. */
|
|
|
|
|
char * s_sbd1; /* entire superblock data, for part 1 */
|
|
|
|
|
char * s_sbd2; /* entire superblock data, for part 2 */
|
|
|
|
|
__fs16 *s_sb_fic_count; /* pointer to s_sbd->s_ninode */
|
|
|
|
|
sysv_ino_t *s_sb_fic_inodes; /* pointer to s_sbd->s_inode */
|
|
|
|
|
__fs16 *s_sb_total_free_inodes; /* pointer to s_sbd->s_tinode */
|
|
|
|
|
__fs16 *s_bcache_count; /* pointer to s_sbd->s_nfree */
|
|
|
|
|
sysv_zone_t *s_bcache; /* pointer to s_sbd->s_free */
|
|
|
|
|
__fs32 *s_free_blocks; /* pointer to s_sbd->s_tfree */
|
|
|
|
|
__fs32 *s_sb_time; /* pointer to s_sbd->s_time */
|
|
|
|
|
__fs32 *s_sb_state; /* pointer to s_sbd->s_state, only FSTYPE_SYSV */
|
|
|
|
|
/* We keep those superblock entities that don't change here;
|
|
|
|
|
this saves us an indirection and perhaps a conversion. */
|
|
|
|
|
u32 s_firstinodezone; /* index of first inode zone */
|
|
|
|
|
u32 s_firstdatazone; /* same as s_sbd->s_isize */
|
|
|
|
|
u32 s_ninodes; /* total number of inodes */
|
|
|
|
|
u32 s_ndatazones; /* total number of data zones */
|
|
|
|
|
u32 s_nzones; /* same as s_sbd->s_fsize */
|
|
|
|
|
u16 s_namelen; /* max length of dir entry */
|
|
|
|
|
int s_forced_ro;
|
2012-10-06 10:41:46 +00:00
|
|
|
struct mutex s_lock;
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* SystemV/V7/Coherent FS inode data in memory
|
|
|
|
|
*/
|
|
|
|
|
struct sysv_inode_info {
|
|
|
|
|
__fs32 i_data[13];
|
|
|
|
|
u32 i_dir_start_lookup;
|
|
|
|
|
struct inode vfs_inode;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static inline struct sysv_inode_info *SYSV_I(struct inode *inode)
|
|
|
|
|
{
|
2015-03-19 11:28:04 +00:00
|
|
|
return container_of(inode, struct sysv_inode_info, vfs_inode);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline struct sysv_sb_info *SYSV_SB(struct super_block *sb)
|
|
|
|
|
{
|
|
|
|
|
return sb->s_fs_info;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* identify the FS in memory */
|
|
|
|
|
enum {
|
|
|
|
|
FSTYPE_NONE = 0,
|
|
|
|
|
FSTYPE_XENIX,
|
|
|
|
|
FSTYPE_SYSV4,
|
|
|
|
|
FSTYPE_SYSV2,
|
|
|
|
|
FSTYPE_COH,
|
|
|
|
|
FSTYPE_V7,
|
|
|
|
|
FSTYPE_AFS,
|
|
|
|
|
FSTYPE_END,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define SYSV_MAGIC_BASE 0x012FF7B3
|
|
|
|
|
|
|
|
|
|
#define XENIX_SUPER_MAGIC (SYSV_MAGIC_BASE+FSTYPE_XENIX)
|
|
|
|
|
#define SYSV4_SUPER_MAGIC (SYSV_MAGIC_BASE+FSTYPE_SYSV4)
|
|
|
|
|
#define SYSV2_SUPER_MAGIC (SYSV_MAGIC_BASE+FSTYPE_SYSV2)
|
|
|
|
|
#define COH_SUPER_MAGIC (SYSV_MAGIC_BASE+FSTYPE_COH)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Admissible values for i_nlink: 0.._LINK_MAX */
|
|
|
|
|
enum {
|
|
|
|
|
XENIX_LINK_MAX = 126, /* ?? */
|
|
|
|
|
SYSV_LINK_MAX = 126, /* 127? 251? */
|
|
|
|
|
V7_LINK_MAX = 126, /* ?? */
|
|
|
|
|
COH_LINK_MAX = 10000,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static inline void dirty_sb(struct super_block *sb)
|
|
|
|
|
{
|
|
|
|
|
struct sysv_sb_info *sbi = SYSV_SB(sb);
|
|
|
|
|
|
|
|
|
|
mark_buffer_dirty(sbi->s_bh1);
|
|
|
|
|
if (sbi->s_bh1 != sbi->s_bh2)
|
|
|
|
|
mark_buffer_dirty(sbi->s_bh2);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* ialloc.c */
|
|
|
|
|
extern struct sysv_inode *sysv_raw_inode(struct super_block *, unsigned,
|
|
|
|
|
struct buffer_head **);
|
2011-07-26 06:49:38 +00:00
|
|
|
extern struct inode * sysv_new_inode(const struct inode *, umode_t);
|
2005-04-16 22:20:36 +00:00
|
|
|
extern void sysv_free_inode(struct inode *);
|
|
|
|
|
extern unsigned long sysv_count_free_inodes(struct super_block *);
|
|
|
|
|
|
|
|
|
|
/* balloc.c */
|
|
|
|
|
extern sysv_zone_t sysv_new_block(struct super_block *);
|
|
|
|
|
extern void sysv_free_block(struct super_block *, sysv_zone_t);
|
|
|
|
|
extern unsigned long sysv_count_free_blocks(struct super_block *);
|
|
|
|
|
|
|
|
|
|
/* itree.c */
|
|
|
|
|
extern void sysv_truncate(struct inode *);
|
2010-06-04 09:29:56 +00:00
|
|
|
extern int sysv_prepare_chunk(struct page *page, loff_t pos, unsigned len);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
/* inode.c */
|
2008-02-07 08:15:47 +00:00
|
|
|
extern struct inode *sysv_iget(struct super_block *, unsigned int);
|
2010-03-05 08:21:37 +00:00
|
|
|
extern int sysv_write_inode(struct inode *, struct writeback_control *wbc);
|
2005-04-16 22:20:36 +00:00
|
|
|
extern int sysv_sync_inode(struct inode *);
|
|
|
|
|
extern void sysv_set_inode(struct inode *, dev_t);
|
2021-01-21 13:19:43 +00:00
|
|
|
extern int sysv_getattr(struct user_namespace *, const struct path *,
|
|
|
|
|
struct kstat *, u32, unsigned int);
|
2006-12-22 09:07:09 +00:00
|
|
|
extern int sysv_init_icache(void);
|
|
|
|
|
extern void sysv_destroy_icache(void);
|
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
/* dir.c */
|
fs/sysv: Replace kmap() with kmap_local_page()
kmap() is being deprecated in favor of kmap_local_page().
There are two main problems with kmap(): (1) It comes with an overhead as
the mapping space is restricted and protected by a global lock for
synchronization and (2) it also requires global TLB invalidation when the
kmap’s pool wraps and it might block when the mapping space is fully
utilized until a slot becomes available.
With kmap_local_page() the mappings are per thread, CPU local, can take
page faults, and can be called from any context (including interrupts).
It is faster than kmap() in kernels with HIGHMEM enabled. Furthermore,
the tasks can be preempted and, when they are scheduled to run again, the
kernel virtual addresses are restored and still valid.
Since kmap_local_page() would not break the strict rules of local mappings
(i.e., the thread locality and the stack based nesting), this function can
be easily and safely replace the deprecated API.
Therefore, replace kmap() with kmap_local_page() in fs/sysv. kunmap_local()
requires the mapping address, so return that address from dir_get_page()
to be used in dir_put_page().
Suggested-by: Al Viro <viro@zeniv.linux.org.uk>
Suggested-by: Ira Weiny <ira.weiny@intel.com>
Signed-off-by: Fabio M. De Francesco <fmdefrancesco@gmail.com>
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
2023-01-19 15:32:32 +00:00
|
|
|
extern void dir_put_page(struct page *page, void *vaddr);
|
2005-04-16 22:20:36 +00:00
|
|
|
extern struct sysv_dir_entry *sysv_find_entry(struct dentry *, struct page **);
|
|
|
|
|
extern int sysv_add_link(struct dentry *, struct inode *);
|
|
|
|
|
extern int sysv_delete_entry(struct sysv_dir_entry *, struct page *);
|
|
|
|
|
extern int sysv_make_empty(struct inode *, struct inode *);
|
|
|
|
|
extern int sysv_empty_dir(struct inode *);
|
|
|
|
|
extern void sysv_set_link(struct sysv_dir_entry *, struct page *,
|
|
|
|
|
struct inode *);
|
|
|
|
|
extern struct sysv_dir_entry *sysv_dotdot(struct inode *, struct page **);
|
|
|
|
|
extern ino_t sysv_inode_by_name(struct dentry *);
|
|
|
|
|
|
|
|
|
|
|
2007-02-12 08:55:40 +00:00
|
|
|
extern const struct inode_operations sysv_file_inode_operations;
|
|
|
|
|
extern const struct inode_operations sysv_dir_inode_operations;
|
2006-03-28 09:56:42 +00:00
|
|
|
extern const struct file_operations sysv_file_operations;
|
|
|
|
|
extern const struct file_operations sysv_dir_operations;
|
2006-06-28 11:26:44 +00:00
|
|
|
extern const struct address_space_operations sysv_aops;
|
2007-02-12 08:55:41 +00:00
|
|
|
extern const struct super_operations sysv_sops;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
enum {
|
|
|
|
|
BYTESEX_LE,
|
|
|
|
|
BYTESEX_PDP,
|
|
|
|
|
BYTESEX_BE,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static inline u32 PDP_swab(u32 x)
|
|
|
|
|
{
|
|
|
|
|
#ifdef __LITTLE_ENDIAN
|
|
|
|
|
return ((x & 0xffff) << 16) | ((x & 0xffff0000) >> 16);
|
|
|
|
|
#else
|
|
|
|
|
#ifdef __BIG_ENDIAN
|
|
|
|
|
return ((x & 0xff00ff) << 8) | ((x & 0xff00ff00) >> 8);
|
|
|
|
|
#else
|
|
|
|
|
#error BYTESEX
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __u32 fs32_to_cpu(struct sysv_sb_info *sbi, __fs32 n)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex == BYTESEX_PDP)
|
|
|
|
|
return PDP_swab((__force __u32)n);
|
|
|
|
|
else if (sbi->s_bytesex == BYTESEX_LE)
|
|
|
|
|
return le32_to_cpu((__force __le32)n);
|
|
|
|
|
else
|
|
|
|
|
return be32_to_cpu((__force __be32)n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __fs32 cpu_to_fs32(struct sysv_sb_info *sbi, __u32 n)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex == BYTESEX_PDP)
|
|
|
|
|
return (__force __fs32)PDP_swab(n);
|
|
|
|
|
else if (sbi->s_bytesex == BYTESEX_LE)
|
|
|
|
|
return (__force __fs32)cpu_to_le32(n);
|
|
|
|
|
else
|
|
|
|
|
return (__force __fs32)cpu_to_be32(n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __fs32 fs32_add(struct sysv_sb_info *sbi, __fs32 *n, int d)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex == BYTESEX_PDP)
|
|
|
|
|
*(__u32*)n = PDP_swab(PDP_swab(*(__u32*)n)+d);
|
|
|
|
|
else if (sbi->s_bytesex == BYTESEX_LE)
|
2008-04-30 07:54:49 +00:00
|
|
|
le32_add_cpu((__le32 *)n, d);
|
2005-04-16 22:20:36 +00:00
|
|
|
else
|
2008-04-30 07:54:49 +00:00
|
|
|
be32_add_cpu((__be32 *)n, d);
|
2005-04-16 22:20:36 +00:00
|
|
|
return *n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __u16 fs16_to_cpu(struct sysv_sb_info *sbi, __fs16 n)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex != BYTESEX_BE)
|
|
|
|
|
return le16_to_cpu((__force __le16)n);
|
|
|
|
|
else
|
|
|
|
|
return be16_to_cpu((__force __be16)n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __fs16 cpu_to_fs16(struct sysv_sb_info *sbi, __u16 n)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex != BYTESEX_BE)
|
|
|
|
|
return (__force __fs16)cpu_to_le16(n);
|
|
|
|
|
else
|
|
|
|
|
return (__force __fs16)cpu_to_be16(n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline __fs16 fs16_add(struct sysv_sb_info *sbi, __fs16 *n, int d)
|
|
|
|
|
{
|
|
|
|
|
if (sbi->s_bytesex != BYTESEX_BE)
|
2008-04-30 07:54:49 +00:00
|
|
|
le16_add_cpu((__le16 *)n, d);
|
2005-04-16 22:20:36 +00:00
|
|
|
else
|
2008-04-30 07:54:49 +00:00
|
|
|
be16_add_cpu((__be16 *)n, d);
|
2005-04-16 22:20:36 +00:00
|
|
|
return *n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* _SYSV_H */
|
