mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-21 18:11:39 +00: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>
245 lines
7.2 KiB
C
245 lines
7.2 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* File: mca_asm.h
|
|
* Purpose: Machine check handling specific defines
|
|
*
|
|
* Copyright (C) 1999 Silicon Graphics, Inc.
|
|
* Copyright (C) Vijay Chander <vijay@engr.sgi.com>
|
|
* Copyright (C) Srinivasa Thirumalachar <sprasad@engr.sgi.com>
|
|
* Copyright (C) 2000 Hewlett-Packard Co.
|
|
* Copyright (C) 2000 David Mosberger-Tang <davidm@hpl.hp.com>
|
|
* Copyright (C) 2002 Intel Corp.
|
|
* Copyright (C) 2002 Jenna Hall <jenna.s.hall@intel.com>
|
|
* Copyright (C) 2005 Silicon Graphics, Inc
|
|
* Copyright (C) 2005 Keith Owens <kaos@sgi.com>
|
|
*/
|
|
#ifndef _ASM_IA64_MCA_ASM_H
|
|
#define _ASM_IA64_MCA_ASM_H
|
|
|
|
#include <asm/percpu.h>
|
|
|
|
#define PSR_IC 13
|
|
#define PSR_I 14
|
|
#define PSR_DT 17
|
|
#define PSR_RT 27
|
|
#define PSR_MC 35
|
|
#define PSR_IT 36
|
|
#define PSR_BN 44
|
|
|
|
/*
|
|
* This macro converts a instruction virtual address to a physical address
|
|
* Right now for simulation purposes the virtual addresses are
|
|
* direct mapped to physical addresses.
|
|
* 1. Lop off bits 61 thru 63 in the virtual address
|
|
*/
|
|
#define INST_VA_TO_PA(addr) \
|
|
dep addr = 0, addr, 61, 3
|
|
/*
|
|
* This macro converts a data virtual address to a physical address
|
|
* Right now for simulation purposes the virtual addresses are
|
|
* direct mapped to physical addresses.
|
|
* 1. Lop off bits 61 thru 63 in the virtual address
|
|
*/
|
|
#define DATA_VA_TO_PA(addr) \
|
|
tpa addr = addr
|
|
/*
|
|
* This macro converts a data physical address to a virtual address
|
|
* Right now for simulation purposes the virtual addresses are
|
|
* direct mapped to physical addresses.
|
|
* 1. Put 0x7 in bits 61 thru 63.
|
|
*/
|
|
#define DATA_PA_TO_VA(addr,temp) \
|
|
mov temp = 0x7 ;; \
|
|
dep addr = temp, addr, 61, 3
|
|
|
|
#define GET_THIS_PADDR(reg, var) \
|
|
mov reg = IA64_KR(PER_CPU_DATA);; \
|
|
addl reg = THIS_CPU(var), reg
|
|
|
|
/*
|
|
* This macro jumps to the instruction at the given virtual address
|
|
* and starts execution in physical mode with all the address
|
|
* translations turned off.
|
|
* 1. Save the current psr
|
|
* 2. Make sure that all the upper 32 bits are off
|
|
*
|
|
* 3. Clear the interrupt enable and interrupt state collection bits
|
|
* in the psr before updating the ipsr and iip.
|
|
*
|
|
* 4. Turn off the instruction, data and rse translation bits of the psr
|
|
* and store the new value into ipsr
|
|
* Also make sure that the interrupts are disabled.
|
|
* Ensure that we are in little endian mode.
|
|
* [psr.{rt, it, dt, i, be} = 0]
|
|
*
|
|
* 5. Get the physical address corresponding to the virtual address
|
|
* of the next instruction bundle and put it in iip.
|
|
* (Using magic numbers 24 and 40 in the deposint instruction since
|
|
* the IA64_SDK code directly maps to lower 24bits as physical address
|
|
* from a virtual address).
|
|
*
|
|
* 6. Do an rfi to move the values from ipsr to psr and iip to ip.
|
|
*/
|
|
#define PHYSICAL_MODE_ENTER(temp1, temp2, start_addr, old_psr) \
|
|
mov old_psr = psr; \
|
|
;; \
|
|
dep old_psr = 0, old_psr, 32, 32; \
|
|
\
|
|
mov ar.rsc = 0 ; \
|
|
;; \
|
|
srlz.d; \
|
|
mov temp2 = ar.bspstore; \
|
|
;; \
|
|
DATA_VA_TO_PA(temp2); \
|
|
;; \
|
|
mov temp1 = ar.rnat; \
|
|
;; \
|
|
mov ar.bspstore = temp2; \
|
|
;; \
|
|
mov ar.rnat = temp1; \
|
|
mov temp1 = psr; \
|
|
mov temp2 = psr; \
|
|
;; \
|
|
\
|
|
dep temp2 = 0, temp2, PSR_IC, 2; \
|
|
;; \
|
|
mov psr.l = temp2; \
|
|
;; \
|
|
srlz.d; \
|
|
dep temp1 = 0, temp1, 32, 32; \
|
|
;; \
|
|
dep temp1 = 0, temp1, PSR_IT, 1; \
|
|
;; \
|
|
dep temp1 = 0, temp1, PSR_DT, 1; \
|
|
;; \
|
|
dep temp1 = 0, temp1, PSR_RT, 1; \
|
|
;; \
|
|
dep temp1 = 0, temp1, PSR_I, 1; \
|
|
;; \
|
|
dep temp1 = 0, temp1, PSR_IC, 1; \
|
|
;; \
|
|
dep temp1 = -1, temp1, PSR_MC, 1; \
|
|
;; \
|
|
mov cr.ipsr = temp1; \
|
|
;; \
|
|
LOAD_PHYSICAL(p0, temp2, start_addr); \
|
|
;; \
|
|
mov cr.iip = temp2; \
|
|
mov cr.ifs = r0; \
|
|
DATA_VA_TO_PA(sp); \
|
|
DATA_VA_TO_PA(gp); \
|
|
;; \
|
|
srlz.i; \
|
|
;; \
|
|
nop 1; \
|
|
nop 2; \
|
|
nop 1; \
|
|
nop 2; \
|
|
rfi; \
|
|
;;
|
|
|
|
/*
|
|
* This macro jumps to the instruction at the given virtual address
|
|
* and starts execution in virtual mode with all the address
|
|
* translations turned on.
|
|
* 1. Get the old saved psr
|
|
*
|
|
* 2. Clear the interrupt state collection bit in the current psr.
|
|
*
|
|
* 3. Set the instruction translation bit back in the old psr
|
|
* Note we have to do this since we are right now saving only the
|
|
* lower 32-bits of old psr.(Also the old psr has the data and
|
|
* rse translation bits on)
|
|
*
|
|
* 4. Set ipsr to this old_psr with "it" bit set and "bn" = 1.
|
|
*
|
|
* 5. Reset the current thread pointer (r13).
|
|
*
|
|
* 6. Set iip to the virtual address of the next instruction bundle.
|
|
*
|
|
* 7. Do an rfi to move ipsr to psr and iip to ip.
|
|
*/
|
|
|
|
#define VIRTUAL_MODE_ENTER(temp1, temp2, start_addr, old_psr) \
|
|
mov temp2 = psr; \
|
|
;; \
|
|
mov old_psr = temp2; \
|
|
;; \
|
|
dep temp2 = 0, temp2, PSR_IC, 2; \
|
|
;; \
|
|
mov psr.l = temp2; \
|
|
mov ar.rsc = 0; \
|
|
;; \
|
|
srlz.d; \
|
|
mov r13 = ar.k6; \
|
|
mov temp2 = ar.bspstore; \
|
|
;; \
|
|
DATA_PA_TO_VA(temp2,temp1); \
|
|
;; \
|
|
mov temp1 = ar.rnat; \
|
|
;; \
|
|
mov ar.bspstore = temp2; \
|
|
;; \
|
|
mov ar.rnat = temp1; \
|
|
;; \
|
|
mov temp1 = old_psr; \
|
|
;; \
|
|
mov temp2 = 1; \
|
|
;; \
|
|
dep temp1 = temp2, temp1, PSR_IC, 1; \
|
|
;; \
|
|
dep temp1 = temp2, temp1, PSR_IT, 1; \
|
|
;; \
|
|
dep temp1 = temp2, temp1, PSR_DT, 1; \
|
|
;; \
|
|
dep temp1 = temp2, temp1, PSR_RT, 1; \
|
|
;; \
|
|
dep temp1 = temp2, temp1, PSR_BN, 1; \
|
|
;; \
|
|
\
|
|
mov cr.ipsr = temp1; \
|
|
movl temp2 = start_addr; \
|
|
;; \
|
|
mov cr.iip = temp2; \
|
|
movl gp = __gp \
|
|
;; \
|
|
DATA_PA_TO_VA(sp, temp1); \
|
|
srlz.i; \
|
|
;; \
|
|
nop 1; \
|
|
nop 2; \
|
|
nop 1; \
|
|
rfi \
|
|
;;
|
|
|
|
/*
|
|
* The MCA and INIT stacks in struct ia64_mca_cpu look like normal kernel
|
|
* stacks, except that the SAL/OS state and a switch_stack are stored near the
|
|
* top of the MCA/INIT stack. To support concurrent entry to MCA or INIT, as
|
|
* well as MCA over INIT, each event needs its own SAL/OS state. All entries
|
|
* are 16 byte aligned.
|
|
*
|
|
* +---------------------------+
|
|
* | pt_regs |
|
|
* +---------------------------+
|
|
* | switch_stack |
|
|
* +---------------------------+
|
|
* | SAL/OS state |
|
|
* +---------------------------+
|
|
* | 16 byte scratch area |
|
|
* +---------------------------+ <-------- SP at start of C MCA handler
|
|
* | ..... |
|
|
* +---------------------------+
|
|
* | RBS for MCA/INIT handler |
|
|
* +---------------------------+
|
|
* | struct task for MCA/INIT |
|
|
* +---------------------------+ <-------- Bottom of MCA/INIT stack
|
|
*/
|
|
|
|
#define ALIGN16(x) ((x)&~15)
|
|
#define MCA_PT_REGS_OFFSET ALIGN16(KERNEL_STACK_SIZE-IA64_PT_REGS_SIZE)
|
|
#define MCA_SWITCH_STACK_OFFSET ALIGN16(MCA_PT_REGS_OFFSET-IA64_SWITCH_STACK_SIZE)
|
|
#define MCA_SOS_OFFSET ALIGN16(MCA_SWITCH_STACK_OFFSET-IA64_SAL_OS_STATE_SIZE)
|
|
#define MCA_SP_OFFSET ALIGN16(MCA_SOS_OFFSET-16)
|
|
|
|
#endif /* _ASM_IA64_MCA_ASM_H */
|