mirror of
https://github.com/torvalds/linux.git
synced 2024-12-22 10:56:40 +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>
284 lines
8.0 KiB
C
284 lines
8.0 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* IBM/3270 Driver
|
|
*
|
|
* Author(s):
|
|
* Original 3270 Code for 2.4 written by Richard Hitt (UTS Global)
|
|
* Rewritten for 2.5 by Martin Schwidefsky <schwidefsky@de.ibm.com>
|
|
* Copyright IBM Corp. 2003, 2009
|
|
*/
|
|
|
|
#include <asm/idals.h>
|
|
#include <asm/ioctl.h>
|
|
|
|
/* ioctls for fullscreen 3270 */
|
|
#define TUBICMD _IO('3', 3) /* set ccw command for fs reads. */
|
|
#define TUBOCMD _IO('3', 4) /* set ccw command for fs writes. */
|
|
#define TUBGETI _IO('3', 7) /* get ccw command for fs reads. */
|
|
#define TUBGETO _IO('3', 8) /* get ccw command for fs writes. */
|
|
#define TUBSETMOD _IO('3',12) /* FIXME: what does it do ?*/
|
|
#define TUBGETMOD _IO('3',13) /* FIXME: what does it do ?*/
|
|
|
|
/* Local Channel Commands */
|
|
#define TC_WRITE 0x01 /* Write */
|
|
#define TC_RDBUF 0x02 /* Read Buffer */
|
|
#define TC_EWRITE 0x05 /* Erase write */
|
|
#define TC_READMOD 0x06 /* Read modified */
|
|
#define TC_EWRITEA 0x0d /* Erase write alternate */
|
|
#define TC_WRITESF 0x11 /* Write structured field */
|
|
|
|
/* Buffer Control Orders */
|
|
#define TO_SF 0x1d /* Start field */
|
|
#define TO_SBA 0x11 /* Set buffer address */
|
|
#define TO_IC 0x13 /* Insert cursor */
|
|
#define TO_PT 0x05 /* Program tab */
|
|
#define TO_RA 0x3c /* Repeat to address */
|
|
#define TO_SFE 0x29 /* Start field extended */
|
|
#define TO_EUA 0x12 /* Erase unprotected to address */
|
|
#define TO_MF 0x2c /* Modify field */
|
|
#define TO_SA 0x28 /* Set attribute */
|
|
|
|
/* Field Attribute Bytes */
|
|
#define TF_INPUT 0x40 /* Visible input */
|
|
#define TF_INPUTN 0x4c /* Invisible input */
|
|
#define TF_INMDT 0xc1 /* Visible, Set-MDT */
|
|
#define TF_LOG 0x60
|
|
|
|
/* Character Attribute Bytes */
|
|
#define TAT_RESET 0x00
|
|
#define TAT_FIELD 0xc0
|
|
#define TAT_EXTHI 0x41
|
|
#define TAT_COLOR 0x42
|
|
#define TAT_CHARS 0x43
|
|
#define TAT_TRANS 0x46
|
|
|
|
/* Extended-Highlighting Bytes */
|
|
#define TAX_RESET 0x00
|
|
#define TAX_BLINK 0xf1
|
|
#define TAX_REVER 0xf2
|
|
#define TAX_UNDER 0xf4
|
|
|
|
/* Reset value */
|
|
#define TAR_RESET 0x00
|
|
|
|
/* Color values */
|
|
#define TAC_RESET 0x00
|
|
#define TAC_BLUE 0xf1
|
|
#define TAC_RED 0xf2
|
|
#define TAC_PINK 0xf3
|
|
#define TAC_GREEN 0xf4
|
|
#define TAC_TURQ 0xf5
|
|
#define TAC_YELLOW 0xf6
|
|
#define TAC_WHITE 0xf7
|
|
#define TAC_DEFAULT 0x00
|
|
|
|
/* Write Control Characters */
|
|
#define TW_NONE 0x40 /* No particular action */
|
|
#define TW_KR 0xc2 /* Keyboard restore */
|
|
#define TW_PLUSALARM 0x04 /* Add this bit for alarm */
|
|
|
|
#define RAW3270_FIRSTMINOR 1 /* First minor number */
|
|
#define RAW3270_MAXDEVS 255 /* Max number of 3270 devices */
|
|
|
|
/* For TUBGETMOD and TUBSETMOD. Should include. */
|
|
struct raw3270_iocb {
|
|
short model;
|
|
short line_cnt;
|
|
short col_cnt;
|
|
short pf_cnt;
|
|
short re_cnt;
|
|
short map;
|
|
};
|
|
|
|
struct raw3270;
|
|
struct raw3270_view;
|
|
extern struct class *class3270;
|
|
|
|
/* 3270 CCW request */
|
|
struct raw3270_request {
|
|
struct list_head list; /* list head for request queueing. */
|
|
struct raw3270_view *view; /* view of this request */
|
|
struct ccw1 ccw; /* single ccw. */
|
|
void *buffer; /* output buffer. */
|
|
size_t size; /* size of output buffer. */
|
|
int rescnt; /* residual count from devstat. */
|
|
int rc; /* return code for this request. */
|
|
|
|
/* Callback for delivering final status. */
|
|
void (*callback)(struct raw3270_request *, void *);
|
|
void *callback_data;
|
|
};
|
|
|
|
struct raw3270_request *raw3270_request_alloc(size_t size);
|
|
struct raw3270_request *raw3270_request_alloc_bootmem(size_t size);
|
|
void raw3270_request_free(struct raw3270_request *);
|
|
void raw3270_request_reset(struct raw3270_request *);
|
|
void raw3270_request_set_cmd(struct raw3270_request *, u8 cmd);
|
|
int raw3270_request_add_data(struct raw3270_request *, void *, size_t);
|
|
void raw3270_request_set_data(struct raw3270_request *, void *, size_t);
|
|
void raw3270_request_set_idal(struct raw3270_request *, struct idal_buffer *);
|
|
|
|
static inline int
|
|
raw3270_request_final(struct raw3270_request *rq)
|
|
{
|
|
return list_empty(&rq->list);
|
|
}
|
|
|
|
void raw3270_buffer_address(struct raw3270 *, char *, unsigned short);
|
|
|
|
/*
|
|
* Functions of a 3270 view.
|
|
*/
|
|
struct raw3270_fn {
|
|
int (*activate)(struct raw3270_view *);
|
|
void (*deactivate)(struct raw3270_view *);
|
|
void (*intv)(struct raw3270_view *,
|
|
struct raw3270_request *, struct irb *);
|
|
void (*release)(struct raw3270_view *);
|
|
void (*free)(struct raw3270_view *);
|
|
void (*resize)(struct raw3270_view *, int, int, int);
|
|
};
|
|
|
|
/*
|
|
* View structure chaining. The raw3270_view structure is meant to
|
|
* be embedded at the start of the real view data structure, e.g.:
|
|
* struct example {
|
|
* struct raw3270_view view;
|
|
* ...
|
|
* };
|
|
*/
|
|
struct raw3270_view {
|
|
struct list_head list;
|
|
spinlock_t lock;
|
|
atomic_t ref_count;
|
|
struct raw3270 *dev;
|
|
struct raw3270_fn *fn;
|
|
unsigned int model;
|
|
unsigned int rows, cols; /* # of rows & colums of the view */
|
|
unsigned char *ascebc; /* ascii -> ebcdic table */
|
|
};
|
|
|
|
int raw3270_add_view(struct raw3270_view *, struct raw3270_fn *, int);
|
|
int raw3270_activate_view(struct raw3270_view *);
|
|
void raw3270_del_view(struct raw3270_view *);
|
|
void raw3270_deactivate_view(struct raw3270_view *);
|
|
struct raw3270_view *raw3270_find_view(struct raw3270_fn *, int);
|
|
int raw3270_start(struct raw3270_view *, struct raw3270_request *);
|
|
int raw3270_start_locked(struct raw3270_view *, struct raw3270_request *);
|
|
int raw3270_start_irq(struct raw3270_view *, struct raw3270_request *);
|
|
int raw3270_reset(struct raw3270_view *);
|
|
struct raw3270_view *raw3270_view(struct raw3270_view *);
|
|
int raw3270_view_active(struct raw3270_view *);
|
|
|
|
/* Reference count inliner for view structures. */
|
|
static inline void
|
|
raw3270_get_view(struct raw3270_view *view)
|
|
{
|
|
atomic_inc(&view->ref_count);
|
|
}
|
|
|
|
extern wait_queue_head_t raw3270_wait_queue;
|
|
|
|
static inline void
|
|
raw3270_put_view(struct raw3270_view *view)
|
|
{
|
|
if (atomic_dec_return(&view->ref_count) == 0)
|
|
wake_up(&raw3270_wait_queue);
|
|
}
|
|
|
|
struct raw3270 *raw3270_setup_console(void);
|
|
void raw3270_wait_cons_dev(struct raw3270 *);
|
|
|
|
/* Notifier for device addition/removal */
|
|
struct raw3270_notifier {
|
|
struct list_head list;
|
|
void (*create)(int minor);
|
|
void (*destroy)(int minor);
|
|
};
|
|
|
|
int raw3270_register_notifier(struct raw3270_notifier *);
|
|
void raw3270_unregister_notifier(struct raw3270_notifier *);
|
|
void raw3270_pm_unfreeze(struct raw3270_view *);
|
|
|
|
/*
|
|
* Little memory allocator for string objects.
|
|
*/
|
|
struct string
|
|
{
|
|
struct list_head list;
|
|
struct list_head update;
|
|
unsigned long size;
|
|
unsigned long len;
|
|
char string[0];
|
|
} __attribute__ ((aligned(8)));
|
|
|
|
static inline struct string *
|
|
alloc_string(struct list_head *free_list, unsigned long len)
|
|
{
|
|
struct string *cs, *tmp;
|
|
unsigned long size;
|
|
|
|
size = (len + 7L) & -8L;
|
|
list_for_each_entry(cs, free_list, list) {
|
|
if (cs->size < size)
|
|
continue;
|
|
if (cs->size > size + sizeof(struct string)) {
|
|
char *endaddr = (char *) (cs + 1) + cs->size;
|
|
tmp = (struct string *) (endaddr - size) - 1;
|
|
tmp->size = size;
|
|
cs->size -= size + sizeof(struct string);
|
|
cs = tmp;
|
|
} else
|
|
list_del(&cs->list);
|
|
cs->len = len;
|
|
INIT_LIST_HEAD(&cs->list);
|
|
INIT_LIST_HEAD(&cs->update);
|
|
return cs;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static inline unsigned long
|
|
free_string(struct list_head *free_list, struct string *cs)
|
|
{
|
|
struct string *tmp;
|
|
struct list_head *p, *left;
|
|
|
|
/* Find out the left neighbour in free memory list. */
|
|
left = free_list;
|
|
list_for_each(p, free_list) {
|
|
if (list_entry(p, struct string, list) > cs)
|
|
break;
|
|
left = p;
|
|
}
|
|
/* Try to merge with right neighbour = next element from left. */
|
|
if (left->next != free_list) {
|
|
tmp = list_entry(left->next, struct string, list);
|
|
if ((char *) (cs + 1) + cs->size == (char *) tmp) {
|
|
list_del(&tmp->list);
|
|
cs->size += tmp->size + sizeof(struct string);
|
|
}
|
|
}
|
|
/* Try to merge with left neighbour. */
|
|
if (left != free_list) {
|
|
tmp = list_entry(left, struct string, list);
|
|
if ((char *) (tmp + 1) + tmp->size == (char *) cs) {
|
|
tmp->size += cs->size + sizeof(struct string);
|
|
return tmp->size;
|
|
}
|
|
}
|
|
__list_add(&cs->list, left, left->next);
|
|
return cs->size;
|
|
}
|
|
|
|
static inline void
|
|
add_string_memory(struct list_head *free_list, void *mem, unsigned long size)
|
|
{
|
|
struct string *cs;
|
|
|
|
cs = (struct string *) mem;
|
|
cs->size = size - sizeof(struct string);
|
|
free_string(free_list, cs);
|
|
}
|
|
|