mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-26 10:49:33 +00:00
![Greg Kroah-Hartman](/assets/img/avatar_default.png)
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>
201 lines
6.7 KiB
C
201 lines
6.7 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
File: fs/ext4/xattr.h
|
|
|
|
On-disk format of extended attributes for the ext4 filesystem.
|
|
|
|
(C) 2001 Andreas Gruenbacher, <a.gruenbacher@computer.org>
|
|
*/
|
|
|
|
#include <linux/xattr.h>
|
|
|
|
/* Magic value in attribute blocks */
|
|
#define EXT4_XATTR_MAGIC 0xEA020000
|
|
|
|
/* Maximum number of references to one attribute block */
|
|
#define EXT4_XATTR_REFCOUNT_MAX 1024
|
|
|
|
/* Name indexes */
|
|
#define EXT4_XATTR_INDEX_USER 1
|
|
#define EXT4_XATTR_INDEX_POSIX_ACL_ACCESS 2
|
|
#define EXT4_XATTR_INDEX_POSIX_ACL_DEFAULT 3
|
|
#define EXT4_XATTR_INDEX_TRUSTED 4
|
|
#define EXT4_XATTR_INDEX_LUSTRE 5
|
|
#define EXT4_XATTR_INDEX_SECURITY 6
|
|
#define EXT4_XATTR_INDEX_SYSTEM 7
|
|
#define EXT4_XATTR_INDEX_RICHACL 8
|
|
#define EXT4_XATTR_INDEX_ENCRYPTION 9
|
|
#define EXT4_XATTR_INDEX_HURD 10 /* Reserved for Hurd */
|
|
|
|
struct ext4_xattr_header {
|
|
__le32 h_magic; /* magic number for identification */
|
|
__le32 h_refcount; /* reference count */
|
|
__le32 h_blocks; /* number of disk blocks used */
|
|
__le32 h_hash; /* hash value of all attributes */
|
|
__le32 h_checksum; /* crc32c(uuid+id+xattrblock) */
|
|
/* id = inum if refcount=1, blknum otherwise */
|
|
__u32 h_reserved[3]; /* zero right now */
|
|
};
|
|
|
|
struct ext4_xattr_ibody_header {
|
|
__le32 h_magic; /* magic number for identification */
|
|
};
|
|
|
|
struct ext4_xattr_entry {
|
|
__u8 e_name_len; /* length of name */
|
|
__u8 e_name_index; /* attribute name index */
|
|
__le16 e_value_offs; /* offset in disk block of value */
|
|
__le32 e_value_inum; /* inode in which the value is stored */
|
|
__le32 e_value_size; /* size of attribute value */
|
|
__le32 e_hash; /* hash value of name and value */
|
|
char e_name[0]; /* attribute name */
|
|
};
|
|
|
|
#define EXT4_XATTR_PAD_BITS 2
|
|
#define EXT4_XATTR_PAD (1<<EXT4_XATTR_PAD_BITS)
|
|
#define EXT4_XATTR_ROUND (EXT4_XATTR_PAD-1)
|
|
#define EXT4_XATTR_LEN(name_len) \
|
|
(((name_len) + EXT4_XATTR_ROUND + \
|
|
sizeof(struct ext4_xattr_entry)) & ~EXT4_XATTR_ROUND)
|
|
#define EXT4_XATTR_NEXT(entry) \
|
|
((struct ext4_xattr_entry *)( \
|
|
(char *)(entry) + EXT4_XATTR_LEN((entry)->e_name_len)))
|
|
#define EXT4_XATTR_SIZE(size) \
|
|
(((size) + EXT4_XATTR_ROUND) & ~EXT4_XATTR_ROUND)
|
|
|
|
#define IHDR(inode, raw_inode) \
|
|
((struct ext4_xattr_ibody_header *) \
|
|
((void *)raw_inode + \
|
|
EXT4_GOOD_OLD_INODE_SIZE + \
|
|
EXT4_I(inode)->i_extra_isize))
|
|
#define IFIRST(hdr) ((struct ext4_xattr_entry *)((hdr)+1))
|
|
|
|
/*
|
|
* The minimum size of EA value when you start storing it in an external inode
|
|
* size of block - size of header - size of 1 entry - 4 null bytes
|
|
*/
|
|
#define EXT4_XATTR_MIN_LARGE_EA_SIZE(b) \
|
|
((b) - EXT4_XATTR_LEN(3) - sizeof(struct ext4_xattr_header) - 4)
|
|
|
|
#define BHDR(bh) ((struct ext4_xattr_header *)((bh)->b_data))
|
|
#define ENTRY(ptr) ((struct ext4_xattr_entry *)(ptr))
|
|
#define BFIRST(bh) ENTRY(BHDR(bh)+1)
|
|
#define IS_LAST_ENTRY(entry) (*(__u32 *)(entry) == 0)
|
|
|
|
#define EXT4_ZERO_XATTR_VALUE ((void *)-1)
|
|
|
|
struct ext4_xattr_info {
|
|
const char *name;
|
|
const void *value;
|
|
size_t value_len;
|
|
int name_index;
|
|
int in_inode;
|
|
};
|
|
|
|
struct ext4_xattr_search {
|
|
struct ext4_xattr_entry *first;
|
|
void *base;
|
|
void *end;
|
|
struct ext4_xattr_entry *here;
|
|
int not_found;
|
|
};
|
|
|
|
struct ext4_xattr_ibody_find {
|
|
struct ext4_xattr_search s;
|
|
struct ext4_iloc iloc;
|
|
};
|
|
|
|
struct ext4_xattr_inode_array {
|
|
unsigned int count; /* # of used items in the array */
|
|
struct inode *inodes[0];
|
|
};
|
|
|
|
extern const struct xattr_handler ext4_xattr_user_handler;
|
|
extern const struct xattr_handler ext4_xattr_trusted_handler;
|
|
extern const struct xattr_handler ext4_xattr_security_handler;
|
|
|
|
#define EXT4_XATTR_NAME_ENCRYPTION_CONTEXT "c"
|
|
|
|
/*
|
|
* The EXT4_STATE_NO_EXPAND is overloaded and used for two purposes.
|
|
* The first is to signal that there the inline xattrs and data are
|
|
* taking up so much space that we might as well not keep trying to
|
|
* expand it. The second is that xattr_sem is taken for writing, so
|
|
* we shouldn't try to recurse into the inode expansion. For this
|
|
* second case, we need to make sure that we take save and restore the
|
|
* NO_EXPAND state flag appropriately.
|
|
*/
|
|
static inline void ext4_write_lock_xattr(struct inode *inode, int *save)
|
|
{
|
|
down_write(&EXT4_I(inode)->xattr_sem);
|
|
*save = ext4_test_inode_state(inode, EXT4_STATE_NO_EXPAND);
|
|
ext4_set_inode_state(inode, EXT4_STATE_NO_EXPAND);
|
|
}
|
|
|
|
static inline int ext4_write_trylock_xattr(struct inode *inode, int *save)
|
|
{
|
|
if (down_write_trylock(&EXT4_I(inode)->xattr_sem) == 0)
|
|
return 0;
|
|
*save = ext4_test_inode_state(inode, EXT4_STATE_NO_EXPAND);
|
|
ext4_set_inode_state(inode, EXT4_STATE_NO_EXPAND);
|
|
return 1;
|
|
}
|
|
|
|
static inline void ext4_write_unlock_xattr(struct inode *inode, int *save)
|
|
{
|
|
if (*save == 0)
|
|
ext4_clear_inode_state(inode, EXT4_STATE_NO_EXPAND);
|
|
up_write(&EXT4_I(inode)->xattr_sem);
|
|
}
|
|
|
|
extern ssize_t ext4_listxattr(struct dentry *, char *, size_t);
|
|
|
|
extern int ext4_xattr_get(struct inode *, int, const char *, void *, size_t);
|
|
extern int ext4_xattr_set(struct inode *, int, const char *, const void *, size_t, int);
|
|
extern int ext4_xattr_set_handle(handle_t *, struct inode *, int, const char *, const void *, size_t, int);
|
|
extern int ext4_xattr_set_credits(struct inode *inode, size_t value_len,
|
|
bool is_create, int *credits);
|
|
extern int __ext4_xattr_set_credits(struct super_block *sb, struct inode *inode,
|
|
struct buffer_head *block_bh, size_t value_len,
|
|
bool is_create);
|
|
|
|
extern int ext4_xattr_delete_inode(handle_t *handle, struct inode *inode,
|
|
struct ext4_xattr_inode_array **array,
|
|
int extra_credits);
|
|
extern void ext4_xattr_inode_array_free(struct ext4_xattr_inode_array *array);
|
|
|
|
extern int ext4_expand_extra_isize_ea(struct inode *inode, int new_extra_isize,
|
|
struct ext4_inode *raw_inode, handle_t *handle);
|
|
|
|
extern const struct xattr_handler *ext4_xattr_handlers[];
|
|
|
|
extern int ext4_xattr_ibody_find(struct inode *inode, struct ext4_xattr_info *i,
|
|
struct ext4_xattr_ibody_find *is);
|
|
extern int ext4_xattr_ibody_get(struct inode *inode, int name_index,
|
|
const char *name,
|
|
void *buffer, size_t buffer_size);
|
|
extern int ext4_xattr_ibody_inline_set(handle_t *handle, struct inode *inode,
|
|
struct ext4_xattr_info *i,
|
|
struct ext4_xattr_ibody_find *is);
|
|
|
|
extern struct mb_cache *ext4_xattr_create_cache(void);
|
|
extern void ext4_xattr_destroy_cache(struct mb_cache *);
|
|
|
|
#ifdef CONFIG_EXT4_FS_SECURITY
|
|
extern int ext4_init_security(handle_t *handle, struct inode *inode,
|
|
struct inode *dir, const struct qstr *qstr);
|
|
#else
|
|
static inline int ext4_init_security(handle_t *handle, struct inode *inode,
|
|
struct inode *dir, const struct qstr *qstr)
|
|
{
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
#ifdef CONFIG_LOCKDEP
|
|
extern void ext4_xattr_inode_set_class(struct inode *ea_inode);
|
|
#else
|
|
static inline void ext4_xattr_inode_set_class(struct inode *ea_inode) { }
|
|
#endif
|
|
|
|
extern int ext4_get_inode_usage(struct inode *inode, qsize_t *usage);
|