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-06-22 00:17:14 +00:00
|
|
|
/*
|
|
|
|
* bitmap.h: Copyright (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003
|
|
|
|
*
|
|
|
|
* additions: Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.
|
|
|
|
*/
|
|
|
|
#ifndef BITMAP_H
|
|
|
|
#define BITMAP_H 1
|
|
|
|
|
2005-11-09 05:39:32 +00:00
|
|
|
#define BITMAP_MAJOR_LO 3
|
|
|
|
/* version 4 insists the bitmap is in little-endian order
|
|
|
|
* with version 3, it is host-endian which is non-portable
|
2015-08-18 21:35:54 +00:00
|
|
|
* Version 5 is currently set only for clustered devices
|
2005-11-09 05:39:32 +00:00
|
|
|
*/
|
|
|
|
#define BITMAP_MAJOR_HI 4
|
2015-08-18 21:35:54 +00:00
|
|
|
#define BITMAP_MAJOR_CLUSTERED 5
|
2005-11-09 05:39:32 +00:00
|
|
|
#define BITMAP_MAJOR_HOSTENDIAN 3
|
|
|
|
|
2005-06-22 00:17:14 +00:00
|
|
|
/*
|
|
|
|
* in-memory bitmap:
|
|
|
|
*
|
|
|
|
* Use 16 bit block counters to track pending writes to each "chunk".
|
|
|
|
* The 2 high order bits are special-purpose, the first is a flag indicating
|
|
|
|
* whether a resync is needed. The second is a flag indicating whether a
|
|
|
|
* resync is active.
|
|
|
|
* This means that the counter is actually 14 bits:
|
|
|
|
*
|
|
|
|
* +--------+--------+------------------------------------------------+
|
|
|
|
* | resync | resync | counter |
|
|
|
|
* | needed | active | |
|
|
|
|
* | (0-1) | (0-1) | (0-16383) |
|
|
|
|
* +--------+--------+------------------------------------------------+
|
|
|
|
*
|
|
|
|
* The "resync needed" bit is set when:
|
|
|
|
* a '1' bit is read from storage at startup.
|
|
|
|
* a write request fails on some drives
|
|
|
|
* a resync is aborted on a chunk with 'resync active' set
|
|
|
|
* It is cleared (and resync-active set) when a resync starts across all drives
|
|
|
|
* of the chunk.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* The "resync active" bit is set when:
|
|
|
|
* a resync is started on all drives, and resync_needed is set.
|
|
|
|
* resync_needed will be cleared (as long as resync_active wasn't already set).
|
|
|
|
* It is cleared when a resync completes.
|
|
|
|
*
|
|
|
|
* The counter counts pending write requests, plus the on-disk bit.
|
|
|
|
* When the counter is '1' and the resync bits are clear, the on-disk
|
2011-03-31 01:57:33 +00:00
|
|
|
* bit can be cleared as well, thus setting the counter to 0.
|
2005-06-22 00:17:14 +00:00
|
|
|
* When we set a bit, or in the counter (to start a write), if the fields is
|
|
|
|
* 0, we first set the disk bit and set the counter to 1.
|
|
|
|
*
|
2016-03-14 09:01:39 +00:00
|
|
|
* If the counter is 0, the on-disk bit is clear and the stripe is clean
|
|
|
|
* Anything that dirties the stripe pushes the counter to 2 (at least)
|
2005-06-22 00:17:14 +00:00
|
|
|
* and sets the on-disk bit (lazily).
|
|
|
|
* If a periodic sweep find the counter at 2, it is decremented to 1.
|
|
|
|
* If the sweep find the counter at 1, the on-disk bit is cleared and the
|
|
|
|
* counter goes to zero.
|
|
|
|
*
|
|
|
|
* Also, we'll hijack the "map" pointer itself and use it as two 16 bit block
|
|
|
|
* counters as a fallback when "page" memory cannot be allocated:
|
|
|
|
*
|
|
|
|
* Normal case (page memory allocated):
|
|
|
|
*
|
|
|
|
* page pointer (32-bit)
|
|
|
|
*
|
|
|
|
* [ ] ------+
|
|
|
|
* |
|
|
|
|
* +-------> [ ][ ]..[ ] (4096 byte page == 2048 counters)
|
|
|
|
* c1 c2 c2048
|
|
|
|
*
|
|
|
|
* Hijacked case (page memory allocation failed):
|
|
|
|
*
|
|
|
|
* hijacked page pointer (32-bit)
|
|
|
|
*
|
|
|
|
* [ ][ ] (no page memory allocated)
|
|
|
|
* counter #1 (16-bit) counter #2 (16-bit)
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
|
|
|
#define PAGE_BITS (PAGE_SIZE << 3)
|
|
|
|
#define PAGE_BIT_SHIFT (PAGE_SHIFT + 3)
|
|
|
|
|
|
|
|
typedef __u16 bitmap_counter_t;
|
|
|
|
#define COUNTER_BITS 16
|
|
|
|
#define COUNTER_BIT_SHIFT 4
|
|
|
|
#define COUNTER_BYTE_SHIFT (COUNTER_BIT_SHIFT - 3)
|
|
|
|
|
|
|
|
#define NEEDED_MASK ((bitmap_counter_t) (1 << (COUNTER_BITS - 1)))
|
|
|
|
#define RESYNC_MASK ((bitmap_counter_t) (1 << (COUNTER_BITS - 2)))
|
|
|
|
#define COUNTER_MAX ((bitmap_counter_t) RESYNC_MASK - 1)
|
|
|
|
#define NEEDED(x) (((bitmap_counter_t) x) & NEEDED_MASK)
|
|
|
|
#define RESYNC(x) (((bitmap_counter_t) x) & RESYNC_MASK)
|
|
|
|
#define COUNTER(x) (((bitmap_counter_t) x) & COUNTER_MAX)
|
|
|
|
|
|
|
|
/* how many counters per page? */
|
|
|
|
#define PAGE_COUNTER_RATIO (PAGE_BITS / COUNTER_BITS)
|
|
|
|
/* same, except a shift value for more efficient bitops */
|
|
|
|
#define PAGE_COUNTER_SHIFT (PAGE_BIT_SHIFT - COUNTER_BIT_SHIFT)
|
|
|
|
/* same, except a mask value for more efficient bitops */
|
|
|
|
#define PAGE_COUNTER_MASK (PAGE_COUNTER_RATIO - 1)
|
|
|
|
|
|
|
|
#define BITMAP_BLOCK_SHIFT 9
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* bitmap structures:
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define BITMAP_MAGIC 0x6d746962
|
|
|
|
|
|
|
|
/* use these for bitmap->flags and bitmap->sb->state bit-fields */
|
|
|
|
enum bitmap_state {
|
2012-05-22 03:55:15 +00:00
|
|
|
BITMAP_STALE = 1, /* the bitmap file is out of date or had -EIO */
|
|
|
|
BITMAP_WRITE_ERROR = 2, /* A write error has occurred */
|
|
|
|
BITMAP_HOSTENDIAN =15,
|
2005-06-22 00:17:14 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* the superblock at the front of the bitmap file -- little endian */
|
|
|
|
typedef struct bitmap_super_s {
|
2006-10-21 17:24:09 +00:00
|
|
|
__le32 magic; /* 0 BITMAP_MAGIC */
|
|
|
|
__le32 version; /* 4 the bitmap major for now, could change... */
|
|
|
|
__u8 uuid[16]; /* 8 128 bit uuid - must match md device uuid */
|
|
|
|
__le64 events; /* 24 event counter for the bitmap (1)*/
|
|
|
|
__le64 events_cleared;/*32 event counter when last bit cleared (2) */
|
|
|
|
__le64 sync_size; /* 40 the size of the md device's sync range(3) */
|
|
|
|
__le32 state; /* 48 bitmap state information */
|
|
|
|
__le32 chunksize; /* 52 the bitmap chunk size in bytes */
|
|
|
|
__le32 daemon_sleep; /* 56 seconds between disk flushes */
|
|
|
|
__le32 write_behind; /* 60 number of outstanding write-behind writes */
|
2012-05-22 03:55:34 +00:00
|
|
|
__le32 sectors_reserved; /* 64 number of 512-byte sectors that are
|
|
|
|
* reserved for the bitmap. */
|
2014-03-07 16:30:43 +00:00
|
|
|
__le32 nodes; /* 68 the maximum number of nodes in cluster. */
|
2014-03-30 05:42:49 +00:00
|
|
|
__u8 cluster_name[64]; /* 72 cluster name to which this md belongs */
|
|
|
|
__u8 pad[256 - 136]; /* set to zero */
|
2005-06-22 00:17:14 +00:00
|
|
|
} bitmap_super_t;
|
|
|
|
|
|
|
|
/* notes:
|
|
|
|
* (1) This event counter is updated before the eventcounter in the md superblock
|
|
|
|
* When a bitmap is loaded, it is only accepted if this event counter is equal
|
|
|
|
* to, or one greater than, the event counter in the superblock.
|
|
|
|
* (2) This event counter is updated when the other one is *if*and*only*if* the
|
|
|
|
* array is not degraded. As bits are not cleared when the array is degraded,
|
|
|
|
* this represents the last time that any bits were cleared.
|
|
|
|
* If a device is being added that has an event count with this value or
|
|
|
|
* higher, it is accepted as conforming to the bitmap.
|
|
|
|
* (3)This is the number of sectors represented by the bitmap, and is the range that
|
|
|
|
* resync happens across. For raid1 and raid5/6 it is the size of individual
|
|
|
|
* devices. For raid10 it is the size of the array.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
|
|
|
/* the in-memory bitmap is represented by bitmap_pages */
|
|
|
|
struct bitmap_page {
|
|
|
|
/*
|
|
|
|
* map points to the actual memory page
|
|
|
|
*/
|
|
|
|
char *map;
|
|
|
|
/*
|
|
|
|
* in emergencies (when map cannot be alloced), hijack the map
|
|
|
|
* pointer and use it as two counters itself
|
|
|
|
*/
|
|
|
|
unsigned int hijacked:1;
|
2012-05-22 03:55:06 +00:00
|
|
|
/*
|
|
|
|
* If any counter in this page is '1' or '2' - and so could be
|
|
|
|
* cleared then that page is marked as 'pending'
|
|
|
|
*/
|
|
|
|
unsigned int pending:1;
|
2005-06-22 00:17:14 +00:00
|
|
|
/*
|
|
|
|
* count of dirty bits on the page
|
|
|
|
*/
|
2012-05-22 03:55:06 +00:00
|
|
|
unsigned int count:30;
|
2005-06-22 00:17:14 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* the main bitmap structure - one per mddev */
|
|
|
|
struct bitmap {
|
|
|
|
|
2012-05-22 03:55:24 +00:00
|
|
|
struct bitmap_counts {
|
|
|
|
spinlock_t lock;
|
|
|
|
struct bitmap_page *bp;
|
|
|
|
unsigned long pages; /* total number of pages
|
|
|
|
* in the bitmap */
|
|
|
|
unsigned long missing_pages; /* number of pages
|
|
|
|
* not yet allocated */
|
|
|
|
unsigned long chunkshift; /* chunksize = 2^chunkshift
|
|
|
|
* (for bitops) */
|
|
|
|
unsigned long chunks; /* Total number of data
|
|
|
|
* chunks for the array */
|
|
|
|
} counts;
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2012-05-22 03:55:24 +00:00
|
|
|
struct mddev *mddev; /* the md device that the bitmap is for */
|
2005-06-22 00:17:14 +00:00
|
|
|
|
|
|
|
__u64 events_cleared;
|
2008-06-27 22:31:22 +00:00
|
|
|
int need_sync;
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2012-05-22 03:55:10 +00:00
|
|
|
struct bitmap_storage {
|
|
|
|
struct file *file; /* backing disk file */
|
|
|
|
struct page *sb_page; /* cached copy of the bitmap
|
|
|
|
* file superblock */
|
|
|
|
struct page **filemap; /* list of cache pages for
|
|
|
|
* the file */
|
|
|
|
unsigned long *filemap_attr; /* attributes associated
|
|
|
|
* w/ filemap pages */
|
|
|
|
unsigned long file_pages; /* number of pages in the file*/
|
2012-05-22 03:55:11 +00:00
|
|
|
unsigned long bytes; /* total bytes in the bitmap */
|
2012-05-22 03:55:10 +00:00
|
|
|
} storage;
|
2005-06-22 00:17:14 +00:00
|
|
|
|
|
|
|
unsigned long flags;
|
|
|
|
|
2008-03-04 22:29:30 +00:00
|
|
|
int allclean;
|
|
|
|
|
2005-09-09 23:23:47 +00:00
|
|
|
atomic_t behind_writes;
|
2010-03-08 05:02:37 +00:00
|
|
|
unsigned long behind_writes_used; /* highest actual value at runtime */
|
2005-09-09 23:23:47 +00:00
|
|
|
|
2005-06-22 00:17:14 +00:00
|
|
|
/*
|
|
|
|
* the bitmap daemon - periodically wakes up and sweeps the bitmap
|
|
|
|
* file, cleaning up bits and flushing out pages to disk as necessary
|
|
|
|
*/
|
|
|
|
unsigned long daemon_lastrun; /* jiffies of last run */
|
2008-02-06 09:39:50 +00:00
|
|
|
unsigned long last_end_sync; /* when we lasted called end_sync to
|
|
|
|
* update bitmap with resync progress */
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2006-06-26 07:27:48 +00:00
|
|
|
atomic_t pending_writes; /* pending writes to the bitmap file */
|
|
|
|
wait_queue_head_t write_wait;
|
2007-02-08 22:20:37 +00:00
|
|
|
wait_queue_head_t overflow_wait;
|
2010-03-31 00:21:44 +00:00
|
|
|
wait_queue_head_t behind_wait;
|
2006-06-26 07:27:48 +00:00
|
|
|
|
2013-12-11 19:11:53 +00:00
|
|
|
struct kernfs_node *sysfs_can_clear;
|
2014-06-06 16:50:56 +00:00
|
|
|
int cluster_slot; /* Slot offset for clustered env */
|
2005-06-22 00:17:14 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* the bitmap API */
|
|
|
|
|
|
|
|
/* these are used only by md/bitmap */
|
2018-08-01 22:20:50 +00:00
|
|
|
struct bitmap *md_bitmap_create(struct mddev *mddev, int slot);
|
|
|
|
int md_bitmap_load(struct mddev *mddev);
|
|
|
|
void md_bitmap_flush(struct mddev *mddev);
|
|
|
|
void md_bitmap_destroy(struct mddev *mddev);
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2018-08-01 22:20:50 +00:00
|
|
|
void md_bitmap_print_sb(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_update_sb(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_status(struct seq_file *seq, struct bitmap *bitmap);
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2018-08-01 22:20:50 +00:00
|
|
|
int md_bitmap_setallbits(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_write_all(struct bitmap *bitmap);
|
2005-06-22 00:17:14 +00:00
|
|
|
|
2018-08-01 22:20:50 +00:00
|
|
|
void md_bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e);
|
2006-10-03 08:15:49 +00:00
|
|
|
|
2005-06-22 00:17:14 +00:00
|
|
|
/* these are exported */
|
2018-08-01 22:20:50 +00:00
|
|
|
int md_bitmap_startwrite(struct bitmap *bitmap, sector_t offset,
|
|
|
|
unsigned long sectors, int behind);
|
|
|
|
void md_bitmap_endwrite(struct bitmap *bitmap, sector_t offset,
|
2005-09-09 23:23:47 +00:00
|
|
|
unsigned long sectors, int success, int behind);
|
2018-08-01 22:20:50 +00:00
|
|
|
int md_bitmap_start_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int degraded);
|
|
|
|
void md_bitmap_end_sync(struct bitmap *bitmap, sector_t offset, sector_t *blocks, int aborted);
|
|
|
|
void md_bitmap_close_sync(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector, bool force);
|
|
|
|
void md_bitmap_sync_with_cluster(struct mddev *mddev,
|
|
|
|
sector_t old_lo, sector_t old_hi,
|
|
|
|
sector_t new_lo, sector_t new_hi);
|
|
|
|
|
|
|
|
void md_bitmap_unplug(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_daemon_work(struct mddev *mddev);
|
|
|
|
|
|
|
|
int md_bitmap_resize(struct bitmap *bitmap, sector_t blocks,
|
|
|
|
int chunksize, int init);
|
2017-03-01 08:42:39 +00:00
|
|
|
struct bitmap *get_bitmap_from_slot(struct mddev *mddev, int slot);
|
2018-08-01 22:20:50 +00:00
|
|
|
int md_bitmap_copy_from_slot(struct mddev *mddev, int slot,
|
|
|
|
sector_t *lo, sector_t *hi, bool clear_bits);
|
|
|
|
void md_bitmap_free(struct bitmap *bitmap);
|
|
|
|
void md_bitmap_wait_behind_writes(struct mddev *mddev);
|
2005-06-22 00:17:14 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif
|