mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-18 21:16:51 +07:00
b24413180f
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>
251 lines
6.7 KiB
C
251 lines
6.7 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* linux/drivers/mtd/onenand/onenand_bbt.c
|
|
*
|
|
* Bad Block Table support for the OneNAND driver
|
|
*
|
|
* Copyright(c) 2005 Samsung Electronics
|
|
* Kyungmin Park <kyungmin.park@samsung.com>
|
|
*
|
|
* Derived from nand_bbt.c
|
|
*
|
|
* TODO:
|
|
* Split BBT core and chip specific BBT.
|
|
*/
|
|
|
|
#include <linux/slab.h>
|
|
#include <linux/mtd/mtd.h>
|
|
#include <linux/mtd/onenand.h>
|
|
#include <linux/export.h>
|
|
|
|
/**
|
|
* check_short_pattern - [GENERIC] check if a pattern is in the buffer
|
|
* @param buf the buffer to search
|
|
* @param len the length of buffer to search
|
|
* @param paglen the pagelength
|
|
* @param td search pattern descriptor
|
|
*
|
|
* Check for a pattern at the given place. Used to search bad block
|
|
* tables and good / bad block identifiers. Same as check_pattern, but
|
|
* no optional empty check and the pattern is expected to start
|
|
* at offset 0.
|
|
*
|
|
*/
|
|
static int check_short_pattern(uint8_t *buf, int len, int paglen, struct nand_bbt_descr *td)
|
|
{
|
|
int i;
|
|
uint8_t *p = buf;
|
|
|
|
/* Compare the pattern */
|
|
for (i = 0; i < td->len; i++) {
|
|
if (p[i] != td->pattern[i])
|
|
return -1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* create_bbt - [GENERIC] Create a bad block table by scanning the device
|
|
* @param mtd MTD device structure
|
|
* @param buf temporary buffer
|
|
* @param bd descriptor for the good/bad block search pattern
|
|
* @param chip create the table for a specific chip, -1 read all chips.
|
|
* Applies only if NAND_BBT_PERCHIP option is set
|
|
*
|
|
* Create a bad block table by scanning the device
|
|
* for the given good/bad block identify pattern
|
|
*/
|
|
static int create_bbt(struct mtd_info *mtd, uint8_t *buf, struct nand_bbt_descr *bd, int chip)
|
|
{
|
|
struct onenand_chip *this = mtd->priv;
|
|
struct bbm_info *bbm = this->bbm;
|
|
int i, j, numblocks, len, scanlen;
|
|
int startblock;
|
|
loff_t from;
|
|
size_t readlen, ooblen;
|
|
struct mtd_oob_ops ops;
|
|
int rgn;
|
|
|
|
printk(KERN_INFO "Scanning device for bad blocks\n");
|
|
|
|
len = 2;
|
|
|
|
/* We need only read few bytes from the OOB area */
|
|
scanlen = ooblen = 0;
|
|
readlen = bd->len;
|
|
|
|
/* chip == -1 case only */
|
|
/* Note that numblocks is 2 * (real numblocks) here;
|
|
* see i += 2 below as it makses shifting and masking less painful
|
|
*/
|
|
numblocks = this->chipsize >> (bbm->bbt_erase_shift - 1);
|
|
startblock = 0;
|
|
from = 0;
|
|
|
|
ops.mode = MTD_OPS_PLACE_OOB;
|
|
ops.ooblen = readlen;
|
|
ops.oobbuf = buf;
|
|
ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0;
|
|
|
|
for (i = startblock; i < numblocks; ) {
|
|
int ret;
|
|
|
|
for (j = 0; j < len; j++) {
|
|
/* No need to read pages fully,
|
|
* just read required OOB bytes */
|
|
ret = onenand_bbt_read_oob(mtd,
|
|
from + j * this->writesize + bd->offs, &ops);
|
|
|
|
/* If it is a initial bad block, just ignore it */
|
|
if (ret == ONENAND_BBT_READ_FATAL_ERROR)
|
|
return -EIO;
|
|
|
|
if (ret || check_short_pattern(&buf[j * scanlen],
|
|
scanlen, this->writesize, bd)) {
|
|
bbm->bbt[i >> 3] |= 0x03 << (i & 0x6);
|
|
printk(KERN_INFO "OneNAND eraseblock %d is an "
|
|
"initial bad block\n", i >> 1);
|
|
mtd->ecc_stats.badblocks++;
|
|
break;
|
|
}
|
|
}
|
|
i += 2;
|
|
|
|
if (FLEXONENAND(this)) {
|
|
rgn = flexonenand_region(mtd, from);
|
|
from += mtd->eraseregions[rgn].erasesize;
|
|
} else
|
|
from += (1 << bbm->bbt_erase_shift);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
/**
|
|
* onenand_memory_bbt - [GENERIC] create a memory based bad block table
|
|
* @param mtd MTD device structure
|
|
* @param bd descriptor for the good/bad block search pattern
|
|
*
|
|
* The function creates a memory based bbt by scanning the device
|
|
* for manufacturer / software marked good / bad blocks
|
|
*/
|
|
static inline int onenand_memory_bbt (struct mtd_info *mtd, struct nand_bbt_descr *bd)
|
|
{
|
|
struct onenand_chip *this = mtd->priv;
|
|
|
|
return create_bbt(mtd, this->page_buf, bd, -1);
|
|
}
|
|
|
|
/**
|
|
* onenand_isbad_bbt - [OneNAND Interface] Check if a block is bad
|
|
* @param mtd MTD device structure
|
|
* @param offs offset in the device
|
|
* @param allowbbt allow access to bad block table region
|
|
*/
|
|
static int onenand_isbad_bbt(struct mtd_info *mtd, loff_t offs, int allowbbt)
|
|
{
|
|
struct onenand_chip *this = mtd->priv;
|
|
struct bbm_info *bbm = this->bbm;
|
|
int block;
|
|
uint8_t res;
|
|
|
|
/* Get block number * 2 */
|
|
block = (int) (onenand_block(this, offs) << 1);
|
|
res = (bbm->bbt[block >> 3] >> (block & 0x06)) & 0x03;
|
|
|
|
pr_debug("onenand_isbad_bbt: bbt info for offs 0x%08x: (block %d) 0x%02x\n",
|
|
(unsigned int) offs, block >> 1, res);
|
|
|
|
switch ((int) res) {
|
|
case 0x00: return 0;
|
|
case 0x01: return 1;
|
|
case 0x02: return allowbbt ? 0 : 1;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
/**
|
|
* onenand_scan_bbt - [OneNAND Interface] scan, find, read and maybe create bad block table(s)
|
|
* @param mtd MTD device structure
|
|
* @param bd descriptor for the good/bad block search pattern
|
|
*
|
|
* The function checks, if a bad block table(s) is/are already
|
|
* available. If not it scans the device for manufacturer
|
|
* marked good / bad blocks and writes the bad block table(s) to
|
|
* the selected place.
|
|
*
|
|
* The bad block table memory is allocated here. It is freed
|
|
* by the onenand_release function.
|
|
*
|
|
*/
|
|
static int onenand_scan_bbt(struct mtd_info *mtd, struct nand_bbt_descr *bd)
|
|
{
|
|
struct onenand_chip *this = mtd->priv;
|
|
struct bbm_info *bbm = this->bbm;
|
|
int len, ret = 0;
|
|
|
|
len = this->chipsize >> (this->erase_shift + 2);
|
|
/* Allocate memory (2bit per block) and clear the memory bad block table */
|
|
bbm->bbt = kzalloc(len, GFP_KERNEL);
|
|
if (!bbm->bbt)
|
|
return -ENOMEM;
|
|
|
|
/* Set the bad block position */
|
|
bbm->badblockpos = ONENAND_BADBLOCK_POS;
|
|
|
|
/* Set erase shift */
|
|
bbm->bbt_erase_shift = this->erase_shift;
|
|
|
|
if (!bbm->isbad_bbt)
|
|
bbm->isbad_bbt = onenand_isbad_bbt;
|
|
|
|
/* Scan the device to build a memory based bad block table */
|
|
if ((ret = onenand_memory_bbt(mtd, bd))) {
|
|
printk(KERN_ERR "onenand_scan_bbt: Can't scan flash and build the RAM-based BBT\n");
|
|
kfree(bbm->bbt);
|
|
bbm->bbt = NULL;
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* Define some generic bad / good block scan pattern which are used
|
|
* while scanning a device for factory marked good / bad blocks.
|
|
*/
|
|
static uint8_t scan_ff_pattern[] = { 0xff, 0xff };
|
|
|
|
static struct nand_bbt_descr largepage_memorybased = {
|
|
.options = 0,
|
|
.offs = 0,
|
|
.len = 2,
|
|
.pattern = scan_ff_pattern,
|
|
};
|
|
|
|
/**
|
|
* onenand_default_bbt - [OneNAND Interface] Select a default bad block table for the device
|
|
* @param mtd MTD device structure
|
|
*
|
|
* This function selects the default bad block table
|
|
* support for the device and calls the onenand_scan_bbt function
|
|
*/
|
|
int onenand_default_bbt(struct mtd_info *mtd)
|
|
{
|
|
struct onenand_chip *this = mtd->priv;
|
|
struct bbm_info *bbm;
|
|
|
|
this->bbm = kzalloc(sizeof(struct bbm_info), GFP_KERNEL);
|
|
if (!this->bbm)
|
|
return -ENOMEM;
|
|
|
|
bbm = this->bbm;
|
|
|
|
/* 1KB page has same configuration as 2KB page */
|
|
if (!bbm->badblock_pattern)
|
|
bbm->badblock_pattern = &largepage_memorybased;
|
|
|
|
return onenand_scan_bbt(mtd, bbm->badblock_pattern);
|
|
}
|