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 22:07:57 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* linux/fs/hfs/btree.h
|
|
|
|
|
*
|
|
|
|
|
* Copyright (C) 2001
|
|
|
|
|
* Brad Boyer (flar@allandria.com)
|
|
|
|
|
* (C) 2003 Ardis Technologies <roman@ardistech.com>
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "hfs_fs.h"
|
|
|
|
|
|
|
|
|
|
typedef int (*btree_keycmp)(const btree_key *, const btree_key *);
|
|
|
|
|
|
|
|
|
|
#define NODE_HASH_SIZE 256
|
|
|
|
|
|
|
|
|
|
/* A HFS BTree held in memory */
|
|
|
|
|
struct hfs_btree {
|
|
|
|
|
struct super_block *sb;
|
|
|
|
|
struct inode *inode;
|
|
|
|
|
btree_keycmp keycmp;
|
|
|
|
|
|
|
|
|
|
u32 cnid;
|
|
|
|
|
u32 root;
|
|
|
|
|
u32 leaf_count;
|
|
|
|
|
u32 leaf_head;
|
|
|
|
|
u32 leaf_tail;
|
|
|
|
|
u32 node_count;
|
|
|
|
|
u32 free_nodes;
|
|
|
|
|
u32 attributes;
|
|
|
|
|
|
|
|
|
|
unsigned int node_size;
|
|
|
|
|
unsigned int node_size_shift;
|
|
|
|
|
unsigned int max_key_len;
|
|
|
|
|
unsigned int depth;
|
|
|
|
|
|
|
|
|
|
//unsigned int map1_size, map_size;
|
2010-09-07 22:33:08 +08:00
|
|
|
struct mutex tree_lock;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
unsigned int pages_per_bnode;
|
|
|
|
|
spinlock_t hash_lock;
|
|
|
|
|
struct hfs_bnode *node_hash[NODE_HASH_SIZE];
|
|
|
|
|
int node_hash_cnt;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* A HFS BTree node in memory */
|
|
|
|
|
struct hfs_bnode {
|
|
|
|
|
struct hfs_btree *tree;
|
|
|
|
|
|
|
|
|
|
u32 prev;
|
|
|
|
|
u32 this;
|
|
|
|
|
u32 next;
|
|
|
|
|
u32 parent;
|
|
|
|
|
|
|
|
|
|
u16 num_recs;
|
|
|
|
|
u8 type;
|
|
|
|
|
u8 height;
|
|
|
|
|
|
|
|
|
|
struct hfs_bnode *next_hash;
|
|
|
|
|
unsigned long flags;
|
|
|
|
|
wait_queue_head_t lock_wq;
|
|
|
|
|
atomic_t refcnt;
|
|
|
|
|
unsigned int page_offset;
|
|
|
|
|
struct page *page[0];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define HFS_BNODE_ERROR 0
|
|
|
|
|
#define HFS_BNODE_NEW 1
|
|
|
|
|
#define HFS_BNODE_DELETED 2
|
|
|
|
|
|
|
|
|
|
struct hfs_find_data {
|
|
|
|
|
btree_key *key;
|
|
|
|
|
btree_key *search_key;
|
|
|
|
|
struct hfs_btree *tree;
|
|
|
|
|
struct hfs_bnode *bnode;
|
|
|
|
|
int record;
|
|
|
|
|
int keyoffset, keylength;
|
|
|
|
|
int entryoffset, entrylength;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* btree.c */
|
|
|
|
|
extern struct hfs_btree *hfs_btree_open(struct super_block *, u32, btree_keycmp);
|
|
|
|
|
extern void hfs_btree_close(struct hfs_btree *);
|
|
|
|
|
extern void hfs_btree_write(struct hfs_btree *);
|
2018-10-31 06:06:17 +08:00
|
|
|
extern int hfs_bmap_reserve(struct hfs_btree *, int);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern struct hfs_bnode * hfs_bmap_alloc(struct hfs_btree *);
|
|
|
|
|
extern void hfs_bmap_free(struct hfs_bnode *node);
|
|
|
|
|
|
|
|
|
|
/* bnode.c */
|
|
|
|
|
extern void hfs_bnode_read(struct hfs_bnode *, void *, int, int);
|
|
|
|
|
extern u16 hfs_bnode_read_u16(struct hfs_bnode *, int);
|
|
|
|
|
extern u8 hfs_bnode_read_u8(struct hfs_bnode *, int);
|
|
|
|
|
extern void hfs_bnode_read_key(struct hfs_bnode *, void *, int);
|
|
|
|
|
extern void hfs_bnode_write(struct hfs_bnode *, void *, int, int);
|
|
|
|
|
extern void hfs_bnode_write_u16(struct hfs_bnode *, int, u16);
|
|
|
|
|
extern void hfs_bnode_write_u8(struct hfs_bnode *, int, u8);
|
|
|
|
|
extern void hfs_bnode_clear(struct hfs_bnode *, int, int);
|
|
|
|
|
extern void hfs_bnode_copy(struct hfs_bnode *, int,
|
|
|
|
|
struct hfs_bnode *, int, int);
|
|
|
|
|
extern void hfs_bnode_move(struct hfs_bnode *, int, int, int);
|
|
|
|
|
extern void hfs_bnode_dump(struct hfs_bnode *);
|
|
|
|
|
extern void hfs_bnode_unlink(struct hfs_bnode *);
|
|
|
|
|
extern struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *, u32);
|
|
|
|
|
extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
|
|
|
|
|
extern void hfs_bnode_unhash(struct hfs_bnode *);
|
|
|
|
|
extern void hfs_bnode_free(struct hfs_bnode *);
|
|
|
|
|
extern struct hfs_bnode *hfs_bnode_create(struct hfs_btree *, u32);
|
|
|
|
|
extern void hfs_bnode_get(struct hfs_bnode *);
|
|
|
|
|
extern void hfs_bnode_put(struct hfs_bnode *);
|
|
|
|
|
|
|
|
|
|
/* brec.c */
|
|
|
|
|
extern u16 hfs_brec_lenoff(struct hfs_bnode *, u16, u16 *);
|
|
|
|
|
extern u16 hfs_brec_keylen(struct hfs_bnode *, u16);
|
|
|
|
|
extern int hfs_brec_insert(struct hfs_find_data *, void *, int);
|
|
|
|
|
extern int hfs_brec_remove(struct hfs_find_data *);
|
|
|
|
|
|
|
|
|
|
/* bfind.c */
|
|
|
|
|
extern int hfs_find_init(struct hfs_btree *, struct hfs_find_data *);
|
|
|
|
|
extern void hfs_find_exit(struct hfs_find_data *);
|
|
|
|
|
extern int __hfs_brec_find(struct hfs_bnode *, struct hfs_find_data *);
|
|
|
|
|
extern int hfs_brec_find(struct hfs_find_data *);
|
|
|
|
|
extern int hfs_brec_read(struct hfs_find_data *, void *, int);
|
|
|
|
|
extern int hfs_brec_goto(struct hfs_find_data *, int);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
struct hfs_bnode_desc {
|
|
|
|
|
__be32 next; /* (V) Number of the next node at this level */
|
|
|
|
|
__be32 prev; /* (V) Number of the prev node at this level */
|
|
|
|
|
u8 type; /* (F) The type of node */
|
|
|
|
|
u8 height; /* (F) The level of this node (leaves=1) */
|
|
|
|
|
__be16 num_recs; /* (V) The number of records in this node */
|
|
|
|
|
u16 reserved;
|
|
|
|
|
} __packed;
|
|
|
|
|
|
|
|
|
|
#define HFS_NODE_INDEX 0x00 /* An internal (index) node */
|
|
|
|
|
#define HFS_NODE_HEADER 0x01 /* The tree header node (node 0) */
|
|
|
|
|
#define HFS_NODE_MAP 0x02 /* Holds part of the bitmap of used nodes */
|
|
|
|
|
#define HFS_NODE_LEAF 0xFF /* A leaf (ndNHeight==1) node */
|
|
|
|
|
|
|
|
|
|
struct hfs_btree_header_rec {
|
|
|
|
|
__be16 depth; /* (V) The number of levels in this B-tree */
|
|
|
|
|
__be32 root; /* (V) The node number of the root node */
|
|
|
|
|
__be32 leaf_count; /* (V) The number of leaf records */
|
|
|
|
|
__be32 leaf_head; /* (V) The number of the first leaf node */
|
|
|
|
|
__be32 leaf_tail; /* (V) The number of the last leaf node */
|
|
|
|
|
__be16 node_size; /* (F) The number of bytes in a node (=512) */
|
|
|
|
|
__be16 max_key_len; /* (F) The length of a key in an index node */
|
|
|
|
|
__be32 node_count; /* (V) The total number of nodes */
|
|
|
|
|
__be32 free_nodes; /* (V) The number of unused nodes */
|
|
|
|
|
u16 reserved1;
|
|
|
|
|
__be32 clump_size; /* (F) clump size. not usually used. */
|
|
|
|
|
u8 btree_type; /* (F) BTree type */
|
|
|
|
|
u8 reserved2;
|
|
|
|
|
__be32 attributes; /* (F) attributes */
|
|
|
|
|
u32 reserved3[16];
|
|
|
|
|
} __packed;
|
|
|
|
|
|
|
|
|
|
#define BTREE_ATTR_BADCLOSE 0x00000001 /* b-tree not closed properly. not
|
|
|
|
|
used by hfsplus. */
|
|
|
|
|
#define HFS_TREE_BIGKEYS 0x00000002 /* key length is u16 instead of u8.
|
|
|
|
|
used by hfsplus. */
|
|
|
|
|
#define HFS_TREE_VARIDXKEYS 0x00000004 /* variable key length instead of
|
|
|
|
|
max key length. use din catalog
|
|
|
|
|
b-tree but not in extents
|
|
|
|
|
b-tree (hfsplus). */
|
